From 41bbc30b9498390e8615c424d94aac96a3c99ffb Mon Sep 17 00:00:00 2001
From: camperbot <camperbot@users.noreply.github.com>
Date: Tue, 18 Oct 2022 08:29:49 +0100
Subject: [PATCH] chore(i18n,learn): processed translations (#48105)

---
 .../build-a-survey-form.md                    |  12 +-
 .../falsy-bouncer.md                          |  10 +-
 ...-one-decimal-by-another-with-javascript.md |   6 -
 .../escape-sequences-in-strings.md            |  12 +-
 ...-variables-with-the-assignment-operator.md |   6 -
 .../quoting-strings-with-single-quotes.md     |   6 -
 .../basic-javascript/stand-in-line.md         |   4 +-
 .../use-recursion-to-create-a-countdown.md    |   7 +
 ...-recursion-to-create-a-range-of-numbers.md |   7 +
 ...syntax-to-define-a-constructor-function.md |  31 ++-
 ...-concise-declarative-functions-with-es6.md |   3 +-
 ...f-an-array-using-concat-instead-of-push.md |  10 +-
 .../make-a-person.md                          |   8 -
 .../steamroller.md                            |   7 +
 .../sum-all-primes.md                         |  56 +++--
 .../add-methods-after-inheritance.md          |  48 +++-
 .../build-a-25-5-clock.md                     |   2 +-
 .../build-a-drum-machine.md                   |   2 +-
 .../build-a-javascript-calculator.md          |   2 +-
 .../build-a-markdown-previewer.md             |   2 +-
 .../build-a-random-quote-machine.md           |   2 +-
 .../visualize-data-with-a-bar-chart.md        |   6 +-
 .../visualize-data-with-a-choropleth-map.md   |   6 +-
 .../visualize-data-with-a-heat-map.md         |   6 +-
 ...visualize-data-with-a-scatterplot-graph.md |   6 +-
 .../visualize-data-with-a-treemap-diagram.md  |   6 +-
 .../mongodb-and-mongoose/create-a-model.md    |   6 +-
 .../authentication-strategies.md              |   6 +-
 .../authentication-with-socket.io.md          |   4 +-
 .../clean-up-your-project-with-modules.md     |   2 +-
 .../communicate-by-emitting.md                |   2 +-
 .../create-new-middleware.md                  |   2 +-
 .../handle-a-disconnect.md                    |   2 +-
 .../hashing-your-passwords.md                 |   4 +-
 .../how-to-put-a-profile-together.md          |   2 +-
 .../how-to-use-passport-strategies.md         |   2 +-
 ...nt-the-serialization-of-a-passport-user.md |   4 +-
 ...lementation-of-social-authentication-ii.md |  18 +-
 ...ementation-of-social-authentication-iii.md |   2 +-
 ...implementation-of-social-authentication.md |   4 +-
 .../logging-a-user-out.md                     |   4 +-
 .../registration-of-new-users.md              |   2 +-
 .../send-and-display-chat-messages.md         |   2 +-
 .../serialization-of-a-user-object.md         |   4 +-
 .../set-up-a-template-engine.md               |  14 +-
 .../set-up-passport.md                        |  22 +-
 .../set-up-the-environment.md                 |   6 +-
 .../use-a-template-engines-powers.md          |  36 ++-
 ...ality-with-.deepequal-and-.notdeepequal.md |   2 +-
 .../compare-the-properties-of-two-elements.md |  14 +-
 .../learn-how-javascript-assertions-work.md   |   4 +-
 ...sponse-using-chai-http-iii---put-method.md |   2 +-
 ...esponse-using-chai-http-iv---put-method.md |   2 +-
 ...sts-on-api-endpoints-using-chai-http-ii.md |   2 +-
 ...-tests-on-api-endpoints-using-chai-http.md |   2 +-
 ...ional-tests-using-a-headless-browser-ii.md |   4 +-
 ...nctional-tests-using-a-headless-browser.md |   2 +-
 ...mulate-actions-using-a-headless-browser.md |   2 +-
 .../test-for-truthiness.md                    |   2 +-
 .../test-if-a-string-contains-a-substring.md  |   2 +-
 ...f-a-value-falls-within-a-specific-range.md |   2 +-
 .../test-if-a-value-is-a-string.md            |   2 +-
 ...ue-is-of-a-specific-data-structure-type.md |   2 +-
 ...st-if-a-variable-or-function-is-defined.md |   2 +-
 .../test-if-an-array-contains-an-item.md      |   2 +-
 .../test-if-an-object-has-a-property.md       |   2 +-
 ...-object-is-an-instance-of-a-constructor.md |   2 +-
 ...s-below-or-at-least-as-large-as-another.md |   2 +-
 .../use-assert.isok-and-assert.isnotok.md     |   4 +-
 ...se-regular-expressions-to-test-a-string.md |   2 +-
 ...se-the-double-equals-to-assert-equality.md |   2 +-
 ...triple-equals-to-assert-strict-equality.md |   2 +-
 .../american-british-translator.md            |   6 +-
 .../issue-tracker.md                          |   6 +-
 .../metric-imperial-converter.md              |   6 +-
 .../personal-library.md                       |   6 +-
 .../sudoku-solver.md                          |  30 +--
 .../build-your-own-functions.md               |   2 +-
 .../comparing-and-sorting-tuples.md           |   2 +-
 .../data-visualization-mailing-lists.md       |  14 +-
 .../dictionaries-and-loops.md                 |   2 +-
 .../files-as-a-sequence.md                    |   2 +-
 .../intermediate-expressions.md               |   4 +-
 .../intermediate-strings.md                   |   2 +-
 .../introduction-why-program.md               |   4 +-
 .../iterations-more-patterns.md               |   2 +-
 .../more-conditional-structures.md            |   4 +-
 .../networking-web-scraping-with-python.md    |   6 +-
 .../relational-databases-and-sqlite.md        |  14 +-
 ...al-databases-many-to-many-relationships.md |  10 +-
 .../python-for-everybody/strings-and-lists.md |   2 +-
 ...services-api-rate-limiting-and-security.md |   8 +-
 .../arithmetic-formatter.md                   |   4 +-
 .../budget-app.md                             |   2 +-
 .../polygon-area-calculator.md                |   2 +-
 .../probability-calculator.md                 |   4 +-
 .../time-calculator.md                        |   2 +-
 .../introduction-to-data-analysis.md          |   9 +-
 .../demographic-data-analyzer.md              |   9 +-
 ...-variance-standard-deviation-calculator.md |   7 +-
 .../medical-data-visualizer.md                |  35 +--
 .../page-view-time-series-visualizer.md       |  15 +-
 .../sea-level-predictor.md                    |  14 +-
 .../anonymous-message-board.md                |   6 +-
 .../port-scanner.md                           |   8 +-
 .../secure-real-time-multiplayer-game.md      |  55 +++--
 .../sha-1-password-cracker.md                 |  10 +-
 .../stock-price-checker.md                    |   8 +-
 ...ur-site-via-https-only-with-helmet.hsts.md |   2 +-
 ...-response-mime-type-with-helmet.nosniff.md |   2 +-
 ...lmet-using-the-parent-helmet-middleware.md |   2 +-
 ...client-side-caching-with-helmet.nocache.md |   2 +-
 ...fetching-with-helmet.dnsprefetchcontrol.md |   2 +-
 ...sh-and-compare-passwords-asynchronously.md |   2 +-
 ...ash-and-compare-passwords-synchronously.md |   2 +-
 ...-information-using-helmet.hidepoweredby.md |   2 +-
 .../install-and-require-helmet.md             |   6 +-
 ...-of-clickjacking-with-helmet.frameguard.md |   2 +-
 ...pting-xss-attacks-with-helmet.xssfilter.md |   2 +-
 ...ing-untrusted-html-with-helmet.ienoopen.md |   2 +-
 ...olicy-with-helmet.contentsecuritypolicy.md |   2 +-
 .../understand-bcrypt-hashes.md               |  10 +-
 .../find-the-symmetric-difference.md          |   4 +-
 ...d-a-new-element-to-a-binary-search-tree.md |   2 +-
 ...ts-at-a-specific-index-in-a-linked-list.md |   6 +-
 .../data-structures/adjacency-list.md         |   2 +-
 .../check-if-binary-search-tree.md            |  20 +-
 .../create-a-circular-queue.md                |   2 +-
 .../create-a-doubly-linked-list.md            |  10 +-
 .../data-structures/create-a-hash-table.md    |  14 +-
 .../create-a-linked-list-class.md             |   3 +-
 .../create-a-map-data-structure.md            |  16 +-
 .../create-a-trie-search-tree.md              |  12 +-
 .../create-an-es6-javascript-map.md           |  18 +-
 ...ete-a-leaf-node-in-a-binary-search-tree.md |  21 ++
 ...-with-one-child-in-a-binary-search-tree.md |  13 +-
 .../data-structures/depth-first-search.md     |  17 ++
 .../implement-heap-sort-with-a-min-heap.md    |  10 +-
 .../data-structures/incidence-matrix.md       |   2 +-
 .../insert-an-element-into-a-max-heap.md      |  48 ++--
 ...form-a-subset-check-on-two-sets-of-data.md |  18 +-
 .../perform-a-union-on-two-sets.md            |   2 +-
 .../remove-an-element-from-a-max-heap.md      |  42 ++--
 ...ve-elements-from-a-linked-list-by-index.md |   2 +-
 .../reverse-a-doubly-linked-list.md           |  10 +-
 .../search-within-a-linked-list.md            |   2 +-
 ...th-first-search-in-a-binary-search-tree.md |   6 +-
 .../problem-1-multiples-of-3-and-5.md         |  18 +-
 .../problem-10-summation-of-primes.md         |  53 +++--
 .../problem-100-arranged-probability.md       |   2 +-
 .../problem-101-optimum-polynomial.md         |   6 +-
 .../problem-102-triangle-containment.md       |   2 +-
 ...problem-103-special-subset-sums-optimum.md |  21 +-
 .../problem-104-pandigital-fibonacci-ends.md  |   2 +-
 ...problem-105-special-subset-sums-testing.md |   4 +-
 ...em-106-special-subset-sums-meta-testing.md |   4 +-
 .../problem-107-minimal-network.md            |   6 +-
 .../problem-108-diophantine-reciprocals-i.md  |   6 +-
 .../project-euler/problem-109-darts.md        |   9 +-
 .../problem-11-largest-product-in-a-grid.md   |   4 +-
 .../problem-110-diophantine-reciprocals-ii.md |   4 +-
 .../problem-111-primes-with-runs.md           |   2 +-
 .../problem-112-bouncy-numbers.md             |   2 +-
 .../problem-113-non-bouncy-numbers.md         |   4 +-
 ...oblem-114-counting-block-combinations-i.md |  10 +-
 .../problem-116-red-green-or-blue-tiles.md    |  14 +-
 .../problem-117-red-green-and-blue-tiles.md   |   8 +-
 .../problem-118-pandigital-prime-sets.md      |   8 +-
 .../problem-119-digit-power-sum.md            |  12 +-
 ...m-12-highly-divisible-triangular-number.md |   6 +-
 .../problem-121-disc-game-prize-fund.md       |  18 +-
 .../problem-122-efficient-exponentiation.md   |  27 ++-
 .../problem-124-ordered-radicals.md           | 140 +++++++++---
 .../problem-125-palindromic-sums.md           |  16 +-
 .../problem-126-cuboid-layers.md              |  22 +-
 .../project-euler/problem-127-abc-hits.md     |  40 ++--
 .../problem-128-hexagonal-tile-differences.md |  78 ++++++-
 .../project-euler/problem-13-large-sum.md     |   4 +-
 .../problem-135-same-differences.md           |  18 +-
 .../problem-136-singleton-difference.md       |  18 +-
 .../problem-139-pythagorean-tiles.md          |  22 +-
 .../problem-14-longest-collatz-sequence.md    |   4 +-
 ...ng-multiple-reflections-of-a-laser-beam.md |  37 ++-
 ...m-147-rectangles-in-cross-hatched-grids.md |  24 +-
 .../project-euler/problem-15-lattice-paths.md |  18 +-
 ...y-for-a-sub-triangle-having-minimum-sum.md |  28 ++-
 ...tandard-sizes-an-expected-value-problem.md |  18 +-
 ...ng-one-half-as-a-sum-of-inverse-squares.md |  18 +-
 ...lem-153-investigating-gaussian-integers.md |  60 +++--
 .../problem-154-exploring-pascals-pyramid.md  |  20 +-
 ...problem-155-counting-capacitor-circuits.md |  22 +-
 .../problem-156-counting-digits.md            |  38 ++-
 ...em-157-solving-the-diophantine-equation.md |  59 +----
 ...hically-after-its-neighbour-to-the-left.md |  16 +-
 ...159-digital-root-sums-of-factorisations.md |  27 ++-
 .../problem-16-power-digit-sum.md             |   2 +-
 .../problem-160-factorial-trailing-digits.md  |  25 +-
 .../project-euler/problem-161-triominoes.md   |  16 +-
 .../problem-162-hexadecimal-numbers.md        |  24 +-
 .../problem-163-cross-hatched-triangles.md    |  23 +-
 ...s-have-a-sum-greater-than-a-given-value.md |  12 +-
 .../problem-165-intersections.md              |  38 ++-
 .../project-euler/problem-166-criss-cross.md  |  18 +-
 ...roblem-167-investigating-ulam-sequences.md |  22 +-
 .../problem-168-number-rotations.md           |  56 ++++-
 ...an-be-expressed-as-a-sum-of-powers-of-2.md |  26 +--
 .../problem-17-number-letter-counts.md        |   6 +-
 ...can-be-formed-by-concatenating-products.md |  15 +-
 ...f-the-squares-of-the-digits-is-a-square.md |  22 +-
 ...gating-numbers-with-few-repeated-digits.md |  12 +-
 ...ent-hollow-square-laminae-can-be-formed.md |  12 +-
 ...one-two-three-...-distinct-arrangements.md |  18 +-
 ...an-be-expressed-as-a-sum-of-powers-of-2.md |  34 ++-
 ...-angled-triangles-that-share-a-cathetus.md |  10 +-
 ...oblem-177-integer-angled-quadrilaterals.md |  20 +-
 .../project-euler/problem-178-step-numbers.md |  12 +-
 ...oblem-179-consecutive-positive-divisors.md |  12 +-
 .../problem-18-maximum-path-sum-i.md          |   2 +-
 ...-zeros-of-a-function-of-three-variables.md |  27 ++-
 ...of-two-different-colours-can-be-grouped.md |  18 +-
 .../problem-182-rsa-encryption.md             |   2 +-
 .../problem-183-maximum-product-of-parts.md   |  28 +--
 ...lem-184-triangles-containing-the-origin.md |  20 +-
 .../project-euler/problem-185-number-mind.md  |  32 ++-
 .../problem-186-connectedness-of-a-network.md |  27 ++-
 .../project-euler/problem-187-semiprimes.md   |  12 +-
 ...188-the-hyperexponentiation-of-a-number.md |  18 +-
 ...lem-189-tri-colouring-a-triangular-grid.md |  14 +-
 .../problem-19-counting-sundays.md            |   2 +-
 ...oblem-190-maximising-a-weighted-product.md |  16 +-
 .../problem-191-prize-strings.md              |  18 +-
 .../problem-192-best-approximations.md        |  20 +-
 .../problem-193-squarefree-numbers.md         |  14 +-
 .../problem-194-coloured-configurations.md    |  22 +-
 ...-triangles-with-one-angle-of-60-degrees.md |  22 +-
 .../problem-196-prime-triplets.md             |  24 +-
 ...viour-of-a-recursively-defined-sequence.md |  18 +-
 .../problem-198-ambiguous-numbers.md          |  18 +-
 .../problem-199-iterative-circle-packing.md   |   8 +-
 .../problem-2-even-fibonacci-numbers.md       |  24 +-
 .../problem-20-factorial-digit-sum.md         |   2 +-
 ...ontaining-the-contiguous-sub-string-200.md |  18 +-
 .../problem-201-subsets-with-a-unique-sum.md  |  32 ++-
 .../project-euler/problem-202-laserbeam.md    |  18 +-
 ...em-203-squarefree-binomial-coefficients.md |  18 +-
 ...problem-204-generalised-hamming-numbers.md |  16 +-
 .../project-euler/problem-205-dice-game.md    |  10 +-
 .../problem-206-concealed-square.md           |  39 +++-
 ...problem-207-integer-partition-equations.md |  30 ++-
 .../project-euler/problem-208-robot-walks.md  |  16 +-
 .../problem-209-circular-logic.md             |  32 ++-
 .../problem-21-amicable-numbers.md            |   2 +-
 .../problem-210-obtuse-angled-triangles.md    |  20 +-
 .../problem-211-divisor-square-sum.md         |  16 +-
 .../problem-212-combined-volume-of-cuboids.md |  31 +--
 .../project-euler/problem-213-flea-circus.md  |  10 +-
 .../problem-214-totient-chains.md             |  26 ++-
 .../problem-215-crack-free-walls.md           |  16 +-
 ...-primality-of-numbers-of-the-form-2n2-1.md |  18 +-
 .../problem-217-balanced-numbers.md           |  18 +-
 ...blem-218-perfect-right-angled-triangles.md |  28 ++-
 .../problem-219-skew-cost-coding.md           |  24 +-
 .../project-euler/problem-22-names-scores.md  |   2 +-
 .../problem-220-heighway-dragon.md            |  29 ++-
 .../problem-221-alexandrian-integers.md       |  21 +-
 .../problem-222-sphere-packing.md             |  12 +-
 ...lem-223-almost-right-angled-triangles-i.md |  14 +-
 ...em-224-almost-right-angled-triangles-ii.md |  16 +-
 .../problem-225-tribonacci-non-divisors.md    |  16 +-
 .../problem-226-a-scoop-of-blancmange.md      |  20 +-
 .../project-euler/problem-227-the-chase.md    |  20 +-
 .../problem-228-minkowski-sums.md             |  33 ++-
 ...-229-four-representations-using-squares.md |  28 ++-
 .../problem-23-non-abundant-sums.md           |   2 +-
 .../problem-230-fibonacci-words.md            |  36 +--
 ...-factorisation-of-binomial-coefficients.md |  18 +-
 .../project-euler/problem-232-the-race.md     |  20 +-
 .../problem-233-lattice-points-on-a-circle.md |  16 +-
 .../problem-234-semidivisible-numbers.md      |  20 +-
 ...em-235-an-arithmetic-geometric-sequence.md |  18 +-
 .../problem-236-luxury-hampers.md             |  35 ++-
 ...blem-237-tours-on-a-4-x-n-playing-board.md |  27 ++-
 .../problem-238-infinite-string-tour.md       |  31 +--
 .../problem-239-twenty-two-foolish-primes.md  |  10 +-
 .../problem-24-lexicographic-permutations.md  |   2 +-
 .../project-euler/problem-240-top-dice.md     |  20 +-
 .../problem-241-perfection-quotients.md       |  18 +-
 .../project-euler/problem-242-odd-triplets.md |  18 +-
 .../project-euler/problem-243-resilience.md   |  22 +-
 .../project-euler/problem-244-sliders.md      |  26 ++-
 .../project-euler/problem-245-coresilience.md |  22 +-
 .../problem-246-tangents-to-an-ellipse.md     |  30 ++-
 .../problem-247-squares-under-a-hyperbola.md  |  30 ++-
 ...which-eulers-totient-function-equals-13.md |  14 +-
 .../problem-249-prime-subset-sums.md          |  16 +-
 .../problem-25-1000-digit-fibonacci-number.md |   4 +-
 .../project-euler/problem-250-250250.md       |  12 +-
 .../problem-251-cardano-triplets.md           |  18 +-
 .../project-euler/problem-252-convex-holes.md |  17 +-
 .../project-euler/problem-253-tidying-up.md   |  43 ++--
 .../problem-254-sums-of-digit-factorials.md   |  22 +-
 .../problem-255-rounded-square-roots.md       |  41 +++-
 .../problem-256-tatami-free-rooms.md          |  24 +-
 .../problem-257-angular-bisectors.md          |  20 +-
 ...problem-258-a-lagged-fibonacci-sequence.md |  17 +-
 .../problem-259-reachable-numbers.md          |  19 +-
 .../problem-26-reciprocal-cycles.md           |   2 +-
 .../project-euler/problem-260-stone-game.md   |  32 ++-
 .../problem-261-pivotal-square-sums.md        |  22 +-
 .../problem-262-mountain-range.md             |  22 +-
 ...roblem-263-an-engineers-dream-come-true.md |  27 ++-
 .../problem-264-triangle-centres.md           |  43 ++--
 .../problem-265-binary-circles.md             |  25 +-
 .../problem-266-pseudo-square-root.md         |  16 +-
 .../project-euler/problem-267-billionaire.md  |  16 +-
 ...ur-distinct-prime-factors-less-than-100.md |  16 +-
 ...ynomials-with-at-least-one-integer-root.md |  28 ++-
 .../problem-27-quadratic-primes.md            |   2 +-
 .../problem-270-cutting-squares.md            |  26 +--
 .../problem-271-modular-cubes-part-1.md       |  16 +-
 .../problem-272-modular-cubes-part-2.md       |  16 +-
 .../problem-273-sum-of-squares.md             |  24 +-
 .../problem-274-divisibility-multipliers.md   |  24 +-
 .../problem-275-balanced-sculptures.md        |  27 +--
 .../problem-276-primitive-triangles.md        |  16 +-
 ...problem-277-a-modified-collatz-sequence.md |  30 +--
 ...m-278-linear-combinations-of-semiprimes.md |  18 +-
 ...th-integral-sides-and-an-integral-angle.md |  12 +-
 .../problem-28-number-spiral-diagonals.md     |   2 +-
 .../problem-280-ant-and-seeds.md              |  10 +-
 .../problem-281-pizza-toppings.md             |  20 +-
 .../problem-282-the-ackermann-function.md     |  19 +-
 ...h-the-area--perimeter-ratio-is-integral.md |  16 +-
 .../problem-284-steady-squares.md             |  24 +-
 .../problem-285-pythagorean-odds.md           |  20 +-
 .../problem-286-scoring-probabilities.md      |  18 +-
 ...encoding-a-simple-compression-algorithm.md |  35 +--
 .../problem-288-an-enormous-factorial.md      |  23 +-
 .../problem-289-eulerian-cycles.md            |  24 +-
 .../problem-29-distinct-powers.md             |   6 +-
 .../problem-290-digital-signature.md          |  12 +-
 .../problem-291-panaitopol-primes.md          |  14 +-
 .../problem-292-pythagorean-polygons.md       |  25 +-
 .../problem-293-pseudo-fortunate-numbers.md   |  22 +-
 ...oblem-294-sum-of-digits---experience-23.md |  21 +-
 .../problem-295-lenticular-holes.md           |  31 +--
 ...roblem-296-angular-bisector-and-tangent.md |  18 +-
 .../problem-297-zeckendorf-representation.md  |  22 +-
 .../problem-298-selective-amnesia.md          |  33 ++-
 .../problem-299-three-similar-triangles.md    |  32 +--
 .../problem-30-digit-n-powers.md              |   2 +-
 .../problem-300-protein-folding.md            |  24 +-
 .../project-euler/problem-301-nim.md          |  33 +--
 .../problem-302-strong-achilles-numbers.md    |  24 +-
 ...problem-303-multiples-with-small-digits.md |  18 +-
 .../project-euler/problem-304-primonacci.md   |  20 +-
 .../problem-305-reflexive-position.md         |  20 +-
 .../problem-306-paper-strip-game.md           |  26 ++-
 .../project-euler/problem-307-chip-defects.md |  16 +-
 ...8-an-amazing-prime-generating-automaton.md |  24 +-
 .../problem-309-integer-ladders.md            |  20 +-
 .../project-euler/problem-31-coin-sums.md     |   2 +-
 .../project-euler/problem-310-nim-square.md   |  16 +-
 ...em-311-biclinic-integral-quadrilaterals.md |  24 +-
 ...em-312-cyclic-paths-on-sierpiski-graphs.md |  27 ++-
 .../project-euler/problem-313-sliding-game.md |  20 +-
 .../problem-314-the-mouse-on-the-moon.md      |  22 +-
 .../problem-315-digital-root-clocks.md        |  36 ++-
 ...oblem-316-numbers-in-decimal-expansions.md |  34 +--
 .../project-euler/problem-317-firecracker.md  |  16 +-
 .../project-euler/problem-318-2011-nines.md   |  46 ++--
 .../problem-319-bounded-sequences.md          |  24 +-
 .../problem-32-pandigital-products.md         |   2 +-
 ...-factorials-divisible-by-a-huge-integer.md |  18 +-
 .../problem-321-swapping-counters.md          |  22 +-
 ...2-binomial-coefficients-divisible-by-10.md |  16 +-
 ...itwise-or-operations-on-random-integers.md |  23 +-
 .../problem-324-building-a-tower.md           |  20 +-
 .../problem-325-stone-game-ii.md              |  18 +-
 .../problem-326-modulo-summations.md          |  24 +-
 .../problem-327-rooms-of-doom.md              |  30 ++-
 .../problem-328-lowest-cost-search.md         |  32 +--
 .../project-euler/problem-329-prime-frog.md   |  22 +-
 .../problem-33-digit-cancelling-fractions.md  |   2 +-
 .../project-euler/problem-331-cross-flips.md  |  22 +-
 .../problem-332-spherical-triangles.md        |  24 +-
 .../problem-333-special-partitions.md         |  29 +--
 .../problem-334-spilling-the-beans.md         |  23 +-
 .../problem-335-gathering-the-beans.md        |  16 +-
 .../problem-336-maximix-arrangements.md       |  32 ++-
 ...problem-337-totient-stairstep-sequences.md |  26 +--
 ...blem-338-cutting-rectangular-grid-paper.md |  24 +-
 .../problem-339-peredur-fab-efrawg.md         |  18 +-
 .../problem-34-digit-factorials.md            |   4 +-
 .../problem-340-crazy-function.md             |  23 +-
 ...em-341-golombs-self-describing-sequence.md |  23 +-
 ...m-342-the-totient-of-a-square-is-a-cube.md |  17 +-
 .../problem-343-fractional-sequences.md       |  31 ++-
 .../problem-344-silver-dollar-game.md         |  18 +-
 .../project-euler/problem-345-matrix-sum.md   |  27 ++-
 .../problem-346-strong-repunits.md            |  16 +-
 ...largest-integer-divisible-by-two-primes.md |  22 +-
 .../problem-348-sum-of-a-square-and-a-cube.md |  18 +-
 .../project-euler/problem-349-langtons-ant.md |  17 +-
 .../problem-35-circular-primes.md             |   4 +-
 ...e-least-greatest-and-the-greatest-least.md |  24 +-
 .../problem-351-hexagonal-orchards.md         |  20 +-
 .../project-euler/problem-352-blood-tests.md  |  38 ++-
 .../project-euler/problem-353-risky-moon.md   |  28 +--
 ...oblem-354-distances-in-a-bees-honeycomb.md |  18 +-
 .../problem-355-maximal-coprime-subset.md     |  16 +-
 ...-356-largest-roots-of-cubic-polynomials.md |  20 +-
 .../problem-357-prime-generating-integers.md  |  16 +-
 .../problem-358-cyclic-numbers.md             |  29 ++-
 .../problem-359-hilberts-new-hotel.md         |  32 ++-
 .../problem-36-double-base-palindromes.md     |   2 +-
 .../project-euler/problem-360-scary-sphere.md |  22 +-
 ...-361-subsequence-of-thue-morse-sequence.md |  31 +--
 .../problem-362-squarefree-factors.md         |  22 +-
 .../project-euler/problem-363-bzier-curves.md |  30 ++-
 .../problem-364-comfortable-distance.md       |  24 +-
 ...problem-365-a-huge-binomial-coefficient.md |  16 +-
 .../problem-366-stone-game-iii.md             |  34 ++-
 .../project-euler/problem-367-bozo-sort.md    |  28 ++-
 .../problem-368-a-kempner-like-series.md      |  19 +-
 .../project-euler/problem-369-badugi.md       |  14 +-
 .../problem-37-truncatable-primes.md          |   2 +-
 .../problem-370-geometric-triangles.md        |  18 +-
 .../problem-371-licence-plates.md             |  16 +-
 .../problem-372-pencils-of-rays.md            |  18 +-
 .../problem-373-circumscribed-circles.md      |  20 +-
 ...m-374-maximum-integer-partition-product.md |  28 +--
 .../problem-375-minimum-of-subsequences.md    |  31 +--
 .../problem-376-nontransitive-sets-of-dice.md |  37 ++-
 ...problem-377-sum-of-digits-experience-13.md |  14 +-
 .../problem-378-triangle-triples.md           |  22 +-
 ...problem-379-least-common-multiple-count.md |  18 +-
 .../problem-38-pandigital-multiples.md        |   6 +-
 .../problem-380-amazing-mazes.md              |  28 ++-
 .../problem-381-prime-k-factorial.md          |  22 +-
 .../problem-382-generating-polygons.md        |  37 ++-
 ...isibility-comparison-between-factorials.md |  20 +-
 .../problem-384-rudin-shapiro-sequence.md     |  39 ++--
 .../problem-385-ellipses-inside-triangles.md  |  30 +--
 ...blem-386-maximum-length-of-an-antichain.md |  24 +-
 .../problem-387-harshad-numbers.md            |  18 +-
 .../problem-388-distinct-lines.md             |  18 +-
 .../problem-389-platonic-dice.md              |  22 +-
 .../problem-39-integer-right-triangles.md     |   2 +-
 ...th-non-rational-sides-and-integral-area.md |  22 +-
 .../project-euler/problem-391-hopping-game.md |  33 +--
 .../problem-392-enmeshed-unit-circle.md       |  28 ++-
 .../problem-393-migrating-ants.md             |  18 +-
 .../project-euler/problem-394-eating-pie.md   |  29 +--
 .../problem-395-pythagorean-tree.md           |  18 +-
 .../problem-396-weak-goodstein-sequence.md    |  32 ++-
 .../problem-397-triangle-on-parabola.md       |  18 +-
 .../project-euler/problem-398-cutting-rope.md |  16 +-
 ...roblem-399-squarefree-fibonacci-numbers.md |  32 +--
 .../problem-4-largest-palindrome-product.md   |  12 +-
 .../problem-40-champernownes-constant.md      |   2 +-
 .../problem-400-fibonacci-tree-game.md        |  28 +--
 .../problem-401-sum-of-squares-of-divisors.md |  20 +-
 .../problem-402-integer-valued-polynomials.md |  25 +-
 ...ce-points-enclosed-by-parabola-and-line.md |  20 +-
 .../problem-404-crisscross-ellipses.md        |  30 ++-
 .../problem-405-a-rectangular-tiling.md       |  24 +-
 .../problem-406-guessing-game.md              |  42 ++--
 .../project-euler/problem-407-idempotents.md  |  18 +-
 ...lem-408-admissible-paths-through-a-grid.md |  18 +-
 .../project-euler/problem-409-nim-extreme.md  |  24 +-
 .../problem-41-pandigital-prime.md            |   2 +-
 .../problem-410-circle-and-tangent-line.md    |  20 +-
 .../project-euler/problem-411-uphill-paths.md |  24 +-
 .../problem-412-gnomon-numbering.md           |  26 ++-
 .../problem-413-one-child-numbers.md          |  20 +-
 .../problem-414-kaprekar-constant.md          |  32 +--
 .../project-euler/problem-415-titanic-sets.md |  18 +-
 .../project-euler/problem-416-a-frogs-trip.md |  18 +-
 .../problem-417-reciprocal-cycles-ii.md       |  23 +-
 .../problem-418-factorisation-triples.md      |  21 +-
 .../problem-419-look-and-say-sequence.md      |  31 ++-
 .../problem-42-coded-triangle-numbers.md      |   2 +-
 ...problem-420-2x2-positive-integer-matrix.md |  27 ++-
 .../problem-421-prime-factors-of-n151.md      |  26 ++-
 ...m-422-sequence-of-points-on-a-hyperbola.md |  28 ++-
 .../problem-423-consecutive-die-throws.md     |  33 ++-
 .../project-euler/problem-424-kakuro.md       |  43 +++-
 .../problem-425-prime-connection.md           |  27 ++-
 .../problem-426-box-ball-system.md            |  27 ++-
 .../project-euler/problem-427-n-sequences.md  |  22 +-
 .../problem-428-necklace-of-circles.md        |  31 +--
 ...-429-sum-of-squares-of-unitary-divisors.md |  20 +-
 .../problem-43-sub-string-divisibility.md     |   2 +-
 .../project-euler/problem-430-range-flips.md  |  22 +-
 .../problem-431-square-space-silo.md          |  20 +-
 .../project-euler/problem-432-totient-sum.md  |  16 +-
 .../problem-433-steps-in-euclids-algorithm.md |  25 +-
 .../project-euler/problem-434-rigid-graphs.md |  30 ++-
 ...em-435-polynomials-of-fibonacci-numbers.md |  18 +-
 .../project-euler/problem-436-unfair-wager.md |  24 +-
 .../problem-437-fibonacci-primitive-roots.md  |  36 ++-
 ...-part-of-polynomial-equations-solutions.md |  25 +-
 .../problem-439-sum-of-sum-of-divisors.md     |  20 +-
 .../problem-44-pentagon-numbers.md            |   2 +-
 .../problem-440-gcd-and-tiling.md             |  31 ++-
 ...he-inverse-summation-of-coprime-couples.md |  22 +-
 .../problem-442-eleven-free-integers.md       |  14 +-
 .../project-euler/problem-443-gcd-sequence.md |  24 +-
 .../problem-444-the-roundtable-lottery.md     |  26 ++-
 .../problem-445-retractions-a.md              |  24 +-
 .../problem-446-retractions-b.md              |  24 +-
 .../problem-447-retractions-c.md              |  24 +-
 ...oblem-448-average-least-common-multiple.md |  24 +-
 .../problem-449-chocolate-covered-candy.md    |  22 +-
 ...-45-triangular-pentagonal-and-hexagonal.md |   2 +-
 ...blem-450-hypocycloid-and-lattice-points.md |  35 +--
 .../problem-451-modular-inverses.md           |  33 ++-
 .../problem-452-long-products.md              |  18 +-
 .../problem-453-lattice-quadrilaterals.md     |  20 +-
 ...problem-454-diophantine-reciprocals-iii.md |  20 +-
 ...problem-455-powers-with-trailing-digits.md |  18 +-
 ...-456-triangles-containing-the-origin-ii.md |  26 ++-
 ...polynomial-modulo-the-square-of-a-prime.md |  20 +-
 .../problem-458-permutations-of-project.md    |  18 +-
 .../problem-459-flipping-game.md              |  32 ++-
 .../problem-46-goldbachs-other-conjecture.md  |   2 +-
 .../problem-460-an-ant-on-the-move.md         |  31 ++-
 .../project-euler/problem-461-almost-pi.md    |   2 +-
 ...lem-462-permutation-of-3-smooth-numbers.md |  28 ++-
 ...problem-463-a-weird-recurrence-relation.md |  24 +-
 ...roblem-464-mbius-function-and-intervals.md |  31 ++-
 .../problem-465-polar-polygons.md             |  20 +-
 ...istinct-terms-in-a-multiplication-table.md |  26 ++-
 .../project-euler/problem-467-superinteger.md |  31 ++-
 ...mooth-divisors-of-binomial-coefficients.md |  30 ++-
 .../project-euler/problem-469-empty-chairs.md |  18 +-
 .../problem-47-distinct-primes-factors.md     |  60 ++---
 .../project-euler/problem-470-super-ramvok.md |  18 +-
 ...oblem-471-triangle-inscribed-in-ellipse.md |  34 ++-
 .../problem-472-comfortable-distance-ii.md    |  30 +--
 .../problem-473-phigital-number-base.md       |  20 +-
 .../problem-474-last-digits-of-divisors.md    |  18 +-
 .../problem-475-music-festival.md             |  20 +-
 .../problem-476-circle-packing-ii.md          |  18 +-
 .../problem-477-number-sequence-game.md       |  46 ++--
 .../project-euler/problem-478-mixtures.md     |  30 ++-
 .../problem-479-roots-on-the-rise.md          |  20 +-
 .../project-euler/problem-48-self-powers.md   |   2 +-
 .../problem-480-the-last-question.md          | 100 +++-----
 .../problem-49-prime-permutations.md          |   2 +-
 .../problem-5-smallest-multiple.md            |  16 +-
 .../problem-50-consecutive-prime-sum.md       |  92 +++++---
 .../problem-51-prime-digit-replacements.md    | 115 +++++-----
 .../problem-52-permuted-multiples.md          |   2 +-
 .../problem-53-combinatoric-selections.md     |   2 +-
 .../project-euler/problem-54-poker-hands.md   |   2 +-
 .../problem-55-lychrel-numbers.md             |   2 +-
 .../problem-56-powerful-digit-sum.md          |   2 +-
 .../problem-57-square-root-convergents.md     |   2 +-
 .../project-euler/problem-58-spiral-primes.md |   2 +-
 .../problem-59-xor-decryption.md              |   2 +-
 .../problem-6-sum-square-difference.md        |   2 +-
 .../problem-60-prime-pair-sets.md             |   4 +-
 .../problem-61-cyclical-figurate-numbers.md   |   8 +-
 .../problem-62-cubic-permutations.md          |   2 +-
 .../problem-63-powerful-digit-counts.md       |   2 +-
 .../problem-64-odd-period-square-roots.md     |   4 +-
 .../problem-65-convergents-of-e.md            |   2 +-
 .../problem-66-diophantine-equation.md        |  10 +-
 .../problem-67-maximum-path-sum-ii.md         |   2 +-
 .../problem-68-magic-5-gon-ring.md            |   2 +-
 .../problem-69-totient-maximum.md             |   2 +-
 .../project-euler/problem-7-10001st-prime.md  |   2 +-
 .../problem-70-totient-permutation.md         |   2 +-
 .../problem-71-ordered-fractions.md           |   2 +-
 .../problem-72-counting-fractions.md          |   2 +-
 ...roblem-73-counting-fractions-in-a-range.md |   2 +-
 .../problem-74-digit-factorial-chains.md      |  12 +-
 ...lem-75-singular-integer-right-triangles.md |   2 +-
 .../problem-76-counting-summations.md         |   6 +-
 .../problem-77-prime-summations.md            |   2 +-
 .../problem-78-coin-partitions.md             |   2 +-
 .../problem-79-passcode-derivation.md         |   2 +-
 .../problem-8-largest-product-in-a-series.md  |   2 +-
 ...roblem-80-square-root-digital-expansion.md |   2 +-
 .../problem-81-path-sum-two-ways.md           |   6 +-
 .../problem-82-path-sum-three-ways.md         |   6 +-
 .../problem-83-path-sum-four-ways.md          |   8 +-
 .../project-euler/problem-84-monopoly-odds.md |   4 +-
 .../problem-85-counting-rectangles.md         |   2 +-
 .../project-euler/problem-86-cuboid-route.md  |   2 +-
 .../problem-87-prime-power-triples.md         |   2 +-
 .../problem-88-product-sum-numbers.md         |   2 +-
 .../problem-89-roman-numerals.md              |   2 +-
 .../problem-9-special-pythagorean-triplet.md  |   4 +-
 .../problem-90-cube-digit-pairs.md            |   2 +-
 ...ight-triangles-with-integer-coordinates.md |   2 +-
 .../problem-93-arithmetic-expressions.md      |   8 +-
 ...problem-94-almost-equilateral-triangles.md |  18 +-
 .../problem-97-large-non-mersenne-prime.md    |   2 +-
 .../problem-98-anagramic-squares.md           |   2 +-
 .../problem-99-largest-exponential.md         |   2 +-
 .../rosetta-code/24-game.md                   | 141 ++++++++----
 .../9-billion-names-of-god-the-integer.md     |   6 +-
 .../rosetta-code/abc-problem.md               |   2 +-
 ...ient-and-perfect-number-classifications.md |   2 +-
 .../rosetta-code/accumulator-factory.md       |   4 +-
 .../rosetta-code/ackermann-function.md        |   2 +-
 .../rosetta-code/align-columns.md             |  14 +-
 .../rosetta-code/amicable-pairs.md            |  12 +-
 .../rosetta-code/averages-mode.md             |   4 +-
 .../averages-pythagorean-means.md             |   4 +-
 .../rosetta-code/averages-root-mean-square.md |   8 +-
 .../rosetta-code/babbage-problem.md           |   6 +-
 .../rosetta-code/balanced-brackets.md         |  44 ++--
 ...cles-of-given-radius-through-two-points.md |   2 +-
 .../rosetta-code/closest-pair-problem.md      |   2 +-
 .../rosetta-code/combinations.md              |   4 +-
 .../rosetta-code/comma-quibbling.md           |  14 +-
 .../rosetta-code/compare-a-list-of-strings.md |  10 +-
 .../convert-seconds-to-compound-duration.md   |   2 +-
 .../count-occurrences-of-a-substring.md       |   2 +-
 .../rosetta-code/count-the-coins.md           |  34 +--
 .../rosetta-code/cramers-rule.md              |  12 +-
 .../cumulative-standard-deviation.md          |  29 ++-
 .../rosetta-code/cusip.md                     |   2 +-
 .../rosetta-code/cut-a-rectangle.md           |   2 +-
 .../rosetta-code/date-manipulation.md         |   4 +-
 .../rosetta-code/day-of-the-week.md           |   2 +-
 .../rosetta-code/deal-cards-for-freecell.md   |  10 +-
 .../rosetta-code/deepcopy.md                  |   2 +-
 .../define-a-primitive-data-type.md           |   2 +-
 .../rosetta-code/department-numbers.md        |   4 +-
 .../rosetta-code/discordian-date.md           |  21 +-
 .../rosetta-code/dot-product.md               |   4 +-
 .../rosetta-code/element-wise-operations.md   |   2 +-
 .../rosetta-code/emirp-primes.md              |   2 +-
 .../rosetta-code/entropy.md                   |   2 +-
 .../rosetta-code/equilibrium-index.md         |   4 +-
 .../rosetta-code/ethiopian-multiplication.md  |   2 +-
 .../rosetta-code/euler-method.md              |   4 +-
 .../evaluate-binomial-coefficients.md         |   2 +-
 .../execute-a-markov-algorithm.md             | 212 ++++++-----------
 .../rosetta-code/execute-brain.md             |  24 +-
 .../extensible-prime-generator.md             |   4 +-
 .../rosetta-code/factorial.md                 |   4 +-
 .../factors-of-a-mersenne-number.md           |  10 +-
 .../rosetta-code/factors-of-an-integer.md     |   2 +-
 .../rosetta-code/farey-sequence.md            |   4 +-
 .../fibonacci-n-step-number-sequences.md      |   8 +-
 .../rosetta-code/fibonacci-sequence.md        |   2 +-
 .../rosetta-code/fibonacci-word.md            | 114 +++++----
 .../rosetta-code/fizzbuzz.md                  |   2 +-
 .../rosetta-code/fractran.md                  |   4 +-
 .../rosetta-code/gamma-function.md            |   4 +-
 .../rosetta-code/gaussian-elimination.md      |   2 +-
 .../rosetta-code/general-fizzbuzz.md          |   4 +-
 .../generate-lower-case-ascii-alphabet.md     |   2 +-
 .../rosetta-code/generator-exponential.md     |   2 +-
 .../rosetta-code/gray-code.md                 |   8 +-
 .../rosetta-code/greatest-common-divisor.md   |   2 +-
 .../greatest-subsequential-sum.md             |   2 +-
 .../rosetta-code/hailstone-sequence.md        |   6 +-
 .../rosetta-code/happy-numbers.md             |   4 +-
 .../rosetta-code/harshad-or-niven-series.md   |   2 +-
 .../rosetta-code/hash-from-two-arrays.md      |  16 +-
 .../rosetta-code/hash-join.md                 |  12 +-
 .../rosetta-code/heronian-triangles.md        |   4 +-
 .../hofstadter-figure-figure-sequences.md     |  26 +--
 .../rosetta-code/hofstadter-q-sequence.md     |   6 +-
 .../rosetta-code/i-before-e-except-after-c.md |  24 +-
 .../rosetta-code/iban.md                      |  14 +-
 .../rosetta-code/identity-matrix.md           |   2 +-
 .../rosetta-code/iterated-digits-squaring.md  |   2 +-
 .../rosetta-code/jaro-distance.md             |   4 +-
 .../rosetta-code/jortsort.md                  |   4 +-
 .../rosetta-code/josephus-problem.md          |   6 +-
 .../rosetta-code/k-d-tree.md                  |   2 +-
 .../rosetta-code/kaprekar-numbers.md          |  10 +-
 .../rosetta-code/knapsack-problem-0-1.md      |   2 +-
 .../rosetta-code/knapsack-problem-bounded.md  |   2 +-
 .../knapsack-problem-continuous.md            |   2 +-
 .../knapsack-problem-unbounded.md             |   2 +-
 .../rosetta-code/knights-tour.md              |  16 +-
 .../largest-int-from-concatenated-ints.md     |   2 +-
 .../rosetta-code/last-friday-of-each-month.md |   2 +-
 .../rosetta-code/last-letter-first-letter.md  |   2 +-
 .../rosetta-code/leap-year.md                 |   2 +-
 .../rosetta-code/least-common-multiple.md     |   6 +-
 .../rosetta-code/left-factorials.md           |   2 +-
 .../rosetta-code/letter-frequency.md          |   2 +-
 .../rosetta-code/levenshtein-distance.md      |   6 +-
 .../linear-congruential-generator.md          |   6 +-
 .../rosetta-code/long-multiplication.md       |   4 +-
 .../longest-common-subsequence.md             |  22 +-
 .../longest-increasing-subsequence.md         |   8 +-
 .../rosetta-code/longest-string-challenge.md  |   4 +-
 .../rosetta-code/look-and-say-sequence.md     |   4 +-
 ...oop-over-multiple-arrays-simultaneously.md |   2 +-
 .../rosetta-code/lu-decomposition.md          |   6 +-
 .../rosetta-code/lucas-lehmer-test.md         |   2 +-
 .../rosetta-code/ludic-numbers.md             |  26 +--
 .../luhn-test-of-credit-card-numbers.md       |   6 +-
 .../rosetta-code/lychrel-numbers.md           |   4 +-
 .../rosetta-code/lzw-compression.md           |   4 +-
 .../rosetta-code/s-expressions.md             |  16 +-
 .../sailors-coconuts-and-a-monkey-problem.md  |  17 +-
 .../rosetta-code/search-a-list-of-records.md  |   2 +-
 .../rosetta-code/sedols.md                    |  13 +-
 .../rosetta-code/self-describing-numbers.md   |   6 +-
 .../rosetta-code/self-referential-sequence.md |   4 +-
 .../rosetta-code/semiprime.md                 |   4 +-
 .../rosetta-code/set-consolidation.md         |   2 +-
 .../rosetta-code/set-of-real-numbers.md       |   2 +-
 .../rosetta-code/sha-1.md                     |   4 +-
 .../sort-an-array-of-composite-structures.md  |   2 +-
 .../rosetta-code/sort-disjoint-sublist.md     |   2 +-
 .../rosetta-code/sort-stability.md            |   4 +-
 .../sort-using-a-custom-comparator.md         |   2 +-
 .../sorting-algorithms-bead-sort.md           |  38 +--
 .../sorting-algorithms-bogosort.md            |   6 +-
 .../sorting-algorithms-cocktail-sort.md       |  26 +--
 .../sorting-algorithms-comb-sort.md           |  12 +-
 .../sorting-algorithms-gnome-sort.md          |   4 +-
 .../sorting-algorithms-pancake-sort.md        |   4 +-
 .../sorting-algorithms-permutation-sort.md    |   4 +-
 .../sorting-algorithms-shell-sort.md          |   4 +-
 .../sorting-algorithms-stooge-sort.md         |   4 +-
 .../sorting-algorithms-strand-sort.md         |  18 +-
 .../rosetta-code/soundex.md                   |  14 +-
 .../rosetta-code/spiral-matrix.md             |   2 +-
 ...ter-string-based-on-change-of-character.md |   2 +-
 .../rosetta-code/state-name-puzzle.md         |   9 +-
 .../rosetta-code/stern-brocot-sequence.md     |   4 +-
 .../rosetta-code/straddling-checkerboard.md   |  10 +-
 .../rosetta-code/stream-merge.md              |   2 +-
 ...s-and-extended-characters-from-a-string.md |   2 +-
 .../rosetta-code/subleq.md                    |  36 +--
 .../rosetta-code/sudoku.md                    |   4 +-
 .../rosetta-code/sum-digits-of-an-integer.md  |   2 +-
 .../rosetta-code/sum-multiples-of-3-and-5.md  |   2 +-
 .../rosetta-code/sum-of-a-series.md           |   4 +-
 .../rosetta-code/sum-of-squares.md            |   2 +-
 .../rosetta-code/sum-to-100.md                |   2 +-
 .../sutherland-hodgman-polygon-clipping.md    |   4 +-
 .../rosetta-code/symmetric-difference.md      |   8 +-
 .../rosetta-code/taxicab-numbers.md           |  11 +-
 .../tokenize-a-string-with-escaping.md        |   6 +-
 .../rosetta-code/top-rank-per-group.md        |   2 +-
 .../rosetta-code/topological-sort.md          |   2 +-
 .../rosetta-code/towers-of-hanoi.md           |  10 +-
 .../rosetta-code/vector-cross-product.md      |   4 +-
 .../rosetta-code/vector-dot-product.md        |   2 +-
 .../rosetta-code/word-frequency.md            |   4 +-
 .../rosetta-code/word-wrap.md                 |   2 +-
 .../rosetta-code/y-combinator.md              |  12 +-
 .../zeckendorf-number-representation.md       |   2 +-
 .../zhang-suen-thinning-algorithm.md          |  18 +-
 .../rosetta-code/zig-zag-matrix.md            |   6 +-
 .../build-a-camper-leaderboard.md             |   8 +-
 .../build-a-light-bright-app.md               |  20 +-
 .../build-a-nightlife-coordination-app.md     |  12 +-
 .../build-a-pinterest-clone.md                |   8 +-
 .../take-home-projects/build-a-pong-game.md   |  14 +-
 .../take-home-projects/build-a-recipe-box.md  |   6 +-
 .../build-a-roguelike-dungeon-crawler-game.md |   8 +-
 .../take-home-projects/build-a-simon-game.md  |   6 +-
 .../build-a-tic-tac-toe-game.md               |   6 +-
 .../take-home-projects/build-a-voting-app.md  |   2 +-
 .../build-a-wikipedia-viewer.md               |  16 +-
 ...build-an-image-search-abstraction-layer.md |   2 +-
 .../build-the-game-of-life.md                 |  23 +-
 .../chart-the-stock-market.md                 |   2 +-
 .../manage-a-book-trading-club.md             |   6 +-
 .../map-data-across-the-globe.md              |   8 +-
 .../p2p-video-chat-application.md             |   6 +-
 ...-contiguity-with-a-force-directed-graph.md |   6 +-
 .../show-the-local-weather.md                 |   8 +-
 .../use-the-twitch-json-api.md                |  16 +-
 .../book-recommendation-engine-using-knn.md   |  45 +++-
 .../cat-and-dog-image-classifier.md           |  94 +++++++-
 ...near-regression-health-costs-calculator.md |  26 ++-
 .../neural-network-sms-text-classifier.md     |  18 +-
 .../rock-paper-scissors.md                    |  50 +++-
 .../neural-networks-activation-functions.md   |   2 +-
 .../build-a-survey-form.md                    |  12 +-
 .../6148da157cc0bd0d06df5c0a.md               |  14 +-
 .../6148dc095264000dce348bf5.md               |   2 +-
 .../6148dcaaf2e8750e6cb4501a.md               |   2 +-
 .../6148dd31d210990f0fb140f8.md               |   2 +-
 .../6148defa9c01520fb9d178a0.md               |   2 +-
 .../6148dfab9b54c110577de165.md               |   2 +-
 .../6148e0bcc13efd10f7d7a6a9.md               |   2 +-
 .../6148e161ecec9511941f8833.md               |   2 +-
 .../6148e28706b34912340fd042.md               |   2 +-
 .../6148e335c1edd512d00e4691.md               |   2 +-
 .../6148e41c728f65138addf9cc.md               |   2 +-
 .../6148e5aeb102e3142de026a2.md               |   4 +-
 .../5f33294a6af5e9188dbdb8f3.md               |  23 +-
 .../5f332a88dc25a0fd25c7687a.md               |  25 +-
 .../5f332b23c2045fb843337579.md               |  31 +--
 .../5f344f9c805cd193c33d829c.md               |   8 +-
 .../5f344fad8bf01691e71a30eb.md               |   8 +-
 .../5f344fbc22624a2976425065.md               |   8 +-
 .../5f344fc1520b6719f2e35605.md               |  15 +-
 .../5f3477ae34c1239cafe128be.md               |   8 +-
 .../5f3477ae8466a9a3d2cc953c.md               |   8 +-
 .../5f3477ae9675db8bb7655b30.md               |  27 ++-
 .../5f3477aefa51bfc29327200b.md               |   8 +-
 .../5f3477cb2e27333b1ab2b955.md               |   8 +-
 .../5f3477cb303c5cb61b43aa9b.md               |   8 +-
 .../5f3477cbcb6ba47918c1da92.md               |   8 +-
 .../5f34a1fd611d003edeafd681.md               |   8 +-
 .../5f356ed60785e1f3e9850b6e.md               |   8 +-
 .../5f356ed60a5decd94ab66986.md               |   8 +-
 .../5f356ed6199b0cdef1d2be8f.md               |   8 +-
 .../5f356ed63c7807a4f1e6d054.md               |   8 +-
 .../5f356ed63e0fa262326eef05.md               |   8 +-
 .../5f356ed656a336993abd9f7c.md               |   8 +-
 .../5f356ed69db0a491745e2bb6.md               |   8 +-
 .../5f356ed6cf6eab5f15f5cfe6.md               |   8 +-
 .../5f35e5c4321f818cdc4bed30.md               |   8 +-
 .../5f35e5c44359872a137bd98f.md               |   8 +-
 .../5f3c866d0fc037f7311b4ac8.md               |   8 +-
 .../5f3c866d28d7ad0de6470505.md               |   8 +-
 .../5f3c866d5414453fc2d7b480.md               |   8 +-
 .../5f3c866daec9a49519871816.md               |   8 +-
 .../5f3c866dbf362f99b9a0c6d0.md               |   8 +-
 .../5f3c866dd0d0275f01d4d847.md               |   8 +-
 .../5f3c866de7a5b784048f94b1.md               |   8 +-
 .../5f3cade94c6576e7f7b7953f.md               |   8 +-
 .../5f3cade9993019e26313fa8e.md               |   8 +-
 .../5f3cade99dda4e6071a85dfd.md               |   8 +-
 .../5f3cade9fa77275d9f4efe62.md               |   8 +-
 .../5f3ef6e01f288a026d709587.md               |  20 +-
 .../5f3ef6e03d719d5ac4738993.md               |   8 +-
 .../5f3ef6e04559b939080db057.md               |   8 +-
 .../5f3ef6e050279c7a4a7101d3.md               |   8 +-
 .../5f3ef6e05473f91f948724ab.md               |   8 +-
 .../5f3ef6e056bdde6ae6892ba2.md               |   8 +-
 .../5f3ef6e06d34faac0447fc44.md               |   8 +-
 .../5f3ef6e07276f782bb46b93d.md               |  10 +-
 .../5f3ef6e0819d4f23ca7285e6.md               |   8 +-
 .../5f3ef6e087d56ed3ffdc36be.md               |   8 +-
 .../5f3ef6e0a81099d9a697b550.md               |   8 +-
 .../5f3ef6e0b431cc215bb16f55.md               |   8 +-
 .../5f3ef6e0e0c3feaebcf647ad.md               |   8 +-
 .../5f3ef6e0e9629bad967cd71e.md               |   8 +-
 .../5f3ef6e0eaa7da26e3d34d78.md               |   8 +-
 .../5f3ef6e0f8c230bdd2349716.md               |   8 +-
 .../5f3f26fa39591db45e5cd7a0.md               |  10 +-
 .../5f459225127805351a6ad057.md               |  10 +-
 .../5f459a7ceb8b5c446656d88b.md               |  10 +-
 .../5f459cf202c2a3472fae6a9f.md               |  10 +-
 .../5f459fd48bdc98491ca6d1a3.md               |  12 +-
 .../5f45a05977e2fa49d9119437.md               |  10 +-
 .../5f45a276c093334f0f6e9df4.md               |  10 +-
 .../5f45a5a7c49a8251f0bdb527.md               |  10 +-
 .../5f45a66d4a2b0453301e5a26.md               |  10 +-
 .../5f45b0731d39e15d54df4dfc.md               |  10 +-
 .../5f45b25e7ec2405f166b9de1.md               |  10 +-
 .../5f45b3c93c027860d9298dbd.md               |  10 +-
 .../5f45b45d099f3e621fbbb256.md               |  10 +-
 .../5f45b4c81cea7763550e40df.md               |  10 +-
 .../5f45b715301bbf667badc04a.md               |  10 +-
 .../5f46e270702a8456a664f0df.md               |  10 +-
 .../5f46e36e745ead58487aabf2.md               |  10 +-
 .../5f46e7a4750dd05b5a673920.md               |  10 +-
 .../5f46e8284aae155c83015dee.md               |  10 +-
 .../5f46ede1ff8fec5ba656b44c.md               |  10 +-
 .../5f46fc57528aa1c4b5ea7c2e.md               |  10 +-
 .../5f4701b942c824109626c3d8.md               |  10 +-
 .../5f475bb508746c16c9431d42.md               |  10 +-
 .../5f475e1c7f71a61d913836c6.md               |  10 +-
 .../5f47633757ae3469f2d33d2e.md               |   8 +-
 .../5f47fe7e31980053a8d4403b.md               |  16 +-
 .../5f716ad029ee4053c7027a7a.md               |   8 +-
 .../5f716bee5838c354c728a7c5.md               |   8 +-
 .../5f7691dafd882520797cd2f0.md               |   8 +-
 .../5f7692f7c5b3ce22a57788b6.md               |   8 +-
 .../5f769541be494f25449b292f.md               |   8 +-
 .../5f76967fad478126d6552b0d.md               |   8 +-
 .../5f769702e6e33127d14aa120.md               |   8 +-
 .../5f7b87422a560036fd03ccff.md               |   8 +-
 .../5f7b88d37b1f98386f04edc0.md               |   8 +-
 .../616965351e74d4689eb6de30.md               |  13 +-
 .../6153a3952facd25a83fe8083.md               |   2 +-
 .../5dc2385ff86c76b9248c6eb7.md               |  12 +-
 .../5dc23991f86c76b9248c6eb8.md               |  10 +-
 .../5dc23f9bf86c76b9248c6eba.md               |   2 +-
 .../5dc24073f86c76b9248c6ebb.md               |   2 +-
 .../5dc24165f86c76b9248c6ebc.md               |   2 +-
 .../5dc24614f86c76b9248c6ebd.md               |   2 +-
 .../5ddbd81294d8ddc1510a8e56.md               |   8 +-
 .../5dfa22d1b521be39a3de7be0.md               |  11 +-
 .../5dfa2407b521be39a3de7be1.md               |   2 +-
 .../5dfa30b9eacea3f48c6300ad.md               |   2 +-
 .../5dfa3589eacea3f48c6300ae.md               |   2 +-
 .../5dfa371beacea3f48c6300af.md               |   2 +-
 .../5dfa37b9eacea3f48c6300b0.md               |   4 +-
 .../5dfb5ecbeacea3f48c6300b1.md               |   2 +-
 .../5dfb6250eacea3f48c6300b2.md               |   2 +-
 .../5dfb655eeacea3f48c6300b3.md               |   6 +-
 .../5dfb6a35eacea3f48c6300b4.md               |   2 +-
 .../5ef9b03c81a63668521804d0.md               |   2 +-
 .../5ef9b03c81a63668521804d1.md               |   2 +-
 .../5ef9b03c81a63668521804d2.md               |   2 +-
 .../5ef9b03c81a63668521804d3.md               |   2 +-
 .../5ef9b03c81a63668521804d4.md               |   2 +-
 .../5ef9b03c81a63668521804d5.md               |   2 +-
 .../5ef9b03c81a63668521804d6.md               |   2 +-
 .../5ef9b03c81a63668521804d7.md               |   2 +-
 .../5ef9b03c81a63668521804d8.md               |   2 +-
 .../5ef9b03c81a63668521804d9.md               |   2 +-
 .../5ef9b03c81a63668521804da.md               |   2 +-
 .../5ef9b03c81a63668521804db.md               |   2 +-
 .../5ef9b03c81a63668521804dc.md               |   2 +-
 .../5ef9b03c81a63668521804dd.md               |   2 +-
 .../5ef9b03c81a63668521804de.md               |   2 +-
 .../5ef9b03c81a63668521804df.md               |   2 +-
 .../5ef9b03c81a63668521804e1.md               |   2 +-
 .../5ef9b03c81a63668521804e2.md               |   2 +-
 .../5ef9b03c81a63668521804e3.md               |   2 +-
 .../5ef9b03c81a63668521804e5.md               |   2 +-
 .../5ef9b03c81a63668521804e7.md               |   2 +-
 .../5ef9b03c81a63668521804e8.md               |   2 +-
 .../5ef9b03c81a63668521804e9.md               |   2 +-
 .../5ef9b03c81a63668521804ea.md               |   2 +-
 .../5ef9b03c81a63668521804eb.md               |   2 +-
 .../5ef9b03c81a63668521804ec.md               |   2 +-
 .../5ef9b03c81a63668521804ee.md               |   2 +-
 .../5efada803cbd2bbdab94e332.md               |   2 +-
 .../5efae0543cbd2bbdab94e333.md               |   2 +-
 .../5efae16e3cbd2bbdab94e334.md               |   2 +-
 .../5efb23e70dc218d6c85f89b1.md               |   2 +-
 .../5efb2c990dc218d6c85f89b2.md               |   2 +-
 .../5efc4f528d6a74d05e68af74.md               |   2 +-
 .../5efc518e8d6a74d05e68af75.md               |   2 +-
 .../5efc54138d6a74d05e68af76.md               |   2 +-
 .../5efc575c8d6a74d05e68af77.md               |   2 +-
 .../5f05a1d8e233dff4a68508d8.md               |   2 +-
 .../5f07be6ef7412fbad0c5626b.md               |  18 +-
 .../5f07c98cdb9413cbd4b16750.md               |   2 +-
 .../5f07fb1579dc934717801375.md               |  52 ++---
 .../5f0d48e7b435f13ab6550051.md               |   2 +-
 .../5f0d4ab1b435f13ab6550052.md               |   2 +-
 .../5f0d4d04b435f13ab6550053.md               |   2 +-
 .../5f1a80975fc4bcae0edb3497.md               |   2 +-
 .../5f1a89f1190aff21ae42105a.md               |   2 +-
 .../62bb4009e3458a128ff57d5d.md               |   4 +-
 .../62dabe2ef403a12d5d295273.md               |   2 +-
 .../7cf9b03d81a65668421804c3.md               |   2 +-
 .../60f1922fcbd2410527b3bd89.md               |   9 +-
 .../60f803d5241e6a0433a523a1.md               |   9 +-
 .../62a3cfc8328d3351b95d4f61.md               |   2 +-
 .../62a8aa98a8289d0a698eee1d.md               |   2 +-
 .../62a8cbd1e3595431d5a2b3f1.md               |   2 +-
 .../62a8ce73d0dce43468f6689c.md               |   4 +-
 .../62a8cf22272d6d35af80d4ac.md               |   2 +-
 .../62a8d0337d7c67377a4a76c6.md               |   6 +-
 .../62a8d08668fa8b38732486e9.md               |   2 +-
 .../62a8d61ddfe35744369365b7.md               |   6 +-
 .../62a8d6c7001ebc45350e3d16.md               |   4 +-
 .../62a8e35675c18c56354c08cf.md               |   6 +-
 .../62a8e41e2f190c58404dd46e.md               |   4 +-
 .../62a8ed36d7a7915dfa444ba2.md               |   2 +-
 .../62a8edd05e27cc668051686f.md               |   2 +-
 .../62a8eec45f77bc69e8775294.md               |   2 +-
 .../62a8ef8f0c76a46cd221a68c.md               |   2 +-
 .../62a8efb0e3ce826db8daf80f.md               |   2 +-
 .../62a8eff21c0b0f6ebe5b8e38.md               |   2 +-
 .../62aa204c1e1d33348ff09944.md               |   2 +-
 .../62aa20e9cf1be9358f5aceae.md               |   4 +-
 .../62aa226207f33d3ad4c6f546.md               |   6 +-
 .../62aa264d23cdaa45a20efada.md               |   2 +-
 .../62aa27227399d647e1c37a3c.md               |   4 +-
 .../62aa27560def7048d7b4a095.md               |   2 +-
 .../62aa27c40ca6f04ab8be5fac.md               |   2 +-
 .../build-a-survey-form.md                    |  12 +-
 .../falsy-bouncer.md                          |  10 +-
 ...-one-decimal-by-another-with-javascript.md |   6 -
 .../escape-sequences-in-strings.md            |  12 +-
 ...-variables-with-the-assignment-operator.md |   6 -
 .../quoting-strings-with-single-quotes.md     |   6 -
 .../basic-javascript/stand-in-line.md         |   4 +-
 .../use-recursion-to-create-a-countdown.md    |   7 +
 ...-recursion-to-create-a-range-of-numbers.md |   7 +
 ...syntax-to-define-a-constructor-function.md |  31 ++-
 ...-concise-declarative-functions-with-es6.md |   3 +-
 ...f-an-array-using-concat-instead-of-push.md |  10 +-
 .../make-a-person.md                          |   8 -
 .../steamroller.md                            |   7 +
 .../sum-all-primes.md                         |  56 +++--
 .../add-methods-after-inheritance.md          |  48 +++-
 .../build-a-25-5-clock.md                     |   2 +-
 .../build-a-drum-machine.md                   |   2 +-
 .../build-a-javascript-calculator.md          |   2 +-
 .../build-a-markdown-previewer.md             |   2 +-
 .../build-a-random-quote-machine.md           |   2 +-
 .../visualize-data-with-a-bar-chart.md        |   6 +-
 .../visualize-data-with-a-choropleth-map.md   |   6 +-
 .../visualize-data-with-a-heat-map.md         |   6 +-
 ...visualize-data-with-a-scatterplot-graph.md |   6 +-
 .../visualize-data-with-a-treemap-diagram.md  |   6 +-
 .../mongodb-and-mongoose/create-a-model.md    |   6 +-
 .../authentication-strategies.md              |   6 +-
 .../authentication-with-socket.io.md          |   4 +-
 .../clean-up-your-project-with-modules.md     |   2 +-
 .../communicate-by-emitting.md                |   2 +-
 .../create-new-middleware.md                  |   2 +-
 .../handle-a-disconnect.md                    |   2 +-
 .../hashing-your-passwords.md                 |   4 +-
 .../how-to-put-a-profile-together.md          |   2 +-
 .../how-to-use-passport-strategies.md         |   2 +-
 ...nt-the-serialization-of-a-passport-user.md |   4 +-
 ...lementation-of-social-authentication-ii.md |  18 +-
 ...ementation-of-social-authentication-iii.md |   2 +-
 ...implementation-of-social-authentication.md |   4 +-
 .../logging-a-user-out.md                     |   4 +-
 .../registration-of-new-users.md              |   2 +-
 .../send-and-display-chat-messages.md         |   2 +-
 .../serialization-of-a-user-object.md         |   4 +-
 .../set-up-a-template-engine.md               |  14 +-
 .../set-up-passport.md                        |  22 +-
 .../set-up-the-environment.md                 |   6 +-
 .../use-a-template-engines-powers.md          |  36 ++-
 ...ality-with-.deepequal-and-.notdeepequal.md |   2 +-
 .../compare-the-properties-of-two-elements.md |  14 +-
 .../learn-how-javascript-assertions-work.md   |   4 +-
 ...sponse-using-chai-http-iii---put-method.md |   2 +-
 ...esponse-using-chai-http-iv---put-method.md |   2 +-
 ...sts-on-api-endpoints-using-chai-http-ii.md |   2 +-
 ...-tests-on-api-endpoints-using-chai-http.md |   2 +-
 ...ional-tests-using-a-headless-browser-ii.md |   4 +-
 ...nctional-tests-using-a-headless-browser.md |   2 +-
 ...mulate-actions-using-a-headless-browser.md |   2 +-
 .../test-for-truthiness.md                    |   2 +-
 .../test-if-a-string-contains-a-substring.md  |   2 +-
 ...f-a-value-falls-within-a-specific-range.md |   2 +-
 .../test-if-a-value-is-a-string.md            |   2 +-
 ...ue-is-of-a-specific-data-structure-type.md |   2 +-
 ...st-if-a-variable-or-function-is-defined.md |   2 +-
 .../test-if-an-array-contains-an-item.md      |   2 +-
 .../test-if-an-object-has-a-property.md       |   2 +-
 ...-object-is-an-instance-of-a-constructor.md |   2 +-
 ...s-below-or-at-least-as-large-as-another.md |   2 +-
 .../use-assert.isok-and-assert.isnotok.md     |   4 +-
 ...se-regular-expressions-to-test-a-string.md |   2 +-
 ...se-the-double-equals-to-assert-equality.md |   2 +-
 ...triple-equals-to-assert-strict-equality.md |   2 +-
 .../american-british-translator.md            |   6 +-
 .../issue-tracker.md                          |   6 +-
 .../metric-imperial-converter.md              |   6 +-
 .../personal-library.md                       |   6 +-
 .../sudoku-solver.md                          |  30 +--
 .../build-your-own-functions.md               |   2 +-
 .../comparing-and-sorting-tuples.md           |   2 +-
 .../data-visualization-mailing-lists.md       |  14 +-
 .../dictionaries-and-loops.md                 |   2 +-
 .../files-as-a-sequence.md                    |   2 +-
 .../intermediate-expressions.md               |   4 +-
 .../intermediate-strings.md                   |   2 +-
 .../introduction-why-program.md               |   4 +-
 .../iterations-more-patterns.md               |   2 +-
 .../more-conditional-structures.md            |   4 +-
 .../networking-web-scraping-with-python.md    |   6 +-
 .../relational-databases-and-sqlite.md        |  14 +-
 ...al-databases-many-to-many-relationships.md |  10 +-
 .../python-for-everybody/strings-and-lists.md |   2 +-
 ...services-api-rate-limiting-and-security.md |   8 +-
 .../arithmetic-formatter.md                   |   4 +-
 .../budget-app.md                             |   2 +-
 .../polygon-area-calculator.md                |   2 +-
 .../probability-calculator.md                 |   4 +-
 .../time-calculator.md                        |   2 +-
 .../introduction-to-data-analysis.md          |   9 +-
 .../demographic-data-analyzer.md              |   9 +-
 ...-variance-standard-deviation-calculator.md |   7 +-
 .../medical-data-visualizer.md                |  35 +--
 .../page-view-time-series-visualizer.md       |  15 +-
 .../sea-level-predictor.md                    |  14 +-
 .../anonymous-message-board.md                |   6 +-
 .../port-scanner.md                           |   8 +-
 .../secure-real-time-multiplayer-game.md      |  55 +++--
 .../sha-1-password-cracker.md                 |  10 +-
 .../stock-price-checker.md                    |   8 +-
 ...ur-site-via-https-only-with-helmet.hsts.md |   2 +-
 ...-response-mime-type-with-helmet.nosniff.md |   2 +-
 ...lmet-using-the-parent-helmet-middleware.md |   2 +-
 ...client-side-caching-with-helmet.nocache.md |   2 +-
 ...fetching-with-helmet.dnsprefetchcontrol.md |   2 +-
 ...sh-and-compare-passwords-asynchronously.md |   2 +-
 ...ash-and-compare-passwords-synchronously.md |   2 +-
 ...-information-using-helmet.hidepoweredby.md |   2 +-
 .../install-and-require-helmet.md             |   6 +-
 ...-of-clickjacking-with-helmet.frameguard.md |   2 +-
 ...pting-xss-attacks-with-helmet.xssfilter.md |   2 +-
 ...ing-untrusted-html-with-helmet.ienoopen.md |   2 +-
 ...olicy-with-helmet.contentsecuritypolicy.md |   2 +-
 .../understand-bcrypt-hashes.md               |  10 +-
 .../find-the-symmetric-difference.md          |   4 +-
 ...d-a-new-element-to-a-binary-search-tree.md |   2 +-
 ...ts-at-a-specific-index-in-a-linked-list.md |   6 +-
 .../data-structures/adjacency-list.md         |   2 +-
 .../check-if-binary-search-tree.md            |  20 +-
 .../create-a-circular-queue.md                |   2 +-
 .../create-a-doubly-linked-list.md            |  10 +-
 .../data-structures/create-a-hash-table.md    |  14 +-
 .../create-a-linked-list-class.md             |   3 +-
 .../create-a-map-data-structure.md            |  16 +-
 .../create-a-trie-search-tree.md              |  12 +-
 .../create-an-es6-javascript-map.md           |  18 +-
 ...ete-a-leaf-node-in-a-binary-search-tree.md |  21 ++
 ...-with-one-child-in-a-binary-search-tree.md |  13 +-
 .../data-structures/depth-first-search.md     |  17 ++
 .../implement-heap-sort-with-a-min-heap.md    |  10 +-
 .../data-structures/incidence-matrix.md       |   2 +-
 .../insert-an-element-into-a-max-heap.md      |  48 ++--
 ...form-a-subset-check-on-two-sets-of-data.md |  18 +-
 .../perform-a-union-on-two-sets.md            |   2 +-
 .../remove-an-element-from-a-max-heap.md      |  42 ++--
 ...ve-elements-from-a-linked-list-by-index.md |   2 +-
 .../reverse-a-doubly-linked-list.md           |  10 +-
 .../search-within-a-linked-list.md            |   2 +-
 ...th-first-search-in-a-binary-search-tree.md |   6 +-
 .../problem-1-multiples-of-3-and-5.md         |  18 +-
 .../problem-10-summation-of-primes.md         |  53 +++--
 .../problem-100-arranged-probability.md       |   2 +-
 .../problem-101-optimum-polynomial.md         |   6 +-
 .../problem-102-triangle-containment.md       |   2 +-
 ...problem-103-special-subset-sums-optimum.md |  21 +-
 .../problem-104-pandigital-fibonacci-ends.md  |   2 +-
 ...problem-105-special-subset-sums-testing.md |   4 +-
 ...em-106-special-subset-sums-meta-testing.md |   4 +-
 .../problem-107-minimal-network.md            |   6 +-
 .../problem-108-diophantine-reciprocals-i.md  |   6 +-
 .../project-euler/problem-109-darts.md        |   9 +-
 .../problem-11-largest-product-in-a-grid.md   |   4 +-
 .../problem-110-diophantine-reciprocals-ii.md |   4 +-
 .../problem-111-primes-with-runs.md           |   2 +-
 .../problem-112-bouncy-numbers.md             |   2 +-
 .../problem-113-non-bouncy-numbers.md         |   4 +-
 ...oblem-114-counting-block-combinations-i.md |  10 +-
 .../problem-116-red-green-or-blue-tiles.md    |  14 +-
 .../problem-117-red-green-and-blue-tiles.md   |   8 +-
 .../problem-118-pandigital-prime-sets.md      |   8 +-
 .../problem-119-digit-power-sum.md            |  12 +-
 ...m-12-highly-divisible-triangular-number.md |   6 +-
 .../problem-121-disc-game-prize-fund.md       |  18 +-
 .../problem-122-efficient-exponentiation.md   |  27 ++-
 .../problem-124-ordered-radicals.md           | 140 +++++++++---
 .../problem-125-palindromic-sums.md           |  16 +-
 .../problem-126-cuboid-layers.md              |  22 +-
 .../project-euler/problem-127-abc-hits.md     |  40 ++--
 .../problem-128-hexagonal-tile-differences.md |  78 ++++++-
 .../project-euler/problem-13-large-sum.md     |   4 +-
 .../problem-135-same-differences.md           |  18 +-
 .../problem-136-singleton-difference.md       |  18 +-
 .../problem-139-pythagorean-tiles.md          |  22 +-
 .../problem-14-longest-collatz-sequence.md    |   4 +-
 ...ng-multiple-reflections-of-a-laser-beam.md |  37 ++-
 ...m-147-rectangles-in-cross-hatched-grids.md |  24 +-
 .../project-euler/problem-15-lattice-paths.md |  18 +-
 ...y-for-a-sub-triangle-having-minimum-sum.md |  28 ++-
 ...tandard-sizes-an-expected-value-problem.md |  18 +-
 ...ng-one-half-as-a-sum-of-inverse-squares.md |  18 +-
 ...lem-153-investigating-gaussian-integers.md |  60 +++--
 .../problem-154-exploring-pascals-pyramid.md  |  20 +-
 ...problem-155-counting-capacitor-circuits.md |  22 +-
 .../problem-156-counting-digits.md            |  38 ++-
 ...em-157-solving-the-diophantine-equation.md |  59 +----
 ...hically-after-its-neighbour-to-the-left.md |  16 +-
 ...159-digital-root-sums-of-factorisations.md |  27 ++-
 .../problem-16-power-digit-sum.md             |   2 +-
 .../problem-160-factorial-trailing-digits.md  |  25 +-
 .../project-euler/problem-161-triominoes.md   |  16 +-
 .../problem-162-hexadecimal-numbers.md        |  24 +-
 .../problem-163-cross-hatched-triangles.md    |  23 +-
 ...s-have-a-sum-greater-than-a-given-value.md |  12 +-
 .../problem-165-intersections.md              |  38 ++-
 .../project-euler/problem-166-criss-cross.md  |  18 +-
 ...roblem-167-investigating-ulam-sequences.md |  22 +-
 .../problem-168-number-rotations.md           |  56 ++++-
 ...an-be-expressed-as-a-sum-of-powers-of-2.md |  26 +--
 .../problem-17-number-letter-counts.md        |   6 +-
 ...can-be-formed-by-concatenating-products.md |  15 +-
 ...f-the-squares-of-the-digits-is-a-square.md |  22 +-
 ...gating-numbers-with-few-repeated-digits.md |  12 +-
 ...ent-hollow-square-laminae-can-be-formed.md |  12 +-
 ...one-two-three-...-distinct-arrangements.md |  18 +-
 ...an-be-expressed-as-a-sum-of-powers-of-2.md |  34 ++-
 ...-angled-triangles-that-share-a-cathetus.md |  10 +-
 ...oblem-177-integer-angled-quadrilaterals.md |  20 +-
 .../project-euler/problem-178-step-numbers.md |  12 +-
 ...oblem-179-consecutive-positive-divisors.md |  12 +-
 .../problem-18-maximum-path-sum-i.md          |   2 +-
 ...-zeros-of-a-function-of-three-variables.md |  27 ++-
 ...of-two-different-colours-can-be-grouped.md |  18 +-
 .../problem-182-rsa-encryption.md             |   2 +-
 .../problem-183-maximum-product-of-parts.md   |  28 +--
 ...lem-184-triangles-containing-the-origin.md |  20 +-
 .../project-euler/problem-185-number-mind.md  |  32 ++-
 .../problem-186-connectedness-of-a-network.md |  27 ++-
 .../project-euler/problem-187-semiprimes.md   |  12 +-
 ...188-the-hyperexponentiation-of-a-number.md |  18 +-
 ...lem-189-tri-colouring-a-triangular-grid.md |  14 +-
 .../problem-19-counting-sundays.md            |   2 +-
 ...oblem-190-maximising-a-weighted-product.md |  16 +-
 .../problem-191-prize-strings.md              |  18 +-
 .../problem-192-best-approximations.md        |  20 +-
 .../problem-193-squarefree-numbers.md         |  14 +-
 .../problem-194-coloured-configurations.md    |  22 +-
 ...-triangles-with-one-angle-of-60-degrees.md |  22 +-
 .../problem-196-prime-triplets.md             |  24 +-
 ...viour-of-a-recursively-defined-sequence.md |  18 +-
 .../problem-198-ambiguous-numbers.md          |  18 +-
 .../problem-199-iterative-circle-packing.md   |   8 +-
 .../problem-2-even-fibonacci-numbers.md       |  24 +-
 .../problem-20-factorial-digit-sum.md         |   2 +-
 ...ontaining-the-contiguous-sub-string-200.md |  18 +-
 .../problem-201-subsets-with-a-unique-sum.md  |  32 ++-
 .../project-euler/problem-202-laserbeam.md    |  18 +-
 ...em-203-squarefree-binomial-coefficients.md |  18 +-
 ...problem-204-generalised-hamming-numbers.md |  16 +-
 .../project-euler/problem-205-dice-game.md    |  10 +-
 .../problem-206-concealed-square.md           |  39 +++-
 ...problem-207-integer-partition-equations.md |  30 ++-
 .../project-euler/problem-208-robot-walks.md  |  16 +-
 .../problem-209-circular-logic.md             |  32 ++-
 .../problem-21-amicable-numbers.md            |   2 +-
 .../problem-210-obtuse-angled-triangles.md    |  20 +-
 .../problem-211-divisor-square-sum.md         |  16 +-
 .../problem-212-combined-volume-of-cuboids.md |  31 +--
 .../project-euler/problem-213-flea-circus.md  |  10 +-
 .../problem-214-totient-chains.md             |  26 ++-
 .../problem-215-crack-free-walls.md           |  16 +-
 ...-primality-of-numbers-of-the-form-2n2-1.md |  18 +-
 .../problem-217-balanced-numbers.md           |  18 +-
 ...blem-218-perfect-right-angled-triangles.md |  28 ++-
 .../problem-219-skew-cost-coding.md           |  24 +-
 .../project-euler/problem-22-names-scores.md  |   2 +-
 .../problem-220-heighway-dragon.md            |  29 ++-
 .../problem-221-alexandrian-integers.md       |  21 +-
 .../problem-222-sphere-packing.md             |  12 +-
 ...lem-223-almost-right-angled-triangles-i.md |  14 +-
 ...em-224-almost-right-angled-triangles-ii.md |  16 +-
 .../problem-225-tribonacci-non-divisors.md    |  16 +-
 .../problem-226-a-scoop-of-blancmange.md      |  20 +-
 .../project-euler/problem-227-the-chase.md    |  20 +-
 .../problem-228-minkowski-sums.md             |  33 ++-
 ...-229-four-representations-using-squares.md |  28 ++-
 .../problem-23-non-abundant-sums.md           |   2 +-
 .../problem-230-fibonacci-words.md            |  36 +--
 ...-factorisation-of-binomial-coefficients.md |  18 +-
 .../project-euler/problem-232-the-race.md     |  20 +-
 .../problem-233-lattice-points-on-a-circle.md |  16 +-
 .../problem-234-semidivisible-numbers.md      |  20 +-
 ...em-235-an-arithmetic-geometric-sequence.md |  18 +-
 .../problem-236-luxury-hampers.md             |  35 ++-
 ...blem-237-tours-on-a-4-x-n-playing-board.md |  27 ++-
 .../problem-238-infinite-string-tour.md       |  31 +--
 .../problem-239-twenty-two-foolish-primes.md  |  10 +-
 .../problem-24-lexicographic-permutations.md  |   2 +-
 .../project-euler/problem-240-top-dice.md     |  20 +-
 .../problem-241-perfection-quotients.md       |  18 +-
 .../project-euler/problem-242-odd-triplets.md |  18 +-
 .../project-euler/problem-243-resilience.md   |  22 +-
 .../project-euler/problem-244-sliders.md      |  26 ++-
 .../project-euler/problem-245-coresilience.md |  22 +-
 .../problem-246-tangents-to-an-ellipse.md     |  30 ++-
 .../problem-247-squares-under-a-hyperbola.md  |  30 ++-
 ...which-eulers-totient-function-equals-13.md |  14 +-
 .../problem-249-prime-subset-sums.md          |  16 +-
 .../problem-25-1000-digit-fibonacci-number.md |   4 +-
 .../project-euler/problem-250-250250.md       |  12 +-
 .../problem-251-cardano-triplets.md           |  18 +-
 .../project-euler/problem-252-convex-holes.md |  17 +-
 .../project-euler/problem-253-tidying-up.md   |  43 ++--
 .../problem-254-sums-of-digit-factorials.md   |  22 +-
 .../problem-255-rounded-square-roots.md       |  41 +++-
 .../problem-256-tatami-free-rooms.md          |  24 +-
 .../problem-257-angular-bisectors.md          |  20 +-
 ...problem-258-a-lagged-fibonacci-sequence.md |  17 +-
 .../problem-259-reachable-numbers.md          |  19 +-
 .../problem-26-reciprocal-cycles.md           |   2 +-
 .../project-euler/problem-260-stone-game.md   |  32 ++-
 .../problem-261-pivotal-square-sums.md        |  22 +-
 .../problem-262-mountain-range.md             |  22 +-
 ...roblem-263-an-engineers-dream-come-true.md |  27 ++-
 .../problem-264-triangle-centres.md           |  43 ++--
 .../problem-265-binary-circles.md             |  25 +-
 .../problem-266-pseudo-square-root.md         |  16 +-
 .../project-euler/problem-267-billionaire.md  |  16 +-
 ...ur-distinct-prime-factors-less-than-100.md |  16 +-
 ...ynomials-with-at-least-one-integer-root.md |  28 ++-
 .../problem-27-quadratic-primes.md            |   2 +-
 .../problem-270-cutting-squares.md            |  26 +--
 .../problem-271-modular-cubes-part-1.md       |  16 +-
 .../problem-272-modular-cubes-part-2.md       |  16 +-
 .../problem-273-sum-of-squares.md             |  24 +-
 .../problem-274-divisibility-multipliers.md   |  24 +-
 .../problem-275-balanced-sculptures.md        |  27 +--
 .../problem-276-primitive-triangles.md        |  16 +-
 ...problem-277-a-modified-collatz-sequence.md |  30 +--
 ...m-278-linear-combinations-of-semiprimes.md |  18 +-
 ...th-integral-sides-and-an-integral-angle.md |  12 +-
 .../problem-28-number-spiral-diagonals.md     |   2 +-
 .../problem-280-ant-and-seeds.md              |  10 +-
 .../problem-281-pizza-toppings.md             |  20 +-
 .../problem-282-the-ackermann-function.md     |  19 +-
 ...h-the-area--perimeter-ratio-is-integral.md |  16 +-
 .../problem-284-steady-squares.md             |  24 +-
 .../problem-285-pythagorean-odds.md           |  20 +-
 .../problem-286-scoring-probabilities.md      |  18 +-
 ...encoding-a-simple-compression-algorithm.md |  35 +--
 .../problem-288-an-enormous-factorial.md      |  23 +-
 .../problem-289-eulerian-cycles.md            |  24 +-
 .../problem-29-distinct-powers.md             |   6 +-
 .../problem-290-digital-signature.md          |  12 +-
 .../problem-291-panaitopol-primes.md          |  14 +-
 .../problem-292-pythagorean-polygons.md       |  25 +-
 .../problem-293-pseudo-fortunate-numbers.md   |  22 +-
 ...oblem-294-sum-of-digits---experience-23.md |  21 +-
 .../problem-295-lenticular-holes.md           |  31 +--
 ...roblem-296-angular-bisector-and-tangent.md |  18 +-
 .../problem-297-zeckendorf-representation.md  |  22 +-
 .../problem-298-selective-amnesia.md          |  33 ++-
 .../problem-299-three-similar-triangles.md    |  32 +--
 .../problem-30-digit-n-powers.md              |   2 +-
 .../problem-300-protein-folding.md            |  24 +-
 .../project-euler/problem-301-nim.md          |  33 +--
 .../problem-302-strong-achilles-numbers.md    |  24 +-
 ...problem-303-multiples-with-small-digits.md |  18 +-
 .../project-euler/problem-304-primonacci.md   |  20 +-
 .../problem-305-reflexive-position.md         |  20 +-
 .../problem-306-paper-strip-game.md           |  26 ++-
 .../project-euler/problem-307-chip-defects.md |  16 +-
 ...8-an-amazing-prime-generating-automaton.md |  24 +-
 .../problem-309-integer-ladders.md            |  20 +-
 .../project-euler/problem-31-coin-sums.md     |   2 +-
 .../project-euler/problem-310-nim-square.md   |  16 +-
 ...em-311-biclinic-integral-quadrilaterals.md |  24 +-
 ...em-312-cyclic-paths-on-sierpiski-graphs.md |  27 ++-
 .../project-euler/problem-313-sliding-game.md |  20 +-
 .../problem-314-the-mouse-on-the-moon.md      |  22 +-
 .../problem-315-digital-root-clocks.md        |  36 ++-
 ...oblem-316-numbers-in-decimal-expansions.md |  34 +--
 .../project-euler/problem-317-firecracker.md  |  16 +-
 .../project-euler/problem-318-2011-nines.md   |  46 ++--
 .../problem-319-bounded-sequences.md          |  24 +-
 .../problem-32-pandigital-products.md         |   2 +-
 ...-factorials-divisible-by-a-huge-integer.md |  18 +-
 .../problem-321-swapping-counters.md          |  22 +-
 ...2-binomial-coefficients-divisible-by-10.md |  16 +-
 ...itwise-or-operations-on-random-integers.md |  23 +-
 .../problem-324-building-a-tower.md           |  20 +-
 .../problem-325-stone-game-ii.md              |  18 +-
 .../problem-326-modulo-summations.md          |  24 +-
 .../problem-327-rooms-of-doom.md              |  30 ++-
 .../problem-328-lowest-cost-search.md         |  32 +--
 .../project-euler/problem-329-prime-frog.md   |  22 +-
 .../problem-33-digit-cancelling-fractions.md  |   2 +-
 .../project-euler/problem-331-cross-flips.md  |  22 +-
 .../problem-332-spherical-triangles.md        |  24 +-
 .../problem-333-special-partitions.md         |  29 +--
 .../problem-334-spilling-the-beans.md         |  23 +-
 .../problem-335-gathering-the-beans.md        |  16 +-
 .../problem-336-maximix-arrangements.md       |  32 ++-
 ...problem-337-totient-stairstep-sequences.md |  26 +--
 ...blem-338-cutting-rectangular-grid-paper.md |  24 +-
 .../problem-339-peredur-fab-efrawg.md         |  18 +-
 .../problem-34-digit-factorials.md            |   4 +-
 .../problem-340-crazy-function.md             |  23 +-
 ...em-341-golombs-self-describing-sequence.md |  23 +-
 ...m-342-the-totient-of-a-square-is-a-cube.md |  17 +-
 .../problem-343-fractional-sequences.md       |  31 ++-
 .../problem-344-silver-dollar-game.md         |  18 +-
 .../project-euler/problem-345-matrix-sum.md   |  27 ++-
 .../problem-346-strong-repunits.md            |  16 +-
 ...largest-integer-divisible-by-two-primes.md |  22 +-
 .../problem-348-sum-of-a-square-and-a-cube.md |  18 +-
 .../project-euler/problem-349-langtons-ant.md |  17 +-
 .../problem-35-circular-primes.md             |   4 +-
 ...e-least-greatest-and-the-greatest-least.md |  24 +-
 .../problem-351-hexagonal-orchards.md         |  20 +-
 .../project-euler/problem-352-blood-tests.md  |  38 ++-
 .../project-euler/problem-353-risky-moon.md   |  28 +--
 ...oblem-354-distances-in-a-bees-honeycomb.md |  18 +-
 .../problem-355-maximal-coprime-subset.md     |  16 +-
 ...-356-largest-roots-of-cubic-polynomials.md |  20 +-
 .../problem-357-prime-generating-integers.md  |  16 +-
 .../problem-358-cyclic-numbers.md             |  29 ++-
 .../problem-359-hilberts-new-hotel.md         |  32 ++-
 .../problem-36-double-base-palindromes.md     |   2 +-
 .../project-euler/problem-360-scary-sphere.md |  22 +-
 ...-361-subsequence-of-thue-morse-sequence.md |  31 +--
 .../problem-362-squarefree-factors.md         |  22 +-
 .../project-euler/problem-363-bzier-curves.md |  30 ++-
 .../problem-364-comfortable-distance.md       |  24 +-
 ...problem-365-a-huge-binomial-coefficient.md |  16 +-
 .../problem-366-stone-game-iii.md             |  34 ++-
 .../project-euler/problem-367-bozo-sort.md    |  28 ++-
 .../problem-368-a-kempner-like-series.md      |  19 +-
 .../project-euler/problem-369-badugi.md       |  14 +-
 .../problem-37-truncatable-primes.md          |   2 +-
 .../problem-370-geometric-triangles.md        |  18 +-
 .../problem-371-licence-plates.md             |  16 +-
 .../problem-372-pencils-of-rays.md            |  18 +-
 .../problem-373-circumscribed-circles.md      |  20 +-
 ...m-374-maximum-integer-partition-product.md |  28 +--
 .../problem-375-minimum-of-subsequences.md    |  31 +--
 .../problem-376-nontransitive-sets-of-dice.md |  37 ++-
 ...problem-377-sum-of-digits-experience-13.md |  14 +-
 .../problem-378-triangle-triples.md           |  22 +-
 ...problem-379-least-common-multiple-count.md |  18 +-
 .../problem-38-pandigital-multiples.md        |   6 +-
 .../problem-380-amazing-mazes.md              |  28 ++-
 .../problem-381-prime-k-factorial.md          |  22 +-
 .../problem-382-generating-polygons.md        |  37 ++-
 ...isibility-comparison-between-factorials.md |  20 +-
 .../problem-384-rudin-shapiro-sequence.md     |  39 ++--
 .../problem-385-ellipses-inside-triangles.md  |  30 +--
 ...blem-386-maximum-length-of-an-antichain.md |  24 +-
 .../problem-387-harshad-numbers.md            |  18 +-
 .../problem-388-distinct-lines.md             |  18 +-
 .../problem-389-platonic-dice.md              |  22 +-
 .../problem-39-integer-right-triangles.md     |   2 +-
 ...th-non-rational-sides-and-integral-area.md |  22 +-
 .../project-euler/problem-391-hopping-game.md |  33 +--
 .../problem-392-enmeshed-unit-circle.md       |  28 ++-
 .../problem-393-migrating-ants.md             |  18 +-
 .../project-euler/problem-394-eating-pie.md   |  29 +--
 .../problem-395-pythagorean-tree.md           |  18 +-
 .../problem-396-weak-goodstein-sequence.md    |  32 ++-
 .../problem-397-triangle-on-parabola.md       |  18 +-
 .../project-euler/problem-398-cutting-rope.md |  16 +-
 ...roblem-399-squarefree-fibonacci-numbers.md |  32 +--
 .../problem-4-largest-palindrome-product.md   |  12 +-
 .../problem-40-champernownes-constant.md      |   2 +-
 .../problem-400-fibonacci-tree-game.md        |  28 +--
 .../problem-401-sum-of-squares-of-divisors.md |  20 +-
 .../problem-402-integer-valued-polynomials.md |  25 +-
 ...ce-points-enclosed-by-parabola-and-line.md |  20 +-
 .../problem-404-crisscross-ellipses.md        |  30 ++-
 .../problem-405-a-rectangular-tiling.md       |  24 +-
 .../problem-406-guessing-game.md              |  42 ++--
 .../project-euler/problem-407-idempotents.md  |  18 +-
 ...lem-408-admissible-paths-through-a-grid.md |  18 +-
 .../project-euler/problem-409-nim-extreme.md  |  24 +-
 .../problem-41-pandigital-prime.md            |   2 +-
 .../problem-410-circle-and-tangent-line.md    |  20 +-
 .../project-euler/problem-411-uphill-paths.md |  24 +-
 .../problem-412-gnomon-numbering.md           |  26 ++-
 .../problem-413-one-child-numbers.md          |  20 +-
 .../problem-414-kaprekar-constant.md          |  32 +--
 .../project-euler/problem-415-titanic-sets.md |  18 +-
 .../project-euler/problem-416-a-frogs-trip.md |  18 +-
 .../problem-417-reciprocal-cycles-ii.md       |  23 +-
 .../problem-418-factorisation-triples.md      |  21 +-
 .../problem-419-look-and-say-sequence.md      |  31 ++-
 .../problem-42-coded-triangle-numbers.md      |   2 +-
 ...problem-420-2x2-positive-integer-matrix.md |  27 ++-
 .../problem-421-prime-factors-of-n151.md      |  26 ++-
 ...m-422-sequence-of-points-on-a-hyperbola.md |  28 ++-
 .../problem-423-consecutive-die-throws.md     |  33 ++-
 .../project-euler/problem-424-kakuro.md       |  43 +++-
 .../problem-425-prime-connection.md           |  27 ++-
 .../problem-426-box-ball-system.md            |  27 ++-
 .../project-euler/problem-427-n-sequences.md  |  22 +-
 .../problem-428-necklace-of-circles.md        |  31 +--
 ...-429-sum-of-squares-of-unitary-divisors.md |  20 +-
 .../problem-43-sub-string-divisibility.md     |   2 +-
 .../project-euler/problem-430-range-flips.md  |  22 +-
 .../problem-431-square-space-silo.md          |  20 +-
 .../project-euler/problem-432-totient-sum.md  |  16 +-
 .../problem-433-steps-in-euclids-algorithm.md |  25 +-
 .../project-euler/problem-434-rigid-graphs.md |  30 ++-
 ...em-435-polynomials-of-fibonacci-numbers.md |  18 +-
 .../project-euler/problem-436-unfair-wager.md |  24 +-
 .../problem-437-fibonacci-primitive-roots.md  |  36 ++-
 ...-part-of-polynomial-equations-solutions.md |  25 +-
 .../problem-439-sum-of-sum-of-divisors.md     |  20 +-
 .../problem-44-pentagon-numbers.md            |   2 +-
 .../problem-440-gcd-and-tiling.md             |  31 ++-
 ...he-inverse-summation-of-coprime-couples.md |  22 +-
 .../problem-442-eleven-free-integers.md       |  14 +-
 .../project-euler/problem-443-gcd-sequence.md |  24 +-
 .../problem-444-the-roundtable-lottery.md     |  26 ++-
 .../problem-445-retractions-a.md              |  24 +-
 .../problem-446-retractions-b.md              |  24 +-
 .../problem-447-retractions-c.md              |  24 +-
 ...oblem-448-average-least-common-multiple.md |  24 +-
 .../problem-449-chocolate-covered-candy.md    |  22 +-
 ...-45-triangular-pentagonal-and-hexagonal.md |   2 +-
 ...blem-450-hypocycloid-and-lattice-points.md |  35 +--
 .../problem-451-modular-inverses.md           |  33 ++-
 .../problem-452-long-products.md              |  18 +-
 .../problem-453-lattice-quadrilaterals.md     |  20 +-
 ...problem-454-diophantine-reciprocals-iii.md |  20 +-
 ...problem-455-powers-with-trailing-digits.md |  18 +-
 ...-456-triangles-containing-the-origin-ii.md |  26 ++-
 ...polynomial-modulo-the-square-of-a-prime.md |  20 +-
 .../problem-458-permutations-of-project.md    |  18 +-
 .../problem-459-flipping-game.md              |  32 ++-
 .../problem-46-goldbachs-other-conjecture.md  |   2 +-
 .../problem-460-an-ant-on-the-move.md         |  31 ++-
 .../project-euler/problem-461-almost-pi.md    |   2 +-
 ...lem-462-permutation-of-3-smooth-numbers.md |  28 ++-
 ...problem-463-a-weird-recurrence-relation.md |  24 +-
 ...roblem-464-mbius-function-and-intervals.md |  31 ++-
 .../problem-465-polar-polygons.md             |  20 +-
 ...istinct-terms-in-a-multiplication-table.md |  26 ++-
 .../project-euler/problem-467-superinteger.md |  31 ++-
 ...mooth-divisors-of-binomial-coefficients.md |  30 ++-
 .../project-euler/problem-469-empty-chairs.md |  18 +-
 .../problem-47-distinct-primes-factors.md     |  60 ++---
 .../project-euler/problem-470-super-ramvok.md |  18 +-
 ...oblem-471-triangle-inscribed-in-ellipse.md |  34 ++-
 .../problem-472-comfortable-distance-ii.md    |  30 +--
 .../problem-473-phigital-number-base.md       |  20 +-
 .../problem-474-last-digits-of-divisors.md    |  18 +-
 .../problem-475-music-festival.md             |  20 +-
 .../problem-476-circle-packing-ii.md          |  18 +-
 .../problem-477-number-sequence-game.md       |  46 ++--
 .../project-euler/problem-478-mixtures.md     |  30 ++-
 .../problem-479-roots-on-the-rise.md          |  20 +-
 .../project-euler/problem-48-self-powers.md   |   2 +-
 .../problem-480-the-last-question.md          | 100 +++-----
 .../problem-49-prime-permutations.md          |   2 +-
 .../problem-5-smallest-multiple.md            |  16 +-
 .../problem-50-consecutive-prime-sum.md       |  92 +++++---
 .../problem-51-prime-digit-replacements.md    | 115 +++++-----
 .../problem-52-permuted-multiples.md          |   2 +-
 .../problem-53-combinatoric-selections.md     |   2 +-
 .../project-euler/problem-54-poker-hands.md   |   2 +-
 .../problem-55-lychrel-numbers.md             |   2 +-
 .../problem-56-powerful-digit-sum.md          |   2 +-
 .../problem-57-square-root-convergents.md     |   2 +-
 .../project-euler/problem-58-spiral-primes.md |   2 +-
 .../problem-59-xor-decryption.md              |   2 +-
 .../problem-6-sum-square-difference.md        |   2 +-
 .../problem-60-prime-pair-sets.md             |   4 +-
 .../problem-61-cyclical-figurate-numbers.md   |   8 +-
 .../problem-62-cubic-permutations.md          |   2 +-
 .../problem-63-powerful-digit-counts.md       |   2 +-
 .../problem-64-odd-period-square-roots.md     |   4 +-
 .../problem-65-convergents-of-e.md            |   2 +-
 .../problem-66-diophantine-equation.md        |  10 +-
 .../problem-67-maximum-path-sum-ii.md         |   2 +-
 .../problem-68-magic-5-gon-ring.md            |   2 +-
 .../problem-69-totient-maximum.md             |   2 +-
 .../project-euler/problem-7-10001st-prime.md  |   2 +-
 .../problem-70-totient-permutation.md         |   2 +-
 .../problem-71-ordered-fractions.md           |   2 +-
 .../problem-72-counting-fractions.md          |   2 +-
 ...roblem-73-counting-fractions-in-a-range.md |   2 +-
 .../problem-74-digit-factorial-chains.md      |  12 +-
 ...lem-75-singular-integer-right-triangles.md |   2 +-
 .../problem-76-counting-summations.md         |   6 +-
 .../problem-77-prime-summations.md            |   2 +-
 .../problem-78-coin-partitions.md             |   2 +-
 .../problem-79-passcode-derivation.md         |   2 +-
 .../problem-8-largest-product-in-a-series.md  |   2 +-
 ...roblem-80-square-root-digital-expansion.md |   2 +-
 .../problem-81-path-sum-two-ways.md           |   6 +-
 .../problem-82-path-sum-three-ways.md         |   6 +-
 .../problem-83-path-sum-four-ways.md          |   8 +-
 .../project-euler/problem-84-monopoly-odds.md |   4 +-
 .../problem-85-counting-rectangles.md         |   2 +-
 .../project-euler/problem-86-cuboid-route.md  |   2 +-
 .../problem-87-prime-power-triples.md         |   2 +-
 .../problem-88-product-sum-numbers.md         |   2 +-
 .../problem-89-roman-numerals.md              |   2 +-
 .../problem-9-special-pythagorean-triplet.md  |   4 +-
 .../problem-90-cube-digit-pairs.md            |   2 +-
 ...ight-triangles-with-integer-coordinates.md |   2 +-
 .../problem-93-arithmetic-expressions.md      |   8 +-
 ...problem-94-almost-equilateral-triangles.md |  18 +-
 .../problem-97-large-non-mersenne-prime.md    |   2 +-
 .../problem-98-anagramic-squares.md           |   2 +-
 .../problem-99-largest-exponential.md         |   2 +-
 .../rosetta-code/24-game.md                   | 141 ++++++++----
 .../9-billion-names-of-god-the-integer.md     |   6 +-
 .../rosetta-code/abc-problem.md               |   2 +-
 ...ient-and-perfect-number-classifications.md |   2 +-
 .../rosetta-code/accumulator-factory.md       |   4 +-
 .../rosetta-code/ackermann-function.md        |   2 +-
 .../rosetta-code/align-columns.md             |  14 +-
 .../rosetta-code/amicable-pairs.md            |  12 +-
 .../rosetta-code/averages-mode.md             |   4 +-
 .../averages-pythagorean-means.md             |   4 +-
 .../rosetta-code/averages-root-mean-square.md |   8 +-
 .../rosetta-code/babbage-problem.md           |   6 +-
 .../rosetta-code/balanced-brackets.md         |  44 ++--
 ...cles-of-given-radius-through-two-points.md |   2 +-
 .../rosetta-code/closest-pair-problem.md      |   2 +-
 .../rosetta-code/combinations.md              |   4 +-
 .../rosetta-code/comma-quibbling.md           |  14 +-
 .../rosetta-code/compare-a-list-of-strings.md |  10 +-
 .../convert-seconds-to-compound-duration.md   |   2 +-
 .../count-occurrences-of-a-substring.md       |   2 +-
 .../rosetta-code/count-the-coins.md           |  34 +--
 .../rosetta-code/cramers-rule.md              |  12 +-
 .../cumulative-standard-deviation.md          |  29 ++-
 .../rosetta-code/cusip.md                     |   2 +-
 .../rosetta-code/cut-a-rectangle.md           |   2 +-
 .../rosetta-code/date-manipulation.md         |   4 +-
 .../rosetta-code/day-of-the-week.md           |   2 +-
 .../rosetta-code/deal-cards-for-freecell.md   |  10 +-
 .../rosetta-code/deepcopy.md                  |   2 +-
 .../define-a-primitive-data-type.md           |   2 +-
 .../rosetta-code/department-numbers.md        |   4 +-
 .../rosetta-code/discordian-date.md           |  21 +-
 .../rosetta-code/dot-product.md               |   4 +-
 .../rosetta-code/element-wise-operations.md   |   2 +-
 .../rosetta-code/emirp-primes.md              |   2 +-
 .../rosetta-code/entropy.md                   |   2 +-
 .../rosetta-code/equilibrium-index.md         |   4 +-
 .../rosetta-code/ethiopian-multiplication.md  |   2 +-
 .../rosetta-code/euler-method.md              |   4 +-
 .../evaluate-binomial-coefficients.md         |   2 +-
 .../execute-a-markov-algorithm.md             | 212 ++++++-----------
 .../rosetta-code/execute-brain.md             |  24 +-
 .../extensible-prime-generator.md             |   4 +-
 .../rosetta-code/factorial.md                 |   4 +-
 .../factors-of-a-mersenne-number.md           |  10 +-
 .../rosetta-code/factors-of-an-integer.md     |   2 +-
 .../rosetta-code/farey-sequence.md            |   4 +-
 .../fibonacci-n-step-number-sequences.md      |   8 +-
 .../rosetta-code/fibonacci-sequence.md        |   2 +-
 .../rosetta-code/fibonacci-word.md            | 114 +++++----
 .../rosetta-code/fizzbuzz.md                  |   2 +-
 .../rosetta-code/fractran.md                  |   4 +-
 .../rosetta-code/gamma-function.md            |   4 +-
 .../rosetta-code/gaussian-elimination.md      |   2 +-
 .../rosetta-code/general-fizzbuzz.md          |   4 +-
 .../generate-lower-case-ascii-alphabet.md     |   2 +-
 .../rosetta-code/generator-exponential.md     |   2 +-
 .../rosetta-code/gray-code.md                 |   8 +-
 .../rosetta-code/greatest-common-divisor.md   |   2 +-
 .../greatest-subsequential-sum.md             |   2 +-
 .../rosetta-code/hailstone-sequence.md        |   6 +-
 .../rosetta-code/happy-numbers.md             |   4 +-
 .../rosetta-code/harshad-or-niven-series.md   |   2 +-
 .../rosetta-code/hash-from-two-arrays.md      |  16 +-
 .../rosetta-code/hash-join.md                 |  12 +-
 .../rosetta-code/heronian-triangles.md        |   4 +-
 .../hofstadter-figure-figure-sequences.md     |  26 +--
 .../rosetta-code/hofstadter-q-sequence.md     |   6 +-
 .../rosetta-code/i-before-e-except-after-c.md |  24 +-
 .../rosetta-code/iban.md                      |  14 +-
 .../rosetta-code/identity-matrix.md           |   2 +-
 .../rosetta-code/iterated-digits-squaring.md  |   2 +-
 .../rosetta-code/jaro-distance.md             |   4 +-
 .../rosetta-code/jortsort.md                  |   4 +-
 .../rosetta-code/josephus-problem.md          |   6 +-
 .../rosetta-code/k-d-tree.md                  |   2 +-
 .../rosetta-code/kaprekar-numbers.md          |  10 +-
 .../rosetta-code/knapsack-problem-0-1.md      |   2 +-
 .../rosetta-code/knapsack-problem-bounded.md  |   2 +-
 .../knapsack-problem-continuous.md            |   2 +-
 .../knapsack-problem-unbounded.md             |   2 +-
 .../rosetta-code/knights-tour.md              |  16 +-
 .../largest-int-from-concatenated-ints.md     |   2 +-
 .../rosetta-code/last-friday-of-each-month.md |   2 +-
 .../rosetta-code/last-letter-first-letter.md  |   2 +-
 .../rosetta-code/leap-year.md                 |   2 +-
 .../rosetta-code/least-common-multiple.md     |   6 +-
 .../rosetta-code/left-factorials.md           |   2 +-
 .../rosetta-code/letter-frequency.md          |   2 +-
 .../rosetta-code/levenshtein-distance.md      |   6 +-
 .../linear-congruential-generator.md          |   6 +-
 .../rosetta-code/long-multiplication.md       |   4 +-
 .../longest-common-subsequence.md             |  22 +-
 .../longest-increasing-subsequence.md         |   8 +-
 .../rosetta-code/longest-string-challenge.md  |   4 +-
 .../rosetta-code/look-and-say-sequence.md     |   4 +-
 ...oop-over-multiple-arrays-simultaneously.md |   2 +-
 .../rosetta-code/lu-decomposition.md          |   6 +-
 .../rosetta-code/lucas-lehmer-test.md         |   2 +-
 .../rosetta-code/ludic-numbers.md             |  26 +--
 .../luhn-test-of-credit-card-numbers.md       |   6 +-
 .../rosetta-code/lychrel-numbers.md           |   4 +-
 .../rosetta-code/lzw-compression.md           |   4 +-
 .../rosetta-code/s-expressions.md             |  16 +-
 .../sailors-coconuts-and-a-monkey-problem.md  |  17 +-
 .../rosetta-code/search-a-list-of-records.md  |   2 +-
 .../rosetta-code/sedols.md                    |  13 +-
 .../rosetta-code/self-describing-numbers.md   |   6 +-
 .../rosetta-code/self-referential-sequence.md |   4 +-
 .../rosetta-code/semiprime.md                 |   4 +-
 .../rosetta-code/set-consolidation.md         |   2 +-
 .../rosetta-code/set-of-real-numbers.md       |   2 +-
 .../rosetta-code/sha-1.md                     |   4 +-
 .../sort-an-array-of-composite-structures.md  |   2 +-
 .../rosetta-code/sort-disjoint-sublist.md     |   2 +-
 .../rosetta-code/sort-stability.md            |   4 +-
 .../sort-using-a-custom-comparator.md         |   2 +-
 .../sorting-algorithms-bead-sort.md           |  38 +--
 .../sorting-algorithms-bogosort.md            |   6 +-
 .../sorting-algorithms-cocktail-sort.md       |  26 +--
 .../sorting-algorithms-comb-sort.md           |  12 +-
 .../sorting-algorithms-gnome-sort.md          |   4 +-
 .../sorting-algorithms-pancake-sort.md        |   4 +-
 .../sorting-algorithms-permutation-sort.md    |   4 +-
 .../sorting-algorithms-shell-sort.md          |   4 +-
 .../sorting-algorithms-stooge-sort.md         |   4 +-
 .../sorting-algorithms-strand-sort.md         |  18 +-
 .../rosetta-code/soundex.md                   |  14 +-
 .../rosetta-code/spiral-matrix.md             |   2 +-
 ...ter-string-based-on-change-of-character.md |   2 +-
 .../rosetta-code/state-name-puzzle.md         |   9 +-
 .../rosetta-code/stern-brocot-sequence.md     |   4 +-
 .../rosetta-code/straddling-checkerboard.md   |  10 +-
 .../rosetta-code/stream-merge.md              |   2 +-
 ...s-and-extended-characters-from-a-string.md |   2 +-
 .../rosetta-code/subleq.md                    |  36 +--
 .../rosetta-code/sudoku.md                    |   4 +-
 .../rosetta-code/sum-digits-of-an-integer.md  |   2 +-
 .../rosetta-code/sum-multiples-of-3-and-5.md  |   2 +-
 .../rosetta-code/sum-of-a-series.md           |   4 +-
 .../rosetta-code/sum-of-squares.md            |   2 +-
 .../rosetta-code/sum-to-100.md                |   2 +-
 .../sutherland-hodgman-polygon-clipping.md    |   4 +-
 .../rosetta-code/symmetric-difference.md      |   8 +-
 .../rosetta-code/taxicab-numbers.md           |  11 +-
 .../tokenize-a-string-with-escaping.md        |   6 +-
 .../rosetta-code/top-rank-per-group.md        |   2 +-
 .../rosetta-code/topological-sort.md          |   2 +-
 .../rosetta-code/towers-of-hanoi.md           |  10 +-
 .../rosetta-code/vector-cross-product.md      |   4 +-
 .../rosetta-code/vector-dot-product.md        |   2 +-
 .../rosetta-code/word-frequency.md            |   4 +-
 .../rosetta-code/word-wrap.md                 |   2 +-
 .../rosetta-code/y-combinator.md              |  12 +-
 .../zeckendorf-number-representation.md       |   2 +-
 .../zhang-suen-thinning-algorithm.md          |  18 +-
 .../rosetta-code/zig-zag-matrix.md            |   6 +-
 .../build-a-camper-leaderboard.md             |   8 +-
 .../build-a-light-bright-app.md               |  20 +-
 .../build-a-nightlife-coordination-app.md     |  12 +-
 .../build-a-pinterest-clone.md                |   8 +-
 .../take-home-projects/build-a-pong-game.md   |  14 +-
 .../take-home-projects/build-a-recipe-box.md  |   6 +-
 .../build-a-roguelike-dungeon-crawler-game.md |   8 +-
 .../take-home-projects/build-a-simon-game.md  |   6 +-
 .../build-a-tic-tac-toe-game.md               |   6 +-
 .../take-home-projects/build-a-voting-app.md  |   2 +-
 .../build-a-wikipedia-viewer.md               |  16 +-
 ...build-an-image-search-abstraction-layer.md |   2 +-
 .../build-the-game-of-life.md                 |  23 +-
 .../chart-the-stock-market.md                 |   2 +-
 .../manage-a-book-trading-club.md             |   6 +-
 .../map-data-across-the-globe.md              |   8 +-
 .../p2p-video-chat-application.md             |   6 +-
 ...-contiguity-with-a-force-directed-graph.md |   6 +-
 .../show-the-local-weather.md                 |   8 +-
 .../use-the-twitch-json-api.md                |  16 +-
 .../book-recommendation-engine-using-knn.md   |  45 +++-
 .../cat-and-dog-image-classifier.md           |  94 +++++++-
 ...near-regression-health-costs-calculator.md |  26 ++-
 .../neural-network-sms-text-classifier.md     |  18 +-
 .../rock-paper-scissors.md                    |  50 +++-
 .../neural-networks-activation-functions.md   |   2 +-
 .../build-a-survey-form.md                    |  12 +-
 .../6148da157cc0bd0d06df5c0a.md               |  14 +-
 .../6148dc095264000dce348bf5.md               |   2 +-
 .../6148dcaaf2e8750e6cb4501a.md               |   2 +-
 .../6148dd31d210990f0fb140f8.md               |   2 +-
 .../6148defa9c01520fb9d178a0.md               |   2 +-
 .../6148dfab9b54c110577de165.md               |   2 +-
 .../6148e0bcc13efd10f7d7a6a9.md               |   2 +-
 .../6148e161ecec9511941f8833.md               |   2 +-
 .../6148e28706b34912340fd042.md               |   2 +-
 .../6148e335c1edd512d00e4691.md               |   2 +-
 .../6148e41c728f65138addf9cc.md               |   2 +-
 .../6148e5aeb102e3142de026a2.md               |   4 +-
 .../5f33294a6af5e9188dbdb8f3.md               |  23 +-
 .../5f332a88dc25a0fd25c7687a.md               |  25 +-
 .../5f332b23c2045fb843337579.md               |  31 +--
 .../5f344f9c805cd193c33d829c.md               |   8 +-
 .../5f344fad8bf01691e71a30eb.md               |   8 +-
 .../5f344fbc22624a2976425065.md               |   8 +-
 .../5f344fc1520b6719f2e35605.md               |  15 +-
 .../5f3477ae34c1239cafe128be.md               |   8 +-
 .../5f3477ae8466a9a3d2cc953c.md               |   8 +-
 .../5f3477ae9675db8bb7655b30.md               |  27 ++-
 .../5f3477aefa51bfc29327200b.md               |   8 +-
 .../5f3477cb2e27333b1ab2b955.md               |   8 +-
 .../5f3477cb303c5cb61b43aa9b.md               |   8 +-
 .../5f3477cbcb6ba47918c1da92.md               |   8 +-
 .../5f34a1fd611d003edeafd681.md               |   8 +-
 .../5f356ed60785e1f3e9850b6e.md               |   8 +-
 .../5f356ed60a5decd94ab66986.md               |   8 +-
 .../5f356ed6199b0cdef1d2be8f.md               |   8 +-
 .../5f356ed63c7807a4f1e6d054.md               |   8 +-
 .../5f356ed63e0fa262326eef05.md               |   8 +-
 .../5f356ed656a336993abd9f7c.md               |   8 +-
 .../5f356ed69db0a491745e2bb6.md               |   8 +-
 .../5f356ed6cf6eab5f15f5cfe6.md               |   8 +-
 .../5f35e5c4321f818cdc4bed30.md               |   8 +-
 .../5f35e5c44359872a137bd98f.md               |   8 +-
 .../5f3c866d0fc037f7311b4ac8.md               |   8 +-
 .../5f3c866d28d7ad0de6470505.md               |   8 +-
 .../5f3c866d5414453fc2d7b480.md               |   8 +-
 .../5f3c866daec9a49519871816.md               |   8 +-
 .../5f3c866dbf362f99b9a0c6d0.md               |   8 +-
 .../5f3c866dd0d0275f01d4d847.md               |   8 +-
 .../5f3c866de7a5b784048f94b1.md               |   8 +-
 .../5f3cade94c6576e7f7b7953f.md               |   8 +-
 .../5f3cade9993019e26313fa8e.md               |   8 +-
 .../5f3cade99dda4e6071a85dfd.md               |   8 +-
 .../5f3cade9fa77275d9f4efe62.md               |   8 +-
 .../5f3ef6e01f288a026d709587.md               |  20 +-
 .../5f3ef6e03d719d5ac4738993.md               |   8 +-
 .../5f3ef6e04559b939080db057.md               |   8 +-
 .../5f3ef6e050279c7a4a7101d3.md               |   8 +-
 .../5f3ef6e05473f91f948724ab.md               |   8 +-
 .../5f3ef6e056bdde6ae6892ba2.md               |   8 +-
 .../5f3ef6e06d34faac0447fc44.md               |   8 +-
 .../5f3ef6e07276f782bb46b93d.md               |  10 +-
 .../5f3ef6e0819d4f23ca7285e6.md               |   8 +-
 .../5f3ef6e087d56ed3ffdc36be.md               |   8 +-
 .../5f3ef6e0a81099d9a697b550.md               |   8 +-
 .../5f3ef6e0b431cc215bb16f55.md               |   8 +-
 .../5f3ef6e0e0c3feaebcf647ad.md               |   8 +-
 .../5f3ef6e0e9629bad967cd71e.md               |   8 +-
 .../5f3ef6e0eaa7da26e3d34d78.md               |   8 +-
 .../5f3ef6e0f8c230bdd2349716.md               |   8 +-
 .../5f3f26fa39591db45e5cd7a0.md               |  10 +-
 .../5f459225127805351a6ad057.md               |  10 +-
 .../5f459a7ceb8b5c446656d88b.md               |  10 +-
 .../5f459cf202c2a3472fae6a9f.md               |  10 +-
 .../5f459fd48bdc98491ca6d1a3.md               |  12 +-
 .../5f45a05977e2fa49d9119437.md               |  10 +-
 .../5f45a276c093334f0f6e9df4.md               |  10 +-
 .../5f45a5a7c49a8251f0bdb527.md               |  10 +-
 .../5f45a66d4a2b0453301e5a26.md               |  10 +-
 .../5f45b0731d39e15d54df4dfc.md               |  10 +-
 .../5f45b25e7ec2405f166b9de1.md               |  10 +-
 .../5f45b3c93c027860d9298dbd.md               |  10 +-
 .../5f45b45d099f3e621fbbb256.md               |  10 +-
 .../5f45b4c81cea7763550e40df.md               |  10 +-
 .../5f45b715301bbf667badc04a.md               |  10 +-
 .../5f46e270702a8456a664f0df.md               |  10 +-
 .../5f46e36e745ead58487aabf2.md               |  10 +-
 .../5f46e7a4750dd05b5a673920.md               |  10 +-
 .../5f46e8284aae155c83015dee.md               |  10 +-
 .../5f46ede1ff8fec5ba656b44c.md               |  10 +-
 .../5f46fc57528aa1c4b5ea7c2e.md               |  10 +-
 .../5f4701b942c824109626c3d8.md               |  10 +-
 .../5f475bb508746c16c9431d42.md               |  10 +-
 .../5f475e1c7f71a61d913836c6.md               |  10 +-
 .../5f47633757ae3469f2d33d2e.md               |   8 +-
 .../5f47fe7e31980053a8d4403b.md               |  16 +-
 .../5f716ad029ee4053c7027a7a.md               |   8 +-
 .../5f716bee5838c354c728a7c5.md               |   8 +-
 .../5f7691dafd882520797cd2f0.md               |   8 +-
 .../5f7692f7c5b3ce22a57788b6.md               |   8 +-
 .../5f769541be494f25449b292f.md               |   8 +-
 .../5f76967fad478126d6552b0d.md               |   8 +-
 .../5f769702e6e33127d14aa120.md               |   8 +-
 .../5f7b87422a560036fd03ccff.md               |   8 +-
 .../5f7b88d37b1f98386f04edc0.md               |   8 +-
 .../616965351e74d4689eb6de30.md               |  13 +-
 .../6153a3952facd25a83fe8083.md               |   2 +-
 .../5dc2385ff86c76b9248c6eb7.md               |  12 +-
 .../5dc23991f86c76b9248c6eb8.md               |  10 +-
 .../5dc23f9bf86c76b9248c6eba.md               |   2 +-
 .../5dc24073f86c76b9248c6ebb.md               |   2 +-
 .../5dc24165f86c76b9248c6ebc.md               |   2 +-
 .../5dc24614f86c76b9248c6ebd.md               |   2 +-
 .../5ddbd81294d8ddc1510a8e56.md               |   8 +-
 .../5dfa22d1b521be39a3de7be0.md               |  11 +-
 .../5dfa2407b521be39a3de7be1.md               |   2 +-
 .../5dfa30b9eacea3f48c6300ad.md               |   2 +-
 .../5dfa3589eacea3f48c6300ae.md               |   2 +-
 .../5dfa371beacea3f48c6300af.md               |   2 +-
 .../5dfa37b9eacea3f48c6300b0.md               |   4 +-
 .../5dfb5ecbeacea3f48c6300b1.md               |   2 +-
 .../5dfb6250eacea3f48c6300b2.md               |   2 +-
 .../5dfb655eeacea3f48c6300b3.md               |   6 +-
 .../5dfb6a35eacea3f48c6300b4.md               |   2 +-
 .../5ef9b03c81a63668521804d0.md               |   2 +-
 .../5ef9b03c81a63668521804d1.md               |   2 +-
 .../5ef9b03c81a63668521804d2.md               |   2 +-
 .../5ef9b03c81a63668521804d3.md               |   2 +-
 .../5ef9b03c81a63668521804d4.md               |   2 +-
 .../5ef9b03c81a63668521804d5.md               |   2 +-
 .../5ef9b03c81a63668521804d6.md               |   2 +-
 .../5ef9b03c81a63668521804d7.md               |   2 +-
 .../5ef9b03c81a63668521804d8.md               |   2 +-
 .../5ef9b03c81a63668521804d9.md               |   2 +-
 .../5ef9b03c81a63668521804da.md               |   2 +-
 .../5ef9b03c81a63668521804db.md               |   2 +-
 .../5ef9b03c81a63668521804dc.md               |   2 +-
 .../5ef9b03c81a63668521804dd.md               |   2 +-
 .../5ef9b03c81a63668521804de.md               |   2 +-
 .../5ef9b03c81a63668521804df.md               |   2 +-
 .../5ef9b03c81a63668521804e1.md               |   2 +-
 .../5ef9b03c81a63668521804e2.md               |   2 +-
 .../5ef9b03c81a63668521804e3.md               |   2 +-
 .../5ef9b03c81a63668521804e5.md               |   2 +-
 .../5ef9b03c81a63668521804e7.md               |   2 +-
 .../5ef9b03c81a63668521804e8.md               |   2 +-
 .../5ef9b03c81a63668521804e9.md               |   2 +-
 .../5ef9b03c81a63668521804ea.md               |   2 +-
 .../5ef9b03c81a63668521804eb.md               |   2 +-
 .../5ef9b03c81a63668521804ec.md               |   2 +-
 .../5ef9b03c81a63668521804ee.md               |   2 +-
 .../5efada803cbd2bbdab94e332.md               |   2 +-
 .../5efae0543cbd2bbdab94e333.md               |   2 +-
 .../5efae16e3cbd2bbdab94e334.md               |   2 +-
 .../5efb23e70dc218d6c85f89b1.md               |   2 +-
 .../5efb2c990dc218d6c85f89b2.md               |   2 +-
 .../5efc4f528d6a74d05e68af74.md               |   2 +-
 .../5efc518e8d6a74d05e68af75.md               |   2 +-
 .../5efc54138d6a74d05e68af76.md               |   2 +-
 .../5efc575c8d6a74d05e68af77.md               |   2 +-
 .../5f05a1d8e233dff4a68508d8.md               |   2 +-
 .../5f07be6ef7412fbad0c5626b.md               |  18 +-
 .../5f07c98cdb9413cbd4b16750.md               |   2 +-
 .../5f07fb1579dc934717801375.md               |  52 ++---
 .../5f0d48e7b435f13ab6550051.md               |   2 +-
 .../5f0d4ab1b435f13ab6550052.md               |   2 +-
 .../5f0d4d04b435f13ab6550053.md               |   2 +-
 .../5f1a80975fc4bcae0edb3497.md               |   2 +-
 .../5f1a89f1190aff21ae42105a.md               |   2 +-
 .../62bb4009e3458a128ff57d5d.md               |   4 +-
 .../62dabe2ef403a12d5d295273.md               |   2 +-
 .../7cf9b03d81a65668421804c3.md               |   2 +-
 .../60f1922fcbd2410527b3bd89.md               |   9 +-
 .../60f803d5241e6a0433a523a1.md               |   9 +-
 .../62a3cfc8328d3351b95d4f61.md               |   2 +-
 .../62a8aa98a8289d0a698eee1d.md               |   2 +-
 .../62a8cbd1e3595431d5a2b3f1.md               |   2 +-
 .../62a8ce73d0dce43468f6689c.md               |   4 +-
 .../62a8cf22272d6d35af80d4ac.md               |   2 +-
 .../62a8d0337d7c67377a4a76c6.md               |   6 +-
 .../62a8d08668fa8b38732486e9.md               |   2 +-
 .../62a8d61ddfe35744369365b7.md               |   6 +-
 .../62a8d6c7001ebc45350e3d16.md               |   4 +-
 .../62a8e35675c18c56354c08cf.md               |   6 +-
 .../62a8e41e2f190c58404dd46e.md               |   4 +-
 .../62a8ed36d7a7915dfa444ba2.md               |   2 +-
 .../62a8edd05e27cc668051686f.md               |   2 +-
 .../62a8eec45f77bc69e8775294.md               |   2 +-
 .../62a8ef8f0c76a46cd221a68c.md               |   2 +-
 .../62a8efb0e3ce826db8daf80f.md               |   2 +-
 .../62a8eff21c0b0f6ebe5b8e38.md               |   2 +-
 .../62aa204c1e1d33348ff09944.md               |   2 +-
 .../62aa20e9cf1be9358f5aceae.md               |   4 +-
 .../62aa226207f33d3ad4c6f546.md               |   6 +-
 .../62aa264d23cdaa45a20efada.md               |   2 +-
 .../62aa27227399d647e1c37a3c.md               |   4 +-
 .../62aa27560def7048d7b4a095.md               |   2 +-
 .../62aa27c40ca6f04ab8be5fac.md               |   2 +-
 .../build-a-survey-form.md                    |   2 +-
 .../falsy-bouncer.md                          |  10 +-
 ...-one-decimal-by-another-with-javascript.md |   6 -
 .../escape-sequences-in-strings.md            |  12 +-
 ...-variables-with-the-assignment-operator.md |   6 -
 .../quoting-strings-with-single-quotes.md     |   6 -
 .../basic-javascript/stand-in-line.md         |   4 +-
 .../use-recursion-to-create-a-countdown.md    |   7 +
 ...-recursion-to-create-a-range-of-numbers.md |   7 +
 ...syntax-to-define-a-constructor-function.md |  31 ++-
 ...-concise-declarative-functions-with-es6.md |   3 +-
 ...f-an-array-using-concat-instead-of-push.md |  10 +-
 .../make-a-person.md                          |   8 -
 .../steamroller.md                            |   7 +
 .../sum-all-primes.md                         |  56 +++--
 .../add-methods-after-inheritance.md          |  48 +++-
 .../build-a-25-5-clock.md                     |   2 +-
 .../build-a-drum-machine.md                   |   2 +-
 .../build-a-javascript-calculator.md          |   2 +-
 .../build-a-markdown-previewer.md             |   2 +-
 .../build-a-random-quote-machine.md           |   2 +-
 .../visualize-data-with-a-bar-chart.md        |   2 +-
 .../visualize-data-with-a-choropleth-map.md   |   2 +-
 .../visualize-data-with-a-heat-map.md         |   2 +-
 ...visualize-data-with-a-scatterplot-graph.md |   2 +-
 .../visualize-data-with-a-treemap-diagram.md  |   2 +-
 .../mongodb-and-mongoose/create-a-model.md    |   2 +-
 ...ality-with-.deepequal-and-.notdeepequal.md |   2 +-
 .../port-scanner.md                           |  82 +++++--
 .../sha-1-password-cracker.md                 |  59 +++--
 .../stock-price-checker.md                    |  24 +-
 ...ur-site-via-https-only-with-helmet.hsts.md |  14 +-
 ...-response-mime-type-with-helmet.nosniff.md |   2 +-
 ...lmet-using-the-parent-helmet-middleware.md |   4 +-
 ...client-side-caching-with-helmet.nocache.md |   2 +-
 ...fetching-with-helmet.dnsprefetchcontrol.md |   4 +-
 ...sh-and-compare-passwords-asynchronously.md |   8 +-
 ...-information-using-helmet.hidepoweredby.md |   2 +-
 ...-of-clickjacking-with-helmet.frameguard.md |   2 +-
 ...pting-xss-attacks-with-helmet.xssfilter.md |   2 +-
 ...ing-untrusted-html-with-helmet.ienoopen.md |   2 +-
 ...olicy-with-helmet.contentsecuritypolicy.md |   2 +-
 .../understand-bcrypt-hashes.md               |  10 +-
 .../remove-an-element-from-a-max-heap.md      |  46 ++--
 ...th-first-search-in-a-binary-search-tree.md |   6 +-
 .../problem-10-summation-of-primes.md         |  54 +++--
 .../problem-100-arranged-probability.md       |   2 +-
 .../problem-101-optimum-polynomial.md         |   6 +-
 .../problem-102-triangle-containment.md       |   2 +-
 ...problem-103-special-subset-sums-optimum.md |   7 +-
 .../problem-104-pandigital-fibonacci-ends.md  |   2 +-
 ...problem-105-special-subset-sums-testing.md |   2 +-
 ...em-106-special-subset-sums-meta-testing.md |   4 +-
 .../problem-107-minimal-network.md            |   4 +-
 .../problem-108-diophantine-reciprocals-i.md  |   6 +-
 .../project-euler/problem-109-darts.md        |   9 +-
 .../problem-110-diophantine-reciprocals-ii.md |   2 +-
 .../problem-111-primes-with-runs.md           |   2 +-
 .../problem-112-bouncy-numbers.md             |   2 +-
 .../problem-113-non-bouncy-numbers.md         |   2 +-
 ...oblem-114-counting-block-combinations-i.md |   2 +-
 ...blem-115-counting-block-combinations-ii.md |   2 +-
 .../problem-116-red-green-or-blue-tiles.md    |   2 +-
 .../problem-117-red-green-and-blue-tiles.md   |   2 +-
 .../problem-118-pandigital-prime-sets.md      |   4 +-
 .../problem-119-digit-power-sum.md            |   4 +-
 .../problem-120-square-remainders.md          |   2 +-
 .../problem-121-disc-game-prize-fund.md       |  10 +-
 .../problem-122-efficient-exponentiation.md   |  27 ++-
 .../problem-123-prime-square-remainders.md    |  18 +-
 .../problem-124-ordered-radicals.md           | 138 ++++++++---
 .../problem-126-cuboid-layers.md              |  22 +-
 .../project-euler/problem-127-abc-hits.md     |  38 ++-
 .../problem-128-hexagonal-tile-differences.md |  78 ++++++-
 .../problem-129-repunit-divisibility.md       |  18 +-
 ...-composites-with-prime-repunit-property.md |  18 +-
 .../problem-131-prime-cube-partnership.md     |  16 +-
 .../problem-133-repunit-nonfactors.md         |  18 +-
 .../problem-134-prime-pair-connection.md      |  16 +-
 .../problem-135-same-differences.md           |  18 +-
 .../problem-136-singleton-difference.md       |  18 +-
 .../problem-137-fibonacci-golden-nuggets.md   |  35 +--
 .../problem-139-pythagorean-tiles.md          |  16 +-
 ...m-140-modified-fibonacci-golden-nuggets.md |  26 ++-
 ...ressive-numbers-n-which-are-also-square.md |  20 +-
 .../problem-142-perfect-square-collection.md  |  12 +-
 ...ting-the-torricelli-point-of-a-triangle.md |  18 +-
 ...ng-multiple-reflections-of-a-laser-beam.md |  31 ++-
 ...ble-numbers-are-there-below-one-billion.md |  14 +-
 ...oblem-146-investigating-a-prime-pattern.md |  14 +-
 ...m-147-rectangles-in-cross-hatched-grids.md |  16 +-
 .../problem-148-exploring-pascals-triangle.md |  16 +-
 ...searching-for-a-maximum-sum-subsequence.md |  22 +-
 ...y-for-a-sub-triangle-having-minimum-sum.md |  26 ++-
 ...tandard-sizes-an-expected-value-problem.md |  18 +-
 ...ng-one-half-as-a-sum-of-inverse-squares.md |  18 +-
 ...lem-153-investigating-gaussian-integers.md |  56 +++--
 .../problem-154-exploring-pascals-pyramid.md  |  18 +-
 ...problem-155-counting-capacitor-circuits.md |  22 +-
 .../problem-156-counting-digits.md            |  38 ++-
 ...em-157-solving-the-diophantine-equation.md |  59 +----
 ...hically-after-its-neighbour-to-the-left.md |  20 +-
 ...159-digital-root-sums-of-factorisations.md |  27 ++-
 .../problem-160-factorial-trailing-digits.md  |  23 +-
 .../project-euler/problem-161-triominoes.md   |  16 +-
 .../problem-162-hexadecimal-numbers.md        |  24 +-
 .../problem-163-cross-hatched-triangles.md    |  23 +-
 ...s-have-a-sum-greater-than-a-given-value.md |  14 +-
 .../problem-165-intersections.md              |  38 ++-
 .../project-euler/problem-166-criss-cross.md  |  18 +-
 ...roblem-167-investigating-ulam-sequences.md |  22 +-
 .../problem-168-number-rotations.md           |  56 ++++-
 ...an-be-expressed-as-a-sum-of-powers-of-2.md |  26 +--
 ...can-be-formed-by-concatenating-products.md |  15 +-
 ...f-the-squares-of-the-digits-is-a-square.md |  22 +-
 ...gating-numbers-with-few-repeated-digits.md |  12 +-
 ...ent-hollow-square-laminae-can-be-formed.md |  12 +-
 ...one-two-three-...-distinct-arrangements.md |  18 +-
 ...an-be-expressed-as-a-sum-of-powers-of-2.md |  34 ++-
 ...-angled-triangles-that-share-a-cathetus.md |  10 +-
 ...oblem-177-integer-angled-quadrilaterals.md |  20 +-
 .../project-euler/problem-178-step-numbers.md |  12 +-
 ...oblem-179-consecutive-positive-divisors.md |  12 +-
 ...-zeros-of-a-function-of-three-variables.md |  27 ++-
 ...of-two-different-colours-can-be-grouped.md |  18 +-
 .../problem-182-rsa-encryption.md             |   2 +-
 .../problem-183-maximum-product-of-parts.md   |  28 +--
 ...lem-184-triangles-containing-the-origin.md |  20 +-
 .../project-euler/problem-185-number-mind.md  |  32 ++-
 .../problem-186-connectedness-of-a-network.md |  27 ++-
 .../project-euler/problem-187-semiprimes.md   |  12 +-
 ...188-the-hyperexponentiation-of-a-number.md |  18 +-
 ...lem-189-tri-colouring-a-triangular-grid.md |  14 +-
 ...oblem-190-maximising-a-weighted-product.md |  16 +-
 .../problem-192-best-approximations.md        |  20 +-
 .../problem-193-squarefree-numbers.md         |  14 +-
 .../problem-194-coloured-configurations.md    |  22 +-
 ...-triangles-with-one-angle-of-60-degrees.md |  22 +-
 ...viour-of-a-recursively-defined-sequence.md |  16 +-
 .../problem-198-ambiguous-numbers.md          |  16 +-
 .../problem-199-iterative-circle-packing.md   |   8 +-
 ...ontaining-the-contiguous-sub-string-200.md |  18 +-
 .../problem-201-subsets-with-a-unique-sum.md  |  32 ++-
 .../project-euler/problem-202-laserbeam.md    |  18 +-
 ...em-203-squarefree-binomial-coefficients.md |  18 +-
 ...problem-204-generalised-hamming-numbers.md |  16 +-
 .../project-euler/problem-205-dice-game.md    |  10 +-
 .../problem-206-concealed-square.md           |  39 +++-
 ...problem-207-integer-partition-equations.md |  30 ++-
 .../project-euler/problem-208-robot-walks.md  |  16 +-
 .../problem-209-circular-logic.md             |  32 ++-
 .../problem-210-obtuse-angled-triangles.md    |  20 +-
 .../problem-211-divisor-square-sum.md         |  16 +-
 .../problem-212-combined-volume-of-cuboids.md |  31 +--
 .../project-euler/problem-213-flea-circus.md  |  10 +-
 .../problem-214-totient-chains.md             |  24 +-
 .../problem-215-crack-free-walls.md           |  16 +-
 ...-primality-of-numbers-of-the-form-2n2-1.md |  18 +-
 .../problem-217-balanced-numbers.md           |  18 +-
 ...blem-218-perfect-right-angled-triangles.md |  28 ++-
 .../problem-220-heighway-dragon.md            |  29 ++-
 .../problem-221-alexandrian-integers.md       |  21 +-
 .../problem-222-sphere-packing.md             |  12 +-
 ...lem-223-almost-right-angled-triangles-i.md |  14 +-
 ...em-224-almost-right-angled-triangles-ii.md |  14 +-
 .../problem-225-tribonacci-non-divisors.md    |  16 +-
 .../problem-226-a-scoop-of-blancmange.md      |  20 +-
 .../project-euler/problem-227-the-chase.md    |  20 +-
 .../problem-228-minkowski-sums.md             |  33 ++-
 ...-229-four-representations-using-squares.md |  28 ++-
 .../problem-230-fibonacci-words.md            |  38 +--
 ...-factorisation-of-binomial-coefficients.md |  20 +-
 .../project-euler/problem-232-the-race.md     |  20 +-
 .../problem-233-lattice-points-on-a-circle.md |  16 +-
 .../problem-234-semidivisible-numbers.md      |  20 +-
 ...em-235-an-arithmetic-geometric-sequence.md |  16 +-
 .../problem-236-luxury-hampers.md             |  35 ++-
 ...blem-237-tours-on-a-4-x-n-playing-board.md |  27 ++-
 .../problem-238-infinite-string-tour.md       |  31 +--
 .../problem-239-twenty-two-foolish-primes.md  |  10 +-
 .../project-euler/problem-240-top-dice.md     |  20 +-
 .../problem-241-perfection-quotients.md       |  18 +-
 .../project-euler/problem-242-odd-triplets.md |  18 +-
 .../project-euler/problem-243-resilience.md   |  22 +-
 .../project-euler/problem-244-sliders.md      |  26 ++-
 .../project-euler/problem-245-coresilience.md |  22 +-
 .../problem-246-tangents-to-an-ellipse.md     |  28 ++-
 .../problem-247-squares-under-a-hyperbola.md  |  30 ++-
 ...which-eulers-totient-function-equals-13.md |  14 +-
 .../problem-249-prime-subset-sums.md          |  14 +-
 .../project-euler/problem-250-250250.md       |  12 +-
 .../problem-251-cardano-triplets.md           |  18 +-
 .../project-euler/problem-252-convex-holes.md |  17 +-
 .../project-euler/problem-253-tidying-up.md   |  43 ++--
 .../problem-254-sums-of-digit-factorials.md   |  22 +-
 .../problem-255-rounded-square-roots.md       |  41 +++-
 .../problem-256-tatami-free-rooms.md          |  24 +-
 .../problem-257-angular-bisectors.md          |  20 +-
 ...problem-258-a-lagged-fibonacci-sequence.md |  15 +-
 .../problem-259-reachable-numbers.md          |  19 +-
 .../project-euler/problem-260-stone-game.md   |  32 ++-
 .../problem-261-pivotal-square-sums.md        |  22 +-
 .../problem-262-mountain-range.md             |  22 +-
 ...roblem-263-an-engineers-dream-come-true.md |  19 +-
 .../problem-264-triangle-centres.md           |  43 ++--
 .../problem-265-binary-circles.md             |  25 +-
 .../problem-266-pseudo-square-root.md         |  16 +-
 .../project-euler/problem-267-billionaire.md  |  16 +-
 ...ur-distinct-prime-factors-less-than-100.md |  12 +-
 ...ynomials-with-at-least-one-integer-root.md |  28 ++-
 .../problem-27-quadratic-primes.md            |  30 +--
 .../problem-270-cutting-squares.md            |  24 +-
 .../problem-271-modular-cubes-part-1.md       |  16 +-
 .../problem-272-modular-cubes-part-2.md       |  16 +-
 .../problem-273-sum-of-squares.md             |  22 +-
 .../problem-274-divisibility-multipliers.md   |  24 +-
 .../problem-275-balanced-sculptures.md        |  27 +--
 ...problem-277-a-modified-collatz-sequence.md |  30 +--
 ...m-278-linear-combinations-of-semiprimes.md |  18 +-
 ...th-integral-sides-and-an-integral-angle.md |  12 +-
 .../problem-28-number-spiral-diagonals.md     |  20 +-
 .../problem-280-ant-and-seeds.md              |  10 +-
 .../problem-281-pizza-toppings.md             |  20 +-
 .../problem-282-the-ackermann-function.md     |  19 +-
 ...h-the-area--perimeter-ratio-is-integral.md |  16 +-
 .../problem-284-steady-squares.md             |  24 +-
 .../problem-285-pythagorean-odds.md           |  20 +-
 .../problem-286-scoring-probabilities.md      |  16 +-
 ...encoding-a-simple-compression-algorithm.md |  35 +--
 .../problem-288-an-enormous-factorial.md      |  23 +-
 .../problem-289-eulerian-cycles.md            |  24 +-
 .../problem-29-distinct-powers.md             |   6 +-
 .../problem-290-digital-signature.md          |  12 +-
 .../problem-291-panaitopol-primes.md          |  14 +-
 .../problem-292-pythagorean-polygons.md       |  25 +-
 .../problem-293-pseudo-fortunate-numbers.md   |  20 +-
 ...oblem-294-sum-of-digits---experience-23.md |  21 +-
 .../problem-295-lenticular-holes.md           |  31 +--
 ...roblem-296-angular-bisector-and-tangent.md |  18 +-
 .../problem-297-zeckendorf-representation.md  |  22 +-
 .../problem-298-selective-amnesia.md          |  27 ++-
 .../problem-299-three-similar-triangles.md    |  30 ++-
 .../problem-30-digit-n-powers.md              |   2 +-
 .../problem-300-protein-folding.md            |  22 +-
 .../project-euler/problem-301-nim.md          |  33 +--
 .../problem-302-strong-achilles-numbers.md    |  24 +-
 ...problem-303-multiples-with-small-digits.md |  18 +-
 .../project-euler/problem-304-primonacci.md   |  20 +-
 .../problem-305-reflexive-position.md         |  20 +-
 .../problem-306-paper-strip-game.md           |  26 ++-
 .../project-euler/problem-307-chip-defects.md |  18 +-
 ...8-an-amazing-prime-generating-automaton.md |  24 +-
 .../problem-309-integer-ladders.md            |  20 +-
 .../project-euler/problem-31-coin-sums.md     |   2 +-
 .../project-euler/problem-310-nim-square.md   |  16 +-
 ...em-311-biclinic-integral-quadrilaterals.md |  24 +-
 ...em-312-cyclic-paths-on-sierpiski-graphs.md |  27 ++-
 .../project-euler/problem-313-sliding-game.md |  20 +-
 .../problem-314-the-mouse-on-the-moon.md      |  22 +-
 .../problem-315-digital-root-clocks.md        |  36 ++-
 ...oblem-316-numbers-in-decimal-expansions.md |  32 ++-
 .../project-euler/problem-317-firecracker.md  |  16 +-
 .../project-euler/problem-318-2011-nines.md   |  46 ++--
 .../problem-319-bounded-sequences.md          |  24 +-
 .../problem-32-pandigital-products.md         |   2 +-
 ...-factorials-divisible-by-a-huge-integer.md |  18 +-
 .../problem-321-swapping-counters.md          |  22 +-
 ...2-binomial-coefficients-divisible-by-10.md |  16 +-
 ...itwise-or-operations-on-random-integers.md |  23 +-
 .../problem-324-building-a-tower.md           |  20 +-
 .../problem-325-stone-game-ii.md              |  18 +-
 .../problem-326-modulo-summations.md          |  24 +-
 .../problem-327-rooms-of-doom.md              |  28 ++-
 .../problem-328-lowest-cost-search.md         |  32 +--
 .../project-euler/problem-329-prime-frog.md   |  22 +-
 .../problem-33-digit-cancelling-fractions.md  |   2 +-
 .../problem-330-eulers-number.md              |  30 +--
 .../project-euler/problem-331-cross-flips.md  |  22 +-
 .../problem-332-spherical-triangles.md        |  24 +-
 .../problem-333-special-partitions.md         |  27 ++-
 .../problem-334-spilling-the-beans.md         |  23 +-
 .../problem-335-gathering-the-beans.md        |  16 +-
 .../problem-336-maximix-arrangements.md       |  32 ++-
 ...problem-337-totient-stairstep-sequences.md |  26 +--
 ...blem-338-cutting-rectangular-grid-paper.md |  24 +-
 .../problem-339-peredur-fab-efrawg.md         |  18 +-
 .../problem-34-digit-factorials.md            |  10 +-
 .../problem-340-crazy-function.md             |  23 +-
 ...em-341-golombs-self-describing-sequence.md |  21 +-
 ...m-342-the-totient-of-a-square-is-a-cube.md |  17 +-
 .../problem-343-fractional-sequences.md       |  31 ++-
 .../problem-344-silver-dollar-game.md         |  18 +-
 .../project-euler/problem-345-matrix-sum.md   |  27 ++-
 .../problem-346-strong-repunits.md            |  16 +-
 ...largest-integer-divisible-by-two-primes.md |  22 +-
 .../problem-348-sum-of-a-square-and-a-cube.md |  18 +-
 .../project-euler/problem-349-langtons-ant.md |  17 +-
 .../problem-35-circular-primes.md             |   2 +-
 ...e-least-greatest-and-the-greatest-least.md |  24 +-
 .../problem-351-hexagonal-orchards.md         |  20 +-
 .../project-euler/problem-352-blood-tests.md  |  38 ++-
 .../project-euler/problem-353-risky-moon.md   |  26 ++-
 ...oblem-354-distances-in-a-bees-honeycomb.md |  18 +-
 .../problem-355-maximal-coprime-subset.md     |  16 +-
 ...-356-largest-roots-of-cubic-polynomials.md |  18 +-
 .../problem-357-prime-generating-integers.md  |  16 +-
 .../problem-358-cyclic-numbers.md             |  29 ++-
 .../problem-359-hilberts-new-hotel.md         |  32 ++-
 .../problem-36-double-base-palindromes.md     |   2 +-
 .../project-euler/problem-360-scary-sphere.md |  22 +-
 ...-361-subsequence-of-thue-morse-sequence.md |  31 +--
 .../problem-362-squarefree-factors.md         |  22 +-
 .../project-euler/problem-363-bzier-curves.md |  30 ++-
 .../problem-364-comfortable-distance.md       |  24 +-
 ...problem-365-a-huge-binomial-coefficient.md |  16 +-
 .../problem-366-stone-game-iii.md             |  34 ++-
 .../project-euler/problem-367-bozo-sort.md    |  28 ++-
 .../problem-368-a-kempner-like-series.md      |  19 +-
 .../project-euler/problem-369-badugi.md       |  14 +-
 .../problem-37-truncatable-primes.md          |   2 +-
 .../problem-370-geometric-triangles.md        |  18 +-
 .../problem-371-licence-plates.md             |  16 +-
 .../problem-372-pencils-of-rays.md            |  18 +-
 .../problem-373-circumscribed-circles.md      |  20 +-
 ...m-374-maximum-integer-partition-product.md |  28 +--
 .../problem-375-minimum-of-subsequences.md    |  29 +--
 ...problem-377-sum-of-digits-experience-13.md |  20 +-
 .../problem-378-triangle-triples.md           |  24 +-
 ...problem-379-least-common-multiple-count.md |  18 +-
 .../problem-38-pandigital-multiples.md        |   6 +-
 .../problem-380-amazing-mazes.md              |  28 ++-
 .../problem-381-prime-k-factorial.md          |  22 +-
 .../problem-382-generating-polygons.md        |  37 ++-
 ...isibility-comparison-between-factorials.md |  20 +-
 .../problem-384-rudin-shapiro-sequence.md     |  39 ++--
 .../problem-385-ellipses-inside-triangles.md  |  30 +--
 ...blem-386-maximum-length-of-an-antichain.md |  24 +-
 .../problem-387-harshad-numbers.md            |  18 +-
 .../problem-388-distinct-lines.md             |  18 +-
 .../problem-389-platonic-dice.md              |  22 +-
 .../problem-39-integer-right-triangles.md     |   2 +-
 ...th-non-rational-sides-and-integral-area.md |  22 +-
 .../project-euler/problem-391-hopping-game.md |  33 +--
 .../problem-392-enmeshed-unit-circle.md       |  28 ++-
 .../problem-393-migrating-ants.md             |  18 +-
 .../project-euler/problem-394-eating-pie.md   |  23 +-
 .../problem-395-pythagorean-tree.md           |  18 +-
 .../problem-396-weak-goodstein-sequence.md    |  32 ++-
 .../problem-397-triangle-on-parabola.md       |  18 +-
 .../project-euler/problem-398-cutting-rope.md |  16 +-
 ...roblem-399-squarefree-fibonacci-numbers.md |  28 ++-
 .../problem-40-champernownes-constant.md      |   2 +-
 .../problem-400-fibonacci-tree-game.md        |  28 +--
 .../problem-401-sum-of-squares-of-divisors.md |  20 +-
 .../problem-402-integer-valued-polynomials.md |  25 +-
 ...ce-points-enclosed-by-parabola-and-line.md |  20 +-
 .../problem-404-crisscross-ellipses.md        |  28 ++-
 .../problem-405-a-rectangular-tiling.md       |  24 +-
 .../problem-406-guessing-game.md              |  42 ++--
 .../project-euler/problem-407-idempotents.md  |  18 +-
 ...lem-408-admissible-paths-through-a-grid.md |  18 +-
 .../project-euler/problem-409-nim-extreme.md  |  24 +-
 .../problem-41-pandigital-prime.md            |   2 +-
 .../problem-410-circle-and-tangent-line.md    |  20 +-
 .../project-euler/problem-411-uphill-paths.md |  24 +-
 .../problem-412-gnomon-numbering.md           |  26 ++-
 .../problem-413-one-child-numbers.md          |  20 +-
 .../problem-414-kaprekar-constant.md          |  32 +--
 .../project-euler/problem-416-a-frogs-trip.md |  18 +-
 .../problem-417-reciprocal-cycles-ii.md       |  23 +-
 .../problem-418-factorisation-triples.md      |  21 +-
 .../problem-419-look-and-say-sequence.md      |  31 ++-
 .../problem-42-coded-triangle-numbers.md      |   2 +-
 ...problem-420-2x2-positive-integer-matrix.md |  27 ++-
 .../problem-421-prime-factors-of-n151.md      |  26 ++-
 ...m-422-sequence-of-points-on-a-hyperbola.md |  28 ++-
 .../problem-423-consecutive-die-throws.md     |  33 ++-
 .../project-euler/problem-424-kakuro.md       |  43 +++-
 .../problem-425-prime-connection.md           |  27 ++-
 .../problem-426-box-ball-system.md            |  27 ++-
 .../project-euler/problem-427-n-sequences.md  |  22 +-
 .../problem-428-necklace-of-circles.md        |  27 ++-
 ...-429-sum-of-squares-of-unitary-divisors.md |  20 +-
 .../problem-43-sub-string-divisibility.md     |   2 +-
 .../project-euler/problem-430-range-flips.md  |  22 +-
 .../problem-431-square-space-silo.md          |  20 +-
 .../project-euler/problem-432-totient-sum.md  |  16 +-
 .../project-euler/problem-434-rigid-graphs.md |  30 ++-
 ...em-435-polynomials-of-fibonacci-numbers.md |  18 +-
 .../project-euler/problem-436-unfair-wager.md |  24 +-
 .../problem-437-fibonacci-primitive-roots.md  |  36 ++-
 ...-part-of-polynomial-equations-solutions.md |  25 +-
 .../problem-439-sum-of-sum-of-divisors.md     |  20 +-
 .../problem-44-pentagon-numbers.md            |   2 +-
 .../problem-440-gcd-and-tiling.md             |  31 ++-
 ...he-inverse-summation-of-coprime-couples.md |  22 +-
 .../problem-442-eleven-free-integers.md       |  14 +-
 .../project-euler/problem-443-gcd-sequence.md |  24 +-
 .../problem-444-the-roundtable-lottery.md     |  26 ++-
 .../problem-445-retractions-a.md              |  24 +-
 .../problem-446-retractions-b.md              |  24 +-
 .../problem-447-retractions-c.md              |  24 +-
 ...oblem-448-average-least-common-multiple.md |  22 +-
 .../problem-449-chocolate-covered-candy.md    |  22 +-
 ...-45-triangular-pentagonal-and-hexagonal.md |   2 +-
 ...blem-450-hypocycloid-and-lattice-points.md |  35 +--
 .../problem-451-modular-inverses.md           |  33 ++-
 .../problem-452-long-products.md              |  18 +-
 .../problem-453-lattice-quadrilaterals.md     |  20 +-
 ...problem-454-diophantine-reciprocals-iii.md |  20 +-
 ...problem-455-powers-with-trailing-digits.md |  20 +-
 .../problem-459-flipping-game.md              |  30 ++-
 .../problem-46-goldbachs-other-conjecture.md  |   2 +-
 .../problem-460-an-ant-on-the-move.md         |  31 ++-
 ...problem-463-a-weird-recurrence-relation.md |  24 +-
 ...roblem-464-mbius-function-and-intervals.md |  31 ++-
 .../problem-465-polar-polygons.md             |  20 +-
 ...istinct-terms-in-a-multiplication-table.md |  26 ++-
 .../project-euler/problem-467-superinteger.md |  31 ++-
 ...mooth-divisors-of-binomial-coefficients.md |  28 ++-
 .../project-euler/problem-469-empty-chairs.md |  18 +-
 .../problem-47-distinct-primes-factors.md     |  60 ++---
 .../project-euler/problem-470-super-ramvok.md |  18 +-
 ...oblem-471-triangle-inscribed-in-ellipse.md |  34 ++-
 .../problem-472-comfortable-distance-ii.md    |  30 +--
 .../problem-473-phigital-number-base.md       |  20 +-
 .../problem-474-last-digits-of-divisors.md    |  18 +-
 .../problem-475-music-festival.md             |  20 +-
 .../problem-476-circle-packing-ii.md          |  18 +-
 .../problem-477-number-sequence-game.md       |  40 ++--
 .../project-euler/problem-478-mixtures.md     |  28 ++-
 .../problem-479-roots-on-the-rise.md          |  20 +-
 .../project-euler/problem-48-self-powers.md   |   2 +-
 .../problem-480-the-last-question.md          |  98 +++-----
 .../problem-49-prime-permutations.md          |   2 +-
 .../problem-50-consecutive-prime-sum.md       |  92 +++++---
 .../problem-51-prime-digit-replacements.md    | 115 +++++-----
 .../problem-52-permuted-multiples.md          |   2 +-
 .../problem-53-combinatoric-selections.md     |   2 +-
 .../project-euler/problem-54-poker-hands.md   |   2 +-
 .../problem-55-lychrel-numbers.md             |   4 +-
 .../problem-56-powerful-digit-sum.md          |   2 +-
 .../problem-57-square-root-convergents.md     |   2 +-
 .../project-euler/problem-58-spiral-primes.md |   2 +-
 .../problem-59-xor-decryption.md              |   2 +-
 .../problem-60-prime-pair-sets.md             |   2 +-
 .../problem-61-cyclical-figurate-numbers.md   |   2 +-
 .../problem-62-cubic-permutations.md          |   2 +-
 .../problem-63-powerful-digit-counts.md       |   2 +-
 .../problem-64-odd-period-square-roots.md     |   4 +-
 .../problem-65-convergents-of-e.md            |   2 +-
 .../problem-66-diophantine-equation.md        |  10 +-
 .../problem-67-maximum-path-sum-ii.md         |   2 +-
 .../problem-68-magic-5-gon-ring.md            |   2 +-
 .../problem-69-totient-maximum.md             |   2 +-
 .../problem-70-totient-permutation.md         |   2 +-
 .../problem-71-ordered-fractions.md           |   2 +-
 .../problem-72-counting-fractions.md          |   2 +-
 ...roblem-73-counting-fractions-in-a-range.md |   2 +-
 .../problem-74-digit-factorial-chains.md      |  22 +-
 ...lem-75-singular-integer-right-triangles.md |   2 +-
 .../problem-76-counting-summations.md         |   2 +-
 .../problem-77-prime-summations.md            |   2 +-
 .../problem-78-coin-partitions.md             |   2 +-
 .../problem-79-passcode-derivation.md         |   2 +-
 ...roblem-80-square-root-digital-expansion.md |   2 +-
 .../problem-81-path-sum-two-ways.md           |   8 +-
 .../problem-82-path-sum-three-ways.md         |   6 +-
 .../problem-83-path-sum-four-ways.md          |   6 +-
 .../project-euler/problem-84-monopoly-odds.md |   2 +-
 .../problem-85-counting-rectangles.md         |   2 +-
 .../project-euler/problem-86-cuboid-route.md  |   2 +-
 .../problem-87-prime-power-triples.md         |   2 +-
 .../problem-88-product-sum-numbers.md         |   2 +-
 .../problem-89-roman-numerals.md              |   2 +-
 .../problem-90-cube-digit-pairs.md            |   2 +-
 ...ight-triangles-with-integer-coordinates.md |   2 +-
 .../problem-92-square-digit-chains.md         |   7 +-
 .../problem-93-arithmetic-expressions.md      |   6 +-
 ...problem-94-almost-equilateral-triangles.md |   2 +-
 .../problem-95-amicable-chains.md             |   2 +-
 .../problem-97-large-non-mersenne-prime.md    |   2 +-
 .../problem-98-anagramic-squares.md           |   2 +-
 .../problem-99-largest-exponential.md         |   2 +-
 .../rosetta-code/24-game.md                   | 141 ++++++++----
 .../9-billion-names-of-god-the-integer.md     |   4 +-
 .../rosetta-code/accumulator-factory.md       |   4 +-
 .../rosetta-code/ackermann-function.md        |   2 +-
 .../rosetta-code/align-columns.md             |   2 +-
 .../rosetta-code/amicable-pairs.md            |  12 +-
 .../rosetta-code/averages-mode.md             |   4 +-
 .../averages-pythagorean-means.md             |   4 +-
 .../rosetta-code/averages-root-mean-square.md |   8 +-
 .../rosetta-code/babbage-problem.md           |   4 +-
 .../rosetta-code/balanced-brackets.md         |  20 +-
 ...cles-of-given-radius-through-two-points.md |   2 +-
 .../rosetta-code/closest-pair-problem.md      |   2 +-
 .../rosetta-code/combinations.md              |   4 +-
 .../rosetta-code/comma-quibbling.md           |  14 +-
 .../rosetta-code/compare-a-list-of-strings.md |  10 +-
 .../convert-seconds-to-compound-duration.md   |   2 +-
 .../count-occurrences-of-a-substring.md       |   2 +-
 .../rosetta-code/count-the-coins.md           |   4 +-
 .../rosetta-code/cramers-rule.md              |  10 +-
 .../rosetta-code/cusip.md                     |   2 +-
 .../rosetta-code/cut-a-rectangle.md           |   2 +-
 .../rosetta-code/date-format.md               |   2 +-
 .../rosetta-code/date-manipulation.md         |   2 +-
 .../rosetta-code/day-of-the-week.md           |   2 +-
 .../rosetta-code/deal-cards-for-freecell.md   |  16 +-
 .../rosetta-code/deepcopy.md                  |   2 +-
 .../define-a-primitive-data-type.md           |   2 +-
 .../rosetta-code/department-numbers.md        |   2 +-
 .../rosetta-code/discordian-date.md           |  21 +-
 .../rosetta-code/dot-product.md               |   4 +-
 .../rosetta-code/element-wise-operations.md   |   2 +-
 .../rosetta-code/emirp-primes.md              |   2 +-
 .../rosetta-code/entropy.md                   |  22 +-
 .../rosetta-code/equilibrium-index.md         |   2 +-
 .../rosetta-code/ethiopian-multiplication.md  |   2 +-
 .../rosetta-code/euler-method.md              |   6 +-
 .../evaluate-binomial-coefficients.md         |   2 +-
 .../execute-a-markov-algorithm.md             | 216 ++++++------------
 .../rosetta-code/execute-brain.md             |  22 +-
 .../extensible-prime-generator.md             |   2 +-
 .../rosetta-code/factorial.md                 |   4 +-
 .../factors-of-a-mersenne-number.md           |   6 +-
 .../rosetta-code/factors-of-an-integer.md     |   2 +-
 .../rosetta-code/farey-sequence.md            |   4 +-
 .../fibonacci-n-step-number-sequences.md      |   8 +-
 .../rosetta-code/fibonacci-word.md            | 116 +++++-----
 .../rosetta-code/fizzbuzz.md                  |  24 +-
 .../rosetta-code/fractran.md                  |   4 +-
 .../rosetta-code/gamma-function.md            |   4 +-
 .../rosetta-code/gaussian-elimination.md      |   2 +-
 .../rosetta-code/general-fizzbuzz.md          |   4 +-
 .../generate-lower-case-ascii-alphabet.md     |   2 +-
 .../rosetta-code/generator-exponential.md     |   2 +-
 .../rosetta-code/gray-code.md                 |   6 +-
 .../rosetta-code/greatest-common-divisor.md   |   2 +-
 .../greatest-subsequential-sum.md             |   2 +-
 .../rosetta-code/hailstone-sequence.md        |   2 +-
 .../rosetta-code/happy-numbers.md             |   4 +-
 .../rosetta-code/harshad-or-niven-series.md   |   2 +-
 .../rosetta-code/hash-from-two-arrays.md      |  16 +-
 .../rosetta-code/hash-join.md                 |  10 +-
 .../rosetta-code/heronian-triangles.md        |   4 +-
 .../hofstadter-figure-figure-sequences.md     |  26 +--
 .../rosetta-code/hofstadter-q-sequence.md     |   6 +-
 .../rosetta-code/iban.md                      |  14 +-
 .../rosetta-code/identity-matrix.md           |   2 +-
 .../rosetta-code/iterated-digits-squaring.md  |   2 +-
 .../rosetta-code/jaro-distance.md             |  34 +--
 .../rosetta-code/jortsort.md                  |   4 +-
 .../rosetta-code/josephus-problem.md          |   6 +-
 .../rosetta-code/k-d-tree.md                  |   2 +-
 .../rosetta-code/kaprekar-numbers.md          |  10 +-
 .../rosetta-code/knapsack-problem-0-1.md      |   2 +-
 .../rosetta-code/knapsack-problem-bounded.md  |   2 +-
 .../knapsack-problem-continuous.md            |   2 +-
 .../knapsack-problem-unbounded.md             |   2 +-
 .../rosetta-code/knights-tour.md              |  16 +-
 .../largest-int-from-concatenated-ints.md     |   2 +-
 .../rosetta-code/last-friday-of-each-month.md |   2 +-
 .../rosetta-code/last-letter-first-letter.md  |   2 +-
 .../rosetta-code/leap-year.md                 |   2 +-
 .../rosetta-code/least-common-multiple.md     |   6 +-
 .../rosetta-code/left-factorials.md           |   2 +-
 .../rosetta-code/letter-frequency.md          |   2 +-
 .../rosetta-code/levenshtein-distance.md      |   6 +-
 .../linear-congruential-generator.md          |   6 +-
 .../rosetta-code/long-multiplication.md       |   4 +-
 .../longest-common-subsequence.md             |  22 +-
 .../longest-increasing-subsequence.md         |   8 +-
 .../rosetta-code/longest-string-challenge.md  |   4 +-
 .../rosetta-code/look-and-say-sequence.md     |   4 +-
 ...oop-over-multiple-arrays-simultaneously.md |   2 +-
 .../rosetta-code/lu-decomposition.md          |   8 +-
 .../rosetta-code/lucas-lehmer-test.md         |   2 +-
 .../rosetta-code/ludic-numbers.md             |   4 +-
 .../luhn-test-of-credit-card-numbers.md       |   4 +-
 .../rosetta-code/lychrel-numbers.md           |   2 +-
 .../rosetta-code/lzw-compression.md           |   4 +-
 .../rosetta-code/s-expressions.md             |   6 +-
 .../sailors-coconuts-and-a-monkey-problem.md  |  17 +-
 .../rosetta-code/search-a-list-of-records.md  |   2 +-
 .../rosetta-code/sedols.md                    |  13 +-
 .../rosetta-code/self-describing-numbers.md   |   4 +-
 .../rosetta-code/self-referential-sequence.md |   4 +-
 .../rosetta-code/semiprime.md                 |   4 +-
 .../rosetta-code/set-of-real-numbers.md       |   2 +-
 .../rosetta-code/sha-1.md                     |   4 +-
 .../rosetta-code/sha-256.md                   |   2 +-
 .../sort-an-array-of-composite-structures.md  |   2 +-
 .../rosetta-code/sort-disjoint-sublist.md     |   2 +-
 .../rosetta-code/sort-stability.md            |   4 +-
 .../sort-using-a-custom-comparator.md         |   2 +-
 .../sorting-algorithms-bead-sort.md           |  54 ++---
 .../sorting-algorithms-bogosort.md            |   6 +-
 .../sorting-algorithms-cocktail-sort.md       |  26 +--
 .../sorting-algorithms-comb-sort.md           |  12 +-
 .../sorting-algorithms-gnome-sort.md          |   4 +-
 .../sorting-algorithms-pancake-sort.md        |   4 +-
 .../sorting-algorithms-permutation-sort.md    |   4 +-
 .../sorting-algorithms-shell-sort.md          |   4 +-
 .../sorting-algorithms-stooge-sort.md         |   4 +-
 .../sorting-algorithms-strand-sort.md         |  18 +-
 .../rosetta-code/soundex.md                   |  14 +-
 .../rosetta-code/spiral-matrix.md             |   2 +-
 ...ter-string-based-on-change-of-character.md |   2 +-
 .../rosetta-code/state-name-puzzle.md         |   9 +-
 .../rosetta-code/straddling-checkerboard.md   |  10 +-
 ...s-and-extended-characters-from-a-string.md |   2 +-
 .../rosetta-code/subleq.md                    |  36 +--
 .../rosetta-code/sudoku.md                    |   4 +-
 .../rosetta-code/sum-digits-of-an-integer.md  |   2 +-
 .../rosetta-code/sum-multiples-of-3-and-5.md  |   2 +-
 .../rosetta-code/sum-of-a-series.md           |   4 +-
 .../rosetta-code/sum-of-squares.md            |   2 +-
 .../rosetta-code/sum-to-100.md                |   4 +-
 .../sutherland-hodgman-polygon-clipping.md    |   4 +-
 .../rosetta-code/symmetric-difference.md      |   8 +-
 .../rosetta-code/taxicab-numbers.md           |  11 +-
 .../tokenize-a-string-with-escaping.md        |   2 +-
 .../rosetta-code/top-rank-per-group.md        |   2 +-
 .../rosetta-code/topological-sort.md          |   4 +-
 .../rosetta-code/towers-of-hanoi.md           |  12 +-
 .../rosetta-code/word-frequency.md            |  34 +--
 .../rosetta-code/word-wrap.md                 |   2 +-
 .../rosetta-code/y-combinator.md              |  12 +-
 .../zeckendorf-number-representation.md       |   2 +-
 .../zhang-suen-thinning-algorithm.md          |   6 +-
 .../rosetta-code/zig-zag-matrix.md            |   4 +-
 .../build-a-camper-leaderboard.md             |  18 +-
 .../build-a-light-bright-app.md               |   6 +-
 .../build-a-nightlife-coordination-app.md     |  12 +-
 .../build-a-pinterest-clone.md                |  10 +-
 .../take-home-projects/build-a-pong-game.md   |  10 +-
 .../take-home-projects/build-a-recipe-box.md  |  10 +-
 .../build-a-roguelike-dungeon-crawler-game.md |  10 +-
 .../take-home-projects/build-a-simon-game.md  |  10 +-
 .../build-a-tic-tac-toe-game.md               |  10 +-
 .../take-home-projects/build-a-voting-app.md  |   8 +-
 .../build-a-wikipedia-viewer.md               |  18 +-
 ...build-an-image-search-abstraction-layer.md |   6 +-
 .../build-the-game-of-life.md                 |  25 +-
 .../chart-the-stock-market.md                 |   8 +-
 .../manage-a-book-trading-club.md             |   8 +-
 .../map-data-across-the-globe.md              |  10 +-
 ...-contiguity-with-a-force-directed-graph.md |  10 +-
 .../show-the-local-weather.md                 |  14 +-
 .../use-the-twitch-json-api.md                |  18 +-
 ...near-regression-health-costs-calculator.md |  26 ++-
 .../neural-network-sms-text-classifier.md     |  16 +-
 .../rock-paper-scissors.md                    |  48 +++-
 ...neural-networks-the-convolutional-layer.md |   8 +-
 ...-learning-algorithms-building-the-model.md |   4 +
 ...core-learning-algorithms-classification.md |   6 +-
 .../core-learning-algorithms-clustering.md    |   4 +
 ...earning-algorithms-hidden-markov-models.md |   4 +
 ...earning-algorithms-the-training-process.md |   6 +-
 ...ng-algorithms-training-and-testing-data.md |   4 +
 ...using-probabilities-to-make-predictions.md |   4 +
 ...e-learning-algorithms-working-with-data.md |   4 +
 .../tensorflow/core-learning-algorithms.md    |  18 +-
 ...roduction-machine-learning-fundamentals.md |   4 +
 .../tensorflow/introduction-to-tensorflow.md  |   4 +
 ...processing-with-rnns-building-the-model.md |   4 +
 ...ssing-with-rnns-create-a-play-generator.md |   4 +
 ...processing-with-rnns-making-predictions.md |   4 +
 ...al-language-processing-with-rnns-part-2.md |   4 +
 ...ing-with-rnns-recurring-neural-networks.md |   4 +
 ...processing-with-rnns-training-the-model.md |   4 +
 .../natural-language-processing-with-rnns.md  |   4 +
 .../neural-networks-activation-functions.md   |   6 +-
 .../neural-networks-creating-a-model.md       |   4 +
 .../tensorflow/neural-networks-optimizers.md  |   4 +
 .../neural-networks-with-tensorflow.md        |   4 +
 ...cement-learning-with-q-learning-example.md |   4 +
 ...rcement-learning-with-q-learning-part-2.md |   4 +
 .../build-a-survey-form.md                    |   2 +-
 .../6148da157cc0bd0d06df5c0a.md               |  14 +-
 .../6148dc095264000dce348bf5.md               |   2 +-
 .../6148dcaaf2e8750e6cb4501a.md               |   2 +-
 .../6148dd31d210990f0fb140f8.md               |   2 +-
 .../6148defa9c01520fb9d178a0.md               |   2 +-
 .../6148dfab9b54c110577de165.md               |   2 +-
 .../6148e0bcc13efd10f7d7a6a9.md               |   2 +-
 .../6148e161ecec9511941f8833.md               |   2 +-
 .../6148e28706b34912340fd042.md               |   2 +-
 .../6148e335c1edd512d00e4691.md               |   2 +-
 .../6148e41c728f65138addf9cc.md               |   2 +-
 .../6148e5aeb102e3142de026a2.md               |   4 +-
 .../5f33294a6af5e9188dbdb8f3.md               |  23 +-
 .../5f332a88dc25a0fd25c7687a.md               |  25 +-
 .../5f332b23c2045fb843337579.md               |  31 +--
 .../5f344f9c805cd193c33d829c.md               |   8 +-
 .../5f344fad8bf01691e71a30eb.md               |   8 +-
 .../5f344fbc22624a2976425065.md               |   8 +-
 .../5f344fc1520b6719f2e35605.md               |  15 +-
 .../5f3477ae34c1239cafe128be.md               |   8 +-
 .../5f3477ae8466a9a3d2cc953c.md               |   8 +-
 .../5f3477ae9675db8bb7655b30.md               |  27 ++-
 .../5f3477aefa51bfc29327200b.md               |   8 +-
 .../5f3477cb2e27333b1ab2b955.md               |   8 +-
 .../5f3477cb303c5cb61b43aa9b.md               |   8 +-
 .../5f3477cbcb6ba47918c1da92.md               |   8 +-
 .../5f34a1fd611d003edeafd681.md               |   8 +-
 .../5f356ed60785e1f3e9850b6e.md               |   8 +-
 .../5f356ed60a5decd94ab66986.md               |   8 +-
 .../5f356ed6199b0cdef1d2be8f.md               |   8 +-
 .../5f356ed63c7807a4f1e6d054.md               |   8 +-
 .../5f356ed63e0fa262326eef05.md               |   8 +-
 .../5f356ed656a336993abd9f7c.md               |   8 +-
 .../5f356ed69db0a491745e2bb6.md               |   8 +-
 .../5f356ed6cf6eab5f15f5cfe6.md               |   8 +-
 .../5f35e5c4321f818cdc4bed30.md               |   8 +-
 .../5f35e5c44359872a137bd98f.md               |   8 +-
 .../5f3c866d0fc037f7311b4ac8.md               |   8 +-
 .../5f3c866d28d7ad0de6470505.md               |   8 +-
 .../5f3c866d5414453fc2d7b480.md               |   8 +-
 .../5f3c866daec9a49519871816.md               |   8 +-
 .../5f3c866dbf362f99b9a0c6d0.md               |   8 +-
 .../5f3c866dd0d0275f01d4d847.md               |   8 +-
 .../5f3c866de7a5b784048f94b1.md               |   8 +-
 .../5f3cade94c6576e7f7b7953f.md               |   8 +-
 .../5f3cade9993019e26313fa8e.md               |   8 +-
 .../5f3cade99dda4e6071a85dfd.md               |   8 +-
 .../5f3cade9fa77275d9f4efe62.md               |   8 +-
 .../5f3ef6e01f288a026d709587.md               |  20 +-
 .../5f3ef6e03d719d5ac4738993.md               |   8 +-
 .../5f3ef6e04559b939080db057.md               |   8 +-
 .../5f3ef6e050279c7a4a7101d3.md               |   8 +-
 .../5f3ef6e05473f91f948724ab.md               |   8 +-
 .../5f3ef6e056bdde6ae6892ba2.md               |   8 +-
 .../5f3ef6e06d34faac0447fc44.md               |   8 +-
 .../5f3ef6e07276f782bb46b93d.md               |  10 +-
 .../5f3ef6e0819d4f23ca7285e6.md               |   8 +-
 .../5f3ef6e087d56ed3ffdc36be.md               |   8 +-
 .../5f3ef6e0a81099d9a697b550.md               |   8 +-
 .../5f3ef6e0b431cc215bb16f55.md               |   8 +-
 .../5f3ef6e0e0c3feaebcf647ad.md               |   8 +-
 .../5f3ef6e0e9629bad967cd71e.md               |   8 +-
 .../5f3ef6e0eaa7da26e3d34d78.md               |   8 +-
 .../5f3ef6e0f8c230bdd2349716.md               |   8 +-
 .../5f3f26fa39591db45e5cd7a0.md               |  10 +-
 .../5f459225127805351a6ad057.md               |  10 +-
 .../5f459a7ceb8b5c446656d88b.md               |  10 +-
 .../5f459cf202c2a3472fae6a9f.md               |  10 +-
 .../5f459fd48bdc98491ca6d1a3.md               |  12 +-
 .../5f45a05977e2fa49d9119437.md               |  10 +-
 .../5f45a276c093334f0f6e9df4.md               |  10 +-
 .../5f45a5a7c49a8251f0bdb527.md               |  10 +-
 .../5f45a66d4a2b0453301e5a26.md               |  10 +-
 .../5f45b0731d39e15d54df4dfc.md               |  10 +-
 .../5f45b25e7ec2405f166b9de1.md               |  10 +-
 .../5f45b3c93c027860d9298dbd.md               |  10 +-
 .../5f45b45d099f3e621fbbb256.md               |  10 +-
 .../5f45b4c81cea7763550e40df.md               |  10 +-
 .../5f45b715301bbf667badc04a.md               |  10 +-
 .../5f46e270702a8456a664f0df.md               |  10 +-
 .../5f46e36e745ead58487aabf2.md               |  10 +-
 .../5f46e7a4750dd05b5a673920.md               |  10 +-
 .../5f46e8284aae155c83015dee.md               |  10 +-
 .../5f46ede1ff8fec5ba656b44c.md               |  10 +-
 .../5f46fc57528aa1c4b5ea7c2e.md               |  10 +-
 .../5f4701b942c824109626c3d8.md               |  10 +-
 .../5f475bb508746c16c9431d42.md               |  10 +-
 .../5f475e1c7f71a61d913836c6.md               |  10 +-
 .../5f47633757ae3469f2d33d2e.md               |   8 +-
 .../5f47fe7e31980053a8d4403b.md               |  16 +-
 .../5f716ad029ee4053c7027a7a.md               |   8 +-
 .../5f716bee5838c354c728a7c5.md               |   8 +-
 .../5f7691dafd882520797cd2f0.md               |   8 +-
 .../5f7692f7c5b3ce22a57788b6.md               |   8 +-
 .../5f769541be494f25449b292f.md               |   8 +-
 .../5f76967fad478126d6552b0d.md               |   8 +-
 .../5f769702e6e33127d14aa120.md               |   8 +-
 .../5f7b87422a560036fd03ccff.md               |   8 +-
 .../5f7b88d37b1f98386f04edc0.md               |   8 +-
 .../616965351e74d4689eb6de30.md               |  11 +-
 .../617b9ad735109e217284e095.md               |   8 +-
 .../617bd6ec666b1da2587e4e37.md               |  16 +-
 .../618a00ed1ca871a2b3aca0cb.md               |  12 +-
 .../618a0927005553b74bfa05ae.md               |  12 +-
 .../618a0b2befb143baefab632b.md               |  12 +-
 .../618a1275e873dcc803c2d1aa.md               |   8 +-
 .../618a132676346ac9f7fd59dd.md               |  10 +-
 .../618a16873520a8d088ffdf44.md               |   6 +-
 .../618a16d21bd3dad1bb3aa8ef.md               |  10 +-
 .../619b72a0db211f1c29afb906.md               |  10 +-
 .../619b7424f43ec9215e538afe.md               |  12 +-
 .../619b74fa777a2b2473c94f82.md               |  16 +-
 .../619b761916dac02643940022.md               |  10 +-
 .../619b7c3c83de403126b69c1e.md               |  10 +-
 .../619b7fd56aa2253778bcf5f7.md               |  16 +-
 .../61a489b8579e87364b2d2cdb.md               |  12 +-
 .../61a493ead935c148d2b76312.md               |   4 +-
 .../61a498399534644f59cff05e.md               |   8 +-
 .../61a49d15bdbb5e57cc6fd280.md               |   2 +-
 .../61a4a53c4459446dc134a1c6.md               |   8 +-
 .../61a4a6e908bc34725b4c25ac.md               |   6 +-
 .../61a4a7877da33a73a1c1723e.md               |   8 +-
 .../61a4ac092eb21e7dbfe61c33.md               |   8 +-
 .../61a4acbb5587197f68544d00.md               |   8 +-
 .../61a4ada3aabeec822b2975d9.md               |   8 +-
 .../61a4ae5f29eb5584187201c3.md               |   8 +-
 .../61a5be9833e7dc178de2af10.md               |   8 +-
 .../61a5bfe091060f1d6a629dd0.md               |   2 +-
 .../61a5c906ab73313316e342f0.md               |  12 +-
 .../61a5ca57f50ded36d33eef96.md               |   8 +-
 .../61a5d594b887335228ee6533.md               |   2 +-
 .../61a5d6701ee08953ca375243.md               |   2 +-
 .../61a5d79c858bef560e26c685.md               |   2 +-
 .../61a5d7ef1cfcf45764df07a2.md               |   2 +-
 .../61adc60b69cd4b87739d2174.md               |  10 +-
 .../61adc91467b5d59328b9f781.md               |   2 +-
 .../61add79e739a5faee9d96080.md               |   2 +-
 .../61add929e41980b1edbdba7e.md               |   2 +-
 .../61addaf7e83988b59a7d18ff.md               |   2 +-
 .../61ade49b2dad60c076cbd32d.md               |   2 +-
 .../61b092eb9e7fc020b43b1bb2.md               |   2 +-
 .../61b093179e7fc020b43b1bb3.md               |   2 +-
 .../61b093219e7fc020b43b1bb4.md               |   2 +-
 .../61b093329e7fc020b43b1bb5.md               |   2 +-
 .../61b093429e7fc020b43b1bb6.md               |   2 +-
 .../61b0934c9e7fc020b43b1bb7.md               |   2 +-
 .../61b0936d9e7fc020b43b1bb8.md               |   4 +-
 .../61b095989e7fc020b43b1bb9.md               |   2 +-
 .../61b095a79e7fc020b43b1bba.md               |   2 +-
 .../61b095c79e7fc020b43b1bbb.md               |   2 +-
 .../61b09f739aa6572d2064f9b8.md               |   2 +-
 .../61b0a1b2af494934b7ec1a72.md               |   2 +-
 .../61b0a44a6b865738ba49b9fb.md               |   2 +-
 .../61b306305810f1c9040ce5a2.md               |   2 +-
 .../61b30995968123ceb6b76167.md               |   2 +-
 .../61b30a286c228bd0c493c09a.md               |   2 +-
 .../61b31287fb580ae75a486047.md               |   2 +-
 .../61b315e76a63b3ecbbb11b75.md               |   2 +-
 .../61b3183655ec10efd8c0bb07.md               |   2 +-
 .../61b31a451057fff645ec09be.md               |   2 +-
 .../61b31cd7b0c76bfc076b4719.md               |   2 +-
 .../6153a3952facd25a83fe8083.md               |   2 +-
 .../61437d575fb98f57fa8f7f36.md               |   6 +-
 .../614385513d91ae5c251c2052.md               |   2 +-
 .../6143862a5e54455d262c212e.md               |   2 +-
 .../6143869bb45bd85e3b1926aa.md               |  10 +-
 .../614387cbefeeba5f3654a291.md               |   2 +-
 .../614389f601bb4f611db98563.md               |   2 +-
 .../61438b5b66d76a6264430f2a.md               |   2 +-
 .../61438ec09438696391076d6a.md               |   2 +-
 .../61439dc084fa5f659cf75d7c.md               |   2 +-
 .../61439dfc811e12666b04be6f.md               |   4 +-
 .../61439e33e4fb7967609e0c83.md               |   2 +-
 .../6143a1a228f7d068ab16a130.md               |   4 +-
 .../6143a73279ce6369de4b9bcc.md               |   2 +-
 .../6143a778bffc206ac6b1dbe3.md               |   2 +-
 .../6143a83fcc32c26bcfae3efa.md               |   2 +-
 .../6143b97c06c3306d23d5da47.md               |   2 +-
 .../6143b9e1f5035c6e5f2a8231.md               |   4 +-
 .../6143bb50e8e48c6f5ef9d8d5.md               |   2 +-
 .../6143c2a363865c715f1a3f72.md               |   2 +-
 .../6143cd08fe927072ca3a371d.md               |   2 +-
 .../6143cdf48b634a747de42104.md               |   2 +-
 .../6143d003ad9e9d76766293ec.md               |   2 +-
 .../6143d2842b497779bad947de.md               |   2 +-
 .../6144d66a5358db0c80628757.md               |   2 +-
 .../6144d7dbdd3e580da730ff45.md               |   2 +-
 .../6144de308591ec10e27d5383.md               |   2 +-
 .../6144e1ba93e435127a7f516d.md               |   2 +-
 .../6144ee46a9d6e614c598cc05.md               |   2 +-
 .../6144ee790af79815ad15a832.md               |   2 +-
 .../6144f1410990ea17187a722b.md               |   4 +-
 .../6144f3818bfbc51844152e36.md               |   2 +-
 .../6144f42204c8c8195f1f3345.md               |   2 +-
 .../6144f47b7c631e1a6f304dd5.md               |   2 +-
 .../6148b07081759c2c691166a9.md               |   2 +-
 .../6148b0d764e4192e5712ed92.md               |   2 +-
 .../6148b185ef37522f688316b0.md               |   2 +-
 .../6148b30464daf630848c21d4.md               |   2 +-
 .../6148b4b150434734143db6f2.md               |   2 +-
 .../6148b5623efa8f369f2c3643.md               |   2 +-
 .../6148b59ef318e03875f35c4a.md               |   2 +-
 .../6148bd62bbb8c83a5f1fc1b3.md               |   2 +-
 .../6148be3d605d6b3ca9425d11.md               |   2 +-
 .../6148be82ca63c63daa8cca49.md               |   2 +-
 .../6148bf49fcc7913f05dbf9b7.md               |   2 +-
 .../6148bfc43df3bc40fe0e6405.md               |   2 +-
 .../6148c004ffc8434252940dc3.md               |   2 +-
 .../6148c224ecb157439bc5247c.md               |   2 +-
 .../6148c434bd731d45617a76c6.md               |   2 +-
 .../6148c5036ddad94692a66230.md               |   2 +-
 .../6148c58bace368497fb11bcf.md               |   2 +-
 .../6148c6aa9981d74af202125e.md               |   2 +-
 .../6148c721e74ecd4c619ae51c.md               |   2 +-
 .../6148ceaf5d897d4d8b3554b3.md               |   2 +-
 .../6148cf094b3f2b4e8a032c63.md               |   2 +-
 .../6148d0b863d10d50544ace0e.md               |   2 +-
 .../6148d1bdf39c5b5186f5974b.md               |   2 +-
 .../6148d1f9eb63c252e1f8acc4.md               |   2 +-
 .../6148d2444d01ab541e64a1e4.md               |   2 +-
 .../6148d33e31fccf558696c745.md               |   2 +-
 .../6148d3fff5186b57123d97e2.md               |   2 +-
 .../6148d4d57b965358c9fa38bf.md               |   2 +-
 .../6148d7720f0db36775db868a.md               |   2 +-
 .../6148d94fdf6a5d6899f8ff15.md               |   2 +-
 .../6148d9825b50a3698aeee644.md               |   2 +-
 .../6148e162e255676ae0da6a76.md               |   2 +-
 .../6148e19c3e26436be0155690.md               |   2 +-
 .../6148e246146b646cf4255f0c.md               |   2 +-
 .../6148e2dcdd60306dd77d41cc.md               |   2 +-
 .../6148e4d6861a486f60681f36.md               |   2 +-
 .../6148e5a204d99e70343a63e4.md               |   2 +-
 .../6148e62a6f768f71c4f04828.md               |   2 +-
 .../6148e789329dc9736ce59b85.md               |   2 +-
 .../6148f34ebedc2274bceeb99c.md               |   2 +-
 .../6148f600cde42b7670c2611f.md               |   2 +-
 .../6148f693e0728f77c87f3020.md               |   2 +-
 .../6148f6f7d8914c78e93136ca.md               |  10 +-
 .../614e0e503b110f76d3ac2ff6.md               |   2 +-
 .../614e0e588f0e8a772a8a81a6.md               |   2 +-
 .../6165d3b702a5d92ad970b30c.md               |   2 +-
 .../6169cd8a558aa8434e0ad7f6.md               |   2 +-
 .../619665c9abd72906f3ad30f9.md               |   4 +-
 .../61967e74a8e3690ab6292daa.md               |   4 +-
 .../61968df2acd5550bf1616c34.md               |   6 +-
 .../61968e9243a4090cc805531c.md               |   4 +-
 .../61968f8877c6720d6d61aaf5.md               |   4 +-
 .../619691693bc14b0e528f5a20.md               |   4 +-
 .../6196928658b6010f28c39484.md               |   2 +-
 .../619692ff79f5770fc6d8c0b4.md               |   4 +-
 .../6196990f966e8f10a40094f6.md               |   4 +-
 .../619699c10a0f6e11591d73c4.md               |   4 +-
 .../61969aa6acef5b12200f672e.md               |   4 +-
 .../61969c487ced6f12db8fef94.md               |   2 +-
 .../61969d66cfcdba137d021558.md               |   4 +-
 .../61969e7451455614217e901b.md               |   4 +-
 .../6196adc17f77a714d51485f2.md               |   4 +-
 .../6196aead7ac7bf1584b17a7f.md               |   6 +-
 .../6196ce0415498d2463989e84.md               |   2 +-
 .../6196cee94c6da1253809dff9.md               |   2 +-
 .../6196d00a5d7292262bc02f4c.md               |   2 +-
 .../6196d0cda039d026f7f78d1e.md               |   2 +-
 .../6196d1ac33c68d27dcda5796.md               |   2 +-
 .../6196d213d99f16287bff22ae.md               |   2 +-
 .../6196d2c0f22ca0293107c048.md               |   4 +-
 .../6196d32d1340d829f0f6f57d.md               |   2 +-
 .../6196d41d40bf9b2aaea5d520.md               |   2 +-
 .../6197cff995d03905b0cca8ad.md               |   2 +-
 .../6197f40a16afea068c7e60c8.md               |   2 +-
 .../6197f667297bb30a552ce017.md               |   4 +-
 .../61993b72e874e709b8dfd666.md               |   2 +-
 .../61993cf26a8e0f0a553db223.md               |   4 +-
 .../61993dbb35adf30b10d49e38.md               |   2 +-
 .../61993e9adc9e9a0bb4d28fff.md               |   2 +-
 .../6199409834ccaf0d10736596.md               |   2 +-
 .../6199429802b7c10dc79ff871.md               |   2 +-
 .../619943285a41720e6370d985.md               |   4 +-
 .../619943876b706d0f35c01dbc.md               |   2 +-
 .../6199442866286d0ff421a4fc.md               |   2 +-
 .../619be73b3c806006ccc00bb0.md               |   2 +-
 .../619be7af7b0bf60770f5d2a4.md               |   2 +-
 .../619be80062551a080e32c821.md               |   2 +-
 .../619be8ce4ea49008c5bfbc30.md               |   2 +-
 .../619be946958c6009844f1dee.md               |   2 +-
 .../619c155df0063a0a3fec0e32.md               |   2 +-
 .../619c16debd0c270b01c5ce38.md               |   2 +-
 .../619cfdf2e63ddf05feab86ad.md               |   2 +-
 .../619d019488f98c06acbbb71a.md               |   2 +-
 .../619d022dc8400c0763829a17.md               |   2 +-
 .../619d02c7bc95bf0827a5d296.md               |   2 +-
 .../619d033915012509031f309a.md               |   2 +-
 .../619d03dadadb6509a16f4f5f.md               |   2 +-
 .../619d0503e03a790a4179d463.md               |   2 +-
 .../619d05c54dabca0b10058235.md               |   2 +-
 .../619d0882f54bf40bdc4671ed.md               |   2 +-
 .../619d090cd8d6db0c93dc5087.md               |   2 +-
 .../619d0b51ca42ed0d74582186.md               |   2 +-
 .../619d0bc9cb05360e1bf549c3.md               |   2 +-
 .../619d0c1594c38c0ebae75878.md               |   2 +-
 .../619d0d18ca99870f884a7bff.md               |   4 +-
 .../619d0daf214542102739b0da.md               |   2 +-
 .../619d0e56f9ca9710fcb974e3.md               |   2 +-
 .../619d0eec0ac40611b41e2ccc.md               |   2 +-
 .../619d0fc9825c271253df28d4.md               |   2 +-
 .../619d102d786c3d13124c37c6.md               |   2 +-
 .../619d107edf7ddf13cc77106a.md               |   2 +-
 .../619d10cc98145f14820399c5.md               |   2 +-
 .../619d115e2adcd71538e82ebb.md               |   2 +-
 .../619d11e6d5ef9515d2a16033.md               |   2 +-
 .../619d129a417d0716a94de913.md               |   2 +-
 .../619d1340361095175f4b5115.md               |   2 +-
 .../619d15797b580c1828b05426.md               |   2 +-
 .../619d15d955d9d418c4487bbc.md               |   2 +-
 .../619d1629a8adc61960ca8b40.md               |   2 +-
 .../619d1c5fc9f8941a400955da.md               |   2 +-
 .../619d1dab9ff3421ae1976991.md               |   2 +-
 .../619d1deb8b04811b8839ffe4.md               |   2 +-
 .../619d1e7a8e81a61c5a819dc4.md               |   2 +-
 .../619d1ed33c9a071cf657a0d6.md               |   2 +-
 .../619d1fb5d244c31db8a7fdb7.md               |   2 +-
 .../619d204bd73ae51e743b8e94.md               |   4 +-
 .../619d20b12996101f430920fb.md               |   4 +-
 .../619d21fe6a3f9b2016be9d9d.md               |   2 +-
 .../619d229b0e542520cd91c685.md               |   2 +-
 .../619d23089e787e216a7043d6.md               |   2 +-
 .../619d237a107c10221ed743fa.md               |   2 +-
 .../619d26b12e651022d80cd017.md               |   2 +-
 .../619d2712853306238f41828e.md               |   2 +-
 .../619d2b7a84e78b246f2d17a2.md               |   2 +-
 .../619d2bd9c1d43c2526e96f1f.md               |   4 +-
 .../619d2d4e80400325ff89664a.md               |   2 +-
 .../619d2ebc81ba81271460850d.md               |   2 +-
 .../619d2f0e9440bc27caee1cec.md               |   2 +-
 .../619d2fd3ff4f772882e3d998.md               |   2 +-
 .../619d30350883802921bfcccc.md               |   2 +-
 .../619d324f5915c929f36ae91d.md               |   2 +-
 .../619d32c7fa21f32aaa91d499.md               |   2 +-
 .../619d333b738e3c2b5d58b095.md               |   2 +-
 .../619d337765b9f02c10e93722.md               |   2 +-
 .../619d33c51140292cc5a21742.md               |   2 +-
 .../619d3482f505452d861d0f62.md               |   2 +-
 .../619d3561a951bf2e41a24f10.md               |   2 +-
 .../619d36103839c82efa95dd34.md               |   2 +-
 .../619d3711d04d623000013e9e.md               |   2 +-
 .../61a8fe15a6a31306e60d1e89.md               |   4 +-
 .../5d822fd413a79914d39e98cd.md               |   2 +-
 .../5d822fd413a79914d39e98ce.md               |   2 +-
 .../5d822fd413a79914d39e98cf.md               |   4 +-
 .../5d822fd413a79914d39e98d0.md               |   2 +-
 .../5d822fd413a79914d39e98d1.md               |   4 +-
 .../5d822fd413a79914d39e98d2.md               |   4 +-
 .../5d822fd413a79914d39e98d3.md               |   4 +-
 .../5d822fd413a79914d39e98d4.md               |   2 +-
 .../5d822fd413a79914d39e98d5.md               |   4 +-
 .../5d822fd413a79914d39e98d6.md               |   4 +-
 .../5d822fd413a79914d39e98d7.md               |   6 +-
 .../5d822fd413a79914d39e98d8.md               |   2 +-
 .../5d822fd413a79914d39e98d9.md               |   2 +-
 .../5d822fd413a79914d39e98da.md               |   4 +-
 .../5d822fd413a79914d39e98db.md               |   2 +-
 .../5d822fd413a79914d39e98dc.md               |   4 +-
 .../5d822fd413a79914d39e98dd.md               |   4 +-
 .../5d822fd413a79914d39e98de.md               |   4 +-
 .../5d822fd413a79914d39e98df.md               |   4 +-
 .../5d822fd413a79914d39e98e0.md               |   2 +-
 .../5d822fd413a79914d39e98e1.md               |   4 +-
 .../5d822fd413a79914d39e98e2.md               |   4 +-
 .../5d822fd413a79914d39e98e3.md               |   2 +-
 .../5d822fd413a79914d39e98e4.md               |   2 +-
 .../5d822fd413a79914d39e98e5.md               |   2 +-
 .../5d822fd413a79914d39e98e6.md               |   2 +-
 .../5d822fd413a79914d39e98e7.md               |   4 +-
 .../5d822fd413a79914d39e98e8.md               |   2 +-
 .../5d822fd413a79914d39e98e9.md               |   4 +-
 .../5d822fd413a79914d39e98ea.md               |   4 +-
 .../5d822fd413a79914d39e98eb.md               |   2 +-
 .../5d822fd413a79914d39e98ec.md               |   4 +-
 .../5d822fd413a79914d39e98ed.md               |   4 +-
 .../5d822fd413a79914d39e98ee.md               |   4 +-
 .../5d822fd413a79914d39e98ef.md               |   4 +-
 .../5d822fd413a79914d39e98f0.md               |   4 +-
 .../5d822fd413a79914d39e98f1.md               |   4 +-
 .../5d822fd413a79914d39e98f2.md               |   4 +-
 .../5d822fd413a79914d39e98f3.md               |   4 +-
 .../5d822fd413a79914d39e98f4.md               |   4 +-
 .../5d822fd413a79914d39e98f5.md               |   4 +-
 .../5d822fd413a79914d39e98f6.md               |   4 +-
 .../5d822fd413a79914d39e98f7.md               |   4 +-
 .../5d822fd413a79914d39e98f8.md               |   4 +-
 .../5d822fd413a79914d39e98f9.md               |   4 +-
 .../5d822fd413a79914d39e98fa.md               |   4 +-
 .../5d822fd413a79914d39e98fb.md               |  10 +-
 .../5d822fd413a79914d39e98fc.md               |  10 +-
 .../5d822fd413a79914d39e98fd.md               |   2 +-
 .../5d822fd413a79914d39e98fe.md               |  10 +-
 .../5d822fd413a79914d39e98ff.md               |  10 +-
 .../5d822fd413a79914d39e9900.md               |  10 +-
 .../5d822fd413a79914d39e9901.md               |  10 +-
 .../5d822fd413a79914d39e9902.md               |  10 +-
 .../5d822fd413a79914d39e9903.md               |  10 +-
 .../5d822fd413a79914d39e9904.md               |  10 +-
 .../5d822fd413a79914d39e9905.md               |  10 +-
 .../5d822fd413a79914d39e9906.md               |  10 +-
 .../5d822fd413a79914d39e9907.md               |  10 +-
 .../5d822fd413a79914d39e9908.md               |  12 +-
 .../5d822fd413a79914d39e9909.md               |  12 +-
 .../5d822fd413a79914d39e990a.md               |  12 +-
 .../5d822fd413a79914d39e990b.md               |  12 +-
 .../5d822fd413a79914d39e990c.md               |  12 +-
 .../5d822fd413a79914d39e990d.md               |  12 +-
 .../5d822fd413a79914d39e990e.md               |  12 +-
 .../5d822fd413a79914d39e990f.md               |  12 +-
 .../5d822fd413a79914d39e9910.md               |  12 +-
 .../5d822fd413a79914d39e9911.md               |  12 +-
 .../5d822fd413a79914d39e9912.md               |  12 +-
 .../5d822fd413a79914d39e9913.md               |  14 +-
 .../5d822fd413a79914d39e9914.md               |  12 +-
 .../5d822fd413a79914d39e9915.md               |  16 +-
 .../5d822fd413a79914d39e9916.md               |  12 +-
 .../5d822fd413a79914d39e9917.md               |  12 +-
 .../5d822fd413a79914d39e9918.md               |  14 +-
 .../5d822fd413a79914d39e9919.md               |  14 +-
 .../5d822fd413a79914d39e991a.md               |  14 +-
 .../5d822fd413a79914d39e991b.md               |  14 +-
 .../5d822fd413a79914d39e991c.md               |  14 +-
 .../5d822fd413a79914d39e991d.md               |  14 +-
 .../5d822fd413a79914d39e991e.md               |  14 +-
 .../5d822fd413a79914d39e991f.md               |  14 +-
 .../5d822fd413a79914d39e9920.md               |  14 +-
 .../5d822fd413a79914d39e9921.md               |  14 +-
 .../5d822fd413a79914d39e9922.md               |  12 +-
 .../5d822fd413a79914d39e9923.md               |  14 +-
 .../5d822fd413a79914d39e9924.md               |  16 +-
 .../5d822fd413a79914d39e9925.md               |  16 +-
 .../5d822fd413a79914d39e9926.md               |  16 +-
 .../5d822fd413a79914d39e9927.md               |  16 +-
 .../5d822fd413a79914d39e9928.md               |  16 +-
 .../5d822fd413a79914d39e9929.md               |  16 +-
 .../5d822fd413a79914d39e992a.md               |  16 +-
 .../5d822fd413a79914d39e992b.md               |  16 +-
 .../5d822fd413a79914d39e992c.md               |  16 +-
 .../5d822fd413a79914d39e992d.md               |  16 +-
 .../5d822fd413a79914d39e992e.md               |  16 +-
 .../5d822fd413a79914d39e992f.md               |  16 +-
 .../5d822fd413a79914d39e9930.md               |  16 +-
 .../5d822fd413a79914d39e9931.md               |   6 +-
 .../5d822fd413a79914d39e9932.md               |  16 +-
 .../5d822fd413a79914d39e9933.md               |  16 +-
 .../5d822fd413a79914d39e9934.md               |  14 +-
 .../5d822fd413a79914d39e9935.md               |  14 +-
 .../5d822fd413a79914d39e9936.md               |  16 +-
 .../5d822fd413a79914d39e9937.md               |  16 +-
 .../5d822fd413a79914d39e9938.md               |  16 +-
 .../5d822fd413a79914d39e9939.md               |  16 +-
 .../5d822fd413a79914d39e993a.md               |  14 +-
 .../5d822fd413a79914d39e993b.md               |  16 +-
 .../5d822fd413a79914d39e993c.md               |   4 +-
 .../5d822fd413a79914d39e993d.md               |  16 +-
 .../5d822fd413a79914d39e993e.md               |  28 +--
 .../5dc2385ff86c76b9248c6eb7.md               |  12 +-
 .../5dc23991f86c76b9248c6eb8.md               |  10 +-
 .../5dc23f9bf86c76b9248c6eba.md               |   2 +-
 .../5dc24073f86c76b9248c6ebb.md               |   2 +-
 .../5dc24165f86c76b9248c6ebc.md               |   2 +-
 .../5dc24614f86c76b9248c6ebd.md               |   2 +-
 .../5ddbd81294d8ddc1510a8e56.md               |   2 +-
 .../5dfa22d1b521be39a3de7be0.md               |   4 +-
 .../5dfa2407b521be39a3de7be1.md               |   2 +-
 .../5dfa30b9eacea3f48c6300ad.md               |   2 +-
 .../5dfa3589eacea3f48c6300ae.md               |   2 +-
 .../5dfa371beacea3f48c6300af.md               |   2 +-
 .../5dfa37b9eacea3f48c6300b0.md               |   4 +-
 .../5dfb5ecbeacea3f48c6300b1.md               |   2 +-
 .../5dfb6250eacea3f48c6300b2.md               |   2 +-
 .../5dfb655eeacea3f48c6300b3.md               |   6 +-
 .../5dfb6a35eacea3f48c6300b4.md               |   2 +-
 .../5ef9b03c81a63668521804d0.md               |   2 +-
 .../5ef9b03c81a63668521804d1.md               |   2 +-
 .../5ef9b03c81a63668521804d2.md               |   2 +-
 .../5ef9b03c81a63668521804d3.md               |   2 +-
 .../5ef9b03c81a63668521804d4.md               |   2 +-
 .../5ef9b03c81a63668521804d5.md               |   2 +-
 .../5ef9b03c81a63668521804d6.md               |   2 +-
 .../5ef9b03c81a63668521804d7.md               |   2 +-
 .../5ef9b03c81a63668521804d8.md               |   2 +-
 .../5ef9b03c81a63668521804d9.md               |   2 +-
 .../5ef9b03c81a63668521804da.md               |   2 +-
 .../5ef9b03c81a63668521804db.md               |   2 +-
 .../5ef9b03c81a63668521804dc.md               |   2 +-
 .../5ef9b03c81a63668521804dd.md               |   2 +-
 .../5ef9b03c81a63668521804de.md               |   2 +-
 .../5ef9b03c81a63668521804df.md               |   2 +-
 .../5ef9b03c81a63668521804e1.md               |   2 +-
 .../5ef9b03c81a63668521804e2.md               |   2 +-
 .../5ef9b03c81a63668521804e3.md               |   2 +-
 .../5ef9b03c81a63668521804e5.md               |   2 +-
 .../5ef9b03c81a63668521804e7.md               |   2 +-
 .../5ef9b03c81a63668521804e8.md               |   2 +-
 .../5ef9b03c81a63668521804e9.md               |   2 +-
 .../5ef9b03c81a63668521804ea.md               |   2 +-
 .../5ef9b03c81a63668521804eb.md               |   2 +-
 .../5ef9b03c81a63668521804ec.md               |   2 +-
 .../5ef9b03c81a63668521804ee.md               |   2 +-
 .../5efada803cbd2bbdab94e332.md               |   2 +-
 .../5efae0543cbd2bbdab94e333.md               |   2 +-
 .../5efae16e3cbd2bbdab94e334.md               |   2 +-
 .../5efb23e70dc218d6c85f89b1.md               |   2 +-
 .../5efb2c990dc218d6c85f89b2.md               |   2 +-
 .../5efc4f528d6a74d05e68af74.md               |  10 +-
 .../5efc518e8d6a74d05e68af75.md               |   2 +-
 .../5efc54138d6a74d05e68af76.md               |   2 +-
 .../5efc575c8d6a74d05e68af77.md               |   2 +-
 .../5f05a1d8e233dff4a68508d8.md               |   2 +-
 .../5f07be6ef7412fbad0c5626b.md               |  18 +-
 .../5f07c98cdb9413cbd4b16750.md               |   2 +-
 .../5f07fb1579dc934717801375.md               |  52 ++---
 .../5f0d48e7b435f13ab6550051.md               |   2 +-
 .../5f0d4ab1b435f13ab6550052.md               |   2 +-
 .../5f0d4d04b435f13ab6550053.md               |   2 +-
 .../5f1a80975fc4bcae0edb3497.md               |   2 +-
 .../5f1a89f1190aff21ae42105a.md               |   2 +-
 .../62bb4009e3458a128ff57d5d.md               |   4 +-
 .../62dabe2ef403a12d5d295273.md               |   2 +-
 .../7cf9b03d81a65668421804c3.md               |   2 +-
 .../60f1922fcbd2410527b3bd89.md               |   9 +-
 .../60f803d5241e6a0433a523a1.md               |   7 +-
 .../60b69a66b6ddb80858c51578.md               |   2 +-
 .../60b69a66b6ddb80858c51579.md               |   4 +-
 .../60b69a66b6ddb80858c5157a.md               |   7 +-
 .../60b69a66b6ddb80858c5157b.md               |   4 +-
 .../60b69a66b6ddb80858c5157c.md               |   2 +-
 .../60b69a66b6ddb80858c5157d.md               |   2 +-
 .../60b69a66b6ddb80858c5157e.md               |   2 +-
 .../60b69a66b6ddb80858c5157f.md               |   2 +-
 .../60b69a66b6ddb80858c51580.md               |   2 +-
 .../60b69a66b6ddb80858c51581.md               |   4 +-
 .../60b69a66b6ddb80858c51582.md               |   4 +-
 .../60b69a66b6ddb80858c51583.md               |   4 +-
 .../60b69a66b6ddb80858c51584.md               |   4 +-
 .../60b69a66b6ddb80858c51585.md               |   4 +-
 .../60b69a66b6ddb80858c51586.md               |   2 +-
 .../60b69a66b6ddb80858c51587.md               |   2 +-
 .../60b69a66b6ddb80858c51588.md               |   2 +-
 .../60b69a66b6ddb80858c51589.md               |   2 +-
 .../60b69a66b6ddb80858c5158a.md               |   2 +-
 .../60b69a66b6ddb80858c5158b.md               |   2 +-
 .../60b69a66b6ddb80858c5158c.md               |   2 +-
 .../60b69a66b6ddb80858c5158d.md               |   2 +-
 .../60b69a66b6ddb80858c5158e.md               |   2 +-
 .../60b69a66b6ddb80858c5158f.md               |   2 +-
 .../60b69a66b6ddb80858c51590.md               |   2 +-
 .../60b69a66b6ddb80858c51591.md               |   2 +-
 .../60b69a66b6ddb80858c51592.md               |   2 +-
 .../60b69a66b6ddb80858c51593.md               |   2 +-
 .../60b69a66b6ddb80858c51594.md               |   2 +-
 .../60b69a66b6ddb80858c51595.md               |   4 +-
 .../60b69a66b6ddb80858c51596.md               |   2 +-
 .../60b69a66b6ddb80858c51597.md               |   2 +-
 .../60b69a66b6ddb80858c51598.md               |   4 +-
 .../60b69a66b6ddb80858c51599.md               |   4 +-
 .../60b69a66b6ddb80858c5159a.md               |   4 +-
 .../60b69a66b6ddb80858c5159b.md               |   4 +-
 .../60b69a66b6ddb80858c5159c.md               |   2 +-
 .../60b69a66b6ddb80858c5159d.md               |   2 +-
 .../60b69a66b6ddb80858c5159e.md               |   2 +-
 .../60b69a66b6ddb80858c5159f.md               |   2 +-
 .../60b69a66b6ddb80858c515a1.md               |   2 +-
 .../60b69a66b6ddb80858c515a2.md               |   2 +-
 .../60b69a66b6ddb80858c515a3.md               |   2 +-
 .../60b69a66b6ddb80858c515a4.md               |   2 +-
 .../60b69a66b6ddb80858c515a5.md               |   2 +-
 .../60b69a66b6ddb80858c515a6.md               |   2 +-
 .../60b69a66b6ddb80858c515a7.md               |   4 +-
 .../60b69a66b6ddb80858c515a8.md               |   2 +-
 .../60b69a66b6ddb80858c515a9.md               |   2 +-
 .../60b69a66b6ddb80858c515aa.md               |   2 +-
 .../60b69a66b6ddb80858c515ab.md               |   2 +-
 .../60b69a66b6ddb80858c515ac.md               |   2 +-
 .../60b69a66b6ddb80858c515ad.md               |   4 +-
 .../60b69a66b6ddb80858c515ae.md               |   4 +-
 .../60b69a66b6ddb80858c515af.md               |   4 +-
 .../60b69a66b6ddb80858c515b0.md               |   4 +-
 .../60b69a66b6ddb80858c515b1.md               |   4 +-
 .../60b69a66b6ddb80858c515b2.md               |   6 +-
 .../60b69a66b6ddb80858c515b3.md               |   2 +-
 .../60b69a66b6ddb80858c515b4.md               |   4 +-
 .../60b69a66b6ddb80858c515b5.md               |   2 +-
 .../60b69a66b6ddb80858c515b6.md               |   2 +-
 .../60b69a66b6ddb80858c515b7.md               |   2 +-
 .../60b69a66b6ddb80858c515b8.md               |   2 +-
 .../60b69a66b6ddb80858c515b9.md               |   2 +-
 .../60b69a66b6ddb80858c515ba.md               |   2 +-
 .../60b69a66b6ddb80858c515bc.md               |   2 +-
 .../60b69a66b6ddb80858c515bd.md               |   2 +-
 .../60b69a66b6ddb80858c515be.md               |   2 +-
 .../60b69a66b6ddb80858c515bf.md               |   2 +-
 .../60b69a66b6ddb80858c515c0.md               |   2 +-
 .../60b69a66b6ddb80858c515c1.md               |   2 +-
 .../60b69a66b6ddb80858c515c2.md               |   2 +-
 .../60b69a66b6ddb80858c515c3.md               |   2 +-
 .../60b69a66b6ddb80858c515c4.md               |   2 +-
 .../60b69a66b6ddb80858c515c5.md               |   2 +-
 .../60b69a66b6ddb80858c515c6.md               |  10 +-
 .../60b69a66b6ddb80858c515c7.md               |   4 +-
 .../60b80da8676fb3227967a731.md               |   2 +-
 .../60ba890832b4940f24d1936b.md               |   2 +-
 .../60ba89123a445e0f5c9e4022.md               |   2 +-
 .../60ba8913f1704c0f7a8906b8.md               |   2 +-
 .../60ba89146b25080f99ab54ad.md               |   2 +-
 .../60ba8914bab51f0fb8228e9c.md               |   2 +-
 .../60ba929345ab0714a3743655.md               |   2 +-
 .../60ba9296d4d6b414c1b10995.md               |   2 +-
 .../60ba92987c1e4914dfa7a0b9.md               |   2 +-
 .../60bad32219ebcb4a8810ac6a.md               |   2 +-
 .../612ec19d5268da7074941f84.md               |  12 +-
 .../60a3e3396c7b40068ad6996b.md               |   2 +-
 .../60a3e3396c7b40068ad6996c.md               |   2 +-
 .../60a3e3396c7b40068ad6996d.md               |   2 +-
 .../60a3e3396c7b40068ad6996e.md               |   2 +-
 .../60a3e3396c7b40068ad6996f.md               |   2 +-
 .../60a3e3396c7b40068ad69970.md               |   2 +-
 .../60a3e3396c7b40068ad69971.md               |   6 +-
 .../60a3e3396c7b40068ad69972.md               |   2 +-
 .../60a3e3396c7b40068ad69973.md               |   2 +-
 .../60a3e3396c7b40068ad69974.md               |   2 +-
 .../60a3e3396c7b40068ad69975.md               |   2 +-
 .../60a3e3396c7b40068ad69976.md               |   2 +-
 .../60a3e3396c7b40068ad69977.md               |   2 +-
 .../60a3e3396c7b40068ad69978.md               |   2 +-
 .../60a3e3396c7b40068ad69979.md               |   2 +-
 .../60a3e3396c7b40068ad6997a.md               |   2 +-
 .../60a3e3396c7b40068ad6997b.md               |   2 +-
 .../60a3e3396c7b40068ad6997c.md               |   2 +-
 .../60a3e3396c7b40068ad6997d.md               |   2 +-
 .../60a3e3396c7b40068ad6997e.md               |   2 +-
 .../60a3e3396c7b40068ad6997f.md               |   2 +-
 .../60a3e3396c7b40068ad69980.md               |   2 +-
 .../60a3e3396c7b40068ad69981.md               |   6 +-
 .../60a3e3396c7b40068ad69982.md               |   2 +-
 .../60a3e3396c7b40068ad69983.md               |   2 +-
 .../60a3e3396c7b40068ad69984.md               |   2 +-
 .../60a3e3396c7b40068ad69986.md               |   2 +-
 .../60a3e3396c7b40068ad69987.md               |   2 +-
 .../60a3e3396c7b40068ad69988.md               |   2 +-
 .../60a3e3396c7b40068ad69989.md               |   2 +-
 .../60a3e3396c7b40068ad6998a.md               |   2 +-
 .../60a3e3396c7b40068ad6998b.md               |   2 +-
 .../60a3e3396c7b40068ad6998c.md               |   2 +-
 .../60a3e3396c7b40068ad6998d.md               |   2 +-
 .../60a3e3396c7b40068ad6998e.md               |   2 +-
 .../60a3e3396c7b40068ad6998f.md               |   2 +-
 .../60a3e3396c7b40068ad69990.md               |   2 +-
 .../60a3e3396c7b40068ad69991.md               |   2 +-
 .../60a3e3396c7b40068ad69992.md               |   2 +-
 .../60a3e3396c7b40068ad69993.md               |   2 +-
 .../60a3e3396c7b40068ad69994.md               |   2 +-
 .../60a3e3396c7b40068ad69995.md               |   2 +-
 .../60a3e3396c7b40068ad69996.md               |   2 +-
 .../60a3e3396c7b40068ad69997.md               |   4 +-
 .../615f2abbe7d18d49a1e0e1c8.md               |   8 +-
 .../615f2d4150fe0d4cbd0f2628.md               |   2 +-
 .../615f34948891834dd77655a6.md               |   4 +-
 .../615f34ecc1091b4fd5a8a484.md               |   2 +-
 .../615f357957e370510f21ea16.md               |   2 +-
 .../615f378014c2da526a109c81.md               |   2 +-
 .../615f38279e5c3d53692ea441.md               |   2 +-
 .../615f38cabc64e3556f98cc1a.md               |   2 +-
 .../615f3949f58e12577dcefb00.md               |   2 +-
 .../615f39d7da41b15851fa3fb9.md               |   2 +-
 .../615f3b091162165948e1cb33.md               |   2 +-
 .../615f3cafd794015aa9547a6d.md               |   2 +-
 .../615f3d9e59db4b5b8e960762.md               |   2 +-
 .../615f3e1b7233ee5c7595771f.md               |   2 +-
 .../615f3ed16592445e57941aec.md               |   2 +-
 .../615f405b89a7ec5f8e2d11f4.md               |   2 +-
 .../615f40b01f680e608d360ed4.md               |   2 +-
 .../615f4172e9eec061d6456221.md               |   2 +-
 .../615f41c979787462e76dab90.md               |   2 +-
 .../615f423cf65d5864132a0956.md               |   2 +-
 .../615f42a021625f656101ef93.md               |   2 +-
 .../615f4bfb9de4a16703b56eb6.md               |   2 +-
 .../615f4ce9d877b668417c0c42.md               |   2 +-
 .../615f4dde9d72e3694cb9ee3b.md               |   2 +-
 .../615f4ec58334106a4170c2a8.md               |   2 +-
 .../615f4f9e4a40566b776a8f38.md               |   2 +-
 .../615f50473cc0196c6dd3892a.md               |   4 +-
 .../615f51257a8a516d80b6c743.md               |   2 +-
 .../615f51e4e5b24a6e80eccce1.md               |   2 +-
 .../615f522dea4f776f64dc3e91.md               |   2 +-
 .../615f5486b8fd4b71633f69b0.md               |   2 +-
 .../615f575b50b91e72af079480.md               |   2 +-
 .../615f5af373a68e744a3c5a76.md               |   2 +-
 .../615f5c1cb7575c7551ed8a40.md               |   2 +-
 .../615f5fd85d0062761f288364.md               |   2 +-
 .../615f61338c8ca176d6445574.md               |   2 +-
 .../615f666ac5edea782feb7e75.md               |   2 +-
 .../615f671b6d1919792745aa5d.md               |   2 +-
 .../615f6823d0815b7a991f2a75.md               |   2 +-
 .../615f6a7d4ba8037bc086c2c7.md               |   2 +-
 .../615f6b2d164f81809efd9bdc.md               |   2 +-
 .../615f6cc778f7698258467596.md               |   2 +-
 .../615f6fddaac1e083502d3e6a.md               |   2 +-
 .../615f70077a4ff98424236c1e.md               |   2 +-
 .../615f72a872354a850d4f533e.md               |   2 +-
 .../615f74a71f1e498619e38ee8.md               |   2 +-
 .../615f7ad94380408d971d14f6.md               |   4 +-
 .../615f7bc680f7168ea01ebf99.md               |   2 +-
 .../615f7c71eab8218f846e4503.md               |   2 +-
 .../615f7d489a581590d1350288.md               |   2 +-
 .../615f7de4487b64919bb4aa5e.md               |   2 +-
 .../615f7e7281626a92bbd62da8.md               |   2 +-
 .../615f7ecb09de9a938ef94756.md               |   2 +-
 .../615f7fa959ab75948f96a0d6.md               |   2 +-
 .../615f808d85793195b0f53be9.md               |   2 +-
 .../615f829d07b18f96f6f6684b.md               |   2 +-
 .../615f83ef928ec9982b785b6a.md               |   2 +-
 .../615f84f246e8ba98e3cd97be.md               |   2 +-
 .../615f887466db4ba14b5342cc.md               |   2 +-
 .../615f89e055040ba294719d2f.md               |   2 +-
 .../615f8bfe0f30a1a3c340356b.md               |   2 +-
 .../615f8f1223601fa546e93f31.md               |   2 +-
 .../615f905fbd1017a65ca224eb.md               |   2 +-
 .../615f94786869e1a7fec54375.md               |   2 +-
 .../615f951dff9317a900ef683f.md               |   2 +-
 .../62a115879a6d51422652cbfc.md               |   2 +-
 .../62a1166ed9a56d439c0770e7.md               |   2 +-
 .../62a23c1d505bfa13747c8a9b.md               |   2 +-
 .../62a23cb9bc467a147516b500.md               |   2 +-
 .../62a23d1c5f1c93161f3582ae.md               |   8 +-
 .../62a2401b9842721796b72850.md               |   2 +-
 .../62a24068d60b671847d1d4e2.md               |   2 +-
 .../62a2409897ec621942234cf6.md               |   2 +-
 .../62a240c67f3dbb1a1e6d95ee.md               |   2 +-
 .../62a24128d5e8af1b47ad1aab.md               |   2 +-
 .../62a24190868ca51c0b6e83c7.md               |   2 +-
 .../62a241df03c1f61ce936f5d9.md               |   2 +-
 .../62a2509ba163e020bb9d84ea.md               |   2 +-
 .../62a255dae245b52317da824a.md               |   2 +-
 .../62a257659d0d1e2456f24ba2.md               |   2 +-
 .../62a39f5a5790eb27c1e5d4bf.md               |   2 +-
 .../62a3a0a3c0a4b32915d26a6e.md               |   2 +-
 .../62a3a488b24fb32b91155d56.md               |   2 +-
 .../62a3a75d8466a12e009eff76.md               |   2 +-
 .../62a3a7e4f1060e2fc5ffb34b.md               |   2 +-
 .../62a3b365f1cdeb33efc2502e.md               |   2 +-
 .../62a3b3eab50e193608c19fc6.md               |   2 +-
 .../62a3b41c9494f937560640ab.md               |   2 +-
 .../62a3b49686792938718b90d3.md               |   2 +-
 .../62a3b506dbaead396f58a701.md               |   2 +-
 .../62a3b5843544ce3a77459c27.md               |   2 +-
 .../62a3b79d520a7f3d0e25afd6.md               |   2 +-
 .../62a3bb9aeefe4b3fc43c6d7b.md               |   2 +-
 .../62a3bec30ea7f941412512dc.md               |   2 +-
 .../62a3c0ab883fd9435cd5c518.md               |   2 +-
 .../62a3c2fccf186146b59c6e96.md               |   2 +-
 .../62a3c4a0e52767482c5202d4.md               |   2 +-
 .../62a3c668afc43b4a134cca81.md               |   2 +-
 .../62a3c8bf3980c14c438d2aed.md               |   2 +-
 .../62a3c91a2bab1b4d6fabb726.md               |   2 +-
 .../62a3cdb11478a34ff4a6470d.md               |   2 +-
 .../62a3cfc8328d3351b95d4f61.md               |   4 +-
 .../62a7beb1ad61211ac153707f.md               |   2 +-
 .../62a7bf06d2ad9d1c5024e833.md               |   2 +-
 .../62a7bfabe119461eb13ccbd6.md               |   2 +-
 .../62a7bfd9179b7f1f6a15fb1e.md               |   2 +-
 .../62a7c011eef9fb2084b966db.md               |   2 +-
 .../62a7c071219da921758a35bb.md               |   2 +-
 .../62a7c23e6b511f22ed71197a.md               |   2 +-
 .../62a7cc99577fbf25ee7a7d76.md               |   2 +-
 .../62a8a929e4260d08093756d2.md               |   2 +-
 .../62a8a9d876b2580943ba9351.md               |   2 +-
 .../62a8aa98a8289d0a698eee1d.md               |   4 +-
 .../62a8ab0e27cbaf0b54ba8a42.md               |   2 +-
 .../62a8ac194679e60cb561b0a8.md               |   2 +-
 .../62a8ad8e01d7cb0deae5ec66.md               |   2 +-
 .../62a8ade9b2f5b30ef0b606c2.md               |   2 +-
 .../62a8ae85fcaedc0fddc7ca4f.md               |   2 +-
 .../62a8b0b5053f16111b0b6b5f.md               |   2 +-
 .../62a8b1762b7775124622e1a3.md               |   2 +-
 .../62a8b3cc436db8139cc5fc09.md               |   2 +-
 .../62a8b6536156c51500739b41.md               |   2 +-
 .../62a8b711ab7a12161c7d9b67.md               |   2 +-
 .../62a8b9770050d217d2247801.md               |   2 +-
 .../62a8c0c8313e891a15ec23e7.md               |   2 +-
 .../62a8c1154d3ae11aee80353f.md               |   2 +-
 .../62a8c151b23bf21bc7c4fcba.md               |   2 +-
 .../62a8c173949f851c83c64756.md               |   2 +-
 .../62a8c242b25a531f2909e5bc.md               |   2 +-
 .../62a8c2bbbd8aa82052f47c53.md               |   2 +-
 .../62a8c31ec0ec78216a1c36a0.md               |   2 +-
 .../62a8c370ad8c68227137e0bc.md               |   2 +-
 .../62a8c3ebc6c35e23785e1a19.md               |   2 +-
 .../62a8c41ecaf1bd24536129b8.md               |   2 +-
 .../62a8c465fa7b0c252f4a8f0c.md               |   2 +-
 .../62a8c4db0710f3260f867a92.md               |   2 +-
 .../62a8c56247609626fa4a8d6e.md               |   2 +-
 .../62a8c5db7888af27af23f0dd.md               |   2 +-
 .../62a8c65b75664c28a8e59c16.md               |   2 +-
 .../62a8c6815f5f1a29735efe1b.md               |   2 +-
 .../62a8c7322e42962ad53ad204.md               |   2 +-
 .../62a8c7a59e72c02bb1c717d2.md               |   2 +-
 .../62a8c89e4272512d44fc1c66.md               |   2 +-
 .../62a8c8cee8e5cf2e001789b4.md               |   2 +-
 .../62a8ca22d29fe62f3952bdf5.md               |   2 +-
 .../62a8cb19bd7f8a304e5427a1.md               |   2 +-
 .../62a8cbd1e3595431d5a2b3f1.md               |   4 +-
 .../62a8cce1b0c32c33017cf2e9.md               |   2 +-
 .../62a8ce1dfc990134162b3bd9.md               |   2 +-
 .../62a8ce73d0dce43468f6689c.md               |   6 +-
 .../62a8cf22272d6d35af80d4ac.md               |   4 +-
 .../62a8d0337d7c67377a4a76c6.md               |   8 +-
 .../62a8d08668fa8b38732486e9.md               |   4 +-
 .../62a8d0c4f12c2239b6618582.md               |   2 +-
 .../62a8d0fdf2dad83a92883a80.md               |   2 +-
 .../62a8d143f2a58e3b6d6e9c33.md               |   2 +-
 .../62a8d1c72e8bb13c2074d93c.md               |   2 +-
 .../62a8d2146a3e853d0a6e28ca.md               |   2 +-
 .../62a8d24c97461b3ddb9397c8.md               |   2 +-
 .../62a8d2e2a073be3edb46116f.md               |   2 +-
 .../62a8d31ebbc10e3fe1b28e03.md               |   2 +-
 .../62a8d35660db4040ba292193.md               |   2 +-
 .../62a8d382cd075f4169223e14.md               |   2 +-
 .../62a8d539dc11cb42b5dd7ec8.md               |   2 +-
 .../62a8d61ddfe35744369365b7.md               |   8 +-
 .../62a8d6c7001ebc45350e3d16.md               |   6 +-
 .../62a8d7b8ab568b4649998954.md               |   2 +-
 .../62a8d81f539f004776dd9b1e.md               |   2 +-
 .../62a8dd468debb449b4454086.md               |   2 +-
 .../62a8dd9cdb16324b04cfd958.md               |   2 +-
 .../62a8dfcf7fb1044d2f478fd1.md               |   2 +-
 .../62a8e0d1d0110b4ec421489f.md               |   2 +-
 .../62a8e142f7f0bd4fed898de3.md               |   2 +-
 .../62a8e1dc897df55108bcb5e8.md               |   2 +-
 .../62a8e21398ad61520edb724f.md               |   2 +-
 .../62a8e24c673b075317cc0b09.md               |   2 +-
 .../62a8e271f8e3d1541f9624ad.md               |   2 +-
 .../62a8e35675c18c56354c08cf.md               |   8 +-
 .../62a8e41e2f190c58404dd46e.md               |   6 +-
 .../62a8e45cc600c3591cee671a.md               |   2 +-
 .../62a8e49f4df7af5ae2d7a616.md               |   2 +-
 .../62a8e4dc6a60f85bf256a0cb.md               |   2 +-
 .../62a8ed36d7a7915dfa444ba2.md               |   4 +-
 .../62a8edd05e27cc668051686f.md               |   4 +-
 .../62a8ee154c8946678775c4a4.md               |   2 +-
 .../62a8ee71f018e968a056d369.md               |   2 +-
 .../62a8eec45f77bc69e8775294.md               |   4 +-
 .../62a8eefe2e68b66ac563816b.md               |   2 +-
 .../62a8ef6a52292f6bdca4f6f8.md               |   2 +-
 .../62a8ef8f0c76a46cd221a68c.md               |   4 +-
 .../62a8efb0e3ce826db8daf80f.md               |   4 +-
 .../62a8eff21c0b0f6ebe5b8e38.md               |   4 +-
 .../62a8f06fb318666fef69f91e.md               |   2 +-
 .../62a8f14fe6d1fc72454648c7.md               |   2 +-
 .../62a8f1d5f5ddbf74c07f733b.md               |   2 +-
 .../62a8f20463b324759953edad.md               |   2 +-
 .../62a8f256b813a476cae51f49.md               |   2 +-
 .../62a8f2bc37675e77d5835235.md               |   2 +-
 .../62a8f35bde1750791f58773f.md               |   2 +-
 .../62a94114ce0b8918b487390f.md               |   2 +-
 .../62aa1cea594f152ba626b872.md               |   2 +-
 .../62aa1d6736ba262cfa74344b.md               |   2 +-
 .../62aa1d9f535e102e4663e7a6.md               |   2 +-
 .../62aa1e3c7c3d552fb04f0f18.md               |   2 +-
 .../62aa1e8ccd579330e097ce44.md               |   2 +-
 .../62aa1eec891ed731db227a36.md               |   2 +-
 .../62aa1fed3d4e873366ff3131.md               |   2 +-
 .../62aa204c1e1d33348ff09944.md               |   4 +-
 .../62aa20e9cf1be9358f5aceae.md               |   6 +-
 .../62aa2136fc49b836dfedb959.md               |   2 +-
 .../62aa21971e3b743844849985.md               |   2 +-
 .../62aa21ea8d9d9f396b95dd87.md               |   2 +-
 .../62aa226207f33d3ad4c6f546.md               |   8 +-
 .../62aa22aba186563bcbf2c395.md               |   2 +-
 .../62aa234322d4ad3e8bce42cc.md               |   2 +-
 .../62aa2469c77b363fdb4f0e06.md               |   2 +-
 .../62aa252c3b1073415ba2b898.md               |   2 +-
 .../62aa258da314ef42ba0a1858.md               |   2 +-
 .../62aa25fcb5837d43b4d9873d.md               |   2 +-
 .../62aa2626c3c10244b94c787b.md               |   2 +-
 .../62aa264d23cdaa45a20efada.md               |   4 +-
 .../62aa26cca3cd3d46c431e73b.md               |   2 +-
 .../62aa27227399d647e1c37a3c.md               |   6 +-
 .../62aa27560def7048d7b4a095.md               |   4 +-
 .../62aa27c40ca6f04ab8be5fac.md               |   6 +-
 .../62aa28032d863d4bd8058799.md               |   2 +-
 .../62aa287434dc284cea01157c.md               |   2 +-
 .../62aa28bbd6323e4dfb3ac43e.md               |   2 +-
 .../62aa28fb651bf14efa2dbb16.md               |   2 +-
 .../62aa2943669c9d5026af6985.md               |   2 +-
 .../62aa2999ec27ec516655eba6.md               |   2 +-
 .../62aa29d8f8f88152c91350ca.md               |   2 +-
 .../62aa2aec2f09d454253aad6c.md               |   2 +-
 .../62aa2ba9cd881355a6f0a5a8.md               |   2 +-
 .../62b46e3a8d4be31be5af793d.md               |   2 +-
 .../62ba17beef16c563069a65d8.md               |   2 +-
 .../62fc1ee0c5a89717d4785729.md               |   2 +-
 .../62fc20387ef88d1d1998aac5.md               |   2 +-
 .../62fc211760bfc220f4734800.md               |   2 +-
 .../build-a-survey-form.md                    |   2 +-
 .../falsy-bouncer.md                          |  10 +-
 ...-one-decimal-by-another-with-javascript.md |   6 -
 .../escape-sequences-in-strings.md            |  12 +-
 ...-variables-with-the-assignment-operator.md |   6 -
 .../practice-comparing-different-values.md    |   2 +-
 .../quoting-strings-with-single-quotes.md     |   6 -
 .../basic-javascript/stand-in-line.md         |   4 +-
 .../understand-string-immutability.md         |   4 +-
 .../use-recursion-to-create-a-countdown.md    |   7 +
 ...-recursion-to-create-a-range-of-numbers.md |   7 +
 .../mutate-an-array-declared-with-const.md    |   2 +-
 ...syntax-to-define-a-constructor-function.md |  31 ++-
 ...-concise-declarative-functions-with-es6.md |   3 +-
 ...f-an-array-using-concat-instead-of-push.md |  10 +-
 ...tand-functional-programming-terminology.md |   2 +-
 .../make-a-person.md                          |   8 -
 .../steamroller.md                            |   7 +
 .../sum-all-primes.md                         |  56 +++--
 .../add-methods-after-inheritance.md          |  48 +++-
 .../build-a-25-5-clock.md                     |   2 +-
 .../build-a-drum-machine.md                   |  18 +-
 .../build-a-javascript-calculator.md          |   2 +-
 .../build-a-markdown-previewer.md             |   2 +-
 .../build-a-random-quote-machine.md           |   2 +-
 .../visualize-data-with-a-bar-chart.md        |   2 +-
 .../visualize-data-with-a-choropleth-map.md   |   2 +-
 .../visualize-data-with-a-heat-map.md         |   2 +-
 ...visualize-data-with-a-scatterplot-graph.md |   2 +-
 .../visualize-data-with-a-treemap-diagram.md  |   2 +-
 .../add-document-elements-with-d3.md          |   6 +-
 .../add-labels-to-scatter-plot-circles.md     |   8 +-
 .../change-styles-based-on-data.md            |   4 +-
 .../create-a-linear-scale-with-d3.md          |   8 +-
 .../create-a-scatterplot-with-svg-circles.md  |  10 +-
 .../display-shapes-with-svg.md                |   8 +-
 ...on-data-to-find-a-users-gps-coordinates.md |   4 +-
 .../exercise-tracker.md                       |  38 +--
 .../request-header-parser-microservice.md     |   8 +-
 .../timestamp-microservice.md                 |  10 +-
 .../url-shortener-microservice.md             |   2 +-
 ...hain-middleware-to-create-a-time-server.md |  12 +-
 ...t-route-parameter-input-from-the-client.md |   8 +-
 ...-a-root-level-request-logger-middleware.md |  10 +-
 .../meet-the-node-console.md                  |   2 +-
 .../use-body-parser-to-parse-post-requests.md |   2 +-
 .../use-the-.env-file.md                      |  18 +-
 .../add-a-license-to-your-package.json.md     |   6 +-
 ...project-with-external-packages-from-npm.md |   6 +-
 ...e-of-any-node.js-project-or-npm-package.md |   6 +-
 ...remove-a-package-from-your-dependencies.md |   4 +-
 ...he-latest-minor-version-of-a-dependency.md |   6 +-
 ...he-latest-patch-version-of-a-dependency.md |   2 +-
 .../create-and-save-a-record-of-a-model.md    |   4 +-
 .../create-many-records-with-model.create.md  |   4 +-
 .../install-and-set-up-mongoose.md            |   8 +-
 .../use-model.find-to-search-your-database.md |   2 +-
 .../authentication-with-socket.io.md          |   2 +-
 .../create-new-middleware.md                  |   8 +-
 .../registration-of-new-users.md              |  12 +-
 .../send-and-display-chat-messages.md         |   4 +-
 .../serialization-of-a-user-object.md         |  10 +-
 .../set-up-a-template-engine.md               |   2 +-
 .../set-up-passport.md                        |   4 +-
 .../use-a-template-engines-powers.md          |   8 +-
 .../learn-how-javascript-assertions-work.md   |  14 +-
 ...esponse-using-chai-http-iv---put-method.md |  30 +--
 ...sts-on-api-endpoints-using-chai-http-ii.md |  12 +-
 ...nctional-tests-using-a-headless-browser.md |  40 ++--
 .../american-british-translator.md            |   2 +-
 .../issue-tracker.md                          |  12 +-
 .../metric-imperial-converter.md              |   2 +-
 .../personal-library.md                       |   5 +-
 .../sudoku-solver.md                          |   2 +-
 .../data-cleaning-and-visualizations.md       |   2 +-
 .../data-cleaning-with-dataframes.md          |  10 +-
 .../how-to-use-jupyter-notebooks-intro.md     |  14 +-
 .../jupyter-notebooks-cells.md                |  16 +-
 ...-notebooks-importing-and-exporting-data.md |  20 +-
 .../numpy-boolean-arrays.md                   |   8 +-
 .../numpy-introduction-a.md                   |  16 +-
 .../numpy-introduction-b.md                   |  16 +-
 .../numpy-operations.md                       |  10 +-
 ...onal-selection-and-modifying-dataframes.md |  10 +-
 .../pandas-creating-columns.md                |  10 +-
 .../pandas-dataframes.md                      |   8 +-
 ...ndas-indexing-and-conditional-selection.md |  10 +-
 .../pandas-introduction.md                    |  10 +-
 .../parsing-html-and-saving-data.md           |  10 +-
 .../python-functions-and-collections.md       |  16 +-
 .../python-introduction.md                    |  18 +-
 .../python-iteration-and-modules.md           |  10 +-
 .../reading-data-csv-and-txt.md               |   8 +-
 .../reading-data-from-databases.md            |  14 +-
 .../reading-data-introduction.md              |  10 +-
 .../medical-data-visualizer.md                |  44 ++--
 .../page-view-time-series-visualizer.md       |  40 ++--
 .../sea-level-predictor.md                    |   1 +
 .../numpy/basics-of-numpy.md                  |   2 +-
 .../numpy/initializing-different-arrays.md    |   2 +-
 .../anonymous-message-board.md                |  24 +-
 .../port-scanner.md                           |  10 +-
 .../secure-real-time-multiplayer-game.md      |   2 +-
 .../stock-price-checker.md                    |   2 +-
 ...ash-and-compare-passwords-synchronously.md |   2 +-
 .../install-and-require-helmet.md             |  14 +-
 ...pting-xss-attacks-with-helmet.xssfilter.md |   3 +-
 .../developing-a-banner-grabber.md            |   2 +-
 .../algorithms/implement-binary-search.md     |  12 +-
 .../algorithms/implement-insertion-sort.md    |  14 +-
 .../algorithms/implement-quick-sort.md        |  12 +-
 ...ment-is-present-in-a-binary-search-tree.md |   2 +-
 .../check-if-binary-search-tree.md            |   2 +-
 .../create-a-doubly-linked-list.md            |   4 +-
 .../data-structures/create-a-hash-table.md    |  10 +-
 .../create-a-map-data-structure.md            |   2 +-
 .../data-structures/create-a-set-class.md     |   2 +-
 .../create-a-trie-search-tree.md              |   2 +-
 .../create-an-es6-javascript-map.md           |  14 +-
 .../data-structures/depth-first-search.md     |   2 +-
 ...-maximum-height-of-a-binary-search-tree.md |   4 +-
 ...d-maximum-value-in-a-binary-search-tree.md |   2 +-
 .../implement-heap-sort-with-a-min-heap.md    |   4 +-
 .../insert-an-element-into-a-max-heap.md      |   2 +-
 .../data-structures/invert-a-binary-tree.md   |   2 +-
 ...erform-a-difference-on-two-sets-of-data.md |   2 +-
 ...form-a-subset-check-on-two-sets-of-data.md |   2 +-
 ...orm-an-intersection-on-two-sets-of-data.md |   2 +-
 .../remove-elements-from-a-linked-list.md     |   2 +-
 .../reverse-a-doubly-linked-list.md           |   2 +-
 ...th-first-search-in-a-binary-search-tree.md |   2 +-
 ...th-first-search-in-a-binary-search-tree.md |   2 +-
 .../problem-10-summation-of-primes.md         |  54 +++--
 .../problem-101-optimum-polynomial.md         |   9 +-
 ...problem-103-special-subset-sums-optimum.md |   9 +-
 .../problem-107-minimal-network.md            |   6 +-
 .../problem-108-diophantine-reciprocals-i.md  |  10 +-
 .../project-euler/problem-109-darts.md        |  21 +-
 .../problem-111-primes-with-runs.md           |   2 +-
 ...oblem-114-counting-block-combinations-i.md |   2 +-
 .../problem-116-red-green-or-blue-tiles.md    |   6 +-
 .../problem-117-red-green-and-blue-tiles.md   |   2 +-
 .../problem-122-efficient-exponentiation.md   |  22 +-
 .../problem-126-cuboid-layers.md              |   2 +-
 .../problem-128-hexagonal-tile-differences.md |   2 +-
 .../problem-137-fibonacci-golden-nuggets.md   |  15 +-
 ...problem-138-special-isosceles-triangles.md |   2 +-
 .../problem-139-pythagorean-tiles.md          |   2 +-
 ...m-140-modified-fibonacci-golden-nuggets.md |   8 +-
 ...ting-the-torricelli-point-of-a-triangle.md |   2 +-
 ...m-147-rectangles-in-cross-hatched-grids.md |  11 +-
 ...searching-for-a-maximum-sum-subsequence.md |   8 +-
 .../project-euler/problem-15-lattice-paths.md |   2 +-
 ...y-for-a-sub-triangle-having-minimum-sum.md |  24 +-
 ...tandard-sizes-an-expected-value-problem.md |   2 +-
 ...lem-153-investigating-gaussian-integers.md |   2 +-
 .../problem-154-exploring-pascals-pyramid.md  |   2 +-
 ...problem-155-counting-capacitor-circuits.md |   2 +-
 .../problem-156-counting-digits.md            |   2 +-
 ...em-157-solving-the-diophantine-equation.md |  18 +-
 ...hically-after-its-neighbour-to-the-left.md |   3 +-
 ...159-digital-root-sums-of-factorisations.md |  29 +--
 .../problem-160-factorial-trailing-digits.md  |   7 +-
 .../project-euler/problem-161-triominoes.md   |   6 +-
 .../problem-163-cross-hatched-triangles.md    |   8 +-
 ...s-have-a-sum-greater-than-a-given-value.md |   3 +-
 .../problem-165-intersections.md              |  12 +-
 .../project-euler/problem-166-criss-cross.md  |   9 +-
 ...an-be-expressed-as-a-sum-of-powers-of-2.md |  13 +-
 ...can-be-formed-by-concatenating-products.md |   9 +-
 ...one-two-three-...-distinct-arrangements.md |   9 +-
 ...an-be-expressed-as-a-sum-of-powers-of-2.md |   3 +-
 ...oblem-177-integer-angled-quadrilaterals.md |   2 +-
 ...of-two-different-colours-can-be-grouped.md |   3 +-
 .../problem-182-rsa-encryption.md             |  33 +--
 ...lem-184-triangles-containing-the-origin.md |  12 +-
 .../project-euler/problem-185-number-mind.md  |  62 ++---
 .../problem-186-connectedness-of-a-network.md |  24 +-
 ...lem-189-tri-colouring-a-triangular-grid.md |   6 +-
 .../problem-19-counting-sundays.md            |   8 +-
 .../problem-191-prize-strings.md              |  10 +-
 ...viour-of-a-recursively-defined-sequence.md |   4 +-
 .../problem-198-ambiguous-numbers.md          |   2 +-
 .../problem-199-iterative-circle-packing.md   |  10 +-
 .../problem-201-subsets-with-a-unique-sum.md  |  33 +--
 ...em-203-squarefree-binomial-coefficients.md |  16 +-
 .../problem-206-concealed-square.md           |   2 +-
 ...problem-207-integer-partition-equations.md |  32 ++-
 .../project-euler/problem-208-robot-walks.md  |   4 +-
 .../problem-209-circular-logic.md             |  26 +--
 .../problem-210-obtuse-angled-triangles.md    |  10 +-
 .../problem-211-divisor-square-sum.md         |   2 +-
 .../problem-212-combined-volume-of-cuboids.md |  30 ++-
 .../problem-214-totient-chains.md             |  15 +-
 .../problem-215-crack-free-walls.md           |   4 +-
 ...-primality-of-numbers-of-the-form-2n2-1.md |   2 +-
 .../problem-217-balanced-numbers.md           |   4 +-
 .../problem-220-heighway-dragon.md            |  16 +-
 .../problem-222-sphere-packing.md             |   6 +-
 ...em-224-almost-right-angled-triangles-ii.md |   6 +-
 .../problem-225-tribonacci-non-divisors.md    |   4 +-
 .../problem-228-minkowski-sums.md             |   8 +-
 ...-229-four-representations-using-squares.md |  18 +-
 .../problem-230-fibonacci-words.md            |  22 +-
 .../problem-236-luxury-hampers.md             |  12 +-
 ...blem-237-tours-on-a-4-x-n-playing-board.md |   2 +-
 .../problem-238-infinite-string-tour.md       |   6 +-
 .../project-euler/problem-240-top-dice.md     |   9 +-
 .../project-euler/problem-244-sliders.md      |  22 +-
 .../problem-246-tangents-to-an-ellipse.md     |   4 +-
 .../problem-247-squares-under-a-hyperbola.md  |   2 +-
 .../project-euler/problem-252-convex-holes.md |   9 +-
 .../project-euler/problem-253-tidying-up.md   |  30 +--
 .../problem-256-tatami-free-rooms.md          |   2 +-
 .../problem-257-angular-bisectors.md          |   2 +-
 .../problem-261-pivotal-square-sums.md        |   9 +-
 .../problem-265-binary-circles.md             |   2 +-
 ...ur-distinct-prime-factors-less-than-100.md |   3 +-
 .../problem-270-cutting-squares.md            |   2 +-
 .../problem-275-balanced-sculptures.md        |   2 +-
 .../problem-281-pizza-toppings.md             |   2 +-
 .../problem-282-the-ackermann-function.md     |   8 +-
 ...encoding-a-simple-compression-algorithm.md |   2 +-
 .../problem-288-an-enormous-factorial.md      |   7 +-
 .../problem-289-eulerian-cycles.md            |   2 +-
 .../problem-295-lenticular-holes.md           |   9 +-
 ...roblem-296-angular-bisector-and-tangent.md |   2 +-
 .../problem-298-selective-amnesia.md          |  22 +-
 .../problem-299-three-similar-triangles.md    |   2 +-
 .../problem-300-protein-folding.md            |   2 +-
 .../problem-306-paper-strip-game.md           |   2 +-
 .../problem-309-integer-ladders.md            |   2 +-
 ...em-311-biclinic-integral-quadrilaterals.md |   2 +-
 ...em-312-cyclic-paths-on-sierpiski-graphs.md |  13 +-
 .../project-euler/problem-313-sliding-game.md |   4 +-
 .../problem-314-the-mouse-on-the-moon.md      |   2 +-
 .../problem-315-digital-root-clocks.md        |   2 +-
 .../project-euler/problem-318-2011-nines.md   |  15 +-
 .../problem-321-swapping-counters.md          |   4 +-
 .../problem-324-building-a-tower.md           |  10 +-
 .../problem-327-rooms-of-doom.md              |   2 +-
 .../problem-330-eulers-number.md              |  15 +-
 .../project-euler/problem-331-cross-flips.md  |   2 +-
 .../problem-332-spherical-triangles.md        |   2 +-
 .../problem-333-special-partitions.md         |   6 +-
 .../problem-334-spilling-the-beans.md         |  15 +-
 .../problem-335-gathering-the-beans.md        |   2 +-
 .../problem-336-maximix-arrangements.md       |   2 +-
 ...blem-338-cutting-rectangular-grid-paper.md |   2 +-
 .../problem-340-crazy-function.md             |   6 +-
 ...em-341-golombs-self-describing-sequence.md |   6 +-
 .../problem-344-silver-dollar-game.md         |   2 +-
 .../project-euler/problem-345-matrix-sum.md   |  35 +--
 .../problem-348-sum-of-a-square-and-a-cube.md |   9 +-
 .../problem-35-circular-primes.md             |   2 +-
 ...e-least-greatest-and-the-greatest-least.md |   9 +-
 .../problem-351-hexagonal-orchards.md         |   2 +-
 ...oblem-354-distances-in-a-bees-honeycomb.md |   2 +-
 .../problem-358-cyclic-numbers.md             |  22 +-
 .../problem-359-hilberts-new-hotel.md         |  12 +-
 ...-361-subsequence-of-thue-morse-sequence.md |   6 +-
 .../project-euler/problem-363-bzier-curves.md |   2 +-
 .../problem-364-comfortable-distance.md       |   2 +-
 .../problem-375-minimum-of-subsequences.md    |   6 +-
 .../problem-376-nontransitive-sets-of-dice.md |   6 +-
 .../problem-38-pandigital-multiples.md        |   6 +-
 .../problem-380-amazing-mazes.md              |   2 +-
 .../problem-384-rudin-shapiro-sequence.md     |  15 +-
 .../problem-385-ellipses-inside-triangles.md  |   2 +-
 .../problem-392-enmeshed-unit-circle.md       |   2 +-
 .../project-euler/problem-394-eating-pie.md   |   2 +-
 .../problem-395-pythagorean-tree.md           |   2 +-
 .../problem-400-fibonacci-tree-game.md        |   2 +-
 .../problem-404-crisscross-ellipses.md        |   2 +-
 .../problem-405-a-rectangular-tiling.md       |   4 +-
 .../problem-406-guessing-game.md              |   9 +-
 .../project-euler/problem-411-uphill-paths.md |   2 +-
 .../problem-412-gnomon-numbering.md           |   4 +-
 .../problem-414-kaprekar-constant.md          |  10 +-
 .../problem-417-reciprocal-cycles-ii.md       |  15 +-
 ...problem-420-2x2-positive-integer-matrix.md |  12 +-
 ...m-422-sequence-of-points-on-a-hyperbola.md |   2 +-
 .../problem-423-consecutive-die-throws.md     |   7 +-
 .../project-euler/problem-424-kakuro.md       |   2 +-
 .../problem-426-box-ball-system.md            |  11 +-
 .../problem-428-necklace-of-circles.md        |   2 +-
 .../project-euler/problem-430-range-flips.md  |   2 +-
 .../problem-431-square-space-silo.md          |   2 +-
 .../problem-433-steps-in-euclids-algorithm.md |   6 +-
 .../project-euler/problem-434-rigid-graphs.md |   4 +-
 .../problem-437-fibonacci-primitive-roots.md  |  16 +-
 .../problem-440-gcd-and-tiling.md             |  11 +-
 .../project-euler/problem-443-gcd-sequence.md |  12 +-
 ...blem-450-hypocycloid-and-lattice-points.md |   7 +-
 .../problem-451-modular-inverses.md           |  12 +-
 .../problem-453-lattice-quadrilaterals.md     |   2 +-
 ...problem-455-powers-with-trailing-digits.md |   9 +-
 ...-456-triangles-containing-the-origin-ii.md |  17 +-
 .../problem-459-flipping-game.md              |   4 +-
 .../problem-460-an-ant-on-the-move.md         |   2 +-
 .../project-euler/problem-461-almost-pi.md    |   2 +-
 ...problem-463-a-weird-recurrence-relation.md |  10 +-
 .../problem-465-polar-polygons.md             |   2 +-
 ...istinct-terms-in-a-multiplication-table.md |  15 +-
 .../project-euler/problem-467-superinteger.md |  18 +-
 ...mooth-divisors-of-binomial-coefficients.md |  14 +-
 ...oblem-471-triangle-inscribed-in-ellipse.md |   4 +-
 .../problem-472-comfortable-distance-ii.md    |   2 +-
 .../problem-480-the-last-question.md          |  54 ++---
 .../project-euler/problem-54-poker-hands.md   |  10 +-
 .../problem-6-sum-square-difference.md        |  16 +-
 .../problem-61-cyclical-figurate-numbers.md   |  10 +-
 .../problem-68-magic-5-gon-ring.md            |   6 +-
 .../problem-74-digit-factorial-chains.md      |  12 +-
 .../problem-81-path-sum-two-ways.md           |  10 +-
 .../problem-82-path-sum-three-ways.md         |  10 +-
 .../problem-83-path-sum-four-ways.md          |  10 +-
 .../problem-85-counting-rectangles.md         |   2 +-
 .../project-euler/problem-86-cuboid-route.md  |   2 +-
 .../problem-90-cube-digit-pairs.md            |   2 +-
 ...ight-triangles-with-integer-coordinates.md |   4 +-
 .../problem-92-square-digit-chains.md         |   6 +-
 .../problem-95-amicable-chains.md             |   4 +-
 .../rosetta-code/100-doors.md                 |   8 +-
 .../rosetta-code/24-game.md                   |   8 +-
 .../rosetta-code/balanced-brackets.md         |  10 +-
 .../rosetta-code/compare-a-list-of-strings.md |   2 +-
 .../convert-seconds-to-compound-duration.md   |  18 +-
 .../cumulative-standard-deviation.md          |  12 +-
 .../rosetta-code/discordian-date.md           |   2 +-
 .../rosetta-code/euler-method.md              |   2 +-
 .../rosetta-code/execute-brain.md             |  34 +--
 .../hofstadter-figure-figure-sequences.md     |   4 +-
 .../rosetta-code/least-common-multiple.md     |   6 +-
 .../longest-common-subsequence.md             |   6 +-
 .../sailors-coconuts-and-a-monkey-problem.md  |   6 +-
 .../rosetta-code/sedols.md                    |   2 +-
 .../rosetta-code/self-describing-numbers.md   |   2 +-
 .../rosetta-code/sha-256.md                   |   3 +-
 .../sorting-algorithms-strand-sort.md         |   2 +-
 .../rosetta-code/soundex.md                   |   8 +-
 .../rosetta-code/towers-of-hanoi.md           |   2 +-
 .../rosetta-code/y-combinator.md              |   2 +-
 .../zhang-suen-thinning-algorithm.md          |   7 +-
 .../build-a-camper-leaderboard.md             |   2 +-
 .../build-a-light-bright-app.md               |   2 +-
 .../build-a-nightlife-coordination-app.md     |   2 +-
 .../build-a-pinterest-clone.md                |   2 +-
 .../take-home-projects/build-a-pong-game.md   |   2 +-
 .../take-home-projects/build-a-recipe-box.md  |   2 +-
 .../build-a-roguelike-dungeon-crawler-game.md |   2 +-
 .../take-home-projects/build-a-simon-game.md  |   2 +-
 .../build-a-tic-tac-toe-game.md               |   2 +-
 .../build-a-wikipedia-viewer.md               |   8 +-
 .../build-the-game-of-life.md                 |   2 +-
 .../chart-the-stock-market.md                 |   2 +-
 .../manage-a-book-trading-club.md             |   6 +-
 .../map-data-across-the-globe.md              |   2 +-
 .../p2p-video-chat-application.md             |   2 +-
 ...-contiguity-with-a-force-directed-graph.md |   2 +-
 .../show-the-local-weather.md                 |   2 +-
 .../use-the-twitch-json-api.md                |   2 +-
 .../cat-and-dog-image-classifier.md           |   4 +-
 .../rock-paper-scissors.md                    |   4 +-
 .../build-a-personal-portfolio-webpage.md     |  20 +-
 .../build-a-survey-form.md                    |  12 +-
 .../build-a-technical-documentation-page.md   |  42 ++--
 .../61329b210dac0b08047fd6ab.md               |   4 +-
 .../61329d52e5010e08d9b9d66b.md               |  20 +-
 .../6133d11ef548f51f876149e3.md               |  18 +-
 .../6140827cff96e906bd38fc2b.md               |  16 +-
 .../6140883f74224508174794c0.md               |  12 +-
 .../61408e4ae3e35d08feb260eb.md               |  22 +-
 .../61408f155e798909b6908712.md               |  12 +-
 .../6141fabd6f75610664e908fd.md               |   4 +-
 .../6141fed65b61320743da5894.md               |  10 +-
 .../614202874ca576084fca625f.md               |   8 +-
 .../614206033d366c090ca7dd42.md               |   6 +-
 .../61435e3c0679a306c20f1acc.md               |   8 +-
 .../6143610161323a081b249c19.md               |   4 +-
 .../6143639d5eddc7094161648c.md               |  18 +-
 .../6143908b6aafb00a659ca189.md               |  12 +-
 .../6143920c8eafb00b735746ce.md               |   2 +-
 .../6143931a113bb80c45546287.md               |   6 +-
 .../6143956ed76ed60e012faa51.md               |  10 +-
 .../614396f7ae83f20ea6f9f4b3.md               |  14 +-
 .../6143cb26f7edff2dc28f7da5.md               |   2 +-
 .../6144e818fd5ea704fe56081d.md               |   2 +-
 .../6144f8dc6849e405dd8bb829.md               |   2 +-
 .../6145e6eeaa66c605eb087fe9.md               |   2 +-
 .../6145e8b5080a5f06bb0223d0.md               |  12 +-
 .../6145eb5f08a38a0786c7a80c.md               |   2 +-
 .../6145ed1f22caab087630aaad.md               |   2 +-
 .../6145ee65e2e1530938cb594d.md               |   2 +-
 .../6145f02240ff8f09f7ec913c.md               |   2 +-
 .../6145f14f019a4b0adb94b051.md               |   8 +-
 .../6145f47393fbe70c4d885f9c.md               |   4 +-
 .../6145f59029474c0d3dc1c8b8.md               |   8 +-
 .../6145f685797bd30df9784e8c.md               |   2 +-
 .../6145f829ac6a920ebf5797d7.md               |   2 +-
 .../6145f8f8bcd4370f6509078e.md               |   2 +-
 .../6145fb5018cb5b100cb2a88c.md               |   2 +-
 .../6145fc3707fc3310c277f5c8.md               |  14 +-
 .../614796cb8086be482d60e0ac.md               |   8 +-
 .../6147a14ef5668b5881ef2297.md               |   2 +-
 .../614878f7a412310647873015.md               |  10 +-
 .../61487b77d4a37707073a64e5.md               |   8 +-
 .../61487da611a65307e78d2c20.md               |  14 +-
 .../61487f703571b60899055cf9.md               |   2 +-
 .../614883b6fa720e09fb167de9.md               |  12 +-
 .../614884c1f5d6f30ab3d78cde.md               |  20 +-
 .../61488ecfd05e290b5712e6da.md               |   2 +-
 .../6148d99cdc7acd0c519862cb.md               |   8 +-
 .../6148da157cc0bd0d06df5c0a.md               |   2 +-
 .../6148dc095264000dce348bf5.md               |   2 +-
 .../6148dcaaf2e8750e6cb4501a.md               |   2 +-
 .../6148dd31d210990f0fb140f8.md               |   4 +-
 .../6148defa9c01520fb9d178a0.md               |   4 +-
 .../6148dfab9b54c110577de165.md               |   2 +-
 .../6148e0bcc13efd10f7d7a6a9.md               |   2 +-
 .../6148e161ecec9511941f8833.md               |   8 +-
 .../6148e28706b34912340fd042.md               |   2 +-
 .../6148e335c1edd512d00e4691.md               |   2 +-
 .../6148e41c728f65138addf9cc.md               |   6 +-
 .../6148e5aeb102e3142de026a2.md               |   4 +-
 .../614ccc21ea91ef1736b9b578.md               |   8 +-
 .../5f33071498eb2472b87ddee4.md               |   2 +-
 .../5f3313e74582ad9d063e3a38.md               |   2 +-
 .../5f331e55dfab7a896e53c3a1.md               |   2 +-
 .../5f3326b143638ee1a09ff1e3.md               |   2 +-
 .../5f33294a6af5e9188dbdb8f3.md               |   2 +-
 .../5f332a88dc25a0fd25c7687a.md               |   2 +-
 .../5f332b23c2045fb843337579.md               |   2 +-
 .../5f344fc1520b6719f2e35605.md               |  15 +-
 .../5f3477aefa51bfc29327200b.md               |   2 +-
 .../5f356ed60785e1f3e9850b6e.md               |   6 +-
 .../5f356ed60a5decd94ab66986.md               |   8 +-
 .../5f356ed6199b0cdef1d2be8f.md               |   6 +-
 .../5f356ed63c7807a4f1e6d054.md               |   8 +-
 .../5f356ed63e0fa262326eef05.md               |   8 +-
 .../5f356ed656a336993abd9f7c.md               |   8 +-
 .../5f356ed69db0a491745e2bb6.md               |   8 +-
 .../5f356ed6cf6eab5f15f5cfe6.md               |   8 +-
 .../5f3c866d0fc037f7311b4ac8.md               |   8 +-
 .../5f3c866d28d7ad0de6470505.md               |   8 +-
 .../5f3c866d5414453fc2d7b480.md               |   8 +-
 .../5f3c866daec9a49519871816.md               |   8 +-
 .../5f3c866dbf362f99b9a0c6d0.md               |  10 +-
 .../5f3ef6e03d719d5ac4738993.md               |   6 +-
 .../5f3ef6e04559b939080db057.md               |  12 +-
 .../5f3ef6e050279c7a4a7101d3.md               |  12 +-
 .../5f3ef6e05473f91f948724ab.md               |   2 +-
 .../5f3ef6e056bdde6ae6892ba2.md               |   8 +-
 .../5f3ef6e06d34faac0447fc44.md               |   8 +-
 .../5f3ef6e0819d4f23ca7285e6.md               |   2 +-
 .../5f3ef6e087d56ed3ffdc36be.md               |   2 +-
 .../5f3ef6e0a81099d9a697b550.md               |   2 +-
 .../5f3f26fa39591db45e5cd7a0.md               |   8 +-
 .../5f459a7ceb8b5c446656d88b.md               |   6 +-
 .../5f459cf202c2a3472fae6a9f.md               |   6 +-
 .../5f459fd48bdc98491ca6d1a3.md               |   4 +-
 .../5f475bb508746c16c9431d42.md               |  12 +-
 .../5f475e1c7f71a61d913836c6.md               |   8 +-
 .../5f716ad029ee4053c7027a7a.md               |   8 +-
 .../5f716bee5838c354c728a7c5.md               |  10 +-
 .../5f7b88d37b1f98386f04edc0.md               |   2 +-
 .../6140de31b1f5b420410728ff.md               |   2 +-
 .../6140df547f09402144e40b92.md               |   2 +-
 .../6140e0d875ec16262f26432b.md               |   2 +-
 .../6140f4b5c1555a2960de1e5f.md               |   2 +-
 .../614100d7d335bb2a5ff74f1f.md               |   2 +-
 .../6141019eadec6d2c6c6f007b.md               |   2 +-
 .../6169ab1aaeb4cd1174def700.md               |   4 +-
 .../6169b1357fcb701bb5efc619.md               |   2 +-
 .../6169b284950e171d8d0bb16a.md               |   2 +-
 .../616d4a84b756d9c4b8255093.md               |   2 +-
 .../61764f23ea21477b76f3b80f.md               |   2 +-
 .../61764fdda535587e1fefb3aa.md               |   2 +-
 .../6176519636a76b810ab1219a.md               |   2 +-
 .../617b954d9f4f6217a749380e.md               |   2 +-
 .../619b7396e57b771f903be90d.md               |   2 +-
 .../61a4ae5f29eb5584187201c3.md               |   2 +-
 .../61adc91467b5d59328b9f781.md               |   2 +-
 .../61b092eb9e7fc020b43b1bb2.md               |   2 +-
 .../61b0934c9e7fc020b43b1bb7.md               |   2 +-
 .../61b0936d9e7fc020b43b1bb8.md               |   2 +-
 .../61b095a79e7fc020b43b1bba.md               |   2 +-
 .../61b095c79e7fc020b43b1bbb.md               |   2 +-
 .../61b30a286c228bd0c493c09a.md               |   2 +-
 .../61b315e76a63b3ecbbb11b75.md               |   2 +-
 .../61b3183655ec10efd8c0bb07.md               |   2 +-
 .../61b31a451057fff645ec09be.md               |   2 +-
 .../61b31cd7b0c76bfc076b4719.md               |   2 +-
 .../61537bb9b1a29430ac15ad38.md               |   8 +-
 .../61537c5f81f0cf325b4a854c.md               |   4 +-
 .../61537c9eecea6a335db6da79.md               |   2 +-
 .../6153897c27f6334716ee5abe.md               |   2 +-
 .../6153908a366afb4d57185c8d.md               |  12 +-
 .../615392916d83fa4f02f7e2cf.md               |   2 +-
 .../6153947986535e5117e60615.md               |   4 +-
 .../61539f32a206bd53ec116465.md               |   2 +-
 .../6153a3ebb4f7f05b8401b716.md               |   2 +-
 .../6143862a5e54455d262c212e.md               |   2 +-
 .../61439dc084fa5f659cf75d7c.md               |   2 +-
 .../61439dfc811e12666b04be6f.md               |   4 +-
 .../61439e33e4fb7967609e0c83.md               |   2 +-
 .../6143a1a228f7d068ab16a130.md               |   4 +-
 .../6143a73279ce6369de4b9bcc.md               |   2 +-
 .../6143a778bffc206ac6b1dbe3.md               |   4 +-
 .../6143a83fcc32c26bcfae3efa.md               |   2 +-
 .../6143b97c06c3306d23d5da47.md               |   4 +-
 .../6143b9e1f5035c6e5f2a8231.md               |  20 +-
 .../6143bb50e8e48c6f5ef9d8d5.md               |   4 +-
 .../6143c2a363865c715f1a3f72.md               |   2 +-
 .../6143cd08fe927072ca3a371d.md               |   2 +-
 .../6144de308591ec10e27d5383.md               |   2 +-
 .../6144ee790af79815ad15a832.md               |   2 +-
 .../6144f1410990ea17187a722b.md               |   2 +-
 .../6148b59ef318e03875f35c4a.md               |   2 +-
 .../6148bd62bbb8c83a5f1fc1b3.md               |   2 +-
 .../6148d1f9eb63c252e1f8acc4.md               |   2 +-
 .../6148f34ebedc2274bceeb99c.md               |   2 +-
 .../6148f6f7d8914c78e93136ca.md               |   8 +-
 .../614e0e588f0e8a772a8a81a6.md               |   2 +-
 .../6165d3b702a5d92ad970b30c.md               |   2 +-
 .../61967e74a8e3690ab6292daa.md               |   2 +-
 .../61968df2acd5550bf1616c34.md               |   6 +-
 .../61968e9243a4090cc805531c.md               |   2 +-
 .../61968f8877c6720d6d61aaf5.md               |   4 +-
 .../619691693bc14b0e528f5a20.md               |   2 +-
 .../619692ff79f5770fc6d8c0b4.md               |   2 +-
 .../6196990f966e8f10a40094f6.md               |   4 +-
 .../619699c10a0f6e11591d73c4.md               |   2 +-
 .../61969aa6acef5b12200f672e.md               |   2 +-
 .../61969c487ced6f12db8fef94.md               |   2 +-
 .../61969d66cfcdba137d021558.md               |   2 +-
 .../61969e7451455614217e901b.md               |   2 +-
 .../6196adc17f77a714d51485f2.md               |   2 +-
 .../6196aead7ac7bf1584b17a7f.md               |   4 +-
 .../6196d0cda039d026f7f78d1e.md               |   2 +-
 .../6196d213d99f16287bff22ae.md               |   2 +-
 .../6196d2c0f22ca0293107c048.md               |   4 +-
 .../6197f667297bb30a552ce017.md               |   2 +-
 .../61993cf26a8e0f0a553db223.md               |   4 +-
 .../6199409834ccaf0d10736596.md               |   2 +-
 .../619943285a41720e6370d985.md               |   2 +-
 .../619be946958c6009844f1dee.md               |   2 +-
 .../619d0d18ca99870f884a7bff.md               |   4 +-
 .../619d1340361095175f4b5115.md               |   2 +-
 .../619d204bd73ae51e743b8e94.md               |   2 +-
 .../619d20b12996101f430920fb.md               |   2 +-
 .../619d23089e787e216a7043d6.md               |   2 +-
 .../619d2bd9c1d43c2526e96f1f.md               |   2 +-
 .../619d2d4e80400325ff89664a.md               |   2 +-
 .../619d2f0e9440bc27caee1cec.md               |   2 +-
 .../619d2fd3ff4f772882e3d998.md               |   2 +-
 .../619d30350883802921bfcccc.md               |   2 +-
 .../61a8fe15a6a31306e60d1e89.md               |   4 +-
 .../5d822fd413a79914d39e98ca.md               |   2 +-
 .../5d822fd413a79914d39e98cb.md               |   2 +-
 .../5d822fd413a79914d39e98cc.md               |   2 +-
 .../5d822fd413a79914d39e98cf.md               |   4 +-
 .../5d822fd413a79914d39e98d1.md               |   4 +-
 .../5d822fd413a79914d39e98d2.md               |   2 +-
 .../5d822fd413a79914d39e98d3.md               |   2 +-
 .../5d822fd413a79914d39e98d5.md               |   2 +-
 .../5d822fd413a79914d39e98d6.md               |   2 +-
 .../5d822fd413a79914d39e98d7.md               |   6 +-
 .../5d822fd413a79914d39e98da.md               |   2 +-
 .../5d822fd413a79914d39e98dc.md               |   4 +-
 .../5d822fd413a79914d39e98dd.md               |   2 +-
 .../5d822fd413a79914d39e98de.md               |   2 +-
 .../5d822fd413a79914d39e98df.md               |   2 +-
 .../5d822fd413a79914d39e98e1.md               |   2 +-
 .../5d822fd413a79914d39e98e2.md               |   2 +-
 .../5d822fd413a79914d39e98e3.md               |   2 +-
 .../5d822fd413a79914d39e98e6.md               |   2 +-
 .../5d822fd413a79914d39e98e7.md               |   2 +-
 .../5d822fd413a79914d39e98e9.md               |   2 +-
 .../5d822fd413a79914d39e98ea.md               |   2 +-
 .../5d822fd413a79914d39e98eb.md               |   2 +-
 .../5d822fd413a79914d39e98ec.md               |   2 +-
 .../5d822fd413a79914d39e98ed.md               |   2 +-
 .../5d822fd413a79914d39e98ee.md               |   4 +-
 .../5d822fd413a79914d39e98ef.md               |   2 +-
 .../5d822fd413a79914d39e98f0.md               |   2 +-
 .../5d822fd413a79914d39e98f1.md               |   2 +-
 .../5d822fd413a79914d39e98f2.md               |   2 +-
 .../5d822fd413a79914d39e98f3.md               |   2 +-
 .../5d822fd413a79914d39e98f4.md               |   2 +-
 .../5d822fd413a79914d39e98f5.md               |   4 +-
 .../5d822fd413a79914d39e98f6.md               |   2 +-
 .../5d822fd413a79914d39e98f7.md               |   2 +-
 .../5d822fd413a79914d39e98f8.md               |   4 +-
 .../5d822fd413a79914d39e98f9.md               |   2 +-
 .../5d822fd413a79914d39e98fa.md               |   2 +-
 .../5d822fd413a79914d39e98fb.md               |   8 +-
 .../5d822fd413a79914d39e98fc.md               |   8 +-
 .../5d822fd413a79914d39e98fd.md               |   2 +-
 .../5d822fd413a79914d39e98fe.md               |   8 +-
 .../5d822fd413a79914d39e98ff.md               |   8 +-
 .../5d822fd413a79914d39e9900.md               |  10 +-
 .../5d822fd413a79914d39e9901.md               |  10 +-
 .../5d822fd413a79914d39e9902.md               |  10 +-
 .../5d822fd413a79914d39e9903.md               |  10 +-
 .../5d822fd413a79914d39e9904.md               |  10 +-
 .../5d822fd413a79914d39e9905.md               |  10 +-
 .../5d822fd413a79914d39e9906.md               |  10 +-
 .../5d822fd413a79914d39e9907.md               |  10 +-
 .../5d822fd413a79914d39e9908.md               |  12 +-
 .../5d822fd413a79914d39e9909.md               |  12 +-
 .../5d822fd413a79914d39e990a.md               |  10 +-
 .../5d822fd413a79914d39e990b.md               |  10 +-
 .../5d822fd413a79914d39e990c.md               |  10 +-
 .../5d822fd413a79914d39e990d.md               |  10 +-
 .../5d822fd413a79914d39e990e.md               |  10 +-
 .../5d822fd413a79914d39e990f.md               |  10 +-
 .../5d822fd413a79914d39e9910.md               |  12 +-
 .../5d822fd413a79914d39e9911.md               |  12 +-
 .../5d822fd413a79914d39e9912.md               |  12 +-
 .../5d822fd413a79914d39e9913.md               |  14 +-
 .../5d822fd413a79914d39e9914.md               |  12 +-
 .../5d822fd413a79914d39e9915.md               |  16 +-
 .../5d822fd413a79914d39e9916.md               |  12 +-
 .../5d822fd413a79914d39e9917.md               |  12 +-
 .../5d822fd413a79914d39e9918.md               |  14 +-
 .../5d822fd413a79914d39e9919.md               |  14 +-
 .../5d822fd413a79914d39e991a.md               |  12 +-
 .../5d822fd413a79914d39e991b.md               |  12 +-
 .../5d822fd413a79914d39e991c.md               |  12 +-
 .../5d822fd413a79914d39e991d.md               |  12 +-
 .../5d822fd413a79914d39e991e.md               |  12 +-
 .../5d822fd413a79914d39e991f.md               |  12 +-
 .../5d822fd413a79914d39e9920.md               |  14 +-
 .../5d822fd413a79914d39e9921.md               |  14 +-
 .../5d822fd413a79914d39e9922.md               |  12 +-
 .../5d822fd413a79914d39e9923.md               |  14 +-
 .../5d822fd413a79914d39e9924.md               |  16 +-
 .../5d822fd413a79914d39e9925.md               |  16 +-
 .../5d822fd413a79914d39e9926.md               |  16 +-
 .../5d822fd413a79914d39e9927.md               |  16 +-
 .../5d822fd413a79914d39e9928.md               |  16 +-
 .../5d822fd413a79914d39e9929.md               |  16 +-
 .../5d822fd413a79914d39e992a.md               |  14 +-
 .../5d822fd413a79914d39e992b.md               |  14 +-
 .../5d822fd413a79914d39e992c.md               |  14 +-
 .../5d822fd413a79914d39e992d.md               |  14 +-
 .../5d822fd413a79914d39e992e.md               |  14 +-
 .../5d822fd413a79914d39e992f.md               |  14 +-
 .../5d822fd413a79914d39e9930.md               |  16 +-
 .../5d822fd413a79914d39e9931.md               |   6 +-
 .../5d822fd413a79914d39e9932.md               |  14 +-
 .../5d822fd413a79914d39e9933.md               |  14 +-
 .../5d822fd413a79914d39e9934.md               |  12 +-
 .../5d822fd413a79914d39e9935.md               |  12 +-
 .../5d822fd413a79914d39e9936.md               |  16 +-
 .../5d822fd413a79914d39e9937.md               |  14 +-
 .../5d822fd413a79914d39e9938.md               |  14 +-
 .../5d822fd413a79914d39e9939.md               |  14 +-
 .../5d822fd413a79914d39e993a.md               |  12 +-
 .../5d822fd413a79914d39e993b.md               |  16 +-
 .../5d822fd413a79914d39e993c.md               |   4 +-
 .../5d822fd413a79914d39e993d.md               |  16 +-
 .../5d822fd413a79914d39e993e.md               |  28 +--
 .../5dc17dc8f86c76b9248c6eb5.md               |   2 +-
 .../5dfb5ecbeacea3f48c6300b1.md               |   4 +-
 .../5ef9b03c81a63668521804d2.md               |   4 +-
 .../5ef9b03c81a63668521804d5.md               |   2 +-
 .../5ef9b03c81a63668521804dc.md               |   4 +-
 .../5ef9b03c81a63668521804dd.md               |   2 +-
 .../5ef9b03c81a63668521804e2.md               |   2 +-
 .../5ef9b03c81a63668521804eb.md               |   2 +-
 .../5ef9b03c81a63668521804ec.md               |   2 +-
 .../5efc4f528d6a74d05e68af74.md               |   2 +-
 .../5f05a1d8e233dff4a68508d8.md               |   4 +-
 .../60f0286404aefb0562a4fdf9.md               |   2 +-
 .../60f5cb8875ab6a0610f05071.md               |   2 +-
 .../60f80e0081e0f2052ae5b505.md               |   3 +-
 .../60fab9f17fa294054b74228c.md               |   4 +-
 .../60fabf0dd4959805dbae09e6.md               |   6 +-
 .../60faca286cb48b07f6482970.md               |   2 +-
 .../62b30924c5e4ef0daba23b5e.md               |   2 +-
 .../60b69a66b6ddb80858c51579.md               |   4 +-
 .../60b69a66b6ddb80858c5157a.md               |   5 +-
 .../60b69a66b6ddb80858c5157b.md               |   2 +-
 .../60b69a66b6ddb80858c5157e.md               |   2 +-
 .../60b69a66b6ddb80858c51580.md               |   2 +-
 .../60b69a66b6ddb80858c51581.md               |   2 +-
 .../60b69a66b6ddb80858c51582.md               |   2 +-
 .../60b69a66b6ddb80858c51583.md               |   2 +-
 .../60b69a66b6ddb80858c51584.md               |   2 +-
 .../60b69a66b6ddb80858c51585.md               |   2 +-
 .../60b69a66b6ddb80858c51592.md               |   2 +-
 .../60b69a66b6ddb80858c51595.md               |   2 +-
 .../60b69a66b6ddb80858c51598.md               |   2 +-
 .../60b69a66b6ddb80858c51599.md               |   2 +-
 .../60b69a66b6ddb80858c5159a.md               |   2 +-
 .../60b69a66b6ddb80858c5159b.md               |   2 +-
 .../60b69a66b6ddb80858c515a7.md               |   2 +-
 .../60b69a66b6ddb80858c515aa.md               |   2 +-
 .../60b69a66b6ddb80858c515ad.md               |   2 +-
 .../60b69a66b6ddb80858c515ae.md               |   2 +-
 .../60b69a66b6ddb80858c515af.md               |   2 +-
 .../60b69a66b6ddb80858c515b0.md               |   2 +-
 .../60b69a66b6ddb80858c515b1.md               |   2 +-
 .../60b69a66b6ddb80858c515b2.md               |   4 +-
 .../60b69a66b6ddb80858c515b4.md               |   2 +-
 .../60b69a66b6ddb80858c515bc.md               |   2 +-
 .../60b69a66b6ddb80858c515bf.md               |   2 +-
 .../60b69a66b6ddb80858c515c1.md               |   2 +-
 .../60b69a66b6ddb80858c515c6.md               |   2 +-
 .../60ba9296d4d6b414c1b10995.md               |   2 +-
 .../61fd5a93fd62bb35968adeab.md               |   2 +-
 .../61fd6343fb42013d99bcd7f3.md               |   2 +-
 .../61fd71d596e8f253b9408b39.md               |   2 +-
 .../61fd7648a7ba2e5882436831.md               |   2 +-
 .../61fd778081276b59d59abad6.md               |   2 +-
 .../61fd77f7ad2aeb5ae34d07d6.md               |   2 +-
 .../61fd78621573aa5e8b512f5e.md               |   4 +-
 .../61fd7b3fcaa5406257abc5d1.md               |   2 +-
 .../61fd933ba685de776a94997e.md               |   4 +-
 .../61fd94056e0355785fbba4d3.md               |   2 +-
 .../61fd986ddbcbd47ba8fbc5ec.md               |   2 +-
 .../61fdac1e31692f9a9ad97295.md               |   2 +-
 .../61fdaf9ff894b6a084ecdc1b.md               |   2 +-
 .../61fdafe6f07fd7a1c6785bc2.md               |   2 +-
 .../620179bc0a6a2358c72b90ad.md               |   2 +-
 .../620191707bc65579ddd3ce15.md               |   2 +-
 .../620199c7a7a32c81d4db3410.md               |   2 +-
 .../6201a5258af7b398b030bfaf.md               |   2 +-
 .../612e6afc009b450a437940a1.md               |   2 +-
 .../612e77aba7ca691f598feb02.md               |   2 +-
 .../612e813b3ba67633222cbe54.md               |   2 +-
 .../612e8279827a28352ce83a72.md               |   2 +-
 .../612e89562043183c86df287c.md               |   2 +-
 .../612e95ef2e4bdf41f69067f9.md               |   2 +-
 .../612e9d142affc44a453655db.md               |   2 +-
 .../612eb8e984cd73677a92b7e9.md               |   2 +-
 .../612ebf9a210f2b6d77001e68.md               |   2 +-
 .../60a3e3396c7b40068ad6996e.md               |   2 +-
 .../60a3e3396c7b40068ad69970.md               |   2 +-
 .../60a3e3396c7b40068ad69971.md               |   4 +-
 .../60a3e3396c7b40068ad69978.md               |   2 +-
 .../60a3e3396c7b40068ad6997a.md               |   2 +-
 .../60a3e3396c7b40068ad69987.md               |   2 +-
 .../60a3e3396c7b40068ad6998f.md               |   2 +-
 .../60a3e3396c7b40068ad69994.md               |   2 +-
 .../615f34948891834dd77655a6.md               |   2 +-
 .../615f38cabc64e3556f98cc1a.md               |   2 +-
 .../615f3e4af8008c5d494d3afe.md               |   2 +-
 .../615f41c979787462e76dab90.md               |   2 +-
 .../615f423cf65d5864132a0956.md               |   2 +-
 .../615f50473cc0196c6dd3892a.md               |   4 +-
 .../615f51e4e5b24a6e80eccce1.md               |   2 +-
 .../615f575b50b91e72af079480.md               |   2 +-
 .../615f5c1cb7575c7551ed8a40.md               |   2 +-
 .../615f666ac5edea782feb7e75.md               |   2 +-
 .../615f7ad94380408d971d14f6.md               |   2 +-
 .../615f7d489a581590d1350288.md               |   2 +-
 .../615f8f1223601fa546e93f31.md               |   2 +-
 .../615f905fbd1017a65ca224eb.md               |   2 +-
 .../cash-register.md                          |  16 +-
 .../palindrome-checker.md                     |  22 +-
 .../roman-numeral-converter.md                |  82 +++----
 .../telephone-number-validator.md             |   8 +-
 .../62a23d1c5f1c93161f3582ae.md               |   6 +-
 .../62a3cfc8328d3351b95d4f61.md               |   2 +-
 .../62a8aa98a8289d0a698eee1d.md               |   2 +-
 .../62a8cbd1e3595431d5a2b3f1.md               |   2 +-
 .../62a8ce73d0dce43468f6689c.md               |   4 +-
 .../62a8cf22272d6d35af80d4ac.md               |   2 +-
 .../62a8d0337d7c67377a4a76c6.md               |   6 +-
 .../62a8d08668fa8b38732486e9.md               |   2 +-
 .../62a8d61ddfe35744369365b7.md               |   6 +-
 .../62a8d6c7001ebc45350e3d16.md               |   4 +-
 .../62a8e35675c18c56354c08cf.md               |   6 +-
 .../62a8e41e2f190c58404dd46e.md               |   4 +-
 .../62a8ed36d7a7915dfa444ba2.md               |   2 +-
 .../62a8edd05e27cc668051686f.md               |   2 +-
 .../62a8eec45f77bc69e8775294.md               |   2 +-
 .../62a8ef8f0c76a46cd221a68c.md               |   2 +-
 .../62a8efb0e3ce826db8daf80f.md               |   2 +-
 .../62a8eff21c0b0f6ebe5b8e38.md               |   2 +-
 .../62aa204c1e1d33348ff09944.md               |   2 +-
 .../62aa20e9cf1be9358f5aceae.md               |   4 +-
 .../62aa226207f33d3ad4c6f546.md               |   6 +-
 .../62aa264d23cdaa45a20efada.md               |   2 +-
 .../62aa27227399d647e1c37a3c.md               |   4 +-
 .../62aa27560def7048d7b4a095.md               |   2 +-
 .../62aa27c40ca6f04ab8be5fac.md               |   2 +-
 ...-one-decimal-by-another-with-javascript.md |   6 -
 .../escape-sequences-in-strings.md            |  12 +-
 ...-variables-with-the-assignment-operator.md |   6 -
 .../quoting-strings-with-single-quotes.md     |   6 -
 .../basic-javascript/stand-in-line.md         |   4 +-
 .../use-recursion-to-create-a-countdown.md    |   7 +
 ...-recursion-to-create-a-range-of-numbers.md |   7 +
 ...plete-a-promise-with-resolve-and-reject.md |   2 +-
 .../es6/create-a-module-script.md             |   2 +-
 ...syntax-to-define-a-constructor-function.md |  31 ++-
 ...-concise-declarative-functions-with-es6.md |   5 +-
 .../make-a-person.md                          |   8 -
 .../steamroller.md                            |   7 +
 .../sum-all-primes.md                         |  56 +++--
 .../add-methods-after-inheritance.md          |  48 +++-
 ...characters-that-occur-one-or-more-times.md |   4 +-
 ...haracters-that-occur-zero-or-more-times.md |   2 +-
 .../responsively-style-radio-buttons.md       |   2 +-
 .../build-a-25-5-clock.md                     |   2 +-
 .../build-a-drum-machine.md                   |   2 +-
 .../build-a-javascript-calculator.md          |   2 +-
 .../build-a-markdown-previewer.md             |   2 +-
 .../build-a-random-quote-machine.md           |   2 +-
 .../mongodb-and-mongoose/create-a-model.md    |   2 +-
 .../problem-10-summation-of-primes.md         |  54 +++--
 .../6148da157cc0bd0d06df5c0a.md               |  14 +-
 .../6148dc095264000dce348bf5.md               |   2 +-
 .../6148dcaaf2e8750e6cb4501a.md               |   2 +-
 .../6148dd31d210990f0fb140f8.md               |   2 +-
 .../6148defa9c01520fb9d178a0.md               |   2 +-
 .../6148dfab9b54c110577de165.md               |   2 +-
 .../6148e0bcc13efd10f7d7a6a9.md               |   2 +-
 .../6148e161ecec9511941f8833.md               |   2 +-
 .../6148e28706b34912340fd042.md               |   2 +-
 .../6148e335c1edd512d00e4691.md               |   2 +-
 .../6148e41c728f65138addf9cc.md               |   2 +-
 .../6148e5aeb102e3142de026a2.md               |   4 +-
 .../5f33294a6af5e9188dbdb8f3.md               |  23 +-
 .../5f332a88dc25a0fd25c7687a.md               |  25 +-
 .../5f332b23c2045fb843337579.md               |  31 +--
 .../5f344f9c805cd193c33d829c.md               |   8 +-
 .../5f344fad8bf01691e71a30eb.md               |   8 +-
 .../5f344fbc22624a2976425065.md               |   8 +-
 .../5f344fc1520b6719f2e35605.md               |  15 +-
 .../5f3477ae34c1239cafe128be.md               |   8 +-
 .../5f3477ae8466a9a3d2cc953c.md               |   8 +-
 .../5f3477ae9675db8bb7655b30.md               |  19 +-
 .../5f3477aefa51bfc29327200b.md               |   8 +-
 .../5f3477cb2e27333b1ab2b955.md               |   8 +-
 .../5f3477cb303c5cb61b43aa9b.md               |   8 +-
 .../5f3477cbcb6ba47918c1da92.md               |   8 +-
 .../5f34a1fd611d003edeafd681.md               |   8 +-
 .../5f356ed60785e1f3e9850b6e.md               |   8 +-
 .../5f356ed60a5decd94ab66986.md               |   8 +-
 .../5f356ed6199b0cdef1d2be8f.md               |   8 +-
 .../5f356ed63c7807a4f1e6d054.md               |   8 +-
 .../5f356ed63e0fa262326eef05.md               |   8 +-
 .../5f356ed656a336993abd9f7c.md               |   8 +-
 .../5f356ed69db0a491745e2bb6.md               |   8 +-
 .../5f356ed6cf6eab5f15f5cfe6.md               |   8 +-
 .../5f35e5c4321f818cdc4bed30.md               |   8 +-
 .../5f35e5c44359872a137bd98f.md               |   8 +-
 .../5f3c866d0fc037f7311b4ac8.md               |   8 +-
 .../5f3c866d28d7ad0de6470505.md               |   8 +-
 .../5f3c866d5414453fc2d7b480.md               |   8 +-
 .../5f3c866daec9a49519871816.md               |   8 +-
 .../5f3c866dbf362f99b9a0c6d0.md               |   8 +-
 .../5f3c866dd0d0275f01d4d847.md               |   8 +-
 .../5f3c866de7a5b784048f94b1.md               |   8 +-
 .../5f3cade94c6576e7f7b7953f.md               |   8 +-
 .../5f3cade9993019e26313fa8e.md               |   8 +-
 .../5f3cade99dda4e6071a85dfd.md               |   8 +-
 .../5f3cade9fa77275d9f4efe62.md               |   8 +-
 .../5f3ef6e01f288a026d709587.md               |  20 +-
 .../5f3ef6e03d719d5ac4738993.md               |   8 +-
 .../5f3ef6e04559b939080db057.md               |   8 +-
 .../5f3ef6e050279c7a4a7101d3.md               |   8 +-
 .../5f3ef6e05473f91f948724ab.md               |   8 +-
 .../5f3ef6e056bdde6ae6892ba2.md               |   8 +-
 .../5f3ef6e06d34faac0447fc44.md               |   8 +-
 .../5f3ef6e07276f782bb46b93d.md               |  10 +-
 .../5f3ef6e0819d4f23ca7285e6.md               |   8 +-
 .../5f3ef6e087d56ed3ffdc36be.md               |   8 +-
 .../5f3ef6e0a81099d9a697b550.md               |   8 +-
 .../5f3ef6e0b431cc215bb16f55.md               |   8 +-
 .../5f3ef6e0e0c3feaebcf647ad.md               |   8 +-
 .../5f3ef6e0e9629bad967cd71e.md               |   8 +-
 .../5f3ef6e0eaa7da26e3d34d78.md               |   8 +-
 .../5f3ef6e0f8c230bdd2349716.md               |   8 +-
 .../5f3f26fa39591db45e5cd7a0.md               |  10 +-
 .../5f459225127805351a6ad057.md               |  10 +-
 .../5f459a7ceb8b5c446656d88b.md               |  10 +-
 .../5f459cf202c2a3472fae6a9f.md               |  10 +-
 .../5f459fd48bdc98491ca6d1a3.md               |  12 +-
 .../5f45a05977e2fa49d9119437.md               |  10 +-
 .../5f45a276c093334f0f6e9df4.md               |  10 +-
 .../5f45a5a7c49a8251f0bdb527.md               |  10 +-
 .../5f45a66d4a2b0453301e5a26.md               |  10 +-
 .../5f45b0731d39e15d54df4dfc.md               |  10 +-
 .../5f45b25e7ec2405f166b9de1.md               |  10 +-
 .../5f45b3c93c027860d9298dbd.md               |  10 +-
 .../5f45b45d099f3e621fbbb256.md               |  10 +-
 .../5f45b4c81cea7763550e40df.md               |  10 +-
 .../5f45b715301bbf667badc04a.md               |  10 +-
 .../5f46e270702a8456a664f0df.md               |  10 +-
 .../5f46e36e745ead58487aabf2.md               |  10 +-
 .../5f46e7a4750dd05b5a673920.md               |  10 +-
 .../5f46e8284aae155c83015dee.md               |  10 +-
 .../5f46ede1ff8fec5ba656b44c.md               |  10 +-
 .../5f46fc57528aa1c4b5ea7c2e.md               |  10 +-
 .../5f4701b942c824109626c3d8.md               |  10 +-
 .../5f475bb508746c16c9431d42.md               |  10 +-
 .../5f475e1c7f71a61d913836c6.md               |  10 +-
 .../5f47633757ae3469f2d33d2e.md               |   8 +-
 .../5f47fe7e31980053a8d4403b.md               |  16 +-
 .../5f716ad029ee4053c7027a7a.md               |   8 +-
 .../5f716bee5838c354c728a7c5.md               |   8 +-
 .../5f7691dafd882520797cd2f0.md               |   8 +-
 .../5f7692f7c5b3ce22a57788b6.md               |   8 +-
 .../5f769541be494f25449b292f.md               |   8 +-
 .../5f76967fad478126d6552b0d.md               |   8 +-
 .../5f769702e6e33127d14aa120.md               |   8 +-
 .../5f7b87422a560036fd03ccff.md               |   8 +-
 .../5f7b88d37b1f98386f04edc0.md               |   8 +-
 .../616965351e74d4689eb6de30.md               |   9 +-
 .../5dc2385ff86c76b9248c6eb7.md               |  12 +-
 .../5dc23991f86c76b9248c6eb8.md               |  10 +-
 .../5dc23f9bf86c76b9248c6eba.md               |   2 +-
 .../5dc24073f86c76b9248c6ebb.md               |   2 +-
 .../5dc24165f86c76b9248c6ebc.md               |   2 +-
 .../5dc24614f86c76b9248c6ebd.md               |   2 +-
 .../5ddbd81294d8ddc1510a8e56.md               |   2 +-
 .../5dfa22d1b521be39a3de7be0.md               |   4 +-
 .../5dfa2407b521be39a3de7be1.md               |   2 +-
 .../5dfa30b9eacea3f48c6300ad.md               |   2 +-
 .../5dfa3589eacea3f48c6300ae.md               |   2 +-
 .../5dfa371beacea3f48c6300af.md               |   2 +-
 .../5dfa37b9eacea3f48c6300b0.md               |   4 +-
 .../5dfb5ecbeacea3f48c6300b1.md               |   2 +-
 .../5dfb6250eacea3f48c6300b2.md               |   2 +-
 .../5dfb655eeacea3f48c6300b3.md               |   6 +-
 .../5dfb6a35eacea3f48c6300b4.md               |   2 +-
 .../5ef9b03c81a63668521804d0.md               |   2 +-
 .../5ef9b03c81a63668521804d1.md               |   2 +-
 .../5ef9b03c81a63668521804d2.md               |   2 +-
 .../5ef9b03c81a63668521804d3.md               |   2 +-
 .../5ef9b03c81a63668521804d4.md               |   2 +-
 .../5ef9b03c81a63668521804d5.md               |   2 +-
 .../5ef9b03c81a63668521804d6.md               |   2 +-
 .../5ef9b03c81a63668521804d7.md               |   2 +-
 .../5ef9b03c81a63668521804d8.md               |   2 +-
 .../5ef9b03c81a63668521804d9.md               |   2 +-
 .../5ef9b03c81a63668521804da.md               |   2 +-
 .../5ef9b03c81a63668521804db.md               |   2 +-
 .../5ef9b03c81a63668521804dc.md               |   2 +-
 .../5ef9b03c81a63668521804dd.md               |   2 +-
 .../5ef9b03c81a63668521804de.md               |   2 +-
 .../5ef9b03c81a63668521804df.md               |   2 +-
 .../5ef9b03c81a63668521804e1.md               |   2 +-
 .../5ef9b03c81a63668521804e2.md               |   2 +-
 .../5ef9b03c81a63668521804e3.md               |   2 +-
 .../5ef9b03c81a63668521804e5.md               |   2 +-
 .../5ef9b03c81a63668521804e7.md               |   2 +-
 .../5ef9b03c81a63668521804e8.md               |   2 +-
 .../5ef9b03c81a63668521804e9.md               |   2 +-
 .../5ef9b03c81a63668521804ea.md               |   2 +-
 .../5ef9b03c81a63668521804eb.md               |   2 +-
 .../5ef9b03c81a63668521804ec.md               |   2 +-
 .../5ef9b03c81a63668521804ee.md               |   2 +-
 .../5efada803cbd2bbdab94e332.md               |   2 +-
 .../5efae0543cbd2bbdab94e333.md               |   2 +-
 .../5efae16e3cbd2bbdab94e334.md               |   2 +-
 .../5efb23e70dc218d6c85f89b1.md               |   2 +-
 .../5efb2c990dc218d6c85f89b2.md               |   2 +-
 .../5efc4f528d6a74d05e68af74.md               |   2 +-
 .../5efc518e8d6a74d05e68af75.md               |   2 +-
 .../5efc54138d6a74d05e68af76.md               |   2 +-
 .../5efc575c8d6a74d05e68af77.md               |   2 +-
 .../5f05a1d8e233dff4a68508d8.md               |   2 +-
 .../5f07be6ef7412fbad0c5626b.md               |  18 +-
 .../5f07c98cdb9413cbd4b16750.md               |   2 +-
 .../5f07fb1579dc934717801375.md               |  52 ++---
 .../5f0d48e7b435f13ab6550051.md               |   2 +-
 .../5f0d4ab1b435f13ab6550052.md               |   2 +-
 .../5f0d4d04b435f13ab6550053.md               |   2 +-
 .../5f1a80975fc4bcae0edb3497.md               |   2 +-
 .../5f1a89f1190aff21ae42105a.md               |   2 +-
 .../62bb4009e3458a128ff57d5d.md               |   4 +-
 .../62dabe2ef403a12d5d295273.md               |   2 +-
 .../7cf9b03d81a65668421804c3.md               |   2 +-
 .../60f1922fcbd2410527b3bd89.md               |   5 +-
 .../60f803d5241e6a0433a523a1.md               |   5 +-
 .../62a3b49686792938718b90d3.md               |   2 +-
 .../62a7bfabe119461eb13ccbd6.md               |   8 +-
 .../62a8ade9b2f5b30ef0b606c2.md               |   6 +-
 .../62a8b0b5053f16111b0b6b5f.md               |  18 +-
 .../62a8c1154d3ae11aee80353f.md               |  14 +-
 .../62a8c151b23bf21bc7c4fcba.md               |   6 +-
 .../62a8c173949f851c83c64756.md               |   8 +-
 .../62a8c242b25a531f2909e5bc.md               |  10 +-
 .../62a8c2bbbd8aa82052f47c53.md               |  22 +-
 .../62a8c31ec0ec78216a1c36a0.md               |  12 +-
 .../62a8c370ad8c68227137e0bc.md               |   8 +-
 .../62a8c3ebc6c35e23785e1a19.md               |   6 +-
 .../62a8c41ecaf1bd24536129b8.md               |  10 +-
 .../62a8c465fa7b0c252f4a8f0c.md               |  10 +-
 .../62a8c4db0710f3260f867a92.md               |  10 +-
 .../62a8c56247609626fa4a8d6e.md               |  10 +-
 .../62a8c5db7888af27af23f0dd.md               |   8 +-
 .../62a8c65b75664c28a8e59c16.md               |   6 +-
 .../62a8c6815f5f1a29735efe1b.md               |   8 +-
 .../62a8c7322e42962ad53ad204.md               |  14 +-
 .../62a8c7a59e72c02bb1c717d2.md               |   6 +-
 .../62a8c89e4272512d44fc1c66.md               |   8 +-
 .../62a8c8cee8e5cf2e001789b4.md               |   8 +-
 .../62a8ca22d29fe62f3952bdf5.md               |   8 +-
 .../62a8cb19bd7f8a304e5427a1.md               |   6 +-
 .../62a8cbd1e3595431d5a2b3f1.md               |  12 +-
 .../62a8cce1b0c32c33017cf2e9.md               |   8 +-
 .../62a8ce1dfc990134162b3bd9.md               |   4 +-
 .../62a8ce73d0dce43468f6689c.md               |  10 +-
 .../62a8cf22272d6d35af80d4ac.md               |  14 +-
 .../62a8d0337d7c67377a4a76c6.md               |  10 +-
 .../62a8d08668fa8b38732486e9.md               |   6 +-
 .../62a8d0c4f12c2239b6618582.md               |  10 +-
 .../62a8d0fdf2dad83a92883a80.md               |   8 +-
 .../62a8d143f2a58e3b6d6e9c33.md               |   6 +-
 .../62a8d1c72e8bb13c2074d93c.md               |   6 +-
 .../62a8d2146a3e853d0a6e28ca.md               |   8 +-
 .../62a8d24c97461b3ddb9397c8.md               |  10 +-
 .../62a8d2e2a073be3edb46116f.md               |   6 +-
 .../62a8d31ebbc10e3fe1b28e03.md               |   6 +-
 .../62a8d35660db4040ba292193.md               |   8 +-
 .../62a8d382cd075f4169223e14.md               |   6 +-
 .../62a8d539dc11cb42b5dd7ec8.md               |   8 +-
 .../62a8d61ddfe35744369365b7.md               |  12 +-
 .../62a8d6c7001ebc45350e3d16.md               |  10 +-
 .../62a8d7b8ab568b4649998954.md               |   8 +-
 .../62a8d81f539f004776dd9b1e.md               |  32 +--
 .../62a8dd468debb449b4454086.md               |   6 +-
 .../62a8dd9cdb16324b04cfd958.md               |  10 +-
 .../62a8dfcf7fb1044d2f478fd1.md               |   8 +-
 .../62a8e0d1d0110b4ec421489f.md               |  10 +-
 .../62a8e142f7f0bd4fed898de3.md               |  14 +-
 .../62a8e1dc897df55108bcb5e8.md               |   6 +-
 .../62a8e21398ad61520edb724f.md               |   6 +-
 .../62a8e24c673b075317cc0b09.md               |   8 +-
 .../62a8e271f8e3d1541f9624ad.md               |  10 +-
 .../62a8e35675c18c56354c08cf.md               |  10 +-
 .../62a8e41e2f190c58404dd46e.md               |  12 +-
 .../62a8e45cc600c3591cee671a.md               |   6 +-
 .../62a8e49f4df7af5ae2d7a616.md               |  10 +-
 .../62a8e4dc6a60f85bf256a0cb.md               |  22 +-
 .../62a8ed36d7a7915dfa444ba2.md               |  12 +-
 .../62a8edd05e27cc668051686f.md               |  10 +-
 .../62a8ee154c8946678775c4a4.md               |  10 +-
 .../62a8ee71f018e968a056d369.md               |  10 +-
 .../62a8eec45f77bc69e8775294.md               |   6 +-
 .../62a8eefe2e68b66ac563816b.md               |  10 +-
 .../62a8ef6a52292f6bdca4f6f8.md               |   6 +-
 .../62a8ef8f0c76a46cd221a68c.md               |   8 +-
 .../62a8efb0e3ce826db8daf80f.md               |   8 +-
 .../62a8eff21c0b0f6ebe5b8e38.md               |  14 +-
 .../62a8f06fb318666fef69f91e.md               |   6 +-
 .../62a8f14fe6d1fc72454648c7.md               |   6 +-
 .../62a8f1d5f5ddbf74c07f733b.md               |   2 +-
 .../62a8f20463b324759953edad.md               |  26 +--
 .../62a8f256b813a476cae51f49.md               |  14 +-
 .../62a8f2bc37675e77d5835235.md               |  14 +-
 .../62a8f35bde1750791f58773f.md               |   6 +-
 .../62a94114ce0b8918b487390f.md               |  12 +-
 .../62aa1cea594f152ba626b872.md               |   6 +-
 .../62aa1d6736ba262cfa74344b.md               |   6 +-
 .../62aa1d9f535e102e4663e7a6.md               |  10 +-
 .../62aa1e3c7c3d552fb04f0f18.md               |   4 +-
 .../62aa1e8ccd579330e097ce44.md               |   4 +-
 .../62aa204c1e1d33348ff09944.md               |   2 +-
 .../62aa20e9cf1be9358f5aceae.md               |   4 +-
 .../62aa226207f33d3ad4c6f546.md               |   6 +-
 .../62aa264d23cdaa45a20efada.md               |   2 +-
 .../62aa27227399d647e1c37a3c.md               |   4 +-
 .../62aa27560def7048d7b4a095.md               |   2 +-
 .../62aa27c40ca6f04ab8be5fac.md               |   2 +-
 .../62ba17beef16c563069a65d8.md               |  12 +-
 .../falsy-bouncer.md                          |  10 +-
 ...-one-decimal-by-another-with-javascript.md |   6 -
 .../escape-sequences-in-strings.md            |  12 +-
 ...-variables-with-the-assignment-operator.md |   6 -
 .../quoting-strings-with-single-quotes.md     |   6 -
 .../basic-javascript/stand-in-line.md         |   4 +-
 .../use-recursion-to-create-a-countdown.md    |   7 +
 ...-recursion-to-create-a-range-of-numbers.md |   7 +
 ...syntax-to-define-a-constructor-function.md |  31 ++-
 ...-concise-declarative-functions-with-es6.md |   3 +-
 ...f-an-array-using-concat-instead-of-push.md |  10 +-
 .../make-a-person.md                          |   8 -
 .../steamroller.md                            |   7 +
 .../sum-all-primes.md                         |  56 +++--
 .../add-methods-after-inheritance.md          |  48 +++-
 .../build-a-25-5-clock.md                     |   2 +-
 .../build-a-drum-machine.md                   |   2 +-
 .../build-a-javascript-calculator.md          |   2 +-
 .../build-a-markdown-previewer.md             |   2 +-
 .../build-a-random-quote-machine.md           |   2 +-
 .../visualize-data-with-a-bar-chart.md        |   2 +-
 .../visualize-data-with-a-choropleth-map.md   |   2 +-
 .../visualize-data-with-a-heat-map.md         |   2 +-
 ...visualize-data-with-a-scatterplot-graph.md |   2 +-
 .../visualize-data-with-a-treemap-diagram.md  |   2 +-
 .../mongodb-and-mongoose/create-a-model.md    |   4 +-
 .../set-up-the-environment.md                 |   2 +-
 .../use-a-template-engines-powers.md          |  34 ++-
 ...ality-with-.deepequal-and-.notdeepequal.md |   2 +-
 .../build-your-own-functions.md               |   2 +-
 .../comparing-and-sorting-tuples.md           |   2 +-
 .../dictionaries-and-loops.md                 |   2 +-
 .../files-as-a-sequence.md                    |   2 +-
 .../intermediate-expressions.md               |   4 +-
 .../intermediate-strings.md                   |   2 +-
 .../introduction-why-program.md               |   4 +-
 .../iterations-more-patterns.md               |   2 +-
 .../more-conditional-structures.md            |   4 +-
 .../networking-web-scraping-with-python.md    |   6 +-
 .../relational-databases-and-sqlite.md        |  16 +-
 ...al-databases-many-to-many-relationships.md |  10 +-
 .../python-for-everybody/strings-and-lists.md |   2 +-
 ...services-api-rate-limiting-and-security.md |   8 +-
 .../arithmetic-formatter.md                   |   6 +-
 .../budget-app.md                             |  30 +--
 .../polygon-area-calculator.md                |  30 +--
 .../probability-calculator.md                 |  32 +--
 .../time-calculator.md                        |   2 +-
 .../introduction-to-data-analysis.md          |  15 +-
 .../demographic-data-analyzer.md              |   9 +-
 ...-variance-standard-deviation-calculator.md |   7 +-
 .../medical-data-visualizer.md                |  35 +--
 .../page-view-time-series-visualizer.md       |  15 +-
 .../sea-level-predictor.md                    |  14 +-
 .../anonymous-message-board.md                |   6 +-
 .../port-scanner.md                           |   8 +-
 .../secure-real-time-multiplayer-game.md      |  57 +++--
 .../sha-1-password-cracker.md                 |  10 +-
 .../stock-price-checker.md                    |   8 +-
 ...ur-site-via-https-only-with-helmet.hsts.md |   2 +-
 ...-response-mime-type-with-helmet.nosniff.md |   2 +-
 ...lmet-using-the-parent-helmet-middleware.md |   2 +-
 ...client-side-caching-with-helmet.nocache.md |   2 +-
 ...fetching-with-helmet.dnsprefetchcontrol.md |   2 +-
 ...sh-and-compare-passwords-asynchronously.md |   2 +-
 ...ash-and-compare-passwords-synchronously.md |   2 +-
 ...-information-using-helmet.hidepoweredby.md |   2 +-
 .../install-and-require-helmet.md             |   6 +-
 ...-of-clickjacking-with-helmet.frameguard.md |   2 +-
 ...pting-xss-attacks-with-helmet.xssfilter.md |   2 +-
 ...ing-untrusted-html-with-helmet.ienoopen.md |   2 +-
 ...olicy-with-helmet.contentsecuritypolicy.md |   2 +-
 .../understand-bcrypt-hashes.md               |   8 +-
 .../find-the-symmetric-difference.md          |   4 +-
 ...d-a-new-element-to-a-binary-search-tree.md |   2 +-
 .../create-a-doubly-linked-list.md            |  12 +-
 .../data-structures/create-a-hash-table.md    |  14 +-
 .../create-a-map-data-structure.md            |  14 +-
 .../create-a-trie-search-tree.md              |  12 +-
 .../create-an-es6-javascript-map.md           |  14 +-
 .../implement-heap-sort-with-a-min-heap.md    |  10 +-
 .../data-structures/incidence-matrix.md       |   2 +-
 .../insert-an-element-into-a-max-heap.md      |   8 +-
 ...form-a-subset-check-on-two-sets-of-data.md |  12 +-
 .../perform-a-union-on-two-sets.md            |   2 +-
 .../remove-an-element-from-a-max-heap.md      |  10 +-
 .../reverse-a-doubly-linked-list.md           |  10 +-
 .../search-within-a-linked-list.md            |   2 +-
 .../problem-10-summation-of-primes.md         |  54 +++--
 .../problem-107-minimal-network.md            |   4 +-
 .../problem-128-hexagonal-tile-differences.md |  64 +++++-
 .../problem-168-number-rotations.md           |  52 ++++-
 ...lem-184-triangles-containing-the-origin.md |   2 +-
 .../problem-2-even-fibonacci-numbers.md       |   4 +-
 .../project-euler/problem-250-250250.md       |   2 +-
 .../problem-257-angular-bisectors.md          |   4 +-
 ...itwise-or-operations-on-random-integers.md |  14 +-
 .../problem-326-modulo-summations.md          |   4 +-
 .../problem-344-silver-dollar-game.md         |   2 +-
 ...-356-largest-roots-of-cubic-polynomials.md |   4 +-
 .../problem-371-licence-plates.md             |   4 +-
 .../problem-414-kaprekar-constant.md          |   4 +-
 ...-part-of-polynomial-equations-solutions.md |   4 +-
 ...blem-450-hypocycloid-and-lattice-points.md |   7 +-
 .../problem-473-phigital-number-base.md       |   4 +-
 .../problem-64-odd-period-square-roots.md     |   4 +-
 .../problem-9-special-pythagorean-triplet.md  |   4 +-
 .../rosetta-code/24-game.md                   | 141 ++++++++----
 .../9-billion-names-of-god-the-integer.md     |   4 +-
 .../rosetta-code/accumulator-factory.md       |   4 +-
 .../rosetta-code/amicable-pairs.md            |  20 +-
 .../rosetta-code/averages-mode.md             |   4 +-
 .../averages-pythagorean-means.md             |   4 +-
 .../rosetta-code/averages-root-mean-square.md |  12 +-
 .../rosetta-code/babbage-problem.md           |   4 +-
 .../rosetta-code/comma-quibbling.md           |  14 +-
 .../rosetta-code/compare-a-list-of-strings.md |  34 +--
 .../rosetta-code/count-the-coins.md           |   4 +-
 .../rosetta-code/cramers-rule.md              |  24 +-
 .../cumulative-standard-deviation.md          |  43 +++-
 .../rosetta-code/deal-cards-for-freecell.md   |  20 +-
 .../rosetta-code/discordian-date.md           |  37 ++-
 .../rosetta-code/dot-product.md               |   4 +-
 .../rosetta-code/euler-method.md              |   4 +-
 .../execute-a-markov-algorithm.md             | 214 ++++++-----------
 .../rosetta-code/execute-brain.md             |  22 +-
 .../factors-of-a-mersenne-number.md           |   6 +-
 .../rosetta-code/farey-sequence.md            |   4 +-
 .../fibonacci-n-step-number-sequences.md      |   8 +-
 .../rosetta-code/fibonacci-word.md            | 118 +++++-----
 .../rosetta-code/fractran.md                  |   4 +-
 .../rosetta-code/gamma-function.md            |   4 +-
 .../rosetta-code/general-fizzbuzz.md          |   4 +-
 .../rosetta-code/gray-code.md                 |   6 +-
 .../rosetta-code/happy-numbers.md             |   4 +-
 .../rosetta-code/hash-from-two-arrays.md      |  30 +--
 .../rosetta-code/hash-join.md                 |   6 +-
 .../rosetta-code/heronian-triangles.md        |   4 +-
 .../hofstadter-figure-figure-sequences.md     |  50 ++--
 .../rosetta-code/hofstadter-q-sequence.md     |   6 +-
 .../rosetta-code/i-before-e-except-after-c.md |   4 +-
 .../rosetta-code/iban.md                      |  14 +-
 .../rosetta-code/jortsort.md                  |   4 +-
 .../rosetta-code/josephus-problem.md          |   6 +-
 .../rosetta-code/kaprekar-numbers.md          |   6 +-
 .../rosetta-code/knights-tour.md              |  16 +-
 .../rosetta-code/least-common-multiple.md     |  22 +-
 .../rosetta-code/levenshtein-distance.md      |   4 +-
 .../linear-congruential-generator.md          |   6 +-
 .../rosetta-code/long-multiplication.md       |   4 +-
 .../longest-common-subsequence.md             |  40 ++--
 .../longest-increasing-subsequence.md         |  28 +--
 .../rosetta-code/look-and-say-sequence.md     |   4 +-
 .../rosetta-code/lu-decomposition.md          |   6 +-
 .../rosetta-code/ludic-numbers.md             |   4 +-
 .../luhn-test-of-credit-card-numbers.md       |   4 +-
 .../rosetta-code/lzw-compression.md           |  24 +-
 .../rosetta-code/s-expressions.md             |   6 +-
 .../sailors-coconuts-and-a-monkey-problem.md  |  25 +-
 .../rosetta-code/sedols.md                    |  25 +-
 .../rosetta-code/self-describing-numbers.md   |   4 +-
 .../rosetta-code/self-referential-sequence.md |   4 +-
 .../rosetta-code/semiprime.md                 |   4 +-
 .../rosetta-code/sha-1.md                     |   4 +-
 .../rosetta-code/sort-stability.md            |   4 +-
 .../sorting-algorithms-bead-sort.md           |  38 +--
 .../sorting-algorithms-bogosort.md            |   4 +-
 .../sorting-algorithms-cocktail-sort.md       |  26 +--
 .../sorting-algorithms-comb-sort.md           |  36 ++-
 .../sorting-algorithms-gnome-sort.md          |   4 +-
 .../sorting-algorithms-pancake-sort.md        |   4 +-
 .../sorting-algorithms-shell-sort.md          |   4 +-
 .../sorting-algorithms-stooge-sort.md         |   4 +-
 .../sorting-algorithms-strand-sort.md         |  32 ++-
 .../rosetta-code/soundex.md                   |  40 ++--
 .../rosetta-code/state-name-puzzle.md         |  17 +-
 .../rosetta-code/stern-brocot-sequence.md     |   4 +-
 .../rosetta-code/straddling-checkerboard.md   |  30 ++-
 .../rosetta-code/subleq.md                    |   4 +-
 .../rosetta-code/sudoku.md                    |   4 +-
 .../rosetta-code/sum-of-a-series.md           |   4 +-
 .../sutherland-hodgman-polygon-clipping.md    |   4 +-
 .../rosetta-code/symmetric-difference.md      |  24 +-
 .../rosetta-code/taxicab-numbers.md           |  23 +-
 .../rosetta-code/towers-of-hanoi.md           |  20 +-
 .../rosetta-code/y-combinator.md              |  24 +-
 .../zhang-suen-thinning-algorithm.md          |   4 +-
 .../rosetta-code/zig-zag-matrix.md            |   4 +-
 .../build-a-camper-leaderboard.md             |   6 +-
 .../build-a-light-bright-app.md               |   6 +-
 .../build-a-nightlife-coordination-app.md     |   4 +-
 .../build-a-pinterest-clone.md                |   8 +-
 .../take-home-projects/build-a-pong-game.md   |   6 +-
 .../take-home-projects/build-a-recipe-box.md  |   6 +-
 .../build-a-roguelike-dungeon-crawler-game.md |   6 +-
 .../take-home-projects/build-a-simon-game.md  |   6 +-
 .../build-a-tic-tac-toe-game.md               |   6 +-
 .../take-home-projects/build-a-voting-app.md  |   2 +-
 .../build-a-wikipedia-viewer.md               |  18 +-
 ...build-an-image-search-abstraction-layer.md |   2 +-
 .../build-the-game-of-life.md                 |  31 ++-
 .../chart-the-stock-market.md                 |   2 +-
 .../manage-a-book-trading-club.md             |   6 +-
 .../map-data-across-the-globe.md              |   6 +-
 .../p2p-video-chat-application.md             |   6 +-
 ...-contiguity-with-a-force-directed-graph.md |   6 +-
 .../show-the-local-weather.md                 |   8 +-
 .../use-the-twitch-json-api.md                |  16 +-
 .../book-recommendation-engine-using-knn.md   |  45 +++-
 .../cat-and-dog-image-classifier.md           |  94 +++++++-
 ...near-regression-health-costs-calculator.md |  26 ++-
 .../rock-paper-scissors.md                    |  50 +++-
 .../neural-networks-activation-functions.md   |   2 +-
 .../build-a-number-guessing-game.md           |   4 +-
 .../build-a-periodic-table-database.md        |   4 +-
 .../build-a-kitty-ipsum-translator.md         |   2 +-
 .../build-a-bike-rental-shop.md               |   2 +-
 .../build-a-boilerplate.md                    |   2 +-
 .../build-five-programs.md                    |   2 +-
 .../build-an-sql-reference-object.md          |   2 +-
 .../build-a-castle.md                         |   2 +-
 .../build-a-mario-database.md                 |   2 +-
 .../build-a-student-database-part-1.md        |   2 +-
 .../build-a-student-database-part-2.md        |   2 +-
 .../build-a-survey-form.md                    |  12 +-
 .../6148da157cc0bd0d06df5c0a.md               |  14 +-
 .../6148dc095264000dce348bf5.md               |   2 +-
 .../6148dcaaf2e8750e6cb4501a.md               |   2 +-
 .../6148dd31d210990f0fb140f8.md               |   2 +-
 .../6148defa9c01520fb9d178a0.md               |   2 +-
 .../6148dfab9b54c110577de165.md               |   2 +-
 .../6148e0bcc13efd10f7d7a6a9.md               |   2 +-
 .../6148e161ecec9511941f8833.md               |   2 +-
 .../6148e28706b34912340fd042.md               |   2 +-
 .../6148e335c1edd512d00e4691.md               |   2 +-
 .../6148e41c728f65138addf9cc.md               |   2 +-
 .../6148e5aeb102e3142de026a2.md               |   4 +-
 .../5f33294a6af5e9188dbdb8f3.md               |  23 +-
 .../5f332a88dc25a0fd25c7687a.md               |  25 +-
 .../5f332b23c2045fb843337579.md               |  31 +--
 .../5f344f9c805cd193c33d829c.md               |   8 +-
 .../5f344fad8bf01691e71a30eb.md               |   8 +-
 .../5f344fbc22624a2976425065.md               |   8 +-
 .../5f344fc1520b6719f2e35605.md               |  15 +-
 .../5f3477ae34c1239cafe128be.md               |   8 +-
 .../5f3477ae8466a9a3d2cc953c.md               |   8 +-
 .../5f3477ae9675db8bb7655b30.md               |  27 ++-
 .../5f3477aefa51bfc29327200b.md               |   8 +-
 .../5f3477cb2e27333b1ab2b955.md               |   8 +-
 .../5f3477cb303c5cb61b43aa9b.md               |   8 +-
 .../5f3477cbcb6ba47918c1da92.md               |   8 +-
 .../5f34a1fd611d003edeafd681.md               |   8 +-
 .../5f356ed60785e1f3e9850b6e.md               |   8 +-
 .../5f356ed60a5decd94ab66986.md               |   8 +-
 .../5f356ed6199b0cdef1d2be8f.md               |   8 +-
 .../5f356ed63c7807a4f1e6d054.md               |   8 +-
 .../5f356ed63e0fa262326eef05.md               |   8 +-
 .../5f356ed656a336993abd9f7c.md               |   8 +-
 .../5f356ed69db0a491745e2bb6.md               |   8 +-
 .../5f356ed6cf6eab5f15f5cfe6.md               |   8 +-
 .../5f35e5c4321f818cdc4bed30.md               |   8 +-
 .../5f35e5c44359872a137bd98f.md               |   8 +-
 .../5f3c866d0fc037f7311b4ac8.md               |   8 +-
 .../5f3c866d28d7ad0de6470505.md               |   8 +-
 .../5f3c866d5414453fc2d7b480.md               |   8 +-
 .../5f3c866daec9a49519871816.md               |   8 +-
 .../5f3c866dbf362f99b9a0c6d0.md               |   8 +-
 .../5f3c866dd0d0275f01d4d847.md               |   8 +-
 .../5f3c866de7a5b784048f94b1.md               |   8 +-
 .../5f3cade94c6576e7f7b7953f.md               |   8 +-
 .../5f3cade9993019e26313fa8e.md               |   8 +-
 .../5f3cade99dda4e6071a85dfd.md               |   8 +-
 .../5f3cade9fa77275d9f4efe62.md               |   8 +-
 .../5f3ef6e01f288a026d709587.md               |  20 +-
 .../5f3ef6e03d719d5ac4738993.md               |   8 +-
 .../5f3ef6e04559b939080db057.md               |   8 +-
 .../5f3ef6e050279c7a4a7101d3.md               |   8 +-
 .../5f3ef6e05473f91f948724ab.md               |   8 +-
 .../5f3ef6e056bdde6ae6892ba2.md               |   8 +-
 .../5f3ef6e06d34faac0447fc44.md               |   8 +-
 .../5f3ef6e07276f782bb46b93d.md               |  10 +-
 .../5f3ef6e0819d4f23ca7285e6.md               |   8 +-
 .../5f3ef6e087d56ed3ffdc36be.md               |   8 +-
 .../5f3ef6e0a81099d9a697b550.md               |   8 +-
 .../5f3ef6e0b431cc215bb16f55.md               |   8 +-
 .../5f3ef6e0e0c3feaebcf647ad.md               |   8 +-
 .../5f3ef6e0e9629bad967cd71e.md               |   8 +-
 .../5f3ef6e0eaa7da26e3d34d78.md               |   8 +-
 .../5f3ef6e0f8c230bdd2349716.md               |   8 +-
 .../5f3f26fa39591db45e5cd7a0.md               |  10 +-
 .../5f459225127805351a6ad057.md               |  10 +-
 .../5f459a7ceb8b5c446656d88b.md               |  10 +-
 .../5f459cf202c2a3472fae6a9f.md               |  10 +-
 .../5f459fd48bdc98491ca6d1a3.md               |  12 +-
 .../5f45a05977e2fa49d9119437.md               |  10 +-
 .../5f45a276c093334f0f6e9df4.md               |  10 +-
 .../5f45a5a7c49a8251f0bdb527.md               |  10 +-
 .../5f45a66d4a2b0453301e5a26.md               |  10 +-
 .../5f45b0731d39e15d54df4dfc.md               |  10 +-
 .../5f45b25e7ec2405f166b9de1.md               |  10 +-
 .../5f45b3c93c027860d9298dbd.md               |  10 +-
 .../5f45b45d099f3e621fbbb256.md               |  10 +-
 .../5f45b4c81cea7763550e40df.md               |  10 +-
 .../5f45b715301bbf667badc04a.md               |  10 +-
 .../5f46e270702a8456a664f0df.md               |  10 +-
 .../5f46e36e745ead58487aabf2.md               |  10 +-
 .../5f46e7a4750dd05b5a673920.md               |  10 +-
 .../5f46e8284aae155c83015dee.md               |  10 +-
 .../5f46ede1ff8fec5ba656b44c.md               |  10 +-
 .../5f46fc57528aa1c4b5ea7c2e.md               |  10 +-
 .../5f4701b942c824109626c3d8.md               |  10 +-
 .../5f475bb508746c16c9431d42.md               |  10 +-
 .../5f475e1c7f71a61d913836c6.md               |  10 +-
 .../5f47633757ae3469f2d33d2e.md               |   8 +-
 .../5f47fe7e31980053a8d4403b.md               |  16 +-
 .../5f716ad029ee4053c7027a7a.md               |   8 +-
 .../5f716bee5838c354c728a7c5.md               |   8 +-
 .../5f7691dafd882520797cd2f0.md               |   8 +-
 .../5f7692f7c5b3ce22a57788b6.md               |   8 +-
 .../5f769541be494f25449b292f.md               |   8 +-
 .../5f76967fad478126d6552b0d.md               |   8 +-
 .../5f769702e6e33127d14aa120.md               |   8 +-
 .../5f7b87422a560036fd03ccff.md               |   8 +-
 .../5f7b88d37b1f98386f04edc0.md               |   8 +-
 .../616965351e74d4689eb6de30.md               |  13 +-
 .../61537a8054753e2f1f2a1574.md               |  10 +-
 .../61537c5f81f0cf325b4a854c.md               |  12 +-
 .../615380dff67172357fcf0425.md               |   2 +-
 .../6153897c27f6334716ee5abe.md               |   2 +-
 .../615389bd81347947ea7ba896.md               |   8 +-
 .../6153908a366afb4d57185c8d.md               |   2 +-
 .../615392916d83fa4f02f7e2cf.md               |   4 +-
 .../6153938dce8b294ff8f5a4e9.md               |   2 +-
 .../61539e07e7430b528fbffe21.md               |   2 +-
 .../61539f32a206bd53ec116465.md               |   2 +-
 .../6153a3952facd25a83fe8083.md               |   2 +-
 .../6153a3ebb4f7f05b8401b716.md               |   2 +-
 .../61437d575fb98f57fa8f7f36.md               |   6 +-
 .../614385513d91ae5c251c2052.md               |   2 +-
 .../614389f601bb4f611db98563.md               |   2 +-
 .../61439dfc811e12666b04be6f.md               |   2 +-
 .../6143a1a228f7d068ab16a130.md               |   4 +-
 .../6143a73279ce6369de4b9bcc.md               |   2 +-
 .../6143a778bffc206ac6b1dbe3.md               |   2 +-
 .../6143b97c06c3306d23d5da47.md               |   2 +-
 .../6143b9e1f5035c6e5f2a8231.md               |   4 +-
 .../6143bb50e8e48c6f5ef9d8d5.md               |   2 +-
 .../6143c2a363865c715f1a3f72.md               |   2 +-
 .../6143cd08fe927072ca3a371d.md               |   2 +-
 .../6143d2842b497779bad947de.md               |   2 +-
 .../6144ee790af79815ad15a832.md               |   2 +-
 .../6144f1410990ea17187a722b.md               |   2 +-
 .../6144f3818bfbc51844152e36.md               |   2 +-
 .../6144f42204c8c8195f1f3345.md               |   2 +-
 .../6148b07081759c2c691166a9.md               |   2 +-
 .../6148b0d764e4192e5712ed92.md               |   2 +-
 .../6148b30464daf630848c21d4.md               |   2 +-
 .../6148b4b150434734143db6f2.md               |   2 +-
 .../6148bd62bbb8c83a5f1fc1b3.md               |   2 +-
 .../6148be3d605d6b3ca9425d11.md               |   2 +-
 .../6148bf49fcc7913f05dbf9b7.md               |   2 +-
 .../6148bfc43df3bc40fe0e6405.md               |   2 +-
 .../6148c224ecb157439bc5247c.md               |   2 +-
 .../6148c721e74ecd4c619ae51c.md               |   2 +-
 .../6148cf094b3f2b4e8a032c63.md               |   2 +-
 .../6148d0b863d10d50544ace0e.md               |   2 +-
 .../6148d1f9eb63c252e1f8acc4.md               |   2 +-
 .../6148d2444d01ab541e64a1e4.md               |   2 +-
 .../6148d33e31fccf558696c745.md               |   2 +-
 .../6148d3fff5186b57123d97e2.md               |   2 +-
 .../6148d4d57b965358c9fa38bf.md               |   2 +-
 .../6148d94fdf6a5d6899f8ff15.md               |   2 +-
 .../6148e162e255676ae0da6a76.md               |   2 +-
 .../6148e19c3e26436be0155690.md               |   2 +-
 .../6148e246146b646cf4255f0c.md               |   2 +-
 .../6148e4d6861a486f60681f36.md               |   2 +-
 .../6148e5a204d99e70343a63e4.md               |   2 +-
 .../6148f6f7d8914c78e93136ca.md               |   8 +-
 .../614e0e588f0e8a772a8a81a6.md               |   2 +-
 .../6165d3b702a5d92ad970b30c.md               |   2 +-
 .../6169cd8a558aa8434e0ad7f6.md               |   2 +-
 .../619665c9abd72906f3ad30f9.md               |  22 +-
 .../61967e74a8e3690ab6292daa.md               |   6 +-
 .../61968df2acd5550bf1616c34.md               |   6 +-
 .../61968e9243a4090cc805531c.md               |   4 +-
 .../61968f8877c6720d6d61aaf5.md               |   4 +-
 .../619691693bc14b0e528f5a20.md               |   4 +-
 .../6196928658b6010f28c39484.md               |   2 +-
 .../619692ff79f5770fc6d8c0b4.md               |   4 +-
 .../6196990f966e8f10a40094f6.md               |   4 +-
 .../619699c10a0f6e11591d73c4.md               |   4 +-
 .../61969aa6acef5b12200f672e.md               |   4 +-
 .../61969c487ced6f12db8fef94.md               |   2 +-
 .../61969d66cfcdba137d021558.md               |   4 +-
 .../61969e7451455614217e901b.md               |   4 +-
 .../6196adc17f77a714d51485f2.md               |   4 +-
 .../6196aead7ac7bf1584b17a7f.md               |   6 +-
 .../6196ce0415498d2463989e84.md               |   2 +-
 .../6196cee94c6da1253809dff9.md               |   2 +-
 .../6196d00a5d7292262bc02f4c.md               |   2 +-
 .../6196d0cda039d026f7f78d1e.md               |   2 +-
 .../6196d1ac33c68d27dcda5796.md               |   2 +-
 .../6196d213d99f16287bff22ae.md               |   2 +-
 .../6196d2c0f22ca0293107c048.md               |   4 +-
 .../6196d32d1340d829f0f6f57d.md               |   2 +-
 .../6196d41d40bf9b2aaea5d520.md               |   2 +-
 .../6197cff995d03905b0cca8ad.md               |   2 +-
 .../6197f40a16afea068c7e60c8.md               |   2 +-
 .../6197f667297bb30a552ce017.md               |   4 +-
 .../61993b72e874e709b8dfd666.md               |   2 +-
 .../61993cf26a8e0f0a553db223.md               |   4 +-
 .../61993dbb35adf30b10d49e38.md               |   2 +-
 .../61993e9adc9e9a0bb4d28fff.md               |   2 +-
 .../6199409834ccaf0d10736596.md               |   2 +-
 .../6199429802b7c10dc79ff871.md               |   2 +-
 .../619943285a41720e6370d985.md               |   4 +-
 .../619943876b706d0f35c01dbc.md               |   2 +-
 .../6199442866286d0ff421a4fc.md               |   2 +-
 .../619bcf239fc15905ecd66fce.md               |   2 +-
 .../619be73b3c806006ccc00bb0.md               |   2 +-
 .../619be7af7b0bf60770f5d2a4.md               |   2 +-
 .../619be80062551a080e32c821.md               |   2 +-
 .../619be8ce4ea49008c5bfbc30.md               |   2 +-
 .../619be946958c6009844f1dee.md               |   2 +-
 .../619c155df0063a0a3fec0e32.md               |   2 +-
 .../619c16debd0c270b01c5ce38.md               |   2 +-
 .../619cfdf2e63ddf05feab86ad.md               |   2 +-
 .../619d019488f98c06acbbb71a.md               |   2 +-
 .../619d022dc8400c0763829a17.md               |   4 +-
 .../619d02c7bc95bf0827a5d296.md               |   2 +-
 .../619d033915012509031f309a.md               |   2 +-
 .../619d03dadadb6509a16f4f5f.md               |   2 +-
 .../619d0503e03a790a4179d463.md               |   2 +-
 .../619d05c54dabca0b10058235.md               |   2 +-
 .../619d0882f54bf40bdc4671ed.md               |   2 +-
 .../619d090cd8d6db0c93dc5087.md               |   2 +-
 .../619d0b51ca42ed0d74582186.md               |   2 +-
 .../619d0bc9cb05360e1bf549c3.md               |   2 +-
 .../619d0c1594c38c0ebae75878.md               |   6 +-
 .../619d0d18ca99870f884a7bff.md               |   4 +-
 .../619d0daf214542102739b0da.md               |   2 +-
 .../619d0e56f9ca9710fcb974e3.md               |   2 +-
 .../619d0eec0ac40611b41e2ccc.md               |   2 +-
 .../619d0fc9825c271253df28d4.md               |   2 +-
 .../619d102d786c3d13124c37c6.md               |   2 +-
 .../619d107edf7ddf13cc77106a.md               |   6 +-
 .../619d10cc98145f14820399c5.md               |   2 +-
 .../619d115e2adcd71538e82ebb.md               |   2 +-
 .../619d11e6d5ef9515d2a16033.md               |   4 +-
 .../619d129a417d0716a94de913.md               |   4 +-
 .../619d1340361095175f4b5115.md               |   2 +-
 .../619d15797b580c1828b05426.md               |   2 +-
 .../619d15d955d9d418c4487bbc.md               |   2 +-
 .../619d1629a8adc61960ca8b40.md               |   2 +-
 .../619d1c5fc9f8941a400955da.md               |   2 +-
 .../619d1dab9ff3421ae1976991.md               |   2 +-
 .../619d1deb8b04811b8839ffe4.md               |   2 +-
 .../619d1e7a8e81a61c5a819dc4.md               |   2 +-
 .../619d1ed33c9a071cf657a0d6.md               |   2 +-
 .../619d1fb5d244c31db8a7fdb7.md               |   2 +-
 .../619d204bd73ae51e743b8e94.md               |   4 +-
 .../619d20b12996101f430920fb.md               |   4 +-
 .../619d21fe6a3f9b2016be9d9d.md               |   6 +-
 .../619d229b0e542520cd91c685.md               |   2 +-
 .../619d23089e787e216a7043d6.md               |   2 +-
 .../619d237a107c10221ed743fa.md               |   2 +-
 .../619d26b12e651022d80cd017.md               |   2 +-
 .../619d2712853306238f41828e.md               |   2 +-
 .../619d2b7a84e78b246f2d17a2.md               |   6 +-
 .../619d2bd9c1d43c2526e96f1f.md               |   4 +-
 .../619d2d4e80400325ff89664a.md               |   2 +-
 .../619d2ebc81ba81271460850d.md               |   2 +-
 .../619d2f0e9440bc27caee1cec.md               |   2 +-
 .../619d2fd3ff4f772882e3d998.md               |   2 +-
 .../619d30350883802921bfcccc.md               |   2 +-
 .../619d324f5915c929f36ae91d.md               |   2 +-
 .../619d32c7fa21f32aaa91d499.md               |   2 +-
 .../619d333b738e3c2b5d58b095.md               |   2 +-
 .../619d337765b9f02c10e93722.md               |   2 +-
 .../619d33c51140292cc5a21742.md               |   2 +-
 .../619d3482f505452d861d0f62.md               |   2 +-
 .../619d3561a951bf2e41a24f10.md               |   2 +-
 .../619d36103839c82efa95dd34.md               |   2 +-
 .../619d3711d04d623000013e9e.md               |   2 +-
 .../61a8fe15a6a31306e60d1e89.md               |   4 +-
 .../5d822fd413a79914d39e9908.md               |  22 +-
 .../5d822fd413a79914d39e9909.md               |  16 +-
 .../5d822fd413a79914d39e990a.md               |  26 +--
 .../5d822fd413a79914d39e990b.md               |  18 +-
 .../5d822fd413a79914d39e990c.md               |  18 +-
 .../5d822fd413a79914d39e990d.md               |  18 +-
 .../5d822fd413a79914d39e990e.md               |  20 +-
 .../5d822fd413a79914d39e990f.md               |  24 +-
 .../5d822fd413a79914d39e9910.md               |  16 +-
 .../5d822fd413a79914d39e9911.md               |  24 +-
 .../5d822fd413a79914d39e9912.md               |  22 +-
 .../5d822fd413a79914d39e9913.md               |  18 +-
 .../5d822fd413a79914d39e9914.md               |  18 +-
 .../5d822fd413a79914d39e9915.md               |  16 +-
 .../5d822fd413a79914d39e9916.md               |  24 +-
 .../5d822fd413a79914d39e9917.md               |  22 +-
 .../5d822fd413a79914d39e9918.md               |  20 +-
 .../5d822fd413a79914d39e9919.md               |  20 +-
 .../5d822fd413a79914d39e991a.md               |  22 +-
 .../5d822fd413a79914d39e991b.md               |  22 +-
 .../5d822fd413a79914d39e991c.md               |  20 +-
 .../5d822fd413a79914d39e991d.md               |  18 +-
 .../5d822fd413a79914d39e991e.md               |  22 +-
 .../5d822fd413a79914d39e991f.md               |  20 +-
 .../5d822fd413a79914d39e9920.md               |  22 +-
 .../5d822fd413a79914d39e9921.md               |  26 +--
 .../5d822fd413a79914d39e9922.md               |  22 +-
 .../5d822fd413a79914d39e9923.md               |  22 +-
 .../5d822fd413a79914d39e9924.md               |  20 +-
 .../5d822fd413a79914d39e9925.md               |  22 +-
 .../5d822fd413a79914d39e9926.md               |  24 +-
 .../5d822fd413a79914d39e9927.md               |  20 +-
 .../5d822fd413a79914d39e9928.md               |  16 +-
 .../5d822fd413a79914d39e9929.md               |  16 +-
 .../5d822fd413a79914d39e992a.md               |  16 +-
 .../5d822fd413a79914d39e992b.md               |  16 +-
 .../5d822fd413a79914d39e992c.md               |  16 +-
 .../5d822fd413a79914d39e992d.md               |  16 +-
 .../5d822fd413a79914d39e992e.md               |  16 +-
 .../5d822fd413a79914d39e992f.md               |  16 +-
 .../5d822fd413a79914d39e9930.md               |  16 +-
 .../5d822fd413a79914d39e9931.md               |   6 +-
 .../5d822fd413a79914d39e9932.md               |  16 +-
 .../5d822fd413a79914d39e9933.md               |  16 +-
 .../5d822fd413a79914d39e9934.md               |  14 +-
 .../5d822fd413a79914d39e9935.md               |  14 +-
 .../5d822fd413a79914d39e9936.md               |  16 +-
 .../5d822fd413a79914d39e9937.md               |  16 +-
 .../5d822fd413a79914d39e9938.md               |  16 +-
 .../5d822fd413a79914d39e9939.md               |  16 +-
 .../5d822fd413a79914d39e993a.md               |  14 +-
 .../5d822fd413a79914d39e993b.md               |  16 +-
 .../5d822fd413a79914d39e993c.md               |   4 +-
 .../5d822fd413a79914d39e993d.md               |  16 +-
 .../5d822fd413a79914d39e993e.md               |  28 +--
 .../5dc2385ff86c76b9248c6eb7.md               |  12 +-
 .../5dc23991f86c76b9248c6eb8.md               |  18 +-
 .../5dc23f9bf86c76b9248c6eba.md               |   2 +-
 .../5dc24073f86c76b9248c6ebb.md               |  14 +-
 .../5dc24165f86c76b9248c6ebc.md               |   2 +-
 .../5dc24614f86c76b9248c6ebd.md               |   2 +-
 .../5ddbd81294d8ddc1510a8e56.md               |   8 +-
 .../5dfa22d1b521be39a3de7be0.md               |  11 +-
 .../5dfa2407b521be39a3de7be1.md               |   2 +-
 .../5dfa30b9eacea3f48c6300ad.md               |   2 +-
 .../5dfa3589eacea3f48c6300ae.md               |   2 +-
 .../5dfa371beacea3f48c6300af.md               |   2 +-
 .../5dfa37b9eacea3f48c6300b0.md               |   4 +-
 .../5dfb5ecbeacea3f48c6300b1.md               |   2 +-
 .../5dfb6250eacea3f48c6300b2.md               |   2 +-
 .../5dfb655eeacea3f48c6300b3.md               |   6 +-
 .../5dfb6a35eacea3f48c6300b4.md               |   2 +-
 .../5ef9b03c81a63668521804d0.md               |   2 +-
 .../5ef9b03c81a63668521804d1.md               |   2 +-
 .../5ef9b03c81a63668521804d2.md               |   2 +-
 .../5ef9b03c81a63668521804d3.md               |   2 +-
 .../5ef9b03c81a63668521804d4.md               |   2 +-
 .../5ef9b03c81a63668521804d5.md               |   2 +-
 .../5ef9b03c81a63668521804d6.md               |   2 +-
 .../5ef9b03c81a63668521804d7.md               |   2 +-
 .../5ef9b03c81a63668521804d8.md               |   2 +-
 .../5ef9b03c81a63668521804d9.md               |   2 +-
 .../5ef9b03c81a63668521804da.md               |   2 +-
 .../5ef9b03c81a63668521804db.md               |   2 +-
 .../5ef9b03c81a63668521804dc.md               |   2 +-
 .../5ef9b03c81a63668521804dd.md               |   2 +-
 .../5ef9b03c81a63668521804de.md               |   2 +-
 .../5ef9b03c81a63668521804df.md               |   2 +-
 .../5ef9b03c81a63668521804e1.md               |   2 +-
 .../5ef9b03c81a63668521804e2.md               |   2 +-
 .../5ef9b03c81a63668521804e3.md               |   2 +-
 .../5ef9b03c81a63668521804e5.md               |   2 +-
 .../5ef9b03c81a63668521804e7.md               |   2 +-
 .../5ef9b03c81a63668521804e8.md               |   2 +-
 .../5ef9b03c81a63668521804e9.md               |   2 +-
 .../5ef9b03c81a63668521804ea.md               |   2 +-
 .../5ef9b03c81a63668521804eb.md               |   2 +-
 .../5ef9b03c81a63668521804ec.md               |   2 +-
 .../5ef9b03c81a63668521804ee.md               |   2 +-
 .../5efada803cbd2bbdab94e332.md               |   2 +-
 .../5efae0543cbd2bbdab94e333.md               |   2 +-
 .../5efae16e3cbd2bbdab94e334.md               |   2 +-
 .../5efb23e70dc218d6c85f89b1.md               |   2 +-
 .../5efb2c990dc218d6c85f89b2.md               |  16 +-
 .../5efc4f528d6a74d05e68af74.md               |  10 +-
 .../5efc518e8d6a74d05e68af75.md               |   2 +-
 .../5efc54138d6a74d05e68af76.md               |   2 +-
 .../5efc575c8d6a74d05e68af77.md               |   2 +-
 .../5f05a1d8e233dff4a68508d8.md               |   2 +-
 .../5f07be6ef7412fbad0c5626b.md               |  18 +-
 .../5f07c98cdb9413cbd4b16750.md               |   2 +-
 .../5f07fb1579dc934717801375.md               |  52 ++---
 .../5f0d48e7b435f13ab6550051.md               |   2 +-
 .../5f0d4ab1b435f13ab6550052.md               |   2 +-
 .../5f0d4d04b435f13ab6550053.md               |   2 +-
 .../5f1a80975fc4bcae0edb3497.md               |   2 +-
 .../5f1a89f1190aff21ae42105a.md               |   2 +-
 .../62bb4009e3458a128ff57d5d.md               |   4 +-
 .../62dabe2ef403a12d5d295273.md               |  16 +-
 .../7cf9b03d81a65668421804c3.md               |   2 +-
 .../60f0286404aefb0562a4fdf9.md               |   2 +-
 .../60f1922fcbd2410527b3bd89.md               |   9 +-
 .../60f5cb8875ab6a0610f05071.md               |  10 +-
 .../60f803d5241e6a0433a523a1.md               |   9 +-
 .../60f8604682407e0d017bbf7f.md               |   2 +-
 .../60fabf0dd4959805dbae09e6.md               |   2 +-
 .../60ffe1bc30415f042faea936.md               |   2 +-
 .../60ffe3936796ac04959285a9.md               |   2 +-
 .../60ffe69ee377c6055e192a46.md               |  12 +-
 .../60ffe7d8aae62c05bcc9e7eb.md               |   8 +-
 .../60ffec2825da1007509ddd06.md               |   2 +-
 .../62b30924c5e4ef0daba23b5e.md               |   4 +-
 .../62cc5b1779e4d313466f73c5.md               |   2 +-
 .../62ff8b9dab5ac88e4d3d43a3.md               |   2 +-
 .../62ff8e998d3e7eae14d6ae3b.md               |   2 +-
 .../62ff919a7b5612c0670923a5.md               |   2 +-
 .../60b69a66b6ddb80858c5157e.md               |   2 +-
 .../60b69a66b6ddb80858c51580.md               |   2 +-
 .../60b69a66b6ddb80858c51581.md               |   4 +-
 .../60b69a66b6ddb80858c51582.md               |   2 +-
 .../60b69a66b6ddb80858c51583.md               |   4 +-
 .../60b69a66b6ddb80858c51584.md               |   2 +-
 .../60b69a66b6ddb80858c51585.md               |   2 +-
 .../60b69a66b6ddb80858c51586.md               |   2 +-
 .../60b69a66b6ddb80858c51588.md               |   2 +-
 .../60b69a66b6ddb80858c5158b.md               |   2 +-
 .../60b69a66b6ddb80858c5158d.md               |   2 +-
 .../60b69a66b6ddb80858c5158f.md               |   2 +-
 .../60b69a66b6ddb80858c51591.md               |   2 +-
 .../60b69a66b6ddb80858c51592.md               |   2 +-
 .../60b69a66b6ddb80858c51595.md               |   4 +-
 .../60b69a66b6ddb80858c51598.md               |   4 +-
 .../60b69a66b6ddb80858c51599.md               |   2 +-
 .../60b69a66b6ddb80858c5159a.md               |   4 +-
 .../60b69a66b6ddb80858c5159b.md               |   4 +-
 .../60b69a66b6ddb80858c5159d.md               |   2 +-
 .../60b69a66b6ddb80858c5159f.md               |   2 +-
 .../60b69a66b6ddb80858c515a1.md               |   2 +-
 .../60b69a66b6ddb80858c515a2.md               |   2 +-
 .../60b69a66b6ddb80858c515a5.md               |   2 +-
 .../60b69a66b6ddb80858c515a6.md               |   2 +-
 .../60b69a66b6ddb80858c515a7.md               |   4 +-
 .../60b69a66b6ddb80858c515a9.md               |   2 +-
 .../60b69a66b6ddb80858c515aa.md               |   2 +-
 .../60b69a66b6ddb80858c515ab.md               |   2 +-
 .../60b69a66b6ddb80858c515ac.md               |   2 +-
 .../60b69a66b6ddb80858c515ad.md               |   2 +-
 .../60b69a66b6ddb80858c515ae.md               |   2 +-
 .../60b69a66b6ddb80858c515af.md               |   4 +-
 .../60b69a66b6ddb80858c515b0.md               |   2 +-
 .../60b69a66b6ddb80858c515b1.md               |   4 +-
 .../60b69a66b6ddb80858c515b2.md               |   4 +-
 .../60b69a66b6ddb80858c515b3.md               |   2 +-
 .../60b69a66b6ddb80858c515b4.md               |   4 +-
 .../60b69a66b6ddb80858c515b7.md               |   2 +-
 .../60b69a66b6ddb80858c515b8.md               |   2 +-
 .../60b69a66b6ddb80858c515b9.md               |   2 +-
 .../60b69a66b6ddb80858c515bc.md               |   2 +-
 .../60b69a66b6ddb80858c515bd.md               |   2 +-
 .../60b69a66b6ddb80858c515be.md               |   2 +-
 .../60b69a66b6ddb80858c515c0.md               |   2 +-
 .../60b69a66b6ddb80858c515c3.md               |   2 +-
 .../60b69a66b6ddb80858c515c5.md               |   2 +-
 .../60ba8913f1704c0f7a8906b8.md               |   2 +-
 .../60ba89146b25080f99ab54ad.md               |   2 +-
 .../60ba8914bab51f0fb8228e9c.md               |   2 +-
 .../60ba929345ab0714a3743655.md               |   2 +-
 .../61fd5a93fd62bb35968adeab.md               |  34 +--
 .../61fd6343fb42013d99bcd7f3.md               |   4 +-
 .../61fd66c687e610436494c6f1.md               |   6 +-
 .../61fd67a656743144844941cb.md               |   2 +-
 .../61fd6ab779390f49148773bb.md               |   2 +-
 .../61fd6b7c83dbf54a08cf0498.md               |  12 +-
 .../61fd6cc9475a784b7776233e.md               |   2 +-
 .../61fd70336ebb3e4f62ee81ba.md               |   2 +-
 .../61fd719788899952e67692b9.md               |   2 +-
 .../61fd71d596e8f253b9408b39.md               |   2 +-
 .../61fd75ea7f663457612dba02.md               |  12 +-
 .../61fd7648a7ba2e5882436831.md               |   8 +-
 .../61fd778081276b59d59abad6.md               |   4 +-
 .../61fd77f7ad2aeb5ae34d07d6.md               |   4 +-
 .../61fd78621573aa5e8b512f5e.md               |  22 +-
 .../61fd7a160ed17960e971f28b.md               |   2 +-
 .../61fd7b3fcaa5406257abc5d1.md               |   2 +-
 .../61fd8e491324ce717da97ffe.md               |   8 +-
 .../61fd8fd08af43372f02952d0.md               |   2 +-
 .../61fd9126aa72a474301fc49f.md               |   2 +-
 .../61fd933ba685de776a94997e.md               |  22 +-
 .../61fd94056e0355785fbba4d3.md               |   4 +-
 .../61fd986ddbcbd47ba8fbc5ec.md               |   4 +-
 .../61fd990577d8227dd93fbeeb.md               |  10 +-
 .../61fd9a4ff2fc4481b9157bd7.md               |   2 +-
 .../61fd9ad665a4a282c8106be3.md               |   2 +-
 .../61fd9b7285bde783ad5b8aac.md               |   2 +-
 .../61fd9d9fbdfe078800317055.md               |   2 +-
 .../61fda307bde0b091cf7d884a.md               |   2 +-
 .../61fda339eadcfd92a6812bed.md               |   2 +-
 .../61fdac1e31692f9a9ad97295.md               |   4 +-
 .../61fdaea3999cb19d76ce717b.md               |   2 +-
 .../61fdaf9ff894b6a084ecdc1b.md               |   4 +-
 .../61fdafe6f07fd7a1c6785bc2.md               |   4 +-
 .../61fdb04d9939f0a26ca51c2b.md               |   2 +-
 .../620159cd5431aa34bc6a4c9c.md               |   2 +-
 .../62015a5da1c95c358f079ebb.md               |   4 +-
 .../62015cd2654a1139321a89d2.md               |   2 +-
 .../62015d8942384c3aed48329e.md               |   2 +-
 .../620167374bb8b4455cd11125.md               |   2 +-
 .../620174ed519dd7506c1a4b61.md               |   2 +-
 .../620175b3710a0951cfa86edf.md               |   8 +-
 .../6201782cc420715562f36271.md               |   2 +-
 .../620179bc0a6a2358c72b90ad.md               |   2 +-
 .../62017b6f47454059bf2d3bd1.md               |   2 +-
 .../62017f47c87be96457c49f46.md               |   2 +-
 .../62017fa5bbef406580ceb44f.md               |   2 +-
 .../62018243f046a368fab8ffb6.md               |   2 +-
 .../6201830cb0c74b69f1b41635.md               |   2 +-
 .../620186f4b6b8356d2def576b.md               |   2 +-
 .../62018ba1aa263770c953be66.md               |   2 +-
 .../62018c3e94434a71af1d5eaa.md               |  10 +-
 .../62018ec29b3ae674f40bef31.md               |   2 +-
 .../62019093fe30e278e797d2f6.md               |   2 +-
 .../620191707bc65579ddd3ce15.md               |   8 +-
 .../620192a767533a7ad19d96d7.md               |   2 +-
 .../6201995d9ab88e80f1989dce.md               |   2 +-
 .../620199c7a7a32c81d4db3410.md               |   2 +-
 .../6201a1a7af32c287bd6b8183.md               |   2 +-
 .../6201a1cc668a34888f5b2f52.md               |   2 +-
 .../6201a20d742f5c89736c8cfb.md               |   2 +-
 .../6201a42e39bf3b95b6a33bf3.md               |   2 +-
 .../6201a4adcc6414968b391592.md               |   2 +-
 .../6201a5258af7b398b030bfaf.md               |   2 +-
 .../6201a59be346d399c21d10b1.md               |   2 +-
 .../612e6afc009b450a437940a1.md               |  16 +-
 .../612e83ec2eca1e370f830511.md               |  13 +-
 .../612eaf56b7ba3257fdbfb0db.md               |   2 +-
 .../612ebcba99bfa46a15370b11.md               |  18 +-
 .../612ec19d5268da7074941f84.md               |  16 +-
 .../roman-numeral-converter.md                |   2 +-
 .../62a23d1c5f1c93161f3582ae.md               |   6 +-
 .../62a3cfc8328d3351b95d4f61.md               |   2 +-
 .../62a8aa98a8289d0a698eee1d.md               |   2 +-
 .../62a8cbd1e3595431d5a2b3f1.md               |   2 +-
 .../62a8ce73d0dce43468f6689c.md               |   4 +-
 .../62a8cf22272d6d35af80d4ac.md               |   2 +-
 .../62a8d0337d7c67377a4a76c6.md               |   6 +-
 .../62a8d08668fa8b38732486e9.md               |   2 +-
 .../62a8d61ddfe35744369365b7.md               |   6 +-
 .../62a8d6c7001ebc45350e3d16.md               |   4 +-
 .../62a8e35675c18c56354c08cf.md               |   6 +-
 .../62a8e41e2f190c58404dd46e.md               |   4 +-
 .../62a8ed36d7a7915dfa444ba2.md               |   2 +-
 .../62a8edd05e27cc668051686f.md               |   2 +-
 .../62a8eec45f77bc69e8775294.md               |   2 +-
 .../62a8ef8f0c76a46cd221a68c.md               |   2 +-
 .../62a8efb0e3ce826db8daf80f.md               |   2 +-
 .../62a8eff21c0b0f6ebe5b8e38.md               |   2 +-
 .../62aa204c1e1d33348ff09944.md               |   2 +-
 .../62aa20e9cf1be9358f5aceae.md               |   4 +-
 .../62aa226207f33d3ad4c6f546.md               |   6 +-
 .../62aa264d23cdaa45a20efada.md               |   2 +-
 .../62aa27227399d647e1c37a3c.md               |   4 +-
 .../62aa27560def7048d7b4a095.md               |   2 +-
 .../62aa27c40ca6f04ab8be5fac.md               |   2 +-
 .../build-a-survey-form.md                    |  12 +-
 ...ugh-all-an-arrays-items-using-for-loops.md |   2 +-
 ...-one-decimal-by-another-with-javascript.md |   6 -
 .../escape-sequences-in-strings.md            |  12 +-
 ...-variables-with-the-assignment-operator.md |   6 -
 .../quoting-strings-with-single-quotes.md     |   6 -
 .../basic-javascript/stand-in-line.md         |   4 +-
 .../use-recursion-to-create-a-countdown.md    |   7 +
 ...-recursion-to-create-a-range-of-numbers.md |   7 +
 ...syntax-to-define-a-constructor-function.md |  31 ++-
 ...-concise-declarative-functions-with-es6.md |   3 +-
 .../make-a-person.md                          |   8 -
 .../steamroller.md                            |   7 +
 .../sum-all-primes.md                         |  56 +++--
 .../add-methods-after-inheritance.md          |  48 +++-
 .../build-a-25-5-clock.md                     |   2 +-
 .../build-a-drum-machine.md                   |   2 +-
 .../build-a-javascript-calculator.md          |   2 +-
 .../build-a-markdown-previewer.md             |   2 +-
 .../build-a-random-quote-machine.md           |   2 +-
 .../mongodb-and-mongoose/create-a-model.md    |   2 +-
 .../problem-10-summation-of-primes.md         |  54 +++--
 .../build-a-survey-form.md                    |  12 +-
 .../6148da157cc0bd0d06df5c0a.md               |  14 +-
 .../6148dc095264000dce348bf5.md               |   2 +-
 .../6148dcaaf2e8750e6cb4501a.md               |   2 +-
 .../6148dd31d210990f0fb140f8.md               |   2 +-
 .../6148defa9c01520fb9d178a0.md               |   2 +-
 .../6148dfab9b54c110577de165.md               |   2 +-
 .../6148e0bcc13efd10f7d7a6a9.md               |   2 +-
 .../6148e161ecec9511941f8833.md               |   2 +-
 .../6148e28706b34912340fd042.md               |   2 +-
 .../6148e335c1edd512d00e4691.md               |   2 +-
 .../6148e41c728f65138addf9cc.md               |   2 +-
 .../6148e5aeb102e3142de026a2.md               |   4 +-
 .../5f33294a6af5e9188dbdb8f3.md               |  23 +-
 .../5f332a88dc25a0fd25c7687a.md               |  25 +-
 .../5f332b23c2045fb843337579.md               |  31 +--
 .../5f344f9c805cd193c33d829c.md               |   8 +-
 .../5f344fad8bf01691e71a30eb.md               |   8 +-
 .../5f344fbc22624a2976425065.md               |   8 +-
 .../5f344fc1520b6719f2e35605.md               |  15 +-
 .../5f3477ae34c1239cafe128be.md               |   8 +-
 .../5f3477ae8466a9a3d2cc953c.md               |   8 +-
 .../5f3477ae9675db8bb7655b30.md               |  17 +-
 .../5f3477aefa51bfc29327200b.md               |   8 +-
 .../5f3477cb2e27333b1ab2b955.md               |   8 +-
 .../5f3477cb303c5cb61b43aa9b.md               |   8 +-
 .../5f3477cbcb6ba47918c1da92.md               |   8 +-
 .../5f34a1fd611d003edeafd681.md               |   8 +-
 .../5f356ed60785e1f3e9850b6e.md               |   8 +-
 .../5f356ed60a5decd94ab66986.md               |   8 +-
 .../5f356ed6199b0cdef1d2be8f.md               |   8 +-
 .../5f356ed63c7807a4f1e6d054.md               |   8 +-
 .../5f356ed63e0fa262326eef05.md               |   8 +-
 .../5f356ed656a336993abd9f7c.md               |   8 +-
 .../5f356ed69db0a491745e2bb6.md               |   8 +-
 .../5f356ed6cf6eab5f15f5cfe6.md               |   8 +-
 .../5f35e5c4321f818cdc4bed30.md               |   8 +-
 .../5f35e5c44359872a137bd98f.md               |   8 +-
 .../5f3c866d0fc037f7311b4ac8.md               |   8 +-
 .../5f3c866d28d7ad0de6470505.md               |   8 +-
 .../5f3c866d5414453fc2d7b480.md               |   8 +-
 .../5f3c866daec9a49519871816.md               |   8 +-
 .../5f3c866dbf362f99b9a0c6d0.md               |   8 +-
 .../5f3c866dd0d0275f01d4d847.md               |   8 +-
 .../5f3c866de7a5b784048f94b1.md               |   8 +-
 .../5f3cade94c6576e7f7b7953f.md               |   8 +-
 .../5f3cade9993019e26313fa8e.md               |   8 +-
 .../5f3cade99dda4e6071a85dfd.md               |   8 +-
 .../5f3cade9fa77275d9f4efe62.md               |   8 +-
 .../5f3ef6e01f288a026d709587.md               |  20 +-
 .../5f3ef6e03d719d5ac4738993.md               |   8 +-
 .../5f3ef6e04559b939080db057.md               |   8 +-
 .../5f3ef6e050279c7a4a7101d3.md               |   8 +-
 .../5f3ef6e05473f91f948724ab.md               |   8 +-
 .../5f3ef6e056bdde6ae6892ba2.md               |   8 +-
 .../5f3ef6e06d34faac0447fc44.md               |   8 +-
 .../5f3ef6e07276f782bb46b93d.md               |  10 +-
 .../5f3ef6e0819d4f23ca7285e6.md               |   8 +-
 .../5f3ef6e087d56ed3ffdc36be.md               |   8 +-
 .../5f3ef6e0a81099d9a697b550.md               |   8 +-
 .../5f3ef6e0b431cc215bb16f55.md               |   8 +-
 .../5f3ef6e0e0c3feaebcf647ad.md               |   8 +-
 .../5f3ef6e0e9629bad967cd71e.md               |   8 +-
 .../5f3ef6e0eaa7da26e3d34d78.md               |   8 +-
 .../5f3ef6e0f8c230bdd2349716.md               |   8 +-
 .../5f3f26fa39591db45e5cd7a0.md               |  10 +-
 .../5f459225127805351a6ad057.md               |  10 +-
 .../5f459a7ceb8b5c446656d88b.md               |  10 +-
 .../5f459cf202c2a3472fae6a9f.md               |  10 +-
 .../5f459fd48bdc98491ca6d1a3.md               |  12 +-
 .../5f45a05977e2fa49d9119437.md               |  10 +-
 .../5f45a276c093334f0f6e9df4.md               |  10 +-
 .../5f45a5a7c49a8251f0bdb527.md               |  12 +-
 .../5f45a66d4a2b0453301e5a26.md               |  10 +-
 .../5f45b0731d39e15d54df4dfc.md               |  10 +-
 .../5f45b25e7ec2405f166b9de1.md               |  10 +-
 .../5f45b3c93c027860d9298dbd.md               |  10 +-
 .../5f45b45d099f3e621fbbb256.md               |  10 +-
 .../5f45b4c81cea7763550e40df.md               |  10 +-
 .../5f45b715301bbf667badc04a.md               |  10 +-
 .../5f46e270702a8456a664f0df.md               |  10 +-
 .../5f46e36e745ead58487aabf2.md               |  10 +-
 .../5f46e7a4750dd05b5a673920.md               |  10 +-
 .../5f46e8284aae155c83015dee.md               |  10 +-
 .../5f46ede1ff8fec5ba656b44c.md               |  10 +-
 .../5f46fc57528aa1c4b5ea7c2e.md               |  10 +-
 .../5f4701b942c824109626c3d8.md               |  10 +-
 .../5f475bb508746c16c9431d42.md               |  10 +-
 .../5f475e1c7f71a61d913836c6.md               |  10 +-
 .../5f47633757ae3469f2d33d2e.md               |   8 +-
 .../5f47fe7e31980053a8d4403b.md               |  16 +-
 .../5f716ad029ee4053c7027a7a.md               |   8 +-
 .../5f716bee5838c354c728a7c5.md               |   8 +-
 .../5f7691dafd882520797cd2f0.md               |   8 +-
 .../5f7692f7c5b3ce22a57788b6.md               |   8 +-
 .../5f769541be494f25449b292f.md               |   8 +-
 .../5f76967fad478126d6552b0d.md               |   8 +-
 .../5f769702e6e33127d14aa120.md               |   8 +-
 .../5f7b87422a560036fd03ccff.md               |   8 +-
 .../5f7b88d37b1f98386f04edc0.md               |   8 +-
 .../616965351e74d4689eb6de30.md               |   7 +-
 .../617bb5624a75e86463b7e638.md               |   2 +-
 .../61439dfc811e12666b04be6f.md               |   2 +-
 .../5dc2385ff86c76b9248c6eb7.md               |  12 +-
 .../5dc23991f86c76b9248c6eb8.md               |  10 +-
 .../5dc23f9bf86c76b9248c6eba.md               |   2 +-
 .../5dc24073f86c76b9248c6ebb.md               |   2 +-
 .../5dc24165f86c76b9248c6ebc.md               |   2 +-
 .../5dc24614f86c76b9248c6ebd.md               |   2 +-
 .../5ddbd81294d8ddc1510a8e56.md               |   2 +-
 .../5dfa22d1b521be39a3de7be0.md               |   4 +-
 .../5dfa2407b521be39a3de7be1.md               |   2 +-
 .../5dfa30b9eacea3f48c6300ad.md               |   2 +-
 .../5dfa3589eacea3f48c6300ae.md               |   2 +-
 .../5dfa371beacea3f48c6300af.md               |   2 +-
 .../5dfa37b9eacea3f48c6300b0.md               |   4 +-
 .../5dfb5ecbeacea3f48c6300b1.md               |   2 +-
 .../5dfb6250eacea3f48c6300b2.md               |   2 +-
 .../5dfb655eeacea3f48c6300b3.md               |   6 +-
 .../5dfb6a35eacea3f48c6300b4.md               |   2 +-
 .../5ef9b03c81a63668521804d0.md               |   2 +-
 .../5ef9b03c81a63668521804d1.md               |   2 +-
 .../5ef9b03c81a63668521804d2.md               |   2 +-
 .../5ef9b03c81a63668521804d3.md               |   2 +-
 .../5ef9b03c81a63668521804d4.md               |   2 +-
 .../5ef9b03c81a63668521804d5.md               |   2 +-
 .../5ef9b03c81a63668521804d6.md               |   2 +-
 .../5ef9b03c81a63668521804d7.md               |   2 +-
 .../5ef9b03c81a63668521804d8.md               |   2 +-
 .../5ef9b03c81a63668521804d9.md               |   2 +-
 .../5ef9b03c81a63668521804da.md               |   2 +-
 .../5ef9b03c81a63668521804db.md               |   2 +-
 .../5ef9b03c81a63668521804dc.md               |   2 +-
 .../5ef9b03c81a63668521804dd.md               |   2 +-
 .../5ef9b03c81a63668521804de.md               |   2 +-
 .../5ef9b03c81a63668521804df.md               |   2 +-
 .../5ef9b03c81a63668521804e1.md               |   2 +-
 .../5ef9b03c81a63668521804e2.md               |   2 +-
 .../5ef9b03c81a63668521804e3.md               |   2 +-
 .../5ef9b03c81a63668521804e5.md               |   2 +-
 .../5ef9b03c81a63668521804e7.md               |   2 +-
 .../5ef9b03c81a63668521804e8.md               |   2 +-
 .../5ef9b03c81a63668521804e9.md               |   2 +-
 .../5ef9b03c81a63668521804ea.md               |   2 +-
 .../5ef9b03c81a63668521804eb.md               |   2 +-
 .../5ef9b03c81a63668521804ec.md               |   2 +-
 .../5ef9b03c81a63668521804ee.md               |   2 +-
 .../5efada803cbd2bbdab94e332.md               |   2 +-
 .../5efae0543cbd2bbdab94e333.md               |   2 +-
 .../5efae16e3cbd2bbdab94e334.md               |   2 +-
 .../5efb23e70dc218d6c85f89b1.md               |   2 +-
 .../5efb2c990dc218d6c85f89b2.md               |   2 +-
 .../5efc4f528d6a74d05e68af74.md               |   2 +-
 .../5efc518e8d6a74d05e68af75.md               |   2 +-
 .../5efc54138d6a74d05e68af76.md               |   2 +-
 .../5efc575c8d6a74d05e68af77.md               |   2 +-
 .../5f05a1d8e233dff4a68508d8.md               |   2 +-
 .../5f07be6ef7412fbad0c5626b.md               |  18 +-
 .../5f07c98cdb9413cbd4b16750.md               |   2 +-
 .../5f07fb1579dc934717801375.md               |  52 ++---
 .../5f0d48e7b435f13ab6550051.md               |   2 +-
 .../5f0d4ab1b435f13ab6550052.md               |   2 +-
 .../5f0d4d04b435f13ab6550053.md               |   2 +-
 .../5f1a80975fc4bcae0edb3497.md               |   2 +-
 .../5f1a89f1190aff21ae42105a.md               |   2 +-
 .../62bb4009e3458a128ff57d5d.md               |   4 +-
 .../62dabe2ef403a12d5d295273.md               |   4 +-
 .../7cf9b03d81a65668421804c3.md               |   2 +-
 .../60f1922fcbd2410527b3bd89.md               |   3 +-
 .../60f803d5241e6a0433a523a1.md               |   1 +
 .../615f50473cc0196c6dd3892a.md               |   2 +-
 .../62a23d1c5f1c93161f3582ae.md               |   6 +-
 .../62a3cfc8328d3351b95d4f61.md               |   2 +-
 .../62a8aa98a8289d0a698eee1d.md               |   2 +-
 .../62a8cbd1e3595431d5a2b3f1.md               |   2 +-
 .../62a8ce73d0dce43468f6689c.md               |   4 +-
 .../62a8cf22272d6d35af80d4ac.md               |   2 +-
 .../62a8d0337d7c67377a4a76c6.md               |   6 +-
 .../62a8d08668fa8b38732486e9.md               |   2 +-
 .../62a8d61ddfe35744369365b7.md               |   6 +-
 .../62a8d6c7001ebc45350e3d16.md               |   4 +-
 .../62a8e35675c18c56354c08cf.md               |   6 +-
 .../62a8e41e2f190c58404dd46e.md               |   4 +-
 .../62a8ed36d7a7915dfa444ba2.md               |   2 +-
 .../62a8edd05e27cc668051686f.md               |   2 +-
 .../62a8eec45f77bc69e8775294.md               |   2 +-
 .../62a8ef8f0c76a46cd221a68c.md               |   2 +-
 .../62a8efb0e3ce826db8daf80f.md               |   2 +-
 .../62a8eff21c0b0f6ebe5b8e38.md               |   2 +-
 .../62aa204c1e1d33348ff09944.md               |   2 +-
 .../62aa20e9cf1be9358f5aceae.md               |   4 +-
 .../62aa226207f33d3ad4c6f546.md               |   8 +-
 .../62aa264d23cdaa45a20efada.md               |   2 +-
 .../62aa27227399d647e1c37a3c.md               |   4 +-
 .../62aa27560def7048d7b4a095.md               |   2 +-
 .../62aa27c40ca6f04ab8be5fac.md               |   2 +-
 .../falsy-bouncer.md                          |  10 +-
 .../access-array-data-with-indexes.md         |  12 +-
 ...s-multi-dimensional-arrays-with-indexes.md |   8 +-
 ...essing-object-properties-with-variables.md |  34 +--
 .../assignment-with-a-returned-value.md       |   2 +-
 .../comment-your-javascript-code.md           |   2 +-
 .../comparison-with-the-equality-operator.md  |  20 +-
 ...mparison-with-the-greater-than-operator.md |  16 +-
 ...h-the-greater-than-or-equal-to-operator.md |  28 ++-
 ...comparison-with-the-inequality-operator.md |  16 +-
 .../comparison-with-the-less-than-operator.md |  28 ++-
 ...with-the-less-than-or-equal-to-operator.md |  30 ++-
 ...rison-with-the-strict-equality-operator.md |  18 +-
 ...son-with-the-strict-inequality-operator.md |  20 +-
 ...oncatenating-strings-with-plus-operator.md |  16 +-
 ...g-strings-with-the-plus-equals-operator.md |  10 +-
 .../constructing-strings-with-variables.md    |   2 +-
 .../basic-javascript/counting-cards.md        |  29 ++-
 .../create-decimal-numbers-with-javascript.md |   2 +-
 ...ad-only-variable-with-the-const-keyword.md |  36 +--
 .../decrement-a-number-with-javascript.md     |  14 +-
 ...-one-decimal-by-another-with-javascript.md |   6 -
 .../escape-sequences-in-strings.md            |  12 +-
 .../escaping-literal-quotes-in-strings.md     |   2 +-
 .../find-the-length-of-a-string.md            |   4 +-
 ...nerate-random-fractions-with-javascript.md |   2 +-
 .../global-scope-and-functions.md             |   2 +-
 .../basic-javascript/golf-code.md             |   2 +-
 ...-variables-with-the-assignment-operator.md |   6 -
 ...terate-with-javascript-do...while-loops.md |   2 +-
 .../local-scope-and-functions.md              |   2 +-
 .../practice-comparing-different-values.md    |   2 +-
 .../quoting-strings-with-single-quotes.md     |   6 -
 .../basic-javascript/record-collection.md     |   8 +-
 .../return-early-pattern-for-functions.md     |   4 +-
 ...returning-boolean-values-from-functions.md |   2 +-
 .../basic-javascript/stand-in-line.md         |   4 +-
 .../understand-string-immutability.md         |   4 +-
 .../understanding-uninitialized-variables.md  |   8 +-
 .../use-recursion-to-create-a-countdown.md    |   9 +-
 ...-recursion-to-create-a-range-of-numbers.md |   7 +
 .../using-objects-for-lookups.md              |   8 +-
 .../basic-javascript/word-blanks.md           |  18 +-
 .../mutate-an-array-declared-with-const.md    |   2 +-
 ...syntax-to-define-a-constructor-function.md |  31 ++-
 ...-concise-declarative-functions-with-es6.md |   3 +-
 ...f-an-array-using-concat-instead-of-push.md |  10 +-
 ...tand-functional-programming-terminology.md |   2 +-
 .../make-a-person.md                          |   8 -
 .../map-the-debris.md                         |  23 +-
 .../steamroller.md                            |   7 +
 .../sum-all-primes.md                         |  56 +++--
 .../add-methods-after-inheritance.md          |  48 +++-
 .../build-a-25-5-clock.md                     |   2 +-
 .../build-a-drum-machine.md                   |  18 +-
 .../build-a-javascript-calculator.md          |   2 +-
 .../build-a-markdown-previewer.md             |   2 +-
 .../build-a-random-quote-machine.md           |   2 +-
 .../moving-forward-from-here.md               |   2 +-
 .../react/create-a-stateful-component.md      |  16 +-
 .../react/introducing-inline-styles.md        |   2 +-
 .../react/render-conditionally-from-props.md  |  12 +-
 .../react/set-state-with-this.setstate.md     |   2 +-
 ...rray.map-to-dynamically-render-elements.md |   2 +-
 ...roptypes-to-define-the-props-you-expect.md |   2 +-
 ...the-lifecycle-method-componentwillmount.md |   2 +-
 .../redux/create-a-redux-store.md             |   2 +-
 .../visualize-data-with-a-bar-chart.md        |   2 +-
 .../visualize-data-with-a-choropleth-map.md   |   2 +-
 .../visualize-data-with-a-heat-map.md         |   2 +-
 ...visualize-data-with-a-scatterplot-graph.md |   2 +-
 .../visualize-data-with-a-treemap-diagram.md  |   2 +-
 .../exercise-tracker.md                       |  40 ++--
 .../timestamp-microservice.md                 |   8 +-
 ...hain-middleware-to-create-a-time-server.md |   4 +-
 .../use-body-parser-to-parse-post-requests.md |   4 +-
 .../use-the-.env-file.md                      |   4 +-
 ...project-with-external-packages-from-npm.md |  18 +-
 ...es-by-understanding-semantic-versioning.md |  16 +-
 ...remove-a-package-from-your-dependencies.md |  10 +-
 ...he-latest-minor-version-of-a-dependency.md |  18 +-
 ...he-latest-patch-version-of-a-dependency.md |  18 +-
 .../mongodb-and-mongoose/create-a-model.md    |   6 +-
 .../install-and-set-up-mongoose.md            |  36 ++-
 ...-updates-by-running-find-edit-then-save.md |   2 +-
 .../announce-new-users.md                     |   2 +-
 .../authentication-strategies.md              |   6 +-
 .../authentication-with-socket.io.md          |   4 +-
 .../clean-up-your-project-with-modules.md     |   2 +-
 .../communicate-by-emitting.md                |   2 +-
 .../create-new-middleware.md                  |   2 +-
 .../handle-a-disconnect.md                    |   2 +-
 .../hashing-your-passwords.md                 |   4 +-
 .../how-to-put-a-profile-together.md          |   2 +-
 .../how-to-use-passport-strategies.md         |   2 +-
 ...nt-the-serialization-of-a-passport-user.md |   4 +-
 ...lementation-of-social-authentication-ii.md |  18 +-
 ...ementation-of-social-authentication-iii.md |   2 +-
 ...implementation-of-social-authentication.md |   4 +-
 .../logging-a-user-out.md                     |   4 +-
 .../registration-of-new-users.md              |   2 +-
 .../send-and-display-chat-messages.md         |   2 +-
 .../serialization-of-a-user-object.md         |   4 +-
 .../set-up-a-template-engine.md               |  14 +-
 .../set-up-passport.md                        |  22 +-
 .../set-up-the-environment.md                 |   6 +-
 .../use-a-template-engines-powers.md          |  36 ++-
 ...ality-with-.deepequal-and-.notdeepequal.md |   2 +-
 .../compare-the-properties-of-two-elements.md |  14 +-
 ...ional-tests-using-a-headless-browser-ii.md |   4 +-
 .../use-assert.isok-and-assert.isnotok.md     |   4 +-
 .../sudoku-solver.md                          |  30 +--
 .../build-your-own-functions.md               |   2 +-
 .../comparing-and-sorting-tuples.md           |   2 +-
 .../files-as-a-sequence.md                    |   2 +-
 .../intermediate-expressions.md               |   4 +-
 .../introduction-why-program.md               |   4 +-
 .../iterations-more-patterns.md               |   2 +-
 .../more-conditional-structures.md            |   4 +-
 .../networking-web-scraping-with-python.md    |   6 +-
 .../relational-databases-and-sqlite.md        |   8 +-
 ...al-databases-many-to-many-relationships.md |  10 +-
 .../python-for-everybody/strings-and-lists.md |   2 +-
 .../arithmetic-formatter.md                   |  49 ++--
 .../budget-app.md                             |  48 ++--
 .../polygon-area-calculator.md                |  42 ++--
 .../probability-calculator.md                 |  48 ++--
 .../time-calculator.md                        |  34 ++-
 .../introduction-to-data-analysis.md          |  15 +-
 .../demographic-data-analyzer.md              |  17 +-
 ...-variance-standard-deviation-calculator.md |  23 +-
 .../medical-data-visualizer.md                |  43 ++--
 .../page-view-time-series-visualizer.md       |  23 +-
 .../sea-level-predictor.md                    |  22 +-
 .../port-scanner.md                           |  28 +--
 .../secure-real-time-multiplayer-game.md      |  57 +++--
 .../sha-1-password-cracker.md                 |  32 +--
 .../stock-price-checker.md                    |   8 +-
 ...sh-and-compare-passwords-asynchronously.md |  16 +-
 .../install-and-require-helmet.md             |   6 +-
 .../understand-bcrypt-hashes.md               |   8 +-
 .../find-the-symmetric-difference.md          |   6 +-
 .../algorithms/implement-binary-search.md     |   2 +-
 ...d-a-new-element-to-a-binary-search-tree.md |   2 +-
 .../check-if-binary-search-tree.md            |  20 +-
 .../create-a-doubly-linked-list.md            |  10 +-
 .../data-structures/create-a-hash-table.md    |  14 +-
 .../create-a-map-data-structure.md            |  14 +-
 .../create-a-trie-search-tree.md              |  12 +-
 .../create-an-es6-javascript-map.md           |  14 +-
 .../data-structures/depth-first-search.md     |  31 ++-
 .../implement-heap-sort-with-a-min-heap.md    |  10 +-
 .../data-structures/incidence-matrix.md       |   2 +-
 .../insert-an-element-into-a-max-heap.md      |   8 +-
 ...form-a-subset-check-on-two-sets-of-data.md |  10 +-
 .../perform-a-union-on-two-sets.md            |   2 +-
 .../remove-an-element-from-a-max-heap.md      |  10 +-
 ...ve-elements-from-a-linked-list-by-index.md |   2 +-
 .../reverse-a-doubly-linked-list.md           |  10 +-
 .../search-within-a-linked-list.md            |   2 +-
 .../problem-10-summation-of-primes.md         |  54 +++--
 .../problem-107-minimal-network.md            |   4 +-
 .../problem-124-ordered-radicals.md           |  12 +-
 .../problem-128-hexagonal-tile-differences.md |  64 +++++-
 .../problem-168-number-rotations.md           |  52 ++++-
 .../problem-199-iterative-circle-packing.md   |  18 +-
 .../problem-2-even-fibonacci-numbers.md       |   4 +-
 .../project-euler/problem-250-250250.md       |   4 +-
 .../problem-257-angular-bisectors.md          |   4 +-
 ...h-the-area--perimeter-ratio-is-integral.md |  14 +-
 .../problem-29-distinct-powers.md             |  16 +-
 ...itwise-or-operations-on-random-integers.md |  14 +-
 .../problem-326-modulo-summations.md          |   4 +-
 .../project-euler/problem-331-cross-flips.md  |  22 +-
 .../problem-344-silver-dollar-game.md         |   4 +-
 ...-356-largest-roots-of-cubic-polynomials.md |   4 +-
 .../problem-371-licence-plates.md             |   4 +-
 .../problem-414-kaprekar-constant.md          |   4 +-
 .../problem-421-prime-factors-of-n151.md      |   4 +-
 ...-429-sum-of-squares-of-unitary-divisors.md |   6 +-
 ...-part-of-polynomial-equations-solutions.md |   4 +-
 ...blem-450-hypocycloid-and-lattice-points.md |   7 +-
 .../problem-473-phigital-number-base.md       |   4 +-
 .../problem-64-odd-period-square-roots.md     |   4 +-
 .../rosetta-code/24-game.md                   | 141 ++++++++----
 .../9-billion-names-of-god-the-integer.md     |   4 +-
 .../rosetta-code/accumulator-factory.md       |   4 +-
 .../rosetta-code/amicable-pairs.md            |  20 +-
 .../rosetta-code/averages-mode.md             |   4 +-
 .../averages-pythagorean-means.md             |   4 +-
 .../rosetta-code/averages-root-mean-square.md |  10 +-
 .../rosetta-code/babbage-problem.md           |   4 +-
 ...cles-of-given-radius-through-two-points.md |  10 +-
 .../rosetta-code/comma-quibbling.md           |  14 +-
 .../rosetta-code/compare-a-list-of-strings.md |  30 ++-
 .../rosetta-code/count-the-coins.md           |   4 +-
 .../rosetta-code/cramers-rule.md              |  22 +-
 .../cumulative-standard-deviation.md          |  41 +++-
 .../rosetta-code/deal-cards-for-freecell.md   |  18 +-
 .../rosetta-code/discordian-date.md           |  35 ++-
 .../rosetta-code/dot-product.md               |   4 +-
 .../rosetta-code/euler-method.md              |   4 +-
 .../execute-a-markov-algorithm.md             | 214 ++++++-----------
 .../rosetta-code/execute-brain.md             |   4 +-
 .../rosetta-code/factorial.md                 |   4 +-
 .../factors-of-a-mersenne-number.md           |   6 +-
 .../rosetta-code/farey-sequence.md            |   4 +-
 .../fibonacci-n-step-number-sequences.md      |   8 +-
 .../rosetta-code/fibonacci-word.md            | 116 +++++-----
 .../rosetta-code/fractran.md                  |   4 +-
 .../rosetta-code/gamma-function.md            |   4 +-
 .../rosetta-code/general-fizzbuzz.md          |   4 +-
 .../rosetta-code/gray-code.md                 |   6 +-
 .../rosetta-code/happy-numbers.md             |   4 +-
 .../rosetta-code/hash-from-two-arrays.md      |  16 +-
 .../rosetta-code/hash-join.md                 |   6 +-
 .../rosetta-code/heronian-triangles.md        |   4 +-
 .../hofstadter-figure-figure-sequences.md     |  48 ++--
 .../rosetta-code/hofstadter-q-sequence.md     |   6 +-
 .../rosetta-code/i-before-e-except-after-c.md |   4 +-
 .../rosetta-code/iban.md                      |  14 +-
 .../rosetta-code/jortsort.md                  |   4 +-
 .../rosetta-code/josephus-problem.md          |   6 +-
 .../rosetta-code/kaprekar-numbers.md          |   6 +-
 .../rosetta-code/knights-tour.md              |  16 +-
 .../rosetta-code/least-common-multiple.md     |  10 +-
 .../rosetta-code/levenshtein-distance.md      |   4 +-
 .../linear-congruential-generator.md          |   6 +-
 .../rosetta-code/long-multiplication.md       |   4 +-
 .../longest-common-subsequence.md             |  40 ++--
 .../longest-increasing-subsequence.md         |  26 +--
 .../rosetta-code/longest-string-challenge.md  |   4 +-
 .../rosetta-code/look-and-say-sequence.md     |   4 +-
 .../rosetta-code/lu-decomposition.md          |   6 +-
 .../rosetta-code/ludic-numbers.md             |   4 +-
 .../luhn-test-of-credit-card-numbers.md       |   4 +-
 .../rosetta-code/lzw-compression.md           |   8 +-
 .../rosetta-code/s-expressions.md             |   6 +-
 .../sailors-coconuts-and-a-monkey-problem.md  |  19 +-
 .../rosetta-code/sedols.md                    |  23 +-
 .../rosetta-code/self-describing-numbers.md   |   4 +-
 .../rosetta-code/self-referential-sequence.md |   4 +-
 .../rosetta-code/semiprime.md                 |   4 +-
 .../rosetta-code/sha-1.md                     |   4 +-
 .../rosetta-code/sort-stability.md            |   4 +-
 .../sorting-algorithms-bead-sort.md           |  38 +--
 .../sorting-algorithms-bogosort.md            |   4 +-
 .../sorting-algorithms-cocktail-sort.md       |  26 +--
 .../sorting-algorithms-comb-sort.md           |  22 +-
 .../sorting-algorithms-gnome-sort.md          |   4 +-
 .../sorting-algorithms-pancake-sort.md        |   4 +-
 .../sorting-algorithms-shell-sort.md          |   4 +-
 .../sorting-algorithms-stooge-sort.md         |   4 +-
 .../sorting-algorithms-strand-sort.md         |  30 ++-
 .../rosetta-code/soundex.md                   |  18 +-
 .../rosetta-code/state-name-puzzle.md         |  15 +-
 .../rosetta-code/stern-brocot-sequence.md     |   4 +-
 .../rosetta-code/straddling-checkerboard.md   |  26 ++-
 .../rosetta-code/subleq.md                    |   4 +-
 .../rosetta-code/sudoku.md                    |   4 +-
 .../rosetta-code/sum-of-a-series.md           |   4 +-
 .../sutherland-hodgman-polygon-clipping.md    |   4 +-
 .../rosetta-code/symmetric-difference.md      |  24 +-
 .../rosetta-code/taxicab-numbers.md           |  21 +-
 .../rosetta-code/towers-of-hanoi.md           |  18 +-
 .../rosetta-code/y-combinator.md              |  12 +-
 .../rosetta-code/zig-zag-matrix.md            |   4 +-
 .../build-a-camper-leaderboard.md             |   6 +-
 .../build-a-light-bright-app.md               |   6 +-
 .../build-a-nightlife-coordination-app.md     |   4 +-
 .../build-a-pinterest-clone.md                |   8 +-
 .../take-home-projects/build-a-pong-game.md   |   6 +-
 .../take-home-projects/build-a-recipe-box.md  |   6 +-
 .../build-a-roguelike-dungeon-crawler-game.md |   6 +-
 .../take-home-projects/build-a-simon-game.md  |   6 +-
 .../build-a-tic-tac-toe-game.md               |   6 +-
 .../build-a-wikipedia-viewer.md               |  18 +-
 ...build-an-image-search-abstraction-layer.md |   2 +-
 .../build-the-game-of-life.md                 |  31 ++-
 .../manage-a-book-trading-club.md             |  10 +-
 .../map-data-across-the-globe.md              |   6 +-
 .../p2p-video-chat-application.md             |   6 +-
 ...-contiguity-with-a-force-directed-graph.md |   6 +-
 .../show-the-local-weather.md                 |   8 +-
 .../use-the-twitch-json-api.md                |  16 +-
 .../book-recommendation-engine-using-knn.md   |  43 +++-
 .../cat-and-dog-image-classifier.md           |  92 +++++++-
 ...near-regression-health-costs-calculator.md |  26 ++-
 .../neural-network-sms-text-classifier.md     |  16 +-
 .../rock-paper-scissors.md                    |  48 +++-
 .../neural-networks-activation-functions.md   |   2 +-
 .../6148da157cc0bd0d06df5c0a.md               |  14 +-
 .../6148dc095264000dce348bf5.md               |   2 +-
 .../6148dcaaf2e8750e6cb4501a.md               |   2 +-
 .../6148dd31d210990f0fb140f8.md               |   2 +-
 .../6148defa9c01520fb9d178a0.md               |   2 +-
 .../6148dfab9b54c110577de165.md               |   2 +-
 .../6148e0bcc13efd10f7d7a6a9.md               |   2 +-
 .../6148e161ecec9511941f8833.md               |   2 +-
 .../6148e28706b34912340fd042.md               |   2 +-
 .../6148e335c1edd512d00e4691.md               |   2 +-
 .../6148e41c728f65138addf9cc.md               |   2 +-
 .../6148e5aeb102e3142de026a2.md               |   4 +-
 .../5f33294a6af5e9188dbdb8f3.md               |  23 +-
 .../5f332a88dc25a0fd25c7687a.md               |  25 +-
 .../5f332b23c2045fb843337579.md               |  31 +--
 .../5f344f9c805cd193c33d829c.md               |   8 +-
 .../5f344fad8bf01691e71a30eb.md               |   8 +-
 .../5f344fbc22624a2976425065.md               |   8 +-
 .../5f344fc1520b6719f2e35605.md               |  15 +-
 .../5f3477ae34c1239cafe128be.md               |   8 +-
 .../5f3477ae8466a9a3d2cc953c.md               |   8 +-
 .../5f3477ae9675db8bb7655b30.md               |  17 +-
 .../5f3477aefa51bfc29327200b.md               |   8 +-
 .../5f3477cb2e27333b1ab2b955.md               |   8 +-
 .../5f3477cb303c5cb61b43aa9b.md               |   8 +-
 .../5f3477cbcb6ba47918c1da92.md               |   8 +-
 .../5f34a1fd611d003edeafd681.md               |   8 +-
 .../5f356ed60785e1f3e9850b6e.md               |   8 +-
 .../5f356ed60a5decd94ab66986.md               |   8 +-
 .../5f356ed6199b0cdef1d2be8f.md               |   8 +-
 .../5f356ed63c7807a4f1e6d054.md               |   8 +-
 .../5f356ed63e0fa262326eef05.md               |   8 +-
 .../5f356ed656a336993abd9f7c.md               |   8 +-
 .../5f356ed69db0a491745e2bb6.md               |   8 +-
 .../5f356ed6cf6eab5f15f5cfe6.md               |   8 +-
 .../5f35e5c4321f818cdc4bed30.md               |   8 +-
 .../5f35e5c44359872a137bd98f.md               |   8 +-
 .../5f3c866d0fc037f7311b4ac8.md               |   8 +-
 .../5f3c866d28d7ad0de6470505.md               |   8 +-
 .../5f3c866d5414453fc2d7b480.md               |   8 +-
 .../5f3c866daec9a49519871816.md               |   8 +-
 .../5f3c866dbf362f99b9a0c6d0.md               |   8 +-
 .../5f3c866dd0d0275f01d4d847.md               |   8 +-
 .../5f3c866de7a5b784048f94b1.md               |   8 +-
 .../5f3cade94c6576e7f7b7953f.md               |   8 +-
 .../5f3cade9993019e26313fa8e.md               |   8 +-
 .../5f3cade99dda4e6071a85dfd.md               |   8 +-
 .../5f3cade9fa77275d9f4efe62.md               |   8 +-
 .../5f3ef6e01f288a026d709587.md               |  20 +-
 .../5f3ef6e03d719d5ac4738993.md               |   8 +-
 .../5f3ef6e04559b939080db057.md               |   8 +-
 .../5f3ef6e050279c7a4a7101d3.md               |   8 +-
 .../5f3ef6e05473f91f948724ab.md               |   8 +-
 .../5f3ef6e056bdde6ae6892ba2.md               |   8 +-
 .../5f3ef6e06d34faac0447fc44.md               |   8 +-
 .../5f3ef6e07276f782bb46b93d.md               |  10 +-
 .../5f3ef6e0819d4f23ca7285e6.md               |   8 +-
 .../5f3ef6e087d56ed3ffdc36be.md               |   8 +-
 .../5f3ef6e0a81099d9a697b550.md               |   8 +-
 .../5f3ef6e0b431cc215bb16f55.md               |   8 +-
 .../5f3ef6e0e0c3feaebcf647ad.md               |   8 +-
 .../5f3ef6e0e9629bad967cd71e.md               |   8 +-
 .../5f3ef6e0eaa7da26e3d34d78.md               |   8 +-
 .../5f3ef6e0f8c230bdd2349716.md               |   8 +-
 .../5f3f26fa39591db45e5cd7a0.md               |  10 +-
 .../5f459225127805351a6ad057.md               |  10 +-
 .../5f459a7ceb8b5c446656d88b.md               |  10 +-
 .../5f459cf202c2a3472fae6a9f.md               |  10 +-
 .../5f459fd48bdc98491ca6d1a3.md               |  12 +-
 .../5f45a05977e2fa49d9119437.md               |  10 +-
 .../5f45a276c093334f0f6e9df4.md               |  10 +-
 .../5f45a5a7c49a8251f0bdb527.md               |  10 +-
 .../5f45a66d4a2b0453301e5a26.md               |  10 +-
 .../5f45b0731d39e15d54df4dfc.md               |  10 +-
 .../5f45b25e7ec2405f166b9de1.md               |  10 +-
 .../5f45b3c93c027860d9298dbd.md               |  10 +-
 .../5f45b45d099f3e621fbbb256.md               |  10 +-
 .../5f45b4c81cea7763550e40df.md               |  10 +-
 .../5f45b715301bbf667badc04a.md               |  10 +-
 .../5f46e270702a8456a664f0df.md               |  10 +-
 .../5f46e36e745ead58487aabf2.md               |  10 +-
 .../5f46e7a4750dd05b5a673920.md               |  10 +-
 .../5f46e8284aae155c83015dee.md               |  10 +-
 .../5f46ede1ff8fec5ba656b44c.md               |  10 +-
 .../5f46fc57528aa1c4b5ea7c2e.md               |  10 +-
 .../5f4701b942c824109626c3d8.md               |  10 +-
 .../5f475bb508746c16c9431d42.md               |  10 +-
 .../5f475e1c7f71a61d913836c6.md               |  10 +-
 .../5f47633757ae3469f2d33d2e.md               |   8 +-
 .../5f47fe7e31980053a8d4403b.md               |  16 +-
 .../5f716ad029ee4053c7027a7a.md               |   8 +-
 .../5f716bee5838c354c728a7c5.md               |   8 +-
 .../5f7691dafd882520797cd2f0.md               |   8 +-
 .../5f7692f7c5b3ce22a57788b6.md               |   8 +-
 .../5f769541be494f25449b292f.md               |   8 +-
 .../5f76967fad478126d6552b0d.md               |   8 +-
 .../5f769702e6e33127d14aa120.md               |   8 +-
 .../5f7b87422a560036fd03ccff.md               |   8 +-
 .../5f7b88d37b1f98386f04edc0.md               |   8 +-
 .../616965351e74d4689eb6de30.md               |   7 +-
 .../5dc2385ff86c76b9248c6eb7.md               |  12 +-
 .../5dc23991f86c76b9248c6eb8.md               |  10 +-
 .../5dc23f9bf86c76b9248c6eba.md               |   2 +-
 .../5dc24073f86c76b9248c6ebb.md               |   2 +-
 .../5dc24165f86c76b9248c6ebc.md               |   2 +-
 .../5dc24614f86c76b9248c6ebd.md               |   2 +-
 .../5ddbd81294d8ddc1510a8e56.md               |   2 +-
 .../5dfa22d1b521be39a3de7be0.md               |   4 +-
 .../5dfa2407b521be39a3de7be1.md               |   2 +-
 .../5dfa30b9eacea3f48c6300ad.md               |   2 +-
 .../5dfa3589eacea3f48c6300ae.md               |   2 +-
 .../5dfa371beacea3f48c6300af.md               |   2 +-
 .../5dfa37b9eacea3f48c6300b0.md               |   4 +-
 .../5dfb5ecbeacea3f48c6300b1.md               |   2 +-
 .../5dfb6250eacea3f48c6300b2.md               |   2 +-
 .../5dfb655eeacea3f48c6300b3.md               |   6 +-
 .../5dfb6a35eacea3f48c6300b4.md               |   2 +-
 .../5ef9b03c81a63668521804d0.md               |   2 +-
 .../5ef9b03c81a63668521804d1.md               |   2 +-
 .../5ef9b03c81a63668521804d2.md               |   2 +-
 .../5ef9b03c81a63668521804d3.md               |   2 +-
 .../5ef9b03c81a63668521804d4.md               |   2 +-
 .../5ef9b03c81a63668521804d5.md               |   2 +-
 .../5ef9b03c81a63668521804d6.md               |   2 +-
 .../5ef9b03c81a63668521804d7.md               |   2 +-
 .../5ef9b03c81a63668521804d8.md               |   2 +-
 .../5ef9b03c81a63668521804d9.md               |   2 +-
 .../5ef9b03c81a63668521804da.md               |   2 +-
 .../5ef9b03c81a63668521804db.md               |   2 +-
 .../5ef9b03c81a63668521804dc.md               |   2 +-
 .../5ef9b03c81a63668521804dd.md               |   2 +-
 .../5ef9b03c81a63668521804de.md               |   2 +-
 .../5ef9b03c81a63668521804df.md               |   2 +-
 .../5ef9b03c81a63668521804e1.md               |   2 +-
 .../5ef9b03c81a63668521804e2.md               |   2 +-
 .../5ef9b03c81a63668521804e3.md               |   2 +-
 .../5ef9b03c81a63668521804e5.md               |   2 +-
 .../5ef9b03c81a63668521804e7.md               |   2 +-
 .../5ef9b03c81a63668521804e8.md               |   2 +-
 .../5ef9b03c81a63668521804e9.md               |   2 +-
 .../5ef9b03c81a63668521804ea.md               |   2 +-
 .../5ef9b03c81a63668521804eb.md               |   2 +-
 .../5ef9b03c81a63668521804ec.md               |   2 +-
 .../5ef9b03c81a63668521804ee.md               |   2 +-
 .../5efada803cbd2bbdab94e332.md               |   2 +-
 .../5efae0543cbd2bbdab94e333.md               |   2 +-
 .../5efae16e3cbd2bbdab94e334.md               |   2 +-
 .../5efb23e70dc218d6c85f89b1.md               |   2 +-
 .../5efb2c990dc218d6c85f89b2.md               |   2 +-
 .../5efc4f528d6a74d05e68af74.md               |   2 +-
 .../5efc518e8d6a74d05e68af75.md               |   2 +-
 .../5efc54138d6a74d05e68af76.md               |   2 +-
 .../5efc575c8d6a74d05e68af77.md               |   2 +-
 .../5f05a1d8e233dff4a68508d8.md               |   2 +-
 .../5f07be6ef7412fbad0c5626b.md               |  18 +-
 .../5f07c98cdb9413cbd4b16750.md               |   2 +-
 .../5f07fb1579dc934717801375.md               |  52 ++---
 .../5f0d48e7b435f13ab6550051.md               |   2 +-
 .../5f0d4ab1b435f13ab6550052.md               |   2 +-
 .../5f0d4d04b435f13ab6550053.md               |   2 +-
 .../5f1a80975fc4bcae0edb3497.md               |   2 +-
 .../5f1a89f1190aff21ae42105a.md               |   2 +-
 .../62bb4009e3458a128ff57d5d.md               |   4 +-
 .../62dabe2ef403a12d5d295273.md               |   2 +-
 .../7cf9b03d81a65668421804c3.md               |   2 +-
 .../60f1922fcbd2410527b3bd89.md               |   7 +-
 .../60f803d5241e6a0433a523a1.md               |   1 +
 .../62a3c2fccf186146b59c6e96.md               |  12 +-
 .../62a3c4a0e52767482c5202d4.md               |  16 +-
 .../62a3c668afc43b4a134cca81.md               |  14 +-
 .../62a3cfc8328d3351b95d4f61.md               |  18 +-
 .../62a7beb1ad61211ac153707f.md               |  20 +-
 .../62a7bf06d2ad9d1c5024e833.md               |  28 +--
 .../62a7bfabe119461eb13ccbd6.md               |  12 +-
 .../62a7c23e6b511f22ed71197a.md               |   8 +-
 .../62a7cc99577fbf25ee7a7d76.md               |  12 +-
 .../62a8a929e4260d08093756d2.md               |  10 +-
 .../62a8a9d876b2580943ba9351.md               |  10 +-
 .../62a8aa98a8289d0a698eee1d.md               |  14 +-
 .../62a8ab0e27cbaf0b54ba8a42.md               |  16 +-
 .../62a8ac194679e60cb561b0a8.md               |  14 +-
 .../62a8ad8e01d7cb0deae5ec66.md               |  16 +-
 .../62a8ade9b2f5b30ef0b606c2.md               |  10 +-
 .../62a8ae85fcaedc0fddc7ca4f.md               |  24 +-
 .../62a8b0b5053f16111b0b6b5f.md               |  22 +-
 .../62a8b1762b7775124622e1a3.md               |   8 +-
 .../62a8b3cc436db8139cc5fc09.md               |   6 +-
 .../62a8b6536156c51500739b41.md               |  14 +-
 .../62a8b711ab7a12161c7d9b67.md               |   8 +-
 .../62a8b9770050d217d2247801.md               |   8 +-
 .../62a8c0c8313e891a15ec23e7.md               |  12 +-
 .../62a8c1154d3ae11aee80353f.md               |  16 +-
 .../62a8c151b23bf21bc7c4fcba.md               |   8 +-
 .../62a8c173949f851c83c64756.md               |  10 +-
 .../62a8c242b25a531f2909e5bc.md               |  12 +-
 .../62a8c2bbbd8aa82052f47c53.md               |  24 +-
 .../62a8c31ec0ec78216a1c36a0.md               |  14 +-
 .../62a8c370ad8c68227137e0bc.md               |  10 +-
 .../62a8c3ebc6c35e23785e1a19.md               |   8 +-
 .../62a8c41ecaf1bd24536129b8.md               |   2 +-
 .../62a8c465fa7b0c252f4a8f0c.md               |   8 +-
 .../62a8c4db0710f3260f867a92.md               |   8 +-
 .../62a8c56247609626fa4a8d6e.md               |   2 +-
 .../62a8c5db7888af27af23f0dd.md               |   8 +-
 .../62a8c65b75664c28a8e59c16.md               |   2 +-
 .../62a8c6815f5f1a29735efe1b.md               |   6 +-
 .../62a8c7322e42962ad53ad204.md               |   6 +-
 .../62a8c7a59e72c02bb1c717d2.md               |   4 +-
 .../62a8c89e4272512d44fc1c66.md               |   4 +-
 .../62a8c8cee8e5cf2e001789b4.md               |   4 +-
 .../62a8ca22d29fe62f3952bdf5.md               |   2 +-
 .../62a8cb19bd7f8a304e5427a1.md               |   6 +-
 .../62a8cbd1e3595431d5a2b3f1.md               |   6 +-
 .../62a8cce1b0c32c33017cf2e9.md               |   4 +-
 .../62a8ce1dfc990134162b3bd9.md               |   4 +-
 .../62a8ce73d0dce43468f6689c.md               |   6 +-
 .../62a8cf22272d6d35af80d4ac.md               |   6 +-
 .../62a8d0337d7c67377a4a76c6.md               |   8 +-
 .../62a8d08668fa8b38732486e9.md               |   8 +-
 .../62a8d0c4f12c2239b6618582.md               |  12 +-
 .../62a8d0fdf2dad83a92883a80.md               |   6 +-
 .../62a8d143f2a58e3b6d6e9c33.md               |   4 +-
 .../62a8d1c72e8bb13c2074d93c.md               |   2 +-
 .../62a8d2146a3e853d0a6e28ca.md               |   8 +-
 .../62a8d24c97461b3ddb9397c8.md               |  10 +-
 .../62a8d2e2a073be3edb46116f.md               |   6 +-
 .../62a8d31ebbc10e3fe1b28e03.md               |   4 +-
 .../62a8d35660db4040ba292193.md               |   4 +-
 .../62a8d382cd075f4169223e14.md               |   6 +-
 .../62a8d539dc11cb42b5dd7ec8.md               |   2 +-
 .../62a8d61ddfe35744369365b7.md               |  10 +-
 .../62a8d6c7001ebc45350e3d16.md               |   6 +-
 .../62a8d7b8ab568b4649998954.md               |   6 +-
 .../62a8d81f539f004776dd9b1e.md               |  24 +-
 .../62a8dd468debb449b4454086.md               |   6 +-
 .../62a8dd9cdb16324b04cfd958.md               |   8 +-
 .../62a8dfcf7fb1044d2f478fd1.md               |   2 +-
 .../62a8e0d1d0110b4ec421489f.md               |  10 +-
 .../62a8e142f7f0bd4fed898de3.md               |   8 +-
 .../62a8e1dc897df55108bcb5e8.md               |   2 +-
 .../62a8e21398ad61520edb724f.md               |   2 +-
 .../62a8e24c673b075317cc0b09.md               |   4 +-
 .../62a8e271f8e3d1541f9624ad.md               |   2 +-
 .../62a8e35675c18c56354c08cf.md               |   8 +-
 .../62a8e41e2f190c58404dd46e.md               |   6 +-
 .../62a8e45cc600c3591cee671a.md               |   2 +-
 .../62a8e49f4df7af5ae2d7a616.md               |   4 +-
 .../62a8e4dc6a60f85bf256a0cb.md               |   2 +-
 .../62a8ed36d7a7915dfa444ba2.md               |   2 +-
 .../62a8edd05e27cc668051686f.md               |   8 +-
 .../62a8ee154c8946678775c4a4.md               |   6 +-
 .../62a8ee71f018e968a056d369.md               |  10 +-
 .../62a8eec45f77bc69e8775294.md               |   4 +-
 .../62a8eefe2e68b66ac563816b.md               |   2 +-
 .../62a8ef6a52292f6bdca4f6f8.md               |   2 +-
 .../62a8ef8f0c76a46cd221a68c.md               |   8 +-
 .../62a8efb0e3ce826db8daf80f.md               |   6 +-
 .../62a8eff21c0b0f6ebe5b8e38.md               |   8 +-
 .../62a8f06fb318666fef69f91e.md               |   2 +-
 .../62a8f14fe6d1fc72454648c7.md               |   4 +-
 .../62a8f1d5f5ddbf74c07f733b.md               |   4 +-
 .../62a8f20463b324759953edad.md               |  22 +-
 .../62a8f256b813a476cae51f49.md               |   8 +-
 .../62a8f2bc37675e77d5835235.md               |   2 +-
 .../62a8f35bde1750791f58773f.md               |   4 +-
 .../62a94114ce0b8918b487390f.md               |   4 +-
 .../62aa1d6736ba262cfa74344b.md               |   4 +-
 .../62aa1d9f535e102e4663e7a6.md               |   6 +-
 .../62aa1e3c7c3d552fb04f0f18.md               |   2 +-
 .../62aa1e8ccd579330e097ce44.md               |   2 +-
 .../62aa1eec891ed731db227a36.md               |   2 +-
 .../62aa1fed3d4e873366ff3131.md               |   2 +-
 .../62aa204c1e1d33348ff09944.md               |   4 +-
 .../62aa20e9cf1be9358f5aceae.md               |   6 +-
 .../62aa2136fc49b836dfedb959.md               |   4 +-
 .../62aa21971e3b743844849985.md               |   2 +-
 .../62aa21ea8d9d9f396b95dd87.md               |   8 +-
 .../62aa226207f33d3ad4c6f546.md               |  14 +-
 .../62aa22aba186563bcbf2c395.md               |   2 +-
 .../62aa234322d4ad3e8bce42cc.md               |   4 +-
 .../62aa2469c77b363fdb4f0e06.md               |  12 +-
 .../62aa252c3b1073415ba2b898.md               |   8 +-
 .../62aa25fcb5837d43b4d9873d.md               |  16 +-
 .../62aa2626c3c10244b94c787b.md               |   6 +-
 .../62aa264d23cdaa45a20efada.md               |   4 +-
 .../62aa26cca3cd3d46c431e73b.md               |   2 +-
 .../62aa27227399d647e1c37a3c.md               |   6 +-
 .../62aa27560def7048d7b4a095.md               |   4 +-
 .../62aa27c40ca6f04ab8be5fac.md               |   4 +-
 .../62aa28032d863d4bd8058799.md               |   2 +-
 .../62aa287434dc284cea01157c.md               |   2 +-
 .../62aa28bbd6323e4dfb3ac43e.md               |   2 +-
 .../62aa28fb651bf14efa2dbb16.md               |   4 +-
 .../62aa2943669c9d5026af6985.md               |   4 +-
 .../62aa2999ec27ec516655eba6.md               |   2 +-
 .../62aa29d8f8f88152c91350ca.md               |   2 +-
 .../62aa2aec2f09d454253aad6c.md               |   6 +-
 .../62aa2ba9cd881355a6f0a5a8.md               |   6 +-
 .../62b46e3a8d4be31be5af793d.md               |   2 +-
 .../62fc1ee0c5a89717d4785729.md               |  14 +-
 .../62fc20387ef88d1d1998aac5.md               |  12 +-
 .../62fc211760bfc220f4734800.md               |   8 +-
 .../chinese-traditional/comments.json         |   3 +-
 curriculum/dictionaries/chinese/comments.json |   3 +-
 curriculum/dictionaries/german/comments.json  | 111 +++++++++
 6193 files changed, 34024 insertions(+), 29301 deletions(-)
 create mode 100644 curriculum/dictionaries/german/comments.json

diff --git a/curriculum/challenges/chinese-traditional/01-responsive-web-design/responsive-web-design-projects/build-a-survey-form.md b/curriculum/challenges/chinese-traditional/01-responsive-web-design/responsive-web-design-projects/build-a-survey-form.md
index a8bb0cf51a9..4ffdba5ea38 100644
--- a/curriculum/challenges/chinese-traditional/01-responsive-web-design/responsive-web-design-projects/build-a-survey-form.md
+++ b/curriculum/challenges/chinese-traditional/01-responsive-web-design/responsive-web-design-projects/build-a-survey-form.md
@@ -91,7 +91,7 @@ const el = document.getElementById('name')
 assert(!!el && el.required)
 ```
 
-你的 `#name` 元素應該是 `#survey-form` 元素的子元素。
+Your `#name` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #name')
@@ -119,7 +119,7 @@ const el = document.getElementById('email')
 assert(!!el && el.required)
 ```
 
-你的 `#email` 元素應該是 `#survey-form` 元素的子元素。
+Your `#email` should be a descendant of `#survey-form`
 
 ```js
 const el = document.querySelector('#survey-form #email')
@@ -133,7 +133,7 @@ const el = document.getElementById('number')
 assert(!!el && el.tagName === 'INPUT')
 ```
 
-你的 `#number` 元素應該是 `#survey-form` 元素的子元素。
+Your `#number` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #number')
@@ -203,21 +203,21 @@ const el = document.getElementById('number-label')
 assert(!!el && el.innerText.length > 0)
 ```
 
-你的 `#name-label` 元素應該是 `#survey-form` 元素的子元素。
+Your `#name-label` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #name-label')
 assert(!!el)
 ```
 
-你的 `#email-label` 元素應該是 `#survey-form` 元素的子元素。
+Your `#email-label` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #email-label')
 assert(!!el)
 ```
 
-你的 `#number-label` 元素應該是 `#survey-form` 元素的子元素。
+Your `#number-label` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #number-label')
diff --git a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md
index b0f1416de35..b76bb842d4c 100644
--- a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md
+++ b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md
@@ -8,7 +8,7 @@ dashedName: falsy-bouncer
 
 # --description--
 
-從數組中移除所有假值（falsy values）。
+Remove all falsy values from an array. Return a new array; do not mutate the original array.
 
 JavaScript 中的假值有 `false`、`null`、`0`、`""`、`undefined`、`NaN`。
 
@@ -40,6 +40,14 @@ assert.deepEqual(bouncer([false, null, 0, NaN, undefined, '']), []);
 assert.deepEqual(bouncer([null, NaN, 1, 2, undefined]), [1, 2]);
 ```
 
+You should not mutate `arr`.
+
+```js
+const arr = ['a', false, 0, 'Naomi'];
+bouncer(arr);
+assert.deepEqual(arr, ['a', false, 0, 'Naomi'])
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
index 25b0e991643..86b5874bb4d 100644
--- a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
+++ b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
@@ -37,12 +37,6 @@ assert(code.match(/quotient/g).length === 1);
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function(y){return 'quotient = '+y;})(quotient);
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
index bccac3a3929..01adfa0d9d5 100644
--- a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
+++ b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
@@ -11,12 +11,12 @@ dashedName: escape-sequences-in-strings
 
 引號不是字符串中唯一可以被轉義（<dfn>escaped</dfn>）的字符。 使用轉義字符有兩個原因：
 
-1.  首先是可以讓你使用無法輸入的字符，例如退格。
+1.  To allow you to use characters you may not otherwise be able to type out, such as a newline.
 2.  其次是可以讓你在一個字符串中表示多個引號，而不會出錯。
 
 我們在之前的挑戰中學到了這個。
 
-<table class='table table-striped'><thead><tr><th>代碼</th><th>輸出</th></tr></thead><tbody><tr><td><code>\'</code></td><td>單引號</td></tr><tr><td><code>\"</code></td><td>雙引號</td></tr><tr><td><code>\\</code></td><td>反斜槓</td></tr><tr><td><code>\n</code></td><td>換行符</td></tr><tr><td><code>\r</code></td><td>回車符</td></tr><tr><td><code>\t</code></td><td>製表符</td></tr><tr><td><code>\b</code></td><td>退格</td></tr><tr><td><code>\f</code></td><td>換頁符</td></tr></tbody></table>
+<table class='table table-striped'><thead><tr><th>代碼</th><th>輸出</th></tr></thead><tbody><tr><td><code>\'</code></td><td>單引號</td></tr><tr><td><code>\"</code></td><td>雙引號</td></tr><tr><td><code>\\</code></td><td>反斜槓</td></tr><tr><td><code>\n</code></td><td>換行符</td></tr><tr><td><code>\t</code></td><td>tab</td></tr><tr><td><code>\r</code></td><td>carriage return</td></tr><tr><td><code>\b</code></td><td>退格</td></tr><tr><td><code>\f</code></td><td>換頁符</td></tr></tbody></table>
 
 *請注意，必須對反斜槓本身進行轉義，它才能顯示爲反斜槓。*
 
@@ -78,14 +78,6 @@ assert(myStr === 'FirstLine\n\t\\SecondLine\nThirdLine');
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function(){
-if (myStr !== undefined){
-console.log('myStr:\n' + myStr);}})();
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
index 054a453aee3..a8360c285b5 100644
--- a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
+++ b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
@@ -31,12 +31,6 @@ assert(/var\s+a\s*=\s*9(\s*;?\s*)$/.test(code));
 
 # --seed--
 
-## --after-user-code--
-
-```js
-if(typeof a !== 'undefined') {(function(a){return "a = " + a;})(a);} else { (function() {return 'a is undefined';})(); }
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
index d80d8fb1a58..7cb1ebf3801 100644
--- a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
+++ b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
@@ -62,12 +62,6 @@ assert(code.match(/"/g).length === 4 && code.match(/'/g).length === 2);
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function() { return "myStr = " + myStr; })();
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
index 6ed26f256a9..4d8c35de2c7 100644
--- a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
+++ b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
@@ -98,7 +98,7 @@ function nextInLine(arr, item) {
 }
 
 // Setup
-const testArr = [1, 2, 3, 4, 5];
+let testArr = [1, 2, 3, 4, 5];
 
 // Display code
 console.log("Before: " + JSON.stringify(testArr));
@@ -109,7 +109,7 @@ console.log("After: " + JSON.stringify(testArr));
 # --solutions--
 
 ```js
-const testArr = [1, 2, 3, 4, 5];
+let testArr = [1, 2, 3, 4, 5];
 
 function nextInLine(arr, item) {
     arr.push(item);
diff --git a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
index 830cd6c9609..964bdf024bd 100644
--- a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
+++ b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
@@ -71,6 +71,13 @@ assert(
 );
 ```
 
+Global variables should not be used to cache the array.
+
+```js
+countdown(1)
+assert.deepStrictEqual(countdown(5), [5, 4, 3, 2, 1]);
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
index 5cc0098b523..429cd2dcbd5 100644
--- a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
+++ b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
@@ -56,6 +56,13 @@ assert.deepStrictEqual(rangeOfNumbers(6, 9), [6, 7, 8, 9]);
 assert.deepStrictEqual(rangeOfNumbers(4, 4), [4]);
 ```
 
+Global variables should not be used to cache the array.
+
+```js
+rangeOfNumbers(1, 3)
+assert.deepStrictEqual(rangeOfNumbers(6, 9), [6, 7, 8, 9]);
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
index 18806c6610e..bf01fc37706 100644
--- a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
+++ b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
@@ -12,24 +12,35 @@ ES6 提供了一個新的創建對象的語法，使用關鍵字 <dfn>class</dfn
 
 值得注意的是，`class` 只是一個語法糖，它並不像 Java、Python 或者 Ruby 這一類的語言一樣，嚴格履行了面向對象的開發規範。
 
-在 ES5 裏面，我們通常會定義一個構造函數 `constructor`，然後使用 `new` 關鍵字來實例化一個對象：
-
-```js
-var SpaceShuttle = function(targetPlanet){
-  this.targetPlanet = targetPlanet;
-}
-var zeus = new SpaceShuttle('Jupiter');
-```
-
-`class` 語法只是簡單地替換了構造函數 `constructor` 的寫法：
+In ES5, an object can be created by defining a `constructor` function and using the `new` keyword to instantiate the object.
+
+In ES6, a `class` declaration has a `constructor` method that is invoked with the `new` keyword. If the `constructor` method is not explicitly defined, then it is implicitly defined with no arguments.
 
 ```js
+// Explicit constructor
 class SpaceShuttle {
   constructor(targetPlanet) {
     this.targetPlanet = targetPlanet;
   }
+  takeOff() {
+    console.log("To " + this.targetPlanet + "!");
+  }
 }
+
+// Implicit constructor 
+class Rocket {
+  launch() {
+    console.log("To the moon!");
+  }
+}
+
 const zeus = new SpaceShuttle('Jupiter');
+// prints To Jupiter! in console
+zeus.takeOff();
+
+const atlas = new Rocket();
+// prints To the moon! in console
+atlas.launch();
 ```
 
 應該注意 `class` 關鍵字聲明瞭一個新的函數，裏面添加了一個構造函數。 當用 `new` 創建一個新的對象時，構造函數會被調用。
diff --git a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
index 2af031b3492..677a84ce510 100644
--- a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
+++ b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
@@ -53,7 +53,8 @@ assert(
 `bicycle.setGear(48)` 應將 `gear` 的值改爲 48。
 
 ```js
-assert(new bicycle.setGear(48).gear === 48);
+bicycle.setGear(48);
+assert(bicycle.gear === 48);
 ```
 
 # --seed--
diff --git a/curriculum/challenges/chinese-traditional/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/chinese-traditional/02-javascript-algorithms-and-data-structures/functional-programming/add-elements-to-the-end-of-an-array-using-concat-instead-of-push.md
index 3383a8029ef..78735a1467f 100644
--- a/curriculum/challenges/chinese-traditional/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/chinese-traditional/02-javascript-algorithms-and-data-structures/functional-programming/add-elements-to-the-end-of-an-array-using-concat-instead-of-push.md
@@ -10,20 +10,20 @@ dashedName: add-elements-to-the-end-of-an-array-using-concat-instead-of-push
 
 函數式編程就是創建和使用具有不變性的函數。
 
-上一個挑戰介紹了 `concat` 方法，這是一種在不改變原始數組的前提下，將數組組合成新數組的方法。 將 `concat` 方法與 `push` 方法做比較。 `push` 將元素添加到調用它的數組的末尾，這樣會改變該數組。 舉個例子：
+The last challenge introduced the `concat` method as a way to merge arrays into a new array without mutating the original arrays. 將 `concat` 方法與 `push` 方法做比較。 `push` adds items to the end of the same array it is called on, which mutates that array. 舉個例子：
 
 ```js
 const arr = [1, 2, 3];
-arr.push([4, 5, 6]);
+arr.push(4, 5, 6);
 ```
 
-`arr` 的值被修改爲 `[1, 2, 3, [4, 5, 6]]`，這不是函數編程方式。
+`arr` would have a modified value of `[1, 2, 3, 4, 5, 6]`, which is not the functional programming way.
 
-`concat` 方法可以將新項目添加到數組末尾，而不產生副作用。
+`concat` offers a way to merge new items to the end of an array without any mutating side effects.
 
 # --instructions--
 
-修改 `nonMutatingPush` 函數，用 `concat` 替代 `push` 將 `newItem` 添加到 `original` 末尾。 該函數應返回一個數組。
+Change the `nonMutatingPush` function so it uses `concat` to merge `newItem` to the end of `original` without mutating `original` or `newItem` arrays. 該函數應返回一個數組。
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
index 1a2cab7d004..f89fb88eadd 100644
--- a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
+++ b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
@@ -137,14 +137,6 @@ assert.strictEqual(
 
 # --seed--
 
-## --after-user-code--
-
-```js
-if(bob){
-  bob = new Person("Bob Ross");
-}
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
index fb696510b8b..81e84279592 100644
--- a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
+++ b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
@@ -42,6 +42,13 @@ assert.deepEqual(steamrollArray([1, {}, [3, [[4]]]]), [1, {}, 3, 4]);
 assert(!code.match(/\.\s*flat\s*\(/) && !code.match(/\.\s*flatMap\s*\(/));
 ```
 
+Global variables should not be used.
+
+```js
+steamrollArray([1, {}, [3, [[4]]]])
+assert.deepEqual(steamrollArray([1, {}, [3, [[4]]]]), [1, {}, 3, 4])
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
index b79c3f5625b..4457789ddae 100644
--- a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
+++ b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
@@ -47,28 +47,48 @@ sumPrimes(10);
 # --solutions--
 
 ```js
-function eratosthenesArray(n) {
-    var primes = [];
-    if (n > 2) {
-        var half = n>>1;
-        var sieve = Array(half);
-        for (var i = 1, limit = Math.sqrt(n)>>1; i <= limit; i++) {
-            if (!sieve[i]) {
-                for (var step = 2*i+1, j = (step*step)>>1; j < half; j+=step) {
-                    sieve[j] = true;
-                }
-            }
-        }
-        primes.push(2);
-        for (var p = 1; p < half; p++) {
-            if (!sieve[p]) primes.push(2*p+1);
+class PrimeSeive {
+  constructor(num) {
+    const seive = Array(Math.floor((num - 1) / 2)).fill(true);
+    const upper = Math.floor((num - 1) / 2);
+    const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+
+    for (let i = 0; i <= sqrtUpper; i++) {
+      if (seive[i]) {
+        // Mark value in seive array
+        const prime = 2 * i + 3;
+        // Mark all multiples of this number as false (not prime)
+        const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+        for (let j = primeSqaredIndex; j < upper; j += prime) {
+          seive[j] = false;
         }
+      }
     }
-    return primes;
-}
+
+    this._seive = seive;
+  }
+
+  isPrime(num) {
+    return num === 2
+      ? true
+      : num % 2 === 0
+        ? false
+        : this.isOddPrime(num);
+  }
+
+  isOddPrime(num) {
+    return this._seive[(num - 3) / 2];
+  }
+};
 
 function sumPrimes(num) {
-  return eratosthenesArray(num+1).reduce(function(a,b) {return a+b;}, 0);
+  const primeSeive = new PrimeSeive(num);
+
+  let sum = 2;
+  for (let i = 3; i <= num; i += 2) {
+    if (primeSeive.isOddPrime(i)) sum += i;
+  }
+  return sum;
 }
 
 sumPrimes(10);
diff --git a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
index 626f7c8141d..ce2687e5a89 100644
--- a/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
+++ b/curriculum/challenges/chinese-traditional/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
@@ -79,23 +79,55 @@ assert(beagle.constructor === Dog);
 `beagle.eat()` 應該記錄字符串 `nom nom nom`
 
 ```js
-console.log = function (msg) {
-  throw msg;
-};
-assert.throws(() => beagle.eat(), 'nom nom nom');
+capture();
+beagle.eat();
+uncapture();
+assert(logOutput == 'nom nom nom');
 ```
 
 `beagle.bark()` 應該將字符串 `Woof!` 打印到控制檯
 
 ```js
-console.log = function (msg) {
-  throw msg;
-};
-assert.throws(() => beagle.bark(), 'Woof!');
+capture();
+beagle.bark();
+uncapture();
+assert(logOutput == 'Woof!');
 ```
 
 # --seed--
 
+## --before-user-code--
+
+```js
+var logOutput = "";
+var originalConsole = console
+function capture() {
+    var nativeLog = console.log;
+    console.log = function (message) {
+        logOutput = message;
+        if(nativeLog.apply) {
+          nativeLog.apply(originalConsole, arguments);
+        } else {
+          var nativeMsg = Array.prototype.slice.apply(arguments).join(' ');
+          nativeLog(nativeMsg);
+        }
+    };
+}
+
+function uncapture() {
+  console.log = originalConsole.log;
+}
+
+capture();
+```
+
+## --after-user-code--
+
+```js
+uncapture();
+(function() { return logOutput || "console.log never called"; })();
+```
+
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/chinese-traditional/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md b/curriculum/challenges/chinese-traditional/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
index 643d3befd5d..21093512a8c 100644
--- a/curriculum/challenges/chinese-traditional/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
+++ b/curriculum/challenges/chinese-traditional/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
@@ -8,7 +8,7 @@ dashedName: build-a-25--5-clock
 
 # --description--
 
-**目標：** 構建一個應用，功能和 <a href="https://codepen.io/freeCodeCamp/full/XpKrrW" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/XpKrrW</a> 類似。
+**Objective:** Build an app that is functionally similar to this: <a href="https://25--5-clock.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://25--5-clock.freecodecamp.rocks</a>.
 
 完成以下需求，並且通過所有測試。 可以使用你需要的任何庫或 API。 賦予它你自己的個人風格。
 
diff --git a/curriculum/challenges/chinese-traditional/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md b/curriculum/challenges/chinese-traditional/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
index f3fb2b74390..46bc000a2e2 100644
--- a/curriculum/challenges/chinese-traditional/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
+++ b/curriculum/challenges/chinese-traditional/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
@@ -8,7 +8,7 @@ dashedName: build-a-drum-machine
 
 # --description--
 
-**目標：** 構建一個應用，功能和 <a href="https://codepen.io/freeCodeCamp/full/MJyNMd" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/MJyNMd</a> 類似。
+**Objective:** Build an app that is functionally similar to this: <a href="https://drum-machine.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://drum-machine.freecodecamp.rocks/</a>.
 
 完成以下需求，並且通過所有測試。 可以使用你需要的任何庫或 API。 賦予它你自己的個人風格。
 
diff --git a/curriculum/challenges/chinese-traditional/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md b/curriculum/challenges/chinese-traditional/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
index e0de9e3ab07..51cf65eeebc 100644
--- a/curriculum/challenges/chinese-traditional/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
+++ b/curriculum/challenges/chinese-traditional/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
@@ -8,7 +8,7 @@ dashedName: build-a-javascript-calculator
 
 # --description--
 
-**目標：** 構建一個應用，功能和 <a href="https://codepen.io/freeCodeCamp/full/wgGVVX" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/wgGVVX</a> 類似。
+**Objective:** Build an app that is functionally similar to this: <a href="https://javascript-calculator.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://javascript-calculator.freecodecamp.rocks/</a>.
 
 完成以下需求，並且通過所有測試。 可以使用你需要的任何庫或 API。 賦予它你自己的個人風格。
 
diff --git a/curriculum/challenges/chinese-traditional/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md b/curriculum/challenges/chinese-traditional/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
index 8e235b6e320..385221aecf0 100644
--- a/curriculum/challenges/chinese-traditional/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
+++ b/curriculum/challenges/chinese-traditional/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
@@ -8,7 +8,7 @@ dashedName: build-a-markdown-previewer
 
 # --description--
 
-**目標：** 構建一個應用，功能和 <a href="https://codepen.io/freeCodeCamp/full/GrZVVO" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/GrZVVO</a> 類似。
+**Objective:** Build an app that is functionally similar to this: <a href="https://markdown-previewer.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://markdown-previewer.freecodecamp.rocks/</a>.
 
 完成以下需求，並且通過所有測試。 可以使用你需要的任何庫或 API。 賦予它你自己的個人風格。
 
diff --git a/curriculum/challenges/chinese-traditional/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md b/curriculum/challenges/chinese-traditional/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
index ddd6da04890..d2656cd7cac 100644
--- a/curriculum/challenges/chinese-traditional/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
+++ b/curriculum/challenges/chinese-traditional/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
@@ -8,7 +8,7 @@ dashedName: build-a-random-quote-machine
 
 # --description--
 
-**目標：** 構建一個應用，功能和 <a href="https://codepen.io/freeCodeCamp/full/qRZeGZ" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/qRZeGZ</a> 類似。
+**Objective:** Build an app that is functionally similar to this: <a href="https://random-quote-machine.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://random-quote-machine.freecodecamp.rocks/</a>.
 
 完成以下需求，並且通過所有測試。 可以使用你需要的任何庫或 API。 賦予它你自己的個人風格。
 
diff --git a/curriculum/challenges/chinese-traditional/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md b/curriculum/challenges/chinese-traditional/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
index fea3ec04265..01b1d522cc7 100644
--- a/curriculum/challenges/chinese-traditional/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
+++ b/curriculum/challenges/chinese-traditional/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
@@ -8,9 +8,9 @@ dashedName: visualize-data-with-a-bar-chart
 
 # --description--
 
-**目標：** 在 [CodePen.io](https://codepen.io) 上實現一個功能類似 <https://codepen.io/freeCodeCamp/full/GrZVaM> 的 App。
+**Objective:** Build an app that is functionally similar to this: <a href="https://bar-chart.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://bar-chart.freecodecamp.rocks</a>.
 
-在滿足以下[需求](https://en.wikipedia.org/wiki/User_story)並能通過所有測試的前提下， 你可以根據自己的喜好來美化你的 app。
+完成以下需求，並且通過所有測試。 使用你需要的任何庫或 API。 賦予它你自己的個人風格。
 
 你可以使用 HTML、JavaScript、CSS、以及基於 svg 的 D3 可視化庫來完成這個挑戰。 該任務需要使用 D3 的座標軸屬性生成座標軸，這個屬性會自動生成沿軸的刻度。 通過 D3 測試需要這些刻度，因爲它們的位置被用來確定繪製元素的對齊方式。 你可以在這裏 <https://github.com/d3/d3/blob/master/API.md#axes-d3-axis> 獲取關於生成座標軸的信息。 每次測試查詢的元素都必須是非虛擬 DOM。 如果你使用了前端框架（例如 Vue），那麼對於動態的內容測試結果可能不準確。 我們希望最終能夠兼容這些框架，但 D3 項目目前還不支持它們。
 
@@ -42,7 +42,7 @@ dashedName: visualize-data-with-a-bar-chart
 
 以下是完成此項目所需的數據： `https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/GDP-data.json`
 
-你可以<a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>使用 CodePen 模板</a>來創建你的項目，點擊 `Save` 即可創建你的項目。 或者你可以在任何你喜歡的環境中使用以下 CDN 鏈接來運行測試：`https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
+你可以<a href='https://codepen.io/pen?template=MJjpwO' target="_blank" rel="noopener noreferrer nofollow">使用 CodePen 模版</a>創建你的新項目，點擊 `Save` 即可創建你的新項目。 或者你可以在任何你喜歡的環境中使用以下 CDN 鏈接來運行測試：`https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
 
 當你完成了本項目，並且該項目所有測試運行通過，請提交項目的 URL。
 
diff --git a/curriculum/challenges/chinese-traditional/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md b/curriculum/challenges/chinese-traditional/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
index 628f636436e..26d8a6e9973 100644
--- a/curriculum/challenges/chinese-traditional/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
+++ b/curriculum/challenges/chinese-traditional/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
@@ -8,9 +8,9 @@ dashedName: visualize-data-with-a-choropleth-map
 
 # --description--
 
-**目標：** 在 [CodePen.io](https://codepen.io) 上實現一個功能類似 <https://codepen.io/freeCodeCamp/full/EZKqza> 的 App。
+**Objective:** Build an app that is functionally similar to this: <a href="https://choropleth-map.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://choropleth-map.freecodecamp.rocks</a>.
 
-在滿足以下[需求](https://en.wikipedia.org/wiki/User_story)並能通過所有測試的前提下， 你可以根據自己的喜好來美化你的 app。
+完成以下需求，並且通過所有測試。 你可以使用你需要的任何庫或 API。 賦予它你自己的個人風格。
 
 你可以使用 HTML、JavaScript、CSS、以及基於 svg 的 D3 可視化庫來完成這個挑戰。 每次測試查詢的元素都必須是非虛擬 DOM。 如果你使用了前端框架（例如 Vue），那麼對於動態的內容測試結果可能不準確。 我們希望最終能夠兼容這些框架，但 D3 項目目前還不支持它們。
 
@@ -41,7 +41,7 @@ dashedName: visualize-data-with-a-choropleth-map
 -   **US Education Data:** `https://cdn.freecodecamp.org/testable-projects-fcc/data/choropleth_map/for_user_education.json`
 -   **US County Data:** `https://cdn.freecodecamp.org/testable-projects-fcc/data/choropleth_map/counties.json`
 
-你可以<a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>使用 CodePen 模板</a>來創建你的項目，點擊 `Save` 即可創建你的項目。 或者你可以在任何你喜歡的環境中使用以下 CDN 鏈接來運行測試：`https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
+你可以<a href='https://codepen.io/pen?template=MJjpwO' target="_blank" rel="noopener noreferrer nofollow">使用這份 CodePen 模版</a>來創建你的新項目，點擊 `Save` 即可創建屬於你自己的項目。 或者你可以在任何你喜歡的環境中使用以下 CDN 鏈接來運行測試：`https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
 
 當你完成了本項目，並且該項目所有測試運行通過，請提交項目的 URL。
 
diff --git a/curriculum/challenges/chinese-traditional/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md b/curriculum/challenges/chinese-traditional/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
index e69236fb536..408c09d3712 100644
--- a/curriculum/challenges/chinese-traditional/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
+++ b/curriculum/challenges/chinese-traditional/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
@@ -8,9 +8,9 @@ dashedName: visualize-data-with-a-heat-map
 
 # --description--
 
-**目標：** 在 [CodePen.io](https://codepen.io) 上實現一個功能類似 <https://codepen.io/freeCodeCamp/full/JEXgeY> 的 App。
+**Objective:** Build an app that is functionally similar to this: <a href="https://heat-map.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://heat-map.freecodecamp.rocks</a>.
 
-在滿足以下[需求](https://en.wikipedia.org/wiki/User_story)並能通過所有測試的前提下， 你可以根據自己的喜好來美化你的 app。
+完成以下需求，並且通過所有測試。 你可以使用你需要的任何庫或 API。 賦予它你自己的個人風格。
 
 你可以使用 HTML、JavaScript、CSS、以及基於 svg 的 D3 可視化庫來完成這個挑戰。 每次測試查詢的元素都必須是非虛擬 DOM。 如果你使用了前端框架（例如 Vue），那麼對於動態的內容測試結果可能不準確。 我們希望最終能夠兼容這些框架，但 D3 項目目前還不支持它們。
 
@@ -50,7 +50,7 @@ dashedName: visualize-data-with-a-heat-map
 
 以下是完成此項目所需的數據：`https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/global-temperature.json`
 
-你可以<a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>使用這個 CodePen 模板</a>來創建你的項目，點擊 `Save` 即可創建你的項目。 或者你可以在任何你喜歡的環境中使用以下 CDN 鏈接來運行測試：`https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
+你可以<a href='https://codepen.io/pen?template=MJjpwO' target="_blank" rel="noopener noreferrer nofollow">使用 CodePen 模版</a>創建你的新項目，點擊 `Save` 即可創建你的新項目。 或者你可以在任何你喜歡的環境中使用以下 CDN 鏈接來運行測試：`https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
 
 當你完成了本項目，並且該項目所有測試運行通過，請提交項目的 URL。
 
diff --git a/curriculum/challenges/chinese-traditional/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md b/curriculum/challenges/chinese-traditional/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
index 4066a98d892..7948ab49d5d 100644
--- a/curriculum/challenges/chinese-traditional/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
+++ b/curriculum/challenges/chinese-traditional/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
@@ -8,9 +8,9 @@ dashedName: visualize-data-with-a-scatterplot-graph
 
 # --description--
 
-**目標：** 在 [CodePen.io](https://codepen.io) 上實現一個功能類似 <https://codepen.io/freeCodeCamp/full/bgpXyK> 的 App。
+**Objective:** Build an app that is functionally similar to this: <a href="https://scatterplot-graph.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://scatterplot-graph.freecodecamp.rocks</a>.
 
-在滿足以下[需求](https://en.wikipedia.org/wiki/User_story)並能通過所有測試的前提下， 你可以根據自己的喜好來美化你的 app。
+完成以下需求，並且通過所有測試。 你可以使用你需要的任何庫或 API。 賦予它你自己的個人風格。
 
 你可以使用 HTML、JavaScript、CSS、以及基於 svg 的 D3 可視化庫來完成這個挑戰。 該任務需要使用 D3 的座標軸屬性生成座標軸，這個屬性會自動生成沿軸的刻度。 這些刻度是通過 D3 測試所必需的，因爲它們的位置是用來確定圖表元素的對齊方式。 你可以在這裏 <https://github.com/d3/d3/blob/master/API.md#axes-d3-axis> 獲取關於生成座標軸的信息。 每次測試查詢的元素都必須是非虛擬 DOM。 如果你使用了前端框架（例如 Vue），因爲內容是動態渲染的，試結果可能不準確。 我們希望最終能夠兼容這些框架，但 D3 框架目前還不支持它們。
 
@@ -46,7 +46,7 @@ dashedName: visualize-data-with-a-scatterplot-graph
 
 以下是完成此項目所需的數據：`https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/cyclist-data.json`
 
-你可以<a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>使用這個 CodePen 模板</a>來創建你的項目，點擊 `Save` 即可創建你的項目。 或者你可以在任何你喜歡的環境中使用以下 CDN 鏈接來運行測試：`https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
+你可以<a href='https://codepen.io/pen?template=MJjpwO' target="_blank" rel="noopener noreferrer nofollow">使用 CodePen 模版</a>創建你的新項目，點擊 `Save` 即可創建你的新項目。 或者你可以在任何你喜歡的環境中使用以下 CDN 鏈接來運行測試：`https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
 
 當你完成了本項目，並且項目通過所有測試，請提交項目的 URL。
 
diff --git a/curriculum/challenges/chinese-traditional/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md b/curriculum/challenges/chinese-traditional/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
index 5e570d2cce1..9bc8283a0f2 100644
--- a/curriculum/challenges/chinese-traditional/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
+++ b/curriculum/challenges/chinese-traditional/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
@@ -8,9 +8,9 @@ dashedName: visualize-data-with-a-treemap-diagram
 
 # --description--
 
-**目標：** 在 [CodePen.io](https://codepen.io) 上實現一個功能類似 <https://codepen.io/freeCodeCamp/full/KaNGNR> 的 App。
+**Objective:** Build an app that is functionally similar to this: <a href="https://treemap-diagram.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://treemap-diagram.freecodecamp.rocks</a>.
 
-在滿足以下[需求](https://en.wikipedia.org/wiki/User_story)並能通過所有測試的前提下， 你可以根據自己的喜好來美化你的 app。
+完成以下需求，並且通過所有測試。 使用你需要的任何庫或 API。 賦予它你自己的個人風格。
 
 你可以使用 HTML、JavaScript、CSS、以及基於 svg 的 D3 可視化庫來完成這個挑戰。 該任務需要使用 D3 的座標軸屬性生成座標軸，這個屬性會自動生成沿軸的刻度。 這些刻度是通過 D3 測試所必需的，因爲它們的位置是用來確定圖表元素的對齊方式。 你可以在這裏 <https://github.com/d3/d3/blob/master/API.md#axes-d3-axis> 獲取關於生成座標軸的信息。 每次測試查詢的元素都必須是非虛擬 DOM。 如果你使用了前端框架（例如 Vue），那麼對於動態的內容測試結果可能不準確。 我們希望最終能夠兼容這些框架，但 D3 項目目前還不支持它們。
 
@@ -42,7 +42,7 @@ dashedName: visualize-data-with-a-treemap-diagram
 -   **Movie Sales：** `https://cdn.freecodecamp.org/testable-projects-fcc/data/tree_map/movie-data.json`
 -   **Video Game Sales：** `https://cdn.freecodecamp.org/testable-projects-fcc/data/tree_map/video-game-sales-data.json`
 
-你可以<a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>使用 CodePen 模板</a>來創建你的項目，點擊 `Save` 即可創建你的項目。 或者你可以在任何你喜歡的環境中使用以下 CDN 鏈接來運行測試：`https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
+你可以<a href='https://codepen.io/pen?template=MJjpwO' target="_blank" rel="noopener noreferrer nofollow">使用 CodePen 模版</a>創建你的新項目，點擊 `Save` 即可創建你的新項目。 或者你可以在任何你喜歡的環境中使用以下 CDN 鏈接來運行測試：`https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
 
 當你完成了本項目，並且該項目所有測試運行通過，請提交項目的 URL。
 
diff --git a/curriculum/challenges/chinese-traditional/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md b/curriculum/challenges/chinese-traditional/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md
index 99acff55520..dcbbb361036 100644
--- a/curriculum/challenges/chinese-traditional/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md
+++ b/curriculum/challenges/chinese-traditional/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md
@@ -10,9 +10,9 @@ dashedName: create-a-model
 
 **C** RUD 第一小節——CREATE
 
-首先，我們需要一個 Schema， 每一個 Schema 都對應一個 MongoDB 的 collection， 並且在相應的 collection 裏定義 documents 的“樣子”。 Schema 用於組成模型（Model）， 我們甚至可以通過嵌套 Schema 來創建複雜的模型。目前我們先從簡。 我們可以根據模型創建實例，模型實例化後的對象稱爲 documents。
+First of all, we need a Schema. 每一個 Schema 都對應一個 MongoDB 的 collection， 並且在相應的 collection 裏定義 documents 的“樣子”。 Schemas are building blocks for Models. They can be nested to create complex models, but in this case, we'll keep things simple. 我們可以根據模型創建實例，模型實例化後的對象稱爲 documents。
 
-Replit 是一個真實的服務器，在其中，通過 handler 函數和數據庫交互。 這些函數會在特定事件（比如有人調用了我們的服務器 API）發生時執行。 接下來的挑戰題目即是以此爲基礎。 `done()` 是一個回調函數，它的作用是在一個異步操作（比如對數據庫進行插入、查詢、更新或刪除）執行完成時，通知我們可以繼續執行後續的其它代碼。 這與 Node.js 中的處理方式十分類似，在 Node.js 中，我們會在（異步操作）成功時調用 `done(null, data)`，在失敗時調用 `done(err)`。
+Replit is a real server, and in real servers, the interactions with the database happen in handler functions. 這些函數會在特定事件（比如有人調用了我們的服務器 API）發生時執行。 接下來的挑戰題目即是以此爲基礎。 `done()` 是一個回調函數，它的作用是在一個異步操作（比如對數據庫進行插入、查詢、更新或刪除）執行完成時，通知我們可以繼續執行後續的其它代碼。 這與 Node.js 中的處理方式十分類似，在 Node.js 中，我們會在（異步操作）成功時調用 `done(null, data)`，在失敗時調用 `done(err)`。
 
 注意：與遠程服務器進行交互時，我們需要考慮到發生錯誤的可能！
 
@@ -38,7 +38,7 @@ age :  number
 favoriteFoods : array of strings (*)
 ```
 
-採用 Mongoose 基礎 schema 類型。 你如果還想添加更多的鍵，就請使用 required 或 unique 等簡單的驗證器（validators），並設置默認值。 詳情請參考 [Mongoose 文檔](http://mongoosejs.com/docs/guide.html)。
+採用 Mongoose 基礎 schema 類型。 你如果還想添加更多的鍵，就請使用 required 或 unique 等簡單的驗證器（validators），並設置默認值。 查看我們的 <a href="https://www.freecodecamp.org/news/introduction-to-mongoose-for-mongodb-d2a7aa593c57/" target="_blank" rel="noopener noreferrer nofollow">Mongoose 文章</a>。
 
 請從 `personSchema` 創建一個名爲 `Person` 的 model。
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/authentication-strategies.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/authentication-strategies.md
index 6eb6549303a..b32a2b4ec88 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/authentication-strategies.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/authentication-strategies.md
@@ -8,9 +8,9 @@ dashedName: authentication-strategies
 
 # --description--
 
-策略是認證用戶的一種方式。 如果你讓用戶在註冊時填寫了用戶信息，那你就可以基於這些信息進行驗證。或者也可以引入第三方登錄，如 Google 或者 Github。 對於這個項目的驗證策略，我們會採用自己搭建的方式完成。 可以[點擊這裏](http://passportjs.org/)訪問 Passport 網站，查看數以百計的策略。
+策略是認證用戶的一種方式。 如果你讓用戶在註冊時填寫了用戶信息，那你就可以基於這些信息進行驗證。或者也可以引入第三方登錄，如 Google 或者 Github。 在這個項目中，我們將使用 Passport 中間件。 Passport 提供了一套全面的策略，支持使用用戶名和密碼、GitHub、谷歌等進行認證。
 
-引入 `passport-local@~1.0.0` 作爲依賴，然後將它添加到服務器，就像這樣：`const LocalStrategy = require('passport-local');`
+`passport-local@~1.0.0` has already been added as a dependency, so add it to your server as follows: `const LocalStrategy = require('passport-local');`
 
 然後，需要讓 passport **使用**一個實例化的 LocalStrategy 對象，這個對象的一些設置已完成。 請注意，接下來的所有代碼都應寫在連接數據庫的回調中，因爲它們的執行都依賴數據庫。
 
@@ -34,7 +34,7 @@ passport.use(new LocalStrategy(
 
 在下一個挑戰中，我們會基於表單數據調用上面寫好的驗證策略。
 
-完成上述要求後，請提交你的頁面鏈接。 如果你遇到任何問題，可以參考[這裏](https://gist.github.com/camperbot/53b495c02b92adeee0aa1bd3f3be8a4b)的答案。
+完成上述要求後，請提交你的頁面鏈接。 如果你在運行時遇到錯誤，可以點擊此處查看<a href="https://gist.github.com/camperbot/53b495c02b92adeee0aa1bd3f3be8a4b" target="_blank" rel="noopener noreferrer nofollow">已執行項目的當前進度</a>。
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md
index 2b069246fe6..e1d14e15d4d 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md
@@ -10,7 +10,7 @@ dashedName: authentication-with-socket-io
 
 目前，你還無法確定連接到服務器的用戶身份。 雖然 `req.user` 包含用戶信息，但這個只在用戶直接與服務器交互時產生。當用戶通過 web socket 與服務器連接時，由於不存在 `req` 對象，我們就無法獲取用戶數據。 解決這個問題的方法之一是通過讀取和解析請求中包含 passport session 的 cookie，然後反序列化，進而獲取用戶信息對象。 幸運的是，NPM 上有可以讓這個複雜的流程簡單化的庫。
 
-添加 `passport.socketio@~3.7.0`、`connect-mongo@~3.2.0`、`cookie-parser@~1.4.5` 作爲依賴，把它們分別賦值給 `passportSocketIo`、`MongoStore`、`cookieParser`。 同時，我們需要從之前引入的 `express-session` 中開闢新的內存空間， 就像這樣：
+`passport.socketio@~3.7.0`, `connect-mongo@~3.2.0`, and `cookie-parser@~1.4.5` have already been added as dependencies. Require them as `passportSocketIo`, `MongoStore`, and `cookieParser` respectively. Also, we need to initialize a new memory store, from `express-session` which we previously required. It should look like this:
 
 ```js
 const MongoStore = require('connect-mongo')(session);
@@ -65,7 +65,7 @@ console.log('user ' + socket.request.user.name + ' connected');
 
 它將在服務器控制檯記錄已連接的用戶！
 
-完成以上要求後，請提交你的頁面鏈接。 如果你遇到了問題，可以參考[這裏](https://gist.github.com/camperbot/1414cc9433044e306dd7fd0caa1c6254)的答案。
+完成以上要求後，請提交你的頁面鏈接。 If you're running into errors, you can check out the project up to this point <a href="https://gist.github.com/camperbot/1414cc9433044e306dd7fd0caa1c6254" target="_blank" rel="noopener noreferrer nofollow">https://gist.github.com/camperbot/1414cc9433044e306dd7fd0caa1c6254</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/clean-up-your-project-with-modules.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/clean-up-your-project-with-modules.md
index a117727bcf7..b14d397bf59 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/clean-up-your-project-with-modules.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/clean-up-your-project-with-modules.md
@@ -26,7 +26,7 @@ module.exports = function (app, myDataBase) {
 
 現在，我們來把 server.js 中與驗證相關的代碼分離到 auth.js 中，例如序列化，設置驗證策略等。 請正確添加依賴，並在 server.js 中調用 `auth(app, myDataBase)`。
 
-完成上述要求後，請提交你的頁面鏈接。 如果你遇到了問題，可以參考[這裏](https://gist.github.com/camperbot/2d06ac5c7d850d8cf073d2c2c794cc92)的答案。
+完成上述要求後，請提交你的頁面鏈接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/2d06ac5c7d850d8cf073d2c2c794cc92" target="_blank" rel="noopener noreferrer nofollow">check out an example of the completed project</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/communicate-by-emitting.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/communicate-by-emitting.md
index 0bc1bdf733a..ad93e666f65 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/communicate-by-emitting.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/communicate-by-emitting.md
@@ -38,7 +38,7 @@ socket.on('user count', function(data) {
 
 現在你可以嘗試啓動你的 app 並登錄，你會看到在客戶端的控制檯打印出了 “1”，這就表示目前連接到服務器的用戶數爲 1。 你可以試着通過打開多個 app 來驗證數量是否會增加。
 
-完成上述要求後，請提交你的頁面鏈接。 如果你遇到了問題，可以參考[這裏](https://gist.github.com/camperbot/28ef7f1078f56eb48c7b1aeea35ba1f5)的答案。
+完成上述要求後，請提交你的頁面鏈接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/28ef7f1078f56eb48c7b1aeea35ba1f5" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/create-new-middleware.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/create-new-middleware.md
index 56041c62957..ba267e8e475 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/create-new-middleware.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/create-new-middleware.md
@@ -31,7 +31,7 @@ app
  });
 ```
 
-完成上述要求後，請提交你的頁面鏈接。 如果你遇到了問題，可以參考[這裏](https://gist.github.com/camperbot/ae49b8778cab87e93284a91343da0959)的答案。
+完成上述要求後，請提交你的頁面鏈接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/ae49b8778cab87e93284a91343da0959" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/handle-a-disconnect.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/handle-a-disconnect.md
index 88c9d2b5934..eab72ab1823 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/handle-a-disconnect.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/handle-a-disconnect.md
@@ -22,7 +22,7 @@ socket.on('disconnect', () => {
 
 **注意：**和 `'disconnect'` 類似，所有 socket 可以發送到服務器的事件，我們都應該在有 “socket” 定義的連接監聽器裏處理。
 
-完成上述要求後，請提交你的頁面鏈接。 如果你遇到了問題，可以參考[這裏](https://gist.github.com/camperbot/ab1007b76069884fb45b215d3c4496fa)的答案。
+完成上述要求後，請提交你的頁面鏈接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/ab1007b76069884fb45b215d3c4496fa" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/hashing-your-passwords.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/hashing-your-passwords.md
index 812540f591f..42b5b3d0243 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/hashing-your-passwords.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/hashing-your-passwords.md
@@ -10,7 +10,7 @@ dashedName: hashing-your-passwords
 
 回過頭來看信息安全，你也許記得在數據庫中存儲明文密碼是*絕對*禁止的。 現在，我們需要引入 BCrypt 來解決這個問題。
 
-添加 `bcrypt@~5.0.0` 作爲依賴，並在服務端使用它。 你需要在兩個步驟中使用哈希運算：註冊和保存新賬戶，以及登錄時檢查密碼是否正確。
+`bcrypt@~5.0.0` has already been added as a dependency, so require it in your server. 你需要在兩個步驟中使用哈希運算：註冊和保存新賬戶，以及登錄時檢查密碼是否正確。
 
 目前處理註冊的路由中，我們是這樣把密碼添加到數據庫的：`password: req.body.password`。 保存哈希值的一個簡單方式是在數據庫邏輯中添加 `const hash = bcrypt.hashSync(req.body.password, 12);`，然後把 `req.body.password` 替換爲 `password: hash`。
 
@@ -24,7 +24,7 @@ if (!bcrypt.compareSync(password, user.password)) {
 
 當你需要存儲密碼時，這樣做可以有效地提升網站的安全性。
 
-完成上述要求後，請提交你的頁面鏈接。 如果你遇到了問題，可以參考[這裏](https://gist.github.com/camperbot/dc16cca09daea4d4151a9c36a1fab564)的答案。
+完成上述要求後，請提交你的頁面鏈接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/dc16cca09daea4d4151a9c36a1fab564" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/how-to-put-a-profile-together.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/how-to-put-a-profile-together.md
index 4cff542563f..119469df9d5 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/how-to-put-a-profile-together.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/how-to-put-a-profile-together.md
@@ -24,7 +24,7 @@ h2.center#welcome Welcome, #{username}!
 a(href='/logout') Logout
 ```
 
-完成上述要求後，請提交你的頁面鏈接。 如果你遇到了問題，可以參考[這裏](https://gist.github.com/camperbot/136b3ad611cc80b41cab6f74bb460f6a)的答案。
+完成上述要求後，請提交你的頁面鏈接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/136b3ad611cc80b41cab6f74bb460f6a" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/how-to-use-passport-strategies.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/how-to-use-passport-strategies.md
index 1ed7d4edfff..10ab146d70b 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/how-to-use-passport-strategies.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/how-to-use-passport-strategies.md
@@ -18,7 +18,7 @@ dashedName: how-to-use-passport-strategies
 
 這時，由於我們還沒有實現註冊功能，如果你在表單裏輸入了用戶名和密碼，路由將會重定向到主頁 `/`，在服務端將會打印 `'User {USERNAME} attempted to log in.'`。
 
-完成上述要求後，請提交你的頁面鏈接。 如果你遇到了問題，可以參考[這裏](https://gist.github.com/camperbot/7ad011ac54612ad53188b500c5e99cb9)的答案。
+完成上述要求後，請提交你的頁面鏈接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/7ad011ac54612ad53188b500c5e99cb9" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/implement-the-serialization-of-a-passport-user.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/implement-the-serialization-of-a-passport-user.md
index c67fbaefd80..b3989f852ce 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/implement-the-serialization-of-a-passport-user.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/implement-the-serialization-of-a-passport-user.md
@@ -10,7 +10,7 @@ dashedName: implement-the-serialization-of-a-passport-user
 
 截至目前，我們還沒有配置完數據庫，因此還無法加載用戶數據。 實現這個的方式很多，但對於我們的項目，一旦服務器啓動，那麼只要有 app 實例在運行，數據庫就應一直處於連接狀態。 爲此，你需要在環境變量 `MONGO_URI` 中添加你的數據庫地址（比如：`mongodb+srv://:@cluster0-jvwxi.mongodb.net/?retryWrites=true&w=majority`）。 我們會在 `connection.js` 文件中調用它。
 
-*你可以在 [MongoDB Atlas](https://www.mongodb.com/cloud/atlas) 創建一個免費的數據庫。*
+*If you are having issues setting up a free database on MongoDB Atlas, check out <a href="https://www.freecodecamp.org/news/get-started-with-mongodb-atlas/" target="_blank" rel="noopener noreferrer nofollow">tutorial</a>.*
 
 現在我們想要連接到數據庫，然後開始監聽請求。 這樣做的目的是在連接數據庫之前或者出現數據庫錯誤時，不接收任何請求。 要實現這一點，你需要在以下代碼中包含序列化和應用的路由：
 
@@ -40,7 +40,7 @@ myDB(async client => {
 
 記得要取消 `deserializeUser` 中 `myDataBase` 的註釋，並把 `doc` 添加到 `done(null, null)`。
 
-完成上述要求後，請提交你的頁面鏈接。 如果你遇到了問題，可以參考[這裏](https://gist.github.com/camperbot/175f2f585a2d8034044c7e8857d5add7)的答案。
+完成上述要求後，請提交你的頁面鏈接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/175f2f585a2d8034044c7e8857d5add7" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-ii.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-ii.md
index c9428da7859..78d443e59b0 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-ii.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-ii.md
@@ -8,11 +8,13 @@ dashedName: implementation-of-social-authentication-ii
 
 # --description--
 
-設置 GitHub 驗證的最後一步是創建策略本身。 爲此，你需要在項目中添加 `passport-github@~1.1.0` 依賴，並在 `auth.js` 中請求它，作爲 `GithubStrategy`，像這樣：`const GitHubStrategy = require('passport-github').Strategy;`。 別忘了請求和配置 `dotenv`，使用你的環境變量。
+設置 GitHub 驗證的最後一步是創建策略本身。 `passport-github@~1.1.0` has already been added as a dependency, so require it in your `auth.js` file as `GithubStrategy` like this: `const GitHubStrategy = require('passport-github').Strategy;`. 別忘了請求和配置 `dotenv`，使用你的環境變量。
 
-爲了設置 GitHub 策略，我們需要在 Passport 中使用實例化的 `GitHubStrategy`，它可以接收兩個參數：一個對象（包括 `clientID`、`clientSecret` 和 `callbackURL`），以及一個回調函數。在這個回調函數中，我們要處理驗證成功時，判斷用戶是否已經在數據庫中存在的邏輯，以及在用戶數據庫對象中最初保存哪些字段。 這種處理方式適用於絕大部分第三方驗證策略，但有些策略會需要我們提供更多的信息，詳情請參考相關策略的 GitHub README。 例如，Google 的驗證策略會要求你提供一個 *scope*，用於標示用戶成功登錄後，你需要從返回的對象中獲取那些信息。以及，這也需要經過用戶同意，你纔可以獲取到。 你可以在[這裏](https://github.com/jaredhanson/passport-github/)瞭解當前我們使用的驗證策略的用法，不過我們也會在 freeCodeCamp 課程中進行詳細講解。
+爲了設置 GitHub 策略，我們需要在 Passport 中使用實例化的 `GitHubStrategy`，它可以接收兩個參數：一個對象（包括 `clientID`、`clientSecret` 和 `callbackURL`），以及一個回調函數。在這個回調函數中，我們要處理驗證成功時，判斷用戶是否已經在數據庫中存在的邏輯，以及在用戶數據庫對象中最初保存哪些字段。 這種處理方式適用於絕大部分第三方驗證策略，但有些策略會需要我們提供更多的信息，詳情請參考相關策略的 GitHub README。 例如，Google 的驗證策略會要求你提供一個 *scope*，用於標示用戶成功登錄後，你需要從返回的對象中獲取那些信息。以及，這也需要經過用戶同意，你纔可以獲取到。
 
-你的新策略應該這樣去實現：
+The current strategy we are implementing authenticates users using a GitHub account and OAuth 2.0 tokens. The client ID and secret obtained when creating an application are supplied as options when creating the strategy. The strategy also requires a `verify` callback, which receives the access token and optional refresh token, as well as `profile` which contains the authenticated user's GitHub profile. The `verify` callback must call `cb` providing a user to complete authentication.
+
+Here's how your new strategy should look at this point:
 
 ```js
 passport.use(new GitHubStrategy({
@@ -27,13 +29,13 @@ passport.use(new GitHubStrategy({
 ));
 ```
 
-目前，你的驗證部分不會成功。由於沒有數據庫的邏輯和回調函數，你的代碼目前還會報錯。但如果你試一試，就可以在控制檯裏看到輸出了你的 GitHub 個人信息。
+Your authentication won't be successful yet, and it will actually throw an error without the database logic and callback, but it should log your GitHub profile to your console if you try it!
 
-完成上述要求後，請提交你的頁面鏈接。 如果你遇到了問題，可以參考[這裏](https://gist.github.com/camperbot/ff3a1166684c1b184709ac0bee30dee6)的答案。
+Submit your page when you think you've got it right. If you're running into errors, you can <a href="https://gist.github.com/camperbot/ff3a1166684c1b184709ac0bee30dee6" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
-應正確添加依賴 passport-github。
+passport-github dependency should be added.
 
 ```js
 (getUserInput) =>
@@ -52,7 +54,7 @@ passport.use(new GitHubStrategy({
   );
 ```
 
-應正確請求依賴 passport-github。
+passport-github should be required.
 
 ```js
 (getUserInput) =>
@@ -70,7 +72,7 @@ passport.use(new GitHubStrategy({
   );
 ```
 
-到目前爲止，Github 策略應正確設置。
+GitHub strategy should be setup correctly thus far.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-iii.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-iii.md
index 98185beacac..d278ad9897b 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-iii.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-iii.md
@@ -42,7 +42,7 @@ myDataBase.findOneAndUpdate(
 
 你現在應該可以登錄你的應用了，試試吧。
 
-完成上述要求後，你可以在下方提交你的頁面鏈接。 如果你遇到了問題，可以參考 [這裏](https://gist.github.com/camperbot/183e968f0e01d81dde015d45ba9d2745) 的答案。
+完成上述要求後，你可以在下方提交你的頁面鏈接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/183e968f0e01d81dde015d45ba9d2745" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication.md
index d6723354c39..8d2b0f776fe 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication.md
@@ -18,7 +18,7 @@ dashedName: implementation-of-social-authentication
 
 在 OAuth 驗證策略中，我們至少需要提供 *Client ID* 和 *Client Secret*，這樣第三方平臺就會獲悉驗證請求的來源，以及這個來源是否有效。 爲此，需要去我們使用的第三方驗證平臺（比如 GitHub）獲取這兩個字段的值。 注意，我們獲取到的這個值是唯一的，僅對我們的當前 app 有效——**因此，千萬不要分享給別人**，更不要上傳到公共倉庫或者直接寫在代碼裏。 通常，我們會把它們放在 `.env` 文件裏，並通過 `process.env.GITHUB_CLIENT_ID` 獲取。 對於這次挑戰，我們將會使用 GitHub 作爲驗證平臺。
 
-首先，你需要進入賬戶設置裏的 “developer settings（開發者設置）”板塊，在 '[OAuth applications](https://github.com/settings/developers)' 獲取 *Client ID and Secret*。 點擊 “Register a new application（註冊一個新的應用）”，設置你的應用名稱，然後把你的 Replit 主頁地址（**不是項目代碼的 url**）粘貼到 Homepage URL。然後，回調 url 需要設置成上面 Homepage URL 裏你粘貼的地址，但後面要加上 `/auth/github/callback`。 這樣在用戶通過 Github 驗證後才能跳轉到我們指定的頁面。 在你的 `.env` 文件裏將返回的信息保存爲 `'GITHUB_CLIENT_ID'` 和 `'GITHUB_CLIENT_SECRET'`。
+Obtaining your *Client ID and Secret* from GitHub is done in your account profile settings under 'developer settings', then <a href="https://github.com/settings/developers" target="_blank" rel="noopener noreferrer nofollow">'OAuth applications'</a>. 點擊 “Register a new application（註冊一個新的應用）”，設置你的應用名稱，然後把你的 Replit 主頁地址（**不是項目代碼的 url**）粘貼到 Homepage URL。然後，回調 url 需要設置成上面 Homepage URL 裏你粘貼的地址，但後面要加上 `/auth/github/callback`。 這樣在用戶通過 Github 驗證後才能跳轉到我們指定的頁面。 在你的 `.env` 文件裏將返回的信息保存爲 `'GITHUB_CLIENT_ID'` 和 `'GITHUB_CLIENT_SECRET'`。
 
 在你的 `routes.js` 文件中，添加 `showSocialAuth: true` 到主頁路由，在 `showRegistration: true` 的後面。 然後，爲 `/auth/github` 和 `/auth/github/callback` 創建兩個接收 GET 請求的路由。 第一個只需要通過調用 passport 來驗證 `'github'`。 第二個應該調用 passport 來驗證 `'github'`，但需要在失敗時跳轉回主頁 `/`，成功時跳轉到用戶頁面 `/profile`（跳轉的邏輯與上一個項目中的邏輯一樣）。
 
@@ -31,7 +31,7 @@ app.route('/login')
   });
 ```
 
-完成上述要求後，請提交你的頁面鏈接。 如果你遇到了問題，可以參考[這裏](https://gist.github.com/camperbot/1f7f6f76adb178680246989612bea21e)的答案。
+完成上述要求後，請提交你的頁面鏈接。 If you're running into errors, you can check out the project up to this point <a href="https://gist.github.com/camperbot/1f7f6f76adb178680246989612bea21e" target="_blank" rel="noopener noreferrer nofollow">https://gist.github.com/camperbot/1f7f6f76adb178680246989612bea21e</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/logging-a-user-out.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/logging-a-user-out.md
index 621b0b1c4cb..b1523952694 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/logging-a-user-out.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/logging-a-user-out.md
@@ -30,11 +30,11 @@ app.use((req, res, next) => {
 });
 ```
 
-完成上述要求後，請提交你的頁面鏈接。 如果你遇到了問題，可以參考[這裏](https://gist.github.com/camperbot/c3eeb8a3ebf855e021fd0c044095a23b)的答案。
+完成上述要求後，請提交你的頁面鏈接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/c3eeb8a3ebf855e021fd0c044095a23b" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
-`req.Logout` 應在 `/logout` 路由中調用。
+`req.logout()` should be called in your `/logout` route.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md
index 2236a4bf810..a2a47f0bd01 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md
@@ -47,7 +47,7 @@ app.route('/register')
   );
 ```
 
-完成上述要求後，請提交你的頁面鏈接。 如果你遇到了問題，可以參考[這裏](https://gist.github.com/camperbot/b230a5b3bbc89b1fa0ce32a2aa7b083e)的答案。
+完成上述要求後，請提交你的頁面鏈接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/b230a5b3bbc89b1fa0ce32a2aa7b083e" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 **注意：**接下來的挑戰可能會在運行 *picture-in-picture*（畫中畫）模式的瀏覽器中出現問題。 如果你使用的線上 IDE 提供在 IDE 內預覽 app 的功能，請考慮打開新的標籤頁預覽。
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md
index 99946aca2f9..32bdcaf76bd 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md
@@ -28,7 +28,7 @@ socket.emit('chat message', messageToSend);
 
 至此，我們已經完成發送信息到所有客戶端的功能。
 
-完成上述要求後，請提交你的頁面鏈接。 如果你遇到了問題，可以參考[這裏](https://gist.github.com/camperbot/d7af9864375207e254f73262976d2016)的答案。
+完成上述要求後，請提交你的頁面鏈接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/d7af9864375207e254f73262976d2016" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md
index 4bc7345ac7e..5891eee6470 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md
@@ -12,7 +12,7 @@ dashedName: serialization-of-a-user-object
 
 我們需要用到序列化和反序列化的方法來進行配置。 passport 爲我們提供了 `passport.serializeUser( OURFUNCTION )` 和 `passport.deserializeUser( OURFUNCTION )` 兩個方法。
 
-`serializeUser` 方法接收兩個參數，分別是表示用戶的對象和一個回調函數。 其中，回調函數的返回值應爲這個用戶的唯一標識符：最簡單的寫法就是讓它返回用戶的 `_id`。 它應當是唯一的，是由 MongoDB 產生的。 類似地，`deserializeUser` 也接收兩個參數，分別是在序列化時生成的標識符以及一個回調函數。在回調函數裏，我們需要根據根據傳入的標識符（比如 \_id）返回表示用戶的對象。 爲了在 MongoDB 中通過 query（查詢語句）獲取 `_id` 字段，首先我們需要創建 `const ObjectID = require('mongodb').ObjectID;`；然後調用它：`new ObjectID(THE_ID)`。 確保添加 `mongodb@~3.6.0` 作爲依賴項。 你可以在下面的例子中看到：
+`serializeUser` 方法接收兩個參數，分別是表示用戶的對象和一個回調函數。 其中，回調函數的返回值應爲這個用戶的唯一標識符：最簡單的寫法就是讓它返回用戶的 `_id`。 它應當是唯一的，是由 MongoDB 產生的。 類似地，`deserializeUser` 也接收兩個參數，分別是在序列化時生成的標識符以及一個回調函數。在回調函數裏，我們需要根據根據傳入的標識符（比如 \_id）返回表示用戶的對象。 爲了在 MongoDB 中通過 query（查詢語句）獲取 `_id` 字段，首先我們需要創建 `const ObjectID = require('mongodb').ObjectID;`；然後調用它：`new ObjectID(THE_ID)`。 `mongodb@~3.6.0` has already been added as a dependency. 你可以在下面的例子中看到：
 
 ```js
 passport.serializeUser((user, done) => {
@@ -28,7 +28,7 @@ passport.deserializeUser((id, done) => {
 
 因此，在我們在下一步中配置 DB 前，`deserializeUser` 會拋出錯誤。所以，現在請先註釋掉上面的代碼，在 `deserializeUser` 中僅調用 `done(null, null)` 即可。
 
-完成上述要求後，請提交你的頁面鏈接。 如果你遇到了問題，可以參考 [這裏](https://gist.github.com/camperbot/7068a0d09e61ec7424572b366751f048) 的答案。
+完成上述要求後，請提交你的頁面鏈接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/7068a0d09e61ec7424572b366751f048" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md
index 343a464008e..3a24e4382d9 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md
@@ -10,25 +10,25 @@ dashedName: set-up-a-template-engine
 
 你可以採用下面的任意一種方式完成這些挑戰：
 
-- 克隆[這個 GitHub 倉庫](https://github.com/freeCodeCamp/boilerplate-advancednode/)，在本地完成這些挑戰。
-- 使用[我們的 Replit 上的初始化項目](https://replit.com/github/freeCodeCamp/boilerplate-advancednode)來完成項目。
+- Clone <a href="https://github.com/freeCodeCamp/boilerplate-advancednode/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete these challenges locally.
+- Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-advancednode" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete these challenges.
 - 使用一個你選擇的站點生成器來完成項目。 需要確定包含了我們 GitHub 倉庫的所有文件。
 
 完成本項目後，請將一個正常運行的 demo（項目演示）託管在可以公開訪問的平臺。 然後在 `Solution Link` 框中提交你的項目 URL。
 
 你可以在應用的模版引擎中使用靜態模板文件（如那些寫在 *Pug* 裏的）。 在運行時，模版引擎會用服務端的真實數據替換掉模版文件中的變量， 然後將模版轉譯成發送給客戶端的 HTML 靜態文件。 這樣可以輕鬆地構造 HTML 頁面，允許在頁面直接顯示變量內容而不需要從客戶端發送 API 請求。
 
-在 `package.json` 文件中添加依賴 `pug@~3.0.0`。
+`pug@~3.0.0` has already been installed, and is listed as a dependency in your `package.json` file.
 
 Express 需要知道你正在使用哪個模板引擎。 我們將使用 `set` 方法來分配 `pug` 作爲 `view engine` 屬性的值： `app.set('view engine', 'pug')`。
 
-在正確渲染 `views/pug` 目錄中的索引文件之後，加載頁面。
+Your page will be blank until you correctly render the index file in the `views/pug` directory.
 
-修改 `/` 路由中 `res.render()` 聲明的參數爲 `views/pug` 目錄的文件路徑。 這個路徑可以是相對路徑（相對於 views），也可以是絕對路徑，不需要文件擴展。
+To render the `pug` template, you need to use `res.render()` in the `/` route. Pass the file path to the `views/pug` directory as the argument to the method. The path can be a relative path (relative to views), or an absolute path, and does not require a file extension.
 
-如果一切順利，那麼你的應用主頁不會再顯示信息 “`Pug template is not defined.`”，而是會顯示一個信息表明你已經成功渲染 Pug 模版！
+If all went as planned, your app home page will no longer be blank and will display a message indicating you've successfully rendered the Pug template!
 
-完成以上要求後，請提交你的頁面鏈接。 如果你遇到問題，可以查看[這裏](https://gist.github.com/camperbot/3515cd676ea4dfceab4e322f59a37791)的答案。
+完成以上要求後，請提交你的頁面鏈接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/3515cd676ea4dfceab4e322f59a37791" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/set-up-passport.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/set-up-passport.md
index dc4a0805bc5..55f6d64fbfb 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/set-up-passport.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/set-up-passport.md
@@ -8,15 +8,13 @@ dashedName: set-up-passport
 
 # --description--
 
-現在我們來創建 *Passport*，最終我們需要用它來實現用戶註冊和登錄。 除了 Passport，我們還會用 Express-session 來處理 session（會話）。 在客戶端，我們可以用這個中間件把 session id 儲存到 cookie。同時，我們可以在服務器上通過這個 id 訪問 session 數據。 通過這種方式，我們無需把用戶的個人賬號信息存到 cookie，來完成用戶的驗證。只需要用這個 id 作爲 *key* 來訪問服務器上用戶的數據即可。
+現在我們來創建 *Passport*，最終我們需要用它來實現用戶註冊和登錄。 除了 Passport，我們還會用 Express-session 來處理 session（會話）。 Express-session has a ton of advanced features you can use, but for now we're just going to use the basics! Using this middleware saves the session id as a cookie in the client and allows us to access the session data using that id on the server. This way we keep personal account information out of the cookie used by the client to verify to our server they are authenticated and just keep the *key* to access the data stored on the server.
 
-爲了在你的項目中使用 Passport，首先你需要在 package.json 文件中添加依賴： `passport@~0.4.1`
+`passport@~0.4.1` and `express-session@~1.17.1` are already installed, and are both listed as dependencies in your `package.json` file.
 
-此外，還需要添加 Express-session 作爲依賴。 Express-session 有許多高級特性，但我們暫時只需要瞭解其基礎功能。 `express-session@~1.17.1`
+You will need to set up the session settings now and initialize Passport. Be sure to first create the variables 'session' and 'passport' to require 'express-session' and 'passport' respectively.
 
-現在，我們需要配置 session 並初始化 Passport。 請先創建變量 “session” 和 “passport” 來分別引入 “express-session” 和 “passport”。
-
-爲了讓 express 應用可以使用 session，我們需要添加一些基礎選項。 請在 .env 文件中添加字段 “SESSION_SECRET”，並給它賦一個隨機值， 便於加密 cookie、計算哈希。
+To set up your express app to use the session we'll define just a few basic options. Be sure to add 'SESSION_SECRET' to your .env file and give it a random value. This is used to compute the hash used to encrypt your cookie!
 
 ```js
 app.use(session({
@@ -27,13 +25,13 @@ app.use(session({
 }));
 ```
 
-還有，我們需要讓 express **使用** “passport.initialize()” 和 “passport.session()”。 （例如，`app.use(passport.initialize());`）。
+As well you can go ahead and tell your express app to **use** 'passport.initialize()' and 'passport.session()'. (For example, `app.use(passport.initialize());`)
 
-完成上述要求後，請提交你的頁面鏈接。 如果你遇到了問題，可以參考[這裏](https://gist.github.com/camperbot/4068a7662a2f9f5d5011074397d6788c)的答案。
+Submit your page when you think you've got it right. If you're running into errors, you can <a href="https://gist.github.com/camperbot/4068a7662a2f9f5d5011074397d6788c" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
-應添加 Passort 和 express-session 作爲依賴。
+Passport and Express-session should be dependencies.
 
 ```js
 (getUserInput) =>
@@ -57,7 +55,7 @@ app.use(session({
   );
 ```
 
-依賴應正確引入。
+Dependencies should be correctly required.
 
 ```js
 (getUserInput) =>
@@ -80,7 +78,7 @@ app.use(session({
   );
 ```
 
-Express app 可以使用新的依賴。
+Express app should use new dependencies.
 
 ```js
 (getUserInput) =>
@@ -103,7 +101,7 @@ Express app 可以使用新的依賴。
   );
 ```
 
-應正確設置 session 和 session secret。
+Session and session secret should be correctly set up.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md
index f313aa1a121..9b779f41eac 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md
@@ -10,7 +10,7 @@ dashedName: set-up-the-environment
 
 在接下來的挑戰中，我們將會用到 `chat.pug` 文件。 首先，在你的 `routes.js` 文件中爲 `/chat` 添加一個處理 GET 請求的路由，並給它傳入 `ensureAuthenticated`。在回調函數中，我們需要讓它渲染 `chat.pug` 文件，並在響應中包含 `{ user: req.user }` 信息。 現在，請修改 `/auth/github/callback` 路由，讓它可以像這樣設置 user_id：`req.session.user_id = req.user.id`，並在設置完成後重定向至 `/chat`。
 
-添加 `socket.io@~2.3.0` 作爲依賴項，並且在你的服務器中和 `http` （內置在 Nodejs 中）一起導入/實例化。具體如下：
+`socket.io@~2.3.0` has already been added as a dependency, so require/instantiate it in your server as follows with `http` (comes built-in with Nodejs):
 
 ```javascript
 const http = require('http').createServer(app);
@@ -19,7 +19,7 @@ const io = require('socket.io')(http);
 
 現在我們的 *express 應用*已經包含了 *http* 服務，接下來我們需要監聽 *http* 服務的事件。 爲此，我們需要把 `app.listen` 更新爲 `http.listen`。
 
-需要處理的第一件事是監聽客戶端的新連接。 <dfn>on</dfn> 關鍵字就是監聽這個特定事件。 它需要 2 個參數：一個包含所發出事件標題的字符串，以及一個用於傳遞數據的函數。 在連接監聽器中，我們用 *socket* 來代表它所包含的數據。 socket 就是指已連接到服務器的客戶端。
+需要處理的第一件事是監聽客戶端的新連接。 <dfn>on</dfn> 關鍵字就是監聽這個特定事件。 It requires 2 arguments: a string containing the title of the event that's emitted, and a function with which the data is passed through. 在連接監聽器中，我們用 *socket* 來代表它所包含的數據。 socket 就是指已連接到服務器的客戶端。
 
 爲了可以監聽服務器的連接事件，我們在數據庫連接的部分加入如下代碼：
 
@@ -42,7 +42,7 @@ let socket = io();
 
 **注意：**只有在連接到處於同一個 url/server 上的 socket 時，`io()`纔可以正常執行。 如果需要連接到外部的 socket，就需要這樣調用：`io.connect('URL');`。
 
-完成上述要求後，請提交你的頁面鏈接。 如果你遇到了問題，可以參考[這裏](https://gist.github.com/camperbot/aae41cf59debc1a4755c9a00ee3859d1)的答案。
+完成上述要求後，請提交你的頁面鏈接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/aae41cf59debc1a4755c9a00ee3859d1" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md
index dc3b522e950..cce5575a5af 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md
@@ -12,19 +12,43 @@ dashedName: use-a-template-engines-powers
 
 在 Pug 文件中，你可以用變量名來調用變量，比如寫成 `#{variable_name}` 來實現行內調用，或像 `p=variable_name` 把元素與變量直接寫在一起，這表示 p 元素的內容等價於這個變量。
 
-建議大家在 [Pug 的 README](https://github.com/pugjs/pug) 裏看看它的語法和用法，這樣你寫出的代碼會相對簡練。 另外要注意，Pug 使用縮進來表示嵌套的代碼塊。
+ Pug is all about using whitespace and tabs to show nested elements and cutting down on the amount of code needed to make a beautiful site. Read the Pug documentation for more information on usage and syntax.
 
-在 pug 的 'index.pug' 文件中，我們使用了 *title* 和 *message* 兩個變量。
+ Here is an example:
 
-爲了從服務器傳遞這些信息，你需要給 *res.render* 的第二個參數傳入一個對象，其中包含變量對應的值。 比如，如果你想傳遞對象 `{title: 'Hello', message: 'Please login'}` 到你的主頁，
+ ```html
+ <!--Typing this using Pug-->
+ head
+    script(type='text/javascript').
+      if (foo) bar(1 + 5);
+  body
+    if youAreUsingPug
+        p You are amazing
+      else
+        p Get on it!
 
-看起來應該像這樣：`res.render(process.cwd() + '/views/pug/index', {title: 'Hello', message: 'Please login'});`。現在刷新頁面，你應該看到那些值就像在 index.pug 文件中一樣被渲染在頁面上正確的位置。
+<!--will lead to creating this code-->
+  <head>
+    <script type="text/javascript">
+      if (foo) bar(1 + 5);
+    </script>
+  </head>
+  <body>
+    <p>You are amazing</p>
+  </body>
+  ```
 
-完成上述要求後，請提交你的頁面鏈接。 如果你遇到了問題，可以參考 [這裏](https://gist.github.com/camperbot/4af125119ed36e6e6a8bb920db0c0871) 的答案。
+Looking at our pug file `index.pug` included in your project, we used the variables `title` and `message`.
+
+To pass those along from our server, you will need to add an object as a second argument to your `res.render` with the variables and their values. For example, pass this object along setting the variables for your index view: `{title: 'Hello', message: 'Please login'}`
+
+It should look like: `res.render(process.cwd() + '/views/pug/index', {title: 'Hello', message: 'Please login'});` Now refresh your page and you should see those values rendered in your view in the correct spot as laid out in your `index.pug` file!
+
+Submit your page when you think you've got it right. If you're running into errors, you can check out the <a href="https://gist.github.com/camperbot/4af125119ed36e6e6a8bb920db0c0871" target="_blank" rel="noopener noreferrer nofollow">project completed up to this point</a>.
 
 # --hints--
 
-Pug 應正確地展示變量。
+Pug should correctly render variables.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md
index 3ce660a170c..72465c4f868 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md
@@ -8,7 +8,7 @@ dashedName: assert-deep-equality-with--deepequal-and--notdeepequal
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>  or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `deepEqual()` 斷言兩個對象是否深度相等。
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/compare-the-properties-of-two-elements.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/compare-the-properties-of-two-elements.md
index a65e2471ad2..107b249b8de 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/compare-the-properties-of-two-elements.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/compare-the-properties-of-two-elements.md
@@ -8,15 +8,15 @@ dashedName: compare-the-properties-of-two-elements
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 # --instructions--
 
-在 `tests/1_unit-tests.js` 中，在標有 `#8` 的 `Comparisons` 套件裏，將每個 `assert` 改成 `assert.isAbove` 或 `assert.isAtMost` 方法，讓測試通過（結果應該返回 `true`）。 不要改變傳入斷言的參數。
+Within `tests/1_unit-tests.js` under the test labelled `#8` in the `Comparisons` suite, change each `assert` to either `assert.isAbove` or `assert.isAtMost` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
 
 # --hints--
 
-不應有未通過的測試
+All tests should pass.
 
 ```js
 (getUserInput) =>
@@ -30,7 +30,7 @@ dashedName: compare-the-properties-of-two-elements
   );
 ```
 
-請爲第一個斷言選擇正確的方法 — `isAbove` 或 `isAtMost`。
+You should choose the correct method for the first assertion - `isAbove` vs. `isAtMost`.
 
 ```js
 (getUserInput) =>
@@ -48,7 +48,7 @@ dashedName: compare-the-properties-of-two-elements
   );
 ```
 
-請爲第二個斷言選擇正確的方法 — `isAbove` 或 `isAtMost`。
+You should choose the correct method for the second assertion - `isAbove` vs. `isAtMost`.
 
 ```js
 (getUserInput) =>
@@ -62,7 +62,7 @@ dashedName: compare-the-properties-of-two-elements
   );
 ```
 
-請爲第三個斷言選擇正確的方法 — `isAbove` 或 `isAtMost`。
+You should choose the correct method for the third assertion - `isAbove` vs. `isAtMost`.
 
 ```js
 (getUserInput) =>
@@ -80,7 +80,7 @@ dashedName: compare-the-properties-of-two-elements
   );
 ```
 
-請爲第四個斷言選擇正確的方法 — `isAbove` 或 `isAtMost`。
+You should choose the correct method for the fourth assertion - `isAbove` vs. `isAtMost`.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/learn-how-javascript-assertions-work.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/learn-how-javascript-assertions-work.md
index 2e8e5a94839..71b7099db8c 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/learn-how-javascript-assertions-work.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/learn-how-javascript-assertions-work.md
@@ -10,8 +10,8 @@ dashedName: learn-how-javascript-assertions-work
 
 你可以採用下面的任意一種方式完成這些挑戰：
 
-- 克隆[這個 GitHub 倉庫](https://github.com/freeCodeCamp/boilerplate-mochachai/)並在本地完成項目。
-- 使用[我們的 Replit 上的初始化項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)來完成項目。
+- Clone <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete these challenges locally.
+- Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete these challenges.
 - 使用一個你喜歡的站點生成器來完成項目。 需要確定包含了我們 GitHub 倉庫的所有文件。
 
 完成本項目後，請將一個正常運行的 demo（項目演示）託管在可以公開訪問的平臺。 然後在 `Solution Link` 框中提交你的項目 URL。
diff --git a/curriculum/challenges/chinese-traditional/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/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iii---put-method.md
index 71ede243843..9995cdeb83d 100644
--- a/curriculum/challenges/chinese-traditional/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/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iii---put-method.md
@@ -8,7 +8,7 @@ dashedName: run-functional-tests-on-an-api-response-using-chai-http-iii---put-me
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 當你測試一個 `PUT` 請求時，你經常會隨同它一起發送數據。 你在 `PUT` 請求中包含的數據被稱爲請求的主體。
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iv---put-method.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iv---put-method.md
index f79a74e2244..d556982e11e 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iv---put-method.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iv---put-method.md
@@ -8,7 +8,7 @@ dashedName: run-functional-tests-on-an-api-response-using-chai-http-iv---put-met
 
 # --description--
 
-請注意，本項目在 [這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai) 的基礎上進行開發。你也可以從 [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 這個練習與上一個類似。
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http-ii.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http-ii.md
index 48251c3a748..f2a580bd225 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http-ii.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http-ii.md
@@ -8,7 +8,7 @@ dashedName: run-functional-tests-on-api-endpoints-using-chai-http-ii
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http.md
index 207471c9c25..858d3f856d8 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http.md
@@ -8,7 +8,7 @@ dashedName: run-functional-tests-on-api-endpoints-using-chai-http
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 Mocha 允許你使用名爲 `chai-http` 的插件測試異步操作，例如調用 API 端點。
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser-ii.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser-ii.md
index f9cef3d4a71..8ee00251c2f 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser-ii.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser-ii.md
@@ -8,11 +8,11 @@ dashedName: run-functional-tests-using-a-headless-browser-ii
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 # --instructions--
 
-在 `tests/2_functional-tests.js` 中，在 `'Submit the surname "Vespucci" in the HTML form'` 測試（`// #5`），自動執行以下操作：
+Within `tests/2_functional-tests.js`, in the `'Submit the surname "Vespucci" in the HTML form'` test (`// #6`), automate the following:
 
 1.  在表格中填寫姓氏 `Vespucci`。
 2.  點擊提交按鈕
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser.md
index b7ecb5c9663..a4d9b7014e9 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser.md
@@ -8,7 +8,7 @@ dashedName: run-functional-tests-using-a-headless-browser
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 在頁面上有一個輸入表單。 它將數據作爲 AJAX 請求發送到 `PUT /travellers` 端點。
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/simulate-actions-using-a-headless-browser.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/simulate-actions-using-a-headless-browser.md
index 10c84675e02..3d73b5e4b91 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/simulate-actions-using-a-headless-browser.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/simulate-actions-using-a-headless-browser.md
@@ -7,7 +7,7 @@ dashedName: simulate-actions-using-a-headless-browser
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 在接下來的挑戰中，你將使用無頭瀏覽器模擬人類與頁面的交互。
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-for-truthiness.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-for-truthiness.md
index 55ea9d8a5f1..120fbb97114 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-for-truthiness.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-for-truthiness.md
@@ -8,7 +8,7 @@ dashedName: test-for-truthiness
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `isTrue()` 僅當給出的值爲 Boolean 的 `true` 時可以通過測試；`isNotTrue()` 則會在給出除 `true` 以外的值時通過測試。
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-string-contains-a-substring.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-string-contains-a-substring.md
index 9e94ebe58c9..23b356d6daa 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-string-contains-a-substring.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-string-contains-a-substring.md
@@ -8,7 +8,7 @@ dashedName: test-if-a-string-contains-a-substring
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `include()` 和 `notInclude()` 同樣可以用於字符串。 `include()` 用於斷言字符串中包含某個子字符串。
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-falls-within-a-specific-range.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-falls-within-a-specific-range.md
index 8bf27780278..91aaf87b3e2 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-falls-within-a-specific-range.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-falls-within-a-specific-range.md
@@ -8,7 +8,7 @@ dashedName: test-if-a-value-falls-within-a-specific-range
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 ```javascript
 .approximately(actual, expected, delta, [message])
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-a-string.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-a-string.md
index 7a7ba1db000..039a43e37c8 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-a-string.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-a-string.md
@@ -8,7 +8,7 @@ dashedName: test-if-a-value-is-a-string
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `isString` 或 `isNotString` 斷言一個值是否爲字符串。
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-of-a-specific-data-structure-type.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-of-a-specific-data-structure-type.md
index b877f7a1096..b9179db3dd9 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-of-a-specific-data-structure-type.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-of-a-specific-data-structure-type.md
@@ -8,7 +8,7 @@ dashedName: test-if-a-value-is-of-a-specific-data-structure-type
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `#typeOf` 斷言一個值的類型符合給定的類型，這個類型與 `Object.prototype.toString` 一致。
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-variable-or-function-is-defined.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-variable-or-function-is-defined.md
index 2f5e0fc4e89..f983bf4b262 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-variable-or-function-is-defined.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-variable-or-function-is-defined.md
@@ -8,7 +8,7 @@ dashedName: test-if-a-variable-or-function-is-defined
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-array-contains-an-item.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-array-contains-an-item.md
index 3dbb1278126..3aef8eaa9b0 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-array-contains-an-item.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-array-contains-an-item.md
@@ -8,7 +8,7 @@ dashedName: test-if-an-array-contains-an-item
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-has-a-property.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-has-a-property.md
index 7207a75531f..da6a59a3d90 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-has-a-property.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-has-a-property.md
@@ -8,7 +8,7 @@ dashedName: test-if-an-object-has-a-property
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `property` 斷言一個對象含有給定屬性。
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-is-an-instance-of-a-constructor.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-is-an-instance-of-a-constructor.md
index 51698b42b75..407a4a415d0 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-is-an-instance-of-a-constructor.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-is-an-instance-of-a-constructor.md
@@ -8,7 +8,7 @@ dashedName: test-if-an-object-is-an-instance-of-a-constructor
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `#instanceOf` 斷言一個對象是一個構造器的實例。
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-one-value-is-below-or-at-least-as-large-as-another.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-one-value-is-below-or-at-least-as-large-as-another.md
index d0e487cb16d..601d7496b65 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-one-value-is-below-or-at-least-as-large-as-another.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-one-value-is-below-or-at-least-as-large-as-another.md
@@ -8,7 +8,7 @@ dashedName: test-if-one-value-is-below-or-at-least-as-large-as-another
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/use-assert.isok-and-assert.isnotok.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/use-assert.isok-and-assert.isnotok.md
index 8f94593f41d..8583e4d2ee7 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/use-assert.isok-and-assert.isnotok.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/use-assert.isok-and-assert.isnotok.md
@@ -8,11 +8,11 @@ dashedName: use-assert-isok-and-assert-isnotok
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `isOk()` 用來測試值是否爲真值，`isNotOk()` 用來測試值是否爲假值。
 
-可以在[過濾數組中的假值](https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer)這個挑戰中瞭解更多關於真值和假值的信息。
+To learn more about truthy and falsy values, try our <a href="https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer" target="_blank" rel="noopener noreferrer nofollow">Falsy Bouncer</a> challenge.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/use-regular-expressions-to-test-a-string.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/use-regular-expressions-to-test-a-string.md
index 348b3bdc887..659ba631dd9 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/use-regular-expressions-to-test-a-string.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/use-regular-expressions-to-test-a-string.md
@@ -8,7 +8,7 @@ dashedName: use-regular-expressions-to-test-a-string
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `match()` 斷言一個值匹配一個正則表達式（第二個參數）。
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-double-equals-to-assert-equality.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-double-equals-to-assert-equality.md
index fc4f563ca49..e7ee1a318bd 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-double-equals-to-assert-equality.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-double-equals-to-assert-equality.md
@@ -8,7 +8,7 @@ dashedName: use-the-double-equals-to-assert-equality
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `equal()` 使用 `==` 比較對象。
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-triple-equals-to-assert-strict-equality.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-triple-equals-to-assert-strict-equality.md
index 11b87ed3737..39bbff495fa 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-triple-equals-to-assert-strict-equality.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-triple-equals-to-assert-strict-equality.md
@@ -8,7 +8,7 @@ dashedName: use-the-triple-equals-to-assert-strict-equality
 
 # --description--
 
-請注意，本項目在[這個 Replit 項目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基礎上進行開發。你也可以從 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `strictEqual()` 使用 `===` 比較對象。
 
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-projects/american-british-translator.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-projects/american-british-translator.md
index e245dc28ed8..2d9443effcd 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-projects/american-british-translator.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-projects/american-british-translator.md
@@ -8,10 +8,10 @@ dashedName: american-british-translator
 
 # --description--
 
-構建一個 JavaScript 的全棧應用，在功能上與這個應用相似：<https://american-british-translator.freecodecamp.rocks/>。 可以採用下面的任意一種方式完成這個挑戰：
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://american-british-translator.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://american-british-translator.freecodecamp.rocks/</a>. 可以採用下面的任意一種方式完成這個挑戰：
 
--   克隆 [這個 GitHub 倉庫](https://github.com/freeCodeCamp/boilerplate-project-american-british-english-translator/) 並在本地完成項目。
--   使用[我們的 Replit 初始化項目](https://replit.com/github/freeCodeCamp/boilerplate-project-american-british-english-translator)來完成你的項目。
+-   Clone <a href="https://github.com/freeCodeCamp/boilerplate-project-american-british-english-translator/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete your project locally.
+-   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-american-british-english-translator" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 -   使用您選擇的站點生成器來完成項目。 並確保包含了我們 GitHub 倉庫的所有文件。
 
 當完成本項目，請確認有一個可以公開訪問的正常運行 demo 。 然後將 URL 提交到 `Solution Link` 中。 此外，還可以將項目的源碼提交到 `GitHub Link` 中。
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-projects/issue-tracker.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-projects/issue-tracker.md
index 9db42401462..e1096893573 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-projects/issue-tracker.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-projects/issue-tracker.md
@@ -8,10 +8,10 @@ dashedName: issue-tracker
 
 # --description--
 
-構建一個 JavaScript 的全棧應用，在功能上與這個應用相似： <https://issue-tracker.freecodecamp.rocks/>。 可以採用下面的任意一種方式完成這個挑戰：
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://issue-tracker.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://issue-tracker.freecodecamp.rocks/</a>. 可以採用下面的任意一種方式完成這個挑戰：
 
--   克隆 [GitHub 倉庫](https://github.com/freeCodeCamp/boilerplate-project-issuetracker/) 並在本地完成你的項目。
--   使用[我們的 Replit 初始化項目](https://replit.com/github/freeCodeCamp/boilerplate-project-issuetracker)來完成你的項目。
+-   Clone <a href="https://github.com/freeCodeCamp/boilerplate-project-issuetracker/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete your project locally.
+-   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-issuetracker" target="_blank" rel="noopener noreferrer nofollow">this Replit starter project</a> to complete your project.
 -   使用一個你喜歡的站點生成器來完成項目。 需要確定包含了我們 GitHub 倉庫的所有文件。
 
 完成本項目後，請將一個正常運行的 demo（項目演示）託管在可以公開訪問的平臺。 然後在 `Solution Link` 框中提交你的項目 URL。 此外，還可以將項目的源碼提交到 `GitHub Link` 中。
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-projects/metric-imperial-converter.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-projects/metric-imperial-converter.md
index 3c1f724eb0d..6a3f006a885 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-projects/metric-imperial-converter.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-projects/metric-imperial-converter.md
@@ -8,10 +8,10 @@ dashedName: metric-imperial-converter
 
 # --description--
 
-構建一個 JavaScript 的全棧應用，在功能上與這個應用相似：<https://metric-imperial-converter.freecodecamp.rocks/>。 可以採用下面的任意一種方式完成這個挑戰：
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://metric-imperial-converter.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://metric-imperial-converter.freecodecamp.rocks/</a>. 可以採用下面的任意一種方式完成這個挑戰：
 
-- 克隆 [GitHub 倉庫](https://github.com/freeCodeCamp/boilerplate-project-metricimpconverter/) 並在本地完成你的項目。
-- 使用[我們的 Replit 初始化項目](https://replit.com/github/freeCodeCamp/boilerplate-project-metricimpconverter)來完成你的項目。
+- Clone <a href="https://github.com/freeCodeCamp/boilerplate-project-metricimpconverter/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete your project locally.
+- Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-metricimpconverter" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 - 使用一個你喜歡的站點生成器來完成項目。 需要確定包含了我們 GitHub 倉庫的所有文件。
 
 完成本項目後，請將一個正常運行的 demo（項目演示）託管在可以公開訪問的平臺。 然後在 `Solution Link` 框中提交你的項目 URL。 此外，還可以將項目的源碼提交到 `GitHub Link` 中。
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-projects/personal-library.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-projects/personal-library.md
index 691d7124655..f9e2f97afda 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-projects/personal-library.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-projects/personal-library.md
@@ -8,10 +8,10 @@ dashedName: personal-library
 
 # --description--
 
-構建一個 JavaScript 的全棧應用，在功能上與這個應用相似：<https://personal-library.freecodecamp.rocks/>。 可以採用下面的任意一種方式完成這個挑戰：
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://personal-library.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://personal-library.freecodecamp.rocks/</a>. 可以採用下面的任意一種方式完成這個挑戰：
 
--   克隆 [這個 GitHub 倉庫](https://github.com/freeCodeCamp/boilerplate-project-library) 並在本地完成項目。
--   使用[我們的 Replit 初始化項目](https://replit.com/github/freeCodeCamp/boilerplate-project-library)來完成你的項目。
+-   Clone <a href="https://github.com/freeCodeCamp/boilerplate-project-library" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete your project locally.
+-   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-library" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 -   使用一個你喜歡的站點生成器來完成項目。 需要確定包含了我們 GitHub 倉庫的所有文件。
 
 完成本項目後，請將一個正常運行的 demo（項目演示）託管在可以公開訪問的平臺。 然後在 `Solution Link` 框中提交你的項目 URL。 此外，還可以將項目的源碼提交到 `GitHub Link` 中。
diff --git a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-projects/sudoku-solver.md b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-projects/sudoku-solver.md
index b5fa2049789..0f91eb2a6b4 100644
--- a/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-projects/sudoku-solver.md
+++ b/curriculum/challenges/chinese-traditional/06-quality-assurance/quality-assurance-projects/sudoku-solver.md
@@ -8,10 +8,10 @@ dashedName: sudoku-solver
 
 # --description--
 
-構建一個 JavaScript 的全棧應用，在功能上與這個應用相似：<https://sudoku-solver.freecodecamp.rocks/>。 可以採用下面的任意一種方式完成這個挑戰：
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://sudoku-solver.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://sudoku-solver.freecodecamp.rocks/</a>. 可以採用下面的任意一種方式完成這個挑戰：
 
--   克隆 [GitHub 倉庫](https://github.com/freecodecamp/boilerplate-project-sudoku-solver) 並在本地完成你的項目。
--   使用[我們的 Replit 初始化項目](https://replit.com/github/freeCodeCamp/boilerplate-project-sudoku-solver)來完成你的項目。
+-   Clone <a href="https://github.com/freecodecamp/boilerplate-project-sudoku-solver" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete your project locally.
+-   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-sudoku-solver" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 -   使用一個你喜歡的站點生成器來完成項目。 需要確定包含了我們 GitHub 倉庫的所有文件。
 
 完成本項目後，請將一個正常運行的 demo（項目演示）託管在可以公開訪問的平臺。 然後在 `Solution Link` 框中提交你的項目 URL。 此外，還可以將項目的源碼提交到 `GitHub Link` 中。
@@ -270,7 +270,7 @@ async (getUserInput) => {
 };
 ```
 
-如果提交給 `/api/check` 的對象缺失 `puzzle`、`coordinate` 或 `value`，返回的值將是 `{ error: Required field(s) missing }`
+If the object submitted to `/api/check` is missing `puzzle`, `coordinate` or `value`, the returned value will be `{ error: 'Required field(s) missing' }`
 
 ```js
 async (getUserInput) => {
@@ -324,7 +324,7 @@ async (getUserInput) => {
 };
 ```
 
-如果提交給 `/api/check` 的 `value` 不是一個介於 1 到 9 之間的數字，則返回的值將是 `{ error: 'Invalid value' }`
+If the `value` submitted to `/api/check` is not a number between 1 and 9, the returned value will be `{ error: 'Invalid value' }`
 
 ```js
 async (getUserInput) => {
@@ -353,9 +353,11 @@ async (getUserInput) => {
   try {
     const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
     assert.isArray(getTests);
-    const units = getTests.filter((el) => el.context.includes('UnitTests'));
-    assert.isAtLeast(units.length, 12, 'At least 12 tests passed');
-    units.forEach((test) => {
+    const unitTests = getTests.filter((test) => {
+      return !!test.context.match(/Unit\s*Tests/gi);
+    });
+    assert.isAtLeast(unitTests.length, 12, 'At least 12 tests passed');
+    unitTests.forEach((test) => {
       assert.equal(test.state, 'passed', 'Test in Passed State');
       assert.isAtLeast(
         test.assertions.length,
@@ -369,18 +371,18 @@ async (getUserInput) => {
 };
 ```
 
-所有 14 項功能測試都已完成並通過。 請參閱 `/tests/2_functional-tests.js` 來了解你應該編寫的測試的功能。
+所有 14 項功能測試都已完成並通過。 See `/tests/2_functional-tests.js` for the expected functionality you should write tests for.
 
 ```js
 async (getUserInput) => {
   try {
     const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
     assert.isArray(getTests);
-    const funcs = getTests.filter((el) =>
-      el.context.includes('Functional Tests')
-    );
-    assert.isAtLeast(funcs.length, 14, 'At least 14 tests passed');
-    funcs.forEach((test) => {
+    const functTests = getTests.filter((test) => {
+      return !!test.context.match(/Functional\s*Tests/gi);
+    });
+    assert.isAtLeast(functTests.length, 14, 'At least 14 tests passed');
+    functTests.forEach((test) => {
       assert.equal(test.state, 'passed', 'Test in Passed State');
       assert.isAtLeast(
         test.assertions.length,
diff --git a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md
index e6ca1518b38..0b07afe3d2f 100644
--- a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md
+++ b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md
@@ -14,7 +14,7 @@ dashedName: build-your-own-functions
 
 更多資源
 
-\- [練習](https://www.youtube.com/watch?v=ksvGhDsjtpw)
+\- <a href="https://www.youtube.com/watch?v=ksvGhDsjtpw" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md
index 5405d9d9ed9..8e2e171ac25 100644
--- a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md
+++ b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md
@@ -14,7 +14,7 @@ dashedName: comparing-and-sorting-tuples
 
 更多資源：
 
-\- [練習](https://www.youtube.com/watch?v=EhQxwzyT16E)
+\- <a href="https://www.youtube.com/watch?v=EhQxwzyT16E" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/data-visualization-mailing-lists.md b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/data-visualization-mailing-lists.md
index 22ce778b6ef..da1898ddba0 100644
--- a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/data-visualization-mailing-lists.md
+++ b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/data-visualization-mailing-lists.md
@@ -14,19 +14,19 @@ dashedName: data-visualization-mailing-lists
 
 更多資源：
 
-\- [練習：Geodata](https://www.youtube.com/watch?v=KfhslNzopxo)
+\- <a href="https://www.youtube.com/watch?v=KfhslNzopxo" target="_blank" rel="noopener noreferrer nofollow">練習：Geodata</a>
 
-\- [練習：Gmane 模型](https://www.youtube.com/watch?v=wSpl1-7afAk)
+\- <a href="https://www.youtube.com/watch?v=wSpl1-7afAk" target="_blank" rel="noopener noreferrer nofollow">練習：Gmane 模型</a>
 
-\- [練習：Gmane Spider](https://www.youtube.com/watch?v=H3w4lOFBUOI)
+\- <a href="https://www.youtube.com/watch?v=H3w4lOFBUOI" target="_blank" rel="noopener noreferrer nofollow">Exercise: Gmane Spider</a>
 
-\- [練習：Gmane Viz](https://www.youtube.com/watch?v=LRqVPMEXByw)
+\- <a href="https://www.youtube.com/watch?v=LRqVPMEXByw" target="_blank" rel="noopener noreferrer nofollow">Exercise: Gmane Viz</a>
 
-\- [練習：Page Rank](https://www.youtube.com/watch?v=yFRAZBkBDBs)
+\- <a href="https://www.youtube.com/watch?v=yFRAZBkBDBs" target="_blank" rel="noopener noreferrer nofollow">Exercise: Page Rank</a>
 
-\- [練習：Page Spider](https://www.youtube.com/watch?v=sXedPQ_AnWA)
+\- <a href="https://www.youtube.com/watch?v=sXedPQ_AnWA" target="_blank" rel="noopener noreferrer nofollow">Exercise: Page Spider</a>
 
-\- [練習: Page Viz](https://www.youtube.com/watch?v=Fm0hpkxsZoo)
+\- <a href="https://www.youtube.com/watch?v=Fm0hpkxsZoo" target="_blank" rel="noopener noreferrer nofollow">Exercise: Page Viz</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/dictionaries-and-loops.md b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/dictionaries-and-loops.md
index e4337d2cfb6..a095df2bf0a 100644
--- a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/dictionaries-and-loops.md
+++ b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/dictionaries-and-loops.md
@@ -14,7 +14,7 @@ dashedName: dictionaries-and-loops
 
 更多資源：
 
-\- [練習](https://www.youtube.com/watch?v=PrhZ9qwBDD8)
+\- <a href="https://www.youtube.com/watch?v=PrhZ9qwBDD8" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md
index 7abcb0ab6c3..cdc943a7645 100644
--- a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md
+++ b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md
@@ -14,7 +14,7 @@ dashedName: files-as-a-sequence
 
 更多資源：
 
-\- [練習](https://www.youtube.com/watch?v=il1j4wkte2E)
+\- <a href="https://www.youtube.com/watch?v=il1j4wkte2E" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md
index 607b6415b93..4e613551868 100644
--- a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md
+++ b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md
@@ -14,9 +14,9 @@ dashedName: intermediate-expressions
 
 更多資源：
 
-\- [練習 1](https://youtu.be/t_4DPwsaGDY)
+\- <a href="https://youtu.be/t_4DPwsaGDY" target="_blank" rel="noopener noreferrer nofollow">Exercise 1</a>
 
-\- [練習 2](https://youtu.be/wgkC8SxraAQ)
+\- <a href="https://youtu.be/wgkC8SxraAQ" target="_blank" rel="noopener noreferrer nofollow">Exercise 2</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/intermediate-strings.md b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/intermediate-strings.md
index 606b9bf5abb..8c409de6303 100644
--- a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/intermediate-strings.md
+++ b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/intermediate-strings.md
@@ -14,7 +14,7 @@ dashedName: intermediate-strings
 
 更多資料：
 
-[練習](https://www.youtube.com/watch?v=1bSqHot-KwE)
+\- <a href="https://www.youtube.com/watch?v=1bSqHot-KwE" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md
index 2f13ffc8b4f..2d969304655 100644
--- a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md
+++ b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md
@@ -18,9 +18,9 @@ dashedName: introduction-why-program
 
 更多資源：
 
-\- [Windows 系統安裝 Python](https://youtu.be/F7mtLrYzZP8)
+\- <a href="https://youtu.be/F7mtLrYzZP8" target="_blank" rel="noopener noreferrer nofollow">Install Python on Windows</a>
 
-\- [MacOS 系統安裝 Python](https://youtu.be/wfLnZP-4sZw)
+\- <a href="https://youtu.be/wfLnZP-4sZw" target="_blank" rel="noopener noreferrer nofollow">Install Python on MacOS</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md
index 8f80966ed50..9ba8ebf3f61 100644
--- a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md
+++ b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md
@@ -14,7 +14,7 @@ dashedName: iterations-more-patterns
 
 更多資源：
 
-\- [練習](https://www.youtube.com/watch?v=kjxXZQw0uPg)
+\- <a href="https://www.youtube.com/watch?v=kjxXZQw0uPg" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md
index 6d492b14707..82f39b31fed 100644
--- a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md
+++ b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md
@@ -14,9 +14,9 @@ dashedName: more-conditional-structures
 
 更多資源：
 
-\- [練習 1](https://www.youtube.com/watch?v=crLerB4ZxMI)
+\- <a href="https://www.youtube.com/watch?v=crLerB4ZxMI" target="_blank" rel="noopener noreferrer nofollow">Exercise 1</a>
 
-\- [練習 2](https://www.youtube.com/watch?v=KJN3-7HH6yk)
+\- <a href="https://www.youtube.com/watch?v=KJN3-7HH6yk" target="_blank" rel="noopener noreferrer nofollow">Exercise 2</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md
index a140c9b601e..ee0b5294818 100644
--- a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md
+++ b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md
@@ -14,11 +14,11 @@ dashedName: networking-web-scraping-with-python
 
 更多資料：
 
-\- [練習：socket1](https://www.youtube.com/watch?v=dWLdI143W-g)
+\- <a href="https://www.youtube.com/watch?v=dWLdI143W-g" target="_blank" rel="noopener noreferrer nofollow">Exercise: socket1</a>
 
-\- [練習：urllib](https://www.youtube.com/watch?v=8yis2DvbBkI)
+\- <a href="https://www.youtube.com/watch?v=8yis2DvbBkI" target="_blank" rel="noopener noreferrer nofollow">Exercise: urllib</a>
 
-\- [練習：urllinks](https://www.youtube.com/watch?v=g9flPDG9nnY)
+\- <a href="https://www.youtube.com/watch?v=g9flPDG9nnY" target="_blank" rel="noopener noreferrer nofollow">Exercise: urllinks</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md
index 43d896fd086..64628790865 100644
--- a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md
+++ b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md
@@ -10,15 +10,21 @@ bilibiliIds:
 dashedName: relational-databases-and-sqlite
 ---
 
+# --description--
+
+<a href="https://www.sqlite.org/download.html" target="_blank" rel="noopener noreferrer nofollow">Download SQLite</a>  
+<a href="https://sqlitebrowser.org/dl/" target="_blank" rel="noopener noreferrer nofollow">Download DB Browser for SQLite</a>  
+<a href="https://www.sqlite.org/famous.html" target="_blank" rel="noopener noreferrer nofollow">SQLite usage</a>
+
 # --question--
 
 ## --text--
 
-哪個不是數據庫中主要的數據結構？
+哪一個不是數據庫中的主要數據結構？
 
 ## --answers--
 
-指數
+索引
 
 ---
 
@@ -26,11 +32,11 @@ dashedName: relational-databases-and-sqlite
 
 ---
 
-一行
+行
 
 ---
 
-一列
+列
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md
index 3ecdc5d2138..ea20d6bdc0c 100644
--- a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md
+++ b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md
@@ -14,15 +14,15 @@ dashedName: relational-databases-many-to-many-relationships
 
 更多資料：
 
-\- [練習：電子郵件](https://www.youtube.com/watch?v=uQ3Qv1z_Vao)
+\- <a href="https://www.youtube.com/watch?v=uQ3Qv1z_Vao" target="_blank" rel="noopener noreferrer nofollow">Exercise: Email</a>
 
-\- [練習：名冊](https://www.youtube.com/watch?v=qEkUEAz8j3o)
+\- <a href="https://www.youtube.com/watch?v=qEkUEAz8j3o" target="_blank" rel="noopener noreferrer nofollow">Exercise: Roster</a>
 
-\- [練習：曲目](https://www.youtube.com/watch?v=I-E7avcPeSE)
+\- <a href="https://www.youtube.com/watch?v=I-E7avcPeSE" target="_blank" rel="noopener noreferrer nofollow">Exercise: Tracks</a>
 
-\- [練習：推特好友](https://www.youtube.com/watch?v=RZRAoBFIH6A)
+\- <a href="https://www.youtube.com/watch?v=RZRAoBFIH6A" target="_blank" rel="noopener noreferrer nofollow">Exercise: Twfriends</a>
 
-\- [練習：推特爬蟲](https://www.youtube.com/watch?v=xBaJddvJL4A)
+\- <a href="https://www.youtube.com/watch?v=xBaJddvJL4A" target="_blank" rel="noopener noreferrer nofollow">Exercise: Twspider</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md
index 81608d7a271..b715d5a3576 100644
--- a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md
+++ b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md
@@ -14,7 +14,7 @@ dashedName: strings-and-lists
 
 更多資源：
 
-\- [練習](https://www.youtube.com/watch?v=-9TfJF2dwHI)
+\- <a href="https://www.youtube.com/watch?v=-9TfJF2dwHI" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/web-services-api-rate-limiting-and-security.md b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/web-services-api-rate-limiting-and-security.md
index 3651be8daf6..c178df44c11 100644
--- a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/web-services-api-rate-limiting-and-security.md
+++ b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/python-for-everybody/web-services-api-rate-limiting-and-security.md
@@ -14,13 +14,13 @@ dashedName: web-services-api-rate-limiting-and-security
 
 更多資料：
 
-\- [練習：GeoJSON](https://www.youtube.com/watch?v=TJGJN0T8tak)
+\- <a href="https://www.youtube.com/watch?v=TJGJN0T8tak" target="_blank" rel="noopener noreferrer nofollow">Exercise: GeoJSON</a>
 
-\- [練習：JSON](https://www.youtube.com/watch?v=vTmw5RtfGMY)
+\- <a href="https://www.youtube.com/watch?v=vTmw5RtfGMY" target="_blank" rel="noopener noreferrer nofollow">Exercise: JSON</a>
 
-\- [練習：Twitter](https://www.youtube.com/watch?v=2c7YwhvpCro)
+\- <a href="https://www.youtube.com/watch?v=2c7YwhvpCro" target="_blank" rel="noopener noreferrer nofollow">Exercise: Twitter</a>
 
-\- [練習：XML](https://www.youtube.com/watch?v=AopYOlDa-vY)
+\- <a href="https://www.youtube.com/watch?v=AopYOlDa-vY" target="_blank" rel="noopener noreferrer nofollow">Exercise: XML</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md
index 3e41aa1b713..78ac98c42ea 100644
--- a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md
+++ b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md
@@ -8,7 +8,7 @@ dashedName: arithmetic-formatter
 
 # --description--
 
-你將[使用我們的 Replit 入門代碼來完成這個項目](https://replit.com/github/freeCodeCamp/boilerplate-arithmetic-formatter)。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-arithmetic-formatter" target="_blank" rel="noopener noreferrer nofollow"> working on this project with our Replit starter code</a>.
 
 # --instructions--
 
@@ -64,7 +64,7 @@ arithmetic_arranger(["32 + 8", "1 - 3801", "9999 + 9999", "523 - 49"], True)
   - 每個數字（操作數）應該只包含數字。 否則，該函數將返回： `Error: Numbers must only contain digits.`
   - 每個操作數（也就是運算符兩側的數字）的寬度最多爲四位。 否則，返回的錯誤字符串將爲： `Error: Numbers cannot be more than four digits.`
 - 如果用戶提供了正確格式的問題，返回的轉換將遵循以下規則：
-  - 運算符和兩個數中最長的一個之間應該有一個空格，運算符與第二個數在同一行，兩個數的順序與所提供的相同（第一個將是頂部的，而第二個將是底部。
+  - There should be a single space between the operator and the longest of the two operands, the operator will be on the same line as the second operand, both operands will be in the same order as provided (the first will be the top one and the second will be the bottom).
   - 數字應該右對齊。
   - 每個問題之間應該有四個空格。
   - 每個問題的底部都應該有破折號。 破折號應該單獨沿着每個問題的整個長度延伸。 （上面的例子展示了這應該是什麼樣子。）
diff --git a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md
index 363f1264881..83fad56fbb1 100644
--- a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md
+++ b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md
@@ -8,7 +8,7 @@ dashedName: budget-app
 
 # --description--
 
-你將[使用我們的 Replit 入門代碼來完成這個項目](https://replit.com/github/freeCodeCamp/boilerplate-budget-app)。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-budget-app" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md
index 0c767fcb6ad..18a6b19442a 100644
--- a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md
+++ b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md
@@ -8,7 +8,7 @@ dashedName: polygon-area-calculator
 
 # --description--
 
-你將通過使用我們的[Replit 入門代碼](https://replit.com/github/freeCodeCamp/boilerplate-polygon-area-calculator)來完成本項目。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-polygon-area-calculator" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md
index 039d4078989..fb4d8bb7beb 100644
--- a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md
+++ b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md
@@ -8,7 +8,7 @@ dashedName: probability-calculator
 
 # --description--
 
-你將通過使用我們的[Replit 入門代碼](https://replit.com/github/freeCodeCamp/boilerplate-probability-calculator)來完成本項目。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-probability-calculator" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 # --instructions--
 
@@ -37,7 +37,7 @@ hat3 = Hat(red=5, orange=4, black=1, blue=0, pink=2, striped=9)
 
 `experiment` 函數應該返回一個概率。
 
-例如，假設你想確定當你從一個包含 6 個黑球、4 個紅球和 3 個綠球的帽子中抽出 5 個球時，至少得到 2 個紅球和 1 個綠球的概率。 爲此，我們進行 `N` 次實驗，記錄其中我們至少得到 2 個紅球和 1 個綠球的次數 `M`，並估計概率爲`M/N`。 每個實驗都包括從一頂裝有指定球的帽子開始，抽取一些球，然後檢查我們是否得到了我們想要得到的球。
+For example, if you want to determine the probability of getting at least two red balls and one green ball when you draw five balls from a hat containing six black, four red, and three green. To do this, you will perform `N` experiments, count how many times `M` you get at least two red balls and one green ball, and estimate the probability as `M/N`. Each experiment consists of starting with a hat containing the specified balls, drawing several balls, and checking if you got the balls you were attempting to draw.
 
 以下是基於上面的示例調用 `experiment` 函數的方法，其中包含 2000 個實驗：
 
diff --git a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md
index d0357eae42b..ae63f756dba 100644
--- a/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md
+++ b/curriculum/challenges/chinese-traditional/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md
@@ -8,7 +8,7 @@ dashedName: time-calculator
 
 # --description--
 
-你將通過使用我們的[Replit 入門代碼](https://replit.com/github/freeCodeCamp/boilerplate-time-calculator)來完成本項目。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-time-calculator" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 # --instructions--
 
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 2d90bd0490a..d7f08525a68 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
@@ -11,16 +11,17 @@ dashedName: introduction-to-data-analysis
 ---
 
 # --description--
+數據分析是指通過清理、轉換、處理原始數據，從而洞察數據價值的行爲。
 
-以下有更多的資料：
+更多資源：
 
-\- [幻燈片](https://docs.google.com/presentation/d/1cUIt8b2ySz-85_ykfeuuWsurccwTAuFPn782pZBzFsU/edit?usp=sharing)
+\- <a href="https://chinese.freecodecamp.org/news/what-is-data-analysis/" rel="noopener noreferrer nofollow">專欄文章</a>
 
 # --question--
 
 ## --text--
 
-以下哪一項 **不是** 數據分析的一部分？
+以下哪一項**不屬於**數據分析範疇？
 
 ## --answers--
 
@@ -28,7 +29,7 @@ dashedName: introduction-to-data-analysis
 
 ---
 
-爲分析選擇所需的結論。
+分析數據並得出結論。
 
 ---
 
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 31f1f9f6134..7465c2437f5 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
@@ -8,12 +8,13 @@ dashedName: demographic-data-analyzer
 
 # --description--
 
-你將通過使用我們的[Replit 入門代碼](https://replit.com/github/freeCodeCamp/boilerplate-demographic-data-analyzer)來完成本項目。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-demographic-data-analyzer" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 我們仍在開發 Python 課程的交互式教學部分。 目前，你可以在 YouTube 上通過 freeCodeCamp.org 上傳的一些視頻學習這個項目相關的知識。
 
-- [Python for Everybody 視頻課程](https://www.freecodecamp.org/news/python-for-everybody/)（14 小時）
-- [Learn Python 視頻課程](https://www.freecodecamp.org/news/learn-python-video-course/)（10 小時）
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a> (14 hours)
+
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">How to Analyze Data with Python Pandas</a> (10 hours)
 
 # --instructions--
 
@@ -59,7 +60,7 @@ dashedName: demographic-data-analyzer
 
 ## 數據集源
 
-Dua, D. and Graff, C. (2019). [UCI Machine Learning Repository](http://archive.ics.uci.edu/ml). Irvine, CA: University of California, School of Information and Computer Science.
+Dua, D. and Graff, C. (2019). <a href="http://archive.ics.uci.edu/ml" target="_blank" rel="noopener noreferrer nofollow">UCI Machine Learning Repository</a>. Irvine, CA: University of California, School of Information and Computer Science.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md
index 9c1ccbc5987..847b3078441 100644
--- a/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md
+++ b/curriculum/challenges/chinese-traditional/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md
@@ -8,12 +8,13 @@ dashedName: mean-variance-standard-deviation-calculator
 
 # --description--
 
-你將通過使用我們的[Replit 入門代碼](https://replit.com/github/freeCodeCamp/boilerplate-mean-variance-standard-deviation-calculator)來完成本項目。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-mean-variance-standard-deviation-calculator" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 我們仍在開發 Python 課程的交互式教學部分。 目前，你可以在 YouTube 上通過 freeCodeCamp.org 上傳的一些視頻學習這個項目相關的知識。
 
-- [Python for Everybody 視頻課程](https://www.freecodecamp.org/news/python-for-everybody/)（14 小時）
-- [Learn Python 視頻課程](https://www.freecodecamp.org/news/learn-python-video-course/)（10 小時）
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a>(14 hours)
+
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">How to Analyze Data with Python Pandas</a> (10 hours)
 
 # --instructions--
 
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 a3ddebd0934..8120ddc059f 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
@@ -8,12 +8,13 @@ dashedName: medical-data-visualizer
 
 # --description--
 
-你將通過使用我們的[Replit 入門代碼](https://replit.com/github/freeCodeCamp/boilerplate-medical-data-visualizer)來完成本項目。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-medical-data-visualizer" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 我們仍在開發 Python 課程的交互式教學部分。 目前，你可以在 YouTube 上通過 freeCodeCamp.org 上傳的一些視頻學習這個項目相關的知識。
 
-- [Python for Everybody 視頻課程](https://www.freecodecamp.org/news/python-for-everybody/)（14 小時）
-- [Learn Python 視頻課程](https://www.freecodecamp.org/news/learn-python-video-course/)（10 小時）
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a>(14 hours)
+
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">How to Analyze Data with Python Pandas</a> (10 hours)
 
 # --instructions--
 
@@ -25,20 +26,20 @@ dashedName: medical-data-visualizer
 
 文件名：medical_examination.csv
 
-|    項目    | 變量類型 |     變量名     |         變量值類型         |
-|:--------:|:----:|:-----------:|:---------------------:|
-|    年齡    | 客觀特徵 |     age     |      int (days)       |
-|    身高    | 客觀特徵 |   height    |       int (cm)        |
-|    體重    | 客觀特徵 |   weight    |      float (kg)       |
-|    性別    | 客觀特徵 |   gender    |         分類編碼          |
-|   收縮壓    | 檢測特徵 |    ap_hi    |          int          |
-|   舒張壓    | 檢測特徵 |    ap_lo    |          int          |
-|   膽固醇    | 檢測特徵 | cholesterol | 1：正常，2：高於正常，3：遠遠高於正常值 |
-|   血糖值    | 檢測特徵 |    gluc     | 1：正常，2：高於正常，3：遠遠高於正常值 |
-|   吸菸問題   | 主觀特徵 |    smoke    |        binary         |
-|   飲酒量    | 主觀特徵 |    alco     |        binary         |
-|   體育活動   | 主觀特徵 |   active    |        binary         |
-| 是否有心血管疾病 | 目標變量 |   cardio    |        binary         |
+|    項目    | 變量類型 |      變量名      |         變量值類型         |
+|:--------:|:----:|:-------------:|:---------------------:|
+|    年齡    | 客觀特徵 |     `age`     |      int (days)       |
+|    身高    | 客觀特徵 |   `height`    |       int (cm)        |
+|    體重    | 客觀特徵 |   `weight`    |      float (kg)       |
+|    性別    | 客觀特徵 |   `gender`    |         分類編碼          |
+|   收縮壓    | 檢測特徵 |    `ap_hi`    |          int          |
+|   舒張壓    | 檢測特徵 |    `ap_lo`    |          int          |
+|   膽固醇    | 檢測特徵 | `cholesterol` | 1：正常，2：高於正常，3：遠遠高於正常值 |
+|   血糖值    | 檢測特徵 |    `gluc`     | 1：正常，2：高於正常，3：遠遠高於正常值 |
+|   吸菸問題   | 主觀特徵 |    `smoke`    |        binary         |
+|   飲酒量    | 主觀特徵 |    `alco`     |        binary         |
+|   體育活動   | 主觀特徵 |   `active`    |        binary         |
+| 是否有心血管疾病 | 目標變量 |   `cardio`    |        binary         |
 
 ## 任務
 
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 a8fb8b8b997..61881d16f42 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
@@ -8,12 +8,13 @@ dashedName: page-view-time-series-visualizer
 
 # --description--
 
-你將通過使用我們的[Replit 入門代碼](https://replit.com/github/freeCodeCamp/boilerplate-page-view-time-series-visualizer)來完成本項目。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-page-view-time-series-visualizer" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 我們仍在開發 Python 課程的交互式教學部分。 目前，你可以在 freeCodeCamp.org 的 YouTube 頻道中通過視頻學習到這個項目相關的所有知識
 
-- [Python for Everybody 視頻課程](https://www.freecodecamp.org/news/python-for-everybody/)（14 小時）
-- [Learn Python 視頻課程](https://www.freecodecamp.org/news/learn-python-video-course/)（10 小時）
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a>(14 hours)
+
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">How to Analyze Data with Python Pandas</a> (10 hours)
 
 # --instructions--
 
@@ -21,11 +22,11 @@ dashedName: page-view-time-series-visualizer
 
 使用數據完成以下任務：
 
-- 使用 Pandas 從 “fcc-forum-pageviews.csv” 導入數據。 將索引設置爲 “date” 列。
+- 使用 Pandas 從 “fcc-forum-pageviews.csv” 導入數據。 Set the index to the `date` column.
 - 通過過濾掉頁面瀏覽量位於數據集前 2.5% 或數據集後 2.5% 的日期來清理數據。
-- 創建一個 `draw_line_plot` 函數，該函數使用 Matplotlib 繪製類似於“examples/Figure_1.png”的折線圖。 標題應爲“Daily freeCodeCamp Forum Page Views 5/2016-12/2019”。 x 軸上的標籤應爲“Date”，y 軸上的標籤應爲“Page Views”。
-- 創建一個 `draw_bar_plot` 函數，用於繪製類似於“examples/Figure_2.png”的條形圖。 它應該顯示按年份分組的每個月的平均每日頁面瀏覽量。 圖例應顯示月份標籤並具有“Months”標題。 在圖表上，x 軸上的標籤應爲“Years”，y 軸上的標籤應爲“Average Page Views”。
-- 創建一個 `draw_box_plot` 函數，該函數使用 Seaborn 繪製兩個相鄰的箱形圖，類似於“examples/Figure_3.png”。 這些箱線圖應顯示值在給定年份或月份內的分佈情況以及隨時間推移的比較情況。 第一個圖表的標題應爲“Year-wise Box Plot (Trend)”，第二個圖表的標題應爲“Month-wise Box Plot (Seasonality)”。 確保底部的月份標籤從“Jan”開始，並且 x 和 x 軸標記正確。 樣板文件包括準備數據的命令。
+- 創建一個 `draw_line_plot` 函數，該函數使用 Matplotlib 繪製類似於“examples/Figure_1.png”的折線圖。 The title should be `Daily freeCodeCamp Forum Page Views 5/2016-12/2019`. The label on the x axis should be `Date` and the label on the y axis should be `Page Views`.
+- 創建一個 `draw_bar_plot` 函數，用於繪製類似於“examples/Figure_2.png”的條形圖。 它應該顯示按年份分組的每個月的平均每日頁面瀏覽量。 The legend should show month labels and have a title of `Months`. On the chart, the label on the x axis should be `Years` and the label on the y axis should be `Average Page Views`.
+- 創建一個 `draw_box_plot` 函數，該函數使用 Seaborn 繪製兩個相鄰的箱形圖，類似於“examples/Figure_3.png”。 這些箱線圖應顯示值在給定年份或月份內的分佈情況以及隨時間推移的比較情況。 The title of the first chart should be `Year-wise Box Plot (Trend)` and the title of the second chart should be `Month-wise Box Plot (Seasonality)`. Make sure the month labels on bottom start at `Jan` and the x and y axis are labeled correctly. 樣板文件包括準備數據的命令。
 
 對於每個圖表，請確保使用數據框的副本。 單元測試是在 `test_module.py` 下爲你編寫的。
 
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 97e9f9d9b09..d6c5df5b66d 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
@@ -8,12 +8,13 @@ dashedName: sea-level-predictor
 
 # --description--
 
-你將通過使用我們的[Replit 入門代碼](https://replit.com/github/freeCodeCamp/boilerplate-sea-level-predictor)來完成本項目。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-sea-level-predictor" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 我們仍在開發 Python 課程的交互式教學部分。 目前，你可以在 YouTube 上通過 freeCodeCamp.org 上傳的一些視頻學習這個項目相關的知識。
 
-- [Python for Everybody 視頻課程](https://www.freecodecamp.org/news/python-for-everybody/)（14 小時）
-- [Learn Python 視頻課程](https://www.freecodecamp.org/news/learn-python-video-course/)（10 小時）
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a>(14 hours)
+
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">How to Analyze Data with Python Pandas</a> (10 hours)
 
 # --instructions--
 
@@ -22,10 +23,10 @@ dashedName: sea-level-predictor
 使用數據完成以下任務：
 
 - 使用 Pandas 從 `epa-sea-level.csv` 導入數據。
-- 使用 matplotlib 創建散點圖，使用“Year”列作爲 x 軸，將“CSIRO Adjusted Sea Level”列作爲 y 軸。
+- Use matplotlib to create a scatter plot using the `Year` column as the x-axis and the `CSIRO Adjusted Sea Level` column as the y-axix.
 - 使用 `scipy.stats` 中的 `linregress` 函數來獲得最佳擬合線的斜率和 y 截距。 在散點圖的頂部繪製最佳擬合線。 使線穿過 2050 年以預測 2050 年的海平面上升。
 - 僅使用數據集中從 2000 年到最近一年的數據繪製一條新的最佳擬合線。 如果上升速度繼續與 2000 年一樣，則使該線也經過 2050 年以預測 2050 年的海平面上升。
-- x 標籤應爲 “Year”，y 標籤應爲 “Sea Level (inches)”，標題應爲 “Rise in Sea Level”。
+- The x label should be `Year`, the y label should be `Sea Level (inches)`, and the title should be `Rise in Sea Level`.
 
 單元測試是在 `test_module.py` 下爲你編寫的。
 
@@ -44,7 +45,8 @@ dashedName: sea-level-predictor
 複製項目的 URL 並將其提交給 freeCodeCamp。
 
 ## 數據源
-[Global Average Absolute Sea Level Change](https://datahub.io/core/sea-level-rise), 1880-2014 from the US Environmental Protection Agency using data from CSIRO, 2015; NOAA, 2015.
+
+<a href="https://datahub.io/core/sea-level-rise" target="_blank" rel="noopener noreferrer nofollow">Global Average Absolute Sea Level Change</a>, 1880-2014 from the US Environmental Protection Agency using data from CSIRO, 2015; NOAA, 2015.
 
 
 # --hints--
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 3d8a7e3cd73..187204881cc 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
@@ -8,12 +8,12 @@ dashedName: anonymous-message-board
 
 # --description--
 
-構建一個功能上與此相似的全棧式 JavaScript 應用程序：<https://anonymous-message-board.freecodecamp.rocks/>。
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://anonymous-message-board.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://anonymous-message-board.freecodecamp.rocks/</a>.
 
 在這個項目中，你將使用以下方法之一編寫你的代碼：
 
--   克隆[這個 GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-messageboard/) 並在本地完成你的項目。
--   使用 [我們的 Replit 啓動項目](https://replit.com/github/freeCodeCamp/boilerplate-project-messageboard)來完成你的項目。
+-   Clone <a href="https://github.com/freeCodeCamp/boilerplate-project-messageboard/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete your project locally.
+-   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-messageboard" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 -   使用一個你喜歡的站點生成器來完成項目。 需要確定包含了我們 GitHub 倉庫的所有文件。
 
 完成本項目後，請將一個正常運行的 demo（項目演示）託管在可以公開訪問的平臺。 然後將 URL 提交到 `Solution Link` 中。 此外，還可以提交一個指向項目源碼的 `GitHub Link`。
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 3b1c42645fa..971c95b5463 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
@@ -9,13 +9,15 @@ dashedName: port-scanner
 
 # --description--
 
-你將通過使用我們的 [Replit 入門代碼](https://replit.com/github/freeCodeCamp/boilerplate-port-scanner) 來完成本項目。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-port-scanner" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 我們仍在開發 Python 課程的交互式教學部分。 目前，你可以在 YouTube 上通過 freeCodeCamp.org 上傳的一些視頻學習這個項目相關的知識。
 
-- [Python for Everybody 視頻課程](https://www.freecodecamp.org/news/python-for-everybody/)（14 小時）
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a> (14 hours)
 
-- [Learn Python 視頻課程](https://www.freecodecamp.org/news/learn-python-video-course/)（10 小時）
+- <a href="https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/" target="_blank" rel="noopener noreferrer nofollow">Learn Python Basics in Depth</a> (4 hours)
+
+- <a href="https://www.freecodecamp.org/news/intermediate-python-course/" target="_blank" rel="noopener noreferrer nofollow">Intermediate Python Course</a> (6 hours)
 
 # --instructions--
 
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 c9f85c9f162..f4138a1ddac 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
@@ -8,21 +8,32 @@ dashedName: secure-real-time-multiplayer-game
 
 # --description--
 
-使用 HTML Canvas API 和 [Socket.io](https://socket.io/) 開發一個 2D 實時多人遊戲，其功能與此類似：<https://secure-real-time-multiplayer-game.freecodecamp.rocks/>。 在這個項目中，你將使用以下方法之一編寫你的代碼：
+使用 HTML Canvas API 和 Socket.io 開發一個功能上類似於 <a href="https://secure-real-time-multiplayer-game.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://secure-real-time-multiplayer-game.freecodecamp.rocks/</a> 的 2D 實時多人遊戲。 在這個項目中，你將使用以下方法之一編寫你的代碼：
 
--   克隆[這個 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)來完成你的項目。
+-   克隆<a href="https://github.com/freeCodeCamp/boilerplate-project-secure-real-time-multiplayer-game/" target="_blank" rel="noopener noreferrer nofollow">這個 GitHub 倉庫</a>，並在本地完成你的項目。
+-   使用<a href="https://replit.com/github/freeCodeCamp/boilerplate-project-secure-real-time-multiplayer-game" target="_blank" rel="noopener noreferrer nofollow">我們在 Replit 上的初始化項目</a>來完成你的項目
 -   使用您選擇的站點生成器來完成項目。 需要確定包含了我們 GitHub 倉庫的所有文件。
 
 完成本項目後，請將一個正常運行的 demo（項目演示）託管在可以公開訪問的平臺。 然後在 `Solution Link` 框中提交你的項目 URL。 此外，還可以將項目的源碼提交到 `GitHub Link` 中。
 
 # --instructions--
 
-**注意** ：`helmet@^3.21.3` 是用戶故事所必需的。 這意味着你需要使用以前版本的 Helmet 的文檔，瞭解如何實現用戶故事的信息。
+創建一個安全的多人遊戲，每名玩家可以移動他們的角色，並且這個遊戲至少提供了一個可收集的道具，玩家的排名是根據他們的分數計算的。
+
+有關詳細信息，請參考下面的測試。
+
+請確保你的遊戲是安全的！ 包含以下安全措施：
+
+- 客戶端不能猜測/嗅探 MIME 類型
+- 防止 XSS 攻擊
+- 不要在客戶端中緩存網站的任何信息
+- 在請求頭中聲明網站是由 `PHP 7.4.3` 提供技術支持
+
+**注意：** `helmet@^3.21.3` 是需求中所要求的。 這意味着你將需要使用之前版本的 Helmet 文檔，來了解如何實現需求。
 
 # --hints--
 
-提交自己的項目，而不是示例的 URL。
+你應該提交你自己的項目，而不是示例 URL
 
 ```js
 (getUserInput) => {
@@ -34,91 +45,91 @@ dashedName: secure-real-time-multiplayer-game
 };
 ```
 
-多個玩家可以連接到一臺服務器遊玩。
+多名玩家可以連接到同一臺服務器玩這個遊戲。
 
 ```js
 
 ```
 
-每個玩家都有頭像。
+每名玩家都有一個角色。
 
 ```js
 
 ```
 
-每個玩家都由在 `Player.mjs` 中創建的 `Player` 類對象來代表。
+每名玩家都由 `Player.mjs` 中的 `Player` 類創建的對象表示
 
 ```js
 
 ```
 
-至少，每個玩家對象應該包含一個唯一的 `id`、一個 `score`，以及代表玩家當前位置的 `x` 和 `y` 座標。
+至少，每個玩家對象都應該包含一個唯一的 `id`、一個`score`，以及代表玩家當前位置的 `x` 和 `y` 座標。
 
 ```js
 
 ```
 
-遊戲至少有一種類型的可收藏物品。 在 `Collectible.mjs` 中完成 `Collectible` 類來實現這一點。
+遊戲中至少有一種可收集道具。 在 `Collectible.mjs` 中完成 `Collectible` 類來實現這一點
 
 ```js
 
 ```
 
-至少，每個由 `Collectible` 類創建的可收集物品對象應該包含一個唯一的 `id`、一個 `value`，以及代表該物品當前位置的 `x` 和 `y` 座標。
+至少，由 `Collectible` 類創建的每個可收集物品對象應該包含一個唯一的 `id`、一個 `value` 和代表物品的當前位置 `x` 和 `y` 座標。
 
 ```js
 
 ```
 
-玩家可以使用 WASD 或方向鍵移動頭像。 完成 `Player.mjs` 中的 `movePlayer` 方法來實現這一功能。
+玩家可以使用 WASD 和/或箭頭鍵移動他們的角色。 完成 `Player.mjs` 中的 `movePlayer` 方法來實現這一功能。
 
 ```js
 
 ```
 
-`movePlayer` 方法應該接受兩個參數：一個是 “up”、“down”、“left” 或 “right” 的字符串，另一個是玩家角色位置應該改變的像素數量。 `movePlayer` 應該調整它所調用的玩家對象的 `x` 和 `y` 座標。
+`movePlayer` 方法應該接受兩個參數：一個由 “up”、“down”、“left” 或 “right” 組成的字符串，以及一個表示玩家位置應該改變的像素數量的數字。 `movePlayer` 應該調整被調用的玩家對象的 `x` 和 `y` 座標。
 
 ```js
 
 ```
 
-用玩家的分數來計算他們相對其他玩家的名次。 在 `Player` 類中完成 `calculateRank` 方法來實現這個。
+玩家的分數應該用來計算他們與其他玩家相比的排名。 完成 `Player` 類中的 `calculateRank` 方法來實現這個功能。
 
 ```js
 
 ```
 
-`calculateRank` 方法應該接受一個代表所有在線玩家的對象數組，並返回字符串 `Rank: currentRanking/totalPlayers`。 例如，在一局有兩個玩家的遊戲中，如果玩家 A 的分數是 3，玩家 B 的分數是 5，那麼玩家 A 的 `calculateRank` 應該返回 `Rank: 2/2`。
+`calculateRank` 方法應該接受一個代表所有連接的玩家的對象數組，並返回字符串 `Rank: currentRanking/totalPlayers`（排名：當前排名/總玩家數）。 舉個例子，在一個兩人遊戲中，如果玩家 A 有 3 分，玩家 B 有 5 分，那麼玩家 A 的 `calculateRank` 應該返回 `Rank: 2/2`。
 
 ```js
 
 ```
 
-玩家可以與可收集物品發生碰撞。 完成 `Player.mjs` 中的 `collision` 方法來實現這一點。
+玩家可以與收集道具發生碰撞。 完成 `Player.mjs` 中的 `collision` 方法實現這一功能。
 
 ```js
 
 ```
 
-`collision` 方法應該接受一個可收集物品的對象作爲參數。 如果玩家的頭像與物品相交，`collision` 方法應該返回 `true`。
+`collision` 方法應該接受可收集物品的對象作爲參數。 如果玩家的角色與道具重合，`collision` 方法應該返回 `true`。
 
 ```js
 
 ```
 
-所有玩家都保持遊戲狀態同步。
+所有玩家保持同步。
 
 ```js
 
 ```
 
-玩家可以隨時斷開與遊戲的連接。
+玩家可以在任何時候退出遊戲。
 
 ```js
 
 ```
 
-阻止客戶端試圖猜測/嗅探 MIME 類型。
+防止客戶端嘗試猜測/嗅探 MIME 類型。
 
 ```js
 async (getUserInput) => {
@@ -138,7 +149,7 @@ async (getUserInput) => {
 };
 ```
 
-客戶端沒有緩存任何網站內容。
+網站上的任何東西都不會被緩存到客戶端中。
 
 ```js
 async (getUserInput) => {
@@ -154,7 +165,7 @@ async (getUserInput) => {
 };
 ```
 
-請求頭顯示該網站是由 “PHP 7.4.3” 驅動的，儘管實際並非如此（作爲一種安全防禦措施）。
+在請求頭中聲明該網站由 “PHP 7.4.3” 提供技術支持，儘管它並非如此（作爲一種安全措施）。
 
 ```js
 async (getUserInput) => {
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 4ad5dbe6d3f..678ed3f2636 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
@@ -9,13 +9,15 @@ dashedName: sha-1-password-cracker
 
 # --description--
 
-你將通過使用我們的 [Replit 入門代碼](https://replit.com/github/freeCodeCamp/boilerplate-SHA-1-password-cracker) 來完成本項目。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-SHA-1-password-cracker" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 我們仍在開發 Python 課程的交互式教學部分。 目前，你可以在 YouTube 上通過 freeCodeCamp.org 上傳的一些視頻學習這個項目相關的知識。
 
-- [Python for Everybody 視頻課程](https://www.freecodecamp.org/news/python-for-everybody/)（14 小時）
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a> (14 hours)
 
-- [Learn Python 視頻課程](https://www.freecodecamp.org/news/learn-python-video-course/)（10 小時）
+- <a href="https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/" target="_blank" rel="noopener noreferrer nofollow">Learn Python Basics in Depth</a> (4 hours)
+
+- <a href="https://www.freecodecamp.org/news/intermediate-python-course/" target="_blank" rel="noopener noreferrer nofollow">Intermediate Python Course</a> (6 hours)
 
 # --instructions--
 
@@ -41,7 +43,7 @@ dashedName: sha-1-password-cracker
 - `da5a4e8cf89539e66097acd2f8af128acae2f8ae` 應該返回 “q1w2e3r4t5”
 - `ea3f62d498e3b98557f9f9cd0d905028b3b019e1` 應該返回 “bubbles1”
 
-`hashlib` 庫已經爲你導入。 你應該在你的代碼中使用它。 [在此瞭解更多關於 “hashlib” 的信息](https://docs.python.org/3/library/hashlib.html)
+`hashlib` 庫已經爲你導入。 You should consider using it in your code. <a href="https://docs.python.org/3/library/hashlib.html" target="_blank" rel="noopener noreferrer nofollow">Learn more about "hashlib" here</a>.
 
 ## 開發
 
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 e3bd6496a19..59dbc2b278b 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
@@ -8,14 +8,14 @@ dashedName: stock-price-checker
 
 # --description--
 
-構建一個 JavaScript 的全棧應用，在功能上與這個應用相似：<https://stock-price-checker.freecodecamp.rocks/>。
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://stock-price-checker.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://stock-price-checker.freecodecamp.rocks/</a>.
 
-由於所有可靠的股票價格 API 都需要一個 API 密鑰，我們已經建立了一個解決方案。 使用 [https://stock-price-checer-proxy.freecodecamp.rocks/](https://stock-price-checker-proxy.freecodecamp.rocks/) 獲取最新的股票價格信息，而無需註冊您自己的密鑰。
+由於所有可靠的股票價格 API 都需要一個 API 密鑰，我們已經建立了一個解決方案。 Use <a href="https://stock-price-checker-proxy.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://stock-price-checker-proxy.freecodecamp.rocks/</a> to get up-to-date stock price information without needing to sign up for your own key.
 
 可以採用下面的任意一種方式完成這個挑戰：
 
--   克隆 [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-stockchecker/) 並在本地完成項目。
--   使用[我們的 Replit 啓動項目](https://replit.com/github/freeCodeCamp/boilerplate-project-stockchecker)來完成你的項目。
+-   Clone <a href="https://github.com/freeCodeCamp/boilerplate-project-stockchecker/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete your project locally.
+-   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-stockchecker" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 -   使用你選擇的網站生成器來完成項目。 需要包含我們 GitHub 倉庫的所有文件。
 
 完成本項目後，請將一個正常運行的 demo（項目演示）託管在可以公開訪問的平臺。 然後將 URL 提交到 `Solution Link` 中。 此外，還可以將項目的源碼提交到 `GitHub Link` 中。
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 c028f374915..c17d40e14f2 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
@@ -8,7 +8,7 @@ dashedName: ask-browsers-to-access-your-site-via-https-only-with-helmet-hsts
 
 # --description--
 
-請注意，本項目在[這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基礎上進行開發。你也可以從 [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 HTTP 嚴格傳輸安全（HSTS）是一種網絡安全策略，有助於保護網站免受協議降級攻擊和 cookie 劫持。 如果你的網站可以通過 HTTPS 訪問，你可以要求用戶的瀏覽器避免使用不安全的 HTTP。 通過設置標頭 Strict-Transport-Security，你告訴瀏覽器在指定時間內對未來的請求使用 HTTPS。 這將對初始請求之後的請求起作用。
 
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 3df51eff7ff..736ebfffb22 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
@@ -8,7 +8,7 @@ dashedName: avoid-inferring-the-response-mime-type-with-helmet-nosniff
 
 # --description--
 
-請注意，本項目在[這個 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`。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>. 瀏覽器可以使用內容或 MIME 嗅探來覆蓋響應的 `Content-Type` 頭，猜測並使用隱含的內容類型來處理數據。 雖然這在某些情況下可能很方便，但也可能導致一些危險的攻擊。 該中間件將 X-Content-Type-Options 頭設置爲 `nosniff`，指示瀏覽器不要繞過所提供的 `Content-Type`。
 
 # --instructions--
 
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 9a72ee091bf..f651618a89f 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
@@ -8,7 +8,7 @@ dashedName: configure-helmet-using-the-parent-helmet-middleware
 
 # --description--
 
-請注意，本項目在[這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基礎上進行開發。你也可以從 [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `app.use(helmet())` 將自動包括上面介紹的所有中間件，除了 `noCache()` 和 `contentSecurityPolicy()`，但如果有必要，這些可以被啓用。 你也可以使用配置對象，單獨禁用或配置任何其他中間件。
 
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 5ecebfe01fa..dfb80f98d11 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
@@ -8,7 +8,7 @@ dashedName: disable-client-side-caching-with-helmet-nocache
 
 # --description--
 
-請注意，本項目在[這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基礎上進行開發。 你也可以從[GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/)上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 如果你正在爲你的網站發佈更新，而你希望用戶總是下載較新的版本，你可以（嘗試）在客戶的瀏覽器上禁用緩存。 它在開發中也很有用。 緩存具有性能優勢，你將失去這些優勢，因此只有在真正需要時才使用此選項。
 
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 455ce2a2546..d5e63354248 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
@@ -8,7 +8,7 @@ dashedName: disable-dns-prefetching-with-helmet-dnsprefetchcontrol
 
 # --description--
 
-請注意，本項目在[這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基礎上進行開發。你也可以從 [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 爲了提高性能，大部分瀏覽器都會爲頁面上的鏈接預先加載 DNS 記錄。 這樣當用戶點擊一個鏈接的時候瀏覽器已經知道其 IP 地址了。 但這也會造成 DNS 服務的過度使用（如果你有一個百萬用戶數量級的大型網站）、隱私問題（竊聽者可以藉此推測出你在訪問哪個頁面）、頁面統計數據準確性（有些沒訪問過的鏈接會被標記成已訪問）。 如果你對安全性要求比較高，你應該禁用 DNS 預加載。 當然，這樣做會讓你損失一些性能。
 
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 737288015a7..93e3da005da 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
@@ -8,7 +8,7 @@ dashedName: hash-and-compare-passwords-asynchronously
 
 # --description--
 
-請注意，本項目在[這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基礎上進行開發。 你也可以從[GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/)上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-bcrypt" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-bcrypt/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 由於哈希運算會佔用很大計算機資源，並且會耗費比較多時間，因此比較推薦的做法是異步調用哈希算法，這樣就不會因此阻止其它連接或請求了。 異步調用哈希方法非常簡單，只需要：
 
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 c19836bc321..570d37bdc05 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
@@ -8,7 +8,7 @@ dashedName: hash-and-compare-passwords-synchronously
 
 # --description--
 
-請注意，本項目在 [這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-bcrypt) 的基礎上進行開發。 你也可以從 [GitHub](https://github.com/freeCodeCamp/boilerplate-bcrypt/) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-bcrypt" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-bcrypt/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 同步執行哈希運算是非常簡單的，但這會在哈希計算量大並且次數多的情況下造成延遲。 用這個方法哈希就像調用函數一樣簡單。
 
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 32214afbae6..5e881c25e58 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
@@ -8,7 +8,7 @@ dashedName: hide-potentially-dangerous-information-using-helmet-hidepoweredby
 
 # --description--
 
-請注意，本項目在[這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基礎上進行開發。你也可以從 [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 如果黑客發現你的網站是用 Express 搭建的，那麼他們就可以利用 Express 或 Node 現存的漏洞來攻擊你的網站。 `X-Powered-By: Express` 默認在來自 Express 的每個請求中被髮送。 使用 `helmet.hidePoweredBy()` 中間件來移除 X-Powered-By 頭。
 
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 49d5ede4259..1bc77e579da 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
@@ -10,8 +10,8 @@ dashedName: install-and-require-helmet
 
 你可以採用下面的任意一種編寫代碼的方式來完成這些挑戰：
 
-- 克隆 [這個 GitHub 倉庫](https://github.com/freeCodeCamp/boilerplate-infosec/) 並在本地完成這些挑戰。
-- 使用[我們在 Repl.it 上的初始化項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)來完成這些挑戰。
+- 克隆<a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">這個 GitHub 倉庫</a>，並在本地完成這些挑戰。
+- 使用<a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">我們在 Replit 上的初始化項目</a>來完成這些挑戰。
 - 使用你選擇的網站生成器來完成項目。 需要包含我們 GitHub 倉庫的所有文件。
 
 完成本項目後，請將一個正常運行的 demo（項目演示）託管在可以公開訪問的平臺。 然後在 `Solution Link` 字段中提交它的 URL。
@@ -22,7 +22,7 @@ Helmet 通過設置各種 HTTP 頭來保護你的 Express 應用程序。
 
 你在這些課程中寫的所有代碼都在 `myApp.js` 文件中，在初始代碼之間。 不要改變或刪除我們爲你添加的代碼。
 
-安裝 Helmet 的 `3.21.3` 版本，然後引入它。 你可以用 `npm install --save-exact package@version` 來安裝一個特定版本的軟件包，或者直接將其添加到你的 `package.json` 中。
+Helmet `3.21.3` 版已經安裝完畢，所以在 `myApp.js` 中請求它作爲 `helmet`。
 
 # --hints--
 
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 dcbf163ddd4..18c18a4a9ff 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
@@ -8,7 +8,7 @@ dashedName: mitigate-the-risk-of-clickjacking-with-helmet-frameguard
 
 # --description--
 
-請注意，本項目在 [這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec) 的基礎上進行開發。 你也可以從 [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 你的網頁可能在未經你同意的情況下被放在 `<frame>` 或 `<iframe>` 中。 這可能會導致點擊劫持攻擊等情況。 點擊劫持是一種欺騙用戶的技術，使其與用戶認爲不同的頁面進行互動。 這可以通過使用 iframe 的方式，在一個惡意的環境中執行你的頁面而獲得。 在這種情況下，黑客可以在你的頁面上設置一個隱藏層。 隱藏的按鈕可以被用來運行壞的腳本。 該中間件設置 X-Frame-Options 頭。 它限制了誰可以把你的網站放在一個框架裏。 它有三種模式：DENY、SAMEORIGIN 和 ALLOW-FROM。
 
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 7c30c0ca26d..c0fada043e2 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
@@ -9,7 +9,7 @@ dashedName: mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet-xs
 
 # --description--
 
-請注意，本項目在 [這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec) 的基礎上進行開發。你也可以從 [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 跨站腳本（XSS）是一種常見的攻擊類型，惡意腳本被注入到易受攻擊的頁面，目的是竊取敏感數據，如會話 cookies 或密碼。
 
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 fd2c5616069..fd357d5be03 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
@@ -8,7 +8,7 @@ dashedName: prevent-ie-from-opening-untrusted-html-with-helmet-ienoopen
 
 # --description--
 
-請注意，本項目在[這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基礎上進行開發。 你也可以從[GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/)上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 有些網站會下載不安全的 HTML 文件。 某些版本的 IE 默認情況下還會在你網站的作用域下打開這些 HTML 文件。 換句話說，這些不安全的 HTML 頁面可以在你的網站做惡意行爲。 我們可以通過中間件來設置 header 中的 X-Download-Options 字段，讓它的值爲 noopen。 這樣就可以防止 IE 在不信任的網站下執行下載的文件。
 
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 6e439ee8d3c..6abd3a2dbac 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
@@ -8,7 +8,7 @@ dashedName: set-a-content-security-policy-with-helmet-contentsecuritypolicy
 
 # --description--
 
-請注意，本項目在 [這個 Repl.it 項目](https://replit.com/github/freeCodeCamp/boilerplate-infosec) 的基礎上進行開發。你也可以從 [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 在這個挑戰中，我們要重點討論現代瀏覽器中一種能有效減輕安全風險和防禦很多種類型常見攻擊的安全防護。 通過設置和配置內容安全策略，你可以防止在頁面中無意中注入任何內容。 這會讓你的應用遠離 XSS 漏洞、惡意追蹤、惡意 frames 和很多其他攻擊。 CSP 通過配置資源白名單來避免這些問題。 你可以給任何一種類型的頁面資源（腳本、樣式文件、字體、frames、媒體文件等）做這個配置。 它支持很多指令，所以網站管理員可以做細緻的控制。 更多詳情請參考 HTML 5 Rocks 和 KeyCDN。 不幸的是，一些舊的瀏覽器不支持 CSP。
 
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 b3227a1c5aa..f0a8b7d77d6 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
@@ -8,17 +8,17 @@ dashedName: understand-bcrypt-hashes
 
 # --description--
 
-在下面的挑戰中，你將啓動一個新的項目，這個項目與之前的項目不同。 你可以在 [Replit](https://replit.com/github/freeCodeCamp/boilerplate-bcrypt)上找到新的啓動項目，或者從 [GitHub](https://github.com/freeCodeCamp/boilerplate-bcrypt/) 上克隆它。
+在下面的挑戰中，你將啓動一個新的項目，這個項目與之前的項目不同。 You can find the new starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-bcrypt" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or clone it from <a href="https://github.com/freeCodeCamp/boilerplate-bcrypt/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
-BCrypt 哈希值是非常安全的。 哈希值基本上是原始數據的指紋，總是唯一的。 這是通過將原始數據輸入一個算法並返回一個固定長度的結果來實現的。 爲了使這一過程更加複雜和安全，你還可以向你的哈希值 *加鹽*。 對你的散列加鹽處理包含了在散列過程之前向原始數據添加隨機數據，這使得破解散列更加困難。
+BCrypt 哈希值是非常安全的。 哈希值基本上是原始數據的指紋，總是唯一的。 這是通過將原始數據輸入一個算法並返回一個固定長度的結果來實現的。 爲了使這一過程更加複雜和安全，你還可以向你的哈希值 *加鹽*。 對你的哈希加鹽處理包含了在哈希過程之前向原始數據添加隨機數據，這使得破解哈希更加困難。
 
-BCrypt 哈希值總是看起來有像`$2a$13$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm` 的結構。 它遵循固定的結構，第一小節 `$2a` 說明了該哈希採用什麼算法。 接下來的部分 `$13` 定義了 *成本*。 成本是指計算哈希值需要多少能量。 它在 2^cost 的對數尺度上，決定了數據要通過散列算法計算多少次。 例如，當 cost 爲 10 時，你能夠在普通計算機上每秒散列 10 個密碼，然而當 cost 爲 15 時，每次散列需要 3 秒...... 進一步說，當 cost 爲 31 時，完成一次散列需要好幾天。 通常 cost 爲 12 的哈希運算就已經足夠安全。 哈希結果的最後一部分 `$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm` 看起來像是由隨機數字、點和字母組成的字符串，但實際上它有兩部分內容。 前面 22 個字符是加入的鹽，剩下的就是加密過的密碼！
+BCrypt hashes will always look like `$2a$13$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm` which does have a structure. 第一小節 `$2a` 說明了該哈希採用什麼算法。 接下來的部分 `$13` 定義了 *成本*。 成本是指計算哈希值需要多少能量。 它在 2^cost 的對數尺度上，決定了數據要通過哈希算法計算多少次。 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 take multiple days to complete a hash. 通常 cost 爲 12 的哈希運算就已經足夠安全。 哈希結果的最後一部分 `$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm` 看起來像是由隨機數字、點和字母組成的字符串，但實際上它有兩部分內容。 前面 22 個字符是加入的鹽，剩下的就是加密過的密碼！
 
 # --instructions--
 
-要開始使用 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` 文件中加入這些課程的所有代碼，放在我們提供的代碼之間。 不要改變或刪除我們爲你添加的代碼。
+BCrypt has already been added as a dependency, so require it as `bcrypt` in your server.
 
 請在完成挑戰後提交你的頁面。
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md
index e4efff4024b..4b78a2b2abe 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md
@@ -1,7 +1,7 @@
 ---
 id: a3f503de51cf954ede28891d
 title: 找到對稱差異
-challengeType: 5
+challengeType: 1
 forumTopicId: 301611
 dashedName: find-the-symmetric-difference
 ---
@@ -54,7 +54,7 @@ assert.sameMembers(sym([1, 2, 3], [5, 2, 1, 4, 5]), [3, 4, 5]);
 assert.equal(sym([1, 2, 3], [5, 2, 1, 4, 5]).length, 3);
 ```
 
-`sym([1, 2, 5], [2, 3, 5], [3, 4, 5])` 應該返回 `[1, 4, 5]` 。
+`sym([1, 2, 5], [2, 3, 5], [3, 4, 5])` should return `[1, 4, 5]`.
 
 ```js
 assert.sameMembers(sym([1, 2, 5], [2, 3, 5], [3, 4, 5]), [1, 4, 5]);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md
index 31ca72f945c..6d17f3c2215 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md
@@ -22,7 +22,7 @@ dashedName: add-a-new-element-to-a-binary-search-tree
 
 # --instructions--
 
-我們將從簡單的內容開始。 我們在這裏定義了一個二叉搜索樹結構的骨架，此外還有一個爲我們的樹創建節點的函數。 注意觀察每個節點可能有一個左值和右值。 如果子樹存在，它們將被分配給對應的子樹。 在我們的二叉搜索樹中，你將創建一個方法來向我們的二叉搜索樹添加新的值。 該方法應該被稱爲`add` ，它應該接受一個整數值來添加到樹中。 注意保持二叉搜索樹的不變量：每個左子項中的值應小於或等於父值，並且每個右子項中的值應大於或等於父值。 在這裏，讓我們確保我們的樹不會含有重複的值。 如果我們嘗試添加已存在的值，則該方法應返回`null` 。 否則，如果添加成功，則應返回`undefined` 。
+我們將從簡單的內容開始。 我們在這裏定義了一個二叉搜索樹結構的骨架，此外還有一個爲我們的樹創建節點的函數。 注意觀察每個節點可能有一個左值和右值。 如果子樹存在，它們將被分配給對應的子樹。 In our binary search tree, you will create a method to add new values to the tree. 該方法應該被稱爲`add` ，它應該接受一個整數值來添加到樹中。 注意保持二叉搜索樹的不變量：每個左子項中的值應小於或等於父值，並且每個右子項中的值應大於或等於父值。 在這裏，讓我們確保我們的樹不會含有重複的值。 如果我們嘗試添加已存在的值，則該方法應返回`null` 。 否則，如果添加成功，則應返回`undefined` 。
 
 **提示：** 樹是自然的遞歸數據結構！
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.md
index 3ca9c8c0f4c..11b26fc829f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.md
@@ -8,7 +8,7 @@ dashedName: add-elements-at-a-specific-index-in-a-linked-list
 
 # --description--
 
-Let's create a addAt(index,element) method that adds an element at a given index. Just like how we remove elements at a given index, we need to keep track of the currentIndex as we traverse the linked list. When the currentIndex matches the given index, we would need to reassign the previous node's next property to reference the new added node. And the new node should reference the next node in the currentIndex. Returning to the conga line example, a new person wants to join the line, but he wants to join in the middle. You are in the middle of the line, so you take your hands off of the person ahead of you. The new person walks over and puts his hands on the person you once had hands on, and you now have your hands on the new person.
+讓我們創建一個 addAt(index,element) 方法，在給定的索引處添加一個元素。 就像我們如何刪除給定索引處的元素一樣，我們需要在遍歷鏈表時跟蹤 currentIndex。 當 currentIndex 與給定索引匹配時，我們需要重新分配上一個節點的下一個屬性以引用新添加的節點。 並且新節點應該引用 currentIndex 中的下一個節點。 Returning to the conga line example, a new person wants to join the line, but he wants to join in the middle. You are in the middle of the line, so you take your hands off of the person ahead of you. The new person walks over and puts his hands on the person you once had hands on, and you now have your hands on the new person.
 
 # --instructions--
 
@@ -24,8 +24,8 @@ assert(
     var test = new LinkedList();
     test.add('cat');
     test.add('dog');
-    test.addAt(0, 'cat');
-    return test.head().element === 'cat';
+    test.addAt(0, 'fish');
+    return test.head().element === 'fish' && test.head().next.element === 'cat';
   })()
 );
 ```
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/adjacency-list.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/adjacency-list.md
index 72868a02d7d..e9b7f17e96f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/adjacency-list.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/adjacency-list.md
@@ -58,7 +58,7 @@ There should be an edge between `Jill` and `Jenny`.
 ```js
 assert(
   undirectedAdjList.Jill.indexOf('Jenny') !== -1 &&
-    undirectedAdjList.Jill.indexOf('Jenny') !== -1
+    undirectedAdjList.Jenny.indexOf('Jill') !== -1
 );
 ```
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md
index 42081a1355d..db3165a4b73 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md
@@ -39,6 +39,24 @@ assert(
 );
 ```
 
+`isBinarySearchTree()` should return false when checked with a tree that is not a binary search tree.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    test.push(1);
+    test.root.left = new Node(1);
+    return isBinarySearchTree(test) == false;
+  })()
+);
+```
+
 # --seed--
 
 ## --after-user-code--
@@ -114,7 +132,7 @@ function isBinarySearchTree(tree) {
     function checkTree(node) {
       if (node.left != null) {
         const left = node.left;
-        if (left.value > node.value) {
+        if (left.value >= node.value) {
           isBST = false;
         } else {
           checkTree(left);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-circular-queue.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-circular-queue.md
index 16ff688fabf..a12f64eea8c 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-circular-queue.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-circular-queue.md
@@ -46,7 +46,7 @@ This approach requires a constant amount of memory but allows files of a much la
 
 # --instructions--
 
-In this challenge we will implement a circular queue. The circular queue should provide `enqueue` and `dequeue` methods which allow you to read from and write to the queue. The class itself should also accept an integer argument which you can use to specify the size of the queue when created. We've written the starting version of this class for you in the code editor.
+In this challenge we will implement a circular queue. The circular queue should provide `enqueue` and `dequeue` methods which allow you to read from and write to the queue. The class itself should also accept an integer argument which you can use to specify the size of the queue when created. 我們已經在代碼編輯器中爲您編寫了此類的起始版本。
 
 When you enqueue items to the queue, the write pointer should advance forward and loop back to the beginning once it reaches the end of the queue. The `enqueue` method should return the item you enqueued if it is successful; otherwise it will return `null`.
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md
index 16c2e122fa7..b9f3f12d767 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md
@@ -20,7 +20,7 @@ Be careful to handle any possible edge cases when writing these methods, such as
 
 # --hints--
 
-The DoublyLinkedList data structure should exist.
+The `DoublyLinkedList` data structure should exist.
 
 ```js
 assert(
@@ -34,7 +34,7 @@ assert(
 );
 ```
 
-The DoublyLinkedList should have a method called add.
+The `DoublyLinkedList` should have a method called `add`.
 
 ```js
 assert(
@@ -51,7 +51,7 @@ assert(
 );
 ```
 
-The DoublyLinkedList should have a method called remove.
+The `DoublyLinkedList` should have a method called `remove`.
 
 ```js
 assert(
@@ -68,7 +68,7 @@ assert(
 );
 ```
 
-Removing an item from an empty list should return null.
+Removing an item from an empty list should return `null`.
 
 ```js
 assert(
@@ -82,7 +82,7 @@ assert(
 );
 ```
 
-The add method should add items to the list.
+The `add` method should add items to the list.
 
 ```js
 assert(
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 a33c3d51787..035733ac109 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
@@ -24,7 +24,7 @@ Be sure to write your code to account for collisions!
 
 # --hints--
 
-The HashTable data structure should exist.
+The `HashTable` data structure should exist.
 
 ```js
 assert(
@@ -38,7 +38,7 @@ assert(
 );
 ```
 
-The HashTable should have an add method.
+The `HashTable` should have an `add` method.
 
 ```js
 assert(
@@ -52,7 +52,7 @@ assert(
 );
 ```
 
-The HashTable should have a lookup method.
+The `HashTable` should have a `lookup` method.
 
 ```js
 assert(
@@ -66,7 +66,7 @@ assert(
 );
 ```
 
-The HashTable should have a remove method.
+The `HashTable` should have a `remove` method.
 
 ```js
 assert(
@@ -80,7 +80,7 @@ assert(
 );
 ```
 
-The add method should add key value pairs and the lookup method should return the values associated with a given key.
+The `add` method should add key value pairs and the `lookup` method should return the values associated with a given key.
 
 ```js
 assert(
@@ -95,7 +95,7 @@ assert(
 );
 ```
 
-The remove method should accept a key as input and should remove the associated key value pair.
+The `remove` method should accept a key as input and should remove the associated key value pair.
 
 ```js
 assert(
@@ -113,7 +113,7 @@ assert(
 );
 ```
 
-The remove method should only remove the correct key value pair.
+The `remove` method should only remove the correct key value pair.
 
 ```js
 assert(
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-linked-list-class.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-linked-list-class.md
index 0c768cf0a28..d52a34cab7d 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-linked-list-class.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-linked-list-class.md
@@ -57,7 +57,8 @@ assert(
     var test = new LinkedList();
     test.add('cat');
     test.add('dog');
-    return test.head().next.element === 'dog';
+    test.add('fish');
+    return test.head().next.element === 'dog' && test.head().next.next.element === 'fish';
   })()
 );
 ```
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-map-data-structure.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-map-data-structure.md
index 0c32270e722..6f2159a5e0d 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-map-data-structure.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-map-data-structure.md
@@ -1,6 +1,6 @@
 ---
 id: 8d5823c8c441eddfaeb5bdef
-title: Create a Map Data Structure
+title: 創建映射數據結構
 challengeType: 1
 forumTopicId: 301629
 dashedName: create-a-map-data-structure
@@ -26,7 +26,7 @@ Let's get some practice creating our own map. Because JavaScript objects provide
 
 # --hints--
 
-The Map data structure should exist.
+The `Map` data structure should exist.
 
 ```js
 assert(
@@ -40,7 +40,7 @@ assert(
 );
 ```
 
-The Map object should have the following methods: add, remove, get, has, values, clear, and size.
+The `Map` object should have the following methods: `add`, `remove`, `get`, `has`, `values`, `clear`, and `size`.
 
 ```js
 assert(
@@ -62,7 +62,7 @@ assert(
 );
 ```
 
-The add method should add items to the map.
+The `add` method should add items to the map.
 
 ```js
 assert(
@@ -79,7 +79,7 @@ assert(
 );
 ```
 
-The has method should return true for added items and false for absent items.
+The `has` method should return `true` for added items and `false` for absent items.
 
 ```js
 assert(
@@ -94,7 +94,7 @@ assert(
 );
 ```
 
-The get method should accept keys as input and should return the associated values.
+The `get` method should accept keys as input and should return the associated values.
 
 ```js
 assert(
@@ -109,7 +109,7 @@ assert(
 );
 ```
 
-The values method should return all the values stored in the map as strings in an array.
+The `values` method should return all the values stored in the map as strings in an array.
 
 ```js
 assert(
@@ -131,7 +131,7 @@ assert(
 );
 ```
 
-The clear method should empty the map and the size method should return the number of items present in the map.
+The `clear` method should empty the map and the `size` method should return the number of items present in the map.
 
 ```js
 assert(
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md
index fb838c883e0..b1495efd441 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md
@@ -12,11 +12,11 @@ Here we will move on from binary search trees and take a look at another type of
 
 # --instructions--
 
-Let's create a trie to store words. It will accept words through an `add` method and store these in a trie data structure. It will also allow us to query if a given string is a word with an `isWord` method, and retrieve all the words entered into the trie with a `print` method. `isWord` should return a boolean value and print should return an array of all these words as string values. In order for us to verify that this data structure is implemented correctly, we've provided a `Node` structure for each node in the tree. Each node will be an object with a `keys` property which is a JavaScript Map object. This will hold the individual letters that are valid keys of each node. We've also created an `end` property on the nodes that can be set to `true` if the node represents the termination of a word.
+Let's create a trie to store words. It will accept words through an `add` method and store these in a trie data structure. It will also allow us to query if a given string is a word with an `isWord` method, and retrieve all the words entered into the trie with a `print` method. `isWord` should return a boolean value and `print` should return an array of all these words as string values. In order for us to verify that this data structure is implemented correctly, we've provided a `Node` structure for each node in the tree. Each node will be an object with a `keys` property which is a JavaScript Map object. This will hold the individual letters that are valid keys of each node. We've also created an `end` property on the nodes that can be set to `true` if the node represents the termination of a word.
 
 # --hints--
 
-The Trie should have an add method.
+The `Trie` should have an `add` method.
 
 ```js
 assert(
@@ -32,7 +32,7 @@ assert(
 );
 ```
 
-The Trie should have a print method.
+The `Trie` should have a `print` method.
 
 ```js
 assert(
@@ -48,7 +48,7 @@ assert(
 );
 ```
 
-The Trie should have an isWord method.
+The `Trie` should have an `isWord` method.
 
 ```js
 assert(
@@ -64,7 +64,7 @@ assert(
 );
 ```
 
-The print method should return all items added to the trie as strings in an array.
+The `print` method should return all items added to the trie as strings in an array.
 
 ```js
 assert(
@@ -93,7 +93,7 @@ assert(
 );
 ```
 
-The isWord method should return true only for words added to the trie and false for all other words.
+The `isWord` method should return `true` only for words added to the trie and `false` for all other words.
 
 ```js
 assert(
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 7e6822ef676..02bcedd36db 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
@@ -8,7 +8,15 @@ dashedName: create-an-es6-javascript-map
 
 # --description--
 
-The new version of JavaScript provides us with a built-in Map object which provides much of the functionality we wrote by hand in the last challenge. This Map object, although similar to regular JavaScript objects, provides some useful functionality that normal objects lack. For example, an ES6 Map tracks the insertion order of items that are added to it. Here is a more complete overview of its methods: `.has(key)` returns true or false based on the presence of a key `.get(key)` returns the value associated with a key `.set(key, value)` sets a new key, value pair `.delete(key)` removes a key, value pair `.clear()` removes all key, value pairs `.entries()` returns an array of all the keys in insertion order `.values()` returns an array of all the values in insertion order
+The new version of JavaScript provides us with a built-in Map object which provides much of the functionality we wrote by hand in the last challenge. This Map object, although similar to regular JavaScript objects, provides some useful functionality that normal objects lack. For example, an ES6 Map tracks the insertion order of items that are added to it. Here is a more complete overview of its methods:
+
+- `.has(key)` returns true or false based on the presence of a key
+- `.get(key)` returns the value associated with a key
+- `.set(key, value)` sets a new key, value pair
+- `.delete(key)` removes a key, value pair
+- `.clear()` removes all key, value pairs
+- `.entries()` returns an array of all the keys in insertion order
+- `.values()` returns an array of all the values in insertion order
 
 # --instructions--
 
@@ -16,13 +24,13 @@ Define a JavaScript Map object and assign to it a variable called myMap. Add the
 
 # --hints--
 
-The myMap object should exist.
+The `myMap` object should exist.
 
 ```js
 assert(typeof myMap === 'object');
 ```
 
-myMap should contain the key value pair `freeCodeCamp`, `Awesome!`.
+`myMap` should contain the key value pair `freeCodeCamp`, `Awesome!`.
 
 ```js
 assert(myMap.get('freeCodeCamp') === 'Awesome!');
@@ -39,5 +47,7 @@ assert(myMap.get('freeCodeCamp') === 'Awesome!');
 # --solutions--
 
 ```js
-// solution required
+const myMap = new Map();
+
+myMap.set("freeCodeCamp", "Awesome!");
 ```
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree.md
index 43d58845d26..a359575e5f7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree.md
@@ -46,6 +46,25 @@ assert(
 );
 ```
 
+Trying to remove an element from an empty tree should return `null`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    if (typeof test.remove !== 'function') {
+      return false;
+    }
+    return test.remove(100) == null;
+  })()
+);
+```
+
 Trying to remove an element that does not exist should return `null`.
 
 ```js
@@ -60,6 +79,8 @@ assert(
     if (typeof test.remove !== 'function') {
       return false;
     }
+    test.add(15);
+    test.add(30);
     return test.remove(100) == null;
   })()
 );
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.md
index db24b0b29ee..808d2f722ba 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.md
@@ -128,14 +128,15 @@ assert(
     if (typeof test.remove !== 'function') {
       return false;
     }
-    test.add(-1);
+    test.add(1);
+    test.add(4);
     test.add(3);
-    test.add(7);
-    test.add(16);
-    test.remove(16);
-    test.remove(7);
+    test.add(2);
+    test.add(6);
+    test.add(8);
+    test.remove(6);
     test.remove(3);
-    return test.inorder().join('') == '-1';
+    return test.inorder().join('') == '1248';
   })()
 );
 ```
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/depth-first-search.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/depth-first-search.md
index 8fedd91cc51..d03cf5a4b33 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/depth-first-search.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/depth-first-search.md
@@ -49,6 +49,23 @@ assert.sameMembers(
 );
 ```
 
+The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]` with a start node of `3` should return an array with `3`, `2`, `1`, and `0`.
+
+```js
+assert.sameMembers(
+  (function () {
+    var graph = [
+      [0, 1, 0, 0],
+      [1, 0, 1, 0],
+      [0, 1, 0, 1],
+      [0, 0, 1, 0]
+    ];
+    return dfs(graph, 3);
+  })(),
+  [3, 2, 1, 0]
+);
+```
+
 The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]` with a start node of `1` should return an array with four elements.
 
 ```js
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md
index 158817a64db..efc98e7be70 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md
@@ -18,7 +18,7 @@ Let's implement heap sort with a min heap. Feel free to adapt your max heap code
 
 # --hints--
 
-The MinHeap data structure should exist.
+The `MinHeap` data structure should exist.
 
 ```js
 assert(
@@ -32,7 +32,7 @@ assert(
 );
 ```
 
-MinHeap should have a method called insert.
+`MinHeap` should have a method called `insert`.
 
 ```js
 assert(
@@ -48,7 +48,7 @@ assert(
 );
 ```
 
-MinHeap should have a method called remove.
+`MinHeap` should have a method called `remove`.
 
 ```js
 assert(
@@ -64,7 +64,7 @@ assert(
 );
 ```
 
-MinHeap should have a method called sort.
+`MinHeap` should have a method called `sort`.
 
 ```js
 assert(
@@ -80,7 +80,7 @@ assert(
 );
 ```
 
-The sort method should return an array containing all items added to the min heap in sorted order.
+The `sort` method should return an array containing all items added to the min heap in sorted order.
 
 ```js
 assert(
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/incidence-matrix.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/incidence-matrix.md
index 068b629cdd8..5b5e174b7b0 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/incidence-matrix.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/incidence-matrix.md
@@ -18,7 +18,7 @@ Each column will represent a unique edge. Also, each edge connects two nodes. To
 
 <blockquote>    1<br>   ---<br>1 | 1<br>2 | 0<br>3 | 1</blockquote>
 
-Here is an example of an `incidence matrix` with 4 edges and 4 nodes. Remember, the columns are the edges and rows are the nodes themselves.
+Here is an example of an incidence matrix with 4 edges and 4 nodes. Remember, the columns are the edges and rows are the nodes themselves.
 
 <blockquote>    1 2 3 4<br>   --------<br>1 | 0 1 1 1<br>2 | 1 1 0 0<br>3 | 1 0 0 1<br>4 | 0 0 1 0</blockquote>
 
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 e20657a87c8..3528a99be9a 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
@@ -48,7 +48,7 @@ Finally, add a `print` method which returns an array of all the items that have
 
 # --hints--
 
-The MaxHeap data structure should exist.
+The `MaxHeap` data structure should exist.
 
 ```js
 assert(
@@ -62,7 +62,7 @@ assert(
 );
 ```
 
-MaxHeap should have a method called insert.
+`MaxHeap` should have a method called `insert`.
 
 ```js
 assert(
@@ -78,7 +78,7 @@ assert(
 );
 ```
 
-MaxHeap should have a method called print.
+`MaxHeap` should have a method called `print`.
 
 ```js
 assert(
@@ -94,7 +94,7 @@ assert(
 );
 ```
 
-The insert method should add elements according to the max heap property.
+The `insert` method should add elements according to the max heap property.
 
 ```js
 assert(
@@ -110,8 +110,12 @@ assert(
     test.insert(700);
     test.insert(32);
     test.insert(51);
-    let result = test.print();
-    return result.length == 5 ? result[0] == 700 : result[1] == 700;
+    test.insert(800);
+    const result = test.print();
+    const solution = JSON.stringify([null,800,51,700,32,50,100]);
+    const solutionWithoutNull = JSON.stringify([800,51,700,32,50,100]);
+
+    return (result.length == 6) ? (JSON.stringify(result) == solutionWithoutNull) : (JSON.stringify(result) == solution);
   })()
 );
 ```
@@ -133,20 +137,28 @@ var MaxHeap = function() {
 ```js
 var MaxHeap = function() {
     // Only change code below this line
-    this.heap = [null];
-    this.insert = (ele) => {
-        var index = this.heap.length;
-        var arr = [...this.heap];
-        arr.push(ele);
-        while (ele > arr[Math.floor(index / 2)] && index > 1) {
-            arr[index] = arr[Math.floor(index / 2)];
-            arr[Math.floor(index / 2)] = ele;
-            index = arr[Math.floor(index / 2)];
-        }
-        this.heap = arr;
+    this.heap = [];
+    this.parent = index => {
+      return Math.floor((index - 1) / 2);
+    }
+    this.insert = element => {
+      this.heap.push(element);
+      this.heapifyUp(this.heap.length - 1);
+    }
+    this.heapifyUp = index => {
+      let currentIndex = index,
+      parentIndex = this.parent(currentIndex);
+      while (currentIndex > 0 && this.heap[currentIndex] > this.heap[parentIndex]) {
+        this.swap(currentIndex, parentIndex);
+        currentIndex = parentIndex;
+        parentIndex = this.parent(parentIndex);
+      }
+    }
+    this.swap = (index1, index2) => {
+      [this.heap[index1], this.heap[index2]] = [this.heap[index2], this.heap[index1]];
     }
     this.print = () => {
-        return this.heap.slice(1);
+      return this.heap;
     }
     // Only change code above this line
 };
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md
index ea0caa1b3ed..4e0aa41ecce 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md
@@ -1,6 +1,6 @@
 ---
 id: 587d8254367417b2b2512c6f
-title: Perform a Subset Check on Two Sets of Data
+title: 對兩組數據執行子集檢查
 challengeType: 1
 forumTopicId: 301707
 dashedName: perform-a-subset-check-on-two-sets-of-data
@@ -8,13 +8,13 @@ dashedName: perform-a-subset-check-on-two-sets-of-data
 
 # --description--
 
-In this exercise, we are going to perform a subset test on 2 sets of data. We will create a method on our `Set` data structure called `isSubsetOf`. This will compare the first set against the second, and if the first set is fully contained within the second, it will return `true`.
+在本練習中，我們將對 2 組數據執行子集測試。 我們將在我們的 `Set` 數據結構上創建一個名爲 `isSubsetOf` 的方法。 這將比較第一組與第二組，如果第一組完全包含在第二組中，則它將返回 `true`。
 
-For example, if `setA = ['a','b']` and `setB = ['a','b','c','d']`, then `setA` is a subset of `setB`, so `setA.isSubsetOf(setB)` should return `true`.
+例如，如果 `setA = ['a','b']` 和 `setB = ['a','b','c','d']`，那麼 `setA` 是 `setB` 的子集，所以 `setA.isSubsetOf(setB)` 應該返回 `true`。
 
 # --hints--
 
-Your `Set` class should have a `isSubsetOf` method.
+你的 `Set` 類應該有一個 `isSubsetOf` 方法。
 
 ```js
 assert(
@@ -25,7 +25,7 @@ assert(
 );
 ```
 
-The first Set() should be contained in the second Set
+The first `Set` should be contained in the second `Set`.
 
 ```js
 assert(
@@ -43,7 +43,7 @@ assert(
 );
 ```
 
-`['a', 'b'].isSubsetOf(['a', 'b', 'c', 'd'])` should return `true`
+`['a', 'b'].isSubsetOf(['a', 'b', 'c', 'd'])` should return `true`.
 
 ```js
 assert(
@@ -62,7 +62,7 @@ assert(
 );
 ```
 
-`['a', 'b', 'c'].isSubsetOf(['a', 'b'])` should return `false`
+`['a', 'b', 'c'].isSubsetOf(['a', 'b'])` should return `false`.
 
 ```js
 assert(
@@ -80,7 +80,7 @@ assert(
 );
 ```
 
-`[].isSubsetOf([])` should return `true`
+`[].isSubsetOf([])` should return `true`.
 
 ```js
 assert(
@@ -93,7 +93,7 @@ assert(
 );
 ```
 
-`['a', 'b'].isSubsetOf(['c', 'd'])` should return `false`
+`['a', 'b'].isSubsetOf(['c', 'd'])` should return `false`.
 
 ```js
 assert(
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md
index 04ecfb767f8..3c5455892a6 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md
@@ -25,7 +25,7 @@ assert(
 );
 ```
 
-The union of a Set containing values ["a", "b", "c"] and a Set containing values ["c", "d"] should return a new Set containing values ["a", "b", "c", "d"].
+The union of a `Set` containing values `["a", "b", "c"]` and a `Set` containing values `["c", "d"]` should return a new `Set` containing values `["a", "b", "c", "d"]`.
 
 ```js
 assert(
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
index 858073f2112..ecd6876805a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
@@ -22,7 +22,7 @@ Instructions: Add a method to our max heap called `remove`. This method should r
 
 # --hints--
 
-The MaxHeap data structure should exist.
+The `MaxHeap` data structure should exist.
 
 ```js
 assert(
@@ -36,7 +36,7 @@ assert(
 );
 ```
 
-MaxHeap should have a method called print.
+`MaxHeap` should have a method called `print`.
 
 ```js
 assert(
@@ -52,7 +52,7 @@ assert(
 );
 ```
 
-MaxHeap should have a method called insert.
+`MaxHeap` should have a method called `insert`.
 
 ```js
 assert(
@@ -68,7 +68,7 @@ assert(
 );
 ```
 
-MaxHeap should have a method called remove.
+`MaxHeap` should have a method called `remove`.
 
 ```js
 assert(
@@ -84,7 +84,7 @@ assert(
 );
 ```
 
-The remove method should remove the greatest element from the max heap while maintaining the max heap property.
+The `remove` method should remove the greatest element from the max heap while maintaining the max heap property.
 
 ```js
 assert(
@@ -114,21 +114,29 @@ assert(
 ## --seed-contents--
 
 ```js
-var MaxHeap = function() {
-  this.heap = [null];
-  this.insert = (ele) => {
-    var index = this.heap.length;
-    var arr = [...this.heap];
-    arr.push(ele);
-    while (ele > arr[Math.floor(index / 2)] && index > 1) {
-      arr[index] = arr[Math.floor(index / 2)];
-      arr[Math.floor(index / 2)] = ele;
-      index = arr[Math.floor(index / 2)];
+var MaxHeap = function () {
+  this.heap = [];
+  this.parent = index => {
+    return Math.floor((index - 1) / 2);
+  }
+  this.insert = element => {
+    this.heap.push(element);
+    this.heapifyUp(this.heap.length - 1);
+  }
+  this.heapifyUp = index => {
+    let currentIndex = index,
+    parentIndex = this.parent(currentIndex);
+    while (currentIndex > 0 && this.heap[currentIndex] > this.heap[parentIndex]) {
+      this.swap(currentIndex, parentIndex);
+      currentIndex = parentIndex;
+      parentIndex = this.parent(parentIndex);
     }
-    this.heap = arr;
+  }
+  this.swap = (index1, index2) => {
+    [this.heap[index1], this.heap[index2]] = [this.heap[index2], this.heap[index1]];
   }
   this.print = () => {
-    return this.heap.slice(1);
+    return this.heap;
   }
   // Only change code below this line
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.md
index 9a8e59f77fc..56392c469ad 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.md
@@ -14,7 +14,7 @@ Let's write a `removeAt` method that removes the `element` at a given `index`. T
 
 A common technique used to iterate through the elements of a linked list involves a <dfn>'runner'</dfn>, or sentinel, that 'points' at the nodes that your code is comparing. In our case, starting at the `head` of our list, we start with a `currentIndex` variable that starts at `0`. The `currentIndex` should increment by one for each node we pass.
 
-Just like our `remove(element)` method, which [we covered in a previous lesson](/learn/coding-interview-prep/data-structures/remove-elements-from-a-linked-list), we need to be careful not to orphan the rest of our list when we remove the node in our `removeAt(index)` method. We keep our nodes contiguous by making sure that the node that has reference to the removed node has a reference to the next node.
+Just like our `remove(element)` method, which <a href="/learn/coding-interview-prep/data-structures/remove-elements-from-a-linked-list" target="_blank" rel="noopener noreferrer nofollow">we covered in a previous lesson</a>, we need to be careful not to orphan the rest of our list when we remove the node in our `removeAt(index)` method. We keep our nodes contiguous by making sure that the node that has reference to the removed node has a reference to the next node.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
index 58edfaa2a50..c26c4677db7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
@@ -12,7 +12,7 @@ Let's create one more method for our doubly linked list called reverse which rev
 
 # --hints--
 
-The DoublyLinkedList data structure should exist.
+The `DoublyLinkedList` data structure should exist.
 
 ```js
 assert(
@@ -26,7 +26,7 @@ assert(
 );
 ```
 
-The DoublyLinkedList should have a method called reverse.
+The `DoublyLinkedList` should have a method called `reverse`.
 
 ```js
 assert(
@@ -43,7 +43,7 @@ assert(
 );
 ```
 
-Reversing an empty list should return null.
+Reversing an empty list should return `null`.
 
 ```js
 assert(
@@ -57,7 +57,7 @@ assert(
 );
 ```
 
-The reverse method should reverse the list.
+The `reverse` method should reverse the list.
 
 ```js
 assert(
@@ -77,7 +77,7 @@ assert(
 );
 ```
 
-The next and previous references should be correctly maintained when a list is reversed.
+The `next` and `previous` references should be correctly maintained when a list is reversed.
 
 ```js
 assert(
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/search-within-a-linked-list.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/search-within-a-linked-list.md
index 03361689fef..aa2c05c8810 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/search-within-a-linked-list.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/search-within-a-linked-list.md
@@ -16,7 +16,7 @@ Let's also implement a method that does the opposite: an `elementAt` method that
 
 # --instructions--
 
-Write an `isEmpty` method that checks if the linked list is empty, an `indexOf` method that returns the `index` of a given element, and an `elementAt` that returns an `element` at a given `index.`
+Write an `isEmpty` method that checks if the linked list is empty, an `indexOf` method that returns the `index` of a given element, and an `elementAt` that returns an `element` at a given `index`.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md
index b02f10043d3..43cea5739cc 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md
@@ -8,13 +8,13 @@ dashedName: use-breadth-first-search-in-a-binary-search-tree
 
 # --description--
 
-Here we will introduce another tree traversal method: breadth-first search. In contrast to the depth-first search methods from the last challenge, breadth-first search explores all the nodes in a given level within a tree before continuing on to the next level. Typically, queues are utilized as helper data structures in the design of breadth-first search algorithms.
+這裏我們將介紹另一種樹遍歷方法：廣度優先搜索。 與上一次挑戰中的深度優先搜索方法相比，廣度優先搜索在繼續進入下一級別之前探索樹中給定級別中的所有節點。 通常，隊列在廣度優先搜索算法的設計中用作輔助數據結構。
 
-In this method, we start by adding the root node to a queue. Then we begin a loop where we dequeue the first item in the queue, add it to a new array, and then inspect both its child subtrees. If its children are not null, they are each enqueued. This process continues until the queue is empty.
+在此方法中，我們首先將根節點添加到隊列中。 然後我們開始一個循環，我們將隊列中的第一個項目出列，將其添加到一個新數組，然後檢查它們的子子樹。 If its children are not null, they are each enqueued. 此過程將繼續，直到隊列爲空。
 
 # --instructions--
 
-Let's create a breadth-first search method in our tree called `levelOrder`. This method should return an array containing the values of all the tree nodes, explored in a breadth-first manner. Be sure to return the values in the array, not the nodes themselves. A level should be traversed from left to right. Next, let's write a similar method called `reverseLevelOrder` which performs the same search but in the reverse direction (right to left) at each level.
+Let's create a breadth-first search method in our tree called `levelOrder`. 此方法應返回一個包含所有樹節點值的數組，並以廣度優先的方式進行探索。 確保返回數組中的值，而不是節點本身。 應從左到右遍歷一個級別。 接下來，讓我們編寫一個名爲`reverseLevelOrder`的類似方法，它在每個級別執行相同的搜索，但是反向（從右到左）。
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5.md
index ff256d48a47..045679e88a8 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5.md
@@ -1,44 +1,44 @@
 ---
 id: 5900f36e1000cf542c50fe80
-title: 'Problem 1: Multiples of 3 and 5'
-challengeType: 5
+title: '問題 1：3 或 5 的倍數'
+challengeType: 1
 forumTopicId: 301722
 dashedName: problem-1-multiples-of-3-and-5
 ---
 
 # --description--
 
-If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
+If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. 這些倍數的總和是 23。
 
-Find the sum of all the multiples of 3 or 5 below the provided parameter value `number`.
+在提供的參數值 `number` 下找到所有 3 或 5 的倍數之和。
 
 # --hints--
 
-`multiplesOf3and5(10)` should return a number.
+`multiplesOf3and5(10)` 應該返回一個數字。
 
 ```js
 assert(typeof multiplesOf3and5(10) === 'number');
 ```
 
-`multiplesOf3and5(49)` should return 543.
+`multiplesOf3and5(49)` 應該返回 543。
 
 ```js
 assert.strictEqual(multiplesOf3and5(49), 543);
 ```
 
-`multiplesOf3and5(1000)` should return 233168.
+`multiplesOf3and5(1000)` 應該返回 233168。
 
 ```js
 assert.strictEqual(multiplesOf3and5(1000), 233168);
 ```
 
-`multiplesOf3and5(8456)` should return 16687353.
+`multiplesOf3and5(8456)` 應該返回 16687353。
 
 ```js
 assert.strictEqual(multiplesOf3and5(8456), 16687353);
 ```
 
-`multiplesOf3and5(19564)` should return 89301183.
+`multiplesOf3and5(19564)` 應該返回 89301183。
 
 ```js
 assert.strictEqual(multiplesOf3and5(19564), 89301183);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
index d1194e13f33..39ab831dad7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3761000cf542c50fe89
 title: 'Problem 10: Summation of primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301723
 dashedName: problem-10-summation-of-primes
 ---
@@ -60,21 +60,46 @@ primeSummation(2000000);
 # --solutions--
 
 ```js
-function primeSummation(n) {
-  if (n < 3) { return 0 };
-  let nums = [0, 0, 2];
-  for (let i = 3; i < n; i += 2){
-    nums.push(i);
-    nums.push(0);
-  }
-  let sum = 2;
-  for (let i = 3; i < n; i += 2){
-    if (nums[i] !== 0){
-      sum += nums[i];
-      for (let j = i*i; j < n; j += i){
-        nums[j] = 0;
+class PrimeSeive {
+  constructor(num) {
+    const seive = Array(Math.floor((num - 1) / 2)).fill(true);
+    const upper = Math.floor((num - 1) / 2);
+    const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+
+    for (let i = 0; i <= sqrtUpper; i++) {
+      if (seive[i]) {
+        // Mark value in seive array
+        const prime = 2 * i + 3;
+        // Mark all multiples of this number as false (not prime)
+        const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+        for (let j = primeSqaredIndex; j < upper; j += prime) {
+          seive[j] = false;
+        }
       }
     }
+
+    this._seive = seive;
+  }
+
+  isPrime(num) {
+    return num === 2
+      ? true
+      : num % 2 === 0
+        ? false
+        : this.isOddPrime(num);
+  }
+
+  isOddPrime(num) {
+    return this._seive[(num - 3) / 2];
+  }
+};
+
+function primeSummation(num) {
+  const primeSeive = new PrimeSeive(num);
+
+  let sum = 2;
+  for (let i = 3; i < num; i += 2) {
+    if (primeSeive.isOddPrime(i)) sum += i;
   }
   return sum;
 }
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 1d44675e282..4507fa49c56 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d01000cf542c50fee3
 title: 'Problem 100: Arranged probability'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301724
 dashedName: problem-100-arranged-probability
 ---
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 cd51f0f2ecc..803f95dc33e 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d21000cf542c50fee4
 title: 'Problem 101: Optimum polynomial'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301725
 dashedName: problem-101-optimum-polynomial
 ---
@@ -20,7 +20,9 @@ As a basis, if we were only given the first term of sequence, it would be most s
 
 Hence we obtain the following OPs for the cubic sequence:
 
-$$\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}$$
+$$\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 $\color{red}{red}$ above), we obtain 1 + 15 + 58 = 74. Consider the following tenth degree polynomial generating function:
 
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 9705afbc6f3..c90a827dda3 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d21000cf542c50fee5
 title: 'Problem 102: Triangle containment'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301726
 dashedName: problem-102-triangle-containment
 ---
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 677153bd674..fbbbbbb551f 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
@@ -1,25 +1,28 @@
 ---
 id: 5900f3d61000cf542c50fee7
-title: 'Problem 103: Special subset sums: optimum'
-challengeType: 5
+title: '問題 103：特殊子集和：最優'
+challengeType: 1
 forumTopicId: 301727
 dashedName: problem-103-special-subset-sums-optimum
 ---
 
 # --description--
 
-Let $S(A)$ represent the sum of elements in set A of size n. We shall call it a special sum set if for any two non-empty disjoint subsets, B and C, the following properties are true:
+設 $S(A)$ 是大小爲 n 的集合 A 中所有元素之和。 若任取集合 A 中任意兩個非空且沒有交集的集合 B 和 C，滿足下列兩個條件，那麼我們就稱集合 A 爲特殊的和集：
 
-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)$.
+1. $S(B) ≠ S(C)$; 即任意子集所有元素的和均不相同。
+2. 如果集合 B 中的元素個數多於集合 C，那麼 $S(B) > S(C)$。
 
-If $S(A)$ is minimised for a given n, we shall call it an optimum special sum set. The first five optimum special sum sets are given below.
+對於給定的數字 n，我們稱使得 $S(A)$ 最小的集合 A 爲最優特殊和集。 下面給出前五個最優特殊和集。
 
-$$\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}$$
+$$\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}$$
 
-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.
+由上述規律可以猜測，似乎對於一個給定的最優特殊和集 $A = \\{a_1, a_2, \ldots, a_n\\}$，下一個最優特殊和集將會是 $B = \\{b, a_1 + b, a_2 + b, \ldots, a_n + b\\}$，其中 b 是集合 A 的“中間”元素。
 
-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`.
+通過上述“規則”，我們猜測當 $n = 6$ 時，最優特殊和集應爲 $A = \\{11, 17, 20, 22, 23, 24\\}$，且 $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.
 
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 1c61ea7c2ed..baa7dcbfdbd 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d51000cf542c50fee6
 title: 'Problem 104: Pandigital Fibonacci ends'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301728
 dashedName: problem-104-pandigital-fibonacci-ends
 ---
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 0a5d611f908..65204d956df 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d61000cf542c50fee8
-title: 'Problem 105: Special subset sums: testing'
-challengeType: 5
+title: '問題 105：特殊子集和：測試'
+challengeType: 1
 forumTopicId: 301729
 dashedName: problem-105-special-subset-sums-testing
 ---
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 e771a72835d..951109fc7bf 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d71000cf542c50fee9
-title: 'Problem 106: Special subset sums: meta-testing'
-challengeType: 5
+title: '問題 106：特殊子集和：元測試'
+challengeType: 1
 forumTopicId: 301730
 dashedName: problem-106-special-subset-sums-meta-testing
 ---
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 312e9f33122..d9b09a35d09 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d91000cf542c50feea
-title: 'Problem 107: Minimal network'
-challengeType: 5
+title: '問題 107：最小網絡'
+challengeType: 1
 forumTopicId: 301731
 dashedName: problem-107-minimal-network
 ---
@@ -27,7 +27,7 @@ The same network can be represented by the matrix below.
 
 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;" />
+<img class="img-responsive center-block" alt="Network with 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`.
 
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 3b8d6f014f3..56fbe532238 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d91000cf542c50feeb
 title: 'Problem 108: Diophantine Reciprocals I'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301732
 dashedName: problem-108-diophantine-reciprocals-i
 ---
@@ -14,7 +14,9 @@ $$\frac{1}{x} + \frac{1}{y} = \frac{1}{n}$$
 
 For `n` = 4 there are exactly three distinct solutions:
 
-$$\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}$$
+$$\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?
 
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 3b16fe7ac69..5064f7e146c 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3db1000cf542c50feec
 title: 'Problem 109: Darts'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301733
 dashedName: problem-109-darts
 ---
@@ -20,7 +20,12 @@ There are many variations of rules but in the most popular game the players will
 
 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:
 
-$$\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}$$
+$$\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}$$
 
 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?
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid.md
index d7610e3ac39..e7c5d173ab1 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3781000cf542c50fe8a
-title: 'Problem 11: Largest product in a grid'
-challengeType: 5
+title: '問題 11：矩陣中最大的乘積'
+challengeType: 1
 forumTopicId: 301734
 dashedName: problem-11-largest-product-in-a-grid
 ---
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 79070c6654d..6ada6d6dffd 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3db1000cf542c50feed
-title: 'Problem 110: Diophantine Reciprocals II'
-challengeType: 5
+title: '問題 110：丟番圖倒數 II'
+challengeType: 1
 forumTopicId: 301735
 dashedName: problem-110-diophantine-reciprocals-ii
 ---
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 a6a9958de73..7f22fbffb6c 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3db1000cf542c50feee
 title: 'Problem 111: Primes with runs'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301736
 dashedName: problem-111-primes-with-runs
 ---
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 d2b8f071980..7599de29978 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3dd1000cf542c50feef
 title: 'Problem 112: Bouncy numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301738
 dashedName: problem-112-bouncy-numbers
 ---
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 a06f41a9a5e..98ad4b845bf 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3dd1000cf542c50fef0
-title: 'Problem 113: Non-bouncy numbers'
-challengeType: 5
+title: '問題 113：非彈性數'
+challengeType: 1
 forumTopicId: 301739
 dashedName: problem-113-non-bouncy-numbers
 ---
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 c6690bddf5b..e7079163123 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
@@ -1,20 +1,20 @@
 ---
 id: 5900f3e01000cf542c50fef2
-title: 'Problem 114: Counting block combinations I'
-challengeType: 5
+title: '問題 114：計算塊組合 I'
+challengeType: 1
 forumTopicId: 301740
 dashedName: problem-114-counting-block-combinations-i
 ---
 
 # --description--
 
-A row measuring seven units in length has red blocks with a minimum length of three units placed on it, such that any two red blocks (which are allowed to be different lengths) are separated by at least one black square. There are exactly seventeen ways of doing this.
+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. 有 17 種方法可以做到這一點。
 
 <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?
+有多少種方法可以填充長度爲 50 個單位的行？
 
-**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).
+**Note:** Although the example above does not lend itself to the possibility, in general it is permitted to mix block sizes. 例如，在長度爲 8 個單位的行上，你可以使用紅色 (3)、黑色 (1) 和紅色 (4)。
 
 # --hints--
 
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 a88bc07a34a..73a6974b38a 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3e01000cf542c50fef3
 title: 'Problem 116: Red, green or blue tiles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301742
 dashedName: problem-116-red-green-or-blue-tiles
 ---
@@ -12,23 +12,23 @@ 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;" />
+<img class="img-responsive center-block" alt="將紅色塊放在長度爲 5 個單元的一行中的可能方法" 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;" />
+<img class="img-responsive center-block" alt="將綠色塊放在長度爲 5 個單位的一行中的可能方法" 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.
 
-<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;" />
+<img class="img-responsive center-block" alt="將藍色塊放在長度爲 5 個單位的一行中的可能方法" 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?
+假定顏色不能混合，則有 7 + 3 + 2 = 12 種方法來替換長度爲 5 個單位的黑色瓷磚。 如果顏色不能混合且至少必須使用一個彩色瓷塊，那麼一行長度爲50個單位的黑色瓷塊可以有多少種不同的更換方式？
 
-**Note:** This is related to Problem 117.
+**注意：** 這與問題 117 有關。
 
 # --hints--
 
-`redGreenBlueOne()` should return `20492570929`.
+`redGreenBlueOne()` 應該返回 `20492570929`。
 
 ```js
 assert.strictEqual(redGreenBlueOne(), 20492570929);
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 ed6d0355598..f93d9d7f4ad 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3e21000cf542c50fef4
 title: 'Problem 117: Red, green, and blue tiles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301743
 dashedName: problem-117-red-green-and-blue-tiles
 ---
@@ -10,15 +10,15 @@ 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.
 
-<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;" />
+<img class="img-responsive center-block" alt="將紅色、綠色和藍色塊放置在長度爲 5 單位的一行中的可能方法" 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.
+**注意**：這一題與問題 116 有關。
 
 # --hints--
 
-`redGreenBlueTilesTwo()` should return `100808458960497`.
+`redGreenBlueTilesTwo()` 應該返回 `100808458960497`。
 
 ```js
 assert.strictEqual(redGreenBlueTilesTwo(), 100808458960497);
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 00a0605319f..eeeb4bdccbe 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
@@ -1,20 +1,20 @@
 ---
 id: 5900f3e21000cf542c50fef5
-title: 'Problem 118: Pandigital prime sets'
-challengeType: 5
+title: '問題 118：全數字（Pandigital）素數集'
+challengeType: 1
 forumTopicId: 301744
 dashedName: problem-118-pandigital-prime-sets
 ---
 
 # --description--
 
-Using all of the digits 1 through 9 and concatenating them freely to form decimal integers, different sets can be formed. Interestingly with the set $\\{2, 5, 47, 89, 631\\}$, all of the elements belonging to it are prime.
+Using all of the digits 1 through 9 and concatenating them freely to form decimal integers, different sets can be formed. 有趣的是，對於集合 $\\{2, 5, 47, 89, 631\\}$，所有屬於它的元素都是素數。
 
 How many distinct sets containing each of the digits one through nine exactly once contain only prime elements?
 
 # --hints--
 
-`pandigitalPrimeSets()` should return `44680`.
+`pandigitalPrimeSets()` 應該返回 `44680`。
 
 ```js
 assert.strictEqual(pandigitalPrimeSets(), 44680);
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 72ed8397d7b..a47297635ff 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
@@ -1,24 +1,24 @@
 ---
 id: 5900f3e41000cf542c50fef6
 title: 'Problem 119: Digit power sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301745
 dashedName: problem-119-digit-power-sum
 ---
 
 # --description--
 
-The number 512 is interesting because it is equal to the sum of its digits raised to some power: $5 + 1 + 2 = 8$, and $8^3 = 512$. Another example of a number with this property is $614656 = 28^4$.
+數字 512 很有趣，因爲它等於其各位數字之和的某個冪：$5 + 1 + 2 = 8$，$8^3 = 512$。 Another example of a number with this property is $614656 = 28^4$.
 
-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.
+我們定義 $a_n$ 爲這種序列中的第 $n-th$ 項，並要求這種序列至少包含兩位數字。
 
-You are given that $a_2 = 512$ and $a_{10} = 614656$.
+已知 $a_2 = 512$ 而 $a_{10} = 614656$。
 
-Find $a_{30}$.
+求 $a_{30}$。
 
 # --hints--
 
-`digitPowerSum()` should return `248155780267521`.
+`digitPowerSum()` 應該返回 `248155780267521`
 
 ```js
 assert.strictEqual(digitPowerSum(), 248155780267521);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number.md
index b14276a81e7..ebe647d18f7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f3781000cf542c50fe8b
 title: 'Problem 12: Highly divisible triangular number'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301746
 dashedName: problem-12-highly-divisible-triangular-number
 ---
 
 # --description--
 
-The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:
+The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. 序列的前十項是：
 
 <div style='text-align: center;'>1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...</div>
 
@@ -58,7 +58,7 @@ assert.strictEqual(divisibleTriangleNumber(167), 1385280);
 assert.strictEqual(divisibleTriangleNumber(374), 17907120);
 ```
 
-`divisibleTriangleNumber(500)` should return 76576500.
+`divisibleTriangleNumber(500)`應該返回76576500。
 
 ```js
 assert.strictEqual(divisibleTriangleNumber(500), 76576500);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.md
index 1cc716c41ca..cf6c5ca7c35 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f3e51000cf542c50fef8
 title: 'Problem 121: Disc game prize fund'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301748
 dashedName: problem-121-disc-game-prize-fund
 ---
 
 # --description--
 
-A bag contains one red disc and one blue disc. In a game of chance a player takes a disc at random and its colour is noted. After each turn the disc is returned to the bag, an extra red disc is added, and another disc is taken at random.
+A bag contains one red disc and one blue disc. 在機會遊戲中，玩家隨機拿一張圓盤並記錄它的顏色。 每轉一圈後，將圓盤放回包中，額外添加一個紅色圓盤，並隨機取出另一圓盤。
 
-The player pays £1 to play and wins if they have taken more blue discs than red discs at the end of the game.
+玩家支付 1 英鎊來參加遊戲，如果他在遊戲結束時獲得的藍盤比紅盤多則獲得勝利。
 
-If the game is played for four turns, the probability of a player winning is exactly 11/120, and so the maximum prize fund the banker should allocate for winning in this game would be £10 before they would expect to incur a loss. Note that any payout will be a whole number of pounds and also includes the original £1 paid to play the game, so in the example given the player actually wins £9.
+如果遊戲進行四回合，那麼玩家獲勝的概率恰好是 11/120，因此莊家爲這場遊戲中分配的最高獎金應該是 10 英鎊，以避免產生期望損失。 請注意，任何支付都將是一個整數英鎊，包含爲玩遊戲而支付的原始 1 英鎊，因此在給出的示例中，玩家實際上贏得了 9 英鎊。
 
-Find the maximum prize fund that should be allocated to a single game in which fifteen turns are played.
+找到玩 15 個回合時分配給單局遊戲的最大獎金。
 
 # --hints--
 
-`euler121()` should return 2269.
+`discGamePrize()` 應該返回 `2269`。
 
 ```js
-assert.strictEqual(euler121(), 2269);
+assert.strictEqual(discGamePrize(), 2269);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler121(), 2269);
 ## --seed-contents--
 
 ```js
-function euler121() {
+function discGamePrize() {
 
   return true;
 }
 
-euler121();
+discGamePrize();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md
index 7da1b4274e3..78c29aa7952 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md
@@ -1,35 +1,40 @@
 ---
 id: 5900f3e61000cf542c50fef9
 title: 'Problem 122: Efficient exponentiation'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301749
 dashedName: problem-122-efficient-exponentiation
 ---
 
 # --description--
 
-The most naive way of computing n15 requires fourteen multiplications:
+The most naive way of computing $n^{15}$ requires fourteen multiplications:
 
-n × n × ... × n = n15
+$$n × n × \ldots × n = n^{15}$$
 
 But using a "binary" method you can compute it in six multiplications:
 
-n × n = n2n2 × n2 = n4n4 × n4 = n8n8 × n4 = n12n12 × n2 = n14n14 × n = n15
+$$\begin{align}   & n × n = n^2\\\\
+  & n^2 × n^2 = n^4\\\\   & n^4 × n^4 = n^8\\\\
+  & n^8 × n^4 = n^{12}\\\\   & n^{12} × n^2 = n^{14}\\\\
+  & n^{14} × n = n^{15} \end{align}$$
 
 However it is yet possible to compute it in only five multiplications:
 
-n × n = n2n2 × n = n3n3 × n3 = n6n6 × n6 = n12n12 × n3 = n15
+$$\begin{align}   & n × n = n^2\\\\
+  & n^2 × n = n^3\\\\   & n^3 × n^3 = n^6\\\\
+  & n^6 × n^6 = n^{12}\\\\ & n^{12} × n^3 = n^{15} \end{align}$$
 
-We shall define m(k) to be the minimum number of multiplications to compute nk; for example m(15) = 5.
+We shall define $m(k)$ to be the minimum number of multiplications to compute $n^k$; for example $m(15) = 5$.
 
-For 1 ≤ k ≤ 200, find ∑ m(k).
+For $1 ≤ k ≤ 200$, find $\sum{m(k)}$.
 
 # --hints--
 
-`euler122()` should return 1582.
+`efficientExponentation()` should return `1582`.
 
 ```js
-assert.strictEqual(euler122(), 1582);
+assert.strictEqual(efficientExponentation(), 1582);
 ```
 
 # --seed--
@@ -37,12 +42,12 @@ assert.strictEqual(euler122(), 1582);
 ## --seed-contents--
 
 ```js
-function euler122() {
+function efficientExponentation() {
 
   return true;
 }
 
-euler122();
+efficientExponentation();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
index 1dfc34dc9b3..f4c29af9719 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
@@ -1,49 +1,125 @@
 ---
 id: 5900f3e81000cf542c50fefb
-title: 'Problem 124: Ordered radicals'
-challengeType: 5
+title: '問題 124：根數排序'
+challengeType: 1
 forumTopicId: 301751
 dashedName: problem-124-ordered-radicals
 ---
 
 # --description--
 
-The radical of n, rad(n), is the product of the distinct prime factors of n. For example, 504 = 23 × 32 × 7, so rad(504) = 2 × 3 × 7 = 42.
+The radical of $n$, $rad(n)$, is the product of the distinct prime factors of $n$. 例如 $504 = 2^3 × 3^2 × 7$，故 $rad(504) = 2 × 3 × 7 = 42$。
 
-If we calculate rad(n) for 1 ≤ n ≤ 10, then sort them on rad(n), and sorting on n if the radical values are equal, we get:
+如果我們爲 $1 ≤ n ≤ 10$ 計算 $rad(n)$，然後按 $rad(n)$ 對它們進行排序，如果部首值相等則按 $n$ 排序，我們得到：
 
-Unsorted
+<div style="text-align: center;">
+  <table cellpadding="2" cellspacing="0" border="0" align="center">
+    <tbody>
+      <tr>
+        <td colspan="2">$Unsorted$</td>
+        <td></td>
+        <td colspan="3">$Sorted$</td>
+      </tr>
+      <tr>
+        <td>$n$</td>
+        <td>$rad(n)$</td>
+        <td></td>
+        <td>$n$</td>
+        <td>$rad(n)$</td>
+        <td>$k$</td>
+      </tr>
+      <tr>
+        <td>1</td>
+        <td>1</td>
+        <td></td>
+        <td>1</td>
+        <td>1</td>
+        <td>1</td>
+      </tr>
+      <tr>
+        <td>2</td>
+        <td>2</td>
+        <td></td>
+        <td>2</td>
+        <td>2</td>
+        <td>2</td>
+      </tr>
+      <tr>
+        <td>3</td>
+        <td>3</td>
+        <td></td>
+        <td>4</td>
+        <td>2</td>
+        <td>3</td>
+      </tr>
+      <tr>
+        <td>4</td>
+        <td>2</td>
+        <td></td>
+        <td>8</td>
+        <td>2</td>
+        <td>4</td>
+      </tr>
+      <tr>
+        <td>5</td>
+        <td>5</td>
+        <td></td>
+        <td>3</td>
+        <td>3</td>
+        <td>5</td>
+      </tr>
+      <tr>
+        <td>6</td>
+        <td>6</td>
+        <td></td>
+        <td>9</td>
+        <td>3</td>
+        <td>6</td>
+      </tr>
+      <tr>
+        <td>7</td>
+        <td>7</td>
+        <td></td>
+        <td>5</td>
+        <td>5</td>
+        <td>7</td>
+      </tr>
+      <tr>
+        <td>8</td>
+        <td>2</td>
+        <td></td>
+        <td>6</td>
+        <td>6</td>
+        <td>8</td>
+      </tr>
+      <tr>
+        <td>9</td>
+        <td>3</td>
+        <td></td>
+        <td>7</td>
+        <td>7</td>
+        <td>9</td>
+      </tr>
+      <tr>
+        <td>10</td>
+        <td>10</td>
+        <td></td>
+        <td>10</td>
+        <td>10</td>
+        <td>10</td>
+      </tr>
+    </tbody>
+  </table>
+</div><br>
 
-Sorted n rad(n)
-
-n rad(n) k 11
-
-111 22
-
-222 33
-
-423 42
-
-824 55
-
-335 66
-
-936 77
-
-557 82
-
-668 93
-
-779 1010
-
-101010 Let E(k) be the kth element in the sorted n column; for example, E(4) = 8 and E(6) = 9. If rad(n) is sorted for 1 ≤ n ≤ 100000, find E(10000).
+記 $E(k)$ 爲已經排序的 $n$ 列中的第 $k$ 個元素；例如，$E(4) = 8$ 且 $E(6) = 9$。 如果 $rad(n)$ 按 $1 ≤ n ≤ 100000$ 排序，找到 $E(10000)$。
 
 # --hints--
 
-`euler124()` should return 21417.
+`orderedRadicals()` 應該返回 `21417`。
 
 ```js
-assert.strictEqual(euler124(), 21417);
+assert.strictEqual(orderedRadicals(), 21417);
 ```
 
 # --seed--
@@ -51,12 +127,12 @@ assert.strictEqual(euler124(), 21417);
 ## --seed-contents--
 
 ```js
-function euler124() {
+function orderedRadicals() {
 
   return true;
 }
 
-euler124();
+orderedRadicals();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-125-palindromic-sums.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-125-palindromic-sums.md
index 460f5e2a237..9e26dfa108e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-125-palindromic-sums.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-125-palindromic-sums.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f3e91000cf542c50fefc
 title: 'Problem 125: Palindromic sums'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301752
 dashedName: problem-125-palindromic-sums
 ---
 
 # --description--
 
-The palindromic number 595 is interesting because it can be written as the sum of consecutive squares: 62 + 72 + 82 + 92 + 102 + 112 + 122.
+The palindromic number 595 is interesting because it can be written as the sum of consecutive squares: $6^2 + 7^2 + 8^2 + 9^2 + 10^2 + 11^2 + 12^2$.
 
-There are exactly eleven palindromes below one-thousand that can be written as consecutive square sums, and the sum of these palindromes is 4164. Note that 1 = 02 + 12 has not been included as this problem is concerned with the squares of positive integers.
+There are exactly eleven palindromes below one-thousand that can be written as consecutive square sums, and the sum of these palindromes is 4164. Note that $1 = 0^2 + 1^2$ has not been included as this problem is concerned with the squares of positive integers.
 
-Find the sum of all the numbers less than 108 that are both palindromic and can be written as the sum of consecutive squares.
+Find the sum of all the numbers less than $10^8$ that are both palindromic and can be written as the sum of consecutive squares.
 
 # --hints--
 
-`euler125()` should return 2906969179.
+`palindromicSums()` should return `2906969179`.
 
 ```js
-assert.strictEqual(euler125(), 2906969179);
+assert.strictEqual(palindromicSums(), 2906969179);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler125(), 2906969179);
 ## --seed-contents--
 
 ```js
-function euler125() {
+function palindromicSums() {
 
   return true;
 }
 
-euler125();
+palindromicSums();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md
index fe9b4a6aa80..4dd0a699532 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ea1000cf542c50fefd
 title: 'Problem 126: Cuboid layers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301753
 dashedName: problem-126-cuboid-layers
 ---
@@ -10,14 +10,24 @@ dashedName: problem-126-cuboid-layers
 
 The minimum number of cubes to cover every visible face on a cuboid measuring 3 x 2 x 1 is twenty-two.
 
-If we then add a second layer to this solid it would require forty-six cubes to cover every visible face, the third layer would require seventy-eight cubes, and the fourth layer would require one-hundred and eighteen cubes to cover every visible face. However, the first layer on a cuboid measuring 5 x 1 x 1 also requires twenty-two cubes; similarly the first layer on cuboids measuring 5 x 3 x 1, 7 x 2 x 1, and 11 x 1 x 1 all contain forty-six cubes. We shall define C(n) to represent the number of cuboids that contain n cubes in one of its layers. So C(22) = 2, C(46) = 4, C(78) = 5, and C(118) = 8. It turns out that 154 is the least value of n for which C(n) = 10. Find the least value of n for which C(n) = 1000.
+<img class="img-responsive center-block" alt="3x2x1 的長方體被 22 個 1x1x1 的立方體覆蓋" src="https://cdn.freecodecamp.org/curriculum/project-euler/cuboid-layers.png" style="background-color: white; padding: 10px;" />
+
+如果我們再添加第二層來覆蓋現在這個體的每一個可見面，則需要 64 個立方體，第三層需要 78 個立方體，第四層需要 118 個。
+
+而覆蓋尺寸爲 5 x 1 x 1 的長方體第一層同樣也需要 22 個小立方體；類似的覆蓋尺寸爲 5 x 3 x 1，7 x 2 x 1，和 11 x 1 x 1 的第一層都需要 46 個立方體。
+
+我們定義 $C(n)$ 爲可以用 $n$ 個小立方體覆蓋其某一層表面的長方體的數目。 則 $C(22) = 2$，$C(46) = 4$，$C(78) = 5$，而 $C(118) = 8$。
+
+可以發現 154 是滿足 $C(n) = 10$ 時 $n$ 的最小值。
+
+求滿足 $C(n) = 1000$ 時，$n$ 的最小值。
 
 # --hints--
 
-`euler126()` should return 18522.
+`cuboidLayers()` 應該返回 `18522`。
 
 ```js
-assert.strictEqual(euler126(), 18522);
+assert.strictEqual(cuboidLayers(), 18522);
 ```
 
 # --seed--
@@ -25,12 +35,12 @@ assert.strictEqual(euler126(), 18522);
 ## --seed-contents--
 
 ```js
-function euler126() {
+function cuboidLayers() {
 
   return true;
 }
 
-euler126();
+cuboidLayers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-127-abc-hits.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-127-abc-hits.md
index 665e17c0a74..0783b28dcaf 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-127-abc-hits.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-127-abc-hits.md
@@ -1,45 +1,39 @@
 ---
 id: 5900f3ec1000cf542c50fefe
 title: 'Problem 127: abc-hits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301754
 dashedName: problem-127-abc-hits
 ---
 
 # --description--
 
-The radical of n, rad(n), is the product of distinct prime factors of n. For example, 504 = 23 × 32 × 7, so rad(504) = 2 × 3 × 7 = 42.
+$n$ 的根數 $rad(n)$ 是 $n$ 的所有素數因子的積。 如 $504 = 2^3 × 3^2 × 7$，則 $rad(504) = 2 × 3 × 7 = 42$。
 
 We shall define the triplet of positive integers (a, b, c) to be an abc-hit if:
 
-GCD(a, b) = GCD(a, c) = GCD(b, c) = 1
+1. $GCD(a, b) = GCD(a, c) = GCD(b, c) = 1$ 即 a、b、c 兩兩互質
+2. $a &lt; b$
+3. $a + b = c$
+4. $rad(abc) &lt; c$
 
-a &lt; b
+例如， (5, 27, 32) 爲 abc-hit，因爲：
 
-a + b = c
+1. $GCD(5, 27) = GCD(5, 32) = GCD(27, 32) = 1$
+2. $5 &lt; 27$
+3. $5 + 27 = 32$
+4. $rad(4320) = 30 &lt; 32$
 
-rad(abc) &lt; c
+可以發現 abc-hits 非常罕見，對於 $c &lt; 1000$，只有 31 個 abc-hits，可得 $\sum{c} = 12523$。
 
-For example, (5, 27, 32) is an abc-hit, because:
-
-GCD(5, 27) = GCD(5, 32) = GCD(27, 32) = 1
-
-5 &lt; 27
-
-5 + 27 = 32
-
-rad(4320) = 30 &lt; 32
-
-It turns out that abc-hits are quite rare and there are only thirty-one abc-hits for c &lt; 1000, with ∑c = 12523.
-
-Find ∑c for c &lt; 120000.
+求 $c &lt; 120000$ 時的 $\sum{c}$。
 
 # --hints--
 
-`euler127()` should return 18407904.
+`abcHits()` 應該返回 `18407904`。
 
 ```js
-assert.strictEqual(euler127(), 18407904);
+assert.strictEqual(abcHits(), 18407904);
 ```
 
 # --seed--
@@ -47,12 +41,12 @@ assert.strictEqual(euler127(), 18407904);
 ## --seed-contents--
 
 ```js
-function euler127() {
+function abcHits() {
 
   return true;
 }
 
-euler127();
+abcHits();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
index 7bdd6242348..e3c053e56de 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ec1000cf542c50feff
 title: 'Problem 128: Hexagonal tile differences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301755
 dashedName: problem-128-hexagonal-tile-differences
 ---
@@ -12,14 +12,32 @@ A hexagonal tile with number 1 is surrounded by a ring of six hexagonal tiles, s
 
 New rings are added in the same fashion, with the next rings being numbered 8 to 19, 20 to 37, 38 to 61, and so on. The diagram below shows the first three rings.
 
-By finding the difference between tile n and each of its six neighbours we shall define PD(n) to be the number of those differences which are prime. For example, working clockwise around tile 8 the differences are 12, 29, 11, 6, 1, and 13. So PD(8) = 3. In the same way, the differences around tile 17 are 1, 17, 16, 1, 11, and 10, hence PD(17) = 2. It can be shown that the maximum value of PD(n) is 3. If all of the tiles for which PD(n) = 3 are listed in ascending order to form a sequence, the 10th tile would be 271. Find the 2000th tile in this sequence.
+<img class="img-responsive center-block" alt="前三圈排列好的六角磚，數字編號爲 1 到 37，其中磚 8 和磚 17高亮" src="https://cdn.freecodecamp.org/curriculum/project-euler/hexagonal-tile-differences.png" style="background-color: white; padding: 10px;" />
+
+通過計算磚 $n$ 和它周圍 6 塊磚的數字差，我們定位 $PD(n)$ 爲數字差中素數的個數。
+
+例如，圍繞磚 8 順時針方向的差額分別爲 12、29、11、6、1 和 13。 則 $PD(8) = 3$。
+
+同理，圍繞磚 17 的差額爲 1、17、16、1、11 和 10，所以 $PD(17) = 2$。
+
+可以發現 $PD(n)$ 的最大值是 $3$。
+
+如果 $PD(n) = 3$ 的磚按升序排列，那麼第 10 塊磚將會是 271。
+
+求序列中的第 2000 塊磚。
 
 # --hints--
 
-`euler128()` should return 14516824220.
+`hexagonalTile(10)` should return `271`.
 
 ```js
-assert.strictEqual(euler128(), 14516824220);
+assert.strictEqual(hexagonalTile(10), 271);
+```
+
+`hexagonalTile(2000)` should return `14516824220`.
+
+```js
+assert.strictEqual(hexagonalTile(2000), 14516824220);
 ```
 
 # --seed--
@@ -27,16 +45,62 @@ assert.strictEqual(euler128(), 14516824220);
 ## --seed-contents--
 
 ```js
-function euler128() {
+function hexagonalTile(tileIndex) {
 
   return true;
 }
 
-euler128();
+hexagonalTile(10);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+const NUM_PRIMES = 840000;
+const PRIME_SEIVE = Array(Math.floor((NUM_PRIMES-1)/2)).fill(true);
+(function initPrimes(num) {
+  const upper = Math.floor((num - 1) / 2);
+  const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+  for (let i = 0; i <= sqrtUpper; i++) {
+    if (PRIME_SEIVE[i]) {
+      // Mark value in PRIMES array
+      const prime = 2 * i + 3;
+      // Mark all multiples of this number as false (not prime)
+      const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+      for (let j = primeSqaredIndex; j < upper; j += prime) {
+        PRIME_SEIVE[j] = false;
+      }
+    }
+  }
+})(NUM_PRIMES);
+
+function isPrime(num) {
+  if (num === 2) return true;
+  else if (num % 2 === 0) return false
+  else return PRIME_SEIVE[(num - 3) / 2];
+}
+
+function hexagonalTile(tileIndex) {
+  let count = 1;
+  let n = 1;
+  let number = 0;
+
+  while (count < tileIndex) {
+    if (isPrime(6*n - 1) &&
+        isPrime(6*n + 1) &&
+        isPrime(12*n + 5)) {
+      number = 3*n*n - 3*n + 2;
+      count++;
+      if (count >= tileIndex) break;
+    }
+    if (isPrime(6*n + 5) &&
+        isPrime(6*n - 1) &&
+        isPrime(12*n - 7) && n != 1) {
+      number = 3*n*n + 3*n + 1;
+      count++;
+    }
+    n++;
+  }
+  return number;
+}
 ```
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-13-large-sum.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-13-large-sum.md
index 05775850cff..7e4db74fcb7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-13-large-sum.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-13-large-sum.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f37a1000cf542c50fe8c
 title: 'Problem 13: Large sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301757
 dashedName: problem-13-large-sum
 ---
@@ -278,7 +278,7 @@ function largeSum(arr) {
 
   sum = sum.toString(10);
 
-  sum = sum.substr(0, 1) + sum.substr(2);
+  sum = sum.substring(0, 1) + sum.substring(2);
 
   let firstTen = sum.slice(0, 10);
   return parseInt(firstTen, 10);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-135-same-differences.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-135-same-differences.md
index f0de3b5c589..3045467d61e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-135-same-differences.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-135-same-differences.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f3f31000cf542c50ff06
 title: 'Problem 135: Same differences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301763
 dashedName: problem-135-same-differences
 ---
 
 # --description--
 
-Given the positive integers, x, y, and z, are consecutive terms of an arithmetic progression, the least value of the positive integer, n, for which the equation, x2 − y2 − z2 = n, has exactly two solutions is n = 27:
+Given the positive integers, $x$, $y$, and $z$, are consecutive terms of an arithmetic progression, the least value of the positive integer, $n$, for which the equation, $x^2 − y^2 − z^2 = n$, has exactly two solutions is $n = 27$:
 
-342 − 272 − 202 = 122 − 92 − 62 = 27
+$$34^2 − 27^2 − 20^2 = 12^2 − 9^2 − 6^2 = 27$$
 
-It turns out that n = 1155 is the least value which has exactly ten solutions.
+It turns out that $n = 1155$ is the least value which has exactly ten solutions.
 
-How many values of n less than one million have exactly ten distinct solutions?
+How many values of $n$ less than one million have exactly ten distinct solutions?
 
 # --hints--
 
-`euler135()` should return 4989.
+`sameDifferences()` should return `4989`.
 
 ```js
-assert.strictEqual(euler135(), 4989);
+assert.strictEqual(sameDifferences(), 4989);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler135(), 4989);
 ## --seed-contents--
 
 ```js
-function euler135() {
+function sameDifferences() {
 
   return true;
 }
 
-euler135();
+sameDifferences();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-136-singleton-difference.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-136-singleton-difference.md
index 34fda8a4eeb..20fcfc6460a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-136-singleton-difference.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-136-singleton-difference.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f3f51000cf542c50ff07
 title: 'Problem 136: Singleton difference'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301764
 dashedName: problem-136-singleton-difference
 ---
 
 # --description--
 
-The positive integers, x, y, and z, are consecutive terms of an arithmetic progression. Given that n is a positive integer, the equation, x2 − y2 − z2 = n, has exactly one solution when n = 20:
+正整數 $x$、$y$ 和 $z$ 是算術級數的連續項。 已知 $n$ 爲正整數，對於方程 $x^2 − y^2 − z^2 = n$，當 $n = 20$ 時存在唯一解:
 
-132 − 102 − 72 = 20
+$$13^2 − 10^2 − 7^2 = 20$$
 
-In fact there are twenty-five values of n below one hundred for which the equation has a unique solution.
+事實上，有 25 個 $n$ 小於 100 的值，使得方程有唯一解。
 
-How many values of n less than fifty million have exactly one solution?
+有多少小於五千萬的 $n$ 使得方程有唯一解?
 
 # --hints--
 
-`euler136()` should return 2544559.
+`singletonDifference()` 應該返回 `2544559`。
 
 ```js
-assert.strictEqual(euler136(), 2544559);
+assert.strictEqual(singletonDifference(), 2544559);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler136(), 2544559);
 ## --seed-contents--
 
 ```js
-function euler136() {
+function singletonDifference() {
 
   return true;
 }
 
-euler136();
+singletonDifference();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md
index 800c0ccbab2..fb20e21216f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md
@@ -1,25 +1,29 @@
 ---
 id: 5900f3f71000cf542c50ff0a
-title: 'Problem 139: Pythagorean tiles'
-challengeType: 5
+title: '問題 139：畢達哥拉斯磚塊'
+challengeType: 1
 forumTopicId: 301767
 dashedName: problem-139-pythagorean-tiles
 ---
 
 # --description--
 
-Let (a, b, c) represent the three sides of a right angle triangle with integral length sides. It is possible to place four such triangles together to form a square with length c.
+設（a，b，c）表示具有整數邊長的直角三角形的三條邊。 It is possible to place four such triangles together to form a square with length c.
 
-For example, (3, 4, 5) triangles can be placed together to form a 5 by 5 square with a 1 by 1 hole in the middle and it can be seen that the 5 by 5 square can be tiled with twenty-five 1 by 1 squares.
+例如，邊長爲（3，4，5）的三角形可以放在一起形成一個 5 乘 5 的正方形，中間有一個 1 乘 1 的小正方形，並且可以用 25 個 1 乘 1 的小正方形平埔填充 5 乘 5 的正方形。
 
-However, if (5, 12, 13) triangles were used then the hole would measure 7 by 7 and these could not be used to tile the 13 by 13 square. Given that the perimeter of the right triangle is less than one-hundred million, how many Pythagorean triangles would allow such a tiling to take place?
+<img class="img-responsive center-block" alt="兩個 5 x 5 的正方形：第一個通過 4 個 3 x 4 x 5 的三角形組成，中心有個 1 x 1 小正方形；第二個通過 25 個 1 x 1 的小正方形平鋪填充。" src="https://cdn.freecodecamp.org/curriculum/project-euler/pythagorean-tiles.png" style="background-color: white; padding: 10px;" />
+
+但是，如果使用（5，12，13）的三角形組成正方形，中間的小正方形是 7 乘 7 的。 而這些 7 x 7 的正方形將無法平鋪填充 13 x 13 的正方形。
+
+請求出在周長小於 100,000,000 的直角三角形中，有多少個畢達哥斯拉三角形可以滿足這種填充？
 
 # --hints--
 
-`euler139()` should return 10057761.
+`pythagoreanTiles()` 應該返回 `10057761`。
 
 ```js
-assert.strictEqual(euler139(), 10057761);
+assert.strictEqual(pythagoreanTiles(), 10057761);
 ```
 
 # --seed--
@@ -27,12 +31,12 @@ assert.strictEqual(euler139(), 10057761);
 ## --seed-contents--
 
 ```js
-function euler139() {
+function pythagoreanTiles() {
 
   return true;
 }
 
-euler139();
+pythagoreanTiles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-14-longest-collatz-sequence.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-14-longest-collatz-sequence.md
index e01a0067bd0..8311342bea4 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-14-longest-collatz-sequence.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-14-longest-collatz-sequence.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f37a1000cf542c50fe8d
 title: '問題 14：最長考拉茲序列'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301768
 dashedName: problem-14-longest-collatz-sequence
 ---
@@ -22,7 +22,7 @@ dashedName: problem-14-longest-collatz-sequence
 
 求出在小於 `limit` 的數中，哪個可以產生最長的考拉茲序列？
 
-**注意：** 序列中數字的個數允許超過一百萬。
+**Note:** Once the chain starts the terms are allowed to go above `limit`.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md
index 88d8b1e5a8d..189b36ea30c 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md
@@ -1,29 +1,44 @@
 ---
 id: 5900f3fc1000cf542c50ff0f
-title: 'Problem 144: Investigating multiple reflections of a laser beam'
-challengeType: 5
+title: '問題 144：一束激光的多次反射研究'
+challengeType: 1
 forumTopicId: 301773
 dashedName: problem-144-investigating-multiple-reflections-of-a-laser-beam
 ---
 
 # --description--
 
-In laser physics, a "white cell" is a mirror system that acts as a delay line for the laser beam. The beam enters the cell, bounces around on the mirrors, and eventually works its way back out.
+激光物理學中，“白腔”是一個使激光束產生延遲的鏡面系統。 激光束進入白腔後，會在鏡面上不斷反射，並最終射出。
 
-The specific white cell we will be considering is an ellipse with the equation 4x2 + y2 = 100
+本題中涉及的白腔是一個橢圓，對應方程爲 $4{x}^2 + y^2 = 100$。
 
-The section corresponding to −0.01 ≤ x ≤ +0.01 at the top is missing, allowing the light to enter and exit through the hole.
+橢圓頂部削去了 $−0.01 ≤ x ≤ +0.01$ 的部分，使得激光束可以通過該部分進入和離開白腔。
 
-The light beam in this problem starts at the point (0.0,10.1) just outside the white cell, and the beam first impacts the mirror at (1.4,-9.6). Each time the laser beam hits the surface of the ellipse, it follows the usual law of reflection "angle of incidence equals angle of reflection." That is, both the incident and reflected beams make the same angle with the normal line at the point of incidence. In the figure on the left, the red line shows the first two points of contact between the laser beam and the wall of the white cell; the blue line shows the line tangent to the ellipse at the point of incidence of the first bounce.The slope m of the tangent line at any point (x,y) of the given ellipse is: m = −4x/yThe normal line is perpendicular to this tangent line at the point of incidence. The animation on the right shows the first 10 reflections of the beam.
+<div style="text-align: center">
+  <img class="img-responsive center-block" alt="激光束由點 (0.0, 10.1) 發出，並於點 (1.4, -9.6) 處擊中鏡面" src="https://cdn.freecodecamp.org/curriculum/project-euler/investigating-multiple-reflections-of-a-laser-beam-1.png" style="display: inline-block; background-color: white; padding: 10px;">
+  <img class="img-responsive center-block" alt="激光束前十次反射路徑的動畫" src="https://cdn.freecodecamp.org/curriculum/project-euler/investigating-multiple-reflections-of-a-laser-beam-2.gif" style="display: inline-block; background-color: white; padding: 10px;">
+</div><br>
 
-How many times does the beam hit the internal surface of the white cell before exiting?
+本題中，激光束從白腔外一點 (0.0, 10.1) 發出，首次接觸鏡面的點爲 (1.4, -9.6)。
+
+每當激光束擊中橢圓表面時，均遵循反射定律：“入射角等於反射角”。 即入射光束和反射光束與界面法線的夾角角度相等。
+
+左圖中，紅線展示了激光束擊中白腔鏡面的前兩個接觸點；藍線表示第一次反射時在入射點處與橢圓的切線。
+
+對橢圓任意點 (x, y)，均有切線斜率 m 滿足 $m = −4 × \frac{x}{y}$。
+
+法線垂直於入射點處的切線。
+
+右側動畫展示了激光束前十次反射的路徑。
+
+請求出在激光束離開白腔前，它在橢圓的內表面上擊中了多少次？
 
 # --hints--
 
-`euler144()` should return 354.
+`laserBeamReflections()` 應該返回 `354`。
 
 ```js
-assert.strictEqual(euler144(), 354);
+assert.strictEqual(laserBeamReflections(), 354);
 ```
 
 # --seed--
@@ -31,12 +46,12 @@ assert.strictEqual(euler144(), 354);
 ## --seed-contents--
 
 ```js
-function euler144() {
+function laserBeamReflections() {
 
   return true;
 }
 
-euler144();
+laserBeamReflections();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md
index 3b422811f69..6f5e0e01f16 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md
@@ -1,27 +1,31 @@
 ---
 id: 5900f3ff1000cf542c50ff12
-title: 'Problem 147: Rectangles in cross-hatched grids'
-challengeType: 5
+title: '問題 147：交叉對角線網格中的矩形'
+challengeType: 1
 forumTopicId: 301776
 dashedName: problem-147-rectangles-in-cross-hatched-grids
 ---
 
 # --description--
 
-In a 3x2 cross-hatched grid, a total of 37 different rectangles could be situated within that grid as indicated in the sketch.
+如圖所示，在 3 x 2 的交叉對角線網格中，共有 37 個不同的矩形可以放置於該網格內。
 
-There are 5 grids smaller than 3x2, vertical and horizontal dimensions being important, i.e. 1x1, 2x1, 3x1, 1x2 and 2x2. If each of them is cross-hatched, the following number of different rectangles could be situated within those smaller grids: 1x1: 1 2x1: 4 3x1: 8 1x2: 4 2x2: 18
+<img class="img-responsive center-block" alt="3 x 2 網格中放置不同矩形的方法" src="https://cdn.freecodecamp.org/curriculum/project-euler/rectangles-in-cross-hatched-grids.png" style="background-color: white; padding: 10px;" />
 
-Adding those to the 37 of the 3x2 grid, a total of 72 different rectangles could be situated within 3x2 and smaller grids.
+從長和寬的角度考慮，有 5 種小於 3 x 2 網格的矩形，即 1 x 1、2 x 1、3 x 1、1 x 2 和 2 x 2。 若畫出上述矩形的交叉對角線，則有不同的矩形可以位於這些更小的網格中，對應數量如下：
 
-How many different rectangles could be situated within 47x43 and smaller grids?
+$$\begin{array}{|c|c|} \hline 1 \times 1 & 1  \\\\ \hline 2 \times 1 & 4  \\\\ \hline 3 \times 1 & 8  \\\\ \hline 1 \times 2 & 4  \\\\ \hline 2 \times 2 & 18 \\\\ \hline \end{array}$$
+
+上述個數與 3 x 2 網格中的 37 相加，可得對於 3 x 2 及其更小的網格，共有 72 個不同的矩形可以放置其中。
+
+請求出 47 x 43 及其更小的網格中，可以放置多少個不同的矩形？
 
 # --hints--
 
-`euler147()` should return 846910284.
+`crossHatchedRectangles()` 應該返回 `846910284`。
 
 ```js
-assert.strictEqual(euler147(), 846910284);
+assert.strictEqual(crossHatchedRectangles(), 846910284);
 ```
 
 # --seed--
@@ -29,12 +33,12 @@ assert.strictEqual(euler147(), 846910284);
 ## --seed-contents--
 
 ```js
-function euler147() {
+function crossHatchedRectangles() {
 
   return true;
 }
 
-euler147();
+crossHatchedRectangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-15-lattice-paths.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-15-lattice-paths.md
index 225a31ee93c..7d0a89e14cd 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-15-lattice-paths.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-15-lattice-paths.md
@@ -1,40 +1,40 @@
 ---
 id: 5900f37b1000cf542c50fe8e
-title: 'Problem 15: Lattice paths'
-challengeType: 5
+title: '問題 15：網格路徑'
+challengeType: 1
 forumTopicId: 301780
 dashedName: problem-15-lattice-paths
 ---
 
 # --description--
 
-Starting in the top left corner of a 2×2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.
+從一個 2 × 2 的網格左上角出發，規定只允許向右或向下移動，則到達右下角的路徑恰好有 6 條。
 
-<img class="img-responsive center-block" alt="a diagram of 6 2 by 2 grids showing all the routes to the bottom right corner" src="https://cdn-media-1.freecodecamp.org/project-euler/1Atixoj.gif" style="background-color: white; padding: 10px;" />
+<img class="img-responsive center-block" alt="圖片展示了到達 2 × 2 網格右下角的所有 6 條路徑" src="https://cdn-media-1.freecodecamp.org/project-euler/1Atixoj.gif" style="background-color: white; padding: 10px;" />
 
-How many such routes are there through a given `gridSize`?
+給定網格大小爲 `gridSize`，請求出這樣的路徑有多少條?
 
 # --hints--
 
-`latticePaths(4)` should return a number.
+`latticePaths(4)` 應該返回一個數字。
 
 ```js
 assert(typeof latticePaths(4) === 'number');
 ```
 
-`latticePaths(4)` should return 70.
+`latticePaths(4)` 應該返回 70。
 
 ```js
 assert.strictEqual(latticePaths(4), 70);
 ```
 
-`latticePaths(9)` should return 48620.
+`latticePaths(9)` 應該返回 48620。
 
 ```js
 assert.strictEqual(latticePaths(9), 48620);
 ```
 
-`latticePaths(20)` should return 137846528820.
+`latticePaths(20)` 應該返回 137846528820。
 
 ```js
 assert.strictEqual(latticePaths(20), 137846528820);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md
index fa659c2f46e..9479be0cf94 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md
@@ -2,7 +2,7 @@
 id: 5900f4031000cf542c50ff15
 title: >-
   Problem 150: Searching a triangular array for a sub-triangle having minimum-sum
-challengeType: 5
+challengeType: 1
 forumTopicId: 301781
 dashedName: problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum
 ---
@@ -11,17 +11,23 @@ dashedName: problem-150-searching-a-triangular-array-for-a-sub-triangle-having-m
 
 In a triangular array of positive and negative integers, we wish to find a sub-triangle such that the sum of the numbers it contains is the smallest possible.
 
-In the example below, it can be easily verified that the marked triangle satisfies this condition having a sum of −42.
+在下面的示例中，可以很容易地驗證標記的三角形滿足具有 -42 的總和的條件。
 
-We wish to make such a triangular array with one thousand rows, so we generate 500500 pseudo-random numbers sk in the range ±219, using a type of random number generator (known as a Linear Congruential Generator) as follows: t := 0
+<img class="img-responsive center-block" alt="三角形數組，帶有標記的子三角形，總和 -42" src="https://cdn.freecodecamp.org/curriculum/project-euler/searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.gif" style="background-color: white; padding: 10px;" />
 
-for k = 1 up to k = 500500:
+我們希望製作一個包含一千行的三角形數組，因此我們使用一種隨機數生成器（稱爲線性同餘生成器）生成 500500 個僞隨機數 $s_k$ ，範圍爲 $±2^{19}$，如下所示：
 
-t := (615949\*t + 797807) modulo 220 sk := t−219 Thus: s1 = 273519, s2 = −153582, s3 = 450905 etc Our triangular array is then formed using the pseudo-random numbers thus:
+$$\begin{align}   t := & \\ 0\\\\
+  \text{for}\\ & k = 1\\ \text{up to}\\ k = 500500:\\\\   & t := (615949 × t + 797807)\\ \text{modulo}\\ 2^{20}\\\\
+  & s_k := t − 219\\\\ \end{align}$$
 
-s1 s2 s3 s4 s5 s6
+例如：$s_1 = 273519$、$s_2 = −153582$、$s_3 = 450905$ 等。
 
-s7 s8 s9 s10 ...
+然後使用僞隨機數組形成我們的三角形數組如下：
+
+$$ s_1 \\\\
+s_2\\;s_3 \\\\ s_4\\; s_5\\; s_6 \\\\
+s_7\\; s_8\\; s_9\\; s_{10} \\\\ \ldots $$
 
 Sub-triangles can start at any element of the array and extend down as far as we like (taking-in the two elements directly below it from the next row, the three elements directly below from the row after that, and so on).
 
@@ -31,10 +37,10 @@ Find the smallest possible sub-triangle sum.
 
 # --hints--
 
-`euler150()` should return -271248680.
+`smallestSubTriangleSum()` 應該返回 `-271248680`。
 
 ```js
-assert.strictEqual(euler150(), -271248680);
+assert.strictEqual(smallestSubTriangleSum(), -271248680);
 ```
 
 # --seed--
@@ -42,12 +48,12 @@ assert.strictEqual(euler150(), -271248680);
 ## --seed-contents--
 
 ```js
-function euler150() {
+function smallestSubTriangleSum() {
 
   return true;
 }
 
-euler150();
+smallestSubTriangleSum();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md
index e75e5a0fdfe..c60cd46cb45 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4031000cf542c50ff16
 title: 'Problem 151: Paper sheets of standard sizes: an expected-value problem'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301782
 dashedName: problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem
 ---
@@ -16,14 +16,20 @@ He proceeds to cut it in half, thus getting two sheets of size A2. Then he cuts
 
 All the unused sheets are placed back in the envelope.
 
-At the beginning of each subsequent batch, he takes from the envelope one sheet of paper at random. If it is of size A5, he uses it. If it is larger, he repeats the 'cut-in-half' procedure until he has what he needs and any remaining sheets are always placed back in the envelope. Excluding the first and last batch of the week, find the expected number of times (during each week) that the foreman finds a single sheet of paper in the envelope. Give your answer rounded to six decimal places using the format x.xxxxxx .
+<img class="img-responsive center-block" alt="A1 尺寸紙可以拆分爲：A2、A3、A4 和兩張 A5 紙" src="https://cdn.freecodecamp.org/curriculum/project-euler/paper-sheets-of-standard-sizes-an-expected-value-problem.png" style="background-color: white; padding: 10px;" />
+
+隨後每批開始時，他隨機從信封中拿走一張紙張。 If it is of size A5, he uses it. 如果它更大，他會重複“切成兩半”的程序，直到他有他需要的東西，任何剩餘的紙張總是放回信封裏。
+
+排除一週的第一批和最後一批，求領班在信封中找到一張紙的預期次數（每週）。
+
+使用格式 `x.xxxxxx` 將您的答案四捨五入到小數點後六位。
 
 # --hints--
 
-`euler151()` should return 0.464399.
+`expectedValueProblem()` 應該返回 `0.464399`。
 
 ```js
-assert.strictEqual(euler151(), 0.464399);
+assert.strictEqual(expectedValueProblem(), 0.464399);
 ```
 
 # --seed--
@@ -31,12 +37,12 @@ assert.strictEqual(euler151(), 0.464399);
 ## --seed-contents--
 
 ```js
-function euler151() {
+function expectedValueProblem() {
 
   return true;
 }
 
-euler151();
+expectedValueProblem();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md
index 1acd9f0652e..2958a84d8c5 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md
@@ -1,25 +1,29 @@
 ---
 id: 5900f4041000cf542c50ff17
 title: 'Problem 152: Writing one half as a sum of inverse squares'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301783
 dashedName: problem-152-writing-one-half-as-a-sum-of-inverse-squares
 ---
 
 # --description--
 
-There are several ways to write the number 1/2 as a sum of inverse squares using distinct integers.
+有幾種方法可以使用不同的整數將數字 $\frac{1}{2}$ 寫成倒數平方和。
 
 For instance, the numbers {2,3,4,5,7,12,15,20,28,35} can be used:
 
-In fact, only using integers between 2 and 45 inclusive, there are exactly three ways to do it, the remaining two being: {2,3,4,6,7,9,10,20,28,35,36,45} and {2,3,4,6,7,9,12,15,28,30,35,36,45}. How many ways are there to write the number 1/2 as a sum of inverse squares using distinct integers between 2 and 80 inclusive?
+$$\frac{1}{2} = \frac{1}{2^2} + \frac{1}{3^2} + \frac{1}{4^2} + \frac{1}{5^2} + \frac{1}{7^2} + \frac{1}{{12}^2} + \frac{1}{{15}^2} + \frac{1}{{20}^2} + \frac{1}{{28}^2} + \frac{1}{{35}^2}$$
+
+In fact, only using integers between 2 and 45 inclusive, there are exactly three ways to do it, the remaining two being: {2,3,4,6,7,9,10,20,28,35,36,45} and {2,3,4,6,7,9,12,15,28,30,35,36,45}.
+
+使用 2 到 80 之間（含 2 和 80）的不同整數，有多少種方法可以將數字 $\frac{1}{2}$ 寫成倒數平方和？
 
 # --hints--
 
-`euler152()` should return 301.
+`sumInverseSquares()` 應該返回 `301`。
 
 ```js
-assert.strictEqual(euler152(), 301);
+assert.strictEqual(sumInverseSquares(), 301);
 ```
 
 # --seed--
@@ -27,12 +31,12 @@ assert.strictEqual(euler152(), 301);
 ## --seed-contents--
 
 ```js
-function euler152() {
+function sumInverseSquares() {
 
   return true;
 }
 
-euler152();
+sumInverseSquares();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md
index b1eaa92c44b..ddc465d72f2 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md
@@ -1,53 +1,67 @@
 ---
 id: 5900f4051000cf542c50ff18
-title: 'Problem 153: Investigating Gaussian Integers'
-challengeType: 5
+title: '問題 153：研究高斯整數'
+challengeType: 1
 forumTopicId: 301784
 dashedName: problem-153-investigating-gaussian-integers
 ---
 
 # --description--
 
-As we all know the equation x2=-1 has no solutions for real x.
+衆所周知，方程 $x^2 = -1$ 沒有實數 $x$ 解。
 
-If we however introduce the imaginary number i this equation has two solutions: x=i and x=-i.
+然而，如果我們引入虛數 $i$，則該等式具有兩個解： $x = i$ 與 $x = -i$。
 
-If we go a step further the equation (x-3)2=-4 has two complex solutions: x=3+2i and x=3-2i. x=3+2i and x=3-2i are called each others' complex conjugate.
+如果我們更進一步，方程式 ${(x - 3)}^2 = -4$ 有兩個複數解： $x = 3 + 2i$ 和 $x = 3 - 2i$， 被稱爲共軛複數。
 
-Numbers of the form a+bi are called complex numbers.
+形式 $a + bi$ 的數字稱爲複數。
 
-In general a+bi and a−bi are each other's complex conjugate. A Gaussian Integer is a complex number a+bi such that both a and b are integers.
+通常 $a + bi$ 與 $a − bi$ 爲共軛複數。 高斯整數是指複數 $a + bi$，$a$ 與 $b$ 都是整數。
 
-The regular integers are also Gaussian integers (with b=0).
+常規整數也是高斯整數（$b = 0$）。
 
-To distinguish them from Gaussian integers with b ≠ 0 we call such integers "rational integers."
+爲了將它們與 $b ≠ 0$ 的高斯整數區分開來，我們稱這樣的整數爲“有理整數”。
 
-A Gaussian integer is called a divisor of a rational integer n if the result is also a Gaussian integer.
+一個高斯整數可以作爲有理整數 $n$ 的約數，如果得到的餘數也是一個高斯整數。
 
-If for example we divide 5 by 1+2i we can simplify in the following manner:
+例如，如果我們將 5 除以 $1 + 2i$，我們可以通過以下方式進行簡化：
 
-Multiply numerator and denominator by the complex conjugate of 1+2i: 1−2i.
+將分子和分母乘以 $1 + 2i$ 的複共軛：$1 − 2i$。
 
-The result is .
+結果是：
 
-So 1+2i is a divisor of 5.
+$$\frac{5}{1 + 2i} = \frac{5}{1 + 2i} \frac{1 - 2i}{1 - 2i} = \frac{5(1 - 2i)}{1 - {(2i)}^2} = \frac{5(1 - 2i)}{1 - (-4)} = \frac{5(1 - 2i)}{5} = 1 - 2i$$
 
-Note that 1+i is not a divisor of 5 because .
+所以 $1 + 2i$ 是 5 的約數.
 
-Note also that if the Gaussian Integer (a+bi) is a divisor of a rational integer n, then its complex conjugate (a−bi) is also a divisor of n. In fact, 5 has six divisors such that the real part is positive: {1, 1 + 2i, 1 − 2i, 2 + i, 2 − i, 5}.
+請注意，$1 + i$ 不是 5 的除數，因爲：
 
-The following is a table of all of the divisors for the first five positive rational integers:
+$$\frac{5}{1 + i} = \frac{5}{2} - \frac{5}{2}i$$
 
-n Gaussian integer divisors with positive real partSum s(n) of these
+注意，如果高斯整數（$a + bi$）是有理整數 $n$ 的約數，則其共軛複數（$a − bi$）也是 $n$ 的因子。 事實上，5 有六個因數，使得實部爲正數：{1, 1 + 2i, 1 − 2i, 2 + i, 2 − i, 5}。
 
-divisors111 21, 1+i, 1-i, 25 31, 34 41, 1+i, 1-i, 2, 2+2i, 2-2i,413 51, 1+2i, 1-2i, 2+i, 2-i, 512 For divisors with positive real parts, then, we have: . For 1 ≤ n ≤ 105, ∑ s(n)=17924657155. What is ∑ s(n) for 1 ≤ n ≤ 108?
+以下是前五個正整數的所有約數表：
+
+| n | 實數部分爲正的高斯整數約數表                        | 這些除數的總和 s(n) |
+| - | ------------------------------------- | ------------ |
+| 1 | 1                                     | 1            |
+| 2 | 1, 1 + i, 1 - i, 2                    | 5            |
+| 3 | 1, 3                                  | 4            |
+| 4 | 1, 1 + i, 1 - i, 2, 2 + 2i, 2 - 2i, 4 | 13           |
+| 5 | 1, 1 + 2i, 1 - 2i, 2 + i, 2 - i, 5    | 12           |
+
+對於實數部分爲正的約數，我們有：$\displaystyle\sum_{n=1}^5 s(n) = 35$。
+
+對於 $1 ≤ n ≤ {10}^5$, $\displaystyle\sum_{n = 1}^{{10}^5} s(n) = 17924657155$.
+
+求 $\displaystyle\sum_{n=1}^{{10}^8} s(n)$?
 
 # --hints--
 
-`euler153()` should return 17971254122360636.
+`sumGaussianIntegers()` 應得 `17971254122360636`。
 
 ```js
-assert.strictEqual(euler153(), 17971254122360636);
+assert.strictEqual(sumGaussianIntegers(), 17971254122360636);
 ```
 
 # --seed--
@@ -55,12 +69,12 @@ assert.strictEqual(euler153(), 17971254122360636);
 ## --seed-contents--
 
 ```js
-function euler153() {
+function sumGaussianIntegers() {
 
   return true;
 }
 
-euler153();
+sumGaussianIntegers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md
index 8d8abe0dfcd..91523c8d23e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4071000cf542c50ff19
-title: 'Problem 154: Exploring Pascal''s pyramid'
-challengeType: 5
+title: '問題 154：探索帕斯卡金字塔'
+challengeType: 1
 forumTopicId: 301785
 dashedName: problem-154-exploring-pascals-pyramid
 ---
@@ -10,14 +10,20 @@ dashedName: problem-154-exploring-pascals-pyramid
 
 A triangular pyramid is constructed using spherical balls so that each ball rests on exactly three balls of the next lower level.
 
-Then, we calculate the number of paths leading from the apex to each position: A path starts at the apex and progresses downwards to any of the three spheres directly below the current position. Consequently, the number of paths to reach a certain position is the sum of the numbers immediately above it (depending on the position, there are up to three numbers above it). The result is Pascal's pyramid and the numbers at each level n are the coefficients of the trinomial expansion (x + y + z)n. How many coefficients in the expansion of (x + y + z)200000 are multiples of 1012?
+<img class="img-responsive center-block" alt="用球形搭建的四級三角形金字塔" src="https://cdn.freecodecamp.org/curriculum/project-euler/exploring-pascals-pyramid.png" style="background-color: white; padding: 10px;" />
+
+然後，我們計算從頂點到每個位置的路徑數量：路徑從頂點開始並向下前進到當前位置正下方的三個球體中的任何一個。 因此，到達某個位置的路徑數是緊接在其上方的數字的總和（取決於位置，在其上方最多有三個數字）。
+
+其結果是帕斯卡金字塔（Pascal's pyramid），每個級別 n 的數字是三項式 ${(x + y + z)}^n$ 展開的係數.
+
+${(x + y + z)}^{200000}$ 的展開式中有多少個係數是 ${10}^{12}$ 的倍數？
 
 # --hints--
 
-`euler154()` should return 479742450.
+`pascalsPyramid()` 應該返回 `479742450`。
 
 ```js
-assert.strictEqual(euler154(), 479742450);
+assert.strictEqual(pascalsPyramid(), 479742450);
 ```
 
 # --seed--
@@ -25,12 +31,12 @@ assert.strictEqual(euler154(), 479742450);
 ## --seed-contents--
 
 ```js
-function euler154() {
+function pascalsPyramid() {
 
   return true;
 }
 
-euler154();
+pascalsPyramid();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md
index 404c223c6a4..36c292d8c56 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4081000cf542c50ff1a
 title: 'Problem 155: Counting Capacitor Circuits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301786
 dashedName: problem-155-counting-capacitor-circuits
 ---
@@ -10,18 +10,24 @@ dashedName: problem-155-counting-capacitor-circuits
 
 An electric circuit uses exclusively identical capacitors of the same value C.
 
-The capacitors can be connected in series or in parallel to form sub-units, which can then be connected in series or in parallel with other capacitors or other sub-units to form larger sub-units, and so on up to a final circuit. Using this simple procedure and up to n identical capacitors, we can make circuits having a range of different total capacitances. For example, using up to n=3 capacitors of 60 F each, we can obtain the following 7 distinct total capacitance values:
+電容器可以串聯或並聯連接以形成子單元，子單元然後可以與其他電容器或其他子單元串聯或並聯連接以形成更大的子單元，以此類推直到最終電路。
 
-If we denote by D(n) the number of distinct total capacitance values we can obtain when using up to n equal-valued capacitors and the simple procedure described above, we have: D(1)=1, D(2)=3, D(3)=7 ... Find D(18). Reminder : When connecting capacitors C1, C2 etc in parallel, the total capacitance is CT = C1 + C2 +...,
+使用這個簡單的程序和最多 n 個相同的電容器，我們可以製作具有不同總電容範圍的電路。 例如，最多使用 $n = 3$ 個 $60 μF$ 的電容器， 我們可以獲得以下 7 個不同的總電容值：
 
-whereas when connecting them in series, the overall capacitance is given by:
+<img class="img-responsive center-block" alt="示例電路最多有三個電容器，每個 60 μF" src="https://cdn.freecodecamp.org/curriculum/project-euler/counting-capacitor-circuits.gif" style="background-color: white; padding: 10px;" />
+
+如果我們用 $D(n)$ 表示當使用最多 $n$ 個等值電容器時，我們採用上述簡單程序可以獲得的不同總電容值的數量，我們得到：$D(1) = 1, D(2) = 3, D(3)=7, \ldots$。
+
+求 $D(18)$。
+
+提醒：當並連 $C_1$, $C_2$ 等電容器時，總容量爲 $C_T = C_1 + C_2 + \cdots$；而當串連它們時，總容量爲 $\frac{1}{C_T} = \frac{1}{C_1} + \frac{1}{C_2} + \cdots$。
 
 # --hints--
 
-`euler155()` should return 3857447.
+`capacitanceValues()` 應得 `3857447`。
 
 ```js
-assert.strictEqual(euler155(), 3857447);
+assert.strictEqual(capacitanceValues(), 3857447);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler155(), 3857447);
 ## --seed-contents--
 
 ```js
-function euler155() {
+function capacitanceValues() {
 
   return true;
 }
 
-euler155();
+capacitanceValues();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-156-counting-digits.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-156-counting-digits.md
index 3ab75c957bc..fb820e64aa0 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-156-counting-digits.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-156-counting-digits.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4091000cf542c50ff1b
 title: 'Problem 156: Counting Digits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301787
 dashedName: problem-156-counting-digits
 ---
@@ -12,24 +12,40 @@ Starting from zero the natural numbers are written down in base 10 like this:
 
 0 1 2 3 4 5 6 7 8 9 10 11 12....
 
-Consider the digit d=1. After we write down each number n, we will update the number of ones that have occurred and call this number f(n,1). The first values for f(n,1), then, are as follows:
+Consider the digit $d = 1$. After we write down each number n, we will update the number of ones that have occurred and call this number $f(n, 1)$. The first values for $f(n, 1)$, then, are as follows:
 
-nf(n,1) 00 11 21 31 41 51 61 71 81 91 102 114 125
+| $n$ | $f(n, 1)$ |
+| --- | --------- |
+| 0   | 0         |
+| 1   | 1         |
+| 2   | 1         |
+| 3   | 1         |
+| 4   | 1         |
+| 5   | 1         |
+| 6   | 1         |
+| 7   | 1         |
+| 8   | 1         |
+| 9   | 1         |
+| 10  | 2         |
+| 11  | 4         |
+| 12  | 5         |
 
-Note that f(n,1) never equals 3.
+Note that $f(n, 1)$ never equals 3.
 
-So the first two solutions of the equation f(n,1)=n are n=0 and n=1. The next solution is n=199981. In the same manner the function f(n,d) gives the total number of digits d that have been written down after the number n has been written.
+So the first two solutions of the equation $f(n, 1) = n$ are $n = 0$ and $n = 1$. The next solution is $n = 199981$. In the same manner the function $f(n, d)$ gives the total number of digits d that have been written down after the number $n$ has been written.
 
-In fact, for every digit d ≠ 0, 0 is the first solution of the equation f(n,d)=n. Let s(d) be the sum of all the solutions for which f(n,d)=n.
+In fact, for every digit $d ≠ 0$, 0 is the first solution of the equation $f(n, d) = n$. Let $s(d)$ be the sum of all the solutions for which $f(n, d) = n$.
 
-You are given that s(1)=22786974071. Find ∑ s(d) for 1 ≤ d ≤ 9. Note: if, for some n, f(n,d)=n for more than one value of d this value of n is counted again for every value of d for which f(n,d)=n.
+You are given that $s(1) = 22786974071$. Find $\sum{s(d)}$ for $1 ≤ d ≤ 9$.
+
+Note: if, for some $n$, $f(n, d) = n$ for more than one value of $d$ this value of $n$ is counted again for every value of $d$ for which $f(n, d) = n$.
 
 # --hints--
 
-`euler156()` should return 21295121502550.
+`countingDigits()` should return `21295121502550`.
 
 ```js
-assert.strictEqual(euler156(), 21295121502550);
+assert.strictEqual(countingDigits(), 21295121502550);
 ```
 
 # --seed--
@@ -37,12 +53,12 @@ assert.strictEqual(euler156(), 21295121502550);
 ## --seed-contents--
 
 ```js
-function euler156() {
+function countingDigits() {
 
   return true;
 }
 
-euler156();
+countingDigits();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md
index fa1e3270516..aa5e8185547 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md
@@ -1,65 +1,30 @@
 ---
 id: 5900f4091000cf542c50ff1c
 title: 'Problem 157: Solving the diophantine equation'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301788
 dashedName: problem-157-solving-the-diophantine-equation
 ---
 
 # --description--
 
-Consider the diophantine equation 1/a+1/b= p/10n with a, b, p, n positive integers and a ≤ b.
+Consider the diophantine equation $\frac{1}{a} + \frac{1}{b} = \frac{p}{{10}^n}$ with $a$, $b$, $p$, $n$ positive integers and $a ≤ b$.
 
-For n=1 this equation has 20 solutions that are listed below:
+For $n = 1$ this equation has 20 solutions that are listed below:
 
-1/1+1/1=20/10
+$$\begin{array}{lllll} \frac{1}{1}  + \frac{1}{1}  = \frac{20}{10} & \frac{1}{1} + \frac{1}{2}  = \frac{15}{10} & \frac{1}{1}  + \frac{1}{5}  = \frac{12}{10} & \frac{1}{1} + \frac{1}{10} = \frac{11}{10} & \frac{1}{2}  + \frac{1}{2}  = \frac{10}{10} \\\\
+  \frac{1}{2}  + \frac{1}{5}  = \frac{7}{10}   & \frac{1}{2} + \frac{1}{10} = \frac{6}{10} & \frac{1}{3}  + \frac{1}{6}  = \frac{5}{10}   & \frac{1}{3} + \frac{1}{15} = \frac{4}{10} & \frac{1}{4}  + \frac{1}{4}  = \frac{5}{10} \\\\
+  \frac{1}{4}  + \frac{1}{4}  = \frac{5}{10}  & \frac{1}{5}  + \frac{1}{5}  = \frac{4}{10} & \frac{1}{5}  + \frac{1}{10} = \frac{3}{10}  & \frac{1}{6}  + \frac{1}{30} = \frac{2}{10} & \frac{1}{10} + \frac{1}{10} = \frac{2}{10} \\\\
+  \frac{1}{11} + \frac{1}{110} = \frac{1}{10} & \frac{1}{12} + \frac{1}{60}  = \frac{1}{10} & \frac{1}{14} + \frac{1}{35}  = \frac{1}{10} & \frac{1}{15} + \frac{1}{30}  = \frac{1}{10} & \frac{1}{20} + \frac{1}{20}  = \frac{1}{10} \end{array}$$
 
-1/1+1/2=15/10
-
-1/1+1/5=12/10
-
-1/1+1/10=11/10
-
-1/2+1/2=10/10
-
-1/2+1/5=7/10
-
-1/2+1/10=6/10
-
-1/3+1/6=5/10
-
-1/3+1/15=4/10
-
-1/4+1/4=5/10
-
-1/4+1/20=3/10
-
-1/5+1/5=4/10
-
-1/5+1/10=3/10
-
-1/6+1/30=2/10
-
-1/10+1/10=2/10
-
-1/11+1/110=1/10
-
-1/12+1/60=1/10
-
-1/14+1/35=1/10
-
-1/15+1/30=1/10
-
-1/20+1/20=1/10
-
-How many solutions has this equation for 1 ≤ n ≤ 9?
+How many solutions has this equation for $1 ≤ n ≤ 9$?
 
 # --hints--
 
-`euler157()` should return 53490.
+`diophantineEquation()` should return `53490`.
 
 ```js
-assert.strictEqual(euler157(), 53490);
+assert.strictEqual(diophantineEquation(), 53490);
 ```
 
 # --seed--
@@ -67,12 +32,12 @@ assert.strictEqual(euler157(), 53490);
 ## --seed-contents--
 
 ```js
-function euler157() {
+function diophantineEquation() {
 
   return true;
 }
 
-euler157();
+diophantineEquation();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md
index 6b979cb0d7f..845e2be3303 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md
@@ -2,7 +2,7 @@
 id: 5900f40a1000cf542c50ff1d
 title: >-
   Problem 158: Exploring strings for which only one character comes lexicographically after its neighbour to the left
-challengeType: 5
+challengeType: 1
 forumTopicId: 301789
 dashedName: >-
   problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left
@@ -20,18 +20,18 @@ For 'hat' there is exactly one character that comes lexicographically after its
 
 In all there are 10400 strings of length 3 for which exactly one character comes lexicographically after its neighbour to the left.
 
-We now consider strings of n ≤ 26 different characters from the alphabet.
+We now consider strings of $n ≤ 26$ different characters from the alphabet.
 
-For every n, p(n) is the number of strings of length n for which exactly one character comes lexicographically after its neighbour to the left.
+For every $n$, $p(n)$ is the number of strings of length $n$ for which exactly one character comes lexicographically after its neighbour to the left.
 
-What is the maximum value of p(n)?
+What is the maximum value of $p(n)$?
 
 # --hints--
 
-`euler158()` should return 409511334375.
+`lexicographicNeighbours()` should return `409511334375`.
 
 ```js
-assert.strictEqual(euler158(), 409511334375);
+assert.strictEqual(lexicographicNeighbours(), 409511334375);
 ```
 
 # --seed--
@@ -39,12 +39,12 @@ assert.strictEqual(euler158(), 409511334375);
 ## --seed-contents--
 
 ```js
-function euler158() {
+function lexicographicNeighbours() {
 
   return true;
 }
 
-euler158();
+lexicographicNeighbours();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md
index b5e3b4945bd..07a2e4945a4 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f40c1000cf542c50ff1e
 title: 'Problem 159: Digital root sums of factorisations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301790
 dashedName: problem-159-digital-root-sums-of-factorisations
 ---
@@ -12,13 +12,32 @@ A composite number can be factored many different ways.
 
 For instance, not including multiplication by one, 24 can be factored in 7 distinct ways:
 
-24 = 2x2x2x3 24 = 2x3x4 24 = 2x2x6 24 = 4x6 24 = 3x8 24 = 2x12 24 = 24
+$$\begin{align}   & 24 = 2 \times 2 \times 2 \times 3\\\\
+  & 24 = 2 \times 3 \times 4  \\\\   & 24 = 2 \times 2 \times 6  \\\\
+  & 24 = 4 \times 6    \\\\   & 24 = 3 \times 8    \\\\
+  & 24 = 2 \times 12   \\\\ & 24 = 24 \end{align}$$
 
-Recall that the digital root of a number, in base 10, is found by adding together the digits of that number, and repeating that process until a number is arrived at that is less than 10. Thus the digital root of 467 is 8. We shall call a Digital Root Sum (DRS) the sum of the digital roots of the individual factors of our number. The chart below demonstrates all of the DRS values for 24. FactorisationDigital Root Sum2x2x2x3 92x3x4 92x2x6 104x6 103x8 112x12 524 6The maximum Digital Root Sum of 24 is 11. The function mdrs(n) gives the maximum Digital Root Sum of n. So mdrs(24)=11. Find ∑mdrs(n) for 1 &lt; n &lt; 1,000,000.
+Recall that the digital root of a number, in base 10, is found by adding together the digits of that number, and repeating that process until a number arrives at less than 10. Thus the digital root of 467 is 8.
+
+We shall call a Digital Root Sum (DRS) the sum of the digital roots of the individual factors of our number. The chart below demonstrates all of the DRS values for 24.
+
+| Factorisation | Digital Root Sum |
+| ------------- | ---------------- |
+| 2x2x2x3       | 9                |
+| 2x3x4         | 9                |
+| 2x2x6         | 10               |
+| 4x6           | 10               |
+| 3x8           | 11               |
+| 2x12          | 5                |
+| 24            | 6                |
+
+The maximum Digital Root Sum of 24 is 11. The function $mdrs(n)$ gives the maximum Digital Root Sum of $n$. So $mdrs(24) = 11$.
+
+Find $\sum{mdrs(n)}$ for $1 &lt; n &lt; 1,000,000$.
 
 # --hints--
 
-`euler159()` should return 14489159.
+`euler159()` should return `14489159`.
 
 ```js
 assert.strictEqual(euler159(), 14489159);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-16-power-digit-sum.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-16-power-digit-sum.md
index b71b4800826..8ef1c137f88 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-16-power-digit-sum.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-16-power-digit-sum.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f37d1000cf542c50fe8f
 title: 'Problem 16: Power digit sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301791
 dashedName: problem-16-power-digit-sum
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md
index c7319ba84c3..e7b3b90803a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md
@@ -1,31 +1,28 @@
 ---
 id: 5900f40d1000cf542c50ff1f
-title: 'Problem 160: Factorial trailing digits'
-challengeType: 5
+title: '問題 160：因子尾隨數字'
+challengeType: 1
 forumTopicId: 301794
 dashedName: problem-160-factorial-trailing-digits
 ---
 
 # --description--
 
-For any N, let f(N) be the last five digits before the trailing zeroes in N!.
+For any $N$, let $f(N)$ be the last five digits before the trailing zeroes in $N!$.
 
-For example,
+例如，
 
-9! = 362880 so f(9)=36288
+$$\begin{align}   & 9! = 362880 \\; \text{so} \\; f(9) = 36288 \\\\
+  & 10! = 3628800 \\; \text{so} \\; f(10) = 36288 \\\\ & 20! = 2432902008176640000 \\; \text{so} \\; f(20) = 17664 \end{align}$$
 
-10! = 3628800 so f(10)=36288
-
-20! = 2432902008176640000 so f(20)=17664
-
-Find f(1,000,000,000,000)
+Find $f(1,000,000,000,000)$
 
 # --hints--
 
-`euler160()` should return 16576.
+`factorialTrailingDigits()` should return `16576`.
 
 ```js
-assert.strictEqual(euler160(), 16576);
+assert.strictEqual(factorialTrailingDigits(), 16576);
 ```
 
 # --seed--
@@ -33,12 +30,12 @@ assert.strictEqual(euler160(), 16576);
 ## --seed-contents--
 
 ```js
-function euler160() {
+function factorialTrailingDigits() {
 
   return true;
 }
 
-euler160();
+factorialTrailingDigits();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-161-triominoes.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-161-triominoes.md
index ea369bae60d..8e0a070c788 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-161-triominoes.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-161-triominoes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f40d1000cf542c50ff20
 title: 'Problem 161: Triominoes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301795
 dashedName: problem-161-triominoes
 ---
@@ -12,18 +12,24 @@ A triomino is a shape consisting of three squares joined via the edges.
 
 There are two basic forms:
 
+<img class="img-responsive center-block" alt="two basic triominoes forms" src="https://cdn.freecodecamp.org/curriculum/project-euler/triominoes-1.gif" style="background-color: white; padding: 10px;" />
+
 If all possible orientations are taken into account there are six:
 
+<img class="img-responsive center-block" alt="triominoes forms including orientation" src="https://cdn.freecodecamp.org/curriculum/project-euler/triominoes-2.gif" style="background-color: white; padding: 10px;" />
+
 Any n by m grid for which nxm is divisible by 3 can be tiled with triominoes. If we consider tilings that can be obtained by reflection or rotation from another tiling as different there are 41 ways a 2 by 9 grid can be tiled with triominoes:
 
+<img class="img-responsive center-block" alt="animation showing 41 ways of filling 2x9 grid with triominoes" src="https://cdn.freecodecamp.org/curriculum/project-euler/triominoes-3.gif" style="background-color: white; padding: 10px;" />
+
 In how many ways can a 9 by 12 grid be tiled in this way by triominoes?
 
 # --hints--
 
-`euler161()` should return 20574308184277972.
+`triominoes()` should return `20574308184277972`.
 
 ```js
-assert.strictEqual(euler161(), 20574308184277972);
+assert.strictEqual(triominoes(), 20574308184277972);
 ```
 
 # --seed--
@@ -31,12 +37,12 @@ assert.strictEqual(euler161(), 20574308184277972);
 ## --seed-contents--
 
 ```js
-function euler161() {
+function triominoes() {
 
   return true;
 }
 
-euler161();
+triominoes();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.md
index 53a6bcd7722..9ad940349fe 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f40e1000cf542c50ff21
 title: 'Problem 162: Hexadecimal numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301796
 dashedName: problem-162-hexadecimal-numbers
 ---
@@ -10,9 +10,9 @@ dashedName: problem-162-hexadecimal-numbers
 
 In the hexadecimal number system numbers are represented using 16 different digits:
 
-0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F
+$$0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F$$
 
-The hexadecimal number AF when written in the decimal number system equals 10x16+15=175.
+The hexadecimal number AF when written in the decimal number system equals $10 \times 16 + 15 = 175$.
 
 In the 3-digit hexadecimal numbers 10A, 1A0, A10, and A01 the digits 0,1 and A are all present.
 
@@ -20,16 +20,22 @@ Like numbers written in base ten we write hexadecimal numbers without leading ze
 
 How many hexadecimal numbers containing at most sixteen hexadecimal digits exist with all of the digits 0,1, and A present at least once?
 
-Give your answer as a hexadecimal number.
+Give your answer with hexadecimal number as a string.
 
-(A,B,C,D,E and F in upper case, without any leading or trailing code that marks the number as hexadecimal and without leading zeroes , e.g. 1A3F and not: 1a3f and not 0x1a3f and not $1A3F and not #1A3F and not 0000001A3F)
+**Note:** (A,B,C,D,E and F in upper case, without any leading or trailing code that marks the number as hexadecimal and without leading zeroes , e.g. 1A3F and not: 1a3f and not 0x1a3f and not $1A3F and not #1A3F and not 0000001A3F)
 
 # --hints--
 
-`euler162()` should return 3D58725572C62302.
+`hexadecimalNumbers()` should return a string.
 
 ```js
-assert.strictEqual(euler162(), '3D58725572C62302');
+assert(typeof hexadecimalNumbers() === 'string');
+```
+
+`hexadecimalNumbers()` should return the string `3D58725572C62302`.
+
+```js
+assert.strictEqual(hexadecimalNumbers(), '3D58725572C62302');
 ```
 
 # --seed--
@@ -37,12 +43,12 @@ assert.strictEqual(euler162(), '3D58725572C62302');
 ## --seed-contents--
 
 ```js
-function euler162() {
+function hexadecimalNumbers() {
 
   return true;
 }
 
-euler162();
+hexadecimalNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md
index 72ed1158b19..e5fa50fb8e9 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f40f1000cf542c50ff22
 title: 'Problem 163: Cross-hatched triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301797
 dashedName: problem-163-cross-hatched-triangles
 ---
@@ -10,14 +10,25 @@ dashedName: problem-163-cross-hatched-triangles
 
 Consider an equilateral triangle in which straight lines are drawn from each vertex to the middle of the opposite side, such as in the size 1 triangle in the sketch below.
 
-Sixteen triangles of either different shape or size or orientation or location can now be observed in that triangle. Using size 1 triangles as building blocks, larger triangles can be formed, such as the size 2 triangle in the above sketch. One-hundred and four triangles of either different shape or size or orientation or location can now be observed in that size 2 triangle. It can be observed that the size 2 triangle contains 4 size 1 triangle building blocks. A size 3 triangle would contain 9 size 1 triangle building blocks and a size n triangle would thus contain n2 size 1 triangle building blocks. If we denote T(n) as the number of triangles present in a triangle of size n, then T(1) = 16 T(2) = 104 Find T(36).
+<img class="img-responsive center-block" alt="triangles with size 1 and size 2" src="https://cdn.freecodecamp.org/curriculum/project-euler/cross-hatched-triangles.gif" style="background-color: white; padding: 10px;" />
+
+Sixteen triangles of either different shape or size or orientation or location can now be observed in that triangle. Using size 1 triangles as building blocks, larger triangles can be formed, such as the size 2 triangle in the above sketch. One-hundred and four triangles of either different shape or size or orientation or location can now be observed in that size 2 triangle.
+
+It can be observed that the size 2 triangle contains 4 size 1 triangle building blocks. A size 3 triangle would contain 9 size 1 triangle building blocks and a size $n$ triangle would thus contain $n^2$ size 1 triangle building blocks.
+
+If we denote $T(n)$ as the number of triangles present in a triangle of size $n$, then
+
+$$\begin{align}   & T(1) = 16 \\\\
+  & T(2) = 104 \end{align}$$
+
+Find $T(36)$.
 
 # --hints--
 
-`euler163()` should return 343047.
+`crossHatchedTriangles()` should return `343047`.
 
 ```js
-assert.strictEqual(euler163(), 343047);
+assert.strictEqual(crossHatchedTriangles(), 343047);
 ```
 
 # --seed--
@@ -25,12 +36,12 @@ assert.strictEqual(euler163(), 343047);
 ## --seed-contents--
 
 ```js
-function euler163() {
+function crossHatchedTriangles() {
 
   return true;
 }
 
-euler163();
+crossHatchedTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md
index 8082f00bff3..83215f99ba4 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md
@@ -2,7 +2,7 @@
 id: 5900f4111000cf542c50ff23
 title: >-
   Problem 164: Numbers for which no three consecutive digits have a sum greater than a given value
-challengeType: 5
+challengeType: 1
 forumTopicId: 301798
 dashedName: >-
   problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value
@@ -10,14 +10,14 @@ dashedName: >-
 
 # --description--
 
-How many 20 digit numbers n (without any leading zero) exist such that no three consecutive digits of n have a sum greater than 9?
+How many 20 digit numbers $n$ (without any leading zero) exist such that no three consecutive digits of $n$ have a sum greater than 9?
 
 # --hints--
 
-`euler164()` should return 378158756814587.
+`consecutiveDigitsSum()` should return `378158756814587`.
 
 ```js
-assert.strictEqual(euler164(), 378158756814587);
+assert.strictEqual(consecutiveDigitsSum(), 378158756814587);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler164(), 378158756814587);
 ## --seed-contents--
 
 ```js
-function euler164() {
+function consecutiveDigitsSum() {
 
   return true;
 }
 
-euler164();
+consecutiveDigitsSum();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-165-intersections.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-165-intersections.md
index a98373c3384..04fef3d3e53 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-165-intersections.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-165-intersections.md
@@ -1,29 +1,47 @@
 ---
 id: 5900f4111000cf542c50ff24
 title: 'Problem 165: Intersections'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301799
 dashedName: problem-165-intersections
 ---
 
 # --description--
 
-A segment is uniquely defined by its two endpoints. By considering two line segments in plane geometry there are three possibilities:
-
-the segments have zero points, one point, or infinitely many points in common.
+A segment is uniquely defined by its two endpoints. By considering two line segments in plane geometry there are three possibilities: the segments have zero points, one point, or infinitely many points in common.
 
 Moreover when two segments have exactly one point in common it might be the case that that common point is an endpoint of either one of the segments or of both. If a common point of two segments is not an endpoint of either of the segments it is an interior point of both segments.
 
-We will call a common point T of two segments L1 and L2 a true intersection point of L1 and L2 if T is the only common point of L1 and L2 and T is an interior point of both segments.
+We will call a common point $T$ of two segments $L_1$ and $L_2$ a true intersection point of $L_1$ and $L_2$ if $T$ is the only common point of $L_1$ and $L_2$ and $T$ is an interior point of both segments.
 
-Consider the three segments L1, L2, and L3: L1: (27, 44) to (12, 32) L2: (46, 53) to (17, 62) L3: (46, 70) to (22, 40) It can be verified that line segments L2 and L3 have a true intersection point. We note that as the one of the end points of L3: (22,40) lies on L1 this is not considered to be a true point of intersection. L1 and L2 have no common point. So among the three line segments, we find one true intersection point. Now let us do the same for 5000 line segments. To this end, we generate 20000 numbers using the so-called "Blum Blum Shub" pseudo-random number generator. s0 = 290797 sn+1 = sn×sn (modulo 50515093) tn = sn (modulo 500) To create each line segment, we use four consecutive numbers tn. That is, the first line segment is given by: (t1, t2) to (t3, t4) The first four numbers computed according to the above generator should be: 27, 144, 12 and 232. The first segment would thus be (27,144) to (12,232). How many distinct true intersection points are found among the 5000 line segments?
+Consider the three segments $L_1$, $L_2$, and $L_3$:
+
+$$\begin{align}   & L_1: (27, 44) \\;\text{to}\\; (12, 32) \\\\
+  & L_2: (46, 53) \\;\text{to}\\; (17, 62) \\\\   & L_3: (46, 70) \\;\text{to}\\; (22, 40) \\\\
+\end{align}$$
+
+It can be verified that line segments $L_2$ and $L_3$ have a true intersection point. We note that as the one of the end points of $L_3$: (22, 40) lies on $L_1$ this is not considered to be a true point of intersection. $L_1$ and $L_2$ have no common point. So among the three line segments, we find one true intersection point.
+
+Now let us do the same for 5000 line segments. To this end, we generate 20000 numbers using the so-called "Blum Blum Shub" pseudo-random number generator.
+
+$$\begin{align}   & s_0 = 290797 \\\\
+  & s_{n + 1} = s_n × s_n (\text{modulo}\\; 50515093) \\\\   & t_n = s_n (\text{modulo}\\; 500) \\\\
+\end{align}$$
+
+To create each line segment, we use four consecutive numbers $t_n$. That is, the first line segment is given by:
+
+($_t$1, $t_2$) to ($t_3$, $t_4$)
+
+The first four numbers computed according to the above generator should be: 27, 144, 12 and 232. The first segment would thus be (27, 144) to (12, 232).
+
+How many distinct true intersection points are found among the 5000 line segments?
 
 # --hints--
 
-`euler165()` should return 2868868.
+`distinctIntersections()` should return `2868868`.
 
 ```js
-assert.strictEqual(euler165(), 2868868);
+assert.strictEqual(distinctIntersections(), 2868868);
 ```
 
 # --seed--
@@ -31,12 +49,12 @@ assert.strictEqual(euler165(), 2868868);
 ## --seed-contents--
 
 ```js
-function euler165() {
+function distinctIntersections() {
 
   return true;
 }
 
-euler165();
+distinctIntersections();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-166-criss-cross.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-166-criss-cross.md
index 9f1db5cea49..f413a225835 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-166-criss-cross.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-166-criss-cross.md
@@ -1,29 +1,31 @@
 ---
 id: 5900f4131000cf542c50ff25
 title: 'Problem 166: Criss Cross'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301800
 dashedName: problem-166-criss-cross
 ---
 
 # --description--
 
-A 4x4 grid is filled with digits d, 0 ≤ d ≤ 9.
+A 4x4 grid is filled with digits $d$, $0 ≤ d ≤ 9$.
 
 It can be seen that in the grid
 
-6 3 3 0 5 0 4 3 0 7 1 4 1 2 4 5
+$$\begin{array}{}   6 & 3 & 3 & 0 \\\\
+  5 & 0 & 4 & 3 \\\\   0 & 7 & 1 & 4 \\\\
+  1 & 2 & 4 & 5 \end{array}$$
 
 the sum of each row and each column has the value 12. Moreover the sum of each diagonal is also 12.
 
-In how many ways can you fill a 4x4 grid with the digits d, 0 ≤ d ≤ 9 so that each row, each column, and both diagonals have the same sum?
+In how many ways can you fill a 4x4 grid with the digits $d$, $0 ≤ d ≤ 9$ so that each row, each column, and both diagonals have the same sum?
 
 # --hints--
 
-`euler166()` should return 7130034.
+`crissCross()` should return `7130034`.
 
 ```js
-assert.strictEqual(euler166(), 7130034);
+assert.strictEqual(crissCross(), 7130034);
 ```
 
 # --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler166(), 7130034);
 ## --seed-contents--
 
 ```js
-function euler166() {
+function crissCross() {
 
   return true;
 }
 
-euler166();
+crissCross();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.md
index 6f30b4b2729..37f3fd53c28 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.md
@@ -1,31 +1,29 @@
 ---
 id: 5900f4141000cf542c50ff26
 title: 'Problem 167: Investigating Ulam sequences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301801
 dashedName: problem-167-investigating-ulam-sequences
 ---
 
 # --description--
 
-For two positive integers a and b, the Ulam sequence U(a,b) is defined by U(a,b)1 = a, U(a,b)2 = b and for k > 2,
+For two positive integers $a$ and $b$, the Ulam sequence $U(a,b)$ is defined by ${U{(a,b)}\_1} = a$, ${U{(a,b)}\_2} = b$ and for $k > 2$, ${U{(a,b)}\_k}$ is the smallest integer greater than ${U{(a,b)}\_{(k-1)}}$ which can be written in exactly one way as the sum of two distinct previous members of $U(a,b)$.
 
-U(a,b)k is the smallest integer greater than U(a,b)(k-1) which can be written in exactly one way as the sum of two distinct previous members of U(a,b).
+For example, the sequence $U(1,2)$ begins with
 
-For example, the sequence U(1,2) begins with
+$$1, 2, 3 = 1 + 2, 4 = 1 + 3, 6 = 2 + 4, 8 = 2 + 6, 11 = 3 + 8$$
 
-1, 2, 3 = 1 + 2, 4 = 1 + 3, 6 = 2 + 4, 8 = 2 + 6, 11 = 3 + 8;
+5 does not belong to it because $5 = 1 + 4 = 2 + 3$ has two representations as the sum of two previous members, likewise $7 = 1 + 6 = 3 + 4$.
 
-5 does not belong to it because 5 = 1 + 4 = 2 + 3 has two representations as the sum of two previous members, likewise 7 = 1 + 6 = 3 + 4.
-
-Find ∑U(2,2n+1)k for 2 ≤ n ≤10, where k = 1011.
+Find $\sum {U(2, 2n + 1)_k}$ for $2 ≤ n ≤ 10$, where $k = {10}^{11}$.
 
 # --hints--
 
-`euler167()` should return 3916160068885.
+`ulamSequences()` should return `3916160068885`.
 
 ```js
-assert.strictEqual(euler167(), 3916160068885);
+assert.strictEqual(ulamSequences(), 3916160068885);
 ```
 
 # --seed--
@@ -33,12 +31,12 @@ assert.strictEqual(euler167(), 3916160068885);
 ## --seed-contents--
 
 ```js
-function euler167() {
+function ulamSequences() {
 
   return true;
 }
 
-euler167();
+ulamSequences();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-168-number-rotations.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-168-number-rotations.md
index 9ad5f78e64d..50802415375 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-168-number-rotations.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-168-number-rotations.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4151000cf542c50ff27
 title: 'Problem 168: Number Rotations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301802
 dashedName: problem-168-number-rotations
 ---
@@ -10,18 +10,24 @@ dashedName: problem-168-number-rotations
 
 Consider the number 142857. We can right-rotate this number by moving the last digit (7) to the front of it, giving us 714285.
 
-It can be verified that 714285=5×142857.
+It can be verified that $714285 = 5 × 142857$.
 
 This demonstrates an unusual property of 142857: it is a divisor of its right-rotation.
 
-Find the last 5 digits of the sum of all integers n, 10 &lt; n &lt; 10100, that have this property.
+For integer number of digits $a$ and $b$, find the last 5 digits of the sum of all integers $n$, $10^a &lt; n &lt; 10^b$, that have this property.
 
 # --hints--
 
-`euler168()` should return 59206.
+`numberRotations(2, 10)` should return `98311`.
 
 ```js
-assert.strictEqual(euler168(), 59206);
+assert.strictEqual(numberRotations(2, 10), 98311);
+```
+
+`numberRotations(2, 100)` should return `59206`.
+
+```js
+assert.strictEqual(numberRotations(2, 100), 59206);
 ```
 
 # --seed--
@@ -29,16 +35,48 @@ assert.strictEqual(euler168(), 59206);
 ## --seed-contents--
 
 ```js
-function euler168() {
+function numberRotations(a, b) {
 
-  return true;
+  return 0;
 }
 
-euler168();
+numberRotations();
 ```
 
 # --solutions--
 
 ```js
-// solution required
+function numberRotations(minDigits, maxDigits) {
+  const DIGITS_TO_KEEP = 100000n;
+  const powersOfTen = Array(maxDigits).fill(0);
+  powersOfTen[0] = 1n;
+  for (let i = 1; i < maxDigits; i++) {
+    powersOfTen[i] = powersOfTen[i - 1] * 10n;
+  }
+
+  // We want numbers of the form xd * m = dx
+  // Or more precisely:
+  //   (x * 10 + d) * m = d*10^(n-1) + x
+  // Solving for x:
+  //   x = d (10^(n-1) - m) / (10 * m - 1)
+  let total = 0n;
+  for (let numDigits = minDigits; numDigits <= maxDigits; numDigits++) {
+    // Check all multiplier - digit pairs to see if a candidate can be built
+    //  with the correct number of digits
+    for (let multiplier = 1n; multiplier < 10n; multiplier++) {
+      for (let lastDigit = 1n; lastDigit < 10n; lastDigit++) {
+        const numerator   = lastDigit * (powersOfTen[numDigits - 1] - multiplier);
+        const denominator = (powersOfTen[1] * multiplier - 1n);
+        if (numerator % denominator === 0n) {
+          const candidate = (numerator / denominator) * 10n + lastDigit;
+          if (candidate.toString().length === numDigits) {
+            total = (total + candidate) % DIGITS_TO_KEEP;
+          }
+        }
+      }
+    }
+  }
+
+  return parseInt(total);
+}
 ```
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
index e0bf8ea804d..52005157a98 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
@@ -2,7 +2,7 @@
 id: 5900f4151000cf542c50ff28
 title: >-
   Problem 169: Exploring the number of different ways a number can be expressed as a sum of powers of 2
-challengeType: 5
+challengeType: 1
 forumTopicId: 301803
 dashedName: >-
   problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2
@@ -10,26 +10,22 @@ dashedName: >-
 
 # --description--
 
-Define f(0)=1 and f(n) to be the number of different ways n can be expressed as a sum of integer powers of 2 using each power no more than twice.
+Define $f(0)=1$ and $f(n)$ to be the number of different ways $n$ can be expressed as a sum of integer powers of 2 using each power no more than twice.
 
-For example, f(10)=5 since there are five different ways to express 10:
+For example, $f(10)=5$ since there are five different ways to express 10:
 
-1 + 1 + 8
+$$\begin{align}   & 1 + 1 + 8 \\\\
+  & 1 + 1 + 4 + 4 \\\\   & 1 + 1 + 2 + 2 + 4 \\\\
+  & 2 + 4 + 4 \\\\ & 2 + 8 \end{align}$$
 
-1 + 1 + 4 + 41 + 1 + 2 + 2 + 4
-
-2 + 4 + 4
-
-2 + 8
-
-What is f(1025)?
+What is $f({10}^{25})$?
 
 # --hints--
 
-`euler169()` should return 178653872807.
+`numberOfWaysToExpress()` should return `178653872807`.
 
 ```js
-assert.strictEqual(euler169(), 178653872807);
+assert.strictEqual(numberOfWaysToExpress(), 178653872807);
 ```
 
 # --seed--
@@ -37,12 +33,12 @@ assert.strictEqual(euler169(), 178653872807);
 ## --seed-contents--
 
 ```js
-function euler169() {
+function numberOfWaysToExpress() {
 
   return true;
 }
 
-euler169();
+numberOfWaysToExpress();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-17-number-letter-counts.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-17-number-letter-counts.md
index 2b096d1d78b..c057291496e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-17-number-letter-counts.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-17-number-letter-counts.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f37d1000cf542c50fe90
 title: 'Problem 17: Number letter counts'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301804
 dashedName: problem-17-number-letter-counts
 ---
@@ -28,13 +28,13 @@ assert(typeof numberLetterCounts(5) === 'number');
 assert.strictEqual(numberLetterCounts(5), 19);
 ```
 
-`numberLetterCounts(150)` should return 1903.
+`numberLetterCounts(150)` 應該返回 1903。
 
 ```js
 assert.strictEqual(numberLetterCounts(150), 1903);
 ```
 
-`numberLetterCounts(1000)` should return 21124.
+`numberLetterCounts(1000)` 應該返回 21124。
 
 ```js
 assert.strictEqual(numberLetterCounts(1000), 21124);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md
index 7a7e20558b5..b6886e18764 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md
@@ -2,7 +2,7 @@
 id: 5900f4161000cf542c50ff29
 title: >-
   Problem 170: Find the largest 0 to 9 pandigital that can be formed by concatenating products
-challengeType: 5
+challengeType: 1
 forumTopicId: 301805
 dashedName: >-
   problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products
@@ -12,9 +12,10 @@ dashedName: >-
 
 Take the number 6 and multiply it by each of 1273 and 9854:
 
-6 × 1273 = 7638 6 × 9854 = 59124
+$$\begin{align}   & 6 × 1273 = 7638 \\\\
+  & 6 × 9854 = 59124 \\\\ \end{align}$$
 
-By concatenating these products we get the 1 to 9 pandigital 763859124. We will call 763859124 the "concatenated product of 6 and (1273,9854)". Notice too, that the concatenation of the input numbers, 612739854, is also 1 to 9 pandigital.
+By concatenating these products we get the 1 to 9 pandigital 763859124. We will call 763859124 the "concatenated product of 6 and (1273, 9854)". Notice too, that the concatenation of the input numbers, 612739854, is also 1 to 9 pandigital.
 
 The same can be done for 0 to 9 pandigital numbers.
 
@@ -22,10 +23,10 @@ What is the largest 0 to 9 pandigital 10-digit concatenated product of an intege
 
 # --hints--
 
-`euler170()` should return 9857164023.
+`largestPandigital()` should return `9857164023`.
 
 ```js
-assert.strictEqual(euler170(), 9857164023);
+assert.strictEqual(largestPandigital(), 9857164023);
 ```
 
 # --seed--
@@ -33,12 +34,12 @@ assert.strictEqual(euler170(), 9857164023);
 ## --seed-contents--
 
 ```js
-function euler170() {
+function largestPandigital() {
 
   return true;
 }
 
-euler170();
+largestPandigital();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md
index 2b355e111f4..60133bf2e51 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md
@@ -2,7 +2,7 @@
 id: 5900f4181000cf542c50ff2a
 title: >-
   Problem 171: Finding numbers for which the sum of the squares of the digits is a square
-challengeType: 5
+challengeType: 1
 forumTopicId: 301806
 dashedName: >-
   problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square
@@ -10,22 +10,20 @@ dashedName: >-
 
 # --description--
 
-For a positive integer n, let f(n) be the sum of the squares of the digits (in base 10) of n, e.g.
+For a positive integer $n$, let $f(n)$ be the sum of the squares of the digits (in base 10) of $n$, e.g.
 
-f(3) = 32 = 9,
+$$\begin{align}   & f(3) = 3^2 = 9 \\\\
+  & f(25) = 2^2 + 5^2 = 4 + 25 = 29 \\\\   & f(442) = 4^2 + 4^2 + 2^2 = 16 + 16 + 4 = 36 \\\\
+\end{align}$$
 
-f(25) = 22 + 52 = 4 + 25 = 29,
-
-f(442) = 42 + 42 + 22 = 16 + 16 + 4 = 36
-
-Find the last nine digits of the sum of all n, 0 &lt; n &lt; 1020, such that f(n) is a perfect square.
+Find the last nine digits of the sum of all $n$, $0 &lt; n &lt; {10}^{20}$, such that $f(n)$ is a perfect square.
 
 # --hints--
 
-`euler171()` should return 142989277.
+`lastDigitsSumOfPerfectSquare()` should return `142989277`.
 
 ```js
-assert.strictEqual(euler171(), 142989277);
+assert.strictEqual(lastDigitsSumOfPerfectSquare(), 142989277);
 ```
 
 # --seed--
@@ -33,12 +31,12 @@ assert.strictEqual(euler171(), 142989277);
 ## --seed-contents--
 
 ```js
-function euler171() {
+function lastDigitsSumOfPerfectSquare() {
 
   return true;
 }
 
-euler171();
+lastDigitsSumOfPerfectSquare();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.md
index a25ab3224fd..cfc75b9ff19 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.md
@@ -1,21 +1,21 @@
 ---
 id: 5900f4181000cf542c50ff2b
 title: 'Problem 172: Investigating numbers with few repeated digits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301807
 dashedName: problem-172-investigating-numbers-with-few-repeated-digits
 ---
 
 # --description--
 
-How many 18-digit numbers n (without leading zeros) are there such that no digit occurs more than three times in n?
+How many 18-digit numbers $n$ (without leading zeros) are there such that no digit occurs more than three times in $n$?
 
 # --hints--
 
-`euler172()` should return 227485267000992000.
+`numbersWithRepeatedDigits()` should return `227485267000992000`.
 
 ```js
-assert.strictEqual(euler172(), 227485267000992000);
+assert.strictEqual(numbersWithRepeatedDigits(), 227485267000992000);
 ```
 
 # --seed--
@@ -23,12 +23,12 @@ assert.strictEqual(euler172(), 227485267000992000);
 ## --seed-contents--
 
 ```js
-function euler172() {
+function numbersWithRepeatedDigits() {
 
   return true;
 }
 
-euler172();
+numbersWithRepeatedDigits();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md
index 700b710e805..0488d662943 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md
@@ -2,7 +2,7 @@
 id: 5900f41a1000cf542c50ff2c
 title: >-
   Problem 173: Using up to one million tiles how many different "hollow" square laminae can be formed?
-challengeType: 5
+challengeType: 1
 forumTopicId: 301808
 dashedName: >-
   problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed
@@ -12,14 +12,16 @@ dashedName: >-
 
 We shall define a square lamina to be a square outline with a square "hole" so that the shape possesses vertical and horizontal symmetry. For example, using exactly thirty-two square tiles we can form two different square laminae:
 
+<img class="img-responsive center-block" alt="two square lamina with holes 2x2 and 7x7" src="https://cdn.freecodecamp.org/curriculum/project-euler/using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.gif" style="background-color: white; padding: 10px;" />
+
 With one-hundred tiles, and not necessarily using all of the tiles at one time, it is possible to form forty-one different square laminae. Using up to one million tiles how many different square laminae can be formed?
 
 # --hints--
 
-`euler173()` should return 1572729.
+`differentHollowSquareLaminae()` should return `1572729`.
 
 ```js
-assert.strictEqual(euler173(), 1572729);
+assert.strictEqual(differentHollowSquareLaminae(), 1572729);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler173(), 1572729);
 ## --seed-contents--
 
 ```js
-function euler173() {
+function differentHollowSquareLaminae() {
 
   return true;
 }
 
-euler173();
+differentHollowSquareLaminae();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md
index 13277919381..48843b6b0a9 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md
@@ -2,7 +2,7 @@
 id: 5900f41a1000cf542c50ff2d
 title: >-
   Problem 174: Counting the number of "hollow" square laminae that can form one, two, three, ... distinct arrangements
-challengeType: 5
+challengeType: 1
 forumTopicId: 301809
 dashedName: >-
   problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-----distinct-arrangements
@@ -14,14 +14,20 @@ We shall define a square lamina to be a square outline with a square "hole" so t
 
 Given eight tiles it is possible to form a lamina in only one way: 3x3 square with a 1x1 hole in the middle. However, using thirty-two tiles it is possible to form two distinct laminae.
 
-If t represents the number of tiles used, we shall say that t = 8 is type L(1) and t = 32 is type L(2). Let N(n) be the number of t ≤ 1000000 such that t is type L(n); for example, N(15) = 832. What is ∑ N(n) for 1 ≤ n ≤ 10?
+<img class="img-responsive center-block" alt="two square lamina with holes 2x2 and 7x7" src="https://cdn.freecodecamp.org/curriculum/project-euler/using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.gif" style="background-color: white; padding: 10px;" />
+
+If $t$ represents the number of tiles used, we shall say that $t = 8$ is type $L(1)$ and $t = 32$ is type $L(2)$.
+
+Let $N(n)$ be the number of $t ≤ 1000000$ such that $t$ is type $L(n)$; for example, $N(15) = 832$.
+
+What is $\sum N(n)$ for $1 ≤ n ≤ 10$?
 
 # --hints--
 
-`euler174()` should return 209566.
+`hollowSquareLaminaeDistinctArrangements()` should return `209566`.
 
 ```js
-assert.strictEqual(euler174(), 209566);
+assert.strictEqual(hollowSquareLaminaeDistinctArrangements(), 209566);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler174(), 209566);
 ## --seed-contents--
 
 ```js
-function euler174() {
+function hollowSquareLaminaeDistinctArrangements() {
 
   return true;
 }
 
-euler174();
+hollowSquareLaminaeDistinctArrangements();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
index cd3abbf807a..b3419c34823 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
@@ -2,7 +2,7 @@
 id: 5900f41c1000cf542c50ff2e
 title: >-
   Problem 175: Fractions involving the number of different ways a number can be expressed as a sum of powers of 2
-challengeType: 5
+challengeType: 1
 forumTopicId: 301810
 dashedName: >-
   problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2
@@ -10,18 +10,36 @@ dashedName: >-
 
 # --description--
 
-Define f(0)=1 and f(n) to be the number of ways to write n as a sum of powers of 2 where no power occurs more than twice.
+Define $f(0) = 1$ and $f(n)$ to be the number of ways to write $n$ as a sum of powers of 2 where no power occurs more than twice.
 
-For example, f(10)=5 since there are five different ways to express 10:10 = 8+2 = 8+1+1 = 4+4+2 = 4+2+2+1+1 = 4+4+1+1
+For example, $f(10) = 5$ since there are five different ways to express 10:
 
-It can be shown that for every fraction p/q (p>0, q>0) there exists at least one integer n such that f(n)/f(n-1)=p/q. For instance, the smallest n for which f(n)/f(n-1)=13/17 is 241. The binary expansion of 241 is 11110001. Reading this binary number from the most significant bit to the least significant bit there are 4 one's, 3 zeroes and 1 one. We shall call the string 4,3,1 the Shortened Binary Expansion of 241. Find the Shortened Binary Expansion of the smallest n for which f(n)/f(n-1)=123456789/987654321. Give your answer as comma separated integers, without any whitespaces.
+$$10 = 8 + 2 = 8 + 1 + 1 = 4 + 4 + 2 = 4 + 2 + 2 + 1 + 1 = 4 + 4 + 1 + 1$$
+
+It can be shown that for every fraction $\frac{p}{q}\\; (p>0, q>0)$ there exists at least one integer $n$ such that $\frac{f(n)}{f(n - 1)} = \frac{p}{q}$.
+
+For instance, the smallest $n$ for which $\frac{f(n)}{f(n - 1)} = \frac{13}{17}$ is 241. The binary expansion of 241 is 11110001.
+
+Reading this binary number from the most significant bit to the least significant bit there are 4 one's, 3 zeroes and 1 one. We shall call the string 4,3,1 the Shortened Binary Expansion of 241.
+
+Find the Shortened Binary Expansion of the smallest $n$ for which
+
+$$\frac{f(n)}{f(n - 1)} = \frac{123456789}{987654321}$$
+
+Give your answer as a string with comma separated integers, without any whitespaces.
 
 # --hints--
 
-`euler175()` should return 1, 13717420, 8.
+`shortenedBinaryExpansionOfNumber()` should return a string.
 
 ```js
-assert.strictEqual(euler175(), 1, 13717420, 8);
+assert(typeof shortenedBinaryExpansionOfNumber() === 'string');
+```
+
+`shortenedBinaryExpansionOfNumber()` should return the string `1,13717420,8`.
+
+```js
+assert.strictEqual(shortenedBinaryExpansionOfNumber(), '1,13717420,8');
 ```
 
 # --seed--
@@ -29,12 +47,12 @@ assert.strictEqual(euler175(), 1, 13717420, 8);
 ## --seed-contents--
 
 ```js
-function euler175() {
+function shortenedBinaryExpansionOfNumber() {
 
   return true;
 }
 
-euler175();
+shortenedBinaryExpansionOfNumber();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.md
index c3b6c090fed..01056496296 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f41c1000cf542c50ff2f
 title: 'Problem 176: Right-angled triangles that share a cathetus'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301811
 dashedName: problem-176-right-angled-triangles-that-share-a-cathetus
 ---
@@ -14,10 +14,10 @@ Find the smallest integer that can be the length of a cathetus of exactly 47547
 
 # --hints--
 
-`euler176()` should return 96818198400000.
+`trianglesSharingCathetus()` should return `96818198400000`.
 
 ```js
-assert.strictEqual(euler176(), 96818198400000);
+assert.strictEqual(trianglesSharingCathetus(), 96818198400000);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler176(), 96818198400000);
 ## --seed-contents--
 
 ```js
-function euler176() {
+function trianglesSharingCathetus() {
 
   return true;
 }
 
-euler176();
+trianglesSharingCathetus();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md
index 2e391146546..c6f7b8ee5c4 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f41e1000cf542c50ff30
 title: 'Problem 177: Integer angled Quadrilaterals'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301812
 dashedName: problem-177-integer-angled-quadrilaterals
 ---
@@ -10,14 +10,22 @@ dashedName: problem-177-integer-angled-quadrilaterals
 
 Let ABCD be a convex quadrilateral, with diagonals AC and BD. At each vertex the diagonal makes an angle with each of the two sides, creating eight corner angles.
 
-For example, at vertex A, the two angles are CAD, CAB. We call such a quadrilateral for which all eight corner angles have integer values when measured in degrees an "integer angled quadrilateral". An example of an integer angled quadrilateral is a square, where all eight corner angles are 45°. Another example is given by DAC = 20°, BAC = 60°, ABD = 50°, CBD = 30°, BCA = 40°, DCA = 30°, CDB = 80°, ADB = 50°. What is the total number of non-similar integer angled quadrilaterals? Note: In your calculations you may assume that a calculated angle is integral if it is within a tolerance of 10-9 of an integer value.
+<img class="img-responsive center-block" alt="convex quadrilateral ABCD, with diagonals AC and BD" src="https://cdn.freecodecamp.org/curriculum/project-euler/integer-angled-quadrilaterals.gif" style="background-color: white; padding: 10px;" />
+
+For example, at vertex A, the two angles are CAD, CAB.
+
+We call such a quadrilateral for which all eight corner angles have integer values when measured in degrees an "integer angled quadrilateral". An example of an integer angled quadrilateral is a square, where all eight corner angles are 45°. Another example is given by DAC = 20°, BAC = 60°, ABD = 50°, CBD = 30°, BCA = 40°, DCA = 30°, CDB = 80°, ADB = 50°.
+
+What is the total number of non-similar integer angled quadrilaterals?
+
+**Note:** In your calculations you may assume that a calculated angle is integral if it is within a tolerance of ${10}^{-9}$ of an integer value.
 
 # --hints--
 
-`euler177()` should return 129325.
+`integerAngledQuadrilaterals()` should return `129325`.
 
 ```js
-assert.strictEqual(euler177(), 129325);
+assert.strictEqual(integerAngledQuadrilaterals(), 129325);
 ```
 
 # --seed--
@@ -25,12 +33,12 @@ assert.strictEqual(euler177(), 129325);
 ## --seed-contents--
 
 ```js
-function euler177() {
+function integerAngledQuadrilaterals() {
 
   return true;
 }
 
-euler177();
+integerAngledQuadrilaterals();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-178-step-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-178-step-numbers.md
index 12bad9c5ada..22f44139de6 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-178-step-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-178-step-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f41e1000cf542c50ff31
 title: 'Problem 178: Step Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301813
 dashedName: problem-178-step-numbers
 ---
@@ -16,14 +16,14 @@ A number for which every pair of consecutive digits has a difference of one is c
 
 A pandigital number contains every decimal digit from 0 to 9 at least once.
 
-How many pandigital step numbers less than 1040 are there?
+How many pandigital step numbers less than ${10}^{40}$ are there?
 
 # --hints--
 
-`euler178()` should return 126461847755.
+`stepNumbers()` should return `126461847755`.
 
 ```js
-assert.strictEqual(euler178(), 126461847755);
+assert.strictEqual(stepNumbers(), 126461847755);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler178(), 126461847755);
 ## --seed-contents--
 
 ```js
-function euler178() {
+function stepNumbers() {
 
   return true;
 }
 
-euler178();
+stepNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md
index 1811def962b..a159a7af8f6 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md
@@ -1,21 +1,21 @@
 ---
 id: 5900f41f1000cf542c50ff32
 title: 'Problem 179: Consecutive positive divisors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301814
 dashedName: problem-179-consecutive-positive-divisors
 ---
 
 # --description--
 
-Find the number of integers 1 &lt; n &lt; 107, for which n and n + 1 have the same number of positive divisors. For example, 14 has the positive divisors 1, 2, 7, 14 while 15 has 1, 3, 5, 15.
+Find the number of integers $1 &lt; n &lt; {10}^7$, for which $n$ and $n + 1$ have the same number of positive divisors. For example, 14 has the positive divisors 1, 2, 7, 14 while 15 has 1, 3, 5, 15.
 
 # --hints--
 
-`euler179()` should return 986262.
+`consecutivePositiveDivisors()` should return `986262`.
 
 ```js
-assert.strictEqual(euler179(), 986262);
+assert.strictEqual(consecutivePositiveDivisors(), 986262);
 ```
 
 # --seed--
@@ -23,12 +23,12 @@ assert.strictEqual(euler179(), 986262);
 ## --seed-contents--
 
 ```js
-function euler179() {
+function consecutivePositiveDivisors() {
 
   return true;
 }
 
-euler179();
+consecutivePositiveDivisors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-18-maximum-path-sum-i.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-18-maximum-path-sum-i.md
index 2ad9a7a7a6e..f0d97a950b2 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-18-maximum-path-sum-i.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-18-maximum-path-sum-i.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f37e1000cf542c50fe91
 title: 'Problem 18: Maximum path sum I'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301815
 dashedName: problem-18-maximum-path-sum-i
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.md
index 3b46677319d..9eed96d38b2 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.md
@@ -1,37 +1,36 @@
 ---
 id: 5900f4201000cf542c50ff33
 title: 'Problem 180: Rational zeros of a function of three variables'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301816
 dashedName: problem-180-rational-zeros-of-a-function-of-three-variables
 ---
 
 # --description--
 
-For any integer n, consider the three functions
+For any integer $n$, consider the three functions
 
-f1,n(x,y,z) = xn+1 + yn+1 − zn+1f2,n(x,y,z) = (xy + yz + zx)\*(xn-1 + yn-1 − zn-1)f3,n(x,y,z) = xyz\*(xn-2 + yn-2 − zn-2)
+$$\begin{align}   & f_{1,n}(x,y,z) = x^{n + 1} + y^{n + 1} − z^{n + 1}\\\\
+  & f_{2,n}(x,y,z) = (xy + yz + zx) \times (x^{n - 1} + y^{n - 1} − z^{n - 1})\\\\ & f_{3,n}(x,y,z) = xyz \times (x^{n - 2} + y^{n - 2} − z^{n - 2}) \end{align}$$
 
 and their combination
 
-fn(x,y,z) = f1,n(x,y,z) + f2,n(x,y,z) − f3,n(x,y,z)
+$$\begin{align} & f_n(x,y,z) = f_{1,n}(x,y,z) + f_{2,n}(x,y,z) − f_{3,n}(x,y,z) \end{align}$$
 
-We call (x,y,z) a golden triple of order k if x, y, and z are all rational numbers of the form a / b with
+We call $(x,y,z)$ a golden triple of order $k$ if $x$, $y$, and $z$ are all rational numbers of the form $\frac{a}{b}$ with $0 &lt; a &lt; b ≤ k$ and there is (at least) one integer $n$, so that $f_n(x,y,z) = 0$.
 
-0 &lt; a &lt; b ≤ k and there is (at least) one integer n, so that fn(x,y,z) = 0.
+Let $s(x,y,z) = x + y + z$.
 
-Let s(x,y,z) = x + y + z.
+Let $t = \frac{u}{v}$ be the sum of all distinct $s(x,y,z)$ for all golden triples $(x,y,z)$ of order 35. All the $s(x,y,z)$ and $t$ must be in reduced form.
 
-Let t = u / v be the sum of all distinct s(x,y,z) for all golden triples (x,y,z) of order 35. All the s(x,y,z) and t must be in reduced form.
-
-Find u + v.
+Find $u + v$.
 
 # --hints--
 
-`euler180()` should return 285196020571078980.
+`rationalZeros()` should return `285196020571078980`.
 
 ```js
-assert.strictEqual(euler180(), 285196020571078980);
+assert.strictEqual(rationalZeros(), 285196020571078980);
 ```
 
 # --seed--
@@ -39,12 +38,12 @@ assert.strictEqual(euler180(), 285196020571078980);
 ## --seed-contents--
 
 ```js
-function euler180() {
+function rationalZeros() {
 
   return true;
 }
 
-euler180();
+rationalZeros();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md
index 1aa8a4d0875..f98d3a71b9e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md
@@ -2,7 +2,7 @@
 id: 5900f4231000cf542c50ff34
 title: >-
   Problem 181: Investigating in how many ways objects of two different colours can be grouped
-challengeType: 5
+challengeType: 1
 forumTopicId: 301817
 dashedName: >-
   problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped
@@ -10,20 +10,18 @@ dashedName: >-
 
 # --description--
 
-Having three black objects B and one white object W they can be grouped in 7 ways like this:
+Having three black objects $B$ and one white object $W$ they can be grouped in 7 ways like this:
 
-(BBBW)(B,BBW)(B,B,BW)(B,B,B,W)
+$$(BBBW)\\;(B,BBW)\\;(B,B,BW)\\;(B,B,B,W)\\;(B,BB,W)\\;(BBB,W)\\;(BB,BW)$$
 
-(B,BB,W)(BBB,W)(BB,BW)
-
-In how many ways can sixty black objects B and forty white objects W be thus grouped?
+In how many ways can sixty black objects $B$ and forty white objects $W$ be thus grouped?
 
 # --hints--
 
-`euler181()` should return 83735848679360670.
+`colorsGrouping()` should return `83735848679360670`.
 
 ```js
-assert.strictEqual(euler181(), 83735848679360670);
+assert.strictEqual(colorsGrouping(), 83735848679360670);
 ```
 
 # --seed--
@@ -31,12 +29,12 @@ assert.strictEqual(euler181(), 83735848679360670);
 ## --seed-contents--
 
 ```js
-function euler181() {
+function colorsGrouping() {
 
   return true;
 }
 
-euler181();
+colorsGrouping();
 ```
 
 # --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 c739b6384ad..e971434b3e7 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f4231000cf542c50ff35
 title: 'Problem 182: RSA encryption'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301818
 dashedName: problem-182-rsa-encryption
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.md
index 0dcbca86fd5..7586be421e3 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.md
@@ -1,37 +1,37 @@
 ---
 id: 5900f4231000cf542c50ff36
 title: 'Problem 183: Maximum product of parts'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301819
 dashedName: problem-183-maximum-product-of-parts
 ---
 
 # --description--
 
-Let N be a positive integer and let N be split into k equal parts, r = N/k, so that N = r + r + ... + r.
+Let $N$ be a positive integer and let $N$ be split into $k$ equal parts, $r = \frac{N}{k}$, so that $N = r + r + \cdots + r$.
 
-Let P be the product of these parts, P = r × r × ... × r = rk.
+Let $P$ be the product of these parts, $P = r × r × \cdots × r = r^k$.
 
-For example, if 11 is split into five equal parts, 11 = 2.2 + 2.2 + 2.2 + 2.2 + 2.2, then P = 2.25 = 51.53632.
+For example, if 11 is split into five equal parts, 11 = 2.2 + 2.2 + 2.2 + 2.2 + 2.2, then $P = {2.2}^5 = 51.53632$.
 
-Let M(N) = Pmax for a given value of N.
+Let $M(N) = P_{max}$ for a given value of $N$.
 
-It turns out that the maximum for N = 11 is found by splitting eleven into four equal parts which leads to Pmax = (11/4)4; that is, M(11) = 14641/256 = 57.19140625, which is a terminating decimal.
+It turns out that the maximum for $N = 11$ is found by splitting eleven into four equal parts which leads to $P_{max} = {(\frac{11}{4})}^4$; that is, $M(11) = \frac{14641}{256} = 57.19140625$, which is a terminating decimal.
 
-However, for N = 8 the maximum is achieved by splitting it into three equal parts, so M(8) = 512/27, which is a non-terminating decimal.
+However, for $N = 8$ the maximum is achieved by splitting it into three equal parts, so $M(8) = \frac{512}{27}$, which is a non-terminating decimal.
 
-Let D(N) = N if M(N) is a non-terminating decimal and D(N) = -N if M(N) is a terminating decimal.
+Let $D(N) = N$ if $M(N)$ is a non-terminating decimal and $D(N) = -N$ if $M(N)$ is a terminating decimal.
 
-For example, ΣD(N) for 5 ≤ N ≤ 100 is 2438.
+For example, $\sum D(N)$ for $5 ≤ N ≤ 100$ is 2438.
 
-Find ΣD(N) for 5 ≤ N ≤ 10000.
+Find $\sum D(N)$ for $5 ≤ N ≤ 10000$.
 
 # --hints--
 
-`euler183()` should return 48861552.
+`maximumProductOfParts()` should return `48861552`.
 
 ```js
-assert.strictEqual(euler183(), 48861552);
+assert.strictEqual(maximumProductOfParts(), 48861552);
 ```
 
 # --seed--
@@ -39,12 +39,12 @@ assert.strictEqual(euler183(), 48861552);
 ## --seed-contents--
 
 ```js
-function euler183() {
+function maximumProductOfParts() {
 
   return true;
 }
 
-euler183();
+maximumProductOfParts();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md
index dd5855935b1..8d3eb0bfc9d 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f4241000cf542c50ff37
 title: 'Problem 184: Triangles containing the origin'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301820
 dashedName: problem-184-triangles-containing-the-origin
 ---
 
 # --description--
 
-Consider the set Ir of points (x,y) with integer coordinates in the interior of the circle with radius r, centered at the origin, i.e. x2 + y2 &lt; r2.
+Consider the set $I_r$ of points $(x,y)$ with integer coordinates in the interior of the circle with radius $r$, centered at the origin, i.e. $x^2 + y^2 &lt; r^2$.
 
-For a radius of 2, I2 contains the nine points (0,0), (1,0), (1,1), (0,1), (-1,1), (-1,0), (-1,-1), (0,-1) and (1,-1). There are eight triangles having all three vertices in I2 which contain the origin in the interior. Two of them are shown below, the others are obtained from these by rotation.
+For a radius of 2, $I_2$ contains the nine points (0,0), (1,0), (1,1), (0,1), (-1,1), (-1,0), (-1,-1), (0,-1) and (1,-1). There are eight triangles having all three vertices in $I_2$ which contain the origin in the interior. Two of them are shown below, the others are obtained from these by rotation.
 
-For a radius of 3, there are 360 triangles containing the origin in the interior and having all vertices in I3 and for I5 the number is 10600.
+<img class="img-responsive center-block" alt="circle with radius 2, centered at the origin, with nine marked points and two triangles - (-1,0), (0,1), (1,-1) and (-1,1), (0,-1), (1,1)" src="https://cdn.freecodecamp.org/curriculum/project-euler/triangles-containing-the-origin.gif" style="background-color: white; padding: 10px;" />
 
-How many triangles are there containing the origin in the interior and having all three vertices in I105?
+For a radius of 3, there are 360 triangles containing the origin in the interior and having all vertices in $I_3$ and for $I_5$ the number is 10600.
+
+How many triangles are there containing the origin in the interior and having all three vertices in $I_{105}$?
 
 # --hints--
 
-`euler184()` should return 1725323624056.
+`trianglesContainingOrigin()` should return `1725323624056`.
 
 ```js
-assert.strictEqual(euler184(), 1725323624056);
+assert.strictEqual(trianglesContainingOrigin(), 1725323624056);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler184(), 1725323624056);
 ## --seed-contents--
 
 ```js
-function euler184() {
+function trianglesContainingOrigin() {
 
   return true;
 }
 
-euler184();
+trianglesContainingOrigin();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-185-number-mind.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-185-number-mind.md
index bd8a8539373..820f0832166 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-185-number-mind.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-185-number-mind.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4251000cf542c50ff38
 title: 'Problem 185: Number Mind'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301821
 dashedName: problem-185-number-mind
 ---
@@ -12,20 +12,38 @@ The game Number Mind is a variant of the well known game Master Mind.
 
 Instead of coloured pegs, you have to guess a secret sequence of digits. After each guess you're only told in how many places you've guessed the correct digit. So, if the sequence was 1234 and you guessed 2036, you'd be told that you have one correct digit; however, you would NOT be told that you also have another digit in the wrong place.
 
-For instance, given the following guesses for a 5-digit secret sequence, 90342 ;2 correct 70794 ;0 correct 39458 ;2 correct 34109 ;1 correct 51545 ;2 correct 12531 ;1 correct The correct sequence 39542 is unique.
+For instance, given the following guesses for a 5-digit secret sequence,
+
+$$\begin{align}   & 90342 ;2\\;\text{correct}\\\\
+  & 70794 ;0\\;\text{correct}\\\\   & 39458 ;2\\;\text{correct}\\\\
+  & 34109 ;1\\;\text{correct}\\\\   & 51545 ;2\\;\text{correct}\\\\
+  & 12531 ;1\\;\text{correct} \end{align}$$
+
+The correct sequence 39542 is unique.
 
 Based on the following guesses,
 
-5616185650518293 ;2 correct 3847439647293047 ;1 correct 5855462940810587 ;3 correct 9742855507068353 ;3 correct 4296849643607543 ;3 correct 3174248439465858 ;1 correct 4513559094146117 ;2 correct 7890971548908067 ;3 correct 8157356344118483 ;1 correct 2615250744386899 ;2 correct 8690095851526254 ;3 correct 6375711915077050 ;1 correct 6913859173121360 ;1 correct 6442889055042768 ;2 correct 2321386104303845 ;0 correct 2326509471271448 ;2 correct 5251583379644322 ;2 correct 1748270476758276 ;3 correct 4895722652190306 ;1 correct 3041631117224635 ;3 correct 1841236454324589 ;3 correct 2659862637316867 ;2 correct
+$$\begin{align}   & 5616185650518293 ;2\\;\text{correct}\\\\
+  & 3847439647293047 ;1\\;\text{correct}\\\\   & 5855462940810587 ;3\\;\text{correct}\\\\
+  & 9742855507068353 ;3\\;\text{correct}\\\\   & 4296849643607543 ;3\\;\text{correct}\\\\
+  & 3174248439465858 ;1\\;\text{correct}\\\\   & 4513559094146117 ;2\\;\text{correct}\\\\
+  & 7890971548908067 ;3\\;\text{correct}\\\\   & 8157356344118483 ;1\\;\text{correct}\\\\
+  & 2615250744386899 ;2\\;\text{correct}\\\\   & 8690095851526254 ;3\\;\text{correct}\\\\
+  & 6375711915077050 ;1\\;\text{correct}\\\\   & 6913859173121360 ;1\\;\text{correct}\\\\
+  & 6442889055042768 ;2\\;\text{correct}\\\\   & 2321386104303845 ;0\\;\text{correct}\\\\
+  & 2326509471271448 ;2\\;\text{correct}\\\\   & 5251583379644322 ;2\\;\text{correct}\\\\
+  & 1748270476758276 ;3\\;\text{correct}\\\\   & 4895722652190306 ;1\\;\text{correct}\\\\
+  & 3041631117224635 ;3\\;\text{correct}\\\\   & 1841236454324589 ;3\\;\text{correct}\\\\
+  & 2659862637316867 ;2\\;\text{correct} \end{align}$$
 
 Find the unique 16-digit secret sequence.
 
 # --hints--
 
-`euler185()` should return 4640261571849533.
+`numberMind()` should return `4640261571849533`.
 
 ```js
-assert.strictEqual(euler185(), 4640261571849533);
+assert.strictEqual(numberMind(), 4640261571849533);
 ```
 
 # --seed--
@@ -33,12 +51,12 @@ assert.strictEqual(euler185(), 4640261571849533);
 ## --seed-contents--
 
 ```js
-function euler185() {
+function numberMind() {
 
   return true;
 }
 
-euler185();
+numberMind();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md
index 119501f8331..8d1fed78cdf 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4281000cf542c50ff39
 title: 'Problem 186: Connectedness of a network'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301822
 dashedName: problem-186-connectedness-of-a-network
 ---
@@ -10,22 +10,31 @@ dashedName: problem-186-connectedness-of-a-network
 
 Here are the records from a busy telephone system with one million users:
 
-RecNrCallerCalled120000710005326001835004393600863701497......... The telephone number of the caller and the called number in record n are Caller(n) = S2n-1 and Called(n) = S2n where S1,2,3,... come from the "Lagged Fibonacci Generator":
+| RecNr | Caller | Called |
+| ----- | ------ | ------ |
+| 1     | 200007 | 100053 |
+| 2     | 600183 | 500439 |
+| 3     | 600863 | 701497 |
+| ...   | ...    | ...    |
 
-For 1 ≤ k ≤ 55, Sk = \[100003 - 200003k + 300007k3] (modulo 1000000) For 56 ≤ k, Sk = \[Sk-24 + Sk-55] (modulo 1000000)
+The telephone number of the caller and the called number in record $n$ are $Caller(n) = S_{2n - 1}$ and $Called(n) = S_{2n}$ where ${S}_{1,2,3,\ldots}$ come from the "Lagged Fibonacci Generator":
 
-If Caller(n) = Called(n) then the user is assumed to have misdialled and the call fails; otherwise the call is successful.
+For $1 ≤ k ≤ 55$, $S_k = [100003 - 200003k + 300007{k}^3]\\;(\text{modulo}\\;1000000)$
 
-From the start of the records, we say that any pair of users X and Y are friends if X calls Y or vice-versa. Similarly, X is a friend of a friend of Z if X is a friend of Y and Y is a friend of Z; and so on for longer chains.
+For $56 ≤ k$, $S_k = [S_{k - 24} + S_{k - 55}]\\;(\text{modulo}\\;1000000)$
+
+If $Caller(n) = Called(n)$ then the user is assumed to have misdialled and the call fails; otherwise the call is successful.
+
+From the start of the records, we say that any pair of users $X$ and $Y$ are friends if $X$ calls $Y$ or vice-versa. Similarly, $X$ is a friend of a friend of $Z$ if $X$ is a friend of $Y$ and $Y$ is a friend of $Z$; and so on for longer chains.
 
 The Prime Minister's phone number is 524287. After how many successful calls, not counting misdials, will 99% of the users (including the PM) be a friend, or a friend of a friend etc., of the Prime Minister?
 
 # --hints--
 
-`euler186()` should return 2325629.
+`connectednessOfANetwork()` should return `2325629`.
 
 ```js
-assert.strictEqual(euler186(), 2325629);
+assert.strictEqual(connectednessOfANetwork(), 2325629);
 ```
 
 # --seed--
@@ -33,12 +42,12 @@ assert.strictEqual(euler186(), 2325629);
 ## --seed-contents--
 
 ```js
-function euler186() {
+function connectednessOfANetwork() {
 
   return true;
 }
 
-euler186();
+connectednessOfANetwork();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-187-semiprimes.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-187-semiprimes.md
index 043684a9d76..bcd6f324753 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-187-semiprimes.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-187-semiprimes.md
@@ -1,22 +1,22 @@
 ---
 id: 5900f4291000cf542c50ff3a
 title: 'Problem 187: Semiprimes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301823
 dashedName: problem-187-semiprimes
 ---
 
 # --description--
 
-A composite is a number containing at least two prime factors. For example, 15 = 3 × 5; 9 = 3 × 3; 12 = 2 × 2 × 3.
+A composite is a number containing at least two prime factors. For example, $15 = 3 × 5; 9 = 3 × 3; 12 = 2 × 2 × 3$.
 
 There are ten composites below thirty containing precisely two, not necessarily distinct, prime factors: 4, 6, 9, 10, 14, 15, 21, 22, 25, 26.
 
-How many composite integers, n &lt; 108, have precisely two, not necessarily distinct, prime factors?
+How many composite integers, $n &lt; {10}^8$, have precisely two, not necessarily distinct, prime factors?
 
 # --hints--
 
-`euler187()` should return 17427258.
+`semiPrimes()` should return `17427258`.
 
 ```js
 assert.strictEqual(euler187(), 17427258);
@@ -27,12 +27,12 @@ assert.strictEqual(euler187(), 17427258);
 ## --seed-contents--
 
 ```js
-function euler187() {
+function semiPrimes() {
 
   return true;
 }
 
-euler187();
+semiPrimes();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.md
index 8c24a2f8e95..1e0ae1dc9fa 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4291000cf542c50ff3b
 title: 'Problem 188: The hyperexponentiation of a number'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301824
 dashedName: problem-188-the-hyperexponentiation-of-a-number
 ---
 
 # --description--
 
-The hyperexponentiation or tetration of a number a by a positive integer b, denoted by a↑↑b or ba, is recursively defined by:
+The hyperexponentiation or tetration of a number $a$ by a positive integer $b$, denoted by $a↑↑b$ or ${}^ba$, is recursively defined by:
 
-a↑↑1 = a,
+$a↑↑1 = a$,
 
-a↑↑(k+1) = a(a↑↑k).
+$a↑↑(k+1) = a^{(a↑↑k)}$.
 
-Thus we have e.g. 3↑↑2 = 33 = 27, hence 3↑↑3 = 327 = 7625597484987 and 3↑↑4 is roughly 103.6383346400240996\*10^12. Find the last 8 digits of 1777↑↑1855.
+Thus we have e.g. $3↑↑2 = 3^3 = 27$, hence $3↑↑3 = 3^{27} = 7625597484987$ and $3↑↑4$ is roughly ${10}^{3.6383346400240996 \times {10}^{12}}$. Find the last 8 digits of $1777↑↑1855$.
 
 # --hints--
 
-`euler188()` should return 95962097.
+`hyperexponentation()` should return `95962097`.
 
 ```js
-assert.strictEqual(euler188(), 95962097);
+assert.strictEqual(hyperexponentation(), 95962097);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler188(), 95962097);
 ## --seed-contents--
 
 ```js
-function euler188() {
+function hyperexponentation() {
 
   return true;
 }
 
-euler188();
+hyperexponentation();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md
index 4153d584425..6ac8cedcec5 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4291000cf542c50ff3c
 title: 'Problem 189: Tri-colouring a triangular grid'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301825
 dashedName: problem-189-tri-colouring-a-triangular-grid
 ---
@@ -10,20 +10,24 @@ dashedName: problem-189-tri-colouring-a-triangular-grid
 
 Consider the following configuration of 64 triangles:
 
+<img class="img-responsive center-block" alt="64 triangles arranged to create larger triangle with side length of 8 triangles" src="https://cdn.freecodecamp.org/curriculum/project-euler/tri-colouring-a-triangular-grid-1.gif" style="background-color: white; padding: 10px;" />
+
 We wish to colour the interior of each triangle with one of three colours: red, green or blue, so that no two neighbouring triangles have the same colour. Such a colouring shall be called valid. Here, two triangles are said to be neighbouring if they share an edge. Note: if they only share a vertex, then they are not neighbours.
 
 For example, here is a valid colouring of the above grid:
 
+<img class="img-responsive center-block" alt="colored grid of 64 triangles" src="https://cdn.freecodecamp.org/curriculum/project-euler/tri-colouring-a-triangular-grid-2.gif" style="background-color: white; padding: 10px;" />
+
 A colouring C' which is obtained from a colouring C by rotation or reflection is considered distinct from C unless the two are identical.
 
 How many distinct valid colourings are there for the above configuration?
 
 # --hints--
 
-`euler189()` should return 10834893628237824.
+`triangularGridColoring()` should return `10834893628237824`.
 
 ```js
-assert.strictEqual(euler189(), 10834893628237824);
+assert.strictEqual(triangularGridColoring(), 10834893628237824);
 ```
 
 # --seed--
@@ -31,12 +35,12 @@ assert.strictEqual(euler189(), 10834893628237824);
 ## --seed-contents--
 
 ```js
-function euler189() {
+function triangularGridColoring() {
 
   return true;
 }
 
-euler189();
+triangularGridColoring();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-19-counting-sundays.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-19-counting-sundays.md
index c12d6d1c6b8..5a3e24cc431 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-19-counting-sundays.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-19-counting-sundays.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f37f1000cf542c50fe92
 title: 'Problem 19: Counting Sundays'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301827
 dashedName: problem-19-counting-sundays
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.md
index 143247df800..806332925e0 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f42b1000cf542c50ff3d
 title: 'Problem 190: Maximising a weighted product'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301828
 dashedName: problem-190-maximising-a-weighted-product
 ---
 
 # --description--
 
-Let Sm = (x1, x2, ... , xm) be the m-tuple of positive real numbers with x1 + x2 + ... + xm = m for which Pm = x1 \* x22 \* ... \* xmm is maximised.
+Let $S_m = (x_1, x_2, \ldots, x_m)$ be the $m$-tuple of positive real numbers with $x_1 + x_2 + \cdots + x_m = m$ for which $P_m = x_1 \times {x_2}^2 \times \cdots \times {x_m}^m$ is maximised.
 
-For example, it can be verified that \[P10] = 4112 (\[ ] is the integer part function).
+For example, it can be verified that $[P_{10}] = 4112$ ([ ] is the integer part function).
 
-Find Σ\[Pm] for 2 ≤ m ≤ 15.
+Find $\sum {[P_m]}$ for $2 ≤ m ≤ 15$.
 
 # --hints--
 
-`euler190()` should return 371048281.
+`maximisingWeightedProduct()` should return `371048281`.
 
 ```js
-assert.strictEqual(euler190(), 371048281);
+assert.strictEqual(maximisingWeightedProduct(), 371048281);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler190(), 371048281);
 ## --seed-contents--
 
 ```js
-function euler190() {
+function maximisingWeightedProduct() {
 
   return true;
 }
 
-euler190();
+maximisingWeightedProduct();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-191-prize-strings.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-191-prize-strings.md
index bd93cdca4c2..8e4e35e5736 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-191-prize-strings.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-191-prize-strings.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f42b1000cf542c50ff3e
 title: 'Problem 191: Prize Strings'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301829
 dashedName: problem-191-prize-strings
 ---
@@ -14,16 +14,22 @@ During an n-day period a trinary string is formed for each child consisting of L
 
 Although there are eighty-one trinary strings for a 4-day period that can be formed, exactly forty-three strings would lead to a prize:
 
-OOOO OOOA OOOL OOAO OOAA OOAL OOLO OOLA OAOO OAOA OAOL OAAO OAAL OALO OALA OLOO OLOA OLAO OLAA AOOO AOOA AOOL AOAO AOAA AOAL AOLO AOLA AAOO AAOA AAOL AALO AALA ALOO ALOA ALAO ALAA LOOO LOOA LOAO LOAA LAOO LAOA LAAO
+```markup
+OOOO OOOA OOOL OOAO OOAA OOAL OOLO OOLA OAOO OAOA
+OAOL OAAO OAAL OALO OALA OLOO OLOA OLAO OLAA AOOO
+AOOA AOOL AOAO AOAA AOAL AOLO AOLA AAOO AAOA AAOL
+AALO AALA ALOO ALOA ALAO ALAA LOOO LOOA LOAO LOAA
+LAOO LAOA LAAO
+```
 
 How many "prize" strings exist over a 30-day period?
 
 # --hints--
 
-`euler191()` should return 1918080160.
+`prizeStrings()` should return `1918080160`.
 
 ```js
-assert.strictEqual(euler191(), 1918080160);
+assert.strictEqual(prizeStrings(), 1918080160);
 ```
 
 # --seed--
@@ -31,12 +37,12 @@ assert.strictEqual(euler191(), 1918080160);
 ## --seed-contents--
 
 ```js
-function euler191() {
+function prizeStrings() {
 
   return true;
 }
 
-euler191();
+prizeStrings();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-192-best-approximations.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-192-best-approximations.md
index 6751cbffaf9..61889d4d47b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-192-best-approximations.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-192-best-approximations.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f42c1000cf542c50ff3f
 title: 'Problem 192: Best Approximations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301830
 dashedName: problem-192-best-approximations
 ---
 
 # --description--
 
-Let x be a real number.
+Let $x$ be a real number.
 
-A best approximation to x for the denominator bound d is a rational number r/s in reduced form, with s ≤ d, such that any rational number which is closer to x than r/s has a denominator larger than d:
+A best approximation to $x$ for the denominator bound $d$ is a rational number $\frac{r}{s}$ in reduced form, with $s ≤ d$, such that any rational number which is closer to $x$ than $\frac{r}{s}$ has a denominator larger than $d$:
 
-|p/q-x| &lt; |r/s-x| ⇒ q > d
+$$|\frac{p}{q} - x| &lt; |\frac{r}{s} - x| ⇒ q > d$$
 
-For example, the best approximation to √13 for the denominator bound 20 is 18/5 and the best approximation to √13 for the denominator bound 30 is 101/28.
+For example, the best approximation to $\sqrt{13}$ for the denominator bound $20$ is $\frac{18}{5}$ and the best approximation to $\sqrt{13}$ for the denominator bound $30$ is $\frac{101}{28}$.
 
-Find the sum of all denominators of the best approximations to √n for the denominator bound 1012, where n is not a perfect square and 1 &lt; n ≤ 100000.
+Find the sum of all denominators of the best approximations to $\sqrt{n}$ for the denominator bound ${10}^{12}$, where $n$ is not a perfect square and $1 &lt; n ≤ 100000$.
 
 # --hints--
 
-`euler192()` should return 57060635927998344.
+`bestApproximations()` should return `57060635927998344`.
 
 ```js
-assert.strictEqual(euler192(), 57060635927998344);
+assert.strictEqual(bestApproximations(), 57060635927998344);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler192(), 57060635927998344);
 ## --seed-contents--
 
 ```js
-function euler192() {
+function bestApproximations() {
 
   return true;
 }
 
-euler192();
+bestApproximations();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-193-squarefree-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-193-squarefree-numbers.md
index 1b9cc8d4900..7e17fd27c15 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-193-squarefree-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-193-squarefree-numbers.md
@@ -1,23 +1,23 @@
 ---
 id: 5900f42f1000cf542c50ff41
 title: 'Problem 193: Squarefree Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301831
 dashedName: problem-193-squarefree-numbers
 ---
 
 # --description--
 
-A positive integer n is called squarefree, if no square of a prime divides n, thus 1, 2, 3, 5, 6, 7, 10, 11 are squarefree, but not 4, 8, 9, 12.
+A positive integer $n$ is called squarefree, if no square of a prime divides $n$, thus 1, 2, 3, 5, 6, 7, 10, 11 are squarefree, but not 4, 8, 9, 12.
 
-How many squarefree numbers are there below 250?
+How many squarefree numbers are there below $2^{50}$?
 
 # --hints--
 
-`euler193()` should return 684465067343069.
+`squarefreeNumbers()` should return `684465067343069`.
 
 ```js
-assert.strictEqual(euler193(), 684465067343069);
+assert.strictEqual(squarefreeNumbers(), 684465067343069);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler193(), 684465067343069);
 ## --seed-contents--
 
 ```js
-function euler193() {
+function squarefreeNumbers() {
 
   return true;
 }
 
-euler193();
+squarefreeNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-194-coloured-configurations.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-194-coloured-configurations.md
index 947d65c7878..4d5b05af3d9 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-194-coloured-configurations.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-194-coloured-configurations.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f42f1000cf542c50ff40
 title: 'Problem 194: Coloured Configurations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301832
 dashedName: problem-194-coloured-configurations
 ---
@@ -9,23 +9,21 @@ dashedName: problem-194-coloured-configurations
 # --description--
 
 Consider graphs built with the units A:
+<img class="img-responsive" alt="graph unit A" src="https://cdn.freecodecamp.org/curriculum/project-euler/coloured-configurations-1.png" style="display: inline-block; background-color: white; padding: 10px;" />
+ and B: <img class="img-responsive" alt="graph unit B" src="https://cdn.freecodecamp.org/curriculum/project-euler/coloured-configurations-2.png" style="display: inline-block; background-color: white; padding: 10px;" />, where the units are glued along the vertical edges as in the graph <img class="img-responsive" alt="graph with four units glued along the vertical edges" src="https://cdn.freecodecamp.org/curriculum/project-euler/coloured-configurations-3.png" style="display: inline-block; background-color: white; padding: 10px;" />.
 
-and B: , where the units are glued along
+A configuration of type $(a,b,c)$ is a graph thus built of $a$ units A and $b$ units B, where the graph's vertices are coloured using up to $c$ colours, so that no two adjacent vertices have the same colour. The compound graph above is an example of a configuration of type $(2,2,6)$, in fact of type $(2,2,c)$ for all $c ≥ 4$
 
-the vertical edges as in the graph .
+Let $N(a,b,c)$ be the number of configurations of type $(a,b,c)$. For example, $N(1,0,3) = 24$, $N(0,2,4) = 92928$ and $N(2,2,3) = 20736$.
 
-A configuration of type (a,b,c) is a graph thus built of a units A and b units B, where the graph's vertices are coloured using up to c colours, so that no two adjacent vertices have the same colour. The compound graph above is an example of a configuration of type (2,2,6), in fact of type (2,2,c) for all c ≥ 4.
-
-Let N(a,b,c) be the number of configurations of type (a,b,c). For example, N(1,0,3) = 24, N(0,2,4) = 92928 and N(2,2,3) = 20736.
-
-Find the last 8 digits of N(25,75,1984).
+Find the last 8 digits of $N(25,75,1984)$.
 
 # --hints--
 
-`euler194()` should return 61190912.
+`coloredConfigurations()` should return `61190912`.
 
 ```js
-assert.strictEqual(euler194(), 61190912);
+assert.strictEqual(coloredConfigurations(), 61190912);
 ```
 
 # --seed--
@@ -33,12 +31,12 @@ assert.strictEqual(euler194(), 61190912);
 ## --seed-contents--
 
 ```js
-function euler194() {
+function coloredConfigurations() {
 
   return true;
 }
 
-euler194();
+coloredConfigurations();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md
index cd52202435f..18c2acd7592 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md
@@ -1,31 +1,29 @@
 ---
 id: 5900f4311000cf542c50ff43
 title: 'Problem 195: Inscribed circles of triangles with one angle of 60 degrees'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301833
 dashedName: problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees
 ---
 
 # --description--
 
-Let's call an integer sided triangle with exactly one angle of 60 degrees a 60-degree triangle.
+Let's call an integer sided triangle with exactly one angle of 60° a 60° triangle.
 
-Let r be the radius of the inscribed circle of such a 60-degree triangle.
+Let $r$ be the radius of the inscribed circle of such a 60° triangle.
 
-There are 1234 60-degree triangles for which r ≤ 100.
+There are 1234 60° triangles for which $r ≤ 100$.
 
-Let T(n) be the number of 60-degree triangles for which r ≤ n, so
+Let $T(n)$ be the number of 60° triangles for which $r ≤ n$, so $T(100) = 1234$, $T(1000) = 22767$, and $T(10000) = 359912$.
 
-T(100) = 1234, T(1000) = 22767, and T(10000) = 359912.
-
-Find T(1053779).
+Find $T(1053779)$.
 
 # --hints--
 
-`euler195()` should return 75085391.
+`inscribedCirclesOfTriangles()` should return `75085391`.
 
 ```js
-assert.strictEqual(euler195(), 75085391);
+assert.strictEqual(inscribedCirclesOfTriangles(), 75085391);
 ```
 
 # --seed--
@@ -33,12 +31,12 @@ assert.strictEqual(euler195(), 75085391);
 ## --seed-contents--
 
 ```js
-function euler195() {
+function inscribedCirclesOfTriangles() {
 
   return true;
 }
 
-euler195();
+inscribedCirclesOfTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-196-prime-triplets.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-196-prime-triplets.md
index 4ead4631ddc..d072c7689a1 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-196-prime-triplets.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-196-prime-triplets.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4301000cf542c50ff42
 title: 'Problem 196: Prime triplets'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301834
 dashedName: problem-196-prime-triplets
 ---
@@ -10,7 +10,13 @@ dashedName: problem-196-prime-triplets
 
 Build a triangle from all positive integers in the following way:
 
-1 2 3 4 5 6 7 8 9 1011 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 2829 30 31 32 33 34 35 3637 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 . . .
+$$\begin{array}{rrr}   &  1 \\\\
+  &  \color{red}{2} &  \color{red}{3} \\\\   &  4 & \color{red}{5} &  6 \\\\
+  &  \color{red}{7} &  8 &  9 & 10 \\\\   & \color{red}{11} & 12 & \color{red}{13} & 14 & 15  \\\\
+  & 16 & \color{red}{17} & 18 & \color{red}{19} & 20 & 21 \\\\   & 22 & \color{red}{23} & 24 & 25 & 26 & 27 & 28 \\\\
+  & \color{red}{29} & 30 & \color{red}{31} & 32 & 33 & 34 & 35 & 36 \\\\   & \color{red}{37} & 38 & 39 & 40 & \color{red}{41} & 42 & \color{red}{43} & 44 & 45 \\\\
+  & 46 & \color{red}{47} & 48 & 49 & 50 & 51 & 52 & \color{red}{53} & 54 & 55 \\\\   & 56 & 57 & 58 & \color{red}{59} & 60 & \color{red}{61} & 62 & 63 & 64 & 65 & 66 \\\\
+  & \cdots \end{array}$$
 
 Each positive integer has up to eight neighbours in the triangle.
 
@@ -20,18 +26,18 @@ For example, in the second row, the prime numbers 2 and 3 are elements of some p
 
 If row 8 is considered, it contains two primes which are elements of some prime triplet, i.e. 29 and 31. If row 9 is considered, it contains only one prime which is an element of some prime triplet: 37.
 
-Define S(n) as the sum of the primes in row n which are elements of any prime triplet. Then S(8)=60 and S(9)=37.
+Define $S(n)$ as the sum of the primes in row $n$ which are elements of any prime triplet. Then $S(8) = 60$ and $S(9) = 37$.
 
-You are given that S(10000)=950007619.
+You are given that $S(10000) = 950007619$.
 
-Find S(5678027) + S(7208785).
+Find $S(5678027) + S(7208785)$.
 
 # --hints--
 
-`euler196()` should return 322303240771079940.
+`primeTriplets()` should return `322303240771079940`.
 
 ```js
-assert.strictEqual(euler196(), 322303240771079940);
+assert.strictEqual(primeTriplets(), 322303240771079940);
 ```
 
 # --seed--
@@ -39,12 +45,12 @@ assert.strictEqual(euler196(), 322303240771079940);
 ## --seed-contents--
 
 ```js
-function euler196() {
+function primeTriplets() {
 
   return true;
 }
 
-euler196();
+primeTriplets();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md
index 1e2f3fe30d6..04a43b0d889 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md
@@ -1,25 +1,23 @@
 ---
 id: 5900f4311000cf542c50ff44
-title: 'Problem 197: Investigating the behaviour of a recursively defined sequence'
-challengeType: 5
+title: '問題 197：研究遞歸定義的序列的行爲'
+challengeType: 1
 forumTopicId: 301835
 dashedName: problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence
 ---
 
 # --description--
 
-Given is the function f(x) = ⌊230.403243784-x2⌋ × 10-9 ( ⌊ ⌋ is the floor-function),
+Given is the function $f(x) = ⌊{2}^{30.403243784 - x^2}⌋ × {10}^{-9}$ ( ⌊ ⌋ is the floor-function), the sequence $u_n$ is defined by $u_0 = -1$ and $u_{n + 1} = f(u_n)$.
 
-the sequence un is defined by u0 = -1 and un+1 = f(un).
-
-Find un + un+1 for n = 1012. Give your answer with 9 digits after the decimal point.
+Find $u_n + u_{n + 1}$ for $n = {10}^{12}$. Give your answer with 9 digits after the decimal point.
 
 # --hints--
 
-`euler197()` should return 1.710637717.
+`recursivelyDefinedSequence()` should return `1.710637717`.
 
 ```js
-assert.strictEqual(euler197(), 1.710637717);
+assert.strictEqual(recursivelyDefinedSequence(), 1.710637717);
 ```
 
 # --seed--
@@ -27,12 +25,12 @@ assert.strictEqual(euler197(), 1.710637717);
 ## --seed-contents--
 
 ```js
-function euler197() {
+function recursivelyDefinedSequence() {
 
   return true;
 }
 
-euler197();
+recursivelyDefinedSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md
index a955aa7c37e..4ca79addc2a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4331000cf542c50ff45
-title: 'Problem 198: Ambiguous Numbers'
-challengeType: 5
+title: '問題 198：模糊數字'
+challengeType: 1
 forumTopicId: 301836
 dashedName: problem-198-ambiguous-numbers
 ---
 
 # --description--
 
-A best approximation to a real number x for the denominator bound d is a rational number r/s (in reduced form) with s ≤ d, so that any rational number p/q which is closer to x than r/s has q > d.
+A best approximation to a real number $x$ for the denominator bound $d$ is a rational number $\frac{r}{s}$ (in reduced form) with $s ≤ d$, so that any rational number $\frac{p}{q}$ which is closer to $x$ than $\frac{r}{s}$ has $q > d$.
 
-Usually the best approximation to a real number is uniquely determined for all denominator bounds. However, there are some exceptions, e.g. 9/40 has the two best approximations 1/4 and 1/5 for the denominator bound 6. We shall call a real number x ambiguous, if there is at least one denominator bound for which x possesses two best approximations. Clearly, an ambiguous number is necessarily rational.
+Usually the best approximation to a real number is uniquely determined for all denominator bounds. However, there are some exceptions, e.g. $\frac{9}{40}$ has the two best approximations $\frac{1}{4}$ and $\frac{1}{5}$ for the denominator bound $6$. We shall call a real number $x$ ambiguous, if there is at least one denominator bound for which $x$ possesses two best approximations. Clearly, an ambiguous number is necessarily rational.
 
-How many ambiguous numbers x = p/q, 0 &lt; x &lt; 1/100, are there whose denominator q does not exceed 108?
+How many ambiguous numbers $x = \frac{p}{q}$, $0 &lt; x &lt; \frac{1}{100}$, are there whose denominator $q$ does not exceed ${10}^8$?
 
 # --hints--
 
-`euler198()` should return 52374425.
+`ambiguousNumbers()` should return `52374425`.
 
 ```js
-assert.strictEqual(euler198(), 52374425);
+assert.strictEqual(ambiguousNumbers(), 52374425);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler198(), 52374425);
 ## --seed-contents--
 
 ```js
-function euler198() {
+function ambiguousNumbers() {
 
   return true;
 }
 
-euler198();
+ambiguousNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md
index 0194bbb44d1..5c699d70320 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4341000cf542c50ff46
 title: 'Problem 199: Iterative Circle Packing'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301837
 dashedName: problem-199-iterative-circle-packing
 ---
@@ -10,7 +10,7 @@ dashedName: problem-199-iterative-circle-packing
 
 Three circles of equal radius are placed inside a larger circle such that each pair of circles is tangent to one another and the inner circles do not overlap. There are four uncovered "gaps" which are to be filled iteratively with more tangent circles.
 
-<img class="img-responsive center-block" alt="a diagram of non-overlapping concentric circles" src="https://cdn-media-1.freecodecamp.org/project-euler/199-circles-in-circles.gif" style="background-color: white; padding: 10px;" />
+<img class="img-responsive center-block" alt="a diagram of non-overlapping circles" src="https://cdn-media-1.freecodecamp.org/project-euler/199-circles-in-circles.gif" style="background-color: white; padding: 10px;" />
 
 At each iteration, a maximally sized circle is placed in each gap, which creates more gaps for the next iteration. After 3 iterations (pictured), there are 108 gaps and the fraction of the area which is not covered by circles is 0.06790342, rounded to eight decimal places.
 
@@ -24,13 +24,13 @@ What fraction of the area is not covered by circles after `n` iterations? Give y
 assert(typeof iterativeCirclePacking(10) === 'number');
 ```
 
-`iterativeCirclePacking(10)` should return 0.00396087.
+`iterativeCirclePacking(10)` should return `0.00396087`.
 
 ```js
 assert.strictEqual(iterativeCirclePacking(10), 0.00396087);
 ```
 
-`iterativeCirclePacking(3)` should return 0.06790342.
+`iterativeCirclePacking(3)` should return `0.06790342`.
 
 ```js
 assert.strictEqual(iterativeCirclePacking(3), 0.06790342);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md
index ecf2a8aa73a..5552da767b0 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md
@@ -1,70 +1,70 @@
 ---
 id: 5900f36e1000cf542c50fe81
 title: 'Problem 2: Even Fibonacci Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301838
 dashedName: problem-2-even-fibonacci-numbers
 ---
 
 # --description--
 
-Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:
+Each new term in the Fibonacci sequence is generated by adding the previous two terms. 從 1 和 2 開始，前 10 項將是：
 
 <div style='text-align: center;'>1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...</div>
 
-By considering the terms in the Fibonacci sequence whose values do not exceed `n`, find the sum of the even-valued terms.
+通過考慮 Fibonacci 數列中值不超過 `n` 的項，找到偶數值項的總和。
 
 # --hints--
 
-`fiboEvenSum(10)` should return a number.
+`fiboEvenSum(10)` 應該返回數字類型的數據。
 
 ```js
 assert(typeof fiboEvenSum(10) === 'number');
 ```
 
-Your function should return an `even` value.
+Your function should return an even value.
 
 ```js
 assert.equal(fiboEvenSum(10) % 2 === 0, true);
 ```
 
-Your function should sum the even-valued Fibonacci numbers: `fiboEvenSum(8)` should return 10.
+您的函數應該把偶數值的 Fibonacci 數字相加： `fiboEvenSum(8)` 應該返回 10。
 
 ```js
 assert.strictEqual(fiboEvenSum(8), 10);
 ```
 
-`fiboEvenSum(10)` should return 10.
+`fiboEvenSum(10)` 應該返回 10。
 
 ```js
 assert.strictEqual(fiboEvenSum(10), 10);
 ```
 
-`fiboEvenSum(34)` should return 44.
+`fiboEvenSum(34)` 應返回 44。
 
 ```js
 assert.strictEqual(fiboEvenSum(34), 44);
 ```
 
-`fiboEvenSum(60)` should return 44.
+`fiboEvenSum(60)` 應該返回 44。
 
 ```js
 assert.strictEqual(fiboEvenSum(60), 44);
 ```
 
-`fiboEvenSum(1000)` should return 798.
+`fiboEvenSum(1000)` 應該返回 798。
 
 ```js
 assert.strictEqual(fiboEvenSum(1000), 798);
 ```
 
-`fiboEvenSum(100000)` should return 60696.
+`fiboEvenSum(100000)` 應該返回 60696。
 
 ```js
 assert.strictEqual(fiboEvenSum(100000), 60696);
 ```
 
-`fiboEvenSum(4000000)` should return 4613732.
+`fiboEvenSum(4000000)` 應該返回 4613732。
 
 ```js
 assert.strictEqual(fiboEvenSum(4000000), 4613732);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-20-factorial-digit-sum.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-20-factorial-digit-sum.md
index 579ac97f6f9..a109ff5f9b2 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-20-factorial-digit-sum.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-20-factorial-digit-sum.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3801000cf542c50fe93
 title: 'Problem 20: Factorial digit sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301839
 dashedName: problem-20-factorial-digit-sum
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md
index c6458059ce1..cf83bbea1df 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md
@@ -2,7 +2,7 @@
 id: 5900f4351000cf542c50ff47
 title: >-
   Problem 200: Find the 200th prime-proof sqube containing the contiguous sub-string "200"
-challengeType: 5
+challengeType: 1
 forumTopicId: 301840
 dashedName: >-
   problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200
@@ -10,22 +10,22 @@ dashedName: >-
 
 # --description--
 
-We shall define a sqube to be a number of the form, p2q3, where p and q are distinct primes.
+We shall define a sqube to be a number of the form, ${p^2}{q^3}$, where $p$ and $q$ are distinct primes.
 
-For example, 200 = 5223 or 120072949 = 232613.
+For example, $200 = {5^2}{2^3}$ or $120072949 = {{23}^2}{{61}^3}$.
 
 The first five squbes are 72, 108, 200, 392, and 500.
 
-Interestingly, 200 is also the first number for which you cannot change any single digit to make a prime; we shall call such numbers, prime-proof. The next prime-proof sqube which contains the contiguous sub-string "200" is 1992008.
+有趣的是，200 也是第一個不能改變任何一位數來構成素數的數字；我們將稱這些數字爲素數證明。 The next prime-proof sqube which contains the contiguous sub-string `200` is 1992008.
 
-Find the 200th prime-proof sqube containing the contiguous sub-string "200".
+Find the 200th prime-proof sqube containing the contiguous sub-string `200`.
 
 # --hints--
 
-`euler200()` should return 229161792008.
+`primeProofSqubeWithSubString()` should return `229161792008`.
 
 ```js
-assert.strictEqual(euler200(), 229161792008);
+assert.strictEqual(primeProofSqubeWithSubString(), 229161792008);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler200(), 229161792008);
 ## --seed-contents--
 
 ```js
-function euler200() {
+function primeProofSqubeWithSubString() {
 
   return true;
 }
 
-euler200();
+primeProofSqubeWithSubString();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md
index 045fd9b2b8b..e0513d008ec 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md
@@ -1,31 +1,41 @@
 ---
 id: 5900f4361000cf542c50ff48
 title: 'Problem 201: Subsets with a unique sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301841
 dashedName: problem-201-subsets-with-a-unique-sum
 ---
 
 # --description--
 
-For any set A of numbers, let sum(A) be the sum of the elements of A.
+For any set $A$ of numbers, let $sum(A)$ be the sum of the elements of $A$.
 
-Consider the set B = {1,3,6,8,10,11}. There are 20 subsets of B containing three elements, and their sums are:
+Consider the set $B = \\{1,3,6,8,10,11\\}$. There are 20 subsets of $B$ containing three elements, and their sums are:
 
-sum({1,3,6}) = 10, sum({1,3,8}) = 12, sum({1,3,10}) = 14, sum({1,3,11}) = 15, sum({1,6,8}) = 15, sum({1,6,10}) = 17, sum({1,6,11}) = 18, sum({1,8,10}) = 19, sum({1,8,11}) = 20, sum({1,10,11}) = 22, sum({3,6,8}) = 17, sum({3,6,10}) = 19, sum({3,6,11}) = 20, sum({3,8,10}) = 21, sum({3,8,11}) = 22, sum({3,10,11}) = 24, sum({6,8,10}) = 24, sum({6,8,11}) = 25, sum({6,10,11}) = 27, sum({8,10,11}) = 29.
+$$\begin{align}   & sum(\\{1,3,6\\}) = 10 \\\\
+  & sum(\\{1,3,8\\}) = 12 \\\\   & sum(\\{1,3,10\\}) = 14 \\\\
+  & sum(\\{1,3,11\\}) = 15 \\\\   & sum(\\{1,6,8\\}) = 15 \\\\
+  & sum(\\{1,6,10\\}) = 17 \\\\   & sum(\\{1,6,11\\}) = 18 \\\\
+  & sum(\\{1,8,10\\}) = 19 \\\\   & sum(\\{1,8,11\\}) = 20 \\\\
+  & sum(\\{1,10,11\\}) = 22 \\\\   & sum(\\{3,6,8\\}) = 17 \\\\
+  & sum(\\{3,6,10\\}) = 19 \\\\   & sum(\\{3,6,11\\}) = 20 \\\\
+  & sum(\\{3,8,10\\}) = 21 \\\\   & sum(\\{3,8,11\\}) = 22 \\\\
+  & sum(\\{3,10,11\\}) = 24 \\\\   & sum(\\{6,8,10\\}) = 24 \\\\
+  & sum(\\{6,8,11\\}) = 25 \\\\   & sum(\\{6,10,11\\}) = 27 \\\\
+  & sum(\\{8,10,11\\}) = 29 \\end{align}$$
 
-Some of these sums occur more than once, others are unique. For a set A, let U(A,k) be the set of unique sums of k-element subsets of A, in our example we find U(B,3) = {10,12,14,18,21,25,27,29} and sum(U(B,3)) = 156.
+Some of these sums occur more than once, others are unique. For a set $A$, let $U(A,k)$ be the set of unique sums of $k$-element subsets of $A$, in our example we find $U(B,3) = \\{10,12,14,18,21,25,27,29\\}$ and $sum(U(B,3)) = 156$.
 
-Now consider the 100-element set S = {12, 22, ... , 1002}. S has 100891344545564193334812497256 50-element subsets.
+Now consider the $100$-element set $S = \\{1^2, 2^2, \ldots , {100}^2\\}$. $S$ has $100\\,891\\,344\\,545\\,564\\,193\\,334\\,812\\,497\\,256\\;$ $50$-element subsets.
 
-Determine the sum of all integers which are the sum of exactly one of the 50-element subsets of S, i.e. find sum(U(S,50)).
+Determine the sum of all integers which are the sum of exactly one of the $50$-element subsets of $S$, i.e. find $sum(U(S,50))$.
 
 # --hints--
 
-`euler201()` should return 115039000.
+`uniqueSubsetsSum()` should return `115039000`.
 
 ```js
-assert.strictEqual(euler201(), 115039000);
+assert.strictEqual(uniqueSubsetsSum(), 115039000);
 ```
 
 # --seed--
@@ -33,12 +43,12 @@ assert.strictEqual(euler201(), 115039000);
 ## --seed-contents--
 
 ```js
-function euler201() {
+function uniqueSubsetsSum() {
 
   return true;
 }
 
-euler201();
+uniqueSubsetsSum();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-202-laserbeam.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-202-laserbeam.md
index c42f68e4147..2090a152b22 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-202-laserbeam.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-202-laserbeam.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4371000cf542c50ff49
 title: 'Problem 202: Laserbeam'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301843
 dashedName: problem-202-laserbeam
 ---
@@ -10,18 +10,20 @@ dashedName: problem-202-laserbeam
 
 Three mirrors are arranged in the shape of an equilateral triangle, with their reflective surfaces pointing inwards. There is an infinitesimal gap at each vertex of the triangle through which a laser beam may pass.
 
-Label the vertices A, B and C. There are 2 ways in which a laser beam may enter vertex C, bounce off 11 surfaces, then exit through the same vertex: one way is shown below; the other is the reverse of that.
+Label the vertices $A$, $B$ and $C$. There are 2 ways in which a laser beam may enter vertex $C$, bounce off 11 surfaces, then exit through the same vertex: one way is shown below; the other is the reverse of that.
 
-There are 80840 ways in which a laser beam may enter vertex C, bounce off 1000001 surfaces, then exit through the same vertex.
+<img class="img-responsive center-block" alt="one way in which laser beam may enter vertex C, bounce off 11 surfaces and exit through the same vertex" src="https://cdn.freecodecamp.org/curriculum/project-euler/laserbeam.gif" style="background-color: white; padding: 10px;" />
 
-In how many ways can a laser beam enter at vertex C, bounce off 12017639147 surfaces, then exit through the same vertex?
+There are 80840 ways in which a laser beam may enter vertex $C$, bounce off 1000001 surfaces, then exit through the same vertex.
+
+In how many ways can a laser beam enter at vertex $C$, bounce off 12017639147 surfaces, then exit through the same vertex?
 
 # --hints--
 
-`euler202()` should return 1209002624.
+`laserbeam()` should return `1209002624`.
 
 ```js
-assert.strictEqual(euler202(), 1209002624);
+assert.strictEqual(laserbeam(), 1209002624);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler202(), 1209002624);
 ## --seed-contents--
 
 ```js
-function euler202() {
+function laserbeam() {
 
   return true;
 }
 
-euler202();
+laserbeam();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md
index 4ecf609e4b3..4e418715771 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md
@@ -1,16 +1,20 @@
 ---
 id: 5900f4381000cf542c50ff4a
 title: 'Problem 203: Squarefree Binomial Coefficients'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301844
 dashedName: problem-203-squarefree-binomial-coefficients
 ---
 
 # --description--
 
-The binomial coefficients nCk can be arranged in triangular form, Pascal's triangle, like this:
+The binomial coefficients $\displaystyle\binom{n}{k}$ can be arranged in triangular form, Pascal's triangle, like this:
 
-111121133114641151010511615201561172135352171 .........
+$$\begin{array}{ccccccccccccccc}    &   &   &   &    &    &    &  1 &    &    &    &   &   &   &   \\\\
+   &   &   &   &    &    &  1 &    & 1  &    &    &   &   &   &   \\\\    &   &   &   &    &  1 &    &  2 &    &  1 &    &   &   &   &   \\\\
+   &   &   &   &  1 &    &  3 &    &  3 &    &  1 &   &   &   &   \\\\    &   &   & 1 &    &  4 &    &  6 &    &  4 &    & 1 &   &   &   \\\\
+   &   & 1 &   &  5 &    & 10 &    & 10 &    &  5 &   & 1 &   &   \\\\    & 1 &   & 6 &    & 15 &    & 20 &    & 15 &    & 6 &   & 1 &   \\\\
+ 1 &   & 7 &   & 21 &    & 35 &    & 35 &    & 21 &   & 7 &   & 1 \\\\ &   &   &   &    &    &    & \ldots \end{array}$$
 
 It can be seen that the first eight rows of Pascal's triangle contain twelve distinct numbers: 1, 2, 3, 4, 5, 6, 7, 10, 15, 20, 21 and 35.
 
@@ -20,10 +24,10 @@ Find the sum of the distinct squarefree numbers in the first 51 rows of Pascal's
 
 # --hints--
 
-`euler203()` should return 34029210557338.
+`squarefreeBinomialCoefficients()` should return `34029210557338`.
 
 ```js
-assert.strictEqual(euler203(), 34029210557338);
+assert.strictEqual(squarefreeBinomialCoefficients(), 34029210557338);
 ```
 
 # --seed--
@@ -31,12 +35,12 @@ assert.strictEqual(euler203(), 34029210557338);
 ## --seed-contents--
 
 ```js
-function euler203() {
+function squarefreeBinomialCoefficients() {
 
   return true;
 }
 
-euler203();
+squarefreeBinomialCoefficients();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.md
index 4d81e08eea0..584cf57c132 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4381000cf542c50ff4b
 title: 'Problem 204: Generalised Hamming Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301845
 dashedName: problem-204-generalised-hamming-numbers
 ---
@@ -12,18 +12,18 @@ A Hamming number is a positive number which has no prime factor larger than 5.
 
 So the first few Hamming numbers are 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15.
 
-There are 1105 Hamming numbers not exceeding 108.
+There are 1105 Hamming numbers not exceeding ${10}^8$.
 
-We will call a positive number a generalised Hamming number of type n, if it has no prime factor larger than n. Hence the Hamming numbers are the generalised Hamming numbers of type 5.
+We will call a positive number a generalised Hamming number of type $n$, if it has no prime factor larger than $n$. Hence the Hamming numbers are the generalised Hamming numbers of type 5.
 
-How many generalised Hamming numbers of type 100 are there which don't exceed 109?
+How many generalised Hamming numbers of type 100 are there which don't exceed ${10}^9$?
 
 # --hints--
 
-`euler204()` should return 2944730.
+`generalisedHammingNumbers()` should return `2944730`.
 
 ```js
-assert.strictEqual(euler204(), 2944730);
+assert.strictEqual(generalisedHammingNumbers(), 2944730);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler204(), 2944730);
 ## --seed-contents--
 
 ```js
-function euler204() {
+function generalisedHammingNumbers() {
 
   return true;
 }
 
-euler204();
+generalisedHammingNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-205-dice-game.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-205-dice-game.md
index 41bf903b6d9..17614dbf03b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-205-dice-game.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-205-dice-game.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4391000cf542c50ff4c
 title: 'Problem 205: Dice Game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301846
 dashedName: problem-205-dice-game
 ---
@@ -18,10 +18,10 @@ What is the probability that Pyramidal Pete beats Cubic Colin? Give your answer
 
 # --hints--
 
-`euler205()` should return 0.5731441.
+`diceGame()` should return `0.5731441`.
 
 ```js
-assert.strictEqual(euler205(), 0.5731441);
+assert.strictEqual(diceGame(), 0.5731441);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler205(), 0.5731441);
 ## --seed-contents--
 
 ```js
-function euler205() {
+function diceGame() {
 
   return true;
 }
 
-euler205();
+diceGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-206-concealed-square.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-206-concealed-square.md
index eaedced890e..596f703da28 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-206-concealed-square.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-206-concealed-square.md
@@ -1,21 +1,21 @@
 ---
 id: 5900f43a1000cf542c50ff4d
 title: 'Problem 206: Concealed Square'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301847
 dashedName: problem-206-concealed-square
 ---
 
 # --description--
 
-Find the unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0, where each “\_” is a single digit.
+Find the unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0, where each "_" is a single digit.
 
 # --hints--
 
-`euler206()` should return 1389019170.
+`concealedSquare()` should return `1389019170`.
 
 ```js
-assert.strictEqual(euler206(), 1389019170);
+assert.strictEqual(concealedSquare(), 1389019170);
 ```
 
 # --seed--
@@ -23,16 +23,41 @@ assert.strictEqual(euler206(), 1389019170);
 ## --seed-contents--
 
 ```js
-function euler206() {
+function concealedSquare() {
 
   return true;
 }
 
-euler206();
+concealedSquare();
 ```
 
 # --solutions--
 
 ```js
-// solution required
+// Check if n**2 matches the pattern
+function squareMatchs(n) {
+  // Need BigInt due to size of values
+  let nSquared = (BigInt(n) * BigInt(n)).toString();
+
+  // Check if digits match pattern
+  for (let i = 1; i <= 9; i++) {
+    if (nSquared[2 * (i - 1)] != i) return false;
+  }
+  return true;
+}
+
+// Find integer whose square matches the pattern
+function concealedSquare() {
+  // Set bounds based upon max and min candidates
+  const minSquareRoot = Math.floor(Math.sqrt(10203040506070809) / 10) * 10;
+  const maxSquareRoot = Math.ceil(Math.sqrt(19293949596979899) / 10) * 10;
+
+  for (let x = maxSquareRoot; x >= minSquareRoot; x -= 10) {
+    // Note: 3*3 = 9 and 7*7 = 49 are only trailing digits
+    //       that can produce 9 as trailing digit in square
+    if (squareMatchs(x + 3)) return (x + 3)*10;
+    if (squareMatchs(x + 7)) return (x + 7)*10;
+  }
+  return -1;
+}
 ```
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md
index 19f1d12c8d4..29efa6bc5f6 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md
@@ -1,31 +1,39 @@
 ---
 id: 5900f43c1000cf542c50ff4e
 title: 'Problem 207: Integer partition equations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301848
 dashedName: problem-207-integer-partition-equations
 ---
 
 # --description--
 
-For some positive integers k, there exists an integer partition of the form 4t = 2t + k,
+For some positive integers $k$, there exists an integer partition of the form $4^t = 2^t + k$,
 
-where 4t, 2t, and k are all positive integers and t is a real number.
+where $4^t$, $2^t$, and $k$ are all positive integers and $t$ is a real number.
 
-The first two such partitions are 41 = 21 + 2 and 41.5849625... = 21.5849625... + 6.
+The first two such partitions are $4^1 = 2^1 + 2$ and $4^{1.584\\,962\\,5\ldots} = 2^{1.584\\,962\\,5\ldots} + 6$.
 
-Partitions where t is also an integer are called perfect. For any m ≥ 1 let P(m) be the proportion of such partitions that are perfect with k ≤ m. Thus P(6) = 1/2.
+Partitions where $t$ is also an integer are called perfect. For any $m ≥ 1$ let $P(m)$ be the proportion of such partitions that are perfect with $k ≤ m$.
 
-In the following table are listed some values of P(m) P(5) = 1/1 P(10) = 1/2 P(15) = 2/3 P(20) = 1/2 P(25) = 1/2 P(30) = 2/5 ... P(180) = 1/4 P(185) = 3/13
+Thus $P(6) = \frac{1}{2}$.
 
-Find the smallest m for which P(m) &lt; 1/12345
+In the following table are listed some values of $P(m)$
+
+$$\begin{align}   & P(5) = \frac{1}{1}    \\\\
+  & P(10) = \frac{1}{2}   \\\\   & P(15) = \frac{2}{3}   \\\\
+  & P(20) = \frac{1}{2}   \\\\   & P(25) = \frac{1}{2}   \\\\
+  & P(30) = \frac{2}{5}   \\\\   & \ldots                \\\\
+  & P(180) = \frac{1}{4}  \\\\ & P(185) = \frac{3}{13} \end{align}$$
+
+Find the smallest $m$ for which $P(m) &lt; \frac{1}{12\\,345}$
 
 # --hints--
 
-`euler207()` should return 44043947822.
+`integerPartitionEquations()` should return `44043947822`.
 
 ```js
-assert.strictEqual(euler207(), 44043947822);
+assert.strictEqual(integerPartitionEquations(), 44043947822);
 ```
 
 # --seed--
@@ -33,12 +41,12 @@ assert.strictEqual(euler207(), 44043947822);
 ## --seed-contents--
 
 ```js
-function euler207() {
+function integerPartitionEquations() {
 
   return true;
 }
 
-euler207();
+integerPartitionEquations();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-208-robot-walks.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-208-robot-walks.md
index 36d5a8fff53..63c4e63cf53 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-208-robot-walks.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-208-robot-walks.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f43f1000cf542c50ff51
 title: 'Problem 208: Robot Walks'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301849
 dashedName: problem-208-robot-walks
 ---
@@ -12,14 +12,18 @@ A robot moves in a series of one-fifth circular arcs (72°), with a free choice
 
 One of 70932 possible closed paths of 25 arcs starting northward is
 
-Given that the robot starts facing North, how many journeys of 70 arcs in length can it take that return it, after the final arc, to its starting position? (Any arc may be traversed multiple times.)
+<img class="img-responsive center-block" alt="closed path of 25 arcs, starting northward" src="https://cdn.freecodecamp.org/curriculum/project-euler/robot-walks.gif" style="background-color: white; padding: 10px;" />
+
+Given that the robot starts facing North, how many journeys of 70 arcs in length can it take that return it, after the final arc, to its starting position?
+
+**Note:** Any arc may be traversed multiple times.
 
 # --hints--
 
-`euler208()` should return 331951449665644800.
+`robotWalks()` should return `331951449665644800`.
 
 ```js
-assert.strictEqual(euler208(), 331951449665644800);
+assert.strictEqual(robotWalks(), 331951449665644800);
 ```
 
 # --seed--
@@ -27,12 +31,12 @@ assert.strictEqual(euler208(), 331951449665644800);
 ## --seed-contents--
 
 ```js
-function euler208() {
+function robotWalks() {
 
   return true;
 }
 
-euler208();
+robotWalks();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-209-circular-logic.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-209-circular-logic.md
index f7437447361..97190a72f20 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-209-circular-logic.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-209-circular-logic.md
@@ -1,27 +1,41 @@
 ---
 id: 5900f43e1000cf542c50ff4f
 title: 'Problem 209: Circular Logic'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301850
 dashedName: problem-209-circular-logic
 ---
 
 # --description--
 
-A k-input binary truth table is a map from k input bits
+A $k$-input binary truth table is a map from $k$ input bits (binary digits, 0 [false] or 1 [true]) to 1 output bit. For example, the $2$-input binary truth tables for the logical $AND$ and $XOR$ functions are:
 
-(binary digits, 0 \[false] or 1 \[true]) to 1 output bit. For example, the 2-input binary truth tables for the logical AND and XOR functions are:
+| x | y | x AND y |
+| - | - | ------- |
+| 0 | 0 | 0       |
+| 0 | 1 | 0       |
+| 1 | 0 | 0       |
+| 1 | 1 | 1       |
 
-x y x AND y000010100111x y x XOR y000011101110How many 6-input binary truth tables, τ, satisfy the formula
+| x | y | x XOR y |
+| - | - | ------- |
+| 0 | 0 | 0       |
+| 0 | 1 | 1       |
+| 1 | 0 | 1       |
+| 1 | 1 | 0       |
 
-τ(a, b, c, d, e, f) AND τ(b, c, d, e, f, a XOR (b AND c)) = 0 for all 6-bit inputs (a, b, c, d, e, f)?
+How many $6$-input binary truth tables, $τ$, satisfy the formula
+
+$$τ(a, b, c, d, e, f) \\; AND \\; τ(b, c, d, e, f, a \\; XOR \\; (b \\; AND \\; c)) = 0$$
+
+for all $6$-bit inputs ($a$, $b$, $c$, $d$, $e$, $f$)?
 
 # --hints--
 
-`euler209()` should return 15964587728784.
+`circularLogic()` should return `15964587728784`.
 
 ```js
-assert.strictEqual(euler209(), 15964587728784);
+assert.strictEqual(circularLogic(), 15964587728784);
 ```
 
 # --seed--
@@ -29,12 +43,12 @@ assert.strictEqual(euler209(), 15964587728784);
 ## --seed-contents--
 
 ```js
-function euler209() {
+function circularLogic() {
 
   return true;
 }
 
-euler209();
+circularLogic();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-21-amicable-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-21-amicable-numbers.md
index 58acfba70e1..df19c7d7c20 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-21-amicable-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-21-amicable-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3811000cf542c50fe94
 title: 'Problem 21: Amicable numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301851
 dashedName: problem-21-amicable-numbers
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md
index 1fc7d980330..0dbbed2f9b0 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f43e1000cf542c50ff50
 title: 'Problem 210: Obtuse Angled Triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301852
 dashedName: problem-210-obtuse-angled-triangles
 ---
 
 # --description--
 
-Consider the set S(r) of points (x,y) with integer coordinates satisfying |x| + |y| ≤ r.
+Consider the set $S(r)$ of points ($x$,$y$) with integer coordinates satisfying $|x| + |y| ≤ r$.
 
-Let O be the point (0,0) and C the point (r/4,r/4).
+Let $O$ be the point (0,0) and $C$ the point ($\frac{r}{4}$,$\frac{r}{4}$).
 
-Let N(r) be the number of points B in S(r), so that the triangle OBC has an obtuse angle, i.e. the largest angle α satisfies 90°&lt;α&lt;180°.
+Let $N(r)$ be the number of points $B$ in $S(r)$, so that the triangle $OBC$ has an obtuse angle, i.e. the largest angle $α$ satisfies $90°&lt;α&lt;180°$.
 
-So, for example, N(4)=24 and N(8)=100.
+So, for example, $N(4)=24$ and $N(8)=100$.
 
-What is N(1,000,000,000)?
+What is $N(1\\,000\\,000\\,000)$?
 
 # --hints--
 
-`euler210()` should return 1598174770174689500.
+`obtuseAngledTriangles()` should return `1598174770174689500`.
 
 ```js
-assert.strictEqual(euler210(), 1598174770174689500);
+assert.strictEqual(obtuseAngledTriangles(), 1598174770174689500);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler210(), 1598174770174689500);
 ## --seed-contents--
 
 ```js
-function euler210() {
+function obtuseAngledTriangles() {
 
   return true;
 }
 
-euler210();
+obtuseAngledTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md
index bde41e4a79e..828e558e426 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f43f1000cf542c50ff52
 title: 'Problem 211: Divisor Square Sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301853
 dashedName: problem-211-divisor-square-sum
 ---
 
 # --description--
 
-For a positive integer n, let σ2(n) be the sum of the squares of its divisors. For example,
+For a positive integer $n$, let $σ_2(n)$ be the sum of the squares of its divisors. 例如，
 
-σ2(10) = 1 + 4 + 25 + 100 = 130.
+$$σ_2(10) = 1 + 4 + 25 + 100 = 130$$
 
-Find the sum of all n, 0 &lt; n &lt; 64,000,000 such that σ2(n) is a perfect square.
+Find the sum of all $n$, $0 &lt; n &lt; 64\\,000\\,000$ such that $σ_2(n)$ is a perfect square.
 
 # --hints--
 
-`euler211()` should return 1922364685.
+`divisorSquareSum()` should return `1922364685`.
 
 ```js
-assert.strictEqual(euler211(), 1922364685);
+assert.strictEqual(divisorSquareSum(), 1922364685);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler211(), 1922364685);
 ## --seed-contents--
 
 ```js
-function euler211() {
+function divisorSquareSum() {
 
   return true;
 }
 
-euler211();
+divisorSquareSum();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md
index 901bbbc3d11..6fd271c483e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md
@@ -1,35 +1,40 @@
 ---
 id: 5900f4411000cf542c50ff53
 title: 'Problem 212: Combined Volume of Cuboids'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301854
 dashedName: problem-212-combined-volume-of-cuboids
 ---
 
 # --description--
 
-An axis-aligned cuboid, specified by parameters { (x0,y0,z0), (dx,dy,dz) }, consists of all points (X,Y,Z) such that x0 ≤ X ≤ x0+dx, y0 ≤ Y ≤ y0+dy and z0 ≤ Z ≤ z0+dz. The volume of the cuboid is the product, dx × dy × dz. The combined volume of a collection of cuboids is the volume of their union and will be less than the sum of the individual volumes if any cuboids overlap.
+An axis-aligned cuboid, specified by parameters $\{ (x_0,y_0,z_0), (dx,dy,dz) \}$, consists of all points ($X$,$Y$,$Z$) such that $x_0 ≤ X ≤ x_0 + dx$, $y_0 ≤ Y ≤ y_0 + dy$ and $z_0 ≤ Z ≤ z_0 + dz$. The volume of the cuboid is the product, $dx × dy × dz$. The combined volume of a collection of cuboids is the volume of their union and will be less than the sum of the individual volumes if any cuboids overlap.
 
-Let C1,...,C50000 be a collection of 50000 axis-aligned cuboids such that Cn has parameters
+Let $C_1, \ldots, C_{50000}$ be a collection of 50000 axis-aligned cuboids such that $C_n$ has parameters
 
-x0 = S6n-5 modulo 10000y0 = S6n-4 modulo 10000z0 = S6n-3 modulo 10000dx = 1 + (S6n-2 modulo 399)dy = 1 + (S6n-1 modulo 399)dz = 1 + (S6n modulo 399)
+$$\begin{align}   & x_0 = S_{6n - 5} \\; \text{modulo} \\; 10000    \\\\
+  & y_0 = S_{6n - 4} \\; \text{modulo} \\; 10000    \\\\   & z_0 = S_{6n - 3} \\; \text{modulo} \\; 10000    \\\\
+  & dx = 1 + (S_{6n - 2} \\; \text{modulo} \\; 399) \\\\   & dy = 1 + (S_{6n - 1} \\; \text{modulo} \\; 399) \\\\
+  & dz = 1 + (S_{6n} \\; \text{modulo} \\; 399)     \\\\ \end{align}$$
 
-where S1,...,S300000 come from the "Lagged Fibonacci Generator":
+where $S_1, \ldots, S_{300000}$ come from the "Lagged Fibonacci Generator":
 
-For 1 ≤ k ≤ 55, Sk = \[100003 - 200003k + 300007k3] (modulo 1000000)For 56 ≤ k, Sk = \[Sk-24 + Sk-55] (modulo 1000000)
+For $1 ≤ k ≤ 55$, $S_k = [100003 - 200003k + 300007k^3] \\; (modulo \\; 1000000)$
 
-Thus, C1 has parameters {(7,53,183),(94,369,56)}, C2 has parameters {(2383,3563,5079),(42,212,344)}, and so on.
+For $56 ≤ k$, $S_k = [S_{k - 24} + S_{k - 55}] \\; (modulo \\; 1000000)$
 
-The combined volume of the first 100 cuboids, C1,...,C100, is 723581599.
+Thus, $C_1$ has parameters $\{(7,53,183), (94,369,56)\}$, $C_2$ has parameters $\{(2383,3563,5079), (42,212,344)\}$, and so on.
 
-What is the combined volume of all 50000 cuboids, C1,...,C50000 ?
+The combined volume of the first 100 cuboids, $C_1, \ldots, C_{100}$, is 723581599.
+
+What is the combined volume of all 50000 cuboids, $C_1, \ldots, C_{50000}$?
 
 # --hints--
 
-`euler212()` should return 328968937309.
+`combinedValueOfCuboids()` should return `328968937309`.
 
 ```js
-assert.strictEqual(euler212(), 328968937309);
+assert.strictEqual(combinedValueOfCuboids(), 328968937309);
 ```
 
 # --seed--
@@ -37,12 +42,12 @@ assert.strictEqual(euler212(), 328968937309);
 ## --seed-contents--
 
 ```js
-function euler212() {
+function combinedValueOfCuboids() {
 
   return true;
 }
 
-euler212();
+combinedValueOfCuboids();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-213-flea-circus.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-213-flea-circus.md
index 2fbc23393c1..a18eb635255 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-213-flea-circus.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-213-flea-circus.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4411000cf542c50ff54
 title: 'Problem 213: Flea Circus'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301855
 dashedName: problem-213-flea-circus
 ---
@@ -16,10 +16,10 @@ What is the expected number of unoccupied squares after 50 rings of the bell? Gi
 
 # --hints--
 
-`euler213()` should return 330.721154.
+`fleaCircus()` should return `330.721154`.
 
 ```js
-assert.strictEqual(euler213(), 330.721154);
+assert.strictEqual(fleaCircus(), 330.721154);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler213(), 330.721154);
 ## --seed-contents--
 
 ```js
-function euler213() {
+function fleaCircus() {
 
   return true;
 }
 
-euler213();
+fleaCircus();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-214-totient-chains.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-214-totient-chains.md
index 754596cef69..7f2091ef599 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-214-totient-chains.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-214-totient-chains.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f4421000cf542c50ff55
-title: 'Problem 214: Totient Chains'
-challengeType: 5
+title: '問題 214：Totient 鏈'
+challengeType: 1
 forumTopicId: 301856
 dashedName: problem-214-totient-chains
 ---
 
 # --description--
 
-Let φ be Euler's totient function, i.e. for a natural number n,
+Let $φ$ be Euler's totient function, i.e. for a natural number $n$, $φ(n)$ is the number of $k$, $1 ≤ k ≤ n$, for which $gcd(k,n) = 1$.
 
-φ(n) is the number of k, 1 ≤ k ≤ n, for which gcd(k,n) = 1.
+By iterating $φ$, each positive integer generates a decreasing chain of numbers ending in 1. E.g. if we start with 5 the sequence 5,4,2,1 is generated. Here is a listing of all chains with length 4:
 
-By iterating φ, each positive integer generates a decreasing chain of numbers ending in 1. E.g. if we start with 5 the sequence 5,4,2,1 is generated. Here is a listing of all chains with length 4:
-
-5,4,2,1 7,6,2,1 8,4,2,1 9,6,2,1 10,4,2,1 12,4,2,1 14,6,2,1 18,6,2,1
+$$\begin{align}    5,4,2,1 & \\\\
+   7,6,2,1 & \\\\    8,4,2,1 & \\\\
+   9,6,2,1 & \\\\   10,4,2,1 & \\\\
+  12,4,2,1 & \\\\   14,6,2,1 & \\\\
+  18,6,2,1 & \end{align}$$
 
 Only two of these chains start with a prime, their sum is 12.
 
-What is the sum of all primes less than 40000000 which generate a chain of length 25?
+What is the sum of all primes less than $40\\,000\\,000$ which generate a chain of length 25?
 
 # --hints--
 
-`euler214()` should return 1677366278943.
+`totientChains()` should return `1677366278943`.
 
 ```js
-assert.strictEqual(euler214(), 1677366278943);
+assert.strictEqual(totientChains(), 1677366278943);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler214(), 1677366278943);
 ## --seed-contents--
 
 ```js
-function euler214() {
+function totientChains() {
 
   return true;
 }
 
-euler214();
+totientChains();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md
index 45f7f563e73..4e0f214b938 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4431000cf542c50ff56
 title: 'Problem 215: Crack-free Walls'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301857
 dashedName: problem-215-crack-free-walls
 ---
@@ -12,16 +12,18 @@ Consider the problem of building a wall out of 2×1 and 3×1 bricks (horizontal
 
 For example, the following 9×3 wall is not acceptable due to the running crack shown in red:
 
-There are eight ways of forming a crack-free 9×3 wall, written W(9,3) = 8.
+<img class="img-responsive center-block" alt="9x3 wall with one lined up gap between horizontally-adjacent bricks" src="https://cdn.freecodecamp.org/curriculum/project-euler/crack-free-walls.gif" style="background-color: white; padding: 10px;" />
 
-Calculate W(32,10).
+There are eight ways of forming a crack-free 9×3 wall, written $W(9,3) = 8$.
+
+Calculate $W(32,10)$.
 
 # --hints--
 
-`euler215()` should return 806844323190414.
+`crackFreeWalls()` should return `806844323190414`.
 
 ```js
-assert.strictEqual(euler215(), 806844323190414);
+assert.strictEqual(crackFreeWalls(), 806844323190414);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler215(), 806844323190414);
 ## --seed-contents--
 
 ```js
-function euler215() {
+function crackFreeWalls() {
 
   return true;
 }
 
-euler215();
+crackFreeWalls();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md
index e7591cd46f5..a528915ab9a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f4451000cf542c50ff57
 title: 'Problem 216: Investigating the primality of numbers of the form 2n2-1'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301858
 dashedName: problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1
 ---
 
 # --description--
 
-Consider numbers t(n) of the form t(n) = 2n2-1 with n > 1.
+Consider numbers $t(n)$ of the form $t(n) = 2n^2 - 1$ with $n > 1$.
 
 The first such numbers are 7, 17, 31, 49, 71, 97, 127 and 161.
 
-It turns out that only 49 = 7\*7 and 161 = 7\*23 are not prime.
+It turns out that only $49 = 7 \times 7$ and $161 = 7 \times 23$ are not prime.
 
-For n ≤ 10000 there are 2202 numbers t(n) that are prime.
+For $n ≤ 10000$ there are 2202 numbers $t(n)$ that are prime.
 
-How many numbers t(n) are prime for n ≤ 50,000,000 ?
+How many numbers $t(n)$ are prime for $n ≤ 50\\,000\\,000$?
 
 # --hints--
 
-`euler216()` should return 5437849.
+`primalityOfNumbers()` should return `5437849`.
 
 ```js
-assert.strictEqual(euler216(), 5437849);
+assert.strictEqual(primalityOfNumbers(), 5437849);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler216(), 5437849);
 ## --seed-contents--
 
 ```js
-function euler216() {
+function primalityOfNumbers() {
 
   return true;
 }
 
-euler216();
+primalityOfNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md
index 625b4a6c6d2..f685410fcd3 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f4461000cf542c50ff58
 title: 'Problem 217: Balanced Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301859
 dashedName: problem-217-balanced-numbers
 ---
 
 # --description--
 
-A positive integer with k (decimal) digits is called balanced if its first ⌈k/2⌉ digits sum to the same value as its last ⌈k/2⌉ digits, where ⌈x⌉, pronounced ceiling of x, is the smallest integer ≥ x, thus ⌈π⌉ = 4 and ⌈5⌉ = 5.
+A positive integer with $k$ (decimal) digits is called balanced if its first $⌈\frac{k}{2}⌉$ digits sum to the same value as its last $⌈\frac{k}{2}⌉$ digits, where $⌈x⌉$, pronounced ceiling of $x$, is the smallest integer $≥ x$, thus $⌈π⌉ = 4$ and $⌈5⌉ = 5$.
 
 So, for example, all palindromes are balanced, as is 13722.
 
-Let T(n) be the sum of all balanced numbers less than 10n.
+Let $T(n)$ be the sum of all balanced numbers less than $10^n$.
 
-Thus: T(1) = 45, T(2) = 540 and T(5) = 334795890.
+Thus: $T(1) = 45$, $T(2) = 540$ and $T(5) = 334\\,795\\,890$.
 
-Find T(47) mod 315
+Find $T(47)\\,mod\\,3^{15}$
 
 # --hints--
 
-`euler217()` should return 6273134.
+`balancedNumbers()` should return `6273134`.
 
 ```js
-assert.strictEqual(euler217(), 6273134);
+assert.strictEqual(balancedNumbers(), 6273134);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler217(), 6273134);
 ## --seed-contents--
 
 ```js
-function euler217() {
+function balancedNumbers() {
 
   return true;
 }
 
-euler217();
+balancedNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.md
index db91d74874e..1d29c005426 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.md
@@ -1,33 +1,39 @@
 ---
 id: 5900f4461000cf542c50ff59
 title: 'Problem 218: Perfect right-angled triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301860
 dashedName: problem-218-perfect-right-angled-triangles
 ---
 
 # --description--
 
-Consider the right angled triangle with sides a=7, b=24 and c=25.
+Consider the right-angled triangle with sides $a=7$, $b=24$ and $c=25$.
 
 The area of this triangle is 84, which is divisible by the perfect numbers 6 and 28.
 
-Moreover it is a primitive right angled triangle as gcd(a,b)=1 and gcd(b,c)=1.
+Moreover it is a primitive right-angled triangle as $gcd(a,b) = 1$ and $gcd(b,c) = 1$.
 
-Also c is a perfect square.
+Also $c$ is a perfect square.
 
-We will call a right angled triangle perfect if -it is a primitive right angled triangle -its hypotenuse is a perfect square
+We will call a right-angled triangle perfect if:
 
-We will call a right angled triangle super-perfect if -it is a perfect right angled triangle and -its area is a multiple of the perfect numbers 6 and 28.
+- it is a primitive right-angled triangle
+- its hypotenuse is a perfect square
 
-How many perfect right-angled triangles with c≤1016 exist that are not super-perfect?
+We will call a right-angled triangle super-perfect if:
+
+- it is a perfect right-angled triangle
+- its area is a multiple of the perfect numbers 6 and 28.
+
+How many perfect right-angled triangles with $c ≤ {10}^{16}$ exist that are not super-perfect?
 
 # --hints--
 
-`euler218()` should return 0.
+`perfectRightAngledTriangles()` should return `0`.
 
 ```js
-assert.strictEqual(euler218(), 0);
+assert.strictEqual(perfectRightAngledTriangles(), 0);
 ```
 
 # --seed--
@@ -35,12 +41,12 @@ assert.strictEqual(euler218(), 0);
 ## --seed-contents--
 
 ```js
-function euler218() {
+function perfectRightAngledTriangles() {
 
   return true;
 }
 
-euler218();
+perfectRightAngledTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-219-skew-cost-coding.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-219-skew-cost-coding.md
index 38d16eba872..f2d2b0f8721 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-219-skew-cost-coding.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-219-skew-cost-coding.md
@@ -1,33 +1,33 @@
 ---
 id: 5900f4481000cf542c50ff5a
 title: 'Problem 219: Skew-cost coding'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301861
 dashedName: problem-219-skew-cost-coding
 ---
 
 # --description--
 
-Let A and B be bit strings (sequences of 0's and 1's).
+Let $A$ and $B$ be bit strings (sequences of 0's and 1's).
 
-If A is equal to the leftmost length(A) bits of B, then A is said to be a prefix of B.
+If $A$ is equal to the <u>left</u>most length($A$) bits of $B$, then $A$ is said to be a prefix of $B$.
 
-For example, 00110 is a prefix of 001101001, but not of 00111 or 100110.
+For example, 00110 is a prefix of <u>00110</u>1001, but not of 00111 or 100110.
 
-A prefix-free code of size n is a collection of n distinct bit strings such that no string is a prefix of any other. For example, this is a prefix-free code of size 6:
+A prefix-free code of size $n$ is a collection of $n$ distinct bit strings such that no string is a prefix of any other. For example, this is a prefix-free code of size 6:
 
-0000, 0001, 001, 01, 10, 11
+$$0000, 0001, 001, 01, 10, 11$$
 
-Now suppose that it costs one penny to transmit a '0' bit, but four pence to transmit a '1'. Then the total cost of the prefix-free code shown above is 35 pence, which happens to be the cheapest possible for the skewed pricing scheme in question. In short, we write Cost(6) = 35.
+Now suppose that it costs one penny to transmit a '0' bit, but four pence to transmit a '1'. Then the total cost of the prefix-free code shown above is 35 pence, which happens to be the cheapest possible for the skewed pricing scheme in question. In short, we write $Cost(6) = 35$.
 
-What is Cost(109) ?
+What is $Cost(10^9)$?
 
 # --hints--
 
-`euler219()` should return 64564225042.
+`skewCostCoding()` should return `64564225042`.
 
 ```js
-assert.strictEqual(euler219(), 64564225042);
+assert.strictEqual(skewCostCoding(), 64564225042);
 ```
 
 # --seed--
@@ -35,12 +35,12 @@ assert.strictEqual(euler219(), 64564225042);
 ## --seed-contents--
 
 ```js
-function euler219() {
+function skewCostCoding() {
 
   return true;
 }
 
-euler219();
+skewCostCoding();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-22-names-scores.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-22-names-scores.md
index e93e40d6ef4..4c8df4383a7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-22-names-scores.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-22-names-scores.md
@@ -1,7 +1,7 @@
 ---
 id: 5a51eabcad78bf416f316e2a
 title: 'Problem 22: Names scores'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301862
 dashedName: problem-22-names-scores
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md
index 1fccaef107f..e58e3c3f3ec 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md
@@ -1,31 +1,40 @@
 ---
 id: 5900f4481000cf542c50ff5b
 title: 'Problem 220: Heighway Dragon'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301863
 dashedName: problem-220-heighway-dragon
 ---
 
 # --description--
 
-Let D0 be the two-letter string "Fa". For n≥1, derive Dn from Dn-1 by the string-rewriting rules:
+Let $D_0$ be the two-letter string "Fa". For $n ≥ 1$, derive $D_n$ from $D_{n - 1}$ by the string-rewriting rules:
 
-"a" → "aRbFR" "b" → "LFaLb"
+- "a" → "aRbFR"
+- "b" → "LFaLb"
 
-Thus, D0 = "Fa", D1 = "FaRbFR", D2 = "FaRbFRRLFaLbFR", and so on.
+Thus, $D_0$ = "Fa", $D_1$ = "FaRbFR", $D_2$ = "FaRbFRRLFaLbFR", and so on.
 
 These strings can be interpreted as instructions to a computer graphics program, with "F" meaning "draw forward one unit", "L" meaning "turn left 90 degrees", "R" meaning "turn right 90 degrees", and "a" and "b" being ignored. The initial position of the computer cursor is (0,0), pointing up towards (0,1).
 
-Then Dn is an exotic drawing known as the Heighway Dragon of order n. For example, D10 is shown below; counting each "F" as one step, the highlighted spot at (18,16) is the position reached after 500 steps.
+Then $D_n$ is an exotic drawing known as the Heighway Dragon of order $n$. For example, $D_{10}$ is shown below; counting each "F" as one step, the highlighted spot at (18,16) is the position reached after 500 steps.
 
-What is the position of the cursor after 1012 steps in D50 ? Give your answer in the form x,y with no spaces.
+<img class="img-responsive center-block" alt="drawing of the Heighway Dragon after 500 steps" src="https://cdn.freecodecamp.org/curriculum/project-euler/heighway-dragon.gif" style="background-color: white; padding: 10px;" />
+
+What is the position of the cursor after ${10}^{12}$ steps in $D_{50}$? Give your answer as a string in the form `x,y` with no spaces.
 
 # --hints--
 
-`euler220()` should return 139776, 963904.
+`heighwayDragon()` should return a string.
 
 ```js
-assert.strictEqual(euler220(), 139776, 963904);
+assert(typeof heighwayDragon() === 'string');
+```
+
+`heighwayDragon()` should return the string `139776,963904`.
+
+```js
+assert.strictEqual(heighwayDragon(), '139776,963904');
 ```
 
 # --seed--
@@ -33,12 +42,12 @@ assert.strictEqual(euler220(), 139776, 963904);
 ## --seed-contents--
 
 ```js
-function euler220() {
+function heighwayDragon() {
 
   return true;
 }
 
-euler220();
+heighwayDragon();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-221-alexandrian-integers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-221-alexandrian-integers.md
index 010d2bd57c9..e7fedf26f75 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-221-alexandrian-integers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-221-alexandrian-integers.md
@@ -1,27 +1,32 @@
 ---
 id: 5900f4491000cf542c50ff5c
 title: 'Problem 221: Alexandrian Integers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301864
 dashedName: problem-221-alexandrian-integers
 ---
 
 # --description--
 
-We shall call a positive integer A an "Alexandrian integer", if there exist integers p, q, r such that: A = p · q · r and 1/A = 1/p + 1/q + 1/r
+We shall call a positive integer $A$ an "Alexandrian integer", if there exist integers $p$, $q$, $r$ such that:
 
-<!-- TODO Use MathJax -->
+$$A = p \times q \times r$$
 
-For example, 630 is an Alexandrian integer (p = 5, q = −7, r = −18). In fact, 630 is the 6th Alexandrian integer, the first 6 Alexandrian integers being: 6, 42, 120, 156, 420 and 630.
+and
+
+$$\frac{1}{A} = \frac{1}{p} + \frac{1}{q} + \frac{1}{r}$$
+
+
+For example, 630 is an Alexandrian integer ($p = 5$, $q = −7$, $r = −18$). In fact, 630 is the 6th Alexandrian integer, the first 6 Alexandrian integers being: 6, 42, 120, 156, 420 and 630.
 
 Find the 150000th Alexandrian integer.
 
 # --hints--
 
-`euler221()` should return 1884161251122450.
+`alexandrianIntegers()` should return `1884161251122450`.
 
 ```js
-assert.strictEqual(euler221(), 1884161251122450);
+assert.strictEqual(alexandrianIntegers(), 1884161251122450);
 ```
 
 # --seed--
@@ -29,12 +34,12 @@ assert.strictEqual(euler221(), 1884161251122450);
 ## --seed-contents--
 
 ```js
-function euler221() {
+function alexandrianIntegers() {
 
   return true;
 }
 
-euler221();
+alexandrianIntegers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md
index 423ce7ff8e6..cdb6a9c3977 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f44b1000cf542c50ff5d
 title: 'Problem 222: Sphere Packing'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301865
 dashedName: problem-222-sphere-packing
 ---
@@ -10,14 +10,14 @@ dashedName: problem-222-sphere-packing
 
 What is the length of the shortest pipe, of internal radius 50mm, that can fully contain 21 balls of radii 30mm, 31mm, ..., 50mm?
 
-Give your answer in micrometres (10-6 m) rounded to the nearest integer.
+Give your answer in micrometres (${10}^{-6}$ m) rounded to the nearest integer.
 
 # --hints--
 
-`euler222()` should return 1590933.
+`spherePacking()` should return `1590933`.
 
 ```js
-assert.strictEqual(euler222(), 1590933);
+assert.strictEqual(spherePacking(), 1590933);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler222(), 1590933);
 ## --seed-contents--
 
 ```js
-function euler222() {
+function spherePacking() {
 
   return true;
 }
 
-euler222();
+spherePacking();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.md
index 28f8d8f2143..7fdbc36cbc6 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.md
@@ -1,23 +1,23 @@
 ---
 id: 5900f44b1000cf542c50ff5e
 title: 'Problem 223: Almost right-angled triangles I'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301866
 dashedName: problem-223-almost-right-angled-triangles-i
 ---
 
 # --description--
 
-Let us call an integer sided triangle with sides a ≤ b ≤ c barely acute if the sides satisfy a2 + b2 = c2 + 1.
+Let us call an integer sided triangle with sides $a ≤ b ≤ c$ barely acute if the sides satisfy $a^2 + b^2 = c^2 + 1$.
 
-How many barely acute triangles are there with perimeter ≤ 25,000,000?
+How many barely acute triangles are there with perimeter $≤ 25\\,000\\,000$?
 
 # --hints--
 
-`euler223()` should return 61614848.
+`almostRightAngledTrianglesOne()` should return `61614848`.
 
 ```js
-assert.strictEqual(euler223(), 61614848);
+assert.strictEqual(almostRightAngledTrianglesOne(), 61614848);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler223(), 61614848);
 ## --seed-contents--
 
 ```js
-function euler223() {
+function almostRightAngledTrianglesOne() {
 
   return true;
 }
 
-euler223();
+almostRightAngledTrianglesOne();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md
index d9f557fd4a9..5e004799b0e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md
@@ -1,23 +1,23 @@
 ---
 id: 5900f44e1000cf542c50ff5f
-title: 'Problem 224: Almost right-angled triangles II'
-challengeType: 5
+title: '問題 224：幾乎直角三角形 II'
+challengeType: 1
 forumTopicId: 301867
 dashedName: problem-224-almost-right-angled-triangles-ii
 ---
 
 # --description--
 
-Let us call an integer sided triangle with sides a ≤ b ≤ c barely obtuse if the sides satisfy a2 + b2 = c2 - 1.
+Let us call an integer sided triangle with sides $a ≤ b ≤ c$ barely obtuse if the sides satisfy $a^2 + b^2 = c^2 - 1$.
 
-How many barely obtuse triangles are there with perimeter ≤ 75,000,000?
+How many barely obtuse triangles are there with perimeter $≤ 75\\,000\\,000$?
 
 # --hints--
 
-`euler224()` should return 4137330.
+`almostRightAngledTrianglesTwo()` should return `4137330`.
 
 ```js
-assert.strictEqual(euler224(), 4137330);
+assert.strictEqual(almostRightAngledTrianglesTwo(), 4137330);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler224(), 4137330);
 ## --seed-contents--
 
 ```js
-function euler224() {
+function almostRightAngledTrianglesTwo() {
 
   return true;
 }
 
-euler224();
+almostRightAngledTrianglesTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md
index ff5fb05c1a7..2221b445314 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f44e1000cf542c50ff60
 title: 'Problem 225: Tribonacci non-divisors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301868
 dashedName: problem-225-tribonacci-non-divisors
 ---
@@ -10,18 +10,18 @@ dashedName: problem-225-tribonacci-non-divisors
 
 The sequence 1, 1, 1, 3, 5, 9, 17, 31, 57, 105, 193, 355, 653, 1201 ...
 
-is defined by T1 = T2 = T3 = 1 and Tn = Tn-1 + Tn-2 + Tn-3.
+is defined by $T_1 = T_2 = T_3 = 1$ and $T_n = T_{n - 1} + T_{n - 2} + T_{n - 3}$.
 
-It can be shown that 27 does not divide any terms of this sequence.In fact, 27 is the first odd number with this property.
+It can be shown that 27 does not divide any terms of this sequence. In fact, 27 is the first odd number with this property.
 
-Find the 124th odd number that does not divide any terms of the above sequence.
+Find the ${124}^{\text{th}}$ odd number that does not divide any terms of the above sequence.
 
 # --hints--
 
-`euler225()` should return 2009.
+`tribonacciNonDivisors()` should return `2009`.
 
 ```js
-assert.strictEqual(euler225(), 2009);
+assert.strictEqual(tribonacciNonDivisors(), 2009);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler225(), 2009);
 ## --seed-contents--
 
 ```js
-function euler225() {
+function tribonacciNonDivisors() {
 
   return true;
 }
 
-euler225();
+tribonacciNonDivisors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.md
index 3aadacc50b8..fd8031f2594 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f4511000cf542c50ff62
 title: 'Problem 226: A Scoop of Blancmange'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301869
 dashedName: problem-226-a-scoop-of-blancmange
 ---
 
 # --description--
 
-The blancmange curve is the set of points (x,y) such that 0 ≤ x ≤ 1 and ,where s(x) = the distance from x to the nearest integer.
+The blancmange curve is the set of points ($x$,$y$) such that $0 ≤ x ≤ 1$ and $\displaystyle y = \sum_{n = 0}^{\infty} \frac{s(2^nx)}{2^n}$, where $s(x)$ is the distance from $x$ to the nearest integer.
 
-The area under the blancmange curve is equal to ½, shown in pink in the diagram below.
+The area under the blancmange curve is equal to $\frac{1}{2}$, shown in pink in the diagram below.
 
-Let C be the circle with centre (¼,½) and radius ¼, shown in black in the diagram.
+<img class="img-responsive center-block" alt="diagram of blancmange curve, with circle C shown on diagram" src="https://cdn.freecodecamp.org/curriculum/project-euler/a-scoop-of-blancmange.gif" style="background-color: white; padding: 10px;" />
 
-What area under the blancmange curve is enclosed by C?Give your answer rounded to eight decimal places in the form 0.abcdefgh
+Let $C$ be the circle with centre ($\frac{1}{4}$,$\frac{1}{2}$) and radius $\frac{1}{4}$, shown in black in the diagram.
+
+What area under the blancmange curve is enclosed by $C$? Give your answer rounded to eight decimal places in the form 0.abcdefgh
 
 # --hints--
 
-`euler226()` should return 0.11316017.
+`scoopOfBlancmange()` should return `0.11316017`.
 
 ```js
-assert.strictEqual(euler226(), 0.11316017);
+assert.strictEqual(scoopOfBlancmange(), 0.11316017);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler226(), 0.11316017);
 ## --seed-contents--
 
 ```js
-function euler226() {
+function scoopOfBlancmange() {
 
   return true;
 }
 
-euler226();
+scoopOfBlancmange();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-227-the-chase.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-227-the-chase.md
index aff8e9b9340..3121c6ac8d8 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-227-the-chase.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-227-the-chase.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f44f1000cf542c50ff61
 title: 'Problem 227: The Chase'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301870
 dashedName: problem-227-the-chase
 ---
@@ -10,16 +10,24 @@ dashedName: problem-227-the-chase
 
 "The Chase" is a game played with two dice and an even number of players.
 
-The players sit around a table; the game begins with two opposite players having one die each. On each turn, the two players with a die roll it. If a player rolls a 1, he passes the die to his neighbour on the left; if he rolls a 6, he passes the die to his neighbour on the right; otherwise, he keeps the die for the next turn. The game ends when one player has both dice after they have been rolled and passed; that player has then lost.
+The players sit around a table; the game begins with two opposite players having one die each. On each turn, the two players with a die roll it.
+
+If the player rolls a 1, he passes the die to his neighbour on the left.
+
+If the player rolls a 6, he passes the die to his neighbour on the right.
+
+Otherwise, he keeps the die for the next turn.
+
+The game ends when one player has both dice after they have been rolled and passed; that player has then lost.
 
 In a game with 100 players, what is the expected number of turns the game lasts? Give your answer rounded to ten significant digits.
 
 # --hints--
 
-`euler227()` should return 3780.618622.
+`theChase()` should return `3780.618622`.
 
 ```js
-assert.strictEqual(euler227(), 3780.618622);
+assert.strictEqual(theChase(), 3780.618622);
 ```
 
 # --seed--
@@ -27,12 +35,12 @@ assert.strictEqual(euler227(), 3780.618622);
 ## --seed-contents--
 
 ```js
-function euler227() {
+function theChase() {
 
   return true;
 }
 
-euler227();
+theChase();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md
index 3ee325d2be7..3bccd240ed2 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md
@@ -1,41 +1,34 @@
 ---
 id: 5900f4511000cf542c50ff63
 title: 'Problem 228: Minkowski Sums'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301871
 dashedName: problem-228-minkowski-sums
 ---
 
 # --description--
 
-<!-- TODO Use MathJax and re-write from projecteuler.net -->
+Let $S_n$ be the regular $n$-sided polygon – or shape – whose vertices $v_k (k = 1, 2, \ldots, n)$ have coordinates:
 
-Let Sn be the regular n-sided polygon – or shape – whose vertices
+$$\begin{align}   & x_k = cos(\frac{2k - 1}{n} × 180°) \\\\
+  & y_k = sin(\frac{2k - 1}{n} × 180°) \end{align}$$
 
-vk (k = 1,2,…,n) have coordinates:
+Each $S_n$ is to be interpreted as a filled shape consisting of all points on the perimeter and in the interior.
 
-xk = cos( 2k-1/n ×180° )
+The Minkowski sum, $S + T$, of two shapes $S$ and $T$ is the result of adding every point in $S$ to every point in $T$, where point addition is performed coordinate-wise: $(u, v) + (x, y) = (u + x, v + y)$.
 
-yk = sin( 2k-1/n ×180° )
+For example, the sum of $S_3$ and $S_4$ is the six-sided shape shown in pink below:
 
-Each Sn is to be interpreted as a filled shape consisting of all points on the perimeter and in the interior.
+<img class="img-responsive center-block" alt="image showing S_3, S_4 and S_3 + S_4" src="https://cdn.freecodecamp.org/curriculum/project-euler/minkowski-sums.png" style="background-color: white; padding: 10px;" />
 
-The Minkowski sum, S+T, of two shapes S and T is the result of
-
-adding every point in S to every point in T, where point addition is performed coordinate-wise:
-
-(u, v) + (x, y) = (u+x, v+y).
-
-For example, the sum of S3 and S4 is the six-sided shape shown in pink below:
-
-How many sides does S1864 + S1865 + … + S1909 have?
+How many sides does $S_{1864} + S_{1865} + \ldots + S_{1909}$ have?
 
 # --hints--
 
-`euler228()` should return 86226.
+`minkowskiSums()` should return `86226`.
 
 ```js
-assert.strictEqual(euler228(), 86226);
+assert.strictEqual(minkowskiSums(), 86226);
 ```
 
 # --seed--
@@ -43,12 +36,12 @@ assert.strictEqual(euler228(), 86226);
 ## --seed-contents--
 
 ```js
-function euler228() {
+function minkowskiSums() {
 
   return true;
 }
 
-euler228();
+minkowskiSums();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md
index 0431ab815bd..3903d30320f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4521000cf542c50ff64
 title: 'Problem 229: Four Representations using Squares'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301872
 dashedName: problem-229-four-representations-using-squares
 ---
@@ -10,26 +10,30 @@ dashedName: problem-229-four-representations-using-squares
 
 Consider the number 3600. It is very special, because
 
-3600 = 482 + 362 3600 = 202 + 2×402 3600 = 302 + 3×302 3600 = 452 + 7×152
+$$\begin{align}   & 3600 = {48}^2 + {36}^2   \\\\
+  & 3600 = {20}^2 + {2×40}^2 \\\\   & 3600 = {30}^2 + {3×30}^2 \\\\
+  & 3600 = {45}^2 + {7×15}^2 \\\\ \end{align}$$
 
-Similarly, we find that 88201 = 992 + 2802 = 2872 + 2×542 = 2832 + 3×522 = 1972 + 7×842.
+Similarly, we find that $88201 = {99}^2 + {280}^2 = {287}^2 + 2 × {54}^2 = {283}^2 + 3 × {52}^2 = {197}^2 + 7 × {84}^2$.
 
-In 1747, Euler proved which numbers are representable as a sum of two squares. We are interested in the numbers n which admit representations of all of the following four types:
+In 1747, Euler proved which numbers are representable as a sum of two squares. We are interested in the numbers $n$ which admit representations of all of the following four types:
 
-n = a12 + b12n = a22 + 2 b22n = a32 + 3 b32n = a72 + 7 b72,
+$$\begin{align}   & n = {a_1}^2 + {b_1}^2  \\\\
+  & n = {a_2}^2 + 2{b_2}^2 \\\\   & n = {a_3}^2 + 3{b_3}^2 \\\\
+  & n = {a_7}^2 + 7{b_7}^2 \\\\ \end{align}$$
 
-where the ak and bk are positive integers.
+where the $a_k$ and $b_k$ are positive integers.
 
-There are 75373 such numbers that do not exceed 107.
+There are 75373 such numbers that do not exceed ${10}^7$.
 
-How many such numbers are there that do not exceed 2×109?
+How many such numbers are there that do not exceed $2 × {10}^9$?
 
 # --hints--
 
-`euler229()` should return 11325263.
+`representationsUsingSquares()` should return `11325263`.
 
 ```js
-assert.strictEqual(euler229(), 11325263);
+assert.strictEqual(representationsUsingSquares(), 11325263);
 ```
 
 # --seed--
@@ -37,12 +41,12 @@ assert.strictEqual(euler229(), 11325263);
 ## --seed-contents--
 
 ```js
-function euler229() {
+function representationsUsingSquares() {
 
   return true;
 }
 
-euler229();
+representationsUsingSquares();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-23-non-abundant-sums.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-23-non-abundant-sums.md
index ce8b2262e4a..cc7079af8c4 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-23-non-abundant-sums.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-23-non-abundant-sums.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3831000cf542c50fe96
 title: 'Problem 23: Non-abundant sums'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301873
 dashedName: problem-23-non-abundant-sums
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md
index 16ea3131991..bc6cd70f1cc 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md
@@ -1,39 +1,47 @@
 ---
 id: 5900f4531000cf542c50ff65
 title: 'Problem 230: Fibonacci Words'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301874
 dashedName: problem-230-fibonacci-words
 ---
 
 # --description--
 
-For any two strings of digits, A and B, we define FA,B to be the sequence (A,B,AB,BAB,ABBAB,...) in which each term is the concatenation of the previous two.
+For any two strings of digits, $A$ and $B$, we define $F_{A,B}$ to be the sequence ($A, B, AB, BAB, ABBAB, \ldots$) in which each term is the concatenation of the previous two.
 
-Further, we define DA,B(n) to be the nth digit in the first term of FA,B that contains at least n digits.
+Further, we define $D_{A,B}(n)$ to be the $n^{\text{th}}$ digit in the first term of $F_{A,B}$ that contains at least $n$ digits.
 
 Example:
 
-Let A=1415926535, B=8979323846. We wish to find DA,B(35), say.
+Let $A = 1\\,415\\,926\\,535$, $B = 8\\,979\\,323\\,846$. We wish to find $D_{A,B}(35)$, say.
 
-The first few terms of FA,B are: 1415926535 8979323846 14159265358979323846 897932384614159265358979323846 14159265358979323846897932384614159265358979323846
+The first few terms of $F_{A,B}$ are:
 
-Then DA,B(35) is the 35th digit in the fifth term, which is 9.
+$$\begin{align}   & 1\\,415\\,926\\,535 \\\\
+  & 8\\,979\\,323\\,846 \\\\   & 14\\,159\\,265\\,358\\,979\\,323\\,846 \\\\
+  & 897\\,932\\,384\\,614\\,159\\,265\\,358\\,979\\,323\\,846 \\\\ & 14\\,159\\,265\\,358\\,979\\,323\\,846\\,897\\,932\\,384\\,614\\,15\color{red}{9}\\,265\\,358\\,979\\,323\\,846 \end{align}$$
 
-Now we use for A the first 100 digits of π behind the decimal point: 14159265358979323846264338327950288419716939937510 58209749445923078164062862089986280348253421170679
+Then $D_{A,B}(35)$ is the ${35}^{\text{th}}$ digit in the fifth term, which is 9.
 
-and for B the next hundred digits:
+Now we use for $A$ the first 100 digits of $π$ behind the decimal point:
 
-82148086513282306647093844609550582231725359408128 48111745028410270193852110555964462294895493038196 .
+$$\begin{align}   & 14\\,159\\,265\\,358\\,979\\,323\\,846\\,264\\,338\\,327\\,950\\,288\\,419\\,716\\,939\\,937\\,510 \\\\
+  & 58\\,209\\,749\\,445\\,923\\,078\\,164\\,062\\,862\\,089\\,986\\,280\\,348\\,253\\,421\\,170\\,679 \end{align}$$
 
-Find ∑n = 0,1,...,17 10n× DA,B((127+19n)×7n) .
+and for $B$ the next hundred digits:
+
+$$\begin{align}   & 82\\,148\\,086\\,513\\,282\\,306\\,647\\,093\\,844\\,609\\,550\\,582\\,231\\,725\\,359\\,408\\,128 \\\\
+  & 48\\,111\\,745\\,028\\,410\\,270\\,193\\,852\\,110\\,555\\,964\\,462\\,294\\,895\\,493\\,038\\,196 \end{align}$$
+
+Find $\sum_{n = 0, 1, \ldots, 17} {10}^n × D_{A,B}((127 + 19n) × 7^n)$.
 
 # --hints--
 
-`euler230()` should return 850481152593119200.
+`fibonacciWords()` should return `850481152593119200`.
 
 ```js
-assert.strictEqual(euler230(), 850481152593119200);
+assert.strictEqual(fibonacciWords(), 850481152593119200);
 ```
 
 # --seed--
@@ -41,12 +49,12 @@ assert.strictEqual(euler230(), 850481152593119200);
 ## --seed-contents--
 
 ```js
-function euler230() {
+function fibonacciWords() {
 
   return true;
 }
 
-euler230();
+fibonacciWords();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md
index c313225c729..498810cf48c 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4531000cf542c50ff66
 title: 'Problem 231: The prime factorisation of binomial coefficients'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301875
 dashedName: problem-231-the-prime-factorisation-of-binomial-coefficients
 ---
 
 # --description--
 
-The binomial coefficient 10C3 = 120.
+The binomial coefficient $\displaystyle\binom{10}{3} = 120$.
 
-120 = 23 × 3 × 5 = 2 × 2 × 2 × 3 × 5, and 2 + 2 + 2 + 3 + 5 = 14.
+$120 = 2^3 × 3 × 5 = 2 × 2 × 2 × 3 × 5$, and $2 + 2 + 2 + 3 + 5 = 14$.
 
-So the sum of the terms in the prime factorisation of 10C3 is 14.
+So the sum of the terms in the prime factorisation of $\displaystyle\binom{10}{3}$ is $14$.
 
-Find the sum of the terms in the prime factorisation of 20000000C15000000.
+Find the sum of the terms in the prime factorisation of $\binom{20\\,000\\,000}{15\\,000\\,000}$.
 
 # --hints--
 
-`euler231()` should return 7526965179680.
+`primeFactorisation()` should return `7526965179680`.
 
 ```js
-assert.strictEqual(euler231(), 7526965179680);
+assert.strictEqual(primeFactorisation(), 7526965179680);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler231(), 7526965179680);
 ## --seed-contents--
 
 ```js
-function euler231() {
+function primeFactorisation() {
 
   return true;
 }
 
-euler231();
+primeFactorisation();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-232-the-race.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-232-the-race.md
index c109669bd8a..c03c0d687b3 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-232-the-race.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-232-the-race.md
@@ -1,16 +1,22 @@
 ---
 id: 5900f4551000cf542c50ff67
 title: 'Problem 232: The Race'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301876
 dashedName: problem-232-the-race
 ---
 
 # --description--
 
-Two players share an unbiased coin and take it in turns to play "The Race". On Player 1's turn, he tosses the coin once: if it comes up Heads, he scores one point; if it comes up Tails, he scores nothing. On Player 2's turn, she chooses a positive integer T and tosses the coin T times: if it comes up all Heads, she scores 2T-1 points; otherwise, she scores nothing. Player 1 goes first. The winner is the first to 100 or more points.
+Two players share an unbiased coin and take it in turns to play "The Race".
 
-On each turn Player 2 selects the number, T, of coin tosses that maximises the probability of her winning.
+On Player 1's turn, he tosses the coin once: if it comes up Heads, he scores one point; if it comes up Tails, he scores nothing.
+
+On Player 2's turn, she chooses a positive integer $T$ and tosses the coin $T$ times: if it comes up all Heads, she scores $2^{T - 1}$ points; otherwise, she scores nothing.
+
+Player 1 goes first. The winner is the first to 100 or more points.
+
+On each turn Player 2 selects the number, $T$, of coin tosses that maximises the probability of her winning.
 
 What is the probability that Player 2 wins?
 
@@ -18,10 +24,10 @@ Give your answer rounded to eight decimal places in the form 0.abcdefgh .
 
 # --hints--
 
-`euler232()` should return 0.83648556.
+`theRace()` should return `0.83648556`.
 
 ```js
-assert.strictEqual(euler232(), 0.83648556);
+assert.strictEqual(theRace(), 0.83648556);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler232(), 0.83648556);
 ## --seed-contents--
 
 ```js
-function euler232() {
+function theRace() {
 
   return true;
 }
 
-euler232();
+theRace();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.md
index 5903d7e8c95..db650947233 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4551000cf542c50ff68
 title: 'Problem 233: Lattice points on a circle'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301877
 dashedName: problem-233-lattice-points-on-a-circle
 ---
 
 # --description--
 
-Let f(N) be the number of points with integer coordinates that are on a circle passing through (0,0), (N,0),(0,N), and (N,N).
+Let $f(N)$ be the number of points with integer coordinates that are on a circle passing through $(0,0)$, $(N,0)$,$(0,N)$, and $(N,N)$.
 
-It can be shown that f(10000) = 36.
+It can be shown that $f(10000) = 36$.
 
-What is the sum of all positive integers N ≤ 1011 such that f(N) = 420 ?
+What is the sum of all positive integers $N ≤ {10}^{11}$ such that $f(N) = 420$?
 
 # --hints--
 
-`euler233()` should return 271204031455541300.
+`latticePointsOnACircle()` should return `271204031455541300`.
 
 ```js
-assert.strictEqual(euler233(), 271204031455541300);
+assert.strictEqual(latticePointsOnACircle(), 271204031455541300);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler233(), 271204031455541300);
 ## --seed-contents--
 
 ```js
-function euler233() {
+function latticePointsOnACircle() {
 
   return true;
 }
 
-euler233();
+latticePointsOnACircle();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.md
index edf39ca239d..ec01ca36a28 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f4571000cf542c50ff69
 title: 'Problem 234: Semidivisible numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301878
 dashedName: problem-234-semidivisible-numbers
 ---
 
 # --description--
 
-For an integer n ≥ 4, we define the lower prime square root of n, denoted by lps(n), as the largest prime ≤ √n and the upper prime square root of n, ups(n), as the smallest prime ≥ √n.
+For an integer $n ≥ 4$, we define the lower prime square root of $n$, denoted by $lps(n)$, as the $\text{largest prime} ≤ \sqrt{n}$ and the upper prime square root of $n$, $ups(n)$, as the $\text{smallest prime} ≥ \sqrt{n}$.
 
-So, for example, lps(4) = 2 = ups(4), lps(1000) = 31, ups(1000) = 37.
+So, for example, $lps(4) = 2 = ups(4)$, $lps(1000) = 31$, $ups(1000) = 37$.
 
-Let us call an integer n ≥ 4 semidivisible, if one of lps(n) and ups(n) divides n, but not both.
+Let us call an integer $n ≥ 4$ semidivisible, if one of $lps(n)$ and $ups(n)$ divides $n$, but not both.
 
-The sum of the semidivisible numbers not exceeding 15 is 30, the numbers are 8, 10 and 12. 15 is not semidivisible because it is a multiple of both lps(15) = 3 and ups(15) = 5. As a further example, the sum of the 92 semidivisible numbers up to 1000 is 34825.
+The sum of the semidivisible numbers not exceeding 15 is 30, the numbers are 8, 10 and 12. 15 is not semidivisible because it is a multiple of both $lps(15) = 3$ and $ups(15) = 5$. As a further example, the sum of the 92 semidivisible numbers up to 1000 is 34825.
 
-What is the sum of all semidivisible numbers not exceeding 999966663333 ?
+What is the sum of all semidivisible numbers not exceeding 999966663333?
 
 # --hints--
 
-`euler234()` should return 1259187438574927000.
+`semidivisibleNumbers()` should return `1259187438574927000`.
 
 ```js
-assert.strictEqual(euler234(), 1259187438574927000);
+assert.strictEqual(semidivisibleNumbers(), 1259187438574927000);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler234(), 1259187438574927000);
 ## --seed-contents--
 
 ```js
-function euler234() {
+function semidivisibleNumbers() {
 
   return true;
 }
 
-euler234();
+semidivisibleNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.md
index 549fc0275de..6a58db5a83f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4571000cf542c50ff6a
-title: 'Problem 235: An Arithmetic Geometric sequence'
-challengeType: 5
+title: '問題 235：算術幾何序列'
+challengeType: 1
 forumTopicId: 301879
 dashedName: problem-235-an-arithmetic-geometric-sequence
 ---
 
 # --description--
 
-Given is the arithmetic-geometric sequence u(k) = (900-3k)rk-1.
+Given is the arithmetic-geometric sequence $u(k) = (900 - 3k)r^{k - 1}$.
 
-Let s(n) = Σk=1...nu(k).
+Let $s(n) = \sum_{k=1 \ldots n} u(k)$.
 
-Find the value of r for which s(5000) = -600,000,000,000.
+Find the value of $r$ for which $s(5000) = -600\\,000\\,000\\,000$.
 
 Give your answer rounded to 12 places behind the decimal point.
 
 # --hints--
 
-`euler235()` should return 1.002322108633.
+`arithmeticGeometricSequence()` should return `1.002322108633`.
 
 ```js
-assert.strictEqual(euler235(), 1.002322108633);
+assert.strictEqual(arithmeticGeometricSequence(), 1.002322108633);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler235(), 1.002322108633);
 ## --seed-contents--
 
 ```js
-function euler235() {
+function arithmeticGeometricSequence() {
 
   return true;
 }
 
-euler235();
+arithmeticGeometricSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md
index 01c7effbc3e..2ae12a0ab04 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4591000cf542c50ff6b
 title: 'Problem 236: Luxury Hampers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301881
 dashedName: problem-236-luxury-hampers
 ---
@@ -10,22 +10,39 @@ dashedName: problem-236-luxury-hampers
 
 Suppliers 'A' and 'B' provided the following numbers of products for the luxury hamper market:
 
-Product'A''B'Beluga Caviar5248640Christmas Cake13121888Gammon Joint26243776Vintage Port57603776Champagne Truffles39365664
+| Product            | 'A'  | 'B'  |
+| ------------------ | ---- | ---- |
+| Beluga Caviar      | 5248 | 640  |
+| Christmas Cake     | 1312 | 1888 |
+| Gammon Joint       | 2624 | 3776 |
+| Vintage Port       | 5760 | 3776 |
+| Champagne Truffles | 3936 | 5664 |
 
 Although the suppliers try very hard to ship their goods in perfect condition, there is inevitably some spoilage - i.e. products gone bad.
 
-The suppliers compare their performance using two types of statistic:The five per-product spoilage rates for each supplier are equal to the number of products gone bad divided by the number of products supplied, for each of the five products in turn. The overall spoilage rate for each supplier is equal to the total number of products gone bad divided by the total number of products provided by that supplier.To their surprise, the suppliers found that each of the five per-product spoilage rates was worse (higher) for 'B' than for 'A' by the same factor (ratio of spoilage rates), m>1; and yet, paradoxically, the overall spoilage rate was worse for 'A' than for 'B', also by a factor of m.
+The suppliers compare their performance using two types of statistic:
 
-There are thirty-five m>1 for which this surprising result could have occurred, the smallest of which is 1476/1475.
+- The five per-product spoilage rates for each supplier are equal to the number of products gone bad divided by the number of products supplied, for each of the five products in turn.
+- The overall spoilage rate for each supplier is equal to the total number of products gone bad divided by the total number of products provided by that supplier.
 
-What's the largest possible value of m? Give your answer as a fraction reduced to its lowest terms, in the form u/v.
+To their surprise, the suppliers found that each of the five per-product spoilage rates was worse (higher) for 'B' than for 'A' by the same factor (ratio of spoilage rates), $m > 1$; and yet, paradoxically, the overall spoilage rate was worse for 'A' than for 'B', also by a factor of $m$.
+
+There are thirty-five $m > 1$ for which this surprising result could have occurred, the smallest of which is $\frac{1476}{1475}$.
+
+What's the largest possible value of $m$? Give your answer as a string with fraction reduced to its lowest terms, in the form `u/v`.
 
 # --hints--
 
-`euler236()` should return 123 / 59.
+`luxuryHampers()` should return a string.
 
 ```js
-assert.strictEqual(euler236(), 123 / 59);
+assert(typeof luxuryHampers() === 'string');
+```
+
+`luxuryHampers()` should return the string `123/59`.
+
+```js
+assert.strictEqual(luxuryHampers(), '123/59');
 ```
 
 # --seed--
@@ -33,12 +50,12 @@ assert.strictEqual(euler236(), 123 / 59);
 ## --seed-contents--
 
 ```js
-function euler236() {
+function luxuryHampers() {
 
   return true;
 }
 
-euler236();
+luxuryHampers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md
index eec1076ec10..ef7c2a30c04 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md
@@ -1,33 +1,32 @@
 ---
 id: 5900f4591000cf542c50ff6c
 title: 'Problem 237: Tours on a 4 x n playing board'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301882
 dashedName: problem-237-tours-on-a-4-x-n-playing-board
 ---
 
 # --description--
 
-Let T(n) be the number of tours over a 4 × n playing board such that:
+Let $T(n)$ be the number of tours over a 4 × $n$ playing board such that:
 
-The tour starts in the top left corner.
-
-The tour consists of moves that are up, down, left, or right one square.
-
-The tour visits each square exactly once.
-
-The tour ends in the bottom left corner.
+- The tour starts in the top left corner.
+- The tour consists of moves that are up, down, left, or right one square.
+- The tour visits each square exactly once.
+- The tour ends in the bottom left corner.
 
 The diagram shows one tour over a 4 × 10 board:
 
-T(10) is 2329. What is T(1012) modulo 108?
+<img class="img-responsive center-block" alt="one tour over 4 x 10 board" src="https://cdn.freecodecamp.org/curriculum/project-euler/tours-on-a-4-x-n-playing-board.gif" style="background-color: white; padding: 10px;" />
+
+$T(10)$ is 2329. What is $T({10}^{12})$ modulo ${10}^8$?
 
 # --hints--
 
-`euler237()` should return 15836928.
+`toursOnPlayingBoard()` should return `15836928`.
 
 ```js
-assert.strictEqual(euler237(), 15836928);
+assert.strictEqual(toursOnPlayingBoard(), 15836928);
 ```
 
 # --seed--
@@ -35,12 +34,12 @@ assert.strictEqual(euler237(), 15836928);
 ## --seed-contents--
 
 ```js
-function euler237() {
+function toursOnPlayingBoard() {
 
   return true;
 }
 
-euler237();
+toursOnPlayingBoard();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md
index 4bb75276865..b617c60d1dd 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f45b1000cf542c50ff6d
 title: 'Problem 238: Infinite string tour'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301883
 dashedName: problem-238-infinite-string-tour
 ---
@@ -10,32 +10,33 @@ dashedName: problem-238-infinite-string-tour
 
 Create a sequence of numbers using the "Blum Blum Shub" pseudo-random number generator:
 
-s0 = 14025256 sn+1 = sn2 mod 20300713
+$$ s_0 = 14025256 \\\\
+s_{n + 1} = {s_n}^2 \\; mod \\; 20\\,300\\,713 $$
 
-Concatenate these numbers s0s1s2… to create a string w of infinite length. Then, w = 14025256741014958470038053646…
+Concatenate these numbers $s_0s_1s_2\ldots$ to create a string $w$ of infinite length. Then, $w = 14025256741014958470038053646\ldots$
 
-For a positive integer k, if no substring of w exists with a sum of digits equal to k, p(k) is defined to be zero. If at least one substring of w exists with a sum of digits equal to k, we define p(k) = z, where z is the starting position of the earliest such substring.
+For a positive integer $k$, if no substring of $w$ exists with a sum of digits equal to $k$, $p(k)$ is defined to be zero. If at least one substring of $w$ exists with a sum of digits equal to $k$, we define $p(k) = z$, where $z$ is the starting position of the earliest such substring.
 
-For instance:
+例如：
 
-The substrings 1, 14, 1402, … with respective sums of digits equal to 1, 5, 7, … start at position 1, hence p(1) = p(5) = p(7) = … = 1.
+The substrings 1, 14, 1402, … with respective sums of digits equal to 1, 5, 7, … start at position 1, hence $p(1) = p(5) = p(7) = \ldots = 1$.
 
-The substrings 4, 402, 4025, … with respective sums of digits equal to 4, 6, 11, … start at position 2, hence p(4) = p(6) = p(11) = … = 2.
+The substrings 4, 402, 4025, … with respective sums of digits equal to 4, 6, 11, … start at position 2, hence $p(4) = p(6) = p(11) = \ldots = 2$.
 
-The substrings 02, 0252, … with respective sums of digits equal to 2, 9, … start at position 3, hence p(2) = p(9) = … = 3.
+The substrings 02, 0252, … with respective sums of digits equal to 2, 9, … start at position 3, hence $p(2) = p(9) = \ldots = 3$.
 
-Note that substring 025 starting at position 3, has a sum of digits equal to 7, but there was an earlier substring (starting at position 1) with a sum of digits equal to 7, so p(7) = 1, not 3.
+Note that substring 025 starting at position 3, has a sum of digits equal to 7, but there was an earlier substring (starting at position 1) with a sum of digits equal to 7, so $p(7) = 1$, not 3.
 
-We can verify that, for 0 &lt; k ≤ 103, ∑ p(k) = 4742.
+We can verify that, for $0 &lt; k ≤ {10}^3$, $\sum p(k) = 4742$.
 
-Find ∑ p(k), for 0 &lt; k ≤ 2·1015.
+Find $\sum p(k)$, for $0 &lt; k ≤ 2 \times {10}^{15}$.
 
 # --hints--
 
-`euler238()` should return 9922545104535660.
+`infiniteStringTour()` should return `9922545104535660`.
 
 ```js
-assert.strictEqual(euler238(), 9922545104535660);
+assert.strictEqual(infiniteStringTour(), 9922545104535660);
 ```
 
 # --seed--
@@ -43,12 +44,12 @@ assert.strictEqual(euler238(), 9922545104535660);
 ## --seed-contents--
 
 ```js
-function euler238() {
+function infiniteStringTour() {
 
   return true;
 }
 
-euler238();
+infiniteStringTour();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.md
index b68783fecf6..9fff8274ba8 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f45c1000cf542c50ff6e
 title: 'Problem 239: Twenty-two Foolish Primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301884
 dashedName: problem-239-twenty-two-foolish-primes
 ---
@@ -16,10 +16,10 @@ Give your answer rounded to 12 places behind the decimal point in the form 0.abc
 
 # --hints--
 
-`euler239()` should return 0.001887854841.
+`twentyTwoFoolishPrimes()` should return `0.001887854841`.
 
 ```js
-assert.strictEqual(euler239(), 0.001887854841);
+assert.strictEqual(twentyTwoFoolishPrimes(), 0.001887854841);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler239(), 0.001887854841);
 ## --seed-contents--
 
 ```js
-function euler239() {
+function twentyTwoFoolishPrimes() {
 
   return true;
 }
 
-euler239();
+twentyTwoFoolishPrimes();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.md
index 49998335d2e..91572e2dd40 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3841000cf542c50fe97
 title: 'Problem 24: Lexicographic permutations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301885
 dashedName: problem-24-lexicographic-permutations
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-240-top-dice.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-240-top-dice.md
index 392edfa3dda..97f89f17305 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-240-top-dice.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-240-top-dice.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f45d1000cf542c50ff6f
 title: 'Problem 240: Top Dice'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301887
 dashedName: problem-240-top-dice
 ---
@@ -10,22 +10,18 @@ dashedName: problem-240-top-dice
 
 There are 1111 ways in which five 6-sided dice (sides numbered 1 to 6) can be rolled so that the top three sum to 15. Some examples are:
 
-D1,D2,D3,D4,D5 = 4,3,6,3,5
-
-D1,D2,D3,D4,D5 = 4,3,3,5,6
-
-D1,D2,D3,D4,D5 = 3,3,3,6,6
-
-D1,D2,D3,D4,D5 = 6,6,3,3,3
+$$\begin{align}   & D_1,D_2,D_3,D_4,D_5 = 4,3,6,3,5 \\\\
+  & D_1,D_2,D_3,D_4,D_5 = 4,3,3,5,6 \\\\   & D_1,D_2,D_3,D_4,D_5 = 3,3,3,6,6 \\\\
+  & D_1,D_2,D_3,D_4,D_5 = 6,6,3,3,3 \end{align}$$
 
 In how many ways can twenty 12-sided dice (sides numbered 1 to 12) be rolled so that the top ten sum to 70?
 
 # --hints--
 
-`euler240()` should return 7448717393364182000.
+`topDice()` should return `7448717393364182000`.
 
 ```js
-assert.strictEqual(euler240(), 7448717393364182000);
+assert.strictEqual(topDice(), 7448717393364182000);
 ```
 
 # --seed--
@@ -33,12 +29,12 @@ assert.strictEqual(euler240(), 7448717393364182000);
 ## --seed-contents--
 
 ```js
-function euler240() {
+function topDice() {
 
   return true;
 }
 
-euler240();
+topDice();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-241-perfection-quotients.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-241-perfection-quotients.md
index b80b7872cb4..492d3f61f8e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-241-perfection-quotients.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-241-perfection-quotients.md
@@ -1,25 +1,27 @@
 ---
 id: 5900f45d1000cf542c50ff70
 title: 'Problem 241: Perfection Quotients'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301888
 dashedName: problem-241-perfection-quotients
 ---
 
 # --description--
 
-For a positive integer n, let σ(n) be the sum of all divisors of n, so e.g. σ(6) = 1 + 2 + 3 + 6 = 12.
+For a positive integer $n$, let $σ(n)$ be the sum of all divisors of $n$, so e.g. $σ(6) = 1 + 2 + 3 + 6 = 12$.
 
-A perfect number, as you probably know, is a number with σ(n) = 2n.
+A perfect number, as you probably know, is a number with $σ(n) = 2n$.
 
-Let us define the perfection quotient of a positive integer asp(n)= σ(n)n . Find the sum of all positive integers n ≤ 1018 for which p(n) has the form k + 1⁄2, where k is an integer.
+Let us define the perfection quotient of a positive integer as $p(n) = \frac{σ(n)}{n}$.
+
+Find the sum of all positive integers $n ≤ {10}^{18}$ for which $p(n)$ has the form $k + \frac{1}{2}$, where $k$ is an integer.
 
 # --hints--
 
-`euler241()` should return 482316491800641150.
+`perfectionQuotients()` should return `482316491800641150`.
 
 ```js
-assert.strictEqual(euler241(), 482316491800641150);
+assert.strictEqual(perfectionQuotients(), 482316491800641150);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler241(), 482316491800641150);
 ## --seed-contents--
 
 ```js
-function euler241() {
+function perfectionQuotients() {
 
   return true;
 }
 
-euler241();
+perfectionQuotients();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-242-odd-triplets.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-242-odd-triplets.md
index c8eb8d360c5..abbcfca2a6a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-242-odd-triplets.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-242-odd-triplets.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f45f1000cf542c50ff71
 title: 'Problem 242: Odd Triplets'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301889
 dashedName: problem-242-odd-triplets
 ---
 
 # --description--
 
-Given the set {1,2,...,n}, we define f(n,k) as the number of its k-element subsets with an odd sum of elements. For example, f(5,3) = 4, since the set {1,2,3,4,5} has four 3-element subsets having an odd sum of elements, i.e.: {1,2,4}, {1,3,5}, {2,3,4} and {2,4,5}.
+Given the set {1,2,..., $n$}, we define $f(n, k)$ as the number of its $k$-element subsets with an odd sum of elements. For example, $f(5,3) = 4$, since the set {1,2,3,4,5} has four 3-element subsets having an odd sum of elements, i.e.: {1,2,4}, {1,3,5}, {2,3,4} and {2,4,5}.
 
-When all three values n, k and f(n,k) are odd, we say that they make an odd-triplet \[n,k,f(n,k)].
+When all three values $n$, $k$ and $f(n, k)$ are odd, we say that they make an odd-triplet $[n, k, f(n, k)]$.
 
-There are exactly five odd-triplets with n ≤ 10, namely: \[1,1,f(1,1) = 1], \[5,1,f(5,1) = 3], \[5,5,f(5,5) = 1], \[9,1,f(9,1) = 5] and \[9,9,f(9,9) = 1].
+There are exactly five odd-triplets with $n ≤ 10$, namely: $[1, 1, f(1, 1) = 1]$, $[5, 1, f(5, 1) = 3]$, $[5, 5, f(5, 5) = 1]$, $[9, 1, f(9, 1) = 5]$ and $[9, 9, f(9, 9) = 1]$.
 
-How many odd-triplets are there with n ≤ 1012 ?
+How many odd-triplets are there with $n ≤ {10}^{12}$?
 
 # --hints--
 
-`euler242()` should return 997104142249036700.
+`oddTriplets()` should return `997104142249036700`.
 
 ```js
-assert.strictEqual(euler242(), 997104142249036700);
+assert.strictEqual(oddTriplets(), 997104142249036700);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler242(), 997104142249036700);
 ## --seed-contents--
 
 ```js
-function euler242() {
+function oddTriplets() {
 
   return true;
 }
 
-euler242();
+oddTriplets();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-243-resilience.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-243-resilience.md
index 54c911233ab..67287eac731 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-243-resilience.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-243-resilience.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4601000cf542c50ff73
 title: 'Problem 243: Resilience'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301890
 dashedName: problem-243-resilience
 ---
@@ -10,18 +10,24 @@ dashedName: problem-243-resilience
 
 A positive fraction whose numerator is less than its denominator is called a proper fraction.
 
-For any denominator, d, there will be d−1 proper fractions; for example, with d = 12:1/12 , 2/12 , 3/12 , 4/12 , 5/12 , 6/12 , 7/12 , 8/12 , 9/12 , 10/12 , 11/12 .
+For any denominator, $d$, there will be $d−1$ proper fractions; for example, with $d = 12$:
 
-We shall call a fraction that cannot be cancelled down a resilient fraction. Furthermore we shall define the resilience of a denominator, R(d), to be the ratio of its proper fractions that are resilient; for example, R(12) = 4/11 . In fact, d = 12 is the smallest denominator having a resilience R(d) &lt; 4/10 .
+$$\frac{1}{12}, \frac{2}{12}, \frac{3}{12}, \frac{4}{12}, \frac{5}{12}, \frac{6}{12}, \frac{7}{12}, \frac{8}{12}, \frac{9}{12}, \frac{10}{12}, \frac{11}{12}$$
 
-Find the smallest denominator d, having a resilience R(d) &lt; 15499/94744 .
+We shall call a fraction that cannot be cancelled down a resilient fraction.
+
+Furthermore we shall define the resilience of a denominator, $R(d)$, to be the ratio of its proper fractions that are resilient; for example, $R(12) = \frac{4}{11}$.
+
+In fact, $d = 12$ is the smallest denominator having a resilience $R(d) &lt; \frac{4}{10}$.
+
+Find the smallest denominator $d$, having a resilience $R(d) &lt; \frac{15\\,499}{94\\,744}$.
 
 # --hints--
 
-`euler243()` should return 892371480.
+`resilience()` should return `892371480`.
 
 ```js
-assert.strictEqual(euler243(), 892371480);
+assert.strictEqual(resilience(), 892371480);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler243(), 892371480);
 ## --seed-contents--
 
 ```js
-function euler243() {
+function resilience() {
 
   return true;
 }
 
-euler243();
+resilience();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-244-sliders.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-244-sliders.md
index dfc2ef5931d..ebe4a76b838 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-244-sliders.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-244-sliders.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4601000cf542c50ff72
 title: 'Problem 244: Sliders'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301891
 dashedName: problem-244-sliders
 ---
@@ -10,28 +10,32 @@ dashedName: problem-244-sliders
 
 You probably know the game Fifteen Puzzle. Here, instead of numbered tiles, we have seven red tiles and eight blue tiles.
 
-A move is denoted by the uppercase initial of the direction (Left, Right, Up, Down) in which the tile is slid, e.g. starting from configuration (S), by the sequence LULUR we reach the configuration (E):
+A move is denoted by the uppercase initial of the direction (Left, Right, Up, Down) in which the tile is slid, e.g. starting from configuration ($S$), by the sequence $LULUR$ we reach the configuration ($E$):
 
-(S), (E)
+($S$) <img class="img-responsive" alt="configuration S" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliders-1.gif" style="display: inline-block; background-color: white; padding: 10px;" />, ($E$) <img class="img-responsive" alt="configuration E" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliders-2.gif" style="display: inline-block; background-color: white; padding: 10px;" />
 
 For each path, its checksum is calculated by (pseudocode):
 
-checksum = 0 checksum = (checksum × 243 + m1) mod 100 000 007 checksum = (checksum × 243 + m2) mod 100 000 007 … checksum = (checksum × 243 + mn) mod 100 000 007 where mk is the ASCII value of the kth letter in the move sequence and the ASCII values for the moves are:
+$$\begin{align}   & \text{checksum} = 0 \\\\
+  & \text{checksum} = (\text{checksum} × 243 + m_1) \\; \text{mod} \\; 100\\,000\\,007 \\\\   & \text{checksum} = (\text{checksum} × 243 + m_2) \\; \text{mod} \\; 100\\,000\\,007 \\\\
+  & \ldots \\\\ & \text{checksum} = (\text{checksum} × 243 + m_n) \\; \text{mod} \\; 100\\,000\\,007 \end{align}$$
 
-L76R82U85D68
+where $m_k$ is the ASCII value of the $k^{\text{th}}$ letter in the move sequence and the ASCII values for the moves are:
 
-For the sequence LULUR given above, the checksum would be 19761398. Now, starting from configuration (S), find all shortest ways to reach configuration (T).
+$$\begin{array}{|c|c|} \hline L & 76 \\\\ \hline R & 82 \\\\ \hline U & 85 \\\\ \hline D & 68 \\\\ \hline \end{array}$$
 
-(S), (T)
+For the sequence $LULUR$ given above, the checksum would be 19761398. Now, starting from configuration ($S$), find all shortest ways to reach configuration ($T$).
+
+($S$) <img class="img-responsive center-block" alt="configuration S" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliders-3.gif" style="display: inline-block; background-color: white; padding: 10px;" />, ($T$) <img class="img-responsive center-block" alt="configuration T" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliders-4.gif" style="display: inline-block; background-color: white; padding: 10px;" />
 
 What is the sum of all checksums for the paths having the minimal length?
 
 # --hints--
 
-`euler244()` should return 96356848.
+`sliders()` should return `96356848`.
 
 ```js
-assert.strictEqual(euler244(), 96356848);
+assert.strictEqual(sliders(), 96356848);
 ```
 
 # --seed--
@@ -39,12 +43,12 @@ assert.strictEqual(euler244(), 96356848);
 ## --seed-contents--
 
 ```js
-function euler244() {
+function sliders() {
 
   return true;
 }
 
-euler244();
+sliders();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-245-coresilience.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-245-coresilience.md
index 47fc69a5fab..c3e090d0edb 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-245-coresilience.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-245-coresilience.md
@@ -1,23 +1,31 @@
 ---
 id: 5900f4621000cf542c50ff74
 title: 'Problem 245: Coresilience'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301892
 dashedName: problem-245-coresilience
 ---
 
 # --description--
 
-We shall call a fraction that cannot be cancelled down a resilient fraction. Furthermore we shall define the resilience of a denominator, R(d), to be the ratio of its proper fractions that are resilient; for example, R(12) = 4⁄11.
+We shall call a fraction that cannot be cancelled down a resilient fraction.
 
-The resilience of a number d > 1 is then φ(d)d − 1 , where φ is Euler's totient function. We further define the coresilience of a number n > 1 as C(n)= n − φ(n)n − 1. The coresilience of a prime p is C(p) = 1p − 1. Find the sum of all composite integers 1 &lt; n ≤ 2×1011, for which C(n) is a unit fraction.
+Furthermore we shall define the resilience of a denominator, $R(d)$, to be the ratio of its proper fractions that are resilient; for example, $R(12) = \frac{4}{11}$.
+
+The resilience of a number $d > 1$ is then $\frac{φ(d)}{d − 1}$ , where $φ$ is Euler's totient function.
+
+We further define the coresilience of a number $n > 1$ as $C(n) = \frac{n − φ(n)}{n − 1}$.
+
+The coresilience of a prime $p$ is $C(p) = \frac{1}{p − 1}$.
+
+Find the sum of all composite integers $1 &lt; n ≤ 2 × {10}^{11}$, for which $C(n)$ is a unit fraction.
 
 # --hints--
 
-`euler245()` should return 288084712410001.
+`coresilience()` should return `288084712410001`.
 
 ```js
-assert.strictEqual(euler245(), 288084712410001);
+assert.strictEqual(coresilience(), 288084712410001);
 ```
 
 # --seed--
@@ -25,12 +33,12 @@ assert.strictEqual(euler245(), 288084712410001);
 ## --seed-contents--
 
 ```js
-function euler245() {
+function coresilience() {
 
   return true;
 }
 
-euler245();
+coresilience();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md
index 2d50a2e979d..c981db403c7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4621000cf542c50ff75
-title: 'Problem 246: Tangents to an ellipse'
-challengeType: 5
+title: '問題 246：橢圓的切線'
+challengeType: 1
 forumTopicId: 301893
 dashedName: problem-246-tangents-to-an-ellipse
 ---
@@ -10,20 +10,32 @@ dashedName: problem-246-tangents-to-an-ellipse
 
 A definition for an ellipse is:
 
-Given a circle c with centre M and radius r and a point G such that d(G,M)
+Given a circle $c$ with centre $M$ and radius $r$ and a point $G$ such that $d(G, M) < r$, the locus of the points that are equidistant from $c$ and $G$ form an ellipse.
 
 The construction of the points of the ellipse is shown below.
 
-Given are the points M(-2000,1500) and G(8000,1500). Given is also the circle c with centre M and radius 15000. The locus of the points that are equidistant from G and c form an ellipse e. From a point P outside e the two tangents t1 and t2 to the ellipse are drawn. Let the points where t1 and t2 touch the ellipse be R and S.
+<img class="img-responsive center-block" alt="animation of ellipse construction" src="https://cdn.freecodecamp.org/curriculum/project-euler/tangents-to-an-ellipse-1.gif" style="background-color: white; padding: 10px;" />
 
-For how many lattice points P is angle RPS greater than 45 degrees?
+Given are the points $M(-2000, 1500)$ and $G(8000, 1500)$.
+
+Given is also the circle $c$ with centre $M$ and radius $15\\,000$.
+
+The locus of the points that are equidistant from $G$ and $c$ form an ellipse $e$.
+
+From a point $P$ outside $e$ the two tangents $t_1$ and $t_2$ to the ellipse are drawn.
+
+Let the points where $t_1$ and $t_2$ touch the ellipse be $R$ and $S$.
+
+<img class="img-responsive center-block" alt="circle c with the centre M, radius 15000, and point P outsie of ellipse e; from point P two tangents t_1 and t_2 are drawn to the ellipse, with points touching ellipse are R and S" src="https://cdn.freecodecamp.org/curriculum/project-euler/tangents-to-an-ellipse-2.gif" style="background-color: white; padding: 10px;" />
+
+For how many lattice points $P$ is angle $RPS$ greater than 45°?
 
 # --hints--
 
-`euler246()` should return 810834388.
+`tangentsToAnEllipse()` should return `810834388`.
 
 ```js
-assert.strictEqual(euler246(), 810834388);
+assert.strictEqual(tangentsToAnEllipse(), 810834388);
 ```
 
 # --seed--
@@ -31,12 +43,12 @@ assert.strictEqual(euler246(), 810834388);
 ## --seed-contents--
 
 ```js
-function euler246() {
+function tangentsToAnEllipse() {
 
   return true;
 }
 
-euler246();
+tangentsToAnEllipse();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md
index d9a5572eeac..d84036f8701 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md
@@ -1,27 +1,39 @@
 ---
 id: 5900f4641000cf542c50ff76
 title: 'Problem 247: Squares under a hyperbola'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301894
 dashedName: problem-247-squares-under-a-hyperbola
 ---
 
 # --description--
 
-Consider the region constrained by 1 ≤ x and 0 ≤ y ≤ 1/x.
+Consider the region constrained by $1 ≤ x$ and $0 ≤ y ≤ \frac{1}{x}$.
 
-Let S1 be the largest square that can fit under the curve. Let S2 be the largest square that fits in the remaining area, and so on. Let the index of Sn be the pair (left, below) indicating the number of squares to the left of Sn and the number of squares below Sn.
+Let $S_1$ be the largest square that can fit under the curve.
 
-The diagram shows some such squares labelled by number. S2 has one square to its left and none below, so the index of S2 is (1,0). It can be seen that the index of S32 is (1,1) as is the index of S50. 50 is the largest n for which the index of Sn is (1,1).
+Let $S_2$ be the largest square that fits in the remaining area, and so on.
 
-What is the largest n for which the index of Sn is (3,3)?
+Let the index of $S_n$ be the pair (left, below) indicating the number of squares to the left of $S_n$ and the number of squares below $S_n$.
+
+<img class="img-responsive center-block" alt="diagram with squares under the hyperbola" src="https://cdn.freecodecamp.org/curriculum/project-euler/squares-under-a-hyperbola.gif" style="background-color: white; padding: 10px;" />
+
+The diagram shows some such squares labelled by number.
+
+$S_2$ has one square to its left and none below, so the index of $S_2$ is (1, 0).
+
+It can be seen that the index of $S_{32}$ is (1,1) as is the index of $S_{50}$.
+
+50 is the largest $n$ for which the index of $S_n$ is (1, 1).
+
+What is the largest $n$ for which the index of $S_n$ is (3, 3)?
 
 # --hints--
 
-`euler247()` should return 782252.
+`squaresUnderAHyperbola()` should return `782252`.
 
 ```js
-assert.strictEqual(euler247(), 782252);
+assert.strictEqual(squaresUnderAHyperbola(), 782252);
 ```
 
 # --seed--
@@ -29,12 +41,12 @@ assert.strictEqual(euler247(), 782252);
 ## --seed-contents--
 
 ```js
-function euler247() {
+function squaresUnderAHyperbola() {
 
   return true;
 }
 
-euler247();
+squaresUnderAHyperbola();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md
index 1641fd73a25..0df6dd5226a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md
@@ -1,23 +1,23 @@
 ---
 id: 5900f4651000cf542c50ff77
 title: 'Problem 248: Numbers for which Euler’s totient function equals 13!'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301895
 dashedName: problem-248-numbers-for-which-eulers-totient-function-equals-13
 ---
 
 # --description--
 
-The first number n for which φ(n)=13! is 6227180929.
+The first number $n$ for which $φ(n) = 13!$ is $6\\,227\\,180\\,929$.
 
-Find the 150,000th such number.
+Find the ${150\\,000}^{\text{th}}$ such number.
 
 # --hints--
 
-`euler248()` should return 23507044290.
+`eulersTotientFunctionEquals()` should return `23507044290`.
 
 ```js
-assert.strictEqual(euler248(), 23507044290);
+assert.strictEqual(eulersTotientFunctionEquals(), 23507044290);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler248(), 23507044290);
 ## --seed-contents--
 
 ```js
-function euler248() {
+function eulersTotientFunctionEquals() {
 
   return true;
 }
 
-euler248();
+eulersTotientFunctionEquals();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md
index 71c8d1da197..236e690cc81 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4671000cf542c50ff79
 title: 'Problem 249: Prime Subset Sums'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301896
 dashedName: problem-249-prime-subset-sums
 ---
 
 # --description--
 
-Let S = {2, 3, 5, ..., 4999} be the set of prime numbers less than 5000.
+Let $S = \\{2, 3, 5, \ldots, 4999\\}$ be the set of prime numbers less than 5000.
 
-Find the number of subsets of S, the sum of whose elements is a prime number.
+Find the number of subsets of $S$, the sum of whose elements is a prime number.
 
-Enter the rightmost 16 digits as your answer.
+輸入最右邊的 16 位數字作爲答案。
 
 # --hints--
 
-`euler249()` should return 9275262564250418.
+`primeSubsetSums()` should return `9275262564250418`.
 
 ```js
-assert.strictEqual(euler249(), 9275262564250418);
+assert.strictEqual(primeSubsetSums(), 9275262564250418);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler249(), 9275262564250418);
 ## --seed-contents--
 
 ```js
-function euler249() {
+function primeSubsetSums() {
 
   return true;
 }
 
-euler249();
+primeSubsetSums();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number.md
index ca7d277f447..2f5e0a39c70 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f3851000cf542c50fe98
 title: 'Problem 25: 1000-digit Fibonacci number'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301897
 dashedName: problem-25-1000-digit-fibonacci-number
 ---
 
 # --description--
 
-The Fibonacci sequence is defined by the recurrence relation:
+斐波那契數列由遞推關係定義：
 
 <div style='padding-left: 4em;'>F<sub>n</sub> = F<sub>n−1</sub> + F<sub>n−2</sub>, where F<sub>1</sub> = 1 and F<sub>2</sub> = 1.</div>
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-250-250250.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-250-250250.md
index 9c488260551..c526154b6e7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-250-250250.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-250-250250.md
@@ -1,21 +1,21 @@
 ---
 id: 5900f4661000cf542c50ff78
 title: 'Problem 250: 250250'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301898
 dashedName: problem-250-250250
 ---
 
 # --description--
 
-Find the number of non-empty subsets of {11, 22, 33,..., 250250250250}, the sum of whose elements is divisible by 250. Enter the rightmost 16 digits as your answer.
+Find the number of non-empty subsets of $\\{{1}^{1}, {2}^{2}, {3}^{3}, \ldots, {250250}^{250250}\\}$, the sum of whose elements is divisible by 250. Enter the rightmost 16 digits as your answer.
 
 # --hints--
 
-`euler250()` should return 1425480602091519.
+`twoHundredFifty()` should return `1425480602091519`.
 
 ```js
-assert.strictEqual(euler250(), 1425480602091519);
+assert.strictEqual(twoHundredFifty(), 1425480602091519);
 ```
 
 # --seed--
@@ -23,12 +23,12 @@ assert.strictEqual(euler250(), 1425480602091519);
 ## --seed-contents--
 
 ```js
-function euler250() {
+function twoHundredFifty() {
 
   return true;
 }
 
-euler250();
+twoHundredFifty();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.md
index 9023efb8182..8f4013595f3 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f4671000cf542c50ff7a
 title: 'Problem 251: Cardano Triplets'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301899
 dashedName: problem-251-cardano-triplets
 ---
 
 # --description--
 
-A triplet of positive integers (a,b,c) is called a Cardano Triplet if it satisfies the condition:
+A triplet of positive integers ($a$,$b$,$c$) is called a Cardano Triplet if it satisfies the condition:
+
+$$\sqrt[3]{a + b \sqrt{c}} + \sqrt[3]{a - b \sqrt{c}} = 1$$
 
 For example, (2,1,5) is a Cardano Triplet.
 
-There exist 149 Cardano Triplets for which a+b+c ≤ 1000.
+There exist 149 Cardano Triplets for which $a + b + c ≤ 1000$.
 
-Find how many Cardano Triplets exist such that a+b+c ≤ 110,000,000.
+Find how many Cardano Triplets exist such that $a + b + c ≤ 110\\,000\\,000$.
 
 # --hints--
 
-`euler251()` should return 18946051.
+`cardanoTriplets()` should return `18946051`.
 
 ```js
-assert.strictEqual(euler251(), 18946051);
+assert.strictEqual(cardanoTriplets(), 18946051);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler251(), 18946051);
 ## --seed-contents--
 
 ```js
-function euler251() {
+function cardanoTriplets() {
 
   return true;
 }
 
-euler251();
+cardanoTriplets();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-252-convex-holes.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-252-convex-holes.md
index 68251abd753..ec671c067aa 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-252-convex-holes.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-252-convex-holes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4691000cf542c50ff7b
 title: 'Problem 252: Convex Holes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301900
 dashedName: problem-252-convex-holes
 ---
@@ -12,9 +12,12 @@ Given a set of points on a plane, we define a convex hole to be a convex polygon
 
 As an example, the image below shows a set of twenty points and a few such convex holes. The convex hole shown as a red heptagon has an area equal to 1049694.5 square units, which is the highest possible area for a convex hole on the given set of points.
 
-For our example, we used the first 20 points (T2k−1, T2k), for k = 1,2,…,20, produced with the pseudo-random number generator:
+<img class="img-responsive center-block" alt="set of twenty points and convex holes on plane" src="https://cdn.freecodecamp.org/curriculum/project-euler/convex-holes.gif" style="background-color: white; padding: 10px;" />
 
-S0 = 290797 Sn+1 = Sn2 mod 50515093 Tn = ( Sn mod 2000 ) − 1000
+For our example, we used the first 20 points ($T_{2k − 1}$, $T_{2k}$), for $k = 1, 2, \ldots, 20$, produced with the pseudo-random number generator:
+
+$$\begin{align}   S_0 & = 290\\,797 \\\\
+  S_{n+1} & = {S_n}^2 \\; \text{mod} \\; 50\\,515\\,093 \\\\ T_n & = (S_n \\; \text{mod} \\; 2000) − 1000 \end{align}$$
 
 i.e. (527, 144), (−488, 732), (−454, −947), …
 
@@ -22,10 +25,10 @@ What is the maximum area for a convex hole on the set containing the first 500 p
 
 # --hints--
 
-`euler252()` should return 104924.
+`convexHoles()` should return `104924`.
 
 ```js
-assert.strictEqual(euler252(), 104924);
+assert.strictEqual(convexHoles(), 104924);
 ```
 
 # --seed--
@@ -33,12 +36,12 @@ assert.strictEqual(euler252(), 104924);
 ## --seed-contents--
 
 ```js
-function euler252() {
+function convexHoles() {
 
   return true;
 }
 
-euler252();
+convexHoles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-253-tidying-up.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-253-tidying-up.md
index 78efca2bdc3..c084198f053 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-253-tidying-up.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-253-tidying-up.md
@@ -1,35 +1,52 @@
 ---
 id: 5900f4691000cf542c50ff7c
 title: 'Problem 253: Tidying up'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301901
 dashedName: problem-253-tidying-up
 ---
 
 # --description--
 
-A small child has a “number caterpillar” consisting of forty jigsaw pieces, each with one number on it, which, when connected together in a line, reveal the numbers 1 to 40 in order.
+A small child has a "number caterpillar" consisting of forty jigsaw pieces, each with one number on it, which, when connected together in a line, reveal the numbers 1 to 40 in order.
 
-Every night, the child's father has to pick up the pieces of the caterpillar that have been scattered across the play room. He picks up the pieces at random and places them in the correct order. As the caterpillar is built up in this way, it forms distinct segments that gradually merge together. The number of segments starts at zero (no pieces placed), generally increases up to about eleven or twelve, then tends to drop again before finishing at a single segment (all pieces placed).
+Every night, the child's father has to pick up the pieces of the caterpillar that have been scattered across the play room. He picks up the pieces at random and places them in the correct order.
 
-For example:
+As the caterpillar is built up in this way, it forms distinct segments that gradually merge together. The number of segments starts at zero (no pieces placed), generally increases up to about eleven or twelve, then tends to drop again before finishing at a single segment (all pieces placed).
 
-Piece Placed Segments So Far121422936434554354……
+例如：
 
-Let M be the maximum number of segments encountered during a random tidy-up of the caterpillar. For a caterpillar of ten pieces, the number of possibilities for each M is
+| Piece Placed | Segments So Far |
+| ------------ | --------------- |
+| 12           | 1               |
+| 4            | 2               |
+| 29           | 3               |
+| 6            | 4               |
+| 34           | 5               |
+| 5            | 4               |
+| 35           | 4               |
+| …            | …               |
 
-M Possibilities1512 2250912 31815264 41418112 5144000
+Let $M$ be the maximum number of segments encountered during a random tidy-up of the caterpillar. For a caterpillar of ten pieces, the number of possibilities for each $M$ is
 
-so the most likely value of M is 3 and the average value is 385643⁄113400 = 3.400732, rounded to six decimal places.
+| M | Possibilities |
+| - | ------------- |
+| 1 | 512           |
+| 2 | 250912        |
+| 3 | 1815264       |
+| 4 | 1418112       |
+| 5 | 144000        |
 
-The most likely value of M for a forty-piece caterpillar is 11; but what is the average value of M? Give your answer rounded to six decimal places.
+so the most likely value of $M$ is 3 and the average value is $\frac{385\\,643}{113\\,400} = 3.400732$, rounded to six decimal places.
+
+The most likely value of $M$ for a forty-piece caterpillar is 11; but what is the average value of $M$? Give your answer rounded to six decimal places.
 
 # --hints--
 
-`euler253()` should return 11.492847.
+`tidyingUp()` should return `11.492847`.
 
 ```js
-assert.strictEqual(euler253(), 11.492847);
+assert.strictEqual(tidyingUp(), 11.492847);
 ```
 
 # --seed--
@@ -37,12 +54,12 @@ assert.strictEqual(euler253(), 11.492847);
 ## --seed-contents--
 
 ```js
-function euler253() {
+function tidyingUp() {
 
   return true;
 }
 
-euler253();
+tidyingUp();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.md
index 028f20783ef..3d91777d0a4 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.md
@@ -1,31 +1,31 @@
 ---
 id: 5900f46b1000cf542c50ff7d
 title: 'Problem 254: Sums of Digit Factorials'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301902
 dashedName: problem-254-sums-of-digit-factorials
 ---
 
 # --description--
 
-Define f(n) as the sum of the factorials of the digits of n. For example, f(342) = 3! + 4! + 2! = 32.
+Define $f(n)$ as the sum of the factorials of the digits of $n$. For example, $f(342) = 3! + 4! + 2! = 32$.
 
-Define sf(n) as the sum of the digits of f(n). So sf(342) = 3 + 2 = 5.
+Define $sf(n)$ as the sum of the digits of $f(n)$. So $sf(342) = 3 + 2 = 5$.
 
-Define g(i) to be the smallest positive integer n such that sf(n) = i. Though sf(342) is 5, sf(25) is also 5, and it can be verified that g(5) is 25.
+Define $g(i)$ to be the smallest positive integer $n$ such that $sf(n) = i$. Though $sf(342)$ is 5, $sf(25)$ is also 5, and it can be verified that $g(5)$ is 25.
 
-Define sg(i) as the sum of the digits of g(i). So sg(5) = 2 + 5 = 7.
+Define $sg(i)$ as the sum of the digits of $g(i)$. So $sg(5) = 2 + 5 = 7$.
 
-Further, it can be verified that g(20) is 267 and ∑ sg(i) for 1 ≤ i ≤ 20 is 156.
+Further, it can be verified that $g(20)$ is 267 and $\sum sg(i)$ for $1 ≤ i ≤ 20$ is 156.
 
-What is ∑ sg(i) for 1 ≤ i ≤ 150?
+What is $\sum sg(i)$ for $1 ≤ i ≤ 150$?
 
 # --hints--
 
-`euler254()` should return 8184523820510.
+`sumsOfDigitFactorials()` should return `8184523820510`.
 
 ```js
-assert.strictEqual(euler254(), 8184523820510);
+assert.strictEqual(sumsOfDigitFactorials(), 8184523820510);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler254(), 8184523820510);
 ## --seed-contents--
 
 ```js
-function euler254() {
+function sumsOfDigitFactorials() {
 
   return true;
 }
 
-euler254();
+sumsOfDigitFactorials();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md
index 8c6acc7113e..b5a008161fb 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md
@@ -1,33 +1,50 @@
 ---
 id: 5900f46d1000cf542c50ff7f
 title: 'Problem 255: Rounded Square Roots'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301903
 dashedName: problem-255-rounded-square-roots
 ---
 
 # --description--
 
-We define the rounded-square-root of a positive integer n as the square root of n rounded to the nearest integer.
+We define the rounded-square-root of a positive integer $n$ as the square root of $n$ rounded to the nearest integer.
 
-The following procedure (essentially Heron's method adapted to integer arithmetic) finds the rounded-square-root of n: Let d be the number of digits of the number n. If d is odd, set x0 = 2×10(d-1)⁄2. If d is even, set x0 = 7×10(d-2)⁄2. Repeat:
+The following procedure (essentially Heron's method adapted to integer arithmetic) finds the rounded-square-root of $n$:
 
-until xk+1 = xk.
+Let $d$ be the number of digits of the number $n$.
 
-As an example, let us find the rounded-square-root of n = 4321.n has 4 digits, so x0 = 7×10(4-2)⁄2 = 70. Since x2 = x1, we stop here. So, after just two iterations, we have found that the rounded-square-root of 4321 is 66 (the actual square root is 65.7343137…).
+If $d$ is odd, set $x_0 = 2 × {10}^{\frac{d - 1}{2}}$.
 
-The number of iterations required when using this method is surprisingly low. For example, we can find the rounded-square-root of a 5-digit integer (10,000 ≤ n ≤ 99,999) with an average of 3.2102888889 iterations (the average value was rounded to 10 decimal places).
+If $d$ is even, set $x_0 = 7 × {10}^{\frac{d - 2}{2}}$.
 
-Using the procedure described above, what is the average number of iterations required to find the rounded-square-root of a 14-digit number (1013 ≤ n &lt; 1014)? Give your answer rounded to 10 decimal places.
+重複：
 
-Note: The symbols ⌊x⌋ and ⌈x⌉ represent the floor function and ceiling function respectively.
+$$x_{k + 1} = \left\lfloor\frac{x_k + \left\lceil\frac{n}{x_k}\right\rceil}{2}\right\rfloor$$
+
+until $x_{k + 1} = x_k$.
+
+As an example, let us find the rounded-square-root of $n = 4321$.
+
+$n$ has 4 digits, so $x_0 = 7 × {10}^{\frac{4-2}{2}} = 70$.
+
+$$x_1 = \left\lfloor\frac{70 + \left\lceil\frac{4321}{70}\right\rceil}{2}\right\rfloor = 66 \\\\
+x_2 = \left\lfloor\frac{66 + \left\lceil\frac{4321}{66}\right\rceil}{2}\right\rfloor = 66$$
+
+Since $x_2 = x_1$, we stop here. So, after just two iterations, we have found that the rounded-square-root of 4321 is 66 (the actual square root is 65.7343137…).
+
+The number of iterations required when using this method is surprisingly low. For example, we can find the rounded-square-root of a 5-digit integer ($10\\,000 ≤ n ≤ 99\\,999$) with an average of 3.2102888889 iterations (the average value was rounded to 10 decimal places).
+
+Using the procedure described above, what is the average number of iterations required to find the rounded-square-root of a 14-digit number (${10}^{13} ≤ n &lt; {10}^{14}$)? Give your answer rounded to 10 decimal places.
+
+**Note:** The symbols $⌊x⌋$ and $⌈x⌉$ represent the floor function and ceiling function respectively.
 
 # --hints--
 
-`euler255()` should return 4.447401118.
+`roundedSquareRoots()` should return `4.447401118`.
 
 ```js
-assert.strictEqual(euler255(), 4.447401118);
+assert.strictEqual(roundedSquareRoots(), 4.447401118);
 ```
 
 # --seed--
@@ -35,12 +52,12 @@ assert.strictEqual(euler255(), 4.447401118);
 ## --seed-contents--
 
 ```js
-function euler255() {
+function roundedSquareRoots() {
 
   return true;
 }
 
-euler255();
+roundedSquareRoots();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md
index 7a55e36abec..a1fba0b5f2a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f46c1000cf542c50ff7e
 title: 'Problem 256: Tatami-Free Rooms'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301904
 dashedName: problem-256-tatami-free-rooms
 ---
@@ -12,26 +12,28 @@ Tatami are rectangular mats, used to completely cover the floor of a room, witho
 
 Assuming that the only type of available tatami has dimensions 1×2, there are obviously some limitations for the shape and size of the rooms that can be covered.
 
-For this problem, we consider only rectangular rooms with integer dimensions a, b and even size s = a·b. We use the term 'size' to denote the floor surface area of the room, and — without loss of generality — we add the condition a ≤ b.
+For this problem, we consider only rectangular rooms with integer dimensions $a$, $b$ and even size $s = a \times b$. We use the term 'size' to denote the floor surface area of the room, and — without loss of generality — we add the condition $a ≤ b$.
 
 There is one rule to follow when laying out tatami: there must be no points where corners of four different mats meet. For example, consider the two arrangements below for a 4×4 room:
 
-The arrangement on the left is acceptable, whereas the one on the right is not: a red "X" in the middle, marks the point where four tatami meet.
+<img class="img-responsive center-block" alt="two arragements of mats in 4x4 room" src="https://cdn.freecodecamp.org/curriculum/project-euler/tatami-free-rooms.gif" style="background-color: white; padding: 10px;" />
 
-Because of this rule, certain even-sized rooms cannot be covered with tatami: we call them tatami-free rooms. Further, we define T(s) as the number of tatami-free rooms of size s.
+The arrangement on the left is acceptable, whereas the one on the right is not: a red "<strong><span style="color: red;">X</span></strong>" in the middle, marks the point where four tatami meet.
 
-The smallest tatami-free room has size s = 70 and dimensions 7×10. All the other rooms of size s = 70 can be covered with tatami; they are: 1×70, 2×35 and 5×14. Hence, T(70) = 1.
+Because of this rule, certain even-sized rooms cannot be covered with tatami: we call them tatami-free rooms. Further, we define $T(s)$ as the number of tatami-free rooms of size $s$.
 
-Similarly, we can verify that T(1320) = 5 because there are exactly 5 tatami-free rooms of size s = 1320: 20×66, 22×60, 24×55, 30×44 and 33×40. In fact, s = 1320 is the smallest room-size s for which T(s) = 5.
+The smallest tatami-free room has size $s = 70$ and dimensions 7×10. All the other rooms of size $s = 70$ can be covered with tatami; they are: 1×70, 2×35 and 5×14. Hence, $T(70) = 1$.
 
-Find the smallest room-size s for which T(s) = 200.
+Similarly, we can verify that $T(1320) = 5$ because there are exactly 5 tatami-free rooms of size $s = 1320$: 20×66, 22×60, 24×55, 30×44 and 33×40. In fact, $s = 1320$ is the smallest room-size $s$ for which $T(s) = 5$.
+
+Find the smallest room-size $s$ for which $T(s) = 200$.
 
 # --hints--
 
-`euler256()` should return 85765680.
+`tatamiFreeRooms()` should return `85765680`.
 
 ```js
-assert.strictEqual(euler256(), 85765680);
+assert.strictEqual(tatamiFreeRooms(), 85765680);
 ```
 
 # --seed--
@@ -39,12 +41,12 @@ assert.strictEqual(euler256(), 85765680);
 ## --seed-contents--
 
 ```js
-function euler256() {
+function tatamiFreeRooms() {
 
   return true;
 }
 
-euler256();
+tatamiFreeRooms();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
index 629b1f0340e..60864ac52e1 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f46e1000cf542c50ff80
 title: 'Problem 257: Angular Bisectors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301905
 dashedName: problem-257-angular-bisectors
 ---
 
 # --description--
 
-Given is an integer sided triangle ABC with sides a ≤ b ≤ c.
+Given is an integer sided triangle $ABC$ with sides $a ≤ b ≤ c$ ($AB = c$, $BC = a$ and $AC = b$).
 
-(AB = c, BC = a and AC = b).
+The angular bisectors of the triangle intersect the sides at points $E$, $F$ and $G$ (see picture below).
 
-The angular bisectors of the triangle intersect the sides at points E, F and G (see picture below).
+<img class="img-responsive center-block" alt="triangle ABC, with angular bisectors intersecting sides at the points E, F and G" src="https://cdn.freecodecamp.org/curriculum/project-euler/angular-bisectors.gif" style="background-color: white; padding: 10px;" />
 
-The segments EF, EG and FG partition the triangle ABC into four smaller triangles: AEG, BFE, CGF and EFG. It can be proven that for each of these four triangles the ratio area(ABC)/area(subtriangle) is rational. However, there exist triangles for which some or all of these ratios are integral.
+The segments $EF$, $EG$ and $FG$ partition the triangle $ABC$ into four smaller triangles: $AEG$, $BFE$, $CGF$ and $EFG$. It can be proven that for each of these four triangles the ratio $\frac{\text{area}(ABC)}{\text{area}(\text{subtriangle})}$ is rational. However, there exist triangles for which some or all of these ratios are integral.
 
-How many triangles ABC with perimeter≤100,000,000 exist so that the ratio area(ABC)/area(AEG) is integral?
+How many triangles $ABC$ with perimeter $≤ 100\\,000\\,000$ exist so that the ratio $\frac{\text{area}(ABC)}{\text{area}(AEG)}$ is integral?
 
 # --hints--
 
-`euler257()` should return 139012411.
+`angularBisectors()` should return `139012411`.
 
 ```js
-assert.strictEqual(euler257(), 139012411);
+assert.strictEqual(angularBisectors(), 139012411);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler257(), 139012411);
 ## --seed-contents--
 
 ```js
-function euler257() {
+function angularBisectors() {
 
   return true;
 }
 
-euler257();
+angularBisectors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.md
index 963b52807ec..ad71a8e2c1d 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.md
@@ -1,23 +1,26 @@
 ---
 id: 5900f46e1000cf542c50ff81
 title: 'Problem 258: A lagged Fibonacci sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301906
 dashedName: problem-258-a-lagged-fibonacci-sequence
 ---
 
 # --description--
 
-A sequence is defined as:
+序列定義爲：
 
-gk = 1, for 0 ≤ k ≤ 1999 gk = gk-2000 + gk-1999, for k ≥ 2000. Find gk mod 20092010 for k = 1018.
+- $g_k = 1$, for $0 ≤ k ≤ 1999$
+- $g_k = g_{k - 2000} + g_{k - 1999}$, for $k ≥ 2000$.
+
+Find $g_k$ mod 20092010 for $k = {10}^{18}$.
 
 # --hints--
 
-`euler258()` should return 12747994.
+`laggedFibonacciSequence()` should return `12747994`.
 
 ```js
-assert.strictEqual(euler258(), 12747994);
+assert.strictEqual(laggedFibonacciSequence(), 12747994);
 ```
 
 # --seed--
@@ -25,12 +28,12 @@ assert.strictEqual(euler258(), 12747994);
 ## --seed-contents--
 
 ```js
-function euler258() {
+function laggedFibonacciSequence() {
 
   return true;
 }
 
-euler258();
+laggedFibonacciSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-259-reachable-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-259-reachable-numbers.md
index c9eab8e6efd..a8fa3ceb470 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-259-reachable-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-259-reachable-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4701000cf542c50ff82
 title: 'Problem 259: Reachable Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301907
 dashedName: problem-259-reachable-numbers
 ---
@@ -10,16 +10,23 @@ dashedName: problem-259-reachable-numbers
 
 A positive integer will be called reachable if it can result from an arithmetic expression obeying the following rules:
 
-Uses the digits 1 through 9, in that order and exactly once each. Any successive digits can be concatenated (for example, using the digits 2, 3 and 4 we obtain the number 234). Only the four usual binary arithmetic operations (addition, subtraction, multiplication and division) are allowed. Each operation can be used any number of times, or not at all. Unary minus is not allowed. Any number of (possibly nested) parentheses may be used to define the order of operations. For example, 42 is reachable, since (1/23) *((4*5)-6) \* (78-9) = 42.
+- Uses the digits 1 through 9, in that order and exactly once each.
+- Any successive digits can be concatenated (for example, using the digits 2, 3 and 4 we obtain the number 234).
+- Only the four usual binary arithmetic operations (addition, subtraction, multiplication and division) are allowed.
+- Each operation can be used any number of times, or not at all.
+- Unary minus is not allowed.
+- Any number of (possibly nested) parentheses may be used to define the order of operations.
+
+For example, 42 is reachable, since $\frac{1}{23} \times ((4 \times 5) - 6) \times (78 - 9) = 42$.
 
 What is the sum of all positive reachable integers?
 
 # --hints--
 
-`euler259()` should return 20101196798.
+`reachableNumbers()` should return `20101196798`.
 
 ```js
-assert.strictEqual(euler259(), 20101196798);
+assert.strictEqual(reachableNumbers(), 20101196798);
 ```
 
 # --seed--
@@ -27,12 +34,12 @@ assert.strictEqual(euler259(), 20101196798);
 ## --seed-contents--
 
 ```js
-function euler259() {
+function reachableNumbers() {
 
   return true;
 }
 
-euler259();
+reachableNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-26-reciprocal-cycles.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-26-reciprocal-cycles.md
index d6ee972f907..580ba5807a3 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-26-reciprocal-cycles.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-26-reciprocal-cycles.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3861000cf542c50fe99
 title: 'Problem 26: Reciprocal cycles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301908
 dashedName: problem-26-reciprocal-cycles
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-260-stone-game.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-260-stone-game.md
index 55f0dccfd5d..d0724fd1214 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-260-stone-game.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-260-stone-game.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4701000cf542c50ff83
 title: 'Problem 260: Stone Game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301909
 dashedName: problem-260-stone-game
 ---
@@ -10,24 +10,34 @@ dashedName: problem-260-stone-game
 
 A game is played with three piles of stones and two players.
 
-At her turn, a player removes one or more stones from the piles. However, if she takes stones from more than one pile, she must remove the same number of stones from each of the selected piles.
+On each player's turn, the player removes one or more stones from the piles. However, if the player takes stones from more than one pile, the same number of stones must be removed from each of the selected piles.
 
-In other words, the player chooses some N>0 and removes: N stones from any single pile; or N stones from each of any two piles (2N total); or N stones from each of the three piles (3N total). The player taking the last stone(s) wins the game.
+In other words, the player chooses some $N > 0$ and removes:
 
-A winning configuration is one where the first player can force a win. For example, (0,0,13), (0,11,11) and (5,5,5) are winning configurations because the first player can immediately remove all stones.
+- $N$ stones from any single pile; or
+- $N$ stones from each of any two piles ($2N$ total); or
+- $N$ stones from each of the three piles ($3N$ total).
 
-A losing configuration is one where the second player can force a win, no matter what the first player does. For example, (0,1,2) and (1,3,3) are losing configurations: any legal move leaves a winning configuration for the second player.
+The player taking the last stone(s) wins the game.
 
-Consider all losing configurations (xi,yi,zi) where xi ≤ yi ≤ zi ≤ 100. We can verify that Σ(xi+yi+zi) = 173895 for these.
+A winning configuration is one where the first player can force a win.
 
-Find Σ(xi+yi+zi) where (xi,yi,zi) ranges over the losing configurations with xi ≤ yi ≤ zi ≤ 1000.
+For example, (0,0,13), (0,11,11) and (5,5,5) are winning configurations because the first player can immediately remove all stones.
+
+A losing configuration is one where the second player can force a win, no matter what the first player does.
+
+For example, (0,1,2) and (1,3,3) are losing configurations: any legal move leaves a winning configuration for the second player.
+
+Consider all losing configurations ($x_i$,$y_i$,$z_i$) where $x_i ≤ y_i ≤ z_i ≤ 100$. We can verify that $\sum (x_i + y_i + z_i) = 173\\,895$ for these.
+
+Find $\sum (x_i + y_i + z_i)$ where ($x_i$,$y_i$,$z_i$) ranges over the losing configurations with $x_i ≤ y_i ≤ z_i ≤ 1000$.
 
 # --hints--
 
-`euler260()` should return 167542057.
+`stoneGame()` should return `167542057`.
 
 ```js
-assert.strictEqual(euler260(), 167542057);
+assert.strictEqual(stoneGame(), 167542057);
 ```
 
 # --seed--
@@ -35,12 +45,12 @@ assert.strictEqual(euler260(), 167542057);
 ## --seed-contents--
 
 ```js
-function euler260() {
+function stoneGame() {
 
   return true;
 }
 
-euler260();
+stoneGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md
index b265e7910b2..af6e1b5aa27 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md
@@ -1,25 +1,31 @@
 ---
 id: 5900f4711000cf542c50ff84
 title: 'Problem 261: Pivotal Square Sums'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301910
 dashedName: problem-261-pivotal-square-sums
 ---
 
 # --description--
 
-Let us call a positive integer k a square-pivot, if there is a pair of integers m > 0 and n ≥ k, such that the sum of the (m+1) consecutive squares up to k equals the sum of the m consecutive squares from (n+1) on:
+Let us call a positive integer $k$ a square-pivot, if there is a pair of integers $m > 0$ and $n ≥ k$, such that the sum of the ($m + 1$) consecutive squares up to $k$ equals the sum of the $m$ consecutive squares from ($n + 1$) on:
 
-(k-m)2 + ... + k2 = (n+1)2 + ... + (n+m)2.
+$${(k - m)}^2 + \ldots + k^2 = {(n + 1)}^2 + \ldots + {(n + m)}^2$$
 
-Some small square-pivots are 4: 32 + 42 = 52 21: 202 + 212 = 292 24: 212 + 222 + 232 + 242 = 252 + 262 + 272 110: 1082 + 1092 + 1102 = 1332 + 1342Find the sum of all distinct square-pivots ≤ 1010.
+Some small square-pivots are
+
+$$\begin{align}   & \mathbf{4}: 3^2 + \mathbf{4}^2 = 5^2 \\\\
+  & \mathbf{21}: {20}^2 + \mathbf{21}^2 = {29}^2 \\\\   & \mathbf{24}: {21}^2 + {22}^2 + {23}^2 + \mathbf{24}^2 = {25}^2 + {26}^2 + {27}^2 \\\\
+  & \mathbf{110}: {108}^2 + {109}^2 + \mathbf{110}^2 = {133}^2 + {134}^2 \\\\ \end{align}$$
+
+Find the sum of all distinct square-pivots $≤ {10}^{10}$.
 
 # --hints--
 
-`euler261()` should return 238890850232021.
+`pivotalSquareSums()` should return `238890850232021`.
 
 ```js
-assert.strictEqual(euler261(), 238890850232021);
+assert.strictEqual(pivotalSquareSums(), 238890850232021);
 ```
 
 # --seed--
@@ -27,12 +33,12 @@ assert.strictEqual(euler261(), 238890850232021);
 ## --seed-contents--
 
 ```js
-function euler261() {
+function pivotalSquareSums() {
 
   return true;
 }
 
-euler261();
+pivotalSquareSums();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-262-mountain-range.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-262-mountain-range.md
index 01cc16de4e1..d340e834fa6 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-262-mountain-range.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-262-mountain-range.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f4731000cf542c50ff85
 title: 'Problem 262: Mountain Range'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301911
 dashedName: problem-262-mountain-range
 ---
 
 # --description--
 
-The following equation represents the continuous topography of a mountainous region, giving the elevation h at any point (x,y):
+The following equation represents the continuous topography of a mountainous region, giving the elevation $h$ at any point ($x$,$y$):
 
-A mosquito intends to fly from A(200,200) to B(1400,1400), without leaving the area given by 0 ≤ x, y ≤ 1600.
+$$h = \left(5000 - \frac{x^2 + y^2 + xy}{200} + \frac{25(x + y)}{2}\right) \times e^{-\left|\frac{x^2 + y^2}{1\\,000\\,000} - \frac{3(x + y)}{2000} + \frac{7}{10}\right|}$$
 
-Because of the intervening mountains, it first rises straight up to a point A', having elevation f. Then, while remaining at the same elevation f, it flies around any obstacles until it arrives at a point B' directly above B.
+A mosquito intends to fly from A(200,200) to B(1400,1400), without leaving the area given by $0 ≤ x$, $y ≤ 1600$.
 
-First, determine fmin which is the minimum constant elevation allowing such a trip from A to B, while remaining in the specified area. Then, find the length of the shortest path between A' and B', while flying at that constant elevation fmin.
+Because of the intervening mountains, it first rises straight up to a point A', having elevation $f$. Then, while remaining at the same elevation $f$, it flies around any obstacles until it arrives at a point B' directly above B.
+
+First, determine $f_{min}$ which is the minimum constant elevation allowing such a trip from A to B, while remaining in the specified area. Then, find the length of the shortest path between A' and B', while flying at that constant elevation $f_{min}$.
 
 Give that length as your answer, rounded to three decimal places.
 
-Note: For convenience, the elevation function shown above is repeated below, in a form suitable for most programming languages: h=( 5000-0.005*(x*x+y*y+x*y)+12.5*(x+y) )* exp( -abs(0.000001*(x*x+y*y)-0.0015*(x+y)+0.7) )
+**Note:** For convenience, the elevation function shown above is repeated below, in a form suitable for most programming languages: `h=( 5000-0.005*(x*x+y*y+x*y)+12.5*(x+y) )* exp( -abs(0.000001*(x*x+y*y)-0.0015*(x+y)+0.7) )`.
 
 # --hints--
 
-`euler262()` should return 2531.205.
+`mountainRange()` should return `2531.205`.
 
 ```js
-assert.strictEqual(euler262(), 2531.205);
+assert.strictEqual(mountainRange(), 2531.205);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler262(), 2531.205);
 ## --seed-contents--
 
 ```js
-function euler262() {
+function mountainRange() {
 
   return true;
 }
 
-euler262();
+mountainRange();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.md
index 24fca67d821..2192ea3cda9 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.md
@@ -1,37 +1,40 @@
 ---
 id: 5900f4741000cf542c50ff86
-title: 'Problem 263: An engineers'' dream come true'
-challengeType: 5
+title: '問題 263：工程師的夢想成真'
+challengeType: 1
 forumTopicId: 301912
 dashedName: problem-263-an-engineers-dream-come-true
 ---
 
 # --description--
 
-Consider the number 6. The divisors of 6 are: 1,2,3 and 6.
+Consider the number 6. 6 的除數是：1、2、3 和 6。
 
 Every number from 1 up to and including 6 can be written as a sum of distinct divisors of 6:
 
-1=1, 2=2, 3=1+2, 4=1+3, 5=2+3, 6=6.
+$1 = 1$, $2 = 2$, $3 = 1 + 2$, $4 = 1 + 3$, $5 = 2 + 3$, $6 = 6$.
 
-A number n is called a practical number if every number from 1 up to and including n can be expressed as a sum of distinct divisors of n.
+A number $n$ is called a practical number if every number from 1 up to and including $n$ can be expressed as a sum of distinct divisors of $n$.
 
-A pair of consecutive prime numbers with a difference of six is called a sexy pair (since "sex" is the Latin word for "six"). The first sexy pair is (23, 29).
+A pair of consecutive prime numbers with a difference of six is called a sexy pair (since "sex" is the Latin word for "six"). 第一個性感的對是 (23, 29)。
 
 We may occasionally find a triple-pair, which means three consecutive sexy prime pairs, such that the second member of each pair is the first member of the next pair.
 
-We shall call a number n such that : (n-9, n-3), (n-3,n+3), (n+3, n+9) form a triple-pair, and the numbers n-8, n-4, n, n+4 and n+8 are all practical,
+We shall call a number $n$ such that:
 
-an engineers’ paradise.
+- ($n - 9$, $n - 3$), ($n - 3$, $n + 3$), ($n + 3$, $n + 9$) form a triple-pair, and
+- the numbers $n - 8$, $n - 4$, $n$, $n + 4$ and $n + 8$ are all practical,
+
+工程師的天堂。
 
 Find the sum of the first four engineers’ paradises.
 
 # --hints--
 
-`euler263()` should return 2039506520.
+`engineersDreamComeTrue()` should return `2039506520`.
 
 ```js
-assert.strictEqual(euler263(), 2039506520);
+assert.strictEqual(engineersDreamComeTrue(), 2039506520);
 ```
 
 # --seed--
@@ -39,12 +42,12 @@ assert.strictEqual(euler263(), 2039506520);
 ## --seed-contents--
 
 ```js
-function euler263() {
+function engineersDreamComeTrue() {
 
   return true;
 }
 
-euler263();
+engineersDreamComeTrue();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-264-triangle-centres.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-264-triangle-centres.md
index 34be7dede4c..dc22c0cf51b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-264-triangle-centres.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-264-triangle-centres.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4751000cf542c50ff87
 title: 'Problem 264: Triangle Centres'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301913
 dashedName: problem-264-triangle-centres
 ---
@@ -10,28 +10,45 @@ dashedName: problem-264-triangle-centres
 
 Consider all the triangles having:
 
-All their vertices on lattice points.
+- All their vertices on lattice points.
+- Circumcentre at the origin O.
+- Orthocentre at the point H(5, 0).
 
-Circumcentre at the origin O.
-
-Orthocentre at the point H(5, 0).
-
-There are nine such triangles having a perimeter ≤ 50.
+There are nine such triangles having a $\text{perimeter} ≤ 50$.
 
 Listed and shown in ascending order of their perimeter, they are:
 
-A(-4, 3), B(5, 0), C(4, -3) A(4, 3), B(5, 0), C(-4, -3) A(-3, 4), B(5, 0), C(3, -4) A(3, 4), B(5, 0), C(-3, -4) A(0, 5), B(5, 0), C(0, -5) A(1, 8), B(8, -1), C(-4, -7) A(8, 1), B(1, -8), C(-4, 7) A(2, 9), B(9, -2), C(-6, -7) A(9, 2), B(2, -9), C(-6, 7)
+<table>
+  <tbody>
+    <tr>
+      <td>
+A(-4, 3), B(5, 0), C(4, -3)<br>
+A(4, 3), B(5, 0), C(-4, -3)<br>
+A(-3, 4), B(5, 0), C(3, -4)<br>
+<br><br>
+A(3, 4), B(5, 0), C(-3, -4)<br>
+A(0, 5), B(5, 0), C(0, -5)<br>
+A(1, 8), B(8, -1), C(-4, -7)<br>
+<br><br>
+A(8, 1), B(1, -8), C(-4, 7)<br>
+A(2, 9), B(9, -2), C(-6, -7)<br>
+A(9, 2), B(2, -9), C(-6, 7)<br>
+      </td>
+      <td><img class="img-responsive center-block" alt="nine triangles ABC with perimeter ≤ 50" src="https://cdn.freecodecamp.org/curriculum/project-euler/triangle-centres.gif" style="background-color: white; padding: 10px;"></td>
+    </tr>
+  </tbody>
+</table>
 
 The sum of their perimeters, rounded to four decimal places, is 291.0089.
 
-Find all such triangles with a perimeter ≤ 105. Enter as your answer the sum of their perimeters rounded to four decimal places.
+Find all such triangles with a $\text{perimeter} ≤ {10}^5$. Enter as your answer the sum of their perimeters rounded to four decimal places.
 
 # --hints--
 
-`euler264()` should return 2816417.1055.
+`triangleCentres()` should return `2816417.1055`.
 
 ```js
-assert.strictEqual(euler264(), 2816417.1055);
+assert.strictEqual(triangleCentres(), 2816417.1055);
 ```
 
 # --seed--
@@ -39,12 +56,12 @@ assert.strictEqual(euler264(), 2816417.1055);
 ## --seed-contents--
 
 ```js
-function euler264() {
+function triangleCentres() {
 
   return true;
 }
 
-euler264();
+triangleCentres();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-265-binary-circles.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-265-binary-circles.md
index 0ed757aa65a..4262d97c798 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-265-binary-circles.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-265-binary-circles.md
@@ -1,31 +1,36 @@
 ---
 id: 5900f4761000cf542c50ff88
 title: 'Problem 265: Binary Circles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301914
 dashedName: problem-265-binary-circles
 ---
 
 # --description--
 
-2N binary digits can be placed in a circle so that all the N-digit clockwise subsequences are distinct.
+$2^N$ binary digits can be placed in a circle so that all the $N$-digit clockwise subsequences are distinct.
 
-For N=3, two such circular arrangements are possible, ignoring rotations:
+For $N = 3$, two such circular arrangements are possible, ignoring rotations:
+
+<img class="img-responsive center-block" alt="two circular arrangements for N = 3" src="https://cdn.freecodecamp.org/curriculum/project-euler/binary-circles.gif" style="background-color: white; padding: 10px;" />
 
 For the first arrangement, the 3-digit subsequences, in clockwise order, are: 000, 001, 010, 101, 011, 111, 110 and 100.
 
-Each circular arrangement can be encoded as a number by concatenating the binary digits starting with the subsequence of all zeros as the most significant bits and proceeding clockwise. The two arrangements for N=3 are thus represented as 23 and 29: 00010111 2 = 23 00011101 2 = 29
+Each circular arrangement can be encoded as a number by concatenating the binary digits starting with the subsequence of all zeros as the most significant bits and proceeding clockwise. The two arrangements for $N = 3$ are thus represented as 23 and 29:
 
-Calling S(N) the sum of the unique numeric representations, we can see that S(3) = 23 + 29 = 52.
+$${00010111}_2 = 23\\\\
+{00011101}_2 = 29$$
 
-Find S(5).
+Calling $S(N)$ the sum of the unique numeric representations, we can see that $S(3) = 23 + 29 = 52$.
+
+Find $S(5)$.
 
 # --hints--
 
-`euler265()` should return 209110240768.
+`binaryCircles()` should return `209110240768`.
 
 ```js
-assert.strictEqual(euler265(), 209110240768);
+assert.strictEqual(binaryCircles(), 209110240768);
 ```
 
 # --seed--
@@ -33,12 +38,12 @@ assert.strictEqual(euler265(), 209110240768);
 ## --seed-contents--
 
 ```js
-function euler265() {
+function binaryCircles() {
 
   return true;
 }
 
-euler265();
+binaryCircles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-266-pseudo-square-root.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-266-pseudo-square-root.md
index 18569d5b8e9..2b22e967efb 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-266-pseudo-square-root.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-266-pseudo-square-root.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4771000cf542c50ff89
 title: 'Problem 266: Pseudo Square Root'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301915
 dashedName: problem-266-pseudo-square-root
 ---
@@ -12,18 +12,18 @@ The divisors of 12 are: 1,2,3,4,6 and 12.
 
 The largest divisor of 12 that does not exceed the square root of 12 is 3.
 
-We shall call the largest divisor of an integer n that does not exceed the square root of n the pseudo square root (PSR) of n.
+We shall call the largest divisor of an integer $n$ that does not exceed the square root of $n$ the pseudo square root ($PSR$) of $n$.
 
-It can be seen that PSR(3102)=47.
+It can be seen that $PSR(3102) = 47$.
 
-Let p be the product of the primes below 190. Find PSR(p) mod 1016.
+Let $p$ be the product of the primes below 190. Find $PSR(p)\bmod {10}^{16}$.
 
 # --hints--
 
-`euler266()` should return 1096883702440585.
+`pseudoSquareRoot()` should return `1096883702440585`.
 
 ```js
-assert.strictEqual(euler266(), 1096883702440585);
+assert.strictEqual(pseudoSquareRoot(), 1096883702440585);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler266(), 1096883702440585);
 ## --seed-contents--
 
 ```js
-function euler266() {
+function pseudoSquareRoot() {
 
   return true;
 }
 
-euler266();
+pseudoSquareRoot();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-267-billionaire.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-267-billionaire.md
index 0c308ff3ec8..8dbe1d8ab66 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-267-billionaire.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-267-billionaire.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4771000cf542c50ff8a
 title: 'Problem 267: Billionaire'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301916
 dashedName: problem-267-billionaire
 ---
@@ -10,22 +10,22 @@ dashedName: problem-267-billionaire
 
 You are given a unique investment opportunity.
 
-Starting with £1 of capital, you can choose a fixed proportion, f, of your capital to bet on a fair coin toss repeatedly for 1000 tosses.
+Starting with £1 of capital, you can choose a fixed proportion, $f$, of your capital to bet on a fair coin toss repeatedly for 1000 tosses.
 
 Your return is double your bet for heads and you lose your bet for tails.
 
-For example, if f = 1/4, for the first toss you bet £0.25, and if heads comes up you win £0.5 and so then have £1.5. You then bet £0.375 and if the second toss is tails, you have £1.125.
+For example, if $f = \frac{1}{4}$, for the first toss you bet £0.25, and if heads comes up you win £0.5 and so then have £1.5. You then bet £0.375 and if the second toss is tails, you have £1.125.
 
-Choosing f to maximize your chances of having at least £1,000,000,000 after 1,000 flips, what is the chance that you become a billionaire?
+Choosing $f$ to maximize your chances of having at least £1,000,000,000 after 1,000 flips, what is the chance that you become a billionaire?
 
 All computations are assumed to be exact (no rounding), but give your answer rounded to 12 digits behind the decimal point in the form 0.abcdefghijkl.
 
 # --hints--
 
-`euler267()` should return 0.999992836187.
+`billionaire()` should return `0.999992836187`.
 
 ```js
-assert.strictEqual(euler267(), 0.999992836187);
+assert.strictEqual(billionaire(), 0.999992836187);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler267(), 0.999992836187);
 ## --seed-contents--
 
 ```js
-function euler267() {
+function billionaire() {
 
   return true;
 }
 
-euler267();
+billionaire();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md
index d11cb99eef8..4e855d52234 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md
@@ -1,8 +1,8 @@
 ---
 id: 5900f4791000cf542c50ff8b
 title: >-
-  Problem 268: Counting numbers with at least four distinct prime factors less than 100
-challengeType: 5
+  問題 268：計算至少有四個不同的質因數小於 100 的數
+challengeType: 1
 forumTopicId: 301917
 dashedName: >-
   problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100
@@ -10,16 +10,16 @@ dashedName: >-
 
 # --description--
 
-It can be verified that there are 23 positive integers less than 1000 that are divisible by at least four distinct primes less than 100.
+可以驗證，有 23 個小於 1000 的正整數可以被至少四個不同的小於 100 的素數整除。
 
-Find how many positive integers less than 1016 are divisible by at least four distinct primes less than 100.
+Find how many positive integers less than ${10}^{16}$ are divisible by at least four distinct primes less than 100.
 
 # --hints--
 
-`euler268()` should return 785478606870985.
+`fourDistinctPrimeFactors()` should return `785478606870985`.
 
 ```js
-assert.strictEqual(euler268(), 785478606870985);
+assert.strictEqual(fourDistinctPrimeFactors(), 785478606870985);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler268(), 785478606870985);
 ## --seed-contents--
 
 ```js
-function euler268() {
+function fourDistinctPrimeFactors() {
 
   return true;
 }
 
-euler268();
+fourDistinctPrimeFactors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.md
index b4b26926105..3b66b2a2ab1 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.md
@@ -1,31 +1,37 @@
 ---
 id: 5900f4791000cf542c50ff8c
 title: 'Problem 269: Polynomials with at least one integer root'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301918
 dashedName: problem-269-polynomials-with-at-least-one-integer-root
 ---
 
 # --description--
 
-A root or zero of a polynomial P(x) is a solution to the equation P(x) = 0.
+A root or zero of a polynomial $P(x)$ is a solution to the equation $P(x) = 0$.
 
-Define Pn as the polynomial whose coefficients are the digits of n.
+Define $P_n$ as the polynomial whose coefficients are the digits of $n$.
 
-For example, P5703(x) = 5x3 + 7x2 + 3.
+For example, $P_{5703}(x) = 5x^3 + 7x^2 + 3$.
 
-We can see that:Pn(0) is the last digit of n, Pn(1) is the sum of the digits of n, Pn(10) is n itself.Define Z(k) as the number of positive integers, n, not exceeding k for which the polynomial Pn has at least one integer root.
+We can see that:
 
-It can be verified that Z(100 000) is 14696.
+- $P_n(0)$ is the last digit of $n$,
+- $P_n(1)$ is the sum of the digits of $n$,
+- $Pn(10)$ is $n$ itself.
 
-What is Z(1016)?
+Define $Z(k)$ as the number of positive integers, $n$, not exceeding $k$ for which the polynomial $P_n$ has at least one integer root.
+
+It can be verified that $Z(100\\,000)$ is 14696.
+
+What is $Z({10}^{16})$?
 
 # --hints--
 
-`euler269()` should return 1311109198529286.
+`polynomialsWithOneIntegerRoot()` should return `1311109198529286`.
 
 ```js
-assert.strictEqual(euler269(), 1311109198529286);
+assert.strictEqual(polynomialsWithOneIntegerRoot(), 1311109198529286);
 ```
 
 # --seed--
@@ -33,12 +39,12 @@ assert.strictEqual(euler269(), 1311109198529286);
 ## --seed-contents--
 
 ```js
-function euler269() {
+function polynomialsWithOneIntegerRoot() {
 
   return true;
 }
 
-euler269();
+polynomialsWithOneIntegerRoot();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-27-quadratic-primes.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-27-quadratic-primes.md
index a694ee2a595..e7c8ebe01eb 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-27-quadratic-primes.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-27-quadratic-primes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3871000cf542c50fe9a
 title: 'Problem 27: Quadratic primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301919
 dashedName: problem-27-quadratic-primes
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md
index 5d490e3b17a..d885f1f830d 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md
@@ -1,31 +1,31 @@
 ---
 id: 5900f47c1000cf542c50ff8e
-title: 'Problem 270: Cutting Squares'
-challengeType: 5
+title: '問題 270：切割方塊'
+challengeType: 1
 forumTopicId: 301920
 dashedName: problem-270-cutting-squares
 ---
 
 # --description--
 
-A square piece of paper with integer dimensions N×N is placed with a corner at the origin and two of its sides along the x- and y-axes. Then, we cut it up respecting the following rules:
+A square piece of paper with integer dimensions $N×N$ is placed with a corner at the origin and two of its sides along the $x$- and $y$-axes. Then, we cut it up respecting the following rules:
 
-We only make straight cuts between two points lying on different sides of the square, and having integer coordinates.
+- We only make straight cuts between two points lying on different sides of the square, and having integer coordinates.
+- Two cuts cannot cross, but several cuts can meet at the same border point.
+- Proceed until no more legal cuts can be made.
 
-Two cuts cannot cross, but several cuts can meet at the same border point.
+Counting any reflections or rotations as distinct, we call $C(N)$ the number of ways to cut an $N×N$ square. For example, $C(1) = 2$ and $C(2) = 30$ (shown below).
 
-Proceed until no more legal cuts can be made.
+<img class="img-responsive center-block" alt="ways to cut 2x2 square, counting reflections and rotations as distinct" src="https://cdn.freecodecamp.org/curriculum/project-euler/cutting-squares.gif" style="background-color: white; padding: 10px;" />
 
-Counting any reflections or rotations as distinct, we call C(N) the number of ways to cut an N×N square. For example, C(1) = 2 and C(2) = 30 (shown below).
-
-What is C(30) mod 108 ?
+What is $C(30)\bmod {10}^8$ ?
 
 # --hints--
 
-`euler270()` should return 82282080.
+`cuttingSquares()` should return `82282080`.
 
 ```js
-assert.strictEqual(euler270(), 82282080);
+assert.strictEqual(cuttingSquares(), 82282080);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler270(), 82282080);
 ## --seed-contents--
 
 ```js
-function euler270() {
+function cuttingSquares() {
 
   return true;
 }
 
-euler270();
+cuttingSquares();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.md
index e9f9bb785cc..f1dbf4b5666 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f47b1000cf542c50ff8d
 title: 'Problem 271: Modular Cubes, part 1'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301921
 dashedName: problem-271-modular-cubes-part-1
 ---
 
 # --description--
 
-For a positive number n, define S(n) as the sum of the integers x, for which 1
+For a positive number $n$, define $S(n)$ as the sum of the integers $x$, for which $1 < x < n$ and $x^3 \equiv 1\bmod n$.
 
-When n=91, there are 8 possible values for x, namely : 9, 16, 22, 29, 53, 74, 79, 81. Thus, S(91)=9+16+22+29+53+74+79+81=363.
+When $n = 91$, there are 8 possible values for $x$, namely: 9, 16, 22, 29, 53, 74, 79, 81. Thus, $S(91) = 9 + 16 + 22 + 29 + 53 + 74 + 79 + 81 = 363$.
 
-Find S(13082761331670030).
+Find $S(13\\,082\\,761\\,331\\,670\\,030)$.
 
 # --hints--
 
-`euler271()` should return 4617456485273130000.
+`modularCubesOne()` should return `4617456485273130000`.
 
 ```js
-assert.strictEqual(euler271(), 4617456485273130000);
+assert.strictEqual(modularCubesOne(), 4617456485273130000);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler271(), 4617456485273130000);
 ## --seed-contents--
 
 ```js
-function euler271() {
+function modularCubesOne() {
 
   return true;
 }
 
-euler271();
+modularCubesOne();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.md
index 3cfb07b5b3f..d764ea6563b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f47d1000cf542c50ff8f
 title: 'Problem 272: Modular Cubes, part 2'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301922
 dashedName: problem-272-modular-cubes-part-2
 ---
 
 # --description--
 
-For a positive number n, define C(n) as the number of the integers x, for which 1
+For a positive number $n$, define $C(n)$ as the number of the integers $x$, for which $1 < x < n$ and $x^3 \equiv 1\bmod n$.
 
-When n=91, there are 8 possible values for x, namely : 9, 16, 22, 29, 53, 74, 79, 81. Thus, C(91)=8.
+When $n = 91$, there are 8 possible values for $x$, namely: 9, 16, 22, 29, 53, 74, 79, 81. Thus, $C(91) = 8$.
 
-Find the sum of the positive numbers n≤1011 for which C(n)=242.
+Find the sum of the positive numbers $n ≤ {10}^{11}$ for which $C(n)=242$.
 
 # --hints--
 
-`euler272()` should return 8495585919506151000.
+`modularCubesTwo()` should return `8495585919506151000`.
 
 ```js
-assert.strictEqual(euler272(), 8495585919506151000);
+assert.strictEqual(modularCubesTwo(), 8495585919506151000);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler272(), 8495585919506151000);
 ## --seed-contents--
 
 ```js
-function euler272() {
+function modularCubesTwo() {
 
   return true;
 }
 
-euler272();
+modularCubesTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-273-sum-of-squares.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-273-sum-of-squares.md
index 508c463ddd8..fe8faf0e7cb 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-273-sum-of-squares.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-273-sum-of-squares.md
@@ -1,23 +1,31 @@
 ---
 id: 5900f47e1000cf542c50ff90
-title: 'Problem 273: Sum of Squares'
-challengeType: 5
+title: '問題 273：正方形的總和'
+challengeType: 1
 forumTopicId: 301923
 dashedName: problem-273-sum-of-squares
 ---
 
 # --description--
 
-Consider equations of the form: a2 + b2 = N, 0 ≤ a ≤ b, a, b and N integer.
+Consider equations of the form: $a^2 + b^2 = N$, $0 ≤ a ≤ b$, $a$, $b$ and $N$ integer.
 
-For N=65 there are two solutions: a=1, b=8 and a=4, b=7. We call S(N) the sum of the values of a of all solutions of a2 + b2 = N, 0 ≤ a ≤ b, a, b and N integer. Thus S(65) = 1 + 4 = 5. Find ∑S(N), for all squarefree N only divisible by primes of the form 4k+1 with 4k+1 &lt; 150.
+For $N = 65$ there are two solutions:
+
+$a = 1, b = 8$ and $a = 4, b = 7$.
+
+We call $S(N)$ the sum of the values of $a$ of all solutions of $a^2 + b^2 = N$, $0 ≤ a ≤ b$, $a$, $b$ and $N$ integer.
+
+Thus $S(65) = 1 + 4 = 5$.
+
+Find $\sum S(N)$, for all squarefree $N$ only divisible by primes of the form $4k + 1$ with $4k + 1 &lt; 150$.
 
 # --hints--
 
-`euler273()` should return 2032447591196869000.
+`sumOfSquares()` should return `2032447591196869000`.
 
 ```js
-assert.strictEqual(euler273(), 2032447591196869000);
+assert.strictEqual(sumOfSquares(), 2032447591196869000);
 ```
 
 # --seed--
@@ -25,12 +33,12 @@ assert.strictEqual(euler273(), 2032447591196869000);
 ## --seed-contents--
 
 ```js
-function euler273() {
+function sumOfSquares() {
 
   return true;
 }
 
-euler273();
+sumOfSquares();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.md
index 7841b6ed8f3..bf56b697151 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.md
@@ -1,33 +1,35 @@
 ---
 id: 5900f47f1000cf542c50ff91
 title: 'Problem 274: Divisibility Multipliers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301924
 dashedName: problem-274-divisibility-multipliers
 ---
 
 # --description--
 
-For each integer p > 1 coprime to 10 there is a positive divisibility multiplier m &lt; p which preserves divisibility by p for the following function on any positive integer, n:
+For each integer $p > 1$ coprime to 10 there is a positive divisibility multiplier $m &lt; p$ which preserves divisibility by $p$ for the following function on any positive integer, $n$:
 
-f(n) = (all but the last digit of n) + (the last digit of n) \* m
+$f(n) = (\text{all but the last digit of} \\; n) + (\text{the last digit of} \\; n) \times m$
 
-That is, if m is the divisibility multiplier for p, then f(n) is divisible by p if and only if n is divisible by p.
+That is, if $m$ is the divisibility multiplier for $p$, then $f(n)$ is divisible by $p$ if and only if $n$ is divisible by $p$.
 
-(When n is much larger than p, f(n) will be less than n and repeated application of f provides a multiplicative divisibility test for p.)
+(When $n$ is much larger than $p$, $f(n)$ will be less than $n$ and repeated application of $f$ provides a multiplicative divisibility test for $p$.)
 
 For example, the divisibility multiplier for 113 is 34.
 
-f(76275) = 7627 + 5 *34 = 7797 : 76275 and 7797 are both divisible by 113f(12345) = 1234 + 5* 34 = 1404 : 12345 and 1404 are both not divisible by 113
+$f(76275) = 7627 + 5 \times 34 = 7797$: 76275 and 7797 are both divisible by 113
 
-The sum of the divisibility multipliers for the primes that are coprime to 10 and less than 1000 is 39517. What is the sum of the divisibility multipliers for the primes that are coprime to 10 and less than 107?
+$f(12345) = 1234 + 5 \times 34 = 1404$: 12345 and 1404 are both not divisible by 113
+
+The sum of the divisibility multipliers for the primes that are coprime to 10 and less than 1000 is 39517. What is the sum of the divisibility multipliers for the primes that are coprime to 10 and less than ${10}^7$?
 
 # --hints--
 
-`euler274()` should return 1601912348822.
+`divisibilityMultipliers()` should return `1601912348822`.
 
 ```js
-assert.strictEqual(euler274(), 1601912348822);
+assert.strictEqual(divisibilityMultipliers(), 1601912348822);
 ```
 
 # --seed--
@@ -35,12 +37,12 @@ assert.strictEqual(euler274(), 1601912348822);
 ## --seed-contents--
 
 ```js
-function euler274() {
+function divisibilityMultipliers() {
 
   return true;
 }
 
-euler274();
+divisibilityMultipliers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md
index a65dc0151c8..decc755a9ee 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md
@@ -1,33 +1,34 @@
 ---
 id: 5900f4801000cf542c50ff92
 title: 'Problem 275: Balanced Sculptures'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301925
 dashedName: problem-275-balanced-sculptures
 ---
 
 # --description--
 
-Let us define a balanced sculpture of order n as follows:
+Let us define a balanced sculpture of order $n$ as follows:
 
-A polyomino made up of n+1 tiles known as the blocks (n tiles) and the plinth (remaining tile);
+- A polyomino made up of $n + 1$ tiles known as the blocks ($n$ tiles) and the plinth (remaining tile);
+- the plinth has its centre at position ($x = 0$, $y = 0$);
+- the blocks have $y$-coordinates greater than zero (so the plinth is the unique lowest tile);
+- the centre of mass of all the blocks, combined, has $x$-coordinate equal to zero.
 
-the plinth has its centre at position (x = 0, y = 0);
+When counting the sculptures, any arrangements which are simply reflections about the $y$-axis, are <u>not</u> counted as distinct. For example, the 18 balanced sculptures of order 6 are shown below; note that each pair of mirror images (about the $y$-axis) is counted as one sculpture:
 
-the blocks have y-coordinates greater than zero (so the plinth is the unique lowest tile);
+<img class="img-responsive center-block" alt="18 balanced sculptures of order 6" src="https://cdn.freecodecamp.org/curriculum/project-euler/balanced-sculptures.gif" style="background-color: white; padding: 10px;" />
 
-the centre of mass of all the blocks, combined, has x-coordinate equal to zero.
+There are 964 balanced sculptures of order 10 and 360505 of order 15.
 
-When counting the sculptures, any arrangements which are simply reflections about the y-axis, are not counted as distinct. For example, the 18 balanced sculptures of order 6 are shown below; note that each pair of mirror images (about the y-axis) is counted as one sculpture:
-
-There are 964 balanced sculptures of order 10 and 360505 of order 15.How many balanced sculptures are there of order 18?
+How many balanced sculptures are there of order 18?
 
 # --hints--
 
-`euler275()` should return 15030564.
+`balancedSculptures()` should return `15030564`.
 
 ```js
-assert.strictEqual(euler275(), 15030564);
+assert.strictEqual(balancedSculptures(), 15030564);
 ```
 
 # --seed--
@@ -35,12 +36,12 @@ assert.strictEqual(euler275(), 15030564);
 ## --seed-contents--
 
 ```js
-function euler275() {
+function balancedSculptures() {
 
   return true;
 }
 
-euler275();
+balancedSculptures();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-276-primitive-triangles.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-276-primitive-triangles.md
index 0e8392e57be..26ce00839b4 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-276-primitive-triangles.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-276-primitive-triangles.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4801000cf542c50ff93
 title: 'Problem 276: Primitive Triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301926
 dashedName: problem-276-primitive-triangles
 ---
 
 # --description--
 
-Consider the triangles with integer sides a, b and c with a ≤ b ≤ c.
+Consider the triangles with integer sides $a$, $b$ and $c$ with $a ≤ b ≤ c$.
 
-An integer sided triangle (a,b,c) is called primitive if gcd(a,b,c)=1.
+An integer sided triangle $(a,b,c)$ is called primitive if $gcd(a,b,c) = 1$.
 
-How many primitive integer sided triangles exist with a perimeter not exceeding 10 000 000?
+How many primitive integer sided triangles exist with a perimeter not exceeding $10\\,000\\,000$?
 
 # --hints--
 
-`euler276()` should return 5777137137739633000.
+`primitiveTriangles()` should return `5777137137739633000`.
 
 ```js
-assert.strictEqual(euler276(), 5777137137739633000);
+assert.strictEqual(primitiveTriangles(), 5777137137739633000);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler276(), 5777137137739633000);
 ## --seed-contents--
 
 ```js
-function euler276() {
+function primitiveTriangles() {
 
   return true;
 }
 
-euler276();
+primitiveTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.md
index 1f081396c26..c80635aa3d8 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.md
@@ -1,35 +1,39 @@
 ---
 id: 5900f4811000cf542c50ff94
 title: 'Problem 277: A Modified Collatz sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301927
 dashedName: problem-277-a-modified-collatz-sequence
 ---
 
 # --description--
 
-A modified Collatz sequence of integers is obtained from a starting value a1 in the following way:
+A modified Collatz sequence of integers is obtained from a starting value $a_1$ in the following way:
 
-an+1 = an/3 if an is divisible by 3. We shall denote this as a large downward step, "D".
+$a_{n + 1} = \frac{a_n}{3}$ if $a_n$ is divisible by 3. We shall denote this as a large downward step, "D".
 
-an+1 = (4an + 2)/3 if an divided by 3 gives a remainder of 1. We shall denote this as an upward step, "U".
+$a_{n + 1} = \frac{4a_n + 2}{3}$ if $a_n$ divided by 3 gives a remainder of 1. We shall denote this as an upward step, "U".
 
-an+1 = (2an - 1)/3 if an divided by 3 gives a remainder of 2. We shall denote this as a small downward step, "d".
+$a_{n + 1} = \frac{2a_n - 1}{3}$ if $a_n$ divided by 3 gives a remainder of 2. We shall denote this as a small downward step, "d".
 
-The sequence terminates when some an = 1.
+The sequence terminates when some $a_n = 1$.
 
-Given any integer, we can list out the sequence of steps. For instance if a1=231, then the sequence {an}={231,77,51,17,11,7,10,14,9,3,1} corresponds to the steps "DdDddUUdDD".
+Given any integer, we can list out the sequence of steps. For instance if $a_1 = 231$, then the sequence $\\{a_n\\} = \\{231, 77, 51, 17, 11, 7, 10, 14, 9, 3, 1\\}$ corresponds to the steps "DdDddUUdDD".
 
-Of course, there are other sequences that begin with that same sequence "DdDddUUdDD....". For instance, if a1=1004064, then the sequence is DdDddUUdDDDdUDUUUdDdUUDDDUdDD. In fact, 1004064 is the smallest possible a1 > 106 that begins with the sequence DdDddUUdDD.
+Of course, there are other sequences that begin with that same sequence "DdDddUUdDD....".
 
-What is the smallest a1 > 1015 that begins with the sequence "UDDDUdddDDUDDddDdDddDDUDDdUUDd"?
+For instance, if $a_1 = 1004064$, then the sequence is DdDddUUdDDDdUDUUUdDdUUDDDUdDD.
+
+In fact, 1004064 is the smallest possible $a_1 > {10}^6$ that begins with the sequence DdDddUUdDD.
+
+What is the smallest $a_1 > {10}^{15}$ that begins with the sequence "UDDDUdddDDUDDddDdDddDDUDDdUUDd"?
 
 # --hints--
 
-`euler277()` should return 1125977393124310.
+`modifiedCollatzSequence()` should return `1125977393124310`.
 
 ```js
-assert.strictEqual(euler277(), 1125977393124310);
+assert.strictEqual(modifiedCollatzSequence(), 1125977393124310);
 ```
 
 # --seed--
@@ -37,12 +41,12 @@ assert.strictEqual(euler277(), 1125977393124310);
 ## --seed-contents--
 
 ```js
-function euler277() {
+function modifiedCollatzSequence() {
 
   return true;
 }
 
-euler277();
+modifiedCollatzSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.md
index 6e26a6a316f..215c51cb036 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4831000cf542c50ff95
 title: 'Problem 278: Linear Combinations of Semiprimes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301928
 dashedName: problem-278-linear-combinations-of-semiprimes
 ---
 
 # --description--
 
-Given the values of integers 1 &lt; a1 &lt; a2 &lt;... &lt; an, consider the linear combination q1a1 + q2a2 + ... + qnan = b, using only integer values qk ≥ 0.
+Given the values of integers $1 &lt; a_1 &lt; a_2 &lt; \ldots &lt; a_n$, consider the linear combination $q_1a_1 + q_2a_2 + \ldots + q_na_n = b$, using only integer values $q_k ≥ 0$.
 
-Note that for a given set of ak, it may be that not all values of b are possible. For instance, if a1 = 5 and a2 = 7, there are no q1 ≥ 0 and q2 ≥ 0 such that b could be 1, 2, 3, 4, 6, 8, 9, 11, 13, 16, 18 or 23.
+Note that for a given set of $a_k$, it may be that not all values of $b$ are possible. For instance, if $a_1 = 5$ and $a_2 = 7$, there are no $q_1 ≥ 0$ and $q_2 ≥ 0$ such that $b$ could be 1, 2, 3, 4, 6, 8, 9, 11, 13, 16, 18 or 23.
 
-In fact, 23 is the largest impossible value of b for a1 = 5 and a2 = 7. We therefore call f(5, 7) = 23. Similarly, it can be shown that f(6, 10, 15)=29 and f(14, 22, 77) = 195.
+In fact, 23 is the largest impossible value of $b$ for $a_1 = 5$ and $a_2 = 7$. We therefore call $f(5, 7) = 23$. Similarly, it can be shown that $f(6, 10, 15)=29$ and $f(14, 22, 77) = 195$.
 
-Find ∑ f(p*q,p*r,q\*r), where p, q and r are prime numbers and p &lt; q &lt; r &lt; 5000.
+Find $\sum f(pq,pr,qr)$, where $p$, $q$ and $r$ are prime numbers and $p &lt; q &lt; r &lt; 5000$.
 
 # --hints--
 
-`euler278()` should return 1228215747273908500.
+`linearCombinationOfSemiprimes()` should return `1228215747273908500`.
 
 ```js
-assert.strictEqual(euler278(), 1228215747273908500);
+assert.strictEqual(linearCombinationOfSemiprimes(), 1228215747273908500);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler278(), 1228215747273908500);
 ## --seed-contents--
 
 ```js
-function euler278() {
+function linearCombinationOfSemiprimes() {
 
   return true;
 }
 
-euler278();
+linearCombinationOfSemiprimes();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.md
index 9fc673b5ea4..9d50a5ebc61 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.md
@@ -1,21 +1,21 @@
 ---
 id: 5900f4841000cf542c50ff96
 title: 'Problem 279: Triangles with integral sides and an integral angle'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301929
 dashedName: problem-279-triangles-with-integral-sides-and-an-integral-angle
 ---
 
 # --description--
 
-How many triangles are there with integral sides, at least one integral angle (measured in degrees), and a perimeter that does not exceed 108?
+How many triangles are there with integral sides, at least one integral angle (measured in degrees), and a perimeter that does not exceed ${10}^8$?
 
 # --hints--
 
-`euler279()` should return 416577688.
+`trianglesWithIntegralSidesAndAngle()` should return `416577688`.
 
 ```js
-assert.strictEqual(euler279(), 416577688);
+assert.strictEqual(trianglesWithIntegralSidesAndAngle(), 416577688);
 ```
 
 # --seed--
@@ -23,12 +23,12 @@ assert.strictEqual(euler279(), 416577688);
 ## --seed-contents--
 
 ```js
-function euler279() {
+function trianglesWithIntegralSidesAndAngle() {
 
   return true;
 }
 
-euler279();
+trianglesWithIntegralSidesAndAngle();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.md
index a476199d1dc..eee50073f68 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3881000cf542c50fe9b
 title: 'Problem 28: Number spiral diagonals'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301930
 dashedName: problem-28-number-spiral-diagonals
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-280-ant-and-seeds.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-280-ant-and-seeds.md
index 642a7d802f9..5057b8bd47c 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-280-ant-and-seeds.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-280-ant-and-seeds.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4841000cf542c50ff97
 title: 'Problem 280: Ant and seeds'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301931
 dashedName: problem-280-ant-and-seeds
 ---
@@ -16,10 +16,10 @@ What's the expected number of steps until all seeds have been dropped in the top
 
 # --hints--
 
-`euler280()` should return 430.088247.
+`antAndSeeds()` should return `430.088247`.
 
 ```js
-assert.strictEqual(euler280(), 430.088247);
+assert.strictEqual(antAndSeeds(), 430.088247);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler280(), 430.088247);
 ## --seed-contents--
 
 ```js
-function euler280() {
+function antAndSeeds() {
 
   return true;
 }
 
-euler280();
+antAndSeeds();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md
index 9ac6cf33a6f..60b84a893f8 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f4861000cf542c50ff98
 title: 'Problem 281: Pizza Toppings'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301932
 dashedName: problem-281-pizza-toppings
 ---
 
 # --description--
 
-You are given a pizza (perfect circle) that has been cut into m·n equal pieces and you want to have exactly one topping on each slice.
+You are given a pizza (perfect circle) that has been cut into $m·n$ equal pieces and you want to have exactly one topping on each slice.
 
-Let f(m,n) denote the number of ways you can have toppings on the pizza with m different toppings (m ≥ 2), using each topping on exactly n slices (n ≥ 1). Reflections are considered distinct, rotations are not.
+Let $f(m,n)$ denote the number of ways you can have toppings on the pizza with $m$ different toppings ($m ≥ 2$), using each topping on exactly $n$ slices ($n ≥ 1$). Reflections are considered distinct, rotations are not.
 
-Thus, for instance, f(2,1) = 1, f(2,2) = f(3,1) = 2 and f(3,2) = 16. f(3,2) is shown below:
+Thus, for instance, $f(2,1) = 1$, $f(2,2) = f(3,1) = 2$ and $f(3,2) = 16$. $f(3,2)$ is shown below:
 
-Find the sum of all f(m,n) such that f(m,n) ≤ 1015.
+<img class="img-responsive center-block" alt="animation with 16 ways to have 3 different toppings on 2 slices each" src="https://cdn.freecodecamp.org/curriculum/project-euler/pizza-toppings.gif" style="background-color: white; padding: 10px;" />
+
+Find the sum of all $f(m,n)$ such that $f(m,n) ≤ {10}^{15}$.
 
 # --hints--
 
-`euler281()` should return 1485776387445623.
+`pizzaToppings()` should return `1485776387445623`.
 
 ```js
-assert.strictEqual(euler281(), 1485776387445623);
+assert.strictEqual(pizzaToppings(), 1485776387445623);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler281(), 1485776387445623);
 ## --seed-contents--
 
 ```js
-function euler281() {
+function pizzaToppings() {
 
   return true;
 }
 
-euler281();
+pizzaToppings();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md
index 5abd58ec44b..c9cbb75087d 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md
@@ -1,25 +1,28 @@
 ---
 id: 5900f4861000cf542c50ff99
 title: 'Problem 282: The Ackermann function'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301933
 dashedName: problem-282-the-ackermann-function
 ---
 
 # --description--
 
-For non-negative integers m, n, the Ackermann function A(m, n) is defined as follows:
+For non-negative integers $m$, $n$, the Ackermann function $A(m, n)$ is defined as follows:
 
-For example A(1, 0) = 2, A(2, 2) = 7 and A(3, 4) = 125.
+$$A(m, n) = \begin{cases} n + 1                 & \text{if $m = 0$}             \\\\
+A(m - 1, 1)           & \text{if $m > 0$ and $n = 0$} \\\\ A(m - 1, A(m, n - 1)) & \text{if $m > 0$ and $n > 0$} \end{cases}$$
 
-Find A(n, n) and give your answer mod 148.
+For example $A(1, 0) = 2$, $A(2, 2) = 7$ and $A(3, 4) = 125$.
+
+Find $\displaystyle\sum_{n = 0}^6 A(n, n)$ and give your answer mod ${14}^8$.
 
 # --hints--
 
-`euler282()` should return 1098988351.
+`ackermanFunction()` should return `1098988351`.
 
 ```js
-assert.strictEqual(euler282(), 1098988351);
+assert.strictEqual(ackermanFunction(), 1098988351);
 ```
 
 # --seed--
@@ -27,12 +30,12 @@ assert.strictEqual(euler282(), 1098988351);
 ## --seed-contents--
 
 ```js
-function euler282() {
+function ackermanFunction() {
 
   return true;
 }
 
-euler282();
+ackermanFunction();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md
index e15776ec08f..e32d0d74b9d 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md
@@ -1,8 +1,8 @@
 ---
 id: 5900f4881000cf542c50ff9a
 title: >-
-  Problem 283: Integer sided triangles for which the area * perimeter ratio is integral
-challengeType: 5
+  Problem 283: Integer sided triangles for which the area / perimeter ratio is integral
+challengeType: 1
 forumTopicId: 301934
 dashedName: >-
   problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral
@@ -12,20 +12,20 @@ dashedName: >-
 
 Consider the triangle with sides 6, 8 and 10. It can be seen that the perimeter and the area are both equal to 24.
 
-So the area/perimeter ratio is equal to 1.
+So the $\frac{\text{area}}{\text{perimeter}}$ ratio is equal to 1.
 
 Consider also the triangle with sides 13, 14 and 15. The perimeter equals 42 while the area is equal to 84.
 
-So for this triangle the area/perimeter ratio is equal to 2.
+So for this triangle the $\frac{\text{area}}{\text{perimeter}}$ ratio is equal to 2.
 
 Find the sum of the perimeters of all integer sided triangles for which the area/perimeter ratios are equal to positive integers not exceeding 1000.
 
 # --hints--
 
-`euler283()` should return 28038042525570324.
+`integralAreaPerimeterRatio()` should return `28038042525570324`.
 
 ```js
-assert.strictEqual(euler283(), 28038042525570324);
+assert.strictEqual(integralAreaPerimeterRatio(), 28038042525570324);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler283(), 28038042525570324);
 ## --seed-contents--
 
 ```js
-function euler283() {
+function integralAreaPerimeterRatio() {
 
   return true;
 }
 
-euler283();
+integralAreaPerimeterRatio();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-284-steady-squares.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-284-steady-squares.md
index 818483669ec..d6c86b00055 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-284-steady-squares.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-284-steady-squares.md
@@ -1,27 +1,33 @@
 ---
 id: 5900f4891000cf542c50ff9b
 title: 'Problem 284: Steady Squares'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301935
 dashedName: problem-284-steady-squares
 ---
 
 # --description--
 
-The 3-digit number 376 in the decimal numbering system is an example of numbers with the special property that its square ends with the same digits: 3762 = 141376. Let's call a number with this property a steady square.
+The 3-digit number 376 in the decimal numbering system is an example of numbers with the special property that its square ends with the same digits: ${376}^2 = 141376$. Let's call a number with this property a steady square.
 
-Steady squares can also be observed in other numbering systems. In the base 14 numbering system, the 3-digit number c37 is also a steady square: c372 = aa0c37, and the sum of its digits is c+3+7=18 in the same numbering system. The letters a, b, c and d are used for the 10, 11, 12 and 13 digits respectively, in a manner similar to the hexadecimal numbering system.
+Steady squares can also be observed in other numbering systems. In the base 14 numbering system, the 3-digit number $c37$ is also a steady square: $c37^2 = aa0c37$, and the sum of its digits is $c+3+7=18$ in the same numbering system. The letters $a$, $b$, $c$ and $d$ are used for the 10, 11, 12 and 13 digits respectively, in a manner similar to the hexadecimal numbering system.
 
-For 1 ≤ n ≤ 9, the sum of the digits of all the n-digit steady squares in the base 14 numbering system is 2d8 (582 decimal). Steady squares with leading 0's are not allowed.
+For $1 ≤ n ≤ 9$, the sum of the digits of all the $n$-digit steady squares in the base 14 numbering system is $2d8$ (582 decimal). Steady squares with leading 0's are not allowed.
 
-Find the sum of the digits of all the n-digit steady squares in the base 14 numbering system for 1 ≤ n ≤ 10000 (decimal) and give your answer in the base 14 system using lower case letters where necessary.
+Find the sum of the digits of all the $n$-digit steady squares in the base 14 numbering system for $1 ≤ n ≤ 10000$ (decimal) and give your answer as a string in the base 14 system using lower case letters where necessary.
 
 # --hints--
 
-`euler284()` should return 5a411d7b.
+`steadySquares()` should return a string.
 
 ```js
-assert.strictEqual(euler284(), '5a411d7b');
+assert(typeof steadySquares() === 'string');
+```
+
+`steadySquares()` should return the string `5a411d7b`.
+
+```js
+assert.strictEqual(steadySquares(), '5a411d7b');
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler284(), '5a411d7b');
 ## --seed-contents--
 
 ```js
-function euler284() {
+function steadySquares() {
 
   return true;
 }
 
-euler284();
+steadySquares();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-285-pythagorean-odds.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-285-pythagorean-odds.md
index 12ddabd7222..5c6e49167f9 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-285-pythagorean-odds.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-285-pythagorean-odds.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f48a1000cf542c50ff9c
 title: 'Problem 285: Pythagorean odds'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301936
 dashedName: problem-285-pythagorean-odds
 ---
 
 # --description--
 
-Albert chooses a positive integer k, then two real numbers a, b are randomly chosen in the interval \[0,1] with uniform distribution.
+Albert chooses a positive integer $k$, then two real numbers $a$, $b$ are randomly chosen in the interval [0,1] with uniform distribution.
 
-The square root of the sum (k·a+1)2 + (k·b+1)2 is then computed and rounded to the nearest integer. If the result is equal to k, he scores k points; otherwise he scores nothing.
+The square root of the sum ${(ka + 1)}^2 + {(kb + 1)}^2$ is then computed and rounded to the nearest integer. If the result is equal to $k$, he scores $k$ points; otherwise he scores nothing.
 
-For example, if k = 6, a = 0.2 and b = 0.85, then (k·a+1)2 + (k·b+1)2 = 42.05. The square root of 42.05 is 6.484... and when rounded to the nearest integer, it becomes 6. This is equal to k, so he scores 6 points.
+For example, if $k = 6$, $a = 0.2$ and $b = 0.85$, then ${(ka + 1)}^2 + {(kb + 1)}^2 = 42.05$. The square root of 42.05 is 6.484... and when rounded to the nearest integer, it becomes 6. This is equal to $k$, so he scores 6 points.
 
-It can be shown that if he plays 10 turns with k = 1, k = 2, ..., k = 10, the expected value of his total score, rounded to five decimal places, is 10.20914.
+It can be shown that if he plays 10 turns with $k = 1, k = 2, \ldots, k = 10$, the expected value of his total score, rounded to five decimal places, is 10.20914.
 
-If he plays 105 turns with k = 1, k = 2, k = 3, ..., k = 105, what is the expected value of his total score, rounded to five decimal places?
+If he plays ${10}^5$ turns with $k = 1, k = 2, k = 3, \ldots, k = {10}^5$, what is the expected value of his total score, rounded to five decimal places?
 
 # --hints--
 
-`euler285()` should return 157055.80999.
+`pythagoreanOdds()` should return `157055.80999`.
 
 ```js
-assert.strictEqual(euler285(), 157055.80999);
+assert.strictEqual(pythagoreanOdds(), 157055.80999);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler285(), 157055.80999);
 ## --seed-contents--
 
 ```js
-function euler285() {
+function pythagoreanOdds() {
 
   return true;
 }
 
-euler285();
+pythagoreanOdds();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-286-scoring-probabilities.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-286-scoring-probabilities.md
index abb357c47a2..a5a2a524139 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-286-scoring-probabilities.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-286-scoring-probabilities.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f48a1000cf542c50ff9d
-title: 'Problem 286: Scoring probabilities'
-challengeType: 5
+title: '問題 286：計分概率'
+challengeType: 1
 forumTopicId: 301937
 dashedName: problem-286-scoring-probabilities
 ---
 
 # --description--
 
-Barbara is a mathematician and a basketball player. She has found that the probability of scoring a point when shooting from a distance x is exactly (1 - x/q), where q is a real constant greater than 50.
+芭芭拉（Barbara）是數學家和籃球運動員。 She has found that the probability of scoring a point when shooting from a distance $x$ is exactly ($1 - \frac{x}{q}$), where $q$ is a real constant greater than 50.
 
-During each practice run, she takes shots from distances x = 1, x = 2, ..., x = 50 and, according to her records, she has precisely a 2 % chance to score a total of exactly 20 points.
+During each practice run, she takes shots from distances $x = 1, x = 2, \ldots, x = 50$ and, according to her records, she has precisely a 2 % chance to score a total of exactly 20 points.
 
-Find q and give your answer rounded to 10 decimal places.
+Find $q$ and give your answer rounded to 10 decimal places.
 
 # --hints--
 
-`euler286()` should return 52.6494571953.
+`scoringProbabilities()` should return `52.6494571953`.
 
 ```js
-assert.strictEqual(euler286(), 52.6494571953);
+assert.strictEqual(scoringProbabilities(), 52.6494571953);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler286(), 52.6494571953);
 ## --seed-contents--
 
 ```js
-function euler286() {
+function scoringProbabilities() {
 
   return true;
 }
 
-euler286();
+scoringProbabilities();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md
index 8d11a248e2f..2d86e40868c 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md
@@ -1,37 +1,42 @@
 ---
 id: 5900f48b1000cf542c50ff9e
 title: 'Problem 287: Quadtree encoding (a simple compression algorithm)'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301938
 dashedName: problem-287-quadtree-encoding-a-simple-compression-algorithm
 ---
 
 # --description--
 
-The quadtree encoding allows us to describe a 2N×2N black and white image as a sequence of bits (0 and 1). Those sequences are to be read from left to right like this:
+The quadtree encoding allows us to describe a $2^N×2^N$ black and white image as a sequence of bits (0 and 1). 這些序列應從左向右讀取，如下所示：
 
-the first bit deals with the complete 2N×2N region;
+- the first bit deals with the complete $2^N×2^N$ region;
+- “ 0”表示拆分：
+  - the current $2^n×2^n$ region is divided into 4 sub-regions of dimension $2^{n - 1}×2^{n - 1}$,
+  - the next bits contains the description of the top left, top right, bottom left and bottom right sub-regions - in that order;
+- “10”表示當前區域只包含黑色像素；
+- "11" indicates that the current region contains only white pixels.
 
-"0" denotes a split:
+Consider the following 4×4 image (colored marks denote places where a split can occur):
 
-the current 2n×2n region is divided into 4 sub-regions of dimension 2n-1×2n-1,
+<img class="img-responsive center-block" alt="4x4 image with colored marks denoting place where split can occur" src="https://cdn.freecodecamp.org/curriculum/project-euler/quadtree-encoding-a-simple-compression-algorithm.gif" style="background-color: white; padding: 10px;" />
 
-the next bits contains the description of the top left, top right, bottom left and bottom right sub-regions - in that order;
+This image can be described by several sequences, for example : "<strong><span style="color: red">0</span></strong><strong><span style="color: blue">0</span></strong>10101010<strong><span style="color: green">0</span></strong>1011111011<strong><span style="color: orange">0</span></strong>10101010", of length 30, or "<strong><span style="color: red">0</span></strong>10<strong><span style="color: green">0</span></strong>101111101110", of length 16, which is the minimal sequence for this image.
 
-"10" indicates that the current region contains only black pixels;
+For a positive integer $N$, define $D_N$ as the $2^N×2^N$ image with the following coloring scheme:
 
-"11" indicates that the current region contains only white pixels.Consider the following 4×4 image (colored marks denote places where a split can occur):
+- the pixel with coordinates $x = 0$, $y = 0$ corresponds to the bottom left pixel,
+- if ${(x - 2^{N - 1})}^2 + {(y - 2^{N - 1})}^2 ≤ 2^{2N - 2}$ then the pixel is black,
+- otherwise the pixel is white.
 
-This image can be described by several sequences, for example : "001010101001011111011010101010", of length 30, or "0100101111101110", of length 16, which is the minimal sequence for this image.
-
-For a positive integer N, define DN as the 2N×2N image with the following coloring scheme: the pixel with coordinates x = 0, y = 0 corresponds to the bottom left pixel, if (x - 2N-1)2 + (y - 2N-1)2 ≤ 22N-2 then the pixel is black, otherwise the pixel is white.What is the length of the minimal sequence describing D24 ?
+What is the length of the minimal sequence describing $D_{24}$?
 
 # --hints--
 
-`euler287()` should return 313135496.
+`quadtreeEncoding()` should return `313135496`.
 
 ```js
-assert.strictEqual(euler287(), 313135496);
+assert.strictEqual(quadtreeEncoding(), 313135496);
 ```
 
 # --seed--
@@ -39,12 +44,12 @@ assert.strictEqual(euler287(), 313135496);
 ## --seed-contents--
 
 ```js
-function euler287() {
+function quadtreeEncoding() {
 
   return true;
 }
 
-euler287();
+quadtreeEncoding();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md
index 28a2e301ceb..cd92a15cd8c 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md
@@ -1,31 +1,32 @@
 ---
 id: 5900f48d1000cf542c50ff9f
 title: 'Problem 288: An enormous factorial'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301939
 dashedName: problem-288-an-enormous-factorial
 ---
 
 # --description--
 
-For any prime p the number N(p,q) is defined by
+For any prime $p$ the number $N(p,q)$ is defined by $N(p,q) = \sum_{n=0}^q T_n \times p^n$ with $T_n$ generated by the following random number generator:
 
-N(p,q) = ∑n=0 to q Tn\*pn with Tn generated by the following random number generator:
+$$\begin{align}   & S_0 = 290797 \\\\
+  & S_{n + 1} = {S_n}^2\bmod 50\\,515\\,093 \\\\ & T_n = S_n\bmod p \end{align}$$
 
-S0 = 290797 Sn+1 = Sn2 mod 50515093 Tn = Sn mod p
+Let $Nfac(p,q)$ be the factorial of $N(p,q)$.
 
-Let Nfac(p,q) be the factorial of N(p,q). Let NF(p,q) be the number of factors p in Nfac(p,q).
+Let $NF(p,q)$ be the number of factors $p$ in $Nfac(p,q)$.
 
-You are given that NF(3,10000) mod 320=624955285.
+You are given that $NF(3,10000) \bmod 3^{20} = 624\\,955\\,285$.
 
-Find NF(61,107) mod 6110
+Find $NF(61,{10}^7)\bmod {61}^{10}$.
 
 # --hints--
 
-`euler288()` should return 605857431263982000.
+`enormousFactorial()` should return `605857431263982000`.
 
 ```js
-assert.strictEqual(euler288(), 605857431263982000);
+assert.strictEqual(enormousFactorial(), 605857431263982000);
 ```
 
 # --seed--
@@ -33,12 +34,12 @@ assert.strictEqual(euler288(), 605857431263982000);
 ## --seed-contents--
 
 ```js
-function euler288() {
+function enormousFactorial() {
 
   return true;
 }
 
-euler288();
+enormousFactorial();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md
index fcac68664d9..e491cab3612 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f48d1000cf542c50ffa0
 title: 'Problem 289: Eulerian Cycles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301940
 dashedName: problem-289-eulerian-cycles
 ---
 
 # --description--
 
-Let C(x,y) be a circle passing through the points (x, y), (x, y+1), (x+1, y) and (x+1, y+1).
+Let $C(x,y)$ be a circle passing through the points ($x$, $y$), ($x$, $y + 1$), ($x + 1$, $y$) and ($x + 1$, $y + 1$).
 
-For positive integers m and n, let E(m,n) be a configuration which consists of the m·n circles: { C(x,y): 0 ≤ x &lt; m, 0 ≤ y &lt; n, x and y are integers }
+For positive integers $m$ and $n$, let $E(m,n)$ be a configuration which consists of the $m·n$ circles: { $C(x,y)$: $0 ≤ x &lt; m$, $0 ≤ y &lt; n$, $x$ and $y$ are integers }
 
-An Eulerian cycle on E(m,n) is a closed path that passes through each arc exactly once. Many such paths are possible on E(m,n), but we are only interested in those which are not self-crossing: A non-crossing path just touches itself at lattice points, but it never crosses itself.
+An Eulerian cycle on $E(m,n)$ is a closed path that passes through each arc exactly once. Many such paths are possible on $E(m,n)$, but we are only interested in those which are not self-crossing: A non-crossing path just touches itself at lattice points, but it never crosses itself.
 
-The image below shows E(3,3) and an example of an Eulerian non-crossing path.
+The image below shows $E(3,3)$ and an example of an Eulerian non-crossing path.
 
-Let L(m,n) be the number of Eulerian non-crossing paths on E(m,n). For example, L(1,2) = 2, L(2,2) = 37 and L(3,3) = 104290.
+<img class="img-responsive center-block" alt="Eulerian cycle E(3, 3) and Eulerian non-crossing path" src="https://cdn.freecodecamp.org/curriculum/project-euler/eulerian-cycles.gif" style="background-color: white; padding: 10px;" />
 
-Find L(6,10) mod 1010.
+Let $L(m,n)$ be the number of Eulerian non-crossing paths on $E(m,n)$. For example, $L(1,2) = 2$, $L(2,2) = 37$ and $L(3,3) = 104290$.
+
+Find $L(6,10)\bmod {10}^{10}$.
 
 # --hints--
 
-`euler289()` should return 6567944538.
+`eulerianCycles()` should return `6567944538`.
 
 ```js
-assert.strictEqual(euler289(), 6567944538);
+assert.strictEqual(eulerianCycles(), 6567944538);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler289(), 6567944538);
 ## --seed-contents--
 
 ```js
-function euler289() {
+function eulerianCycles() {
 
   return true;
 }
 
-euler289();
+eulerianCycles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
index 28c05dfc85d..4b8f00162ee 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f3891000cf542c50fe9c
 title: 'Problem 29: Distinct powers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301941
 dashedName: problem-29-distinct-powers
 ---
 
 # --description--
 
-Consider all integer combinations of ab for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
+Consider all integer combinations of $a^b$ for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
 
 <div style='padding-left: 4em;'>
   2<sup>2</sup>=4, 2<sup>3</sup>=8, 2<sup>4</sup>=16, 2<sup>5</sup>=32 <br>
@@ -23,7 +23,7 @@ If they are then placed in numerical order, with any repeats removed, we get the
   4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
 </div>
 
-How many distinct terms are in the sequence generated by `ab` for 2 ≤ `a` ≤ `n` and 2 ≤ `b` ≤ `n`?
+How many distinct terms are in the sequence generated by $a^b$ for 2 ≤ `a` ≤ `n` and 2 ≤ `b` ≤ `n`?
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-290-digital-signature.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-290-digital-signature.md
index e46dfedd830..a6b3636eefd 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-290-digital-signature.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-290-digital-signature.md
@@ -1,21 +1,21 @@
 ---
 id: 5900f48f1000cf542c50ffa1
 title: 'Problem 290: Digital Signature'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301942
 dashedName: problem-290-digital-signature
 ---
 
 # --description--
 
-How many integers 0 ≤ n &lt; 1018 have the property that the sum of the digits of n equals the sum of digits of 137n?
+How many integers $0 ≤ n &lt; {10}^{18}$ have the property that the sum of the digits of $n$ equals the sum of digits of $137n$?
 
 # --hints--
 
-`euler290()` should return 20444710234716470.
+`digitalSignature()` should return `20444710234716470`.
 
 ```js
-assert.strictEqual(euler290(), 20444710234716470);
+assert.strictEqual(digitalSignature(), 20444710234716470);
 ```
 
 # --seed--
@@ -23,12 +23,12 @@ assert.strictEqual(euler290(), 20444710234716470);
 ## --seed-contents--
 
 ```js
-function euler290() {
+function digitalSignature() {
 
   return true;
 }
 
-euler290();
+digitalSignature();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.md
index 0c7d704d9f4..bb33727271a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.md
@@ -1,23 +1,23 @@
 ---
 id: 5900f48f1000cf542c50ffa2
 title: 'Problem 291: Panaitopol Primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301943
 dashedName: problem-291-panaitopol-primes
 ---
 
 # --description--
 
-A prime number p is called a Panaitopol prime if for some positive integersx and y.
+A prime number $p$ is called a Panaitopol prime if $p = \frac{x^4 - y^4}{x^3 + y^3}$ for some positive integers $x$ and $y$.
 
-Find how many Panaitopol primes are less than 5×1015.
+Find how many Panaitopol primes are less than $5 × {10}^{15}$.
 
 # --hints--
 
-`euler291()` should return 4037526.
+`panaitopolPrimes()` should return `4037526`.
 
 ```js
-assert.strictEqual(euler291(), 4037526);
+assert.strictEqual(panaitopolPrimes(), 4037526);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler291(), 4037526);
 ## --seed-contents--
 
 ```js
-function euler291() {
+function panaitopolPrimes() {
 
   return true;
 }
 
-euler291();
+panaitopolPrimes();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.md
index 446e8755315..8e0dd899454 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.md
@@ -1,31 +1,34 @@
 ---
 id: 5900f4911000cf542c50ffa3
 title: 'Problem 292: Pythagorean Polygons'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301944
 dashedName: problem-292-pythagorean-polygons
 ---
 
 # --description--
 
-We shall define a pythagorean polygon to be a convex polygon with the following properties:there are at least three vertices,
+We shall define a pythagorean polygon to be a convex polygon with the following properties:
 
-no three vertices are aligned,
+- there are at least three vertices,
+- no three vertices are aligned,
+- each vertex has integer coordinates,
+- each edge has integer length.
 
-each vertex has integer coordinates,
-
-each edge has integer length.For a given integer n, define P(n) as the number of distinct pythagorean polygons for which the perimeter is ≤ n.
+For a given integer $n$, define $P(n)$ as the number of distinct pythagorean polygons for which the perimeter is $≤ n$.
 
 Pythagorean polygons should be considered distinct as long as none is a translation of another.
 
-You are given that P(4) = 1, P(30) = 3655 and P(60) = 891045. Find P(120).
+You are given that $P(4) = 1$, $P(30) = 3655$ and $P(60) = 891045$.
+
+Find $P(120)$.
 
 # --hints--
 
-`euler292()` should return 3600060866.
+`pythagoreanPolygons()` should return `3600060866`.
 
 ```js
-assert.strictEqual(euler292(), 3600060866);
+assert.strictEqual(pythagoreanPolygons(), 3600060866);
 ```
 
 # --seed--
@@ -33,12 +36,12 @@ assert.strictEqual(euler292(), 3600060866);
 ## --seed-contents--
 
 ```js
-function euler292() {
+function pythagoreanPolygons() {
 
   return true;
 }
 
-euler292();
+pythagoreanPolygons();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.md
index 18307e7b042..7ebf1248e66 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f4931000cf542c50ffa4
-title: 'Problem 293: Pseudo-Fortunate Numbers'
-challengeType: 5
+title: '問題 293：僞幸運數'
+challengeType: 1
 forumTopicId: 301945
 dashedName: problem-293-pseudo-fortunate-numbers
 ---
 
 # --description--
 
-An even positive integer N will be called admissible, if it is a power of 2 or its distinct prime factors are consecutive primes.
+An even positive integer $N$ will be called admissible, if it is a power of 2 or its distinct prime factors are consecutive primes.
 
-The first twelve admissible numbers are 2,4,6,8,12,16,18,24,30,32,36,48.
+The first twelve admissible numbers are 2, 4, 6, 8, 12, 16, 18, 24, 30, 32, 36, 48.
 
-If N is admissible, the smallest integer M > 1 such that N+M is prime, will be called the pseudo-Fortunate number for N.
+If $N$ is admissible, the smallest integer $M > 1$ such that $N + M$ is prime, will be called the pseudo-Fortunate number for $N$.
 
-For example, N=630 is admissible since it is even and its distinct prime factors are the consecutive primes 2,3,5 and 7. The next prime number after 631 is 641; hence, the pseudo-Fortunate number for 630 is M=11. It can also be seen that the pseudo-Fortunate number for 16 is 3.
+For example, $N = 630$ is admissible since it is even and its distinct prime factors are the consecutive primes 2, 3, 5 and 7. The next prime number after 631 is 641; hence, the pseudo-Fortunate number for 630 is $M = 11$. It can also be seen that the pseudo-Fortunate number for 16 is 3.
 
-Find the sum of all distinct pseudo-Fortunate numbers for admissible numbers N less than 109.
+Find the sum of all distinct pseudo-Fortunate numbers for admissible numbers $N$ less than ${10}^9$.
 
 # --hints--
 
-`euler293()` should return 2209.
+`pseudoFortunateNumbers()` should return `2209`.
 
 ```js
-assert.strictEqual(euler293(), 2209);
+assert.strictEqual(pseudoFortunateNumbers(), 2209);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler293(), 2209);
 ## --seed-contents--
 
 ```js
-function euler293() {
+function pseudoFortunateNumbers() {
 
   return true;
 }
 
-euler293();
+pseudoFortunateNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.md
index b7bc62a5f13..b32ebc882de 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.md
@@ -1,29 +1,30 @@
 ---
 id: 5900f4931000cf542c50ffa5
 title: 'Problem 294: Sum of digits - experience #23'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301946
 dashedName: problem-294-sum-of-digits---experience-23
 ---
 
 # --description--
 
-For a positive integer k, define d(k) as the sum of the digits of k in its usual decimal representation.
+For a positive integer $k$, define $d(k)$ as the sum of the digits of $k$ in its usual decimal representation. Thus $d(42) = 4 + 2 = 6$.
 
-Thus d(42) = 4+2 = 6.
+For a positive integer $n$, define $S(n)$ as the number of positive integers $k &lt; {10}^n$ with the following properties:
 
-For a positive integer n, define S(n) as the number of positive integers k &lt; 10n with the following properties : k is divisible by 23 and d(k) = 23.
+- $k$ is divisible by 23 and,
+- $d(k) = 23$.
 
-You are given that S(9) = 263626 and S(42) = 6377168878570056.
+You are given that $S(9) = 263\\,626$ and $S(42) = 6\\,377\\,168\\,878\\,570\\,056$.
 
-Find S(1112) and give your answer mod 109.
+Find $S({11}^{12})$ and give your answer $\bmod {10}^9$.
 
 # --hints--
 
-`euler294()` should return 789184709.
+`experience23()` should return `789184709`.
 
 ```js
-assert.strictEqual(euler294(), 789184709);
+assert.strictEqual(experience23(), 789184709);
 ```
 
 # --seed--
@@ -31,12 +32,12 @@ assert.strictEqual(euler294(), 789184709);
 ## --seed-contents--
 
 ```js
-function euler294() {
+function experience23() {
 
   return true;
 }
 
-euler294();
+experience23();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md
index 70d1de6d608..0aed3487b21 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4931000cf542c50ffa6
 title: 'Problem 295: Lenticular holes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301947
 dashedName: problem-295-lenticular-holes
 ---
@@ -10,30 +10,33 @@ dashedName: problem-295-lenticular-holes
 
 We call the convex area enclosed by two circles a lenticular hole if:
 
-The centres of both circles are on lattice points.
+- 兩個圓的中心都在晶格點上。
+- 兩個圓在兩個不同的晶格點處相交。
+- 被兩個圓包圍的凸區域的內部不包含任何晶格點。
 
-The two circles intersect at two distinct lattice points.
+Consider the circles:
 
-The interior of the convex area enclosed by both circles does not contain any lattice points.
+$$\begin{align}   & C_0: x^2 + y^2 = 25 \\\\
+  & C_1: {(x + 4)}^2 + {(y - 4)}^2 = 1 \\\\ & C_2: {(x - 12)}^2 + {(y - 4)}^2 = 65 \end{align}$$
 
-Consider the circles: C0: x2+y2=25 C1: (x+4)2+(y-4)2=1 C2: (x-12)2+(y-4)2=65
+The circles $C_0$, $C_1$ and $C_2$ are drawn in the picture below.
 
-The circles C0, C1 and C2 are drawn in the picture below.
+<img class="img-responsive center-block" alt="C_0, C_1 and C_2 circles" src="https://cdn.freecodecamp.org/curriculum/project-euler/lenticular-holes.gif" style="background-color: white; padding: 10px;" />
 
-C0 and C1 form a lenticular hole, as well as C0 and C2.
+$C_0$ and $C_1$ form a lenticular hole, as well as $C_0$ and $C_2$.
 
-We call an ordered pair of positive real numbers (r1, r2) a lenticular pair if there exist two circles with radii r1 and r2 that form a lenticular hole. We can verify that (1, 5) and (5, √65) are the lenticular pairs of the example above.
+We call an ordered pair of positive real numbers ($r_1$, $r_2$) a lenticular pair if there exist two circles with radii $r_1$ and $r_2$ that form a lenticular hole. We can verify that ($1$, $5$) and ($5$, $\sqrt{65}$) are the lenticular pairs of the example above.
 
-Let L(N) be the number of distinct lenticular pairs (r1, r2) for which 0 &lt; r1 ≤ r2 ≤ N. We can verify that L(10) = 30 and L(100) = 3442.
+Let $L(N)$ be the number of distinct lenticular pairs ($r_1$, $r_2$) for which $0 &lt; r_1 ≤ r_2 ≤ N$. We can verify that $L(10) = 30$ and $L(100) = 3442$.
 
-Find L(100 000).
+Find $L(100\\,000)$.
 
 # --hints--
 
-`euler295()` should return 4884650818.
+`lenticularHoles()` should return `4884650818`.
 
 ```js
-assert.strictEqual(euler295(), 4884650818);
+assert.strictEqual(lenticularHoles(), 4884650818);
 ```
 
 # --seed--
@@ -41,12 +44,12 @@ assert.strictEqual(euler295(), 4884650818);
 ## --seed-contents--
 
 ```js
-function euler295() {
+function lenticularHoles() {
 
   return true;
 }
 
-euler295();
+lenticularHoles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md
index 0d269dca3cc..660d66eabb4 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md
@@ -1,25 +1,27 @@
 ---
 id: 5900f4941000cf542c50ffa7
 title: 'Problem 296: Angular Bisector and Tangent'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301948
 dashedName: problem-296-angular-bisector-and-tangent
 ---
 
 # --description--
 
-Given is an integer sided triangle ABC with BC ≤ AC ≤ AB.k is the angular bisector of angle ACB.m is the tangent at C to the circumscribed circle of ABC.n is a line parallel to m through B.
+Given is an integer sided triangle $ABC$ with $BC ≤ AC ≤ AB$. $k$ is the angular bisector of angle $ACB$. $m$ is the tangent at $C$ to the circumscribed circle of $ABC$. $n$ is a line parallel to $m$ through $B$.
 
-The intersection of n and k is called E.
+The intersection of $n$ and $k$ is called $E$.
 
-How many triangles ABC with a perimeter not exceeding 100 000 exist such that BE has integral length?
+<img class="img-responsive center-block" alt="triangle ABC, with k - the angular bisector of angle ACB, m - tangent at point C, n - line parallel to m through B, and point E - intersection of k and n" src="https://cdn.freecodecamp.org/curriculum/project-euler/angular-bisector-and-tangent.gif" style="background-color: white; padding: 10px;" />
+
+How many triangles $ABC$ with a perimeter not exceeding $100\\,000$ exist such that $BE$ has integral length?
 
 # --hints--
 
-`euler296()` should return 1137208419.
+`angularBisectorAndTangent()` should return `1137208419`.
 
 ```js
-assert.strictEqual(euler296(), 1137208419);
+assert.strictEqual(angularBisectorAndTangent(), 1137208419);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler296(), 1137208419);
 ## --seed-contents--
 
 ```js
-function euler296() {
+function angularBisectorAndTangent() {
 
   return true;
 }
 
-euler296();
+angularBisectorAndTangent();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.md
index 55d96b520c6..55f3adbfd1c 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4951000cf542c50ffa8
 title: 'Problem 297: Zeckendorf Representation'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301949
 dashedName: problem-297-zeckendorf-representation
 ---
@@ -12,18 +12,24 @@ Each new term in the Fibonacci sequence is generated by adding the previous two
 
 Starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89.
 
-Every positive integer can be uniquely written as a sum of nonconsecutive terms of the Fibonacci sequence. For example, 100 = 3 + 8 + 89. Such a sum is called the Zeckendorf representation of the number.
+Every positive integer can be uniquely written as a sum of nonconsecutive terms of the Fibonacci sequence. For example, 100 = 3 + 8 + 89.
 
-For any integer n>0, let z(n) be the number of terms in the Zeckendorf representation of n. Thus, z(5) = 1, z(14) = 2, z(100) = 3 etc. Also, for 0&lt;n&lt;106, ∑ z(n) = 7894453.
+Such a sum is called the Zeckendorf representation of the number.
 
-Find ∑ z(n) for 0&lt;n&lt;1017.
+For any integer $n>0$, let $z(n)$ be the number of terms in the Zeckendorf representation of $n$.
+
+Thus, $z(5) = 1$, $z(14) = 2$, $z(100) = 3$ etc.
+
+Also, for $0 &lt; n &lt; {10}^6$, $\sum z(n) = 7\\,894\\,453$.
+
+Find $\sum z(n)$ for $0 &lt; n &lt; {10}^{17}$.
 
 # --hints--
 
-`euler297()` should return 2252639041804718000.
+`zeckendorfRepresentation()` should return `2252639041804718000`.
 
 ```js
-assert.strictEqual(euler297(), 2252639041804718000);
+assert.strictEqual(zeckendorfRepresentation(), 2252639041804718000);
 ```
 
 # --seed--
@@ -31,12 +37,12 @@ assert.strictEqual(euler297(), 2252639041804718000);
 ## --seed-contents--
 
 ```js
-function euler297() {
+function zeckendorfRepresentation() {
 
   return true;
 }
 
-euler297();
+zeckendorfRepresentation();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md
index a9c0c8ad7e0..debc5e824bc 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md
@@ -1,27 +1,40 @@
 ---
 id: 5900f4971000cf542c50ffa9
-title: 'Problem 298: Selective Amnesia'
-challengeType: 5
+title: '問題 298：選擇性健忘症'
+challengeType: 1
 forumTopicId: 301950
 dashedName: problem-298-selective-amnesia
 ---
 
 # --description--
 
-Larry and Robin play a memory game involving of a sequence of random numbers between 1 and 10, inclusive, that are called out one at a time. Each player can remember up to 5 previous numbers. When the called number is in a player's memory, that player is awarded a point. If it's not, the player adds the called number to his memory, removing another number if his memory is full.
+拉里（Larry）和羅賓（Robin）玩着一場記憶遊戲，其中涉及一個隨機數序列，介於1到10之間（含1和10），每次被召喚一個。 每個玩家最多可以記住 5 個先前的數字。 當被叫號碼在玩家的記憶中時，該玩家將獲得積分。 如果不是，玩家將被叫號碼添加到他的記憶中，如果他的記憶已滿，則刪除另一個號碼。
 
-Both players start with empty memories. Both players always add new missed numbers to their memory but use a different strategy in deciding which number to remove: Larry's strategy is to remove the number that hasn't been called in the longest time. Robin's strategy is to remove the number that's been in the memory the longest time.
+兩位選手都從空白的記憶開始。 兩個玩家總是在他們的記憶中添加新的錯過的號碼，但在決定刪除哪個號碼時使用不同的策略：拉里的策略是刪除最長時間沒有被叫到的號碼。 Robin 的策略是刪除記憶中最長時間的數字。
 
-Example game:Turn Callednumber Larry'smemory Larry'sscore Robin'smemory Robin'sscore 1 1 1 0 1 0 2 2 1,2 0 1,2 0 3 4 1,2,4 0 1,2,4 0 4 6 1,2,4,6 0 1,2,4,6 0 5 1 1,2,4,6 1 1,2,4,6 1 6 8 1,2,4,6,8 1 1,2,4,6,8 1 7 10 1,4,6,8,10 1 2,4,6,8,10 1 8 2 1,2,6,8,10 1 2,4,6,8,10 2 9 4 1,2,4,8,10 1 2,4,6,8,10 3 10 1 1,2,4,8,10 2 1,4,6,8,10 3
+Example game:
 
-Denoting Larry's score by L and Robin's score by R, what is the expected value of |L-R| after 50 turns? Give your answer rounded to eight decimal places using the format x.xxxxxxxx .
+| Turn | Called number | Larry's memory | Larry's score | Robin's memory | Robin's score |
+| ---- | ------------- | --------------:| ------------- | -------------- | ------------- |
+| 1    | 1             |              1 | 0             | 1              | 0             |
+| 2    | 2             |            1,2 | 0             | 1,2            | 0             |
+| 3    | 4             |          1,2,4 | 0             | 1,2,4          | 0             |
+| 4    | 6             |        1,2,4,6 | 0             | 1,2,4,6        | 0             |
+| 5    | 1             |        1,2,4,6 | 1             | 1,2,4,6        | 1             |
+| 6    | 8             |      1,2,4,6,8 | 1             | 1,2,4,6,8      | 1             |
+| 7    | 10            |     1,4,6,8,10 | 1             | 2,4,6,8,10     | 1             |
+| 8    | 2             |     1,2,6,8,10 | 1             | 2,4,6,8,10     | 2             |
+| 9    | 4             |     1,2,4,8,10 | 1             | 2,4,6,8,10     | 3             |
+| 10   | 1             |     1,2,4,8,10 | 2             | 1,4,6,8,10     | 3             |
+
+Denoting Larry's score by $L$ and Robin's score by $R$, what is the expected value of $|L - R|$ after 50 turns? 使用 x.xxxxxxxx 格式將答案四捨五入到小數點後八位。
 
 # --hints--
 
-`euler298()` should return 1.76882294.
+`selectiveAmnesia()` should return `1.76882294`.
 
 ```js
-assert.strictEqual(euler298(), 1.76882294);
+assert.strictEqual(selectiveAmnesia(), 1.76882294);
 ```
 
 # --seed--
@@ -29,12 +42,12 @@ assert.strictEqual(euler298(), 1.76882294);
 ## --seed-contents--
 
 ```js
-function euler298() {
+function selectiveAmnesia() {
 
   return true;
 }
 
-euler298();
+selectiveAmnesia();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md
index 586b5890681..cadebb22ca5 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md
@@ -1,33 +1,39 @@
 ---
 id: 5900f4971000cf542c50ffaa
-title: 'Problem 299: Three similar triangles'
-challengeType: 5
+title: '問題 299：三個相似的三角形'
+challengeType: 1
 forumTopicId: 301951
 dashedName: problem-299-three-similar-triangles
 ---
 
 # --description--
 
-Four points with integer coordinates are selected:A(a, 0), B(b, 0), C(0, c) and D(0, d),
+Four points with integer coordinates are selected:
 
-with 0 &lt; a &lt; b and 0 &lt; c &lt; d.
+$A(a, 0)$, $B(b, 0)$, $C(0, c)$ and $D(0, d)$, with $0 &lt; a &lt; b$ and $0 &lt; c &lt; d$.
 
-Point P, also with integer coordinates, is chosen on the line AC so that the three triangles ABP, CDP and BDP are all similar.
+Point $P$, also with integer coordinates, is chosen on the line $AC$ so that the three triangles $ABP$, $CDP$ and $BDP$ are all similar.
 
-It is easy to prove that the three triangles can be similar, only if a=c.
+<img class="img-responsive center-block" alt="points A, B, C, D and P creating three triangles: ABP, CDP, and BDP" src="https://cdn.freecodecamp.org/curriculum/project-euler/three-similar-triangles.gif" style="background-color: white; padding: 10px;" />
 
-So, given that a=c, we are looking for triplets (a,b,d) such that at least one point P (with integer coordinates) exists on AC, making the three triangles ABP, CDP and BDP all similar.
+It is easy to prove that the three triangles can be similar, only if $a = c$.
 
-For example, if (a,b,d)=(2,3,4), it can be easily verified that point P(1,1) satisfies the above condition. Note that the triplets (2,3,4) and (2,4,3) are considered as distinct, although point P(1,1) is common for both.
+So, given that $a = c$, we are looking for triplets ($a$, $b$, $d$) such that at least one point $P$ (with integer coordinates) exists on $AC$, making the three triangles $ABP$, $CDP$ and $BDP$ all similar.
 
-If b+d &lt; 100, there are 92 distinct triplets (a,b,d) such that point P exists. If b+d &lt; 100 000, there are 320471 distinct triplets (a,b,d) such that point P exists. If b+d &lt; 100 000 000, how many distinct triplets (a,b,d) are there such that point P exists?
+For example, if $(a, b, d) = (2, 3, 4)$, it can be easily verified that point $P(1, 1)$ satisfies the above condition. Note that the triplets (2,3,4) and (2,4,3) are considered as distinct, although point $P(1, 1)$ is common for both.
+
+If $b + d &lt; 100$, there are 92 distinct triplets ($a$, $b$, $d$) such that point $P$ exists.
+
+If $b + d &lt; 100\\,000$, there are 320471 distinct triplets ($a$, $b$, $d$) such that point $P$ exists.
+
+If $b + d &lt; 100\\,000\\,000$, how many distinct triplets ($a$, $b$, $d$) are there such that point $P$ exists?
 
 # --hints--
 
-`euler299()` should return 549936643.
+`threeSimilarTriangles()` should return `549936643`.
 
 ```js
-assert.strictEqual(euler299(), 549936643);
+assert.strictEqual(threeSimilarTriangles(), 549936643);
 ```
 
 # --seed--
@@ -35,12 +41,12 @@ assert.strictEqual(euler299(), 549936643);
 ## --seed-contents--
 
 ```js
-function euler299() {
+function threeSimilarTriangles() {
 
   return true;
 }
 
-euler299();
+threeSimilarTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-30-digit-n-powers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-30-digit-n-powers.md
index 1eb7fd409bb..1e7472bce84 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-30-digit-n-powers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-30-digit-n-powers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f38a1000cf542c50fe9d
 title: 'Problem 30: Digit n powers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301953
 dashedName: problem-30-digit-n-powers
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-300-protein-folding.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-300-protein-folding.md
index 52c5f272c6f..dd87dada2c1 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-300-protein-folding.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-300-protein-folding.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f49a1000cf542c50ffac
-title: 'Problem 300: Protein folding'
-challengeType: 5
+title: '問題 300：蛋白質摺疊'
+challengeType: 1
 forumTopicId: 301954
 dashedName: problem-300-protein-folding
 ---
@@ -10,24 +10,30 @@ dashedName: problem-300-protein-folding
 
 In a very simplified form, we can consider proteins as strings consisting of hydrophobic (H) and polar (P) elements, e.g. HHPPHHHPHHPH.
 
-For this problem, the orientation of a protein is important; e.g. HPP is considered distinct from PPH. Thus, there are 2n distinct proteins consisting of n elements.
+For this problem, the orientation of a protein is important; e.g. HPP is considered distinct from PPH. Thus, there are $2^n$ distinct proteins consisting of $n$ elements.
 
-When one encounters these strings in nature, they are always folded in such a way that the number of H-H contact points is as large as possible, since this is energetically advantageous. As a result, the H-elements tend to accumulate in the inner part, with the P-elements on the outside. Natural proteins are folded in three dimensions of course, but we will only consider protein folding in two dimensions.
+When one encounters these strings in nature, they are always folded in such a way that the number of H-H contact points is as large as possible, since this is energetically advantageous.
+
+As a result, the H-elements tend to accumulate in the inner part, with the P-elements on the outside.
+
+Natural proteins are folded in three dimensions of course, but we will only consider protein folding in <u>two dimensions</u>.
 
 The figure below shows two possible ways that our example protein could be folded (H-H contact points are shown with red dots).
 
+<img class="img-responsive center-block" alt="two possible ways to fold example protein" src="https://cdn.freecodecamp.org/curriculum/project-euler/protein-folding.gif" style="background-color: white; padding: 10px;" />
+
 The folding on the left has only six H-H contact points, thus it would never occur naturally. On the other hand, the folding on the right has nine H-H contact points, which is optimal for this string.
 
-Assuming that H and P elements are equally likely to occur in any position along the string, the average number of H-H contact points in an optimal folding of a random protein string of length 8 turns out to be 850 / 28=3.3203125.
+Assuming that H and P elements are equally likely to occur in any position along the string, the average number of H-H contact points in an optimal folding of a random protein string of length 8 turns out to be $\frac{850}{2^8} = 3.3203125$.
 
 What is the average number of H-H contact points in an optimal folding of a random protein string of length 15? Give your answer using as many decimal places as necessary for an exact result.
 
 # --hints--
 
-`euler300()` should return 8.0540771484375.
+`proteinFolding()` should return `8.0540771484375`.
 
 ```js
-assert.strictEqual(euler300(), 8.0540771484375);
+assert.strictEqual(proteinFolding(), 8.0540771484375);
 ```
 
 # --seed--
@@ -35,12 +41,12 @@ assert.strictEqual(euler300(), 8.0540771484375);
 ## --seed-contents--
 
 ```js
-function euler300() {
+function proteinFolding() {
 
   return true;
 }
 
-euler300();
+proteinFolding();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-301-nim.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-301-nim.md
index 8197d8abf58..0f3fdd86f90 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-301-nim.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-301-nim.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4991000cf542c50ffab
 title: 'Problem 301: Nim'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301955
 dashedName: problem-301-nim
 ---
@@ -12,25 +12,30 @@ Nim is a game played with heaps of stones, where two players take it in turn to
 
 We'll consider the three-heap normal-play version of Nim, which works as follows:
 
--   At the start of the game there are three heaps of stones.
--   On his turn the player removes any positive number of stones from any single heap.
--   The first player unable to move (because no stones remain) loses.
+- At the start of the game there are three heaps of stones.
+- On his turn the player removes any positive number of stones from any single heap.
+- The first player unable to move (because no stones remain) loses.
 
-If (n1,n2,n3) indicates a Nim position consisting of heaps of size n1, n2 and n3 then there is a simple function X(n1,n2,n3) — that you may look up or attempt to deduce for yourself — that returns: zero if, with perfect strategy, the player about to move will eventually lose; or non-zero if, with perfect strategy, the player about to move will eventually win. For example X(1,2,3) = 0 because, no matter what the current player does, his opponent can respond with a move that leaves two heaps of equal size, at which point every move by the current player can be mirrored by his opponent until no stones remain; so the current player loses. To illustrate:
+If ($n_1$, $n_2$, $n_3$) indicates a Nim position consisting of heaps of size $n_1$, $n_2$ and $n_3$ then there is a simple function $X(n_1,n_2,n_3)$ — that you may look up or attempt to deduce for yourself — that returns:
 
--   current player moves to (1,2,1)
--   opponent moves to (1,0,1)
--   current player moves to (0,0,1)
--   opponent moves to (0,0,0), and so wins.
+- zero if, with perfect strategy, the player about to move will eventually lose; or
+- non-zero if, with perfect strategy, the player about to move will eventually win.
 
-For how many positive integers n ≤ 230 does X(n,2n,3n) = 0 ?
+For example $X(1, 2, 3) = 0$ because, no matter what the current player does, his opponent can respond with a move that leaves two heaps of equal size, at which point every move by the current player can be mirrored by his opponent until no stones remain; so the current player loses. 爲了顯示：
+
+- current player moves to (1,2,1)
+- opponent moves to (1,0,1)
+- current player moves to (0,0,1)
+- opponent moves to (0,0,0), and so wins.
+
+For how many positive integers $n ≤ 2^{30}$ does $X(n, 2n, 3n) = 0$?
 
 # --hints--
 
-`euler301()` should return 2178309.
+`nim()` should return `2178309`.
 
 ```js
-assert.strictEqual(euler301(), 2178309);
+assert.strictEqual(nim(), 2178309);
 ```
 
 # --seed--
@@ -38,12 +43,12 @@ assert.strictEqual(euler301(), 2178309);
 ## --seed-contents--
 
 ```js
-function euler301() {
+function nim() {
 
   return true;
 }
 
-euler301();
+nim();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.md
index 78c112d626a..4c5301c49bf 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.md
@@ -1,33 +1,33 @@
 ---
 id: 5900f49b1000cf542c50ffad
 title: 'Problem 302: Strong Achilles Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301956
 dashedName: problem-302-strong-achilles-numbers
 ---
 
 # --description--
 
-A positive integer n is powerful if p2 is a divisor of n for every prime factor p in n.
+A positive integer $n$ is powerful if $p^2$ is a divisor of $n$ for every prime factor $p$ in $n$.
 
-A positive integer n is a perfect power if n can be expressed as a power of another positive integer.
+A positive integer $n$ is a perfect power if $n$ can be expressed as a power of another positive integer.
 
-A positive integer n is an Achilles number if n is powerful but not a perfect power. For example, 864 and 1800 are Achilles numbers: 864 = 25·33 and 1800 = 23·32·52.
+A positive integer $n$ is an Achilles number if $n$ is powerful but not a perfect power. For example, 864 and 1800 are Achilles numbers: $864 = 2^5 \times 3^3$ and $1800 = 2^3 \times 3^2 \times 5^2$.
 
-We shall call a positive integer S a Strong Achilles number if both S and φ(S) are Achilles numbers.1 For example, 864 is a Strong Achilles number: φ(864) = 288 = 25·32. However, 1800 isn't a Strong Achilles number because: φ(1800) = 480 = 25·31·51.
+We shall call a positive integer $S$ a Strong Achilles number if both $S$ and $φ(S)$ are Achilles numbers. $φ$ denotes Euler's totient function.
 
-There are 7 Strong Achilles numbers below 104 and 656 below 108.
+For example, 864 is a Strong Achilles number: $φ(864) = 288 = 2^5 \times 3^2$. However, 1800 isn't a Strong Achilles number because: $φ(1800) = 480 = 2^5 \times 3^1 \times 5^1$.
 
-How many Strong Achilles numbers are there below 1018?
+There are 7 Strong Achilles numbers below ${10}^4$ and 656 below ${10}^8$.
 
-1 φ denotes Euler's totient function.
+How many Strong Achilles numbers are there below ${10}^{18}$?
 
 # --hints--
 
-`euler302()` should return 1170060.
+`strongAchillesNumbers()` should return `1170060`.
 
 ```js
-assert.strictEqual(euler302(), 1170060);
+assert.strictEqual(strongAchillesNumbers(), 1170060);
 ```
 
 # --seed--
@@ -35,12 +35,12 @@ assert.strictEqual(euler302(), 1170060);
 ## --seed-contents--
 
 ```js
-function euler302() {
+function strongAchillesNumbers() {
 
   return true;
 }
 
-euler302();
+strongAchillesNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.md
index 1f9b36fad0d..108d8bd39fc 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f49b1000cf542c50ffae
 title: 'Problem 303: Multiples with small digits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301957
 dashedName: problem-303-multiples-with-small-digits
 ---
 
 # --description--
 
-For a positive integer n, define f(n) as the least positive multiple of n that, written in base 10, uses only digits ≤ 2.
+For a positive integer $n$, define $f(n)$ as the least positive multiple of $n$ that, written in base 10, uses only digits $≤ 2$.
 
-Thus f(2)=2, f(3)=12, f(7)=21, f(42)=210, f(89)=1121222.
+Thus $f(2) = 2$, $f(3) = 12$, $f(7) = 21$, $f(42) = 210$, $f(89) = 1\\,121\\,222$.
 
-Also, .
+Also, $\displaystyle\sum_{n = 1}^{100} \frac{f(n)}{n} = 11\\,363\\,107$.
 
-Find .
+Find $\displaystyle\sum_{n = 1}^{10\\,000} \frac{f(n)}{n}$.
 
 # --hints--
 
-`euler303()` should return 1111981904675169.
+`multiplesWithSmallDigits()` should return `1111981904675169`.
 
 ```js
-assert.strictEqual(euler303(), 1111981904675169);
+assert.strictEqual(multiplesWithSmallDigits(), 1111981904675169);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler303(), 1111981904675169);
 ## --seed-contents--
 
 ```js
-function euler303() {
+function multiplesWithSmallDigits() {
 
   return true;
 }
 
-euler303();
+multiplesWithSmallDigits();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-304-primonacci.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-304-primonacci.md
index aab56db5538..a4939940a8f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-304-primonacci.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-304-primonacci.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f49d1000cf542c50ffaf
 title: 'Problem 304: Primonacci'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301958
 dashedName: problem-304-primonacci
 ---
 
 # --description--
 
-For any positive integer n the function next_prime(n) returns the smallest prime p such that p>n.
+For any positive integer $n$ the function $\text{next_prime}(n)$ returns the smallest prime $p$ such that $p > n$.
 
-The sequence a(n) is defined by: a(1)=next_prime(1014) and a(n)=next_prime(a(n-1)) for n>1.
+The sequence $a(n)$ is defined by: $a(1) = \text{next_prime}({10}^{14})$ and $a(n) = \text{next_prime}(a(n - 1))$ for $n > 1$.
 
-The fibonacci sequence f(n) is defined by: f(0)=0, f(1)=1 and f(n)=f(n-1)+f(n-2) for n>1.
+The fibonacci sequence $f(n)$ is defined by: $f(0) = 0$, $f(1) = 1$ and $f(n) = f(n - 1) + f(n - 2)$ for $n > 1$.
 
-The sequence b(n) is defined as f(a(n)).
+The sequence $b(n)$ is defined as $f(a(n))$.
 
-Find ∑b(n) for 1≤n≤100 000. Give your answer mod 1234567891011.
+Find $\sum b(n)$ for $1≤n≤100\\,000$. Give your answer $\bmod 1\\,234\\,567\\,891\\,011$.
 
 # --hints--
 
-`euler304()` should return 283988410192.
+`primonacci()` should return `283988410192`.
 
 ```js
-assert.strictEqual(euler304(), 283988410192);
+assert.strictEqual(primonacci(), 283988410192);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler304(), 283988410192);
 ## --seed-contents--
 
 ```js
-function euler304() {
+function primonacci() {
 
   return true;
 }
 
-euler304();
+primonacci();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-305-reflexive-position.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-305-reflexive-position.md
index c42f1440383..566e7b7b76c 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-305-reflexive-position.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-305-reflexive-position.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f49d1000cf542c50ffb0
 title: 'Problem 305: Reflexive Position'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301959
 dashedName: problem-305-reflexive-position
 ---
 
 # --description--
 
-Let's call S the (infinite) string that is made by concatenating the consecutive positive integers (starting from 1) written down in base 10.
+Let's call $S$ the (infinite) string that is made by concatenating the consecutive positive integers (starting from 1) written down in base 10.
 
-Thus, S = 1234567891011121314151617181920212223242...
+Thus, $S = 1234567891011121314151617181920212223242\ldots$
 
-It's easy to see that any number will show up an infinite number of times in S.
+It's easy to see that any number will show up an infinite number of times in $S$.
 
-Let's call f(n) the starting position of the nth occurrence of n in S. For example, f(1)=1, f(5)=81, f(12)=271 and f(7780)=111111365.
+Let's call $f(n)$ the starting position of the $n^{\text{th}}$ occurrence of $n$ in $S$. For example, $f(1) = 1$, $f(5) = 81$, $f(12) = 271$ and $f(7780) = 111\\,111\\,365$.
 
-Find ∑f(3k) for 1≤k≤13.
+Find $\sum f(3^k) for 1 ≤ k ≤ 13$.
 
 # --hints--
 
-`euler305()` should return 18174995535140.
+`reflexivePosition()` should return `18174995535140`.
 
 ```js
-assert.strictEqual(euler305(), 18174995535140);
+assert.strictEqual(reflexivePosition(), 18174995535140);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler305(), 18174995535140);
 ## --seed-contents--
 
 ```js
-function euler305() {
+function reflexivePosition() {
 
   return true;
 }
 
-euler305();
+reflexivePosition();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md
index d750803f3b2..3dd4604bc13 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f49f1000cf542c50ffb1
 title: 'Problem 306: Paper-strip Game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301960
 dashedName: problem-306-paper-strip-game
 ---
@@ -10,20 +10,28 @@ dashedName: problem-306-paper-strip-game
 
 The following game is a classic example of Combinatorial Game Theory:
 
-Two players start with a strip of n white squares and they take alternate turns. On each turn, a player picks two contiguous white squares and paints them black. The first player who cannot make a move loses.
+Two players start with a strip of $n$ white squares and they take alternate turns. On each turn, a player picks two contiguous white squares and paints them black. The first player who cannot make a move loses.
 
-If n = 1, there are no valid moves, so the first player loses automatically. If n = 2, there is only one valid move, after which the second player loses. If n = 3, there are two valid moves, but both leave a situation where the second player loses. If n = 4, there are three valid moves for the first player; she can win the game by painting the two middle squares. If n = 5, there are four valid moves for the first player (shown below in red); but no matter what she does, the second player (blue) wins.
+- $n = 1$: No valid moves, so the first player loses automatically.
+- $n = 2$: Only one valid move, after which the second player loses.
+- $n = 3$: Two valid moves, but both leave a situation where the second player loses.
+- $n = 4$: There are three valid moves for the first player; who is able to win the game by painting the two middle squares.
+- $n = 5$: Four valid moves for the first player (shown below in red); but no matter what the player does, the second player (blue) wins.
 
-So, for 1 ≤ n ≤ 5, there are 3 values of n for which the first player can force a win. Similarly, for 1 ≤ n ≤ 50, there are 40 values of n for which the first player can force a win.
+<img class="img-responsive center-block" alt="valid starting moves for strip with 5 squares" src="https://cdn.freecodecamp.org/curriculum/project-euler/paper-strip-game.gif" style="background-color: white; padding: 10px;" />
 
-For 1 ≤ n ≤ 1 000 000, how many values of n are there for which the first player can force a win?
+So, for $1 ≤ n ≤ 5$, there are 3 values of $n$ for which the first player can force a win.
+
+Similarly, for $1 ≤ n ≤ 50$, there are 40 values of $n$ for which the first player can force a win.
+
+For $1 ≤ n ≤ 1\\,000\\,000$, how many values of $n$ are there for which the first player can force a win?
 
 # --hints--
 
-`euler306()` should return 852938.
+`paperStripGame()` should return `852938`.
 
 ```js
-assert.strictEqual(euler306(), 852938);
+assert.strictEqual(paperStripGame(), 852938);
 ```
 
 # --seed--
@@ -31,12 +39,12 @@ assert.strictEqual(euler306(), 852938);
 ## --seed-contents--
 
 ```js
-function euler306() {
+function paperStripGame() {
 
   return true;
 }
 
-euler306();
+paperStripGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-307-chip-defects.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-307-chip-defects.md
index eac5e7e113d..3f0fd2be0cb 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-307-chip-defects.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-307-chip-defects.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4a01000cf542c50ffb2
 title: 'Problem 307: Chip Defects'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301961
 dashedName: problem-307-chip-defects
 ---
 
 # --description--
 
-k defects are randomly distributed amongst n integrated-circuit chips produced by a factory (any number of defects may be found on a chip and each defect is independent of the other defects).
+$k$ defects are randomly distributed amongst $n$ integrated-circuit chips produced by a factory (any number of defects may be found on a chip and each defect is independent of the other defects).
 
-Let p(k,n) represent the probability that there is a chip with at least 3 defects. For instance p(3,7) ≈ 0.0204081633.
+Let $p(k,n)$ represent the probability that there is a chip with at least 3 defects. For instance $p(3,7) ≈ 0.0204081633$.
 
-Find p(20 000, 1 000 000) and give your answer rounded to 10 decimal places in the form 0.abcdefghij
+Find $p(20\\,000, 1\\,000\\,000)$ and give your answer rounded to 10 decimal places in the form 0.abcdefghij
 
 # --hints--
 
-`euler307()` should return 0.7311720251.
+`chipDefects()` should return `0.7311720251`.
 
 ```js
-assert.strictEqual(euler307(), 0.7311720251);
+assert.strictEqual(chipDefects(), 0.7311720251);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler307(), 0.7311720251);
 ## --seed-contents--
 
 ```js
-function euler307() {
+function chipDefects() {
 
   return true;
 }
 
-euler307();
+chipDefects();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.md
index a0cfc2d8a96..22f3cabc900 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4a11000cf542c50ffb3
 title: 'Problem 308: An amazing Prime-generating Automaton'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301962
 dashedName: problem-308-an-amazing-prime-generating-automaton
 ---
@@ -12,18 +12,26 @@ A program written in the programming language Fractran consists of a list of fra
 
 The internal state of the Fractran Virtual Machine is a positive integer, which is initially set to a seed value. Each iteration of a Fractran program multiplies the state integer by the first fraction in the list which will leave it an integer.
 
-For example, one of the Fractran programs that John Horton Conway wrote for prime-generation consists of the following 14 fractions:1791 , 7885 , 1951 , 2338 , 2933 , 7729 , 9523 , 7719 , 117 , 1113 , 1311 , 152 , 17 , 551 . Starting with the seed integer 2, successive iterations of the program produce the sequence: 15, 825, 725, 1925, 2275, 425, ..., 68, 4, 30, ..., 136, 8, 60, ..., 544, 32, 240, ...
+For example, one of the Fractran programs that John Horton Conway wrote for prime-generation consists of the following 14 fractions:
 
-The powers of 2 that appear in this sequence are 22, 23, 25, ... It can be shown that all the powers of 2 in this sequence have prime exponents and that all the primes appear as exponents of powers of 2, in proper order!
+$$\frac{17}{91}, \frac{78}{85}, \frac{19}{51}, \frac{23}{38}, \frac{29}{33}, \frac{77}{29}, \frac{95}{23}, \frac{77}{19}, \frac{1}{17}, \frac{11}{13}, \frac{13}{11}, \frac{15}{2}, \frac{1}{7}, \frac{55}{1}$$
 
-If someone uses the above Fractran program to solve Project Euler Problem 7 (find the 10001st prime), how many iterations would be needed until the program produces 210001st prime ?
+Starting with the seed integer 2, successive iterations of the program produce the sequence:
+
+$$15, 825, 725, 1925, 2275, 425, \ldots, 68, \mathbf{4}, 30, \ldots, 136, \mathbf{8}, 60, \ldots, 544, \mathbf{32}, 240, \ldots$$
+
+The powers of 2 that appear in this sequence are $2^2, 2^3, 2^5, \ldots$.
+
+It can be shown that all the powers of 2 in this sequence have prime exponents and that all the primes appear as exponents of powers of 2, in proper order!
+
+If someone uses the above Fractran program to solve Project Euler Problem 7 (find the ${10001}^{\text{st}}$ prime), how many iterations would be needed until the program produces $2^{10001^{\text{st}}\text{ prime}}$?
 
 # --hints--
 
-`euler308()` should return 1539669807660924.
+`primeGeneratingAutomation()` should return `1539669807660924`.
 
 ```js
-assert.strictEqual(euler308(), 1539669807660924);
+assert.strictEqual(primeGeneratingAutomation(), 1539669807660924);
 ```
 
 # --seed--
@@ -31,12 +39,12 @@ assert.strictEqual(euler308(), 1539669807660924);
 ## --seed-contents--
 
 ```js
-function euler308() {
+function primeGeneratingAutomation() {
 
   return true;
 }
 
-euler308();
+primeGeneratingAutomation();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md
index 03d5603c1f9..721b756f533 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f4a11000cf542c50ffb4
 title: 'Problem 309: Integer Ladders'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301963
 dashedName: problem-309-integer-ladders
 ---
 
 # --description--
 
-In the classic "Crossing Ladders" problem, we are given the lengths x and y of two ladders resting on the opposite walls of a narrow, level street. We are also given the height h above the street where the two ladders cross and we are asked to find the width of the street (w).
+In the classic "Crossing Ladders" problem, we are given the lengths $x$ and $y$ of two ladders resting on the opposite walls of a narrow, level street. We are also given the height $h$ above the street where the two ladders cross and we are asked to find the width of the street ($w$).
 
-Here, we are only concerned with instances where all four variables are positive integers. For example, if x = 70, y = 119 and h = 30, we can calculate that w = 56.
+<img class="img-responsive center-block" alt="ladders x and y, crossing at the height h, and resting on opposite walls of the street of width w" src="https://cdn.freecodecamp.org/curriculum/project-euler/integer-ladders.gif" style="background-color: white; padding: 10px;" />
 
-In fact, for integer values x, y, h and 0 &lt; x &lt; y &lt; 200, there are only five triplets (x,y,h) producing integer solutions for w: (70, 119, 30), (74, 182, 21), (87, 105, 35), (100, 116, 35) and (119, 175, 40).
+Here, we are only concerned with instances where all four variables are positive integers. For example, if $x = 70$, $y = 119$ and $h = 30$, we can calculate that $w = 56$.
 
-For integer values x, y, h and 0 &lt; x &lt; y &lt; 1 000 000, how many triplets (x,y,h) produce integer solutions for w?
+In fact, for integer values $x$, $y$, $h$ and $0 &lt; x &lt; y &lt; 200$, there are only five triplets ($x$, $y$, $h$) producing integer solutions for $w$: (70, 119, 30), (74, 182, 21), (87, 105, 35), (100, 116, 35) and (119, 175, 40).
+
+For integer values $x$, $y$, $h$ and $0 &lt; x &lt; y &lt; 1\\,000\\,000$, how many triplets ($x$, $y$, $h$) produce integer solutions for $w$?
 
 # --hints--
 
-`euler309()` should return 210139.
+`integerLadders()` should return `210139`.
 
 ```js
-assert.strictEqual(euler309(), 210139);
+assert.strictEqual(integerLadders(), 210139);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler309(), 210139);
 ## --seed-contents--
 
 ```js
-function euler309() {
+function integerLadders() {
 
   return true;
 }
 
-euler309();
+integerLadders();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-31-coin-sums.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-31-coin-sums.md
index 0826a685f4c..ae4372cd69f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-31-coin-sums.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-31-coin-sums.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f38b1000cf542c50fe9e
 title: 'Problem 31: Coin sums'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301965
 dashedName: problem-31-coin-sums
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-310-nim-square.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-310-nim-square.md
index c93f2fd5315..4eacb352843 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-310-nim-square.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-310-nim-square.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4a21000cf542c50ffb5
 title: 'Problem 310: Nim Square'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301966
 dashedName: problem-310-nim-square
 ---
@@ -12,18 +12,18 @@ Alice and Bob play the game Nim Square.
 
 Nim Square is just like ordinary three-heap normal play Nim, but the players may only remove a square number of stones from a heap.
 
-The number of stones in the three heaps is represented by the ordered triple (a,b,c).
+The number of stones in the three heaps is represented by the ordered triple ($a$, $b$, $c$).
 
-If 0≤a≤b≤c≤29 then the number of losing positions for the next player is 1160.
+If $0 ≤ a ≤ b ≤ c ≤ 29$ then the number of losing positions for the next player is 1160.
 
-Find the number of losing positions for the next player if 0≤a≤b≤c≤100 000.
+Find the number of losing positions for the next player if $0 ≤ a ≤ b ≤ c ≤ 100\\,000$.
 
 # --hints--
 
-`euler310()` should return 2586528661783.
+`nimSquare()` should return `2586528661783`.
 
 ```js
-assert.strictEqual(euler310(), 2586528661783);
+assert.strictEqual(nimSquare(), 2586528661783);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler310(), 2586528661783);
 ## --seed-contents--
 
 ```js
-function euler310() {
+function nimSquare() {
 
   return true;
 }
 
-euler310();
+nimSquare();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md
index b5aee9d2b54..97736d98034 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f4a31000cf542c50ffb6
 title: 'Problem 311: Biclinic Integral Quadrilaterals'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301967
 dashedName: problem-311-biclinic-integral-quadrilaterals
 ---
 
 # --description--
 
-ABCD is a convex, integer sided quadrilateral with 1 ≤ AB &lt; BC &lt; CD &lt; AD.
+$ABCD$ is a convex, integer sided quadrilateral with $1 ≤ AB &lt; BC &lt; CD &lt; AD$.
 
-BD has integer length. O is the midpoint of BD. AO has integer length.
+$BD$ has integer length. $O$ is the midpoint of $BD$. $AO$ has integer length.
 
-We'll call ABCD a biclinic integral quadrilateral if AO = CO ≤ BO = DO.
+We'll call $ABCD$ a biclinic integral quadrilateral if $AO = CO ≤ BO = DO$.
 
-For example, the following quadrilateral is a biclinic integral quadrilateral: AB = 19, BC = 29, CD = 37, AD = 43, BD = 48 and AO = CO = 23.
+For example, the following quadrilateral is a biclinic integral quadrilateral: $AB = 19$, $BC = 29$, $CD = 37$, $AD = 43$, $BD = 48$ and $AO = CO = 23$.
 
-Let B(N) be the number of distinct biclinic integral quadrilaterals ABCD that satisfy AB2+BC2+CD2+AD2 ≤ N. We can verify that B(10 000) = 49 and B(1 000 000) = 38239.
+<img class="img-responsive center-block" alt="quadrilateral ABCD, with point O, an midpoint of BD" src="https://cdn.freecodecamp.org/curriculum/project-euler/biclinic-integral-quadrilaterals.gif" style="background-color: white; padding: 10px;" />
 
-Find B(10 000 000 000).
+Let $B(N)$ be the number of distinct biclinic integral quadrilaterals $ABCD$ that satisfy ${AB}^2 + {BC}^2 + {CD}^2 + {AD}^2 ≤ N$. We can verify that $B(10\\,000) = 49$ and $B(1\\,000\\,000) = 38239$.
+
+Find $B(10\\,000\\,000\\,000)$.
 
 # --hints--
 
-`euler311()` should return 2466018557.
+`biclinicIntegralQuadrilaterals()` should return `2466018557`.
 
 ```js
-assert.strictEqual(euler311(), 2466018557);
+assert.strictEqual(biclinicIntegralQuadrilaterals(), 2466018557);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler311(), 2466018557);
 ## --seed-contents--
 
 ```js
-function euler311() {
+function biclinicIntegralQuadrilaterals() {
 
   return true;
 }
 
-euler311();
+biclinicIntegralQuadrilaterals();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md
index b9083a73f0b..122f28f97dc 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md
@@ -1,29 +1,36 @@
 ---
 id: 5900f4a51000cf542c50ffb7
 title: 'Problem 312: Cyclic paths on Sierpiński graphs'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301968
 dashedName: problem-312-cyclic-paths-on-sierpiski-graphs
 ---
 
 # --description--
 
-\- A Sierpiński graph of order-1 (S1) is an equilateral triangle.
+- A Sierpiński graph of order-1 ($S_1$) is an equilateral triangle.
+- $S_{n + 1}$ is obtained from $S_n$ by positioning three copies of $S_n$ so that every pair of copies has one common corner.
 
-\- Sn+1 is obtained from Sn by positioning three copies of Sn so that every pair of copies has one common corner.
+<img class="img-responsive center-block" alt="Sierpinski graphs of order-1 to order-5" src="https://cdn.freecodecamp.org/curriculum/project-euler/cyclic-paths-on-sierpinski-graphs-1.gif" style="background-color: white; padding: 10px;" />
 
-Let C(n) be the number of cycles that pass exactly once through all the vertices of Sn. For example, C(3) = 8 because eight such cycles can be drawn on S3, as shown below:
+Let $C(n)$ be the number of cycles that pass exactly once through all the vertices of $S_n$. For example, $C(3) = 8$ because eight such cycles can be drawn on $S_3$, as shown below:
 
-It can also be verified that : C(1) = C(2) = 1 C(5) = 71328803586048 C(10 000) mod 108 = 37652224 C(10 000) mod 138 = 617720485
+<img class="img-responsive center-block" alt="eight cycles that pass exactly once through all vertices of S_3" src="https://cdn.freecodecamp.org/curriculum/project-euler/cyclic-paths-on-sierpinski-graphs-2.gif" style="background-color: white; padding: 10px;" />
 
-Find C(C(C(10 000))) mod 138.
+It can also be verified that:
+
+$$\begin{align}   & C(1) = C(2) = 1 \\\\
+  & C(5) = 71\\,328\\,803\\,586\\,048 \\\\   & C(10 000)\bmod {10}^8 = 37\\,652\\,224 \\\\
+  & C(10 000)\bmod {13}^8 = 617\\,720\\,485 \\\\ \end{align}$$
+
+Find $C(C(C(10\\,000)))\bmod {13}^8$.
 
 # --hints--
 
-`euler312()` should return 324681947.
+`pathsOnSierpinskiGraphs()` should return `324681947`.
 
 ```js
-assert.strictEqual(euler312(), 324681947);
+assert.strictEqual(pathsOnSierpinskiGraphs(), 324681947);
 ```
 
 # --seed--
@@ -31,12 +38,12 @@ assert.strictEqual(euler312(), 324681947);
 ## --seed-contents--
 
 ```js
-function euler312() {
+function pathsOnSierpinskiGraphs() {
 
   return true;
 }
 
-euler312();
+pathsOnSierpinskiGraphs();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-313-sliding-game.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-313-sliding-game.md
index dd6ec7cfb3a..8f5726b71f4 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-313-sliding-game.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-313-sliding-game.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4a61000cf542c50ffb8
 title: 'Problem 313: Sliding game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301969
 dashedName: problem-313-sliding-game
 ---
@@ -10,18 +10,22 @@ dashedName: problem-313-sliding-game
 
 In a sliding game a counter may slide horizontally or vertically into an empty space. The objective of the game is to move the red counter from the top left corner of a grid to the bottom right corner; the space always starts in the bottom right corner. For example, the following sequence of pictures show how the game can be completed in five moves on a 2 by 2 grid.
 
-Let S(m,n) represent the minimum number of moves to complete the game on an m by n grid. For example, it can be verified that S(5,4) = 25.
+<img class="img-responsive center-block" alt="completing game in five moves on grid 2x2" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliding-game-1.gif" style="background-color: white; padding: 10px;" />
 
-There are exactly 5482 grids for which S(m,n) = p2, where p &lt; 100 is prime.
+Let $S(m, n)$ represent the minimum number of moves to complete the game on an $m$ by $n$ grid. For example, it can be verified that $S(5, 4) = 25$.
 
-How many grids does S(m,n) = p2, where p &lt; 106 is prime?
+<img class="img-responsive center-block" alt="initial grid state and final grid state for game on grid 5x4" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliding-game-2.gif" style="background-color: white; padding: 10px;" />
+
+There are exactly 5482 grids for which $S(m, n) = p^2$, where $p &lt; 100$ is prime.
+
+How many grids does $S(m, n) = p^2$, where $p &lt; {10}^6$ is prime?
 
 # --hints--
 
-`euler313()` should return 2057774861813004.
+`slidingGame()` should return `2057774861813004`.
 
 ```js
-assert.strictEqual(euler313(), 2057774861813004);
+assert.strictEqual(slidingGame(), 2057774861813004);
 ```
 
 # --seed--
@@ -29,12 +33,12 @@ assert.strictEqual(euler313(), 2057774861813004);
 ## --seed-contents--
 
 ```js
-function euler313() {
+function slidingGame() {
 
   return true;
 }
 
-euler313();
+slidingGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md
index 78cd0f1cf65..0bb0e4f9ab9 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4a71000cf542c50ffb9
 title: 'Problem 314: The Mouse on the Moon'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301970
 dashedName: problem-314-the-mouse-on-the-moon
 ---
@@ -10,20 +10,24 @@ dashedName: problem-314-the-mouse-on-the-moon
 
 The moon has been opened up, and land can be obtained for free, but there is a catch. You have to build a wall around the land that you stake out, and building a wall on the moon is expensive. Every country has been allotted a 500 m by 500 m square area, but they will possess only that area which they wall in. 251001 posts have been placed in a rectangular grid with 1 meter spacing. The wall must be a closed series of straight lines, each line running from post to post.
 
-The bigger countries of course have built a 2000 m wall enclosing the entire 250 000 m2 area. The Duchy of Grand Fenwick, has a tighter budget, and has asked you (their Royal Programmer) to compute what shape would get best maximum enclosed-area/wall-length ratio.
+The bigger countries of course have built a 2000 m wall enclosing the entire 250 000 $\text{m}^2$ area. The Duchy of Grand Fenwick, has a tighter budget, and has asked you (their Royal Programmer) to compute what shape would get best maximum $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio.
 
-You have done some preliminary calculations on a sheet of paper. For a 2000 meter wall enclosing the 250 000 m2 area the enclosed-area/wall-length ratio is 125. Although not allowed , but to get an idea if this is anything better: if you place a circle inside the square area touching the four sides the area will be equal to π*2502 m2 and the perimeter will be π*500 m, so the enclosed-area/wall-length ratio will also be 125.
+You have done some preliminary calculations on a sheet of paper. For a 2000 meter wall enclosing the 250 000 $\text{m}^2$ area the $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio is 125.
 
-However, if you cut off from the square four triangles with sides 75 m, 75 m and 75√2 m the total area becomes 238750 m2 and the perimeter becomes 1400+300√2 m. So this gives an enclosed-area/wall-length ratio of 130.87, which is significantly better.
+Although not allowed, but to get an idea if this is anything better: if you place a circle inside the square area touching the four sides the area will be equal to $π \times {250}^2 \text{m}^2$ and the perimeter will be $π \times 500 \text{m}$, so the $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio will also be 125.
 
-Find the maximum enclosed-area/wall-length ratio. Give your answer rounded to 8 places behind the decimal point in the form abc.defghijk.
+However, if you cut off from the square four triangles with sides 75 m, 75 m and $75\sqrt{2}$ m the total area becomes 238750 $\text{m}^2$ and the perimeter becomes $1400 + 300\sqrt{2}$ m. So this gives an $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio of 130.87, which is significantly better.
+
+<img class="img-responsive center-block" alt="picture showing difference in encosed-area between circle and square with cut off four triangles" src="https://cdn.freecodecamp.org/curriculum/project-euler/the-mouse-on-the-moon.gif" style="background-color: white; padding: 10px;" />
+
+Find the maximum $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio. Give your answer rounded to 8 places behind the decimal point in the form abc.defghijk.
 
 # --hints--
 
-`euler314()` should return 132.52756426.
+`theMouseOnTheMoon()` should return `132.52756426`.
 
 ```js
-assert.strictEqual(euler314(), 132.52756426);
+assert.strictEqual(theMouseOnTheMoon(), 132.52756426);
 ```
 
 # --seed--
@@ -31,12 +35,12 @@ assert.strictEqual(euler314(), 132.52756426);
 ## --seed-contents--
 
 ```js
-function euler314() {
+function theMouseOnTheMoon() {
 
   return true;
 }
 
-euler314();
+theMouseOnTheMoon();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md
index 38a2a69cca1..59389d4a7ff 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md
@@ -1,41 +1,55 @@
 ---
 id: 5900f4a71000cf542c50ffba
 title: 'Problem 315: Digital root clocks'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301971
 dashedName: problem-315-digital-root-clocks
 ---
 
 # --description--
 
+<img class="img-responsive center-block" alt="animation of Sam's and Max's clocks calculating digital roots starting from 137" src="https://cdn.freecodecamp.org/curriculum/project-euler/digital-root-clocks.gif" style="background-color: white; padding: 10px;" />
+
 Sam and Max are asked to transform two digital clocks into two "digital root" clocks.
 
 A digital root clock is a digital clock that calculates digital roots step by step.
 
-When a clock is fed a number, it will show it and then it will start the calculation, showing all the intermediate values until it gets to the result. For example, if the clock is fed the number 137, it will show: "137" → "11" → "2" and then it will go black, waiting for the next number.
+When a clock is fed a number, it will show it and then it will start the calculation, showing all the intermediate values until it gets to the result. For example, if the clock is fed the number 137, it will show: `137` → `11` → `2` and then it will go black, waiting for the next number.
 
-Every digital number consists of some light segments: three horizontal (top, middle, bottom) and four vertical (top-left, top-right, bottom-left, bottom-right). Number "1" is made of vertical top-right and bottom-right, number "4" is made by middle horizontal and vertical top-left, top-right and bottom-right. Number "8" lights them all.
+Every digital number consists of some light segments: three horizontal (top, middle, bottom) and four vertical (top-left, top-right, bottom-left, bottom-right). Number `1` is made of vertical top-right and bottom-right, number `4` is made by middle horizontal and vertical top-left, top-right and bottom-right. Number `8` lights them all.
 
-The clocks consume energy only when segments are turned on/off. To turn on a "2" will cost 5 transitions, while a "7" will cost only 4 transitions.
+The clocks consume energy only when segments are turned on/off. To turn on a `2` will cost 5 transitions, while a `7` will cost only 4 transitions.
 
 Sam and Max built two different clocks.
 
-Sam's clock is fed e.g. number 137: the clock shows "137", then the panel is turned off, then the next number ("11") is turned on, then the panel is turned off again and finally the last number ("2") is turned on and, after some time, off. For the example, with number 137, Sam's clock requires:"137" : (2 + 5 + 4) × 2 = 22 transitions ("137" on/off). "11" : (2 + 2) × 2 = 8 transitions ("11" on/off). "2" : (5) × 2 = 10 transitions ("2" on/off).
+Sam's clock is fed e.g. number 137: the clock shows `137`, then the panel is turned off, then the next number (`11`) is turned on, then the panel is turned off again and finally the last number (`2`) is turned on and, after some time, off.
+
+For the example, with number 137, Sam's clock requires:
+
+- `137`: $(2 + 5 + 4) × 2 = 22$ transitions (`137` on/off).
+- `11`: $(2 + 2) × 2 = 8$ transitions (`11` on/off).
+- `2`: $(5) × 2 = 10$ transitions (`2` on/off).
 
 For a grand total of 40 transitions.
 
-Max's clock works differently. Instead of turning off the whole panel, it is smart enough to turn off only those segments that won't be needed for the next number. For number 137, Max's clock requires:"137" : 2 + 5 + 4 = 11 transitions ("137" on) 7 transitions (to turn off the segments that are not needed for number "11"). "11" : 0 transitions (number "11" is already turned on correctly) 3 transitions (to turn off the first "1" and the bottom part of the second "1"; the top part is common with number "2"). "2" : 4 transitions (to turn on the remaining segments in order to get a "2") 5 transitions (to turn off number "2").
+Max's clock works differently. Instead of turning off the whole panel, it is smart enough to turn off only those segments that won't be needed for the next number.
+
+For number 137, Max's clock requires:
+
+- `137` : $2 + 5 + 4 = 11$ transitions (`137` on), $7$ transitions (to turn off the segments that are not needed for number `11`).
+- `11` : $0$ transitions (number `11` is already turned on correctly), $3$ transitions (to turn off the first `1` and the bottom part of the second `1`; the top part is common with number `2`).
+- `2` : $4$ transitions (to turn on the remaining segments in order to get a `2`), $5$ transitions (to turn off number `2`).
 
 For a grand total of 30 transitions.
 
-Of course, Max's clock consumes less power than Sam's one. The two clocks are fed all the prime numbers between A = 107 and B = 2×107. Find the difference between the total number of transitions needed by Sam's clock and that needed by Max's one.
+Of course, Max's clock consumes less power than Sam's one. The two clocks are fed all the prime numbers between $A = {10}^7$ and $B = 2 × {10}^7$. Find the difference between the total number of transitions needed by Sam's clock and that needed by Max's one.
 
 # --hints--
 
-`euler315()` should return 13625242.
+`digitalRootClocks()` should return `13625242`.
 
 ```js
-assert.strictEqual(euler315(), 13625242);
+assert.strictEqual(digitalRootClocks(), 13625242);
 ```
 
 # --seed--
@@ -43,12 +57,12 @@ assert.strictEqual(euler315(), 13625242);
 ## --seed-contents--
 
 ```js
-function euler315() {
+function digitalRootClocks() {
 
   return true;
 }
 
-euler315();
+digitalRootClocks();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.md
index 4a2821b24e7..63d1303ecd8 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.md
@@ -1,33 +1,41 @@
 ---
 id: 5900f4a81000cf542c50ffbb
-title: 'Problem 316: Numbers in decimal expansions'
-challengeType: 5
+title: '問題 316：十進制擴展中的數字'
+challengeType: 1
 forumTopicId: 301972
 dashedName: problem-316-numbers-in-decimal-expansions
 ---
 
 # --description--
 
-Let p = p1 p2 p3 ... be an infinite sequence of random digits, selected from {0,1,2,3,4,5,6,7,8,9} with equal probability.
+Let $p = p_1 p_2 p_3 \ldots$ be an infinite sequence of random digits, selected from {0,1,2,3,4,5,6,7,8,9} with equal probability.
 
-It can be seen that p corresponds to the real number 0.p1 p2 p3 ....
+It can be seen that $p$ corresponds to the real number $0.p_1 p_2 p_3 \ldots$.
 
-It can also be seen that choosing a random real number from the interval \[0,1) is equivalent to choosing an infinite sequence of random digits selected from {0,1,2,3,4,5,6,7,8,9} with equal probability.
+It can also be seen that choosing a random real number from the interval [0,1) is equivalent to choosing an infinite sequence of random digits selected from {0,1,2,3,4,5,6,7,8,9} with equal probability.
 
-For any positive integer n with d decimal digits, let k be the smallest index such that pk, pk+1, ...pk+d-1 are the decimal digits of n, in the same order. Also, let g(n) be the expected value of k; it can be proven that g(n) is always finite and, interestingly, always an integer number.
+For any positive integer $n$ with $d$ decimal digits, let $k$ be the smallest index such that $p_k, p_{k + 1}, \ldots p_{k + d - 1}$ are the decimal digits of $n$, in the same order.
 
-For example, if n = 535, then for p = 31415926535897...., we get k = 9 for p = 355287143650049560000490848764084685354..., we get k = 36 etc and we find that g(535) = 1008.
+Also, let $g(n)$ be the expected value of $k$; it can be proven that $g(n)$ is always finite and, interestingly, always an integer number.
 
-Given that , find
+For example, if $n = 535$, then
 
-Note: represents the floor function.
+for $p = 31415926\mathbf{535}897\ldots$, we get $k = 9$
+
+for $p = 35528714365004956000049084876408468\mathbf{535}4\ldots$, we get $k = 36$
+
+etc and we find that $g(535) = 1008$.
+
+Given that $\displaystyle\sum_{n = 2}^{999} g\left(\left\lfloor\frac{{10}^6}{n}\right\rfloor\right) = 27280188$, find $\displaystyle\sum_{n = 2}^{999\\,999} g\left(\left\lfloor\frac{{10}^{16}}{n}\right\rfloor\right)$.
+
+**Note:** $\lfloor x\rfloor$ represents the floor function.
 
 # --hints--
 
-`euler316()` should return 542934735751917760.
+`numbersInDecimalExpansion()` should return `542934735751917760`.
 
 ```js
-assert.strictEqual(euler316(), 542934735751917760);
+assert.strictEqual(numbersInDecimalExpansion(), 542934735751917760);
 ```
 
 # --seed--
@@ -35,12 +43,12 @@ assert.strictEqual(euler316(), 542934735751917760);
 ## --seed-contents--
 
 ```js
-function euler316() {
+function numbersInDecimalExpansion() {
 
   return true;
 }
 
-euler316();
+numbersInDecimalExpansion();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-317-firecracker.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-317-firecracker.md
index bb528a225aa..f9715cfd8df 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-317-firecracker.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-317-firecracker.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4aa1000cf542c50ffbc
 title: 'Problem 317: Firecracker'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301973
 dashedName: problem-317-firecracker
 ---
 
 # --description--
 
-A firecracker explodes at a height of 100 m above level ground. It breaks into a large number of very small fragments, which move in every direction; all of them have the same initial velocity of 20 m/s.
+A firecracker explodes at a height of 100 m above level ground. It breaks into a large number of very small fragments, which move in every direction; all of them have the same initial velocity of 20 $\frac{\text{m}}{\text{s}}$.
 
-We assume that the fragments move without air resistance, in a uniform gravitational field with g=9.81 m/s2.
+We assume that the fragments move without air resistance, in a uniform gravitational field with $g=9.81 \frac{\text{m}}{\text{s}^2}$.
 
-Find the volume (in m3) of the region through which the fragments move before reaching the ground. Give your answer rounded to four decimal places.
+Find the volume (in $\text{m}^3$) of the region through which the fragments move before reaching the ground. Give your answer rounded to four decimal places.
 
 # --hints--
 
-`euler317()` should return 1856532.8455.
+`firecracker()` should return `1856532.8455`.
 
 ```js
-assert.strictEqual(euler317(), 1856532.8455);
+assert.strictEqual(firecracker(), 1856532.8455);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler317(), 1856532.8455);
 ## --seed-contents--
 
 ```js
-function euler317() {
+function firecracker() {
 
   return true;
 }
 
-euler317();
+firecracker();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-318-2011-nines.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-318-2011-nines.md
index 1e8e9b8821e..f4b4f8315b5 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-318-2011-nines.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-318-2011-nines.md
@@ -1,51 +1,39 @@
 ---
 id: 5900f4ab1000cf542c50ffbd
 title: 'Problem 318: 2011 nines'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301974
 dashedName: problem-318-2011-nines
 ---
 
 # --description--
 
-Consider the real number √2+√3.
+Consider the real number $\sqrt{2} + \sqrt{3}$.
 
-When we calculate the even powers of √2+√3
+When we calculate the even powers of $\sqrt{2} + \sqrt{3}$ we get:
 
-we get:
+$$\begin{align}   & {(\sqrt{2} + \sqrt{3})}^2 = 9.898979485566356\ldots \\\\
+  & {(\sqrt{2} + \sqrt{3})}^4 = 97.98979485566356\ldots \\\\   & {(\sqrt{2} + \sqrt{3})}^6 = 969.998969071069263\ldots \\\\
+  & {(\sqrt{2} + \sqrt{3})}^8 = 9601.99989585502907\ldots \\\\   & {(\sqrt{2} + \sqrt{3})}^{10} = 95049.999989479221\ldots \\\\
+  & {(\sqrt{2} + \sqrt{3})}^{12} = 940897.9999989371855\ldots \\\\   & {(\sqrt{2} + \sqrt{3})}^{14} = 9313929.99999989263\ldots \\\\
+  & {(\sqrt{2} + \sqrt{3})}^{16} = 92198401.99999998915\ldots \\\\ \end{align}$$
 
-(√2+√3)2 = 9.898979485566356...
+It looks like that the number of consecutive nines at the beginning of the fractional part of these powers is non-decreasing. In fact it can be proven that the fractional part of ${(\sqrt{2} + \sqrt{3})}^{2n}$ approaches 1 for large $n$.
 
-(√2+√3)4 = 97.98979485566356...
+Consider all real numbers of the form $\sqrt{p} + \sqrt{q}$ with $p$ and $q$ positive integers and $p &lt; q$, such that the fractional part of ${(\sqrt{p} + \sqrt{q})}^{2n}$ approaches 1 for large $n$.
 
-(√2+√3)6 = 969.998969071069263...
+Let $C(p,q,n)$ be the number of consecutive nines at the beginning of the fractional part of ${(\sqrt{p} + \sqrt{q})}^{2n}$.
 
-(√2+√3)8 = 9601.99989585502907...
+Let $N(p,q)$ be the minimal value of $n$ such that $C(p,q,n) ≥ 2011$.
 
-(√2+√3)10 = 95049.999989479221...
-
-(√2+√3)12 = 940897.9999989371855...
-
-(√2+√3)14 = 9313929.99999989263...
-
-(√2+√3)16 = 92198401.99999998915...
-
-It looks like that the number of consecutive nines at the beginning of the fractional part of these powers is non-decreasing. In fact it can be proven that the fractional part of (√2+√3)2n approaches 1 for large n.
-
-Consider all real numbers of the form √p+√q with p and q positive integers and p&lt;q, such that the fractional part of (√p+√q)2n approaches 1 for large n.
-
-Let C(p,q,n) be the number of consecutive nines at the beginning of the fractional part of (√p+√q)2n.
-
-Let N(p,q) be the minimal value of n such that C(p,q,n) ≥ 2011.
-
-Find ∑N(p,q) for p+q ≤ 2011.
+Find $\sum N(p,q)$ for $p + q ≤ 2011$.
 
 # --hints--
 
-`euler318()` should return 709313889.
+`twoThousandElevenNines()` should return `709313889`.
 
 ```js
-assert.strictEqual(euler318(), 709313889);
+assert.strictEqual(twoThousandElevenNines(), 709313889);
 ```
 
 # --seed--
@@ -53,12 +41,12 @@ assert.strictEqual(euler318(), 709313889);
 ## --seed-contents--
 
 ```js
-function euler318() {
+function twoThousandElevenNines() {
 
   return true;
 }
 
-euler318();
+twoThousandElevenNines();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-319-bounded-sequences.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-319-bounded-sequences.md
index 687eeb26cd2..36341fac54b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-319-bounded-sequences.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-319-bounded-sequences.md
@@ -1,33 +1,31 @@
 ---
 id: 5900f4ab1000cf542c50ffbe
 title: 'Problem 319: Bounded Sequences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301975
 dashedName: problem-319-bounded-sequences
 ---
 
 # --description--
 
-Let x1, x2,..., xn be a sequence of length n such that:
+Let $x_1, x_2, \ldots, x_n$ be a sequence of length $n$ such that:
 
-x1 = 2
-
-for all 1 &lt; i ≤ n : xi-1 &lt; xi
-
-for all i and j with 1 ≤ i, j ≤ n : (xi) j &lt; (xj + 1)i
+- $x_1 = 2$
+- for all $1 &lt; i ≤ n : x_{i - 1} &lt; x_i$
+- for all $i$ and $j$ with $1 ≤ i, j ≤ n : {(x_i)}^j &lt; {(x_j + 1)}^i$
 
 There are only five such sequences of length 2, namely: {2,4}, {2,5}, {2,6}, {2,7} and {2,8}. There are 293 such sequences of length 5; three examples are given below: {2,5,11,25,55}, {2,6,14,36,88}, {2,8,22,64,181}.
 
-Let t(n) denote the number of such sequences of length n. You are given that t(10) = 86195 and t(20) = 5227991891.
+Let $t(n)$ denote the number of such sequences of length $n$. You are given that $t(10) = 86195$ and $t(20) = 5227991891$.
 
-Find t(1010) and give your answer modulo 109.
+Find $t({10}^{10})$ and give your answer modulo $10^9$.
 
 # --hints--
 
-`euler319()` should return 268457129.
+`boundedSequences()` should return `268457129`.
 
 ```js
-assert.strictEqual(euler319(), 268457129);
+assert.strictEqual(boundedSequences(), 268457129);
 ```
 
 # --seed--
@@ -35,12 +33,12 @@ assert.strictEqual(euler319(), 268457129);
 ## --seed-contents--
 
 ```js
-function euler319() {
+function boundedSequences() {
 
   return true;
 }
 
-euler319();
+boundedSequences();
 ```
 
 # --solutions--
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 fe1724d44f7..5fe7d0495c5 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f38c1000cf542c50fe9f
 title: 'Problem 32: Pandigital products'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301976
 dashedName: problem-32-pandigital-products
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.md
index 5171172f984..b0f0cc5c6ae 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4ae1000cf542c50ffbf
 title: 'Problem 320: Factorials divisible by a huge integer'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301977
 dashedName: problem-320-factorials-divisible-by-a-huge-integer
 ---
 
 # --description--
 
-Let N(i) be the smallest integer n such that n! is divisible by (i!)1234567890
+Let $N(i)$ be the smallest integer $n$ such that $n!$ is divisible by $(i!)^{1234567890}$
 
-Let S(u)=∑N(i) for 10 ≤ i ≤ u.
+Let $S(u) = \sum N(i)$ for $10 ≤ i ≤ u$.
 
-S(1000)=614538266565663.
+$S(1000)=614\\,538\\,266\\,565\\,663$.
 
-Find S(1 000 000) mod 1018.
+Find $S(1\\,000\\,000)\bmod {10}^{18}$.
 
 # --hints--
 
-`euler320()` should return 278157919195482660.
+`divisibleByHugeInteger()` should return `278157919195482660`.
 
 ```js
-assert.strictEqual(euler320(), 278157919195482660);
+assert.strictEqual(divisibleByHugeInteger(), 278157919195482660);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler320(), 278157919195482660);
 ## --seed-contents--
 
 ```js
-function euler320() {
+function divisibleByHugeInteger() {
 
   return true;
 }
 
-euler320();
+divisibleByHugeInteger();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md
index 34e52a4dea9..177610fd3c7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md
@@ -1,29 +1,35 @@
 ---
 id: 5900f4ae1000cf542c50ffc0
 title: 'Problem 321: Swapping Counters'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301978
 dashedName: problem-321-swapping-counters
 ---
 
 # --description--
 
-A horizontal row comprising of 2n + 1 squares has n red counters placed at one end and n blue counters at the other end, being separated by a single empty square in the centre. For example, when n = 3.
+A horizontal row comprising of $2n + 1$ squares has $n$ red counters placed at one end and $n$ blue counters at the other end, being separated by a single empty square in the center. For example, when $n = 3$.
+
+<img class="img-responsive center-block" alt="three squares with red and blue counters placed on opposite ends of the row, separated by one empty square" src="https://cdn.freecodecamp.org/curriculum/project-euler/swapping-counters-1.gif" style="background-color: white; padding: 10px;" />
 
 A counter can move from one square to the next (slide) or can jump over another counter (hop) as long as the square next to that counter is unoccupied.
 
-Let M(n) represent the minimum number of moves/actions to completely reverse the positions of the coloured counters; that is, move all the red counters to the right and all the blue counters to the left. It can be verified M(3) = 15, which also happens to be a triangle number.
+<img class="img-responsive center-block" alt="allowed moves of the counter" src="https://cdn.freecodecamp.org/curriculum/project-euler/swapping-counters-2.gif" style="background-color: white; padding: 10px;" />
 
-If we create a sequence based on the values of n for which M(n) is a triangle number then the first five terms would be: 1, 3, 10, 22, and 63, and their sum would be 99.
+Let $M(n)$ represent the minimum number of moves/actions to completely reverse the positions of the colored counters; that is, move all the red counters to the right and all the blue counters to the left.
+
+It can be verified $M(3) = 15$, which also happens to be a triangle number.
+
+If we create a sequence based on the values of n for which $M(n)$ is a triangle number then the first five terms would be: 1, 3, 10, 22, and 63, and their sum would be 99.
 
 Find the sum of the first forty terms of this sequence.
 
 # --hints--
 
-`euler321()` should return 2470433131948040.
+`swappingCounters()` should return `2470433131948040`.
 
 ```js
-assert.strictEqual(euler321(), 2470433131948040);
+assert.strictEqual(swappingCounters(), 2470433131948040);
 ```
 
 # --seed--
@@ -31,12 +37,12 @@ assert.strictEqual(euler321(), 2470433131948040);
 ## --seed-contents--
 
 ```js
-function euler321() {
+function swappingCounters() {
 
   return true;
 }
 
-euler321();
+swappingCounters();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.md
index 241c3a74f07..2c1725a5c4b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4af1000cf542c50ffc1
 title: 'Problem 322: Binomial coefficients divisible by 10'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301979
 dashedName: problem-322-binomial-coefficients-divisible-by-10
 ---
 
 # --description--
 
-Let T(m, n) be the number of the binomial coefficients iCn that are divisible by 10 for n ≤ i &lt; m(i, m and n are positive integers).
+Let $T(m, n)$ be the number of the binomial coefficients ${}^iC_n$ that are divisible by 10 for $n ≤ i &lt; m$ ($i$, $m$ and $n$ are positive integers).
 
-You are given that T(109, 107-10) = 989697000.
+You are given that $T({10}^9, {10}^7 - 10) = 989\\,697\\,000$.
 
-Find T(1018, 1012-10).
+Find $T({10}^{18}, {10}^{12} - 10)$.
 
 # --hints--
 
-`euler322()` should return 999998760323314000.
+`binomialCoefficientsDivisibleBy10()` should return `999998760323314000`.
 
 ```js
-assert.strictEqual(euler322(), 999998760323314000);
+assert.strictEqual(binomialCoefficientsDivisibleBy10(), 999998760323314000);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler322(), 999998760323314000);
 ## --seed-contents--
 
 ```js
-function euler322() {
+function binomialCoefficientsDivisibleBy10() {
 
   return true;
 }
 
-euler322();
+binomialCoefficientsDivisibleBy10();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
index b3367595620..7cd5acf36cc 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
@@ -1,31 +1,30 @@
 ---
 id: 5900f4b01000cf542c50ffc2
 title: 'Problem 323: Bitwise-OR operations on random integers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301980
 dashedName: problem-323-bitwise-or-operations-on-random-integers
 ---
 
 # --description--
 
-Let y0, y1, y2,... be a sequence of random unsigned 32 bit integers
+Let $y_0, y_1, y_2, \ldots$ be a sequence of random unsigned 32 bit integers (i.e. $0 ≤ y_i &lt; 2^{32}$, every value equally likely).
 
-(i.e. 0 ≤ yi &lt; 232, every value equally likely).
+For the sequence $x_i$ the following recursion is given:
 
-For the sequence xi the following recursion is given:x0 = 0 and
+- $x_0 = 0$ and
+- $x_i = x_{i - 1} \mathbf{|} y_{i - 1}$, for $i > 0$. ($\mathbf{|}$ is the bitwise-OR operator)
 
-xi = xi-1| yi-1, for i > 0. ( | is the bitwise-OR operator)
+It can be seen that eventually there will be an index $N$ such that $x_i = 2^{32} - 1$ (a bit-pattern of all ones) for all $i ≥ N$.
 
-It can be seen that eventually there will be an index N such that xi = 232 -1 (a bit-pattern of all ones) for all i ≥ N.
-
-Find the expected value of N. Give your answer rounded to 10 digits after the decimal point.
+Find the expected value of $N$. Give your answer rounded to 10 digits after the decimal point.
 
 # --hints--
 
-`euler323()` should return 6.3551758451.
+`bitwiseOrOnRandomIntegers()` should return `6.3551758451`.
 
 ```js
-assert.strictEqual(euler323(), 6.3551758451);
+assert.strictEqual(bitwiseOrOnRandomIntegers(), 6.3551758451);
 ```
 
 # --seed--
@@ -33,12 +32,12 @@ assert.strictEqual(euler323(), 6.3551758451);
 ## --seed-contents--
 
 ```js
-function euler323() {
+function bitwiseOrOnRandomIntegers() {
 
   return true;
 }
 
-euler323();
+bitwiseOrOnRandomIntegers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md
index 66ce4914777..e79296a5f0f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md
@@ -1,25 +1,29 @@
 ---
 id: 5900f4b11000cf542c50ffc3
 title: 'Problem 324: Building a tower'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301981
 dashedName: problem-324-building-a-tower
 ---
 
 # --description--
 
-Let f(n) represent the number of ways one can fill a 3×3×n tower with blocks of 2×1×1. You're allowed to rotate the blocks in any way you like; however, rotations, reflections etc of the tower itself are counted as distinct.
+Let $f(n)$ represent the number of ways one can fill a $3×3×n$ tower with blocks of $2×1×1$. You're allowed to rotate the blocks in any way you like; however, rotations, reflections etc of the tower itself are counted as distinct.
 
-For example (with q = 100000007) :f(2) = 229,f(4) = 117805,f(10) mod q = 96149360,f(103) mod q = 24806056,f(106) mod q = 30808124.
+For example (with $q = 100\\,000\\,007$):
 
-Find f(1010000) mod 100000007.
+$$\begin{align}   & f(2) = 229, \\\\
+  & f(4) = 117\\,805, \\\\   & f(10)\bmod q = 96\\,149\\,360, \\\\
+  & f({10}^3)\bmod q = 24\\,806\\,056, \\\\ & f({10}^6)\bmod q = 30\\,808\\,124. \end{align}$$
+
+Find $f({10}^{10000})\bmod 100\\,000\\,007$.
 
 # --hints--
 
-`euler324()` should return 96972774.
+`buildingTower()` should return `96972774`.
 
 ```js
-assert.strictEqual(euler324(), 96972774);
+assert.strictEqual(buildingTower(), 96972774);
 ```
 
 # --seed--
@@ -27,12 +31,12 @@ assert.strictEqual(euler324(), 96972774);
 ## --seed-contents--
 
 ```js
-function euler324() {
+function buildingTower() {
 
   return true;
 }
 
-euler324();
+buildingTower();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-325-stone-game-ii.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-325-stone-game-ii.md
index 6d0389b9fac..b1392c1e246 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-325-stone-game-ii.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-325-stone-game-ii.md
@@ -1,16 +1,16 @@
 ---
 id: 5900f4b11000cf542c50ffc4
 title: 'Problem 325: Stone Game II'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301982
 dashedName: problem-325-stone-game-ii
 ---
 
 # --description--
 
-A game is played with two piles of stones and two players. At her turn, a player removes a number of stones from the larger pile. The number of stones she removes must be a positive multiple of the number of stones in the smaller pile.
+A game is played with two piles of stones and two players. On each player's turn, the player may remove a number of stones from the larger pile. The number of stones removes must be a positive multiple of the number of stones in the smaller pile.
 
-E.g., let the ordered pair(6,14) describe a configuration with 6 stones in the smaller pile and 14 stones in the larger pile, then the first player can remove 6 or 12 stones from the larger pile.
+E.g., let the ordered pair (6,14) describe a configuration with 6 stones in the smaller pile and 14 stones in the larger pile, then the first player can remove 6 or 12 stones from the larger pile.
 
 The player taking all the stones from a pile wins the game.
 
@@ -18,16 +18,16 @@ A winning configuration is one where the first player can force a win. For examp
 
 A losing configuration is one where the second player can force a win, no matter what the first player does. For example, (2,3) and (3,4) are losing configurations: any legal move leaves a winning configuration for the second player.
 
-Define S(N) as the sum of (xi+yi) for all losing configurations (xi,yi), 0 &lt; xi &lt; yi ≤ N. We can verify that S(10) = 211 and S(104) = 230312207313.
+Define $S(N)$ as the sum of ($x_i + y_i$) for all losing configurations ($x_i$, $y_i$), $0 &lt; x_i &lt; y_i ≤ N$. We can verify that $S(10) = 211$ and $S({10}^4) = 230\\,312\\,207\\,313$.
 
-Find S(1016) mod 710.
+Find $S({10}^{16})\bmod 7^{10}$.
 
 # --hints--
 
-`euler325()` should return 54672965.
+`stoneGameTwo()` should return `54672965`.
 
 ```js
-assert.strictEqual(euler325(), 54672965);
+assert.strictEqual(stoneGameTwo(), 54672965);
 ```
 
 # --seed--
@@ -35,12 +35,12 @@ assert.strictEqual(euler325(), 54672965);
 ## --seed-contents--
 
 ```js
-function euler325() {
+function stoneGameTwo() {
 
   return true;
 }
 
-euler325();
+stoneGameTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md
index 1e6b648d9a0..e43a4a9f23c 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f4b21000cf542c50ffc5
 title: 'Problem 326: Modulo Summations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301983
 dashedName: problem-326-modulo-summations
 ---
 
 # --description--
 
-Let an be a sequence recursively defined by: .
+Let $a_n$ be a sequence recursively defined by: $a_1 = 1$, $\displaystyle a_n = \left(\sum_{k = 1}^{n - 1} k \times a_k\right)\bmod n$.
 
-So the first 10 elements of an are: 1,1,0,3,0,3,5,4,1,9.
+So the first 10 elements of $a_n$ are: 1, 1, 0, 3, 0, 3, 5, 4, 1, 9.
 
-Let f(N,M) represent the number of pairs (p,q) such that:
+Let $f(N, M)$ represent the number of pairs $(p, q)$ such that:
 
-It can be seen that f(10,10)=4 with the pairs (3,3), (5,5), (7,9) and (9,10).
+$$ 1 \le p \le q \le N \\; \text{and} \\; \left(\sum_{i = p}^q a_i\right)\bmod M = 0$$
 
-You are also given that f(104,103)=97158.
+It can be seen that $f(10, 10) = 4$ with the pairs (3,3), (5,5), (7,9) and (9,10).
 
-Find f(1012,106).
+You are also given that $f({10}^4, {10}^3) = 97\\,158$.
+
+Find $f({10}^{12}, {10}^6)$.
 
 # --hints--
 
-`euler326()` should return 1966666166408794400.
+`moduloSummations()` should return `1966666166408794400`.
 
 ```js
-assert.strictEqual(euler326(), 1966666166408794400);
+assert.strictEqual(moduloSummations(), 1966666166408794400);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler326(), 1966666166408794400);
 ## --seed-contents--
 
 ```js
-function euler326() {
+function moduloSummations() {
 
   return true;
 }
 
-euler326();
+moduloSummations();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md
index 354596b1d74..7fb1c882f04 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4b31000cf542c50ffc6
 title: 'Problem 327: Rooms of Doom'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301984
 dashedName: problem-327-rooms-of-doom
 ---
@@ -10,28 +10,36 @@ dashedName: problem-327-rooms-of-doom
 
 A series of three rooms are connected to each other by automatic doors.
 
-Each door is operated by a security card. Once you enter a room the door automatically closes and that security card cannot be used again. A machine at the start will dispense an unlimited number of cards, but each room (including the starting room) contains scanners and if they detect that you are holding more than three security cards or if they detect an unattended security card on the floor, then all the doors will become permanently locked. However, each room contains a box where you may safely store any number of security cards for use at a later stage.
+<img class="img-responsive center-block" alt="series of three rooms, connected to each other by automatic doors" src="https://cdn.freecodecamp.org/curriculum/project-euler/rooms-of-doom.gif" style="background-color: white; padding: 10px;" />
+
+每扇門都由安全卡操作。 Once you enter a room, the door automatically closes, and that security card cannot be used again. A machine will dispense an unlimited number of cards at the start, but each room (including the starting room) contains scanners. If they detect that you are holding more than three security cards or if they detect an unattended security card on the floor, then all the doors will become permanently locked. However, each room contains a box where you may safely store any number of security cards for use at a later stage.
 
 If you simply tried to travel through the rooms one at a time then as you entered room 3 you would have used all three cards and would be trapped in that room forever!
 
-However, if you make use of the storage boxes, then escape is possible. For example, you could enter room 1 using your first card, place one card in the storage box, and use your third card to exit the room back to the start. Then after collecting three more cards from the dispensing machine you could use one to enter room 1 and collect the card you placed in the box a moment ago. You now have three cards again and will be able to travel through the remaining three doors. This method allows you to travel through all three rooms using six security cards in total.
+但是，如果您使用存儲箱，則可以進行逃生。 For example, you could enter room 1 using your first card, place one card in the storage box, and use your third card to exit the room back to the start. Then after collecting three more cards from the dispensing machine you could use one to enter room 1 and collect the card you placed in the box a moment ago. You now have three cards again and will be able to travel through the remaining three doors. This method allows you to travel through all three rooms using six security cards in total.
 
 It is possible to travel through six rooms using a total of 123 security cards while carrying a maximum of 3 cards.
 
-Let C be the maximum number of cards which can be carried at any time. Let R be the number of rooms to travel through. Let M(C,R) be the minimum number of cards required from the dispensing machine to travel through R rooms carrying up to a maximum of C cards at any time.
+Let $C$ be the maximum number of cards which can be carried at any time.
 
-For example, M(3,6)=123 and M(4,6)=23.And, ΣM(C,6)=146 for 3 ≤ C ≤ 4.
+Let $R$ be the number of rooms to travel through.
 
-You are given that ΣM(C,10)=10382 for 3 ≤ C ≤ 10.
+Let $M(C, R)$ be the minimum number of cards required from the dispensing machine to travel through $R$ rooms carrying up to a maximum of $C$ cards at any time.
 
-Find ΣM(C,30) for 3 ≤ C ≤ 40.
+For example, $M(3, 6) = 123$ and $M(4, 6) = 23$.
+
+And, $\sum M(C, 6) = 146$ for $3 ≤ C ≤ 4$.
+
+You are given that $\sum M(C, 10) = 10382$ for $3 ≤ C ≤ 10$.
+
+Find $\sum M(C, 30)$ for $3 ≤ C ≤ 40$.
 
 # --hints--
 
-`euler327()` should return 34315549139516.
+`roomsOfDoom()` should return `34315549139516`.
 
 ```js
-assert.strictEqual(euler327(), 34315549139516);
+assert.strictEqual(roomsOfDoom(), 34315549139516);
 ```
 
 # --seed--
@@ -39,12 +47,12 @@ assert.strictEqual(euler327(), 34315549139516);
 ## --seed-contents--
 
 ```js
-function euler327() {
+function roomsOfDoom() {
 
   return true;
 }
 
-euler327();
+roomsOfDoom();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-328-lowest-cost-search.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-328-lowest-cost-search.md
index 4a00f455cc1..3d3d44147e3 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-328-lowest-cost-search.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-328-lowest-cost-search.md
@@ -1,39 +1,39 @@
 ---
 id: 5900f4b41000cf542c50ffc7
 title: 'Problem 328: Lowest-cost Search'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301985
 dashedName: problem-328-lowest-cost-search
 ---
 
 # --description--
 
-We are trying to find a hidden number selected from the set of integers {1, 2, ..., n} by asking questions.
+We are trying to find a hidden number selected from the set of integers {1, 2, ..., $n$} by asking questions. Each number (question) we ask, has a <u>cost equal to the number asked</u> and we get one of three possible answers:
 
-Each number (question) we ask, has a cost equal to the number asked and we get one of three possible answers: "Your guess is lower than the hidden number", or
+- "Your guess is lower than the hidden number", or
+- "Yes, that's it!", or
+- "Your guess is higher than the hidden number".
 
-"Yes, that's it!", or
+Given the value of $n$, an optimal strategy minimizes the total cost (i.e. the sum of all the questions asked) <u>for the worst possible case</u>. E.g.
 
-"Your guess is higher than the hidden number".
+If $n = 3$, the best we can do is obviously to ask the number "<strong>2</strong>". The answer will immediately lead us to find the hidden number (at a total cost = 2).
 
-Given the value of n, an optimal strategy minimizes the total cost (i.e. the sum of all the questions asked) for the worst possible case. E.g.
+If $n = 8$, we might decide to use a "binary search" type of strategy: Our first question would be "<strong>4</strong>" and if the hidden number is higher than 4 we will need one or two additional questions. Let our second question be "<strong>6</strong>". If the hidden number is still higher than 6, we will need a third question in order to discriminate between 7 and 8. Thus, our third question will be "<strong>7</strong>" and the total cost for this worst-case scenario will be $4 + 6 + 7 = \mathbf{\color{red}{17}}$.
 
-If n=3, the best we can do is obviously to ask the number "2". The answer will immediately lead us to find the hidden number (at a total cost = 2).
+We can improve considerably the worst-case cost for $n = 8$, by asking "<strong>5</strong>" as our first question. If we are told that the hidden number is higher than 5, our second question will be "<strong>7</strong>", then we'll know for certain what the hidden number is (for a total cost of $5 + 7 = \mathbf{\color{blue}{12}}$). If we are told that the hidden number is lower than 5, our second question will be "<strong>3</strong>" and if the hidden number is lower than 3 our third question will be "<strong>1</strong>", giving a total cost of $5 + 3 + 1 = \mathbf{\color{blue}{9}}$. Since $\mathbf{\color{blue}{12 > 9}}$, the worst-case cost for this strategy is <strong><span style="color: red;">12</span></strong>. That's better than what we achieved previously with the "binary search" strategy; it is also better than or equal to any other strategy. So, in fact, we have just described an optimal strategy for $n = 8$.
 
-If n=8, we might decide to use a "binary search" type of strategy: Our first question would be "4" and if the hidden number is higher than 4 we will need one or two additional questions. Let our second question be "6". If the hidden number is still higher than 6, we will need a third question in order to discriminate between 7 and 8. Thus, our third question will be "7" and the total cost for this worst-case scenario will be 4+6+7=17.
+Let $C(n)$ be the worst-case cost achieved by an optimal strategy for $n$, as described above. Thus $C(1) = 0$, $C(2) = 1$, $C(3) = 2$ and $C(8) = 12$.
 
-We can improve considerably the worst-case cost for n=8, by asking "5" as our first question. If we are told that the hidden number is higher than 5, our second question will be "7", then we'll know for certain what the hidden number is (for a total cost of 5+7=12). If we are told that the hidden number is lower than 5, our second question will be "3" and if the hidden number is lower than 3 our third question will be "1", giving a total cost of 5+3+1=9. Since 12>9, the worst-case cost for this strategy is 12. That's better than what we achieved previously with the "binary search" strategy; it is also better than or equal to any other strategy. So, in fact, we have just described an optimal strategy for n=8.
+Similarly, $C(100) = 400$ and $\displaystyle\sum_{n = 1}^{100} C(n) = 17575$.
 
-Let C(n) be the worst-case cost achieved by an optimal strategy for n, as described above. Thus C(1) = 0, C(2) = 1, C(3) = 2 and C(8) = 12. Similarly, C(100) = 400 and C(n) = 17575.
-
-Find C(n).
+Find $\displaystyle\sum_{n = 1}^{200\\,000} C(n)$.
 
 # --hints--
 
-`euler328()` should return 260511850222.
+`lowestCostSearch()` should return `260511850222`.
 
 ```js
-assert.strictEqual(euler328(), 260511850222);
+assert.strictEqual(lowestCostSearch(), 260511850222);
 ```
 
 # --seed--
@@ -41,12 +41,12 @@ assert.strictEqual(euler328(), 260511850222);
 ## --seed-contents--
 
 ```js
-function euler328() {
+function lowestCostSearch() {
 
   return true;
 }
 
-euler328();
+lowestCostSearch();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-329-prime-frog.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-329-prime-frog.md
index 6b1e185daf9..e14df07e58a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-329-prime-frog.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-329-prime-frog.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4b51000cf542c50ffc8
 title: 'Problem 329: Prime Frog'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301986
 dashedName: problem-329-prime-frog
 ---
@@ -12,20 +12,26 @@ Susan has a prime frog.
 
 Her frog is jumping around over 500 squares numbered 1 to 500.
 
-He can only jump one square to the left or to the right, with equal probability, and he cannot jump outside the range \[1;500].(if it lands at either end, it automatically jumps to the only available square on the next move.)
+He can only jump one square to the left or to the right, with equal probability, and he cannot jump outside the range [1;500]. (if it lands at either end, it automatically jumps to the only available square on the next move.)
 
-When he is on a square with a prime number on it, he croaks 'P' (PRIME) with probability 2/3 or 'N' (NOT PRIME) with probability 1/3 just before jumping to the next square. When he is on a square with a number on it that is not a prime he croaks 'P' with probability 1/3 or 'N' with probability 2/3 just before jumping to the next square.
+When he is on a square with a prime number on it, he croaks 'P' (PRIME) with probability $\frac{2}{3}$ or 'N' (NOT PRIME) with probability $\frac{1}{3}$ just before jumping to the next square. When he is on a square with a number on it that is not a prime he croaks 'P' with probability $\frac{1}{3}$ or 'N' with probability $\frac{2}{3}$ just before jumping to the next square.
 
 Given that the frog's starting position is random with the same probability for every square, and given that she listens to his first 15 croaks, what is the probability that she hears the sequence PPPPNNPPPNPPNPN?
 
-Give your answer as a fraction p/q in reduced form.
+Give your answer as a string as a fraction `p/q` in reduced form.
 
 # --hints--
 
-`euler329()` should return 199740353 / 29386561536000.
+`primeFrog()` should return a string.
 
 ```js
-assert.strictEqual(euler329(), 199740353 / 29386561536000);
+assert(typeof primeFrog() === 'string');
+```
+
+`primeFrog()` should return the string `199740353/29386561536000`.
+
+```js
+assert.strictEqual(primeFrog(), '199740353/29386561536000');
 ```
 
 # --seed--
@@ -33,12 +39,12 @@ assert.strictEqual(euler329(), 199740353 / 29386561536000);
 ## --seed-contents--
 
 ```js
-function euler329() {
+function primeFrog() {
 
   return true;
 }
 
-euler329();
+primeFrog();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.md
index ec7756e9451..5419f2f8270 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f38d1000cf542c50fea0
 title: 'Problem 33: Digit cancelling fractions'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301987
 dashedName: problem-33-digit-cancelling-fractions
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-331-cross-flips.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-331-cross-flips.md
index 4d3d330a744..84e5ffbdd51 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-331-cross-flips.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-331-cross-flips.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4b71000cf542c50ffca
 title: 'Problem 331: Cross flips'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301989
 dashedName: problem-331-cross-flips
 ---
@@ -10,24 +10,26 @@ dashedName: problem-331-cross-flips
 
 N×N disks are placed on a square game board. Each disk has a black side and white side.
 
-At each turn, you may choose a disk and flip all the disks in the same row and the same column as this disk: thus 2×N-1 disks are flipped. The game ends when all disks show their white side. The following example shows a game on a 5×5 board.
+At each turn, you may choose a disk and flip all the disks in the same row and the same column as this disk: thus $2 × N - 1$ disks are flipped. The game ends when all disks show their white side. The following example shows a game on a 5×5 board.
+
+<img class="img-responsive center-block" alt="animation showing game on 5x5 board" src="https://cdn.freecodecamp.org/curriculum/project-euler/cross-flips.gif" style="background-color: white; padding: 10px;" />
 
 It can be proven that 3 is the minimal number of turns to finish this game.
 
-The bottom left disk on the N×N board has coordinates (0,0); the bottom right disk has coordinates (N-1,0) and the top left disk has coordinates (0,N-1).
+The bottom left disk on the $N×N$ board has coordinates (0, 0); the bottom right disk has coordinates ($N - 1$,$0$) and the top left disk has coordinates ($0$,$N - 1$).
 
-Let CN be the following configuration of a board with N×N disks: A disk at (x,y) satisfying , shows its black side; otherwise, it shows its white side. C5 is shown above.
+Let $C_N$ be the following configuration of a board with $N × N$ disks: A disk at ($x$, $y$) satisfying $N - 1 \le \sqrt{x^2 + y^2} \lt N$, shows its black side; otherwise, it shows its white side. $C_5$ is shown above.
 
-Let T(N) be the minimal number of turns to finish a game starting from configuration CN or 0 if configuration CN is unsolvable. We have shown that T(5)=3. You are also given that T(10)=29 and T(1 000)=395253.
+Let $T(N)$ be the minimal number of turns to finish a game starting from configuration $C_N$ or 0 if configuration $C_N$ is unsolvable. We have shown that $T(5) = 3$. You are also given that $T(10) = 29$ and $T(1\\,000) = 395\\,253$.
 
-Find .
+Find $\displaystyle \sum_{i = 3}^{31} T(2^i - i)$.
 
 # --hints--
 
-`euler331()` should return 467178235146843500.
+`crossFlips()` should return `467178235146843500`.
 
 ```js
-assert.strictEqual(euler331(), 467178235146843500);
+assert.strictEqual(crossFlips(), 467178235146843500);
 ```
 
 # --seed--
@@ -35,12 +37,12 @@ assert.strictEqual(euler331(), 467178235146843500);
 ## --seed-contents--
 
 ```js
-function euler331() {
+function crossFlips() {
 
   return true;
 }
 
-euler331();
+crossFlips();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md
index ea3a4d0c431..06401c06d14 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4b91000cf542c50ffcb
 title: 'Problem 332: Spherical triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301990
 dashedName: problem-332-spherical-triangles
 ---
@@ -10,18 +10,26 @@ dashedName: problem-332-spherical-triangles
 
 A spherical triangle is a figure formed on the surface of a sphere by three great circular arcs intersecting pairwise in three vertices.
 
-Let C(r) be the sphere with the centre (0,0,0) and radius r. Let Z(r) be the set of points on the surface of C(r) with integer coordinates. Let T(r) be the set of spherical triangles with vertices in Z(r). Degenerate spherical triangles, formed by three points on the same great arc, are not included in T(r). Let A(r) be the area of the smallest spherical triangle in T(r).
+<img class="img-responsive center-block" alt="spherical triangle formed on the surface of a sphere" src="https://cdn.freecodecamp.org/curriculum/project-euler/spherical-triangles.jpg" style="background-color: white; padding: 10px;" />
 
-For example A(14) is 3.294040 rounded to six decimal places.
+Let $C(r)$ be the sphere with the centre (0,0,0) and radius $r$.
 
-Find A(r). Give your answer rounded to six decimal places.
+Let $Z(r)$ be the set of points on the surface of $C(r)$ with integer coordinates.
+
+Let $T(r)$ be the set of spherical triangles with vertices in $Z(r)$. Degenerate spherical triangles, formed by three points on the same great arc, are <u>not</u> included in $T(r)$.
+
+Let $A(r)$ be the area of the smallest spherical triangle in $T(r)$.
+
+For example $A(14)$ is 3.294040 rounded to six decimal places.
+
+Find $\displaystyle \sum_{r = 1}^{50} A(r)$. 將您的答案四捨五入到小數點後六位。
 
 # --hints--
 
-`euler332()` should return 2717.751525.
+`sphericalTriangles()` should return `2717.751525`.
 
 ```js
-assert.strictEqual(euler332(), 2717.751525);
+assert.strictEqual(sphericalTriangles(), 2717.751525);
 ```
 
 # --seed--
@@ -29,12 +37,12 @@ assert.strictEqual(euler332(), 2717.751525);
 ## --seed-contents--
 
 ```js
-function euler332() {
+function sphericalTriangles() {
 
   return true;
 }
 
-euler332();
+sphericalTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-333-special-partitions.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-333-special-partitions.md
index 5af490eb7ea..d771a608002 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-333-special-partitions.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-333-special-partitions.md
@@ -1,33 +1,36 @@
 ---
 id: 5900f4b91000cf542c50ffcc
-title: 'Problem 333: Special partitions'
-challengeType: 5
+title: '問題 333：特殊分區'
+challengeType: 1
 forumTopicId: 301991
 dashedName: problem-333-special-partitions
 ---
 
 # --description--
 
-All positive integers can be partitioned in such a way that each and every term of the partition can be expressed as 2ix3j, where i,j ≥ 0.
+All positive integers can be partitioned in such a way that each and every term of the partition can be expressed as $2^i \times 3^j$, where $i, j ≥ 0$.
 
-Let's consider only those such partitions where none of the terms can divide any of the other terms. For example, the partition of 17 = 2 + 6 + 9 = (21x30 + 21x31 + 20x32) would not be valid since 2 can divide 6. Neither would the partition 17 = 16 + 1 = (24x30 + 20x30) since 1 can divide 16. The only valid partition of 17 would be 8 + 9 = (23x30 + 20x32).
+Let's consider only those such partitions where none of the terms can divide any of the other terms. For example, the partition of $17 = 2 + 6 + 9 = (2^1 \times 3^0 + 2^1 \times 3^1 + 2^0 \times 3^2)$ would not be valid since 2 can divide 6. Neither would the partition $17 = 16 + 1 = (2^4 \times 3^0 + 2^0 \times 3^0)$ since 1 can divide 16. The only valid partition of 17 would be $8 + 9 = (2^3 \times 3^0 + 2^0 \times 3^2)$.
 
-Many integers have more than one valid partition, the first being 11 having the following two partitions. 11 = 2 + 9 = (21x30 + 20x32) 11 = 8 + 3 = (23x30 + 20x31)
+Many integers have more than one valid partition, the first being 11 having the following two partitions.
 
-Let's define P(n) as the number of valid partitions of n. For example, P(11) = 2.
+$$\begin{align}   & 11 = 2 + 9 = (2^1 \times 3^0 + 2^0 \times 3^2) \\\\
+  & 11 = 8 + 3 = (2^3 \times 3^0 + 2^0 \times 3^1) \end{align}$$
 
-Let's consider only the prime integers q which would have a single valid partition such as P(17).
+Let's define $P(n)$ as the number of valid partitions of $n$. For example, $P(11) = 2$.
 
-The sum of the primes q &lt;100 such that P(q)=1 equals 233.
+Let's consider only the prime integers $q$ which would have a single valid partition such as $P(17)$.
 
-Find the sum of the primes q &lt;1000000 such that P(q)=1.
+The sum of the primes $q &lt;100$ such that $P(q) = 1$ equals 233.
+
+Find the sum of the primes $q &lt; 1\\,000\\,000$ such that $P(q) = 1$.
 
 # --hints--
 
-`euler333()` should return 3053105.
+`specialPartitions()` should return `3053105`.
 
 ```js
-assert.strictEqual(euler333(), 3053105);
+assert.strictEqual(specialPartitions(), 3053105);
 ```
 
 # --seed--
@@ -35,12 +38,12 @@ assert.strictEqual(euler333(), 3053105);
 ## --seed-contents--
 
 ```js
-function euler333() {
+function specialPartitions() {
 
   return true;
 }
 
-euler333();
+specialPartitions();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md
index fe354cec8a1..d8be81c5efa 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4ba1000cf542c50ffcd
 title: 'Problem 334: Spilling the beans'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301992
 dashedName: problem-334-spilling-the-beans
 ---
@@ -12,20 +12,25 @@ In Plato's heaven, there exist an infinite number of bowls in a straight line. E
 
 For example, consider two adjacent bowls containing 2 and 3 beans respectively, all other bowls being empty. The following eight moves will finish the game:
 
-<!-- TODO Use MathJax and re-write from projecteuler.net -->
+<img class="img-responsive center-block" alt="animation of game when two adjacent bowls contains 2 and 3 beans respectivelly" src="https://cdn.freecodecamp.org/curriculum/project-euler/spilling-the-beans.gif" style="background-color: white; padding: 10px;" />
 
-You are given the following sequences: t0 = 123456. ti = ti-12, if ti-1 is even ti-12 926252, if ti-1 is odd where ⌊x⌋ is the floor function and is the bitwise XOR operator. bi = ( ti mod 211) + 1.
+You are given the following sequences:
 
-The first two terms of the last sequence are b1 = 289 and b2 = 145. If we start with b1 and b2 beans in two adjacent bowls, 3419100 moves would be required to finish the game.
+$$\begin{align}   & t_0 = 123456, \\\\
+  & t_i = \begin{cases}          \frac{t_{i - 1}}{2},               & \text{if $t_{i - 1}$ is even} \\\\
+         \left\lfloor\frac{t_{i - 1}}{2}\right\rfloor \oplus 926252, & \text{if $t_{i - 1}$ is odd}          \end{cases} \\\\
+         & \qquad \text{where $⌊x⌋$ is the floor function and $\oplus$ is the bitwise XOR operator.} \\\\ & b_i = (t_i\bmod 2^{11}) + 1. \end{align}$$
 
-Consider now 1500 adjacent bowls containing b1, b2,..., b1500 beans respectively, all other bowls being empty. Find how many moves it takes before the game ends.
+The first two terms of the last sequence are $b_1 = 289$ and $b_2 = 145$. If we start with $b_1$ and $b_2$ beans in two adjacent bowls, 3419100 moves would be required to finish the game.
+
+Consider now 1500 adjacent bowls containing $b_1, b_2, \ldots, b_{1500}$ beans respectively, all other bowls being empty. Find how many moves it takes before the game ends.
 
 # --hints--
 
-`euler334()` should return 150320021261690850.
+`spillingTheBeans()` should return `150320021261690850`.
 
 ```js
-assert.strictEqual(euler334(), 150320021261690850);
+assert.strictEqual(spillingTheBeans(), 150320021261690850);
 ```
 
 # --seed--
@@ -33,12 +38,12 @@ assert.strictEqual(euler334(), 150320021261690850);
 ## --seed-contents--
 
 ```js
-function euler334() {
+function spillingTheBeans() {
 
   return true;
 }
 
-euler334();
+spillingTheBeans();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md
index 0605e0d053f..c1b35177c9b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4bd1000cf542c50ffce
 title: 'Problem 335: Gathering the beans'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301993
 dashedName: problem-335-gathering-the-beans
 ---
@@ -10,18 +10,20 @@ dashedName: problem-335-gathering-the-beans
 
 Whenever Peter feels bored, he places some bowls, containing one bean each, in a circle. After this, he takes all the beans out of a certain bowl and drops them one by one in the bowls going clockwise. He repeats this, starting from the bowl he dropped the last bean in, until the initial situation appears again. For example with 5 bowls he acts as follows:
 
+<img class="img-responsive center-block" alt="animation of moving beans in 5 bowls" src="https://cdn.freecodecamp.org/curriculum/project-euler/gathering-the-beans.gif" style="background-color: white; padding: 10px;" />
+
 So with 5 bowls it takes Peter 15 moves to return to the initial situation.
 
-Let M(x) represent the number of moves required to return to the initial situation, starting with x bowls. Thus, M(5) = 15. It can also be verified that M(100) = 10920.
+Let $M(x)$ represent the number of moves required to return to the initial situation, starting with $x$ bowls. Thus, $M(5) = 15$. It can also be verified that $M(100) = 10920$.
 
-Find M(2k+1). Give your answer modulo 79.
+Find $\displaystyle\sum_{k = 0}^{{10}^{18}} M(2^k + 1)$. Give your answer modulo $7^9$.
 
 # --hints--
 
-`euler335()` should return 5032316.
+`gatheringTheBeans()` should return `5032316`.
 
 ```js
-assert.strictEqual(euler335(), 5032316);
+assert.strictEqual(gatheringTheBeans(), 5032316);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler335(), 5032316);
 ## --seed-contents--
 
 ```js
-function euler335() {
+function gatheringTheBeans() {
 
   return true;
 }
 
-euler335();
+gatheringTheBeans();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md
index 3dbf18111c6..c5df56c3d7b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md
@@ -1,33 +1,41 @@
 ---
 id: 5900f4bd1000cf542c50ffcf
 title: 'Problem 336: Maximix Arrangements'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301994
 dashedName: problem-336-maximix-arrangements
 ---
 
 # --description--
 
-A train is used to transport four carriages in the order: ABCD. However, sometimes when the train arrives to collect the carriages they are not in the correct order.
+A train is used to transport four carriages in the order: $ABCD$. However, sometimes when the train arrives to collect the carriages they are not in the correct order.
 
-To rearrange the carriages they are all shunted on to a large rotating turntable. After the carriages are uncoupled at a specific point the train moves off the turntable pulling the carriages still attached with it. The remaining carriages are rotated 180 degrees. All of the carriages are then rejoined and this process is repeated as often as necessary in order to obtain the least number of uses of the turntable.
+To rearrange the carriages, they are all shunted onto a large rotating turntable. After the carriages are uncoupled at a specific point, the train moves off the turntable pulling the carriages still attached with it. The remaining carriages are rotated 180°. All of the carriages are then rejoined and this process is repeated as often as necessary in order to obtain the least number of uses of the turntable.
 
-Some arrangements, such as ADCB, can be solved easily: the carriages are separated between A and D, and after DCB are rotated the correct order has been achieved.
+Some arrangements, such as $ADCB$, can be solved easily: the carriages are separated between $A$ and $D$, and after $DCB$ are rotated the correct order has been achieved.
 
-However, Simple Simon, the train driver, is not known for his efficiency, so he always solves the problem by initially getting carriage A in the correct place, then carriage B, and so on.
+However, Simple Simon, the train driver, is not known for his efficiency, so he always solves the problem by initially getting carriage $A$ in the correct place, then carriage $B$, and so on.
 
-Using four carriages, the worst possible arrangements for Simon, which we shall call maximix arrangements, are DACB and DBAC; each requiring him five rotations (although, using the most efficient approach, they could be solved using just three rotations). The process he uses for DACB is shown below.
+Using four carriages, the worst possible arrangements for Simon, which we shall call maximix arrangements, are $DACB$ and $DBAC$; each requiring him five rotations (although, using the most efficient approach, they could be solved using just three rotations). The process he uses for $DACB$ is shown below.
 
-It can be verified that there are 24 maximix arrangements for six carriages, of which the tenth lexicographic maximix arrangement is DFAECB.
+<img class="img-responsive center-block" alt="five rotations for maximix arrangement DACB" src="https://cdn.freecodecamp.org/curriculum/project-euler/maximix-arrangements.gif" style="background-color: white; padding: 10px;" />
 
-Find the 2011th lexicographic maximix arrangement for eleven carriages.
+It can be verified that there are 24 maximix arrangements for six carriages, of which the tenth lexicographic maximix arrangement is $DFAECB$.
+
+Find the ${2011}^{\text{th}}$ lexicographic maximix arrangement for eleven carriages.
 
 # --hints--
 
-`euler336()` should return CAGBIHEFJDK.
+`maximixArrangements()` should return a string.
 
 ```js
-assert.strictEqual(euler336(), CAGBIHEFJDK);
+assert(typeof maximixArrangements() === 'string');
+```
+
+`maximixArrangements()` should return the string `CAGBIHEFJDK`.
+
+```js
+assert.strictEqual(maximixArrangements(), 'CAGBIHEFJDK');
 ```
 
 # --seed--
@@ -35,12 +43,12 @@ assert.strictEqual(euler336(), CAGBIHEFJDK);
 ## --seed-contents--
 
 ```js
-function euler336() {
+function maximixArrangements() {
 
   return true;
 }
 
-euler336();
+maximixArrangements();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.md
index 677c918f053..ed090ed3f86 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.md
@@ -1,35 +1,35 @@
 ---
 id: 5900f4be1000cf542c50ffd0
 title: 'Problem 337: Totient Stairstep Sequences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301995
 dashedName: problem-337-totient-stairstep-sequences
 ---
 
 # --description--
 
-Let {a1, a2,..., an} be an integer sequence of length n such that:
+Let $\\{a_1, a_2, \ldots, a_n\\}$ be an integer sequence of length $n$ such that:
 
-a1 = 6
+- $a_1 = 6$
+- for all $1 ≤ i &lt; n$ : $φ(a_i) &lt; φ(a_{i + 1}) &lt; a_i &lt; a_{i + 1}$
 
-for all 1 ≤ i &lt; n : φ(ai) &lt; φ(ai+1) &lt; ai &lt; ai+11
+$φ$ denotes Euler's totient function.
 
-Let S(N) be the number of such sequences with an ≤ N.
+Let $S(N)$ be the number of such sequences with $a_n ≤ N$.
 
-For example, S(10) = 4: {6}, {6, 8}, {6, 8, 9} and {6, 10}.
+For example, $S(10) = 4$: {6}, {6, 8}, {6, 8, 9} and {6, 10}.
 
-We can verify that S(100) = 482073668 and S(10 000) mod 108 = 73808307.
+We can verify that $S(100) = 482\\,073\\,668$ and $S(10\\,000)\bmod {10}^8 = 73\\,808\\,307$.
 
-Find S(20 000 000) mod 108.
+Find $S(20\\,000\\,000)\bmod {10}^8$.
 
-1 φ denotes Euler's totient function.
 
 # --hints--
 
-`euler337()` should return 85068035.
+`totientStairstepSequences()` should return `85068035`.
 
 ```js
-assert.strictEqual(euler337(), 85068035);
+assert.strictEqual(totientStairstepSequences(), 85068035);
 ```
 
 # --seed--
@@ -37,12 +37,12 @@ assert.strictEqual(euler337(), 85068035);
 ## --seed-contents--
 
 ```js
-function euler337() {
+function totientStairstepSequences() {
 
   return true;
 }
 
-euler337();
+totientStairstepSequences();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md
index 514dc560b01..9a2143b65fd 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md
@@ -1,33 +1,35 @@
 ---
 id: 5900f4be1000cf542c50ffd1
 title: 'Problem 338: Cutting Rectangular Grid Paper'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301996
 dashedName: problem-338-cutting-rectangular-grid-paper
 ---
 
 # --description--
 
-A rectangular sheet of grid paper with integer dimensions w × h is given. Its grid spacing is 1.
+A rectangular sheet of grid paper with integer dimensions $w$ × $h$ is given. Its grid spacing is 1.
 
 When we cut the sheet along the grid lines into two pieces and rearrange those pieces without overlap, we can make new rectangles with different dimensions.
 
-For example, from a sheet with dimensions 9 × 4 , we can make rectangles with dimensions 18 × 2, 12 × 3 and 6 × 6 by cutting and rearranging as below:
+For example, from a sheet with dimensions 9 × 4, we can make rectangles with dimensions 18 × 2, 12 × 3 and 6 × 6 by cutting and rearranging as below:
 
-Similarly, from a sheet with dimensions 9 × 8 , we can make rectangles with dimensions 18 × 4 and 12 × 6 .
+<img class="img-responsive center-block" alt="sheet with 9 x 4 dimensions cut in three different ways to make rectangles with 18 x 2, 12 x 3 and 6 x 6 dimensions" src="https://cdn.freecodecamp.org/curriculum/project-euler/cutting-rectangular-grid-paper.gif" style="background-color: white; padding: 10px;" />
 
-For a pair w and h, let F(w,h) be the number of distinct rectangles that can be made from a sheet with dimensions w × h . For example, F(2,1) = 0, F(2,2) = 1, F(9,4) = 3 and F(9,8) = 2. Note that rectangles congruent to the initial one are not counted in F(w,h). Note also that rectangles with dimensions w × h and dimensions h × w are not considered distinct.
+Similarly, from a sheet with dimensions 9 × 8, we can make rectangles with dimensions 18 × 4 and 12 × 6.
 
-For an integer N, let G(N) be the sum of F(w,h) for all pairs w and h which satisfy 0 &lt; h ≤ w ≤ N. We can verify that G(10) = 55, G(103) = 971745 and G(105) = 9992617687.
+For a pair $w$ and $h$, let $F(w, h)$ be the number of distinct rectangles that can be made from a sheet with dimensions $w$ × $h$. For example, $F(2, 1) = 0$, $F(2, 2) = 1$, $F(9, 4) = 3$ and $F(9, 8) = 2$. Note that rectangles congruent to the initial one are not counted in $F(w, h)$. Note also that rectangles with dimensions $w$ × $h$ and dimensions $h$ × $w$ are not considered distinct.
 
-Find G(1012). Give your answer modulo 108.
+For an integer $N$, let $G(N)$ be the sum of $F(w, h)$ for all pairs $w$ and $h$ which satisfy $0 &lt; h ≤ w ≤ N$. We can verify that $G(10) = 55$, $G({10}^3) = 971\\,745$ and $G({10}^5) = 9\\,992\\,617\\,687$.
+
+Find $G({10}^{12})$. Give your answer modulo ${10}^8$.
 
 # --hints--
 
-`euler338()` should return 15614292.
+`cuttingRectangularGridPaper()` should return `15614292`.
 
 ```js
-assert.strictEqual(euler338(), 15614292);
+assert.strictEqual(cuttingRectangularGridPaper(), 15614292);
 ```
 
 # --seed--
@@ -35,12 +37,12 @@ assert.strictEqual(euler338(), 15614292);
 ## --seed-contents--
 
 ```js
-function euler338() {
+function cuttingRectangularGridPaper() {
 
   return true;
 }
 
-euler338();
+cuttingRectangularGridPaper();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.md
index 6844c7e65c9..7c1934c581b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.md
@@ -1,25 +1,27 @@
 ---
 id: 5900f4c01000cf542c50ffd2
 title: 'Problem 339: Peredur fab Efrawg'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301997
 dashedName: problem-339-peredur-fab-efrawg
 ---
 
 # --description--
 
-"And he came towards a valley, through which ran a river; and the borders of the valley were wooded, and on each side of the river were level meadows. And on one side of the river he saw a flock of white sheep, and on the other a flock of black sheep. And whenever one of the white sheep bleated, one of the black sheep would cross over and become white; and when one of the black sheep bleated, one of the white sheep would cross over and become black."en.wikisource.org
+"And he came towards a valley, through which ran a river; and the borders of the valley were wooded, and on each side of the river were level meadows. And on one side of the river he saw a flock of white sheep, and on the other a flock of black sheep. And whenever one of the white sheep bleated, one of the black sheep would cross over and become white; and when one of the black sheep bleated, one of the white sheep would cross over and become black." - Peredur the Son of Evrawc
 
-Initially each flock consists of n sheep. Each sheep (regardless of colour) is equally likely to be the next sheep to bleat. After a sheep has bleated and a sheep from the other flock has crossed over, Peredur may remove a number of white sheep in order to maximize the expected final number of black sheep. Let E(n) be the expected final number of black sheep if Peredur uses an optimal strategy.
+Initially, each flock consists of $n$ sheep. Each sheep (regardless of color) is equally likely to be the next sheep to bleat. After a sheep has bleated and a sheep from the other flock has crossed over, Peredur may remove a number of white sheep in order to maximize the expected final number of black sheep. Let $E(n)$ be the expected final number of black sheep if Peredur uses an optimal strategy.
 
-You are given that E(5) = 6.871346 rounded to 6 places behind the decimal point. Find E(10 000) and give your answer rounded to 6 places behind the decimal point.
+You are given that $E(5) = 6.871346$ rounded to 6 places behind the decimal point.
+
+Find $E(10\\,000)$ and give your answer rounded to 6 places behind the decimal point.
 
 # --hints--
 
-`euler339()` should return 19823.542204.
+`peredurFabEfrawg()` should return `19823.542204`.
 
 ```js
-assert.strictEqual(euler339(), 19823.542204);
+assert.strictEqual(peredurFabEfrawg(), 19823.542204);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler339(), 19823.542204);
 ## --seed-contents--
 
 ```js
-function euler339() {
+function peredurFabEfrawg() {
 
   return true;
 }
 
-euler339();
+peredurFabEfrawg();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md
index 080d068344e..ea0dd907b2f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f38e1000cf542c50fea1
-title: 'Problem 34: Digit factorials'
-challengeType: 5
+title: '問題 34：數字階乘'
+challengeType: 1
 forumTopicId: 301998
 dashedName: problem-34-digit-factorials
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-340-crazy-function.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-340-crazy-function.md
index 86b29f061e2..72da02c1095 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-340-crazy-function.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-340-crazy-function.md
@@ -1,31 +1,30 @@
 ---
 id: 5900f4c21000cf542c50ffd4
 title: 'Problem 340: Crazy Function'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301999
 dashedName: problem-340-crazy-function
 ---
 
 # --description--
 
-For fixed integers a, b, c, define the crazy function F(n) as follows:
+For fixed integers $a$, $b$, $c$, define the crazy function $F(n)$ as follows:
 
-F(n) = n - c for all n > b
+$$\begin{align}   & F(n) = n - c \\;\text{ for all } n > b \\\\
+  & F(n) = F(a + F(a + F(a + F(a + n)))) \\;\text{ for all } n ≤ b. \end{align}$$
 
-F(n) = F(a + F(a + F(a + F(a + n)))) for all n ≤ b.
+Also, define $S(a, b, c) = \displaystyle\sum_{n = 0}^b F(n)$.
 
-Also, define S(a, b, c) = .
+For example, if $a = 50$, $b = 2000$ and $c = 40$, then $F(0) = 3240$ and $F(2000) = 2040$. Also, $S(50, 2000, 40) = 5\\,204\\,240$.
 
-For example, if a = 50, b = 2000 and c = 40, then F(0) = 3240 and F(2000) = 2040. Also, S(50, 2000, 40) = 5204240.
-
-Find the last 9 digits of S(217, 721, 127).
+Find the last 9 digits of $S({21}^7, 7^{21}, {12}^7)$.
 
 # --hints--
 
-`euler340()` should return 291504964.
+`crazyFunction()` should return `291504964`.
 
 ```js
-assert.strictEqual(euler340(), 291504964);
+assert.strictEqual(crazyFunction(), 291504964);
 ```
 
 # --seed--
@@ -33,12 +32,12 @@ assert.strictEqual(euler340(), 291504964);
 ## --seed-contents--
 
 ```js
-function euler340() {
+function crazyFunction() {
 
   return true;
 }
 
-euler340();
+crazyFunction();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md
index 740ef0d7518..8f256e2253d 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md
@@ -1,27 +1,30 @@
 ---
 id: 5900f4c11000cf542c50ffd3
-title: 'Problem 341: Golomb''s self-describing sequence'
-challengeType: 5
+title: '問題 341：Golomb 的自描述序列'
+challengeType: 1
 forumTopicId: 302000
 dashedName: problem-341-golombs-self-describing-sequence
 ---
 
 # --description--
 
-The Golomb's self-describing sequence {G(n)} is the only nondecreasing sequence of natural numbers such that n appears exactly G(n) times in the sequence. The values of G(n) for the first few n are
+The Golomb's self-describing sequence ($G(n)$) is the only nondecreasing sequence of natural numbers such that $n$ appears exactly $G(n)$ times in the sequence. The values of $G(n)$ for the first few $n$ are
 
-n123456789101112131415…G(n)122334445556666…
+$$\begin{array}{c}   n    & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 & 11 & 12 & 13 & 14 & 15 & \ldots \\\\
+  G(n) & 1 & 2 & 2 & 3 & 3 & 4 & 4 & 4 & 5 & 5  &  5 &  6 &  6 &  6 &  6 & \ldots \end{array}$$
 
-You are given that G(103) = 86, G(106) = 6137. You are also given that ΣG(n3) = 153506976 for 1 ≤ n &lt; 103.
+You are given that $G({10}^3) = 86$, $G({10}^6) = 6137$.
 
-Find ΣG(n3) for 1 ≤ n &lt; 106.
+You are also given that $\sum G(n^3) = 153\\,506\\,976$ for $1 ≤ n &lt; {10}^3$.
+
+Find $\sum G(n^3)$ for $1 ≤ n &lt; {10}^6$.
 
 # --hints--
 
-`euler341()` should return 56098610614277016.
+`golombsSequence()` should return `56098610614277016`.
 
 ```js
-assert.strictEqual(euler341(), 56098610614277016);
+assert.strictEqual(golombsSequence(), 56098610614277016);
 ```
 
 # --seed--
@@ -29,12 +32,12 @@ assert.strictEqual(euler341(), 56098610614277016);
 ## --seed-contents--
 
 ```js
-function euler341() {
+function golombsSequence() {
 
   return true;
 }
 
-euler341();
+golombsSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.md
index 2253ce390fb..85990bc5b54 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4c31000cf542c50ffd5
 title: 'Problem 342: The totient of a square is a cube'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302001
 dashedName: problem-342-the-totient-of-a-square-is-a-cube
 ---
@@ -10,20 +10,19 @@ dashedName: problem-342-the-totient-of-a-square-is-a-cube
 
 Consider the number 50.
 
-502 = 2500 = 22 × 54, so φ(2500) = 2 × 4 × 53 = 8 × 53 = 23 × 53. 1
+${50}^2 = 2500 = 2^2 × 5^4$, so $φ(2500) = 2 × 4 × 5^3 = 8 × 5^3 = 2^3 × 5^3$. $φ$ denotes Euler's totient function.
 
-So 2500 is a square and φ(2500) is a cube.
+So 2500 is a square and $φ(2500)$ is a cube.
 
-Find the sum of all numbers n, 1 &lt; n &lt; 1010 such that φ(n2) is a cube.
+Find the sum of all numbers $n$, $1 &lt; n &lt; {10}^{10}$ such that $φ(n^2)$ is a cube.
 
-1 φ denotes Euler's totient function.
 
 # --hints--
 
-`euler342()` should return 5943040885644.
+`totientOfSquare()` should return `5943040885644`.
 
 ```js
-assert.strictEqual(euler342(), 5943040885644);
+assert.strictEqual(totientOfSquare(), 5943040885644);
 ```
 
 # --seed--
@@ -31,12 +30,12 @@ assert.strictEqual(euler342(), 5943040885644);
 ## --seed-contents--
 
 ```js
-function euler342() {
+function totientOfSquare() {
 
   return true;
 }
 
-euler342();
+totientOfSquare();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-343-fractional-sequences.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-343-fractional-sequences.md
index 3102009e8c0..f284af9e94b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-343-fractional-sequences.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-343-fractional-sequences.md
@@ -1,39 +1,38 @@
 ---
 id: 5900f4c41000cf542c50ffd6
 title: 'Problem 343: Fractional Sequences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302002
 dashedName: problem-343-fractional-sequences
 ---
 
 # --description--
 
-For any positive integer k, a finite sequence ai of fractions xi/yi is defined by:
+For any positive integer $k$, a finite sequence $a_i$ of fractions $\frac{x_i}{y_i}$ is defined by:
 
-a1 = 1/k and
+- $a_1 = \displaystyle\frac{1}{k}$ and
+- $a_i = \displaystyle\frac{(x_{i - 1} + 1)}{(y_{i - 1} - 1)}$ reduced to lowest terms for $i > 1$.
 
-ai = (xi-1+1)/(yi-1-1) reduced to lowest terms for i>1.
+When $a_i$ reaches some integer $n$, the sequence stops. (That is, when $y_i = 1$.)
 
-When ai reaches some integer n, the sequence stops. (That is, when yi=1.)
+Define $f(k) = n$.
 
-Define f(k) = n.
+For example, for $k = 20$:
 
-For example, for k = 20:
+$$\frac{1}{20} → \frac{2}{19} → \frac{3}{18} = \frac{1}{6} → \frac{2}{5} → \frac{3}{4} → \frac{4}{3} → \frac{5}{2} → \frac{6}{1} = 6$$
 
-1/20 → 2/19 → 3/18 = 1/6 → 2/5 → 3/4 → 4/3 → 5/2 → 6/1 = 6
+So $f(20) = 6$.
 
-So f(20) = 6.
+Also $f(1) = 1$, $f(2) = 2$, $f(3) = 1$ and $\sum f(k^3) = 118\\,937$ for $1 ≤ k ≤ 100$.
 
-Also f(1) = 1, f(2) = 2, f(3) = 1 and Σf(k3) = 118937 for 1 ≤ k ≤ 100.
-
-Find Σf(k3) for 1 ≤ k ≤ 2×106.
+Find $\sum f(k^3)$ for $1 ≤ k ≤ 2 × {10}^6$.
 
 # --hints--
 
-`euler343()` should return 269533451410884200.
+`fractionalSequences()` should return `269533451410884200`.
 
 ```js
-assert.strictEqual(euler343(), 269533451410884200);
+assert.strictEqual(fractionalSequences(), 269533451410884200);
 ```
 
 # --seed--
@@ -41,12 +40,12 @@ assert.strictEqual(euler343(), 269533451410884200);
 ## --seed-contents--
 
 ```js
-function euler343() {
+function fractionalSequences() {
 
   return true;
 }
 
-euler343();
+fractionalSequences();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
index f4fb768b65b..0f9fcc5f2e6 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4c51000cf542c50ffd7
 title: 'Problem 344: Silver dollar game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302003
 dashedName: problem-344-silver-dollar-game
 ---
@@ -18,20 +18,22 @@ Alternatively, the player can choose to make the special move of pocketing the l
 
 The winner is the player who pockets the silver dollar.
 
+<img class="img-responsive center-block" alt="silver dollar game" src="https://cdn.freecodecamp.org/curriculum/project-euler/silver-dollar-game.gif" style="background-color: white; padding: 10px;" />
+
 A winning configuration is an arrangement of coins on the strip where the first player can force a win no matter what the second player does.
 
-Let W(n,c) be the number of winning configurations for a strip of n squares, c worthless coins and one silver dollar.
+Let $W(n, c)$ be the number of winning configurations for a strip of $n$ squares, $c$ worthless coins and one silver dollar.
 
-You are given that W(10,2) = 324 and W(100,10) = 1514704946113500.
+You are given that $W(10, 2) = 324$ and $W(100, 10) = 1\\,514\\,704\\,946\\,113\\,500$.
 
-Find W(1 000 000, 100) modulo the semiprime 1000 036 000 099 (= 1 000 003 · 1 000 033).
+Find $W(1\\,000\\,000, 100)$ modulo the semiprime $1000\\,036\\,000\\,099 (= 1\\,000\\,003 \times 1\\,000\\,033)$.
 
 # --hints--
 
-`euler344()` should return 65579304332.
+`silverDollarGame()` should return `65579304332`.
 
 ```js
-assert.strictEqual(euler344(), 65579304332);
+assert.strictEqual(silverDollarGame(), 65579304332);
 ```
 
 # --seed--
@@ -39,12 +41,12 @@ assert.strictEqual(euler344(), 65579304332);
 ## --seed-contents--
 
 ```js
-function euler344() {
+function silverDollarGame() {
 
   return true;
 }
 
-euler344();
+silverDollarGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md
index 9cb8157d07c..19aa26fd74f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md
@@ -1,27 +1,38 @@
 ---
 id: 5900f4c81000cf542c50ffda
 title: 'Problem 345: Matrix Sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302004
 dashedName: problem-345-matrix-sum
 ---
 
 # --description--
 
-We define the Matrix Sum of a matrix as the maximum sum of matrix elements with each element being the only one in his row and column. For example, the Matrix Sum of the matrix below equals 3315 ( = 863 + 383 + 343 + 959 + 767):
+We define the Matrix Sum of a matrix as the maximum sum of matrix elements with each element being the only one in his row and column.
 
-7 53 183 439 863 497 383 563 79 973 287 63 343 169 583 627 343 773 959 943767 473 103 699 303
+For example, the Matrix Sum of the matrix below equals $3315 ( = 863 + 383 + 343 + 959 + 767)$:
+
+$$\begin{array}{rrrrr}     7                &  53                & 183                & 439                & \color{lime}{863} \\\\
+  497                & \color{lime}{383} & 563                &  79                & 973 \\\\   287                &  63                & \color{lime}{343} & 169                & 583 \\\\
+  627                & 343                & 773                & \color{lime}{959} & 943 \\\\ \color{lime}{767} & 473                & 103                & 699                & 303 \end{array}$$
 
 Find the Matrix Sum of:
 
-7 53 183 439 863 497 383 563 79 973 287 63 343 169 583 627 343 773 959 943 767 473 103 699 303 957 703 583 639 913 447 283 463 29 23 487 463 993 119 883 327 493 423 159 743 217 623 3 399 853 407 103 983 89 463 290 516 212 462 350 960 376 682 962 300 780 486 502 912 800 250 346 172 812 350 870 456 192 162 593 473 915 45 989 873 823 965 425 329 803 973 965 905 919 133 673 665 235 509 613 673 815 165 992 326 322 148 972 962 286 255 941 541 265 323 925 281 601 95 973 445 721 11 525 473 65 511 164 138 672 18 428 154 448 848 414 456 310 312 798 104 566 520 302 248 694 976 430 392 198 184 829 373 181 631 101 969 613 840 740 778 458 284 760 390 821 461 843 513 17 901 711 993 293 157 274 94 192 156 574 34 124 4 878 450 476 712 914 838 669 875 299 823 329 699 815 559 813 459 522 788 168 586 966 232 308 833 251 631 107 813 883 451 509 615 77 281 613 459 205 380 274 302 35 805
+$$\\begin{array}{r}     7 &  53 & 183 & 439 & 863 & 497 & 383 & 563 &  79 & 973 & 287 &  63 & 343 & 169 & 583 \\\\
+  627 & 343 & 773 & 959 & 943 & 767 & 473 & 103 & 699 & 303 & 957 & 703 & 583 & 639 & 913 \\\\   447 & 283 & 463 &  29 &  23 & 487 & 463 & 993 & 119 & 883 & 327 & 493 & 423 & 159 & 743 \\\\
+  217 & 623 &   3 & 399 & 853 & 407 & 103 & 983 &  89 & 463 & 290 & 516 & 212 & 462 & 350 \\\\   960 & 376 & 682 & 962 & 300 & 780 & 486 & 502 & 912 & 800 & 250 & 346 & 172 & 812 & 350 \\\\
+  870 & 456 & 192 & 162 & 593 & 473 & 915 &  45 & 989 & 873 & 823 & 965 & 425 & 329 & 803 \\\\   973 & 965 & 905 & 919 & 133 & 673 & 665 & 235 & 509 & 613 & 673 & 815 & 165 & 992 & 326 \\\\
+  322 & 148 & 972 & 962 & 286 & 255 & 941 & 541 & 265 & 323 & 925 & 281 & 601 &  95 & 973 \\\\   445 & 721 &  11 & 525 & 473 &  65 & 511 & 164 & 138 & 672 &  18 & 428 & 154 & 448 & 848 \\\\
+  414 & 456 & 310 & 312 & 798 & 104 & 566 & 520 & 302 & 248 & 694 & 976 & 430 & 392 & 198 \\\\   184 & 829 & 373 & 181 & 631 & 101 & 969 & 613 & 840 & 740 & 778 & 458 & 284 & 760 & 390 \\\\
+  821 & 461 & 843 & 513 &  17 & 901 & 711 & 993 & 293 & 157 & 274 &  94 & 192 & 156 & 574 \\\\    34 & 124 &   4 & 878 & 450 & 476 & 712 & 914 & 838 & 669 & 875 & 299 & 823 & 329 & 699 \\\\
+  815 & 559 & 813 & 459 & 522 & 788 & 168 & 586 & 966 & 232 & 308 & 833 & 251 & 631 & 107 \\\\ 813 & 883 & 451 & 509 & 615 &  77 & 281 & 613 & 459 & 205 & 380 & 274 & 302 &  35 & 805 \end{array}$$
 
 # --hints--
 
-`euler345()` should return 13938.
+`matrixSum()` should return `13938`.
 
 ```js
-assert.strictEqual(euler345(), 13938);
+assert.strictEqual(matrixSum(), 13938);
 ```
 
 # --seed--
@@ -29,12 +40,12 @@ assert.strictEqual(euler345(), 13938);
 ## --seed-contents--
 
 ```js
-function euler345() {
+function matrixSum() {
 
   return true;
 }
 
-euler345();
+matrixSum();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md
index 49a1f6b2c25..98b7cc48b2f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4c71000cf542c50ffd8
 title: 'Problem 346: Strong Repunits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302005
 dashedName: problem-346-strong-repunits
 ---
 
 # --description--
 
-The number 7 is special, because 7 is 111 written in base 2, and 11 written in base 6 (i.e. 710 = 116 = 1112). In other words, 7 is a repunit in at least two bases b > 1.
+The number 7 is special, because 7 is 111 written in base 2, and 11 written in base 6 (i.e. $7_{10} = {11}_6 = {111}_2$). In other words, 7 is a repunit in at least two bases $b > 1$.
 
-We shall call a positive integer with this property a strong repunit. It can be verified that there are 8 strong repunits below 50: {1,7,13,15,21,31,40,43}. Furthermore, the sum of all strong repunits below 1000 equals 15864.
+We shall call a positive integer with this property a strong repunit. It can be verified that there are 8 strong repunits below 50: {1, 7, 13, 15, 21, 31, 40, 43}. Furthermore, the sum of all strong repunits below 1000 equals 15864.
 
-Find the sum of all strong repunits below 1012.
+Find the sum of all strong repunits below ${10}^{12}$.
 
 # --hints--
 
-`euler346()` should return 336108797689259260.
+`strongRepunits()` should return `336108797689259260`.
 
 ```js
-assert.strictEqual(euler346(), 336108797689259260);
+assert.strictEqual(strongRepunits(), 336108797689259260);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler346(), 336108797689259260);
 ## --seed-contents--
 
 ```js
-function euler346() {
+function strongRepunits() {
 
   return true;
 }
 
-euler346();
+strongRepunits();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.md
index 70845508fa3..15174e82655 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.md
@@ -1,31 +1,31 @@
 ---
 id: 5900f4c81000cf542c50ffd9
 title: 'Problem 347: Largest integer divisible by two primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302006
 dashedName: problem-347-largest-integer-divisible-by-two-primes
 ---
 
 # --description--
 
-The largest integer ≤ 100 that is only divisible by both the primes 2 and 3 is 96, as 96=32\*3=25\*3.
+The largest integer $≤ 100$ that is only divisible by both the primes 2 and 3 is 96, as $96 = 32 \times 3 = 2^5 \times 3$.
 
-For two distinct primes p and q let M(p,q,N) be the largest positive integer ≤N only divisible
+For two distinct primes $p$ and $q$ let $M(p, q, N)$ be the largest positive integer $≤ N$ only divisible by both $p$ and $q$ and $M(p, q, N)=0$ if such a positive integer does not exist.
 
-by both p and q and M(p,q,N)=0 if such a positive integer does not exist.
+E.g. $M(2, 3, 100) = 96$.
 
-E.g. M(2,3,100)=96. M(3,5,100)=75 and not 90 because 90 is divisible by 2 ,3 and 5. Also M(2,73,100)=0 because there does not exist a positive integer ≤ 100 that is divisible by both 2 and 73.
+$M(3, 5, 100) = 75$ and not 90 because 90 is divisible by 2, 3 and 5. Also $M(2, 73, 100) = 0$ because there does not exist a positive integer $≤ 100$ that is divisible by both 2 and 73.
 
-Let S(N) be the sum of all distinct M(p,q,N). S(100)=2262.
+Let $S(N)$ be the sum of all distinct $M(p, q, N)$. $S(100)=2262$.
 
-Find S(10 000 000).
+Find $S(10\\,000\\,000)$.
 
 # --hints--
 
-`euler347()` should return 11109800204052.
+`integerDivisibleByTwoPrimes()` should return `11109800204052`.
 
 ```js
-assert.strictEqual(euler347(), 11109800204052);
+assert.strictEqual(integerDivisibleByTwoPrimes(), 11109800204052);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler347(), 11109800204052);
 ## --seed-contents--
 
 ```js
-function euler347() {
+function integerDivisibleByTwoPrimes() {
 
   return true;
 }
 
-euler347();
+integerDivisibleByTwoPrimes();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md
index 2fe6e2bc137..8e69b16ca7a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4c81000cf542c50ffdb
 title: 'Problem 348: Sum of a square and a cube'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302007
 dashedName: problem-348-sum-of-a-square-and-a-cube
 ---
@@ -10,16 +10,22 @@ dashedName: problem-348-sum-of-a-square-and-a-cube
 
 Many numbers can be expressed as the sum of a square and a cube. Some of them in more than one way.
 
-Consider the palindromic numbers that can be expressed as the sum of a square and a cube, both greater than 1, in exactly 4 different ways. For example, 5229225 is a palindromic number and it can be expressed in exactly 4 different ways: 22852 + 203 22232 + 663 18102 + 1253 11972 + 1563
+Consider the palindromic numbers that can be expressed as the sum of a square and a cube, both greater than 1, in exactly 4 different ways.
+
+For example, 5229225 is a palindromic number and it can be expressed in exactly 4 different ways:
+
+$$\begin{align}   & {2285}^2 + {20}^3 \\\\
+  & {2223}^2 + {66}^3 \\\\   & {1810}^2 + {125}^3 \\\\
+  & {1197}^2 + {156}^3 \end{align}$$
 
 Find the sum of the five smallest such palindromic numbers.
 
 # --hints--
 
-`euler348()` should return 1004195061.
+`sumOfSquareAndCube()` should return `1004195061`.
 
 ```js
-assert.strictEqual(euler348(), 1004195061);
+assert.strictEqual(sumOfSquareAndCube(), 1004195061);
 ```
 
 # --seed--
@@ -27,12 +33,12 @@ assert.strictEqual(euler348(), 1004195061);
 ## --seed-contents--
 
 ```js
-function euler348() {
+function sumOfSquareAndCube() {
 
   return true;
 }
 
-euler348();
+sumOfSquareAndCube();
 ```
 
 # --solutions--
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 239ba5a6a18..71fe17860a2 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f4ca1000cf542c50ffdc
 title: 'Problem 349: Langton''s ant'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302008
 dashedName: problem-349-langtons-ant
 ---
@@ -12,18 +12,17 @@ An ant moves on a regular grid of squares that are coloured either black or whit
 
 The ant is always oriented in one of the cardinal directions (left, right, up or down) and moves from square to adjacent square according to the following rules:
 
-\- if it is on a black square, it flips the color of the square to white, rotates 90 degrees counterclockwise and moves forward one square.
+- if it is on a black square, it flips the color of the square to white, rotates 90° counterclockwise and moves forward one square.
+- if it is on a white square, it flips the color of the square to black, rotates 90° clockwise and moves forward one square.
 
-\- if it is on a white square, it flips the color of the square to black, rotates 90 degrees clockwise and moves forward one square.
-
-Starting with a grid that is entirely white, how many squares are black after 10<sup>18</sup> moves of the ant?
+Starting with a grid that is entirely white, how many squares are black after ${10}^{18}$ moves of the ant?
 
 # --hints--
 
-`euler349()` should return 115384615384614940.
+`langtonsAnt()` should return `115384615384614940`.
 
 ```js
-assert.strictEqual(euler349(), 115384615384614940);
+assert.strictEqual(langtonsAnt(), 115384615384614940);
 ```
 
 # --seed--
@@ -31,12 +30,12 @@ assert.strictEqual(euler349(), 115384615384614940);
 ## --seed-contents--
 
 ```js
-function euler349() {
+function langtonsAnt() {
 
   return true;
 }
 
-euler349();
+langtonsAnt();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-35-circular-primes.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-35-circular-primes.md
index d3d74989d65..e02ad55e55a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-35-circular-primes.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-35-circular-primes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f38f1000cf542c50fea2
 title: 'Problem 35: Circular primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302009
 dashedName: problem-35-circular-primes
 ---
@@ -14,7 +14,7 @@ There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73
 
 How many circular primes are there below `n`, whereas 100 ≤ `n` ≤ 1000000?
 
-**Note:**
+**注意:**
 
 Circular primes individual rotation can exceed `n`.
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md
index ebc52998b58..353170dbe13 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f4cb1000cf542c50ffdd
 title: 'Problem 350: Constraining the least greatest and the greatest least'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302010
 dashedName: problem-350-constraining-the-least-greatest-and-the-greatest-least
 ---
 
 # --description--
 
-A list of size n is a sequence of n natural numbers. Examples are (2,4,6), (2,6,4), (10,6,15,6), and (11).
+A list of size $n$ is a sequence of $n$ natural numbers. Examples are (2, 4, 6), (2, 6, 4), (10, 6, 15, 6), and (11).
 
-The greatest common divisor, or gcd, of a list is the largest natural number that divides all entries of the list. Examples: gcd(2,6,4) = 2, gcd(10,6,15,6) = 1 and gcd(11) = 11.
+The greatest common divisor, or $gcd$, of a list is the largest natural number that divides all entries of the list. Examples: $gcd(2, 6, 4) = 2$, $gcd(10, 6, 15, 6) = 1$ and $gcd(11) = 11$.
 
-The least common multiple, or lcm, of a list is the smallest natural number divisible by each entry of the list. Examples: lcm(2,6,4) = 12, lcm(10,6,15,6) = 30 and lcm(11) = 11.
+The least common multiple, or $lcm$, of a list is the smallest natural number divisible by each entry of the list. Examples: $lcm(2, 6, 4) = 12$, $lcm(10, 6, 15, 6) = 30$ and $lcm(11) = 11$.
 
-Let f(G, L, N) be the number of lists of size N with gcd ≥ G and lcm ≤ L. For example:
+Let $f(G, L, N)$ be the number of lists of size $N$ with $gcd ≥ G$ and $lcm ≤ L$. 例如：
 
-f(10, 100, 1) = 91. f(10, 100, 2) = 327. f(10, 100, 3) = 1135. f(10, 100, 1000) mod 1014 = 3286053.
+$$\begin{align}   & f(10, 100, 1) = 91 \\\\
+  & f(10, 100, 2) = 327 \\\\   & f(10, 100, 3) = 1135 \\\\
+  & f(10, 100, 1000)\bmod {101}^4 = 3\\,286\\,053 \end{align}$$
 
-Find f(106, 1012, 1018) mod 1014.
+Find $f({10}^6, {10}^{12}, {10}^{18})\bmod {101}^4$.
 
 # --hints--
 
-`euler350()` should return 84664213.
+`leastGreatestAndGreatestLeast()` should return `84664213`.
 
 ```js
-assert.strictEqual(euler350(), 84664213);
+assert.strictEqual(leastGreatestAndGreatestLeast(), 84664213);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler350(), 84664213);
 ## --seed-contents--
 
 ```js
-function euler350() {
+function leastGreatestAndGreatestLeast() {
 
   return true;
 }
 
-euler350();
+leastGreatestAndGreatestLeast();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md
index 33f0089171f..fa6811e9185 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md
@@ -1,29 +1,31 @@
 ---
 id: 5900f4cb1000cf542c50ffde
 title: 'Problem 351: Hexagonal orchards'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302011
 dashedName: problem-351-hexagonal-orchards
 ---
 
 # --description--
 
-A hexagonal orchard of order n is a triangular lattice made up of points within a regular hexagon with side n. The following is an example of a hexagonal orchard of order 5:
+A hexagonal orchard of order $n$ is a triangular lattice made up of points within a regular hexagon with side $n$. The following is an example of a hexagonal orchard of order 5:
+
+<img class="img-responsive center-block" alt="hexagonal orchard of order 5, with highlighted in green points, which are hidden from the center by a point closer to it" src="https://cdn.freecodecamp.org/curriculum/project-euler/hexagonal-orchards.png" style="background-color: white; padding: 10px;" />
 
 Highlighted in green are the points which are hidden from the center by a point closer to it. It can be seen that for a hexagonal orchard of order 5, 30 points are hidden from the center.
 
-Let H(n) be the number of points hidden from the center in a hexagonal orchard of order n.
+Let $H(n)$ be the number of points hidden from the center in a hexagonal orchard of order $n$.
 
-H(5) = 30. H(10) = 138. H(1 000) = 1177848.
+$H(5) = 30$. $H(10) = 138$. $H(1\\,000)$ = $1\\,177\\,848$.
 
-Find H(100 000 000).
+Find $H(100\\,000\\,000)$.
 
 # --hints--
 
-`euler351()` should return 11762187201804552.
+`hexagonalOrchards()` should return `11762187201804552`.
 
 ```js
-assert.strictEqual(euler351(), 11762187201804552);
+assert.strictEqual(hexagonalOrchards(), 11762187201804552);
 ```
 
 # --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler351(), 11762187201804552);
 ## --seed-contents--
 
 ```js
-function euler351() {
+function hexagonalOrchards() {
 
   return true;
 }
 
-euler351();
+hexagonalOrchards();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-352-blood-tests.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-352-blood-tests.md
index 76af2f075c8..b0de4ec7213 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-352-blood-tests.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-352-blood-tests.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4cd1000cf542c50ffdf
 title: 'Problem 352: Blood tests'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302012
 dashedName: problem-352-blood-tests
 ---
@@ -12,28 +12,42 @@ Each one of the 25 sheep in a flock must be tested for a rare virus, known to af
 
 An accurate and extremely sensitive PCR test exists for blood samples, producing a clear positive / negative result, but it is very time-consuming and expensive.
 
-Because of the high cost, the vet-in-charge suggests that instead of performing 25 separate tests, the following procedure can be used instead: The sheep are split into 5 groups of 5 sheep in each group. For each group, the 5 samples are mixed together and a single test is performed. Then, If the result is negative, all the sheep in that group are deemed to be virus-free. If the result is positive, 5 additional tests will be performed (a separate test for each animal) to determine the affected individual(s).
+Because of the high cost, the vet-in-charge suggests that instead of performing 25 separate tests, the following procedure can be used instead:
 
-Since the probability of infection for any specific animal is only 0.02, the first test (on the pooled samples) for each group will be: Negative (and no more tests needed) with probability 0.985 = 0.9039207968. Positive (5 additional tests needed) with probability 1 - 0.9039207968 = 0.0960792032.
+The sheep are split into 5 groups of 5 sheep in each group. For each group, the 5 samples are mixed together and a single test is performed. Then,
 
-Thus, the expected number of tests for each group is 1 + 0.0960792032 × 5 = 1.480396016. Consequently, all 5 groups can be screened using an average of only 1.480396016 × 5 = 7.40198008 tests, which represents a huge saving of more than 70% !
+- If the result is negative, all the sheep in that group are deemed to be virus-free.
+- If the result is positive, 5 additional tests will be performed (a separate test for each animal) to determine the affected individual(s).
 
-Although the scheme we have just described seems to be very efficient, it can still be improved considerably (always assuming that the test is sufficiently sensitive and that there are no adverse effects caused by mixing different samples). E.g.: We may start by running a test on a mixture of all the 25 samples. It can be verified that in about 60.35% of the cases this test will be negative, thus no more tests will be needed. Further testing will only be required for the remaining 39.65% of the cases. If we know that at least one animal in a group of 5 is infected and the first 4 individual tests come out negative, there is no need to run a test on the fifth animal (we know that it must be infected). We can try a different number of groups / different number of animals in each group, adjusting those numbers at each level so that the total expected number of tests will be minimised.
+Since the probability of infection for any specific animal is only 0.02, the first test (on the pooled samples) for each group will be:
+
+- Negative (and no more tests needed) with probability ${0.98}^5 = 0.9039207968$.
+- Positive (5 additional tests needed) with probability $1 - 0.9039207968 = 0.0960792032$.
+
+Thus, the expected number of tests for each group is $1 + 0.0960792032 × 5 = 1.480396016$.
+
+Consequently, all 5 groups can be screened using an average of only $1.480396016 × 5 = \mathbf{7.40198008}$ tests, which represents a huge saving of more than 70%!
+
+Although the scheme we have just described seems to be very efficient, it can still be improved considerably (always assuming that the test is sufficiently sensitive and no adverse effects are caused by mixing different samples). E.g.:
+
+- We may start by running a test on a mixture of all the 25 samples. It can be verified that in about 60.35% of the cases this test will be negative, thus no more tests will be needed. Further testing will only be required for the remaining 39.65% of the cases.
+- If we know that at least one animal in a group of 5 is infected and the first 4 individual tests come out negative, there is no need to run a test on the fifth animal (we know that it must be infected).
+- We can try a different number of groups / different number of animals in each group, adjusting those numbers at each level so that the total expected number of tests will be minimised.
 
 To simplify the very wide range of possibilities, there is one restriction we place when devising the most cost-efficient testing scheme: whenever we start with a mixed sample, all the sheep contributing to that sample must be fully screened (i.e. a verdict of infected / virus-free must be reached for all of them) before we start examining any other animals.
 
-For the current example, it turns out that the most cost-efficient testing scheme (we'll call it the optimal strategy) requires an average of just 4.155452 tests!
+For the current example, it turns out that the most cost-efficient testing scheme (we'll call it the optimal strategy) requires an average of just <strong>4.155452</strong> tests!
 
-Using the optimal strategy, let T(s,p) represent the average number of tests needed to screen a flock of s sheep for a virus having probability p to be present in any individual. Thus, rounded to six decimal places, T(25, 0.02) = 4.155452 and T(25, 0.10) = 12.702124.
+Using the optimal strategy, let $T(s, p)$ represent the average number of tests needed to screen a flock of $s$ sheep for a virus having probability $p$ to be present in any individual. Thus, rounded to six decimal places, $T(25, 0.02) = 4.155452$ and $T(25, 0.10) = 12.702124$.
 
-Find ΣT(10000, p) for p=0.01, 0.02, 0.03, ... 0.50. Give your answer rounded to six decimal places.
+Find $\sum T(10\\,000, p)$ for $p = 0.01, 0.02, 0.03, \ldots 0.50$. Give your answer rounded to six decimal places.
 
 # --hints--
 
-`euler352()` should return 378563.260589.
+`bloodTests()` should return `378563.260589`.
 
 ```js
-assert.strictEqual(euler352(), 378563.260589);
+assert.strictEqual(bloodTests(), 378563.260589);
 ```
 
 # --seed--
@@ -41,12 +55,12 @@ assert.strictEqual(euler352(), 378563.260589);
 ## --seed-contents--
 
 ```js
-function euler352() {
+function bloodTests() {
 
   return true;
 }
 
-euler352();
+bloodTests();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-353-risky-moon.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-353-risky-moon.md
index 74faf24c26f..37ee59c2312 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-353-risky-moon.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-353-risky-moon.md
@@ -1,35 +1,37 @@
 ---
 id: 5900f4cd1000cf542c50ffe0
-title: 'Problem 353: Risky moon'
-challengeType: 5
+title: '問題 353：危險的月亮'
+challengeType: 1
 forumTopicId: 302013
 dashedName: problem-353-risky-moon
 ---
 
 # --description--
 
-A moon could be described by the sphere C(r) with centre (0,0,0) and radius r.
+A moon could be described by the sphere $C(r)$ with centre (0, 0, 0) and radius $r$.
 
-There are stations on the moon at the points on the surface of C(r) with integer coordinates. The station at (0,0,r) is called North Pole station, the station at (0,0,-r) is called South Pole station.
+There are stations on the moon at the points on the surface of $C(r)$ with integer coordinates. The station at (0, 0, $r$) is called North Pole station, the station at (0, 0, $-r$) is called South Pole station.
 
-All stations are connected with each other via the shortest road on the great arc through the stations. A journey between two stations is risky. If d is the length of the road between two stations, (d/(π r))2 is a measure for the risk of the journey (let us call it the risk of the road). If the journey includes more than two stations, the risk of the journey is the sum of risks of the used roads.
+所有車站都通過車站的大弧上最短的道路相互連接。 兩個站之間的旅程是有風險的。 If $d$ is the length of the road between two stations, $\{\left(\frac{d}{πr}\right)}^2$ is a measure for the risk of the journey (let us call it the risk of the road). 如果旅程包括兩個以上的車站，則旅程的風險是使用過的道路的風險總和。
 
-A direct journey from the North Pole station to the South Pole station has the length πr and risk 1. The journey from the North Pole station to the South Pole station via (0,r,0) has the same length, but a smaller risk: (½πr/(πr))2+(½πr/(πr))2=0.5.
+A direct journey from the North Pole station to the South Pole station has the length $πr$ and risk 1. The journey from the North Pole station to the South Pole station via (0, $r$, 0) has the same length, but a smaller risk:
 
-The minimal risk of a journey from the North Pole station to the South Pole station on C(r) is M(r).
+$${\left(\frac{\frac{1}{2}πr}{πr}\right)}^2+{\left(\frac{\frac{1}{2}πr}{πr}\right)}^2 = 0.5$$
 
-You are given that M(7)=0.1784943998 rounded to 10 digits behind the decimal point.
+The minimal risk of a journey from the North Pole station to the South Pole station on $C(r)$ is $M(r)$.
 
-Find ∑M(2n-1) for 1≤n≤15.
+You are given that $M(7) = 0.178\\,494\\,399\\,8$ rounded to 10 digits behind the decimal point.
+
+Find $\displaystyle\sum_{n = 1}^{15} M(2^n - 1)$.
 
 Give your answer rounded to 10 digits behind the decimal point in the form a.bcdefghijk.
 
 # --hints--
 
-`euler353()` should return 1.2759860331.
+`riskyMoon()` should return `1.2759860331`.
 
 ```js
-assert.strictEqual(euler353(), 1.2759860331);
+assert.strictEqual(riskyMoon(), 1.2759860331);
 ```
 
 # --seed--
@@ -37,12 +39,12 @@ assert.strictEqual(euler353(), 1.2759860331);
 ## --seed-contents--
 
 ```js
-function euler353() {
+function riskyMoon() {
 
   return true;
 }
 
-euler353();
+riskyMoon();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md
index 346a1af4515..f7d023146ca 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4cf1000cf542c50ffe1
 title: 'Problem 354: Distances in a bee''s honeycomb'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302014
 dashedName: problem-354-distances-in-a-bees-honeycomb
 ---
@@ -10,16 +10,20 @@ dashedName: problem-354-distances-in-a-bees-honeycomb
 
 Consider a honey bee's honeycomb where each cell is a perfect regular hexagon with side length 1.
 
-One particular cell is occupied by the queen bee. For a positive real number L, let B(L) count the cells with distance L from the queen bee cell (all distances are measured from centre to centre); you may assume that the honeycomb is large enough to accommodate for any distance we wish to consider. For example, B(√3) = 6, B(√21) = 12 and B(111 111 111) = 54.
+<img class="img-responsive center-block" alt="honeycomb with hexagon sides of length 1" src="https://cdn.freecodecamp.org/curriculum/project-euler/distances-in-a-bees-honeycomb.png" style="background-color: white; padding: 10px;" />
 
-Find the number of L ≤ 5·1011 such that B(L) = 450.
+One particular cell is occupied by the queen bee. For a positive real number $L$, let $B(L)$ count the cells with distance $L$ from the queen bee cell (all distances are measured from centre to centre); you may assume that the honeycomb is large enough to accommodate for any distance we wish to consider.
+
+For example, $B(\sqrt{3}) = 6$, $B(\sqrt{21}) = 12$ and $B(111\\,111\\,111) = 54$.
+
+Find the number of $L ≤ 5 \times {10}^{11}$ such that $B(L) = 450$.
 
 # --hints--
 
-`euler354()` should return 58065134.
+`distancesInHoneycomb()` should return `58065134`.
 
 ```js
-assert.strictEqual(euler354(), 58065134);
+assert.strictEqual(distancesInHoneycomb(), 58065134);
 ```
 
 # --seed--
@@ -27,12 +31,12 @@ assert.strictEqual(euler354(), 58065134);
 ## --seed-contents--
 
 ```js
-function euler354() {
+function distancesInHoneycomb() {
 
   return true;
 }
 
-euler354();
+distancesInHoneycomb();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.md
index a166a1057ac..a7e2179ec87 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4d01000cf542c50ffe2
 title: 'Problem 355: Maximal coprime subset'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302015
 dashedName: problem-355-maximal-coprime-subset
 ---
 
 # --description--
 
-Define Co(n) to be the maximal possible sum of a set of mutually co-prime elements from {1, 2, ..., n}. For example Co(10) is 30 and hits that maximum on the subset {1, 5, 7, 8, 9}.
+Define $Co(n)$ to be the maximal possible sum of a set of mutually co-prime elements from $\\{1, 2, \ldots, n\\}$. For example $Co(10)$ is 30 and hits that maximum on the subset $\\{1, 5, 7, 8, 9\\}$.
 
-You are given that Co(30) = 193 and Co(100) = 1356.
+You are given that $Co(30) = 193$ and $Co(100) = 1356$.
 
-Find Co(200000).
+Find $Co(200\\,000)$.
 
 # --hints--
 
-`euler355()` should return 1726545007.
+`maximalCoprimeSubset()` should return `1726545007`.
 
 ```js
-assert.strictEqual(euler355(), 1726545007);
+assert.strictEqual(maximalCoprimeSubset(), 1726545007);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler355(), 1726545007);
 ## --seed-contents--
 
 ```js
-function euler355() {
+function maximalCoprimeSubset() {
 
   return true;
 }
 
-euler355();
+maximalCoprimeSubset();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
index 9027dcecf96..257beec0aef 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4d01000cf542c50ffe3
-title: 'Problem 356: Largest roots of cubic polynomials'
-challengeType: 5
+title: '問題 356：三次多項式的最大根數'
+challengeType: 1
 forumTopicId: 302016
 dashedName: problem-356-largest-roots-of-cubic-polynomials
 ---
 
 # --description--
 
-Let an be the largest real root of a polynomial g(x) = x3 - 2n·x2 + n.
+Let $a_n$ be the largest real root of a polynomial $g(x) = x^3 - 2^n \times x^2 + n$.
 
-For example, a2 = 3.86619826...
+For example, $a_2 = 3.86619826\ldots$
 
-Find the last eight digits of.
+Find the last eight digits of $\displaystyle\sum_{i = 1}^{30} \lfloor {a_i}^{987654321}\rfloor$.
 
-Note: represents the floor function.
+**Note:** $\lfloor a\rfloor$ represents the floor function.
 
 # --hints--
 
-`euler356()` should return 28010159.
+`rootsOfCubicPolynomials()` should return `28010159`.
 
 ```js
-assert.strictEqual(euler356(), 28010159);
+assert.strictEqual(rootsOfCubicPolynomials(), 28010159);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler356(), 28010159);
 ## --seed-contents--
 
 ```js
-function euler356() {
+function rootsOfCubicPolynomials() {
 
   return true;
 }
 
-euler356();
+rootsOfCubicPolynomials();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-357-prime-generating-integers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-357-prime-generating-integers.md
index 1bb3f094a21..003fc35bdd6 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-357-prime-generating-integers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-357-prime-generating-integers.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4d11000cf542c50ffe4
 title: 'Problem 357: Prime generating integers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302017
 dashedName: problem-357-prime-generating-integers
 ---
 
 # --description--
 
-Consider the divisors of 30: 1,2,3,5,6,10,15,30.
+Consider the divisors of 30: 1, 2, 3, 5, 6, 10, 15, 30.
 
-It can be seen that for every divisor d of 30, d+30/d is prime.
+It can be seen that for every divisor $d$ of 30, $d + \frac{30}{d}$ is prime.
 
-Find the sum of all positive integers n not exceeding 100 000 000such that for every divisor d of n, d+n/d is prime.
+Find the sum of all positive integers $n$ not exceeding $100\\,000\\,000$ such that for every divisor $d$ of $n$, $d + \frac{n}{d}$ is prime.
 
 # --hints--
 
-`euler357()` should return 1739023853137.
+`primeGeneratingIntegers()` should return `1739023853137`.
 
 ```js
-assert.strictEqual(euler357(), 1739023853137);
+assert.strictEqual(primeGeneratingIntegers(), 1739023853137);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler357(), 1739023853137);
 ## --seed-contents--
 
 ```js
-function euler357() {
+function primeGeneratingIntegers() {
 
   return true;
 }
 
-euler357();
+primeGeneratingIntegers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md
index fb08a667a8b..9a7f94d3bff 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md
@@ -1,31 +1,40 @@
 ---
 id: 5900f4d21000cf542c50ffe5
 title: 'Problem 358: Cyclic numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302018
 dashedName: problem-358-cyclic-numbers
 ---
 
 # --description--
 
-A cyclic number with n digits has a very interesting property:
+A cyclic number with $n$ digits has a very interesting property:
 
-When it is multiplied by 1, 2, 3, 4, ... n, all the products have exactly the same digits, in the same order, but rotated in a circular fashion!
+When it is multiplied by 1, 2, 3, 4, ... $n$, all the products have exactly the same digits, in the same order, but rotated in a circular fashion!
 
-The smallest cyclic number is the 6-digit number 142857 : 142857 × 1 = 142857 142857 × 2 = 285714 142857 × 3 = 428571 142857 × 4 = 571428 142857 × 5 = 714285 142857 × 6 = 857142
+The smallest cyclic number is the 6-digit number 142857:
 
-The next cyclic number is 0588235294117647 with 16 digits : 0588235294117647 × 1 = 0588235294117647 0588235294117647 × 2 = 1176470588235294 0588235294117647 × 3 = 1764705882352941 ... 0588235294117647 × 16 = 9411764705882352
+$$\begin{align}   & 142857 × 1 = 142857 \\\\
+  & 142857 × 2 = 285714 \\\\   & 142857 × 3 = 428571 \\\\
+  & 142857 × 4 = 571428 \\\\   & 142857 × 5 = 714285 \\\\
+  & 142857 × 6 = 857142 \end{align}$$
+
+The next cyclic number is 0588235294117647 with 16 digits:
+
+$$\begin{align}   & 0588235294117647 × 1 = 0588235294117647 \\\\
+  & 0588235294117647 × 2 = 1176470588235294 \\\\   & 0588235294117647 × 3 = 1764705882352941 \\\\
+  & \ldots \\\\ & 0588235294117647 × 16 = 9411764705882352 \end{align}$$
 
 Note that for cyclic numbers, leading zeros are important.
 
-There is only one cyclic number for which, the eleven leftmost digits are 00000000137 and the five rightmost digits are 56789 (i.e., it has the form 00000000137...56789 with an unknown number of digits in the middle). Find the sum of all its digits.
+There is only one cyclic number for which, the eleven leftmost digits are 00000000137 and the five rightmost digits are 56789 (i.e., it has the form $00000000137\ldots56789$ with an unknown number of digits in the middle). Find the sum of all its digits.
 
 # --hints--
 
-`euler358()` should return 3284144505.
+`cyclicNumbers()` should return `3284144505`.
 
 ```js
-assert.strictEqual(euler358(), 3284144505);
+assert.strictEqual(cyclicNumbers(), 3284144505);
 ```
 
 # --seed--
@@ -33,12 +42,12 @@ assert.strictEqual(euler358(), 3284144505);
 ## --seed-contents--
 
 ```js
-function euler358() {
+function cyclicNumbers() {
 
   return true;
 }
 
-euler358();
+cyclicNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md
index 971ae0f4012..0cfd6a75f09 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4d31000cf542c50ffe6
 title: 'Problem 359: Hilbert''s New Hotel'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302019
 dashedName: problem-359-hilberts-new-hotel
 ---
@@ -10,22 +10,36 @@ dashedName: problem-359-hilberts-new-hotel
 
 An infinite number of people (numbered 1, 2, 3, etc.) are lined up to get a room at Hilbert's newest infinite hotel. The hotel contains an infinite number of floors (numbered 1, 2, 3, etc.), and each floor contains an infinite number of rooms (numbered 1, 2, 3, etc.).
 
-Initially the hotel is empty. Hilbert declares a rule on how the nth person is assigned a room: person n gets the first vacant room in the lowest numbered floor satisfying either of the following: the floor is empty the floor is not empty, and if the latest person taking a room in that floor is person m, then m + n is a perfect square
+Initially the hotel is empty. Hilbert declares a rule on how the $n^{\text{th}}$ person is assigned a room: person $n$ gets the first vacant room in the lowest numbered floor satisfying either of the following:
 
-Person 1 gets room 1 in floor 1 since floor 1 is empty. Person 2 does not get room 2 in floor 1 since 1 + 2 = 3 is not a perfect square. Person 2 instead gets room 1 in floor 2 since floor 2 is empty. Person 3 gets room 2 in floor 1 since 1 + 3 = 4 is a perfect square.
+- the floor is empty
+- the floor is not empty, and if the latest person taking a room in that floor is person $m$, then $m + n$ is a perfect square
+
+Person 1 gets room 1 in floor 1 since floor 1 is empty.
+
+Person 2 does not get room 2 in floor 1 since 1 + 2 = 3 is not a perfect square.
+
+Person 2 instead gets room 1 in floor 2 since floor 2 is empty.
+
+Person 3 gets room 2 in floor 1 since 1 + 3 = 4 is a perfect square.
 
 Eventually, every person in the line gets a room in the hotel.
 
-Define P(f, r) to be n if person n occupies room r in floor f, and 0 if no person occupies the room. Here are a few examples: P(1, 1) = 1 P(1, 2) = 3 P(2, 1) = 2 P(10, 20) = 440 P(25, 75) = 4863 P(99, 100) = 19454
+Define $P(f, r)$ to be $n$ if person $n$ occupies room $r$ in floor $f$, and 0 if no person occupies the room. Here are a few examples:
 
-Find the sum of all P(f, r) for all positive f and r such that f × r = 71328803586048 and give the last 8 digits as your answer.
+$$\begin{align}   & P(1, 1) = 1 \\\\
+  & P(1, 2) = 3 \\\\   & P(2, 1) = 2 \\\\
+  & P(10, 20) = 440 \\\\   & P(25, 75) = 4863 \\\\
+  & P(99, 100) = 19454 \end{align}$$
+
+Find the sum of all $P(f, r)$ for all positive $f$ and $r$ such that $f × r = 71\\,328\\,803\\,586\\,048$ and give the last 8 digits as your answer.
 
 # --hints--
 
-`euler359()` should return 40632119.
+`hilbertsNewHotel()` should return `40632119`.
 
 ```js
-assert.strictEqual(euler359(), 40632119);
+assert.strictEqual(hilbertsNewHotel(), 40632119);
 ```
 
 # --seed--
@@ -33,12 +47,12 @@ assert.strictEqual(euler359(), 40632119);
 ## --seed-contents--
 
 ```js
-function euler359() {
+function hilbertsNewHotel() {
 
   return true;
 }
 
-euler359();
+hilbertsNewHotel();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-36-double-base-palindromes.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-36-double-base-palindromes.md
index 359211b5301..9793d760c20 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-36-double-base-palindromes.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-36-double-base-palindromes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3901000cf542c50fea3
 title: 'Problem 36: Double-base palindromes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302020
 dashedName: problem-36-double-base-palindromes
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-360-scary-sphere.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-360-scary-sphere.md
index f028a5d58be..932a0a9dc4e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-360-scary-sphere.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-360-scary-sphere.md
@@ -1,27 +1,31 @@
 ---
 id: 5900f4d41000cf542c50ffe7
 title: 'Problem 360: Scary Sphere'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302021
 dashedName: problem-360-scary-sphere
 ---
 
 # --description--
 
-Given two points (x1,y1,z1) and (x2,y2,z2) in three dimensional space, the Manhattan distance between those points is defined as |x1-x2|+|y1-y2|+|z1-z2|.
+Given two points ($x_1$, $y_1$, $z_1$) and ($x_2$, $y_2$, $z_2$) in three dimensional space, the Manhattan distance between those points is defined as $|x_1 - x_2| + |y_1 - y_2| + |z_1 - z_2|$.
 
-Let C(r) be a sphere with radius r and center in the origin O(0,0,0). Let I(r) be the set of all points with integer coordinates on the surface of C(r). Let S(r) be the sum of the Manhattan distances of all elements of I(r) to the origin O.
+Let $C(r)$ be a sphere with radius $r$ and center in the origin $O(0, 0, 0)$.
 
-E.g. S(45)=34518.
+Let $I(r)$ be the set of all points with integer coordinates on the surface of $C(r)$.
 
-Find S(1010).
+Let $S(r)$ be the sum of the Manhattan distances of all elements of $I(r)$ to the origin $O$.
+
+E.g. $S(45)=34518$.
+
+Find $S({10}^{10})$.
 
 # --hints--
 
-`euler360()` should return 878825614395267100.
+`scarySphere()` should return `878825614395267100`.
 
 ```js
-assert.strictEqual(euler360(), 878825614395267100);
+assert.strictEqual(scarySphere(), 878825614395267100);
 ```
 
 # --seed--
@@ -29,12 +33,12 @@ assert.strictEqual(euler360(), 878825614395267100);
 ## --seed-contents--
 
 ```js
-function euler360() {
+function scarySphere() {
 
   return true;
 }
 
-euler360();
+scarySphere();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md
index bc131597891..efae1fb220c 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md
@@ -1,37 +1,38 @@
 ---
 id: 5900f4d51000cf542c50ffe8
 title: 'Problem 361: Subsequence of Thue-Morse sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302022
 dashedName: problem-361-subsequence-of-thue-morse-sequence
 ---
 
 # --description--
 
-The Thue-Morse sequence {Tn} is a binary sequence satisfying:
+The Thue-Morse sequence $\\{T_n\\}$ is a binary sequence satisfying:
 
-T0 = 0
+- $T_0 = 0$
+- $T_{2n} = T_n$
+- $T_{2n + 1} = 1 - T_n$
 
-T2n = Tn
+The first several terms of $\\{T_n\\}$ are given as follows: $01101001\color{red}{10010}1101001011001101001\ldots$.
 
-T2n+1 = 1 - Tn
+We define $\\{A_n\\}$ as the sorted sequence of integers such that the binary expression of each element appears as a subsequence in $\\{T_n\\}$. For example, the decimal number 18 is expressed as 10010 in binary. 10010 appears in $\\{T_n\\}$ ($T_8$ to $T_{12}$), so 18 is an element of $\\{A_n\\}$. The decimal number 14 is expressed as 1110 in binary. 1110 never appears in $\\{T_n\\}$, so 14 is not an element of $\\{A_n\\}$.
 
-The first several terms of {Tn} are given as follows: 01101001100101101001011001101001....
+The first several terms of $A_n$ are given as follows:
 
-We define {An} as the sorted sequence of integers such that the binary expression of each element appears as a subsequence in {Tn}. For example, the decimal number 18 is expressed as 10010 in binary. 10010 appears in {Tn} (T8 to T12), so 18 is an element of {An}. The decimal number 14 is expressed as 1110 in binary. 1110 never appears in {Tn}, so 14 is not an element of {An}.
+$$\begin{array}{cr}   n   & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 &  8 &  9 & 10 & 11 & 12 & \ldots \\\\
+  A_n & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 9 & 10 & 11 & 12 & 13 & 18 & \ldots \end{array}$$
 
-The first several terms of An are given as follows: n0123456789101112…An012345691011121318…
+We can also verify that $A_{100} = 3251$ and $A_{1000} = 80\\,852\\,364\\,498$.
 
-We can also verify that A100 = 3251 and A1000 = 80852364498.
-
-Find the last 9 digits of .
+Find the last 9 digits of $\displaystyle\sum_{k = 1}^{18} A_{{10}^k}$.
 
 # --hints--
 
-`euler361()` should return 178476944.
+`subsequenceOfThueMorseSequence()` should return `178476944`.
 
 ```js
-assert.strictEqual(euler361(), 178476944);
+assert.strictEqual(subsequenceOfThueMorseSequence(), 178476944);
 ```
 
 # --seed--
@@ -39,12 +40,12 @@ assert.strictEqual(euler361(), 178476944);
 ## --seed-contents--
 
 ```js
-function euler361() {
+function subsequenceOfThueMorseSequence() {
 
   return true;
 }
 
-euler361();
+subsequenceOfThueMorseSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-362-squarefree-factors.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-362-squarefree-factors.md
index 4d6bc3f4a97..19f6b0f9cdc 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-362-squarefree-factors.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-362-squarefree-factors.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4d61000cf542c50ffe9
 title: 'Problem 362: Squarefree factors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302023
 dashedName: problem-362-squarefree-factors
 ---
@@ -12,24 +12,24 @@ Consider the number 54.
 
 54 can be factored in 7 distinct ways into one or more factors larger than 1:
 
-54, 2×27, 3×18, 6×9, 3×3×6, 2×3×9 and 2×3×3×3.
+$$54, 2 × 27, 3 × 18, 6 × 9, 3 × 3 × 6, 2 × 3 × 9 \text{ and } 2 × 3 × 3 × 3$$
 
-If we require that the factors are all squarefree only two ways remain: 3×3×6 and 2×3×3×3.
+If we require that the factors are all squarefree only two ways remain: $3 × 3 × 6$ and $2 × 3 × 3 × 3$.
 
-Let's call Fsf(n) the number of ways n can be factored into one or more squarefree factors larger than 1, so Fsf(54)=2.
+Let's call $Fsf(n)$ the number of ways $n$ can be factored into one or more squarefree factors larger than 1, so $Fsf(54) = 2$.
 
-Let S(n) be ∑Fsf(k) for k=2 to n.
+Let $S(n)$ be $\sum Fsf(k)$ for $k = 2$ to $n$.
 
-S(100)=193.
+$S(100) = 193$.
 
-Find S(10 000 000 000).
+Find $S(10\\,000\\,000\\,000)$.
 
 # --hints--
 
-`euler362()` should return 457895958010.
+`squarefreeFactors()` should return `457895958010`.
 
 ```js
-assert.strictEqual(euler362(), 457895958010);
+assert.strictEqual(squarefreeFactors(), 457895958010);
 ```
 
 # --seed--
@@ -37,12 +37,12 @@ assert.strictEqual(euler362(), 457895958010);
 ## --seed-contents--
 
 ```js
-function euler362() {
+function squarefreeFactors() {
 
   return true;
 }
 
-euler362();
+squarefreeFactors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md
index 2fde41d1eb0..df13df6a0c5 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md
@@ -1,31 +1,39 @@
 ---
 id: 5900f4d91000cf542c50ffeb
 title: 'Problem 363: Bézier Curves'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302024
 dashedName: problem-363-bzier-curves
 ---
 
 # --description--
 
-A cubic Bézier curve is defined by four points: P0, P1, P2 and P3.
+A cubic Bézier curve is defined by four points: $P_0$, $P_1$, $P_2$ and $P_3$.
 
-The curve is constructed as follows: On the segments P0P1, P1P2 and P2P3 the points Q0,Q1 and Q2 are drawn such that P0Q0 / P0P1 = P1Q1 / P1P2 = P2Q2 / P2P3 = t (t in \[0,1]). On the segments Q0Q1 and Q1Q2 the points R0 and R1 are drawn such that Q0R0 / Q0Q1 = Q1R1 / Q1Q2 = t for the same value of t. On the segment R0R1 the point B is drawn such that R0B / R0R1 = t for the same value of t. The Bézier curve defined by the points P0, P1, P2, P3 is the locus of B as Q0 takes all possible positions on the segment P0P1. (Please note that for all points the value of t is the same.)
+The curve is constructed as follows:
 
-At this (external) web address you will find an applet that allows you to drag the points P0, P1, P2 and P3 to see what the Bézier curve (green curve) defined by those points looks like. You can also drag the point Q0 along the segment P0P1.
+<img class="img-responsive center-block" alt="construction of Bézier curve" src="https://cdn.freecodecamp.org/curriculum/project-euler/bzier-curves.png" style="background-color: white; padding: 10px;" />
 
-From the construction it is clear that the Bézier curve will be tangent to the segments P0P1 in P0 and P2P3 in P3.
+On the segments $P_0P_1$, $P_1P_2$ and $P_2P_3$ the points $Q_0$,$Q_1$ and $Q_2$ are drawn such that $\frac{P_0Q_0}{P_0P_1} = \frac{P_1Q_1}{P_1P_2} = \frac{P_2Q_2}{P_2P_3} = t$, with $t$ in [0,1].
 
-A cubic Bézier curve with P0=(1,0), P1=(1,v), P2=(v,1) and P3=(0,1) is used to approximate a quarter circle. The value v > 0 is chosen such that the area enclosed by the lines OP0, OP3 and the curve is equal to π/4 (the area of the quarter circle).
+On the segments $Q_0Q_1$ and $Q_1Q_2$ the points $R_0$ and $R_1$ are drawn such that $\frac{Q_0R_0}{Q_0Q_1} = \frac{Q_1R_1}{Q_1Q_2} = t$ for the same value of $t$.
 
-By how many percent does the length of the curve differ from the length of the quarter circle? That is, if L is the length of the curve, calculate 100 × L − π/2π/2Give your answer rounded to 10 digits behind the decimal point.
+On the segment $R_0R_1$ the point $B$ is drawn such that $\frac{R_0B}{R_0R_1} = t$ for the same value of $t$.
+
+The Bézier curve defined by the points $P_0$, $P_1$, $P_2$, $P_3$ is the locus of $B$ as $Q_0$ takes all possible positions on the segment $P_0P_1$. (Please note that for all points the value of $t$ is the same.)
+
+From the construction it is clear that the Bézier curve will be tangent to the segments $P_0P_1$ in $P_0$ and $P_2P_3$ in $P_3$.
+
+A cubic Bézier curve with $P_0 = (1, 0)$, $P_1 = (1, v)$, $P_2 = (v, 1)$ and $P_3 = (0, 1)$ is used to approximate a quarter circle. The value $v > 0$ is chosen such that the area enclosed by the lines $OP_0$, $OP_3$ and the curve is equal to $\frac{π}{4}$ (the area of the quarter circle).
+
+By how many percent does the length of the curve differ from the length of the quarter circle? That is, if $L$ is the length of the curve, calculate $100 × \displaystyle\frac{L − \frac{π}{2}}{\frac{π}{2}}$. Give your answer rounded to 10 digits behind the decimal point.
 
 # --hints--
 
-`euler363()` should return 0.0000372091.
+`bezierCurves()` should return `0.0000372091`.
 
 ```js
-assert.strictEqual(euler363(), 0.0000372091);
+assert.strictEqual(bezierCurves(), 0.0000372091);
 ```
 
 # --seed--
@@ -33,12 +41,12 @@ assert.strictEqual(euler363(), 0.0000372091);
 ## --seed-contents--
 
 ```js
-function euler363() {
+function bezierCurves() {
 
   return true;
 }
 
-euler363();
+bezierCurves();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md
index 84637798b87..83f8f7ec5d4 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f4d91000cf542c50ffea
 title: 'Problem 364: Comfortable distance'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302025
 dashedName: problem-364-comfortable-distance
 ---
 
 # --description--
 
-There are N seats in a row. N people come after each other to fill the seats according to the following rules:
+There are $N$ seats in a row. $N$ people come after each other to fill the seats according to the following rules:
 
-If there is any seat whose adjacent seat(s) are not occupied take such a seat.
+1. If there is any seat whose adjacent seat(s) are not occupied take such a seat.
+2. If there is no such seat and there is any seat for which only one adjacent seat is occupied take such a seat.
+3. Otherwise take one of the remaining available seats.
 
-If there is no such seat and there is any seat for which only one adjacent seat is occupied take such a seat.
+Let $T(N)$ be the number of possibilities that $N$ seats are occupied by $N$ people with the given rules. The following figure shows $T(4) = 8$.
 
-Otherwise take one of the remaining available seats.
+<img class="img-responsive center-block" alt="eight ways for N seats to be occupied by N people" src="https://cdn.freecodecamp.org/curriculum/project-euler/comfortable-distance.gif" style="background-color: white; padding: 10px;" />
 
-Let T(N) be the number of possibilities that N seats are occupied by N people with the given rules. The following figure shows T(4)=8.
+We can verify that $T(10) = 61\\,632$ and $T(1\\,000)\bmod 100\\,000\\,007 = 47\\,255\\,094$.
 
-We can verify that T(10) = 61632 and T(1 000) mod 100 000 007 = 47255094. Find T(1 000 000) mod 100 000 007.
+Find $T(1\\,000\\,000)\bmod 100\\,000\\,007$.
 
 # --hints--
 
-`euler364()` should return 44855254.
+`comfortableDistance()` should return `44855254`.
 
 ```js
-assert.strictEqual(euler364(), 44855254);
+assert.strictEqual(comfortableDistance(), 44855254);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler364(), 44855254);
 ## --seed-contents--
 
 ```js
-function euler364() {
+function comfortableDistance() {
 
   return true;
 }
 
-euler364();
+comfortableDistance();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.md
index 1647ff46ea4..46dc7abf5d6 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4da1000cf542c50ffec
 title: 'Problem 365: A huge binomial coefficient'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302026
 dashedName: problem-365-a-huge-binomial-coefficient
 ---
 
 # --description--
 
-The binomial coefficient C(1018,109) is a number with more than 9 billion (9×109) digits.
+The binomial coefficient $\displaystyle\binom{{10}^{18}}{{10}^9}$ is a number with more than 9 billion ($9 × {10}^9$) digits.
 
-Let M(n,k,m) denote the binomial coefficient C(n,k) modulo m.
+Let $M(n, k, m)$ denote the binomial coefficient $\displaystyle\binom{n}{k}$ modulo $m$.
 
-Calculate ∑M(1018,109,p*q*r) for 1000&lt;p&lt;q&lt;r&lt;5000 and p,q,r prime.
+Calculate $\sum M({10}^{18}, {10}^9, p \times q \times r)$ for $1000 &lt; p &lt; q &lt; r &lt; 5000$ and $p$, $q$, $r$ prime.
 
 # --hints--
 
-`euler365()` should return 162619462356610300.
+`hugeBinomialCoefficient()` should return `162619462356610300`.
 
 ```js
-assert.strictEqual(euler365(), 162619462356610300);
+assert.strictEqual(hugeBinomialCoefficient(), 162619462356610300);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler365(), 162619462356610300);
 ## --seed-contents--
 
 ```js
-function euler365() {
+function hugeBinomialCoefficient() {
 
   return true;
 }
 
-euler365();
+hugeBinomialCoefficient();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-366-stone-game-iii.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-366-stone-game-iii.md
index b7f832ebf4b..e4c51cb8c50 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-366-stone-game-iii.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-366-stone-game-iii.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4da1000cf542c50ffed
 title: 'Problem 366: Stone Game III'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302027
 dashedName: problem-366-stone-game-iii
 ---
@@ -10,7 +10,7 @@ dashedName: problem-366-stone-game-iii
 
 Two players, Anton and Bernhard, are playing the following game.
 
-There is one pile of n stones.
+There is one pile of $n$ stones.
 
 The first player may remove any positive number of stones, but not the whole pile.
 
@@ -18,20 +18,34 @@ Thereafter, each player may remove at most twice the number of stones his oppone
 
 The player who removes the last stone wins.
 
-E.g. n=5 If the first player takes anything more than one stone the next player will be able to take all remaining stones. If the first player takes one stone, leaving four, his opponent will take also one stone, leaving three stones. The first player cannot take all three because he may take at most 2x1=2 stones. So let's say he takes also one stone, leaving 2. The second player can take the two remaining stones and wins. So 5 is a losing position for the first player. For some winning positions there is more than one possible move for the first player. E.g. when n=17 the first player can remove one or four stones.
+E.g. $n = 5$
 
-Let M(n) be the maximum number of stones the first player can take from a winning position at his first turn and M(n)=0 for any other position.
+If the first player takes anything more than one stone the next player will be able to take all remaining stones.
 
-∑M(n) for n≤100 is 728.
+If the first player takes one stone, leaving four, his opponent will take also one stone, leaving three stones.
 
-Find ∑M(n) for n≤1018. Give your answer modulo 108.
+The first player cannot take all three because he may take at most $2 \times 1 = 2$ stones. So let's say he also takes one stone, leaving 2.
+
+The second player can take the two remaining stones and wins.
+
+So 5 is a losing position for the first player.
+
+For some winning positions there is more than one possible move for the first player.
+
+E.g. when $n = 17$ the first player can remove one or four stones.
+
+Let $M(n)$ be the maximum number of stones the first player can take from a winning position at his first turn and $M(n) = 0$ for any other position.
+
+$\sum M(n)$ for $n ≤ 100$ is 728.
+
+Find $\sum M(n)$ for $n ≤ {10}^{18}$. Give your answer modulo ${10}^8$.
 
 # --hints--
 
-`euler366()` should return 88351299.
+`stoneGameThree()` should return `88351299`.
 
 ```js
-assert.strictEqual(euler366(), 88351299);
+assert.strictEqual(stoneGameThree(), 88351299);
 ```
 
 # --seed--
@@ -39,12 +53,12 @@ assert.strictEqual(euler366(), 88351299);
 ## --seed-contents--
 
 ```js
-function euler366() {
+function stoneGameThree() {
 
   return true;
 }
 
-euler366();
+stoneGameThree();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-367-bozo-sort.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-367-bozo-sort.md
index 979702592a9..01a24b3c665 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-367-bozo-sort.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-367-bozo-sort.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4db1000cf542c50ffee
 title: 'Problem 367: Bozo sort'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302028
 dashedName: problem-367-bozo-sort
 ---
@@ -10,18 +10,30 @@ dashedName: problem-367-bozo-sort
 
 Bozo sort, not to be confused with the slightly less efficient bogo sort, consists out of checking if the input sequence is sorted and if not swapping randomly two elements. This is repeated until eventually the sequence is sorted.
 
-If we consider all permutations of the first 4 natural numbers as input the expectation value of the number of swaps, averaged over all 4! input sequences is 24.75. The already sorted sequence takes 0 steps.
+If we consider all permutations of the first 4 natural numbers as input the expectation value of the number of swaps, averaged over all $4!$ input sequences is $24.75$.
 
-In this problem we consider the following variant on bozo sort. If the sequence is not in order we pick three elements at random and shuffle these three elements randomly. All 3!=6 permutations of those three elements are equally likely. The already sorted sequence will take 0 steps. If we consider all permutations of the first 4 natural numbers as input the expectation value of the number of shuffles, averaged over all 4! input sequences is 27.5. Consider as input sequences the permutations of the first 11 natural numbers. Averaged over all 11! input sequences, what is the expected number of shuffles this sorting algorithm will perform?
+The already sorted sequence takes 0 steps.
 
-Give your answer rounded to the nearest integer.
+In this problem we consider the following variant on bozo sort.
+
+If the sequence is not in order we pick three elements at random and shuffle these three elements randomly.
+
+All $3! = 6$ permutations of those three elements are equally likely.
+
+The already sorted sequence will take 0 steps.
+
+If we consider all permutations of the first 4 natural numbers as input the expectation value of the number of shuffles, averaged over all $4!$ input sequences is $27.5$.
+
+Consider as input sequences the permutations of the first 11 natural numbers.
+
+Averaged over all $11!$ input sequences, what is the expected number of shuffles this sorting algorithm will perform? Give your answer rounded to the nearest integer.
 
 # --hints--
 
-`euler367()` should return 48271207.
+`bozoSort()` should return `48271207`.
 
 ```js
-assert.strictEqual(euler367(), 48271207);
+assert.strictEqual(bozoSort(), 48271207);
 ```
 
 # --seed--
@@ -29,12 +41,12 @@ assert.strictEqual(euler367(), 48271207);
 ## --seed-contents--
 
 ```js
-function euler367() {
+function bozoSort() {
 
   return true;
 }
 
-euler367();
+bozoSort();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.md
index dc9cf2f919b..afc2e6dc9b8 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.md
@@ -1,18 +1,23 @@
 ---
 id: 5900f4dd1000cf542c50ffef
 title: 'Problem 368: A Kempner-like series'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302029
 dashedName: problem-368-a-kempner-like-series
 ---
 
 # --description--
 
-The harmonic series $1 + \\dfrac{1}{2} + \\dfrac{1}{3} + \\dfrac{1}{4} + ...$ is well known to be divergent.
+The harmonic series $1 + \dfrac{1}{2} + \dfrac{1}{3} + \dfrac{1}{4} + \ldots$ is well known to be divergent.
 
 If we however omit from this series every term where the denominator has a 9 in it, the series remarkably enough converges to approximately 22.9206766193. This modified harmonic series is called the Kempner series.
 
-Let us now consider another modified harmonic series by omitting from the harmonic series every term where the denominator has 3 or more equal consecutive digits. One can verify that out of the first 1200 terms of the harmonic series, only 20 terms will be omitted. These 20 omitted terms are: $$\\dfrac{1}{111}, \\dfrac{1}{222}, \\dfrac{1}{333}, \\dfrac{1}{444}, \\dfrac{1}{555}, \\dfrac{1}{666}, \\dfrac{1}{777}, \\dfrac{1}{888}, \\dfrac{1}{999}, \\dfrac{1}{1000}, \\dfrac{1}{1110}, \\\\ \\dfrac{1}{1111}, \\dfrac{1}{1112}, \\dfrac{1}{1113}, \\dfrac{1}{1114}, \\dfrac{1}{1115}, \\dfrac{1}{1116}, \\dfrac{1}{1117}, \\dfrac{1}{1118}, \\dfrac{1}{1119}$$
+Let us now consider another modified harmonic series by omitting from the harmonic series every term where the denominator has 3 or more equal consecutive digits. One can verify that out of the first 1200 terms of the harmonic series, only 20 terms will be omitted.
+
+These 20 omitted terms are:
+
+$$\dfrac{1}{111}, \dfrac{1}{222}, \dfrac{1}{333}, \dfrac{1}{444}, \dfrac{1}{555}, \dfrac{1}{666}, \dfrac{1}{777}, \dfrac{1}{888}, \dfrac{1}{999}, \dfrac{1}{1000}, \dfrac{1}{1110}, \\\\
+\dfrac{1}{1111}, \dfrac{1}{1112}, \dfrac{1}{1113}, \dfrac{1}{1114}, \dfrac{1}{1115}, \dfrac{1}{1116}, \dfrac{1}{1117}, \dfrac{1}{1118}, \dfrac{1}{1119}$$
 
 This series converges as well.
 
@@ -20,10 +25,10 @@ Find the value the series converges to. Give your answer rounded to 10 digits be
 
 # --hints--
 
-`euler368()` should return 253.6135092068.
+`kempnerLikeSeries()` should return `253.6135092068`.
 
 ```js
-assert.strictEqual(euler368(), 253.6135092068);
+assert.strictEqual(kempnerLikeSeries(), 253.6135092068);
 ```
 
 # --seed--
@@ -31,12 +36,12 @@ assert.strictEqual(euler368(), 253.6135092068);
 ## --seed-contents--
 
 ```js
-function euler368() {
+function kempnerLikeSeries() {
 
   return true;
 }
 
-euler368();
+kempnerLikeSeries();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-369-badugi.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-369-badugi.md
index abdcb4c8102..b297bf965da 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-369-badugi.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-369-badugi.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4de1000cf542c50fff0
 title: 'Problem 369: Badugi'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302030
 dashedName: problem-369-badugi
 ---
@@ -10,16 +10,16 @@ dashedName: problem-369-badugi
 
 In a standard 52 card deck of playing cards, a set of 4 cards is a Badugi if it contains 4 cards with no pairs and no two cards of the same suit.
 
-Let f(n) be the number of ways to choose n cards with a 4 card subset that is a Badugi. For example, there are 2598960 ways to choose five cards from a standard 52 card deck, of which 514800 contain a 4 card subset that is a Badugi, so f(5) = 514800.
+Let $f(n)$ be the number of ways to choose $n$ cards with a 4 card subset that is a Badugi. For example, there are $2\\,598\\,960$ ways to choose five cards from a standard 52 card deck, of which $514\\,800$ contain a 4 card subset that is a Badugi, so $f(5) = 514800$.
 
-Find ∑f(n) for 4 ≤ n ≤ 13.
+Find $\sum f(n)$ for $4 ≤ n ≤ 13$.
 
 # --hints--
 
-`euler369()` should return 862400558448.
+`badugi()` should return `862400558448`.
 
 ```js
-assert.strictEqual(euler369(), 862400558448);
+assert.strictEqual(badugi(), 862400558448);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler369(), 862400558448);
 ## --seed-contents--
 
 ```js
-function euler369() {
+function badugi() {
 
   return true;
 }
 
-euler369();
+badugi();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-37-truncatable-primes.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-37-truncatable-primes.md
index 7cac6e4ddb3..5d4c80d5252 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-37-truncatable-primes.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-37-truncatable-primes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3911000cf542c50fea4
 title: 'Problem 37: Truncatable primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302031
 dashedName: problem-37-truncatable-primes
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-370-geometric-triangles.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-370-geometric-triangles.md
index 469f9151e03..dd37d167a05 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-370-geometric-triangles.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-370-geometric-triangles.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4de1000cf542c50fff1
 title: 'Problem 370: Geometric triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302032
 dashedName: problem-370-geometric-triangles
 ---
 
 # --description--
 
-Let us define a geometric triangle as an integer sided triangle with sides a ≤ b ≤ c so that its sides form a geometric progression, i.e. b2 = a · c .
+Let us define a geometric triangle as an integer sided triangle with sides $a ≤ b ≤ c$ so that its sides form a geometric progression, i.e. $b^2 = a \times c$.
 
-An example of such a geometric triangle is the triangle with sides a = 144, b = 156 and c = 169.
+An example of such a geometric triangle is the triangle with sides $a = 144$, $b = 156$ and $c = 169$.
 
-There are 861805 geometric triangles with perimeter ≤ 106 .
+There are $861\\,805$ geometric triangles with $\text{perimeter} ≤ {10}^6$.
 
-How many geometric triangles exist with perimeter ≤ 2.5·1013 ?
+How many geometric triangles exist with $\text{perimeter} ≤ 2.5 \times {10}^{13}$?
 
 # --hints--
 
-`euler370()` should return 41791929448408.
+`geometricTriangles()` should return `41791929448408`.
 
 ```js
-assert.strictEqual(euler370(), 41791929448408);
+assert.strictEqual(geometricTriangles(), 41791929448408);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler370(), 41791929448408);
 ## --seed-contents--
 
 ```js
-function euler370() {
+function geometricTriangles() {
 
   return true;
 }
 
-euler370();
+geometricTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-371-licence-plates.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-371-licence-plates.md
index 005b5aaf078..dee9928047e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-371-licence-plates.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-371-licence-plates.md
@@ -1,31 +1,31 @@
 ---
 id: 5900f4e01000cf542c50fff2
 title: 'Problem 371: Licence plates'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302033
 dashedName: problem-371-licence-plates
 ---
 
 # --description--
 
-Oregon licence plates consist of three letters followed by a three digit number (each digit can be from \[0..9]).
+Oregon licence plates consist of three letters followed by a three digit number (each digit can be from [0...9]).
 
 While driving to work Seth plays the following game:
 
 Whenever the numbers of two licence plates seen on his trip add to 1000 that's a win.
 
-E.g. MIC-012 and HAN-988 is a win and RYU-500 and SET-500 too. (as long as he sees them in the same trip).
+E.g. `MIC-012` and `HAN-988` is a win and `RYU-500` and `SET-500` too (as long as he sees them in the same trip).
 
 Find the expected number of plates he needs to see for a win. Give your answer rounded to 8 decimal places behind the decimal point.
 
-Note: We assume that each licence plate seen is equally likely to have any three digit number on it.
+**Note:** We assume that each licence plate seen is equally likely to have any three digit number on it.
 
 # --hints--
 
-`euler371()` should return 40.66368097.
+`licensePlates()` should return `40.66368097`.
 
 ```js
-assert.strictEqual(euler371(), 40.66368097);
+assert.strictEqual(licensePlates(), 40.66368097);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler371(), 40.66368097);
 ## --seed-contents--
 
 ```js
-function euler371() {
+function licensePlates() {
 
   return true;
 }
 
-euler371();
+licensePlates();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-372-pencils-of-rays.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-372-pencils-of-rays.md
index 1a04cacb71a..9a8e0ff315d 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-372-pencils-of-rays.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-372-pencils-of-rays.md
@@ -1,23 +1,27 @@
 ---
 id: 5900f4e11000cf542c50fff3
 title: 'Problem 372: Pencils of rays'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302034
 dashedName: problem-372-pencils-of-rays
 ---
 
 # --description--
 
-Let R(M, N) be the number of lattice points (x, y) which satisfy M
+Let $R(M, N)$ be the number of lattice points ($x$, $y$) which satisfy $M \lt x \le N$, $M \lt y \le N$ and $\left\lfloor\frac{y^2}{x^2}\right\rfloor$ is odd.
 
-Note: represents the floor function.
+We can verify that $R(0, 100) = 3\\,019$ and $R(100, 10\\,000) = 29\\,750\\,422$.
+
+Find $R(2 \times {10}^6, {10}^9)$.
+
+**Note:** $\lfloor x\rfloor$ represents the floor function.
 
 # --hints--
 
-`euler372()` should return 301450082318807040.
+`pencilsOfRays()` should return `301450082318807040`.
 
 ```js
-assert.strictEqual(euler372(), 301450082318807040);
+assert.strictEqual(pencilsOfRays(), 301450082318807040);
 ```
 
 # --seed--
@@ -25,12 +29,12 @@ assert.strictEqual(euler372(), 301450082318807040);
 ## --seed-contents--
 
 ```js
-function euler372() {
+function pencilsOfRays() {
 
   return true;
 }
 
-euler372();
+pencilsOfRays();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-373-circumscribed-circles.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-373-circumscribed-circles.md
index 534c32ea251..dbe4e1d47e4 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-373-circumscribed-circles.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-373-circumscribed-circles.md
@@ -1,29 +1,27 @@
 ---
 id: 5900f4e11000cf542c50fff4
 title: 'Problem 373: Circumscribed Circles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302035
 dashedName: problem-373-circumscribed-circles
 ---
 
 # --description--
 
-Every triangle has a circumscribed circle that goes through the three vertices.
+Every triangle has a circumscribed circle that goes through the three vertices. Consider all integer sided triangles for which the radius of the circumscribed circle is integral as well.
 
-Consider all integer sided triangles for which the radius of the circumscribed circle is integral as well.
+Let $S(n)$ be the sum of the radii of the circumscribed circles of all such triangles for which the radius does not exceed $n$.
 
-Let S(n) be the sum of the radii of the circumscribed circles of all such triangles for which the radius does not exceed n.
+$S(100) = 4\\,950$ and $S(1\\,200) = 1\\,653\\,605$.
 
-S(100)=4950 and S(1200)=1653605.
-
-Find S(107).
+Find $S({10}^7)$.
 
 # --hints--
 
-`euler373()` should return 727227472448913.
+`circumscribedCircles()` should return `727227472448913`.
 
 ```js
-assert.strictEqual(euler373(), 727227472448913);
+assert.strictEqual(circumscribedCircles(), 727227472448913);
 ```
 
 # --seed--
@@ -31,12 +29,12 @@ assert.strictEqual(euler373(), 727227472448913);
 ## --seed-contents--
 
 ```js
-function euler373() {
+function circumscribedCircles() {
 
   return true;
 }
 
-euler373();
+circumscribedCircles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.md
index 10fe6218919..e2578270e64 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.md
@@ -1,35 +1,37 @@
 ---
 id: 5900f4e51000cf542c50fff6
 title: 'Problem 374: Maximum Integer Partition Product'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302036
 dashedName: problem-374-maximum-integer-partition-product
 ---
 
 # --description--
 
-An integer partition of a number n is a way of writing n as a sum of positive integers.
+An integer partition of a number $n$ is a way of writing $n$ as a sum of positive integers.
 
-Partitions that differ only in the order of their summands are considered the same. A partition of n into distinct parts is a partition of n in which every part occurs at most once.
+Partitions that differ only in the order of their summands are considered the same. A partition of $n$ into distinct parts is a partition of $n$ in which every part occurs at most once.
 
-The partitions of 5 into distinct parts are: 5, 4+1 and 3+2.
+The partitions of 5 into distinct parts are:
 
-Let f(n) be the maximum product of the parts of any such partition of n into distinct parts and let m(n) be the number of elements of any such partition of n with that product.
+5, 4 + 1 and 3 + 2.
 
-So f(5)=6 and m(5)=2.
+Let $f(n)$ be the maximum product of the parts of any such partition of $n$ into distinct parts and let $m(n)$ be the number of elements of any such partition of $n$ with that product.
 
-For n=10 the partition with the largest product is 10=2+3+5, which gives f(10)=30 and m(10)=3. And their product, f(10)·m(10) = 30·3 = 90
+So $f(5) = 6$ and $m(5) = 2$.
 
-It can be verified that ∑f(n)·m(n) for 1 ≤ n ≤ 100 = 1683550844462.
+For $n = 10$ the partition with the largest product is $10 = 2 + 3 + 5$, which gives $f(10) = 30$ and $m(10) = 3$. And their product, $f(10) \times m(10) = 30 \times 3 = 90$
 
-Find ∑f(n)·m(n) for 1 ≤ n ≤ 1014. Give your answer modulo 982451653, the 50 millionth prime.
+It can be verified that $\sum f(n) \times m(n)$ for $1 ≤ n ≤ 100 = 1\\,683\\,550\\,844\\,462$.
+
+Find $\sum f(n) \times m(n)$ for $1 ≤ n ≤ {10}^{14}$. Give your answer modulo $982\\,451\\,653$, the 50 millionth prime.
 
 # --hints--
 
-`euler374()` should return 334420941.
+`maximumIntegerPartitionProduct()` should return `334420941`.
 
 ```js
-assert.strictEqual(euler374(), 334420941);
+assert.strictEqual(maximumIntegerPartitionProduct(), 334420941);
 ```
 
 # --seed--
@@ -37,12 +39,12 @@ assert.strictEqual(euler374(), 334420941);
 ## --seed-contents--
 
 ```js
-function euler374() {
+function maximumIntegerPartitionProduct() {
 
   return true;
 }
 
-euler374();
+maximumIntegerPartitionProduct();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md
index 684613a2357..aaa3d513f7e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md
@@ -1,37 +1,30 @@
 ---
 id: 5900f4e41000cf542c50fff5
-title: 'Problem 375: Minimum of subsequences'
-challengeType: 5
+title: '問題 375：子序列的最小值'
+challengeType: 1
 forumTopicId: 302037
 dashedName: problem-375-minimum-of-subsequences
 ---
 
 # --description--
 
-Let Sn be an integer sequence produced with the following pseudo-random number generator:
+Let $S_n$ be an integer sequence produced with the following pseudo-random number generator:
 
-S0
+$$\begin{align}         S_0 & = 290\\,797 \\\\
+  S_{n + 1} & = {S_n}^2\bmod 50\\,515\\,093 \end{align}$$
 
-=
+Let $A(i, j)$ be the minimum of the numbers $S_i, S_{i + 1}, \ldots, S_j$ for $i ≤ j$. Let $M(N) = \sum A(i, j)$ for $1 ≤ i ≤ j ≤ N$.
 
-290797
+We can verify that $M(10) = 432\\,256\\,955$ and $M(10\\,000) = 3\\,264\\,567\\,774\\,119$.
 
-Sn+1
-
-=
-
-Sn2 mod 50515093
-
-Let A(i, j) be the minimum of the numbers Si, Si+1, ... , Sj for i ≤ j. Let M(N) = ΣA(i, j) for 1 ≤ i ≤ j ≤ N. We can verify that M(10) = 432256955 and M(10 000) = 3264567774119.
-
-Find M(2 000 000 000).
+Find $M(2\\,000\\,000\\,000)$.
 
 # --hints--
 
-`euler375()` should return 7435327983715286000.
+`minimumOfSubsequences()` should return `7435327983715286000`.
 
 ```js
-assert.strictEqual(euler375(), 7435327983715286000);
+assert.strictEqual(minimumOfSubsequences(), 7435327983715286000);
 ```
 
 # --seed--
@@ -39,12 +32,12 @@ assert.strictEqual(euler375(), 7435327983715286000);
 ## --seed-contents--
 
 ```js
-function euler375() {
+function minimumOfSubsequences() {
 
   return true;
 }
 
-euler375();
+minimumOfSubsequences();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.md
index b76c4d26e8f..344a1e84e90 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4e51000cf542c50fff7
 title: 'Problem 376: Nontransitive sets of dice'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302038
 dashedName: problem-376-nontransitive-sets-of-dice
 ---
@@ -10,28 +10,43 @@ dashedName: problem-376-nontransitive-sets-of-dice
 
 Consider the following set of dice with nonstandard pips:
 
-Die A: 1 4 4 4 4 4 Die B: 2 2 2 5 5 5 Die C: 3 3 3 3 3 6
+$$\begin{array}{}   \text{Die A: } & 1 & 4 & 4 & 4 & 4 & 4 \\\\
+  \text{Die B: } & 2 & 2 & 2 & 5 & 5 & 5 \\\\   \text{Die C: } & 3 & 3 & 3 & 3 & 3 & 6 \\\\
+\end{array}$$
 
 A game is played by two players picking a die in turn and rolling it. The player who rolls the highest value wins.
 
-If the first player picks die A and the second player picks die B we get P(second player wins) = 7/12 > 1/2
+If the first player picks die $A$ and the second player picks die $B$ we get
 
-If the first player picks die B and the second player picks die C we get P(second player wins) = 7/12 > 1/2
+$P(\text{second player wins}) = \frac{7}{12} > \frac{1}{2}$
 
-If the first player picks die C and the second player picks die A we get P(second player wins) = 25/36 > 1/2
+If the first player picks die $B$ and the second player picks die $C$ we get
+
+$P(\text{second player wins}) = \frac{7}{12} > \frac{1}{2}$
+
+If the first player picks die $C$ and the second player picks die $A$ we get
+
+$P(\text{second player wins}) = \frac{25}{36} > \frac{1}{2}$
 
 So whatever die the first player picks, the second player can pick another die and have a larger than 50% chance of winning. A set of dice having this property is called a nontransitive set of dice.
 
-We wish to investigate how many sets of nontransitive dice exist. We will assume the following conditions:There are three six-sided dice with each side having between 1 and N pips, inclusive. Dice with the same set of pips are equal, regardless of which side on the die the pips are located. The same pip value may appear on multiple dice; if both players roll the same value neither player wins. The sets of dice {A,B,C}, {B,C,A} and {C,A,B} are the same set.
+We wish to investigate how many sets of nontransitive dice exist. We will assume the following conditions:
 
-For N = 7 we find there are 9780 such sets. How many are there for N = 30 ?
+- There are three six-sided dice with each side having between 1 and $N$ pips, inclusive.
+- Dice with the same set of pips are equal, regardless of which side on the die the pips are located.
+- The same pip value may appear on multiple dice; if both players roll the same value neither player wins.
+- The sets of dice $\\{A, B, C\\}$, $\\{B, C, A\\}$ and $\\{C, A, B\\}$ are the same set.
+
+For $N = 7$ we find there are 9780 such sets.
+
+How many are there for $N = 30$?
 
 # --hints--
 
-`euler376()` should return 973059630185670.
+`nontransitiveSetsOfDice()` should return `973059630185670`.
 
 ```js
-assert.strictEqual(euler376(), 973059630185670);
+assert.strictEqual(nontransitiveSetsOfDice(), 973059630185670);
 ```
 
 # --seed--
@@ -39,12 +54,12 @@ assert.strictEqual(euler376(), 973059630185670);
 ## --seed-contents--
 
 ```js
-function euler376() {
+function nontransitiveSetsOfDice() {
 
   return true;
 }
 
-euler376();
+nontransitiveSetsOfDice();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.md
index 660508c2348..ff149a27b28 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4e51000cf542c50fff8
 title: 'Problem 377: Sum of digits, experience 13'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302039
 dashedName: problem-377-sum-of-digits-experience-13
 ---
@@ -14,16 +14,16 @@ There are 16 positive integers that do not have a zero in their digits and that
 
 Their sum is 17891.
 
-Let f(n) be the sum of all positive integers that do not have a zero in their digits and have a digital sum equal to n.
+Let $f(n)$ be the sum of all positive integers that do not have a zero in their digits and have a digital sum equal to $n$.
 
-Find $\\displaystyle \\sum\_{i=1}^{17} f(13^i)$. Give the last 9 digits as your answer.
+Find $\displaystyle\sum_{i=1}^{17} f(13^i)$. Give the last 9 digits as your answer.
 
 # --hints--
 
-`euler377()` should return 732385277.
+`experience13()` should return `732385277`.
 
 ```js
-assert.strictEqual(euler377(), 732385277);
+assert.strictEqual(experience13(), 732385277);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler377(), 732385277);
 ## --seed-contents--
 
 ```js
-function euler377() {
+function experience13() {
 
   return true;
 }
 
-euler377();
+experience13();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-378-triangle-triples.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-378-triangle-triples.md
index 22589747fe8..e72ba4316c9 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-378-triangle-triples.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-378-triangle-triples.md
@@ -1,31 +1,27 @@
 ---
 id: 5900f4e61000cf542c50fff9
 title: 'Problem 378: Triangle Triples'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302040
 dashedName: problem-378-triangle-triples
 ---
 
 # --description--
 
-Let T(n) be the nth triangle number, so T(n) =
+Let $T(n)$ be the $n^{\text{th}}$ triangle number, so $T(n) = \frac{n(n + 1)}{2}$.
 
-n (n+1)2
+Let $dT(n)$ be the number of divisors of $T(n)$. E.g.: $T(7) = 28$ and $dT(7) = 6$.
 
-.
+Let $Tr(n)$ be the number of triples ($i$, $j$, $k$) such that $1 ≤ i &lt; j &lt; k ≤ n$ and $dT(i) > dT(j) > dT(k)$. $Tr(20) = 14$, $Tr(100) = 5\\,772$ and $Tr(1000) = 11\\,174\\,776$.
 
-Let dT(n) be the number of divisors of T(n). E.g.: T(7) = 28 and dT(7) = 6.
-
-Let Tr(n) be the number of triples (i, j, k) such that 1 ≤ i &lt; j &lt; k ≤ n and dT(i) > dT(j) > dT(k). Tr(20) = 14, Tr(100) = 5772 and Tr(1000) = 11174776.
-
-Find Tr(60 000 000). Give the last 18 digits of your answer.
+Find $Tr(60\\,000\\,000)$. Give the last 18 digits of your answer.
 
 # --hints--
 
-`euler378()` should return 147534623725724700.
+`triangleTriples()` should return `147534623725724700`.
 
 ```js
-assert.strictEqual(euler378(), 147534623725724700);
+assert.strictEqual(triangleTriples(), 147534623725724700);
 ```
 
 # --seed--
@@ -33,12 +29,12 @@ assert.strictEqual(euler378(), 147534623725724700);
 ## --seed-contents--
 
 ```js
-function euler378() {
+function triangleTriples() {
 
   return true;
 }
 
-euler378();
+triangleTriples();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.md
index 3933d82ea2c..0f2fb896572 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4e81000cf542c50fffa
 title: 'Problem 379: Least common multiple count'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302041
 dashedName: problem-379-least-common-multiple-count
 ---
 
 # --description--
 
-Let f(n) be the number of couples (x,y) with x and y positive integers, x ≤ y and the least common multiple of x and y equal to n.
+Let $f(n)$ be the number of couples ($x$, $y$) with $x$ and $y$ positive integers, $x ≤ y$ and the least common multiple of $x$ and $y$ equal to $n$.
 
-Let g be the summatory function of f, i.e.: g(n) = ∑ f(i) for 1 ≤ i ≤ n.
+Let $g$ be the summatory function of $f$, i.e.: $g(n) = \sum f(i)$ for $1 ≤ i ≤ n$.
 
-You are given that g(106) = 37429395.
+You are given that $g({10}^6) = 37\\,429\\,395$.
 
-Find g(1012).
+Find $g({10}^{12})$.
 
 # --hints--
 
-`euler379()` should return 132314136838185.
+`leastCommonMultipleCount()` should return `132314136838185`.
 
 ```js
-assert.strictEqual(euler379(), 132314136838185);
+assert.strictEqual(leastCommonMultipleCount(), 132314136838185);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler379(), 132314136838185);
 ## --seed-contents--
 
 ```js
-function euler379() {
+function leastCommonMultipleCount() {
 
   return true;
 }
 
-euler379();
+leastCommonMultipleCount();
 ```
 
 # --solutions--
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 1c3f0c56c60..a1190e84f39 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3931000cf542c50fea5
 title: 'Problem 38: Pandigital multiples'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302042
 dashedName: problem-38-pandigital-multiples
 ---
@@ -10,7 +10,9 @@ dashedName: problem-38-pandigital-multiples
 
 Take the number 192 and multiply it by each of 1, 2, and 3:
 
-$$\begin{align} 192 × 1 = 192\\\\ 192 × 2 = 384\\\\ 192 × 3 = 576\\\\ \end{align}$$
+$$\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).
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md
index 8596f52fa78..6755479e936 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md
@@ -1,27 +1,37 @@
 ---
 id: 5900f4e81000cf542c50fffb
 title: 'Problem 380: Amazing Mazes!'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302044
 dashedName: problem-380-amazing-mazes
 ---
 
 # --description--
 
-An m×n maze is an m×n rectangular grid with walls placed between grid cells such that there is exactly one path from the top-left square to any other square. The following are examples of a 9×12 maze and a 15×20 maze:
+An $m×n$ maze is an $m×n$ rectangular grid with walls placed between grid cells such that there is exactly one path from the top-left square to any other square. The following are examples of a 9×12 maze and a 15×20 maze:
 
-Let C(m,n) be the number of distinct m×n mazes. Mazes which can be formed by rotation and reflection from another maze are considered distinct.
+<img class="img-responsive center-block" alt="9x12 maze and 15x20 maze" src="https://cdn.freecodecamp.org/curriculum/project-euler/amazing-mazes.gif" style="background-color: white; padding: 10px;" />
 
-It can be verified that C(1,1) = 1, C(2,2) = 4, C(3,4) = 2415, and C(9,12) = 2.5720e46 (in scientific notation rounded to 5 significant digits). Find C(100,500) and write your answer in scientific notation rounded to 5 significant digits.
+Let $C(m, n)$ be the number of distinct $m×n$ mazes. Mazes which can be formed by rotation and reflection from another maze are considered distinct.
 
-When giving your answer, use a lowercase e to separate mantissa and exponent. E.g. if the answer is 1234567891011 then the answer format would be 1.2346e12.
+It can be verified that $C(1, 1) = 1$, $C(2, 2) = 4$, $C(3, 4) = 2415$, and $C(9, 12) = 2.5720\mathrm{e}\\,46$ (in scientific notation rounded to 5 significant digits).
+
+Find $C(100, 500)$ and write your answer as a string in scientific notation rounded to 5 significant digits.
+
+When giving your answer, use a lowercase e to separate mantissa and exponent. 例如： if the answer is 1234567891011 then the answer format would be the string `1.2346e12`.
 
 # --hints--
 
-`euler380()` should return Infinity.
+`amazingMazes()` should return a string.
 
 ```js
-assert.strictEqual(euler380(), Infinity);
+assert(typeof amazingMazes() === 'string');
+```
+
+`amazingMazes()` should return the string `6.3202e25093`.
+
+```js
+assert.strictEqual(amazingMazes(), '6.3202e25093');
 ```
 
 # --seed--
@@ -29,12 +39,12 @@ assert.strictEqual(euler380(), Infinity);
 ## --seed-contents--
 
 ```js
-function euler380() {
+function amazingMazes() {
 
   return true;
 }
 
-euler380();
+amazingMazes();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-381-prime-k-factorial.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-381-prime-k-factorial.md
index f64768a5c7a..01090dbc3cb 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-381-prime-k-factorial.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-381-prime-k-factorial.md
@@ -1,27 +1,31 @@
 ---
 id: 5900f4ea1000cf542c50fffc
 title: 'Problem 381: (prime-k) factorial'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302045
 dashedName: problem-381-prime-k-factorial
 ---
 
 # --description--
 
-For a prime p let S(p) = (∑(p-k)!) mod(p) for 1 ≤ k ≤ 5.
+For a prime $p$ let $S(p) = (\sum (p - k)!)\bmod (p)$ for $1 ≤ k ≤ 5$.
 
-For example, if p=7, (7-1)! + (7-2)! + (7-3)! + (7-4)! + (7-5)! = 6! + 5! + 4! + 3! + 2! = 720+120+24+6+2 = 872. As 872 mod(7) = 4, S(7) = 4.
+For example, if $p = 7$,
 
-It can be verified that ∑S(p) = 480 for 5 ≤ p &lt; 100.
+$$(7 - 1)! + (7 - 2)! + (7 - 3)! + (7 - 4)! + (7 - 5)! = 6！ + 5！ + 4！ + 3！ + 2！ = 720 + 120 + 24 + 6 + 2 = 872$$
 
-Find ∑S(p) for 5 ≤ p &lt; 108.
+As $872\bmod (7) = 4$, $S(7) = 4$.
+
+It can be verified that $\sum S(p) = 480$ for $5 ≤ p &lt; 100$.
+
+Find $\sum S(p)$ for $5 ≤ p &lt; {10}^8$.
 
 # --hints--
 
-`euler381()` should return 139602943319822.
+`primeKFactorial()` should return `139602943319822`.
 
 ```js
-assert.strictEqual(euler381(), 139602943319822);
+assert.strictEqual(primeKFactorial(), 139602943319822);
 ```
 
 # --seed--
@@ -29,12 +33,12 @@ assert.strictEqual(euler381(), 139602943319822);
 ## --seed-contents--
 
 ```js
-function euler381() {
+function primeKFactorial() {
 
   return true;
 }
 
-euler381();
+primeKFactorial();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-382-generating-polygons.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-382-generating-polygons.md
index ae95128f6bb..605495d8fed 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-382-generating-polygons.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-382-generating-polygons.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4eb1000cf542c50fffd
 title: 'Problem 382: Generating polygons'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302046
 dashedName: problem-382-generating-polygons
 ---
@@ -10,22 +10,39 @@ dashedName: problem-382-generating-polygons
 
 A polygon is a flat shape consisting of straight line segments that are joined to form a closed chain or circuit. A polygon consists of at least three sides and does not self-intersect.
 
-A set S of positive numbers is said to generate a polygon P if: no two sides of P are the same length, the length of every side of P is in S, and S contains no other value.
+A set $S$ of positive numbers is said to generate a polygon $P$ if:
 
-For example: The set {3, 4, 5} generates a polygon with sides 3, 4, and 5 (a triangle). The set {6, 9, 11, 24} generates a polygon with sides 6, 9, 11, and 24 (a quadrilateral). The sets {1, 2, 3} and {2, 3, 4, 9} do not generate any polygon at all.
+- no two sides of $P$ are the same length,
+- the length of every side of $P$ is in $S$, and
+- $S$ contains no other value.
 
-Consider the sequence s, defined as follows:s1 = 1, s2 = 2, s3 = 3 sn = sn-1 + sn-3 for n > 3.
+For example:
 
-Let Un be the set {s1, s2, ..., sn}. For example, U10 = {1, 2, 3, 4, 6, 9, 13, 19, 28, 41}. Let f(n) be the number of subsets of Un which generate at least one polygon. For example, f(5) = 7, f(10) = 501 and f(25) = 18635853.
+The set {3, 4, 5} generates a polygon with sides 3, 4, and 5 (a triangle).
 
-Find the last 9 digits of f(1018).
+The set {6, 9, 11, 24} generates a polygon with sides 6, 9, 11, and 24 (a quadrilateral).
+
+The sets {1, 2, 3} and {2, 3, 4, 9} do not generate any polygon at all.
+
+Consider the sequence $s$, defined as follows:
+
+- $s_1 = 1$, $s_2 = 2$, $s_3 = 3$
+- $s_n = s_{n - 1} + s_{n - 3}$ for $n > 3$.
+
+Let $U_n$ be the set $\\{s_1, s_2, \ldots, s_n\\}$. For example, $U_{10} = \\{1, 2, 3, 4, 6, 9, 13, 19, 28, 41\\}$.
+
+Let $f(n)$ be the number of subsets of $U_n$ which generate at least one polygon.
+
+For example, $f(5) = 7$, $f(10) = 501$ and $f(25) = 18\\,635\\,853$.
+
+Find the last 9 digits of $f({10}^{18})$.
 
 # --hints--
 
-`euler382()` should return 697003956.
+`generatingPolygons()` should return `697003956`.
 
 ```js
-assert.strictEqual(euler382(), 697003956);
+assert.strictEqual(generatingPolygons(), 697003956);
 ```
 
 # --seed--
@@ -33,12 +50,12 @@ assert.strictEqual(euler382(), 697003956);
 ## --seed-contents--
 
 ```js
-function euler382() {
+function generatingPolygons() {
 
   return true;
 }
 
-euler382();
+generatingPolygons();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.md
index f199cb4f946..4a851985199 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f4ed1000cf542c50ffff
 title: 'Problem 383: Divisibility comparison between factorials'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302047
 dashedName: problem-383-divisibility-comparison-between-factorials
 ---
 
 # --description--
 
-Let f5(n) be the largest integer x for which 5x divides n.
+Let $f_5(n)$ be the largest integer $x$ for which $5^x$ divides $n$.
 
-For example, f5(625000) = 7.
+For example, $f_5(625\\,000) = 7$.
 
-Let T5(n) be the number of integers i which satisfy f5((2·i-1)!) &lt; 2·f5(i!) and 1 ≤ i ≤ n. It can be verified that T5(103) = 68 and T5(109) = 2408210.
+Let $T_5(n)$ be the number of integers $i$ which satisfy $f_5((2 \times i - 1)!) &lt; 2 \times f_5(i!)$ and $1 ≤ i ≤ n$.
 
-Find T5(1018).
+It can be verified that $T_5({10}^3) = 68$ and $T_5({10}^9) = 2\\,408\\,210$.
+
+Find $T_5({10}^{18})$.
 
 # --hints--
 
-`euler383()` should return 22173624649806.
+`factorialDivisibilityComparison()` should return `22173624649806`.
 
 ```js
-assert.strictEqual(euler383(), 22173624649806);
+assert.strictEqual(factorialDivisibilityComparison(), 22173624649806);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler383(), 22173624649806);
 ## --seed-contents--
 
 ```js
-function euler383() {
+function factorialDivisibilityComparison() {
 
   return true;
 }
 
-euler383();
+factorialDivisibilityComparison();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md
index c57f0ee2f96..9f11652c82f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md
@@ -1,37 +1,48 @@
 ---
 id: 5900f4ed1000cf542c50fffe
 title: 'Problem 384: Rudin-Shapiro sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302048
 dashedName: problem-384-rudin-shapiro-sequence
 ---
 
 # --description--
 
-Define the sequence a(n) as the number of adjacent pairs of ones in the binary expansion of n (possibly overlapping).
+Define the sequence $a(n)$ as the number of adjacent pairs of ones in the binary expansion of $n$ (possibly overlapping).
 
-E.g.: a(5) = a(1012) = 0, a(6) = a(1102) = 1, a(7) = a(1112) = 2
+E.g.: $a(5) = a({101}_2) = 0$, $a(6) = a({110}_2) = 1$, $a(7) = a({111}_2) = 2$
 
-Define the sequence b(n) = (-1)a(n). This sequence is called the Rudin-Shapiro sequence. Also consider the summatory sequence of b(n): .
+Define the sequence $b(n) = {(-1)}^{a(n)}$. This sequence is called the Rudin-Shapiro sequence.
 
-The first couple of values of these sequences are: n 0 1 2 3 4 5 6 7 a(n) 0 0 0 1 0 0 1 2 b(n) 1 1 1 -1 1 1 -1 1 s(n) 1 2 3 2 3 4 3 4
+Also consider the summatory sequence of $b(n)$: $s(n) = \displaystyle\sum_{i = 0}^{n} b(i)$.
 
-The sequence s(n) has the remarkable property that all elements are positive and every positive integer k occurs exactly k times.
+The first couple of values of these sequences are:
 
-Define g(t,c), with 1 ≤ c ≤ t, as the index in s(n) for which t occurs for the c'th time in s(n). E.g.: g(3,3) = 6, g(4,2) = 7 and g(54321,12345) = 1220847710.
+$$\begin{array}{lr}   n    & 0 & 1 & 2 &  3 & 4 & 5 &  6 & 7 \\\\
+  a(n) & 0 & 0 & 0 &  1 & 0 & 0 &  1 & 2 \\\\   b(n) & 1 & 1 & 1 & -1 & 1 & 1 & -1 & 1 \\\\
+  s(n) & 1 & 2 & 3 &  2 & 3 & 4 &  3 & 4 \end{array}$$
 
-Let F(n) be the fibonacci sequence defined by: F(0)=F(1)=1 and F(n)=F(n-1)+F(n-2) for n>1.
+The sequence $s(n)$ has the remarkable property that all elements are positive and every positive integer $k$ occurs exactly $k$ times.
 
-Define GF(t)=g(F(t),F(t-1)).
+Define $g(t, c)$, with $1 ≤ c ≤ t$, as the index in $s(n)$ for which $t$ occurs for the $c$'th time in $s(n)$.
 
-Find ΣGF(t) for 2≤t≤45.
+E.g.: $g(3, 3) = 6$, $g(4, 2) = 7$ and $g(54321, 12345) = 1\\,220\\,847\\,710$.
+
+Let $F(n)$ be the fibonacci sequence defined by:
+
+$$\begin{align}   & F(0) = F(1) = 1 \text{ and} \\\\
+  & F(n) = F(n - 1) + F(n - 2) \text{ for } n > 1. \end{align}$$
+
+Define $GF(t) = g(F(t), F(t - 1))$.
+
+Find $\sum GF(t)$ for$ 2 ≤ t ≤ 45$.
 
 # --hints--
 
-`euler384()` should return 3354706415856333000.
+`rudinShapiroSequence()` should return `3354706415856333000`.
 
 ```js
-assert.strictEqual(euler384(), 3354706415856333000);
+assert.strictEqual(rudinShapiroSequence(), 3354706415856333000);
 ```
 
 # --seed--
@@ -39,12 +50,12 @@ assert.strictEqual(euler384(), 3354706415856333000);
 ## --seed-contents--
 
 ```js
-function euler384() {
+function rudinShapiroSequence() {
 
   return true;
 }
 
-euler384();
+rudinShapiroSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md
index 3cb1e307632..96df0312f03 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md
@@ -1,36 +1,38 @@
 ---
 id: 5900f4ee1000cf542c510000
 title: 'Problem 385: Ellipses inside triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302049
 dashedName: problem-385-ellipses-inside-triangles
 ---
 
 # --description--
 
-For any triangle T in the plane, it can be shown that there is a unique ellipse with largest area that is completely inside T.
+For any triangle $T$ in the plane, it can be shown that there is a unique ellipse with largest area that is completely inside $T$.
 
-For a given n, consider triangles T such that:
+<img class="img-responsive center-block" alt="ellipse completely insisde of triangle" src="https://cdn.freecodecamp.org/curriculum/project-euler/ellipses-inside-triangles.png" style="background-color: white; padding: 10px;" />
 
--   the vertices of T have integer coordinates with absolute value ≤ n, and
--   the foci1 of the largest-area ellipse inside T are (√13,0) and (-√13,0).
+For a given $n$, consider triangles $T$ such that:
 
-Let A(n) be the sum of the areas of all such triangles.
+-   the vertices of $T$ have integer coordinates with absolute value $≤ n$, and
+-   the foci<sup>1</sup> of the largest-area ellipse inside $T$ are $(\sqrt{13}, 0)$ and $(-\sqrt{13}, 0)$.
 
-For example, if n = 8, there are two such triangles. Their vertices are (-4,-3),(-4,3),(8,0) and (4,3),(4,-3),(-8,0), and the area of each triangle is 36. Thus A(8) = 36 + 36 = 72.
+Let $A(n)$ be the sum of the areas of all such triangles.
 
-It can be verified that A(10) = 252, A(100) = 34632 and A(1000) = 3529008.
+For example, if $n = 8$, there are two such triangles. Their vertices are (-4,-3), (-4,3), (8,0) and (4,3), (4,-3), (-8,0), and the area of each triangle is 36. Thus $A(8) = 36 + 36 = 72$.
 
-Find A(1 000 000 000).
+It can be verified that $A(10) = 252$, $A(100) = 34\\,632$ and $A(1000) = 3\\,529\\,008$.
 
-1The foci (plural of focus) of an ellipse are two points A and B such that for every point P on the boundary of the ellipse, AP + PB is constant.
+Find $A(1\\,000\\,000\\,000)$.
+
+<sup>1</sup>The foci (plural of focus) of an ellipse are two points $A$ and $B$ such that for every point $P$ on the boundary of the ellipse, $AP + PB$ is constant.
 
 # --hints--
 
-`euler385()` should return 3776957309612154000.
+`ellipsesInsideTriangles()` should return `3776957309612154000`.
 
 ```js
-assert.strictEqual(euler385(), 3776957309612154000);
+assert.strictEqual(ellipsesInsideTriangles(), 3776957309612154000);
 ```
 
 # --seed--
@@ -38,12 +40,12 @@ assert.strictEqual(euler385(), 3776957309612154000);
 ## --seed-contents--
 
 ```js
-function euler385() {
+function ellipsesInsideTriangles() {
 
   return true;
 }
 
-euler385();
+ellipsesInsideTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.md
index 36a6ce965c8..de0614e4651 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.md
@@ -1,29 +1,33 @@
 ---
 id: 5900f4ef1000cf542c510001
 title: 'Problem 386: Maximum length of an antichain'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302050
 dashedName: problem-386-maximum-length-of-an-antichain
 ---
 
 # --description--
 
-Let n be an integer and S(n) be the set of factors of n.
+Let $n$ be an integer and $S(n)$ be the set of factors of $n$.
 
-A subset A of S(n) is called an antichain of S(n) if A contains only one element or if none of the elements of A divides any of the other elements of A.
+A subset $A$ of $S(n)$ is called an antichain of $S(n)$ if $A$ contains only one element or if none of the elements of $A$ divides any of the other elements of $A$.
 
-For example: S(30) = {1, 2, 3, 5, 6, 10, 15, 30} {2, 5, 6} is not an antichain of S(30). {2, 3, 5} is an antichain of S(30).
+For example: $S(30) = \\{1, 2, 3, 5, 6, 10, 15, 30\\}$
 
-Let N(n) be the maximum length of an antichain of S(n).
+$\\{2, 5, 6\\}$ is not an antichain of $S(30)$.
 
-Find ΣN(n) for 1 ≤ n ≤ 108
+$\\{2, 3, 5\\}$ is an antichain of $S(30)$.
+
+Let $N(n)$ be the maximum length of an antichain of $S(n)$.
+
+Find $\sum N(n)$ for $1 ≤ n ≤ {10}^8$
 
 # --hints--
 
-`euler386()` should return 528755790.
+`maximumLengthOfAntichain()` should return `528755790`.
 
 ```js
-assert.strictEqual(euler386(), 528755790);
+assert.strictEqual(maximumLengthOfAntichain(), 528755790);
 ```
 
 # --seed--
@@ -31,12 +35,12 @@ assert.strictEqual(euler386(), 528755790);
 ## --seed-contents--
 
 ```js
-function euler386() {
+function maximumLengthOfAntichain() {
 
   return true;
 }
 
-euler386();
+maximumLengthOfAntichain();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md
index aa3caddfe3e..2b2ccbbaa0e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4f11000cf542c510003
 title: 'Problem 387: Harshad Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302051
 dashedName: problem-387-harshad-numbers
 ---
@@ -18,20 +18,24 @@ When we truncate the last digit from 20, we get 2, which is also a Harshad numbe
 
 Let's call a Harshad number that, while recursively truncating the last digit, always results in a Harshad number a right truncatable Harshad number.
 
-Also: 201/3=67 which is prime. Let's call a Harshad number that, when divided by the sum of its digits, results in a prime a strong Harshad number.
+Also:
+
+$\frac{201}{3} = 67$ which is prime.
+
+Let's call a Harshad number that, when divided by the sum of its digits, results in a prime a strong Harshad number.
 
 Now take the number 2011 which is prime. When we truncate the last digit from it we get 201, a strong Harshad number that is also right truncatable. Let's call such primes strong, right truncatable Harshad primes.
 
 You are given that the sum of the strong, right truncatable Harshad primes less than 10000 is 90619.
 
-Find the sum of the strong, right truncatable Harshad primes less than 1014.
+Find the sum of the strong, right truncatable Harshad primes less than ${10}^{14}$.
 
 # --hints--
 
-`euler387()` should return 696067597313468.
+`harshadNumbers()` should return `696067597313468`.
 
 ```js
-assert.strictEqual(euler387(), 696067597313468);
+assert.strictEqual(harshadNumbers(), 696067597313468);
 ```
 
 # --seed--
@@ -39,12 +43,12 @@ assert.strictEqual(euler387(), 696067597313468);
 ## --seed-contents--
 
 ```js
-function euler387() {
+function harshadNumbers() {
 
   return true;
 }
 
-euler387();
+harshadNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md
index ba13e9be3cd..4ff7f140070 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4f11000cf542c510002
 title: 'Problem 388: Distinct Lines'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302052
 dashedName: problem-388-distinct-lines
 ---
 
 # --description--
 
-Consider all lattice points (a,b,c) with 0 ≤ a,b,c ≤ N.
+Consider all lattice points ($a$, $b$, $c$) with $0 ≤ a, b, c ≤ N$.
 
-From the origin O(0,0,0) all lines are drawn to the other lattice points. Let D(N) be the number of distinct such lines.
+From the origin $O(0, 0, 0)$ all lines are drawn to the other lattice points. Let $D(N)$ be the number of distinct such lines.
 
-You are given that D(1 000 000) = 831909254469114121.
+You are given that $D(1\\,000\\,000) = 831\\,909\\,254\\,469\\,114\\,121$.
 
-Find D(1010). Give as your answer the first nine digits followed by the last nine digits.
+Find $D({10}^{10})$. Give as your answer the first nine digits followed by the last nine digits.
 
 # --hints--
 
-`euler388()` should return 831907372805130000.
+`distinctLines()` should return `831907372805130000`.
 
 ```js
-assert.strictEqual(euler388(), 831907372805130000);
+assert.strictEqual(distinctLines(), 831907372805130000);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler388(), 831907372805130000);
 ## --seed-contents--
 
 ```js
-function euler388() {
+function distinctLines() {
 
   return true;
 }
 
-euler388();
+distinctLines();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-389-platonic-dice.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-389-platonic-dice.md
index 0fb6bb2688e..081791ffe3b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-389-platonic-dice.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-389-platonic-dice.md
@@ -1,23 +1,31 @@
 ---
 id: 5900f4f21000cf542c510004
 title: 'Problem 389: Platonic Dice'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302053
 dashedName: problem-389-platonic-dice
 ---
 
 # --description--
 
-An unbiased single 4-sided die is thrown and its value, T, is noted.T unbiased 6-sided dice are thrown and their scores are added together. The sum, C, is noted.C unbiased 8-sided dice are thrown and their scores are added together. The sum, O, is noted.O unbiased 12-sided dice are thrown and their scores are added together. The sum, D, is noted.D unbiased 20-sided dice are thrown and their scores are added together. The sum, I, is noted.
+An unbiased single 4-sided die is thrown and its value, $T$, is noted.
 
-Find the variance of I, and give your answer rounded to 4 decimal places.
+$T$ unbiased 6-sided dice are thrown and their scores are added together. The sum, $C$, is noted.
+
+$C$ unbiased 8-sided dice are thrown and their scores are added together. The sum, $O$, is noted.
+
+$O$ unbiased 12-sided dice are thrown and their scores are added together. The sum, $D$, is noted.
+
+$D$ unbiased 20-sided dice are thrown and their scores are added together. The sum, $I$, is noted.
+
+Find the variance of $I$, and give your answer rounded to 4 decimal places.
 
 # --hints--
 
-`euler389()` should return 2406376.3623.
+`platonicDice()` should return `2406376.3623`.
 
 ```js
-assert.strictEqual(euler389(), 2406376.3623);
+assert.strictEqual(platonicDice(), 2406376.3623);
 ```
 
 # --seed--
@@ -25,12 +33,12 @@ assert.strictEqual(euler389(), 2406376.3623);
 ## --seed-contents--
 
 ```js
-function euler389() {
+function platonicDice() {
 
   return true;
 }
 
-euler389();
+platonicDice();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-39-integer-right-triangles.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-39-integer-right-triangles.md
index d19bb816b7f..f1957262624 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-39-integer-right-triangles.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-39-integer-right-triangles.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3931000cf542c50fea6
 title: 'Problem 39: Integer right triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302054
 dashedName: problem-39-integer-right-triangles
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.md
index e582b23f2d7..fa9e6f08884 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.md
@@ -1,31 +1,29 @@
 ---
 id: 5900f4f21000cf542c510005
 title: 'Problem 390: Triangles with non rational sides and integral area'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302055
 dashedName: problem-390-triangles-with-non-rational-sides-and-integral-area
 ---
 
 # --description--
 
-Consider the triangle with sides √5, √65 and √68.
+Consider the triangle with sides $\sqrt{5}$, $\sqrt{65}$ and $\sqrt{68}$. It can be shown that this triangle has area 9.
 
-It can be shown that this triangle has area 9.
+$S(n)$ is the sum of the areas of all triangles with sides $\sqrt{1 + b^2}$, $\sqrt{1 + c^2}$ and $\sqrt{b^2 + c^2}$ (for positive integers $b$ and $c$) that have an integral area not exceeding $n$.
 
-S(n) is the sum of the areas of all triangles with sides √(1+b2), √(1+c2) and √(b2+c2) (for positive integers b and c ) that have an integral area not exceeding n.
+The example triangle has $b = 2$ and $c = 8$.
 
-The example triangle has b=2 and c=8.
+$S({10}^6) = 18\\,018\\,206$.
 
-S(106)=18018206.
-
-Find S(1010).
+Find $S({10}^{10})$.
 
 # --hints--
 
-`euler390()` should return 2919133642971.
+`nonRationalSidesAndIntegralArea()` should return `2919133642971`.
 
 ```js
-assert.strictEqual(euler390(), 2919133642971);
+assert.strictEqual(nonRationalSidesAndIntegralArea(), 2919133642971);
 ```
 
 # --seed--
@@ -33,12 +31,12 @@ assert.strictEqual(euler390(), 2919133642971);
 ## --seed-contents--
 
 ```js
-function euler390() {
+function nonRationalSidesAndIntegralArea() {
 
   return true;
 }
 
-euler390();
+nonRationalSidesAndIntegralArea();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-391-hopping-game.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-391-hopping-game.md
index 4eda36c0a45..e94e14e527b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-391-hopping-game.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-391-hopping-game.md
@@ -1,35 +1,42 @@
 ---
 id: 5900f4f31000cf542c510006
 title: 'Problem 391: Hopping Game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302056
 dashedName: problem-391-hopping-game
 ---
 
 # --description--
 
-Let sk be the number of 1’s when writing the numbers from 0 to k in binary.
+Let $s_k$ be the number of 1’s when writing the numbers from 0 to $k$ in binary.
 
-For example, writing 0 to 5 in binary, we have 0, 1, 10, 11, 100, 101. There are seven 1’s, so s5 = 7.
+For example, writing 0 to 5 in binary, we have 0, 1, 10, 11, 100, 101. There are seven 1’s, so $s_5 = 7$.
 
-The sequence S = {sk : k ≥ 0} starts {0, 1, 2, 4, 5, 7, 9, 12, ...}.
+The sequence $S = \\{s_k : k ≥ 0\\}$ starts $\\{0, 1, 2, 4, 5, 7, 9, 12, \ldots\\}$.
 
-A game is played by two players. Before the game starts, a number n is chosen. A counter c starts at 0. At each turn, the player chooses a number from 1 to n (inclusive) and increases c by that number. The resulting value of c must be a member of S. If there are no more valid moves, the player loses.
+A game is played by two players. Before the game starts, a number $n$ is chosen. A counter $c$ starts at 0. At each turn, the player chooses a number from 1 to $n$ (inclusive) and increases $c$ by that number. The resulting value of $c$ must be a member of $S$. If there are no more valid moves, the player loses.
 
-For example: Let n = 5. c starts at 0. Player 1 chooses 4, so c becomes 0 + 4 = 4. Player 2 chooses 5, so c becomes 4 + 5 = 9. Player 1 chooses 3, so c becomes 9 + 3 = 12. etc. Note that c must always belong to S, and each player can increase c by at most n.
+For example, with $n = 5$ and starting with $c = 0$:
 
-Let M(n) be the highest number the first player can choose at her first turn to force a win, and M(n) = 0 if there is no such move. For example, M(2) = 2, M(7) = 1 and M(20) = 4.
+- Player 1 chooses 4, so $c$ becomes $0 + 4 = 4$.
+- Player 2 chooses 5, so $c$ becomes $4 + 5 = 9$.
+- Player 1 chooses 3, so $c$ becomes $9 + 3 = 12$.
+- etc.
 
-Given Σ(M(n))3 = 8150 for 1 ≤ n ≤ 20.
+Note that $c$ must always belong to $S$, and each player can increase $c$ by at most $n$.
 
-Find Σ(M(n))3 for 1 ≤ n ≤ 1000.
+Let $M(n)$ be the highest number the first player can choose at her first turn to force a win, and $M(n) = 0$ if there is no such move. For example, $M(2) = 2$, $M(7) = 1$ and $M(20) = 4$.
+
+It can be verified $\sum M{(n)}^3 = 8150$ for $1 ≤ n ≤ 20$.
+
+Find $\sum M{(n)}^3$ for $1 ≤ n ≤ 1000$.
 
 # --hints--
 
-`euler391()` should return 61029882288.
+`hoppingGame()` should return `61029882288`.
 
 ```js
-assert.strictEqual(euler391(), 61029882288);
+assert.strictEqual(hoppingGame(), 61029882288);
 ```
 
 # --seed--
@@ -37,12 +44,12 @@ assert.strictEqual(euler391(), 61029882288);
 ## --seed-contents--
 
 ```js
-function euler391() {
+function hoppingGame() {
 
   return true;
 }
 
-euler391();
+hoppingGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md
index cd4d53f17da..7e40a574c29 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4f41000cf542c510007
 title: 'Problem 392: Enmeshed unit circle'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302057
 dashedName: problem-392-enmeshed-unit-circle
 ---
@@ -12,20 +12,30 @@ A rectilinear grid is an orthogonal grid where the spacing between the gridlines
 
 An example of such grid is logarithmic graph paper.
 
-Consider rectilinear grids in the Cartesian coordinate system with the following properties:The gridlines are parallel to the axes of the Cartesian coordinate system.There are N+2 vertical and N+2 horizontal gridlines. Hence there are (N+1) x (N+1) rectangular cells.The equations of the two outer vertical gridlines are x = -1 and x = 1.The equations of the two outer horizontal gridlines are y = -1 and y = 1.The grid cells are colored red if they overlap with the unit circle, black otherwise.For this problem we would like you to find the positions of the remaining N inner horizontal and N inner vertical gridlines so that the area occupied by the red cells is minimized.
+Consider rectilinear grids in the Cartesian coordinate system with the following properties:
 
-E.g. here is a picture of the solution for N = 10:
+- The gridlines are parallel to the axes of the Cartesian coordinate system.
+- There are $N + 2$ vertical and $N + 2$ horizontal gridlines. Hence there are $(N + 1) \times (N + 1)$ rectangular cells.
+- The equations of the two outer vertical gridlines are $x = -1$ and $x = 1$.
+- The equations of the two outer horizontal gridlines are $y = -1$ and $y = 1$.
+- The grid cells are colored red if they overlap with the unit circle, black otherwise.
 
-The area occupied by the red cells for N = 10 rounded to 10 digits behind the decimal point is 3.3469640797.
+For this problem we would like you to find the positions of the remaining $N$ inner horizontal and $N$ inner vertical gridlines so that the area occupied by the red cells is minimized.
 
-Find the positions for N = 400. Give as your answer the area occupied by the red cells rounded to 10 digits behind the decimal point.
+E.g. here is a picture of the solution for $N = 10$:
+
+<img class="img-responsive center-block" alt="solution for N = 10" src="https://cdn.freecodecamp.org/curriculum/project-euler/enmeshed-unit-circle.png" style="background-color: white; padding: 10px;" />
+
+The area occupied by the red cells for $N = 10$ rounded to 10 digits behind the decimal point is 3.3469640797.
+
+Find the positions for $N = 400$. Give as your answer the area occupied by the red cells rounded to 10 digits behind the decimal point.
 
 # --hints--
 
-`euler392()` should return 3.1486734435.
+`enmeshedUnitCircle()` should return `3.1486734435`.
 
 ```js
-assert.strictEqual(euler392(), 3.1486734435);
+assert.strictEqual(enmeshedUnitCircle(), 3.1486734435);
 ```
 
 # --seed--
@@ -33,12 +43,12 @@ assert.strictEqual(euler392(), 3.1486734435);
 ## --seed-contents--
 
 ```js
-function euler392() {
+function enmeshedUnitCircle() {
 
   return true;
 }
 
-euler392();
+enmeshedUnitCircle();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md
index 21f98ec10cc..28a0b4d745c 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f4f61000cf542c510008
 title: 'Problem 393: Migrating ants'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302058
 dashedName: problem-393-migrating-ants
 ---
 
 # --description--
 
-An n×n grid of squares contains n2 ants, one ant per square.
+An $n × n$ grid of squares contains $n^2$ ants, one ant per square.
 
 All ants decide to move simultaneously to an adjacent square (usually 4 possibilities, except for ants on the edge of the grid or at the corners).
 
-We define f(n) to be the number of ways this can happen without any ants ending on the same square and without any two ants crossing the same edge between two squares.
+We define $f(n)$ to be the number of ways this can happen without any ants ending on the same square and without any two ants crossing the same edge between two squares.
 
-You are given that f(4) = 88. Find f(10).
+You are given that $f(4) = 88$.
+
+Find $f(10)$.
 
 # --hints--
 
-`euler393()` should return 112398351350823100.
+`migratingAnts()` should return `112398351350823100`.
 
 ```js
-assert.strictEqual(euler393(), 112398351350823100);
+assert.strictEqual(migratingAnts(), 112398351350823100);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler393(), 112398351350823100);
 ## --seed-contents--
 
 ```js
-function euler393() {
+function migratingAnts() {
 
   return true;
 }
 
-euler393();
+migratingAnts();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-394-eating-pie.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-394-eating-pie.md
index 26c7bce3a95..2bd5085bab0 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-394-eating-pie.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-394-eating-pie.md
@@ -1,35 +1,36 @@
 ---
 id: 5900f4f71000cf542c510009
-title: 'Problem 394: Eating pie'
-challengeType: 5
+title: '問題 394：吃餡餅'
+challengeType: 1
 forumTopicId: 302059
 dashedName: problem-394-eating-pie
 ---
 
 # --description--
 
-Jeff eats a pie in an unusual way.
+傑夫以一種不同尋常的方式吃餡餅。
 
-The pie is circular. He starts with slicing an initial cut in the pie along a radius.
+餡餅是圓形的。 他首先沿着半徑切割餡餅中的初始切口。
 
-While there is at least a given fraction F of pie left, he performs the following procedure:
+While there is at least a given fraction $F$ of pie left, he performs the following procedure:
 
-\- He makes two slices from the pie centre to any point of what is remaining of the pie border, any point on the remaining pie border equally likely. This will divide the remaining pie into three pieces.
+- He makes two slices from the pie centre to any point of what is remaining of the pie border, any point on the remaining pie border equally likely. This will divide the remaining pie into three pieces.
+- Going counterclockwise from the initial cut, he takes the first two pie pieces and eats them.
 
-\- Going counterclockwise from the initial cut, he takes the first two pie pieces and eats them.
+When less than a fraction $F$ of pie remains, he does not repeat this procedure. Instead, he eats all of the remaining pie.
 
-When less than a fraction F of pie remains, he does not repeat this procedure. Instead, he eats all of the remaining pie.
+<img class="img-responsive center-block" alt="animation of pie slicing procedure" src="https://cdn.freecodecamp.org/curriculum/project-euler/eating-pie.gif" style="background-color: white; padding: 10px;" />
 
-For x ≥ 1, let E(x) be the expected number of times Jeff repeats the procedure above with F = 1/x. It can be verified that E(1) = 1, E(2) ≈ 1.2676536759, and E(7.5) ≈ 2.1215732071.
+For $x ≥ 1$, let $E(x)$ be the expected number of times Jeff repeats the procedure above with $F = \frac{1}{x}$. It can be verified that $E(1) = 1$, $E(2) ≈ 1.2676536759$, and $E(7.5) ≈ 2.1215732071$.
 
-Find E(40) rounded to 10 decimal places behind the decimal point.
+Find $E(40)$ rounded to 10 decimal places behind the decimal point.
 
 # --hints--
 
-`euler394()` should return 3.2370342194.
+`eatingPie()` should return `3.2370342194`.
 
 ```js
-assert.strictEqual(euler394(), 3.2370342194);
+assert.strictEqual(eatingPie(), 3.2370342194);
 ```
 
 # --seed--
@@ -37,12 +38,12 @@ assert.strictEqual(euler394(), 3.2370342194);
 ## --seed-contents--
 
 ```js
-function euler394() {
+function eatingPie() {
 
   return true;
 }
 
-euler394();
+eatingPie();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md
index 80903ac0ef5..cff705c06fb 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4f71000cf542c51000a
 title: 'Problem 395: Pythagorean tree'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302060
 dashedName: problem-395-pythagorean-tree
 ---
@@ -10,20 +10,26 @@ dashedName: problem-395-pythagorean-tree
 
 The Pythagorean tree is a fractal generated by the following procedure:
 
-Start with a unit square. Then, calling one of the sides its base (in the animation, the bottom side is the base): Attach a right triangle to the side opposite the base, with the hypotenuse coinciding with that side and with the sides in a 3-4-5 ratio. Note that the smaller side of the triangle must be on the 'right' side with respect to the base (see animation). Attach a square to each leg of the right triangle, with one of its sides coinciding with that leg. Repeat this procedure for both squares, considering as their bases the sides touching the triangle.
+Start with a unit square. Then, calling one of the sides its base (in the animation, the bottom side is the base):
+
+1. Attach a right triangle to the side opposite the base, with the hypotenuse coinciding with that side and with the sides in a 3-4-5 ratio. Note that the smaller side of the triangle must be on the 'right' side with respect to the base (see animation).
+2. Attach a square to each leg of the right triangle, with one of its sides coinciding with that leg.
+3. Repeat this procedure for both squares, considering as their bases the sides touching the triangle.
 
 The resulting figure, after an infinite number of iterations, is the Pythagorean tree.
 
+<img class="img-responsive center-block" alt="animation showing 8 iterations of the procedure" src="https://cdn.freecodecamp.org/curriculum/project-euler/pythagorean-tree.gif" style="background-color: white; padding: 10px;" />
+
 It can be shown that there exists at least one rectangle, whose sides are parallel to the largest square of the Pythagorean tree, which encloses the Pythagorean tree completely.
 
 Find the smallest area possible for such a bounding rectangle, and give your answer rounded to 10 decimal places.
 
 # --hints--
 
-`euler395()` should return 28.2453753155.
+`pythagoreanTree()` should return `28.2453753155`.
 
 ```js
-assert.strictEqual(euler395(), 28.2453753155);
+assert.strictEqual(pythagoreanTree(), 28.2453753155);
 ```
 
 # --seed--
@@ -31,12 +37,12 @@ assert.strictEqual(euler395(), 28.2453753155);
 ## --seed-contents--
 
 ```js
-function euler395() {
+function pythagoreanTree() {
 
   return true;
 }
 
-euler395();
+pythagoreanTree();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.md
index bb98b389ba5..33d738c128b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.md
@@ -1,37 +1,45 @@
 ---
 id: 5900f4f81000cf542c51000b
 title: 'Problem 396: Weak Goodstein sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302061
 dashedName: problem-396-weak-goodstein-sequence
 ---
 
 # --description--
 
-For any positive integer n, the nth weak Goodstein sequence {g1, g2, g3, ...} is defined as:
+For any positive integer $n$, the $n$th weak Goodstein sequence $\\{g1, g2, g3, \ldots\\}$ is defined as:
 
-g1 = n
+- $g_1 = n$
+- for $k > 1$, $g_k$ is obtained by writing $g_{k - 1}$ in base $k$, interpreting it as a base $k + 1$ number, and subtracting 1.
 
-for k > 1, gk is obtained by writing gk-1 in base k, interpreting it as a base k + 1 number, and subtracting 1.
+The sequence terminates when $g_k$ becomes 0.
 
-The sequence terminates when gk becomes 0.
+For example, the $6$th weak Goodstein sequence is $\\{6, 11, 17, 25, \ldots\\}$:
 
-For example, the 6th weak Goodstein sequence is {6, 11, 17, 25, ...}: g1 = 6. g2 = 11 since 6 = 1102, 1103 = 12, and 12 - 1 = 11. g3 = 17 since 11 = 1023, 1024 = 18, and 18 - 1 = 17. g4 = 25 since 17 = 1014, 1015 = 26, and 26 - 1 = 25.
+- $g_1 = 6$.
+- $g_2 = 11$ since $6 = 110_2$, $110_3 = 12$, and $12 - 1 = 11$.
+- $g_3 = 17$ since $11 = 102_3$, $102_4 = 18$, and $18 - 1 = 17$.
+- $g_4 = 25$ since $17 = 101_4$, $101_5 = 26$, and $26 - 1 = 25$.
 
 and so on.
 
 It can be shown that every weak Goodstein sequence terminates.
 
-Let G(n) be the number of nonzero elements in the nth weak Goodstein sequence. It can be verified that G(2) = 3, G(4) = 21 and G(6) = 381. It can also be verified that ΣG(n) = 2517 for 1 ≤ n &lt; 8.
+Let $G(n)$ be the number of nonzero elements in the $n$th weak Goodstein sequence.
 
-Find the last 9 digits of ΣG(n) for 1 ≤ n &lt; 16.
+It can be verified that $G(2) = 3$, $G(4) = 21$ and $G(6) = 381$.
+
+It can also be verified that $\sum G(n) = 2517$ for $1 ≤ n &lt; 8$.
+
+Find the last 9 digits of $\sum G(n)$ for $1 ≤ n &lt; 16$.
 
 # --hints--
 
-`euler396()` should return 173214653.
+`weakGoodsteinSequence()` should return `173214653`.
 
 ```js
-assert.strictEqual(euler396(), 173214653);
+assert.strictEqual(weakGoodsteinSequence(), 173214653);
 ```
 
 # --seed--
@@ -39,12 +47,12 @@ assert.strictEqual(euler396(), 173214653);
 ## --seed-contents--
 
 ```js
-function euler396() {
+function weakGoodsteinSequence() {
 
   return true;
 }
 
-euler396();
+weakGoodsteinSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.md
index d8d95c2dd3a..2d9fc181db3 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.md
@@ -1,25 +1,27 @@
 ---
 id: 5900f4f91000cf542c51000c
 title: 'Problem 397: Triangle on parabola'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302062
 dashedName: problem-397-triangle-on-parabola
 ---
 
 # --description--
 
-On the parabola y = x2/k, three points A(a, a2/k), B(b, b2/k) and C(c, c2/k) are chosen.
+On the parabola $y = \frac{x^2}{k}$, three points $A(a, \frac{a^2}{k})$, $B(b, \frac{b^2}{k})$ and $C(c, \frac{c^2}{k})$ are chosen.
 
-Let F(K, X) be the number of the integer quadruplets (k, a, b, c) such that at least one angle of the triangle ABC is 45-degree, with 1 ≤ k ≤ K and -X ≤ a &lt; b &lt; c ≤ X.
+Let $F(K, X)$ be the number of the integer quadruplets $(k, a, b, c)$ such that at least one angle of the triangle $ABC$ is 45°, with $1 ≤ k ≤ K$ and $-X ≤ a &lt; b &lt; c ≤ X$.
 
-For example, F(1, 10) = 41 and F(10, 100) = 12492. Find F(106, 109).
+For example, $F(1, 10) = 41$ and $F(10, 100) = 12\\,492$.
+
+Find $F({10}^6, {10}^9)$.
 
 # --hints--
 
-`euler397()` should return 141630459461893730.
+`triangleOnParabola()` should return `141630459461893730`.
 
 ```js
-assert.strictEqual(euler397(), 141630459461893730);
+assert.strictEqual(triangleOnParabola(), 141630459461893730);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler397(), 141630459461893730);
 ## --seed-contents--
 
 ```js
-function euler397() {
+function triangleOnParabola() {
 
   return true;
 }
 
-euler397();
+triangleOnParabola();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-398-cutting-rope.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-398-cutting-rope.md
index 4b145fdfbc2..ade33707928 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-398-cutting-rope.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-398-cutting-rope.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4fa1000cf542c51000d
 title: 'Problem 398: Cutting rope'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302063
 dashedName: problem-398-cutting-rope
 ---
 
 # --description--
 
-Inside a rope of length n, n-1 points are placed with distance 1 from each other and from the endpoints. Among these points, we choose m-1 points at random and cut the rope at these points to create m segments.
+Inside a rope of length $n$, $n - 1$ points are placed with distance 1 from each other and from the endpoints. Among these points, we choose $m - 1$ points at random and cut the rope at these points to create $m$ segments.
 
-Let E(n, m) be the expected length of the second-shortest segment. For example, E(3, 2) = 2 and E(8, 3) = 16/7. Note that if multiple segments have the same shortest length the length of the second-shortest segment is defined as the same as the shortest length.
+Let $E(n, m)$ be the expected length of the second-shortest segment. For example, $E(3, 2) = 2$ and $E(8, 3) = \frac{16}{7}$. Note that if multiple segments have the same shortest length the length of the second-shortest segment is defined as the same as the shortest length.
 
-Find E(107, 100). Give your answer rounded to 5 decimal places behind the decimal point.
+Find $E({10}^7, 100)$. Give your answer rounded to 5 decimal places behind the decimal point.
 
 # --hints--
 
-`euler398()` should return 2010.59096.
+`cuttingRope()` should return `2010.59096`.
 
 ```js
-assert.strictEqual(euler398(), 2010.59096);
+assert.strictEqual(cuttingRope(), 2010.59096);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler398(), 2010.59096);
 ## --seed-contents--
 
 ```js
-function euler398() {
+function cuttingRope() {
 
   return true;
 }
 
-euler398();
+cuttingRope();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.md
index b61d13a3365..1070c161f21 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.md
@@ -1,37 +1,43 @@
 ---
 id: 5900f4fc1000cf542c51000e
-title: 'Problem 399: Squarefree Fibonacci Numbers'
-challengeType: 5
+title: '問題 399：Squarefree 斐波那契數列'
+challengeType: 1
 forumTopicId: 302064
 dashedName: problem-399-squarefree-fibonacci-numbers
 ---
 
 # --description--
 
-The first 15 fibonacci numbers are:
+前 15 個斐波那契數是：
 
-1,1,2,3,5,8,13,21,34,55,89,144,233,377,610.
+$$1,1,2,3,5,8,13,21,34,55,89,144,233,377,610.$$
 
 It can be seen that 8 and 144 are not squarefree: 8 is divisible by 4 and 144 is divisible by 4 and by 9.
 
 So the first 13 squarefree fibonacci numbers are:
 
-1,1,2,3,5,13,21,34,55,89,233,377 and 610.
+$$1,1,2,3,5,13,21,34,55,89,233,377 \text{ and } 610.$$
 
-The 200th squarefree fibonacci number is: 971183874599339129547649988289594072811608739584170445. The last sixteen digits of this number are: 1608739584170445 and in scientific notation this number can be written as 9.7e53.
+The $200$th squarefree fibonacci number is: 971183874599339129547649988289594072811608739584170445. The last sixteen digits of this number are: 1608739584170445 and in scientific notation this number can be written as `9.7e53`.
 
-Find the 100 000 000th squarefree fibonacci number. Give as your answer its last sixteen digits followed by a comma followed by the number in scientific notation (rounded to one digit after the decimal point). For the 200th squarefree number the answer would have been: 1608739584170445,9.7e53
+Find the $100\\,000\\,000$th squarefree fibonacci number. Give as your answer as a string with its last sixteen digits followed by a comma followed by the number in scientific notation (rounded to one digit after the decimal point). For the $200$th squarefree number the answer would have been: `1608739584170445,9.7e53`
 
-Note: For this problem, assume that for every prime p, the first fibonacci number divisible by p is not divisible by p2 (this is part of Wall's conjecture). This has been verified for primes ≤ 3·1015, but has not been proven in general.
+**Note:** For this problem, assume that for every prime $p$, the first fibonacci number divisible by $p$ is not divisible by $p^2$ (this is part of Wall's conjecture). This has been verified for primes $≤ 3 \times {10}^{15}$, but has not been proven in general.
 
-If it happens that the conjecture is false, then the accepted answer to this problem isn't guaranteed to be the 100 000 000th squarefree fibonacci number, rather it represents only a lower bound for that number.
+If it happens that the conjecture is false, then the accepted answer to this problem isn't guaranteed to be the $100\\,000\\,000$th squarefree fibonacci number, rather it represents only a lower bound for that number.
 
 # --hints--
 
-`euler399()` should return 1508395636674243, 6.5e27330467.
+`squarefreeFibonacciNumbers()` should return a string.
 
 ```js
-assert.strictEqual(euler399(), 1508395636674243, 6.5e27330467);
+assert(typeof squarefreeFibonacciNumbers() === 'string');
+```
+
+`squarefreeFibonacciNumbers()` should return the string `1508395636674243,6.5e27330467`.
+
+```js
+assert.strictEqual(squarefreeFibonacciNumbers(), '1508395636674243,6.5e27330467');
 ```
 
 # --seed--
@@ -39,12 +45,12 @@ assert.strictEqual(euler399(), 1508395636674243, 6.5e27330467);
 ## --seed-contents--
 
 ```js
-function euler399() {
+function squarefreeFibonacciNumbers() {
 
   return true;
 }
 
-euler399();
+squarefreeFibonacciNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-4-largest-palindrome-product.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-4-largest-palindrome-product.md
index 34dbf96399d..087e10e1b97 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-4-largest-palindrome-product.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-4-largest-palindrome-product.md
@@ -1,32 +1,32 @@
 ---
 id: 5900f3701000cf542c50fe83
-title: 'Problem 4: Largest palindrome product'
-challengeType: 5
+title: '問題 4：最大的迴文積'
+challengeType: 1
 forumTopicId: 302065
 dashedName: problem-4-largest-palindrome-product
 ---
 
 # --description--
 
-A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.
+迴文數字左右兩種方式讀取相同。 The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.
 
 Find the largest palindrome made from the product of two `n`-digit numbers.
 
 # --hints--
 
-`largestPalindromeProduct(2)` should return a number.
+`largestPalindromeProduct(2)` 應該返回一個數字。
 
 ```js
 assert(typeof largestPalindromeProduct(2) === 'number');
 ```
 
-`largestPalindromeProduct(2)` should return 9009.
+`largestPalindromeProduct(2)` 應返回 9009。
 
 ```js
 assert.strictEqual(largestPalindromeProduct(2), 9009);
 ```
 
-`largestPalindromeProduct(3)` should return 906609.
+`largestPalindromeProduct(3)` 應返回 906609。
 
 ```js
 assert.strictEqual(largestPalindromeProduct(3), 906609);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-40-champernownes-constant.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-40-champernownes-constant.md
index f7f6c8f51fb..c4386bd2d91 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-40-champernownes-constant.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-40-champernownes-constant.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3941000cf542c50fea7
 title: 'Problem 40: Champernowne''s constant'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302066
 dashedName: problem-40-champernownes-constant
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md
index 07e767a5ba6..2b2e220949c 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md
@@ -1,35 +1,37 @@
 ---
 id: 5900f4fe1000cf542c510010
 title: 'Problem 400: Fibonacci tree game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302067
 dashedName: problem-400-fibonacci-tree-game
 ---
 
 # --description--
 
-A Fibonacci tree is a binary tree recursively defined as:T(0) is the empty tree.
+A Fibonacci tree is a binary tree recursively defined as:
 
-T(1) is the binary tree with only one node.
-
-T(k) consists of a root node that has T(k-1) and T(k-2) as children.
+- $T(0)$ is the empty tree.
+- $T(1)$ is the binary tree with only one node.
+- $T(k)$ consists of a root node that has $T(k - 1)$ and $T(k - 2)$ as children.
 
 On such a tree two players play a take-away game. On each turn a player selects a node and removes that node along with the subtree rooted at that node. The player who is forced to take the root node of the entire tree loses.
 
-Here are the winning moves of the first player on the first turn for T(k) from k=1 to k=6.
+Here are the winning moves of the first player on the first turn for $T(k)$ from $k = 1$ to $k = 6$.
 
-Let f(k) be the number of winning moves of the first player (i.e. the moves for which the second player has no winning strategy) on the first turn of the game when this game is played on T(k).
+<img class="img-responsive center-block" alt="winning moves of first player, on the first turn for k = 1 to k = 6" src="https://cdn.freecodecamp.org/curriculum/project-euler/fibonacci-tree-game.png" style="background-color: white; padding: 10px;" />
 
-For example, f(5) = 1 and f(10) = 17.
+Let $f(k)$ be the number of winning moves of the first player (i.e. the moves for which the second player has no winning strategy) on the first turn of the game when this game is played on $T(k)$.
 
-Find f(10000). Give the last 18 digits of your answer.
+For example, $f(5) = 1$ and $f(10) = 17$.
+
+Find $f(10000)$. Give the last 18 digits of your answer.
 
 # --hints--
 
-`euler400()` should return 438505383468410600.
+`fibonacciTreeGame()` should return `438505383468410600`.
 
 ```js
-assert.strictEqual(euler400(), 438505383468410600);
+assert.strictEqual(fibonacciTreeGame(), 438505383468410600);
 ```
 
 # --seed--
@@ -37,12 +39,12 @@ assert.strictEqual(euler400(), 438505383468410600);
 ## --seed-contents--
 
 ```js
-function euler400() {
+function fibonacciTreeGame() {
 
   return true;
 }
 
-euler400();
+fibonacciTreeGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.md
index d1c5ca48cc8..eb0c0459100 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f4fd1000cf542c51000f
 title: 'Problem 401: Sum of squares of divisors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302069
 dashedName: problem-401-sum-of-squares-of-divisors
 ---
 
 # --description--
 
-The divisors of 6 are 1,2,3 and 6.
+The divisors of 6 are 1, 2, 3 and 6.
 
-The sum of the squares of these numbers is 1+4+9+36=50.
+The sum of the squares of these numbers is $1 + 4 + 9 + 36 = 50$.
 
-Let sigma2(n) represent the sum of the squares of the divisors of n. Thus sigma2(6)=50.
+Let $\sigma_2(n)$ represent the sum of the squares of the divisors of $n$. Thus $\sigma_2(6) = 50$.
 
-Let SIGMA2 represent the summatory function of sigma2, that is SIGMA2(n)=∑sigma2(i) for i=1 to n. The first 6 values of SIGMA2 are: 1,6,16,37,63 and 113.
+Let $\Sigma_2$ represent the summatory function of $\sigma_2$, that is $\Sigma_2(n) = \sum \sigma_2(i)$ for $i=1$ to $n$. The first 6 values of $\Sigma_2$ are: 1, 6, 16, 37, 63 and 113.
 
-Find SIGMA2(1015) modulo 109.
+Find $\Sigma_2({10}^{15})$ modulo ${10}^9$.
 
 # --hints--
 
-`euler401()` should return 281632621.
+`sumOfSquaresDivisors()` should return `281632621`.
 
 ```js
-assert.strictEqual(euler401(), 281632621);
+assert.strictEqual(sumOfSquaresDivisors(), 281632621);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler401(), 281632621);
 ## --seed-contents--
 
 ```js
-function euler401() {
+function sumOfSquaresDivisors() {
 
   return true;
 }
 
-euler401();
+sumOfSquaresDivisors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.md
index b4c4a63fe8d..cdda26ea631 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.md
@@ -1,31 +1,34 @@
 ---
 id: 5900f4ff1000cf542c510011
 title: 'Problem 402: Integer-valued polynomials'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302070
 dashedName: problem-402-integer-valued-polynomials
 ---
 
 # --description--
 
-It can be shown that the polynomial n4 + 4n3 + 2n2 + 5n is a multiple of 6 for every integer n. It can also be shown that 6 is the largest integer satisfying this property.
+It can be shown that the polynomial $n^4 + 4n^3 + 2n^2 + 5n$ is a multiple of 6 for every integer $n$. It can also be shown that 6 is the largest integer satisfying this property.
 
-Define M(a, b, c) as the maximum m such that n4 + an3 + bn2 + cn is a multiple of m for all integers n. For example, M(4, 2, 5) = 6.
+Define $M(a, b, c)$ as the maximum $m$ such that $n^4 + an^3 + bn^2 + cn$ is a multiple of $m$ for all integers $n$. For example, $M(4, 2, 5) = 6$.
 
-Also, define S(N) as the sum of M(a, b, c) for all 0 &lt; a, b, c ≤ N.
+Also, define $S(N)$ as the sum of $M(a, b, c)$ for all $0 &lt; a, b, c ≤ N$.
 
-We can verify that S(10) = 1972 and S(10000) = 2024258331114.
+We can verify that $S(10) = 1\\,972$ and $S(10\\,000) = 2\\,024\\,258\\,331\\,114$.
 
-Let Fk be the Fibonacci sequence: F0 = 0, F1 = 1 and Fk = Fk-1 + Fk-2 for k ≥ 2.
+Let $F_k$ be the Fibonacci sequence:
 
-Find the last 9 digits of Σ S(Fk) for 2 ≤ k ≤ 1234567890123.
+- $F_0 = 0$, $F_1 = 1$ and
+- $F_k = F_{k - 1} + F_{k - 2}$ for $k ≥ 2$.
+
+Find the last 9 digits of $\sum S(F_k)$ for $2 ≤ k ≤ 1\\,234\\,567\\,890\\,123$.
 
 # --hints--
 
-`euler402()` should return 356019862.
+`integerValuedPolynomials()` should return `356019862`.
 
 ```js
-assert.strictEqual(euler402(), 356019862);
+assert.strictEqual(integerValuedPolynomials(), 356019862);
 ```
 
 # --seed--
@@ -33,12 +36,12 @@ assert.strictEqual(euler402(), 356019862);
 ## --seed-contents--
 
 ```js
-function euler402() {
+function integerValuedPolynomials() {
 
   return true;
 }
 
-euler402();
+integerValuedPolynomials();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.md
index d854a56f4ac..e3f8bfaae35 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f5001000cf542c510013
 title: 'Problem 403: Lattice points enclosed by parabola and line'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302071
 dashedName: problem-403-lattice-points-enclosed-by-parabola-and-line
 ---
 
 # --description--
 
-For integers a and b, we define D(a, b) as the domain enclosed by the parabola y = x2 and the line y = a·x + b:D(a, b) = { (x, y) | x2 ≤ y ≤ a·x + b }.
+For integers $a$ and $b$, we define $D(a, b)$ as the domain enclosed by the parabola $y = x^2$ and the line $y = ax + b: D(a, b) = \\{ (x, y) | x^2 ≤ y ≤ ax + b \\}$.
 
-L(a, b) is defined as the number of lattice points contained in D(a, b). For example, L(1, 2) = 8 and L(2, -1) = 1.
+$L(a, b)$ is defined as the number of lattice points contained in $D(a, b)$. For example, $L(1, 2) = 8$ and $L(2, -1) = 1$.
 
-We also define S(N) as the sum of L(a, b) for all the pairs (a, b) such that the area of D(a, b) is a rational number and |a|,|b| ≤ N. We can verify that S(5) = 344 and S(100) = 26709528.
+We also define $S(N)$ as the sum of $L(a, b)$ for all the pairs ($a$, $b$) such that the area of $D(a, b)$ is a rational number and $|a|,|b| ≤ N$.
 
-Find S(1012). Give your answer mod 108.
+We can verify that $S(5) = 344$ and $S(100) = 26\\,709\\,528$.
+
+Find $S({10}^{12})$. Give your answer $\bmod {10}^8$.
 
 # --hints--
 
-`euler403()` should return 18224771.
+`latticePoints()` should return `18224771`.
 
 ```js
-assert.strictEqual(euler403(), 18224771);
+assert.strictEqual(latticePoints(), 18224771);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler403(), 18224771);
 ## --seed-contents--
 
 ```js
-function euler403() {
+function latticePoints() {
 
   return true;
 }
 
-euler403();
+latticePoints();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md
index 6b7341cea49..68da9b5cb3e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md
@@ -1,29 +1,37 @@
 ---
 id: 5900f5001000cf542c510012
-title: 'Problem 404: Crisscross Ellipses'
-challengeType: 5
+title: '問題 404：交叉橢圓'
+challengeType: 1
 forumTopicId: 302072
 dashedName: problem-404-crisscross-ellipses
 ---
 
 # --description--
 
-Ea is an ellipse with an equation of the form x2 + 4y2 = 4a2.
+$E_a$ is an ellipse with an equation of the form $x^2 + 4y^2 = 4a^2$.
 
-Ea' is the rotated image of Ea by θ degrees counterclockwise around the origin O(0, 0) for 0° &lt; θ &lt; 90°.
+$E_a'$ is the rotated image of $E_a$ by $θ$ degrees counterclockwise around the origin $O(0, 0)$ for $0° &lt; θ &lt; 90°$.
 
-b is the distance to the origin of the two intersection points closest to the origin and c is the distance of the two other intersection points. We call an ordered triplet (a, b, c) a canonical ellipsoidal triplet if a, b and c are positive integers. For example, (209, 247, 286) is a canonical ellipsoidal triplet.
+<img class="img-responsive center-block" alt="ellipse E_a and ellipse rotated by θ degrees E_a'" src="https://cdn.freecodecamp.org/curriculum/project-euler/crisscross-ellipses.gif" style="background-color: white; padding: 10px;" />
 
-Let C(N) be the number of distinct canonical ellipsoidal triplets (a, b, c) for a ≤ N. It can be verified that C(103) = 7, C(104) = 106 and C(106) = 11845.
+$b$ is the distance to the origin of the two intersection points closest to the origin and $c$ is the distance of the two other intersection points.
 
-Find C(1017).
+We call an ordered triplet ($a$, $b$, $c$) a canonical ellipsoidal triplet if $a$, $b$ and $c$ are positive integers.
+
+For example, (209, 247, 286) is a canonical ellipsoidal triplet.
+
+Let $C(N)$ be the number of distinct canonical ellipsoidal triplets ($a$, $b$, $c$) for $a ≤ N$.
+
+It can be verified that $C({10}^3) = 7$, $C({10}^4) = 106$ and $C({10}^6) = 11\\,845$.
+
+Find $C({10}^{17})$.
 
 # --hints--
 
-`euler404()` should return 1199215615081353.
+`crisscrossEllipses()` should return `1199215615081353`.
 
 ```js
-assert.strictEqual(euler404(), 1199215615081353);
+assert.strictEqual(crisscrossEllipses(), 1199215615081353);
 ```
 
 # --seed--
@@ -31,12 +39,12 @@ assert.strictEqual(euler404(), 1199215615081353);
 ## --seed-contents--
 
 ```js
-function euler404() {
+function crisscrossEllipses() {
 
   return true;
 }
 
-euler404();
+crisscrossEllipses();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md
index 87f1f0c28f1..43ceb097a66 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5021000cf542c510014
 title: 'Problem 405: A rectangular tiling'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302073
 dashedName: problem-405-a-rectangular-tiling
 ---
@@ -10,22 +10,26 @@ dashedName: problem-405-a-rectangular-tiling
 
 We wish to tile a rectangle whose length is twice its width.
 
-Let T(0) be the tiling consisting of a single rectangle.
+Let $T(0)$ be the tiling consisting of a single rectangle.
 
-For n > 0, let T(n) be obtained from T(n-1) by replacing all tiles in the following manner:
+For $n > 0$, let $T(n)$ be obtained from $T( n- 1)$ by replacing all tiles in the following manner:
 
-The following animation demonstrates the tilings T(n) for n from 0 to 5:
+<img class="img-responsive center-block" alt="obtaining T(n) from T(n - 1)" src="https://cdn.freecodecamp.org/curriculum/project-euler/a-rectangular-tiling-1.png" style="background-color: white; padding: 10px;" />
 
-Let f(n) be the number of points where four tiles meet in T(n). For example, f(1) = 0, f(4) = 82 and f(109) mod 177 = 126897180.
+The following animation demonstrates the tilings $T(n)$ for $n$ from 0 to 5:
 
-Find f(10k) for k = 1018, give your answer modulo 177.
+<img class="img-responsive center-block" alt="animation with tilings T(n) for n from 0 to 5" src="https://cdn.freecodecamp.org/curriculum/project-euler/a-rectangular-tiling-2.gif" style="background-color: white; padding: 10px;" />
+
+Let $f(n)$ be the number of points where four tiles meet in $T(n)$. For example, $f(1) = 0$, $f(4) = 82$ and $f({10}^9)\bmod {17}^7 = 126\\,897\\,180$.
+
+Find $f({10}^k)$ for $k = {10}^{18}$, give your answer modulo ${17}^7$.
 
 # --hints--
 
-`euler405()` should return 237696125.
+`rectangularTiling()` should return `237696125`.
 
 ```js
-assert.strictEqual(euler405(), 237696125);
+assert.strictEqual(rectangularTiling(), 237696125);
 ```
 
 # --seed--
@@ -33,12 +37,12 @@ assert.strictEqual(euler405(), 237696125);
 ## --seed-contents--
 
 ```js
-function euler405() {
+function rectangularTiling() {
 
   return true;
 }
 
-euler405();
+rectangularTiling();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-406-guessing-game.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-406-guessing-game.md
index fd6535eb66d..6907ad6dae2 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-406-guessing-game.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-406-guessing-game.md
@@ -1,39 +1,51 @@
 ---
 id: 5900f5021000cf542c510015
 title: 'Problem 406: Guessing Game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302074
 dashedName: problem-406-guessing-game
 ---
 
 # --description--
 
-We are trying to find a hidden number selected from the set of integers {1, 2, ..., n} by asking questions.
+We are trying to find a hidden number selected from the set of integers {1, 2, ..., $n$} by asking questions. Each number (question) we ask, we get one of three possible answers:
 
-Each number (question) we ask, we get one of three possible answers: "Your guess is lower than the hidden number" (and you incur a cost of a), or
+- "Your guess is lower than the hidden number" (and you incur a cost of a), or
+- "Your guess is higher than the hidden number" (and you incur a cost of b), or
+- "Yes, that's it!" (and the game ends).
 
-"Your guess is higher than the hidden number" (and you incur a cost of b), or
+Given the value of $n$, $a$, and $b$, an optimal strategy minimizes the total cost <u>for the worst possible case</u>.
 
-"Yes, that's it!" (and the game ends).
+For example, if $n = 5$, $a = 2$, and $b = 3$, then we may begin by asking "<strong>2</strong>" as our first question.
 
-Given the value of n, a, and b, an optimal strategy minimizes the total cost for the worst possible case.
+If we are told that 2 is higher than the hidden number (for a cost of $b = 3$), then we are sure that "<strong>1</strong>" is the hidden number (for a total cost of <strong><span style="color: blue;">3</span></strong>).
 
-For example, if n = 5, a = 2, and b = 3, then we may begin by asking "2" as our first question.
+If we are told that 2 is lower than the hidden number (for a cost of $a = 2$), then our next question will be "<strong>4</strong>".
 
-If we are told that 2 is higher than the hidden number (for a cost of b=3), then we are sure that "1" is the hidden number (for a total cost of 3). If we are told that 2 is lower than the hidden number (for a cost of a=2), then our next question will be "4". If we are told that 4 is higher than the hidden number (for a cost of b=3), then we are sure that "3" is the hidden number (for a total cost of 2+3=5). If we are told that 4 is lower than the hidden number (for a cost of a=2), then we are sure that "5" is the hidden number (for a total cost of 2+2=4). Thus, the worst-case cost achieved by this strategy is 5. It can also be shown that this is the lowest worst-case cost that can be achieved. So, in fact, we have just described an optimal strategy for the given values of n, a, and b.
+If we are told that 4 is higher than the hidden number (for a cost of $b = 3$), then we are sure that "<strong>3</strong>" is the hidden number (for a total cost of $2 + 3 = \color{blue}{\mathbf{5}}$).
 
-Let C(n, a, b) be the worst-case cost achieved by an optimal strategy for the given values of n, a, and b.
+If we are told that 4 is lower than the hidden number (for a cost of $a = 2$), then we are sure that "<strong>5</strong>" is the hidden number (for a total cost of $2 + 2 = \color{blue}{\mathbf{4}}$).
 
-Here are a few examples: C(5, 2, 3) = 5 C(500, √2, √3) = 13.22073197... C(20000, 5, 7) = 82 C(2000000, √5, √7) = 49.63755955...
+Thus, the worst-case cost achieved by this strategy is <strong><span style="color: red">5</span></strong>. It can also be shown that this is the lowest worst-case cost that can be achieved. So, in fact, we have just described an optimal strategy for the given values of $n$, $a$, and $b$.
 
-Let Fk be the Fibonacci numbers: Fk = Fk-1 + Fk-2 with base cases F1 = F2 = 1.Find ∑1≤k≤30 C(1012, √k, √Fk), and give your answer rounded to 8 decimal places behind the decimal point.
+Let $C(n, a, b)$ be the worst-case cost achieved by an optimal strategy for the given values of $n$, $a$, and $b$.
+
+Here are a few examples:
+
+$$\begin{align}   & C(5, 2, 3) = 5 \\\\
+  & C(500, \sqrt{2}, \sqrt{3}) = 13.220\\,731\\,97\ldots \\\\   & C(20\\,000, 5, 7) = 82 \\\\
+  & C(2\\,000\\,000, √5, √7) = 49.637\\,559\\,55\ldots \\\\ \end{align}$$
+
+Let $F_k$ be the Fibonacci numbers: $F_k = F_{k - 1} + F_{k - 2}$ with base cases $F_1 = F_2 = 1$.
+
+Find $\displaystyle\sum_{k = 1}^{30} C({10}^{12}, \sqrt{k}, \sqrt{F_k})$, and give your answer rounded to 8 decimal places behind the decimal point.
 
 # --hints--
 
-`euler406()` should return 36813.12757207.
+`guessingGame()` should return `36813.12757207`.
 
 ```js
-assert.strictEqual(euler406(), 36813.12757207);
+assert.strictEqual(guessingGame(), 36813.12757207);
 ```
 
 # --seed--
@@ -41,12 +53,12 @@ assert.strictEqual(euler406(), 36813.12757207);
 ## --seed-contents--
 
 ```js
-function euler406() {
+function guessingGame() {
 
   return true;
 }
 
-euler406();
+guessingGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-407-idempotents.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-407-idempotents.md
index eb473f7ba0b..f676b0c5b6e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-407-idempotents.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-407-idempotents.md
@@ -1,25 +1,27 @@
 ---
 id: 5900f5041000cf542c510016
 title: 'Problem 407: Idempotents'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302075
 dashedName: problem-407-idempotents
 ---
 
 # --description--
 
-If we calculate a2 mod 6 for 0 ≤ a ≤ 5 we get: 0,1,4,3,4,1.
+If we calculate $a^2\bmod 6$ for $0 ≤ a ≤ 5$ we get: 0, 1, 4, 3, 4, 1.
 
-The largest value of a such that a2 ≡ a mod 6 is 4. Let's call M(n) the largest value of a &lt; n such that a2 ≡ a (mod n). So M(6) = 4.
+The largest value of a such that $a^2 ≡ a\bmod 6$ is $4$.
 
-Find ∑M(n) for 1 ≤ n ≤ 107.
+Let's call $M(n)$ the largest value of $a &lt; n$ such that $a^2 ≡ a (\text{mod } n)$. So $M(6) = 4$.
+
+Find $\sum M(n)$ for $1 ≤ n ≤ {10}^7$.
 
 # --hints--
 
-`euler407()` should return 39782849136421.
+`idempotents()` should return `39782849136421`.
 
 ```js
-assert.strictEqual(euler407(), 39782849136421);
+assert.strictEqual(idempotents(), 39782849136421);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler407(), 39782849136421);
 ## --seed-contents--
 
 ```js
-function euler407() {
+function idempotents() {
 
   return true;
 }
 
-euler407();
+idempotents();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.md
index 0c3decbbe7c..260a1917a56 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f5091000cf542c51001b
 title: 'Problem 408: Admissible paths through a grid'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302076
 dashedName: problem-408-admissible-paths-through-a-grid
 ---
 
 # --description--
 
-Let's call a lattice point (x, y) inadmissible if x, y and x + y are all positive perfect squares.
+Let's call a lattice point ($x$, $y$) inadmissible if $x$, $y$ and $x + y$ are all positive perfect squares.
 
 For example, (9, 16) is inadmissible, while (0, 4), (3, 1) and (9, 4) are not.
 
-Consider a path from point (x1, y1) to point (x2, y2) using only unit steps north or east. Let's call such a path admissible if none of its intermediate points are inadmissible.
+Consider a path from point ($x_1$, $y_1$) to point ($x_2$, $y_2$) using only unit steps north or east. Let's call such a path admissible if none of its intermediate points are inadmissible.
 
-Let P(n) be the number of admissible paths from (0, 0) to (n, n). It can be verified that P(5) = 252, P(16) = 596994440 and P(1000) mod 1 000 000 007 = 341920854.
+Let $P(n)$ be the number of admissible paths from (0, 0) to ($n$, $n$). It can be verified that $P(5) = 252$, $P(16) = 596\\,994\\,440$ and $P(1\\,000)\bmod 1\\,000\\,000\\,007 = 341\\,920\\,854$.
 
-Find P(10 000 000) mod 1 000 000 007.
+Find $P(10\\,000\\,000)\bmod 1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler408()` should return 299742733.
+`admissiblePaths()` should return `299742733`.
 
 ```js
-assert.strictEqual(euler408(), 299742733);
+assert.strictEqual(admissiblePaths(), 299742733);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler408(), 299742733);
 ## --seed-contents--
 
 ```js
-function euler408() {
+function admissiblePaths() {
 
   return true;
 }
 
-euler408();
+admissiblePaths();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-409-nim-extreme.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-409-nim-extreme.md
index d6dbeffce98..735a1c77781 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-409-nim-extreme.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-409-nim-extreme.md
@@ -1,31 +1,31 @@
 ---
 id: 5900f5061000cf542c510017
 title: 'Problem 409: Nim Extreme'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302077
 dashedName: problem-409-nim-extreme
 ---
 
 # --description--
 
-Let n be a positive integer. Consider nim positions where:There are n non-empty piles.
+Let $n$ be a positive integer. Consider nim positions where:
 
-Each pile has size less than 2n.
+- There are $n$ non-empty piles.
+- Each pile has size less than $2^n$.
+- No two piles have the same size.
 
-No two piles have the same size.
+Let $W(n)$ be the number of winning nim positions satisfying the above conditions (a position is winning if the first player has a winning strategy).
 
-Let W(n) be the number of winning nim positions satisfying the above
+For example, $W(1) = 1$, $W(2) = 6$, $W(3) = 168$, $W(5) = 19\\,764\\,360$ and $W(100)\bmod 1\\,000\\,000\\,007 = 384\\,777\\,056$.
 
-conditions (a position is winning if the first player has a winning strategy). For example, W(1) = 1, W(2) = 6, W(3) = 168, W(5) = 19764360 and W(100) mod 1 000 000 007 = 384777056.
-
-Find W(10 000 000) mod 1 000 000 007.
+Find $W(10\\,000\\,000)\bmod 1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler409()` should return 253223948.
+`nimExtreme()` should return `253223948`.
 
 ```js
-assert.strictEqual(euler409(), 253223948);
+assert.strictEqual(nimExtreme(), 253223948);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler409(), 253223948);
 ## --seed-contents--
 
 ```js
-function euler409() {
+function nimExtreme() {
 
   return true;
 }
 
-euler409();
+nimExtreme();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-41-pandigital-prime.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-41-pandigital-prime.md
index 41465478fc3..a774fa31167 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-41-pandigital-prime.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-41-pandigital-prime.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3951000cf542c50fea8
 title: 'Problem 41: Pandigital prime'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302078
 dashedName: problem-41-pandigital-prime
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.md
index cd55b71cbc0..fd9d28a1bab 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f5071000cf542c510018
 title: 'Problem 410: Circle and tangent line'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302079
 dashedName: problem-410-circle-and-tangent-line
 ---
 
 # --description--
 
-Let C be the circle with radius r, x2 + y2 = r2. We choose two points P(a, b) and Q(-a, c) so that the line passing through P and Q is tangent to C.
+Let $C$ be the circle with radius $r$, $x^2 + y^2 = r^2$. We choose two points $P(a, b)$ and $Q(-a, c)$ so that the line passing through $P$ and $Q$ is tangent to $C$.
 
-For example, the quadruplet (r, a, b, c) = (2, 6, 2, -7) satisfies this property.
+For example, the quadruplet $(r, a, b, c) = (2, 6, 2, -7)$ satisfies this property.
 
-Let F(R, X) be the number of the integer quadruplets (r, a, b, c) with this property, and with 0 &lt; r ≤ R and 0 &lt; a ≤ X.
+Let $F(R, X)$ be the number of the integer quadruplets $(r, a, b, c)$ with this property, and with $0 &lt; r ≤ R$ and $0 &lt; a ≤ X$.
 
-We can verify that F(1, 5) = 10, F(2, 10) = 52 and F(10, 100) = 3384. Find F(108, 109) + F(109, 108).
+We can verify that $F(1, 5) = 10$, $F(2, 10) = 52$ and $F(10, 100) = 3384$.
+
+Find $F({10}^8, {10}^9) + F({10}^9, {10}^8)$.
 
 # --hints--
 
-`euler410()` should return 799999783589946600.
+`circleAndTangentLine()` should return `799999783589946600`.
 
 ```js
-assert.strictEqual(euler410(), 799999783589946600);
+assert.strictEqual(circleAndTangentLine(), 799999783589946600);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler410(), 799999783589946600);
 ## --seed-contents--
 
 ```js
-function euler410() {
+function circleAndTangentLine() {
 
   return true;
 }
 
-euler410();
+circleAndTangentLine();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md
index db9dd2cb866..09ace26cdea 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md
@@ -1,29 +1,33 @@
 ---
 id: 5900f5081000cf542c510019
 title: 'Problem 411: Uphill paths'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302080
 dashedName: problem-411-uphill-paths
 ---
 
 # --description--
 
-Let n be a positive integer. Suppose there are stations at the coordinates (x, y) = (2i mod n, 3i mod n) for 0 ≤ i ≤ 2n. We will consider stations with the same coordinates as the same station.
+Let $n$ be a positive integer. Suppose there are stations at the coordinates $(x, y) = (2^i\bmod n, 3^i\bmod n)$ for $0 ≤ i ≤ 2n$. We will consider stations with the same coordinates as the same station.
 
-We wish to form a path from (0, 0) to (n, n) such that the x and y coordinates never decrease. Let S(n) be the maximum number of stations such a path can pass through.
+We wish to form a path from (0, 0) to ($n$, $n$) such that the $x$ and $y$ coordinates never decrease.
 
-For example, if n = 22, there are 11 distinct stations, and a valid path can pass through at most 5 stations. Therefore, S(22) = 5. The case is illustrated below, with an example of an optimal path:
+Let $S(n)$ be the maximum number of stations such a path can pass through.
 
-It can also be verified that S(123) = 14 and S(10000) = 48.
+For example, if $n = 22$, there are 11 distinct stations, and a valid path can pass through at most 5 stations. Therefore, $S(22) = 5$. The case is illustrated below, with an example of an optimal path:
 
-Find ∑ S(k5) for 1 ≤ k ≤ 30.
+<img class="img-responsive center-block" alt="valid path passing through 5 stations, for n = 22, with 11 distinct stations" src="https://cdn.freecodecamp.org/curriculum/project-euler/uphill-paths.png" style="background-color: white; padding: 10px;" />
+
+It can also be verified that $S(123) = 14$ and $S(10\\,000) = 48$.
+
+Find $\sum S(k^5)$ for $1 ≤ k ≤ 30$.
 
 # --hints--
 
-`euler411()` should return 9936352.
+`uphillPaths()` should return `9936352`.
 
 ```js
-assert.strictEqual(euler411(), 9936352);
+assert.strictEqual(uphillPaths(), 9936352);
 ```
 
 # --seed--
@@ -31,12 +35,12 @@ assert.strictEqual(euler411(), 9936352);
 ## --seed-contents--
 
 ```js
-function euler411() {
+function uphillPaths() {
 
   return true;
 }
 
-euler411();
+uphillPaths();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md
index f0dfab1bf60..ac00f985c10 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md
@@ -1,31 +1,35 @@
 ---
 id: 5900f5081000cf542c51001a
 title: 'Problem 412: Gnomon numbering'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302081
 dashedName: problem-412-gnomon-numbering
 ---
 
 # --description--
 
-For integers m, n (0 ≤ n &lt; m), let L(m, n) be an m×m grid with the top-right n×n grid removed.
+For integers $m$, $n$ ($0 ≤ n &lt; m$), let $L(m, n)$ be an $m×m$ grid with the top-right $n×n$ grid removed.
 
-For example, L(5, 3) looks like this:
+For example, $L(5, 3)$ looks like this:
 
-We want to number each cell of L(m, n) with consecutive integers 1, 2, 3, ... such that the number in every cell is smaller than the number below it and to the left of it.
+<img class="img-responsive center-block" alt="5x5 grid, with removed 3x3 grid from the top-right" src="https://cdn.freecodecamp.org/curriculum/project-euler/gnomon-numbering-1.png" style="background-color: white; padding: 10px;" />
 
-For example, here are two valid numberings of L(5, 3):
+We want to number each cell of $L(m, n)$ with consecutive integers 1, 2, 3, ... such that the number in every cell is smaller than the number below it and to the left of it.
 
-Let LC(m, n) be the number of valid numberings of L(m, n). It can be verified that LC(3, 0) = 42, LC(5, 3) = 250250, LC(6, 3) = 406029023400 and LC(10, 5) mod 76543217 = 61251715.
+For example, here are two valid numberings of $L(5, 3)$:
 
-Find LC(10000, 5000) mod 76543217.
+<img class="img-responsive center-block" alt="two valid numberings of L(5, 3)" src="https://cdn.freecodecamp.org/curriculum/project-euler/gnomon-numbering-2.png" style="background-color: white; padding: 10px;" />
+
+Let $LC(m, n)$ be the number of valid numberings of $L(m, n)$. It can be verified that $LC(3, 0) = 42$, $LC(5, 3) = 250\\,250$, $LC(6, 3) = 406\\,029\\,023\\,400$ and $LC(10, 5)\bmod 76\\,543\\,217 = 61\\,251\\,715$.
+
+Find $LC(10\\,000, 5\\,000)\bmod 76\\,543\\,217$.
 
 # --hints--
 
-`euler412()` should return 38788800.
+`gnomonNumbering()` should return `38788800`.
 
 ```js
-assert.strictEqual(euler412(), 38788800);
+assert.strictEqual(gnomonNumbering(), 38788800);
 ```
 
 # --seed--
@@ -33,12 +37,12 @@ assert.strictEqual(euler412(), 38788800);
 ## --seed-contents--
 
 ```js
-function euler412() {
+function gnomonNumbering() {
 
   return true;
 }
 
-euler412();
+gnomonNumbering();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-413-one-child-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-413-one-child-numbers.md
index a3a7ac23c57..374b3a8df34 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-413-one-child-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-413-one-child-numbers.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f50a1000cf542c51001c
 title: 'Problem 413: One-child Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302082
 dashedName: problem-413-one-child-numbers
 ---
 
 # --description--
 
-We say that a d-digit positive number (no leading zeros) is a one-child number if exactly one of its sub-strings is divisible by d.
+We say that a $d$-digit positive number (no leading zeros) is a one-child number if exactly one of its sub-strings is divisible by $d$.
 
-For example, 5671 is a 4-digit one-child number. Among all its sub-strings 5, 6, 7, 1, 56, 67, 71, 567, 671 and 5671, only 56 is divisible by 4. Similarly, 104 is a 3-digit one-child number because only 0 is divisible by 3. 1132451 is a 7-digit one-child number because only 245 is divisible by 7.
+例如，5671 是一個 4 位數的單子號碼。 在它的所有子串 5、6、7、1、56、67、71、567、671 和 5671 中，只有 56 能被 4 整除。
 
-Let F(N) be the number of the one-child numbers less than N. We can verify that F(10) = 9, F(103) = 389 and F(107) = 277674.
+Similarly, 104 is a 3-digit one-child number because only 0 is divisible by 3. 1132451 is a 7-digit one-child number because only 245 is divisible by 7.
 
-Find F(1019).
+Let $F(N)$ be the number of the one-child numbers less than $N$. We can verify that $F(10) = 9$, $F({10}^3) = 389$ and $F({10}^7) = 277\\,674$.
+
+Find $F({10}^{19})$.
 
 # --hints--
 
-`euler413()` should return 3079418648040719.
+`oneChildNumbers()` should return `3079418648040719`.
 
 ```js
-assert.strictEqual(euler413(), 3079418648040719);
+assert.strictEqual(oneChildNumbers(), 3079418648040719);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler413(), 3079418648040719);
 ## --seed-contents--
 
 ```js
-function euler413() {
+function oneChildNumbers() {
 
   return true;
 }
 
-euler413();
+oneChildNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
index 9cf45b79ab3..e50ab2c9a7e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f50b1000cf542c51001d
 title: 'Problem 414: Kaprekar constant'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302083
 dashedName: problem-414-kaprekar-constant
 ---
 
 # --description--
 
-6174 is a remarkable number; if we sort its digits in increasing order and subtract that number from the number you get when you sort the digits in decreasing order, we get 7641-1467=6174.
+6174 is a remarkable number; if we sort its digits in increasing order and subtract that number from the number you get when you sort the digits in decreasing order, we get $7641 - 1467 = 6174$.
 
 Even more remarkable is that if we start from any 4 digit number and repeat this process of sorting and subtracting, we'll eventually end up with 6174 or immediately with 0 if all digits are equal.
 
@@ -16,28 +16,32 @@ This also works with numbers that have less than 4 digits if we pad the number w
 
 E.g. let's start with the number 0837:
 
-8730-0378=8352
-
-8532-2358=6174
+$$\begin{align}   & 8730 - 0378 = 8352 \\\\
+  & 8532 - 2358 = 6174 \end{align}$$
 
 6174 is called the Kaprekar constant. The process of sorting and subtracting and repeating this until either 0 or the Kaprekar constant is reached is called the Kaprekar routine.
 
-We can consider the Kaprekar routine for other bases and number of digits. Unfortunately, it is not guaranteed a Kaprekar constant exists in all cases; either the routine can end up in a cycle for some input numbers or the constant the routine arrives at can be different for different input numbers. However, it can be shown that for 5 digits and a base b = 6t+3≠9, a Kaprekar constant exists. E.g. base 15: (10,4,14,9,5)15 base 21: (14,6,20,13,7)21
+We can consider the Kaprekar routine for other bases and number of digits. Unfortunately, it is not guaranteed a Kaprekar constant exists in all cases; either the routine can end up in a cycle for some input numbers or the constant the routine arrives at can be different for different input numbers. However, it can be shown that for 5 digits and a base $b = 6t + 3 ≠ 9$, a Kaprekar constant exists.
 
-Define Cb to be the Kaprekar constant in base b for 5 digits. Define the function sb(i) to be 0 if i = Cb or if i written in base b consists of 5 identical digits the number of iterations it takes the Kaprekar routine in base b to arrive at Cb, otherwise
+E.g. base 15: ${(10, 4, 14, 9, 5)}\_{15}$ base 21: $(14, 6, 20, 13, 7)\_{21}$
 
-Note that we can define sb(i) for all integers i &lt; b5. If i written in base b takes less than 5 digits, the number is padded with leading zero digits until we have 5 digits before applying the Kaprekar routine.
+Define $C_b$ to be the Kaprekar constant in base $b$ for 5 digits. Define the function $sb(i)$ to be:
 
-Define S(b) as the sum of sb(i) for 0 &lt; i &lt; b5. E.g. S(15) = 5274369 S(111) = 400668930299
+- 0 if $i = C_b$ or if $i$ written in base $b$ consists of 5 identical digits
+- the number of iterations it takes the Kaprekar routine in base $b$ to arrive at $C_b$, otherwise
 
-Find the sum of S(6k+3) for 2 ≤ k ≤ 300. Give the last 18 digits as your answer.
+Note that we can define $sb(i)$ for all integers $i &lt; b^5$. If $i$ written in base $b$ takes less than 5 digits, the number is padded with leading zero digits until we have 5 digits before applying the Kaprekar routine.
+
+Define $S(b)$ as the sum of $sb(i)$ for $0 &lt; i &lt; b^5$. E.g. $S(15) = 5\\,274\\,369$ $S(111) = 400\\,668\\,930\\,299$
+
+Find the sum of $S(6k + 3)$ for $2 ≤ k ≤ 300$. Give the last 18 digits as your answer.
 
 # --hints--
 
-`euler414()` should return 552506775824935500.
+`kaprekarConstant()` should return `552506775824935500`.
 
 ```js
-assert.strictEqual(euler414(), 552506775824935500);
+assert.strictEqual(kaprekarConstant(), 552506775824935500);
 ```
 
 # --seed--
@@ -45,12 +49,12 @@ assert.strictEqual(euler414(), 552506775824935500);
 ## --seed-contents--
 
 ```js
-function euler414() {
+function kaprekarConstant() {
 
   return true;
 }
 
-euler414();
+kaprekarConstant();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-415-titanic-sets.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-415-titanic-sets.md
index 951684acc05..a03c026f9ae 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-415-titanic-sets.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-415-titanic-sets.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f50c1000cf542c51001e
 title: 'Problem 415: Titanic sets'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302084
 dashedName: problem-415-titanic-sets
 ---
 
 # --description--
 
-A set of lattice points S is called a titanic set if there exists a line passing through exactly two points in S.
+A set of lattice points $S$ is called a titanic set if there exists a line passing through exactly two points in $S$.
 
-An example of a titanic set is S = {(0, 0), (0, 1), (0, 2), (1, 1), (2, 0), (1, 0)}, where the line passing through (0, 1) and (2, 0) does not pass through any other point in S.
+An example of a titanic set is $S = \\{(0, 0), (0, 1), (0, 2), (1, 1), (2, 0), (1, 0)\\}$, where the line passing through (0, 1) and (2, 0) does not pass through any other point in $S$.
 
 On the other hand, the set {(0, 0), (1, 1), (2, 2), (4, 4)} is not a titanic set since the line passing through any two points in the set also passes through the other two.
 
-For any positive integer N, let T(N) be the number of titanic sets S whose every point (x, y) satisfies 0 ≤ x, y ≤ N. It can be verified that T(1) = 11, T(2) = 494, T(4) = 33554178, T(111) mod 108 = 13500401 and T(105) mod 108 = 63259062.
+For any positive integer $N$, let $T(N)$ be the number of titanic sets $S$ whose every point ($x$, $y$) satisfies $0 ≤ x$, $y ≤ N$. It can be verified that $T(1) = 11$, $T(2) = 494$, $T(4) = 33\\,554\\,178$, $T(111)\bmod {10}^8 = 13\\,500\\,401$ and $T({10}^5)\bmod {10}^8 = 63\\,259\\,062$.
 
-Find T(1011) mod 108.
+Find $T({10}^{11})\bmod {10}^8$.
 
 # --hints--
 
-`euler415()` should return 55859742.
+`titanicSets()` should return `55859742`.
 
 ```js
-assert.strictEqual(euler415(), 55859742);
+assert.strictEqual(titanicSets(), 55859742);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler415(), 55859742);
 ## --seed-contents--
 
 ```js
-function euler415() {
+function titanicSets() {
 
   return true;
 }
 
-euler415();
+titanicSets();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-416-a-frogs-trip.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-416-a-frogs-trip.md
index 96e9fe1bb0f..048adb254cd 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-416-a-frogs-trip.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-416-a-frogs-trip.md
@@ -1,25 +1,27 @@
 ---
 id: 5900f50e1000cf542c510020
 title: 'Problem 416: A frog''s trip'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302085
 dashedName: problem-416-a-frogs-trip
 ---
 
 # --description--
 
-A row of n squares contains a frog in the leftmost square. By successive jumps the frog goes to the rightmost square and then back to the leftmost square. On the outward trip he jumps one, two or three squares to the right, and on the homeward trip he jumps to the left in a similar manner. He cannot jump outside the squares. He repeats the round-trip travel m times.
+A row of $n$ squares contains a frog in the leftmost square. By successive jumps the frog goes to the rightmost square and then back to the leftmost square. On the outward trip he jumps one, two or three squares to the right, and on the homeward trip he jumps to the left in a similar manner. He cannot jump outside the squares. He repeats the round-trip travel $m$ times.
 
-Let F(m, n) be the number of the ways the frog can travel so that at most one square remains unvisited. For example, F(1, 3) = 4, F(1, 4) = 15, F(1, 5) = 46, F(2, 3) = 16 and F(2, 100) mod 109 = 429619151.
+Let $F(m, n)$ be the number of the ways the frog can travel so that at most one square remains unvisited.
 
-Find the last 9 digits of F(10, 1012).
+For example, $F(1, 3) = 4$, $F(1, 4) = 15$, $F(1, 5) = 46$, $F(2, 3) = 16$ and $F(2, 100)\bmod {10}^9 = 429\\,619\\,151$.
+
+Find the last 9 digits of $F(10, {10}^{12})$.
 
 # --hints--
 
-`euler416()` should return 898082747.
+`frogsTrip()` should return `898082747`.
 
 ```js
-assert.strictEqual(euler416(), 898082747);
+assert.strictEqual(frogsTrip(), 898082747);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler416(), 898082747);
 ## --seed-contents--
 
 ```js
-function euler416() {
+function frogsTrip() {
 
   return true;
 }
 
-euler416();
+frogsTrip();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md
index e73dd646e83..aa0880c13f4 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f50d1000cf542c51001f
 title: 'Problem 417: Reciprocal cycles II'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302086
 dashedName: problem-417-reciprocal-cycles-ii
 ---
@@ -10,22 +10,27 @@ dashedName: problem-417-reciprocal-cycles-ii
 
 A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:
 
-1/2= 0.5 1/3= 0.(3) 1/4= 0.25 1/5= 0.2 1/6= 0.1(6) 1/7= 0.(142857) 1/8= 0.125 1/9= 0.(1) 1/10= 0.1
+$$\begin{align}   & \frac{1}{2}  = 0.5 \\\\
+  & \frac{1}{3}  = 0.(3) \\\\   & \frac{1}{4}  = 0.25 \\\\
+  & \frac{1}{5}  = 0.2 \\\\   & \frac{1}{6}  = 0.1(6) \\\\
+  & \frac{1}{7}  = 0.(142857) \\\\   & \frac{1}{8}  = 0.125 \\\\
+  & \frac{1}{9}  = 0.(1) \\\\   & \frac{1}{10} = 0.1 \\\\
+\end{align}$$
 
-Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that 1/7 has a 6-digit recurring cycle.
+Where $0.1(6)$ means $0.166666\ldots$, and has a 1-digit recurring cycle. It can be seen that $\frac{1}{7}$ has a 6-digit recurring cycle.
 
 Unit fractions whose denominator has no other prime factors than 2 and/or 5 are not considered to have a recurring cycle. We define the length of the recurring cycle of those unit fractions as 0.
 
-Let L(n) denote the length of the recurring cycle of 1/n. You are given that ∑L(n) for 3 ≤ n ≤ 1 000 000 equals 55535191115.
+Let $L(n)$ denote the length of the recurring cycle of $\frac{1}{n}$. You are given that $\sum L(n)$ for $3 ≤ n ≤ 1\\,000\\,000$ equals $55\\,535\\,191\\,115$.
 
-Find ∑L(n) for 3 ≤ n ≤ 100 000 000
+Find $\sum L(n)$ for $3 ≤ n ≤ 100\\,000\\,000$.
 
 # --hints--
 
-`euler417()` should return 446572970925740.
+`reciprocalCyclesTwo()` should return `446572970925740`.
 
 ```js
-assert.strictEqual(euler417(), 446572970925740);
+assert.strictEqual(reciprocalCyclesTwo(), 446572970925740);
 ```
 
 # --seed--
@@ -33,12 +38,12 @@ assert.strictEqual(euler417(), 446572970925740);
 ## --seed-contents--
 
 ```js
-function euler417() {
+function reciprocalCyclesTwo() {
 
   return true;
 }
 
-euler417();
+reciprocalCyclesTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-418-factorisation-triples.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-418-factorisation-triples.md
index ac11b1083f2..2b94b26869e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-418-factorisation-triples.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-418-factorisation-triples.md
@@ -1,29 +1,30 @@
 ---
 id: 5900f50f1000cf542c510021
 title: 'Problem 418: Factorisation triples'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302087
 dashedName: problem-418-factorisation-triples
 ---
 
 # --description--
 
-Let n be a positive integer. An integer triple (a, b, c) is called a factorisation triple of n if: 1 ≤ a ≤ b ≤ c
+Let $n$ be a positive integer. An integer triple ($a$, $b$, $c$) is called a factorisation triple of $n$ if:
 
-a·b·c = n.
+- $1 ≤ a ≤ b ≤ c$
+- $a \times b \times c = n$.
 
-Define f(n) to be a + b + c for the factorisation triple (a, b, c) of n which minimises c / a. One can show that this triple is unique.
+Define $f(n)$ to be $a + b + c$ for the factorisation triple ($a$, $b$, $c$) of $n$ which minimises $\frac{c}{a}$. 可以證明這一三元組是獨特的。
 
-For example, f(165) = 19, f(100100) = 142 and f(20!) = 4034872.
+For example, $f(165) = 19$, $f(100\\,100) = 142$ and $f(20!) = 4\\,034\\,872$.
 
-Find f(43!).
+Find $f(43!)$.
 
 # --hints--
 
-`euler418()` should return 1177163565297340400.
+`factorisationTriples()` should return `1177163565297340400`.
 
 ```js
-assert.strictEqual(euler418(), 1177163565297340400);
+assert.strictEqual(factorisationTriples(), 1177163565297340400);
 ```
 
 # --seed--
@@ -31,12 +32,12 @@ assert.strictEqual(euler418(), 1177163565297340400);
 ## --seed-contents--
 
 ```js
-function euler418() {
+function factorisationTriples() {
 
   return true;
 }
 
-euler418();
+factorisationTriples();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.md
index 2d9f3650907..4143ab36ccb 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5101000cf542c510022
 title: 'Problem 419: Look and say sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302088
 dashedName: problem-419-look-and-say-sequence
 ---
@@ -14,28 +14,35 @@ The sequence starts with 1 and all other members are obtained by describing the
 
 It helps to do this out loud:
 
-1 is 'one one' → 11
+1 is 'one one' $→ 11$
 
-11 is 'two ones' → 21
+11 is 'two ones' $→ 21$
 
-21 is 'one two and one one' → 1211
+21 is 'one two and one one' $→ 1211$
 
-1211 is 'one one, one two and two ones' → 111221
+1211 is 'one one, one two and two ones' $→ 111221$
 
-111221 is 'three ones, two twos and one one' → 312211
+111221 is 'three ones, two twos and one one' $→ 312211$
 
 ...
 
-Define A(n), B(n) and C(n) as the number of ones, twos and threes in the n'th element of the sequence respectively. One can verify that A(40) = 31254, B(40) = 20259 and C(40) = 11625.
+Define $A(n)$, $B(n)$ and $C(n)$ as the number of ones, twos and threes in the $n$'th element of the sequence respectively. One can verify that $A(40) = 31\\,254$, $B(40) = 20\\,259$ and $C(40) = 11\\,625$.
 
-Find A(n), B(n) and C(n) for n = 1012. Give your answer modulo 230 and separate your values for A, B and C by a comma. E.g. for n = 40 the answer would be 31254,20259,11625
+Find $A(n)$, $B(n)$ and $C(n)$ for $n = {10}^{12}$. Give your answer modulo $2^{30}$ as a string and separate your values for $A$, $B$ and $C$ by a comma. E.g. for $n = 40$ the answer would be `31254,20259,11625`.
 
 # --hints--
 
-`euler419()` should return 998567458, 1046245404, 43363922.
+`lookAndSaySequence()` should return a string.
 
 ```js
-assert.strictEqual(euler419(), 998567458, 1046245404, 43363922);
+assert(typeof lookAndSaySequence() === 'string');
+```
+
+
+`lookAndSaySequence()` should return the string `998567458,1046245404,43363922`.
+
+```js
+assert.strictEqual(lookAndSaySequence(), '998567458,1046245404,43363922');
 ```
 
 # --seed--
@@ -43,12 +50,12 @@ assert.strictEqual(euler419(), 998567458, 1046245404, 43363922);
 ## --seed-contents--
 
 ```js
-function euler419() {
+function lookAndSaySequence() {
 
   return true;
 }
 
-euler419();
+lookAndSaySequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.md
index bc3de086231..abda6f2d137 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3961000cf542c50fea9
 title: 'Problem 42: Coded triangle numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302089
 dashedName: problem-42-coded-triangle-numbers
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md
index e65a335aada..97139c6b465 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5111000cf542c510023
 title: 'Problem 420: 2x2 positive integer matrix'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302090
 dashedName: problem-420-2x2-positive-integer-matrix
 ---
@@ -10,18 +10,29 @@ dashedName: problem-420-2x2-positive-integer-matrix
 
 A positive integer matrix is a matrix whose elements are all positive integers.
 
-Some positive integer matrices can be expressed as a square of a positive integer matrix in two different ways. Here is an example:
+Some positive integer matrices can be expressed as a square of a positive integer matrix in two different ways. 這是一個例子：
 
-We define F(N) as the number of the 2x2 positive integer matrices which have a trace less than N and which can be expressed as a square of a positive integer matrix in two different ways. We can verify that F(50) = 7 and F(1000) = 1019.
+$$\begin{pmatrix}   40 & 12 \\\\
+  48 & 40 \end{pmatrix} =
+{\begin{pmatrix}
+  2 & 3 \\\\
+ 12 & 2 \end{pmatrix}}^2 =
+{\begin{pmatrix}
+  6 & 1 \\\\
+  4 & 6 \end{pmatrix}}^2$$
 
-Find F(107).
+We define $F(N)$ as the number of the 2x2 positive integer matrices which have a trace less than N and which can be expressed as a square of a positive integer matrix in two different ways.
+
+We can verify that $F(50) = 7$ and $F(1000) = 1019$.
+
+Find $F({10}^7)$.
 
 # --hints--
 
-`euler420()` should return 145159332.
+`positiveIntegerMatrix()` should return `145159332`.
 
 ```js
-assert.strictEqual(euler420(), 145159332);
+assert.strictEqual(positiveIntegerMatrix(), 145159332);
 ```
 
 # --seed--
@@ -29,12 +40,12 @@ assert.strictEqual(euler420(), 145159332);
 ## --seed-contents--
 
 ```js
-function euler420() {
+function positiveIntegerMatrix() {
 
   return true;
 }
 
-euler420();
+positiveIntegerMatrix();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md
index 61e0b86a92d..f94cb95bc48 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md
@@ -1,27 +1,33 @@
 ---
 id: 5900f5131000cf542c510024
-title: 'Problem 421: Prime factors of n15+1'
-challengeType: 5
+title: 'Problem 421: Prime factors of n^15+1'
+challengeType: 1
 forumTopicId: 302091
 dashedName: problem-421-prime-factors-of-n151
 ---
 
 # --description--
 
-Numbers of the form n15+1 are composite for every integer n > 1.
+Numbers of the form $n^{15} + 1$ are composite for every integer $n > 1$.
 
-For positive integers n and m let s(n,m) be defined as the sum of the distinct prime factors of n15+1 not exceeding m.
+For positive integers $n$ and $m$ let $s(n, m)$ be defined as the sum of the distinct prime factors of $n^{15} + 1$ not exceeding $m$.
 
-E.g. 215+1 = 3×3×11×331. So s(2,10) = 3 and s(2,1000) = 3+11+331 = 345.
+E.g. $2^{15} + 1 = 3 × 3 × 11 × 331$.
 
-Also 1015+1 = 7×11×13×211×241×2161×9091. So s(10,100) = 31 and s(10,1000) = 483. Find ∑ s(n,108) for 1 ≤ n ≤ 1011.
+So $s(2, 10) = 3$ and $s(2, 1000) = 3 + 11 + 331 = 345$.
+
+Also ${10}^{15} + 1 = 7 × 11 × 13 × 211 × 241 × 2161 × 9091$.
+
+So $s(10, 100) = 31$ and $s(10, 1000) = 483$.
+
+Find $\sum s(n, {10}^8)$ for $1 ≤ n ≤ {10}^{11}$.
 
 # --hints--
 
-`euler421()` should return 2304215802083466200.
+`primeFactorsOfN15Plus1()` should return `2304215802083466200`.
 
 ```js
-assert.strictEqual(euler421(), 2304215802083466200);
+assert.strictEqual(primeFactorsOfN15Plus1(), 2304215802083466200);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler421(), 2304215802083466200);
 ## --seed-contents--
 
 ```js
-function euler421() {
+function primeFactorsOfN15Plus1() {
 
   return true;
 }
 
-euler421();
+primeFactorsOfN15Plus1();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md
index cf7455ac9d6..7ea875b71ab 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md
@@ -1,29 +1,37 @@
 ---
 id: 5900f5131000cf542c510025
 title: 'Problem 422: Sequence of points on a hyperbola'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302092
 dashedName: problem-422-sequence-of-points-on-a-hyperbola
 ---
 
 # --description--
 
-Let H be the hyperbola defined by the equation 12x2 + 7xy - 12y2 = 625.
+Let $H$ be the hyperbola defined by the equation $12x^2 + 7xy - 12y^2 = 625$.
 
-Next, define X as the point (7, 1). It can be seen that X is in H.
+Next, define $X$ as the point (7, 1). It can be seen that $X$ is in $H$.
 
-Now we define a sequence of points in H, {Pi : i ≥ 1}, as: P1 = (13, 61/4). P2 = (-43/6, -4). For i > 2, Pi is the unique point in H that is different from Pi-1 and such that line PiPi-1 is parallel to line Pi-2X. It can be shown that Pi is well-defined, and that its coordinates are always rational. You are given that P3 = (-19/2, -229/24), P4 = (1267/144, -37/12) and P7 = (17194218091/143327232, 274748766781/1719926784).
+Now we define a sequence of points in $H, \\{P_i : i ≥ 1\\}$, as:
 
-Find Pn for n = 1114 in the following format:If Pn = (a/b, c/d) where the fractions are in lowest terms and the denominators are positive, then the answer is (a + b + c + d) mod 1 000 000 007.
+- $P_1 = (13, \frac{61}{4})$.
+- $P_2 = (\frac{-43}{6}, -4)$.
+- For $i > 2$, $P_i$ is the unique point in $H$ that is different from $P_{i - 1}$ and such that line $P_iP_{i - 1}$ is parallel to line $P_{i - 2}X$. It can be shown that $P_i$ is well-defined, and that its coordinates are always rational.
 
-For n = 7, the answer would have been: 806236837.
+<img class="img-responsive center-block" alt="animation showing defining points P_1 to P_6" src="https://cdn.freecodecamp.org/curriculum/project-euler/sequence-of-points-on-a-hyperbola.gif" style="background-color: white; padding: 10px;" />
+
+You are given that $P_3 = (\frac{-19}{2}, \frac{-229}{24})$, $P_4 = (\frac{1267}{144}, \frac{-37}{12})$ and $P_7 = (\frac{17\\,194\\,218\\,091}{143\\,327\\,232}, \frac{274\\,748\\,766\\,781}{1\\,719\\,926\\,784})$.
+
+Find $P_n$ for $n = {11}^{14}$ in the following format: If $P_n = (\frac{a}{b}, \frac{c}{d})$ where the fractions are in lowest terms and the denominators are positive, then the answer is $(a + b + c + d)\bmod 1\\,000\\,000\\,007$.
+
+For $n = 7$, the answer would have been: $806\\,236\\,837$.
 
 # --hints--
 
-`euler422()` should return 92060460.
+`sequenceOfPointsOnHyperbola()` should return `92060460`.
 
 ```js
-assert.strictEqual(euler422(), 92060460);
+assert.strictEqual(sequenceOfPointsOnHyperbola(), 92060460);
 ```
 
 # --seed--
@@ -31,12 +39,12 @@ assert.strictEqual(euler422(), 92060460);
 ## --seed-contents--
 
 ```js
-function euler422() {
+function sequenceOfPointsOnHyperbola() {
 
   return true;
 }
 
-euler422();
+sequenceOfPointsOnHyperbola();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md
index a19a5ce19d3..9969311f0de 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md
@@ -1,33 +1,42 @@
 ---
 id: 5900f5141000cf542c510027
 title: 'Problem 423: Consecutive die throws'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302093
 dashedName: problem-423-consecutive-die-throws
 ---
 
 # --description--
 
-Let n be a positive integer.
+Let $n$ be a positive integer.
 
-A 6-sided die is thrown n times. Let c be the number of pairs of consecutive throws that give the same value.
+A 6-sided die is thrown $n$ times. Let $c$ be the number of pairs of consecutive throws that give the same value.
 
-For example, if n = 7 and the values of the die throws are (1,1,5,6,6,6,3), then the following pairs of consecutive throws give the same value: (1,1,5,6,6,6,3) (1,1,5,6,6,6,3) (1,1,5,6,6,6,3) Therefore, c = 3 for (1,1,5,6,6,6,3).
+For example, if $n = 7$ and the values of the die throws are (1, 1, 5, 6, 6, 6, 3), then the following pairs of consecutive throws give the same value:
 
-Define C(n) as the number of outcomes of throwing a 6-sided die n times such that c does not exceed π(n).1 For example, C(3) = 216, C(4) = 1290, C(11) = 361912500 and C(24) = 4727547363281250000.
+$$\begin{align}   & (\underline{1}, \underline{1}, 5, 6, 6, 6, 3) \\\\
+  & (1, 1, 5, \underline{6}, \underline{6}, 6, 3) \\\\ & (1, 1, 5, 6, \underline{6}, \underline{6}, 3) \end{align}$$
 
-Define S(L) as ∑ C(n) for 1 ≤ n ≤ L. For example, S(50) mod 1 000 000 007 = 832833871.
+Therefore, $c = 3$ for (1, 1, 5, 6, 6, 6, 3).
 
-Find S(50 000 000) mod 1 000 000 007.
+Define $C(n)$ as the number of outcomes of throwing a 6-sided die $n$ times such that $c$ does not exceed $π(n)$.<sup>1</sup>
 
-1 π denotes the prime-counting function, i.e. π(n) is the number of primes ≤ n.
+For example, $C(3) = 216$, $C(4) = 1290$, $C(11) = 361\\,912\\,500$ and $C(24) = 4\\,727\\,547\\,363\\,281\\,250\\,000$.
+
+Define $S(L)$ as $\sum C(n)$ for $1 ≤ n ≤ L$.
+
+For example, $S(50)\bmod 1\\,000\\,000\\,007 = 832\\,833\\,871$.
+
+Find $S(50\\,000\\,000)\bmod 1\\,000\\,000\\,007$.
+
+<sup>1</sup> $π$ denotes the prime-counting function, i.e. $π(n)$ is the number of primes $≤ n$.
 
 # --hints--
 
-`euler423()` should return 653972374.
+`consecutiveDieThrows()` should return `653972374`.
 
 ```js
-assert.strictEqual(euler423(), 653972374);
+assert.strictEqual(consecutiveDieThrows(), 653972374);
 ```
 
 # --seed--
@@ -35,12 +44,12 @@ assert.strictEqual(euler423(), 653972374);
 ## --seed-contents--
 
 ```js
-function euler423() {
+function consecutiveDieThrows() {
 
   return true;
 }
 
-euler423();
+consecutiveDieThrows();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-424-kakuro.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-424-kakuro.md
index 827b969ce69..90b1b38773f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-424-kakuro.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-424-kakuro.md
@@ -1,50 +1,73 @@
 ---
 id: 5900f5141000cf542c510026
 title: 'Problem 424: Kakuro'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302094
 dashedName: problem-424-kakuro
 ---
 
 # --description--
 
+<img class="img-responsive center-block" alt="kakuro example" src="https://cdn.freecodecamp.org/curriculum/project-euler/kakuro.gif" style="background-color: white; padding: 10px;" />
+
 The above is an example of a cryptic kakuro (also known as cross sums, or even sums cross) puzzle, with its final solution on the right. (The common rules of kakuro puzzles can be found easily on numerous internet sites. Other related information can also be currently found at krazydad.com whose author has provided the puzzle data for this challenge.)
 
-The downloadable text file (kakuro200.txt) contains the description of 200 such puzzles, a mix of 5x5 and 6x6 types. The first puzzle in the file is the above example which is coded as follows:
+The `testPuzzles` array contains the description of 200 such puzzles, a mix of 5x5 and 6x6 types. The first puzzle in the file is the above example which is coded as string as follows:
 
-6,X,X,(vCC),(vI),X,X,X,(hH),B,O,(vCA),(vJE),X,(hFE,vD),O,O,O,O,(hA),O,I,(hJC,vB),O,O,(hJC),H,O,O,O,X,X,X,(hJE),O,O,X
+`6,X,X,(vCC),(vI),X,X,X,(hH),B,O,(vCA),(vJE),X,(hFE,vD),O,O,O,O,(hA),O,I,(hJC,vB),O,O,(hJC),H,O,O,O,X,X,X,(hJE),O,O,X`
 
 The first character is a numerical digit indicating the size of the information grid. It would be either a 6 (for a 5x5 kakuro puzzle) or a 7 (for a 6x6 puzzle) followed by a comma (,). The extra top line and left column are needed to insert information.
 
-The content of each cell is then described and followed by a comma, going left to right and starting with the top line. X = Gray cell, not required to be filled by a digit. O (upper case letter)= White empty cell to be filled by a digit. A = Or any one of the upper case letters from A to J to be replaced by its equivalent digit in the solved puzzle. ( ) = Location of the encrypted sums. Horizontal sums are preceded by a lower case "h" and vertical sums are preceded by a lower case "v". Those are followed by one or two upper case letters depending if the sum is a single digit or double digit one. For double digit sums, the first letter would be for the "tens" and the second one for the "units". When the cell must contain information for both a horizontal and a vertical sum, the first one is always for the horizontal sum and the two are separated by a comma within the same set of brackets, ex.: (hFE,vD). Each set of brackets is also immediately followed by a comma.
+The content of each cell is then described and followed by a comma, going left to right and starting with the top line.
+
+`X` = Gray cell, not required to be filled by a digit.
+
+`O` (upper case letter)= White empty cell to be filled by a digit.
+
+`A` = Or any one of the upper case letters from A to J to be replaced by its equivalent digit in the solved puzzle.
+
+`( )` = Location of the encrypted sums. Horizontal sums are preceded by a lower case "h" and vertical sums are preceded by a lower case "v". Those are followed by one or two upper case letters depending if the sum is a single digit or double digit one. For double digit sums, the first letter would be for the "tens" and the second one for the "units". When the cell must contain information for both a horizontal and a vertical sum, the first one is always for the horizontal sum and the two are separated by a comma within the same set of brackets, ex.: (hFE,vD). Each set of brackets is also immediately followed by a comma.
 
 The description of the last cell is followed by a Carriage Return/Line Feed (CRLF) instead of a comma.
 
 The required answer to each puzzle is based on the value of each letter necessary to arrive at the solution and according to the alphabetical order. As indicated under the example puzzle, its answer would be 8426039571. At least 9 out of the 10 encrypting letters are always part of the problem description. When only 9 are given, the missing one must be assigned the remaining digit.
 
-You are given that the sum of the answers for the first 10 puzzles in the file is 64414157580.
+You are given that the sum of the answers for the first 10 puzzles in `testPuzzles` is 64414157580.
 
-Find the sum of the answers for the 200 puzzles.
+Find the sum of the answers for `puzzles` array.
 
 # --hints--
 
-`euler424()` should return 1059760019628.
+`kakuro(testPuzzles)` should return `1059760019628`.
 
 ```js
-assert.strictEqual(euler424(), 1059760019628);
+assert.strictEqual(kakuro(_testPuzzles), 1059760019628);
 ```
 
 # --seed--
 
+
+## --after-user-code--
+
+```js
+const _testPuzzles = [
+  '6,X,X,(vCC),(vI),X,X,X,(hH),B,O,(vCA),(vJE),X,(hFE,vD),O,O,O,O,(hA),O,I,(hJC,vB),O,O,(hJC),H,O,O,O,X,X,X,(hJE),O,O,X','7,X,X,X,X,(vJJ),(vCD),X,X,X,X,(hCG),O,O,(vCE),X,X,X,(hCI,vJB),C,O,O,X,(vB),(hJF,vJF),O,F,O,O,(hJA),F,G,O,O,X,X,(hCA),O,A,O,X,X,X,X,(hCF),O,O,X,X,X','7,X,X,X,(vE),(vCB),X,X,X,X,(hJ),O,O,(vCA),X,X,(vCH),(hCG,vCJ),O,O,O,(vJ),(hCE),O,O,O,(hJ,vGG),O,O,(hD),I,O,(hCD,vCB),H,O,O,X,(hCE),O,O,E,X,X,X,X,(hCE),O,O,X,X','6,X,X,X,(vEA),(vJF),X,X,X,(hI),O,O,(vJA),X,(vA),(hEI,vEB),O,O,O,(hIG),C,O,J,O,D,(hJD),O,O,O,X,X,X,(hJD),O,O,X,X','7,X,(vH),(vG),X,X,(vI),(vDH),(hG),B,O,(vDI),(hDB,vDE),O,O,(hBC),I,O,F,O,O,J,X,X,(hG),O,O,X,X,X,(vDG),(hH,vDD),O,O,(vDJ),(vC),(hBI),O,O,O,O,O,O,(hDJ),O,O,X,(hA),O,O','6,X,(vID),(vIJ),X,X,X,(hH),F,I,(vF),(vIA),X,(hIA),G,B,O,C,X,X,(hID),O,O,O,(vIF),X,(hIA),E,O,I,O,X,X,X,(hII),O,G','6,X,X,(vAF),(vAI),X,X,X,(hJ,vAC),O,B,(vGJ),X,(hGH),J,O,O,O,(vAF),(hAG),O,O,(hH,vF),A,D,X,(hGF),O,E,O,O,X,X,(hD),O,O,X','7,X,X,X,X,(vCE),(vGB),X,X,(vJG),(vCI),(hCD,vCJ),O,O,X,(hCI),O,O,O,O,B,(vJB),(hCF),O,O,O,(hCA,vH),O,O,(hCJ),O,O,(hJB,vCJ),O,O,O,X,(hJD),O,O,O,O,O,X,(hF),I,O,X,X,X','7,X,(vBB),(vBD),X,X,X,X,(hBB),C,E,(vEE),(vEC),X,X,(hBC),O,O,O,O,X,X,X,(hEF),H,O,A,(vJ),X,X,X,(hBD),O,O,O,(vI),X,X,(hBE),F,O,O,O,X,X,X,X,(hG),O,O','7,X,X,(vGG),(vGD),X,(vI),(vGI),X,(hGB),O,O,(hGH,vIC),O,O,X,(hGA),O,O,O,J,O,X,X,(hGI),O,O,X,X,X,(vGD),(hE,vE),O,O,(vGF),X,(hIH),O,O,O,O,O,X,(hE),A,O,(hGF),O,O,X','6,X,(vIJ),(vIE),X,X,X,(hF),O,C,(vIA),X,X,(hCA),O,O,D,(vIH),X,X,(hIB),E,O,O,(vF),X,X,(hD),O,A,O,X,X,X,(hID),O,G','6,X,(vAD),(vGI),(vI),X,X,(hB),O,O,O,(vAF),X,(hGC),O,O,O,O,(vGA),(hGE),O,O,(hJ,vB),O,O,X,(hGD),D,O,E,O,X,X,(hAI),O,C,O','6,X,X,X,(vAB),(vFA),X,X,X,(hHI),O,O,(vHJ),X,(vA),(hFJ,vHE),I,D,O,(hFH),O,O,O,O,O,(hHJ),O,O,O,X,X,X,(hC),O,J,X,X','7,X,X,X,(vJ),(vEF),X,X,X,X,(hI,vGD),C,E,(vEF),(vA),X,(hEH),O,O,O,O,O,X,(hH,vJ),O,O,(hJ,vEJ),O,O,(hD),O,A,(hEF,vEB),O,O,X,(hCC),O,O,A,O,O,X,X,X,(hH),O,O,X,X','7,X,X,X,(vAG),(vAJ),(vFH),X,X,X,(hFD),O,O,O,X,X,(vH),(hAJ,vAB),O,O,O,(vB),(hAH),O,H,O,(hC,vAI),O,O,(hE),O,O,(hAI,vAE),O,O,O,X,(hJ),O,O,O,X,X,X,(hFG),E,O,O,X,X','7,X,(vAI),(vHB),X,X,(vJE),(vAA),(hD),O,O,X,(hG),O,O,(hAJ),O,O,(vE),(hAA,vAI),O,O,X,(hHF),O,O,O,O,X,X,(hJF,vAE),O,O,O,J,(vH),(hAI),D,O,X,(hB),O,O,(hAG),O,O,X,(hAA),O,O','7,X,X,(vHJ),(vC),(vAF),X,X,X,(hHF),O,O,O,(vHI),(vHD),X,(hHB,vAB),O,O,O,O,E,(hAI),O,O,X,(hAB),O,O,(hD),O,O,(vAB),(hAI,vE),J,O,(hHH),O,O,O,B,O,X,X,X,(hG),O,A,O,X','6,X,X,(vDF),(vHE),X,X,X,(hHJ,vE),C,O,X,X,(hHI),O,O,O,(vDF),(vHH),(hFA),A,O,B,O,O,X,X,(hE),O,I,O,X,X,(hHH),O,O,X','6,X,(vA),(vA),X,X,X,(hE),O,O,(vCJ),X,X,(hG),O,O,O,(vHI),X,X,(hHC),O,O,H,(vB),X,X,(hCE),O,O,D,X,X,X,(hE),O,O','6,X,X,X,X,(vEH),(vEC),X,X,X,(hEB,vEJ),O,O,X,X,(hEC,vEF),O,O,B,X,(hDD,vEI),O,B,C,X,(hB),O,D,A,X,X,(hEC),O,O,X,X,X','6,X,X,X,X,(vIF),(vH),X,X,X,(hIJ,vGJ),B,I,X,X,(hIB,vIC),O,O,G,X,(hIA,vC),O,O,O,X,(hE),O,O,O,X,X,(hIA),E,O,X,X,X','7,X,(vC),(vFB),X,X,X,X,(hFH),O,O,(vFA),(vFJ),(vC),X,(hFJ),O,O,O,O,O,X,X,X,(hA,vJ),O,O,O,X,X,(hG),D,O,O,(vC),(vFC),X,(hBH),A,O,O,O,E,X,X,X,X,(hFH),O,I','6,X,X,(vFD),(vC),X,X,X,(hDH),E,F,(vDG),(vDD),X,(hDF,vDI),O,O,A,O,(hDG),O,O,(hDG,vDG),O,O,(hDJ),O,D,J,O,X,X,X,(hJ),E,O,X','6,X,X,X,(vE),(vGH),(vIC),X,X,(hD,vIG),O,O,A,X,(hIF,vJ),O,J,E,O,(hJ),O,D,(hGG,vGH),O,O,(hGG),O,O,O,O,X,(hIC),O,O,O,X,X','7,X,X,X,X,(vAG),(vJA),(vH),X,X,X,(hAJ,vDJ),O,O,O,X,X,(hJF),O,O,O,O,X,X,(hG),D,O,X,X,X,(vJH),(hJE,vJD),C,I,X,X,(hAE),B,O,O,O,X,X,(hAJ),O,O,E,X,X,X','7,X,X,X,X,(vGG),(vIA),(vGF),X,X,X,(hGF),O,O,D,X,X,X,(hGJ,vIB),O,O,O,X,X,(hGH,vGD),O,O,O,X,X,(hII,vC),O,J,O,X,X,(hIH),J,O,O,X,X,X,(hGE),O,I,O,X,X,X','6,X,X,(vFA),(vEC),X,X,X,(hI,vFI),F,O,X,X,(hDE),O,O,O,(vFF),(vFF),(hDI),G,J,O,F,O,X,X,(hFJ),O,D,O,X,X,(hFH),J,A,X','7,X,X,X,X,X,(vID),(vBB),X,X,X,X,(hBC),O,I,X,X,(vIH),(vBH),(hBF,vF),O,O,X,(hIE,vD),O,O,I,O,O,(hAG),O,O,O,O,F,X,(hA),O,O,X,X,X,X,(hD),O,O,X,X,X,X','7,X,(vCD),(vCC),X,X,X,X,(hE),B,C,(vCE),X,X,X,(hCD),O,O,O,(vE),(vCG),X,X,(hCH),O,O,O,O,X,X,(hFC),B,J,G,O,(vCC),X,X,X,(hCI),O,O,O,X,X,X,X,(hG),O,O','7,X,X,X,(vID),(vD),(vFB),X,X,X,(hIB,vID),O,O,O,X,X,(hJE,vIA),J,C,O,D,(vF),(hIB),O,O,X,(hIG),O,O,(hIJ),O,O,(vD),(hA,vID),O,O,X,(hJF),O,O,O,O,X,X,(hIE),O,O,O,X,X','7,X,X,(vAC),(vAH),X,X,X,X,(hD),O,O,(vAD),X,X,X,(hCH,vAD),O,O,O,(vAA),(vF),(hAC),O,H,(hAB,vAJ),O,O,A,(hAE),O,O,O,(hD,vAD),O,O,X,X,(hAC),O,O,O,X,X,X,X,(hG),O,O,X','6,X,X,(vBB),(vBE),X,X,X,(hBH),O,I,(vBG),(vBB),X,(hHE,vBD),H,D,O,O,(hBA),C,O,(hA,vG),O,O,(hBF),I,O,O,O,X,X,X,(hG),O,O,X','6,X,X,(vEC),(vD),X,X,X,(hD,vH),O,O,(vIB),X,(hIA),O,O,O,O,(vE),(hII),O,F,(hII,vIG),O,O,X,(hIH),O,O,O,O,X,X,(hIA),O,D,X','6,X,X,X,X,(vEH),(vEG),X,X,X,(hEB,vEF),O,O,X,X,(hAC,vG),O,B,O,X,(hEE,vEC),O,D,O,X,(hEE),O,O,O,X,X,(hEJ),D,O,X,X,X','6,X,(vD),(vB),X,X,X,(hA),O,O,(vE),X,X,(hE),A,O,O,(vCJ),X,X,(hCH),O,A,O,(vCI),X,X,(hB),O,D,O,X,X,X,(hCB),G,O','7,X,X,X,X,(vHJ),(vIF),(vIB),X,X,X,(hIH,vJI),O,O,J,X,X,(hIA),O,O,O,F,X,X,(hIG),O,C,X,X,X,(vD),(hA,vIB),O,J,X,X,(hHB),O,O,O,O,X,X,(hHB),O,O,O,X,X,X','7,X,X,X,(vBJ),(vIB),X,X,X,(vIF),(hBB,vBB),O,O,(vBA),X,(hIC),O,O,O,O,O,(vBA),(hBD),O,O,(hC,vC),O,O,O,(hBJ),E,O,O,(hBC,vBI),G,H,X,(hBA),O,O,O,O,O,X,X,(hBF),O,O,X,X','7,X,(vHI),(vHE),X,X,X,X,(hA),O,O,X,X,X,X,(hHG),O,O,(vHH),(vHE),(vIJ),X,(hHA),O,O,O,O,O,(vHI),X,(hID),H,O,O,B,I,X,X,X,X,(hHB),F,O,X,X,X,X,(hHE),O,H','6,X,X,(vAJ),(vAJ),X,X,X,(hAF,vAA),G,A,X,X,(hDA),O,O,O,(vDE),(vAH),(hAJ),O,O,O,O,I,X,X,(hAG),D,C,O,X,X,(hAI),O,O,X','6,X,X,X,X,(vDH),(vDA),X,X,X,(hG,vDG),O,E,X,X,(hBJ,vBC),O,O,O,X,(hBI,vE),O,E,O,X,(hE),O,O,O,X,X,(hDH),O,E,X,X,X','6,X,X,X,X,(vHJ),(vHH),X,X,X,(hHE,vCC),O,O,X,X,(hF,vG),A,O,O,X,(hHC,vHJ),O,B,O,X,(hHH),O,O,O,X,X,(hHI),O,O,X,X,X','7,X,(vJ),(vDG),X,X,(vDF),(vEF),(hC),E,B,X,(hEA),O,O,(hEE),C,O,(vH),(hED,vEF),A,O,X,(hEC),O,O,O,O,X,X,(hDD,vEF),O,O,O,O,(vEA),(hEJ),O,F,X,(hJ),O,O,(hEF),O,O,X,(hEF),O,O','7,X,X,X,(vCC),(vD),X,X,X,(vJE),(hI,vCH),O,O,(vBF),X,(hCC),O,O,O,O,A,(vJB),(hCB),G,O,O,(hJA,vJF),O,O,(hJA),O,O,(hG,vH),O,O,O,X,(hCE),O,O,O,O,O,X,X,(hH),O,O,X,X','7,X,X,(vEI),(vEB),(vG),X,X,X,(hEF),E,O,O,(vHE),X,X,(hEF,vH),O,O,O,O,(vEI),(hH),O,O,X,(hEH),O,B,(hG),O,O,(vG),(hEI,vED),O,O,X,(hAG),C,O,O,O,X,X,X,(hEE),O,O,O,X','6,X,X,X,X,(vJE),(vF),X,X,X,(hI,vJJ),O,O,X,X,(hEC,vJJ),H,O,O,X,(hF,vJB),O,O,O,X,(hJI),A,C,E,X,X,(hJD),O,J,X,X,X','6,X,X,X,(vH),(vAE),X,X,X,(hCB,vCJ),O,O,(vCB),X,(hCA,vD),O,O,O,O,(hD),C,O,(hCC,vJ),O,O,(hAB),A,O,F,O,X,X,(hB),G,O,X,X','6,X,X,(vEC),(vEG),X,X,X,(hEF),O,O,(vFC),(vEI),X,(hHJ,vJ),E,O,O,A,(hJ),O,O,(hEA,vEA),O,O,(hHH),O,O,O,B,X,X,X,(hEF),O,O,X','7,X,(vEI),(vEC),X,X,X,X,(hH),O,O,X,X,X,X,(hED),O,O,(vEB),(vEG),(vGB),X,(hEJ),O,O,O,O,O,(vD),X,(hIA),O,O,O,O,C,X,X,X,X,(hA),O,I,X,X,X,X,(hEB),A,O','7,X,X,X,(vF),(vG),(vIB),X,X,(vG),(hBA,vIH),J,I,D,X,(hBG),O,O,O,O,O,(vBG),(hA),O,O,X,(hE),O,O,(hBB),O,C,(vA),(hBI,vBE),O,O,X,(hBA),O,O,O,O,O,X,(hBF),O,O,O,X,X','7,X,X,(vEF),(vDI),X,X,X,X,(hDG),O,O,(vDA),X,X,X,(hEA,vG),O,O,O,(vEJ),(vJ),(hF),O,G,(hDH,vDI),O,O,F,(hED),O,O,O,(hDD,vB),O,O,X,X,(hDB),O,O,A,X,X,X,X,(hH),O,O,X','7,X,X,X,X,(vJH),(vD),(vAJ),X,X,X,(hAC,vDH),O,O,O,X,X,(hAA),O,O,O,O,X,X,(hC),F,O,X,X,X,(vC),(hAJ,vAA),I,H,X,X,(hJA),O,D,O,G,X,X,(hJB),O,C,O,X,X,X','6,X,X,X,(vDC),(vG),X,X,X,(hA),O,O,(vCH),X,(vCI),(hCB,vB),O,O,O,(hDF),O,H,O,O,O,(hH),O,O,O,X,X,X,(hH),J,O,X,X','6,X,X,(vCG),(vGA),X,X,X,(hE),O,O,(vGG),(vGB),X,(hCI,vF),O,O,O,I,(hGI),O,O,(hI,vD),O,A,(hGH),O,B,O,O,X,X,X,(hA),O,O,X','6,X,X,X,(vJ),(vHF),X,X,(vF),(hHG,vHD),O,A,X,(hHI),A,O,O,O,(vHE),(hB),G,O,(hD,vHE),O,F,X,(hGJ),O,O,O,O,X,(hHD),O,O,X,X','6,X,X,X,X,(vBD),(vD),X,X,X,(hD,vBB),O,O,X,X,(hI,vHD),O,O,O,X,(hHD,vBE),O,O,A,X,(hHF),C,O,G,X,X,(hBI),O,O,X,X,X','7,X,(vJ),(vFB),(vDB),X,X,X,(hFC),O,O,O,(vFE),X,X,(hFB),O,O,O,O,X,X,X,X,(hG),I,O,X,X,X,X,(hA),O,O,(vFG),(vE),X,X,(hDD),O,O,O,A,X,X,X,(hFD),D,E,J','6,X,X,X,(vAD),(vAH),X,X,(vB),(hF,vEB),O,O,X,(hED),O,O,O,O,(vD),(hD),O,O,(hJ,vI),O,O,X,(hEH),O,A,O,C,X,(hB),G,O,X,X','6,X,X,X,X,(vFG),(vFB),X,X,X,(hFD,vB),O,O,X,X,(hFG,vFG),O,O,O,X,(hI,vH),O,O,C,X,(hGA),E,H,O,X,X,(hD),O,G,X,X,X','7,X,X,X,(vBH),(vBB),X,X,X,X,(hBJ,vBJ),I,O,(vHE),(vI),X,(hBF,vBA),O,O,O,O,O,(hBE),O,D,X,(hA),O,O,(hBC),O,O,(vA),(hBB,vBH),O,O,(hDA),B,H,O,O,O,X,X,X,(hI),O,O,X,X','7,X,X,X,(vEC),(vD),X,X,X,(vJ),(hEB,vEJ),O,O,X,X,(hFC),O,O,O,F,(vEG),X,(hG),O,O,(hH,vFI),O,E,(vEH),X,(hEB),A,O,(hED,vJ),O,O,X,X,(hFI),O,O,O,O,X,X,(hED),O,O,X,X','6,X,(vGH),(vGG),X,X,X,(hGE),O,O,(vFI),(vGJ),X,(hGF),O,O,D,O,X,X,(hGB),O,C,O,(vGG),X,(hFG),O,O,O,O,X,X,X,(hE),O,I','7,X,X,X,(vF),(vGI),X,X,X,(vJ),(hB,vGA),H,G,X,X,(hHF),O,O,O,A,(vHH),X,(hB),O,O,(hGB,vGA),C,O,(vC),X,(hGC),O,O,(hGI,vGF),O,O,X,X,(hHB),O,E,O,O,X,X,(hA),O,O,X,X','7,X,X,X,X,X,(vED),(vIG),X,X,X,X,(hEC),O,O,X,X,(vAC),(vA),(hH,vEG),O,O,X,(hAE,vB),O,O,H,O,O,(hIJ),O,O,O,B,O,X,(hEC),O,O,X,X,X,X,(hEI),O,O,X,X,X,X','7,X,X,(vAI),(vAA),X,X,X,X,(hAD,vAG),O,O,(vAE),X,X,(hAH),O,O,O,O,(vBH),(vD),(hG),O,O,(hI,vE),O,O,O,(hAI),O,O,O,(hG,vAC),D,F,X,X,(hAH),O,O,O,O,X,X,X,(hAJ),O,O,X','7,X,X,(vGD),(vFB),(vJ),X,X,X,(hGD),O,O,O,(vFA),(vGG),X,(hFA),O,O,O,O,O,X,(hGE,vGF),O,O,(hH,vFB),O,O,(hH),O,G,(hGC,vD),O,G,X,(hEB),O,O,O,O,O,X,X,X,(hGC),O,A,O,X','6,X,X,(vAD),(vEE),X,X,X,(hEC),G,O,(vAJ),(vH),X,(hEC,vEG),O,A,O,O,(hEG),F,O,(hEG,vEG),O,O,(hAB),O,E,F,A,X,X,X,(hEG),O,O,X','6,X,X,X,X,(vIB),(vJ),X,X,X,(hB,vIJ),O,O,X,X,(hE,vIF),O,O,C,X,(hFC,vIF),O,A,O,X,(hG),O,O,H,X,X,(hIJ),O,O,X,X,X','6,X,X,X,(vIB),(vEB),X,X,X,(hD,vAE),O,O,(vE),X,(hIJ,vE),O,O,O,O,(hII),O,O,(hJ,vC),H,O,(hAE),O,O,G,J,X,X,(hC),O,O,X,X','6,X,X,(vFF),(vB),X,X,X,(hC,vI),O,J,(vJE),X,(hJJ),O,O,I,G,(vA),(hJJ),O,O,(hJD,vJE),O,O,X,(hJB),O,O,F,O,X,X,(hJH),C,J,X','7,X,X,X,(vEI),(vJI),X,X,X,X,(hJA),O,O,(vJE),(vJJ),X,X,(hJI,vJB),O,E,O,D,X,(hJI,vC),O,H,(hJB,vJE),O,O,(hB),O,O,(hF,vD),O,O,X,(hJB),O,O,O,O,X,X,X,X,(hJE),O,O,X,X','7,X,(vJB),(vFD),X,X,(vFE),(vH),(hJF),O,O,X,(hH),O,O,(hJC),O,O,(vH),(hJF,vJF),O,O,X,(hJI),H,O,O,O,X,X,(hFJ,vJJ),J,O,O,O,(vJA),(hA),G,O,X,(hJF),O,C,(hJC),O,O,X,(hD),O,O','7,X,(vI),(vDH),X,X,X,X,(hB),O,I,X,X,X,X,(hC),O,O,(vA),(vI),(vDJ),X,(hDH),O,B,O,O,O,(vDH),X,(hGG),O,O,O,J,O,X,X,X,X,(hHH),B,O,X,X,X,X,(hHE),O,O','6,X,X,(vDI),(vE),X,X,X,(hA,vDA),E,O,(vHI),X,(hHI),F,A,O,O,(vDF),(hDD),O,O,(hDJ,vDJ),O,O,X,(hDG),O,O,H,O,X,X,(hB),O,D,X','6,X,(vJ),(vDH),X,X,X,(hDA),G,O,(vDA),(vDB),X,(hDB),O,O,I,F,X,X,(hG),O,F,O,(vDI),X,(hED),G,O,O,F,X,X,X,(hDE),O,H','6,X,X,(vCJ),(vD),X,X,X,(hG),O,O,(vAD),(vAE),X,(hCC,vI),O,O,A,O,(hJ),O,F,(hAD,vAD),I,H,(hCD),O,O,O,F,X,X,X,(hAJ),O,G,X','7,X,X,X,X,(vEF),(vEC),(vF),X,X,X,(hED,vEB),O,O,O,X,X,(hEB),O,O,O,O,X,X,(hC),O,D,X,X,X,(vI),(hB,vEE),O,O,X,X,(hEB),E,H,D,O,X,X,(hHJ),O,G,O,X,X,X','7,X,X,X,X,(vJF),(vIC),X,X,X,(vIA),(hD,vJE),O,O,X,X,(hIJ,vD),J,O,O,D,(vG),(hJC),I,O,O,(hJA,vC),O,O,(hJF),J,C,(hJF,vJE),O,O,O,X,(hIB),O,O,O,O,X,X,(hJF),O,O,X,X,X','6,X,(vH),(vJE),X,X,X,(hC),J,O,(vJJ),(vJC),X,(hJJ),A,I,O,H,X,X,(hD),O,O,A,(vC),X,(hAI),F,B,O,O,X,X,X,(hC),J,O','7,X,(vA),(vEE),X,X,(vD),(vF),(hEC),O,O,(vIH),(hI,vEB),O,O,(hBD),O,O,O,O,F,O,X,X,(hA),O,O,X,X,X,(vJ),(hEJ,vEG),F,O,(vA),(vG),(hBG),O,O,O,O,O,O,(hEH),O,O,X,(hG),O,O','6,X,X,X,(vFG),(vFC),X,X,(vE),(hFE,vFF),A,O,X,(hBF),O,O,O,O,(vH),(hE),O,O,(hD,vFF),I,O,X,(hFF),O,O,E,D,X,(hFI),O,O,X,X','6,X,X,(vHA),(vFH),X,X,X,(hFF),O,O,(vFH),(vE),X,(hDI,vFG),O,O,O,O,(hFG),B,O,(hC,vFB),O,O,(hDC),O,G,O,F,X,X,X,(hFF),O,O,X','7,X,X,(vBE),(vBB),(vA),X,X,X,(hH),O,O,O,(vBA),(vH),X,(hGI,vBB),O,J,O,O,O,(hBG),O,O,X,(hI),O,O,(hC),O,O,(vBG),(hE,vBD),H,C,(hBI),O,O,O,O,O,X,X,X,(hGG),O,O,O,X','7,X,X,X,X,X,(vHC),(vF),X,X,X,X,(hF,vC),O,E,X,X,(vEJ),(hEF,vEG),F,O,H,X,(hHD),C,O,O,O,X,X,(hHC,vI),A,O,O,O,X,(hJ),D,O,O,X,X,X,(hF),O,O,X,X,X,X','6,X,X,(vH),(vDC),X,X,X,(hCI,vCD),O,O,X,X,(hH),O,O,O,(vCA),(vCB),(hCJ),O,I,O,D,E,X,X,(hDI),E,H,O,X,X,(hG),O,O,X','7,X,X,X,X,(vJ),(vHE),X,X,X,X,(hHA,vHF),O,B,(vHE),X,X,(hEC,vHG),O,O,O,O,X,(hHE,vHG),O,O,(hA,vHB),O,O,(hJ),O,O,(hHE,vJ),O,O,X,(hED),O,J,O,O,X,X,X,(hB),O,O,X,X,X','6,X,X,(vJG),(vA),X,X,X,(hI),B,O,(vJC),(vJH),X,(hJH,vJC),O,E,O,O,(hB),O,O,(hJJ,vF),O,O,(hCE),O,O,D,I,X,X,X,(hB),O,H,X','6,X,X,X,X,(vDG),(vHH),X,X,(vDH),(hJ,vHB),O,O,X,(hJF),O,O,O,O,X,(hHF,vE),O,O,O,X,(hDJ),H,O,O,I,X,(hHC),G,O,X,X,X','7,X,(vAI),(vHC),X,X,X,X,(hD),O,G,X,X,(vHI),(vG),(hAJ),O,O,(vB),(hH,vAH),O,O,X,(hHF,vH),O,O,F,O,O,(hCA),O,O,O,O,O,(vF),(hH),O,O,X,(hG),O,O,X,X,X,X,(hAH),O,O','7,X,X,X,X,(vFG),(vFI),X,X,X,X,(hFI,vFB),O,O,(vFJ),X,(vFA),(hFG,vGA),O,B,O,O,(hIB),O,O,O,(hH,vJ),O,O,(hJ),O,O,(hFD,vD),O,C,O,(hII),O,O,O,O,X,X,X,(hE),O,O,X,X,X','7,X,X,X,(vI),(vEG),(vFD),X,X,(vED),(hA,vEB),O,O,O,X,(hJC),O,O,A,O,O,X,(hEG),O,O,(hEG,vEC),O,O,(vB),X,(hH),O,O,(hJ,vEB),O,O,X,(hEI),O,O,O,O,J,X,(hFF),O,H,O,X,X','6,X,X,(vEI),(vEB),X,X,X,(hEC,vB),O,O,(vEB),X,(hHC),J,O,O,F,(vEC),(hH),O,O,(hB,vEC),O,O,X,(hEH),O,O,O,O,X,X,(hEA),D,O,X','6,X,X,(vAF),(vBF),X,X,X,(hBI),O,G,(vAD),(vBD),X,(hBI,vF),O,J,O,E,(hBB),A,G,(hBI,vBI),O,H,(hAJ),B,O,O,O,X,X,X,(hBA),O,O,X','6,X,(vCB),(vJ),X,X,X,(hCE),A,O,(vCI),X,X,(hCG),D,O,O,(vCC),X,X,(hCA),O,O,O,(vB),X,X,(hB),O,E,G,X,X,X,(hG),O,H','7,X,X,X,X,X,(vFI),(vHG),X,X,X,X,(hHJ,vHH),O,O,X,X,(vHC),(hHD,vHG),O,O,O,X,(hHH),O,O,O,O,X,X,(hFE,vHC),O,O,O,D,X,(hHE),H,O,O,X,X,X,(hHE),I,A,X,X,X,X','7,X,X,(vFA),(vC),X,X,X,X,(hE),O,B,(vAC),(vGJ),X,X,(hFF,vG),O,O,O,O,(vAI),(hAA),O,D,(hAB,vAC),O,O,O,(hAH),O,O,O,(hAB,vAB),O,O,X,(hFJ),O,O,O,O,X,X,X,X,(hAH),O,J,X','7,X,X,X,(vIF),(vIB),X,X,X,X,(hID),O,O,(vC),X,X,(vIF),(hIH,vEE),O,O,O,(vII),(hEB),O,O,O,(hIB,vIF),D,J,(hIF),O,O,(hII,vIE),O,O,O,X,(hJ),O,G,O,X,X,X,X,(hIF),O,O,X,X','7,X,(vDJ),(vDB),X,X,X,X,(hDJ),O,O,(vDF),(vCE),(vI),X,(hCH),O,O,O,O,O,X,X,X,(hDC,vDB),O,A,G,X,X,(hFE),O,O,O,(vDJ),(vI),X,(hCF),O,O,O,O,O,X,X,X,X,(hDE),O,O','6,X,X,(vCI),(vJ),X,X,X,(hA),O,E,(vEG),(vCC),X,(hEG,vCF),O,O,D,O,(hJ),C,G,(hB,vCC),C,O,(hED),O,O,A,O,X,X,X,(hCD),O,O,X','6,X,X,X,(vG),(vFE),X,X,X,(hG,vBC),O,O,(vBC),X,(hFJ,vC),O,E,O,I,(hG),O,O,(hBF,vBC),O,O,(hEJ),O,O,O,O,X,X,(hBA),D,O,X,X','6,X,X,(vAJ),(vE),X,X,X,(hFH,vH),O,O,(vFA),X,(hFH),O,O,O,O,(vFI),(hI),O,C,(hFI,vFD),O,O,X,(hAC),O,O,I,G,X,X,(hC),O,O,X','6,X,X,X,(vE),(vCJ),X,X,(vFF),(hA,vHJ),C,O,X,(hFC),O,O,O,F,(vD),(hFI),O,O,(hFE,vFJ),O,O,X,(hFG),O,O,O,O,X,(hFD),O,O,X,X','7,X,X,X,(vBJ),(vBI),X,X,X,X,(hA),O,O,(vCH),(vBJ),X,(vCJ),(hCB,vG),H,O,I,B,(hBA),O,O,O,(hBE,vG),O,O,(hBB),F,O,(hBE,vBI),O,O,O,(hBI),O,O,O,O,X,X,X,X,(hBC),O,O,X,X','6,X,X,(vCJ),(vD),X,X,X,(hH),O,O,(vBD),(vJ),X,(hCI,vCH),O,J,F,O,(hCG),O,E,(hA,vCD),O,F,(hBF),O,O,O,O,X,X,X,(hCG),O,O,X','6,X,X,X,X,(vJB),(vG),X,X,X,(hA,vH),I,O,X,X,(hCD,vCG),O,O,B,X,(hCF,vCD),O,O,O,X,(hJD),O,H,O,X,X,(hB),O,O,X,X,X','7,X,(vI),(vEH),X,X,(vCC),(vF),(hG),O,O,X,(hH),O,C,(hJ),O,O,(vAD),(hAG,vG),O,O,X,(hEI),F,O,O,O,X,X,(hAD,vAB),O,O,I,O,(vI),(hG),O,O,X,(hC),O,O,(hAJ),O,O,X,(hAA),O,O','7,X,X,X,X,X,(vEC),(vEA),X,X,X,X,(hB),O,O,X,X,(vDF),(vEH),(hEC,vH),H,O,X,(hEA,vI),O,B,E,O,O,(hDB),E,J,O,D,O,X,(hEH),O,A,X,X,X,X,(hI),O,O,X,X,X,X','6,X,X,X,(vBC),(vBC),X,X,X,(hBJ,vEC),H,O,(vBB),X,(hBE,vA),D,J,O,O,(hC),O,O,(hBE,vBG),O,O,(hEG),H,O,B,O,X,X,(hBI),O,O,X,X','7,X,(vE),(vCF),X,X,X,X,(hJ),O,O,(vFB),X,X,X,(hCJ),O,O,A,(vFE),(vCA),X,X,(hIH),O,O,O,O,X,X,(hFF),O,O,O,B,(vFA),X,X,X,(hCI),O,O,O,X,X,X,X,(hFG),O,O','7,X,X,X,X,(vBH),(vH),X,X,X,X,(hI),O,O,(vE),X,X,X,(hJG,vBF),O,O,O,X,(vH),(hBA,vJE),O,O,O,O,(hDG),O,O,O,O,X,X,(hBG),O,F,O,X,X,X,X,(hA),J,O,X,X,X','7,X,X,X,X,X,(vIC),(vA),X,X,X,(vII),(hG,vIH),F,I,X,X,(hIG),O,O,O,D,X,X,(hC,vC),O,O,J,X,X,(hIF,vE),O,G,A,X,X,(hIH),O,O,O,O,X,X,(hJ),F,D,X,X,X,X','7,X,X,X,(vH),(vCJ),X,X,X,(vCG),(hCB,vEG),O,O,X,X,(hEF),O,I,O,O,(vCI),X,(hCD),O,J,(hCB,vCJ),E,O,(vCC),X,(hCE),O,O,(hCI,vH),O,O,X,X,(hEB),O,O,O,O,X,X,(hD),O,O,X,X','6,X,(vGA),(vBE),X,X,X,(hGC),H,O,(vGF),X,X,(hGG),O,O,O,(vGD),X,X,(hBG),O,J,O,(vGD),X,X,(hGD),O,O,E,X,X,X,(hGH),O,O','6,X,X,(vEE),(vEJ),X,X,X,(hI,vEF),O,O,(vEH),X,(hEA),O,O,O,E,(vB),(hEE),O,O,(hB,vB),O,O,X,(hEG),A,O,I,O,X,X,(hA),D,B,X','6,X,(vJ),(vHA),X,X,X,(hHH),D,O,(vHG),X,X,(hI),O,O,F,(vDG),X,X,(hDJ),O,O,O,(vHF),X,X,(hHF),O,O,E,X,X,X,(hHE),B,O','6,X,X,X,X,(vFI),(vE),X,X,X,(hH,vA),J,I,X,X,(hGF,vD),O,O,F,X,(hGF,vC),O,O,A,X,(hD),O,O,O,X,X,(hD),O,O,X,X,X','7,X,X,(vHG),(vE),X,X,X,X,(hGD),O,O,(vGA),(vHC),(vAJ),X,(hGD,vAC),O,O,O,O,O,(hGC),O,O,(hAA,vGC),O,O,O,(hAC),O,O,F,(hGD,vD),O,O,(hHB),O,O,O,O,O,X,X,X,X,(hI),O,D,X','7,X,X,(vBG),(vBJ),X,(vBD),(vE),X,(hC),O,O,(hBB,vAG),O,C,X,(hBE),O,O,O,O,D,X,(hBG),O,O,O,(vBE),X,X,(vE),(hBI,vJ),O,O,O,X,(hCG),F,G,O,O,O,X,(hC),O,O,(hBJ),O,O,X','7,X,X,X,X,X,(vEA),(vJJ),X,X,(vED),(vJI),(hF),O,O,X,(hB),O,O,(hJH,vB),O,O,X,(hED),O,B,O,O,X,X,(hJI,vJI),O,O,C,O,X,(hJH),O,O,(hJJ),O,O,X,(hF),J,E,X,X,X,X','6,X,(vF),(vED),X,X,X,(hEI),O,O,(vEA),X,X,(hEJ),O,O,J,(vB),X,X,(hB),O,O,O,(vG),X,X,(hJ),B,O,C,X,X,X,(hF),O,E','6,X,X,X,X,(vCH),(vCD),X,X,X,(hG,vCH),O,O,X,X,(hCH,vCI),O,O,O,X,(hFA,vCE),O,O,J,X,(hFF),O,O,O,X,X,(hI),F,C,X,X,X','6,X,X,(vCH),(vA),X,X,X,(hE,vE),D,O,(vAG),(vHC),(hHB),O,O,C,O,I,(hHA),O,O,(hE,vJ),O,O,(hCH),A,O,O,O,O,X,X,(hHD),O,O,X','7,X,(vF),(vDG),(vGD),X,X,X,(hA),O,D,O,(vI),(vGE),X,(hDG),O,C,O,O,O,X,(hGC),H,O,(hH,vA),O,O,(vGF),X,(hH),O,O,(hGB,vGD),O,O,X,(hDH),O,D,O,O,O,X,X,X,(hA),O,O,G','7,X,X,X,X,(vIG),(vIG),X,X,X,X,(hCJ),O,O,(vCE),X,X,X,(hIE,vEA),O,O,O,X,(vJ),(hEA,vIE),O,O,O,O,(hCH),O,F,O,O,X,X,(hCH),I,B,O,X,X,X,X,(hCH),O,O,X,X,X','7,X,X,X,X,(vJ),(vDB),X,X,X,X,(hDG,vH),O,O,X,X,(vB),(hJ,vEB),E,O,O,(vG),(hDJ),O,F,D,(hI,vDC),O,O,(hA),O,O,(hJ,vA),O,O,I,X,(hDA),O,O,O,X,X,X,(hDH),O,O,X,X,X','6,X,X,X,(vEE),(vJA),(vEI),X,X,(hD,vEE),O,F,O,X,(hED,vEC),O,O,O,O,(hJ),O,O,(hEH,vEI),O,O,(hIB),O,O,O,O,X,(hII),O,O,O,X,X','6,X,(vE),(vGH),X,X,X,(hC),O,J,(vFJ),X,X,(hGH),O,O,O,(vJ),X,X,(hFA),B,O,I,(vFF),X,X,(hFG),O,O,O,X,X,X,(hB),F,G','6,X,X,(vIF),(vIJ),X,X,X,(hD,vIC),O,O,X,X,(hIB),O,O,O,(vIG),(vA),(hBF),O,O,F,I,O,X,X,(hE),D,O,F,X,X,(hIF),O,C,X','7,X,(vCD),(vB),X,X,X,X,(hII),O,D,(vA),X,X,X,(hIJ),O,O,O,(vII),X,X,(hID),O,O,O,O,(vIJ),(vCJ),X,X,(hCA),H,O,F,O,X,X,X,(hA),O,O,G,X,X,X,X,(hII),J,O','7,X,(vC),(vFF),X,X,(vHF),(vD),(hFD),O,O,(vHG),(hA,vFJ),O,O,(hHF),O,O,O,O,O,O,X,X,(hFG,vFH),O,O,O,X,X,(hFB,vI),O,O,O,(vFB),(vB),(hIG),O,O,O,O,D,J,(hG),O,I,X,(hFE),O,O','7,X,(vHJ),(vDE),X,X,(vDI),(vHH),(hHG),O,J,(vHJ),(hJ),O,O,(hHE),O,O,O,(hHJ,vB),O,O,X,(hHH),O,O,O,O,X,X,(hDJ,vHA),D,O,E,O,(vF),(hHJ),O,O,(hA),O,O,E,(hHA),O,O,X,(hI),O,O','7,X,(vEH),(vFA),X,X,X,X,(hEB),O,O,(vFA),X,X,X,(hFD),O,O,O,(vEE),(vID),X,X,(hFB),O,O,O,O,X,X,(hFJ),O,O,O,O,(vEE),X,X,X,(hJ),O,B,O,X,X,X,X,(hEH),C,O','6,X,(vJ),(vE),X,X,X,(hA),B,C,(vCJ),X,X,(hCG),O,O,O,(vCD),X,X,(hHF),O,O,O,(vJ),X,X,(hE),O,O,H,X,X,X,(hCE),O,O','6,X,(vGC),(vGH),X,X,X,(hGG),O,O,(vGB),X,X,(hGI),E,O,I,(vGG),X,X,(hIJ),O,C,O,(vA),X,X,(hD),G,O,O,X,X,X,(hD),O,O','6,X,X,X,X,(vIG),(vII),X,X,X,(hE,vIA),I,G,X,X,(hGJ,vGF),O,C,O,X,(hIE,vII),D,O,O,X,(hGJ),O,B,O,X,X,(hA),O,J,X,X,X','6,X,X,X,X,(vIA),(vE),X,X,(vJB),(hB,vII),I,J,X,(hIF),O,O,O,H,X,(hIB,vG),D,J,O,X,(hJG),C,O,O,F,X,(hB),O,O,X,X,X','7,X,X,X,(vDB),(vGG),X,X,X,X,(hGH),O,O,(vGA),(vGA),X,X,(hGF,vGA),O,O,O,O,X,(hGA,vGE),B,O,(hGD,vI),O,O,(hJ),O,I,(hGE,vGG),O,O,X,(hDA),O,D,O,O,X,X,X,X,(hF),O,O,X,X','6,X,X,X,(vFB),(vI),X,X,X,(hGF),O,O,(vGA),X,(vH),(hGA,vFD),O,O,O,(hFF),O,A,O,O,C,(hGG),O,J,O,X,X,X,(hGH),O,D,X,X','6,X,X,(vGA),(vA),X,X,X,(hB,vGE),O,O,(vHJ),X,(hBD),O,O,O,O,(vGH),(hGC),O,O,(hGJ,vGE),O,O,X,(hGG),O,F,O,O,X,X,(hGC),O,O,X','7,X,X,(vCE),(vG),(vI),X,X,X,(hEE),A,O,E,(vCD),(vCH),X,(hEG,vCD),O,O,O,O,O,(hA),G,C,X,(hEH),O,O,(hEE),O,O,(vI),(hA,vD),O,O,(hCF),O,O,O,O,O,X,X,X,(hED),O,O,B,X','7,X,(vG),(vDC),X,(vBA),(vDG),X,(hJ),O,G,(hDA,vBA),O,O,X,(hBC),O,O,G,O,O,X,X,(hDH),O,O,O,(vG),X,X,X,(hG,vDI),O,O,O,(vJ),X,(hBB),E,O,O,O,O,X,(hH),O,J,(hB),O,O','6,X,X,X,(vJG),(vCG),X,X,(vJG),(hJB,vJH),O,O,X,(hJH),I,B,O,O,(vD),(hJB),O,O,(hA,vJG),O,O,X,(hJB),O,B,O,O,X,(hF),I,C,X,X','7,X,(vA),(vE),X,X,(vD),(vB),(hF),O,O,(vJJ),(hI,vGD),O,O,(hGD),O,O,O,O,I,O,X,X,(hJI),O,O,X,X,X,(vJE),(hA,vF),I,O,(vD),(vJJ),(hGA),O,O,O,J,O,O,(hH),O,O,X,(hI),O,O','7,X,X,(vEH),(vEF),X,X,X,X,(hEI,vIH),O,O,(vEI),X,X,(hEI),O,O,O,O,(vIE),(vEJ),(hD),O,O,(hEH,vH),O,O,O,(hEC),O,O,O,(hD,vC),H,G,X,X,(hIA),O,O,O,O,X,X,X,(hD),E,O,X','7,X,X,X,X,X,(vEA),(vCJ),X,X,X,X,(hCD,vCC),O,O,X,X,(vCI),(hCJ,vEH),O,O,O,X,(hDH),O,J,B,O,X,X,(hCH,vD),O,O,O,O,X,(hCJ),O,O,O,X,X,X,(hJ),O,G,X,X,X,X','7,X,(vB),(vFF),X,(vEI),(vFE),X,(hH),O,O,(hFC,vIB),G,O,X,(hFC),O,O,O,O,O,X,X,X,(hFH),O,D,X,X,X,X,(hFF,vFG),O,O,(vFE),(vFH),X,(hEE),O,O,J,O,O,X,(hFG),O,O,(hFG),O,O','6,X,(vHE),(vII),X,X,X,(hHB),O,O,(vHF),(vHJ),X,(hHD),B,O,O,O,X,X,(hG),H,O,O,(vHE),X,(hCA),O,O,E,B,X,X,X,(hHB),O,G','6,X,(vH),(vAF),X,X,X,(hAC),O,O,(vAD),X,X,(hDI),J,O,O,(vAH),X,X,(hAC),O,O,O,(vAI),X,X,(hH),O,O,B,X,X,X,(hAH),O,E','6,X,(vC),(vHA),X,X,X,(hC),O,J,(vHA),X,X,(hF),J,O,O,(vHC),X,X,(hI),O,J,O,(vF),X,X,(hEJ),O,O,B,X,X,X,(hG),O,O','6,X,X,X,(vFJ),(vJC),X,X,(vFF),(hFF,vJE),O,O,X,(hFH),O,F,O,O,(vD),(hFI),O,C,(hE,vH),D,O,X,(hJC),O,O,O,A,X,(hFG),O,J,X,X','7,X,X,X,X,X,(vDE),(vBB),X,(vC),(vDF),X,(hBF),O,O,(hH),O,O,(vE),(hH,vBI),B,O,(hDF),O,O,O,O,D,(vE),X,(hDI,vBE),O,O,C,O,B,(hBF),O,A,X,(hG),E,D,(hG),O,O,X,X,X,X','7,X,(vJ),(vFH),X,X,X,X,(hHH),F,A,X,X,(vGE),(vA),(hI),O,O,(vC),(hF,vD),O,O,X,(hHC,vF),H,O,O,O,O,(hGJ),O,O,O,O,O,(vE),(hE),O,O,X,(hHI),O,O,X,X,X,X,(hA),O,O','7,X,X,(vCD),(vCB),(vF),X,X,X,(hCA,vCJ),O,O,O,(vFH),X,(hCD),O,O,O,O,O,(vCB),(hH),O,O,X,(hI),O,O,(hCE),O,B,(vCE),(hCH,vCI),O,G,X,(hFA),O,G,O,O,O,X,X,(hBC),H,O,O,X','6,X,X,X,X,(vHD),(vHH),X,X,X,(hA,vHH),H,I,X,X,(hHJ,vIG),O,C,O,X,(hHC,vE),O,O,O,X,(hIG),J,O,O,X,X,(hHF),O,O,X,X,X','6,X,X,(vFD),(vJB),X,X,X,(hH,vH),O,O,(vJD),X,(hFH),O,O,O,O,(vJI),(hJD),O,O,(hJD,vG),J,E,X,(hJD),O,O,O,O,X,X,(hB),A,O,X','6,X,X,X,(vC),(vDC),X,X,(vF),(hHB,vDI),O,O,(vDJ),(hDG),O,O,E,O,O,(hHA),O,O,(hHD,vG),O,O,(hEJ),O,O,F,O,O,X,(hJ),O,O,X,X','7,X,X,X,X,X,(vEJ),(vG),X,X,X,X,(hD,vI),C,O,X,X,(vEG),(hFE,vFE),O,O,O,X,(hFD),O,O,O,O,X,X,(hEC,vFI),O,O,O,O,X,(hEC),B,O,H,X,X,X,(hJ),O,O,X,X,X,X','7,X,(vI),(vAC),X,X,(vAI),(vCG),(hB),O,I,X,(hCB,vCD),O,O,(hH),A,D,(hCD,vAF),O,O,O,X,(hAC),O,O,O,O,X,X,(hCF,vCC),O,O,O,O,(vB),(hCB),O,O,O,(hCF),O,O,(hCB),O,J,X,(hB),O,O','6,X,X,X,(vJB),(vIG),X,X,(vA),(hJI,vJC),O,F,X,(hJB),O,O,O,O,(vJE),(hJD),B,O,(hJB,vD),O,H,X,(hJG),O,I,O,O,X,(hA),O,E,X,X','7,X,X,X,X,(vCD),(vCC),(vB),X,X,X,(hCC,vEC),O,I,O,X,X,(hCH),C,O,O,O,X,X,(hCA),F,O,X,X,X,(vA),(hCH,vCE),O,E,X,X,(hGA),C,O,O,O,X,X,(hCE),O,O,O,X,X,X','6,X,X,X,X,(vJI),(vA),X,X,(vJH),(hJE,vJI),O,G,X,(hJE),F,O,O,D,X,(hC,vB),O,E,O,X,(hJH),O,O,O,O,X,(hJD),O,E,X,X,X','6,X,X,X,X,(vAJ),(vAJ),X,X,X,(hAF,vGB),O,O,X,X,(hAE,vD),O,O,O,X,(hAJ,vF),O,J,O,X,(hAF),O,O,H,X,X,(hB),O,I,X,X,X','7,X,X,X,X,(vH),(vIE),X,X,X,X,(hA,vA),O,O,X,X,(vID),(hF,vCH),O,O,A,(vIE),(hIH),O,O,O,(hIA,vIH),O,O,(hIE),O,O,(hIG,vIA),B,O,O,X,(hIF),O,G,A,X,X,X,(hIE),O,D,X,X,X','7,X,(vEF),(vB),(vFC),X,X,X,(hH),O,O,O,(vEA),X,X,(hED),C,O,O,O,X,X,X,X,(hEG),O,F,X,X,X,X,(hEI),O,O,(vEH),(vI),X,X,(hFH),O,O,O,O,X,X,X,(hEE),O,I,O','6,X,(vHI),(vDG),X,X,X,(hHE),J,O,(vDG),X,X,(hHC),H,O,O,(vHA),X,X,(hDH),F,O,G,(vHE),X,X,(hHC),O,O,O,X,X,X,(hHE),O,O','6,X,X,(vAD),(vAE),X,X,X,(hAA),O,O,(vAD),(vAA),X,(hAI,vI),O,F,D,J,(hC),A,O,(hB,vJ),A,E,(hAB),O,I,C,J,X,X,X,(hI),O,H,X','6,X,X,(vDA),(vE),X,X,X,(hJ,vDE),O,F,(vGG),X,(hDJ),O,O,O,O,(vC),(hDD),O,O,(hJ,vI),O,O,X,(hGG),O,D,O,O,X,X,(hDA),G,B,X','7,X,X,(vJD),(vG),(vI),X,X,X,(hG),O,O,H,(vEB),(vEF),X,(hEB),O,O,B,O,J,X,(hEJ,vA),O,H,(hEE,vEA),O,O,(hA),O,O,(hEJ,vG),O,O,X,(hJF),O,O,O,O,O,X,X,X,(hG),F,O,O,X','6,X,X,X,X,(vEJ),(vG),X,X,X,(hDE,vF),O,O,X,X,(hDJ,vF),O,O,O,X,(hA,vDA),O,O,O,X,(hDI),B,O,O,X,X,(hDE),C,O,X,X,X','6,X,X,(vAC),(vD),X,X,X,(hD,vEI),O,O,(vBC),X,(hBA),O,O,O,O,(vH),(hEF),O,O,(hEI,vF),O,O,X,(hEF),O,O,A,O,X,X,(hEE),G,D,X','6,X,X,(vGB),(vD),X,X,X,(hGG),A,C,(vGJ),(vC),X,(hGG,vGC),O,O,O,J,(hGH),O,O,(hE,vI),G,H,(hHF),O,H,O,O,X,X,X,(hE),O,O,X','6,X,X,(vIJ),(vCD),X,X,X,(hCD),O,O,(vCI),(vCG),X,(hIH,vCC),G,O,O,O,(hCE),O,I,(hCH,vCD),G,O,(hIC),B,D,O,O,X,X,X,(hA),O,O,X','7,X,(vII),(vDH),(vID),X,X,X,(hIG),O,O,O,X,X,X,(hDA),O,C,J,(vII),X,X,X,(hID),F,O,O,(vDH),X,X,X,(hID),O,O,O,(vID),X,X,X,(hIE),A,O,O,X,X,X,(hDD),O,O,O','7,X,(vEB),(vF),X,X,X,X,(hED),O,O,(vAJ),(vED),(vD),X,(hIB),O,O,O,G,O,X,X,X,(hF,vA),O,O,O,X,X,(hED),O,O,F,(vA),(vEB),X,(hIE),O,H,O,O,O,X,X,X,X,(hEE),O,O','7,X,X,X,X,(vCA),(vCE),(vB),X,X,X,(hF),O,O,O,X,X,X,(hJG,vCD),I,O,O,X,X,(hF,vB),O,O,O,X,X,(hJI,vCI),O,F,O,X,X,(hD),O,O,O,X,X,X,(hCI),O,O,O,X,X,X','6,X,(vJI),(vI),X,X,X,(hH),O,O,(vD),X,X,(hJA),F,O,O,(vJH),X,X,(hJI),C,G,O,(vJJ),X,X,(hD),O,O,O,X,X,X,(hJE),O,O','6,X,X,X,(vDC),(vAE),X,X,X,(hI),O,B,(vI),X,(vC),(hJ,vDE),O,O,O,(hAF),A,D,O,O,O,(hI),O,O,G,X,X,X,(hDA),H,O,X,X','7,X,X,X,(vFD),(vAF),X,X,X,(vFD),(hFE,vFA),B,O,X,X,(hHI),O,O,O,O,(vFF),X,(hFI),O,O,(hC,vG),O,H,(vFA),X,(hE),O,O,(hFB,vC),O,O,X,X,(hFJ),O,G,O,O,X,X,(hH),O,O,X,X','7,X,X,X,X,(vD),(vHD),X,X,X,(vDH),(hA,vJJ),O,O,(vE),X,(hHB,vJH),O,O,O,E,J,(hJE),H,O,O,(hD,vF),O,O,(hJG),E,O,(hJE,vJG),C,O,O,(hHH),J,O,O,O,O,X,X,(hJJ),O,O,X,X,X','7,X,X,X,X,(vBA),(vEB),X,X,X,(vBG),(hC,vBB),O,O,X,X,(hBD,vBA),O,O,O,O,(vBJ),(hBC),O,O,O,(hBG,vBD),A,O,(hBB),O,O,(hEE,vBF),O,O,D,X,(hBJ),O,O,O,I,X,X,(hBD),O,O,X,X,X','7,X,X,X,X,X,(vDG),(vC),X,(vB),(vFH),X,(hC),E,O,(hA),O,O,(vDD),(hH,vDB),O,O,(hDA),C,O,O,O,O,(vE),X,(hFH,vDE),O,O,H,O,F,(hDH),O,O,X,(hDI),O,O,(hJ),O,O,X,X,X,X','6,X,(vB),(vE),X,X,X,(hA),D,O,(vA),X,X,(hH),O,C,O,(vIG),X,X,(hDI),O,O,O,(vDF),X,X,(hIF),O,O,O,X,X,X,(hH),O,O','7,X,(vHF),(vC),X,X,(vC),(vHF),(hC),O,O,(vBC),(hA,vBF),O,O,(hBE),O,O,O,O,O,O,X,X,(hHD),A,O,X,X,X,(vD),(hJ,vHA),O,O,(vHI),(vC),(hCH),J,O,O,O,O,B,(hHH),O,O,X,(hE),O,O','6,X,X,X,(vJ),(vDA),X,X,(vFD),(hB,vFE),O,O,(vDA),(hDJ),O,O,O,O,O,(hDE),O,O,(hDA,vC),O,H,(hBA),O,I,O,G,O,X,(hJ),E,O,X,X','6,X,(vGA),(vA),X,X,X,(hGE),O,O,(vGD),X,X,(hGA),O,G,A,(vED),X,X,(hGE),O,O,O,(vGD),X,X,(hEB),C,H,F,X,X,X,(hGE),A,I','6,X,(vIC),(vFD),X,X,X,(hIG),O,C,(vIB),X,X,(hFJ),O,O,O,(vII),X,X,(hIE),O,O,F,(vIA),X,X,(hIJ),F,I,O,X,X,X,(hIC),O,O','6,X,X,X,(vJG),(vHH),X,X,X,(hHA),O,O,(vHD),X,(vE),(hJF,vHJ),O,O,O,(hHB),F,O,D,O,O,(hE),O,J,O,X,X,X,(hHE),I,O,X,X','7,X,X,X,(vGG),(vI),(vEC),X,X,(vBH),(hJ,vBI),O,O,O,X,(hBJ),O,O,O,O,O,(vJ),(hGJ),O,O,X,(hA),O,O,(hGC),O,O,(vC),(hGB,vGJ),O,O,X,(hBF),O,O,O,O,B,X,(hBH),O,O,O,X,X','7,X,X,X,X,X,(vD),(vHB),X,X,(vG),(vFC),(hHA,vAI),O,O,X,(hAB),O,O,O,O,O,X,(hAD),O,O,O,(vHB),X,X,(vF),(hAF,vHI),O,O,O,X,(hAB),O,O,O,O,O,X,(hB),O,E,X,X,X,X','6,X,(vBC),(vDF),X,X,X,(hBE),O,O,(vDB),X,X,(hDG),O,J,O,(vC),X,X,(hBI),O,O,O,(vBB),X,X,(hBA),O,O,D,X,X,X,(hBG),F,O','6,X,X,X,(vH),(vDC),(vGA),X,X,(hA,vIE),O,O,O,X,(hIG,vGG),O,O,O,O,(hF),O,O,(hGF,vJ),J,O,(hGA),O,O,O,O,X,(hIE),O,O,O,X,X','6,X,(vHC),(vHJ),X,X,X,(hHC),A,B,(vA),X,X,(hHI),O,O,O,(vHA),X,X,(hD),F,O,O,(vB),X,X,(hII),G,O,O,X,X,X,(hB),O,O','7,X,(vH),(vJA),X,X,(vIE),(vJI),(hJC),O,O,(vDG),(hJE,vIG),O,O,(hDD),I,O,O,O,O,O,X,X,(hII,vIG),O,O,O,X,X,(hIE,vJA),O,O,O,(vB),(vJI),(hDG),C,O,O,O,O,O,(hJF),O,O,X,(hH),O,O','7,X,(vHH),(vBE),X,X,X,X,(hE),B,O,X,(vHF),(vBJ),X,(hHI),C,O,(hJ,vHI),O,O,X,X,(hBC),D,O,O,O,X,X,(hHH),O,O,D,O,(vHF),X,(hHD),F,O,(hHD),G,O,X,X,X,X,(hHE),O,O','7,X,X,X,X,X,(vIF),(vI),X,X,X,X,(hB,vGF),O,O,X,X,(vEG),(hGG,vB),O,O,O,X,(hGJ),O,O,O,H,X,X,(hGA,vA),O,O,O,O,X,(hGC),I,H,O,X,X,X,(hH),G,J,X,X,X,X','7,X,X,X,X,X,(vJF),(vJF),X,X,X,X,(hJD),A,O,X,X,(vBG),(vJB),(hI,vI),O,O,X,(hBD,vJF),F,O,O,E,O,(hIB),O,O,O,O,C,X,(hJG),O,B,X,X,X,X,(hI),O,J,X,X,X,X','6,X,X,(vEI),(vC),X,X,X,(hH,vGG),O,O,(vGD),X,(hBJ),O,O,O,O,(vD),(hGI),O,O,(hD,vD),E,G,X,(hBG),O,O,A,O,X,X,(hJ),O,O,X','7,X,X,X,X,(vFI),(vJF),X,X,X,X,(hJH),O,O,(vJC),X,X,X,(hEE,vEC),O,O,O,X,(vJE),(hED,vEF),O,O,O,G,(hJB),O,O,O,O,X,X,(hEH),O,O,G,X,X,X,X,(hJG),O,O,X,X,X','7,X,X,X,(vJ),(vEI),X,X,X,X,(hJ,vEC),O,A,(vBD),X,X,(hHC,vEA),O,O,O,I,(vF),(hEE),O,O,(hEE,vHD),B,J,O,(hHE),O,O,O,(hG,vED),O,O,X,(hHD),O,O,O,O,X,X,X,(hEA),O,O,X,X','7,X,X,X,X,X,(vFH),(vED),X,X,X,X,(hEC,vEA),O,O,X,X,(vED),(hFI,vEH),O,O,O,X,(hEE),O,O,A,D,X,X,(hFB,vJ),O,O,O,J,X,(hFI),O,O,O,X,X,X,(hI),O,A,X,X,X,X','6,X,(vB),(vHI),X,X,X,(hHH),O,O,(vHJ),(vGA),X,(hHH),O,O,O,I,X,X,(hGE),O,A,O,(vHE),X,(hHJ),H,B,F,D,X,X,X,(hHJ),O,C'
+]
+```
+
 ## --seed-contents--
 
 ```js
-function euler424() {
+function kakuro(puzzles) {
 
   return true;
 }
 
-euler424();
+const testPuzzles = [
+  '6,X,X,(vCC),(vI),X,X,X,(hH),B,O,(vCA),(vJE),X,(hFE,vD),O,O,O,O,(hA),O,I,(hJC,vB),O,O,(hJC),H,O,O,O,X,X,X,(hJE),O,O,X','7,X,X,X,X,(vJJ),(vCD),X,X,X,X,(hCG),O,O,(vCE),X,X,X,(hCI,vJB),C,O,O,X,(vB),(hJF,vJF),O,F,O,O,(hJA),F,G,O,O,X,X,(hCA),O,A,O,X,X,X,X,(hCF),O,O,X,X,X','7,X,X,X,(vE),(vCB),X,X,X,X,(hJ),O,O,(vCA),X,X,(vCH),(hCG,vCJ),O,O,O,(vJ),(hCE),O,O,O,(hJ,vGG),O,O,(hD),I,O,(hCD,vCB),H,O,O,X,(hCE),O,O,E,X,X,X,X,(hCE),O,O,X,X','6,X,X,X,(vEA),(vJF),X,X,X,(hI),O,O,(vJA),X,(vA),(hEI,vEB),O,O,O,(hIG),C,O,J,O,D,(hJD),O,O,O,X,X,X,(hJD),O,O,X,X','7,X,(vH),(vG),X,X,(vI),(vDH),(hG),B,O,(vDI),(hDB,vDE),O,O,(hBC),I,O,F,O,O,J,X,X,(hG),O,O,X,X,X,(vDG),(hH,vDD),O,O,(vDJ),(vC),(hBI),O,O,O,O,O,O,(hDJ),O,O,X,(hA),O,O','6,X,(vID),(vIJ),X,X,X,(hH),F,I,(vF),(vIA),X,(hIA),G,B,O,C,X,X,(hID),O,O,O,(vIF),X,(hIA),E,O,I,O,X,X,X,(hII),O,G','6,X,X,(vAF),(vAI),X,X,X,(hJ,vAC),O,B,(vGJ),X,(hGH),J,O,O,O,(vAF),(hAG),O,O,(hH,vF),A,D,X,(hGF),O,E,O,O,X,X,(hD),O,O,X','7,X,X,X,X,(vCE),(vGB),X,X,(vJG),(vCI),(hCD,vCJ),O,O,X,(hCI),O,O,O,O,B,(vJB),(hCF),O,O,O,(hCA,vH),O,O,(hCJ),O,O,(hJB,vCJ),O,O,O,X,(hJD),O,O,O,O,O,X,(hF),I,O,X,X,X','7,X,(vBB),(vBD),X,X,X,X,(hBB),C,E,(vEE),(vEC),X,X,(hBC),O,O,O,O,X,X,X,(hEF),H,O,A,(vJ),X,X,X,(hBD),O,O,O,(vI),X,X,(hBE),F,O,O,O,X,X,X,X,(hG),O,O','7,X,X,(vGG),(vGD),X,(vI),(vGI),X,(hGB),O,O,(hGH,vIC),O,O,X,(hGA),O,O,O,J,O,X,X,(hGI),O,O,X,X,X,(vGD),(hE,vE),O,O,(vGF),X,(hIH),O,O,O,O,O,X,(hE),A,O,(hGF),O,O,X','6,X,(vIJ),(vIE),X,X,X,(hF),O,C,(vIA),X,X,(hCA),O,O,D,(vIH),X,X,(hIB),E,O,O,(vF),X,X,(hD),O,A,O,X,X,X,(hID),O,G','6,X,(vAD),(vGI),(vI),X,X,(hB),O,O,O,(vAF),X,(hGC),O,O,O,O,(vGA),(hGE),O,O,(hJ,vB),O,O,X,(hGD),D,O,E,O,X,X,(hAI),O,C,O','6,X,X,X,(vAB),(vFA),X,X,X,(hHI),O,O,(vHJ),X,(vA),(hFJ,vHE),I,D,O,(hFH),O,O,O,O,O,(hHJ),O,O,O,X,X,X,(hC),O,J,X,X','7,X,X,X,(vJ),(vEF),X,X,X,X,(hI,vGD),C,E,(vEF),(vA),X,(hEH),O,O,O,O,O,X,(hH,vJ),O,O,(hJ,vEJ),O,O,(hD),O,A,(hEF,vEB),O,O,X,(hCC),O,O,A,O,O,X,X,X,(hH),O,O,X,X','7,X,X,X,(vAG),(vAJ),(vFH),X,X,X,(hFD),O,O,O,X,X,(vH),(hAJ,vAB),O,O,O,(vB),(hAH),O,H,O,(hC,vAI),O,O,(hE),O,O,(hAI,vAE),O,O,O,X,(hJ),O,O,O,X,X,X,(hFG),E,O,O,X,X','7,X,(vAI),(vHB),X,X,(vJE),(vAA),(hD),O,O,X,(hG),O,O,(hAJ),O,O,(vE),(hAA,vAI),O,O,X,(hHF),O,O,O,O,X,X,(hJF,vAE),O,O,O,J,(vH),(hAI),D,O,X,(hB),O,O,(hAG),O,O,X,(hAA),O,O','7,X,X,(vHJ),(vC),(vAF),X,X,X,(hHF),O,O,O,(vHI),(vHD),X,(hHB,vAB),O,O,O,O,E,(hAI),O,O,X,(hAB),O,O,(hD),O,O,(vAB),(hAI,vE),J,O,(hHH),O,O,O,B,O,X,X,X,(hG),O,A,O,X','6,X,X,(vDF),(vHE),X,X,X,(hHJ,vE),C,O,X,X,(hHI),O,O,O,(vDF),(vHH),(hFA),A,O,B,O,O,X,X,(hE),O,I,O,X,X,(hHH),O,O,X','6,X,(vA),(vA),X,X,X,(hE),O,O,(vCJ),X,X,(hG),O,O,O,(vHI),X,X,(hHC),O,O,H,(vB),X,X,(hCE),O,O,D,X,X,X,(hE),O,O','6,X,X,X,X,(vEH),(vEC),X,X,X,(hEB,vEJ),O,O,X,X,(hEC,vEF),O,O,B,X,(hDD,vEI),O,B,C,X,(hB),O,D,A,X,X,(hEC),O,O,X,X,X','6,X,X,X,X,(vIF),(vH),X,X,X,(hIJ,vGJ),B,I,X,X,(hIB,vIC),O,O,G,X,(hIA,vC),O,O,O,X,(hE),O,O,O,X,X,(hIA),E,O,X,X,X','7,X,(vC),(vFB),X,X,X,X,(hFH),O,O,(vFA),(vFJ),(vC),X,(hFJ),O,O,O,O,O,X,X,X,(hA,vJ),O,O,O,X,X,(hG),D,O,O,(vC),(vFC),X,(hBH),A,O,O,O,E,X,X,X,X,(hFH),O,I','6,X,X,(vFD),(vC),X,X,X,(hDH),E,F,(vDG),(vDD),X,(hDF,vDI),O,O,A,O,(hDG),O,O,(hDG,vDG),O,O,(hDJ),O,D,J,O,X,X,X,(hJ),E,O,X','6,X,X,X,(vE),(vGH),(vIC),X,X,(hD,vIG),O,O,A,X,(hIF,vJ),O,J,E,O,(hJ),O,D,(hGG,vGH),O,O,(hGG),O,O,O,O,X,(hIC),O,O,O,X,X','7,X,X,X,X,(vAG),(vJA),(vH),X,X,X,(hAJ,vDJ),O,O,O,X,X,(hJF),O,O,O,O,X,X,(hG),D,O,X,X,X,(vJH),(hJE,vJD),C,I,X,X,(hAE),B,O,O,O,X,X,(hAJ),O,O,E,X,X,X','7,X,X,X,X,(vGG),(vIA),(vGF),X,X,X,(hGF),O,O,D,X,X,X,(hGJ,vIB),O,O,O,X,X,(hGH,vGD),O,O,O,X,X,(hII,vC),O,J,O,X,X,(hIH),J,O,O,X,X,X,(hGE),O,I,O,X,X,X','6,X,X,(vFA),(vEC),X,X,X,(hI,vFI),F,O,X,X,(hDE),O,O,O,(vFF),(vFF),(hDI),G,J,O,F,O,X,X,(hFJ),O,D,O,X,X,(hFH),J,A,X','7,X,X,X,X,X,(vID),(vBB),X,X,X,X,(hBC),O,I,X,X,(vIH),(vBH),(hBF,vF),O,O,X,(hIE,vD),O,O,I,O,O,(hAG),O,O,O,O,F,X,(hA),O,O,X,X,X,X,(hD),O,O,X,X,X,X','7,X,(vCD),(vCC),X,X,X,X,(hE),B,C,(vCE),X,X,X,(hCD),O,O,O,(vE),(vCG),X,X,(hCH),O,O,O,O,X,X,(hFC),B,J,G,O,(vCC),X,X,X,(hCI),O,O,O,X,X,X,X,(hG),O,O','7,X,X,X,(vID),(vD),(vFB),X,X,X,(hIB,vID),O,O,O,X,X,(hJE,vIA),J,C,O,D,(vF),(hIB),O,O,X,(hIG),O,O,(hIJ),O,O,(vD),(hA,vID),O,O,X,(hJF),O,O,O,O,X,X,(hIE),O,O,O,X,X','7,X,X,(vAC),(vAH),X,X,X,X,(hD),O,O,(vAD),X,X,X,(hCH,vAD),O,O,O,(vAA),(vF),(hAC),O,H,(hAB,vAJ),O,O,A,(hAE),O,O,O,(hD,vAD),O,O,X,X,(hAC),O,O,O,X,X,X,X,(hG),O,O,X','6,X,X,(vBB),(vBE),X,X,X,(hBH),O,I,(vBG),(vBB),X,(hHE,vBD),H,D,O,O,(hBA),C,O,(hA,vG),O,O,(hBF),I,O,O,O,X,X,X,(hG),O,O,X','6,X,X,(vEC),(vD),X,X,X,(hD,vH),O,O,(vIB),X,(hIA),O,O,O,O,(vE),(hII),O,F,(hII,vIG),O,O,X,(hIH),O,O,O,O,X,X,(hIA),O,D,X','6,X,X,X,X,(vEH),(vEG),X,X,X,(hEB,vEF),O,O,X,X,(hAC,vG),O,B,O,X,(hEE,vEC),O,D,O,X,(hEE),O,O,O,X,X,(hEJ),D,O,X,X,X','6,X,(vD),(vB),X,X,X,(hA),O,O,(vE),X,X,(hE),A,O,O,(vCJ),X,X,(hCH),O,A,O,(vCI),X,X,(hB),O,D,O,X,X,X,(hCB),G,O','7,X,X,X,X,(vHJ),(vIF),(vIB),X,X,X,(hIH,vJI),O,O,J,X,X,(hIA),O,O,O,F,X,X,(hIG),O,C,X,X,X,(vD),(hA,vIB),O,J,X,X,(hHB),O,O,O,O,X,X,(hHB),O,O,O,X,X,X','7,X,X,X,(vBJ),(vIB),X,X,X,(vIF),(hBB,vBB),O,O,(vBA),X,(hIC),O,O,O,O,O,(vBA),(hBD),O,O,(hC,vC),O,O,O,(hBJ),E,O,O,(hBC,vBI),G,H,X,(hBA),O,O,O,O,O,X,X,(hBF),O,O,X,X','7,X,(vHI),(vHE),X,X,X,X,(hA),O,O,X,X,X,X,(hHG),O,O,(vHH),(vHE),(vIJ),X,(hHA),O,O,O,O,O,(vHI),X,(hID),H,O,O,B,I,X,X,X,X,(hHB),F,O,X,X,X,X,(hHE),O,H','6,X,X,(vAJ),(vAJ),X,X,X,(hAF,vAA),G,A,X,X,(hDA),O,O,O,(vDE),(vAH),(hAJ),O,O,O,O,I,X,X,(hAG),D,C,O,X,X,(hAI),O,O,X','6,X,X,X,X,(vDH),(vDA),X,X,X,(hG,vDG),O,E,X,X,(hBJ,vBC),O,O,O,X,(hBI,vE),O,E,O,X,(hE),O,O,O,X,X,(hDH),O,E,X,X,X','6,X,X,X,X,(vHJ),(vHH),X,X,X,(hHE,vCC),O,O,X,X,(hF,vG),A,O,O,X,(hHC,vHJ),O,B,O,X,(hHH),O,O,O,X,X,(hHI),O,O,X,X,X','7,X,(vJ),(vDG),X,X,(vDF),(vEF),(hC),E,B,X,(hEA),O,O,(hEE),C,O,(vH),(hED,vEF),A,O,X,(hEC),O,O,O,O,X,X,(hDD,vEF),O,O,O,O,(vEA),(hEJ),O,F,X,(hJ),O,O,(hEF),O,O,X,(hEF),O,O','7,X,X,X,(vCC),(vD),X,X,X,(vJE),(hI,vCH),O,O,(vBF),X,(hCC),O,O,O,O,A,(vJB),(hCB),G,O,O,(hJA,vJF),O,O,(hJA),O,O,(hG,vH),O,O,O,X,(hCE),O,O,O,O,O,X,X,(hH),O,O,X,X','7,X,X,(vEI),(vEB),(vG),X,X,X,(hEF),E,O,O,(vHE),X,X,(hEF,vH),O,O,O,O,(vEI),(hH),O,O,X,(hEH),O,B,(hG),O,O,(vG),(hEI,vED),O,O,X,(hAG),C,O,O,O,X,X,X,(hEE),O,O,O,X','6,X,X,X,X,(vJE),(vF),X,X,X,(hI,vJJ),O,O,X,X,(hEC,vJJ),H,O,O,X,(hF,vJB),O,O,O,X,(hJI),A,C,E,X,X,(hJD),O,J,X,X,X','6,X,X,X,(vH),(vAE),X,X,X,(hCB,vCJ),O,O,(vCB),X,(hCA,vD),O,O,O,O,(hD),C,O,(hCC,vJ),O,O,(hAB),A,O,F,O,X,X,(hB),G,O,X,X','6,X,X,(vEC),(vEG),X,X,X,(hEF),O,O,(vFC),(vEI),X,(hHJ,vJ),E,O,O,A,(hJ),O,O,(hEA,vEA),O,O,(hHH),O,O,O,B,X,X,X,(hEF),O,O,X','7,X,(vEI),(vEC),X,X,X,X,(hH),O,O,X,X,X,X,(hED),O,O,(vEB),(vEG),(vGB),X,(hEJ),O,O,O,O,O,(vD),X,(hIA),O,O,O,O,C,X,X,X,X,(hA),O,I,X,X,X,X,(hEB),A,O','7,X,X,X,(vF),(vG),(vIB),X,X,(vG),(hBA,vIH),J,I,D,X,(hBG),O,O,O,O,O,(vBG),(hA),O,O,X,(hE),O,O,(hBB),O,C,(vA),(hBI,vBE),O,O,X,(hBA),O,O,O,O,O,X,(hBF),O,O,O,X,X','7,X,X,(vEF),(vDI),X,X,X,X,(hDG),O,O,(vDA),X,X,X,(hEA,vG),O,O,O,(vEJ),(vJ),(hF),O,G,(hDH,vDI),O,O,F,(hED),O,O,O,(hDD,vB),O,O,X,X,(hDB),O,O,A,X,X,X,X,(hH),O,O,X','7,X,X,X,X,(vJH),(vD),(vAJ),X,X,X,(hAC,vDH),O,O,O,X,X,(hAA),O,O,O,O,X,X,(hC),F,O,X,X,X,(vC),(hAJ,vAA),I,H,X,X,(hJA),O,D,O,G,X,X,(hJB),O,C,O,X,X,X','6,X,X,X,(vDC),(vG),X,X,X,(hA),O,O,(vCH),X,(vCI),(hCB,vB),O,O,O,(hDF),O,H,O,O,O,(hH),O,O,O,X,X,X,(hH),J,O,X,X','6,X,X,(vCG),(vGA),X,X,X,(hE),O,O,(vGG),(vGB),X,(hCI,vF),O,O,O,I,(hGI),O,O,(hI,vD),O,A,(hGH),O,B,O,O,X,X,X,(hA),O,O,X','6,X,X,X,(vJ),(vHF),X,X,(vF),(hHG,vHD),O,A,X,(hHI),A,O,O,O,(vHE),(hB),G,O,(hD,vHE),O,F,X,(hGJ),O,O,O,O,X,(hHD),O,O,X,X','6,X,X,X,X,(vBD),(vD),X,X,X,(hD,vBB),O,O,X,X,(hI,vHD),O,O,O,X,(hHD,vBE),O,O,A,X,(hHF),C,O,G,X,X,(hBI),O,O,X,X,X','7,X,(vJ),(vFB),(vDB),X,X,X,(hFC),O,O,O,(vFE),X,X,(hFB),O,O,O,O,X,X,X,X,(hG),I,O,X,X,X,X,(hA),O,O,(vFG),(vE),X,X,(hDD),O,O,O,A,X,X,X,(hFD),D,E,J','6,X,X,X,(vAD),(vAH),X,X,(vB),(hF,vEB),O,O,X,(hED),O,O,O,O,(vD),(hD),O,O,(hJ,vI),O,O,X,(hEH),O,A,O,C,X,(hB),G,O,X,X','6,X,X,X,X,(vFG),(vFB),X,X,X,(hFD,vB),O,O,X,X,(hFG,vFG),O,O,O,X,(hI,vH),O,O,C,X,(hGA),E,H,O,X,X,(hD),O,G,X,X,X','7,X,X,X,(vBH),(vBB),X,X,X,X,(hBJ,vBJ),I,O,(vHE),(vI),X,(hBF,vBA),O,O,O,O,O,(hBE),O,D,X,(hA),O,O,(hBC),O,O,(vA),(hBB,vBH),O,O,(hDA),B,H,O,O,O,X,X,X,(hI),O,O,X,X','7,X,X,X,(vEC),(vD),X,X,X,(vJ),(hEB,vEJ),O,O,X,X,(hFC),O,O,O,F,(vEG),X,(hG),O,O,(hH,vFI),O,E,(vEH),X,(hEB),A,O,(hED,vJ),O,O,X,X,(hFI),O,O,O,O,X,X,(hED),O,O,X,X','6,X,(vGH),(vGG),X,X,X,(hGE),O,O,(vFI),(vGJ),X,(hGF),O,O,D,O,X,X,(hGB),O,C,O,(vGG),X,(hFG),O,O,O,O,X,X,X,(hE),O,I','7,X,X,X,(vF),(vGI),X,X,X,(vJ),(hB,vGA),H,G,X,X,(hHF),O,O,O,A,(vHH),X,(hB),O,O,(hGB,vGA),C,O,(vC),X,(hGC),O,O,(hGI,vGF),O,O,X,X,(hHB),O,E,O,O,X,X,(hA),O,O,X,X','7,X,X,X,X,X,(vED),(vIG),X,X,X,X,(hEC),O,O,X,X,(vAC),(vA),(hH,vEG),O,O,X,(hAE,vB),O,O,H,O,O,(hIJ),O,O,O,B,O,X,(hEC),O,O,X,X,X,X,(hEI),O,O,X,X,X,X','7,X,X,(vAI),(vAA),X,X,X,X,(hAD,vAG),O,O,(vAE),X,X,(hAH),O,O,O,O,(vBH),(vD),(hG),O,O,(hI,vE),O,O,O,(hAI),O,O,O,(hG,vAC),D,F,X,X,(hAH),O,O,O,O,X,X,X,(hAJ),O,O,X','7,X,X,(vGD),(vFB),(vJ),X,X,X,(hGD),O,O,O,(vFA),(vGG),X,(hFA),O,O,O,O,O,X,(hGE,vGF),O,O,(hH,vFB),O,O,(hH),O,G,(hGC,vD),O,G,X,(hEB),O,O,O,O,O,X,X,X,(hGC),O,A,O,X','6,X,X,(vAD),(vEE),X,X,X,(hEC),G,O,(vAJ),(vH),X,(hEC,vEG),O,A,O,O,(hEG),F,O,(hEG,vEG),O,O,(hAB),O,E,F,A,X,X,X,(hEG),O,O,X','6,X,X,X,X,(vIB),(vJ),X,X,X,(hB,vIJ),O,O,X,X,(hE,vIF),O,O,C,X,(hFC,vIF),O,A,O,X,(hG),O,O,H,X,X,(hIJ),O,O,X,X,X','6,X,X,X,(vIB),(vEB),X,X,X,(hD,vAE),O,O,(vE),X,(hIJ,vE),O,O,O,O,(hII),O,O,(hJ,vC),H,O,(hAE),O,O,G,J,X,X,(hC),O,O,X,X','6,X,X,(vFF),(vB),X,X,X,(hC,vI),O,J,(vJE),X,(hJJ),O,O,I,G,(vA),(hJJ),O,O,(hJD,vJE),O,O,X,(hJB),O,O,F,O,X,X,(hJH),C,J,X','7,X,X,X,(vEI),(vJI),X,X,X,X,(hJA),O,O,(vJE),(vJJ),X,X,(hJI,vJB),O,E,O,D,X,(hJI,vC),O,H,(hJB,vJE),O,O,(hB),O,O,(hF,vD),O,O,X,(hJB),O,O,O,O,X,X,X,X,(hJE),O,O,X,X','7,X,(vJB),(vFD),X,X,(vFE),(vH),(hJF),O,O,X,(hH),O,O,(hJC),O,O,(vH),(hJF,vJF),O,O,X,(hJI),H,O,O,O,X,X,(hFJ,vJJ),J,O,O,O,(vJA),(hA),G,O,X,(hJF),O,C,(hJC),O,O,X,(hD),O,O','7,X,(vI),(vDH),X,X,X,X,(hB),O,I,X,X,X,X,(hC),O,O,(vA),(vI),(vDJ),X,(hDH),O,B,O,O,O,(vDH),X,(hGG),O,O,O,J,O,X,X,X,X,(hHH),B,O,X,X,X,X,(hHE),O,O','6,X,X,(vDI),(vE),X,X,X,(hA,vDA),E,O,(vHI),X,(hHI),F,A,O,O,(vDF),(hDD),O,O,(hDJ,vDJ),O,O,X,(hDG),O,O,H,O,X,X,(hB),O,D,X','6,X,(vJ),(vDH),X,X,X,(hDA),G,O,(vDA),(vDB),X,(hDB),O,O,I,F,X,X,(hG),O,F,O,(vDI),X,(hED),G,O,O,F,X,X,X,(hDE),O,H','6,X,X,(vCJ),(vD),X,X,X,(hG),O,O,(vAD),(vAE),X,(hCC,vI),O,O,A,O,(hJ),O,F,(hAD,vAD),I,H,(hCD),O,O,O,F,X,X,X,(hAJ),O,G,X','7,X,X,X,X,(vEF),(vEC),(vF),X,X,X,(hED,vEB),O,O,O,X,X,(hEB),O,O,O,O,X,X,(hC),O,D,X,X,X,(vI),(hB,vEE),O,O,X,X,(hEB),E,H,D,O,X,X,(hHJ),O,G,O,X,X,X','7,X,X,X,X,(vJF),(vIC),X,X,X,(vIA),(hD,vJE),O,O,X,X,(hIJ,vD),J,O,O,D,(vG),(hJC),I,O,O,(hJA,vC),O,O,(hJF),J,C,(hJF,vJE),O,O,O,X,(hIB),O,O,O,O,X,X,(hJF),O,O,X,X,X','6,X,(vH),(vJE),X,X,X,(hC),J,O,(vJJ),(vJC),X,(hJJ),A,I,O,H,X,X,(hD),O,O,A,(vC),X,(hAI),F,B,O,O,X,X,X,(hC),J,O','7,X,(vA),(vEE),X,X,(vD),(vF),(hEC),O,O,(vIH),(hI,vEB),O,O,(hBD),O,O,O,O,F,O,X,X,(hA),O,O,X,X,X,(vJ),(hEJ,vEG),F,O,(vA),(vG),(hBG),O,O,O,O,O,O,(hEH),O,O,X,(hG),O,O','6,X,X,X,(vFG),(vFC),X,X,(vE),(hFE,vFF),A,O,X,(hBF),O,O,O,O,(vH),(hE),O,O,(hD,vFF),I,O,X,(hFF),O,O,E,D,X,(hFI),O,O,X,X','6,X,X,(vHA),(vFH),X,X,X,(hFF),O,O,(vFH),(vE),X,(hDI,vFG),O,O,O,O,(hFG),B,O,(hC,vFB),O,O,(hDC),O,G,O,F,X,X,X,(hFF),O,O,X','7,X,X,(vBE),(vBB),(vA),X,X,X,(hH),O,O,O,(vBA),(vH),X,(hGI,vBB),O,J,O,O,O,(hBG),O,O,X,(hI),O,O,(hC),O,O,(vBG),(hE,vBD),H,C,(hBI),O,O,O,O,O,X,X,X,(hGG),O,O,O,X','7,X,X,X,X,X,(vHC),(vF),X,X,X,X,(hF,vC),O,E,X,X,(vEJ),(hEF,vEG),F,O,H,X,(hHD),C,O,O,O,X,X,(hHC,vI),A,O,O,O,X,(hJ),D,O,O,X,X,X,(hF),O,O,X,X,X,X','6,X,X,(vH),(vDC),X,X,X,(hCI,vCD),O,O,X,X,(hH),O,O,O,(vCA),(vCB),(hCJ),O,I,O,D,E,X,X,(hDI),E,H,O,X,X,(hG),O,O,X','7,X,X,X,X,(vJ),(vHE),X,X,X,X,(hHA,vHF),O,B,(vHE),X,X,(hEC,vHG),O,O,O,O,X,(hHE,vHG),O,O,(hA,vHB),O,O,(hJ),O,O,(hHE,vJ),O,O,X,(hED),O,J,O,O,X,X,X,(hB),O,O,X,X,X','6,X,X,(vJG),(vA),X,X,X,(hI),B,O,(vJC),(vJH),X,(hJH,vJC),O,E,O,O,(hB),O,O,(hJJ,vF),O,O,(hCE),O,O,D,I,X,X,X,(hB),O,H,X','6,X,X,X,X,(vDG),(vHH),X,X,(vDH),(hJ,vHB),O,O,X,(hJF),O,O,O,O,X,(hHF,vE),O,O,O,X,(hDJ),H,O,O,I,X,(hHC),G,O,X,X,X','7,X,(vAI),(vHC),X,X,X,X,(hD),O,G,X,X,(vHI),(vG),(hAJ),O,O,(vB),(hH,vAH),O,O,X,(hHF,vH),O,O,F,O,O,(hCA),O,O,O,O,O,(vF),(hH),O,O,X,(hG),O,O,X,X,X,X,(hAH),O,O','7,X,X,X,X,(vFG),(vFI),X,X,X,X,(hFI,vFB),O,O,(vFJ),X,(vFA),(hFG,vGA),O,B,O,O,(hIB),O,O,O,(hH,vJ),O,O,(hJ),O,O,(hFD,vD),O,C,O,(hII),O,O,O,O,X,X,X,(hE),O,O,X,X,X','7,X,X,X,(vI),(vEG),(vFD),X,X,(vED),(hA,vEB),O,O,O,X,(hJC),O,O,A,O,O,X,(hEG),O,O,(hEG,vEC),O,O,(vB),X,(hH),O,O,(hJ,vEB),O,O,X,(hEI),O,O,O,O,J,X,(hFF),O,H,O,X,X','6,X,X,(vEI),(vEB),X,X,X,(hEC,vB),O,O,(vEB),X,(hHC),J,O,O,F,(vEC),(hH),O,O,(hB,vEC),O,O,X,(hEH),O,O,O,O,X,X,(hEA),D,O,X','6,X,X,(vAF),(vBF),X,X,X,(hBI),O,G,(vAD),(vBD),X,(hBI,vF),O,J,O,E,(hBB),A,G,(hBI,vBI),O,H,(hAJ),B,O,O,O,X,X,X,(hBA),O,O,X','6,X,(vCB),(vJ),X,X,X,(hCE),A,O,(vCI),X,X,(hCG),D,O,O,(vCC),X,X,(hCA),O,O,O,(vB),X,X,(hB),O,E,G,X,X,X,(hG),O,H','7,X,X,X,X,X,(vFI),(vHG),X,X,X,X,(hHJ,vHH),O,O,X,X,(vHC),(hHD,vHG),O,O,O,X,(hHH),O,O,O,O,X,X,(hFE,vHC),O,O,O,D,X,(hHE),H,O,O,X,X,X,(hHE),I,A,X,X,X,X','7,X,X,(vFA),(vC),X,X,X,X,(hE),O,B,(vAC),(vGJ),X,X,(hFF,vG),O,O,O,O,(vAI),(hAA),O,D,(hAB,vAC),O,O,O,(hAH),O,O,O,(hAB,vAB),O,O,X,(hFJ),O,O,O,O,X,X,X,X,(hAH),O,J,X','7,X,X,X,(vIF),(vIB),X,X,X,X,(hID),O,O,(vC),X,X,(vIF),(hIH,vEE),O,O,O,(vII),(hEB),O,O,O,(hIB,vIF),D,J,(hIF),O,O,(hII,vIE),O,O,O,X,(hJ),O,G,O,X,X,X,X,(hIF),O,O,X,X','7,X,(vDJ),(vDB),X,X,X,X,(hDJ),O,O,(vDF),(vCE),(vI),X,(hCH),O,O,O,O,O,X,X,X,(hDC,vDB),O,A,G,X,X,(hFE),O,O,O,(vDJ),(vI),X,(hCF),O,O,O,O,O,X,X,X,X,(hDE),O,O','6,X,X,(vCI),(vJ),X,X,X,(hA),O,E,(vEG),(vCC),X,(hEG,vCF),O,O,D,O,(hJ),C,G,(hB,vCC),C,O,(hED),O,O,A,O,X,X,X,(hCD),O,O,X','6,X,X,X,(vG),(vFE),X,X,X,(hG,vBC),O,O,(vBC),X,(hFJ,vC),O,E,O,I,(hG),O,O,(hBF,vBC),O,O,(hEJ),O,O,O,O,X,X,(hBA),D,O,X,X','6,X,X,(vAJ),(vE),X,X,X,(hFH,vH),O,O,(vFA),X,(hFH),O,O,O,O,(vFI),(hI),O,C,(hFI,vFD),O,O,X,(hAC),O,O,I,G,X,X,(hC),O,O,X','6,X,X,X,(vE),(vCJ),X,X,(vFF),(hA,vHJ),C,O,X,(hFC),O,O,O,F,(vD),(hFI),O,O,(hFE,vFJ),O,O,X,(hFG),O,O,O,O,X,(hFD),O,O,X,X','7,X,X,X,(vBJ),(vBI),X,X,X,X,(hA),O,O,(vCH),(vBJ),X,(vCJ),(hCB,vG),H,O,I,B,(hBA),O,O,O,(hBE,vG),O,O,(hBB),F,O,(hBE,vBI),O,O,O,(hBI),O,O,O,O,X,X,X,X,(hBC),O,O,X,X','6,X,X,(vCJ),(vD),X,X,X,(hH),O,O,(vBD),(vJ),X,(hCI,vCH),O,J,F,O,(hCG),O,E,(hA,vCD),O,F,(hBF),O,O,O,O,X,X,X,(hCG),O,O,X','6,X,X,X,X,(vJB),(vG),X,X,X,(hA,vH),I,O,X,X,(hCD,vCG),O,O,B,X,(hCF,vCD),O,O,O,X,(hJD),O,H,O,X,X,(hB),O,O,X,X,X','7,X,(vI),(vEH),X,X,(vCC),(vF),(hG),O,O,X,(hH),O,C,(hJ),O,O,(vAD),(hAG,vG),O,O,X,(hEI),F,O,O,O,X,X,(hAD,vAB),O,O,I,O,(vI),(hG),O,O,X,(hC),O,O,(hAJ),O,O,X,(hAA),O,O','7,X,X,X,X,X,(vEC),(vEA),X,X,X,X,(hB),O,O,X,X,(vDF),(vEH),(hEC,vH),H,O,X,(hEA,vI),O,B,E,O,O,(hDB),E,J,O,D,O,X,(hEH),O,A,X,X,X,X,(hI),O,O,X,X,X,X','6,X,X,X,(vBC),(vBC),X,X,X,(hBJ,vEC),H,O,(vBB),X,(hBE,vA),D,J,O,O,(hC),O,O,(hBE,vBG),O,O,(hEG),H,O,B,O,X,X,(hBI),O,O,X,X','7,X,(vE),(vCF),X,X,X,X,(hJ),O,O,(vFB),X,X,X,(hCJ),O,O,A,(vFE),(vCA),X,X,(hIH),O,O,O,O,X,X,(hFF),O,O,O,B,(vFA),X,X,X,(hCI),O,O,O,X,X,X,X,(hFG),O,O','7,X,X,X,X,(vBH),(vH),X,X,X,X,(hI),O,O,(vE),X,X,X,(hJG,vBF),O,O,O,X,(vH),(hBA,vJE),O,O,O,O,(hDG),O,O,O,O,X,X,(hBG),O,F,O,X,X,X,X,(hA),J,O,X,X,X','7,X,X,X,X,X,(vIC),(vA),X,X,X,(vII),(hG,vIH),F,I,X,X,(hIG),O,O,O,D,X,X,(hC,vC),O,O,J,X,X,(hIF,vE),O,G,A,X,X,(hIH),O,O,O,O,X,X,(hJ),F,D,X,X,X,X','7,X,X,X,(vH),(vCJ),X,X,X,(vCG),(hCB,vEG),O,O,X,X,(hEF),O,I,O,O,(vCI),X,(hCD),O,J,(hCB,vCJ),E,O,(vCC),X,(hCE),O,O,(hCI,vH),O,O,X,X,(hEB),O,O,O,O,X,X,(hD),O,O,X,X','6,X,(vGA),(vBE),X,X,X,(hGC),H,O,(vGF),X,X,(hGG),O,O,O,(vGD),X,X,(hBG),O,J,O,(vGD),X,X,(hGD),O,O,E,X,X,X,(hGH),O,O','6,X,X,(vEE),(vEJ),X,X,X,(hI,vEF),O,O,(vEH),X,(hEA),O,O,O,E,(vB),(hEE),O,O,(hB,vB),O,O,X,(hEG),A,O,I,O,X,X,(hA),D,B,X','6,X,(vJ),(vHA),X,X,X,(hHH),D,O,(vHG),X,X,(hI),O,O,F,(vDG),X,X,(hDJ),O,O,O,(vHF),X,X,(hHF),O,O,E,X,X,X,(hHE),B,O','6,X,X,X,X,(vFI),(vE),X,X,X,(hH,vA),J,I,X,X,(hGF,vD),O,O,F,X,(hGF,vC),O,O,A,X,(hD),O,O,O,X,X,(hD),O,O,X,X,X','7,X,X,(vHG),(vE),X,X,X,X,(hGD),O,O,(vGA),(vHC),(vAJ),X,(hGD,vAC),O,O,O,O,O,(hGC),O,O,(hAA,vGC),O,O,O,(hAC),O,O,F,(hGD,vD),O,O,(hHB),O,O,O,O,O,X,X,X,X,(hI),O,D,X','7,X,X,(vBG),(vBJ),X,(vBD),(vE),X,(hC),O,O,(hBB,vAG),O,C,X,(hBE),O,O,O,O,D,X,(hBG),O,O,O,(vBE),X,X,(vE),(hBI,vJ),O,O,O,X,(hCG),F,G,O,O,O,X,(hC),O,O,(hBJ),O,O,X','7,X,X,X,X,X,(vEA),(vJJ),X,X,(vED),(vJI),(hF),O,O,X,(hB),O,O,(hJH,vB),O,O,X,(hED),O,B,O,O,X,X,(hJI,vJI),O,O,C,O,X,(hJH),O,O,(hJJ),O,O,X,(hF),J,E,X,X,X,X','6,X,(vF),(vED),X,X,X,(hEI),O,O,(vEA),X,X,(hEJ),O,O,J,(vB),X,X,(hB),O,O,O,(vG),X,X,(hJ),B,O,C,X,X,X,(hF),O,E','6,X,X,X,X,(vCH),(vCD),X,X,X,(hG,vCH),O,O,X,X,(hCH,vCI),O,O,O,X,(hFA,vCE),O,O,J,X,(hFF),O,O,O,X,X,(hI),F,C,X,X,X','6,X,X,(vCH),(vA),X,X,X,(hE,vE),D,O,(vAG),(vHC),(hHB),O,O,C,O,I,(hHA),O,O,(hE,vJ),O,O,(hCH),A,O,O,O,O,X,X,(hHD),O,O,X','7,X,(vF),(vDG),(vGD),X,X,X,(hA),O,D,O,(vI),(vGE),X,(hDG),O,C,O,O,O,X,(hGC),H,O,(hH,vA),O,O,(vGF),X,(hH),O,O,(hGB,vGD),O,O,X,(hDH),O,D,O,O,O,X,X,X,(hA),O,O,G','7,X,X,X,X,(vIG),(vIG),X,X,X,X,(hCJ),O,O,(vCE),X,X,X,(hIE,vEA),O,O,O,X,(vJ),(hEA,vIE),O,O,O,O,(hCH),O,F,O,O,X,X,(hCH),I,B,O,X,X,X,X,(hCH),O,O,X,X,X','7,X,X,X,X,(vJ),(vDB),X,X,X,X,(hDG,vH),O,O,X,X,(vB),(hJ,vEB),E,O,O,(vG),(hDJ),O,F,D,(hI,vDC),O,O,(hA),O,O,(hJ,vA),O,O,I,X,(hDA),O,O,O,X,X,X,(hDH),O,O,X,X,X','6,X,X,X,(vEE),(vJA),(vEI),X,X,(hD,vEE),O,F,O,X,(hED,vEC),O,O,O,O,(hJ),O,O,(hEH,vEI),O,O,(hIB),O,O,O,O,X,(hII),O,O,O,X,X','6,X,(vE),(vGH),X,X,X,(hC),O,J,(vFJ),X,X,(hGH),O,O,O,(vJ),X,X,(hFA),B,O,I,(vFF),X,X,(hFG),O,O,O,X,X,X,(hB),F,G','6,X,X,(vIF),(vIJ),X,X,X,(hD,vIC),O,O,X,X,(hIB),O,O,O,(vIG),(vA),(hBF),O,O,F,I,O,X,X,(hE),D,O,F,X,X,(hIF),O,C,X','7,X,(vCD),(vB),X,X,X,X,(hII),O,D,(vA),X,X,X,(hIJ),O,O,O,(vII),X,X,(hID),O,O,O,O,(vIJ),(vCJ),X,X,(hCA),H,O,F,O,X,X,X,(hA),O,O,G,X,X,X,X,(hII),J,O','7,X,(vC),(vFF),X,X,(vHF),(vD),(hFD),O,O,(vHG),(hA,vFJ),O,O,(hHF),O,O,O,O,O,O,X,X,(hFG,vFH),O,O,O,X,X,(hFB,vI),O,O,O,(vFB),(vB),(hIG),O,O,O,O,D,J,(hG),O,I,X,(hFE),O,O','7,X,(vHJ),(vDE),X,X,(vDI),(vHH),(hHG),O,J,(vHJ),(hJ),O,O,(hHE),O,O,O,(hHJ,vB),O,O,X,(hHH),O,O,O,O,X,X,(hDJ,vHA),D,O,E,O,(vF),(hHJ),O,O,(hA),O,O,E,(hHA),O,O,X,(hI),O,O','7,X,(vEH),(vFA),X,X,X,X,(hEB),O,O,(vFA),X,X,X,(hFD),O,O,O,(vEE),(vID),X,X,(hFB),O,O,O,O,X,X,(hFJ),O,O,O,O,(vEE),X,X,X,(hJ),O,B,O,X,X,X,X,(hEH),C,O','6,X,(vJ),(vE),X,X,X,(hA),B,C,(vCJ),X,X,(hCG),O,O,O,(vCD),X,X,(hHF),O,O,O,(vJ),X,X,(hE),O,O,H,X,X,X,(hCE),O,O','6,X,(vGC),(vGH),X,X,X,(hGG),O,O,(vGB),X,X,(hGI),E,O,I,(vGG),X,X,(hIJ),O,C,O,(vA),X,X,(hD),G,O,O,X,X,X,(hD),O,O','6,X,X,X,X,(vIG),(vII),X,X,X,(hE,vIA),I,G,X,X,(hGJ,vGF),O,C,O,X,(hIE,vII),D,O,O,X,(hGJ),O,B,O,X,X,(hA),O,J,X,X,X','6,X,X,X,X,(vIA),(vE),X,X,(vJB),(hB,vII),I,J,X,(hIF),O,O,O,H,X,(hIB,vG),D,J,O,X,(hJG),C,O,O,F,X,(hB),O,O,X,X,X','7,X,X,X,(vDB),(vGG),X,X,X,X,(hGH),O,O,(vGA),(vGA),X,X,(hGF,vGA),O,O,O,O,X,(hGA,vGE),B,O,(hGD,vI),O,O,(hJ),O,I,(hGE,vGG),O,O,X,(hDA),O,D,O,O,X,X,X,X,(hF),O,O,X,X','6,X,X,X,(vFB),(vI),X,X,X,(hGF),O,O,(vGA),X,(vH),(hGA,vFD),O,O,O,(hFF),O,A,O,O,C,(hGG),O,J,O,X,X,X,(hGH),O,D,X,X','6,X,X,(vGA),(vA),X,X,X,(hB,vGE),O,O,(vHJ),X,(hBD),O,O,O,O,(vGH),(hGC),O,O,(hGJ,vGE),O,O,X,(hGG),O,F,O,O,X,X,(hGC),O,O,X','7,X,X,(vCE),(vG),(vI),X,X,X,(hEE),A,O,E,(vCD),(vCH),X,(hEG,vCD),O,O,O,O,O,(hA),G,C,X,(hEH),O,O,(hEE),O,O,(vI),(hA,vD),O,O,(hCF),O,O,O,O,O,X,X,X,(hED),O,O,B,X','7,X,(vG),(vDC),X,(vBA),(vDG),X,(hJ),O,G,(hDA,vBA),O,O,X,(hBC),O,O,G,O,O,X,X,(hDH),O,O,O,(vG),X,X,X,(hG,vDI),O,O,O,(vJ),X,(hBB),E,O,O,O,O,X,(hH),O,J,(hB),O,O','6,X,X,X,(vJG),(vCG),X,X,(vJG),(hJB,vJH),O,O,X,(hJH),I,B,O,O,(vD),(hJB),O,O,(hA,vJG),O,O,X,(hJB),O,B,O,O,X,(hF),I,C,X,X','7,X,(vA),(vE),X,X,(vD),(vB),(hF),O,O,(vJJ),(hI,vGD),O,O,(hGD),O,O,O,O,I,O,X,X,(hJI),O,O,X,X,X,(vJE),(hA,vF),I,O,(vD),(vJJ),(hGA),O,O,O,J,O,O,(hH),O,O,X,(hI),O,O','7,X,X,(vEH),(vEF),X,X,X,X,(hEI,vIH),O,O,(vEI),X,X,(hEI),O,O,O,O,(vIE),(vEJ),(hD),O,O,(hEH,vH),O,O,O,(hEC),O,O,O,(hD,vC),H,G,X,X,(hIA),O,O,O,O,X,X,X,(hD),E,O,X','7,X,X,X,X,X,(vEA),(vCJ),X,X,X,X,(hCD,vCC),O,O,X,X,(vCI),(hCJ,vEH),O,O,O,X,(hDH),O,J,B,O,X,X,(hCH,vD),O,O,O,O,X,(hCJ),O,O,O,X,X,X,(hJ),O,G,X,X,X,X','7,X,(vB),(vFF),X,(vEI),(vFE),X,(hH),O,O,(hFC,vIB),G,O,X,(hFC),O,O,O,O,O,X,X,X,(hFH),O,D,X,X,X,X,(hFF,vFG),O,O,(vFE),(vFH),X,(hEE),O,O,J,O,O,X,(hFG),O,O,(hFG),O,O','6,X,(vHE),(vII),X,X,X,(hHB),O,O,(vHF),(vHJ),X,(hHD),B,O,O,O,X,X,(hG),H,O,O,(vHE),X,(hCA),O,O,E,B,X,X,X,(hHB),O,G','6,X,(vH),(vAF),X,X,X,(hAC),O,O,(vAD),X,X,(hDI),J,O,O,(vAH),X,X,(hAC),O,O,O,(vAI),X,X,(hH),O,O,B,X,X,X,(hAH),O,E','6,X,(vC),(vHA),X,X,X,(hC),O,J,(vHA),X,X,(hF),J,O,O,(vHC),X,X,(hI),O,J,O,(vF),X,X,(hEJ),O,O,B,X,X,X,(hG),O,O','6,X,X,X,(vFJ),(vJC),X,X,(vFF),(hFF,vJE),O,O,X,(hFH),O,F,O,O,(vD),(hFI),O,C,(hE,vH),D,O,X,(hJC),O,O,O,A,X,(hFG),O,J,X,X','7,X,X,X,X,X,(vDE),(vBB),X,(vC),(vDF),X,(hBF),O,O,(hH),O,O,(vE),(hH,vBI),B,O,(hDF),O,O,O,O,D,(vE),X,(hDI,vBE),O,O,C,O,B,(hBF),O,A,X,(hG),E,D,(hG),O,O,X,X,X,X','7,X,(vJ),(vFH),X,X,X,X,(hHH),F,A,X,X,(vGE),(vA),(hI),O,O,(vC),(hF,vD),O,O,X,(hHC,vF),H,O,O,O,O,(hGJ),O,O,O,O,O,(vE),(hE),O,O,X,(hHI),O,O,X,X,X,X,(hA),O,O','7,X,X,(vCD),(vCB),(vF),X,X,X,(hCA,vCJ),O,O,O,(vFH),X,(hCD),O,O,O,O,O,(vCB),(hH),O,O,X,(hI),O,O,(hCE),O,B,(vCE),(hCH,vCI),O,G,X,(hFA),O,G,O,O,O,X,X,(hBC),H,O,O,X','6,X,X,X,X,(vHD),(vHH),X,X,X,(hA,vHH),H,I,X,X,(hHJ,vIG),O,C,O,X,(hHC,vE),O,O,O,X,(hIG),J,O,O,X,X,(hHF),O,O,X,X,X','6,X,X,(vFD),(vJB),X,X,X,(hH,vH),O,O,(vJD),X,(hFH),O,O,O,O,(vJI),(hJD),O,O,(hJD,vG),J,E,X,(hJD),O,O,O,O,X,X,(hB),A,O,X','6,X,X,X,(vC),(vDC),X,X,(vF),(hHB,vDI),O,O,(vDJ),(hDG),O,O,E,O,O,(hHA),O,O,(hHD,vG),O,O,(hEJ),O,O,F,O,O,X,(hJ),O,O,X,X','7,X,X,X,X,X,(vEJ),(vG),X,X,X,X,(hD,vI),C,O,X,X,(vEG),(hFE,vFE),O,O,O,X,(hFD),O,O,O,O,X,X,(hEC,vFI),O,O,O,O,X,(hEC),B,O,H,X,X,X,(hJ),O,O,X,X,X,X','7,X,(vI),(vAC),X,X,(vAI),(vCG),(hB),O,I,X,(hCB,vCD),O,O,(hH),A,D,(hCD,vAF),O,O,O,X,(hAC),O,O,O,O,X,X,(hCF,vCC),O,O,O,O,(vB),(hCB),O,O,O,(hCF),O,O,(hCB),O,J,X,(hB),O,O','6,X,X,X,(vJB),(vIG),X,X,(vA),(hJI,vJC),O,F,X,(hJB),O,O,O,O,(vJE),(hJD),B,O,(hJB,vD),O,H,X,(hJG),O,I,O,O,X,(hA),O,E,X,X','7,X,X,X,X,(vCD),(vCC),(vB),X,X,X,(hCC,vEC),O,I,O,X,X,(hCH),C,O,O,O,X,X,(hCA),F,O,X,X,X,(vA),(hCH,vCE),O,E,X,X,(hGA),C,O,O,O,X,X,(hCE),O,O,O,X,X,X','6,X,X,X,X,(vJI),(vA),X,X,(vJH),(hJE,vJI),O,G,X,(hJE),F,O,O,D,X,(hC,vB),O,E,O,X,(hJH),O,O,O,O,X,(hJD),O,E,X,X,X','6,X,X,X,X,(vAJ),(vAJ),X,X,X,(hAF,vGB),O,O,X,X,(hAE,vD),O,O,O,X,(hAJ,vF),O,J,O,X,(hAF),O,O,H,X,X,(hB),O,I,X,X,X','7,X,X,X,X,(vH),(vIE),X,X,X,X,(hA,vA),O,O,X,X,(vID),(hF,vCH),O,O,A,(vIE),(hIH),O,O,O,(hIA,vIH),O,O,(hIE),O,O,(hIG,vIA),B,O,O,X,(hIF),O,G,A,X,X,X,(hIE),O,D,X,X,X','7,X,(vEF),(vB),(vFC),X,X,X,(hH),O,O,O,(vEA),X,X,(hED),C,O,O,O,X,X,X,X,(hEG),O,F,X,X,X,X,(hEI),O,O,(vEH),(vI),X,X,(hFH),O,O,O,O,X,X,X,(hEE),O,I,O','6,X,(vHI),(vDG),X,X,X,(hHE),J,O,(vDG),X,X,(hHC),H,O,O,(vHA),X,X,(hDH),F,O,G,(vHE),X,X,(hHC),O,O,O,X,X,X,(hHE),O,O','6,X,X,(vAD),(vAE),X,X,X,(hAA),O,O,(vAD),(vAA),X,(hAI,vI),O,F,D,J,(hC),A,O,(hB,vJ),A,E,(hAB),O,I,C,J,X,X,X,(hI),O,H,X','6,X,X,(vDA),(vE),X,X,X,(hJ,vDE),O,F,(vGG),X,(hDJ),O,O,O,O,(vC),(hDD),O,O,(hJ,vI),O,O,X,(hGG),O,D,O,O,X,X,(hDA),G,B,X','7,X,X,(vJD),(vG),(vI),X,X,X,(hG),O,O,H,(vEB),(vEF),X,(hEB),O,O,B,O,J,X,(hEJ,vA),O,H,(hEE,vEA),O,O,(hA),O,O,(hEJ,vG),O,O,X,(hJF),O,O,O,O,O,X,X,X,(hG),F,O,O,X','6,X,X,X,X,(vEJ),(vG),X,X,X,(hDE,vF),O,O,X,X,(hDJ,vF),O,O,O,X,(hA,vDA),O,O,O,X,(hDI),B,O,O,X,X,(hDE),C,O,X,X,X','6,X,X,(vAC),(vD),X,X,X,(hD,vEI),O,O,(vBC),X,(hBA),O,O,O,O,(vH),(hEF),O,O,(hEI,vF),O,O,X,(hEF),O,O,A,O,X,X,(hEE),G,D,X','6,X,X,(vGB),(vD),X,X,X,(hGG),A,C,(vGJ),(vC),X,(hGG,vGC),O,O,O,J,(hGH),O,O,(hE,vI),G,H,(hHF),O,H,O,O,X,X,X,(hE),O,O,X','6,X,X,(vIJ),(vCD),X,X,X,(hCD),O,O,(vCI),(vCG),X,(hIH,vCC),G,O,O,O,(hCE),O,I,(hCH,vCD),G,O,(hIC),B,D,O,O,X,X,X,(hA),O,O,X','7,X,(vII),(vDH),(vID),X,X,X,(hIG),O,O,O,X,X,X,(hDA),O,C,J,(vII),X,X,X,(hID),F,O,O,(vDH),X,X,X,(hID),O,O,O,(vID),X,X,X,(hIE),A,O,O,X,X,X,(hDD),O,O,O','7,X,(vEB),(vF),X,X,X,X,(hED),O,O,(vAJ),(vED),(vD),X,(hIB),O,O,O,G,O,X,X,X,(hF,vA),O,O,O,X,X,(hED),O,O,F,(vA),(vEB),X,(hIE),O,H,O,O,O,X,X,X,X,(hEE),O,O','7,X,X,X,X,(vCA),(vCE),(vB),X,X,X,(hF),O,O,O,X,X,X,(hJG,vCD),I,O,O,X,X,(hF,vB),O,O,O,X,X,(hJI,vCI),O,F,O,X,X,(hD),O,O,O,X,X,X,(hCI),O,O,O,X,X,X','6,X,(vJI),(vI),X,X,X,(hH),O,O,(vD),X,X,(hJA),F,O,O,(vJH),X,X,(hJI),C,G,O,(vJJ),X,X,(hD),O,O,O,X,X,X,(hJE),O,O','6,X,X,X,(vDC),(vAE),X,X,X,(hI),O,B,(vI),X,(vC),(hJ,vDE),O,O,O,(hAF),A,D,O,O,O,(hI),O,O,G,X,X,X,(hDA),H,O,X,X','7,X,X,X,(vFD),(vAF),X,X,X,(vFD),(hFE,vFA),B,O,X,X,(hHI),O,O,O,O,(vFF),X,(hFI),O,O,(hC,vG),O,H,(vFA),X,(hE),O,O,(hFB,vC),O,O,X,X,(hFJ),O,G,O,O,X,X,(hH),O,O,X,X','7,X,X,X,X,(vD),(vHD),X,X,X,(vDH),(hA,vJJ),O,O,(vE),X,(hHB,vJH),O,O,O,E,J,(hJE),H,O,O,(hD,vF),O,O,(hJG),E,O,(hJE,vJG),C,O,O,(hHH),J,O,O,O,O,X,X,(hJJ),O,O,X,X,X','7,X,X,X,X,(vBA),(vEB),X,X,X,(vBG),(hC,vBB),O,O,X,X,(hBD,vBA),O,O,O,O,(vBJ),(hBC),O,O,O,(hBG,vBD),A,O,(hBB),O,O,(hEE,vBF),O,O,D,X,(hBJ),O,O,O,I,X,X,(hBD),O,O,X,X,X','7,X,X,X,X,X,(vDG),(vC),X,(vB),(vFH),X,(hC),E,O,(hA),O,O,(vDD),(hH,vDB),O,O,(hDA),C,O,O,O,O,(vE),X,(hFH,vDE),O,O,H,O,F,(hDH),O,O,X,(hDI),O,O,(hJ),O,O,X,X,X,X','6,X,(vB),(vE),X,X,X,(hA),D,O,(vA),X,X,(hH),O,C,O,(vIG),X,X,(hDI),O,O,O,(vDF),X,X,(hIF),O,O,O,X,X,X,(hH),O,O','7,X,(vHF),(vC),X,X,(vC),(vHF),(hC),O,O,(vBC),(hA,vBF),O,O,(hBE),O,O,O,O,O,O,X,X,(hHD),A,O,X,X,X,(vD),(hJ,vHA),O,O,(vHI),(vC),(hCH),J,O,O,O,O,B,(hHH),O,O,X,(hE),O,O','6,X,X,X,(vJ),(vDA),X,X,(vFD),(hB,vFE),O,O,(vDA),(hDJ),O,O,O,O,O,(hDE),O,O,(hDA,vC),O,H,(hBA),O,I,O,G,O,X,(hJ),E,O,X,X','6,X,(vGA),(vA),X,X,X,(hGE),O,O,(vGD),X,X,(hGA),O,G,A,(vED),X,X,(hGE),O,O,O,(vGD),X,X,(hEB),C,H,F,X,X,X,(hGE),A,I','6,X,(vIC),(vFD),X,X,X,(hIG),O,C,(vIB),X,X,(hFJ),O,O,O,(vII),X,X,(hIE),O,O,F,(vIA),X,X,(hIJ),F,I,O,X,X,X,(hIC),O,O','6,X,X,X,(vJG),(vHH),X,X,X,(hHA),O,O,(vHD),X,(vE),(hJF,vHJ),O,O,O,(hHB),F,O,D,O,O,(hE),O,J,O,X,X,X,(hHE),I,O,X,X','7,X,X,X,(vGG),(vI),(vEC),X,X,(vBH),(hJ,vBI),O,O,O,X,(hBJ),O,O,O,O,O,(vJ),(hGJ),O,O,X,(hA),O,O,(hGC),O,O,(vC),(hGB,vGJ),O,O,X,(hBF),O,O,O,O,B,X,(hBH),O,O,O,X,X','7,X,X,X,X,X,(vD),(vHB),X,X,(vG),(vFC),(hHA,vAI),O,O,X,(hAB),O,O,O,O,O,X,(hAD),O,O,O,(vHB),X,X,(vF),(hAF,vHI),O,O,O,X,(hAB),O,O,O,O,O,X,(hB),O,E,X,X,X,X','6,X,(vBC),(vDF),X,X,X,(hBE),O,O,(vDB),X,X,(hDG),O,J,O,(vC),X,X,(hBI),O,O,O,(vBB),X,X,(hBA),O,O,D,X,X,X,(hBG),F,O','6,X,X,X,(vH),(vDC),(vGA),X,X,(hA,vIE),O,O,O,X,(hIG,vGG),O,O,O,O,(hF),O,O,(hGF,vJ),J,O,(hGA),O,O,O,O,X,(hIE),O,O,O,X,X','6,X,(vHC),(vHJ),X,X,X,(hHC),A,B,(vA),X,X,(hHI),O,O,O,(vHA),X,X,(hD),F,O,O,(vB),X,X,(hII),G,O,O,X,X,X,(hB),O,O','7,X,(vH),(vJA),X,X,(vIE),(vJI),(hJC),O,O,(vDG),(hJE,vIG),O,O,(hDD),I,O,O,O,O,O,X,X,(hII,vIG),O,O,O,X,X,(hIE,vJA),O,O,O,(vB),(vJI),(hDG),C,O,O,O,O,O,(hJF),O,O,X,(hH),O,O','7,X,(vHH),(vBE),X,X,X,X,(hE),B,O,X,(vHF),(vBJ),X,(hHI),C,O,(hJ,vHI),O,O,X,X,(hBC),D,O,O,O,X,X,(hHH),O,O,D,O,(vHF),X,(hHD),F,O,(hHD),G,O,X,X,X,X,(hHE),O,O','7,X,X,X,X,X,(vIF),(vI),X,X,X,X,(hB,vGF),O,O,X,X,(vEG),(hGG,vB),O,O,O,X,(hGJ),O,O,O,H,X,X,(hGA,vA),O,O,O,O,X,(hGC),I,H,O,X,X,X,(hH),G,J,X,X,X,X','7,X,X,X,X,X,(vJF),(vJF),X,X,X,X,(hJD),A,O,X,X,(vBG),(vJB),(hI,vI),O,O,X,(hBD,vJF),F,O,O,E,O,(hIB),O,O,O,O,C,X,(hJG),O,B,X,X,X,X,(hI),O,J,X,X,X,X','6,X,X,(vEI),(vC),X,X,X,(hH,vGG),O,O,(vGD),X,(hBJ),O,O,O,O,(vD),(hGI),O,O,(hD,vD),E,G,X,(hBG),O,O,A,O,X,X,(hJ),O,O,X','7,X,X,X,X,(vFI),(vJF),X,X,X,X,(hJH),O,O,(vJC),X,X,X,(hEE,vEC),O,O,O,X,(vJE),(hED,vEF),O,O,O,G,(hJB),O,O,O,O,X,X,(hEH),O,O,G,X,X,X,X,(hJG),O,O,X,X,X','7,X,X,X,(vJ),(vEI),X,X,X,X,(hJ,vEC),O,A,(vBD),X,X,(hHC,vEA),O,O,O,I,(vF),(hEE),O,O,(hEE,vHD),B,J,O,(hHE),O,O,O,(hG,vED),O,O,X,(hHD),O,O,O,O,X,X,X,(hEA),O,O,X,X','7,X,X,X,X,X,(vFH),(vED),X,X,X,X,(hEC,vEA),O,O,X,X,(vED),(hFI,vEH),O,O,O,X,(hEE),O,O,A,D,X,X,(hFB,vJ),O,O,O,J,X,(hFI),O,O,O,X,X,X,(hI),O,A,X,X,X,X','6,X,(vB),(vHI),X,X,X,(hHH),O,O,(vHJ),(vGA),X,(hHH),O,O,O,I,X,X,(hGE),O,A,O,(vHE),X,(hHJ),H,B,F,D,X,X,X,(hHJ),O,C'
+]
+
+kakuro(testPuzzles);
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-425-prime-connection.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-425-prime-connection.md
index d46740b0d58..dfba791e407 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-425-prime-connection.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-425-prime-connection.md
@@ -1,33 +1,36 @@
 ---
 id: 5900f5151000cf542c510028
 title: 'Problem 425: Prime connection'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302095
 dashedName: problem-425-prime-connection
 ---
 
 # --description--
 
-Two positive numbers A and B are said to be connected (denoted by "A ↔ B") if one of these conditions holds:
+Two positive numbers $A$ and $B$ are said to be connected (denoted by "$A ↔ B$") if one of these conditions holds:
 
-(1) A and B have the same length and differ in exactly one digit; for example, 123 ↔ 173.
+1. $A$ and $B$ have the same length and differ in exactly one digit; for example, $123 ↔ 173$.
+2. Adding one digit to the left of $A$ (or $B$) makes $B$ (or $A$); for example, $23 ↔ 223$ and $123 ↔ 23$.
 
-(2) Adding one digit to the left of A (or B) makes B (or A); for example, 23 ↔ 223 and 123 ↔ 23.
+We call a prime $P$ a 2's relative if there exists a chain of connected primes between 2 and $P$ and no prime in the chain exceeds $P$.
 
-We call a prime P a 2's relative if there exists a chain of connected primes between 2 and P and no prime in the chain exceeds P.
+For example, 127 is a 2's relative. One of the possible chains is shown below:
 
-For example, 127 is a 2's relative. One of the possible chains is shown below: 2 ↔ 3 ↔ 13 ↔ 113 ↔ 103 ↔ 107 ↔ 127 However, 11 and 103 are not 2's relatives.
+$$2 ↔ 3 ↔ 13 ↔ 113 ↔ 103 ↔ 107 ↔ 127$$
 
-Let F(N) be the sum of the primes ≤ N which are not 2's relatives. We can verify that F(103) = 431 and F(104) = 78728.
+However, 11 and 103 are not 2's relatives.
 
-Find F(107).
+Let $F(N)$ be the sum of the primes $≤ N$ which are not 2's relatives. We can verify that $F({10}^3) = 431$ and $F({10}^4) = 78\\,728$.
+
+Find $F({10}^7)$.
 
 # --hints--
 
-`euler425()` should return 46479497324.
+`primeConnection()` should return `46479497324`.
 
 ```js
-assert.strictEqual(euler425(), 46479497324);
+assert.strictEqual(primeConnection(), 46479497324);
 ```
 
 # --seed--
@@ -35,12 +38,12 @@ assert.strictEqual(euler425(), 46479497324);
 ## --seed-contents--
 
 ```js
-function euler425() {
+function primeConnection() {
 
   return true;
 }
 
-euler425();
+primeConnection();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md
index 5e2c48c34e0..89314f8aa76 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5171000cf542c510029
 title: 'Problem 426: Box-ball system'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302096
 dashedName: problem-426-box-ball-system
 ---
@@ -14,20 +14,31 @@ A turn consists of moving each ball exactly once according to the following rule
 
 After one turn the sequence (2, 2, 2, 1, 2) becomes (2, 2, 1, 2, 3) as can be seen below; note that we begin the new sequence starting at the first occupied box.
 
+<img class="img-responsive center-block" alt="animation showing one complete turn from (2, 2, 2, 1, 2) to (2, 2, 1, 2, 3)" src="https://cdn.freecodecamp.org/curriculum/project-euler/box-ball-system-1.gif" style="background-color: white; padding: 10px;" />
+
 A system like this is called a Box-Ball System or BBS for short.
 
-It can be shown that after a sufficient number of turns, the system evolves to a state where the consecutive numbers of occupied boxes is invariant. In the example below, the consecutive numbers of occupied boxes evolves to \[1, 2, 3]; we shall call this the final state.
+It can be shown that after a sufficient number of turns, the system evolves to a state where the consecutive numbers of occupied boxes is invariant. In the example below, the consecutive numbers of occupied boxes evolves to [1, 2, 3]; we shall call this the final state.
 
-We define the sequence {ti}:s0 = 290797 sk+1 = sk2 mod 50515093 tk = (sk mod 64) + 1
+<img class="img-responsive center-block" alt="four turns from occupied boxes [2, 2, 2] to final state [1, 2, 3]" src="https://cdn.freecodecamp.org/curriculum/project-euler/box-ball-system-2.gif" style="background-color: white; padding: 10px;" />
 
-Starting from the initial configuration (t0, t1, …, t10), the final state becomes \[1, 3, 10, 24, 51, 75]. Starting from the initial configuration (t0, t1, …, t10 000 000), find the final state. Give as your answer the sum of the squares of the elements of the final state. For example, if the final state is \[1, 2, 3] then 14 ( = 12 + 22 + 32) is your answer.
+We define the sequence $\\{t_i\\}$:
+
+$$\begin{align}   & s_0 = 290\\,797 \\\\
+  & s_{k + 1} = {s_k}^2\bmod 50\\,515\\,093 \\\\ & t_k = (s_k\bmod 64) + 1 \end{align}$$
+
+Starting from the initial configuration $(t_0, t_1, \ldots, t_{10})$, the final state becomes [1, 3, 10, 24, 51, 75].
+
+Starting from the initial configuration $(t_0, t_1, \ldots, t_{10\\,000\\,000})$, find the final state.
+
+Give as your answer the sum of the squares of the elements of the final state. For example, if the final state is [1, 2, 3] then $14 (= 1^2 + 2^2 + 3^2)$ is your answer.
 
 # --hints--
 
-`euler426()` should return 31591886008.
+`boxBallSystem()` should return `31591886008`.
 
 ```js
-assert.strictEqual(euler426(), 31591886008);
+assert.strictEqual(boxBallSystem(), 31591886008);
 ```
 
 # --seed--
@@ -35,12 +46,12 @@ assert.strictEqual(euler426(), 31591886008);
 ## --seed-contents--
 
 ```js
-function euler426() {
+function boxBallSystem() {
 
   return true;
 }
 
-euler426();
+boxBallSystem();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-427-n-sequences.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-427-n-sequences.md
index 8f399eeaf0a..3f244f7937c 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-427-n-sequences.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-427-n-sequences.md
@@ -1,31 +1,31 @@
 ---
 id: 5900f5181000cf542c51002a
 title: 'Problem 427: n-sequences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302097
 dashedName: problem-427-n-sequences
 ---
 
 # --description--
 
-A sequence of integers S = {si} is called an n-sequence if it has n elements and each element si satisfies 1 ≤ si ≤ n. Thus there are nn distinct n-sequences in total.
+A sequence of integers $S = \\{s_i\\}$ is called an $n$-sequence if it has $n$ elements and each element $s_i$ satisfies $1 ≤ s_i ≤ n$. Thus there are $n^n$ distinct $n$-sequences in total.
 
-For example, the sequence S = {1, 5, 5, 10, 7, 7, 7, 2, 3, 7} is a 10-sequence.
+For example, the sequence $S = \\{1, 5, 5, 10, 7, 7, 7, 2, 3, 7\\}$ is a 10-sequence.
 
-For any sequence S, let L(S) be the length of the longest contiguous subsequence of S with the same value. For example, for the given sequence S above, L(S) = 3, because of the three consecutive 7's.
+For any sequence $S$, let $L(S)$ be the length of the longest contiguous subsequence of $S$ with the same value. For example, for the given sequence $S$ above, $L(S) = 3$, because of the three consecutive 7's.
 
-Let f(n) = ∑ L(S) for all n-sequences S.
+Let $f(n) = \sum L(S)$ for all $n$-sequences $S$.
 
-For example, f(3) = 45, f(7) = 1403689 and f(11) = 481496895121.
+For example, $f(3) = 45$, $f(7) = 1\\,403\\,689$ and $f(11) = 481\\,496\\,895\\,121$.
 
-Find f(7 500 000) mod 1 000 000 009.
+Find $f(7\\,500\\,000)\bmod 1\\,000\\,000\\,009$.
 
 # --hints--
 
-`euler427()` should return 97138867.
+`nSequences()` should return `97138867`.
 
 ```js
-assert.strictEqual(euler427(), 97138867);
+assert.strictEqual(nSequences(), 97138867);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler427(), 97138867);
 ## --seed-contents--
 
 ```js
-function euler427() {
+function nSequences() {
 
   return true;
 }
 
-euler427();
+nSequences();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md
index 5919151606c..aaec6448364 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md
@@ -1,34 +1,39 @@
 ---
 id: 5900f5191000cf542c51002b
-title: 'Problem 428: Necklace of Circles'
-challengeType: 5
+title: '問題 428：圓圈項鍊'
+challengeType: 1
 forumTopicId: 302098
 dashedName: problem-428-necklace-of-circles
 ---
 
 # --description--
 
-Let `a`, `b` and `c` be positive numbers.
+令 $a$、$b$ 和 $c$ 爲正數。
 
-Let W, X, Y, Z be four collinear points where |WX| = `a`, |XY| = `b`, |YZ| = `c` and |WZ| = `a` + `b` + `c`.
+令 $W$, $X$, $Y$, $Z$ 爲在一條直線上的四個點，其中 $|WX| = a$, $|XY| = b$, $|YZ| = c$ 且 $|WZ| = a + b + c$。
 
-Let C<sub>in</sub> be the circle having the diameter XY.
+令 $C_{\text{in}}$ 是直徑爲 $XY$ 的圓。
 
-Let C<sub>out</sub> be the circle having the diameter WZ.
+令 $C_{\text{out}}$ 是直徑爲 $WZ$ 的圓。
 
-The triplet (`a`, `b`, `c`) is called a *necklace triplet* if you can place `k` ≥ 3 distinct circles C<sub>1</sub>, C<sub>2</sub>, ..., C<sub><var>k</var></sub> such that:
+定義三元組（$a$, $b$, $c$），如果可以同時放置 $k ≥ 3$ 個不同的圓 $C_1, C_2, \ldots, C_k$，且這些圓之間滿足以下條件，則這個三元組被稱爲*項鍊三元組*：
 
-<ul><li>C<sub><var>i</var></sub> has no common interior points with any C<sub><var>j</var></sub> for 1 ≤ <var>i</var>, <var>j</var> ≤ <var>k</var> and <var>i</var> ≠ <var>j</var>,</li><li>C<sub><var>i</var></sub> is tangent to both C<sub>in</sub> and C<sub>out</sub> for 1 ≤ <var>i</var> ≤ <var>k</var>,</li><li>C<sub><var>i</var></sub> is tangent to C<sub><var>i</var>+1</sub> for 1 ≤ <var>i</var> &lt; <var>k</var>, and</li><li>C<sub><var>k</var></sub> is tangent to C<sub>1</sub>.</li></ul>
-For example, (5, 5, 5) and (4, 3, 21) are necklace triplets, while it can be shown that (2, 2, 5) is not.
-<img src="https://projecteuler.net/project/images/p428_necklace.png" alt="a visual representation of a necklace triplet" />
+- 對於任意的 $1 ≤ i$, $j ≤ k$ 且 $i ≠ j$，$C_i$ 與 $C_j$ 不相交。
+- 對於任意的 $1 ≤ i ≤ k$，$C_i$ 同時與 $C_{\text{in}}$ 和 $C_{\text{out}}$ 相切，
+- 對於任意的 $1 ≤ i &lt; k$，$C_i$ 與 $C_{i + 1}$ 相切。
+- $C_k$ 與 $C_1$ 相切。
 
-Let T(`n`) be the number of necklace triplets (`a`, `b`, `c`) such that `a`, `b` and `c` are positive integers, and `b` ≤ `n`. For example, T(1) = 9, T(20) = 732 and T(3000) = 438106.
+例如，(5, 5, 5) 與 (4, 3, 21) 是項鍊三元組，而 (2, 2, 5) 不是。
 
-Find T(1 000 000 000).
+<img class="img-responsive center-block" alt="項鍊三元組的視覺表現。" src="https://cdn.freecodecamp.org/curriculum/project-euler/necklace-of-circles.png" style="background-color: white; padding: 10px;" />
+
+定義 $T(n)$ 爲項鍊三元組 $(a, b, c)$ 的數量，其中 $a$，$b$ 和 $c$ 爲正整數，且 $b ≤ n$。 例如，$T(1) = 9$，$T(20) = 732$，$T(3\\,000) = 438\\,106$。
+
+請計算 $T(1\\,000\\,000\\,000)$。
 
 # --hints--
 
-`necklace(1000000000)` should return 747215561862.
+`necklace(1000000000)` 應該返回 `747215561862`。
 
 ```js
 assert.strictEqual(necklace(1000000000), 747215561862);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md
index 8b9c108829c..928c602299f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f5191000cf542c51002c
 title: 'Problem 429: Sum of squares of unitary divisors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302099
 dashedName: problem-429-sum-of-squares-of-unitary-divisors
 ---
 
 # --description--
 
-A unitary divisor d of a number n is a divisor of n that has the property gcd(d, n/d) = 1.
+A unitary divisor $d$ of a number $n$ is a divisor of $n$ that has the property $gcd(d, \frac{n}{d}) = 1$.
 
-The unitary divisors of 4! = 24 are 1, 3, 8 and 24.
+The unitary divisors of $4! = 24$ are 1, 3, 8 and 24.
 
-The sum of their squares is 12 + 32 + 82 + 242 = 650.
+The sum of their squares is $12 + 32 + 82 + 242 = 650$.
 
-Let S(n) represent the sum of the squares of the unitary divisors of n. Thus S(4!)=650.
+Let $S(n)$ represent the sum of the squares of the unitary divisors of $n$. Thus $S(4!) = 650$.
 
-Find S(100 000 000!) modulo 1 000 000 009.
+Find $S(100\\,000\\,000!)$ modulo $1\\,000\\,000\\,009$.
 
 # --hints--
 
-`euler429()` should return 98792821.
+`sumSquaresOfUnitaryDivisors()` should return `98792821`.
 
 ```js
-assert.strictEqual(euler429(), 98792821);
+assert.strictEqual(sumSquaresOfUnitaryDivisors(), 98792821);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler429(), 98792821);
 ## --seed-contents--
 
 ```js
-function euler429() {
+function sumSquaresOfUnitaryDivisors() {
 
   return true;
 }
 
-euler429();
+sumSquaresOfUnitaryDivisors();
 ```
 
 # --solutions--
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 7c3a5a83420..53ae7b50350 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3971000cf542c50feaa
 title: 'Problem 43: Sub-string divisibility'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302100
 dashedName: problem-43-sub-string-divisibility
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-430-range-flips.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-430-range-flips.md
index ba66983c7b3..d8838dbe162 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-430-range-flips.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-430-range-flips.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f51a1000cf542c51002d
 title: 'Problem 430: Range flips'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302101
 dashedName: problem-430-range-flips
 ---
 
 # --description--
 
-N disks are placed in a row, indexed 1 to N from left to right.
+$N$ disks are placed in a row, indexed 1 to $N$ from left to right.
 
 Each disk has a black side and white side. Initially all disks show their white side.
 
-At each turn, two, not necessarily distinct, integers A and B between 1 and N (inclusive) are chosen uniformly at random. All disks with an index from A to B (inclusive) are flipped.
+At each turn, two, not necessarily distinct, integers $A$ and $B$ between 1 and $N$ (inclusive) are chosen uniformly at random. All disks with an index from $A$ to $B$ (inclusive) are flipped.
 
-The following example shows the case N = 8. At the first turn A = 5 and B = 2, and at the second turn A = 4 and B = 6.
+The following example shows the case $N = 8$. At the first turn $A = 5$ and $B = 2$, and at the second turn $A = 4$ and $B = 6$.
 
-Let E(N, M) be the expected number of disks that show their white side after M turns. We can verify that E(3, 1) = 10/9, E(3, 2) = 5/3, E(10, 4) ≈ 5.157 and E(100, 10) ≈ 51.893.
+<img class="img-responsive center-block" alt="example for N = 8, with first turn A = 5 and B = 2, and second turn A = 4 and B = 6" src="https://cdn.freecodecamp.org/curriculum/project-euler/range-flips.gif" style="background-color: white; padding: 10px;" />
 
-Find E(1010, 4000). Give your answer rounded to 2 decimal places behind the decimal point.
+Let $E(N, M)$ be the expected number of disks that show their white side after $M$ turns. We can verify that $E(3, 1) = \frac{10}{9}$, $E(3, 2) = \frac{5}{3}$, $E(10, 4) ≈ 5.157$ and $E(100, 10) ≈ 51.893$.
+
+Find $E({10}^{10}, 4000)$. Give your answer rounded to 2 decimal places behind the decimal point.
 
 # --hints--
 
-`euler430()` should return 5000624921.38.
+`rangeFlips()` should return `5000624921.38`.
 
 ```js
-assert.strictEqual(euler430(), 5000624921.38);
+assert.strictEqual(rangeFlips(), 5000624921.38);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler430(), 5000624921.38);
 ## --seed-contents--
 
 ```js
-function euler430() {
+function rangeFlips() {
 
   return true;
 }
 
-euler430();
+rangeFlips();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md
index 51a104b47a0..4199819468b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f51b1000cf542c51002e
 title: 'Problem 431: Square Space Silo'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302102
 dashedName: problem-431-square-space-silo
 ---
@@ -10,20 +10,22 @@ dashedName: problem-431-square-space-silo
 
 Fred the farmer arranges to have a new storage silo installed on his farm and having an obsession for all things square he is absolutely devastated when he discovers that it is circular. Quentin, the representative from the company that installed the silo, explains that they only manufacture cylindrical silos, but he points out that it is resting on a square base. Fred is not amused and insists that it is removed from his property.
 
-Quick thinking Quentin explains that when granular materials are delivered from above a conical slope is formed and the natural angle made with the horizontal is called the angle of repose. For example if the angle of repose, $\\alpha = 30$ degrees, and grain is delivered at the centre of the silo then a perfect cone will form towards the top of the cylinder. In the case of this silo, which has a diameter of 6m, the amount of space wasted would be approximately 32.648388556 m3. However, if grain is delivered at a point on the top which has a horizontal distance of $x$ metres from the centre then a cone with a strangely curved and sloping base is formed. He shows Fred a picture.
+Quick thinking Quentin explains that when granular materials are delivered from above a conical slope is formed and the natural angle made with the horizontal is called the angle of repose. For example if the angle of repose, $\alpha = 30°$, and grain is delivered at the centre of the silo then a perfect cone will form towards the top of the cylinder. In the case of this silo, which has a diameter of 6m, the amount of space wasted would be approximately 32.648388556 m<sup>3</sup>. However, if grain is delivered at a point on the top which has a horizontal distance of $x$ metres from the centre then a cone with a strangely curved and sloping base is formed. He shows Fred a picture.
 
-We shall let the amount of space wasted in cubic metres be given by $V(x)$. If $x = 1.114785284$, which happens to have three squared decimal places, then the amount of space wasted, $V(1.114785284) \\approx 36$. Given the range of possible solutions to this problem there is exactly one other option: $V(2.511167869) \\approx 49$. It would be like knowing that the square is king of the silo, sitting in splendid glory on top of your grain.
+<img class="img-responsive center-block" alt="image presenting forming of the perfect cone towards the top of the cylinder" src="https://cdn.freecodecamp.org/curriculum/project-euler/square-space-silo.png" style="background-color: white; padding: 10px;" />
 
-Fred's eyes light up with delight at this elegant resolution, but on closer inspection of Quentin's drawings and calculations his happiness turns to despondency once more. Fred points out to Quentin that it's the radius of the silo that is 6 metres, not the diameter, and the angle of repose for his grain is 40 degrees. However, if Quentin can find a set of solutions for this particular silo then he will be more than happy to keep it.
+We shall let the amount of space wasted in cubic metres be given by $V(x)$. If $x = 1.114\\,785\\,284$, which happens to have three squared decimal places, then the amount of space wasted, $V(1.114\\,785\\,284) \approx 36$. Given the range of possible solutions to this problem there is exactly one other option: $V(2.511\\,167\\,869) \approx 49$. It would be like knowing that the square is king of the silo, sitting in splendid glory on top of your grain.
 
-If Quick thinking Quentin is to satisfy frustratingly fussy Fred the farmer's appetite for all things square then determine the values of $x$ for all possible square space wastage options and calculate $\\sum x$ correct to 9 decimal places.
+Fred's eyes light up with delight at this elegant resolution, but on closer inspection of Quentin's drawings and calculations his happiness turns to despondency once more. Fred points out to Quentin that it's the radius of the silo that is 6 metres, not the diameter, and the angle of repose for his grain is 40­°. However, if Quentin can find a set of solutions for this particular silo then he will be more than happy to keep it.
+
+If Quick thinking Quentin is to satisfy frustratingly fussy Fred the farmer's appetite for all things square then determine the values of $x$ for all possible square space wastage options and calculate $\sum x$ correct to 9 decimal places.
 
 # --hints--
 
-`euler431()` should return 23.386029052.
+`squareSpaceSilo()` should return `23.386029052`.
 
 ```js
-assert.strictEqual(euler431(), 23.386029052);
+assert.strictEqual(squareSpaceSilo(), 23.386029052);
 ```
 
 # --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler431(), 23.386029052);
 ## --seed-contents--
 
 ```js
-function euler431() {
+function squareSpaceSilo() {
 
   return true;
 }
 
-euler431();
+squareSpaceSilo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-432-totient-sum.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-432-totient-sum.md
index 4f0f5928ef5..2a3f5b744d9 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-432-totient-sum.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-432-totient-sum.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f51e1000cf542c510030
 title: 'Problem 432: Totient sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302103
 dashedName: problem-432-totient-sum
 ---
 
 # --description--
 
-Let S(n,m) = ∑φ(n × i) for 1 ≤ i ≤ m. (φ is Euler's totient function)
+Let $S(n, m) = \sum φ(n × i)$ for $1 ≤ i ≤ m$. ($φ$ is Euler's totient function)
 
-You are given that S(510510,106 )= 45480596821125120.
+You are given that $S(510\\,510, {10}^6) = 45\\,480\\,596\\,821\\,125\\,120$.
 
-Find S(510510,1011). Give the last 9 digits of your answer.
+Find $S(510\\,510, {10}^{11})$. Give the last 9 digits of your answer.
 
 # --hints--
 
-`euler432()` should return 754862080.
+`totientSum()` should return `754862080`.
 
 ```js
-assert.strictEqual(euler432(), 754862080);
+assert.strictEqual(totientSum(), 754862080);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler432(), 754862080);
 ## --seed-contents--
 
 ```js
-function euler432() {
+function totientSum() {
 
   return true;
 }
 
-euler432();
+totientSum();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.md
index 5423c8691c9..4db4c121e91 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.md
@@ -1,29 +1,34 @@
 ---
 id: 5900f51d1000cf542c51002f
 title: 'Problem 433: Steps in Euclid''s algorithm'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302104
 dashedName: problem-433-steps-in-euclids-algorithm
 ---
 
 # --description--
 
-Let E(x0, y0) be the number of steps it takes to determine the greatest common divisor of x0 and y0 with Euclid's algorithm. More formally:x1 = y0, y1 = x0 mod y0xn = yn-1, yn = xn-1 mod yn-1
+Let $E(x_0, y_0)$ be the number of steps it takes to determine the greatest common divisor of $x_0$ and $y_0$ with Euclid's algorithm. More formally:
 
-E(x0, y0) is the smallest n such that yn = 0.
+$$\begin{align}   & x_1 = y_0, y_1 = x_0\bmod y_0 \\\\
+  & x_n = y_{n - 1}, y_n = x_{n - 1}\bmod y_{n - 1} \end{align}$$
 
-We have E(1,1) = 1, E(10,6) = 3 and E(6,10) = 4.
+$E(x_0, y_0)$ is the smallest $n$ such that $y_n = 0$.
 
-Define S(N) as the sum of E(x,y) for 1 ≤ x,y ≤ N. We have S(1) = 1, S(10) = 221 and S(100) = 39826.
+We have $E(1, 1) = 1$, $E(10, 6) = 3$ and $E(6, 10) = 4$.
 
-Find S(5·106).
+Define $S(N)$ as the sum of $E(x, y)$ for $1 ≤ x$, $y ≤ N$.
+
+We have $S(1) = 1$, $S(10) = 221$ and $S(100) = 39\\,826$.
+
+Find $S(5 \times {10}^6)$.
 
 # --hints--
 
-`euler433()` should return 326624372659664.
+`stepsInEuclidsAlgorithm()` should return `326624372659664`.
 
 ```js
-assert.strictEqual(euler433(), 326624372659664);
+assert.strictEqual(stepsInEuclidsAlgorithm(), 326624372659664);
 ```
 
 # --seed--
@@ -31,12 +36,12 @@ assert.strictEqual(euler433(), 326624372659664);
 ## --seed-contents--
 
 ```js
-function euler433() {
+function stepsInEuclidsAlgorithm() {
 
   return true;
 }
 
-euler433();
+stepsInEuclidsAlgorithm();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md
index 48a01b7a3ba..a570e51bccb 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f51f1000cf542c510031
 title: 'Problem 434: Rigid graphs'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302105
 dashedName: problem-434-rigid-graphs
 ---
@@ -18,18 +18,32 @@ A rigid graph is an embedding of a graph which is not flexible.
 
 Informally, a graph is rigid if by replacing the vertices with fully rotating hinges and the edges with rods that are unbending and inelastic, no parts of the graph can be moved independently from the rest of the graph.
 
-The grid graphs embedded in the Euclidean plane are not rigid, as the following animation demonstrates: However, one can make them rigid by adding diagonal edges to the cells. For example, for the 2x3 grid graph, there are 19 ways to make the graph rigid: Note that for the purposes of this problem, we do not consider changing the orientation of a diagonal edge or adding both diagonal edges to a cell as a different way of making a grid graph rigid.
+The grid graphs embedded in the Euclidean plane are not rigid, as the following animation demonstrates:
 
-Let R(m,n) be the number of ways to make the m × n grid graph rigid. E.g. R(2,3) = 19 and R(5,5) = 23679901
+<img class="img-responsive center-block" alt="animation showing grid graphs are not rigid in Euclidean plane" src="https://cdn.freecodecamp.org/curriculum/project-euler/rigid-graphs-1.gif" style="background-color: white; padding: 10px;" />
 
-Define S(N) as ∑R(i,j) for 1 ≤ i, j ≤ N. E.g. S(5) = 25021721. Find S(100), give your answer modulo 1000000033
+However, one can make them rigid by adding diagonal edges to the cells. For example, for the 2x3 grid graph, there are 19 ways to make the graph rigid:
+
+<img class="img-responsive center-block" alt="19 ways to make 2x3 grid graph rigid" src="https://cdn.freecodecamp.org/curriculum/project-euler/rigid-graphs-2.png" style="background-color: white; padding: 10px;" />
+
+Note that for the purposes of this problem, we do not consider changing the orientation of a diagonal edge or adding both diagonal edges to a cell as a different way of making a grid graph rigid.
+
+Let $R(m, n)$ be the number of ways to make the $m × n$ grid graph rigid.
+
+E.g. $R(2, 3) = 19$ and $R(5, 5) = 23\\,679\\,901$.
+
+Define $S(N)$ as $\sum R(i, j)$ for $1 ≤ i$, $j ≤ N$.
+
+E.g. $S(5) = 25\\,021\\,721$.
+
+Find $S(100)$, give your answer modulo $1\\,000\\,000\\,033$.
 
 # --hints--
 
-`euler434()` should return 863253606.
+`rigidGraphs()` should return `863253606`.
 
 ```js
-assert.strictEqual(euler434(), 863253606);
+assert.strictEqual(rigidGraphs(), 863253606);
 ```
 
 # --seed--
@@ -37,12 +51,12 @@ assert.strictEqual(euler434(), 863253606);
 ## --seed-contents--
 
 ```js
-function euler434() {
+function rigidGraphs() {
 
   return true;
 }
 
-euler434();
+rigidGraphs();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.md
index ee078a73824..9df767adcee 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f5201000cf542c510032
 title: 'Problem 435: Polynomials of Fibonacci numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302106
 dashedName: problem-435-polynomials-of-fibonacci-numbers
 ---
 
 # --description--
 
-The Fibonacci numbers {fn, n ≥ 0} are defined recursively as fn = fn-1 + fn-2 with base cases f0 = 0 and f1 = 1.
+The Fibonacci numbers $\\{f_n, n ≥ 0\\}$ are defined recursively as $f_n = f_{n - 1} + f_{n - 2}$ with base cases $f_0 = 0$ and $f_1 = 1$.
 
-Define the polynomials {Fn, n ≥ 0} as Fn(x) = ∑fixi for 0 ≤ i ≤ n.
+Define the polynomials $\\{F_n, n ≥ 0\\}$ as $F_n(x) = \displaystyle\sum_{i = 0}^n f_ix^i$.
 
-For example, F7(x) = x + x2 + 2x3 + 3x4 + 5x5 + 8x6 + 13x7, and F7(11) = 268357683.
+For example, $F_7(x) = x + x^2 + 2x^3 + 3x^4 + 5x^5 + 8x^6 + 13x^7$, and $F_7(11) = 268\\,357\\,683$.
 
-Let n = 1015. Find the sum \[∑0≤x≤100 Fn(x)] mod 1307674368000 (= 15!).
+Let $n = {10}^{15}$. Find the sum $\displaystyle\sum_{x = 0}^{100} F_n(x)$ and give your answer modulo $1\\,307\\,674\\,368\\,000 \\, (= 15!)$.
 
 # --hints--
 
-`euler435()` should return 252541322550.
+`polynomialsOfFibonacciNumbers()` should return `252541322550`.
 
 ```js
-assert.strictEqual(euler435(), 252541322550);
+assert.strictEqual(polynomialsOfFibonacciNumbers(), 252541322550);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler435(), 252541322550);
 ## --seed-contents--
 
 ```js
-function euler435() {
+function polynomialsOfFibonacciNumbers() {
 
   return true;
 }
 
-euler435();
+polynomialsOfFibonacciNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-436-unfair-wager.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-436-unfair-wager.md
index 43b111b868f..444c6f95d1b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-436-unfair-wager.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-436-unfair-wager.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5221000cf542c510033
 title: 'Problem 436: Unfair wager'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302107
 dashedName: problem-436-unfair-wager
 ---
@@ -14,24 +14,26 @@ She suggests they play a game of chance to determine who will wash the dishes.
 
 For this game, they shall use a generator of independent random numbers uniformly distributed between 0 and 1.
 
-The game starts with S = 0.
+The game starts with $S = 0$.
 
-The first player, Louise, adds to S different random numbers from the generator until S > 1 and records her last random number 'x'.
+The first player, Louise, adds to $S$ different random numbers from the generator until $S > 1$ and records her last random number '$x$'.
 
-The second player, Julie, continues adding to S different random numbers from the generator until S > 2 and records her last random number 'y'.
+The second player, Julie, continues adding to $S$ different random numbers from the generator until $S > 2$ and records her last random number '$y$'.
 
-The player with the highest number wins and the loser washes the dishes, i.e. if y > x the second player wins.
+The player with the highest number wins and the loser washes the dishes, i.e. if $y > x$ the second player wins.
 
-For example, if the first player draws 0.62 and 0.44, the first player turn ends since 0.62+0.44 > 1 and x = 0.44. If the second players draws 0.1, 0.27 and 0.91, the second player turn ends since 0.62+0.44+0.1+0.27+0.91 > 2 and y = 0.91. Since y > x, the second player wins.
+For example, if the first player draws 0.62 and 0.44, the first player turn ends since $0.62 + 0.44 > 1$ and $x = 0.44$. If the second players draws 0.1, 0.27 and 0.91, the second player turn ends since $0.62 + 0.44 + 0.1 + 0.27 + 0.91 > 2$ and $y = 0.91$. Since $y > x$, the second player wins.
 
-Louise thinks about it for a second, and objects: "That's not fair". What is the probability that the second player wins? Give your answer rounded to 10 places behind the decimal point in the form 0.abcdefghij
+Louise thinks about it for a second, and objects: "That's not fair".
+
+What is the probability that the second player wins? Give your answer rounded to 10 places behind the decimal point in the form 0.abcdefghij
 
 # --hints--
 
-`euler436()` should return 0.5276662759.
+`unfairWager()` should return `0.5276662759`.
 
 ```js
-assert.strictEqual(euler436(), 0.5276662759);
+assert.strictEqual(unfairWager(), 0.5276662759);
 ```
 
 # --seed--
@@ -39,12 +41,12 @@ assert.strictEqual(euler436(), 0.5276662759);
 ## --seed-contents--
 
 ```js
-function euler436() {
+function unfairWager() {
 
   return true;
 }
 
-euler436();
+unfairWager();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md
index 0072d0f9a9b..47f1606285d 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f5241000cf542c510036
 title: 'Problem 437: Fibonacci primitive roots'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302108
 dashedName: problem-437-fibonacci-primitive-roots
 ---
 
 # --description--
 
-When we calculate 8n modulo 11 for n=0 to 9 we get: 1, 8, 9, 6, 4, 10, 3, 2, 5, 7.
+When we calculate $8^n$ modulo 11 for $n = 0$ to 9 we get: 1, 8, 9, 6, 4, 10, 3, 2, 5, 7.
 
 As we see all possible values from 1 to 10 occur. So 8 is a primitive root of 11.
 
@@ -16,32 +16,24 @@ But there is more:
 
 If we take a closer look we see:
 
-1+8=9
+$$\begin{align}   & 1 + 8 = 9 \\\\
+  & 8 + 9 = 17 ≡ 6\bmod 11 \\\\   & 9 + 6 = 15 ≡ 4\bmod 11 \\\\
+  & 6 + 4 = 10 \\\\   & 4 + 10 = 14 ≡ 3\bmod 11 \\\\
+  & 10 + 3 = 13 ≡ 2\bmod 11 \\\\   & 3 + 2 = 5 \\\\
+  & 2 + 5 = 7 \\\\ & 5 + 7 = 12 ≡ 1\bmod 11. \end{align}$$
 
-8+9=17≡6 mod 11
+So the powers of 8 mod 11 are cyclic with period 10, and $8^n + 8^{n + 1} ≡ 8^{n + 2} (\text{mod } 11)$. 8 is called a Fibonacci primitive root of 11.
 
-9+6=15≡4 mod 11
+Not every prime has a Fibonacci primitive root. There are 323 primes less than 10000 with one or more Fibonacci primitive roots and the sum of these primes is 1480491.
 
-6+4=10
-
-4+10=14≡3 mod 11
-
-10+3=13≡2 mod 11
-
-3+2=5
-
-2+5=7
-
-5+7=12≡1 mod 11.
-
-So the powers of 8 mod 11 are cyclic with period 10, and 8n + 8n+1 ≡ 8n+2 (mod 11). 8 is called a Fibonacci primitive root of 11. Not every prime has a Fibonacci primitive root. There are 323 primes less than 10000 with one or more Fibonacci primitive roots and the sum of these primes is 1480491. Find the sum of the primes less than 100,000,000 with at least one Fibonacci primitive root.
+Find the sum of the primes less than $100\\,000\\,000$ with at least one Fibonacci primitive root.
 
 # --hints--
 
-`euler437()` should return 74204709657207.
+`fibonacciPrimitiveRoots()` should return `74204709657207`.
 
 ```js
-assert.strictEqual(euler437(), 74204709657207);
+assert.strictEqual(fibonacciPrimitiveRoots(), 74204709657207);
 ```
 
 # --seed--
@@ -49,12 +41,12 @@ assert.strictEqual(euler437(), 74204709657207);
 ## --seed-contents--
 
 ```js
-function euler437() {
+function fibonacciPrimitiveRoots() {
 
   return true;
 }
 
-euler437();
+fibonacciPrimitiveRoots();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md
index 112326a2fa3..05c8bd7d4a5 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md
@@ -1,27 +1,34 @@
 ---
 id: 5900f5231000cf542c510034
 title: 'Problem 438: Integer part of polynomial equation''s solutions'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302109
 dashedName: problem-438-integer-part-of-polynomial-equations-solutions
 ---
 
 # --description--
 
-For an n-tuple of integers t = (a1, ..., an), let (x1, ..., xn) be the solutions of the polynomial equation xn + a1xn-1 + a2xn-2 + ... + an-1x + an = 0.
+For an $n$-tuple of integers $t = (a_1, \ldots, a_n)$, let $(x_1, \ldots, x_n)$ be the solutions of the polynomial equation $x^n + a_1x^{n - 1} + a_2x^{n - 2} + \ldots + a_{n - 1}x + a_n = 0$.
 
-Consider the following two conditions: x1, ..., xn are all real. If x1, ..., xn are sorted, ⌊xi⌋ = i for 1 ≤ i ≤ n. (⌊·⌋: floor function.)
+Consider the following two conditions:
 
-In the case of n = 4, there are 12 n-tuples of integers which satisfy both conditions. We define S(t) as the sum of the absolute values of the integers in t. For n = 4 we can verify that ∑S(t) = 2087 for all n-tuples t which satisfy both conditions.
+- $x_1, \ldots, x_n$ are all real.
+- If $x_1, ..., x_n$ are sorted, $⌊x_i⌋ = i$ for $1 ≤ i ≤ n$. ($⌊·⌋:$ floor function.)
 
-Find ∑S(t) for n = 7.
+In the case of $n = 4$, there are 12 $n$-tuples of integers which satisfy both conditions.
+
+We define $S(t)$ as the sum of the absolute values of the integers in $t$.
+
+For $n = 4$ we can verify that $\sum S(t) = 2087$ for all $n$-tuples $t$ which satisfy both conditions.
+
+Find $\sum S(t)$ for $n = 7$.
 
 # --hints--
 
-`euler438()` should return 2046409616809.
+`polynomialIntegerPart()` should return `2046409616809`.
 
 ```js
-assert.strictEqual(euler438(), 2046409616809);
+assert.strictEqual(polynomialIntegerPart(), 2046409616809);
 ```
 
 # --seed--
@@ -29,12 +36,12 @@ assert.strictEqual(euler438(), 2046409616809);
 ## --seed-contents--
 
 ```js
-function euler438() {
+function polynomialIntegerPart() {
 
   return true;
 }
 
-euler438();
+polynomialIntegerPart();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.md
index 4fb1871a853..bb5669ed088 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f5231000cf542c510035
 title: 'Problem 439: Sum of sum of divisors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302110
 dashedName: problem-439-sum-of-sum-of-divisors
 ---
 
 # --description--
 
-Let d(k) be the sum of all divisors of k.
+Let $d(k)$ be the sum of all divisors of $k$.
 
-We define the function S(N) = ∑1≤i≤N ∑1≤j≤Nd(i·j).
+We define the function $S(N) = \sum_{i = 1}^N \sum_{j = 1}^N d(i \times j)$.
 
-For example, S(3) = d(1) + d(2) + d(3) + d(2) + d(4) + d(6) + d(3) + d(6) + d(9) = 59.
+For example, $S(3) = d(1) + d(2) + d(3) + d(2) + d(4) + d(6) + d(3) + d(6) + d(9) = 59$.
 
-You are given that S(103) = 563576517282 and S(105) mod 109 = 215766508. Find S(1011) mod 109.
+You are given that $S({10}^3) = 563\\,576\\,517\\,282$ and $S({10}^5)\bmod {10}^9 = 215\\,766\\,508$.
+
+Find $S({10}^{11})\bmod {10}^9$.
 
 # --hints--
 
-`euler439()` should return 968697378.
+`sumOfSumOfDivisors()` should return `968697378`.
 
 ```js
-assert.strictEqual(euler439(), 968697378);
+assert.strictEqual(sumOfSumOfDivisors(), 968697378);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler439(), 968697378);
 ## --seed-contents--
 
 ```js
-function euler439() {
+function sumOfSumOfDivisors() {
 
   return true;
 }
 
-euler439();
+sumOfSumOfDivisors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-44-pentagon-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-44-pentagon-numbers.md
index 3b89176ca1a..44905c1be79 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-44-pentagon-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-44-pentagon-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3981000cf542c50feab
 title: 'Problem 44: Pentagon numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302111
 dashedName: problem-44-pentagon-numbers
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md
index a68f99a00ad..49afa9608aa 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md
@@ -1,31 +1,40 @@
 ---
 id: 5900f5241000cf542c510037
 title: 'Problem 440: GCD and Tiling'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302112
 dashedName: problem-440-gcd-and-tiling
 ---
 
 # --description--
 
-We want to tile a board of length n and height 1 completely, with either 1 × 2 blocks or 1 × 1 blocks with a single decimal digit on top:
+We want to tile a board of length $n$ and height 1 completely, with either 1 × 2 blocks or 1 × 1 blocks with a single decimal digit on top:
 
-For example, here are some of the ways to tile a board of length n = 8:
+<img class="img-responsive center-block" alt="ten blocks 1x1 with single decimal digit on top, and 1x2 block" src="https://cdn.freecodecamp.org/curriculum/project-euler/gcd-and-tiling-1.png" style="background-color: white; padding: 10px;" />
 
-Let T(n) be the number of ways to tile a board of length n as described above.
+For example, here are some of the ways to tile a board of length $n = 8$:
 
-For example, T(1) = 10 and T(2) = 101.
+<img class="img-responsive center-block" alt="examples of ways to tile a board of length n = 8" src="https://cdn.freecodecamp.org/curriculum/project-euler/gcd-and-tiling-2.png" style="background-color: white; padding: 10px;" />
 
-Let S(L) be the triple sum ∑a,b,c gcd(T(ca), T(cb)) for 1 ≤ a, b, c ≤ L. For example: S(2) = 10444 S(3) = 1292115238446807016106539989 S(4) mod 987 898 789 = 670616280.
+Let $T(n)$ be the number of ways to tile a board of length $n$ as described above.
 
-Find S(2000) mod 987 898 789.
+For example, $T(1) = 10$ and $T(2) = 101$.
+
+Let $S(L)$ be the triple sum $\sum_{a, b, c} gcd(T(c^a), T(c^b))$ for $1 ≤ a, b, c ≤ L$.
+
+For example:
+
+$$\begin{align}   & S(2) = 10\\,444 \\\\
+  & S(3) = 1\\,292\\,115\\,238\\,446\\,807\\,016\\,106\\,539\\,989 \\\\ & S(4)\bmod 987\\,898\\,789 = 670\\,616\\,280. \end{align}$$
+
+Find $S(2000)\bmod 987\\,898\\,789$.
 
 # --hints--
 
-`euler440()` should return 970746056.
+`gcdAndTiling()` should return `970746056`.
 
 ```js
-assert.strictEqual(euler440(), 970746056);
+assert.strictEqual(gcdAndTiling(), 970746056);
 ```
 
 # --seed--
@@ -33,12 +42,12 @@ assert.strictEqual(euler440(), 970746056);
 ## --seed-contents--
 
 ```js
-function euler440() {
+function gcdAndTiling() {
 
   return true;
 }
 
-euler440();
+gcdAndTiling();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.md
index 6cc5fd7e2eb..9c310a1f18d 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.md
@@ -1,27 +1,31 @@
 ---
 id: 5900f5261000cf542c510038
 title: 'Problem 441: The inverse summation of coprime couples'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302113
 dashedName: problem-441-the-inverse-summation-of-coprime-couples
 ---
 
 # --description--
 
-For an integer M, we define R(M) as the sum of 1/(p·q) for all the integer pairs p and q which satisfy all of these conditions:
+For an integer $M$, we define $R(M)$ as the sum of $\frac{1}{p·q}$ for all the integer pairs $p$ and $q$ which satisfy all of these conditions:
 
-1 ≤ p &lt; q ≤ M p + q ≥ M p and q are coprime.
+- $1 ≤ p &lt; q ≤ M$
+- $p + q ≥ M$
+- $p$ and $q$ are coprime.
 
-We also define S(N) as the sum of R(i) for 2 ≤ i ≤ N. We can verify that S(2) = R(2) = 1/2, S(10) ≈ 6.9147 and S(100) ≈ 58.2962.
+We also define $S(N)$ as the sum of $R(i)$ for $2 ≤ i ≤ N$.
 
-Find S(107). Give your answer rounded to four decimal places.
+We can verify that $S(2) = R(2) = \frac{1}{2}$, $S(10) ≈ 6.9147$ and $S(100) ≈ 58.2962$.
+
+Find $S({10}^7)$. Give your answer rounded to four decimal places.
 
 # --hints--
 
-`euler441()` should return 5000088.8395.
+`inverseSummationCoprimeCouples()` should return `5000088.8395`.
 
 ```js
-assert.strictEqual(euler441(), 5000088.8395);
+assert.strictEqual(inverseSummationCoprimeCouples(), 5000088.8395);
 ```
 
 # --seed--
@@ -29,12 +33,12 @@ assert.strictEqual(euler441(), 5000088.8395);
 ## --seed-contents--
 
 ```js
-function euler441() {
+function inverseSummationCoprimeCouples() {
 
   return true;
 }
 
-euler441();
+inverseSummationCoprimeCouples();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-442-eleven-free-integers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-442-eleven-free-integers.md
index e5b1e35319a..9e2e8d90986 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-442-eleven-free-integers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-442-eleven-free-integers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5271000cf542c510039
 title: 'Problem 442: Eleven-free integers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302114
 dashedName: problem-442-eleven-free-integers
 ---
@@ -12,16 +12,16 @@ An integer is called eleven-free if its decimal expansion does not contain any s
 
 For example, 2404 and 13431 are eleven-free, while 911 and 4121331 are not.
 
-Let E(n) be the nth positive eleven-free integer. For example, E(3) = 3, E(200) = 213 and E(500 000) = 531563.
+Let $E(n)$ be the $n$th positive eleven-free integer. For example, $E(3) = 3$, $E(200) = 213$ and $E(500\\,000) = 531\\,563$.
 
-Find E(1018).
+Find $E({10}^{18})$.
 
 # --hints--
 
-`euler442()` should return 1295552661530920200.
+`elevenFreeIntegers()` should return `1295552661530920200`.
 
 ```js
-assert.strictEqual(euler442(), 1295552661530920200);
+assert.strictEqual(elevenFreeIntegers(), 1295552661530920200);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler442(), 1295552661530920200);
 ## --seed-contents--
 
 ```js
-function euler442() {
+function elevenFreeIntegers() {
 
   return true;
 }
 
-euler442();
+elevenFreeIntegers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md
index 9afda46059a..12d62a83aa7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f5271000cf542c51003a
 title: 'Problem 443: GCD sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302115
 dashedName: problem-443-gcd-sequence
 ---
 
 # --description--
 
-Let g(n) be a sequence defined as follows: g(4) = 13, g(n) = g(n-1) + gcd(n, g(n-1)) for n > 4.
+Let $g(n)$ be a sequence defined as follows:
 
-The first few values are:
+$$\begin{align}   & g(4) = 13, \\\\
+  & g(n) = g(n-1) + gcd(n, g(n - 1)) \text{ for } n > 4. \end{align}$$
 
-n 4567891011121314151617181920... g(n) 1314161718272829303132333451545560...
+前幾個值是：
 
-<!-- TODO Use MathJax -->
+$$\begin{array}{l}   n    & 4  & 5  & 6  & 7  & 8  & 9  & 10 & 11 & 12 & 13 & 14 & 15 & 16 & 17 & 18 & 19 & 20 & \ldots \\\\
+  g(n) & 13 & 14 & 16 & 17 & 18 & 27 & 28 & 29 & 30 & 31 & 32 & 33 & 34 & 51 & 54 & 55 & 60 & \ldots \end{array}$$
 
-You are given that g(1 000) = 2524 and g(1 000 000) = 2624152.
+You are given that $g(1\\,000) = 2\\,524$ and $g(1\\,000\\,000) = 2\\,624\\,152$.
 
-Find g(1015).
+Find $g({10}^{15})$.
 
 # --hints--
 
-`euler443()` should return 2744233049300770.
+`gcdSequence()` should return `2744233049300770`.
 
 ```js
-assert.strictEqual(euler443(), 2744233049300770);
+assert.strictEqual(gcdSequence(), 2744233049300770);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler443(), 2744233049300770);
 ## --seed-contents--
 
 ```js
-function euler443() {
+function gcdSequence() {
 
   return true;
 }
 
-euler443();
+gcdSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.md
index 04d71de4854..9e52d4e52b4 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f52a1000cf542c51003b
 title: 'Problem 444: The Roundtable Lottery'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302116
 dashedName: problem-444-the-roundtable-lottery
 ---
 
 # --description--
 
-A group of p people decide to sit down at a round table and play a lottery-ticket trading game. Each person starts off with a randomly-assigned, unscratched lottery ticket. Each ticket, when scratched, reveals a whole-pound prize ranging anywhere from £1 to £p, with no two tickets alike. The goal of the game is for each person to maximize his ticket winnings upon leaving the game.
+A group of $p$ people decide to sit down at a round table and play a lottery-ticket trading game. Each person starts off with a randomly-assigned, unscratched lottery ticket. Each ticket, when scratched, reveals a whole-pound prize ranging anywhere from £1 to £$p$, with no two tickets alike. The goal of the game is for each person to maximize his ticket winnings upon leaving the game.
 
 An arbitrary person is chosen to be the first player. Going around the table, each player has only one of two options:
 
@@ -19,18 +19,26 @@ The game ends once all tickets have been scratched. All players still remaining
 
 Assume that each player uses the optimal strategy for maximizing the expected value of his ticket winnings.
 
-Let E(p) represent the expected number of players left at the table when the game ends in a game consisting of p players (e.g. E(111) = 5.2912 when rounded to 5 significant digits).
+Let $E(p)$ represent the expected number of players left at the table when the game ends in a game consisting of $p$ players (e.g. $E(111) = 5.2912$ when rounded to 5 significant digits).
 
-Let S1(N) = E(p) Let Sk(N) = Sk-1(p) for k > 1
+Let $S_1(N) = \displaystyle\sum_{p = 1}^N E(p)$.
 
-Find S20(1014) and write the answer in scientific notation rounded to 10 significant digits. Use a lowercase e to separate mantissa and exponent (e.g. S3(100) = 5.983679014e5).
+Let $S_k(N) = \displaystyle\sum_{p = 1}^N S_{k - 1}(p)$ for $k > 1$.
+
+Find $S_{20}({10}^{14})$ and write the answer as a string in scientific notation rounded to 10 significant digits. Use a lowercase `e` to separate mantissa and exponent. For example, the answer for $S_3(100)$ would be `5.983679014e5`.
 
 # --hints--
 
-`euler444()` should return 1.200856722e+263.
+`roundtableLottery()` should return a string.
 
 ```js
-assert.strictEqual(euler444(), 1.200856722e263);
+assert(typeof roundtableLottery() === 'string');
+```
+
+`roundtableLottery()` should return the string `1.200856722e263`.
+
+```js
+assert.strictEqual(roundtableLottery(), '1.200856722e263');
 ```
 
 # --seed--
@@ -38,12 +46,12 @@ assert.strictEqual(euler444(), 1.200856722e263);
 ## --seed-contents--
 
 ```js
-function euler444() {
+function roundtableLottery() {
 
   return true;
 }
 
-euler444();
+roundtableLottery();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-445-retractions-a.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-445-retractions-a.md
index 39c80f706d7..841d3796c7d 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-445-retractions-a.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-445-retractions-a.md
@@ -1,27 +1,33 @@
 ---
 id: 5900f52a1000cf542c51003c
 title: 'Problem 445: Retractions A'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302117
 dashedName: problem-445-retractions-a
 ---
 
 # --description--
 
-For every integer n>1, the family of functions fn,a,b is defined
+For every integer $n > 1$, the family of functions $f_{n, a, b}$ is defined by:
 
-by fn,a,b(x)≡ax+b mod n for a,b,x integer and 0
+$f_{n, a, b}(x) ≡ ax + b\bmod n$ for $a, b, x$ integer and $0 \lt a \lt n$, $0 \le b \lt n$, $0 \le x \lt n$.
 
-You are given that ∑ R(c) for c=C(100 000,k), and 1 ≤ k ≤99 999 ≡628701600 (mod 1 000 000 007). (C(n,k) is the binomial coefficient).
+We will call $f_{n, a, b}$ a retraction if $f_{n, a, b}(f_{n, a, b}(x)) \equiv f_{n, a, b}(x)\bmod n$ for every $0 \le x \lt n$.
 
-Find ∑ R(c) for c=C(10 000 000,k), and 1 ≤k≤ 9 999 999. Give your answer modulo 1 000 000 007.
+Let $R(n)$ be the number of retractions for $n$.
+
+You are given that
+
+$$\sum_{k = 1}^{99\\,999} R(\displaystyle\binom{100\\,000}{k}) \equiv 628\\,701\\,600\bmod 1\\,000\\,000\\,007$$
+
+Find $$\sum_{k = 1}^{9\\,999\\,999} R(\displaystyle\binom{10\\,000\\,000}{k})$$ Give your answer modulo $1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler445()` should return 659104042.
+`retractionsA()` should return `659104042`.
 
 ```js
-assert.strictEqual(euler445(), 659104042);
+assert.strictEqual(retractionsA(), 659104042);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler445(), 659104042);
 ## --seed-contents--
 
 ```js
-function euler445() {
+function retractionsA() {
 
   return true;
 }
 
-euler445();
+retractionsA();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-446-retractions-b.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-446-retractions-b.md
index a46677999e8..f1919d426f5 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-446-retractions-b.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-446-retractions-b.md
@@ -1,27 +1,33 @@
 ---
 id: 5900f52c1000cf542c51003d
 title: 'Problem 446: Retractions B'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302118
 dashedName: problem-446-retractions-b
 ---
 
 # --description--
 
-For every integer n>1, the family of functions fn,a,b is defined
+For every integer $n > 1$, the family of functions $f_{n, a, b}$ is defined by:
 
-by fn,a,b(x)≡ax+b mod n for a,b,x integer and 0
+$f_{n, a, b}(x) ≡ ax + b\bmod n$ for $a, b, x$ integer and $0 \lt a \lt n$, $0 \le b \lt n$, $0 \le x \lt n$.
 
-F(N)=∑R(n4+4) for 1≤n≤N. F(1024)=77532377300600.
+We will call $f_{n, a, b}$ a retraction if $f_{n, a, b}(f_{n, a, b}(x)) \equiv f_{n, a, b}(x)\bmod n$ for every $0 \le x \lt n$.
 
-Find F(107) (mod 1 000 000 007)
+Let $R(n)$ be the number of retractions for $n$.
+
+$F(N) = \displaystyle\sum_{n = 1}^N R(n^4 + 4)$.
+
+$F(1024) = 77\\,532\\,377\\,300\\,600$.
+
+Find $F({10}^7)$. Give your answer modulo $1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler446()` should return 907803852.
+`retractionsB()` should return `907803852`.
 
 ```js
-assert.strictEqual(euler446(), 907803852);
+assert.strictEqual(retractionsB(), 907803852);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler446(), 907803852);
 ## --seed-contents--
 
 ```js
-function euler446() {
+function retractionsB() {
 
   return true;
 }
 
-euler446();
+retractionsB();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-447-retractions-c.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-447-retractions-c.md
index c8cb09065ca..882f61f24d0 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-447-retractions-c.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-447-retractions-c.md
@@ -1,27 +1,33 @@
 ---
 id: 5900f52c1000cf542c51003e
 title: 'Problem 447: Retractions C'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302119
 dashedName: problem-447-retractions-c
 ---
 
 # --description--
 
-For every integer n>1, the family of functions fn,a,b is defined
+For every integer $n > 1$, the family of functions $f_{n, a, b}$ is defined by:
 
-by fn,a,b(x)≡ax+b mod n for a,b,x integer and 0
+$f_{n, a, b}(x) ≡ ax + b\bmod n$ for $a, b, x$ integer and $0 \lt a \lt n$, $0 \le b \lt n$, $0 \le x \lt n$.
 
-F(N)=∑R(n) for 2≤n≤N. F(107)≡638042271 (mod 1 000 000 007).
+We will call $f_{n, a, b}$ a retraction if $f_{n, a, b}(f_{n, a, b}(x)) \equiv f_{n, a, b}(x)\bmod n$ for every $0 \le x \lt n$.
 
-Find F(1014) (mod 1 000 000 007).
+Let $R(n)$ be the number of retractions for $n$.
+
+$F(N) = \displaystyle\sum_{n = 2}^N R(n)$.
+
+$F({10}^7) ≡ 638\\,042\\,271\bmod 1\\,000\\,000\\,007$.
+
+Find $F({10}^{14})$. Give your answer modulo $1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler447()` should return 530553372.
+`retractionsC()` should return `530553372`.
 
 ```js
-assert.strictEqual(euler447(), 530553372);
+assert.strictEqual(retractionsC(), 530553372);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler447(), 530553372);
 ## --seed-contents--
 
 ```js
-function euler447() {
+function retractionsC() {
 
   return true;
 }
 
-euler447();
+retractionsC();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.md
index 6bf716c1d34..9ba61428438 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.md
@@ -1,29 +1,31 @@
 ---
 id: 5900f52c1000cf542c51003f
-title: 'Problem 448: Average least common multiple'
-challengeType: 5
+title: '問題 448：平均最小公倍數'
+challengeType: 1
 forumTopicId: 302120
 dashedName: problem-448-average-least-common-multiple
 ---
 
 # --description--
 
-The function lcm(a,b) denotes the least common multiple of a and b.
+The function $lcm(a, b)$ denotes the least common multiple of $a$ and $b$.
 
-Let A(n) be the average of the values of lcm(n,i) for 1≤i≤n.
+Let $A(n)$ be the average of the values of $lcm(n, i)$ for $1 ≤ i ≤ n$.
 
-E.g: A(2)=(2+2)/2=2 and A(10)=(10+10+30+20+10+30+70+40+90+10)/10=32.
+E.g: $A(2) = \frac{2 + 2}{2} = 2$ and $A(10) = \frac{10 + 10 + 30 + 20 + 10 + 30 + 70 + 40 + 90 + 10}{10} = 32$.
 
-Let S(n)=∑A(k) for 1≤k≤n. S(100)=122726.
+Let $S(n) = \sum A(k)$ for $1 ≤ k ≤ n$.
 
-Find S(99999999019) mod 999999017.
+$S(100) = 122\\,726$.
+
+Find $S(99\\,999\\,999\\,019)\bmod 999\\,999\\,017$.
 
 # --hints--
 
-`euler448()` should return 106467648.
+`averageLCM()` should return `106467648`.
 
 ```js
-assert.strictEqual(euler448(), 106467648);
+assert.strictEqual(averageLCM(), 106467648);
 ```
 
 # --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler448(), 106467648);
 ## --seed-contents--
 
 ```js
-function euler448() {
+function averageLCM() {
 
   return true;
 }
 
-euler448();
+averageLCM();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.md
index 18c19230958..f312fd4ab49 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.md
@@ -1,31 +1,29 @@
 ---
 id: 5900f52d1000cf542c510040
 title: 'Problem 449: Chocolate covered candy'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302121
 dashedName: problem-449-chocolate-covered-candy
 ---
 
 # --description--
 
-Phil the confectioner is making a new batch of chocolate covered candy. Each candy centre is shaped like an ellipsoid of revolution defined by the equation: b2x2 + b2y2 + a2z2 = a2b2.
+Phil the confectioner is making a new batch of chocolate covered candy. Each candy centre is shaped like an ellipsoid of revolution defined by the equation: $b^2x^2 + b^2y^2 + a^2z^2 = a^2b^2$.
 
-Phil wants to know how much chocolate is needed to cover one candy centre with a uniform coat of chocolate one millimeter thick. If a=1 mm and b=1 mm, the amount of chocolate required is
+Phil wants to know how much chocolate is needed to cover one candy centre with a uniform coat of chocolate one millimeter thick.
 
-283 π mm3
+If $a = 1$ mm and $b = 1$ mm, the amount of chocolate required is $\frac{28}{3} \pi$ mm<sup>3</sup>
 
-<!-- TODO Use MathJax -->
+If $a = 2$ mm and $b = 1$ mm, the amount of chocolate required is approximately 60.35475635 mm<sup>3</sup>.
 
-If a=2 mm and b=1 mm, the amount of chocolate required is approximately 60.35475635 mm3.
-
-Find the amount of chocolate in mm3 required if a=3 mm and b=1 mm. Give your answer as the number rounded to 8 decimal places behind the decimal point.
+Find the amount of chocolate in mm<sup>3</sup> required if $a = 3$ mm and $b = 1$ mm. Give your answer as the number rounded to 8 decimal places behind the decimal point.
 
 # --hints--
 
-`euler449()` should return 103.37870096.
+`chocolateCoveredCandy()` should return `103.37870096`.
 
 ```js
-assert.strictEqual(euler449(), 103.37870096);
+assert.strictEqual(chocolateCoveredCandy(), 103.37870096);
 ```
 
 # --seed--
@@ -33,12 +31,12 @@ assert.strictEqual(euler449(), 103.37870096);
 ## --seed-contents--
 
 ```js
-function euler449() {
+function chocolateCoveredCandy() {
 
   return true;
 }
 
-euler449();
+chocolateCoveredCandy();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.md
index 5c3b224b4a1..e80bcc8dd50 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3991000cf542c50feac
 title: 'Problem 45: Triangular, pentagonal, and hexagonal'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302122
 dashedName: problem-45-triangular-pentagonal-and-hexagonal
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
index 17cf3af082d..9bfd7f5d15a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f52e1000cf542c510041
 title: 'Problem 450: Hypocycloid and Lattice points'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302123
 dashedName: problem-450-hypocycloid-and-lattice-points
 ---
@@ -10,34 +10,37 @@ dashedName: problem-450-hypocycloid-and-lattice-points
 
 A hypocycloid is the curve drawn by a point on a small circle rolling inside a larger circle. The parametric equations of a hypocycloid centered at the origin, and starting at the right most point is given by:
 
-$x(t) = (R - r) \\cos(t) + r \\cos(\\frac {R - r} r t)$
+$$x(t) = (R - r) \cos(t) + r \cos(\frac{R - r}{r}t)$$
 
-$y(t) = (R - r) \\sin(t) - r \\sin(\\frac {R - r} r t)$
+$$y(t) = (R - r) \sin(t) - r \sin(\frac{R - r}{r} t)$$
 
-Where R is the radius of the large circle and r the radius of the small circle.
+Where $R$ is the radius of the large circle and $r$ the radius of the small circle.
 
-Let $C(R, r)$ be the set of distinct points with integer coordinates on the hypocycloid with radius R and r and for which there is a corresponding value of t such that $\\sin(t)$ and $\\cos(t)$ are rational numbers.
+Let $C(R, r)$ be the set of distinct points with integer coordinates on the hypocycloid with radius $R$ and $r$ and for which there is a corresponding value of $t$ such that $\sin(t)$ and $\cos(t)$ are rational numbers.
 
-Let $S(R, r) = \\sum\_{(x,y) \\in C(R, r)} |x| + |y|$ be the sum of the absolute values of the x and y coordinates of the points in $C(R, r)$.
+Let $S(R, r) = \sum\_{(x,y) \in C(R, r)} |x| + |y|$ be the sum of the absolute values of the $x$ and $y$ coordinates of the points in $C(R, r)$.
 
-Let $T(N) = \\sum*{R = 3}^N \\sum*{r=1}^{\\lfloor \\frac {R - 1} 2 \\rfloor} S(R, r)$ be the sum of $S(R, r)$ for R and r positive integers, $R\\leq N$ and $2r &lt; R$.
+Let $T(N) = \sum_{R = 3}^N \sum_{r=1}^{\left\lfloor \frac{R - 1}{2} \right\rfloor} S(R, r)$ be the sum of $S(R, r)$ for $R$ and $r$ positive integers, $R\leq N$ and $2r &lt; R$.
 
-You are given:C(3, 1) = {(3, 0), (-1, 2), (-1,0), (-1,-2)} C(2500, 1000) = {(2500, 0), (772, 2376), (772, -2376), (516, 1792), (516, -1792), (500, 0), (68, 504), (68, -504),(-1356, 1088), (-1356, -1088), (-1500, 1000), (-1500, -1000)}
+You are given:
 
-Note: (-625, 0) is not an element of C(2500, 1000) because $\\sin(t)$ is not a rational number for the corresponding values of t.
+$$\begin{align}   C(3, 1) = & \\{(3, 0), (-1, 2), (-1,0), (-1,-2)\\} \\\\
+  C(2500, 1000) = & \\{(2500, 0), (772, 2376), (772, -2376), (516, 1792), (516, -1792), (500, 0), (68, 504), \\\\ &(68, -504),(-1356, 1088), (-1356, -1088), (-1500, 1000), (-1500, -1000)\\} \end{align}$$
 
-S(3, 1) = (|3| + |0|) + (|-1| + |2|) + (|-1| + |0|) + (|-1| + |-2|) = 10
+**Note:** (-625, 0) is not an element of $C(2500, 1000)$ because $\sin(t)$ is not a rational number for the corresponding values of $t$.
 
-T(3) = 10; T(10) = 524 ;T(100) = 580442; T(103) = 583108600.
+$S(3, 1) = (|3| + |0|) + (|-1| + |2|) + (|-1| + |0|) + (|-1| + |-2|) = 10$
 
-Find T(106).
+$T(3) = 10$; $T(10) = 524$; $T(100) = 580\\,442$; $T({10}^3) = 583\\,108\\,600$.
+
+Find $T({10}^6)$.
 
 # --hints--
 
-`euler450()` should return 583333163984220900.
+`hypocycloidAndLatticePoints()` should return `583333163984220900`.
 
 ```js
-assert.strictEqual(euler450(), 583333163984220900);
+assert.strictEqual(hypocycloidAndLatticePoints(), 583333163984220900);
 ```
 
 # --seed--
@@ -45,12 +48,12 @@ assert.strictEqual(euler450(), 583333163984220900);
 ## --seed-contents--
 
 ```js
-function euler450() {
+function hypocycloidAndLatticePoints() {
 
   return true;
 }
 
-euler450();
+hypocycloidAndLatticePoints();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md
index 1b12ec1c227..39ebff17846 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5311000cf542c510042
 title: 'Problem 451: Modular inverses'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302124
 dashedName: problem-451-modular-inverses
 ---
@@ -12,32 +12,27 @@ Consider the number 15.
 
 There are eight positive numbers less than 15 which are coprime to 15: 1, 2, 4, 7, 8, 11, 13, 14.
 
-The modular inverses of these numbers modulo 15 are: 1, 8, 4, 13, 2, 11, 7, 14
+The modular inverses of these numbers modulo 15 are: 1, 8, 4, 13, 2, 11, 7, 14 because
 
-because
+$$\begin{align}   & 1  \times 1\bmod 15 = 1 \\\\
+  & 2  \times 8  = 16\bmod 15 = 1 \\\\   & 4  \times 4  = 16\bmod 15 = 1 \\\\
+  & 7  \times 13 = 91\bmod 15 = 1 \\\\   & 11 \times 11 = 121\bmod 15 = 1 \\\\
+  & 14 \times 14 = 196\bmod 15 = 1 \end{align}$$
 
-1\*1 mod 15=1
+Let $I(n)$ be the largest positive number $m$ smaller than $n - 1$ such that the modular inverse of $m$ modulo $n$ equals $m$ itself.
 
-2\*8=16 mod 15=1
+So $I(15) = 11$.
 
-4\*4=16 mod 15=1
+Also $I(100) = 51$ and $I(7) = 1$.
 
-7\*13=91 mod 15=1
-
-11\*11=121 mod 15=1
-
-14\*14=196 mod 15=1
-
-Let I(n) be the largest positive number m smaller than n-1 such that the modular inverse of m modulo n equals m itself. So I(15)=11. Also I(100)=51 and I(7)=1.
-
-Find ∑I(n) for 3≤n≤2·107
+Find $\sum I(n)$ for $3 ≤ n ≤ 2 \times {10}^7$
 
 # --hints--
 
-`euler451()` should return 153651073760956.
+`modularInverses()` should return `153651073760956`.
 
 ```js
-assert.strictEqual(euler451(), 153651073760956);
+assert.strictEqual(modularInverses(), 153651073760956);
 ```
 
 # --seed--
@@ -45,12 +40,12 @@ assert.strictEqual(euler451(), 153651073760956);
 ## --seed-contents--
 
 ```js
-function euler451() {
+function modularInverses() {
 
   return true;
 }
 
-euler451();
+modularInverses();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-452-long-products.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-452-long-products.md
index b52ca22d506..abb043bcebe 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-452-long-products.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-452-long-products.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f5311000cf542c510043
 title: 'Problem 452: Long Products'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302125
 dashedName: problem-452-long-products
 ---
 
 # --description--
 
-Define F(m,n) as the number of n-tuples of positive integers for which the product of the elements doesn't exceed m.
+Define $F(m, n)$ as the number of $n$-tuples of positive integers for which the product of the elements doesn't exceed $m$.
 
-F(10, 10) = 571.
+$F(10, 10) = 571$.
 
-F(106, 106) mod 1 234 567 891 = 252903833.
+$F({10}^6, {10}^6)\bmod 1\\,234\\,567\\,891 = 252\\,903\\,833$.
 
-Find F(109, 109) mod 1 234 567 891.
+Find $F({10}^9, {10}^9)\bmod 1\\,234\\,567\\,891$.
 
 # --hints--
 
-`euler452()` should return 345558983.
+`longProducts()` should return `345558983`.
 
 ```js
-assert.strictEqual(euler452(), 345558983);
+assert.strictEqual(longProducts(), 345558983);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler452(), 345558983);
 ## --seed-contents--
 
 ```js
-function euler452() {
+function longProducts() {
 
   return true;
 }
 
-euler452();
+longProducts();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md
index 69b668a626e..f809ebc60a5 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5311000cf542c510044
 title: 'Problem 453: Lattice Quadrilaterals'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302126
 dashedName: problem-453-lattice-quadrilaterals
 ---
@@ -10,20 +10,22 @@ dashedName: problem-453-lattice-quadrilaterals
 
 A simple quadrilateral is a polygon that has four distinct vertices, has no straight angles and does not self-intersect.
 
-Let Q(m, n) be the number of simple quadrilaterals whose vertices are lattice points with coordinates (x,y) satisfying 0 ≤ x ≤ m and 0 ≤ y ≤ n.
+Let $Q(m, n)$ be the number of simple quadrilaterals whose vertices are lattice points with coordinates ($x$, $y$) satisfying $0 ≤ x ≤ m$ and $0 ≤ y ≤ n$.
 
-For example, Q(2, 2) = 94 as can be seen below:
+For example, $Q(2, 2) = 94$ as can be seen below:
 
-It can also be verified that Q(3, 7) = 39590, Q(12, 3) = 309000 and Q(123, 45) = 70542215894646.
+<img class="img-responsive center-block" alt="94 quadrilaterals whose vertices are lattice points with coordinates (x, y) satiffying 0 &le; x &le; m and 0 &le; y &le; n" src="https://cdn.freecodecamp.org/curriculum/project-euler/lattice-quadrilaterals.png" style="background-color: white; padding: 10px;" />
 
-Find Q(12345, 6789) mod 135707531.
+It can also be verified that $Q(3, 7) = 39\\,590$, $Q(12, 3) = 309\\,000$ and $Q(123, 45) = 70\\,542\\,215\\,894\\,646$.
+
+Find $Q(12\\,345, 6\\,789)\bmod 135\\,707\\,531$.
 
 # --hints--
 
-`euler453()` should return 104354107.
+`latticeQuadrilaterals()` should return `104354107`.
 
 ```js
-assert.strictEqual(euler453(), 104354107);
+assert.strictEqual(latticeQuadrilaterals(), 104354107);
 ```
 
 # --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler453(), 104354107);
 ## --seed-contents--
 
 ```js
-function euler453() {
+function latticeQuadrilaterals() {
 
   return true;
 }
 
-euler453();
+latticeQuadrilaterals();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.md
index 414cfab965d..b2fca3b4a6b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f5331000cf542c510045
 title: 'Problem 454: Diophantine reciprocals III'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302127
 dashedName: problem-454-diophantine-reciprocals-iii
 ---
 
 # --description--
 
-In the following equation x, y, and n are positive integers. 1/x + 1/y= 1/n
+In the following equation $x$, $y$, and $n$ are positive integers.
 
-<!-- TODO Use MathJax -->
+$$\frac{1}{x} + \frac{1}{y} = \frac{1}{n}$$
 
-For a limit L we define F(L) as the number of solutions which satisfy x &lt; y ≤ L.
+For a limit $L$ we define $F(L)$ as the number of solutions which satisfy $x &lt; y ≤ L$.
 
-We can verify that F(15) = 4 and F(1000) = 1069. Find F(1012).
+We can verify that $F(15) = 4$ and $F(1000) = 1069$.
+
+Find $F({10}^{12})$.
 
 # --hints--
 
-`euler454()` should return 5435004633092.
+`diophantineReciprocalsThree()` should return `5435004633092`.
 
 ```js
-assert.strictEqual(euler454(), 5435004633092);
+assert.strictEqual(diophantineReciprocalsThree(), 5435004633092);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler454(), 5435004633092);
 ## --seed-contents--
 
 ```js
-function euler454() {
+function diophantineReciprocalsThree() {
 
   return true;
 }
 
-euler454();
+diophantineReciprocalsThree();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md
index 71202a5f3f2..8e453a983c2 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md
@@ -1,25 +1,29 @@
 ---
 id: 5900f5331000cf542c510046
 title: 'Problem 455: Powers With Trailing Digits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302129
 dashedName: problem-455-powers-with-trailing-digits
 ---
 
 # --description--
 
-Let f(n) be the largest positive integer x less than 109 such that the last 9 digits of nx form the number x (including leading zeros), or zero if no such integer exists.
+Let $f(n)$ be the largest positive integer $x$ less than ${10}^9$ such that the last 9 digits of $n^x$ form the number $x$ (including leading zeros), or zero if no such integer exists.
 
 For example:
 
-f(4) = 411728896 (4411728896 = ...490411728896) f(10) = 0 f(157) = 743757 (157743757 = ...567000743757) Σf(n), 2 ≤ n ≤ 103 = 442530011399 Find Σf(n), 2 ≤ n ≤ 106.
+$$\begin{align}   & f(4) = 411\\,728\\,896 (4^{411\\,728\\,896} = ...490\underline{411728896}) \\\\
+  & f(10) = 0 \\\\   & f(157) = 743\\,757 (157^{743\\,757} = ...567\underline{000743757}) \\\\
+  & Σf(n), 2 ≤ n ≤ 103 = 442\\,530\\,011\\,399 \end{align}$$
+
+Find $\sum f(n)$, $2 ≤ n ≤ {10}^6$.
 
 # --hints--
 
-`euler455()` should return 450186511399999.
+`powersWithTrailingDigits()` should return `450186511399999`.
 
 ```js
-assert.strictEqual(euler455(), 450186511399999);
+assert.strictEqual(powersWithTrailingDigits(), 450186511399999);
 ```
 
 # --seed--
@@ -27,12 +31,12 @@ assert.strictEqual(euler455(), 450186511399999);
 ## --seed-contents--
 
 ```js
-function euler455() {
+function powersWithTrailingDigits() {
 
   return true;
 }
 
-euler455();
+powersWithTrailingDigits();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.md
index fba2743a699..dbb28f3036f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.md
@@ -1,31 +1,35 @@
 ---
 id: 5900f5351000cf542c510047
 title: 'Problem 456: Triangles containing the origin II'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302130
 dashedName: problem-456-triangles-containing-the-origin-ii
 ---
 
 # --description--
 
-Define:xn = (1248n mod 32323) - 16161yn = (8421n mod 30103) - 15051
+定義
 
-Pn = {(x1, y1), (x2, y2), ..., (xn, yn)}
+$$\begin{align}   & x_n = ({1248}^n\bmod 32323) - 16161 \\\\
+  & y_n = ({8421}^n\bmod 30103) - 15051 \\\\ & P_n = \\{(x_1, y_1), (x_2, y_2), \ldots, (x_n, y_n)\\} \end{align}$$
 
-For example, P8 = {(-14913, -6630), (-10161, 5625), (5226, 11896), (8340, -10778), (15852, -5203), (-15165, 11295), (-1427, -14495), (12407, 1060)}.
+For example, $$P_8 = \\{(-14913, -6630), (-10161, 5625), (5226, 11896), (8340, -10778), (15852, -5203), (-15165, 11295), (-1427, -14495), (12407, 1060)\\}$$
 
-Let C(n) be the number of triangles whose vertices are in Pn which contain the origin in the interior.
+Let $C(n)$ be the number of triangles whose vertices are in $P_n$ which contain the origin in the interior.
 
-Examples: C(8) = 20 C(600) = 8950634 C(40 000) = 2666610948988
+示例：
 
-Find C(2 000 000).
+$$\begin{align}   & C(8) = 20 \\\\
+  & C(600) = 8\\,950\\,634 \\\\ & C(40\\,000) = 2\\,666\\,610\\,948\\,988 \end{align}$$
+
+Find $C(2\\,000\\,000)$.
 
 # --hints--
 
-`euler456()` should return 333333208685971500.
+`trianglesContainingOriginTwo()` should return `333333208685971500`.
 
 ```js
-assert.strictEqual(euler456(), 333333208685971500);
+assert.strictEqual(trianglesContainingOriginTwo(), 333333208685971500);
 ```
 
 # --seed--
@@ -33,12 +37,12 @@ assert.strictEqual(euler456(), 333333208685971500);
 ## --seed-contents--
 
 ```js
-function euler456() {
+function trianglesContainingOriginTwo() {
 
   return true;
 }
 
-euler456();
+trianglesContainingOriginTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.md
index 77c3da532c9..b187b6c488a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f5361000cf542c510048
 title: 'Problem 457: A polynomial modulo the square of a prime'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302131
 dashedName: problem-457-a-polynomial-modulo-the-square-of-a-prime
 ---
 
 # --description--
 
-Let f(n) = n2 - 3n - 1.
+Let $f(n) = n^2 - 3n - 1$.
 
-Let p be a prime.
+Let $p$ be a prime.
 
-Let R(p) be the smallest positive integer n such that f(n) mod p2 = 0 if such an integer n exists, otherwise R(p) = 0.
+Let $R(p)$ be the smallest positive integer $n$ such that $f(n)\bmod p^2 = 0$ if such an integer $n$ exists, otherwise $R(p) = 0$.
 
-Let SR(L) be ∑R(p) for all primes not exceeding L.
+Let $SR(L)$ be $\sum R(p)$ for all primes not exceeding $L$.
 
-Find SR(107).
+Find $SR({10}^7)$.
 
 # --hints--
 
-`euler457()` should return 2647787126797397000.
+`polynomialModuloSquareOfPrime()` should return `2647787126797397000`.
 
 ```js
-assert.strictEqual(euler457(), 2647787126797397000);
+assert.strictEqual(polynomialModuloSquareOfPrime(), 2647787126797397000);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler457(), 2647787126797397000);
 ## --seed-contents--
 
 ```js
-function euler457() {
+function polynomialModuloSquareOfPrime() {
 
   return true;
 }
 
-euler457();
+polynomialModuloSquareOfPrime();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-458-permutations-of-project.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-458-permutations-of-project.md
index de844d0fe53..c368503124d 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-458-permutations-of-project.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-458-permutations-of-project.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f5361000cf542c510049
 title: 'Problem 458: Permutations of Project'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302132
 dashedName: problem-458-permutations-of-project
 ---
 
 # --description--
 
-Consider the alphabet A made out of the letters of the word "project": A={c,e,j,o,p,r,t}.
+Consider the alphabet $A$ made out of the letters of the word `project`: $A = \\{c, e, j, o, p, r, t\\}$.
 
-Let T(n) be the number of strings of length n consisting of letters from A that do not have a substring that is one of the 5040 permutations of "project".
+Let $T(n)$ be the number of strings of length $n$ consisting of letters from $A$ that do not have a substring that is one of the 5040 permutations of `project`.
 
-T(7)=77-7!=818503.
+$T(7) = 7^7 - 7! = 818\\,503$.
 
-Find T(1012). Give the last 9 digits of your answer.
+Find $T({10}^{12})$. Give the last 9 digits of your answer.
 
 # --hints--
 
-`euler458()` should return 423341841.
+`permutationsOfProject()` should return `423341841`.
 
 ```js
-assert.strictEqual(euler458(), 423341841);
+assert.strictEqual(permutationsOfProject(), 423341841);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler458(), 423341841);
 ## --seed-contents--
 
 ```js
-function euler458() {
+function permutationsOfProject() {
 
   return true;
 }
 
-euler458();
+permutationsOfProject();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-459-flipping-game.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-459-flipping-game.md
index 72134eec524..e6faca20e88 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-459-flipping-game.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-459-flipping-game.md
@@ -1,35 +1,45 @@
 ---
 id: 5900f5371000cf542c51004a
-title: 'Problem 459: Flipping game'
-challengeType: 5
+title: '問題 459：翻轉游戲'
+challengeType: 1
 forumTopicId: 302133
 dashedName: problem-459-flipping-game
 ---
 
 # --description--
 
-The flipping game is a two player game played on a N by N square board.
+The flipping game is a two player game played on a $N$ by $N$ square board.
 
 Each square contains a disk with one side white and one side black.
 
 The game starts with all disks showing their white side.
 
-A turn consists of flipping all disks in a rectangle with the following properties: the upper right corner of the rectangle contains a white disk the rectangle width is a perfect square (1, 4, 9, 16, ...) the rectangle height is a triangular number (1, 3, 6, 10, ...)
+A turn consists of flipping all disks in a rectangle with the following properties:
+
+- the upper right corner of the rectangle contains a white disk
+- the rectangle width is a perfect square (1, 4, 9, 16, ...)
+- the rectangle height is a triangular number (1, 3, 6, 10, ...)
+
+<img class="img-responsive center-block" alt="flipping all disks in a 4x3 rectangle on a 5x5 board" src="https://cdn.freecodecamp.org/curriculum/project-euler/flipping-game-1.png" style="background-color: white; padding: 10px;" />
 
 Players alternate turns. A player wins by turning the grid all black.
 
-Let W(N) be the number of winning moves for the first player on a N by N board with all disks white, assuming perfect play. W(1) = 1, W(2) = 0, W(5) = 8 and W(102) = 31395.
+Let $W(N)$ be the number of winning moves for the first player on a $N$ by $N$ board with all disks white, assuming perfect play.
 
-For N=5, the first player's eight winning first moves are:
+$W(1) = 1$, $W(2) = 0$, $W(5) = 8$ and $W({10}^2) = 31\\,395$.
 
-Find W(106).
+For $N = 5$, the first player's eight winning first moves are:
+
+<img class="img-responsive center-block" alt="eight winning first moves for N = 5" src="https://cdn.freecodecamp.org/curriculum/project-euler/flipping-game-2.png" style="background-color: white; padding: 10px;" />
+
+Find $W({10}^6)$.
 
 # --hints--
 
-`euler459()` should return 3996390106631.
+`flippingGame()` should return `3996390106631`.
 
 ```js
-assert.strictEqual(euler459(), 3996390106631);
+assert.strictEqual(flippingGame(), 3996390106631);
 ```
 
 # --seed--
@@ -37,12 +47,12 @@ assert.strictEqual(euler459(), 3996390106631);
 ## --seed-contents--
 
 ```js
-function euler459() {
+function flippingGame() {
 
   return true;
 }
 
-euler459();
+flippingGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md
index 9cd82e5bdf2..1bcc859d05e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f39a1000cf542c50fead
 title: 'Problem 46: Goldbach''s other conjecture'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302134
 dashedName: problem-46-goldbachs-other-conjecture
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md
index 467a9693c3a..2bb68f203f4 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md
@@ -1,31 +1,40 @@
 ---
 id: 5900f5381000cf542c51004b
 title: 'Problem 460: An ant on the move'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302135
 dashedName: problem-460-an-ant-on-the-move
 ---
 
 # --description--
 
-On the Euclidean plane, an ant travels from point A(0, 1) to point B(d, 1) for an integer d.
+On the Euclidean plane, an ant travels from point $A(0, 1)$ to point $B(d, 1)$ for an integer $d$.
 
-In each step, the ant at point (x0, y0) chooses one of the lattice points (x1, y1) which satisfy x1 ≥ 0 and y1 ≥ 1 and goes straight to (x1, y1) at a constant velocity v. The value of v depends on y0 and y1 as follows: If y0 = y1, the value of v equals y0. If y0 ≠ y1, the value of v equals (y1 - y0) / (ln(y1) - ln(y0)).
+In each step, the ant at point ($x_0$, $y_0$) chooses one of the lattice points ($x_1$, $y_1$) which satisfy $x_1 ≥ 0$ and $y_1 ≥ 1$ and goes straight to ($x_1$, $y_1$) at a constant velocity $v$. The value of $v$ depends on $y_0$ and $y_1$ as follows:
 
-The left image is one of the possible paths for d = 4. First the ant goes from A(0, 1) to P1(1, 3) at velocity (3 - 1) / (ln(3) - ln(1)) ≈ 1.8205. Then the required time is sqrt(5) / 1.8205 ≈ 1.2283. From P1(1, 3) to P2(3, 3) the ant travels at velocity 3 so the required time is 2 / 3 ≈ 0.6667. From P2(3, 3) to B(4, 1) the ant travels at velocity (1 - 3) / (ln(1) - ln(3)) ≈ 1.8205 so the required time is sqrt(5) / 1.8205 ≈ 1.2283. Thus the total required time is 1.2283 + 0.6667 + 1.2283 = 3.1233.
+- If $y_0 = y_1$, the value of $v$ equals $y_0$.
+- If $y_0 ≠ y_1$, the value of $v$ equals $\frac{y_1 - y_0}{\ln y_1 - \ln y_0}$.
 
-The right image is another path. The total required time is calculated as 0.98026 + 1 + 0.98026 = 2.96052. It can be shown that this is the quickest path for d = 4.
+The left image is one of the possible paths for $d = 4$. First the ant goes from $A(0, 1)$ to $P_1(1, 3)$ at velocity $\frac{3 - 1}{\ln 3 - \ln 1} ≈ 1.8205$. Then the required time is $\frac{\sqrt{5}}{1.820} ≈ 1.2283$.
 
-Let F(d) be the total required time if the ant chooses the quickest path. For example, F(4) ≈ 2.960516287. We can verify that F(10) ≈ 4.668187834 and F(100) ≈ 9.217221972.
+From $P_1(1, 3)$ to $P_2(3, 3)$ the ant travels at velocity 3 so the required time is $\frac{2}{3} ≈ 0.6667$. From $P_2(3, 3)$ to $B(4, 1)$ the ant travels at velocity $\frac{1 - 3}{\ln 1 - \ln 3} ≈ 1.8205$ so the required time is $\frac{\sqrt{5}}{1.8205} ≈ 1.2283$.
 
-Find F(10000). Give your answer rounded to nine decimal places.
+Thus the total required time is $1.2283 + 0.6667 + 1.2283 = 3.1233$.
+
+The right image is another path. The total required time is calculated as $0.98026 + 1 + 0.98026 = 2.96052$. It can be shown that this is the quickest path for $d = 4$.
+
+<img class="img-responsive center-block" alt="two possible paths for d = 4" src="https://cdn.freecodecamp.org/curriculum/project-euler/an-ant-on-the-move.jpg" style="background-color: white; padding: 10px;" />
+
+Let $F(d)$ be the total required time if the ant chooses the quickest path. For example, $F(4) ≈ 2.960\\,516\\,287$. We can verify that $F(10) ≈ 4.668\\,187\\,834$ and $F(100) ≈ 9.217\\,221\\,972$.
+
+Find $F(10\\,000)$. Give your answer rounded to nine decimal places.
 
 # --hints--
 
-`euler460()` should return 18.420738199.
+`antOnTheMove()` should return `18.420738199`.
 
 ```js
-assert.strictEqual(euler460(), 18.420738199);
+assert.strictEqual(antOnTheMove(), 18.420738199);
 ```
 
 # --seed--
@@ -33,12 +42,12 @@ assert.strictEqual(euler460(), 18.420738199);
 ## --seed-contents--
 
 ```js
-function euler460() {
+function antOnTheMove() {
 
   return true;
 }
 
-euler460();
+antOnTheMove();
 ```
 
 # --solutions--
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 9903fbe0108..1ff7e49ee6b 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f53a1000cf542c51004c
 title: 'Problem 461: Almost Pi'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302136
 dashedName: problem-461-almost-pi
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-462-permutation-of-3-smooth-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-462-permutation-of-3-smooth-numbers.md
index 6eb9550e454..b17dc1befcd 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-462-permutation-of-3-smooth-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-462-permutation-of-3-smooth-numbers.md
@@ -1,20 +1,18 @@
 ---
 id: 5900f53b1000cf542c51004d
 title: 'Problem 462: Permutation of 3-smooth numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302137
 dashedName: problem-462-permutation-of-3-smooth-numbers
 ---
 
 # --description--
 
-<!-- TODO use MathJax -->
+A 3-smooth number is an integer which has no prime factor larger than 3. For an integer $N$, we define $S(N)$ as the set of 3-smooth numbers less than or equal to $N$. For example, $S(20) = \\{1, 2, 3, 4, 6, 8, 9, 12, 16, 18\\}$.
 
-A 3-smooth number is an integer which has no prime factor larger than 3. For an integer N, we define S(N) as the set of 3-smooth numbers less than or equal to N . For example, S(20) = { 1, 2, 3, 4, 6, 8, 9, 12, 16, 18 }.
+We define $F(N)$ as the number of permutations of $S(N)$ in which each element comes after all of its proper divisors.
 
-We define F(N) as the number of permutations of S(N) in which each element comes after all of its proper divisors.
-
-This is one of the possible permutations for N = 20.
+This is one of the possible permutations for $N = 20$.
 
 -   1, 2, 4, 3, 9, 8, 16, 6, 18, 12.
 
@@ -22,14 +20,22 @@ This is not a valid permutation because 12 comes before its divisor 6.
 
 -   1, 2, 4, 3, 9, 8, 12, 16, 6, 18.
 
-We can verify that F(6) = 5, F(8) = 9, F(20) = 450 and F(1000) ≈ 8.8521816557e21. Find F(1018). Give as your answer its scientific notation rounded to ten digits after the decimal point. When giving your answer, use a lowercase e to separate mantissa and exponent. E.g. if the answer is 112,233,445,566,778,899 then the answer format would be 1.1223344557e17.
+We can verify that $F(6) = 5$, $F(8) = 9$, $F(20) = 450$ and $F(1000) ≈ 8.8521816557e\\,21$.
+
+Find $F({10}^{18})$. Give as your answer as a string in its scientific notation rounded to ten digits after the decimal point. When giving your answer, use a lowercase `e` to separate mantissa and exponent. E.g. if the answer is $112\\,233\\,445\\,566\\,778\\,899$ then the answer format would be `1.1223344557e17`.
 
 # --hints--
 
-`euler462()` should return Infinity.
+`permutationOf3SmoothNumbers()` should return a string.
 
 ```js
-assert.strictEqual(euler462(), Infinity);
+assert.strictEqual(typeof permutationOf3SmoothNumbers() === 'string');
+```
+
+`permutationOf3SmoothNumbers()` should return the string `5.5350769703e1512`.
+
+```js
+assert.strictEqual(permutationOf3SmoothNumbers(), '5.5350769703e1512');
 ```
 
 # --seed--
@@ -37,12 +43,12 @@ assert.strictEqual(euler462(), Infinity);
 ## --seed-contents--
 
 ```js
-function euler462() {
+function permutationOf3SmoothNumbers() {
 
   return true;
 }
 
-euler462();
+permutationOf3SmoothNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md
index 014935108f6..a8e3607195e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f53c1000cf542c51004e
 title: 'Problem 463: A weird recurrence relation'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302138
 dashedName: problem-463-a-weird-recurrence-relation
 ---
@@ -10,24 +10,22 @@ dashedName: problem-463-a-weird-recurrence-relation
 
 The function $f$ is defined for all positive integers as follows:
 
-$f(1)=1$
+$$\begin{align}   & f(1) = 1 \\\\
+  & f(3) = 3 \\\\   & f(2n) = f(n) \\\\
+  & f(4n + 1) = 2f(2n + 1) - f(n) \\\\ & f(4n + 3) = 3f(2n + 1) - 2f(n) \end{align}$$
 
-$f(3)=3$
+The function $S(n)$ is defined as $\sum_{i=1}^{n} f(i)$.
 
-$f(2n)=f(n)$
+$S(8) = 22$ and $S(100) = 3604$.
 
-$f(4n + 1)=2f(2n + 1) - f(n)$
-
-$f(4n + 3)=3f(2n + 1) - 2f(n)$
-
-The function $S(n)$ is defined as $\\sum\_{i=1}^{n}f(i)$. $S(8)=22$ and $S(100)=3604$. Find $S(3^{37})$. Give the last 9 digits of your answer.
+Find $S(3^{37})$. Give the last 9 digits of your answer.
 
 # --hints--
 
-`euler463()` should return 808981553.
+`weirdRecurrenceRelation()` should return `808981553`.
 
 ```js
-assert.strictEqual(euler463(), 808981553);
+assert.strictEqual(weirdRecurrenceRelation(), 808981553);
 ```
 
 # --seed--
@@ -35,12 +33,12 @@ assert.strictEqual(euler463(), 808981553);
 ## --seed-contents--
 
 ```js
-function euler463() {
+function weirdRecurrenceRelation() {
 
   return true;
 }
 
-euler463();
+weirdRecurrenceRelation();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.md
index 5b209dd1d75..d293fcda274 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.md
@@ -1,33 +1,40 @@
 ---
 id: 5900f53d1000cf542c51004f
 title: 'Problem 464: Möbius function and intervals'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302139
 dashedName: problem-464-mbius-function-and-intervals
 ---
 
 # --description--
 
-The Möbius function, denoted μ(n), is defined as:
+The Möbius function, denoted $μ(n)$, is defined as:
 
-μ(n) = (-1)ω(n) if n is squarefree (where ω(n) is the number of distinct prime factors of n)
+- $μ(n) = (-1)^{ω(n)}$ if $n$ is squarefree (where $ω(n)$ is the number of distinct prime factors of $n$)
+- $μ(n) = 0$ if $n$ is not squarefree.
 
-μ(n) = 0 if n is not squarefree.
+Let $P(a, b)$ be the number of integers $n$ in the interval $[a, b]$ such that $μ(n) = 1$.
 
-Let P(a,b) be the number of integers n in the interval \[a,b] such that μ(n) = 1. Let N(a,b) be the number of integers n in the interval \[a,b] such that μ(n) = -1. For example, P(2,10) = 2 and N(2,10) = 4.
+Let $N(a, b)$ be the number of integers $n$ in the interval $[a, b]$ such that $μ(n) = -1$.
 
-Let C(n) be the number of integer pairs (a,b) such that: 1 ≤ a ≤ b ≤ n, 99·N(a,b) ≤ 100·P(a,b), and 99·P(a,b) ≤ 100·N(a,b).
+For example, $P(2, 10) = 2$ and $N(2, 10) = 4$.
 
-For example, C(10) = 13, C(500) = 16676 and C(10 000) = 20155319.
+Let $C(n)$ be the number of integer pairs $(a, b)$ such that:
 
-Find C(20 000 000).
+- $1 ≤ a ≤ b ≤ n$,
+- $99 \times N(a, b) ≤ 100 \times P(a, b)$, and
+- $99 \times P(a, b) ≤ 100 \times N(a, b)$.
+
+For example, $C(10) = 13$, $C(500) = 16\\,676$ and $C(10\\,000) = 20\\,155\\,319$.
+
+Find $C(20\\,000\\,000)$.
 
 # --hints--
 
-`euler464()` should return 198775297232878.
+`mobiusFunctionAndIntervals()` should return `198775297232878`.
 
 ```js
-assert.strictEqual(euler464(), 198775297232878);
+assert.strictEqual(mobiusFunctionAndIntervals(), 198775297232878);
 ```
 
 # --seed--
@@ -35,12 +42,12 @@ assert.strictEqual(euler464(), 198775297232878);
 ## --seed-contents--
 
 ```js
-function euler464() {
+function mobiusFunctionAndIntervals() {
 
   return true;
 }
 
-euler464();
+mobiusFunctionAndIntervals();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md
index 2baaf0d7751..57ad5b291d6 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f53d1000cf542c510050
 title: 'Problem 465: Polar polygons'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302140
 dashedName: problem-465-polar-polygons
 ---
@@ -14,22 +14,24 @@ For this problem, a polygon can have collinear consecutive vertices. However, a
 
 For example, only the first of the following is a polar polygon (the kernels of the second, third, and fourth do not strictly contain the origin, and the fifth does not have a kernel at all):
 
+<img class="img-responsive center-block" alt="five example polygons" src="https://cdn.freecodecamp.org/curriculum/project-euler/polar-polygons.png" style="background-color: white; padding: 10px;" />
+
 Notice that the first polygon has three consecutive collinear vertices.
 
-Let P(n) be the number of polar polygons such that the vertices (x, y) have integer coordinates whose absolute values are not greater than n.
+Let $P(n)$ be the number of polar polygons such that the vertices $(x, y)$ have integer coordinates whose absolute values are not greater than $n$.
 
-Note that polygons should be counted as different if they have different set of edges, even if they enclose the same area. For example, the polygon with vertices \[(0,0),(0,3),(1,1),(3,0)] is distinct from the polygon with vertices \[(0,0),(0,3),(1,1),(3,0),(1,0)].
+Note that polygons should be counted as different if they have different set of edges, even if they enclose the same area. For example, the polygon with vertices [(0,0), (0,3), (1,1), (3,0)] is distinct from the polygon with vertices [(0,0), (0,3), (1,1), (3,0), (1,0)].
 
-For example, P(1) = 131, P(2) = 1648531, P(3) = 1099461296175 and P(343) mod 1 000 000 007 = 937293740.
+For example, $P(1) = 131$, $P(2) = 1\\,648\\,531$, $P(3) = 1\\,099\\,461\\,296\\,175$ and $P(343)\bmod 1\\,000\\,000\\,007 = 937\\,293\\,740$.
 
-Find P(713) mod 1 000 000 007.
+Find $P(7^{13})\bmod 1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler465()` should return 585965659.
+`polarPolygons()` should return `585965659`.
 
 ```js
-assert.strictEqual(euler465(), 585965659);
+assert.strictEqual(polarPolygons(), 585965659);
 ```
 
 # --seed--
@@ -37,12 +39,12 @@ assert.strictEqual(euler465(), 585965659);
 ## --seed-contents--
 
 ```js
-function euler465() {
+function polarPolygons() {
 
   return true;
 }
 
-euler465();
+polarPolygons();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md
index 3050ea410b1..cfefe6e7b9f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md
@@ -1,31 +1,37 @@
 ---
 id: 5900f53e1000cf542c510051
 title: 'Problem 466: Distinct terms in a multiplication table'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302141
 dashedName: problem-466-distinct-terms-in-a-multiplication-table
 ---
 
 # --description--
 
-Let P(m,n) be the number of distinct terms in an m×n multiplication table.
+Let $P(m,n)$ be the number of distinct terms in an $m×n$ multiplication table.
 
 For example, a 3×4 multiplication table looks like this:
 
-× 12341 12342 24683 36912
+$$\begin{array}{c}   ×          & \mathbf{1} & \mathbf{2} & \mathbf{3} & \mathbf{4}  \\\\
+  \mathbf{1} & 1          & 2          & 3          & 4  \\\\   \mathbf{2} & 2          & 4          & 6          & 8  \\\\
+  \mathbf{3} & 3          & 6          & 9          & 12 \end{array}$$
 
-There are 8 distinct terms {1,2,3,4,6,8,9,12}, therefore P(3,4) = 8.
+There are 8 distinct terms {1, 2, 3, 4, 6, 8, 9, 12}, therefore $P(3, 4) = 8$.
 
-You are given that: P(64,64) = 1263, P(12,345) = 1998, and P(32,1015) = 13826382602124302.
+You are given that:
 
-Find P(64,1016).
+$$\begin{align}   & P(64, 64) = 1\\,263, \\\\
+  & P(12, 345) = 1\\,998, \text{ and} \\\\   & P(32, {10}^{15}) = 13\\,826\\,382\\,602\\,124\\,302. \\\\
+\end{align}$$
+
+Find $P(64, {10}^{16})$.
 
 # --hints--
 
-`euler466()` should return 258381958195474750.
+`multiplicationTable()` should return `258381958195474750`.
 
 ```js
-assert.strictEqual(euler466(), 258381958195474750);
+assert.strictEqual(multiplicationTable(), 258381958195474750);
 ```
 
 # --seed--
@@ -33,12 +39,12 @@ assert.strictEqual(euler466(), 258381958195474750);
 ## --seed-contents--
 
 ```js
-function euler466() {
+function multiplicationTable() {
 
   return true;
 }
 
-euler466();
+multiplicationTable();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-467-superinteger.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-467-superinteger.md
index 8cfd9dc16ab..9b0caad1704 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-467-superinteger.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-467-superinteger.md
@@ -1,33 +1,42 @@
 ---
 id: 5900f5411000cf542c510052
 title: 'Problem 467: Superinteger'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302142
 dashedName: problem-467-superinteger
 ---
 
 # --description--
 
-An integer s is called a superinteger of another integer n if the digits of n form a subsequence of the digits of s.
+An integer $s$ is called a superinteger of another integer $n$ if the digits of $n$ form a subsequence of the digits of $s$.
 
 For example, 2718281828 is a superinteger of 18828, while 314159 is not a superinteger of 151.
 
-Let p(n) be the nth prime number, and let c(n) be the nth composite number. For example, p(1) = 2, p(10) = 29, c(1) = 4 and c(10) = 18. {p(i) : i ≥ 1} = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, ...} {c(i) : i ≥ 1} = {4, 6, 8, 9, 10, 12, 14, 15, 16, 18, ...}
+Let $p(n)$ be the $n$th prime number, and let $c(n)$ be the $n$th composite number. For example, $p(1) = 2$, $p(10) = 29$, $c(1) = 4$ and $c(10) = 18$.
 
-Let PD the sequence of the digital roots of {p(i)} (CD is defined similarly for {c(i)}): PD = {2, 3, 5, 7, 2, 4, 8, 1, 5, 2, ...} CD = {4, 6, 8, 9, 1, 3, 5, 6, 7, 9, ...}
+$$\begin{align}   & \\{p(i) : i ≥ 1\\} = \\{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, \ldots \\} \\\\
+  & \\{c(i) : i ≥ 1\\} = \\{4, 6, 8, 9, 10, 12, 14, 15, 16, 18, \ldots \\} \end{align}$$
 
-Let Pn be the integer formed by concatenating the first n elements of PD (Cn is defined similarly for CD). P10 = 2357248152 C10 = 4689135679
+Let $P^D$ the sequence of the digital roots of $\\{p(i)\\}$ ($C^D$ is defined similarly for $\\{c(i)\\}$):
 
-Let f(n) be the smallest positive integer that is a common superinteger of Pn and Cn. For example, f(10) = 2357246891352679, and f(100) mod 1 000 000 007 = 771661825.
+$$\begin{align}   & P^D = \\{2, 3, 5, 7, 2, 4, 8, 1, 5, 2, \ldots \\} \\\\
+  & C^D = \\{4, 6, 8, 9, 1, 3, 5, 6, 7, 9, \ldots \\} \end{align}$$
 
-Find f(10 000) mod 1 000 000 007.
+Let $P_n$ be the integer formed by concatenating the first $n$ elements of $P^D$ ($C_n$ is defined similarly for $C^D$).
+
+$$\begin{align}   & P_{10} = 2\\,357\\,248\\,152 \\\\
+  & C_{10} = 4\\,689\\,135\\,679 \end{align}$$
+
+Let $f(n)$ be the smallest positive integer that is a common superinteger of $P_n$ and $C_n$. For example, $f(10) = 2\\,357\\,246\\,891\\,352\\,679$, and $f(100)\bmod 1\\,000\\,000\\,007 = 771\\,661\\,825$.
+
+Find $f(10\\,000)\bmod 1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler467()` should return 775181359.
+`superinteger()` should return `775181359`.
 
 ```js
-assert.strictEqual(euler467(), 775181359);
+assert.strictEqual(superinteger(), 775181359);
 ```
 
 # --seed--
@@ -35,12 +44,12 @@ assert.strictEqual(euler467(), 775181359);
 ## --seed-contents--
 
 ```js
-function euler467() {
+function superinteger() {
 
   return true;
 }
 
-euler467();
+superinteger();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md
index 239d2cf56d4..6a97cc8ec95 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md
@@ -1,27 +1,37 @@
 ---
 id: 5900f5411000cf542c510054
-title: 'Problem 468: Smooth divisors of binomial coefficients'
-challengeType: 5
+title: '問題 468：二項式係數的平滑除數'
+challengeType: 1
 forumTopicId: 302143
 dashedName: problem-468-smooth-divisors-of-binomial-coefficients
 ---
 
 # --description--
 
-An integer is called B-smooth if none of its prime factors is greater than B.
+An integer is called B-smooth if none of its prime factors is greater than $B$.
 
-Let SB(n) be the largest B-smooth divisor of n. Examples: S1(10) = 1 S4(2100) = 12 S17(2496144) = 5712
+Let $SB(n)$ be the largest B-smooth divisor of $n$.
 
-Define F(n) = ∑1≤B≤n ∑0≤r≤n SB(C(n,r)). Here, C(n,r) denotes the binomial coefficient. Examples: F(11) = 3132 F(1 111) mod 1 000 000 993 = 706036312 F(111 111) mod 1 000 000 993 = 22156169
+示例：
 
-Find F(11 111 111) mod 1 000 000 993.
+$$\begin{align}   & S_1(10) = 1 \\\\
+  & S_4(2\\,100) = 12 \\\\ & S_{17}(2\\,496\\,144) = 5\\,712 \end{align}$$
+
+Define $F(n) = \displaystyle\sum_{B = 1}^n \sum_{r = 0}^n S_B(\displaystyle\binom{n}{r})$. Here, $\displaystyle\binom{n}{r}$ denotes the binomial coefficient.
+
+示例：
+
+$$\begin{align}   & F(11) = 3132 \\\\
+  & F(1\\,111)\bmod 1\\,000\\,000\\,993 = 706\\,036\\,312 \\\\ & F(111\\,111)\bmod 1\\,000\\,000\\,993 = 22\\,156\\,169 \end{align}$$
+
+Find $F(11\\,111\\,111)\bmod 1\\,000\\,000\\,993$.
 
 # --hints--
 
-`euler468()` should return 852950321.
+`smoothDivisorsOfBinomialCoefficients()` should return `852950321`.
 
 ```js
-assert.strictEqual(euler468(), 852950321);
+assert.strictEqual(smoothDivisorsOfBinomialCoefficients(), 852950321);
 ```
 
 # --seed--
@@ -29,12 +39,12 @@ assert.strictEqual(euler468(), 852950321);
 ## --seed-contents--
 
 ```js
-function euler468() {
+function smoothDivisorsOfBinomialCoefficients() {
 
   return true;
 }
 
-euler468();
+smoothDivisorsOfBinomialCoefficients();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-469-empty-chairs.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-469-empty-chairs.md
index 4e8be025a2f..3dce49fdd9a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-469-empty-chairs.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-469-empty-chairs.md
@@ -1,29 +1,31 @@
 ---
 id: 5900f5411000cf542c510053
 title: 'Problem 469: Empty chairs'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302144
 dashedName: problem-469-empty-chairs
 ---
 
 # --description--
 
-In a room N chairs are placed around a round table.
+In a room $N$ chairs are placed around a round table.
 
 Knights enter the room one by one and choose at random an available empty chair.
 
 To have enough elbow room the knights always leave at least one empty chair between each other.
 
-When there aren't any suitable chairs left, the fraction C of empty chairs is determined. We also define E(N) as the expected value of C. We can verify that E(4) = 1/2 and E(6) = 5/9.
+When there aren't any suitable chairs left, the fraction $C$ of empty chairs is determined. We also define $E(N)$ as the expected value of $C$.
 
-Find E(1018). Give your answer rounded to fourteen decimal places in the form 0.abcdefghijklmn.
+We can verify that $E(4) = \frac{1}{2}$ and $E(6) = \frac{5}{9}$.
+
+Find $E({10}^{18})$. Give your answer rounded to fourteen decimal places in the form 0.abcdefghijklmn.
 
 # --hints--
 
-`euler469()` should return 0.56766764161831.
+`emptyChairs()` should return `0.56766764161831`.
 
 ```js
-assert.strictEqual(euler469(), 0.56766764161831);
+assert.strictEqual(emptyChairs(), 0.56766764161831);
 ```
 
 # --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler469(), 0.56766764161831);
 ## --seed-contents--
 
 ```js
-function euler469() {
+function emptyChairs() {
 
   return true;
 }
 
-euler469();
+emptyChairs();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md
index 998b035f79d..978b7affd9b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f39c1000cf542c50feae
 title: 'Problem 47: Distinct primes factors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302145
 dashedName: problem-47-distinct-primes-factors
 ---
@@ -67,47 +67,25 @@ distinctPrimeFactors(4, 4);
 # --solutions--
 
 ```js
+// Initalize factor count with seive
+const NUMFACTORS = Array(135000).fill(0);
+(function initFactors(num) {
+  for (let i = 2; i < num; i++)
+    if (NUMFACTORS[i] === 0)
+      for (let j = i; j < num; j += i)
+        NUMFACTORS[j]++;
+})(135000);
+
 function distinctPrimeFactors(targetNumPrimes, targetConsecutive) {
-  function numberOfPrimeFactors(n) {
-    let factors = 0;
-
-    //  Considering 2 as a special case
-    let firstFactor = true;
-    while (n % 2 == 0) {
-      n = n / 2;
-      if (firstFactor) {
-        factors++;
-        firstFactor = false;
-      }
-    }
-    // Adding other factors
-    for (let i = 3; i < Math.sqrt(n); i += 2) {
-      firstFactor = true;
-      while (n % i == 0) {
-        n = n / i;
-        if (firstFactor) {
-          factors++;
-          firstFactor = false;
-        }
-      }
-    }
-
-    if (n > 1) { factors++; }
-
-    return factors;
+  let numConsecutive = 0;
+  let currNumber = 10;
+  while (numConsecutive < targetConsecutive) {
+    if (NUMFACTORS[currNumber] === targetNumPrimes)
+      numConsecutive++;
+    else
+      numConsecutive = 0;
+    currNumber++;
   }
-
-  let number = 0;
-  let consecutive = 0;
-
-  while (consecutive < targetConsecutive) {
-    number++;
-    if (numberOfPrimeFactors(number) >= targetNumPrimes) {
-      consecutive++;
-    } else {
-      consecutive = 0;
-    }
-  }
-  return number - targetConsecutive + 1;
+  return currNumber - targetConsecutive;
 }
 ```
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-470-super-ramvok.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-470-super-ramvok.md
index 10ee6d95d8b..7d0f1aad0ee 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-470-super-ramvok.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-470-super-ramvok.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5431000cf542c510055
 title: 'Problem 470: Super Ramvok'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302146
 dashedName: problem-470-super-ramvok
 ---
@@ -10,24 +10,24 @@ dashedName: problem-470-super-ramvok
 
 Consider a single game of Ramvok:
 
-Let t represent the maximum number of turns the game lasts. If t = 0, then the game ends immediately. Otherwise, on each turn i, the player rolls a die. After rolling, if i &lt; t the player can either stop the game and receive a prize equal to the value of the current roll, or discard the roll and try again next turn. If i = t, then the roll cannot be discarded and the prize must be accepted. Before the game begins, t is chosen by the player, who must then pay an up-front cost ct for some constant c. For c = 0, t can be chosen to be infinite (with an up-front cost of 0). Let R(d, c) be the expected profit (i.e. net gain) that the player receives from a single game of optimally-played Ramvok, given a fair d-sided die and cost constant c. For example, R(4, 0.2) = 2.65. Assume that the player has sufficient funds for paying any/all up-front costs.
+Let $t$ represent the maximum number of turns the game lasts. If $t = 0$, then the game ends immediately. Otherwise, on each turn $i$, the player rolls a die. After rolling, if $i &lt; t$ the player can either stop the game and receive a prize equal to the value of the current roll, or discard the roll and try again next turn. If $i = t$, then the roll cannot be discarded and the prize must be accepted. Before the game begins, $t$ is chosen by the player, who must then pay an up-front cost $ct$ for some constant $c$. For $c = 0$, $t$ can be chosen to be infinite (with an up-front cost of 0). Let $R(d, c)$ be the expected profit (i.e. net gain) that the player receives from a single game of optimally-played Ramvok, given a fair $d$-sided die and cost constant $c$. For example, $R(4, 0.2) = 2.65$. Assume that the player has sufficient funds for paying any/all up-front costs.
 
 Now consider a game of Super Ramvok:
 
 In Super Ramvok, the game of Ramvok is played repeatedly, but with a slight modification. After each game, the die is altered. The alteration process is as follows: The die is rolled once, and if the resulting face has its pips visible, then that face is altered to be blank instead. If the face is already blank, then it is changed back to its original value. After the alteration is made, another game of Ramvok can begin (and during such a game, at each turn, the die is rolled until a face with a value on it appears). The player knows which faces are blank and which are not at all times. The game of Super Ramvok ends once all faces of the die are blank.
 
-Let S(d, c) be the expected profit that the player receives from an optimally-played game of Super Ramvok, given a fair d-sided die to start (with all sides visible), and cost constant c. For example, S(6, 1) = 208.3.
+Let $S(d, c)$ be the expected profit that the player receives from an optimally-played game of Super Ramvok, given a fair $d$-sided die to start (with all sides visible), and cost constant $c$. For example, $S(6, 1) = 208.3$.
 
-Let F(n) = ∑4≤d≤n ∑0≤c≤n S(d, c).
+Let $F(n) = \sum_{4 ≤ d ≤ n} \sum_{0 ≤ c ≤ n} S(d, c)$.
 
-Calculate F(20), rounded to the nearest integer.
+Calculate $F(20)$, rounded to the nearest integer.
 
 # --hints--
 
-`euler470()` should return 147668794.
+`superRamvok()` should return `147668794`.
 
 ```js
-assert.strictEqual(euler470(), 147668794);
+assert.strictEqual(superRamvok(), 147668794);
 ```
 
 # --seed--
@@ -35,12 +35,12 @@ assert.strictEqual(euler470(), 147668794);
 ## --seed-contents--
 
 ```js
-function euler470() {
+function superRamvok() {
 
   return true;
 }
 
-euler470();
+superRamvok();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md
index 95385ddec9c..87fba0ff50a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md
@@ -1,27 +1,43 @@
 ---
 id: 5900f5431000cf542c510056
 title: 'Problem 471: Triangle inscribed in ellipse'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302148
 dashedName: problem-471-triangle-inscribed-in-ellipse
 ---
 
 # --description--
 
-The triangle ΔABC is inscribed in an ellipse with equation $\\frac {x^2} {a^2} + \\frac {y^2} {b^2} = 1$, 0 &lt; 2b &lt; a, a and b integers.
+The triangle $ΔABC$ is inscribed in an ellipse with equation $\frac{x^2}{a^2} + \frac{y^2}{b^2} = 1$, $0 &lt; 2b &lt; a$, $a$ and $b$ integers.
 
-Let r(a,b) be the radius of the incircle of ΔABC when the incircle has center (2b, 0) and A has coordinates $\\left( \\frac a 2, \\frac {\\sqrt 3} 2 b\\right)$.
+Let $r(a, b)$ be the radius of the incircle of $ΔABC$ when the incircle has center $(2b, 0)$ and $A$ has coordinates $\left(\frac{a}{2}, \frac{\sqrt{3}}{2}b\right)$.
 
-For example, r(3,1) = ½, r(6,2) = 1, r(12,3) = 2.
+For example, $r(3, 1) = \frac{1}{2}, r(6, 2) = 1, r(12, 3) = 2$.
 
-Let $G(n) = \\sum*{a=3}^n \\sum*{b=1}^{\\lfloor \\frac {a - 1} 2 \\rfloor} r(a, b)$ You are given G(10) = 20.59722222, G(100) = 19223.60980 (rounded to 10 significant digits). Find G(1011). Give your answer in scientific notation rounded to 10 significant digits. Use a lowercase e to separate mantissa and exponent. For G(10) the answer would have been 2.059722222e1.
+<img class="img-responsive center-block" alt="triangle ΔABC inscribed in an ellipse, radius of the incircle of ΔABC r(6, 2) = 1" src="https://cdn.freecodecamp.org/curriculum/project-euler/triangle-inscribed-in-ellipse-1.png" style="background-color: white; padding: 10px;" />
+
+<img class="img-responsive center-block" alt="triangle ΔABC inscribed in an ellipse, radius of the incircle of ΔABC r(12, 3) = 2" src="https://cdn.freecodecamp.org/curriculum/project-euler/triangle-inscribed-in-ellipse-2.png" style="background-color: white; padding: 10px;" />
+
+Let $G(n) = \sum_{a = 3}^n \sum_{b = 1}^{\left\lfloor\frac{a - 1}{2} \right\rfloor} r(a, b)$
+
+You are given $G(10) = 20.59722222$, $G(100) = 19223.60980$ (rounded to 10 significant digits).
+
+Find $G({10}^{11})$. Give your answer as a string in scientific notation rounded to 10 significant digits. Use a lowercase `e` to separate mantissa and exponent.
+
+For $G(10)$ the answer would have been `2.059722222e1`
 
 # --hints--
 
-`euler471()` should return 1.895093981e+31.
+`triangleInscribedInEllipse()` should return a string.
 
 ```js
-assert.strictEqual(euler471(), 1.895093981e31);
+assert(typeof triangleInscribedInEllipse() === 'string');
+```
+
+`triangleInscribedInEllipse()` should return the string `1.895093981e31`.
+
+```js
+assert.strictEqual(triangleInscribedInEllipse(), '1.895093981e31');
 ```
 
 # --seed--
@@ -29,12 +45,12 @@ assert.strictEqual(euler471(), 1.895093981e31);
 ## --seed-contents--
 
 ```js
-function euler471() {
+function triangleInscribedInEllipse() {
 
   return true;
 }
 
-euler471();
+triangleInscribedInEllipse();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md
index f4e90155496..25c9c601cf6 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md
@@ -1,39 +1,39 @@
 ---
 id: 5900f5451000cf542c510057
 title: 'Problem 472: Comfortable Distance II'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302149
 dashedName: problem-472-comfortable-distance-ii
 ---
 
 # --description--
 
-There are N seats in a row. N people come one after another to fill the seats according to the following rules:
+There are $N$ seats in a row. $N$ people come one after another to fill the seats according to the following rules:
 
-No person sits beside another.
+1. No person sits beside another.
+1. The first person chooses any seat.
+1. Each subsequent person chooses the seat furthest from anyone else already seated, as long as it does not violate rule 1. If there is more than one choice satisfying this condition, then the person chooses the leftmost choice.
 
-The first person chooses any seat.
+Note that due to rule 1, some seats will surely be left unoccupied, and the maximum number of people that can be seated is less than $N$ (for $N > 1$).
 
-Each subsequent person chooses the seat furthest from anyone else already seated, as long as it does not violate rule 1. If there is more than one choice satisfying this condition, then the person chooses the leftmost choice.
+Here are the possible seating arrangements for $N = 15$:
 
-Note that due to rule 1, some seats will surely be left unoccupied, and the maximum number of people that can be seated is less than N (for N > 1).
-
-Here are the possible seating arrangements for N = 15:
+<img class="img-responsive center-block" alt="seating arrangements for N = 15" src="https://cdn.freecodecamp.org/curriculum/project-euler/comfortable-distance-ii.png" style="background-color: white; padding: 10px;" />
 
 We see that if the first person chooses correctly, the 15 seats can seat up to 7 people. We can also see that the first person has 9 choices to maximize the number of people that may be seated.
 
-Let f(N) be the number of choices the first person has to maximize the number of occupants for N seats in a row. Thus, f(1) = 1, f(15) = 9, f(20) = 6, and f(500) = 16.
+Let $f(N)$ be the number of choices the first person has to maximize the number of occupants for $N$ seats in a row. Thus, $f(1) = 1$, $f(15) = 9$, $f(20) = 6$, and $f(500) = 16$.
 
-Also, ∑f(N) = 83 for 1 ≤ N ≤ 20 and ∑f(N) = 13343 for 1 ≤ N ≤ 500.
+Also, $\sum f(N) = 83$ for $1 ≤ N ≤ 20$ and $\sum f(N) = 13\\,343$ for $1 ≤ N ≤ 500$.
 
-Find ∑f(N) for 1 ≤ N ≤ 1012. Give the last 8 digits of your answer.
+Find $\sum f(N)$ for $1 ≤ N ≤ {10}^{12}$. Give the last 8 digits of your answer.
 
 # --hints--
 
-`euler472()` should return 73811586.
+`comfortableDistanceTwo()` should return `73811586`.
 
 ```js
-assert.strictEqual(euler472(), 73811586);
+assert.strictEqual(comfortableDistanceTwo(), 73811586);
 ```
 
 # --seed--
@@ -41,12 +41,12 @@ assert.strictEqual(euler472(), 73811586);
 ## --seed-contents--
 
 ```js
-function euler472() {
+function comfortableDistanceTwo() {
 
   return true;
 }
 
-euler472();
+comfortableDistanceTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md
index 505c8a757ba..97a545fed4c 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md
@@ -1,16 +1,16 @@
 ---
 id: 5900f5461000cf542c510058
 title: 'Problem 473: Phigital number base'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302150
 dashedName: problem-473-phigital-number-base
 ---
 
 # --description--
 
-Let $\\varphi$ be the golden ratio: $\\varphi=\\frac{1+\\sqrt{5}}{2}.$
+Let $\varphi$ be the golden ratio: $\varphi = \frac{1+\sqrt{5}}{2}.$
 
-Remarkably it is possible to write every positive integer as a sum of powers of $\\varphi$ even if we require that every power of $\\varphi$ is used at most once in this sum.
+Remarkably it is possible to write every positive integer as a sum of powers of $\varphi$ even if we require that every power of $\varphi$ is used at most once in this sum.
 
 Even then this representation is not unique.
 
@@ -18,9 +18,11 @@ We can make it unique by requiring that no powers with consecutive exponents are
 
 E.g:
 
-$2=\\varphi+\\varphi^{-2}$ and $3=\\varphi^{2}+\\varphi^{-2}$
+$2 = \varphi + \varphi^{-2}$ and $3 = \varphi^{2} + \varphi^{-2}$
 
-To represent this sum of powers of $\\varphi$ we use a string of 0's and 1's with a point to indicate where the negative exponents start. We call this the representation in the phigital numberbase. So $1=1*{\\varphi}$, $2=10.01*{\\varphi}$, $3=100.01*{\\varphi}$ and $14=100100.001001*{\\varphi}$. The strings representing 1, 2 and 14 in the phigital number base are palindromic, while the string representing 3 is not. (the phigital point is not the middle character).
+To represent this sum of powers of $\varphi$ we use a string of 0's and 1's with a point to indicate where the negative exponents start. We call this the representation in the phigital numberbase.
+
+So $1 = 1_{\varphi}$, $2 = 10.01_{\varphi}$, $3 = 100.01_{\varphi}$ and $14 = 100100.001001_{\varphi}$. The strings representing 1, 2 and 14 in the phigital number base are palindromic, while the string representing 3 is not (the phigital point is not the middle character).
 
 The sum of the positive integers not exceeding 1000 whose phigital representation is palindromic is 4345.
 
@@ -28,10 +30,10 @@ Find the sum of the positive integers not exceeding $10^{10}$ whose phigital rep
 
 # --hints--
 
-`euler473()` should return 35856681704365.
+`phigitalNumberBase()` should return `35856681704365`.
 
 ```js
-assert.strictEqual(euler473(), 35856681704365);
+assert.strictEqual(phigitalNumberBase(), 35856681704365);
 ```
 
 # --seed--
@@ -39,12 +41,12 @@ assert.strictEqual(euler473(), 35856681704365);
 ## --seed-contents--
 
 ```js
-function euler473() {
+function phigitalNumberBase() {
 
   return true;
 }
 
-euler473();
+phigitalNumberBase();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.md
index 5c77726bd25..e63a971d336 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f5471000cf542c510059
 title: 'Problem 474: Last digits of divisors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302151
 dashedName: problem-474-last-digits-of-divisors
 ---
 
 # --description--
 
-For a positive integer n and digits d, we define F(n, d) as the number of the divisors of n whose last digits equal d.
+For a positive integer $n$ and digits $d$, we define $F(n, d)$ as the number of the divisors of $n$ whose last digits equal $d$.
 
-For example, F(84, 4) = 3. Among the divisors of 84 (1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84), three of them (4, 14, 84) have the last digit 4.
+For example, $F(84, 4) = 3$. Among the divisors of 84 (1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84), three of them (4, 14, 84) have the last digit 4.
 
-We can also verify that F(12!, 12) = 11 and F(50!, 123) = 17888.
+We can also verify that $F(12!, 12) = 11$ and $F(50!, 123) = 17\\,888$.
 
-Find F(106!, 65432) modulo (1016 + 61).
+Find $F({10}^6!, 65\\,432) \text{ modulo } ({10}^{16} + 61)$.
 
 # --hints--
 
-`euler474()` should return 9690646731515010.
+`lastDigitsOfDivisors()` should return `9690646731515010`.
 
 ```js
-assert.strictEqual(euler474(), 9690646731515010);
+assert.strictEqual(lastDigitsOfDivisors(), 9690646731515010);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler474(), 9690646731515010);
 ## --seed-contents--
 
 ```js
-function euler474() {
+function lastDigitsOfDivisors() {
 
   return true;
 }
 
-euler474();
+lastDigitsOfDivisors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-475-music-festival.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-475-music-festival.md
index dd8cf3538b7..9f019e969d0 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-475-music-festival.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-475-music-festival.md
@@ -1,29 +1,31 @@
 ---
 id: 5900f5481000cf542c51005a
 title: 'Problem 475: Music festival'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302152
 dashedName: problem-475-music-festival
 ---
 
 # --description--
 
-12n musicians participate at a music festival. On the first day, they form 3n quartets and practice all day.
+$12n$ musicians participate at a music festival. On the first day, they form $3n$ quartets and practice all day.
 
 It is a disaster. At the end of the day, all musicians decide they will never again agree to play with any member of their quartet.
 
-On the second day, they form 4n trios, each musician avoiding his previous quartet partners.
+On the second day, they form $4n$ trios, each musician avoiding his previous quartet partners.
 
-Let f(12n) be the number of ways to organize the trios amongst the 12n musicians. You are given f(12) = 576 and f(24) mod 1 000 000 007 = 509089824.
+Let $f(12n)$ be the number of ways to organize the trios amongst the $12n$ musicians.
 
-Find f(600) mod 1 000 000 007.
+You are given $f(12) = 576$ and $f(24)\bmod 1\\,000\\,000\\,007 = 509\\,089\\,824$.
+
+Find $f(600)\bmod 1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler475()` should return 75780067.
+`musicFestival()` should return `75780067`.
 
 ```js
-assert.strictEqual(euler475(), 75780067);
+assert.strictEqual(musicFestival(), 75780067);
 ```
 
 # --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler475(), 75780067);
 ## --seed-contents--
 
 ```js
-function euler475() {
+function musicFestival() {
 
   return true;
 }
 
-euler475();
+musicFestival();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-476-circle-packing-ii.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-476-circle-packing-ii.md
index a5a8bf868b0..c6f88e38013 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-476-circle-packing-ii.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-476-circle-packing-ii.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f5481000cf542c51005b
 title: 'Problem 476: Circle Packing II'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302153
 dashedName: problem-476-circle-packing-ii
 ---
 
 # --description--
 
-Let R(a, b, c) be the maximum area covered by three non-overlapping circles inside a triangle with edge lengths a, b and c.
+Let $R(a, b, c)$ be the maximum area covered by three non-overlapping circles inside a triangle with edge lengths $a$, $b$ and $c$.
 
-Let S(n) be the average value of R(a, b, c) over all integer triplets (a, b, c) such that 1 ≤ a ≤ b ≤ c &lt; a + b ≤ n
+Let $S(n)$ be the average value of $R(a, b, c)$ over all integer triplets $(a, b, c)$ such that $1 ≤ a ≤ b ≤ c &lt; a + b ≤ n$.
 
-You are given S(2) = R(1, 1, 1) ≈ 0.31998, S(5) ≈ 1.25899.
+You are given $S(2) = R(1, 1, 1) ≈ 0.31998$, $S(5) ≈ 1.25899$.
 
-Find S(1803) rounded to 5 decimal places behind the decimal point.
+Find $S(1803)$ rounded to 5 decimal places behind the decimal point.
 
 # --hints--
 
-`euler476()` should return 110242.87794.
+`circlePackingTwo()` should return `110242.87794`.
 
 ```js
-assert.strictEqual(euler476(), 110242.87794);
+assert.strictEqual(circlePackingTwo(), 110242.87794);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler476(), 110242.87794);
 ## --seed-contents--
 
 ```js
-function euler476() {
+function circlePackingTwo() {
 
   return true;
 }
 
-euler476();
+circlePackingTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-477-number-sequence-game.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-477-number-sequence-game.md
index f4c95faba72..97ceba639af 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-477-number-sequence-game.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-477-number-sequence-game.md
@@ -1,49 +1,45 @@
 ---
 id: 5900f54a1000cf542c51005c
-title: 'Problem 477: Number Sequence Game'
-challengeType: 5
+title: '問題 477：數字序列遊戲'
+challengeType: 1
 forumTopicId: 302154
 dashedName: problem-477-number-sequence-game
 ---
 
 # --description--
 
-The number sequence game starts with a sequence S of N numbers written on a line.
+The number sequence game starts with a sequence $S$ of $N$ numbers written on a line.
 
-Two players alternate turns. At his turn, a player must select and remove either the first or the last number remaining in the sequence.
+兩名玩家交替輪流。 在輪到他時，玩家必須選擇並刪除序列中剩餘的第一個或最後一個數字。
 
-The player score is the sum of all the numbers he has taken. Each player attempts to maximize his own sum.
+玩家得分是他所取所有數字的總和。 每個玩家都試圖最大化自己的總和。
 
-If N = 4 and S = {1, 2, 10, 3}, then each player maximizes his score as follows:
+If $N = 4$ and $S = \\{1, 2, 10, 3\\}$, then each player maximizes his score as follows:
 
-Player 1: removes the first number (1)
+- Player 1: removes the first number (1)
+- Player 2: removes the last number from the remaining sequence (3)
+- Player 1: removes the last number from the remaining sequence (10)
+- Player 2: removes the remaining number (2)
 
-Player 2: removes the last number from the remaining sequence (3)
+Player 1 score is $1 + 10 = 11$.
 
-Player 1: removes the last number from the remaining sequence (10)
+Let $F(N)$ be the score of player 1 if both players follow the optimal strategy for the sequence $S = \\{s_1, s_2, \ldots, s_N\\}$ defined as:
 
-Player 2: removes the remaining number (2)
+- $s_1 = 0$
+- $s_{i + 1} = ({s_i}^2 + 45)$ modulo $1\\,000\\,000\\,007$
 
-Player 1 score is 1 + 10 = 11.
+The sequence begins with $S = \\{0, 45, 2\\,070, 4\\,284\\,945, 753\\,524\\,550, 478\\,107\\,844, 894\\,218\\,625, \ldots\\}$.
 
-Let F(N) be the score of player 1 if both players follow the optimal strategy for the sequence S = {s1, s2, ..., sN} defined as:
+You are given $F(2) = 45$, $F(4) = 4\\,284\\,990$, $F(100) = 26\\,365\\,463\\,243$, $F(104) = 2\\,495\\,838\\,522\\,951$.
 
-s1 = 0
-
-si+1 = (si2 + 45) modulo 1 000 000 007
-
-The sequence begins with S = {0, 45, 2070, 4284945, 753524550, 478107844, 894218625, ...}.
-
-You are given F(2) = 45, F(4) = 4284990, F(100) = 26365463243, F(104) = 2495838522951.
-
-Find F(108).
+Find $F({10}^8)$.
 
 # --hints--
 
-`euler477()` should return 25044905874565164.
+`numberSequenceGame()` should return `25044905874565164`.
 
 ```js
-assert.strictEqual(euler477(), 25044905874565164);
+assert.strictEqual(numberSequenceGame(), 25044905874565164);
 ```
 
 # --seed--
@@ -51,12 +47,12 @@ assert.strictEqual(euler477(), 25044905874565164);
 ## --seed-contents--
 
 ```js
-function euler477() {
+function numberSequenceGame() {
 
   return true;
 }
 
-euler477();
+numberSequenceGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-478-mixtures.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-478-mixtures.md
index 37e7681ecff..bfa07a9a8d5 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-478-mixtures.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-478-mixtures.md
@@ -1,33 +1,39 @@
 ---
 id: 5900f54c1000cf542c51005e
-title: 'Problem 478: Mixtures'
-challengeType: 5
+title: '問題 478：混合物'
+challengeType: 1
 forumTopicId: 302155
 dashedName: problem-478-mixtures
 ---
 
 # --description--
 
-Let us consider mixtures of three substances: A, B and C. A mixture can be described by a ratio of the amounts of A, B, and C in it, i.e., (a : b : c). For example, a mixture described by the ratio (2 : 3 : 5) contains 20% A, 30% B and 50% C.
+Let us consider mixtures of three substances: $A$, $B$ and $C$. A mixture can be described by a ratio of the amounts of $A$, $B$, and $C$ in it, i.e., $(a : b : c)$. For example, a mixture described by the ratio (2 : 3 : 5) contains 20% $A$, 30% $B$ and 50% $C$.
 
 For the purposes of this problem, we cannot separate the individual components from a mixture. However, we can combine different amounts of different mixtures to form mixtures with new ratios.
 
-For example, say we have three mixtures with ratios (3 : 0 : 2), (3 : 6 : 11) and (3 : 3 : 4). By mixing 10 units of the first, 20 units of the second and 30 units of the third, we get a new mixture with ratio (6 : 5 : 9), since: (10·3/5 + 20·3/20 + 30·3/10 : 10·0/5 + 20·6/20 + 30·3/10 : 10·2/5 + 20·11/20 + 30·4/10) = (18 : 15 : 27) = (6 : 5 : 9)
+For example, say we have three mixtures with ratios (3 : 0 : 2), (3 : 6 : 11) and (3 : 3 : 4). By mixing 10 units of the first, 20 units of the second and 30 units of the third, we get a new mixture with ratio (6 : 5 : 9), since: ($10 \times \frac{3}{5} + 20 \times \frac{3}{20} + 30 \times \frac{3}{10}$ : $10 \times \frac{0}{5} + 20 \times \frac{6}{20} + 30 \times \frac{3}{10}$ : $10 \times \frac{2}{5} + 20 \times \frac{11}{20} + 30 \times \frac{4}{10}$) = (18 : 15 : 27) = (6 : 5 : 9)
 
-However, with the same three mixtures, it is impossible to form the ratio (3 : 2 : 1), since the amount of B is always less than the amount of C.
+However, with the same three mixtures, it is impossible to form the ratio (3 : 2 : 1), since the amount of $B$ is always less than the amount of $C$.
 
-Let n be a positive integer. Suppose that for every triple of integers (a, b, c) with 0 ≤ a, b, c ≤ n and gcd(a, b, c) = 1, we have a mixture with ratio (a : b : c). Let M(n) be the set of all such mixtures.
+Let $n$ be a positive integer. Suppose that for every triple of integers $(a, b, c)$ with $0 ≤ a, b, c ≤ n$ and $gcd(a, b, c) = 1$, we have a mixture with ratio $(a : b : c)$. Let $M(n)$ be the set of all such mixtures.
 
-For example, M(2) contains the 19 mixtures with the following ratios: {(0 : 0 : 1), (0 : 1 : 0), (0 : 1 : 1), (0 : 1 : 2), (0 : 2 : 1), (1 : 0 : 0), (1 : 0 : 1), (1 : 0 : 2), (1 : 1 : 0), (1 : 1 : 1), (1 : 1 : 2), (1 : 2 : 0), (1 : 2 : 1), (1 : 2 : 2), (2 : 0 : 1), (2 : 1 : 0), (2 : 1 : 1), (2 : 1 : 2), (2 : 2 : 1)}.
+For example, $M(2)$ contains the 19 mixtures with the following ratios:
 
-Let E(n) be the number of subsets of M(n) which can produce the mixture with ratio (1 : 1 : 1), i.e., the mixture with equal parts A, B and C. We can verify that E(1) = 103, E(2) = 520447, E(10) mod 118 = 82608406 and E(500) mod 118 = 13801403. Find E(10 000 000) mod 118.
+{(0 : 0 : 1), (0 : 1 : 0), (0 : 1 : 1), (0 : 1 : 2), (0 : 2 : 1), (1 : 0 : 0), (1 : 0 : 1), (1 : 0 : 2), (1 : 1 : 0), (1 : 1 : 1), (1 : 1 : 2), (1 : 2 : 0), (1 : 2 : 1), (1 : 2 : 2), (2 : 0 : 1), (2 : 1 : 0), (2 : 1 : 1), (2 : 1 : 2), (2 : 2 : 1)}.
+
+Let $E(n)$ be the number of subsets of $M(n)$ which can produce the mixture with ratio (1 : 1 : 1), i.e., the mixture with equal parts $A$, $B$ and $C$.
+
+We can verify that $E(1) = 103$, $E(2) = 520\\,447$, $E(10)\bmod {11}^8 = 82\\,608\\,406$ and $E(500)\bmod {11}^8 = 13\\,801\\,403$.
+
+Find $E(10\\,000\\,000)\bmod {11}^8$.
 
 # --hints--
 
-`euler478()` should return 59510340.
+`mixtures()` should return `59510340`.
 
 ```js
-assert.strictEqual(euler478(), 59510340);
+assert.strictEqual(mixtures(), 59510340);
 ```
 
 # --seed--
@@ -35,12 +41,12 @@ assert.strictEqual(euler478(), 59510340);
 ## --seed-contents--
 
 ```js
-function euler478() {
+function mixtures() {
 
   return true;
 }
 
-euler478();
+mixtures();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.md
index 202e7e04be7..b905a648468 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f54b1000cf542c51005d
 title: 'Problem 479: Roots on the Rise'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302156
 dashedName: problem-479-roots-on-the-rise
 ---
 
 # --description--
 
-Let ak, bk, and ck represent the three solutions (real or complex numbers) to the expression 1/x = (k/x)2(k+x2) - kx.
+Let $a_k$, $b_k$, and $c_k$ represent the three solutions (real or complex numbers) to the expression $\frac{1}{x} = {\left(\frac{k}{x} \right)}^2 (k + x^2) - kx$.
 
-For instance, for k = 5, we see that {a5, b5, c5} is approximately {5.727244, -0.363622+2.057397i, -0.363622-2.057397i}.
+For instance, for $k = 5$, we see that $\\{a_5, b_5, c_5\\}$ is approximately $\\{5.727244, -0.363622 + 2.057397i, -0.363622 - 2.057397i\\}$.
 
-Let S(n) = Σ (ak+bk)p(bk+ck)p(ck+ak)p for all integers p, k such that 1 ≤ p, k ≤ n.
+Let $S(n) = \displaystyle\sum_{p = 1}^n \sum_{k = 1}^n {(a_k + b_k)}^p {(b_k + c_k)}^p {(c_k + a_k)}^p$ for all integers $p$, $k$ such that $1 ≤ p, k ≤ n$.
 
-Interestingly, S(n) is always an integer. For example, S(4) = 51160.
+Interestingly, $S(n)$ is always an integer. For example, $S(4) = 51\\,160$.
 
-Find S(106) modulo 1 000 000 007.
+Find $S({10}^6) \text{ modulo } 1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler479()` should return 191541795.
+`rootsOnTheRise()` should return `191541795`.
 
 ```js
-assert.strictEqual(euler479(), 191541795);
+assert.strictEqual(rootsOnTheRise(), 191541795);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler479(), 191541795);
 ## --seed-contents--
 
 ```js
-function euler479() {
+function rootsOnTheRise() {
 
   return true;
 }
 
-euler479();
+rootsOnTheRise();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-48-self-powers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-48-self-powers.md
index 58e654f8938..d429c978791 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-48-self-powers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-48-self-powers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f39c1000cf542c50feaf
 title: 'Problem 48: Self powers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302157
 dashedName: problem-48-self-powers
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-480-the-last-question.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-480-the-last-question.md
index 9e2ac8d96d8..c25dc593c28 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-480-the-last-question.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-480-the-last-question.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f54c1000cf542c51005f
 title: 'Problem 480: The Last Question'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302158
 dashedName: problem-480-the-last-question
 ---
@@ -10,88 +10,56 @@ dashedName: problem-480-the-last-question
 
 Consider all the words which can be formed by selecting letters, in any order, from the phrase:
 
-thereisasyetinsufficientdataforameaningfulanswer
+$$\mathbf{\text{thereisasyetinsufficientdataforameaningfulanswer}}$$
 
 Suppose those with 15 letters or less are listed in alphabetical order and numbered sequentially starting at 1.
 
 The list would include:
 
-1 : a
+$$\begin{align}   & 1: \text{a} \\\\
+  & 2: \text{aa} \\\\   & 3: \text{aaa} \\\\
+  & 4: \text{aaaa} \\\\   & 5: \text{aaaaa} \\\\
+  & 6: \text{aaaaaa} \\\\   & 7: \text{aaaaaac} \\\\
+  & 8: \text{aaaaaacd} \\\\   & 9: \text{aaaaaacde} \\\\
+  & 10: \text{aaaaaacdee} \\\\   & 11: \text{aaaaaacdeee} \\\\
+  & 12: \text{aaaaaacdeeee} \\\\   & 13: \text{aaaaaacdeeeee} \\\\
+  & 14: \text{aaaaaacdeeeeee} \\\\   & 15: \text{aaaaaacdeeeeeef} \\\\
+  & 16: \text{aaaaaacdeeeeeeg} \\\\   & 17: \text{aaaaaacdeeeeeeh} \\\\
+  & \ldots \\\\   & 28: \text{aaaaaacdeeeeeey} \\\\
+  & 29: \text{aaaaaacdeeeeef} \\\\   & 30: \text{aaaaaacdeeeeefe} \\\\
+  & \ldots \\\\   & 115246685191495242: \text{euleoywuttttsss} \\\\
+  & 115246685191495243: \text{euler} \\\\   & 115246685191495244: \text{eulera} \\\\
+  & ... \\\\   & 525069350231428029: \text{ywuuttttssssrrr} \\\\
+\end{align}$$
 
-2 : aa
+Define $P(w)$ as the position of the word $w$.
 
-3 : aaa
+Define $W(p)$ as the word in position $p$.
 
-4 : aaaa
+We can see that $P(w)$ and $W(p)$ are inverses: $P(W(p)) = p$ and $W(P(w)) = w$.
 
-5 : aaaaa
+示例：
 
-6 : aaaaaa
+$$\begin{align}   & W(10) = \text{ aaaaaacdee} \\\\
+  & P(\text{aaaaaacdee}) = 10 \\\\   & W(115246685191495243) = \text{ euler} \\\\
+  & P(\text{euler}) = 115246685191495243 \\\\ \end{align}$$
 
-7 : aaaaaac
+Find $$W(P(\text{legionary}) + P(\text{calorimeters}) - P(\text{annihilate}) + P(\text{orchestrated}) - P(\text{fluttering})).$$
 
-8 : aaaaaacd
-
-9 : aaaaaacde
-
-10 : aaaaaacdee
-
-11 : aaaaaacdeee
-
-12 : aaaaaacdeeee
-
-13 : aaaaaacdeeeee
-
-14 : aaaaaacdeeeeee
-
-15 : aaaaaacdeeeeeef
-
-16 : aaaaaacdeeeeeeg
-
-17 : aaaaaacdeeeeeeh
-
-...
-
-28 : aaaaaacdeeeeeey
-
-29 : aaaaaacdeeeeef
-
-30 : aaaaaacdeeeeefe
-
-...
-
-115246685191495242: euleoywuttttsss
-
-115246685191495243: euler
-
-115246685191495244: eulera
-
-...
-
-525069350231428029: ywuuttttssssrrrDefine P(w) as the position of the word w.
-
-Define W(p) as the word in position p.
-
-We can see that P(w) and W(p) are inverses: P(W(p)) = p and W(P(w)) = w.
-
-Examples:
-
-W(10) = aaaaaacdee
-
-P(aaaaaacdee) = 10
-
-W(115246685191495243) = euler
-
-P(euler) = 115246685191495243Find W(P(legionary) + P(calorimeters) - P(annihilate) + P(orchestrated) - P(fluttering)).
-
-Give your answer using lowercase characters (no punctuation or space).
+使用小寫字符（沒有標點符號或空格）給出答案。
 
 # --hints--
 
-`euler480()` should return turnthestarson.
+`euler480()` should return a string.
 
 ```js
-assert.strictEqual(euler480(), turnthestarson);
+assert(typeof euler480() === 'string');
+```
+
+`euler480()` should return the string `turnthestarson`.
+
+```js
+assert.strictEqual(euler480(), 'turnthestarson');
 ```
 
 # --seed--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-49-prime-permutations.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-49-prime-permutations.md
index 0dc7ae0ddcf..3c0c1d3d362 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-49-prime-permutations.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-49-prime-permutations.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f39d1000cf542c50feb0
 title: 'Problem 49: Prime permutations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302159
 dashedName: problem-49-prime-permutations
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-5-smallest-multiple.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-5-smallest-multiple.md
index bdece251d77..35af68bd7c4 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-5-smallest-multiple.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-5-smallest-multiple.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3711000cf542c50fe84
 title: 'Problem 5: Smallest multiple'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302160
 dashedName: problem-5-smallest-multiple
 ---
@@ -10,41 +10,41 @@ dashedName: problem-5-smallest-multiple
 
 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
 
-What is the smallest positive number that is evenly divisible by all of the numbers from 1 to `n`?
+能被從 1 到 `n` 的所有數整除的最小正數是多少？
 
 # --hints--
 
-`smallestMult(5)` should return a number.
+`smallestMult(5)` 應該返回數字
 
 ```js
 assert(typeof smallestMult(5) === 'number');
 ```
 
-`smallestMult(5)` should return 60.
+`smallestMult(5)` 應該返回 60。
 
 ```js
 assert.strictEqual(smallestMult(5), 60);
 ```
 
-`smallestMult(7)` should return 420.
+`smallestMult(7)` 應該返回 420。
 
 ```js
 assert.strictEqual(smallestMult(7), 420);
 ```
 
-`smallestMult(10)` should return 2520.
+`smallestMult(10)` 應返回 2520。
 
 ```js
 assert.strictEqual(smallestMult(10), 2520);
 ```
 
-`smallestMult(13)` should return 360360.
+`smallestMult(13)` 應返回 360360。
 
 ```js
 assert.strictEqual(smallestMult(13), 360360);
 ```
 
-`smallestMult(20)` should return 232792560.
+`smallestMult(20)` 應該返回 232792560。
 
 ```js
 assert.strictEqual(smallestMult(20), 232792560);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.md
index 92924bf85e1..861a3e99a8e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f39e1000cf542c50feb1
 title: 'Problem 50: Consecutive prime sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302161
 dashedName: problem-50-consecutive-prime-sum
 ---
@@ -54,42 +54,70 @@ consecutivePrimeSum(1000000);
 # --solutions--
 
 ```js
-function consecutivePrimeSum(limit) {
-  function isPrime(num) {
-    if (num < 2) {
-      return false;
-    } else if (num === 2) {
-      return true;
-    }
-    const sqrtOfNum = Math.floor(num ** 0.5);
-    for (let i = 2; i <= sqrtOfNum + 1; i++) {
-      if (num % i === 0) {
-        return false;
-      }
+// Initalize prime number list with sieve
+const NUM_PRIMES = 1000000;
+const PRIMES = [2];
+const PRIME_SIEVE = Array(Math.floor((NUM_PRIMES-1)/2)).fill(true);
+(function initPrimes(num) {
+  const upper = Math.floor((num - 1) / 2);
+  const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+  for (let i = 0; i <= sqrtUpper; i++) {
+    if (PRIME_SIEVE[i]) {
+      // Mark value in PRIMES array
+      const prime = 2 * i + 3;
+      PRIMES.push(prime);
+      // Mark all multiples of this number as false (not prime)
+      const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+      for (let j = primeSqaredIndex; j < upper; j += prime)
+        PRIME_SIEVE[j] = false;
     }
+  }
+  for (let i = sqrtUpper + 1; i < upper; i++) {
+    if (PRIME_SIEVE[i])
+      PRIMES.push(2 * i + 3);
+  }
+})(NUM_PRIMES);
+
+function isPrime(num) {
+  if (num === 2)
     return true;
-  }
-  function getPrimes(limit) {
-    const primes = [];
-    for (let i = 0; i <= limit; i++) {
-      if (isPrime(i)) primes.push(i);
-    }
-    return primes;
-  }
+  else if (num % 2 === 0)
+    return false
+  else
+    return PRIME_SIEVE[(num - 3) / 2];
+}
 
-  const primes = getPrimes(limit);
-  let primeSum = [...primes];
-  primeSum.reduce((acc, n, i) => {
-    primeSum[i] += acc;
-    return acc += n;
-  }, 0);
+function consecutivePrimeSum(limit) {
+  // Initalize for longest sum < 100
+  let bestPrime = 41;
+  let bestI = 0;
+  let bestJ = 5;
 
-  for (let j = primeSum.length - 1; j >= 0; j--) {
-    for (let i = 0; i < j; i++) {
-      const sum = primeSum[j] - primeSum[i];
-      if (sum > limit) break;
-      if (isPrime(sum) && primes.indexOf(sum) > -1) return sum;
+  // Find longest sum < limit
+  let sumOfCurrRange = 41;
+  let i = 0, j = 5;
+  // -- Loop while current some starting at i is < limit
+  while (sumOfCurrRange < limit) {
+    let currSum = sumOfCurrRange;
+    // -- Loop while pushing j towards end of PRIMES list
+    //      keeping sum under limit
+    while (currSum < limit) {
+      if (isPrime(currSum)) {
+        bestPrime = sumOfCurrRange = currSum;
+        bestI = i;
+        bestJ = j;
+      }
+      // -- Increment inner loop
+      j++;
+      currSum += PRIMES[j];
     }
+    // -- Increment outer loop
+    i++;
+    j = i + (bestJ - bestI);
+    sumOfCurrRange -= PRIMES[i - 1];
+    sumOfCurrRange += PRIMES[j];
   }
+  // Return
+  return bestPrime;
 }
 ```
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 d890d42133e..26aed0ce89a 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f39f1000cf542c50feb2
 title: 'Problem 51: Prime digit replacements'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302162
 dashedName: problem-51-prime-digit-replacements
 ---
@@ -56,68 +56,71 @@ primeDigitReplacements(6);
 # --solutions--
 
 ```js
+const NUM_PRIMES = 1000000;
+const PRIME_SEIVE = Array(Math.floor((NUM_PRIMES-1)/2)).fill(true);
+(function initPrimes(num) {
+  const upper = Math.floor((num - 1) / 2);
+  const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+  for (let i = 0; i <= sqrtUpper; i++) {
+    if (PRIME_SEIVE[i]) {
+      // Mark value in PRIMES array
+      const prime = 2 * i + 3;
+      // Mark all multiples of this number as false (not prime)
+      const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+      for (let j = primeSqaredIndex; j < upper; j += prime) {
+        PRIME_SEIVE[j] = false;
+      }
+    }
+  }
+})(NUM_PRIMES);
+
+function isPrime(num) {
+  if (num === 2) return true;
+  else if (num % 2 === 0) return false
+  else return PRIME_SEIVE[(num - 3) / 2];
+}
+
 function primeDigitReplacements(n) {
-  function isNFamily(number, primesMap, n) {
+  function isNFamily(number, n) {
     const prime = number.toString();
     const lastDigit = prime[prime.length - 1];
+    return doesReplacingMakeFamily(prime, '0', n) ||
+      doesReplacingMakeFamily(prime, '2', n) ||
+      (lastDigit !== '1' && doesReplacingMakeFamily(prime, '1', n));
+  }
+
+  function doesReplacingMakeFamily(prime, digitToReplace, family) {
+    let miss = 0;
+    const base = parseInt(
+      prime
+        .split('')
+        .map(digit => digit == digitToReplace ? '0' : digit)
+        .join('')
+    );
+    const replacements = parseInt(
+      prime
+        .split('')
+        .map(digit => digit === digitToReplace ? '1' : '0')
+        .join('')
+    );
+    const start = prime[0] === digitToReplace ? 1 : 0;
+    for (let i = start; i < 10; i++) {
+      const nextNumber = base + i * replacements;
+      if (!isPartOfFamily(nextNumber, prime)) miss++;
+      if (10 - start - miss < family) break;
+    }
+    return 10 - start - miss === family;
+  }
+
+  function isPartOfFamily(number, prime) {
     return (
-      doesReplacingMakeFamily(prime, '0', primesMap, n) ||
-      (lastDigit !== '1' &&
-        doesReplacingMakeFamily(prime, '1', primesMap, n)) ||
-      doesReplacingMakeFamily(prime, '2', primesMap, n)
+      isPrime(number) && number.toString().length === prime.length
     );
   }
 
-  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;
-      }
+  for (let number = 1; number < 125000; number++) {
+    if (isPrime(number) && isNFamily(number, 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 d5431d8135b..7a3886a6e27 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a01000cf542c50feb3
 title: 'Problem 52: Permuted multiples'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302163
 dashedName: problem-52-permuted-multiples
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-53-combinatoric-selections.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-53-combinatoric-selections.md
index dbd39ef9755..8d96ff14392 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-53-combinatoric-selections.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-53-combinatoric-selections.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a11000cf542c50feb4
 title: 'Problem 53: Combinatoric selections'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302164
 dashedName: problem-53-combinatoric-selections
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-54-poker-hands.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-54-poker-hands.md
index fd260cddf92..b08e9a13bda 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-54-poker-hands.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-54-poker-hands.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a21000cf542c50feb5
 title: 'Problem 54: Poker hands'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302165
 dashedName: problem-54-poker-hands
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-55-lychrel-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-55-lychrel-numbers.md
index 8b074ba2594..890c5b0997d 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-55-lychrel-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-55-lychrel-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a31000cf542c50feb6
 title: 'Problem 55: Lychrel numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302166
 dashedName: problem-55-lychrel-numbers
 ---
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 407314741ab..e445973f332 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a41000cf542c50feb7
 title: 'Problem 56: Powerful digit sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302167
 dashedName: problem-56-powerful-digit-sum
 ---
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 17103bc6fe5..034974d882c 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a51000cf542c50feb8
 title: 'Problem 57: Square root convergents'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302168
 dashedName: problem-57-square-root-convergents
 ---
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 29a3012e447..70b80ebf2a1 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a61000cf542c50feb9
 title: 'Problem 58: Spiral primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302169
 dashedName: problem-58-spiral-primes
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-59-xor-decryption.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-59-xor-decryption.md
index 683db15249a..0784e292908 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-59-xor-decryption.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-59-xor-decryption.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a81000cf542c50feba
 title: 'Problem 59: XOR decryption'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302170
 dashedName: problem-59-xor-decryption
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-6-sum-square-difference.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-6-sum-square-difference.md
index ec60601f106..65a460bd803 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-6-sum-square-difference.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-6-sum-square-difference.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3721000cf542c50fe85
 title: 'Problem 6: Sum square difference'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302171
 dashedName: problem-6-sum-square-difference
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-60-prime-pair-sets.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-60-prime-pair-sets.md
index 5acc6c21769..1a79123e273 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-60-prime-pair-sets.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-60-prime-pair-sets.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f3a81000cf542c50febb
 title: 'Problem 60: Prime pair sets'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302172
 dashedName: problem-60-prime-pair-sets
 ---
 
 # --description--
 
-The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 and 109, both 7109 and 1097 are prime. The sum of these four primes, 792, represents the lowest sum for a set of four primes with this property.
+質數 3、7、109 和 673 非常引人注目。 通過取任何兩個素數並以任何順序連接它們，結果將始終是素數。 例如，取 7 和 109，7109 和 1097 都是質數。 這四個素數的總和，792，代表具有此屬性的一組四個素數的最低和。
 
 Find the lowest sum for a set of five primes for which any two primes concatenate to produce another prime.
 
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 8989f4171cf..04584622af0 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a91000cf542c50febc
 title: 'Problem 61: Cyclical figurate numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302173
 dashedName: problem-61-cyclical-figurate-numbers
 ---
@@ -12,10 +12,10 @@ Triangle, square, pentagonal, hexagonal, heptagonal, and octagonal numbers are a
 
 | Type of Number | Formula                       | Sequence              |
 | -------------- | ----------------------------- | --------------------- |
-| Triangle       | $P_3(n) = \frac{n(n+1)}{2}$  | 1, 3, 6, 10, 15, ...  |
+| 三角形            | $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, ... |
+| 五角形            | $P_5(n) = \frac{n(3n−1)}2$   | 1, 5, 12, 22, 35, ... |
+| 六角形            | $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, ... |
 
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 82294e0708a..a89d136f83c 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3aa1000cf542c50febd
 title: 'Problem 62: Cubic permutations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302174
 dashedName: problem-62-cubic-permutations
 ---
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 02c96036851..2c8b0bb8cd6 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ab1000cf542c50febe
 title: 'Problem 63: Powerful digit counts'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302175
 dashedName: problem-63-powerful-digit-counts
 ---
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 6cc017e1fb4..a6acdfc610e 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ac1000cf542c50febf
 title: 'Problem 64: Odd period square roots'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302176
 dashedName: problem-64-odd-period-square-roots
 ---
@@ -12,7 +12,7 @@ All square roots are periodic when written as continued fractions and can be wri
 
 $\\displaystyle \\quad \\quad \\sqrt{N}=a_0+\\frac 1 {a_1+\\frac 1 {a_2+ \\frac 1 {a3+ \\dots}}}$
 
-For example, let us consider $\\sqrt{23}:$:
+For example, let us consider $\\sqrt{23}$:
 
 $\\quad \\quad \\sqrt{23}=4+\\sqrt{23}-4=4+\\frac 1 {\\frac 1 {\\sqrt{23}-4}}=4+\\frac 1 {1+\\frac{\\sqrt{23}-3}7}$
 
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 7a1383a7f0c..9aa62302442 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ad1000cf542c50fec0
 title: 'Problem 65: Convergents of e'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302177
 dashedName: problem-65-convergents-of-e
 ---
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 0eab98070b1..9e01ce1b0c5 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ae1000cf542c50fec1
 title: 'Problem 66: Diophantine equation'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302178
 dashedName: problem-66-diophantine-equation
 ---
@@ -40,25 +40,25 @@ assert(typeof diophantineEquation(7) === 'number');
 
 `diophantineEquation(7)` should return `5`.
 
-```
+```js
 assert.strictEqual(diophantineEquation(7), 5);
 ```
 
 `diophantineEquation(100)` should return `61`.
 
-```
+```js
 assert.strictEqual(diophantineEquation(100), 61);
 ```
 
 `diophantineEquation(409)` should return `409`.
 
-```
+```js
 assert.strictEqual(diophantineEquation(409), 409);
 ```
 
 `diophantineEquation(500)` should return `421`.
 
-```
+```js
 assert.strictEqual(diophantineEquation(500), 421);
 ```
 
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 9e1e818c9ce..c3aa2fb6e3b 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b01000cf542c50fec2
 title: 'Problem 67: Maximum path sum II'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302179
 dashedName: problem-67-maximum-path-sum-ii
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md
index 1ae580513f2..7be38bfabe1 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b01000cf542c50fec3
 title: 'Problem 68: Magic 5-gon ring'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302180
 dashedName: problem-68-magic-5-gon-ring
 ---
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 2e538e324dc..e57b133fbe7 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b11000cf542c50fec4
 title: 'Problem 69: Totient maximum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302181
 dashedName: problem-69-totient-maximum
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-7-10001st-prime.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-7-10001st-prime.md
index 18b18b2bf1a..6780c8fa2d1 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-7-10001st-prime.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-7-10001st-prime.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3731000cf542c50fe86
 title: 'Problem 7: 10001st prime'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302182
 dashedName: problem-7-10001st-prime
 ---
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 09c3e106281..1328f1ca1e7 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b21000cf542c50fec5
 title: 'Problem 70: Totient permutation'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302183
 dashedName: problem-70-totient-permutation
 ---
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 55a2e9b72f6..267a17669b0 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b31000cf542c50fec6
 title: 'Problem 71: Ordered fractions'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302184
 dashedName: problem-71-ordered-fractions
 ---
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 3929bde7af7..dab392ae0ae 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b41000cf542c50fec7
 title: 'Problem 72: Counting fractions'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302185
 dashedName: problem-72-counting-fractions
 ---
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 10c1ae6ea87..b53ef258385 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b61000cf542c50fec8
 title: 'Problem 73: Counting fractions in a range'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302186
 dashedName: problem-73-counting-fractions-in-a-range
 ---
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 eb9a6e9d13f..45a759f08ef 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b61000cf542c50fec9
 title: 'Problem 74: Digit factorial chains'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302187
 dashedName: problem-74-digit-factorial-chains
 ---
@@ -10,15 +10,19 @@ 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:
 
-$$1! + 4! + 5! = 1 + 24 + 120 = 145$$
+$$1! + 4！ + 5！ = 1 + 24 + 120 = 145$$
 
 Perhaps less well known is 169, in that it produces the longest chain of numbers that link back to 169; it turns out that there are only three such loops that exist:
 
-$$\begin{align} &169 → 363601 → 1454 → 169\\\\ &871 → 45361 → 871\\\\ &872 → 45362 → 872\\\\ \end{align}$$
+$$\begin{align} &169 → 363601 → 1454 → 169\\\\
+&871 → 45361 → 871\\\\ &872 → 45362 → 872\\\\
+\end{align}$$
 
 It is not difficult to prove that EVERY starting number will eventually get stuck in a loop. For example,
 
-$$\begin{align} &69 → 363600 → 1454 → 169 → 363601\\ (→ 1454)\\\\ &78 → 45360 → 871 → 45361\\ (→ 871)\\\\ &540 → 145\\ (→ 145)\\\\ \end{align}$$
+$$\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.
 
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 a20c0a95eac..40ab4fb3e00 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b71000cf542c50feca
 title: 'Problem 75: Singular integer right triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302188
 dashedName: problem-75-singular-integer-right-triangles
 ---
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 bbc9618245c..49d2e681c6b 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
@@ -1,14 +1,14 @@
 ---
 id: 5900f3b81000cf542c50fecb
-title: 'Problem 76: Counting summations'
-challengeType: 5
+title: '問題 76：計算加和'
+challengeType: 1
 forumTopicId: 302189
 dashedName: problem-76-counting-summations
 ---
 
 # --description--
 
-It is possible to write five as a sum in exactly six different ways:
+整數 5 是有可能通過六種不同的加和的方式得到：
 
 <div style='margin-left: 4em;'>
   4 + 1<br>
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 bd26cc3c699..a5639dc73a4 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b91000cf542c50fecc
 title: 'Problem 77: Prime summations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302190
 dashedName: problem-77-prime-summations
 ---
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 61f145116f3..65d3ebad7e4 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ba1000cf542c50fecd
 title: 'Problem 78: Coin partitions'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302191
 dashedName: problem-78-coin-partitions
 ---
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 e9858fa5399..a17babe3520 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3bb1000cf542c50fece
 title: 'Problem 79: Passcode derivation'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302192
 dashedName: problem-79-passcode-derivation
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-8-largest-product-in-a-series.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-8-largest-product-in-a-series.md
index 0fd4703af75..c84d410e207 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-8-largest-product-in-a-series.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-8-largest-product-in-a-series.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3741000cf542c50fe87
 title: 'Problem 8: Largest product in a series'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302193
 dashedName: problem-8-largest-product-in-a-series
 ---
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 a5523347055..34d7dd6eea4 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3bc1000cf542c50fecf
 title: 'Problem 80: Square root digital expansion'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302194
 dashedName: problem-80-square-root-digital-expansion
 ---
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 542d6ce39af..5fe3982048f 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3bd1000cf542c50fed0
 title: 'Problem 81: Path sum: two ways'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302195
 dashedName: problem-81-path-sum-two-ways
 ---
@@ -10,7 +10,9 @@ dashedName: problem-81-path-sum-two-ways
 
 In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by **only moving to the right and down**, is indicated in bold red and is equal to `2427`.
 
-  $$\begin{pmatrix} \color{red}{131} & 673 & 234 & 103 & 18\\\\ \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\\\ 630 & 803 & \color{red}{746} & \color{red}{422} & 111\\\\ 537 & 699 & 497 & \color{red}{121} & 956\\\\ 805 & 732 & 524 & \color{red}{37} & \color{red}{331} \end{pmatrix}$$
+  $$\begin{pmatrix}   \color{red}{131} & 673 & 234 & 103 & 18\\\\
+  \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\\\   630 & 803 & \color{red}{746} & \color{red}{422} & 111\\\\
+  537 & 699 & 497 & \color{red}{121} & 956\\\\ 805 & 732 & 524 & \color{red}{37} & \color{red}{331} \end{pmatrix}$$
 
 Find the minimal path sum from the top left to the bottom right by only moving right and down in `matrix`, a 2D array representing a matrix. The maximum matrix size used in the tests will be 80 by 80.
 
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 ec68b544e25..0895540d468 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3be1000cf542c50fed1
 title: 'Problem 82: Path sum: three ways'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302196
 dashedName: problem-82-path-sum-three-ways
 ---
@@ -12,7 +12,9 @@ dashedName: problem-82-path-sum-three-ways
 
 The minimal path sum in the 5 by 5 matrix below, by starting in any cell in the left column and finishing in any cell in the right column, and only moving up, down, and right, is indicated in red and bold; the sum is equal to `994`.
 
-  $$\begin{pmatrix} 131 & 673 & \color{red}{234} & \color{red}{103} & \color{red}{18}\\\\ \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\\\ 630 & 803 & 746 & 422 & 111\\\\ 537 & 699 & 497 & 121 & 956\\\\ 805 & 732 & 524 & 37 & 331 \end{pmatrix}$$
+  $$\begin{pmatrix}   131 & 673 & \color{red}{234} & \color{red}{103} & \color{red}{18}\\\\
+  \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\\\   630 & 803 & 746 & 422 & 111\\\\
+  537 & 699 & 497 & 121 & 956\\\\ 805 & 732 & 524 & 37 & 331 \end{pmatrix}$$
 
 Find the minimal path sum from the left column to the right column in `matrix`, a 2D array representing a matrix. The maximum matrix size used in tests will be 80 by 80.
 
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 ce957c019f4..2a28b0fec5a 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3bf1000cf542c50fed2
-title: 'Problem 83: Path sum: four ways'
-challengeType: 5
+title: '問題 83：路徑和：四種方式'
+challengeType: 1
 forumTopicId: 302197
 dashedName: problem-83-path-sum-four-ways
 ---
@@ -12,7 +12,9 @@ dashedName: problem-83-path-sum-four-ways
 
 In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by moving left, right, up, and down, is indicated in bold red and is equal to `2297`.
 
-  $$\begin{pmatrix} \color{red}{131} & 673 & \color{red}{234} & \color{red}{103} & \color{red}{18}\\\\ \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & \color{red}{150}\\\\ 630 & 803 & 746 & \color{red}{422} & \color{red}{111}\\\\ 537 & 699 & 497 & \color{red}{121} & 956\\\\ 805 & 732 & 524 & \color{red}{37} & \color{red}{331} \end{pmatrix}$$
+  $$\begin{pmatrix}   \color{red}{131} & 673 & \color{red}{234} & \color{red}{103} & \color{red}{18}\\\\
+  \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & \color{red}{150}\\\\   630 & 803 & 746 & \color{red}{422} & \color{red}{111}\\\\
+  537 & 699 & 497 & \color{red}{121} & 956\\\\ 805 & 732 & 524 & \color{red}{37} & \color{red}{331} \end{pmatrix}$$
 
 Find the minimal path sum from the top left to the bottom right by moving left, right, up, and down in `matrix`, a 2D array representing a matrix. The maximum matrix size used in tests will be 80 by 80.
 
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 6870d2e4207..3b819ecf121 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c11000cf542c50fed3
-title: 'Problem 84: Monopoly odds'
-challengeType: 5
+title: '問題 84：壟斷賠率'
+challengeType: 1
 forumTopicId: 302198
 dashedName: problem-84-monopoly-odds
 ---
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 c6d4c9c2c6b..eafbccb8aee 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c11000cf542c50fed4
 title: 'Problem 85: Counting rectangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302199
 dashedName: problem-85-counting-rectangles
 ---
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 bcd935b24d4..39a860bd794 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c31000cf542c50fed5
 title: 'Problem 86: Cuboid route'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302200
 dashedName: problem-86-cuboid-route
 ---
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 57da5afe793..a6c51eff68d 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c51000cf542c50fed8
 title: 'Problem 87: Prime power triples'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302201
 dashedName: problem-87-prime-power-triples
 ---
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 3134d9cacf3..46779896396 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c51000cf542c50fed6
 title: 'Problem 88: Product-sum numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302203
 dashedName: problem-88-product-sum-numbers
 ---
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 3c0e7ac2aa5..52c03847a6b 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c51000cf542c50fed7
 title: 'Problem 89: Roman numerals'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302204
 dashedName: problem-89-roman-numerals
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md
index 3ce9715e401..a853dd4415e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3761000cf542c50fe88
 title: 'Problem 9: Special Pythagorean triplet'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302205
 dashedName: problem-9-special-pythagorean-triplet
 ---
@@ -30,7 +30,7 @@ assert(typeof specialPythagoreanTriplet(24) === 'number');
 assert.strictEqual(specialPythagoreanTriplet(24), 480);
 ```
 
-`specialPythagoreanTriplet(120)` should return 49920, 55080 or 60000
+`specialPythagoreanTriplet(120)` should return 49920, 55080 or 60000.
 
 ```js
 assert([49920, 55080, 60000].includes(specialPythagoreanTriplet(120)));
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md
index ef2182b215d..3e1206b4c4f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c61000cf542c50fed9
 title: 'Problem 90: Cube digit pairs'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302207
 dashedName: problem-90-cube-digit-pairs
 ---
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 b920e69678d..7874cbab3fc 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c71000cf542c50feda
 title: 'Problem 91: Right triangles with integer coordinates'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302208
 dashedName: problem-91-right-triangles-with-integer-coordinates
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.md
index 81b5dce63a3..1cb6b36a2b6 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.md
@@ -1,16 +1,16 @@
 ---
 id: 5900f3ca1000cf542c50fedc
 title: 'Problem 93: Arithmetic expressions'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302210
 dashedName: problem-93-arithmetic-expressions
 ---
 
 # --description--
 
-By using each of the digits from the set, {1, 2, 3, 4}, exactly once, and making use of the four arithmetic operations (+, −, \*, /) and brackets/parentheses, it is possible to form different positive integer targets.
+使用集合 {1, 2, 3, 4} 中每個數字恰好一次、加減乘除（+, −, ∗, /）四則運算以及括號，可以得到不同的正整數。
 
-For example,
+例如：
 
 <div style='margin-left: 4em;'>
   8 = (4 * (1 + 3)) / 2<br>
@@ -19,7 +19,7 @@ For example,
   36 = 3 * 4 * (2 + 1)
 </div>
 
-Note that concatenations of the digits, like 12 + 34, are not allowed.
+需要注意的是，把數字直接連接起來是不被允許的，例如：12 + 34。
 
 Using the set, {1, 2, 3, 4}, it is possible to obtain thirty-one different target numbers of which 36 is the maximum, and each of the numbers 1 to 28 can be obtained before encountering the first non-expressible number.
 
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 ef0c095e035..35ab09927e0 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
@@ -1,46 +1,46 @@
 ---
 id: 5900f3ca1000cf542c50fedd
 title: 'Problem 94: Almost equilateral triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302211
 dashedName: problem-94-almost-equilateral-triangles
 ---
 
 # --description--
 
-It is easily proved that no equilateral triangle exists with integral length sides and integral area. However, the almost equilateral triangle 5-5-6 has an area of 12 square units.
+很容易證明，不存在同時具有整數邊長和整數面積的等邊三角形。 但是，存在邊長爲 5-5-6 的幾乎等邊三角形，其面積恰爲整數 12。
 
-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.
+我們定義<dfn>幾乎等邊三角形</dfn>是有兩邊一樣長，且第三邊與兩邊最多相差1的三角形。
 
-Find the sum of the perimeters of all almost equilateral triangles with integral side lengths and area and whose perimeters do not exceed `limit`.
+從周長不超過 `limit` 的三角形中，求出所有邊長和麪積均爲整數的幾乎等邊三角形的周長之和。
 
 # --hints--
 
-`almostEquilateralTriangles(50)` should return a number.
+`almostEquilateralTriangles(50)` 應該返回一個數字。
 
 ```js
 assert(typeof almostEquilateralTriangles(50) === 'number');
 ```
 
-`almostEquilateralTriangles(50)` should return `66`.
+`almostEquilateralTriangles(50)` 應該返回 `66`。
 
 ```js
 assert.strictEqual(almostEquilateralTriangles(50), 66);
 ```
 
-`almostEquilateralTriangles(10000)` should return `3688`.
+`almostEquilateralTriangles(10000)` 應該返回 `3688`。
 
 ```js
 assert.strictEqual(almostEquilateralTriangles(10000), 3688);
 ```
 
-`almostEquilateralTriangles(10000000)` should return `9973078`.
+`almostEquilateralTriangles(10000000)` 應該返回 `9973078`。
 
 ```js
 assert.strictEqual(almostEquilateralTriangles(10000000), 9973078);
 ```
 
-`almostEquilateralTriangles(1000000000)` should return `518408346`.
+`almostEquilateralTriangles(1000000000)` 應該返回 `518408346`。
 
 ```js
 assert.strictEqual(almostEquilateralTriangles(1000000000), 518408346);
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 15dafc79a9f..cabdb3486c9 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ce1000cf542c50fee0
 title: 'Problem 97: Large non-Mersenne prime'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302214
 dashedName: problem-97-large-non-mersenne-prime
 ---
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 e63309053f3..f54ab71dd62 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3cf1000cf542c50fee1
 title: 'Problem 98: Anagramic squares'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302215
 dashedName: problem-98-anagramic-squares
 ---
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 07d9a48f01d..af44a7d0bd7 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
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d01000cf542c50fee2
 title: 'Problem 99: Largest exponential'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302216
 dashedName: problem-99-largest-exponential
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/24-game.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/24-game.md
index 775034b49c0..a6da5861b7e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/24-game.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/24-game.md
@@ -1,14 +1,14 @@
 ---
 id: 5951e88f64ebf159166a1176
 title: 24 點遊戲
-challengeType: 5
+challengeType: 1
 forumTopicId: 302218
 dashedName: 24-game
 ---
 
 # --description--
 
-[24 點遊戲](https://en.wikipedia.org/wiki/24_Game)測試一個人的心算能力。
+The 24 Game tests a person's mental arithmetic.
 
 遊戲的目標是使四個數字的計算結果是 24。
 
@@ -39,28 +39,28 @@ dashedName: 24-game
 assert(typeof solve24 === 'function');
 ```
 
-`solve24("4878")` 應該返回 `(7-8/8)*4` 或 `4*(7-8/8)`。
+`solve24("4878")` should return `(7-8/8)*4`, `4*(7-8/8)`, or a similar valid string
 
 ```js
-assert(include(answers[0], removeParentheses(solve24(testCases[0]))));
+assert(isValidSolution_(solve24(testCases_[0])));
 ```
 
-`solve24("1234")` 應該返回 `1*2*3*4`。
+`solve24("1234")` should return `1*2*3*4` or a similar valid string
 
 ```js
-assert(include(answers[1], removeParentheses(solve24(testCases[1]))));
+assert(isValidSolution_(solve24(testCases_[1])));
 ```
 
-`solve24("6789")` 應該返回 `(6*8)/(9-7)` 或 `(8*6)/(9-7)`。
+`solve24("6789")` should return `(6*8)/(9-7)`, `(8*6)/(9-7)`, or a similar valid string
 
 ```js
-assert(include(answers[2], removeParentheses(solve24(testCases[2]))));
+assert(isValidSolution_(solve24(testCases_[2])));
 ```
 
-`solve24("1127")` 應該返回 `(1+7)*(1+2)`。
+`solve24("1127")` should return `(1+7)*(1+2)` or a similar valid string
 
 ```js
-assert(include(answers[3], removeParentheses(solve24(testCases[3]))));
+assert(isValidSolution_(solve24(testCases_[3])));
 ```
 
 # --seed--
@@ -68,56 +68,101 @@ assert(include(answers[3], removeParentheses(solve24(testCases[3]))));
 ## --after-user-code--
 
 ```js
-const testCases = [
+const testCases_ = [
   '4878',
   '1234',
   '6789',
   '1127'
 ];
 
-const answers = [
-  ['(7-8/8)*4', '4*(7-8/8)', '(4-8+7)*8', '(4+7-8)*8', '(7+4-8)*8', '(7-8+4)*8', '8*(4-8+7)', '8*(4+7-8)', '8*(7+4-8)', '8*(7-8+4)'],
-  ['1*2*3*4', '1*2*4*3', '1*3*2*4', '1*3*4*2', '1*4*2*3', '1*4*3*2', '2*1*3*4', '2*1*4*3', '2*3*1*4', '2*3*4*1', '2*4*3*1', '2*4*1*3', '3*1*2*4', '3*1*4*2', '3*2*1*4', '3*2*4*1', '3*4*1*2', '3*4*2*1', '4*1*2*3', '4*1*3*2', '4*2*1*3', '4*2*3*1', '4*3*1*2', '4*3*2*1', '(1+2+3)*4', '(1+3+2)*4', '(2+1+3)*4', '(2+3+1)*4', '(3+1+2)*4', '(3+2+1)*4', '4*(1+2+3)', '4*(2+1+3)', '4*(2+3+1)', '4*(3+1+2)', '4*(3+2+1)'],
-  ['(6*8)/(9-7)', '(8*6)/(9-7)', '6*8/(9-7)', '8*6/(9-7)'],
-  ['(1+7)*(2+1)', '(1+7)*(1+2)', '(1+2)*(1+7)', '(1+2)*(7+1)', '(2+1)*(1+7)', '(7+1)*(2+1)']
-];
-
-function include(ansArr, res) {
-  const index = ansArr.indexOf(res);
-  return index >= 0;
+const OPERATORS_ = {
+  "+": (a, b) => a + b,
+  "-": (a, b) => a - b,
+  "*": (a, b) => a * b,
+  "/": (a, b) => a / b,
 }
 
-//The main method for detecting single parentheses
-function removeParentheses(ans) {
-  for (let i = 0; i < ans.length; i++) {
-    if (!isNaN(ans[i])) {
-      ans = removeParenthesesHelper(ans, i);
+const PRECIDENCE_ = {
+  "+": 1,
+  "-": 1,
+  "*": 2,
+  "/": 2,
+}
+
+function evaluate_(expression) {
+  expression = expression.replace('/\s+/g', '');
+  const stack = [];
+  let postfix = "";
+
+  // Convert from infix to postfix
+  let head = 0;
+  while (head < expression.length) {
+    let c = expression[head];
+    switch (c) {
+      case "(":
+        stack.push(c);
+        break;
+      case ")":
+        let last = stack.pop();
+        while (last !== "(") {
+          postfix += last;
+          last = stack.pop();
+        }
+        break;
+      case "+":
+      case "-":
+      case "*":
+      case "/":
+        while (stack.length &&
+               PRECIDENCE_[c] <= PRECIDENCE_[stack[stack.length-1]]) {
+          postfix += stack.pop();
+        }
+        stack.push(c);
+        break;
+      case "0":
+      case "1":
+      case "2":
+      case "3":
+      case "4":
+      case "5":
+      case "6":
+      case "7":
+      case "8":
+      case "9":
+        postfix += c;
+        break;
+      default:
+        return false;
+    }
+    head++;
+  }
+
+  // Clear out stack
+  while (stack.length) {
+    postfix += stack.pop();
+  }
+
+  // Evaluate postfix
+  for (let c of postfix) {
+    switch (c) {
+      case "+":
+      case "-":
+      case "*":
+      case "/":
+        const b = +stack.pop();
+        const a = +stack.pop();
+        stack.push(OPERATORS_[c](a, b));
+        break;
+      default:
+        stack.push(c);
     }
   }
-  return ans;
+  return stack.pop();
 }
 
-//Helper to remove left and right parantheses
-function removeParenthesesHelper(ans, i) {
-  while (i > 0 && i < ans.length - 1) {
-    if (ans[i - 1] === '(' && ans[i + 1] === ')') {
-      //Paranthesis detected. Remove them.
-      ans = replaceChar(ans, '', i - 1);
-      ans = replaceChar(ans, '', i);
-      i--;
-    } else {
-      return ans;
-    }
-  }
-  return ans;
-}
-
-//Replace a character at a given index for the provided character
-function replaceChar(origString, replaceChar, index) {
-  let firstPart = origString.substr(0, index);
-  let lastPart = origString.substr(index + 1);
-  let newString = firstPart + replaceChar + lastPart;
-  return newString;
+// Check solution validity
+function isValidSolution_(userSolution) {
+  return evaluate_(userSolution) === 24;
 }
 ```
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md
index 125236ca75f..bb7fbb243f0 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md
@@ -1,14 +1,14 @@
 ---
 id: 5949b579404977fbaefcd736
 title: 9 billion names of God the integer
-challengeType: 5
+challengeType: 1
 forumTopicId: 302219
 dashedName: 9-billion-names-of-god-the-integer
 ---
 
 # --description--
 
-This task is a variation of the [short story by Arthur C. Clarke](https://en.wikipedia.org/wiki/The Nine Billion Names of God#Plot_summary "wp: The Nine Billion Names of God#Plot_summary").
+This task is a variation of the short story by Arthur C. Clarke.
 
 (Solvers should be aware of the consequences of completing this task.)
 
@@ -78,7 +78,7 @@ assert.equal(numberOfNames(23), 1255);
 assert.equal(numberOfNames(42), 53174);
 ```
 
-`numberOfNames(123)` should equal 2552338241.
+`numberOfNames(123)` 應等於 2552338241。
 
 ```js
 assert.equal(numberOfNames(123), 2552338241);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/abc-problem.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/abc-problem.md
index b42b619749d..36a7b23eeb7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/abc-problem.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/abc-problem.md
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339acc
 title: ABC Problem
-challengeType: 5
+challengeType: 1
 forumTopicId: 302220
 dashedName: abc-problem
 ---
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 33cbddb68ab..5626858b7d3 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
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339acd
 title: 'Abundant, deficient and perfect number classifications'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302221
 dashedName: abundant-deficient-and-perfect-number-classifications
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/accumulator-factory.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/accumulator-factory.md
index fd90df9f347..e3ee77daf90 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/accumulator-factory.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/accumulator-factory.md
@@ -1,14 +1,14 @@
 ---
 id: 594810f028c0303b75339ace
 title: Accumulator factory
-challengeType: 5
+challengeType: 1
 forumTopicId: 302222
 dashedName: accumulator-factory
 ---
 
 # --description--
 
-A problem posed by [Paul Graham](https://en.wikipedia.org/wiki/Paul_Graham_(programmer)) is that of creating a function that takes a single (numeric) argument and which returns another function that is an accumulator. The returned accumulator function in turn also takes a single numeric argument, and returns the sum of all the numeric values passed in so far to that accumulator (including the initial value passed when the accumulator was created).
+A problem posed by Paul Graham is that of creating a function that takes a single (numeric) argument and which returns another function that is an accumulator. The returned accumulator function in turn also takes a single numeric argument, and returns the sum of all the numeric values passed in so far to that accumulator (including the initial value passed when the accumulator was created).
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/ackermann-function.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/ackermann-function.md
index f80262dc40d..f6443aee8c4 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/ackermann-function.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/ackermann-function.md
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339acf
 title: Ackermann function
-challengeType: 5
+challengeType: 1
 forumTopicId: 302223
 dashedName: ackermann-function
 ---
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 2b58a1e1d86..31ff2d99f96 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
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339ad0
-title: Align columns
-challengeType: 5
+title: 對齊列
+challengeType: 1
 forumTopicId: 302224
 dashedName: align-columns
 ---
@@ -12,7 +12,7 @@ Given an array of many lines, where fields within a line are delineated by a sin
 
 # --instructions--
 
-Use the following text to test your programs:
+使用以下文本測試您的程序：
 
 ```js
 const testText = [
@@ -29,14 +29,14 @@ const testText = [
 ];
 ```
 
-**Note that:**
+**注意：**
 
 - 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.
+- 輸出文本將在純文本編輯器或基本終端上以等寬字體查看。 Lines in it should be joined using new line character (`\n`).
+- 列之間的最小間距應根據文本計算，而不是硬編碼。
+- 不需要在列之間或列周圍添加分隔字符。
 
 For example, one of the lines from the `testText`, after jusitifing to the right, left and center respectivelly:
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/amicable-pairs.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/amicable-pairs.md
index 207ab439f3f..da53936e08e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/amicable-pairs.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/amicable-pairs.md
@@ -1,24 +1,26 @@
 ---
 id: 5949b579404977fbaefcd737
 title: Amicable pairs
-challengeType: 5
+challengeType: 1
 forumTopicId: 302225
 dashedName: amicable-pairs
 ---
 
 # --description--
 
-Two integers $N$ and $M$ are said to be [amicable pairs](https://en.wikipedia.org/wiki/Amicable numbers "wp: Amicable numbers") if $N \\neq M$ and the sum of the [proper divisors](https://rosettacode.org/wiki/Proper divisors "Proper divisors") of $N$ ($\\mathrm{sum}(\\mathrm{propDivs}(N))$) $= M$ as well as $\\mathrm{sum}(\\mathrm{propDivs}(M)) = N$.
+Two integers $N$ and $M$ are said to be amicable pairs if $N \\neq M$ and the sum of the proper divisors of $N$ ($\\mathrm{sum}(\\mathrm{propDivs}(N))$) $= M$ as well as $\\mathrm{sum}(\\mathrm{propDivs}(M)) = N$.
 
-**Example:**
+**例如：**
 
 **1184** and **1210** are an amicable pair, with proper divisors:
 
 <ul>
-  <li>1, 2, 4, 8, 16, 32, 37, 74, 148, 296, 592  and</li>
-  <li>1, 2, 5, 10, 11, 22, 55, 110, 121, 242, 605   respectively.</li>
+  <li>1, 2, 4, 8, 16, 32, 37, 74, 148, 296, 592 and</li>
+  <li>1, 2, 5, 10, 11, 22, 55, 110, 121, 242, 605 respectively.</li>
 </ul>
 
+The sum of the divisors for the first value, **1184**, is **1210** and the sum of the divisors for the second value, **1210**, is **1184**.
+
 # --instructions--
 
 Calculate and show here the Amicable pairs below 20,000 (there are eight).
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/averages-mode.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/averages-mode.md
index 166050bd516..d65362b8929 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/averages-mode.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/averages-mode.md
@@ -1,14 +1,14 @@
 ---
 id: 594d8d0ab97724821379b1e6
 title: Averages/Mode
-challengeType: 5
+challengeType: 1
 forumTopicId: 302226
 dashedName: averagesmode
 ---
 
 # --description--
 
-Write a program to find the [mode](https://en.wikipedia.org/wiki/Mode (statistics) "wp: Mode (statistics)") value of a collection.
+Write a function `mode` to find the value that appears most in an array.
 
 The case where the collection is empty may be ignored. Care must be taken to handle the case where the mode is non-unique.
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md
index 45425141e3b..772c6fb9da1 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md
@@ -1,14 +1,14 @@
 ---
 id: 594d966a1467eb84194f0086
 title: Averages/Pythagorean means
-challengeType: 5
+challengeType: 1
 forumTopicId: 302227
 dashedName: averagespythagorean-means
 ---
 
 # --description--
 
-Compute all three of the [Pythagorean means](https://en.wikipedia.org/wiki/Pythagorean means "wp: Pythagorean means") of the set of integers $1$ through $10$ (inclusive).
+Compute all three of the <a href="https://en.wikipedia.org/wiki/Pythagorean_means" target="_blank" rel="noopener noreferrer nofollow">Pythagorean means</a> of the set of integers $1$ through $10$ (inclusive).
 
 Show that $A(x_1,\\ldots,x_n) \\geq G(x_1,\\ldots,x_n) \\geq H(x_1,\\ldots,x_n)$ for this set of positive integers.
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md
index d7bb3ef969c..f4dbbcbcca7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md
@@ -1,18 +1,16 @@
 ---
 id: 594da033de4190850b893874
 title: Averages/Root mean square
-challengeType: 5
+challengeType: 1
 forumTopicId: 302228
 dashedName: averagesroot-mean-square
 ---
 
 # --description--
 
-Compute the [Root mean square](https://en.wikipedia.org/wiki/Root mean square "wp: Root mean square") of the numbers 1 through 10 inclusive.
+Compute the Root Mean Square (RMS) of the numbers 1 through 10 inclusive.
 
-The *root mean square* is also known by its initials RMS (or rms), and as the **quadratic mean**.
-
-The RMS is calculated as the mean of the squares of the numbers, square-rooted:
+The <abbr title="Root mean square">RMS</abbr> is calculated by taking the square root of the mean of the squares of the numbers, given by the equation:
 
 $$x\_{\\mathrm{rms}} = \\sqrt {{{x_1}^2 + {x_2}^2 + \\cdots + {x_n}^2} \\over n}. $$
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/babbage-problem.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/babbage-problem.md
index 27054cccc54..0b0066b5b05 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/babbage-problem.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/babbage-problem.md
@@ -1,14 +1,14 @@
 ---
 id: 594db4d0dedb4c06a2a4cefd
 title: Babbage problem
-challengeType: 5
+challengeType: 1
 forumTopicId: 302229
 dashedName: babbage-problem
 ---
 
 # --description--
 
-[Charles Babbage](https://en.wikipedia.org/wiki/Charles_Babbage "wp: Charles_Babbage"), looking ahead to the sorts of problems his Analytical Engine would be able to solve, gave this example:
+Charles Babbage, looking ahead to the sorts of problems his Analytical Engine would be able to solve, gave this example:
 
 <blockquote>
   What is the smallest positive integer whose square ends in the digits 269,696?
@@ -17,7 +17,7 @@ dashedName: babbage-problem
 
 He thought the answer might be 99,736, whose square is 9,947,269,696; but he couldn't be certain.
 
-The task is to find out if Babbage had the right answer.
+任務是找出巴貝奇是否有正確的答案。
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/balanced-brackets.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/balanced-brackets.md
index 5045fbd2cad..4e56ebb88be 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/balanced-brackets.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/balanced-brackets.md
@@ -1,7 +1,7 @@
 ---
 id: 594dc6c729e5700999302b45
 title: Balanced brackets
-challengeType: 5
+challengeType: 1
 forumTopicId: 302230
 dashedName: balanced-brackets
 ---
@@ -10,8 +10,8 @@ dashedName: balanced-brackets
 
 Determine whether a generated string of brackets is balanced; that is, whether it consists entirely of pairs of opening/closing brackets (in that order), none of which mis-nest.
 
-**Examples:**
-| Input                     | Output |
+**示例：**
+| 輸入                        | Output |
 | ------------------------- | ------ |
 | <code>\[]</code> | true   |
 | <code>]\[</code> | false  |
@@ -22,115 +22,115 @@ Determine whether a generated string of brackets is balanced; that is, whether i
 
 # --hints--
 
-`isBalanced` should be a function.
+`isBalanced` 應該是一個函數。
 
 ```js
 assert(typeof isBalanced === 'function');
 ```
 
-`isBalanced("[]")` should return true.
+`isBalanced("[]")` 應該返回 true。
 
 ```js
 assert(isBalanced(testCases[0]));
 ```
 
-`isBalanced("]][[[][][][]][")` should return false.
+`isBalanced("]][[[][][][]][")` 應該返回 false。
 
 ```js
 assert(!isBalanced(testCases[1]));
 ```
 
-`isBalanced("[][[[[][][[[]]]]]]")` should return true.
+`isBalanced("[][[[[][][[[]]]]]]")` 應該返回真。
 
 ```js
 assert(isBalanced(testCases[2]));
 ```
 
-`isBalanced("][")` should return false.
+`isBalanced("][")` 應該返回 false。
 
 ```js
 assert(!isBalanced(testCases[3]));
 ```
 
-`isBalanced("[[[]]]][[]")` should return false.
+`isBalanced("[[[]]]][[]")` 應該返回 false。
 
 ```js
 assert(!isBalanced(testCases[4]));
 ```
 
-`isBalanced("][[]")` should return false.
+`isBalanced("][[]")` 應該返回 false。
 
 ```js
 assert(!isBalanced(testCases[5]));
 ```
 
-`isBalanced("][[][]][[[]]")` should return false.
+`isBalanced("][[][]][[[]]")` 應該返回 false。
 
 ```js
 assert(!isBalanced(testCases[6]));
 ```
 
-`isBalanced("[[][]]][")` should return false.
+`isBalanced("[[][]]][")` 應該返回 false。
 
 ```js
 assert(!isBalanced(testCases[7]));
 ```
 
-`isBalanced("[[[]]][[]]]][][[")` should return false.
+`isBalanced("[[[]]][[]]]][][[")` 應該返回 false。
 
 ```js
 assert(!isBalanced(testCases[8]));
 ```
 
-`isBalanced("[]][[]]][[[[][]]")` should return false.
+`isBalanced("[]][[]]][[[[][]]")` 應該返回 false。
 
 ```js
 assert(!isBalanced(testCases[9]));
 ```
 
-`isBalanced("][]][[][")` should return false.
+`isBalanced("][]][[][")` 應該返回 false。
 
 ```js
 assert(!isBalanced(testCases[10]));
 ```
 
-`isBalanced("[[]][[][]]")` should return true.
+`isBalanced("[[]][[][]]")` 應該返回真。
 
 ```js
 assert(isBalanced(testCases[11]));
 ```
 
-`isBalanced("[[]]")` should return true.
+`isBalanced("[[]]")` 應該返回 true。
 
 ```js
 assert(isBalanced(testCases[12]));
 ```
 
-`isBalanced("]][]][[]][[[")` should return false.
+`isBalanced("]][]][[]][[[")` 應該返回 false。
 
 ```js
 assert(!isBalanced(testCases[13]));
 ```
 
-`isBalanced("][]][][[")` should return false.
+`isBalanced("][]][][[")` 應該返回 false。
 
 ```js
 assert(!isBalanced(testCases[14]));
 ```
 
-`isBalanced("][][")` should return false.
+`isBalanced("][][")` 應該返回 false。
 
 ```js
 assert(!isBalanced(testCases[15]));
 ```
 
-`isBalanced("[]]]")` should return false.
+`isBalanced("[]]]")` 應該返回 false。
 
 ```js
 assert(!isBalanced(testCases[16]));
 ```
 
-`isBalanced("")` should return true.
+`isBalanced("")` 應該返回 true。
 
 ```js
 assert(isBalanced(testCases[17]));
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md
index bbd910fb6c5..2254ea4c44a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md
@@ -1,7 +1,7 @@
 ---
 id: 5951815dd895584b06884620
 title: Circles of given radius through two points
-challengeType: 5
+challengeType: 1
 forumTopicId: 302231
 dashedName: circles-of-given-radius-through-two-points
 ---
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 9221d424b31..06259fbc6a1 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
@@ -1,7 +1,7 @@
 ---
 id: 5951a53863c8a34f02bf1bdc
 title: Closest-pair problem
-challengeType: 5
+challengeType: 1
 forumTopicId: 302232
 dashedName: closest-pair-problem
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/combinations.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/combinations.md
index 27e9a3fa6d4..8ced3ef16f7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/combinations.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/combinations.md
@@ -1,7 +1,7 @@
 ---
 id: 5958469238c0d8d2632f46db
 title: Combinations
-challengeType: 5
+challengeType: 1
 forumTopicId: 302233
 dashedName: combinations
 ---
@@ -10,7 +10,7 @@ dashedName: combinations
 
 Given non-negative integers `m` and `n`, generate all size `m` combinations of the integers from `0` (zero) to `n-1` in sorted order (each combination is sorted and the entire table is sorted).
 
-**Example:**
+**例如：**
 
 `3` comb `5` is:
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/comma-quibbling.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/comma-quibbling.md
index 6223a523cee..28053f80b67 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/comma-quibbling.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/comma-quibbling.md
@@ -1,14 +1,14 @@
 ---
 id: 596e414344c3b2872167f0fe
 title: Comma quibbling
-challengeType: 5
+challengeType: 1
 forumTopicId: 302234
 dashedName: comma-quibbling
 ---
 
 # --description--
 
-Comma quibbling is a task originally set by Eric Lippert in his [blog](https://blogs.msdn.com/b/ericlippert/archive/2009/04/15/comma-quibbling.aspx).
+<a href="https://rosettacode.org/wiki/Comma_quibbling" target="_blank" rel="noopener noreferrer nofollow">Comma quibbling</a> is a task originally set by Eric Lippert in his blog.
 
 # --instructions--
 
@@ -52,19 +52,19 @@ assert(typeof quibble(['ABC']) === 'string');
 assert.equal(quibble(testCases[0]), results[0]);
 ```
 
-`quibble(["ABC"])` should return "{ABC}".
+`quibble(["ABC"])` should return `"{ABC}"`.
 
 ```js
 assert.equal(quibble(testCases[1]), results[1]);
 ```
 
-`quibble(["ABC", "DEF"])` should return "{ABC and DEF}".
+`quibble(["ABC", "DEF"])` should return `"{ABC and DEF}"`.
 
 ```js
 assert.equal(quibble(testCases[2]), results[2]);
 ```
 
-`quibble(["ABC", "DEF", "G", "H"])` should return "{ABC,DEF,G and H}".
+`quibble(["ABC", "DEF", "G", "H"])` should return `"{ABC, DEF, G and H}"`.
 
 ```js
 assert.equal(quibble(testCases[3]), results[3]);
@@ -76,7 +76,7 @@ assert.equal(quibble(testCases[3]), results[3]);
 
 ```js
 const testCases = [[], ["ABC"], ["ABC", "DEF"], ["ABC", "DEF", "G", "H"]];
-const results = ["{}", "{ABC}", "{ABC and DEF}", "{ABC,DEF,G and H}"];
+const results = ["{}", "{ABC}", "{ABC and DEF}", "{ABC, DEF, G and H}"];
 ```
 
 ## --seed-contents--
@@ -93,7 +93,7 @@ function quibble(words) {
 ```js
 function quibble(words) {
   return "{" +
-    words.slice(0, words.length - 1).join(",") +
+    words.slice(0, words.length - 1).join(", ") +
    (words.length > 1 ? " and " : "") +
    (words[words.length - 1] || '') +
   "}";
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
index 313cda7dcc3..df465f24694 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
@@ -1,14 +1,20 @@
 ---
 id: 596e457071c35c882915b3e4
 title: Compare a list of strings
-challengeType: 5
+challengeType: 1
 forumTopicId: 302235
 dashedName: compare-a-list-of-strings
 ---
 
 # --description--
 
-Given a [list](https://en.wikipedia.org/wiki/List_(abstract_data_type) "wp: List\_(abstract_data_type)") of arbitrarily many strings, implement a function for each of the following conditions:
+A list is a ordered set of values that may contain duplicates. Here is an example:
+
+```js
+const list = [['AA',  'BB', 'CC'], ['AA', 'ACB', 'AA'], [], ['AA']];
+```
+
+Given a list of arbitrarily many strings, implement a function for each of the following conditions:
 
 <ul>
   <li>test if they are all lexically equal</li>
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 e050e0d7d2a..683a565c301 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
@@ -1,7 +1,7 @@
 ---
 id: 596fd036dc1ab896c5db98b1
 title: Convert seconds to compound duration
-challengeType: 5
+challengeType: 1
 forumTopicId: 302236
 dashedName: convert-seconds-to-compound-duration
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/count-occurrences-of-a-substring.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/count-occurrences-of-a-substring.md
index 50d6c16f8dd..c3274154b40 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/count-occurrences-of-a-substring.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/count-occurrences-of-a-substring.md
@@ -1,7 +1,7 @@
 ---
 id: 596fda99c69f779975a1b67d
 title: Count occurrences of a substring
-challengeType: 5
+challengeType: 1
 forumTopicId: 302237
 dashedName: count-occurrences-of-a-substring
 ---
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 3e6bd14d1d6..de6c92e9e31 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
@@ -1,58 +1,58 @@
 ---
 id: 59713bd26bdeb8a594fb9413
 title: Count the coins
-challengeType: 5
+challengeType: 1
 forumTopicId: 302238
 dashedName: count-the-coins
 ---
 
 # --description--
 
-There are four types of common coins in [US](https://en.wikipedia.org/wiki/United_States) currency:
+There are four types of common coins in US currency:
 
 <ul>
-  <li>quarters (25 cents)</li>
-  <li>dimes (10 cents)</li>
-  <li>nickels (5 cents), and</li>
-  <li>pennies (1 cent)</li>
+  <li>quarters 銅幣(25 美分)</li>
+  <li>小銅幣（10 美分）</li>
+  <li>鎳幣（5 美分），以及</li>
+  <li>pennies 便士(1美分)</li>
 </ul>
 
 <p>There are six ways to make change for 15 cents:</p>
 
 <ul>
-  <li>A dime and a nickel</li>
-  <li>A dime and 5 pennies</li>
-  <li>3 nickels</li>
-  <li>2 nickels and 5 pennies</li>
-  <li>A nickel and 10 pennies</li>
-  <li>15 pennies</li>
+  <li>1 個小銅幣和 1 個鎳幣</li>
+  <li>一個小銅幣和 5 便士</li>
+  <li>3 個鎳幣</li>
+  <li>2 個鎳幣和 5 便士</li>
+  <li>1 個鎳幣和 10 便士</li>
+  <li>15 便士</li>
 </ul>
 
 # --instructions--
 
-Implement a function to determine how many ways there are to make change for a given input, `cents`, that represents an amount of US pennies using these common coins.
+實現一個函數來確定有多少種對給定輸入 `cents` 的找零方式， 找零可以使用一定數量的美國硬幣。
 
 # --hints--
 
-`countCoins` should be a function.
+`countCoins` 應該是一個函數。
 
 ```js
 assert(typeof countCoins === 'function');
 ```
 
-`countCoins(15)` should return `6`.
+`countCoins(15)` 應該返回 `6`。
 
 ```js
 assert.equal(countCoins(15), 6);
 ```
 
-`countCoins(85)` shouls return `163`.
+`countCoins(85)` 應該返回 `163`。
 
 ```js
 assert.equal(countCoins(85), 163);
 ```
 
-`countCoins(100)` should return `242`.
+`countCoins(100)` 應該返回 `242`。
 
 ```js
 assert.equal(countCoins(100), 242);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/cramers-rule.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/cramers-rule.md
index 7580e28c50e..675e8b1670a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/cramers-rule.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/cramers-rule.md
@@ -1,16 +1,20 @@
 ---
 id: 59713da0a428c1a62d7db430
-title: Cramer's rule
-challengeType: 5
+title: 克萊姆法則
+challengeType: 1
 forumTopicId: 302239
 dashedName: cramers-rule
 ---
 
 # --description--
 
-In [linear algebra](https://en.wikipedia.org/wiki/linear algebra "wp: linear algebra"), [Cramer's rule](https://en.wikipedia.org/wiki/Cramer's rule "wp: Cramer's rule") is an explicit formula for the solution of a [system of linear equations](https://en.wikipedia.org/wiki/system of linear equations "wp: system of linear equations") with as many equations as unknowns, valid whenever the system has a unique solution. It expresses the solution in terms of the determinants of the (square) coefficient matrix and of matrices obtained from it by replacing one column by the vector of right hand sides of the equations.
+<a href="https://rosettacode.org/wiki/Cramer%27s_rule" target="_blank" rel="noopener noreferrer nofollow">Cramer's rule</a> is a formula for solving a system of linear equations by using the determinants of matrices formed from subsets of the coefficients and right hand side values.
 
-Given
+The determinant of a matrix with 2 rows and two columns is given by:
+
+$\begin{aligned}|A|={\begin{vmatrix}a&b\\\c&d\end{vmatrix}}=ad-bc.\end{aligned}$
+
+Given a system of linear equations:
 
 $\\left\\{\\begin{matrix}a_1x + b_1y + c_1z&= {\\color{red}d_1}\\\\a_2x + b_2y + c_2z&= {\\color{red}d_2}\\\\a_3x + b_3y + c_3z&= {\\color{red}d_3}\\end{matrix}\\right.$
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md
index 28aa14710d4..2802c448aaa 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md
@@ -1,14 +1,39 @@
 ---
 id: 5a23c84252665b21eecc7e03
 title: Cumulative standard deviation
-challengeType: 5
+challengeType: 1
 forumTopicId: 302240
 dashedName: cumulative-standard-deviation
 ---
 
 # --description--
 
-Write a function that takes an array of numbers as parameter and returns the [standard deviation](https://en.wikipedia.org/wiki/Standard Deviation) of the series.
+Suppose that the entire population of interest is eight students in a particular class. For a finite set of numbers, the population standard deviation is found by taking the square root of the average of the squared deviations of the values subtracted from their average value. The marks of a class of eight students (that is, a statistical population) are the following eight values:
+
+$2, 4, 4, 4, 5, 5, 7, 9$
+
+These eight data points have the mean (average) of 5:
+
+$$\mu ={\frac {2+4+4+4+5+5+7+9}{8}}={\frac {40}{8}}=5$$
+
+First, calculate the deviations of each data point from the mean, and square the result of each:
+
+| Deviations of each data | Square the result    |
+| ----------------------- | -------------------- |
+| $(2-5)^{2}=(-3)^{2}=9$  | $(5-5)^{2}=0^{2}=0$  |
+| $(4-5)^{2}=(-1)^{2}=1$  | $(5-5)^{2}=0^{2}=0$  |
+| $(4-5)^{2}=(-1)^{2}=1$  | $(7-5)^{2}=2^{2}=4$  |
+| $(4-5)^{2}=(-1)^{2}=1$  | $(9-5)^{2}=4^{2}=16$ |
+
+The variance is the mean of these values:
+
+$$\sigma ^{2}={\frac {9+1+1+1+0+0+4+16}{8}}={\frac {32}{8}}=4$$
+
+and the population standard deviation is equal to the square root of the variance:
+
+$$\sigma ={\sqrt {4}}=2$$
+
+Write a function that takes an array of numbers as parameter and returns the <a href="https://rosettacode.org/wiki/Standard_deviation" target="_blank" rel="noopener noreferrer nofollow">standard deviation</a> of the series.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/cusip.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/cusip.md
index 0daefa32937..b74ce598f4a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/cusip.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/cusip.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7e05
 title: CUSIP
-challengeType: 5
+challengeType: 1
 forumTopicId: 302241
 dashedName: cusip
 ---
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 74e9412a08a..446e3fddf1f 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
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7e06
 title: Cut a rectangle
-challengeType: 5
+challengeType: 1
 forumTopicId: 302242
 dashedName: cut-a-rectangle
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/date-manipulation.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/date-manipulation.md
index 3412cd12fda..85a38bc0938 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/date-manipulation.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/date-manipulation.md
@@ -1,14 +1,14 @@
 ---
 id: 5966c21cf732a95f1b67dd28
 title: Date manipulation
-challengeType: 5
+challengeType: 1
 forumTopicId: 302244
 dashedName: date-manipulation
 ---
 
 # --description--
 
-Given a date string in EST, output the given date as a string with 12 hours added to the time. Time zone should be preserved.
+給定 EST 中的日期字符串，將給定的日期輸出爲在時間上添加 12 小時的字符串。 Time zone should be preserved.
 
 Example input: `"March 6 2009 7:30pm EST"`
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/day-of-the-week.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/day-of-the-week.md
index 0260694251c..e41d1e48dae 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/day-of-the-week.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/day-of-the-week.md
@@ -1,7 +1,7 @@
 ---
 id: 5966f99c45e8976909a85575
 title: Day of the week
-challengeType: 5
+challengeType: 1
 forumTopicId: 302245
 dashedName: day-of-the-week
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md
index f9989155956..b6a78ff636a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md
@@ -1,18 +1,18 @@
 ---
 id: 59694356a6e7011f7f1c5f4e
 title: Deal cards for FreeCell
-challengeType: 5
+challengeType: 1
 forumTopicId: 302246
 dashedName: deal-cards-for-freecell
 ---
 
 # --description--
 
-*FreeCell* is the solitaire card game that Paul Alfille introduced to the PLATO system in 1978. Jim Horne, at Microsoft, changed the name to FreeCell and reimplemented the game for [DOS](https://rosettacode.org/wiki/DOS "DOS"), then [Windows](https://rosettacode.org/wiki/Windows "Windows"). This version introduced 32000 numbered deals.
+*FreeCell* is the solitaire card game that Paul Alfille introduced to the PLATO system in 1978. Jim Horne, at Microsoft, changed the name to FreeCell and reimplemented the game for DOS, then Windows. This version introduced 32000 numbered deals.
 
 As the game became popular, Jim Horne disclosed the algorithm, and other implementations of FreeCell began to reproduce the Microsoft deals. These deals are numbered from 1 to 32000. Newer versions from Microsoft have 1 million deals, numbered from 1 to 1000000; some implementations allow numbers outside that range.
 
-The algorithm uses this [linear congruential generator](https://rosettacode.org/wiki/linear congruential generator "linear congruential generator") from Microsoft C:
+The algorithm uses this linear congruential generator from Microsoft C:
 
 <ul>
   <li>$state_{n + 1} \equiv 214013 \times state_n + 2531011 \pmod{2^{31}}$</li>
@@ -24,7 +24,7 @@ The algorithm follows:
 
 <ol>
   <li>Seed the RNG with the number of the deal.
-  </li><li>Create an <a href='https://rosettacode.org/wiki/array' title='array' target='_blank'>array</a> of 52 cards: Ace of Clubs, Ace of Diamonds, Ace of Hearts, Ace of Spades, 2 of Clubs, 2 of Diamonds, and so on through the ranks: Ace, 2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King. The array indexes are 0 to 51, with Ace of Clubs at 0, and King of Spades at 51.</li>
+  </li><li>Create an array of 52 cards: Ace of Clubs, Ace of Diamonds, Ace of Hearts, Ace of Spades, 2 of Clubs, 2 of Diamonds, and so on through the ranks: Ace, 2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King. The array indexes are 0 to 51, with Ace of Clubs at 0, and King of Spades at 51.</li>
   <li>Until the array is empty:</li>
   <li>Choose a random card at index ≡ next random number (mod array length).</li>
     <ul>
@@ -79,8 +79,6 @@ The algorithm follows:
 
 Write a function to take a deal number and deal cards in the same order as this algorithm. The function must return a two dimensional array representing the FreeCell board.
 
-Deals can also be checked against [FreeCell solutions to 1000000 games](https://freecellgamesolutions.com/). (Summon a video solution, and it displays the initial deal.)
-
 # --hints--
 
 `dealFreeCell` should be a function.
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/deepcopy.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/deepcopy.md
index 24b950d8d55..dc7666cee51 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/deepcopy.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/deepcopy.md
@@ -1,7 +1,7 @@
 ---
 id: 596a8888ab7c01048de257d5
 title: Deepcopy
-challengeType: 5
+challengeType: 1
 forumTopicId: 302247
 dashedName: deepcopy
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/define-a-primitive-data-type.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/define-a-primitive-data-type.md
index 2bc3f2dd1b7..e7909424694 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/define-a-primitive-data-type.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/define-a-primitive-data-type.md
@@ -1,7 +1,7 @@
 ---
 id: 597089c87eec450c68aa1643
 title: Define a primitive data type
-challengeType: 5
+challengeType: 1
 forumTopicId: 302248
 dashedName: define-a-primitive-data-type
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/department-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/department-numbers.md
index 0eba1bec54a..50d9ef1e732 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/department-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/department-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 59f40b17e79dbf1ab720ed7a
-title: Department Numbers
-challengeType: 5
+title: 部門編號
+challengeType: 1
 forumTopicId: 302249
 dashedName: department-numbers
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/discordian-date.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/discordian-date.md
index 811a3b867ec..bff43ccc37e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/discordian-date.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/discordian-date.md
@@ -1,14 +1,31 @@
 ---
 id: 59f4eafba0343628bb682785
 title: Discordian date
-challengeType: 5
+challengeType: 1
 forumTopicId: 302250
 dashedName: discordian-date
 ---
 
 # --description--
+The Gregorian calendar is a solar calendar with 12 months of 28-31 days each. A week consists of seven days, and there are 52 weeks and 1 day per year. The year consists of 365 days with a leap day added to February every leap year. A leap year occurs every four years, except for the first three centurial years of every 400 years.
 
-Convert a given date from the [Gregorian calendar](https://en.wikipedia.org/wiki/Gregorian calendar "wp: Gregorian calendar") to the [Discordian calendar](https://en.wikipedia.org/wiki/Discordian calendar "wp: Discordian calendar").
+The <a href="http://www.rosettacode.org/wiki/Discordian_date" target="_blank" rel="noopener noreferrer nofollow">Discordian calendar</a> is aligned with the Gregorian calendar, and begins on January 1. The week consists of five days, and there are 73 weeks per year. The year also consists of 365 days, with an extra day inserted between Chaos 59 and Chaos 60 every leap year.
+
+The months, weekdays, Apostle events, and Holidays in the Discordian calendar are given by:
+
+Seasons: `'Chaos', 'Discord', 'Confusion', 'Bureaucracy', 'The Aftermath'`.
+
+Weekdays: `'Sweetmorn', 'Boomtime', 'Pungenday', 'Prickle-Prickle', 'Setting Orange'`.
+
+Apostle: `'Mungday', 'Mojoday', 'Syaday', 'Zaraday', 'Maladay'`.
+
+Holidays: `'Chaoflux', 'Discoflux', 'Confuflux', 'Bureflux', 'Afflux'`.
+
+# --instructions--
+
+Convert a given date from the Gregorian calendar to the Discordian calendar.
+
+Note that the day Chaos 1, 3188 YOLD in the Discordian calendar is the day January 1, 2022 in the Gregorian calendar.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/dot-product.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/dot-product.md
index c1c61d1b124..0e0fb5c838a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/dot-product.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/dot-product.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7e1e
 title: Dot product
-challengeType: 5
+challengeType: 1
 forumTopicId: 302251
 dashedName: dot-product
 ---
 
 # --description--
 
-Create a function, to compute the **[dot product](https://en.wikipedia.org/wiki/Dot product)**, also known as the **scalar product** of two vectors.
+Create a function, to compute the **dot product**, also known as the **scalar product** of two vectors.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/element-wise-operations.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/element-wise-operations.md
index 52a15c8d11d..8f4b6d005a7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/element-wise-operations.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/element-wise-operations.md
@@ -1,7 +1,7 @@
 ---
 id: 599c333915e0ea32d04d4bec
 title: Element-wise operations
-challengeType: 5
+challengeType: 1
 forumTopicId: 302252
 dashedName: element-wise-operations
 ---
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 564476da7a7..97240396a41 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
@@ -1,7 +1,7 @@
 ---
 id: 599d0ba974141b0f508b37d5
 title: Emirp primes
-challengeType: 5
+challengeType: 1
 forumTopicId: 302253
 dashedName: emirp-primes
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/entropy.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/entropy.md
index 75d61ccc5d9..fa596bd4891 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/entropy.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/entropy.md
@@ -1,7 +1,7 @@
 ---
 id: 599d15309e88c813a40baf58
 title: Entropy
-challengeType: 5
+challengeType: 1
 forumTopicId: 302254
 dashedName: entropy
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/equilibrium-index.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/equilibrium-index.md
index a7a33f9d37a..996b7b47b57 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/equilibrium-index.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/equilibrium-index.md
@@ -1,7 +1,7 @@
 ---
 id: 5987fd532b954e0f21b5d3f6
-title: Equilibrium index
-challengeType: 5
+title: 均衡指數
+challengeType: 1
 forumTopicId: 302255
 dashedName: equilibrium-index
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/ethiopian-multiplication.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/ethiopian-multiplication.md
index a6d1c4cb349..a46d599aa1b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/ethiopian-multiplication.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/ethiopian-multiplication.md
@@ -1,7 +1,7 @@
 ---
 id: 599d1566a02b571412643b84
 title: Ethiopian multiplication
-challengeType: 5
+challengeType: 1
 forumTopicId: 302257
 dashedName: ethiopian-multiplication
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/euler-method.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/euler-method.md
index 4a17c09a25d..184c5a06891 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/euler-method.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/euler-method.md
@@ -1,14 +1,14 @@
 ---
 id: 59880443fb36441083c6c20e
 title: Euler method
-challengeType: 5
+challengeType: 1
 forumTopicId: 302258
 dashedName: euler-method
 ---
 
 # --description--
 
-Euler's method numerically approximates solutions of first-order ordinary differential equations (ODEs) with a given initial value. It is an explicit method for solving initial value problems (IVPs), as described in [the wikipedia page](https://en.wikipedia.org/wiki/Euler method "wp: Euler method").
+Euler's method numerically approximates solutions of first-order ordinary differential equations (ODEs) with a given initial value. It is an explicit method for solving initial value problems (IVPs), as described in <a href="https://www.freecodecamp.org/news/eulers-method-explained-with-examples/" title="Euler's Method Explained with Examples" target="_blank" rel="noopener noreferrer nofollow">this article</a>.
 
 The ODE has to be provided in the following form:
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/evaluate-binomial-coefficients.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/evaluate-binomial-coefficients.md
index 5b48751996c..30eeec21ba6 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/evaluate-binomial-coefficients.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/evaluate-binomial-coefficients.md
@@ -1,7 +1,7 @@
 ---
 id: 598de241872ef8353c58a7a2
 title: Evaluate binomial coefficients
-challengeType: 5
+challengeType: 1
 forumTopicId: 302259
 dashedName: evaluate-binomial-coefficients
 ---
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 cdc024dab4e..112483733bf 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
@@ -1,146 +1,78 @@
 ---
 id: 59e09e6d412c5939baa02d16
 title: Execute a Markov algorithm
-challengeType: 5
+challengeType: 1
 forumTopicId: 302260
 dashedName: execute-a-markov-algorithm
 ---
 
 # --description--
 
-Create an interpreter for a [Markov Algorithm](https://en.wikipedia.org/wiki/Markov algorithm "wp: Markov algorithm").
+Markov Concepts are used in machine learning, because of its simple approach in data manipulation. With a set number of `rules` you can manipulate given `data` to create a desired `output`.
 
-Rules have the syntax:
+We have added in the background:
 
-<pre>[ruleset] ::= (([comment] | [rule]) [newline]+)*
-[comment] ::= # {[any character]}
-[rule] ::= [pattern] [whitespace] -> [whitespace] [.] [replacement]
-[whitespace] ::= ([tab] | [space]) [[whitespace]]
-</pre>
+The `rules` in the form of nested array, and the `data` in the form of array, too. And the desired `outputs`.
 
-There is one rule per line.
+The `rules`:
 
-If there is a `.` (period) present before the \[replacement], then this is a terminating rule in which case the interpreter must halt execution.
+```js
+let rules=[
+[
+"A -> apple","B -> bag","S -> shop","T -> the",
+"the shop -> my brother","a never used -> .terminating rule"
+],
 
-A ruleset consists of a sequence of rules, with optional comments.
+[
+ "A -> apple","B -> bag","S -> .shop","T -> the",
+ "the shop -> my brother","a never used -> .terminating rule"
+],
 
-Rulesets
+[
+ "A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag",
+ "->.* -> money","W -> WW","S -> .shop","T -> the",
+ "the shop -> my brother","a never used -> .terminating rule"
+],
 
-Use the following tests on entries:
+[
+ "_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX",
+ "X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y",
+ "1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "
+],
 
-**Ruleset 1:**
+[
+"A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11",
+"B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"
+]
 
-<pre># This rules file is extracted from Wikipedia:
-# <code>http://en.wikipedia.org/wiki/Markov_Algorithm</code>
-A -> apple
-B -> bag
-S -> shop
-T -> the
-the shop -> my brother
-a never used -> .terminating rule
-</pre>
+];
+```
 
-Sample text of `I bought a B of As from T S.` should generate the output `I bought a bag of apples from my brother.`
+The `data`:
 
-**Ruleset 2:**
+```js
+let data=[
+        "I bought a B of As from T S.",
+        "I bought a B of As from T S.",
+        "I bought a B of As W my Bgage from T S.",
+        "_1111*11111_",
+        "000000A000000"
+        ];
+```
 
-A test of the terminating rule
+The `outputs`:
 
-<pre># Slightly modified from the rules on Wikipedia
-A -> apple
-B -> bag
-S -> .shop
-T -> the
-the shop -> my brother
-a never used -> .terminating rule
-</pre>
+```js
+let outputs=[
+    "I bought a bag of apples from my brother.",
+    "I bought a bag of apples from T shop.",
+    "I bought a bag of apples with my money from T shop.",
+    "11111111111111111111",
+    "00011H1111000"
+    ]
+```
 
-Sample text of `I bought a B of As from T S.` should generate `I bought a bag of apples from T shop.`
-
-**Ruleset 3:**
-
-This tests for correct substitution order and may trap simple regexp based replacement routines if special regexp characters are not escaped.
-
-<pre># BNF Syntax testing rules
-A -> apple
-WWWW -> with
-Bgage -> ->.*
-B -> bag
-->.* -> money
-W -> WW
-S -> .shop
-T -> the
-the shop -> my brother
-a never used -> .terminating rule
-</pre>
-
-Sample text of `I bought a B of As W my Bgage from T S.` should generate `I bought a bag of apples with my money from T shop.`
-
-**Ruleset 4:**
-
-This tests for correct order of scanning of rules, and may trap replacement routines that scan in the wrong order. It implements a general unary multiplication engine. (Note that the input expression must be placed within underscores in this implementation.)
-
-<pre>### Unary Multiplication Engine, for testing Markov Algorithm implementations
-### By Donal Fellows.
-# Unary addition engine
-_+1 -> _1+
-1+1 -> 11+
-# Pass for converting from the splitting of multiplication into ordinary
-# addition
-1! -> !1
-,! -> !+
-_! -> _
-# Unary multiplication by duplicating left side, right side times
-1*1 -> x,@y
-1x -> xX
-X, -> 1,1
-X1 -> 1X
-_x -> _X
-,x -> ,X
-y1 -> 1y
-y_ -> _
-# Next phase of applying
-1@1 -> x,@y
-1@_ -> @_
-,@_ -> !_
-++ -> +
-# Termination cleanup for addition
-_1 -> 1
-1+_ -> 1
-_+_ ->
-</pre>
-
-Sample text of `_1111*11111_` should generate the output `11111111111111111111`
-
-**Ruleset 5:**
-
-A simple [Turing machine](http://en.wikipedia.org/wiki/Turing_machine "link: http&#x3A;//en.wikipedia.org/wiki/Turing_machine"), implementing a three-state [busy beaver](http://en.wikipedia.org/wiki/Busy_beaver "link: http&#x3A;//en.wikipedia.org/wiki/Busy_beaver").
-
-The tape consists of `0`s and `1`s, the states are `A`, `B`, `C` and `H` (for `H`alt), and the head position is indicated by writing the state letter before the character where the head is. All parts of the initial tape the machine operates on have to be given in the input.
-
-Besides demonstrating that the Markov algorithm is Turing-complete, it also made me catch a bug in the C++ implementation which wasn't caught by the first four rulesets.
-
-<pre># Turing machine: three-state busy beaver
-#
-# state A, symbol 0 => write 1, move right, new state B
-A0 -> 1B
-# state A, symbol 1 => write 1, move left, new state C
-0A1 -> C01
-1A1 -> C11
-# state B, symbol 0 => write 1, move left, new state A
-0B0 -> A01
-1B0 -> A11
-# state B, symbol 1 => write 1, move right, new state B
-B1 -> 1B
-# state C, symbol 0 => write 1, move left, new state B
-0C0 -> B01
-1C0 -> B11
-# state C, symbol 1 => write 1, move left, halt
-0C1 -> H01
-1C1 -> H11
-</pre>
-
-This ruleset should turn `000000A000000` into `00011H1111000`
+Using Markov Algorithm, change the `data` into the desired `outputs` using the `rules` provided for you.
 
 # --hints--
 
@@ -150,34 +82,34 @@ This ruleset should turn `000000A000000` into `00011H1111000`
 assert(typeof markov === 'function');
 ```
 
-`markov(["A -> apple","B -> bag","S -> shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` should return "I bought a bag of apples from my brother.".
+`markov(["A -> apple","B -> bag","S -> shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` should return the string `I bought a bag of apples from my brother.`.
 
 ```js
-assert.deepEqual(markov(rules[0], tests[0]), outputs[0]);
+assert.deepEqual(markov(rules[0], datas[0]), outputs[0]);
 ```
 
-`markov(["A -> apple","B -> bag","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` should return "I bought a bag of apples from T shop.".
+`markov(["A -> apple","B -> bag","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` should return the string `I bought a bag of apples from T shop.`.
 
 ```js
-assert.deepEqual(markov(rules[1], tests[1]), outputs[1]);
+assert.deepEqual(markov(rules[1], datas[1]), outputs[1]);
 ```
 
-`markov(["A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag","->.* -> money","W -> WW","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As W my Bgage from T S.")` should return "I bought a bag of apples with my money from T shop.".
+`markov(["A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag","->.* -> money","W -> WW","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As W my Bgage from T S.")` should return the string `I bought a bag of apples with my money from T shop.`.
 
 ```js
-assert.deepEqual(markov(rules[2], tests[2]), outputs[2]);
+assert.deepEqual(markov(rules[2], datas[2]), outputs[2]);
 ```
 
-`markov(["_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX","X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y","1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "],"_1111*11111_")` should return "11111111111111111111".
+`markov(["_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX","X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y","1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "],"_1111*11111_")` should return the string `11111111111111111111`.
 
 ```js
-assert.deepEqual(markov(rules[3], tests[3]), outputs[3]);
+assert.deepEqual(markov(rules[3], datas[3]), outputs[3]);
 ```
 
-`markov(["A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11","B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"],"")` should return "00011H1111000".
+`markov(["A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11","B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"],"")` should return the string `00011H1111000`.
 
 ```js
-assert.deepEqual(markov(rules[4], tests[4]), outputs[4]);
+assert.deepEqual(markov(rules[4], datas[4]), outputs[4]);
 ```
 
 # --seed--
@@ -191,7 +123,7 @@ let rules=[["A -> apple","B -> bag","S -> shop","T -> the","the shop -> my broth
             ["A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag","->.* -> money","W -> WW","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],
             ["_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX","X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y","1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "],
             ["A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11","B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"]];
-let tests=["I bought a B of As from T S.",
+let datas=["I bought a B of As from T S.",
             "I bought a B of As from T S.",
             "I bought a B of As W my Bgage from T S.",
             "_1111*11111_",
@@ -208,7 +140,7 @@ let outputs=["I bought a bag of apples from my brother.",
 ## --seed-contents--
 
 ```js
-function markov(rules,test) {
+function markov(rules,data) {
 
 }
 ```
@@ -216,9 +148,9 @@ function markov(rules,test) {
 # --solutions--
 
 ```js
-function markov(rules,test) {
+function markov(rules,data) {
     let pattern = new RegExp("^([^#]*?)\\s+->\\s+(\\.?)(.*)");
-    let origTest = test;
+    let origData = data;
 
     let captures = [];
 
@@ -229,18 +161,18 @@ function markov(rules,test) {
         captures.push(m);
     });
 
-    test = origTest;
-    let copy = test;
+    data = origData;
+    let copy = data;
     for (let j = 0; j < captures.length; j++) {
         let c = captures[j];
-        test = test.replace(c[0], c[2]);
+        data = data.replace(c[0], c[2]);
         if (c[1]==".")
             break;
-        if (test!=copy) {
+        if (data!=copy) {
             j = -1;
-            copy = test;
+            copy = data;
         }
     }
-    return test;
+    return data;
 }
 ```
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/execute-brain.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/execute-brain.md
index 7504589e582..b714bcb4eea 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/execute-brain.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/execute-brain.md
@@ -1,7 +1,7 @@
 ---
 id: 59e0a8df964e4540d5abe599
-title: Execute Brain****
-challengeType: 5
+title: 執行腦 ****
+challengeType: 1
 forumTopicId: 302261
 dashedName: execute-brain
 ---
@@ -10,21 +10,21 @@ dashedName: execute-brain
 
 Write a function to implement a Brain\*\*\*\* interpreter. The function will take a string as a parameter and should return a string as the output. More details are given below:
 
-RCBF is a set of [Brainf\*\*\*](https://rosettacode.org/wiki/Brainf*** "Brainf\*\*\*") compilers and interpreters written for Rosetta Code in a variety of languages.
+RCBF is a set of <a href="https://rosettacode.org/wiki/Brainf***" target="_blank" rel="noopener noreferrer nofollow">Brainf\*\*\*</a> compilers and interpreters written for Rosetta Code in a variety of languages.
 
 Below are links to each of the versions of RCBF.
 
 An implementation need only properly implement the following instructions:
 
-| Command                   | Description                                                                                |
-| ------------------------- | ------------------------------------------------------------------------------------------ |
-| <code>></code> | Move the pointer to the right                                                              |
-| <code>&lt;</code> | Move the pointer to the left                                                               |
-| <code>+</code> | Increment the memory cell under the pointer                                                |
-| <code>-</code> | Decrement the memory cell under the pointer                                                |
-| <code>.</code> | Output the character signified by the cell at the pointer                                  |
-| <code>,</code> | Input a character and store it in the cell at the pointer                                  |
-| <code>\[</code> | Jump past the matching <code>]</code> if the cell under the pointer is 0          |
+| Command                   | 描述                                                                                          |
+| ------------------------- | ------------------------------------------------------------------------------------------- |
+| <code>></code> | Move the pointer to the right                                                               |
+| <code>&lt;</code> | Move the pointer to the left                                                                |
+| <code>+</code> | Increment the memory cell under the pointer                                                 |
+| <code>-</code> | Decrement the memory cell under the pointer                                                 |
+| <code>.</code> | Output the character signified by the cell at the pointer                                   |
+| <code>,</code> | Input a character and store it in the cell at the pointer                                   |
+| <code>\[</code> | Jump past the matching <code>]</code> if the cell under the pointer is 0           |
 | <code>]</code> | Jump back to the matching <code>\[</code> if the cell under the pointer is nonzero |
 
 Any cell size is allowed, EOF (*E*nd-*O*-*F*ile) support is optional, as is whether you have bounded or unbounded memory.
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/extensible-prime-generator.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/extensible-prime-generator.md
index 620da453ffe..3593c40dfe1 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/extensible-prime-generator.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/extensible-prime-generator.md
@@ -1,14 +1,14 @@
 ---
 id: 598ee8b91b410510ae82efef
 title: Extensible prime generator
-challengeType: 5
+challengeType: 1
 forumTopicId: 302262
 dashedName: extensible-prime-generator
 ---
 
 # --description--
 
-Write a generator of prime numbers, in order, that will automatically adjust to accommodate the generation of any reasonably high prime.
+按順序編寫一個素數生成器，它會自動調整以適應任何合理的高素數的生成。
 
 The generator should be able to:
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/factorial.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/factorial.md
index f58bdffe25e..94bb0d0ef58 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/factorial.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/factorial.md
@@ -1,7 +1,7 @@
 ---
 id: 597b2b2a2702b44414742771
-title: Factorial
-challengeType: 5
+title: 階乘
+challengeType: 1
 forumTopicId: 302263
 dashedName: factorial
 ---
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 0e5a414555c..462cc74bd5a 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
@@ -1,7 +1,7 @@
 ---
 id: 598eea87e5cf4b116c3ff81a
-title: Factors of a Mersenne number
-challengeType: 5
+title: 梅森數的因數
+challengeType: 1
 forumTopicId: 302264
 dashedName: factors-of-a-mersenne-number
 ---
@@ -12,7 +12,7 @@ A Mersenne number is a number in the form of <code>2<sup>P</sup>-1</code>.
 
 If `P` is prime, the Mersenne number may be a Mersenne prime. (If `P` is not prime, the Mersenne number is also not prime.)
 
-In the search for Mersenne prime numbers it is advantageous to eliminate exponents by finding a small factor before starting a, potentially lengthy, [Lucas-Lehmer test](https://rosettacode.org/wiki/Lucas-Lehmer test "Lucas-Lehmer test").
+In the search for Mersenne prime numbers it is advantageous to eliminate exponents by finding a small factor before starting a, potentially lengthy, <a href="https://rosettacode.org/wiki/Lucas-Lehmer test" target="_blank" rel="noopener noreferrer nofollow">Lucas-Lehmer test</a>.
 
 There are very efficient algorithms for determining if a number divides <code>2<sup>P</sup>-1</code> (or equivalently, if <code>2<sup>P</sup> mod (the number) = 1</code>).
 
@@ -22,7 +22,7 @@ The following is how to implement this modPow yourself:
 
 For example, let's compute <code>2<sup>23</sup> mod 47</code>.
 
-Convert the exponent 23 to binary, you get 10111. Starting with <code><tt>square</tt> = 1</code>, repeatedly square it.
+將指數 23 轉換爲二進制，得到 10111。 Starting with <code><tt>square</tt> = 1</code>, repeatedly square it.
 
 Remove the top bit of the exponent, and if it's 1 multiply `square` by the base of the exponentiation (2), then compute <code><tt>square</tt> modulo 47</code>.
 
@@ -48,7 +48,7 @@ Further properties of Mersenne numbers allow us to refine the process even more.
 
 Any factor `q` of <code>2<sup>P</sup>-1</code> must be of the form `2kP+1`, `k` being a positive integer or zero. Furthermore, `q` must be `1` or `7 mod 8`.
 
-Finally any potential factor `q` must be [prime](https://rosettacode.org/wiki/Primality by Trial Division "Primality by Trial Division").
+Finally any potential factor `q` must be <a href="https://rosettacode.org/wiki/Primality_by_trial_division" target="_blank" rel="noopener noreferrer nofollow">prime</a>.
 
 As in other trial division algorithms, the algorithm stops when `2kP+1 > sqrt(N)`.These primarily tests only work on Mersenne numbers where `P` is prime. For example, <code>M<sub>4</sub>=15</code> yields no factors using these techniques, but factors into 3 and 5, neither of which fit `2kP+1`.
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/factors-of-an-integer.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/factors-of-an-integer.md
index 31d9b722b7f..8de06b3c4f0 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/factors-of-an-integer.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/factors-of-an-integer.md
@@ -1,7 +1,7 @@
 ---
 id: 597f1e7fbc206f0e9ba95dc4
 title: Factors of an integer
-challengeType: 5
+challengeType: 1
 forumTopicId: 302265
 dashedName: factors-of-an-integer
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/farey-sequence.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/farey-sequence.md
index 59b4edc9a54..f549221deb3 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/farey-sequence.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/farey-sequence.md
@@ -1,14 +1,14 @@
 ---
 id: 59c3ec9f15068017c96eb8a3
 title: Farey sequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 302266
 dashedName: farey-sequence
 ---
 
 # --description--
 
-The [Farey sequence](https://en.wikipedia.org/wiki/Farey sequence "wp: Farey sequence") <code>F<sub>n</sub></code> of order `n` is the sequence of completely reduced fractions between `0` and `1` which, when in lowest terms, have denominators less than or equal to `n`, arranged in order of increasing size.
+The Farey sequence <code>F<sub>n</sub></code> of order `n` is the sequence of completely reduced fractions between `0` and `1` which, when in lowest terms, have denominators less than or equal to `n`, arranged in order of increasing size.
 
 The *Farey sequence* is sometimes incorrectly called a *Farey series*.
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md
index 456b87de792..540c7372b1e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md
@@ -1,14 +1,14 @@
 ---
 id: 598eef80ba501f1268170e1e
 title: Fibonacci n-step number sequences
-challengeType: 5
+challengeType: 1
 forumTopicId: 302267
 dashedName: fibonacci-n-step-number-sequences
 ---
 
 # --description--
 
-These number series are an expansion of the ordinary [Fibonacci sequence](https://rosettacode.org/wiki/Fibonacci sequence "Fibonacci sequence") where:
+These number series are an expansion of the ordinary Fibonacci sequence where:
 
 <ol>
   <li>For $n = 2$ we have the Fibonacci sequence; with initial values $[1, 1]$ and $F_k^2 = F_{k-1}^2 + F_{k-2}^2$</li>
@@ -17,7 +17,7 @@ These number series are an expansion of the ordinary [Fibonacci sequence](https:
   <li>For general $n>2$ we have the Fibonacci $n$-step sequence - $F_k^n$; with initial values of the first $n$ values of the $(n-1)$'th Fibonacci $n$-step sequence $F_k^{n-1}$; and $k$'th value of this $n$'th sequence being $F_k^n = \sum_{i=1}^{(n)} {F_{k-i}^{(n)}}$</li>
 </ol>
 
-For small values of $n$, [Greek numeric prefixes](https://en.wikipedia.org/wiki/Number prefix#Greek_series "wp: Number prefix#Greek_series") are sometimes used to individually name each series.
+For small values of $n$, Greek numeric prefixes are sometimes used to individually name each series.
 
 Fibonacci $n$-step sequences:
 
@@ -33,7 +33,7 @@ Fibonacci $n$-step sequences:
 | 9   | nonanacci   | 1 1 2 4 8 16 32 64 128 256 511 1021 2040 4076 8144 ... |
 | 10  | decanacci   | 1 1 2 4 8 16 32 64 128 256 512 1023 2045 4088 8172 ... |
 
-Allied sequences can be generated where the initial values are changed: The [Lucas series](https://en.wikipedia.org/wiki/Lucas number "wp: Lucas number") sums the two preceding values like the fibonacci series for $n=2$ but uses $\[2, 1]$ as its initial values.
+Allied sequences can be generated where the initial values are changed: The Lucas series sums the two preceding values like the fibonacci series for $n=2$ but uses $\[2, 1]$ as its initial values.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/fibonacci-sequence.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/fibonacci-sequence.md
index 2cce69c1856..4e60775b086 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/fibonacci-sequence.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/fibonacci-sequence.md
@@ -1,7 +1,7 @@
 ---
 id: 597f24c1dda4e70f53c79c81
 title: Fibonacci sequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 302268
 dashedName: fibonacci-sequence
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/fibonacci-word.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/fibonacci-word.md
index 708f743add3..464f03b61b7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/fibonacci-word.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/fibonacci-word.md
@@ -1,14 +1,14 @@
 ---
 id: 5992e222d397f00d21122931
 title: Fibonacci word
-challengeType: 5
+challengeType: 1
 forumTopicId: 302269
 dashedName: fibonacci-word
 ---
 
 # --description--
 
-The Fibonacci Word may be created in a manner analogous to the Fibonacci Sequence [as described here](https://hal.archives-ouvertes.fr/docs/00/36/79/72/PDF/The_Fibonacci_word_fractal.pdf):
+The Fibonacci Word Sequence may be created in a manner analogous to the Fibonacci Sequence, but it focuses on iterating concatenation.
 
 <pre>Define  F_Word<sub>1</sub>  as  <strong>1</strong>
 Define  F_Word<sub>2</sub>  as  <strong>0</strong>
@@ -16,9 +16,11 @@ Form   F_Word<sub>3</sub>  as  F_Word<sub>2</sub>   concatenated with  F_Word<su
 Form   F_Word<sub>n</sub>  as  F_Word<sub>n-1</sub>  concatenated with  F_word<sub>n-2</sub>
 </pre>
 
+Entropy calculation is required in this challenge, <a href="https://www.freecodecamp.org/learn/coding-interview-prep/rosetta-code/entropy" target="_blank" rel="noopener noreferrer nofollow">as shown in this Rosetta Code challenge</a>
+
 # --instructions--
 
-Write a function to return the Fibonacci Words up to `n`. `n` will be provided as a parameter to the function. The function should return an array of objects. The objects should be of the form: `{ N: 1, Length: 1, Entropy: 0, Word: '1' }`.
+Write a function to return the first `n` Fibonacci Words. The number of `n` is provided as a parameter to the function. The function should return an array of objects. The objects should be of the form: `{ N: 1, Length: 1, Entropy: 0, Word: '1' }`. `Entropy` is computed for the string `Word` and rounded to 8 decimal digits of accuracy. Note that the indices of this sequence start at `1`.
 
 # --hints--
 
@@ -34,10 +36,16 @@ assert(typeof fibWord === 'function');
 assert(Array.isArray(fibWord(5)));
 ```
 
-`fibWord(5)` should return `[{ N:1, Length:1, Entropy:0, Word:"1" },{ N:2, Length:1, Entropy:0, Word:"0" },{ N:3, Length:2, Entropy:1, Word:"01" },{ N:4, Length:3, Entropy:0.9182958340544896, Word:"010" },{ N:5, Length:5, Entropy:0.9709505944546688, Word:"01001" }]`.
+`fibWord(5)` should return `[{ N:1, Length:1, Entropy:0, Word:"1" },{ N:2, Length:1, Entropy:0, Word:"0" },{ N:3, Length:2, Entropy:1, Word:"01" },{ N:4, Length:3, Entropy:0.91829583, Word:"010" },{ N:5, Length:5, Entropy:0.97095059, Word:"01001" }]`.
 
 ```js
-assert.deepEqual(fibWord(5), ans);
+assert.deepEqual(fibWord(5), words5);
+```
+
+`fibWord(7)` should return `[{ N:1, Length:1, Entropy:0, Word:"1" },{ N:2, Length:1, Entropy:0, Word:"0" },{ N:3, Length:2, Entropy:1, Word:"01" },{ N:4, Length:3, Entropy:0.91829583, Word:"010" },{ N:5, Length:5, Entropy:0.97095059, Word:"01001" }, { N:6, Length:8, Entropy:0.954434, Word:'01001010' }, { N:7, Length:13, Entropy:0.9612366, Word:'0100101001001' }]`.
+
+```js
+assert.deepEqual(fibWord(7), words7);
 ```
 
 # --seed--
@@ -45,15 +53,23 @@ assert.deepEqual(fibWord(5), ans);
 ## --after-user-code--
 
 ```js
-let ans=[ { N: 1, Length: 1, Entropy: 0, Word: '1' },
-
+const words5 = [
+  { N: 1, Length: 1, Entropy: 0, Word: '1' },
   { N: 2, Length: 1, Entropy: 0, Word: '0' },
-
   { N: 3, Length: 2, Entropy: 1, Word: '01' },
+  { N: 4, Length: 3, Entropy: 0.91829583, Word: '010' },
+  { N: 5, Length: 5, Entropy: 0.97095059, Word: '01001' }
+];
 
-  { N: 4, Length: 3, Entropy: 0.9182958340544896, Word: '010' },
-
-  { N: 5, Length: 5, Entropy: 0.9709505944546688, Word: '01001' }];
+const words7 = [
+  { N: 1, Length: 1, Entropy: 0, Word: '1' },
+  { N: 2, Length: 1, Entropy: 0, Word: '0' },
+  { N: 3, Length: 2, Entropy: 1, Word: '01' },
+  { N: 4, Length: 3, Entropy: 0.91829583, Word: '010' },
+  { N: 5, Length: 5, Entropy: 0.97095059, Word: '01001' },
+  { N: 6, Length: 8, Entropy: 0.954434, Word: '01001010' },
+  { N: 7, Length: 13, Entropy: 0.9612366, Word: '0100101001001' }
+];
 ```
 
 ## --seed-contents--
@@ -67,55 +83,33 @@ function fibWord(n) {
 # --solutions--
 
 ```js
+// Round to digits
+function roundFloat(num, digits) {
+  return Math.round(num * 10.0**digits) / (10.0**digits);
+}
+
+// Entropy calculation for string with only 0 and 1
+function entropy(word) {
+  function digitEntropy(count) {
+    return count < 1 ? 0
+      : - count / word.length * Math.log2(count / word.length);
+  }
+  const numZeros = word.split('').filter(e => e === '0').length;
+  const numOnes  = word.length - numZeros;
+  return roundFloat(digitEntropy(numZeros) + digitEntropy(numOnes), 8);
+}
+
+// Compute array of Fibonacci words
 function fibWord(n) {
-    function entropy(s) {
-         //create an object containing each individual char
-      //and the amount of iterations per char
-        function prob(s) {
-            var h = Object.create(null);
-            s.split('').forEach(function(c) {
-               h[c] && h[c]++ || (h[c] = 1);
-            });
-            return h;
-        }
-
-        s = s.toString(); //just in case
-        var e = 0, l = s.length, h = prob(s);
-
-        for (var i in h ) {
-            var p = h[i]/l;
-            e -= p * Math.log(p) / Math.log(2);
-        }
-        return e;
-    }
-    var wOne = "1", wTwo = "0", wNth = [wOne, wTwo], w = "", o = [];
-
-    for (var i = 0; i < n; i++) {
-        if (i === 0 || i === 1) {
-            w = wNth[i];
-        } else {
-            w = wNth[i - 1] + wNth[i - 2];
-            wNth.push(w);
-        }
-        var l = w.length;
-        var e = entropy(w);
-
-        if (l <= 21) {
-            o.push({
-                N: i + 1,
-                Length: l,
-                Entropy: e,
-                Word: w
-            });
-        } else {
-            o.push({
-                N: i + 1,
-                Length: l,
-                Entropy: e,
-                Word: "..."
-            });
-        }
-    }
-  return o;
+  return [...Array(n).keys()]
+    .reduce((words, i) => {
+      const word = i === 0 ? "1"
+                 : i === 1 ? "0"
+                 : words[i - 1].Word + words[i - 2].Word;
+      words.push(
+        { N: i + 1, Length: word.length, Entropy: entropy(word), Word: word }
+      );
+      return words;
+    }, []);
 }
 ```
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/fizzbuzz.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/fizzbuzz.md
index 9839933b099..400625c512e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/fizzbuzz.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/fizzbuzz.md
@@ -1,7 +1,7 @@
 ---
 id: 5e9ddb06ec35240f39657419
 title: FizzBuzz
-challengeType: 5
+challengeType: 1
 forumTopicId: 385370
 dashedName: fizzbuzz
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/fractran.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/fractran.md
index 0bcda09bdec..4e3daccf125 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/fractran.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/fractran.md
@@ -1,14 +1,14 @@
 ---
 id: 5a7dad05be01840e1778a0d1
 title: Fractran
-challengeType: 5
+challengeType: 1
 forumTopicId: 302270
 dashedName: fractran
 ---
 
 # --description--
 
-[FRACTRAN](https://en.wikipedia.org/wiki/FRACTRAN "wp: FRACTRAN") is a Turing-complete esoteric programming language invented by the mathematician [John Horton Conway](https://en.wikipedia.org/wiki/John Horton Conway "wp: John Horton Conway").
+FRACTRAN is a Turing-complete esoteric programming language invented by the mathematician John Horton Conway.
 
 A FRACTRAN program is an ordered list of positive fractions $P = (f_1, f_2, \\ldots, f_m)$, together with an initial positive integer input $n$.
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/gamma-function.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/gamma-function.md
index f105a0a1bd5..91b6b01786a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/gamma-function.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/gamma-function.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7e76
 title: Gamma function
-challengeType: 5
+challengeType: 1
 forumTopicId: 302271
 dashedName: gamma-function
 ---
 
 # --description--
 
-Implement one algorithm (or more) to compute the [Gamma](https://en.wikipedia.org/wiki/Gamma function) ($\\Gamma$) function (in the real field only).
+Implement one algorithm (or more) to compute the Gamma function (in the real field only).
 
 The Gamma function can be defined as:
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/gaussian-elimination.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/gaussian-elimination.md
index 2e5adf4bd9e..53b7860f1fc 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/gaussian-elimination.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/gaussian-elimination.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7e77
 title: Gaussian elimination
-challengeType: 5
+challengeType: 1
 forumTopicId: 302272
 dashedName: gaussian-elimination
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md
index 4af8e94f0e3..168406d9457 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7e78
 title: General FizzBuzz
-challengeType: 5
+challengeType: 1
 forumTopicId: 302273
 dashedName: general-fizzbuzz
 ---
 
 # --description--
 
-Write a generalized version of [FizzBuzz](https://rosettacode.org/wiki/FizzBuzz) that works for any list of factors, along with their words.
+Write a generalized version of <a href="https://rosettacode.org/wiki/FizzBuzz" target="_blank" rel="noopener noreferrer nofollow">FizzBuzz</a> that works for any list of factors, along with their words.
 
 This is basically a "fizzbuzz" implementation where the rules of the game are supplied to the user. Create a function to implement this. The function should take two parameters.
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.md
index 5f643c3a38b..eb31c80170b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7e7a
 title: Generate lower case ASCII alphabet
-challengeType: 5
+challengeType: 1
 forumTopicId: 302274
 dashedName: generate-lower-case-ascii-alphabet
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/generator-exponential.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/generator-exponential.md
index f888e8dff04..6b15a7ca62e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/generator-exponential.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/generator-exponential.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7e7b
 title: Generator/Exponential
-challengeType: 5
+challengeType: 1
 forumTopicId: 302275
 dashedName: generatorexponential
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/gray-code.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/gray-code.md
index f46350f0be6..896976a189a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/gray-code.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/gray-code.md
@@ -1,24 +1,24 @@
 ---
 id: 5a23c84252665b21eecc7e80
 title: Gray code
-challengeType: 5
+challengeType: 1
 forumTopicId: 302276
 dashedName: gray-code
 ---
 
 # --description--
 
-[Gray code](https://en.wikipedia.org/wiki/Gray code) is a form of binary encoding where transitions between consecutive numbers differ by only one bit.
+Gray code is a form of binary encoding where transitions between consecutive numbers differ by only one bit.
 
 This is a useful encoding for reducing hardware data hazards with values that change rapidly and/or connect to slower hardware as inputs.
 
-It is also useful for generating inputs for [Karnaugh maps](https://en.wikipedia.org/wiki/Karnaugh map) in order from left to right or top to bottom.
+It is also useful for generating inputs for Karnaugh maps in order from left to right or top to bottom.
 
 # --instructions--
 
 Create a function to encode a number to and decode a number from Gray code. The function should will have 2 parameters.
 
-The first would be a boolean. The function should encode for true and decode for false. The second parameter would be the number to be encoded/decoded.
+第一個是布爾值。 該函數應編碼爲 true，解碼爲 false。 第二個參數是要編碼/解碼的數字。
 
 Display the normal binary representations, Gray code representations, and decoded Gray code values for all 5-bit binary numbers (0-31 inclusive, leading 0's not necessary).
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md
index 60b96750188..8e960936bb6 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7e82
 title: Greatest common divisor
-challengeType: 5
+challengeType: 1
 forumTopicId: 302277
 dashedName: greatest-common-divisor
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.md
index 4a90c111fe2..6b8eebaf0e8 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7e84
 title: Greatest subsequential sum
-challengeType: 5
+challengeType: 1
 forumTopicId: 302278
 dashedName: greatest-subsequential-sum
 ---
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 37768d8cd36..e7586de5a37 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
@@ -1,14 +1,14 @@
 ---
 id: 595608ff8bcd7a50bd490181
 title: Hailstone sequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 302279
 dashedName: hailstone-sequence
 ---
 
 # --description--
 
-The Hailstone sequence of numbers can be generated from a starting positive integer, `n` by:
+Hailstone 數字序列可以從一個起始正整數 `n` 生成：
 
 - If `n` is `1` then the sequence ends
 - If `n` is `even` then the next `n` of the sequence `= n/2`
@@ -25,7 +25,7 @@ The hailstone sequence is also known as hailstone numbers (because the values ar
 
 # --hints--
 
-`hailstoneSequence` should be a function.
+`hailstoneSequence` 應該是一個函數。
 
 ```js
 assert(typeof hailstoneSequence === 'function');
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 6cb33dbcaf6..43ab0ef8989 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
@@ -1,14 +1,14 @@
 ---
 id: 594810f028c0303b75339ad1
 title: Happy numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 302280
 dashedName: happy-numbers
 ---
 
 # --description--
 
-A [happy number](https://en.wikipedia.org/wiki/Happy_number) is defined by the following process:
+A happy number is defined by the following process:
 
 Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals `1` (where it will stay), or it loops endlessly in a cycle which does not include `1`. Those numbers for which this process ends in `1` are happy numbers, while those that do not end in `1` are unhappy numbers.
 
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 400e9513344..ff626d6671d 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
@@ -1,7 +1,7 @@
 ---
 id: 595668ca4cfe1af2fb9818d4
 title: Harshad or Niven series
-challengeType: 5
+challengeType: 1
 forumTopicId: 302281
 dashedName: harshad-or-niven-series
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
index d5a9a396bb9..75facd682ab 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
@@ -1,20 +1,24 @@
 ---
 id: 595671d4d2cdc305f0d5b36f
 title: Hash from two arrays
-challengeType: 5
+challengeType: 1
 forumTopicId: 302283
 dashedName: hash-from-two-arrays
 ---
 
 # --description--
 
-Using two Arrays of equal length, create a Hash object where the elements from one array (the keys) are linked to the elements of the other (the values).
+Given two arrays, create a hash object where the elements from one array (the keys) are linked to the elements of the other (the values).
 
-**Related task:**
+Example:
 
-<ul>
-  <li><a href='https://rosettacode.org/wiki/Associative arrays/Creation' title='Associative arrays/Creation' target='_blank'>Associative arrays/Creation</a></li>
-</ul>
+```js
+const firstArr = [1, 2, 3];
+const secondArr = ["a", "b", "c"];
+const hashObj = arrToObj(firstArr, secondArr);
+```
+
+The hash object created from the arrays above will be `{1: "a", 2: "b", 3: "c"}`.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/hash-join.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/hash-join.md
index 7dc6b729cb6..7f48f200892 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/hash-join.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/hash-join.md
@@ -1,19 +1,19 @@
 ---
 id: 5956795bc9e2c415eb244de1
 title: Hash join
-challengeType: 5
+challengeType: 1
 forumTopicId: 302284
 dashedName: hash-join
 ---
 
 # --description--
 
-An [inner join](https://en.wikipedia.org/wiki/Join_(SQL)#Inner_join "wp: Join\_(SQL)#Inner_join") is an operation that combines two data tables into one table, based on matching column values. The simplest way of implementing this operation is the [nested loop join](https://en.wikipedia.org/wiki/Nested loop join "wp: Nested loop join") algorithm, but a more scalable alternative is the [hash join](https://en.wikipedia.org/wiki/hash join "wp: hash join") algorithm.
+An inner join is an operation that combines two data tables into one table, based on matching column values. The simplest way of implementing this operation is the nested loop join algorithm, but a more scalable alternative is the hash join algorithm.
 
-The "hash join" algorithm consists of two steps:
+“哈希連接”算法包括兩個步驟：
 
 <ol>
-  <li><strong>Hash phase:</strong> Create a <a href='https://en.wikipedia.org/wiki/Multimap' title='wp: Multimap' target='_blank'>multimap</a> from one of the two tables, mapping from each join column value to all the rows that contain it.</li>
+  <li><strong>Hash phase:</strong> Create a multimap from one of the two tables, mapping from each join column value to all the rows that contain it.</li>
   <ul>
     <li>The multimap must support hash-based lookup which scales better than a simple linear search, because that's the whole point of this algorithm.</li>
     <li>Ideally we should create the multimap for the smaller table, thus minimizing its creation time and memory size.</li>
@@ -41,7 +41,7 @@ In pseudo-code, the algorithm could be expressed as follows:
 
 Implement the "hash join" algorithm as a function and demonstrate that it passes the test-case listed below. The function should accept two arrays of objects and return an array of combined objects.
 
-**Input**
+**輸入**
 
 <table>
   <tr>
@@ -127,7 +127,7 @@ Implement the "hash join" algorithm as a function and demonstrate that it passes
   </tr>
 </table>
 
-**Output**
+**輸出**
 
 | A_age | A_name | B_character | B_nemesis |
 | ----- | ------ | ----------- | --------- |
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/heronian-triangles.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/heronian-triangles.md
index 2162dc57eb4..35c83855e3c 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/heronian-triangles.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/heronian-triangles.md
@@ -1,14 +1,14 @@
 ---
 id: 595b98f8b5a2245e243aa831
 title: Heronian triangles
-challengeType: 5
+challengeType: 1
 forumTopicId: 302285
 dashedName: heronian-triangles
 ---
 
 # --description--
 
-[Hero's formula](https://en.wikipedia.org/wiki/Heron's formula "wp: Heron's formula") for the area of a triangle given the length of its three sides `a`, `b`, and `c` is given by:
+Hero's formula for the area of a triangle given the length of its three sides `a`, `b`, and `c` is given by:
 
 $A = \\sqrt{s(s-a)(s-b)(s-c)},$
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
index 1b5b864eda0..e05d87270f2 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
@@ -1,43 +1,35 @@
 ---
 id: 59622f89e4e137560018a40e
 title: Hofstadter Figure-Figure sequences
-challengeType: 5
+challengeType: 1
 forumTopicId: 302286
 dashedName: hofstadter-figure-figure-sequences
 ---
 
 # --description--
 
-These two sequences of positive integers are defined as:
+The Hofstadter Figure-Figure sequences $R_n$ and $S_n$ are given by
 
-$R(1)=1\\ ;\\ S(1)=2 \\\\R(n)=R(n-1)+S(n-1), \\quad n>1.$
+$R_1 = 1\\ ;\\ S_1 = 2 \\\\R_n = R_{n-1} + S_{n-1}, \\quad n>1.$
 
-The sequence $S(n)$ is further defined as the sequence of positive integers not present in $R(n)$.
-
-Sequence $R$ starts:
+Specifically, the sequence $R_n$ contains the values
 
 <pre>1, 3, 7, 12, 18, ...</pre>
 
-Sequence $S$ starts:
+and the sequence $S_n$ contains the values
 
 <pre>2, 4, 5, 6, 8, ...</pre>
 
+The sequence $R_n$ is defined by the recurrence relation $R_n = R_{n-1} + S_{n-1}$, while $S_n$ is defined as sequence of positive integers that are not included in the sequence $R_n$.
+
 # --instructions--
 
-Create two functions named `ffr` and `ffs` that when given `n` return `R(n)` or `S(n)` respectively. (Note that R(1) = 1 and S(1) = 2 to avoid off-by-one errors).
+Create two functions named `ffr` and `ffs` that return `R(n)` or `S(n)`, respectively, for any index `n`. Note that the Hofstadter Figure-Figure sequences are 1-indexed, with $R_1 = 1$ and $S_1 = 2$.
 
 No maximum value for `n` should be assumed.
 
-**References**
+**References**<p>Rosetta: <a href='https://rosettacode.org/wiki/Hofstadter_Figure-Figure_sequences' target='_blank'>Hofstadter Figure-Figure sequences</a></p>.
 
-<ul>
-  <li>
-    Sloane's <a href='https://oeis.org/A005228' target='_blank'>A005228</a> and <a href='https://oeis.org/A030124' target='_blank'>A030124</a>.
-  </li>
-  <li>
-    Wikipedia: <a href='https://en.wikipedia.org/wiki/Hofstadter_sequence#Hofstadter_Figure-Figure_sequences' title='wp: Hofstadter_sequence#Hofstadter_Figure-Figure_sequences' target='_blank'>Hofstadter Figure-Figure sequences</a>.
-  </li>
-</ul>
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
index c8ab7d438ce..27c1bdb4dba 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
@@ -1,18 +1,18 @@
 ---
 id: 59637c4d89f6786115efd814
 title: Hofstadter Q sequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 302287
 dashedName: hofstadter-q-sequence
 ---
 
 # --description--
 
-The [Hofstadter Q sequence](https://en.wikipedia.org/wiki/Hofstadter_sequence#Hofstadter_Q_sequence "wp: Hofstadter_sequence#Hofstadter_Q_sequence") is defined as:
+The Hofstadter Q sequence is defined as:
 
 $Q(1)=Q(2)=1, \\\\ Q(n)=Q\\big(n-Q(n-1)\\big)+Q\\big(n-Q(n-2)), \\quad n>2.$
 
-It is defined like the [Fibonacci sequence](https://rosettacode.org/wiki/Fibonacci sequence "Fibonacci sequence"), but whereas the next term in the Fibonacci sequence is the sum of the previous two terms, in the Q sequence the previous two terms tell you how far to go back in the Q sequence to find the two numbers to sum to make the next term of the sequence.
+It is defined like the Fibonacci sequence, but whereas the next term in the Fibonacci sequence is the sum of the previous two terms, in the Q sequence the previous two terms tell you how far to go back in the Q sequence to find the two numbers to sum to make the next term of the sequence.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md
index afac6dc5121..7ea895f730f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7eb0
-title: I before E except after C
-challengeType: 5
+title: I 在 E 之前，除了 C 之後
+challengeType: 1
 forumTopicId: 302288
 dashedName: i-before-e-except-after-c
 ---
 
 # --description--
 
-The phrase ["I before E, except after C"](https://en.wikipedia.org/wiki/I before E except after C) is a widely known mnemonic which is supposed to help when spelling English words.
+**<a href="http://www.rosettacode.org/wiki/I_before_E_except_after_C" target="_blank" rel="noopener noreferrer nofollow">"I before E, except after C"</a>** is a general rule for English language spelling. If one is unsure whether a word is spelled with the digraph `ei` or `ie`, the rhyme suggests that the correct order is `ie` unless the preceding letter is `c`, in which case it may be `ei`.
 
 Using the words provided, check if the two sub-clauses of the phrase are plausible individually:
 
@@ -21,7 +21,7 @@ Using the words provided, check if the two sub-clauses of the phrase are plausib
   </li>
 </ol>
 
-If both sub-phrases are plausible then the original phrase can be said to be plausible.
+如果兩個子短語都是合理的，則原始短語可以說是合理的。
 
 # --instructions--
 
@@ -29,49 +29,49 @@ Write a function that accepts a word and check if the word follows this rule. Th
 
 # --hints--
 
-`IBeforeExceptC` should be a function.
+`IBeforeExceptC` 應該是一個函數。
 
 ```js
 assert(typeof IBeforeExceptC == 'function');
 ```
 
-`IBeforeExceptC("receive")` should return a boolean.
+`IBeforeExceptC("receive")` 應該返回一個布爾值。
 
 ```js
 assert(typeof IBeforeExceptC('receive') == 'boolean');
 ```
 
-`IBeforeExceptC("receive")` should return `true`.
+`IBeforeExceptC("receive")` 應該返回 `true`。
 
 ```js
 assert.equal(IBeforeExceptC('receive'), true);
 ```
 
-`IBeforeExceptC("science")` should return `false`.
+`IBeforeExceptC("science")` 應該返回 `false`。
 
 ```js
 assert.equal(IBeforeExceptC('science'), false);
 ```
 
-`IBeforeExceptC("imperceivable")` should return `true`.
+`IBeforeExceptC("imperceivable")` 應該返回 `true`。
 
 ```js
 assert.equal(IBeforeExceptC('imperceivable'), true);
 ```
 
-`IBeforeExceptC("inconceivable")` should return `true`.
+`IBeforeExceptC("inconceivable")` 應該返回 `true`。
 
 ```js
 assert.equal(IBeforeExceptC('inconceivable'), true);
 ```
 
-`IBeforeExceptC("insufficient")` should return `false`.
+`IBeforeExceptC("insufficient")` 應該返回 `false`.
 
 ```js
 assert.equal(IBeforeExceptC('insufficient'), false);
 ```
 
-`IBeforeExceptC("omniscient")` should return `false`.
+`IBeforeExceptC("omniscient")` 應該返回 `false`.
 
 ```js
 assert.equal(IBeforeExceptC('omniscient'), false);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/iban.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/iban.md
index 666c50a6be8..dde7926e041 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/iban.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/iban.md
@@ -1,19 +1,19 @@
 ---
 id: 5a23c84252665b21eecc7eaf
 title: IBAN
-challengeType: 5
+challengeType: 1
 forumTopicId: 302289
 dashedName: iban
 ---
 
 # --description--
 
-The [International Bank Account Number (IBAN)](https://en.wikipedia.org/wiki/International_Bank_Account_Number) is an internationally agreed means of identifying bank accounts across national borders with a reduced risk of propagating [transcription errors](https://en.wikipedia.org/wiki/Transcription_error).
+The International Bank Account Number (IBAN) is an internationally agreed means of identifying bank accounts across national borders with a reduced risk of propagating transcription errors.
 
-The IBAN consists of up to 34 alphanumeric characters:
+The <abbr title="International Bank Account Number">IBAN</abbr> consists of up to 34 alphanumeric characters:
 
 <ul>
-  <li>first the two-letter ISO 3166-1 alpha-2 country code</li>
+  <li>first the two-letter <abbr title="International Organization for Standardization">ISO</abbr> 3166-1 alpha-2 country code</li>
   <li>then two check digits, and</li>
   <li>finally a country-specific Basic Bank Account Number (BBAN).</li>
 </ul>
@@ -95,10 +95,10 @@ function isValid(iban) {
     iban = __helpers.removeWhiteSpace(iban)
     if (!iban.match(/^[\dA-Z]+$/)) return false
     var len = iban.length
-    if (len != ibanLen[iban.substr(0,2)]) return false
-    iban = iban.substr(4) + iban.substr(0,4)
+    if (len != ibanLen[iban.substring(0,2)]) return false
+    iban = iban.substring(4) + iban.substring(0,4)
     for (var s='', i=0; i<len; i+=1) s+=parseInt(iban.charAt(i),36)
-    for (var m=s.substr(0,15)%97, s=s.substr(15); s; s=s.substr(13)) m=(m+s.substr(0,13))%97
+    for (var m=s.substring(0,15)%97, s=s.substring(15); s; s=s.substring(13)) m=(m+s.substring(0,13))%97
     return m == 1
 }
 ```
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/identity-matrix.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/identity-matrix.md
index a8465da648c..dba37b7cafa 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/identity-matrix.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/identity-matrix.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7eb1
 title: Identity matrix
-challengeType: 5
+challengeType: 1
 forumTopicId: 302290
 dashedName: identity-matrix
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/iterated-digits-squaring.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/iterated-digits-squaring.md
index bbed591151a..c64fdc125d7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/iterated-digits-squaring.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/iterated-digits-squaring.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ec1
 title: Iterated digits squaring
-challengeType: 5
+challengeType: 1
 forumTopicId: 302291
 dashedName: iterated-digits-squaring
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/jaro-distance.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/jaro-distance.md
index d348acaee73..40476e8efab 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/jaro-distance.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/jaro-distance.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ec2
 title: Jaro distance
-challengeType: 5
+challengeType: 1
 forumTopicId: 302292
 dashedName: jaro-distance
 ---
@@ -27,7 +27,7 @@ Two characters from \\(s_1\\) and \\(s_2\\) respectively, are considered *matchi
 
 Each character of \\(s_1\\) is compared with all its matching characters in \\(s_2\\) . The number of matching (but different sequence order) characters divided by 2 defines the number of *transpositions*.
 
-**Example**
+**示例**
 
 Given the strings \\(s_1\\) *DWAYNE* and \\(s_2\\) *DUANE* we find:
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/jortsort.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/jortsort.md
index 0f121b99ee4..1bb9d70e909 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/jortsort.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/jortsort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7ec4
 title: JortSort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302293
 dashedName: jortsort
 ---
 
 # --description--
 
-jortSort is a sorting toolset that makes the user do the work and guarantees efficiency because you don't have to sort ever again. It was originally presented by Jenn "Moneydollars" Schiffer at the prestigious [JSConf](https://www.youtube.com/watch?v=pj4U_W0OFoE).
+jortSort is a sorting toolset that makes the user do the work and guarantees efficiency because you don't have to sort ever again. It was originally presented by Jenn "Moneydollars" Schiffer at the prestigious JSConf2014.
 
 jortSort should be a function that takes a single array of comparable objects as its argument. It then sorts the array in ascending order and compares the sorted array to the originally provided array. If the arrays match (i.e. the original array was already sorted), the function returns true. If the arrays do not match (i.e. the original array was not sorted), the function returns false.
 
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 6e8314e204c..d7e28e5e0c4 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
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7ec5
 title: Josephus problem
-challengeType: 5
+challengeType: 1
 forumTopicId: 302294
 dashedName: josephus-problem
 ---
 
 # --description--
 
-[Josephus problem](https://en.wikipedia.org/wiki/Josephus problem) is a math puzzle with a grim description: $n$ prisoners are standing on a circle, sequentially numbered from $0$ to $n-1$.
+Josephus problem is a math puzzle with a grim description: $n$ prisoners are standing on a circle, sequentially numbered from $0$ to $n-1$.
 
 An executioner walks along the circle, starting from prisoner $0$, removing every $k$-th prisoner and killing him.
 
@@ -26,7 +26,7 @@ Which number was he?
 
 # --instructions--
 
-Write a function that takes the initial number of prisoners and 'k' as parameter and returns the number of the prisoner that survives.
+Write a function that takes the initial number of prisoners and `k` as parameters and returns the number of the prisoner that survives.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/k-d-tree.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/k-d-tree.md
index 5cb0e1f78fc..9f038dd908d 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/k-d-tree.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/k-d-tree.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ecb
 title: K-d tree
-challengeType: 5
+challengeType: 1
 forumTopicId: 302295
 dashedName: k-d-tree
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md
index 7b2530f4c62..ffef92f7819 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md
@@ -1,27 +1,27 @@
 ---
 id: 5a23c84252665b21eecc7eca
 title: Kaprekar numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 302296
 dashedName: kaprekar-numbers
 ---
 
 # --description--
 
-A positive integer is a [Kaprekar number](https://en.wikipedia.org/wiki/Kaprekar number) if:
+A positive integer is a Kaprekar number if:
 
 <ul>
   <li>It is 1, or,</li>
   <li>The decimal representation of its square may be split once into two parts consisting of positive integers which sum to the original number. </li>
 </ul>
 
-Note that a split resulting in a part consisting purely of 0s is not valid, as 0 is not considered positive.Example
+Note that a split resulting in a part consisting purely of 0s is not valid, as 0 is not considered positive.
 
-Kaprekar numbers:
+Example Kaprekar numbers:
 
 <ul>
   <li><code>2223</code> is a Kaprekar number, as <code>2223 * 2223 = 4941729</code>, <code>4941729</code> may be split to <code>494</code> and <code>1729</code>, and <code>494 + 1729 = 2223</code></li>
-  <li>The series of Kaprekar numbers is known as <a href='https://oeis.org/A006886' target='_blank'>A006886</a>, and begins as <code>1, 9, 45, 55, ...</code></li>
+  <li>The series of Kaprekar numbers is known as A006886, and begins as <code>1, 9, 45, 55, ...</code></li>
 </ul>
 
 # --instructions--
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/knapsack-problem-0-1.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/knapsack-problem-0-1.md
index 4112f63fb20..ab84dea2631 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/knapsack-problem-0-1.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/knapsack-problem-0-1.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ed1
 title: Knapsack problem/0-1
-challengeType: 5
+challengeType: 1
 forumTopicId: 323649
 dashedName: knapsack-problem0-1
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/knapsack-problem-bounded.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/knapsack-problem-bounded.md
index dfcde45510a..2af68ccd123 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/knapsack-problem-bounded.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/knapsack-problem-bounded.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ed2
 title: Knapsack problem/Bounded
-challengeType: 5
+challengeType: 1
 forumTopicId: 323652
 dashedName: knapsack-problembounded
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/knapsack-problem-continuous.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/knapsack-problem-continuous.md
index c106a4a7438..cb6879ac2d9 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/knapsack-problem-continuous.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/knapsack-problem-continuous.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ed3
 title: Knapsack problem/Continuous
-challengeType: 5
+challengeType: 1
 forumTopicId: 323654
 dashedName: knapsack-problemcontinuous
 ---
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 74e1ad8916a..62bb6116126 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
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ed4
 title: Knapsack problem/Unbounded
-challengeType: 5
+challengeType: 1
 forumTopicId: 323655
 dashedName: knapsack-problemunbounded
 ---
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 c7a4b0693de..154df0c3ee4 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
@@ -1,18 +1,18 @@
 ---
 id: 5a23c84252665b21eecc7ed5
 title: Knight's tour
-challengeType: 5
+challengeType: 1
 forumTopicId: 302297
 dashedName: knights-tour
 ---
 
 # --description--
 
-[Knight's Tour](https://en.wikipedia.org/wiki/Knight%27s_tour) Problem: You have an empty `w` \* `h` chessboard, but for a single knight on some square. The knight must perform a sequence of legal moves that result in the knight visiting every square on the chessboard exactly once. Note that it is *not* a requirement that the tour be "closed"; that is, the knight need not end within a single move of its start position.
+Knight's Tour Problem: You have an empty `width` \* `height` chessboard, but for a single knight on some square. The knight must perform a sequence of legal moves that result in the knight visiting every square on the chessboard exactly once. Note that it is *not* a requirement that the tour be "closed"; that is, the knight need not end within a single move of its start position.
 
 # --instructions--
 
-Write a function that takes `w` and `h` as parameters and returns the number of initial positions from where it is possible to achieve the task stated above.
+Write a function that takes `width` and `height` as parameters and returns the number of initial positions from where it is possible to achieve the task stated above.
 
 # --hints--
 
@@ -63,7 +63,7 @@ assert.equal(knightTour(8, 6), 48);
 ## --seed-contents--
 
 ```js
-function knightTour(w, h) {
+function knightTour(width, height) {
 
 }
 ```
@@ -71,7 +71,7 @@ function knightTour(w, h) {
 # --solutions--
 
 ```js
-function knightTour(w, h) {
+function knightTour(width, height) {
   function createBoards(rows, columns) {
     const board = [];
     const visited = [];
@@ -210,11 +210,11 @@ function knightTour(w, h) {
     [1, -2]
   ];
 
-  const [baseBoard, baseVisited] = createBoards(h, w);
+  const [baseBoard, baseVisited] = createBoards(height, width);
   fillAllowedMovesCounts(baseBoard);
   let solvedCount = 0;
-  for (let row = 0; row < h; row++) {
-    for (let column = 0; column < w; column++) {
+  for (let row = 0; row < height; row++) {
+    for (let column = 0; column < width; column++) {
       if (solveStart(baseBoard, baseVisited, row, column)) {
         solvedCount++;
       }
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/largest-int-from-concatenated-ints.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/largest-int-from-concatenated-ints.md
index f8938faa66f..91f5ba030ba 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/largest-int-from-concatenated-ints.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/largest-int-from-concatenated-ints.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7edb
 title: Largest int from concatenated ints
-challengeType: 5
+challengeType: 1
 forumTopicId: 302298
 dashedName: largest-int-from-concatenated-ints
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/last-friday-of-each-month.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/last-friday-of-each-month.md
index e8a6170f549..7ebd6a1b71a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/last-friday-of-each-month.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/last-friday-of-each-month.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7edc
 title: Last Friday of each month
-challengeType: 5
+challengeType: 1
 forumTopicId: 302299
 dashedName: last-friday-of-each-month
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/last-letter-first-letter.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/last-letter-first-letter.md
index a20f5b4df35..f6bb3eafe56 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/last-letter-first-letter.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/last-letter-first-letter.md
@@ -1,7 +1,7 @@
 ---
 id: 5e4ce2b6ac708cc68c1df25e
 title: Last letter-first letter
-challengeType: 5
+challengeType: 1
 forumTopicId: 385256
 dashedName: last-letter-first-letter
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/leap-year.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/leap-year.md
index cf41748dba4..ae2f6773c80 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/leap-year.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/leap-year.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ede
 title: Leap year
-challengeType: 5
+challengeType: 1
 forumTopicId: 302300
 dashedName: leap-year
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/least-common-multiple.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/least-common-multiple.md
index aa27446cbe9..d84da1b8b61 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/least-common-multiple.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/least-common-multiple.md
@@ -1,14 +1,16 @@
 ---
 id: 5a23c84252665b21eecc7edf
 title: Least common multiple
-challengeType: 5
+challengeType: 1
 forumTopicId: 302301
 dashedName: least-common-multiple
 ---
 
 # --description--
 
-The least common multiple of 12 and 18 is 36, because 12 is a factor (12 × 3 = 36), and 18 is a factor (18 × 2 = 36), and there is no positive integer less than 36 that has both factors. As a special case, if either *m* or *n* is zero, then the least common multiple is zero. One way to calculate the least common multiple is to iterate all the multiples of *m*, until you find one that is also a multiple of *n*. If you already have *gcd* for [greatest common divisor](https://rosettacode.org/wiki/greatest common divisor), then this formula calculates *lcm*. ( \\operatorname{lcm}(m, n) = \\frac{|m \\times n|}{\\operatorname{gcd}(m, n)} )
+The least common multiple of 12 and 18 is 36, because 12 is a factor (12 × 3 = 36), and 18 is a factor (18 × 2 = 36), and there is no positive integer less than 36 that has both factors. As a special case, if either $m$ or $n$ is zero, then the least common multiple is zero. One way to calculate the least common multiple is to iterate all the multiples of $m$, until you find one that is also a multiple of $n$. If you already have $gcd$ for <a href="https://rosettacode.org/wiki/Greatest_common_divisor" target="_blank" rel="noopener noreferrer nofollow">greatest common divisor</a>, then this formula calculates $lcm$.
+
+$$ \\operatorname{lcm}(m, n) = \\frac{|m \\times n|}{\\operatorname{gcd}(m, n)} $$
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/left-factorials.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/left-factorials.md
index 36c2761d93e..6f589d1f1e1 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/left-factorials.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/left-factorials.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ee0
 title: Left factorials
-challengeType: 5
+challengeType: 1
 forumTopicId: 302302
 dashedName: left-factorials
 ---
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 d7c0a30349b..1efeade3f64 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
@@ -1,7 +1,7 @@
 ---
 id: 5e4ce2bbac708cc68c1df25f
 title: Letter frequency
-challengeType: 5
+challengeType: 1
 forumTopicId: 385263
 dashedName: letter-frequency
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/levenshtein-distance.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/levenshtein-distance.md
index 2737ad5436a..6894c754274 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/levenshtein-distance.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/levenshtein-distance.md
@@ -1,16 +1,16 @@
 ---
 id: 5e4ce2eaac708cc68c1df260
 title: Levenshtein distance
-challengeType: 5
+challengeType: 1
 forumTopicId: 385264
 dashedName: levenshtein-distance
 ---
 
 # --description--
 
-In information theory and computer science, the **Levenshtein distance** is a [metric](https://en.wikipedia.org/wiki/string metric) for measuring the amount of difference between two sequences (i.e. an [edit distance](https://en.wikipedia.org/wiki/edit distance)). The Levenshtein distance between two strings is defined as the minimum number of edits needed to transform one string into the other, with the allowable edit operations being insertion, deletion, or substitution of a single character.
+In information theory and computer science, the **Levenshtein distance** is a metric for measuring the amount of difference between two sequences (i.e. an edit distance). The Levenshtein distance between two strings is defined as the minimum number of edits needed to transform one string into the other, with the allowable edit operations being insertion, deletion, or substitution of a single character.
 
-Example:
+例如：
 
 The Levenshtein distance between "**kitten**" and "**sitting**" is 3, since the following three edits change one into the other, and there isn't a way to do it with fewer than three edits:
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
index 0448399ccbe..9b7ff866168 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
@@ -1,14 +1,14 @@
 ---
 id: 5e4ce2f5ac708cc68c1df261
 title: Linear congruential generator
-challengeType: 5
+challengeType: 1
 forumTopicId: 385266
 dashedName: linear-congruential-generator
 ---
 
 # --description--
 
-The [linear congruential generator](https://en.wikipedia.org/wiki/linear congruential generator) is a very simple example of a [random number generator](http://rosettacode.org/wiki/random number generator). All linear congruential generators use this formula:
+A linear congruential generator (LCG) is an <em>algorithm</em> that yields a sequence of pseudo-randomized numbers calculated with a discontinuous piecewise linear equation. All linear congruential generators use this formula:
 
 $$r_{n + 1} = (a \times r_n + c) \bmod m$$
 
@@ -22,7 +22,7 @@ Where:
 
 If one chooses the values of $a$, $c$ and $m$ with care, then the generator produces a uniform distribution of integers from $0$ to $m - 1$.
 
-LCG numbers have poor quality. $r_n$ and $r\_{n + 1}$ are not independent, as true random numbers would be. Anyone who knows $r_n$ can predict $r\_{n + 1}$, therefore LCG is not cryptographically secure. The LCG is still good enough for simple tasks like [Miller-Rabin primality test](http://rosettacode.org/wiki/Miller-Rabin primality test), or [FreeCell deals](http://rosettacode.org/wiki/deal cards for FreeCell). Among the benefits of the LCG, one can easily reproduce a sequence of numbers, from the same $r_0$. One can also reproduce such sequence with a different programming language, because the formula is so simple.
+<abbr title="linear congruential generator">LCG</abbr> numbers have poor quality. $r_n$ and $r\_{n + 1}$ are not independent, as true random numbers would be. Anyone who knows $r_n$ can predict $r\_{n + 1}$, therefore <abbr title="linear congruential generator">LCG</abbr> is not cryptographically secure. The <abbr title="linear congruential generator">LCG</abbr> is still good enough for simple tasks like Miller-Rabin primality test, or FreeCell deals. Among the benefits of the <abbr title="linear congruential generator">LCG</abbr>, one can easily reproduce a sequence of numbers, from the same $r_0$. One can also reproduce such sequence with a different programming language, because the formula is so simple.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/long-multiplication.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/long-multiplication.md
index fb4e2456cf3..174bde82794 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/long-multiplication.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/long-multiplication.md
@@ -1,14 +1,14 @@
 ---
 id: 5e4ce2a1ac708cc68c1df25d
 title: Long multiplication
-challengeType: 5
+challengeType: 1
 forumTopicId: 385269
 dashedName: long-multiplication
 ---
 
 # --description--
 
-Explicitly implement [long multiplication](https://en.wikipedia.org/wiki/long multiplication).
+Explicitly implement long multiplication.
 
 This is one possible approach to arbitrary-precision integer algebra.
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
index b027a10f5ea..5b4f0d4c1d3 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
@@ -1,29 +1,23 @@
 ---
 id: 5e6dd1278e6ca105cde40ea9
 title: Longest common subsequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 385271
 dashedName: longest-common-subsequence
 ---
 
 # --description--
 
-The **longest common subsequence** (or [**LCS**](http://en.wikipedia.org/wiki/Longest_common_subsequence_problem)) of groups A and B is the longest group of elements from A and B that are common between the two groups and in the same order in each group. For example, the sequences "1234" and "1224533324" have an LCS of "1234":
+The **longest common subsequence** (or **LCS**) of groups A and B is the longest group of elements from A and B that are common between the two groups and in the same order in each group. For example, the sequences `1234` and `1224533324` have an LCS of `1234`:<u>1234</u>
+<u>12</u>245<u>3</u>332<u>4</u>
 
-***1234***
+For a string example, consider the sequences `thisisatest` and `testing123testing`. An LCS would be `tsitest`:
+<u>t</u>hi<u>si</u>sa<u>test</u>
 
-***12***245***3***332***4***
-
-For a string example, consider the sequences "thisisatest" and "testing123testing". An LCS would be "tsitest":
-
-***t***hi***si***sa***test***
-
-***t***e***s***t***i***ng123***test***ing.
+<u>t</u>e<u>s</u>t<u>i</u>ng123<u>test</u>ing.
 
 Your code only needs to deal with strings.
 
-For more information on this problem please see [Wikipedia](https://en.wikipedia.org/wiki/Longest_common_subsequence_problem).
-
 # --instructions--
 
 Write a case-sensitive function that returns the LCS of two strings. You don't need to show multiple LCS's.
@@ -86,8 +80,8 @@ function lcs(a, b) {
 
 ```js
 function lcs(a, b) {
-  var aSub = a.substr(0, a.length - 1);
-  var bSub = b.substr(0, b.length - 1);
+  var aSub = a.substring(0, a.length - 1);
+  var bSub = b.substring(0, b.length - 1);
 
   if (a.length === 0 || b.length === 0) {
     return '';
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md
index 0ba5661f6c8..0cd96a6d6cc 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md
@@ -1,7 +1,7 @@
 ---
 id: 5e6dd139859c290b6ab80292
 title: Longest increasing subsequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 385272
 dashedName: longest-increasing-subsequence
 ---
@@ -12,14 +12,14 @@ The longest increasing subsequence problem is to find a subsequence of a given s
 
 For the following array:
 
-$\\{3, 10, 2, 1, 20\\}$
+```js
+const array = [3, 10, 2, 1, 20];
+```
 
 Longest increasing sequence is:
 
 $\\{3, 10, 20\\}$
 
-For more information on this problem please see [Wikipedia](https://en.wikipedia.org/wiki/Longest increasing subsequence).
-
 # --instructions--
 
 Write a function that takes an array of numbers as a parameter and returns the longest increasing subsequence.
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/longest-string-challenge.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/longest-string-challenge.md
index 06a0c9d5503..f4bedb96bcc 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/longest-string-challenge.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/longest-string-challenge.md
@@ -1,7 +1,7 @@
 ---
 id: 5e6dd14192286d95fc43046e
 title: Longest string challenge
-challengeType: 5
+challengeType: 1
 forumTopicId: 385275
 dashedName: longest-string-challenge
 ---
@@ -28,7 +28,7 @@ assert(typeof longestString == 'function');
 assert(Array.isArray(longestString(['a', 'bb', 'ccc', 'ee', 'f', 'ggg'])));
 ```
 
-`longestString(["a", "bb", "ccc", "ee", "f", "ggg"])` should return `["ccc", "ggg"]'`.
+`longestString(["a", "bb", "ccc", "ee", "f", "ggg"])` should return `["ccc", "ggg"]`.
 
 ```js
 assert.deepEqual(longestString(['a', 'bb', 'ccc', 'ee', 'f', 'ggg']), [
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md
index ed09269a091..464d824a0c9 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md
@@ -1,14 +1,14 @@
 ---
 id: 5e6dd14797f5ce267c2f19d0
 title: Look-and-say sequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 385277
 dashedName: look-and-say-sequence
 ---
 
 # --description--
 
-The [Look and say sequence](https://en.wikipedia.org/wiki/Look and say sequence) is a recursively defined sequence of numbers.
+The Look and say sequence is a recursively defined sequence of numbers.
 
 Sequence Definition
 
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 e8924ccd287..d0bd62b8726 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
@@ -1,7 +1,7 @@
 ---
 id: 5e6dd15004c88cf00d2a78b3
 title: Loop over multiple arrays simultaneously
-challengeType: 5
+challengeType: 1
 forumTopicId: 385279
 dashedName: loop-over-multiple-arrays-simultaneously
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/lu-decomposition.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/lu-decomposition.md
index 1b2442f3056..45759df22aa 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/lu-decomposition.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/lu-decomposition.md
@@ -1,20 +1,20 @@
 ---
 id: 5e6decd8ec8d7db960950d1c
 title: LU decomposition
-challengeType: 5
+challengeType: 1
 forumTopicId: 385280
 dashedName: lu-decomposition
 ---
 
 # --description--
 
-Every square matrix $A$ can be decomposed into a product of a lower triangular matrix $L$ and a upper triangular matrix $U$, as described in [LU decomposition](https://en.wikipedia.org/wiki/LU decomposition).
+Every square matrix $A$ can be decomposed into a product of a lower triangular matrix $L$ and a upper triangular matrix $U$. This is known as the LU decomposition.
 
 $A = LU$
 
 It is a modified form of Gaussian elimination.
 
-While the [Cholesky decomposition](http://rosettacode.org/wiki/Cholesky decomposition) only works for symmetric, positive definite matrices, the more general LU decomposition works for any square matrix.
+While the Cholesky decomposition only works for symmetric, positive definite matrices, the more general LU decomposition works for any square matrix.
 
 There are several algorithms for calculating $L$ and $U$.
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/lucas-lehmer-test.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/lucas-lehmer-test.md
index 83d3d2bbfaf..e909f6b3f6a 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/lucas-lehmer-test.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/lucas-lehmer-test.md
@@ -1,7 +1,7 @@
 ---
 id: 5e6dee7749a0b85a3f1fc7d5
 title: Lucas-Lehmer test
-challengeType: 5
+challengeType: 1
 forumTopicId: 385281
 dashedName: lucas-lehmer-test
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/ludic-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/ludic-numbers.md
index 0e7be774f58..41cb6b3e80c 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/ludic-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/ludic-numbers.md
@@ -1,22 +1,22 @@
 ---
 id: 5ea281203167d2b0bdefca00
-title: Ludic numbers
-challengeType: 5
+title: 盧迪數
+challengeType: 1
 forumTopicId: 385282
 dashedName: ludic-numbers
 ---
 
 # --description--
 
-[Ludic numbers](https://oeis.org/wiki/Ludic_numbers) are related to prime numbers as they are generated by a sieve quite like the [Sieve of Eratosthenes](https://rosettacode.org/wiki/Sieve_of_Eratosthenes) is used to generate prime numbers.
+Ludic numbers are related to prime numbers as they are generated by a sieve quite like the Sieve of Eratosthenes is used to generate prime numbers.
 
-The first ludic number is 1.
+第一個 ludic 數字是 1。
 
-To generate succeeding ludic numbers create an array of increasing integers starting from 2.
+要生成連續的 ludic 數字，請創建一個從 2 開始遞增的整數數組。
 
 <code style='margin-left: 2em;'><span style='color:blue;font-weight:bold'>2</span> 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 ...</code>
 
-(Loop)
+（循環）
 
 <ul>
   <li>Take the first member of the resultant array as the next ludic number <span style='color:blue;font-weight:bold'>2</span>.</li>
@@ -56,43 +56,43 @@ Write a function that returns all the ludic numbers less than or equal to the gi
 
 # --hints--
 
-`ludic` should be a function.
+`ludic`應該是一個函數。
 
 ```js
 assert(typeof ludic === 'function', '<code>ludic</code> should be a function.');
 ```
 
-`ludic(2)` should return a array.
+`ludic(2)` 應該返回一個數組。
 
 ```js
 assert(Array.isArray(ludic(2)));
 ```
 
-`ludic(2)` should return `[1, 2]`.
+`ludic(2)` 應該返回 `[1, 2]`.
 
 ```js
 assert.deepEqual(ludic(2), [1, 2]);
 ```
 
-`ludic(3)` should return `[1, 2, 3]`.
+`ludic(3)` 返回數組 `[1, 2, 3]`.
 
 ```js
 assert.deepEqual(ludic(3), [1, 2, 3]);
 ```
 
-`ludic(5)` should return `[1, 2, 3, 5]`.
+`ludic(5)` 返回數組 `[1, 2, 3, 5]`.
 
 ```js
 assert.deepEqual(ludic(5), [1, 2, 3, 5]);
 ```
 
-`ludic(20)` should return `[1, 2, 3, 5, 7, 11, 13, 17]`.
+`ludic(20)` 返回數組 `[1, 2, 3, 5, 7, 11, 13, 17]`。
 
 ```js
 assert.deepEqual(ludic(20), [1, 2, 3, 5, 7, 11, 13, 17]);
 ```
 
-`ludic(26)` should return `[1, 2, 3, 5, 7, 11, 13, 17, 23, 25]`.
+`ludic(26)`返回數組`[1, 2, 3, 5, 7, 11, 13, 17, 23, 25]`.
 
 ```js
 assert.deepEqual(ludic(26), [1, 2, 3, 5, 7, 11, 13, 17, 23, 25]);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md
index 4fcc90502ab..49fa7532a67 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 5ea28156e79528a9ab248f27
 title: Luhn test of credit card numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 385284
 dashedName: luhn-test-of-credit-card-numbers
 ---
 
 # --description--
 
-The [Luhn test](https://en.wikipedia.org/wiki/Luhn algorithm) is used by some credit card companies to distinguish valid credit card numbers from what could be a random selection of digits.
+The Luhn test is used by some credit card companies to distinguish valid credit card numbers from what could be a random selection of digits.
 
 Those companies using credit card numbers that can be validated by the Luhn test have numbers that pass the following test:
 
@@ -44,7 +44,7 @@ s1 + s2 = 70 which ends in zero which means that 49927398716 passes the Luhn tes
 
 # --instructions--
 
-Write a function that will validate a number with the Luhn test. Return true if it's a valid number. Otherwise, return false.
+Write a function that will validate a number with the Luhn test. Return true if it's a valid number. 否則，返回 false。
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/lychrel-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/lychrel-numbers.md
index 5ffc202ebd9..120d7292e67 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/lychrel-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/lychrel-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5ea2815a8640bcc6cb7dab3c
 title: Lychrel numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 385287
 dashedName: lychrel-numbers
 ---
@@ -64,7 +64,7 @@ Because of this we can further split the Lychrel numbers into true **Seed** Lych
 
 # --instructions--
 
-Write a function that takes a number as a parameter. Return true if the number is a Lynchrel number. Otherwise, return false. Remember that the iteration limit is 500.
+Write a function that takes a number as a parameter. Return true if the number is a Lynchrel number. 否則，返回 false。 Remember that the iteration limit is 500.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/lzw-compression.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/lzw-compression.md
index ccde98aa946..e4aa0f6e571 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/lzw-compression.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/lzw-compression.md
@@ -1,7 +1,7 @@
 ---
 id: 5ea2815e364d9a2222ea55f8
 title: LZW compression
-challengeType: 5
+challengeType: 1
 forumTopicId: 385288
 dashedName: lzw-compression
 ---
@@ -10,8 +10,6 @@ dashedName: lzw-compression
 
 The Lempel-Ziv-Welch (LZW) algorithm provides loss-less data compression.
 
-You can read a complete description of it in the [Wikipedia article](https://en.wikipedia.org/wiki/Lempel-Ziv-Welch) on the subject.
-
 # --instructions--
 
 Write a function that takes two parameters. The first parameter is a boolean where `true` indicates compress and `false` indicates decompress. The second parameter is either a string or an array to be processed. If it is a string to be compressed, return an array of numbers. If it's an array of numbers to be decompressed, return a string.
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 19304897ae8..61d380a77e9 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
@@ -1,14 +1,14 @@
 ---
 id: 59667989bf71cf555dd5d2ff
-title: S-Expressions
-challengeType: 5
+title: S-表達式
+challengeType: 1
 forumTopicId: 302303
 dashedName: s-expressions
 ---
 
 # --description--
 
-[S-Expressions](https://en.wikipedia.org/wiki/S-Expression "wp: S-Expression") are one convenient way to parse and store data.
+<a href="https://rosettacode.org/wiki/S-expressions" target="_blank" rel="noopener noreferrer nofollow">S-Expressions</a> are one convenient way to parse and store data.
 
 # --instructions--
 
@@ -24,25 +24,25 @@ Handling escaped quotes inside a string is optional; thus "`(foo"bar)`" may be t
 
 For this, the reader need not recognize `\` for escaping, but should, in addition, recognize numbers if the language has appropriate data types.
 
-Note that with the exception of `()"` (`\` if escaping is supported) and whitespace, there are no special characters. Anything else is allowed without quotes.
+Note that with the exception of `()"` (`\` if escaping is supported) and whitespace, there are no special characters. 其他任何內容都是允許的，不帶引號。
 
-The reader should be able to read the following input
+讀者應該能夠閱讀以下輸入
 
 <pre>((data "quoted data" 123 4.5)
 (data (!@# (4.5) "(more" "data)")))
 </pre>
 
-and turn it into a native data structure. (See the [Pike](https://rosettacode.org/wiki/S-Expressions#Pike "\#Pike"), [Python](https://rosettacode.org/wiki/S-Expressions#Python "\#Python") and [Ruby](https://rosettacode.org/wiki/S-Expressions#Ruby "\#Ruby") implementations for examples of native data structures.)
+and turn it into a native data structure.
 
 # --hints--
 
-`parseSexpr` should be a function.
+`parseSexpr` 是一個函數。
 
 ```js
 assert(typeof parseSexpr === 'function');
 ```
 
-`parseSexpr('(data1 data2 data3)')` should return `['data1', 'data2', 'data3']`
+`parseSexpr('(data1 data2 data3)')` 應該返回 `['data1', 'data2', 'data3']`
 
 ```js
 assert.deepEqual(parseSexpr(simpleSExpr), simpleSolution);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
index ec8a0c6e2db..8117215835e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
@@ -1,23 +1,24 @@
 ---
 id: 59da22823d04c95919d46269
 title: 'Sailors, coconuts and a monkey problem'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302304
 dashedName: sailors-coconuts-and-a-monkey-problem
 ---
 
 # --description--
 
-Five sailors are shipwrecked on an island and collect a large pile of coconuts during the day. That night the first sailor wakes up and decides to take his first share early so tries to divide the pile of coconuts equally into five piles but finds that there is one coconut left over, so he tosses it to a monkey and then hides "his" one of the five equally sized piles of coconuts and pushes the other four piles together to form a single visible pile of coconuts again and goes to bed. To cut a long story short, each of the sailors in turn gets up once during the night and performs the same actions of dividing the coconut pile into five, finding that one coconut is left over and giving that single remainder coconut to the monkey. In the morning (after the surreptitious and separate action of each of the five sailors during the night), the remaining coconuts are divided into five equal piles for each of the sailors, whereupon it is found that the pile of coconuts divides equally amongst the sailors with no remainder. (Nothing for the monkey in the morning.)
+Five sailors are shipwrecked on an island and collect a large pile of coconuts during the day.
+
+That night the first sailor wakes up and decides to take his first share early so tries to divide the pile of coconuts equally into five piles but finds that there is one coconut left over, so he tosses it to a monkey and then hides "his" one of the five equally sized piles of coconuts and pushes the other four piles together to form a single visible pile of coconuts again and goes to bed.
+
+To cut a long story short, each of the sailors in turn gets up once during the night and performs the same actions of dividing the coconut pile into five, finding that one coconut is left over and giving that single remainder coconut to the monkey, then push the other four piles together to form a single pile.
+
+In the morning (after the surreptitious and separate action of each of the five sailors during the night), the remaining coconuts are divided into five equal piles for each of the sailors, whereupon it is found that the pile of coconuts divides equally amongst the sailors with no remainder. (Nothing for the monkey in the morning.)
 
 # --instructions--
 
-Create a function that returns the minimum possible size of the initial pile of coconuts collected during the day for `N` sailors. **Note:** Of course the tale is told in a world where the collection of any amount of coconuts in a day and multiple divisions of the pile, etc. can occur in time fitting the story line, so as not to affect the mathematics. **C.f:**
-
-<ul>
-  <li><a href="https://www.youtube.com/watch?v=U9qU20VmvaU" target="_blank"> Monkeys and Coconuts - Numberphile</a> (Video) Analytical solution.</li>
-  <li><a href="https://oeis.org/A002021" target="_blank">A002021 Pile of coconuts problem</a> The On-Line Encyclopedia of Integer Sequences. (Although some of its references may use the alternate form of the tale).</li>
-</ul>
+Create a function that returns the minimum possible size of the initial pile of coconuts collected during the day for `N` sailors. **Note:** Of course the tale is told in a world where the collection of any number of coconuts in a day and multiple divisions of the pile, etc. can occur in time fitting the story line, so as not to affect mathematics.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/search-a-list-of-records.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/search-a-list-of-records.md
index f4fa1a4452e..439ece2740e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/search-a-list-of-records.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/search-a-list-of-records.md
@@ -1,7 +1,7 @@
 ---
 id: 5eb3e497b8d6d7f63c5517ea
 title: Search a list of records
-challengeType: 5
+challengeType: 1
 forumTopicId: 385315
 dashedName: search-a-list-of-records
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sedols.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sedols.md
index 9d5ce33e9d3..9ace124614e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sedols.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sedols.md
@@ -1,14 +1,16 @@
 ---
 id: 59d9c6bc214c613ba73ff012
 title: SEDOLs
-challengeType: 5
+challengeType: 1
 forumTopicId: 302305
 dashedName: sedols
 ---
 
 # --description--
 
-For each number list of 6-digit [SEDOL](https://en.wikipedia.org/wiki/SEDOL "wp: SEDOL")s, calculate and append the checksum digit. That is, given the input string on the left, your function should return the corresponding string on the right:
+<abbr title="Stock Exchange Daily Official List">SEDOL</abbr> is a list of securities identification numbers issued by the London Stock Exchange.
+
+For each number list of 6-digit <abbr title="Stock Exchange Daily Official List">SEDOL</abbr>s, calculate and append the checksum digit. That is, given the input string on the left, your function should return the corresponding string on the right:
 
 <pre>
 710889 => 7108899
@@ -64,8 +66,9 @@ assert(sedol('228276') === '2282765');
 
 ```js
 function sedol(input) {
+  const checkSum = 0
 
-  return true;
+  return checkSum;
 }
 ```
 
@@ -90,7 +93,7 @@ function sedolCheckDigit(char6) {
   for (let i = 0; i < char6.length; i++) {
     sum += weight[i] * parseInt(char6.charAt(i), 36);
   }
-  const check = (10 - (sum % 10)) % 10;
-  return check.toString();
+  const checkSum = (10 - (sum % 10)) % 10;
+  return checkSum.toString();
 }
 ```
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/self-describing-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
index df2a88508fb..760b24edd04 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 5eaf48389ee512d4d103684b
 title: Self Describing Numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 385289
 dashedName: self-describing-numbers
 ---
 
 # --description--
 
-There are several so-called "self describing" or ["self-descriptive"](https://en.wikipedia.org/wiki/Self-descriptive_number) integers.
+There are several so-called "self-describing" or "self-descriptive" integers.
 
 An integer is said to be "self-describing" if it has the property that, when digit positions are labeled 0 to N-1, the digit in each position is equal to the number of times that digit appears in the number.
 
@@ -25,7 +25,7 @@ Self-describing numbers &lt; 100,000,000 are: 1210, 2020, 21200, 3211000, 421010
 
 # --instructions--
 
-Write a function that takes a positive integer as a parameter. If it is self-describing return true. Otherwise, return false.
+Write a function that takes a positive integer as a parameter. If it is self-describing return true. 否則，返回 false。
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/self-referential-sequence.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/self-referential-sequence.md
index 11beda8ba0b..086840b687f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/self-referential-sequence.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/self-referential-sequence.md
@@ -1,14 +1,14 @@
 ---
 id: 5eb3e4a21f462f409d656c73
 title: Self-referential sequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 385317
 dashedName: self-referential-sequence
 ---
 
 # --description--
 
-There are several ways to generate a self-referential sequence. One very common one (the [Look-and-say sequence](https://rosettacode.org/wiki/Look-and-say sequence)) is to start with a positive integer, then generate the next term by concatenating enumerated groups of adjacent alike digits:
+There are several ways to generate a self-referential sequence. One very common one (the <a href="https://rosettacode.org/wiki/Look-and-say_sequence" target="_blank" rel="noopener noreferrer nofollow">Look-and-say sequence</a>) is to start with a positive integer, then generate the next term by concatenating enumerated groups of adjacent alike digits:
 
 <pre>0, 10, 1110, 3110, 132110, 1113122110, 311311222110 ...</pre>
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/semiprime.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/semiprime.md
index 961f13632fd..590e77332ef 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/semiprime.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/semiprime.md
@@ -1,14 +1,14 @@
 ---
 id: 5eb3e4aa847216613aa81983
 title: Semiprime
-challengeType: 5
+challengeType: 1
 forumTopicId: 385318
 dashedName: semiprime
 ---
 
 # --description--
 
-Semiprime numbers are natural numbers that are products of exactly two (possibly equal) [prime numbers](https://rosettacode.org/wiki/prime_number).
+Semiprime numbers are natural numbers that are products of exactly two (possibly equal) <a href="https://rosettacode.org/wiki/prime_number" target="_blank" rel="noopener noreferrer nofollow">prime numbers</a>.
 
 <pre>1679  =  23 x 73</pre>
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/set-consolidation.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/set-consolidation.md
index 3a97b090b37..07a585e0875 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/set-consolidation.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/set-consolidation.md
@@ -1,7 +1,7 @@
 ---
 id: 5eb3e4af7d0e7b760b46cedc
 title: Set consolidation
-challengeType: 5
+challengeType: 1
 forumTopicId: 385319
 dashedName: set-consolidation
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/set-of-real-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/set-of-real-numbers.md
index 7633b59b8a4..addfc4c751b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/set-of-real-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/set-of-real-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5eb3e4b20aa93c437f9e9717
 title: Set of real numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 385322
 dashedName: set-of-real-numbers
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sha-1.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sha-1.md
index e28fca38d70..e62f9f681ad 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sha-1.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sha-1.md
@@ -1,7 +1,7 @@
 ---
 id: 5eb3e4b5f629b9a07429a5d2
 title: SHA-1
-challengeType: 5
+challengeType: 1
 forumTopicId: 385326
 dashedName: sha-1
 ---
@@ -16,7 +16,7 @@ BitTorrent 使用 SHA-1 來驗證下載內容。
 
 Git 和 Mercurial 使用 SHA-1 摘要來覈驗提交內容。
 
-美國政府標準 [FIPS 180-1](https://rosettacode.org/wiki/SHA-1/FIPS-180-1) 了定義 SHA-1。
+A US government standard, <a href="https://rosettacode.org/wiki/SHA-1/FIPS-180-1" target="_blank" rel="noopener noreferrer nofollow">FIPS 180-1</a>, defines SHA-1.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sort-an-array-of-composite-structures.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sort-an-array-of-composite-structures.md
index e2a4065371e..124644791f7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sort-an-array-of-composite-structures.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sort-an-array-of-composite-structures.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ffe
 title: Sort an array of composite structures
-challengeType: 5
+challengeType: 1
 forumTopicId: 302306
 dashedName: sort-an-array-of-composite-structures
 ---
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 b6647f28247..8f1ef877e53 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
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8000
 title: Sort disjoint sublist
-challengeType: 5
+challengeType: 1
 forumTopicId: 302307
 dashedName: sort-disjoint-sublist
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sort-stability.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sort-stability.md
index 3f57407b6af..0820e0c2d77 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sort-stability.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sort-stability.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8014
 title: Sort stability
-challengeType: 5
+challengeType: 1
 forumTopicId: 302308
 dashedName: sort-stability
 ---
 
 # --description--
 
-When sorting records in a table by a particular column or field, a [stable sort](https://en.wikipedia.org/wiki/Stable_sort#Stability) will always retain the relative order of records that have the same key.
+When sorting records in a table by a particular column or field, a <a href="https://www.freecodecamp.org/news/stability-in-sorting-algorithms-a-treatment-of-equality-fa3140a5a539/" target="_blank" rel="noopener noreferrer nofollow">stable sort</a> will always retain the relative order of records that have the same key.
 
 For example, in this table of countries and cities, a stable sort on the **second** column, the cities, would keep the US Birmingham above the UK Birmingham. (Although an unstable sort *might*, in this case, place the US Birmingham above the UK Birmingham, a stable sort routine would *guarantee* it).
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sort-using-a-custom-comparator.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sort-using-a-custom-comparator.md
index e7e7919d0be..175dd475233 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sort-using-a-custom-comparator.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sort-using-a-custom-comparator.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8016
 title: Sort using a custom comparator
-challengeType: 5
+challengeType: 1
 forumTopicId: 302309
 dashedName: sort-using-a-custom-comparator
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md
index 02b836f4de3..302bb1e6654 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md
@@ -1,20 +1,20 @@
 ---
 id: 5a23c84252665b21eecc8001
 title: Sorting algorithms/Bead sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302310
 dashedName: sorting-algorithmsbead-sort
 ---
 
 # --description--
 
-Sort an array of positive integers using the [Bead Sort Algorithm](https://en.wikipedia.org/wiki/Bead_sort).
+A *bead sort* starts by creating a matrix of zeroes whose length is equal to the value of the largest element in the input array. The matrix is transformed by adding one to all elements between the zeroth index and the index indicated by the current element. This process is repeated, until you have filled the matrix.
 
-A *bead sort* is also known as a *gravity sort*.
+Iterating over the matrix, summing the number of elements greater than zero, then decreasing the value of each element by one yields the sorted array.
 
-The algorithm has O(S), where S is the sum of the integers in the input set: Each bead is moved individually.
+**Note:** Each element in the input array is unique.
 
-This is the case when bead sort is implemented without a mechanism to assist in finding empty spaces below the beads, such as in software implementations.
+Sort an array of positive integers using the Bead Sort Algorithm.
 
 # --hints--
 
@@ -90,31 +90,31 @@ function beadSort(arr) {
 
 ```js
 function beadSort(arr) {
-  var max = 0;
-  for (var i = 0; i < arr.length; i++) if (arr[i] > max) max = arr[i];
-  var grid = new Array(arr.length);
-  for (var i = 0; i < grid.length; i++) {
+  let max = 0;
+  for (let i = 0; i < arr.length; i++) if (arr[i] > max) max = arr[i];
+  const grid = new Array(arr.length);
+  for (let i = 0; i < grid.length; i++) {
     grid[i] = new Array(max);
   }
-  var levelcount = new Array(max);
+  const levelcount = new Array(max);
   levelcount.fill(0);
-  for (var i = 0; i < max; i++) {
+  for (let i = 0; i < max; i++) {
     levelcount[i] = 0;
-    for (var j = 0; j < arr.length; j++) grid[j][i] = '_';
+    for (let j = 0; j < arr.length; j++) grid[j][i] = '_';
   }
-  for (var i = 0; i < arr.length; i++) {
-    var num = arr[i];
-    for (var j = 0; num > 0; j++) {
+  for (let i = 0; i < arr.length; i++) {
+    let num = arr[i];
+    for (let j = 0; num > 0; j++) {
       grid[levelcount[j]++][j] = '*';
       num--;
     }
   }
-  var sorted = new Array(arr.length);
+  const sorted = new Array(arr.length);
   sorted.fill(0);
-  for (var i = 0; i < arr.length; i++) {
-    var putt = 0;
+  for (let i = 0; i < arr.length; i++) {
+    let putt = 0;
     for (
-      var j = 0;
+      let j = 0;
       j < max &&
       (function(c) {
         return c.charCodeAt == null ? c : c.charCodeAt(0);
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md
index 2a7b74b5e3a..687dcefb55b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8002
 title: Sorting algorithms/Bogosort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302311
 dashedName: sorting-algorithmsbogosort
 ---
 
 # --description--
 
-[Bogosort](https://en.wikipedia.org/wiki/Bogosort) a list of numbers.
+Bogosort a list of numbers.
 
 Bogosort simply shuffles a collection randomly until it is sorted.
 
@@ -18,7 +18,7 @@ Its average run-time is O(n!) because the chance that any given shuffle of a set
 
 Its best case is O(n) since a single pass through the elements may suffice to order them.
 
-Pseudocode:
+僞代碼：
 
 <pre><b>while not</b> InOrder(list) <b>do</b>
   Shuffle(list)
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
index f4c1b63f681..9f8a3bcb821 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
@@ -1,36 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8004
 title: Sorting algorithms/Cocktail sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302312
 dashedName: sorting-algorithmscocktail-sort
 ---
 
 # --description--
 
-The cocktail shaker sort is an improvement on the [Bubble Sort](https://rosettacode.org/wiki/Bubble Sort). The improvement is basically that values "bubble" both directions through the array, because on each iteration the cocktail shaker sort bubble sorts once forwards and once backwards. Pseudocode for the algorithm (from [wikipedia](https://en.wikipedia.org/wiki/Cocktail sort)):
-
-<pre><b>function</b> <i>cocktailSort</i>( A : list of sortable items )
-  <b>do</b>
-    swapped := false
-    <b>for each</b> i <b>in</b> 0 <b>to</b> length( A ) - 2 <b>do</b>
-      <b>if</b> A[ i ] > A[ i+1 ] <b>then</b> <i>// test whether the two</i>
-                                <i>// elements are in the wrong</i>
-                                <i>// order</i>
-        swap( A[ i ], A[ i+1 ] ) <i>// let the two elements</i>
-                                 <i>// change places</i>
-        swapped := true;
-    <b>if</b> swapped = false <b>then</b>
-      <i>// we can exit the outer loop here if no swaps occurred.</i>
-      <b>break do-while loop</b>;
-    swapped := false
-    <b>for each</b> i <b>in</b> length( A ) - 2 <b>down to</b> 0 <b>do</b>
-      <b>if</b> A[ i ] > A[ i+1 ] <b>then</b>
-        swap( A[ i ], A[ i+1 ] )
-        swapped := true;
-  <b>while</b> swapped; <i>// if no elements have been swapped,</i>
-                <i>// then the list is sorted</i>
-</pre>
+The <a href="https://rosettacode.org/wiki/Sorting_algorithms/Cocktail_sort" target="_blank" rel="noopener noreferrer nofollow">cocktail sort</a> is an improvement on the Bubble Sort. Given an array of numbers, the cocktail sort will traverse the array from start to finish, moving the largest number to the end. Then, it will traverse the array backwards and move the smallest number to the start. It repeats these two passes, moving the next largest/smallest number to its correct position in the array until it is sorted.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
index 472ce20af5a..5f19360a31f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8005
 title: Sorting algorithms/Comb sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302313
 dashedName: sorting-algorithmscomb-sort
 ---
@@ -10,20 +10,14 @@ dashedName: sorting-algorithmscomb-sort
 
 Implement a *comb sort*.
 
-The **Comb Sort** is a variant of the [Bubble Sort](https://rosettacode.org/wiki/Bubble Sort).
+The **Comb Sort** is a variant of the Bubble Sort.
 
-Like the [Shell sort](https://rosettacode.org/wiki/Shell sort), the Comb Sort increases the gap used in comparisons and exchanges.
+Like the Shell sort, the Comb Sort increases the gap used in comparisons and exchanges.
 
 Dividing the gap by $(1-e^{-\\varphi})^{-1} \\approx 1.247330950103979$ works best, but 1.3 may be more practical.
 
 Some implementations use the insertion sort once the gap is less than a certain amount.
 
-**Also see**
-
-<ul>
-  <li>the Wikipedia article: <a href='https://en.wikipedia.org/wiki/Comb sort' target='_blank'>Comb sort</a>.</li>
-</ul>
-
 Variants:
 
 <ul>
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
index e3162404d9b..c0315d5275f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8007
 title: Sorting algorithms/Gnome sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302314
 dashedName: sorting-algorithmsgnome-sort
 ---
 
 # --description--
 
-Gnome sort is a sorting algorithm which is similar to [Insertion sort](https://rosettacode.org/wiki/Insertion sort), except that moving an element to its proper place is accomplished by a series of swaps, as in [Bubble Sort](https://rosettacode.org/wiki/Bubble Sort).
+Gnome sort is a sorting algorithm which is similar to <a href="https://rosettacode.org/wiki/Insertion_sort" target="_blank" rel="noopener noreferrer nofollow">Insertion sort</a>, except that moving an element to its proper place is accomplished by a series of swaps, as in <a href="https://rosettacode.org/wiki/Bubble" target="_blank" rel="noopener noreferrer nofollow">Bubble Sort</a>.
 
 The pseudocode for the algorithm is:
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md
index f107df7b79a..f93ad1aac07 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc800b
 title: Sorting algorithms/Pancake sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302315
 dashedName: sorting-algorithmspancake-sort
 ---
 
 # --description--
 
-Write a function to sort an array of integers (of any convenient size) into ascending order using [Pancake sorting](https://en.wikipedia.org/wiki/Pancake sorting). The function should return the sorted array.
+Write a function to sort an array of integers (of any convenient size) into ascending order using Pancake sorting. The function should return the sorted array.
 
 In short, instead of individual elements being sorted, the only operation allowed is to "flip" one end of the list, like so:
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-permutation-sort.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-permutation-sort.md
index d5fc1e3b083..ab66b45d76c 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-permutation-sort.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-permutation-sort.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc800c
 title: Sorting algorithms/Permutation sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302316
 dashedName: sorting-algorithmspermutation-sort
 ---
@@ -10,7 +10,7 @@ dashedName: sorting-algorithmspermutation-sort
 
 Write a function to implement a permutation sort, which proceeds by generating the possible permutations of the input array until discovering the sorted one. The function should return the sorted array.
 
-Pseudocode:
+僞代碼：
 
 <pre><b>while not</b> InOrder(list) <b>do</b>
   nextPermutation(list)
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md
index 09403447320..53f76a0a3a2 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8010
 title: Sorting algorithms/Shell sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302317
 dashedName: sorting-algorithmsshell-sort
 ---
 
 # --description--
 
-Write a function to sort an array of elements using the [Shell sort](https://en.wikipedia.org/wiki/Shell sort) algorithm, a diminishing increment sort. The function should return the sorted array.
+Write a function to sort an array of elements using the Shell sort algorithm, a diminishing increment sort. The function should return the sorted array.
 
 The Shell sort (also known as Shellsort or Shell's method) is named after its inventor, Donald Shell, who published the algorithm in 1959.
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md
index ec108886c1f..23819a80eb9 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8012
 title: Sorting algorithms/Stooge sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302318
 dashedName: sorting-algorithmsstooge-sort
 ---
 
 # --description--
 
-Write a function to perform [Stooge Sort](https://en.wikipedia.org/wiki/Stooge sort) on an array of integers. The function should return a sorted array.
+Write a function to perform Stooge Sort on an array of integers. The function should return a sorted array.
 
 The Stooge Sort algorithm is as follows:
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
index d8408782db5..af66009395b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
@@ -1,16 +1,28 @@
 ---
 id: 5a23c84252665b21eecc8013
 title: Sorting algorithms/Strand sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302319
 dashedName: sorting-algorithmsstrand-sort
 ---
 
 # --description--
 
-Write a function to sort an array using the [Strand sort](https://en.wikipedia.org/wiki/Strand sort). The function should return the sorted array.
+The **Strand sort** creates sorted subsets that are merged to create the final result.
+
+Consider an `unsortedArray = [3, 1, 4, 2]`. Pick the first item `3` and copy it into a separate array. Search for any bigger item following this item. When you find the a larger item, in this case `4`, copy it to the separate array, `[3, 4]`, and compare the following items to this new value, `4`.
+
+After you have reached the end of the array, remove the items you copied, `[3, 4]`, and start again with the first item remaining in the `unsortedArray`, in this case `1`.
+
+Following this process results in two sorted arrays, `[3, 4]` and `[1, 2]`. Merge these two arrays to create the `strandSortedArray`.
+
+```js
+const unsortedArray = [3, 1, 4, 2];
+const strandsortedArray = [1, 2, 3, 4];
+```
+
+Write a function to sort an array using the **Strand sort**. The function should return the sorted array.
 
-This is a way of sorting numbers by extracting shorter sequences of already sorted numbers from an unsorted list.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/soundex.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/soundex.md
index b7574b38375..b51c5bc6b71 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/soundex.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/soundex.md
@@ -1,14 +1,24 @@
 ---
 id: 5a23c84252665b21eecc8017
 title: Soundex
-challengeType: 5
+challengeType: 1
 forumTopicId: 302320
 dashedName: soundex
 ---
 
 # --description--
 
-Soundex is an algorithm for creating indices for words based on their pronunciation. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling (from [the WP article](https://en.wikipedia.org/wiki/soundex)). There is a major issue in many of the implementations concerning the separation of two consonants that have the same soundex code! According to the [official Rules](https://www.archives.gov/research/census/soundex.html). So check for instance if **Ashcraft** is coded to **A-261**.
+**Soundex Algorithm** deals with the *intentions* of the words. It creates a representation for similar sounding words.
+
+It is used for searching <em>names</em> and <em>addresses</em>. This means that the person who filled in the <em>name</em>, can focus on how it sounds instead of correcting the spelling of <em>names</em>.
+
+For example:
+
+If you are hearing the name `Quenci` for the first time, and misspelled it, you will get **Soundex** code `Q520`.
+
+When you spell the name `Quincy` correctly next time, you will still get the same code `Q520`, which means you can link multiple name pronunciations into the same <em>person</em> without the need for adding every spelling.
+
+Here is the rules: 
 
 <ul>
   <li>If a vowel (A, E, I, O, U) separates two consonants that have the same soundex code, the consonant to the right of the vowel is coded. Tymczak is coded as T-522 (T, 5 for the M, 2 for the C, Z ignored (see "Side-by-Side" rule above), 2 for the K). Since the vowel "A" separates the Z and K, the K is coded.</li>
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/spiral-matrix.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/spiral-matrix.md
index 14da95f5a2f..fbdd024181b 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/spiral-matrix.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/spiral-matrix.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc801c
 title: Spiral matrix
-challengeType: 5
+challengeType: 1
 forumTopicId: 302321
 dashedName: spiral-matrix
 ---
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 4bb28fba9a6..5a7cd85889d 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
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc801d
 title: Split a character string based on change of character
-challengeType: 5
+challengeType: 1
 forumTopicId: 302322
 dashedName: split-a-character-string-based-on-change-of-character
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/state-name-puzzle.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/state-name-puzzle.md
index d22ef19220a..841319d1bda 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/state-name-puzzle.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/state-name-puzzle.md
@@ -1,18 +1,21 @@
 ---
 id: 5a23c84252665b21eecc8024
 title: State name puzzle
-challengeType: 5
+challengeType: 1
 forumTopicId: 302323
 dashedName: state-name-puzzle
 ---
 
 # --description--
 
-This task is inspired by Mark Nelson's DDJ Column "Wordplay" and one of the weekly puzzle challenges from Will Shortz on NPR Weekend Edition [\[1\]](https://www.npr.org/templates/story/story.php?storyId=9264290) and originally attributed to David Edelheit. The challenge was to take the names of two U.S. States, mix them all together, then rearrange the letters to form the names of two *different* U.S. States (so that all four state names differ from one another). What states are these? The problem was reissued on [the Unicon Discussion Web](https://tapestry.tucson.az.us/twiki/bin/view/Main/StateNamesPuzzle) which includes several solutions with analysis. Several techniques may be helpful and you may wish to refer to [Gödel numbering](https://en.wikipedia.org/wiki/Goedel_numbering), [equivalence relations](https://en.wikipedia.org/wiki/Equivalence_relation), and [equivalence classes](https://en.wikipedia.org/wiki/Equivalence_classes). The basic merits of these were discussed in the Unicon Discussion Web. A second challenge in the form of a set of fictitious new states was also presented.
+**State name** is a <em>word puzzle</em> in which you take the letters from two U.S. state names and rearrange them to form the names of two different U.S. states.
+
 
 # --instructions--
 
-Write a function to solve the challenge for the given array of names of states. The function should return an array. Each element should be an object in this form: `{"from":[],"to":[]}`. The "from" array should contain the original names and the "to" array should contain the resultant names.
+Write a function to solve the challenge for a given array of actual U.S. state names, and for fictional state names.
+
+The function should return an array. Each element should be an object in this form: `{"from":[],"to":[]}`. The `"from"` array should contain the original names and the `"to"` array should contain the resultant names.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
index 55580822989..a0030994da2 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8028
 title: Stern-Brocot sequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 302324
 dashedName: stern-brocot-sequence
 ---
 
 # --description--
 
-For this task, the Stern-Brocot sequence is to be generated by an algorithm similar to that employed in generating the [Fibonacci sequence](https://rosettacode.org/wiki/Fibonacci sequence).
+For this task, the Stern-Brocot sequence is to be generated by an algorithm similar to that employed in generating the <a href="https://rosettacode.org/wiki/Fibonacci_sequence" target="_blank" rel="noopener noreferrer nofollow">Fibonacci sequence</a>.
 
 <ol>
   <li>The first and second members of the sequence are both 1:</li>
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md
index e89ca872e69..6181ad81245 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md
@@ -1,14 +1,20 @@
 ---
 id: 5a23c84252665b21eecc8029
 title: Straddling checkerboard
-challengeType: 5
+challengeType: 1
 forumTopicId: 302325
 dashedName: straddling-checkerboard
 ---
 
 # --description--
 
-Implement functions to encrypt and decrypt a message using the [straddling checkerboard](https://en.wikipedia.org/wiki/Straddling_checkerboard) method. The functions will take a string and an array as parameters. The array has 3 strings representing the 3 rows of the checkerboard. The output will be a series of decimal digits. Numbers should be encrypted by inserting the escape character before each digit, then including the digit unencrypted. This should be reversed for decryption.
+Implement functions to encrypt and decrypt a message using the **straddling checkerboard** method.
+
+Each function will take two arguments, a `message` string and an `alphabet` array. The `alphabet` array will contain 3 strings representing the 3 rows of the straddling checkerboard.
+
+The output of the `straddle()` function should be a series of decimal digits. Numbers should be encrypted by inserting the escape character before each digit, then including the digit <em>unencrypted</em>.
+
+This should be reversed for decryption with the `unstraddle()` function.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/stream-merge.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/stream-merge.md
index 234158bb509..9e2c93138d7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/stream-merge.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/stream-merge.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc802a
 title: Stream Merge
-challengeType: 5
+challengeType: 1
 forumTopicId: 302326
 dashedName: stream-merge
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/strip-control-codes-and-extended-characters-from-a-string.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/strip-control-codes-and-extended-characters-from-a-string.md
index 317f9dd7b7e..5207f260b42 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/strip-control-codes-and-extended-characters-from-a-string.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/strip-control-codes-and-extended-characters-from-a-string.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8036
 title: Strip control codes and extended characters from a string
-challengeType: 5
+challengeType: 1
 forumTopicId: 302327
 dashedName: strip-control-codes-and-extended-characters-from-a-string
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/subleq.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/subleq.md
index d302bb9f993..1dc7987cf77 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/subleq.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/subleq.md
@@ -1,37 +1,29 @@
 ---
 id: 5a23c84252665b21eecc8038
 title: Subleq
-challengeType: 5
+challengeType: 1
 forumTopicId: 302328
 dashedName: subleq
 ---
 
 # --description--
 
-[Subleq](https://rosettacode.org/wiki/eso:Subleq) is an example of a [One-Instruction Set Computer (OISC)](https://en.wikipedia.org/wiki/One_instruction_set_computer).
+Subleq is an example of a One-Instruction Set Computer (OISC).
 
-It is named after its only instruction, which is **SU**btract and **B**ranch if **L**ess than or **EQ**ual
-
-to zero.
+It is named after its only instruction, which is **SU**btract and **B**ranch if **L**ess than or **EQ**ual to zero.
 
 Your task is to create an interpreter which emulates such a machine.
 
-The machine's memory consists of an array of signed integers. Any reasonable word size is fine, but the memory must be
-
-able to hold negative as well as positive numbers.
+The machine's memory consists of an array of signed integers. Any reasonable word size is fine, but the memory must be able to hold negative as well as positive numbers.
 
 Execution begins with the instruction pointer aimed at the first word, which is address 0. It proceeds as follows:
 
 <ol>
   <li>Let A, B, and C be the value stored in the three consecutive words in memory starting at the instruction pointer.</li>
   <li>Advance the instruction pointer 3 words to point at the address after the one containing C.</li>
-  <li>If A is -1, then a character is read from standard input and its code point stored in the address given by B. C
-    is unused.</li>
-  <li>If B is -1, then the number contained in the address given by A is interpreted as a code point and the
-    corresponding character output. C is again unused.</li>
-  <li>Otherwise, both A and B are treated as the addresses of memory locations. The number contained in the address
-    given by A is subtracted from the number at the address given by B (and the result stored back in address B). If
-    the result is zero or negative, the value C becomes the new instruction pointer.</li>
+  <li>If A is -1, then a character is read from standard input and its code point stored in the address given by B. C is unused.</li>
+  <li>If B is -1, then the number contained in the address given by A is interpreted as a code point and the corresponding character output. C is again unused.</li>
+  <li>Otherwise, both A and B are treated as the addresses of memory locations. The number contained in the address given by A is subtracted from the number at the address given by B (and the result stored back in address B). If the result is zero or negative, the value C becomes the new instruction pointer.</li>
   <li>If the instruction pointer becomes negative, execution halts.</li>
 </ol>
 
@@ -39,15 +31,7 @@ Other negative addresses besides -1 may be treated as equivalent to -1, or gener
 
 Your solution should accept a program to execute on the machine, separately from the input fed to the program itself.
 
-This program should be in raw subleq "machine code" - whitespace-separated decimal numbers, with no symbolic names or
-
-other assembly-level extensions, to be loaded into memory starting at address 0. Show the output of your solution when
-
-fed this "Hello, world!" program. (Note that the example assumes ASCII or a superset of it, such as any of the Latin-N
-
-character sets or Unicode. You may translate it into another character set if your implementation is on a
-
-non-ASCiI-compatible environment.)
+This program should be in raw subleq "machine code" - whitespace-separated decimal numbers, with no symbolic names or other assembly-level extensions, to be loaded into memory starting at address 0. Show the output of your solution when fed this "Hello, world!" program. (Note that the example assumes ASCII or a superset of it, such as any of the Latin-N character sets or Unicode. You may translate it into another character set if your implementation is on a non-ASCiI-compatible environment.)
 
 <pre>15 17 -1 17 -1 -1 16 1 -1 16 3 -1 15 15 0 0 -1 72 101 108 108 111 44 32 119 111 114 108 100 33 10 0</pre>
 
@@ -66,9 +50,7 @@ message: "Hello, world!\n\0"
 
 # --instructions--
 
-Write a function that takes an array of integers as a parameter. This represents the memory elements. The function
-
-should interpret the sequence and return the output string. For this task, assume that there is no standard input.
+Write a function that takes an array of integers as a parameter. This represents the memory elements. The function should interpret the sequence and return the output string. For this task, assume that there is no standard input.
 
 # --hints--
 
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 e0f6864a89e..01bdc0854df 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
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc803c
 title: Sudoku
-challengeType: 5
+challengeType: 1
 forumTopicId: 302329
 dashedName: sudoku
 ---
 
 # --description--
 
-Write a function to solve a partially filled-in normal 9x9 [Sudoku](https://en.wikipedia.org/wiki/Sudoku) grid and return the result. The blank fields are represented by `-1`. [Algorithmics of Sudoku](https://en.wikipedia.org/wiki/Algorithmics_of_sudoku) may help implement this.
+Write a function to solve a partially filled-in normal 9x9 Sudoku grid and return the result. The blank fields are represented by `-1`.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sum-digits-of-an-integer.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sum-digits-of-an-integer.md
index d13a1bdb030..077d606d4c7 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sum-digits-of-an-integer.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sum-digits-of-an-integer.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc803f
 title: Sum digits of an integer
-challengeType: 5
+challengeType: 1
 forumTopicId: 302331
 dashedName: sum-digits-of-an-integer
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sum-multiples-of-3-and-5.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sum-multiples-of-3-and-5.md
index f92d5b9d218..d5f7e93da8f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sum-multiples-of-3-and-5.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sum-multiples-of-3-and-5.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8040
 title: Sum multiples of 3 and 5
-challengeType: 5
+challengeType: 1
 forumTopicId: 302332
 dashedName: sum-multiples-of-3-and-5
 ---
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 6ffa6d152f7..7d649eee959 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
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8041
 title: Sum of a series
-challengeType: 5
+challengeType: 1
 forumTopicId: 302333
 dashedName: sum-of-a-series
 ---
 
 # --description--
 
-Compute the **n**<sup>th</sup> term of a [series](https://en.wikipedia.org/wiki/Series (mathematics)), i.e. the sum of the **n** first terms of the corresponding [sequence](https://en.wikipedia.org/wiki/sequence). Informally this value, or its limit when **n** tends to infinity, is also called the *sum of the series*, thus the title of this task. For this task, use: $S_n = \displaystyle\sum_{k=1}^n \frac{1}{k^2}$.
+Compute the **n**<sup>th</sup> term of a <em>series</em>, i.e. the sum of the **n** first terms of the corresponding <em>sequence</em>. 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-of-squares.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sum-of-squares.md
index d211cbc1657..ee55a5bfea5 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sum-of-squares.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sum-of-squares.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8042
 title: Sum of squares
-challengeType: 5
+challengeType: 1
 forumTopicId: 302334
 dashedName: sum-of-squares
 ---
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 f30b422ba87..e616195233d 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
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8043
 title: Sum to 100
-challengeType: 5
+challengeType: 1
 forumTopicId: 302335
 dashedName: sum-to-100
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
index 50fe64ed639..50ad887d282 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8045
 title: Sutherland-Hodgman polygon clipping
-challengeType: 5
+challengeType: 1
 forumTopicId: 302336
 dashedName: sutherland-hodgman-polygon-clipping
 ---
 
 # --description--
 
-The [Sutherland-Hodgman clipping algorithm](https://en.wikipedia.org/wiki/Sutherland-Hodgman clipping algorithm) finds the polygon that is the intersection between an arbitrary polygon (the "subject polygon") and a convex polygon (the "clip polygon"). It is used in computer graphics (especially 2D graphics) to reduce the complexity of a scene being displayed by eliminating parts of a polygon that do not need to be displayed. Take the closed polygon defined by the points:
+The Sutherland-Hodgman clipping algorithm finds the polygon that is the intersection between an arbitrary polygon (the "subject polygon") and a convex polygon (the "clip polygon"). It is used in computer graphics (especially 2D graphics) to reduce the complexity of a scene being displayed by eliminating parts of a polygon that do not need to be displayed. Take the closed polygon defined by the points:
 
 <pre>[(50, 150), (200, 50), (350, 150), (350, 300), (250, 300), (200, 250), (150, 350), (100, 250), (100, 200)]</pre>
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/symmetric-difference.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/symmetric-difference.md
index 7009bce4617..bf8d98a2c7f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/symmetric-difference.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/symmetric-difference.md
@@ -1,14 +1,18 @@
 ---
 id: 5a23c84252665b21eecc8046
 title: Symmetric difference
-challengeType: 5
+challengeType: 1
 forumTopicId: 16086
 dashedName: symmetric-difference
 ---
 
 # --description--
 
-Given two [set](https://rosettacode.org/wiki/set)s *A* and *B*, compute $(A \\setminus B) \\cup (B \\setminus A).$ That is, enumerate the items that are in *A* or *B* but not both. This set is called the [symmetric difference](https://en.wikipedia.org/wiki/Symmetric difference) of *A* and *B*. In other words: $(A \\cup B) \\setminus (A \\cap B)$ (the set of items that are in at least one of *A* or *B* minus the set of items that are in both *A* and *B*).
+Given two sets *A* and *B*, compute $(A \\setminus B) \\cup (B \\setminus A).$ That is, enumerate the items that are in *A* or *B* but not both. This set is called the symmetric difference of *A* and *B*. In other words: $(A \\cup B) \\setminus (A \\cap B)$ (the set of items that are in at least one of *A* or *B* minus the set of items that are in both *A* and *B*).
+
+Example:
+
+For sets `A = [1, 2, 3]`, and `B = [1, 3, 4]`, the symmetric difference of *A* and *B* is `[2, 4]`.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/taxicab-numbers.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/taxicab-numbers.md
index 895b46ef050..e968d091577 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/taxicab-numbers.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/taxicab-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 594ecc0d9a8cf816e3340187
 title: Taxicab numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 302337
 dashedName: taxicab-numbers
 ---
 
 # --description--
 
-A [taxicab number](https://en.wikipedia.org/wiki/Hardy–Ramanujan number "wp: Hardy–Ramanujan number") (the definition that is being used here) is a positive integer that can be expressed as the sum of two positive cubes in more than one way.
+A taxicab number (the definition that is being used here) is a positive integer that can be expressed as the sum of two positive cubes in more than one way.
 
 The first taxicab number is `1729`, which is:
 
@@ -29,13 +29,6 @@ Taxicab numbers are also known as:
 
 Write a function that returns the lowest `n` taxicab numbers. For each of the taxicab numbers, show the number as well as its constituent cubes.
 
-**See also:**
-
-<ul>
-  <li><a href='https://oeis.org/A001235' target='_blank'>A001235 taxicab numbers</a> on The On-Line Encyclopedia of Integer Sequences.</li>
-  <li><a href='https://en.wikipedia.org/wiki/Taxicab_number' target='_blank'>taxicab number</a> on Wikipedia.</li>
-</ul>
-
 # --hints--
 
 `taxicabNumbers` should be a function.
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/tokenize-a-string-with-escaping.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/tokenize-a-string-with-escaping.md
index 24a65a163e8..52f676e31df 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/tokenize-a-string-with-escaping.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/tokenize-a-string-with-escaping.md
@@ -1,14 +1,14 @@
 ---
 id: 594faaab4e2a8626833e9c3d
-title: Tokenize a string with escaping
-challengeType: 5
+title: 使用轉義標記字符串
+challengeType: 1
 forumTopicId: 302338
 dashedName: tokenize-a-string-with-escaping
 ---
 
 # --description--
 
-Write a function or program that can split a string at each non-escaped occurrence of a separator character.
+編寫一個函數或程序，可以在分隔符的每個非轉義出現處拆分字符串。
 
 It should accept three input parameters:
 
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 56cd2843797..b32c3f2a2a6 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
@@ -1,7 +1,7 @@
 ---
 id: 595011cba5a81735713873bd
 title: Top rank per group
-challengeType: 5
+challengeType: 1
 forumTopicId: 302339
 dashedName: top-rank-per-group
 ---
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 f57d218e66c..8b9939feb29 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
@@ -1,7 +1,7 @@
 ---
 id: 594fa2746886f41f7d8bf225
 title: Topological sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302340
 dashedName: topological-sort
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
index 4de9c851ba4..596164f14b5 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
@@ -1,20 +1,20 @@
 ---
 id: 5951ed8945deab770972ae56
 title: Towers of Hanoi
-challengeType: 5
+challengeType: 1
 forumTopicId: 302341
 dashedName: towers-of-hanoi
 ---
 
 # --description--
 
-Solve the [Towers of Hanoi](https://en.wikipedia.org/wiki/Towers_of_Hanoi "wp: Towers_of_Hanoi") problem.
+Solve the Towers of Hanoi problem. The number of objects will be given as the first parameter, followed by the strings used to identify each stack of objects. Create a nested array containing the list of moves, `["source", "destination"]`.
 
-Your solution should accept the number of discs as the first parameters, and three string used to identify each of the three stacks of discs, for example `towerOfHanoi(4, 'A', 'B', 'C')`. The function should return an array of arrays containing the list of moves, source -> destination.
+For example, the parameters `(4, 'A', 'B', 'C')`, will result in nested array of moves `[['A', 'C'], ['B', 'A']]`, indicating that the 1st move was to move an object from stack `A` to `C` and the 2nd move was to move an object from stack `B` to `A`.
 
-For example, the array `[['A', 'C'], ['B', 'A']]` indicates that the 1st move was to move a disc from stack A to C, and the 2nd move was to move a disc from stack B to A.
+# --instructions--
 
-<p></p>
+Write a function that returns the moves to stack the objects in a nested array.
 
 # --hints--
 
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 4dab99b445a..0b4a17bfdfa 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
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339ad2
 title: Vector cross product
-challengeType: 5
+challengeType: 1
 forumTopicId: 302342
 dashedName: vector-cross-product
 ---
@@ -12,7 +12,7 @@ A vector is defined as having three dimensions as being represented by an ordere
 
 # --instructions--
 
-Write a function that takes two vectors (arrays) as input and computes their cross product. Your function should return `null` on invalid inputs such as vectors of different lengths.
+Write a function that takes two vectors (arrays) as input and computes their cross product. 該函數應該在無效輸入（例如不同長度的向量）上返回 `null`。
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/vector-dot-product.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/vector-dot-product.md
index fb8ae242aed..447edc27d7f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/vector-dot-product.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/vector-dot-product.md
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339ad3
 title: Vector dot product
-challengeType: 5
+challengeType: 1
 forumTopicId: 302343
 dashedName: vector-dot-product
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/word-frequency.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/word-frequency.md
index 70d2d054dca..aff883e5d51 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/word-frequency.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/word-frequency.md
@@ -1,7 +1,7 @@
 ---
 id: 5e94a54cc7b022105bf0fd2c
 title: Word frequency
-challengeType: 5
+challengeType: 1
 forumTopicId: 393913
 dashedName: word-frequency
 ---
@@ -12,7 +12,7 @@ Given a text string and an integer n, return the n most common words in the file
 
 # --instructions--
 
-Write a function to count the occurrences of each word and return the n most commons words along with the number of their occurences in decreasing frequency.
+Write a function to count the occurrences of each word and return the n most commons words along with the number of their occurrences in decreasing frequency.
 
 The function should return a 2D array with each of the elements in the following form: `[word, freq]`. `word` should be the lowercase version of the word and `freq` the number denoting the count.
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/word-wrap.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/word-wrap.md
index 344be87802e..5ea8d8161da 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/word-wrap.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/word-wrap.md
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339ad4
 title: Word wrap
-challengeType: 5
+challengeType: 1
 forumTopicId: 302344
 dashedName: word-wrap
 ---
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/y-combinator.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/y-combinator.md
index f76ab91e3c8..0c867176bc4 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/y-combinator.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/y-combinator.md
@@ -1,22 +1,20 @@
 ---
 id: 594810f028c0303b75339ad5
 title: Y combinator
-challengeType: 5
+challengeType: 1
 forumTopicId: 302345
 dashedName: y-combinator
 ---
 
 # --description--
 
-In strict [functional programming](https://en.wikipedia.org/wiki/Functional programming "wp: functional programming") and the [lambda calculus](https://en.wikipedia.org/wiki/lambda calculus "wp: lambda calculus"), functions (lambda expressions) don't have state and are only allowed to refer to arguments of enclosing functions. This rules out the usual definition of a recursive function wherein a function is associated with the state of a variable and this variable's state is used in the body of the function. The [Y combinator](https://mvanier.livejournal.com/2897.html) is itself a stateless function that, when applied to another stateless function, returns a recursive version of the function. The Y combinator is the simplest of the class of such functions, called [fixed-point combinators](https://en.wikipedia.org/wiki/Fixed-point combinator "wp: fixed-point combinator").
+In strict <a href="https://www.freecodecamp.org/news/the-principles-of-functional-programming/" target="_blank" rel="noopener noreferrer nofollow">functional programming</a> and the lambda calculus, functions (lambda expressions) don't have state and are only allowed to refer to arguments of enclosing functions. This rules out the usual definition of a recursive function wherein a function is associated with the state of a variable and this variable's state is used in the body of the function.
+
+The Y combinator is itself a stateless function that, when applied to another stateless function, returns a recursive version of the function. The Y combinator is the simplest of the class of such functions, called fixed-point combinators.
 
 # --instructions--
 
-Define the stateless Y combinator function and use it to compute [factorial](https://en.wikipedia.org/wiki/Factorial "wp: factorial"). The `factorial(N)` function is already given to you. **See also:**
-
-<ul>
-  <li><a href="https://vimeo.com/45140590" target="_blank">Jim Weirich: Adventures in Functional Programming</a>.</li>
-</ul>
+Define the stateless Y combinator function and use it to compute the factorials. The `factorial(N)` function is already given to you.
 
 # --hints--
 
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 7794021986e..27ab1af3d3c 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
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339ad6
 title: Zeckendorf number representation
-challengeType: 5
+challengeType: 1
 forumTopicId: 302346
 dashedName: zeckendorf-number-representation
 ---
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 d3970f2f72c..2a24efff765 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
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339ad7
 title: Zhang-Suen thinning algorithm
-challengeType: 5
+challengeType: 1
 forumTopicId: 302347
 dashedName: zhang-suen-thinning-algorithm
 ---
@@ -40,7 +40,7 @@ It produces the thinned output:
   '                               ' ];
 ```
 
-## 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:
 
@@ -51,7 +51,7 @@ Obviously the boundary pixels of the image cannot have the full eight neighbours
 - 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:**
+**步驟 1：**
 
 All pixels are tested and pixels satisfying all the following conditions (simultaneously) are just noted at this stage.
 
@@ -63,7 +63,7 @@ All pixels are tested and pixels satisfying all the following conditions (simult
 
 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:**
+**步驟 2：**
 
 All pixels are again tested and pixels satisfying all the following conditions are just noted at this stage.
 
@@ -73,11 +73,11 @@ All pixels are again tested and pixels satisfying all the following conditions a
 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.
+在迭代圖像並收集滿足所有步驟 2 條件的所有像​​素後，所有這些滿足條件的像素再次設置爲白色。
 
 **Iteration:**
 
-If any pixels were set in this round of either step 1 or step 2 then all steps are repeated until no image pixels are so changed.
+如果在這輪步驟 1 或步驟 2 中設置了任何像素，則重複所有步驟，直到沒有圖像像素髮生如此變化。
 
 # --instructions--
 
@@ -85,19 +85,19 @@ Write a routine to perform Zhang-Suen thinning on the provided `image`, an array
 
 # --hints--
 
-`thinImage` should be a function.
+`thinImage` 應該是一個函數。
 
 ```js
 assert.equal(typeof thinImage, 'function');
 ```
 
-`thinImage` should return an array.
+`thinImage` 應該返回一個數組。
 
 ```js
 assert(Array.isArray(thinImage(_testImage1)));
 ```
 
-`thinImage` should return an array of strings.
+`thinImage` 應該返回一個字符串數組。
 
 ```js
 assert.equal(typeof thinImage(_testImage1)[0], 'string');
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md
index 4f5277c28ad..6a6081f608d 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md
@@ -1,14 +1,14 @@
 ---
 id: 594810f028c0303b75339ad8
-title: Zig-zag matrix
-challengeType: 5
+title: 之字形矩陣
+challengeType: 1
 forumTopicId: 302348
 dashedName: zig-zag-matrix
 ---
 
 # --description--
 
-A 'zig-zag' array is a square arrangement of the first $N^2$ integers, where the numbers increase sequentially as you zig-zag along the array's [anti-diagonals](https://en.wiktionary.org/wiki/antidiagonal).
+A 'zig-zag' array is a square arrangement of the first $N^2$ integers, where the numbers increase sequentially as you zig-zag along the array's anti-diagonals.
 
 For example, for the input `5`, the following result should be produced:
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
index 35f9887785d..999b28f5a06 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
@@ -8,9 +8,9 @@ dashedName: build-a-freecodecamp-forum-homepage
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/JqdoMV>.
+**Objective:** Build an app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/JqdoMV>.
 
-Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+Fulfill the below user stories and get all of the tests to pass. 使用你需要的任何庫或 API。 賦予它你自己的個人風格。
 
 **User Story:** I can see a list of the most recent posts on the freeCodeCamp forum.
 
@@ -20,9 +20,9 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 **Hint:** To get the 30 most recent forum posts: <https://forum-proxy.freecodecamp.rocks/latest>.
 
-When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+完成後，單擊“我已完成此挑戰”按鈕幷包含指向 CodePen 的鏈接。
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
index 5cf03cdd2a3..db918f3e704 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
@@ -8,27 +8,27 @@ dashedName: build-a-light-bright-app
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/eyLYXE>.
+**Objective:** Build an app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/eyLYXE>.
 
-**Rule #1:** Don't look at the example project's code. Figure it out for yourself.
+**規則＃1：** 不要查看示例項目的代碼。 自己搞清楚。
 
-**Rule #2:** Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+**Rule #2:** Fulfill the below user stories and get all of the tests to pass. 使用你需要的任何庫或 API。 賦予它你自己的個人風格。
 
-**User Story:** I can click or drag the mouse cursor to color the circles.
+**用戶故事：** 我可以單擊或拖動鼠標光標爲圓圈着色。
 
-**User Story:** I can double-click on a colored circle to remove the color.
+**用戶故事：** 我可以雙擊彩色圓圈去除顏色。
 
-**User Story:** I can click on a colored circle to change its color.
+**用戶故事：** 我可以點擊彩色圓圈來改變它的顏色。
 
-**User Story:** I should get a circle of different color on each click.
+**用戶故事：** 每次點擊我都會得到一個不同顏色的圓圈。
 
-**User Story:** I can click on the 'Reset' button to remove the recent color.
+**用戶故事：** 我可以點擊“重置”按鈕刪除最近的顏色。
 
-**User Story:** I can click on the 'Reset All' button to remove all the colors from the circles.
+**用戶故事：** 我可以單擊“全部重置”按鈕刪除圓圈中的所有顏色。
 
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
index 5d39e057a64..35843b9c3de 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
@@ -1,6 +1,6 @@
 ---
 id: bd7158d8c443eddfaeb5bdff
-title: Build a Nightlife Coordination App
+title: 建立夜生活協調應用程序
 challengeType: 4
 forumTopicId: 302351
 dashedName: build-a-nightlife-coordination-app
@@ -8,19 +8,19 @@ dashedName: build-a-nightlife-coordination-app
 
 # --description--
 
-Build a full stack JavaScript app that is functionally similar to this: <https://yoyo44.herokuapp.com/>. Use a site builder of your choice to complete the project.
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://yoyo44.herokuapp.com/" target="_blank" rel="noopener noreferrer nofollow">https://yoyo44.herokuapp.com/</a>. Use a site builder of your choice to complete the project.
 
 Here are the specific user stories you should implement for this project:
 
 **User Story:** As an unauthenticated user, you can view all bars in my area.
 
-**User Story:** As an authenticated user, you can add myself to a bar to indicate you am going there tonight.
+**用戶故事：** 作爲一名經過身份驗證的用戶，我可以將自己添加到一個欄中，以表明我今晚要去那裏。
 
-**User Story:** As an authenticated user, you can remove myself from a bar if you no longer want to go there.
+**用戶故事：** 作爲一名經過身份驗證的用戶，如果我不想再去那裏，我可以將自己從酒吧中刪除。
 
-**User Story:** As an unauthenticated user, when you login you should not have to search again.
+**用戶故事：** 作爲未經身份驗證的用戶，當我登錄時，我不需要再次搜索。
 
-**Hint:** Try using the [Yelp API](https://www.yelp.com/developers/documentation/v3) to find venues in the cities your users search for. If you use Yelp's API, be sure to mention so in your app.
+**Hint:** Try using the Yelp API to find venues in the cities your users search for. 如果使用 Yelp 的 API，請務必在應用中提及。
 
 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.
 
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 bd190875b3b..3020d0b7ee8 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,9 +8,9 @@ dashedName: build-a-pinterest-clone
 
 # --description--
 
-**Objective:** Build a [Replit](https://replit.com/) app that is functionally similar to this: <https://build-a-pinterest-clone.freecodecamp.rocks/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://build-a-pinterest-clone.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://build-a-pinterest-clone.freecodecamp.rocks/</a>.
 
-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.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** As an unauthenticated user, I can login with GitHub.
 
@@ -24,11 +24,11 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 **User Story:** As an authenticated user, if I upload an image that is broken, it will be replaced by a placeholder image. (can use jQuery broken image detection)
 
-**Hint:** [Masonry.js](https://masonry.desandro.com/) is a library that allows for Pinterest-style image grids.
+**Hint:** Masonry.js is a library that allows for Pinterest-style image grids.
 
 Once you've finished implementing these user stories, enter the URL to your live app and, optionally, your GitHub repository. Then click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-pong-game.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
index cfa0cc598b6..2ff9a511079 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
@@ -8,23 +8,23 @@ dashedName: build-a-pong-game
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/satyamdev/full/pdMmBp>.
+**Objective:** Build an app that is functionally similar to this: <https://codepen.io/satyamdev/full/pdMmBp>.
 
-**Rule #1:** Don't look at the example project's code. Figure it out for yourself.
+**規則＃1：** 不要查看示例項目的代碼。 自己搞清楚。
 
-**Rule #2:** Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+**Rule #2:** Fulfill the below user stories and get all of the tests to pass. 使用你需要的任何庫或 API。 賦予它你自己的個人風格。
 
 **User Story:** I can control a paddle.
 
-**User Story:** The computer can control the other paddle.
+**用戶故事：** 計算機可以控制另一個撥片。
 
-**User Story:** The computer's paddle is unbeatable. It should never miss the ball.
+**用戶故事：** 計算機的撥片是無法戰勝的。 它絕不應該錯過球。
 
-**User Story:** The game keeps track of the player and computer's score.
+**用戶故事：** 遊戲記錄玩家和計算機的分數。
 
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
index 7817e26951d..c457e33ccc1 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
@@ -8,9 +8,9 @@ dashedName: build-a-recipe-box
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/dNVazZ/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/dNVazZ/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/dNVazZ/</a>.
 
-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.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I can create recipes that have names and ingredients.
 
@@ -28,7 +28,7 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
index de57859782b..61196c85603 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
@@ -1,6 +1,6 @@
 ---
 id: bd7153d8c242eddfaeb5bd13
-title: Build a Roguelike Dungeon Crawler Game
+title: 建立一個 Roguelike Dungeon Crawler 遊戲
 challengeType: 3
 forumTopicId: 302355
 dashedName: build-a-roguelike-dungeon-crawler-game
@@ -8,9 +8,9 @@ dashedName: build-a-roguelike-dungeon-crawler-game
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/apLXEJ/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/apLXEJ/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/apLXEJ/</a>.
 
-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.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I have health, a level, and a weapon. I can pick up a better weapon. I can pick up health items.
 
@@ -32,7 +32,7 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
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 5bc458abb1d..2ff2d760541 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,9 +8,9 @@ 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/freeCodeCamp/full/obYBjE).
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/obYBjE" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/obYBjE</a>.
 
-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.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I am presented with a random series of button presses.
 
@@ -32,7 +32,7 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
index bf79eae711d..2f79f73178e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
@@ -8,9 +8,9 @@ dashedName: build-a-tic-tac-toe-game
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/KzXQgy/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/KzXQgy/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/KzXQgy/</a>.
 
-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.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I can play a game of Tic Tac Toe with the computer.
 
@@ -20,7 +20,7 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-voting-app.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-voting-app.md
index 3e6e257ce88..c5e1f8c05dd 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-voting-app.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-voting-app.md
@@ -8,7 +8,7 @@ dashedName: build-a-voting-app
 
 # --description--
 
-Build a full stack JavaScript app that is functionally similar to this: <https://voting-app.freecodecamp.rocks/>. Use a site builder of your choice to complete the project.
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://voting-app.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://voting-app.freecodecamp.rocks/</a>. Use a site builder of your choice to complete the project.
 
 Here are the specific user stories you should implement for this project:
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
index d4cf3b350f7..adcef83386e 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
@@ -8,23 +8,21 @@ dashedName: build-a-wikipedia-viewer
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/wGqEga/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/wGqEga/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/wGqEga/</a>.
 
-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.
+The MediaWiki software powers Wikipedia, and it helps you collect and organize knowledge and make it available to people.
+
+Using the MediaWiki API, replicate the search function and random article function, similar to the example app above. You can use Wikipedia as your data source.
+
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I can search Wikipedia entries in a search box and see the resulting Wikipedia entries.
 
 **User Story:** I can click a button to see a random Wikipedia entry.
 
-Hint #1: Here's a URL you can use to get a random Wikipedia article: `https://en.wikipedia.org/wiki/Special:Random`.
-
-Hint #2: Here's an entry on using Wikipedia's API: `https://www.mediawiki.org/wiki/API:Main_page`.
-
-Hint #3: Use this [link](https://en.wikipedia.org/wiki/Special:ApiSandbox#action=query&titles=Main%20Page&prop=revisions&rvprop=content&format=jsonfm) to experiment with Wikipedia's API.
-
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md
index a17732de47f..47cee2ababe 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md
@@ -8,7 +8,7 @@ dashedName: build-an-image-search-abstraction-layer
 
 # --description--
 
-Build a full stack JavaScript app that allows you to search for images like this: <https://image-search-abstraction-layer.freecodecamp.rocks/query/lolcats%20funny?page=10> and browse recent search queries like this: <https://image-search-abstraction-layer.freecodecamp.rocks/recent/>. Use a site builder of your choice to complete the project.
+Build a full stack JavaScript app that allows you to search for images like this: <a href="https://image-search-abstraction-layer.freecodecamp.rocks/query/lolcats%20funny?page=10" target="_blank" rel="noopener noreferrer nofollow">https://image-search-abstraction-layer.freecodecamp.rocks/query/lolcats%20funny?page=10</a> and browse recent search queries like this: <a href="https://image-search-abstraction-layer.freecodecamp.rocks/recent/" target="_blank" rel="noopener noreferrer nofollow">https://image-search-abstraction-layer.freecodecamp.rocks/recent/</a>. Use a site builder of your choice to complete the project.
 
 Here are the specific user stories you should implement for this project:
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
index 498b2a027a2..8a07168f613 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
@@ -8,9 +8,20 @@ dashedName: build-the-game-of-life
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/BpwMZv/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/BpwMZv/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/BpwMZv/</a>.
 
-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.
+The Game of Life is a cellular automaton devised by the British mathematician John Horton Conway. It is a <em>zero-player game</em>, meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and observing how it evolves.
+
+The universe of the Game of Life is an infinite, two-dimensional orthogonal grid of square cells, each of which is in one of two possible states, populated and unpopulated. Every cell interacts with its eight neighbours, which are the cells that are horizontally, vertically, or diagonally adjacent.
+
+At each step in time, the following transitions occur:
+
+- Any live cell with fewer than two live neighbours dies, as if by underpopulation.
+- Any live cell with two or three live neighbours lives on to the next generation.
+- Any live cell with more than three live neighbours dies, as if by overpopulation.
+- Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.
+
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** When I first arrive at the game, it will randomly generate a board and start playing.
 
@@ -24,13 +35,9 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 **User Story:** Each time the board changes, I can see how many generations have gone by.
 
-**Hint:** Here's an explanation of Conway's Game of Life from John Conway himself: <https://www.youtube.com/watch?v=E8kUJL04ELA>
+When you are finished, include a link to your project and click the "I've completed this challenge" button.
 
-**Hint:** Here's an overview of Conway's Game of Life with rules for your reference: [https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life](https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life)
-
-When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
-
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md
index fbae3e461ad..a5562365284 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md
@@ -8,7 +8,7 @@ dashedName: chart-the-stock-market
 
 # --description--
 
-Build a full stack JavaScript app that is functionally similar to this: <https://chart-the-stock-market.freecodecamp.rocks/>. Use a site builder of your choice to complete the project.
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://chart-the-stock-market.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://chart-the-stock-market.freecodecamp.rocks/</a>. Use a site builder of your choice to complete the project.
 
 Here are the specific user stories you should implement for this project:
 
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 5a5420d7713..fca6420cdc5 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,9 +8,9 @@ dashedName: manage-a-book-trading-club
 
 # --description--
 
-**Objective:** Build a [Replit](https://replit.com/) app that is functionally similar to this: <https://manage-a-book-trading-club.freecodecamp.rocks/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://manage-a-book-trading-club.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://manage-a-book-trading-club.freecodecamp.rocks/</a>.
 
-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.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I can view all books posted by every user.
 
@@ -22,7 +22,7 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 Once you've finished implementing these user stories, enter the URL to your live app and, optionally, your GitHub repository. Then click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
index aa1dcc3a84a..9086dacfd2f 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
@@ -1,6 +1,6 @@
 ---
 id: bd7108d8c242eddfaeb5bd13
-title: Map Data Across the Globe
+title: 全球地圖數據
 challengeType: 3
 forumTopicId: 302365
 dashedName: map-data-across-the-globe
@@ -8,9 +8,9 @@ dashedName: map-data-across-the-globe
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/mVEJag>.
+**Objective:** Build an app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/mVEJag>.
 
-Fulfill the following [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I can see where all Meteorites landed on a world map.
 
@@ -22,7 +22,7 @@ Fulfill the following [user stories](https://en.wikipedia.org/wiki/User_story).
 
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
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 6070f83ea88..590a5bb4a00 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,9 +8,9 @@ dashedName: p2p-video-chat-application
 
 # --description--
 
-**Objective:** Build a [Replit](https://replit.com/) app that is functionally similar to this: <https://p2p-video-chat-application.freecodecamp.rocks/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://p2p-video-chat-application.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://p2p-video-chat-application.freecodecamp.rocks/</a>.
 
-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.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** Upon arriving, the browser will prompt me to access my camera and microphone.
 
@@ -32,7 +32,7 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 Once you've finished implementing these user stories, enter the URL to your live app and, optionally, your GitHub repository. Then click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
index 9e83b937f40..23f76537c24 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
@@ -8,9 +8,9 @@ dashedName: show-national-contiguity-with-a-force-directed-graph
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/xVopBo>.
+**Objective:** Build an app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/XWEONRz>.
 
-Fulfill the following [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I can see a Force-directed Graph that shows which countries share borders.
 
@@ -22,7 +22,7 @@ Fulfill the following [user stories](https://en.wikipedia.org/wiki/User_story).
 
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/show-the-local-weather.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
index 9d470d6b1cf..d5b751f8a62 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
@@ -8,11 +8,11 @@ dashedName: show-the-local-weather
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/bELRjV>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/bELRjV" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/bELRjV</a>.
 
 **Rule #1:** Don't look at the example project's code. Figure it out for yourself.
 
-**Rule #2:** Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+**Rule #2:** Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I can see the weather in my current location.
 
@@ -20,11 +20,11 @@ dashedName: show-the-local-weather
 
 **User Story:** I can push a button to toggle between Fahrenheit and Celsius.
 
-**Note:** Many internet browsers now require an HTTP Secure (`https://`) connection to obtain a user's locale via HTML5 Geolocation. For this reason, we recommend using HTML5 Geolocation to get user location and then use the freeCodeCamp Weather API <https://weather-proxy.freecodecamp.rocks/> which uses an HTTP Secure connection for the weather. Also, be sure to connect to [CodePen.io](https://codepen.io) via `https://`.
+**Note:** Many internet browsers now require an HTTP Secure (`https://`) connection to obtain a user's locale via HTML5 Geolocation. For this reason, we recommend using HTML5 Geolocation to get user location and then use the freeCodeCamp Weather API <a href="https://weather-proxy.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://weather-proxy.freecodecamp.rocks/</a> which uses an HTTP Secure connection for the weather. Also, be sure to connect to <a href="https://codepen.io" target="_blank" rel="noopener noreferrer nofollow">CodePen.io</a> via `https://`.
 
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
index 55d17b1745f..242279ce6d1 100644
--- a/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
+++ b/curriculum/challenges/chinese-traditional/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
@@ -1,6 +1,6 @@
 ---
 id: bd7158d8c442eddfaeb5bd1f
-title: Use the Twitch JSON API
+title: 使用 Twitch JSON API
 challengeType: 3
 forumTopicId: 19541
 dashedName: use-the-twitch-json-api
@@ -8,25 +8,25 @@ dashedName: use-the-twitch-json-api
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/Myvqmo/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/Myvqmo/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/Myvqmo/</a>.
 
-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.
+The Twitch API is a RESTful API that lets developers build creative integrations for the broader Twitch community.
+
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I can see whether freeCodeCamp is currently streaming on Twitch.tv.
 
 **User Story:** I can click the status output and be sent directly to the freeCodeCamp's Twitch.tv channel.
 
-**User Story:** if a Twitch user is currently streaming, I can see additional details about what they are streaming.
-
-**Hint:** The relevant documentation about Twitch.tv's JSON API is here: <https://dev.twitch.tv/docs/api/reference/#get-streams>.
+**User Story:** If a Twitch user is currently streaming, I can see additional details about what they are streaming.
 
 **Hint:** Here's an array of the Twitch.tv usernames of people who regularly stream: `["ESL_SC2", "OgamingSC2", "cretetion", "freecodecamp", "storbeck", "habathcx", "RobotCaleb", "noobs2ninjas"]`
 
-**UPDATE:** Due to a change in conditions on API usage, Twitch.tv requires an API key, but we've built a workaround. Use <https://twitch-proxy.freecodecamp.rocks/> instead of Twitch's API base URL (i.e. `https://api.twitch.tv/helix` ) and you'll still be able to get account information, without needing to sign up for an API key.
+**UPDATE:** Due to a change in conditions on API usage, Twitch.tv requires an API key, but we've built a workaround. Use <a href="https://twitch-proxy.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://twitch-proxy.freecodecamp.rocks/</a> instead of Twitch's API base URL and you'll still be able to get account information, without needing to sign up for an API key.
 
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
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 4cbdb1f42fa..47d1dd2f49f 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
@@ -8,19 +8,52 @@ dashedName: book-recommendation-engine-using-knn
 
 # --description--
 
-在這個挑戰中，你將使用 K-近鄰算法創建一個書籍推薦算法。
+You will be <a href="https://colab.research.google.com/github/freeCodeCamp/boilerplate-book-recommendation-engine/blob/master/fcc_book_recommendation_knn.ipynb" target="_blank" rel="noopener noreferrer nofollow">working on this project with Google Colaboratory</a>.
 
-你將使用 Book-Crossings 數據集。 該數據集包括 90,000 名用戶對 270,000 冊書籍的 110 萬份評分（評分從 1至 10）。
+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."
 
-你可以[在 Replit 上查看整個項目的具體描述和初始代碼](https://colab.research.google.com/github/freeCodeCamp/boilerplate-book-recommendation-engine/blob/master/fcc_book_recommendation_knn.ipynb)。
+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.
 
-進入該鏈接後，在你自己的賬戶或本地創建一個筆記本的副本。 一旦你完成項目並通過鏈接中的測試，請在下面提交你的項目鏈接。 如果你提交的是 Google Colaboratory 的鏈接，請確保打開鏈接共享時選擇 “anyone with the link”。
+# --instructions--
 
-我們仍在開發機器學習課程的交互式課程部分。 現在，你可以通過這個認證視頻挑戰。 你可能還需要尋找額外的學習資源，類似於你在現實世界項目上所做的工作。
+In this challenge, you will create a book recommendation algorithm using **K-Nearest Neighbors**.
+
+You will use the <a href="http://www2.informatik.uni-freiburg.de/~cziegler/BX/" target="_blank" rel="noopener noreferrer nofollow">Book-Crossings dataset</a>. This dataset contains 1.1 million ratings (scale of 1-10) of 270,000 books by 90,000 users.
+
+After importing and cleaning the data, use `NearestNeighbors` from `sklearn.neighbors` to develop a model that shows books that are similar to a given book. The Nearest Neighbors algorithm measures the distance to determine the “closeness” of instances.
+
+Create a function named `get_recommends` that takes a book title (from the dataset) as an argument and returns a list of 5 similar books with their distances from the book argument.
+
+This code:
+
+```py
+get_recommends("The Queen of the Damned (Vampire Chronicles (Paperback))")
+```
+
+should return:
+
+```py
+[
+  'The Queen of the Damned (Vampire Chronicles (Paperback))',
+  [
+    ['Catch 22', 0.793983519077301], 
+    ['The Witching Hour (Lives of the Mayfair Witches)', 0.7448656558990479], 
+    ['Interview with the Vampire', 0.7345068454742432],
+    ['The Tale of the Body Thief (Vampire Chronicles (Paperback))', 0.5376338362693787],
+    ['The Vampire Lestat (Vampire Chronicles, Book II)', 0.5178412199020386]
+  ]
+]
+```
+
+Notice that the data returned from `get_recommends()` is a list. The first element in the list is the book title passed into the function. The second element in the list is a list of five more lists. Each of the five lists contains a recommended book and the distance from the recommended book to the book passed into the function.
+
+If you graph the dataset (optional), you will notice that most books are not rated frequently. To ensure statistical significance, remove from the dataset users with less than 200 ratings and books with less than 100 ratings.
+
+The first three cells import libraries you may need and the data to use. The final cell is for testing. Write all your code in between those cells.
 
 # --hints--
 
-它應該通過所有的 Python 測試。
+It should pass all Python tests.
 
 ```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 63788626c30..3da6ded87e9 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
@@ -8,17 +8,101 @@ dashedName: cat-and-dog-image-classifier
 
 # --description--
 
-在這個挑戰中，你將使用 TensorFlow 2.0 和 Keras 創建一個卷積神經網絡，對貓和狗的圖像進行正確分類，準確率至少達到 63%。
+You will be <a href="https://colab.research.google.com/github/freeCodeCamp/boilerplate-cat-and-dog-image-classifier/blob/master/fcc_cat_dog.ipynb" target="_blank" rel="noopener noreferrer nofollow">working on this project with Google Colaboratory</a>.
 
-你可以訪問 [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.
 
-我們仍在開發機器學習課程的交互式課程部分。 現在，你可以通過這個認證視頻挑戰。 你可能還需要尋找額外的學習資源，類似於你在真實世界項目中的工作。
+# --instructions--
+
+For this challenge, you will complete the code  to classify images of dogs and cats. You will use TensorFlow 2.0 and Keras to create a convolutional neural network that correctly classifies images of cats and dogs at least 63% of the time. (Extra credit if you get it to 70% accuracy!)
+
+Some of the code is given to you but some code you must fill in to complete this challenge. Read the instruction in each text cell so you will know what you have to do in each code cell.
+
+The first code cell imports the required libraries. The second code cell downloads the data and sets key variables. The third cell is the first place you will write your own code.
+
+The structure of the dataset files that are downloaded looks like this (You will notice that the test directory has no subdirectories and the images are not labeled):
+
+```py
+cats_and_dogs
+|__ train:
+    |______ cats: [cat.0.jpg, cat.1.jpg ...]
+    |______ dogs: [dog.0.jpg, dog.1.jpg ...]
+|__ validation:
+    |______ cats: [cat.2000.jpg, cat.2001.jpg ...]
+    |______ dogs: [dog.2000.jpg, dog.2001.jpg ...]
+|__ test: [1.jpg, 2.jpg ...]
+```
+
+You can tweak epochs and batch size if you like, but it is not required.
+
+The following instructions correspond to specific cell numbers, indicated with a comment at the top of the cell (such as `# 3`).
+
+## Cell 3
+
+Now it is your turn! Set each of the variables in this cell correctly. (They should no longer equal `None`.)
+
+Create image generators for each of the three image data sets (train, validation, test). Use `ImageDataGenerator` to read / decode the images and convert them into floating point tensors. Use the `rescale` argument (and no other arguments for now) to rescale the tensors from values between 0 and 255 to values between 0 and 1.
+
+For the `*_data_gen` variables, use the `flow_from_directory` method. Pass in the batch size, directory, target size (`(IMG_HEIGHT, IMG_WIDTH)`), class mode, and anything else required. `test_data_gen` will be the trickiest one. For `test_data_gen`, make sure to pass in `shuffle=False` to the `flow_from_directory` method. This will make sure the final predictions stay is in the order that our test expects. For `test_data_gen` it will also be helpful to observe the directory structure.
+
+
+After you run the code, the output should look like this:
+
+```py
+Found 2000 images belonging to 2 classes.
+Found 1000 images belonging to 2 classes.
+Found 50 images belonging to 1 class.
+```
+
+## Cell 4
+
+The `plotImages` function will be used a few times to plot images. It takes an array of images and a probabilities list, although the probabilities list is optional. This code is given to you. If you created the `train_data_gen` variable correctly, then running this cell will plot five random training images.
+
+## Cell 5
+
+Recreate the `train_image_generator` using `ImageDataGenerator`.
+
+Since there are a small number of training examples, there is a risk of overfitting. One way to fix this problem is by creating more training data from existing training examples by using random transformations.
+
+Add 4-6 random transformations as arguments to `ImageDataGenerator`. Make sure to rescale the same as before.
+
+## Cell 6
+
+You don't have to do anything for this cell. `train_data_gen` is created just like before but with the new `train_image_generator`. Then, a single image is plotted five different times using different variations.
+
+## Cell 7
+
+In this cell, create a model for the neural network that outputs class probabilities. It should use the Keras Sequential model. It will probably involve a stack of Conv2D and MaxPooling2D layers and then a fully connected layer on top that is activated by a ReLU activation function.
+
+Compile the model passing the arguments to set the optimizer and loss. Also pass in `metrics=['accuracy']` to view training and validation accuracy for each training epoch.
+
+## Cell 8
+
+Use the `fit` method on your `model` to train the network. Make sure to pass in arguments for `x`, `steps_per_epoch`, `epochs`, `validation_data`, and `validation_steps`.
+
+## Cell 9
+
+Run this cell to visualize the accuracy and loss of the model.
+
+## Cell 10
+
+Now it is time to use your model to predict whether a brand new image is a cat or a dog.
+
+In this cell, get the probability that each test image (from `test_data_gen`) is a dog or a cat. `probabilities` should be a list of integers.
+
+Call the `plotImages` function and pass in the test images and the probabilities corresponding to each test image.
+
+After you run the cell, you should see all 50 test images with a label showing the percentage of "sure" that the image is a cat or a dog. The accuracy will correspond to the accuracy shown in the graph above (after running the previous cell). More training images could lead to a higher accuracy.
+
+## Cell 11
+
+Run this final cell to see if you passed the challenge or if you need to keep trying.
 
 # --hints--
 
-它應該通過所有的 Python 測試。
+It should pass all Python tests.
 
 ```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 0b750356664..5aa9a9e6541 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
@@ -8,19 +8,33 @@ dashedName: linear-regression-health-costs-calculator
 
 # --description--
 
-在這個挑戰中，你將使用迴歸算法預測醫療費用。
+You will be <a href="https://colab.research.google.com/github/freeCodeCamp/boilerplate-linear-regression-health-costs-calculator/blob/master/fcc_predict_health_costs_with_regression.ipynb" target="_blank" rel="noopener noreferrer nofollow">working on this project with Google Colaboratory</a>.
 
-你會得到一個數據集，其中包含不同人的信息，包括他們的醫療費用。 用數據來預測基於新數據的醫療費用。
+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 上的完整項目說明和啓動代碼](https://colab.research.google.com/github/freeCodeCamp/boilerplate-linear-regression-health-costs-calculator/blob/master/fcc_predict_health_costs_with_regression.ipynb)。
+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.
 
-進入該鏈接後，在你自己的賬戶或本地創建一個筆記本的副本。 一旦你完成項目並通過鏈接中的測試，請在下面提交你的項目鏈接。 如果你提交的是 Google Colaboratory 的鏈接，請確保打開鏈接共享時選擇 “anyone with the link”。
+# --instructions--
 
-我們仍在開發機器學習課程的交互式課程部分。 現在，你可以通過這個認證中的視頻挑戰。 你可能還需要尋找額外的學習資源，類似於你在真實世界項目中的工作。
+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.
+
+The first two cells of this notebook import libraries and the data.
+
+Make sure to convert categorical data to numbers. Use 80% of the data as the `train_dataset` and 20% of the data as the `test_dataset`.
+
+`pop` off the "expenses" column from these datasets to create new datasets called `train_labels` and `test_labels`. Use these labels when training your model.
+
+Create a model and train it with the `train_dataset`. Run the final cell in this notebook to check your model. The final cell will use the unseen `test_dataset` to check how well the model generalizes.
+
+To pass the challenge, `model.evaluate` must return a Mean Absolute Error of under 3500. This means it predicts health care costs correctly within $3500.
+
+The final cell will also predict expenses using the `test_dataset` and graph the results.
 
 # --hints--
 
-它應該通過所有的 Python 測試。
+It should pass all Python tests.
 
 ```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 b7d8dd33b9d..5ef1f324d1e 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
@@ -8,17 +8,25 @@ dashedName: neural-network-sms-text-classifier
 
 # --description--
 
-在這個挑戰中，你需要創建一個機器學習模型，將短信分類爲 “ham” 或 “spam”。 “ham” 信息是由一個朋友發送的普通信息。 “spam” 是一個公司發送的廣告或信息。
+You will be <a href="https://colab.research.google.com/github/freeCodeCamp/boilerplate-neural-network-sms-text-classifier/blob/master/fcc_sms_text_classification.ipynb" target="_blank" rel="noopener noreferrer nofollow">working on this project with Google Colaboratory</a>.
 
-你可以訪問 [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.
 
-我們仍在開發機器學習課程的交互式課程部分。 現在，你可以通過這個認證中的視頻挑戰。 你可能還需要尋找額外的學習資源，類似於你在真實世界項目中的工作。
+# --instructions--
+
+In this challenge, you need to create a machine learning model that will classify SMS messages as either "ham" or "spam". A "ham" message is a normal message sent by a friend. A "spam" message is an advertisement or a message sent by a company.
+
+You should create a function called `predict_message` that takes a message string as an argument and returns a list. The first element in the list should be a number between zero and one that indicates the likeliness of "ham" (0) or "spam" (1). The second element in the list should be the word "ham" or "spam", depending on which is most likely.
+
+For this challenge, you will use the <a href="http://www.dt.fee.unicamp.br/~tiago/smsspamcollection/" target="_blank" rel="noopener noreferrer nofollow">SMS Spam Collection</a> dataset. The dataset has already been grouped into train data and test data.
+
+The first two cells import the libraries and data. The final cell tests your model and function. Add your code in between these cells.
 
 # --hints--
 
-它應該通過所有的 Python 測試。
+It should pass all Python tests.
 
 ```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 6e9ac405db1..90e2acc3fca 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
@@ -8,17 +8,57 @@ dashedName: rock-paper-scissors
 
 # --description--
 
-在這個挑戰中，你將創建一個程序來玩石頭、剪刀、布。 一個隨機選取的程序通常會有 50% 的時間獲勝。 要通過這一挑戰，你的程序必須與四個不同的機器人進行對戰，並達到至少 60% 勝率。
+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.
 
-你可以訪問 [Replit 上的完整項目描述和啓動代碼](https://replit.com/github/freeCodeCamp/boilerplate-rock-paper-scissors)。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-rock-paper-scissors" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
-進入該鏈接後，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.
 
-我們仍在開發機器學習課程的交互式課程部分。 現在，你需要使用其他資源來學習如何通過這一挑戰。
+# --instructions--
+
+In the file `RPS.py` you are provided with a function called `player`. The function takes an argument that is a string describing the last move of the opponent ("R", "P", or "S"). The function should return a string representing the next move for it to play ("R", "P", or "S").
+
+A player function will receive an empty string as an argument for the first game in a match since there is no previous play.
+
+The file `RPS.py` shows an example function that you will need to update. The example function is defined with two arguments (`player(prev_play, opponent_history = [])`). The function is never called with a second argument so that one is completely optional. The reason why the example function contains a second argument (`opponent_history = []`) is because that is the only way to save state between consecutive calls of the `player` function. You only need the `opponent_history` argument if you want to keep track of the opponent_history.
+
+*Hint: To defeat all four opponents, your program may need to have multiple strategies that change depending on the plays of the opponent.*
+
+## Development
+
+Do not modify `RPS_game.py`. Write all your code in `RPS.py`. For development, you can use `main.py` to test your code.
+
+`main.py` imports the game function and bots from `RPS_game.py`.
+
+To test your code, play a game with the `play` function. The `play` function takes four arguments:
+
+- two players to play against each other (the players are actually functions)
+- the number of games to play in the match
+- an optional argument to see a log of each game. Set it to `True` to see these messages.
+
+```py
+play(player1, player2, num_games[, verbose])
+```
+
+For example, here is how you would call the function if you want `player` and `quincy` to play 1000 games against each other and you want to see the results of each game:
+
+```py
+play(player, quincy, 1000, verbose=True)
+```
+
+Click the "run" button and `main.py` will run.
+
+## Testing
+
+The unit tests for this project are in `test_module.py`. We imported the tests from `test_module.py` to `main.py` for your convenience. If you uncomment the last line in `main.py`, the tests will run automatically whenever you hit the "run" button.
+
+## Submitting
+
+Copy your project's URL and submit it below.
 
 # --hints--
 
-它應該通過所有的 Python 測試。
+It should pass all Python tests.
 
 ```js
 
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 d3ac21c3b0c..ada0426d6f0 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
@@ -14,7 +14,7 @@ dashedName: neural-networks-activation-functions
 
 ## --text--
 
-哪個激活函數在 -1 和 1 之間切換值？
+Which activation function squishes values between -1 and 1?
 
 ## --answers--
 
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md
index a8bb0cf51a9..4ffdba5ea38 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md
@@ -91,7 +91,7 @@ const el = document.getElementById('name')
 assert(!!el && el.required)
 ```
 
-你的 `#name` 元素應該是 `#survey-form` 元素的子元素。
+Your `#name` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #name')
@@ -119,7 +119,7 @@ const el = document.getElementById('email')
 assert(!!el && el.required)
 ```
 
-你的 `#email` 元素應該是 `#survey-form` 元素的子元素。
+Your `#email` should be a descendant of `#survey-form`
 
 ```js
 const el = document.querySelector('#survey-form #email')
@@ -133,7 +133,7 @@ const el = document.getElementById('number')
 assert(!!el && el.tagName === 'INPUT')
 ```
 
-你的 `#number` 元素應該是 `#survey-form` 元素的子元素。
+Your `#number` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #number')
@@ -203,21 +203,21 @@ const el = document.getElementById('number-label')
 assert(!!el && el.innerText.length > 0)
 ```
 
-你的 `#name-label` 元素應該是 `#survey-form` 元素的子元素。
+Your `#name-label` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #name-label')
 assert(!!el)
 ```
 
-你的 `#email-label` 元素應該是 `#survey-form` 元素的子元素。
+Your `#email-label` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #email-label')
 assert(!!el)
 ```
 
-你的 `#number-label` 元素應該是 `#survey-form` 元素的子元素。
+Your `#number-label` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #number-label')
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
index 6b6aa210d0e..4c6347c1bdf 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
@@ -9,7 +9,7 @@ dashedName: step-56
 
 要使 `input` 框彼此對齊，請將所有 `.info` 元素內 `input` 和 `label` 元素的 `display` 屬性設置爲 `inline-block`。
 
-此外，將文本向右對齊。
+Also, align the `label` element's text to the right.
 
 # --hints--
 
@@ -28,22 +28,14 @@ const display = gs('.info > label, .info > input') ?? gs('.info label, .info inp
 assert.equal(display, 'inline-block');
 ```
 
-你應該給 `input` 和 `label` 元素添加 `text-align` 值爲 `right`。
+You should give the `label` element a `text-align` of `right`.
 
 ```js
 const gs = (s) => new __helpers.CSSHelp(document).getStyle(s)?.textAlign;
-const textAlign = gs('.info > label, .info > input') ?? gs('.info label, .info input') ?? gs('.info > input, .info > label') ?? gs('.info input, .info label');
+const textAlign = gs('.info > label') ?? gs('.info label');
 assert.equal(textAlign, 'right');
 ```
 
-你應該在 `.info input` 規則之前設置 `text-align: right` 屬性。
-
-```js
-const gs = (s) => new __helpers.CSSHelp(document).getStyleRule(s);
-assert(gs('.info input').isDeclaredAfter('.info label, .info input') || gs('.info input').isDeclaredAfter('.info > label, .info > input') || gs('.info input').isDeclaredAfter('.info > input, .info > label') || gs('.info input').isDeclaredAfter('.info input, .info label'));
-
-```
-
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
index 36e9c145202..938b3ddfba0 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
@@ -286,7 +286,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -297,6 +296,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 --fcc-editable-region--
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
index efcf3f714e5..43c4d88cd75 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
@@ -272,7 +272,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -283,6 +282,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
index b75ca773f3d..58eaae107bb 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
@@ -262,7 +262,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -273,6 +272,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
index 877a6d06d15..059b3554470 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
@@ -260,7 +260,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -271,6 +270,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
index d9c617f5871..91fc6e4ac2f 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
@@ -300,7 +300,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -311,6 +310,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
index 8e82a9e3c84..fb3e7f34e77 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
@@ -266,7 +266,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -277,6 +276,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
index 02959aed094..8a8182ddcbd 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
@@ -280,7 +280,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -291,6 +290,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
index dcfaf315cfb..0b668065951 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
@@ -278,7 +278,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -289,6 +288,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
index ba829699319..a6c346dddc1 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
@@ -260,7 +260,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -271,6 +270,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
index a1068f60d72..ef18def1299 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
@@ -278,7 +278,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -289,6 +288,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
index e51e840e3c0..681562e0cb8 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
@@ -280,7 +280,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -291,6 +290,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
@@ -603,12 +603,12 @@ input {
 .info label,
 .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .info input {
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
index 0698dbba029..d978485e917 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
@@ -7,38 +7,33 @@ dashedName: step-5
 
 # --description--
 
-咖啡廳的名稱是 `CAMPER CAFE`。 你的 `body` 元素中應該有一個 `h1` 元素。 用大寫字母顯示咖啡店名，使其突出顯示。
+It's time to add some menu content. Add a `main` element within the existing `body` element. It will eventually contain pricing information about coffee and desserts offered by the cafe.
 
 # --hints--
 
-你應該有一個 `<h1>` 開始標籤。
+Your code should have an opening `<main>` tag.
 
 ```js
-assert(code.match(/<h1>/i));
+assert(code.match(/<main>/i));
 ```
 
-你應該有一個 `</h1>` 結束標籤。
+Your code should have a closing `</main>` tag.
 
 ```js
-assert(code.match(/<\/h1>/i));
+assert(code.match(/<\/main>/i));
 ```
 
-你不應該改變你現有的 `body`元素。
+You should not change your `body` element. Make sure you don't accidentally delete your closing tag.
 
 ```js
 assert($('body').length === 1);
 ```
 
-你的 `h1` 元素應該嵌套在你的 `body` 元素中。
+Your `main` tag should be within your `body` tag.
 
 ```js
-assert($('h1')[0].parentElement.tagName === "BODY");
-```
-
-你的 `h1` 元素應該有文字 `CAMPER CAFE`。
-
-```js
-assert(code.match(/<h1>CAMPER CAFE<\/h1>/));
+const main = document.querySelector('main');
+assert(main.parentElement.tagName === 'BODY');
 ```
 
 # --seed--
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
index 12413a16e21..820b11358f7 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
@@ -7,38 +7,38 @@ dashedName: step-6
 
 # --description--
 
-爲了讓遊客知道這家咖啡館成立於 2020 年，在 `h1` 元素下面添加一個 `p`元素，文字爲 `Est. 2020`。
+The name of the cafe is `CAMPER CAFE`. Add an `h1` element within your `main` element. Give it the name of the cafe in capitalized letters to make it stand out.
 
 # --hints--
 
-你應該有一個 `<p>` 開始標籤。
+You should have an opening `<h1>` tag.
 
 ```js
-assert(code.match(/<p>/i));
+assert(code.match(/<h1>/i));
 ```
 
-你應該有一個 `</p>` 結束標籤。
+You should have a closing `</h1>` tag.
 
 ```js
-assert(code.match(/<\/p>/i));
+assert(code.match(/<\/h1>/i));
 ```
 
-你不應該改變你現有的 `h1` 元素。 確認你沒有刪除結束標籤。
+You should not change your existing `main` element.
 
 ```js
-assert($('h1').length === 1);
+assert($('main').length === 1);
 ```
 
-你的 `p` 元素應該在 `h1` 元素的下面。
+Your `h1` element should be nested in your `main` element.
 
 ```js
-assert($('p')[0].previousElementSibling.tagName === 'H1');
+assert($('h1')[0].parentElement.tagName === "MAIN");
 ```
 
-你的 `p` 元素應該有文本 `Est. 2020`。
+Your `h1` element should have the text `CAMPER CAFE`.
 
 ```js
-assert(document.querySelector("p").innerText === "Est. 2020");
+assert(code.match(/<h1>CAMPER CAFE<\/h1>/));
 ```
 
 # --seed--
@@ -54,7 +54,8 @@ assert(document.querySelector("p").innerText === "Est. 2020");
   </head>
   <body>
 --fcc-editable-region--
-    <h1>CAMPER CAFE</h1>
+    <main>
+    </main>
 --fcc-editable-region--
   </body>
 </html>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
index e197cc1e11b..93fab4bf209 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
@@ -7,34 +7,38 @@ dashedName: step-7
 
 # --description--
 
-由於上一步添加的 `p` 元素提供了關於咖啡館的補充信息，因此將 `h1` 和 `p` 元素都嵌套在一個 `header`元素中。
+To let visitors know the cafe was founded in 2020, add a `p` element below the `h1` element with the text `Est. 2020`.
 
 # --hints--
 
-你應該有一個 `<header>` 開始標籤。
+You should have an opening `<p>` tag.
 
 ```js
-assert(code.match(/<header>/i));
+assert(code.match(/<p>/i));
 ```
 
-你應該有一個 `</header>` 結束標籤。
+You should have a closing `</p>` tag.
 
 ```js
-assert(code.match(/<\/header>/i));
+assert(code.match(/<\/p>/i));
 ```
 
-你的 `h1` 元素應該嵌套在你的 `header` 元素中。
+You should not change your existing `h1` element. Make sure you did not delete the closing tag.
 
 ```js
-const header = document.querySelectorAll('header')[0];
-assert(header.children[0].tagName === 'H1');
+assert($('h1').length === 1);
 ```
 
-你的 `p` 元素應該嵌套在你的 `header`元素中。
+Your `p` element should be below your `h1` element.
 
 ```js
-const header = document.querySelectorAll('header')[0];
-assert(header.children[1].tagName === "P");
+assert($('p')[0].previousElementSibling.tagName === 'H1');
+```
+
+Your `p` element should have the text `Est. 2020`.
+
+```js
+assert(document.querySelector("p").innerText === "Est. 2020");
 ```
 
 # --seed--
@@ -49,10 +53,11 @@ assert(header.children[1].tagName === "P");
     <title>Cafe Menu</title>
   </head>
   <body>
+    <main>
 --fcc-editable-region--
-    <h1>CAMPER CAFE</h1>
-    <p>Est. 2020</p>
+      <h1>CAMPER CAFE</h1>
 --fcc-editable-region--
+    </main>
   </body>
 </html>
 ```
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md
index dee74cfd7fd..7e196433574 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344f9c805cd193c33d829c
-title: 步驟 12
+title: Step 11
 challengeType: 0
-dashedName: step-12
+dashedName: step-11
 ---
 
 # --description--
@@ -56,11 +56,9 @@ assert(h1TextAlign === 'center');
 --fcc-editable-region--
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md
index 7484537f7d6..185b6de104d 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fad8bf01691e71a30eb
-title: 步驟 11
+title: Step 10
 challengeType: 0
-dashedName: step-11
+dashedName: step-10
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(code.match(/<head\s*>[\w\W\s]*<style\s*>[\w\W\s]*<\/style\s*>[\w\W\s]*<\/
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md
index f29db1f2c2d..c3cfba4627b 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fbc22624a2976425065
-title: 步驟 10
+title: Step 9
 challengeType: 0
-dashedName: step-10
+dashedName: step-9
 ---
 
 # --description--
@@ -55,11 +55,9 @@ assert(h2.innerText === 'Coffee');
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
 --fcc-editable-region--
       <section>
       </section>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
index 794662b3558..2866c9f4443 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fc1520b6719f2e35605
-title: 步驟 9
+title: Step 8
 challengeType: 0
-dashedName: step-9
+dashedName: step-8
 ---
 
 # --description--
@@ -32,8 +32,9 @@ assert($('main').length === 1);
 你的 `section`元素應該在你的 `main` 元素中。
 
 ```js
-const main = document.querySelectorAll('main')?.[0];
-assert(main.children[0].tagName === 'SECTION');
+const main = document.querySelector('main');
+const section = document.querySelector('section');
+assert(section.parentElement === main);
 ```
 
 # --seed--
@@ -48,12 +49,10 @@ assert(main.children[0].tagName === 'SECTION');
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
-      <h1>CAMPER CAFE</h1>
-      <p>Est. 2020</p>
-    </header>
 --fcc-editable-region--
     <main>
+      <h1>CAMPER CAFE</h1>
+      <p>Est. 2020</p>
     </main>
 --fcc-editable-region--
   </body>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md
index 204b9be78b3..7f42422f56f 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477ae34c1239cafe128be
-title: 步驟 14
+title: Step 13
 challengeType: 0
-dashedName: step-14
+dashedName: step-13
 ---
 
 # --description--
@@ -58,11 +58,9 @@ assert(selectors.length === 1);
 --fcc-editable-region--
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md
index dafdf2140b0..0a374004c96 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477ae8466a9a3d2cc953c
-title: 步驟 16
+title: Step 15
 challengeType: 0
-dashedName: step-16
+dashedName: step-15
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert(!code.match(/style/i));
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md
index 3ada86c6a24..36b2d0703ad 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md
@@ -1,13 +1,13 @@
 ---
 id: 5f3477ae9675db8bb7655b30
-title: 步驟 13
+title: Step 12
 challengeType: 0
-dashedName: step-13
+dashedName: step-12
 ---
 
 # --description--
 
-在上一步中，你使用 <dfn>類型選擇器</dfn> 來設置 `h1` 元素的樣式。 繼續將 `h2` 和 `p` 元素居中，每個元素都有一個新的類型選擇器。
+在上一步中，你使用 <dfn>類型選擇器</dfn> 來設置 `h1` 元素的樣式。 Center the `h2` and `p` elements by adding a new type selector for each one to the existing `style` element.
 
 # --hints--
 
@@ -18,35 +18,42 @@ const hasH1 = new __helpers.CSSHelp(document).getStyle('h1');
 assert(hasH1);
 ```
 
-你應該添加一個新的 `h2` 選擇器。
+You should not add a new `style` tag. Add the new CSS rules to the existing `style` tag.
+
+```js
+const hasManyStyleTags = document.querySelectorAll('style').length > 1;
+assert(!hasManyStyleTags);
+```
+
+You should add a new `h2` selector.
 
 ```js
 const hasH2 = new __helpers.CSSHelp(document).getStyle('h2');
 assert(hasH2);
 ```
 
-你應該添加一個新的 `p` 選擇器。
+You should add a new `p` selector.
 
 ```js
 const hasP = new __helpers.CSSHelp(document).getStyle('p');
 assert(hasP);
 ```
 
-你的 `h1` 元素應該有一個 `text-align` 值爲 `center`。
+Your `h1` element should have a `text-align` of `center`.
 
 ```js
 const h1TextAlign = new __helpers.CSSHelp(document).getStyle('h1')?.getPropertyValue('text-align');
 assert(h1TextAlign === 'center');
 ```
 
-你的 `h2` 元素應該有一個 `text-align` 值爲 `center`。
+Your `h2` element should have a `text-align` of `center`.
 
 ```js
 const h2TextAlign = new __helpers.CSSHelp(document).getStyle('h2')?.getPropertyValue('text-align');
 assert(h2TextAlign === 'center');
 ```
 
-你的 `p` 元素應該有一個 `text-align` 值爲 `center`。
+Your `p` element should have a `text-align` of `center`.
 
 ```js
 const pTextAlign = new __helpers.CSSHelp(document).getStyle('p')?.getPropertyValue('text-align');
@@ -72,11 +79,9 @@ assert(pTextAlign === 'center');
 --fcc-editable-region--
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
index d62841daff3..257a8d7b004 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477aefa51bfc29327200b
-title: 步驟 15
+title: Step 14
 challengeType: 0
-dashedName: step-15
+dashedName: step-14
 ---
 
 # --description--
@@ -54,11 +54,9 @@ dashedName: step-15
     </style>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md
index 0ff827cf129..07bdfd0fc45 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477cb2e27333b1ab2b955
-title: 步驟 17
+title: Step 16
 challengeType: 0
-dashedName: step-17
+dashedName: step-16
 ---
 
 # --description--
@@ -68,11 +68,9 @@ assert(link.dataset.href == 'styles.css')
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md
index 8bdbda5efa0..3dfcead55fe 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477cb303c5cb61b43aa9b
-title: 步驟 19
+title: Step 18
 challengeType: 0
-dashedName: step-19
+dashedName: step-18
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert(bodyBackground === 'brown');
     <link href="styles.css" rel="stylesheet"/>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md
index 5134d941c22..1c614fb469d 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477cbcb6ba47918c1da92
-title: 步驟 18
+title: Step 17
 challengeType: 0
-dashedName: step-18
+dashedName: step-17
 ---
 
 # --description--
@@ -52,11 +52,9 @@ assert(meta[0].outerHTML.match(/content=('|")width=device-width, initial-scale=1
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md
index bad64c93e50..f9cfc61d01b 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md
@@ -1,8 +1,8 @@
 ---
 id: 5f34a1fd611d003edeafd681
-title: 步驟 20
+title: Step 19
 challengeType: 0
-dashedName: step-20
+dashedName: step-19
 ---
 
 # --description--
@@ -39,11 +39,9 @@ assert(bodyBackground === 'burlywood');
     <link href="styles.css" rel="stylesheet"/>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
index 69769e0cbda..da8e2e03b82 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed60785e1f3e9850b6e
-title: 步驟 25
+title: Step 24
 challengeType: 0
-dashedName: step-25
+dashedName: step-24
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(!hasWidth);
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
index 104710911be..99ed6d7329f 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
@@ -1,9 +1,9 @@
 ---
 id: 5f356ed60a5decd94ab66986
-title: 步驟 23
+title: Step 22
 challengeType: 0
 removeComments: false
-dashedName: step-23
+dashedName: step-22
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(bodyCSS === "rgba(0, 0, 0, 0)")
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
index 3eda052e5af..de7771f41f3 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed6199b0cdef1d2be8f
-title: 步驟 27
+title: Step 26
 challengeType: 0
-dashedName: step-27
+dashedName: step-26
 ---
 
 # --description--
@@ -48,11 +48,9 @@ assert(!hasDiv);
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
index 5690d5cbfba..a78bfb1b29c 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed63c7807a4f1e6d054
-title: 步驟 22
+title: Step 21
 challengeType: 0
-dashedName: step-22
+dashedName: step-21
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(divWidth === '300px');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
index fb8ba89e58a..26bdbd79227 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed63e0fa262326eef05
-title: 步驟 24
+title: Step 23
 challengeType: 0
-dashedName: step-24
+dashedName: step-23
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(divBackground === 'burlywood');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
index 68a0972b0b8..9271da5b26a 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed656a336993abd9f7c
-title: 步驟 26
+title: Step 25
 challengeType: 0
-dashedName: step-26
+dashedName: step-25
 ---
 
 # --description--
@@ -49,11 +49,9 @@ assert(divMarginLeft === 'auto');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
index 722dce12dd2..926f6aae26c 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed69db0a491745e2bb6
-title: 步驟 28
+title: Step 27
 challengeType: 0
-dashedName: step-28
+dashedName: step-27
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert($('div').attr('class').includes('menu'));
 --fcc-editable-region--
     <div>
 --fcc-editable-region--
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
index f900422d4bb..9d7aaed358a 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed6cf6eab5f15f5cfe6
-title: 步驟 21
+title: Step 20
 challengeType: 0
-dashedName: step-21
+dashedName: step-20
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(div.parentElement.tagName === 'BODY');
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md
index 8395aebb05b..c7f15a0eead 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md
@@ -1,8 +1,8 @@
 ---
 id: 5f35e5c4321f818cdc4bed30
-title: 步驟 30
+title: Step 29
 challengeType: 0
-dashedName: step-30
+dashedName: step-29
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(article.previousElementSibling.tagName === 'H2');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
 --fcc-editable-region--
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md
index 7cebed63431..3b72cd70fde 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f35e5c44359872a137bd98f
-title: 步驟 29
+title: Step 28
 challengeType: 0
-dashedName: step-29
+dashedName: step-28
 ---
 
 # --description--
@@ -55,11 +55,9 @@ assert(bodyBackground === `url("https://cdn.freecodecamp.org/curriculum/css-cafe
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
index 84ebd26e7eb..2ed935cd80b 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d0fc037f7311b4ac8
-title: 步驟 39
+title: Step 38
 challengeType: 0
-dashedName: step-39
+dashedName: step-38
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(priceWidth === '50%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
index a67c52c02e8..d365499a060 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d28d7ad0de6470505
-title: 步驟 33
+title: Step 32
 challengeType: 0
-dashedName: step-33
+dashedName: step-32
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert($('.flavor')[0].innerText.match(/French Vanilla/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
index adf02a4cd1e..ed5f86e4cab 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d5414453fc2d7b480
-title: 步驟 32
+title: Step 31
 challengeType: 0
-dashedName: step-32
+dashedName: step-31
 ---
 
 # --description--
@@ -90,11 +90,9 @@ assert(children[1].innerText.match(/4\.50/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
 --fcc-editable-region--
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
index d68d207c89e..e29e364832f 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866daec9a49519871816
-title: 步驟 31
+title: Step 30
 challengeType: 0
-dashedName: step-31
+dashedName: step-30
 ---
 
 # --description--
@@ -52,11 +52,9 @@ assert(secondP.innerText.match(/3\.00/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
 --fcc-editable-region--
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
index 483dd3b6d57..0982b4d0b3b 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866dbf362f99b9a0c6d0
-title: 步驟 38
+title: Step 37
 challengeType: 0
-dashedName: step-38
+dashedName: step-37
 ---
 
 # --description--
@@ -53,11 +53,9 @@ assert(itemPDisplay === 'inline-block');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md
index 18551933084..7ef112a8a33 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866dd0d0275f01d4d847
-title: 步驟 40
+title: Step 39
 challengeType: 0
-dashedName: step-40
+dashedName: step-39
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(priceWidth === '49%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md
index 21a09abd754..8d3a5323c47 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866de7a5b784048f94b1
-title: 步驟 37
+title: Step 36
 challengeType: 0
-dashedName: step-37
+dashedName: step-36
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert($('article')[0].className === 'item');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
 --fcc-editable-region--
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md
index d52346d3aca..2e8d8bc5d42 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade94c6576e7f7b7953f
-title: 步驟 42
+title: Step 41
 challengeType: 0
-dashedName: step-42
+dashedName: step-41
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(priceWidth === '50%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md
index fcd09b2126c..7d902eeeb5c 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade9993019e26313fa8e
-title: 步驟 43
+title: Step 42
 challengeType: 0
-dashedName: step-43
+dashedName: step-42
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(articles[4] === items[4]);
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md
index 3f1b8253535..772c4fc8df6 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade99dda4e6071a85dfd
-title: 步驟 47
+title: Step 46
 challengeType: 0
-dashedName: step-47
+dashedName: step-46
 ---
 
 # --description--
@@ -50,11 +50,9 @@ assert($('main').children('section').length === 2);
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
 --fcc-editable-region--
         <section>
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md
index 57ff334e621..7dd2f90fca6 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade9fa77275d9f4efe62
-title: 步驟 41
+title: Step 40
 challengeType: 0
-dashedName: step-41
+dashedName: step-40
 ---
 
 # --description--
@@ -34,11 +34,9 @@ assert(code.match(/Vanilla<\/p><p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md
index a2da53d3609..280305c0e26 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md
@@ -1,15 +1,15 @@
 ---
 id: 5f3ef6e01f288a026d709587
-title: 步驟 67
+title: Step 66
 challengeType: 0
-dashedName: step-67
+dashedName: step-66
 ---
 
 # --description--
 
 你可以使用 `hr` 元素在不同內容的部分之間顯示一個分隔符。
 
-首先，在第一個 `header` 元素和 `main` 元素之間添加一個 `hr`元素。 注意：`hr` 元素是沒有結束標籤的。
+First, add an `hr` element between the `p` element with the class `established` and the first `section` element. 注意：`hr` 元素是沒有結束標籤的。
 
 # --hints--
 
@@ -20,10 +20,10 @@ assert(code.match(/<hr\s?\/?>/i));
 assert(!code.match(/<\/hr>/i));
 ```
 
-你不應該改變你現有的 `header` 元素。
+You should not change your existing `p` element with the class `established`.
 
 ```js
-assert($('header').length === 1);
+assert($('p.established').length === 1);
 ```
 
 你不應該改變你現有的 `main` 元素。
@@ -32,11 +32,11 @@ assert($('header').length === 1);
 assert($('main').length === 1);
 ```
 
-你的 `hr` 元素應該在你的 `header` 元素和 `main` 元素之間。
+Your `hr` element should be between your `p` element and your `section` element.
 
 ```js
-assert($('hr')[0].previousElementSibling.tagName === 'HEADER');
-assert($('hr')[0].nextElementSibling.tagName === 'MAIN');
+assert($('hr')[0].previousElementSibling.tagName === 'P');
+assert($('hr')[0].nextElementSibling.tagName === 'SECTION');
 ```
 
 # --seed--
@@ -55,11 +55,9 @@ assert($('hr')[0].nextElementSibling.tagName === 'MAIN');
   <body>
     <div class="menu">
 --fcc-editable-region--
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
index 1d9ae3d12ae..e634a1ef8af 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e03d719d5ac4738993
-title: 步驟 57
+title: Step 56
 challengeType: 0
-dashedName: step-57
+dashedName: step-56
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(menuMaxWidth === '500px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
index 1de280a7cac..f92cef23c78 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e04559b939080db057
-title: 步驟 56
+title: Step 55
 challengeType: 0
-dashedName: step-56
+dashedName: step-55
 ---
 
 # --description--
@@ -64,11 +64,9 @@ assert(menuPadding === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
index 7a5a2dcb4c4..2317f224b71 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e050279c7a4a7101d3
-title: 步驟 55
+title: Step 54
 challengeType: 0
-dashedName: step-55
+dashedName: step-54
 ---
 
 # --description--
@@ -63,11 +63,9 @@ assert(menuPaddingBottom === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
index b6066e4adbf..881de3e0990 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e05473f91f948724ab
-title: 步驟 58
+title: Step 57
 challengeType: 0
-dashedName: step-58
+dashedName: step-57
 ---
 
 # --description--
@@ -41,11 +41,9 @@ assert(bodyFontFamily === 'sans-serif');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
index 434c420407a..e40058e7e9b 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e056bdde6ae6892ba2
-title: 步驟 59
+title: Step 58
 challengeType: 0
-dashedName: step-59
+dashedName: step-58
 ---
 
 # --description--
@@ -54,11 +54,9 @@ assert($('h2').css('font-family').match(/impact/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
index a51838e50ef..e62195e2035 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e06d34faac0447fc44
-title: 步驟 61
+title: Step 60
 challengeType: 0
-dashedName: step-61
+dashedName: step-60
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(establishedFontStyle === 'italic');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md
index 809c3d22c3d..884c1b3034c 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e07276f782bb46b93d
-title: 步驟 64
+title: Step 63
 challengeType: 0
-dashedName: step-64
+dashedName: step-63
 ---
 
 # --description--
@@ -51,12 +51,10 @@ assert(footer.previousElementSibling.tagName === 'MAIN');
   </head>
   <body>
     <div class="menu">
-      <header>
-        <h1>CAMPER CAFE</h1>
-        <p class="established">Est. 2020</p>
-      </header>
 --fcc-editable-region--
       <main>
+        <h1>CAMPER CAFE</h1>
+        <p class="established">Est. 2020</p>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
index 96ac7adb3da..fb141fa8883 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0819d4f23ca7285e6
-title: 步驟 49
+title: Step 48
 challengeType: 0
-dashedName: step-49
+dashedName: step-48
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('section')[1].children[1].className === 'item');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
index 6b62acb3872..bb35aa9d834 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e087d56ed3ffdc36be
-title: 步驟 62
+title: Step 61
 challengeType: 0
-dashedName: step-62
+dashedName: step-61
 ---
 
 # --description--
@@ -45,13 +45,11 @@ assert($('.established').css('font-style') === 'italic');
   </head>
   <body>
     <div class="menu">
+      <main>
 --fcc-editable-region--
-      <header>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
 --fcc-editable-region--
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
index 8424b1577dc..149cb190b8f 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0a81099d9a697b550
-title: 步驟 65
+title: Step 64
 challengeType: 0
-dashedName: step-65
+dashedName: step-64
 ---
 
 # --description--
@@ -58,11 +58,9 @@ assert(document.querySelector("footer > p > a")?.href === "https://www.freecodec
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md
index 8b901e81aee..74812aed0f5 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0b431cc215bb16f55
-title: 步驟 66
+title: Step 65
 challengeType: 0
-dashedName: step-66
+dashedName: step-65
 ---
 
 # --description--
@@ -38,11 +38,9 @@ assert($('footer').children('p').last().text().match(/123 Free Code Camp Drive/i
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md
index e93c6753670..8e522b2eb7a 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0e0c3feaebcf647ad
-title: 步驟 48
+title: Step 47
 challengeType: 0
-dashedName: step-48
+dashedName: step-47
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('h2')[1].innerText.match(/Desserts/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md
index e430db20347..38d3d0a854a 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0e9629bad967cd71e
-title: 步驟 60
+title: Step 59
 challengeType: 0
-dashedName: step-60
+dashedName: step-59
 ---
 
 # --description--
@@ -35,11 +35,9 @@ assert(fontFamily === 'Impact, serif');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md
index 78cae93bb98..b2c8448b803 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0eaa7da26e3d34d78
-title: 步驟 54
+title: Step 53
 challengeType: 0
-dashedName: step-54
+dashedName: step-53
 ---
 
 # --description--
@@ -56,11 +56,9 @@ assert(menuPaddingRight === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md
index 6a4706fb71d..7bb595ac86a 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0f8c230bdd2349716
-title: 步驟 63
+title: Step 62
 challengeType: 0
-dashedName: step-63
+dashedName: step-62
 ---
 
 # --description--
@@ -56,11 +56,9 @@ assert(h2FontSize === '30px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
index b0462e8a381..1afc761d7cb 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3f26fa39591db45e5cd7a0
-title: 步驟 68
+title: Step 67
 challengeType: 0
-dashedName: step-68
+dashedName: step-67
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(hrHeight === '3px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md
index cd880413ac9..c079ef58d4a 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459225127805351a6ad057
-title: 步驟 69
+title: Step 68
 challengeType: 0
-dashedName: step-69
+dashedName: step-68
 ---
 
 # --description--
@@ -39,12 +39,10 @@ assert(hrBackgroundColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
index 5bdc8e7e133..c4e53c162e6 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459a7ceb8b5c446656d88b
-title: 步驟 70
+title: Step 69
 challengeType: 0
-dashedName: step-70
+dashedName: step-69
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(hrBorderColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
index 6efa1a7f10d..ee6b2afa670 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459cf202c2a3472fae6a9f
-title: 步驟 71
+title: Step 70
 challengeType: 0
-dashedName: step-71
+dashedName: step-70
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(hrHeight === '2px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
index 424b483274d..4fc83f49b4a 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459fd48bdc98491ca6d1a3
-title: 步驟 72
+title: Step 71
 challengeType: 0
-dashedName: step-72
+dashedName: step-71
 ---
 
 # --description--
@@ -39,13 +39,11 @@ assert($('hr')[1].nextElementSibling.tagName === 'FOOTER');
   </head>
   <body>
     <div class="menu">
-      <header>
-        <h1>CAMPER CAFE</h1>
-        <p class="established">Est. 2020</p>
-      </header>
-      <hr>
 --fcc-editable-region--
       <main>
+        <h1>CAMPER CAFE</h1>
+        <p class="established">Est. 2020</p>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md
index 721572750d0..733715c9112 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a05977e2fa49d9119437
-title: 步驟 73
+title: Step 72
 challengeType: 0
-dashedName: step-73
+dashedName: step-72
 ---
 
 # --description--
@@ -39,12 +39,10 @@ assert(bodyPadding === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md
index 179c4f15c77..45473a8667f 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a276c093334f0f6e9df4
-title: 步驟 74
+title: Step 73
 challengeType: 0
-dashedName: step-74
+dashedName: step-73
 ---
 
 # --description--
@@ -63,12 +63,10 @@ assert(itemPMarginBottom === '5px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md
index 68c0ad9524d..ba246f6e9e7 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a5a7c49a8251f0bdb527
-title: 步驟 75
+title: Step 74
 challengeType: 0
-dashedName: step-75
+dashedName: step-74
 ---
 
 # --description--
@@ -47,12 +47,10 @@ assert(itemPFontSize === '18px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md
index a624add46c5..873ee72f333 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a66d4a2b0453301e5a26
-title: 步驟 79
+title: Step 78
 challengeType: 0
-dashedName: step-79
+dashedName: step-78
 ---
 
 # --description--
@@ -54,12 +54,10 @@ assert(footerFontSize === '14px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md
index b93d69a43f8..efbe45df273 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b0731d39e15d54df4dfc
-title: 步驟 80
+title: Step 79
 challengeType: 0
-dashedName: step-80
+dashedName: step-79
 ---
 
 # --description--
@@ -48,12 +48,10 @@ assert(aColor === 'black');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md
index 6c63a8e5961..6dc7f2e3f63 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b25e7ec2405f166b9de1
-title: 步驟 81
+title: Step 80
 challengeType: 0
-dashedName: step-81
+dashedName: step-80
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(aVisitedColor === 'grey' || aVisitedColor === 'gray');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md
index 11077cb723c..932aa6a6c61 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b3c93c027860d9298dbd
-title: 步驟 82
+title: Step 81
 challengeType: 0
-dashedName: step-82
+dashedName: step-81
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(aHoverColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md
index 9c503d5baa5..2ba5802bade 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b45d099f3e621fbbb256
-title: 步驟 83
+title: Step 82
 challengeType: 0
-dashedName: step-83
+dashedName: step-82
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(aActiveColor === 'white');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md
index 0624260cb10..d980f0baa29 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b4c81cea7763550e40df
-title: 步驟 84
+title: Step 83
 challengeType: 0
-dashedName: step-84
+dashedName: step-83
 ---
 
 # --description--
@@ -40,12 +40,10 @@ assert(aActiveColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md
index d4e9ce3ae8c..94a447ef182 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b715301bbf667badc04a
-title: 步驟 85
+title: Step 84
 challengeType: 0
-dashedName: step-85
+dashedName: step-84
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(h1MarginTop === '0px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md
index 866c4714a96..51492875b41 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e270702a8456a664f0df
-title: 步驟 86
+title: Step 85
 challengeType: 0
-dashedName: step-86
+dashedName: step-85
 ---
 
 # --description--
@@ -40,12 +40,10 @@ assert(h1MarginBottom === '15px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md
index d158b639f8b..5ce783392dc 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e36e745ead58487aabf2
-title: 步驟 87
+title: Step 86
 challengeType: 0
-dashedName: step-87
+dashedName: step-86
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(addressMarginBottom === '5px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md
index d5628e3664a..3d97f1fa776 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e7a4750dd05b5a673920
-title: 步驟 88
+title: Step 87
 challengeType: 0
-dashedName: step-88
+dashedName: step-87
 ---
 
 # --description--
@@ -44,12 +44,10 @@ assert($('.address')[0].innerText.match(/123 Free Code Camp Drive/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md
index 8df6c42931d..8e600de6847 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e8284aae155c83015dee
-title: 步驟 89
+title: Step 88
 challengeType: 0
-dashedName: step-89
+dashedName: step-88
 ---
 
 # --description--
@@ -46,12 +46,10 @@ assert($('img').attr('alt').match(/coffee icon/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
 --fcc-editable-region--
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md
index cae729067a7..dccee1f122e 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46ede1ff8fec5ba656b44c
-title: 步驟 78
+title: Step 77
 challengeType: 0
-dashedName: step-78
+dashedName: step-77
 ---
 
 # --description--
@@ -32,12 +32,10 @@ assert(code.match(/\/\*\s*FOOTER\s*\*\//i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md
index 32f8e8b343e..d7ed8b8cf77 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46fc57528aa1c4b5ea7c2e
-title: 步驟 76
+title: Step 75
 challengeType: 0
-dashedName: step-76
+dashedName: step-75
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(bottomLineMargin === '25px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md
index 7fd33fe9b0f..db6b88c2afa 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md
@@ -1,8 +1,8 @@
 ---
 id: 5f4701b942c824109626c3d8
-title: 步驟 77
+title: Step 76
 challengeType: 0
-dashedName: step-77
+dashedName: step-76
 ---
 
 # --description--
@@ -38,12 +38,10 @@ assert($('hr')[1].className === 'bottom-line');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
index ede2a6a6ffe..17d4b3dee80 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
@@ -1,8 +1,8 @@
 ---
 id: 5f475bb508746c16c9431d42
-title: 步驟 90
+title: Step 89
 challengeType: 0
-dashedName: step-90
+dashedName: step-89
 ---
 
 # --description--
@@ -72,12 +72,10 @@ assert(imgMarginRight === 'auto');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
index 776cec33fc2..fcb391c882d 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f475e1c7f71a61d913836c6
-title: 步驟 91
+title: Step 90
 challengeType: 0
-dashedName: step-91
+dashedName: step-90
 ---
 
 # --description--
@@ -44,12 +44,10 @@ assert($('img').last().attr('alt').match(/pie icon/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md
index 43c157a2730..670e9f32d46 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f47633757ae3469f2d33d2e
-title: 步驟 46
+title: Step 45
 challengeType: 0
-dashedName: step-46
+dashedName: step-45
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(priceWidth === '25%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md
index b0a31d40bc0..a428f4410df 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f47fe7e31980053a8d4403b
-title: 步驟 92
+title: Step 91
 challengeType: 0
-dashedName: step-92
+dashedName: step-91
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(imgMarginTop === '-25px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
@@ -209,12 +207,10 @@ a:active {
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
index 7d15f95ee5d..9192cdf1226 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
@@ -1,8 +1,8 @@
 ---
 id: 5f716ad029ee4053c7027a7a
-title: 步驟 50
+title: Step 49
 challengeType: 0
-dashedName: step-50
+dashedName: step-49
 ---
 
 # --description--
@@ -50,11 +50,9 @@ assert($('article').last().children('p')[1].innerText.match(/1\.50/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
index 3c4cc69002b..4d5d1b8e03c 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
@@ -1,8 +1,8 @@
 ---
 id: 5f716bee5838c354c728a7c5
-title: 步驟 53
+title: Step 52
 challengeType: 0
-dashedName: step-53
+dashedName: step-52
 ---
 
 # --description--
@@ -84,11 +84,9 @@ assert(!code.match(/<\/p>\s+<p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md
index de4a954cb8e..480ec3d45c5 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7691dafd882520797cd2f0
-title: 步驟 44
+title: Step 43
 challengeType: 0
-dashedName: step-44
+dashedName: step-43
 ---
 
 # --description--
@@ -32,11 +32,9 @@ assert(!code.match(/<\/p>\s+<p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md
index 125e7c0cf75..3ff125662ad 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7692f7c5b3ce22a57788b6
-title: 步驟 45
+title: Step 44
 challengeType: 0
-dashedName: step-45
+dashedName: step-44
 ---
 
 # --description--
@@ -62,11 +62,9 @@ assert(p[10] === price[4]);
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md
index 3906105c83f..26590032080 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f769541be494f25449b292f
-title: 步驟 34
+title: Step 33
 challengeType: 0
-dashedName: step-34
+dashedName: step-33
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(flavorTextAlign === 'left');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md
index 93f57dc2a5a..1e39f4950af 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md
@@ -1,8 +1,8 @@
 ---
 id: 5f76967fad478126d6552b0d
-title: 步驟 35
+title: Step 34
 challengeType: 0
-dashedName: step-35
+dashedName: step-34
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('.price')[0].innerText.match(/3\.00/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md
index be852a469ec..ee4d5ca34a6 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md
@@ -1,8 +1,8 @@
 ---
 id: 5f769702e6e33127d14aa120
-title: 步驟 36
+title: Step 35
 challengeType: 0
-dashedName: step-36
+dashedName: step-35
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('.price').css('text-align') === 'right');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md
index e2fc3c57166..41dcda4548a 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7b87422a560036fd03ccff
-title: 步驟 51
+title: Step 50
 challengeType: 0
-dashedName: step-51
+dashedName: step-50
 ---
 
 # --description--
@@ -50,11 +50,9 @@ assert(!code.match(/<\/p>\s+<p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
index 4c7f4587596..d73081b14ac 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7b88d37b1f98386f04edc0
-title: 步驟 52
+title: Step 51
 challengeType: 0
-dashedName: step-52
+dashedName: step-51
 ---
 
 # --description--
@@ -35,11 +35,9 @@ assert(selector)
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md
index 1d9e393fc39..7448eb6775b 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md
@@ -7,30 +7,29 @@ dashedName: step-5
 
 # --description--
 
-最後，使用 `viewport` `<meta>` 標籤確保你的頁面在所有設備上看起來都一樣。
-
-在 `head` 中嵌套一個自閉合的 `meta` 元素。 給它一個 `name` 屬性值爲 `viewport`，和一個 `content` 屬性值爲 `width=device-width, initial-scale=1.0`。
+Add another self-closing `meta` element within the `head`. Give it a `name` attribute set to `viewport` and a `content` attribute set to `width=device-width, initial-scale=1.0` so your page looks the same on all devices.
 
 # --hints--
 
-你應該有兩個 `meta` 元素。
+You should have two `meta` elements.
 
 ```js
 const meta = document.querySelectorAll('meta');
 assert(meta?.length === 2);
 ```
 
-你的新 `meta` 元素應該是一個自閉合元素。
+Your new `meta` element should be a self-closing element.
 
 ```js
 assert(code.match(/<\/meta>/i) === null);
 ```
 
-你的新 `meta` 元素應將 `name` 屬性設置爲 `viewport`，並將 `content` 屬性設置爲 `width=device-width, initial-scale=1.0`。
+Your new `meta` element should have a `name` attribute set to `viewport`, and a `content` attribute set to `width=device-width, initial-scale=1.0`.
 
 ```js
 const meta = [...document.querySelectorAll('meta')];
-const target = meta?.find(m => m?.getAttribute('name') === 'viewport' && m?.getAttribute('content') === 'width=device-width, initial-scale=1.0');
+const reValidContent = /^\s*width\s*=\s*device-width\s*,\s*initial-scale\s*=\s*1(?:\.0)?\s*$/;
+const target = meta?.find(m => m?.getAttribute('name') === 'viewport' && reValidContent.test(m?.getAttribute('content')));
 assert.exists(target);
 ```
 
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3952facd25a83fe8083.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3952facd25a83fe8083.md
index 711a8a66a53..abe05cb0cc4 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3952facd25a83fe8083.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3952facd25a83fe8083.md
@@ -7,7 +7,7 @@ dashedName: step-20
 
 # --description--
 
-`::after` 用來創建一個僞元素，作爲已選中元素的最後一個子元素。 我們可以用它在最後一個圖像後添加一個空元素。 如果設置其 `width` 爲和 images 相同，如果是兩列布局，它會將最後一張圖像擠到左邊。 現在它居中顯示，因爲我們在 flex 容器上設置了 `justify-content: center`。
+`::after` 用來創建一個僞元素，作爲已選中元素的最後一個子元素。 You can use it to add an empty element after the last image. If you give it the same `width` as the images it will push the last image to the left when the gallery is in a two-column layout. Right now, it is in the center because you set `justify-content: center` on the flex container.
 
 例如：
 
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md
index 31e8e1ba2a8..0793acafb67 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md
@@ -9,7 +9,7 @@ dashedName: step-5
 
 HTML5 有些元素能夠指明不同的內容區域。 這些元素能讓你的 HTML 易於閱讀，並有助於搜索引擎優化（SEO）和無障礙訪問。
 
-指明一個主要區域，可通過在 `h1` 元素後面添加一個 `<main>` 開始標籤，並在 `p` 元素後面添加一個 `</main>` 結束標籤來實現。
+Identify the main section of this page by adding a `<main>` opening tag before the `h1` element, and a `</main>` closing tag after the `p` element.
 
 # --hints--
 
@@ -25,20 +25,20 @@ assert(document.querySelector('main'));
 assert(code.match(/<\/main\>/));
 ```
 
-你的 `main` 元素的開始標籤應該在 `h1` 元素的下方。 你把順序寫錯了。
+Your `main` element's opening tag should be below the `body` element. 你把順序寫錯了。
 
 ```js
 const main = document.querySelector('main');
-assert.equal(main?.previousElementSibling?.tagName, "H1");
+assert.equal(main?.previousElementSibling, null);
 ```
 
-你的 `main` 元素的開始標籤應該在 `h2` 元素上方。 你把順序寫錯了。
+Your `main` element's opening tag should be above the `h1` element. 你把順序寫錯了。
 
 ```js
-const collection = [...document.querySelectorAll('main,h2')].map(
+const collection = [...document.querySelectorAll('main,h1')].map(
   (node) => node.nodeName
 );
-assert(collection.indexOf('MAIN') < collection.indexOf('H2'));
+assert(collection.indexOf('MAIN') < collection.indexOf('H1'));
 ```
 
 你的 `main` 元素的開始標籤應該在 `p` 元素的下方。 你把順序寫錯了。
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md
index 3ffaa0597af..7acfbe7ce19 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md
@@ -7,9 +7,9 @@ dashedName: step-6
 
 # --description--
 
-在上一步中，你將 `h2` 元素、註釋和 `p` 元素嵌套在 `main` 元素中。 這叫作 *嵌套*。 嵌套的元素（子元素）的位置應該放在被他們嵌套的元素（父元素）中新的一行並且右側保留兩個空格的間距的後面。 這個間距被稱爲縮進，它被用來使 HTML 更容易讀。
+In the previous step, you put the `h1`, `h2`, comment, and `p` elements inside the `main` element. 這叫作 *嵌套*。 嵌套的元素（子元素）的位置應該放在被他們嵌套的元素（父元素）中新的一行並且右側保留兩個空格的間距的後面。 這個間距被稱爲縮進，它被用來使 HTML 更容易讀。
 
-`h2` 元素和註釋比下面代碼中的 `main` 元素多縮進了兩個空格。 使用鍵盤上的空格鍵在 `p` 元素前面再添加兩個空格，使其縮進得當。
+The `h1` element, `h2` element and the comment are indented two spaces more than the `main` element in the code below. 使用鍵盤上的空格鍵在 `p` 元素前面再添加兩個空格，使其縮進得當。
 
 # --hints--
 
@@ -34,7 +34,7 @@ assert(
 不應更改 `h2` 元素行上的縮進。 它的開始標籤前應該有 6 個空格。 可以重啓步驟來恢復原始縮進。
 
 ```js
-assert(code.toLowerCase().match(/<main\>\s*\n\s{6}<h2>/));
+assert(code.toLowerCase().match(/<\/h1\>\s*\n\s{6}<h2>/));
 ```
 
 你的代碼應該有註釋。 你從之前的步驟中刪除了註釋。
@@ -89,9 +89,9 @@ assert(code.toLowerCase().match(/-->\s*\n\s{6}<p>/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
---fcc-editable-region--
+    --fcc-editable-region--
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
     <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md
index 825762aee00..3feb1b1ad16 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md
@@ -47,8 +47,8 @@ assert(collection.indexOf('P') < collection.indexOf('IMG'));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md
index 65c51273481..6f7fb414e19 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md
@@ -46,8 +46,8 @@ assert(!/\<img\s+src\s*=\s*https:\/\/cdn\.freecodecamp\.org\/curriculum\/cat-pho
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md
index 80fcc21a2aa..f064d113b3d 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md
@@ -44,8 +44,8 @@ assert(altText.match(/A cute orange cat lying on its back\.?$/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md
index b3351512e9d..d9e26648894 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md
@@ -64,8 +64,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md
index f5a713ac1b8..40744dba057 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md
@@ -9,7 +9,7 @@ dashedName: step-11
 
 鏈接的文本必須放置在錨點元素（`a`）的起始和閉合標籤之間。 例如，`<a href="https://www.freecodecamp.org">click here to go to freeCodeCamp.org</a>` 就是一個包含着文本 `click here to go to freeCodeCamp.org` 的鏈接。
 
-將錨點文本 `cat photos` 添加到錨點元素中。 這將成爲鏈接的文本。
+Add the anchor text `link to cat pictures` to the anchor element. 這將成爲鏈接的文本。
 
 # --hints--
 
@@ -25,12 +25,12 @@ assert(document.querySelector('a'));
 assert(code.match(/<\/a\>/));
 ```
 
-你的錨點元素（`a`）中的文本應該是 `cat photos`。 確保將鏈接的文本放置在錨點元素（`a`）的起始和閉合標籤之間。
+Your anchor (`a`) element's text should be `link to cat pictures`. 確保將鏈接的文本放置在錨點元素（`a`）的起始和閉合標籤之間。
 
 ```js
 assert(
   document.querySelector('a').innerText.toLowerCase().replace(/\s+/g, ' ') ===
-    'cat photos'
+    'link to cat pictures'
 );
 ```
 
@@ -41,8 +41,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md
index 913ceca31ef..fdb6855b46d 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md
@@ -7,9 +7,10 @@ dashedName: step-12
 
 # --description--
 
-你現在可以在預覽中看到圖像旁邊帶下劃線的字樣 `cat photos`。 那是你的鏈接，點擊它一下。
+In the previous step you turned the words `link to cat pictures` into a link by placing them between opening and closing anchor (`a`) tags. You can do the same to words inside of an element, such as a `p` element.
+
+In the text of your `p` element, turn the words `cat photos` into a link to `https://freecatphotoapp.com` by adding opening and closing anchor (`a`) tags around these words.
 
-在你的 `p` 元素的文本中，將單詞 `cat photos` 轉換爲指向 `https://freecatphotoapp.com` 的鏈接，將這些單詞放到新創建的錨點元素內。
 
 # --hints--
 
@@ -19,7 +20,7 @@ dashedName: step-12
 assert($('p > a').length);
 ```
 
-鏈接的 href 值應爲 `https://freecatphotoapp.com`。 你可能忽略了 href 值或者有拼寫錯誤。
+The link's `href` value should be `https://freecatphotoapp.com`. You have either omitted the `href` value or have a typo.
 
 ```js
 const nestedAnchor = $('p > a')[0];
@@ -54,13 +55,13 @@ assert(pText.match(/click here to view more cat photos\.?$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
       <p>Click here to view more cat photos.</p>
-      <a href="https://freecatphotoapp.com">cat photos</a>
+      <a href="https://freecatphotoapp.com">link to cat pictures</a>
 --fcc-editable-region--
       <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back.">
     </main>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md
index 5405ad5ecd6..74773d661b5 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md
@@ -40,8 +40,8 @@ assert(document.querySelector('a').getAttribute('target') === '_blank');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md
index 3850f3545fa..c178baecd83 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md
@@ -73,8 +73,8 @@ assert(document.querySelector('img').parentNode.nodeName === 'A');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md
index 9c4e8a6f194..ba6f2c45abd 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md
index 7c3bdadb4b5..7363aad6410 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md
@@ -64,8 +64,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md
index d7a7a6279b5..8378b65893d 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md
@@ -37,10 +37,10 @@ assert(secondSectionLastElemNode.nodeName === 'UL');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
-      <h2>Cat Photos</h2>
+        <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
         <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
         <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
index 4a7c3dbd444..3b56c9c892f 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md
index 64d82769e66..d7b524e9045 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md
@@ -68,8 +68,8 @@ assert(!/\<img\s+.+\s+src\s*=\s*https:\/\/cdn\.freecodecamp\.org\/curriculum\/ca
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md
index 33f6044db61..d137b11bac0 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md
@@ -48,11 +48,11 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
-      <h2>Cat Photos</h2>
-      <!-- TODO: Add link to cat photos -->
+        <h2>Cat Photos</h2>
+        <!-- TODO: Add link to cat photos -->
         <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
         <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
       </section>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md
index 9a36d7cb541..dcf18169b84 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md
@@ -69,8 +69,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md
index b6723cd5da9..964c34b61ab 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md
@@ -55,8 +55,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md
index bda6e7893da..cbd1312d861 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md
@@ -51,8 +51,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
index 5619bf9fb64..7fa298f9946 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
@@ -62,8 +62,8 @@ assert.deepStrictEqual(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md
index d4827a4d757..80586ad50d9 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md
@@ -36,8 +36,8 @@ assert($('main > section')[1].lastElementChild.nodeName === 'FIGURE');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md
index ec8c48fcf9f..e3df2081f86 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
index 90376cb138d..d738195193e 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
@@ -63,8 +63,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md
index d6dd1974dae..5ea671607c6 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md
@@ -45,8 +45,8 @@ assert($('form')[0].innerHTML.trim().length === 0);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md
index 79fda607666..c73a0243be3 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md
@@ -71,8 +71,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md
index 51e21ada517..789178492c5 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md
@@ -64,8 +64,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md
index 1c61ecabbe4..5ad0a728047 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md
@@ -58,8 +58,8 @@ assert(!/\<\s*input\s+placeholder\s*=\s*cat\s+photo\s+url/i.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md
index 02ed62dadda..1e92dfcf6ac 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md
@@ -47,8 +47,8 @@ assert(collection.indexOf('INPUT') < collection.indexOf('BUTTON'));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md
index f88fa9c1d2b..4d444db7601 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md
@@ -45,8 +45,8 @@ assert($('input')[0].getAttribute('required') === '');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
index c447f3d0525..978c730f505 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
@@ -90,8 +90,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
index 8363c88c9d9..7f57138e686 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md
index fee3d880ad1..745faddcd8c 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md
@@ -57,8 +57,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md
index 2a6eb9928b3..13be9417aa3 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md
@@ -47,8 +47,8 @@ assert($('input')[0].id.match(/^indoor$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md
index 295f3532723..eefd5f8e798 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md
@@ -53,8 +53,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
index 90f8d091ab3..57b6eba97a1 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
@@ -75,8 +75,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md
index 19168e44651..ab040f72a46 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md
@@ -66,8 +66,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md
index 9b601616711..9bb9c4c3677 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md
@@ -59,8 +59,8 @@ assert(!$('input[type="checkbox"]')[2].hasAttribute('checked'));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md
index fbe3cadcb03..dcdd83b4430 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md
@@ -44,8 +44,8 @@ assert(document.querySelector('main').nextElementSibling.nodeName === 'FOOTER');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md
index bb79eb4e45d..6ed6fb01046 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md
@@ -44,8 +44,8 @@ assert(extraSpacesRemoved.match(/No Copyright - freeCodeCamp\.org$/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md
index fad46c932c8..176bac6e5b7 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md
@@ -55,8 +55,8 @@ assert(pText.match(/^no copyright - freecodecamp.org$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md
index c378e50501c..10f15059e5f 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md
@@ -46,8 +46,8 @@ assert(noSpaces.match(/\<\/head\>\<body\>/));
 <html>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
index c785b7b0fc1..429aaa61117 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
@@ -51,8 +51,8 @@ assert(document.title && document.title.toLowerCase() === 'catphotoapp');
   </head>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
index 3fb5fa9341e..2177cce5b8c 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
@@ -44,8 +44,8 @@ assert(code.match(/<html\s+lang\s*=\s*('|")en\1\s*>/gi));
     <title>CatPhotoApp</title>
   </head>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md
index 293cf5c60ca..5d52a11113d 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md
@@ -38,8 +38,8 @@ assert(noSpaces.match(/^\<\!DOCTYPEhtml\>\<html/));
   </head>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md
index 3a5f7498e89..e2762744a4f 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md
@@ -61,8 +61,8 @@ assert(!/\<img\s+.+\s+src\s*=\s*https:\/\/cdn\.freecodecamp\.org\/curriculum\/ca
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md
index ad2095cdf58..2f2633ae212 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md
@@ -60,8 +60,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md
index 05f90b231c5..6d37ce7b17d 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md
@@ -84,8 +84,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md
index 40981aae982..f048c067f78 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md
@@ -58,8 +58,8 @@ assert(!/\<input\s+type\s*=\s*text/.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md
index a81ab9b0961..85897f5b904 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md
@@ -54,8 +54,8 @@ assert(!/\<\s*button\s+type\s*=\s*submit/i.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
index 486ba517054..0676ff9b1c8 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
@@ -80,8 +80,8 @@ assert(labelElem.textContent.replace(/\s/g, '').match(/Loving/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md
index 45b3b8418df..f7eba56ce5a 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md
@@ -42,8 +42,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md
index 6cfdfc80868..e638795c1a2 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md
@@ -30,8 +30,8 @@ assert($('input[type="checkbox"]')[0].id.match(/^loving$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md
index 5754dff2c3e..38580bf10da 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md
@@ -67,8 +67,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
index 5d84d9b2ce3..e99f2fd93b0 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
@@ -88,8 +88,8 @@ assert(code.match(/<\/label>\s*<label\s*>\s*<input [^>]+>\s*Outdoor/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md
index 845448aebd4..e2fa2c04b23 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md
@@ -9,7 +9,7 @@ dashedName: step-16
 
 在添加任何新內容之前，你應該使用 `section` 元素將貓咪照片內容與未來的內容分開。
 
-將當前位於 `main` 元素中的所有元素嵌套在 `section` 元素中。
+Take your `h2`, comment, `p`, and anchor (`a`) elements and nest them in a `section` element.
 
 # --hints--
 
@@ -35,10 +35,18 @@ assert(document.querySelector('section').parentNode.nodeName === 'MAIN');
 
 ```js
 const childrenOfSection = [...document.querySelector('section').childNodes];
-const foundElems = childrenOfSection.filter((child) => {
+const foundElements = childrenOfSection.filter((child) => {
   return ['H2', 'A', 'P'].includes(child.nodeName);
 });
-assert(foundElems.length === 3);
+assert(foundElements.length === 3);
+```
+
+The `h1` element should not be nested in the `section` element.
+
+```js
+const childrenOfSection = [...document.querySelector('section').childNodes];
+const includesH1 = childrenOfSection.some((child) => child.nodeName === 'H1');
+assert.isFalse(includesH1);
 ```
 
 # --seed--
@@ -48,9 +56,9 @@ assert(foundElems.length === 3);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
---fcc-editable-region--
+    --fcc-editable-region--
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md
index e5035001157..554cb25d523 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md
@@ -64,8 +64,8 @@ assert(foundElems.length === 2);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
 --fcc-editable-region--
       <section>
         <h2>Cat Photos</h2>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md
index 5edef09556c..5c4188f7074 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md
@@ -58,37 +58,37 @@ assert($('main > section')[2].children.length === 0);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
-      <h2>Cat Photos</h2>
-      <!-- TODO: Add link to cat photos -->
-      <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
-      <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
+        <h2>Cat Photos</h2>
+        <!-- TODO: Add link to cat photos -->
+        <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
+        <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
       </section>
 --fcc-editable-region--
       <section>
-      <h2>Cat Lists</h2>
-      <h3>Things cats love:</h3>
-      <ul>
-        <li>cat nip</li>
-        <li>laser pointers</li>
-        <li>lasagna</li>
-      </ul>
-      <figure>
-        <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/lasagna.jpg" alt="A slice of lasagna on a plate.">
-        <figcaption>Cats <em>love</em> lasagna.</figcaption>  
-      </figure>
-      <h3>Top 3 things cats hate:</h3>
-      <ol>
-        <li>flea treatment</li>
-        <li>thunder</li>
-        <li>other cats</li>
-      </ol>
-      <figure>
-        <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/cats.jpg" alt="Five cats looking around a field.">
-        <figcaption>Cats <strong>hate</strong> other cats.</figcaption>  
-      </figure>
+        <h2>Cat Lists</h2>
+        <h3>Things cats love:</h3>
+        <ul>
+          <li>cat nip</li>
+          <li>laser pointers</li>
+          <li>lasagna</li>
+        </ul>
+        <figure>
+          <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/lasagna.jpg" alt="A slice of lasagna on a plate.">
+          <figcaption>Cats <em>love</em> lasagna.</figcaption>  
+        </figure>
+        <h3>Top 3 things cats hate:</h3>
+        <ol>
+          <li>flea treatment</li>
+          <li>thunder</li>
+          <li>other cats</li>
+        </ol>
+        <figure>
+          <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/cats.jpg" alt="Five cats looking around a field.">
+          <figcaption>Cats <strong>hate</strong> other cats.</figcaption>  
+        </figure>
       </section>
 --fcc-editable-region--
     </main>
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md
index 5f6041ec2a1..2db69460b8a 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md
@@ -54,8 +54,8 @@ assert(extraSpacesRemoved.match(/Is your cat an indoor or outdoor cat\??$/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md
index abcb6c3e172..2edb0361dba 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md
@@ -76,8 +76,8 @@ assert(fieldsetChildren[0].length > fieldsetChildren[1].length);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md
index 82e061a1d53..5c9d7014747 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md
@@ -60,8 +60,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md
index b4b85083440..38c2a41576d 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md
@@ -60,8 +60,8 @@ assert(outdoorRadioButton.getAttribute('value').match(/^outdoor$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md
index b85ef61d124..70b3acca50b 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md
@@ -48,8 +48,8 @@ assert(energeticCheckbox.getAttribute('value').match(/^energetic$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md
index 86738b55928..69b5589e37b 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md
@@ -37,8 +37,8 @@ assert.equal(document.querySelector('head > meta')?.getAttribute('charset')?.toL
   </head>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
@@ -106,8 +106,8 @@ assert.equal(document.querySelector('head > meta')?.getAttribute('charset')?.toL
     <title>CatPhotoApp</title>
   </head>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md
index ccab61fe846..d97890c84b4 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md
@@ -69,8 +69,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md
index 6b1ced6a972..39f4bda06b3 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md
@@ -57,8 +57,8 @@ assert(!/\<\s*input\s+.*\s*=\s*catphotourl/.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md
index cab59d62b5a..4fb3975bb6b 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md
@@ -6,24 +6,25 @@ dashedName: step-8
 ---
 
 # --description--
+The `vh` unit stands for viewport height, and is relative to 1% of the `height` of the viewport.
 
-添加一些 CSS 來美化項目。 設置 `body` 的 `width` 爲 `100%`，`height` 爲 `100vh`。
+It is time to spruce the project up with some CSS. Begin by giving the `body` a `width` of `100%`, and a `height` of `100vh`.
 
 # --hints--
 
-應該使用 `body` 元素選擇器。
+You should use the `body` element selector.
 
 ```js
 assert.exists(new __helpers.CSSHelp(document).getStyle('body'));
 ```
 
-應該把 `body` 元素的 `width` 屬性值設置爲 `100%`。
+You should give the `body` a `width` of `100%`.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.width, '100%');
 ```
 
-應該把 `body` 的 `height` 設置爲 `100vh`。
+You should give the `body` a `height` of `100vh`.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.height, '100vh');
diff --git a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md
index caed4015e7e..995e63d1d3f 100644
--- a/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md
+++ b/curriculum/challenges/chinese-traditional/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md
@@ -6,24 +6,25 @@ dashedName: step-15
 ---
 
 # --description--
+The `rem` unit stands for root `em`, and is relative to the font size of the `html` element.
 
-由於 `label` 元素默認是 inline 行內元素，它們出現在其標籤文本的同一行，使得文本難以閱讀。 給 `label` 元素添加 `display: block`，並設置其 `margin` 爲 `0.5rem 0`，來使其顯示在不同的行，並且行之間有一定的距離。
+As `label` elements are inline by default, they are all displayed side by side on the same line, making their text hard to read. To make them appear on separate lines, add `display: block` to the `label` element, and add a `margin` of `0.5rem 0`, to separate them from each other.
 
 # --hints--
 
-應該使用 `label` 選擇器。
+You should use the `label` selector.
 
 ```js
 assert.exists(new __helpers.CSSHelp(document).getStyle('label'));
 ```
 
-應該將 `display` 屬性設置爲 `block`。
+You should add a `display` property of value `block`.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('label')?.display, 'block');
 ```
 
-應該將 `margin` 屬性設置爲 `0.5rem 0`。
+You should add a `margin` property of value `0.5rem 0`.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('label')?.margin, '0.5rem 0px');
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md
index 490ea3e8e2f..3cc2e9eb620 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md
@@ -14,7 +14,7 @@ const info = document.querySelector("#info");
 info.innerText = "Hello World";
 ```
 
-This code would change the element assigned to the `div` variable to have the text `Hello World`. 
+This code would change the element assigned to the `div` variable to have the text `Hello World`.
 
 When a player clicks your `Go to store` button, you want to change the buttons and text. Remove the code inside the `goStore` function and add a line that updates the text of `button1` to say `Buy 10 health (10 gold)`.
 
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md
index d5c3664e5ed..28ff0bb1ad6 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md
@@ -135,7 +135,7 @@ const monsterHealthText =document.querySelector("#monsterHealth");
 --fcc-editable-region--
 const locations = [
     {
-        
+
     }
 ];
 --fcc-editable-region--
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
index d91e6245ebe..8f9a534ce96 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
@@ -206,7 +206,7 @@ function buyWeapon() {
     gold -= 30;
     currentWeapon++;
     goldText.innerText = gold;
-    
+
     text.innerText = "You now have a new weapon.";
   }
 }
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
index 4b1f8fb6cb6..95d244d0f28 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
@@ -7,7 +7,7 @@ dashedName: step-90
 
 # --description--
 
-You can insert variables into a string with the <dfn>concatenation operator</dfn> `+`. Update the `You now have a new weapon.` string to say `You now have a ` and the name of the new weapon. Remember to end the sentence with a period.
+You can insert variables into a string with the <dfn>concatenation operator</dfn> `+`. Update the `You now have a new weapon.` string to say `You now have a` and the name of the new weapon. Remember to end the sentence with a period.
 
 Here is an example that creates the string `Hello, our name is freeCodeCamp.`:
 
@@ -18,7 +18,7 @@ const ourStr = "Hello, our name is " + ourName + ".";
 
 # --hints--
 
-You should update the `text.innerText` assignment to start with the string `You now have a `.
+You should update the `text.innerText` assignment to start with the string `You now have a`.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*=\s*('|")You now have a \1/);
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
index 748ab4d2f08..0adfafd5584 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
@@ -214,7 +214,7 @@ function buyWeapon() {
     goldText.innerText = gold;
     let newWeapon = weapons[currentWeapon].name;
     text.innerText = "You now have a " + newWeapon + ".";
-    
+
   }
 }
 --fcc-editable-region--
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
index b7219fb9be1..4037d95c48c 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
@@ -7,7 +7,7 @@ dashedName: step-92
 
 # --description--
 
-Up until now, any time `text.innerText` was updated the old text was erased. This time, use the `+=` operator to add text to the end of `text.innerText`. Add the string ` In your inventory you have: ` - include the spaces at the beginning and the end.
+Up until now, any time `text.innerText` was updated the old text was erased. This time, use the `+=` operator to add text to the end of `text.innerText`. Add the string `In your inventory you have:` - include the spaces at the beginning and the end.
 
 # --hints--
 
@@ -24,7 +24,7 @@ You should use the `+=` operator to add to `text.innerText`.
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*/)
 ```
 
-You should add the string ` In your inventory you have: ` to the end of `text.innerText`. Mind the spaces!
+You should add the string `In your inventory you have:` to the end of `text.innerText`. Mind the spaces!
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*('|")\sIn your inventory you have:\s\1/)
@@ -203,7 +203,7 @@ function buyWeapon() {
     let newWeapon = weapons[currentWeapon].name;
     text.innerText = "You now have a " + newWeapon + ".";
     inventory.push(newWeapon);
-    
+
   }
 }
 --fcc-editable-region--
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
index 098be4a56e6..908c77e836c 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
@@ -11,7 +11,7 @@ At the end of the second `text.innerText` string you just added, use the concate
 
 # --hints--
 
-You should not change the ` In your inventory you have: ` string.
+You should not change the `In your inventory you have:` string.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*('|")\sIn your inventory you have:\s\1/)
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
index 03e5cceea99..59e7717ce5b 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
@@ -7,7 +7,7 @@ dashedName: step-105
 
 # --description--
 
-After your `currentWeapon`, use the concatenation operator to set `text.innerText` to the string `You sold a `, then `currentWeapon`, then the string `.`.
+After your `currentWeapon`, use the concatenation operator to set `text.innerText` to the string `You sold a`, then `currentWeapon`, then the string `.`.
 
 # --hints--
 
@@ -17,13 +17,13 @@ You should use the assignment operator with `text.innerText`.
 assert.match(sellWeapon.toString(), /text\.innerText\s*=/);
 ```
 
-You should add `You sold a ` to `text.innerText`. Spacing is important.
+You should add `You sold a` to `text.innerText`. Spacing is important.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*=\s*('|")You sold a \1/);
 ```
 
-You should add the value of `currentWeapon` to the `You sold a ` string. Use the concatenation operator to do this on the same line.
+You should add the value of `currentWeapon` to the `You sold a` string. Use the concatenation operator to do this on the same line.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*=\s*('|")You sold a\s\1\s*\+\s*\_currentWeapon/);
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
index bc8435faa22..ab3661c3b47 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
@@ -7,7 +7,7 @@ dashedName: step-106
 
 # --description--
 
-Now use the `+=` operator to add the string ` In your inventory you have: ` and the contents of `inventory` to the `text.innerText`. Make sure to include the space at the beginning and end of the ` In your inventory you have: ` string.
+Now use the `+=` operator to add the string `In your inventory you have:` and the contents of `inventory` to the `text.innerText`. Make sure to include the space at the beginning and end of the `In your inventory you have:` string.
 
 # --hints--
 
@@ -25,7 +25,7 @@ const matches = sellWeapon.toString().match(/text\.innerText\s*\+=/g);
 assert.equal(matches.length, 1);
 ```
 
-You should add the string ` In your inventory you have: ` to the second `text.innerText` line. Spacing matters.
+You should add the string `In your inventory you have:` to the second `text.innerText` line. Spacing matters.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*\+=\s*('|") In your inventory you have: \1/);
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
index 229ca08f2a2..d332dfa1870 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
@@ -17,19 +17,19 @@ You should use dot notation to access the `innerText` property of `text`.
 assert.match(attack.toString(), /text\.innerText/);
 ```
 
-You should assign the string `The ` to `innerText` property of `text`.
+You should assign the string `The` to `innerText` property of `text`.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1/);
 ```
 
-You should use the concatenation operator to add the value of `monsters[fighting].name` to the `The ` string.
+You should use the concatenation operator to add the value of `monsters[fighting].name` to the `The` string.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1\s*\+\s*monsters\[fighting\]\.name/);
 ```
 
-You should use the concatenation operator to add the string ` attacks.` to the `monsters[fighting].name` string.
+You should use the concatenation operator to add the string `attacks.` to the `monsters[fighting].name` string.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1\s*\+\s*monsters\[fighting\]\.name\s*\+\s*('|") attacks\.\2/);
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
index 6566de3802a..a96685f85e9 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
@@ -7,7 +7,7 @@ dashedName: step-119
 
 # --description--
 
-On a new line, add the string ` You attack it with your [weapon].` to the `text` value, replacing `[weapon]` with the player's current weapon.
+On a new line, add the string `You attack it with your [weapon].` to the `text` value, replacing `[weapon]` with the player's current weapon.
 
 # --hints--
 
@@ -24,7 +24,7 @@ You should use compound assignment with `text.innerText`.
 assert.match(attack.toString(), /text\.innerText\s*\+=/);
 ```
 
-You should add the string ` You attack it with your ` to the `text.innerText` value. Remember that spacing matters.
+You should add the string `You attack it with your` to the `text.innerText` value. Remember that spacing matters.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|") You attack it with your \1/);
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
index a2c6fde768a..5e0e6059dff 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
@@ -279,7 +279,7 @@ function attack() {
   text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
   health -= monsters[fighting].level;
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
index acf1efd38b0..055ca35f7fe 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
@@ -275,7 +275,7 @@ function attack() {
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
   healthText.innerText = health;
   monsterHealthText.innerText = monsterHealth;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
index 3524f53b4a3..74b7964b09f 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
@@ -11,7 +11,7 @@ Inside the `dodge` function, set `text.innerText` equal to the string `You dodge
 
 # --hints--
 
-You should assign the string `You dodge the attack from the ` to the `text.innerText` property. Remember that spacing matters.
+You should assign the string `You dodge the attack from the` to the `text.innerText` property. Remember that spacing matters.
 
 ```js
 assert.match(dodge.toString(), /text\.innerText\s*=\s*('|")You dodge the attack from the \1/);
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
index cb9eadcb3ec..c2913614de6 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
@@ -283,7 +283,7 @@ function dodge() {
 function defeatMonster() {
   gold += Math.floor(monsters[fighting].level * 6.7);
   xp += monsters[fighting].level;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
index ca92f837431..0101b5e2285 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
@@ -285,7 +285,7 @@ function defeatMonster() {
   xp += monsters[fighting].level;
   goldText.innerText = gold;
   xpText.innerText = xp;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
index dd0068655fd..93d46489227 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
@@ -10,7 +10,7 @@ dashedName: step-132
 Your `locations` array doesn't have a fifth element, so `locations[4]` doesn't work. Add a new object at the end of the `locations` array, following the same structure as the other objects. Set `name` to `kill monster`, set `button text` to an array with three `Go to town square` strings, set `button functions` to an array with three `goTown` variables, and set `text` to `The monster screams Arg! as it dies. You gain experience points and find gold.`.
 
 # --hints--
- 
+
 Your `locations` array should have five values.
 
 ```js
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
index 3e9df421573..6b3bc12e219 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
@@ -280,7 +280,7 @@ function attack() {
   text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
   health -= getMonsterAttackValue(monsters[fighting].level);
   if (isMonsterHit()) {
-    
+
   }
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
   healthText.innerText = health;
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
index 88836e37794..8bf8c85ac0e 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
@@ -7,7 +7,7 @@ dashedName: step-150
 
 # --description--
 
-Add an `else` statement to your `if` statement. In the `else` statement, use the `+=` operator to add the text ` You miss.` to the end of `text.innerText`.
+Add an `else` statement to your `if` statement. In the `else` statement, use the `+=` operator to add the text `You miss.` to the end of `text.innerText`.
 
 # --hints--
 
@@ -17,7 +17,7 @@ You should add an `else` block after your `if (isMonsterHit())` block.
 assert.match(attack.toString(), /if\s*\(isMonsterHit\(\)\s*\)\s*\{\s*monsterHealth\s*-=\s*weapons\[currentWeapon\]\.power\s*\+\s*Math\.floor\(Math\.random\(\)\s*\*\s*xp\)\s*\+\s*1;\s*\}\s*else/)
 ```
 
-You should add the text ` You miss.` to the end of `text.innerText`. Remember to use compound assignment.
+You should add the text `You miss.` to the end of `text.innerText`. Remember to use compound assignment.
 
 ```js
 assert.match(attack.toString(), /if\s*\(isMonsterHit\(\)\s*\)\s*\{\s*monsterHealth\s*-=\s*weapons\[currentWeapon\]\.power\s*\+\s*Math\.floor\(Math\.random\(\)\s*\*\s*xp\)\s*\+\s*1;\s*\}\s*else\s*\{\s*text\.innerText\s*\+=\s*('|")\sYou miss\.\1/)
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
index 4210b69f7a8..02ffeb838f6 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
@@ -7,7 +7,7 @@ dashedName: step-154
 
 # --description--
 
-Use the `+=` operator to add ` Your [weapon] breaks.` to the end of `text.innerText`, replacing `weapon` with the last item in the `inventory` array. You can get this last item by using `inventory.pop()`, which will remove the last item in the array AND return it so it appears in your string.
+Use the `+=` operator to add `Your [weapon] breaks.` to the end of `text.innerText`, replacing `weapon` with the last item in the `inventory` array. You can get this last item by using `inventory.pop()`, which will remove the last item in the array AND return it so it appears in your string.
 
 # --hints--
 
@@ -30,14 +30,14 @@ You should add the string " Your " to `text.innerText`. Remember that spacing ma
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1/);
 ```
 
-You should add the return value of `inventory.pop()` to the ` Your ` string.
+You should add the return value of `inventory.pop()` to the `Your` string.
 
 ```js
 console.log(attack.toString());
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1\s*\+\s*inventory\.pop\(\)/);
 ```
 
-You should add ` breaks.` to the ` "Your " + inventory.pop()` string.
+You should add `breaks.` to the `"Your " + inventory.pop()` string.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1\s*\+\s*inventory\.pop\(\)\s*\+\s*('|")\sbreaks\.\2/);
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
index b043a04a1a5..bb3a88b2824 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
@@ -375,7 +375,7 @@ function pickEight() {
 --fcc-editable-region--
 function pick(guess) {
   let numbers = [];
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
index ac85513b88f..c0e732491ac 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
@@ -11,13 +11,13 @@ After the `while` loop, set `text.innerText` to equal `You picked [guess]. Here
 
 # --hints--
 
-You should set `text.innerText` to the string `You picked `. Remember that spacing matters.
+You should set `text.innerText` to the string `You picked`. Remember that spacing matters.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1/);
 ```
 
-You should use the concatenation operator to add the value of the `guess` parameter to your `You picked ` string.
+You should use the concatenation operator to add the value of the `guess` parameter to your `You picked` string.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1\s*\+\s*guess/);
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
index 3b20e162326..7b34447692f 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
@@ -11,7 +11,7 @@ Before the final quote in that string you added, insert the new line escape char
 
 # --hints--
 
-You should add the new line escape character `\n` to your `. Here are the random numbers: ` string.
+You should add the new line escape character `\n` to your `. Here are the random numbers:` string.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1\s*\+\s*guess\s*\+\s*('|")\.\sHere are the random numbers:\\n\2/);
diff --git a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
index 180270940d6..c57f4d75914 100644
--- a/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
+++ b/curriculum/challenges/chinese-traditional/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
@@ -369,7 +369,7 @@ function pick(guess) {
     numbers.push(Math.floor(Math.random() * 11));
   }
   text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/chinese/01-responsive-web-design/responsive-web-design-projects/build-a-survey-form.md b/curriculum/challenges/chinese/01-responsive-web-design/responsive-web-design-projects/build-a-survey-form.md
index d70515df0e7..6f444d2befd 100644
--- a/curriculum/challenges/chinese/01-responsive-web-design/responsive-web-design-projects/build-a-survey-form.md
+++ b/curriculum/challenges/chinese/01-responsive-web-design/responsive-web-design-projects/build-a-survey-form.md
@@ -91,7 +91,7 @@ const el = document.getElementById('name')
 assert(!!el && el.required)
 ```
 
-你的 `#name` 元素应该是 `#survey-form` 元素的子元素。
+Your `#name` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #name')
@@ -119,7 +119,7 @@ const el = document.getElementById('email')
 assert(!!el && el.required)
 ```
 
-你的 `#email` 元素应该是 `#survey-form` 元素的子元素。
+Your `#email` should be a descendant of `#survey-form`
 
 ```js
 const el = document.querySelector('#survey-form #email')
@@ -133,7 +133,7 @@ const el = document.getElementById('number')
 assert(!!el && el.tagName === 'INPUT')
 ```
 
-你的 `#number` 元素应该是 `#survey-form` 元素的子元素。
+Your `#number` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #number')
@@ -203,21 +203,21 @@ const el = document.getElementById('number-label')
 assert(!!el && el.innerText.length > 0)
 ```
 
-你的 `#name-label` 元素应该是 `#survey-form` 元素的子元素。
+Your `#name-label` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #name-label')
 assert(!!el)
 ```
 
-你的 `#email-label` 元素应该是 `#survey-form` 元素的子元素。
+Your `#email-label` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #email-label')
 assert(!!el)
 ```
 
-你的 `#number-label` 元素应该是 `#survey-form` 元素的子元素。
+Your `#number-label` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #number-label')
diff --git a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md
index 8c45b3ecec8..d4805808af1 100644
--- a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md
+++ b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md
@@ -8,7 +8,7 @@ dashedName: falsy-bouncer
 
 # --description--
 
-从数组中移除所有假值（falsy values）。
+Remove all falsy values from an array. Return a new array; do not mutate the original array.
 
 JavaScript 中的假值有 `false`、`null`、`0`、`""`、`undefined`、`NaN`。
 
@@ -40,6 +40,14 @@ assert.deepEqual(bouncer([false, null, 0, NaN, undefined, '']), []);
 assert.deepEqual(bouncer([null, NaN, 1, 2, undefined]), [1, 2]);
 ```
 
+You should not mutate `arr`.
+
+```js
+const arr = ['a', false, 0, 'Naomi'];
+bouncer(arr);
+assert.deepEqual(arr, ['a', false, 0, 'Naomi'])
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
index f52d89019ed..a7857ffc6e0 100644
--- a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
+++ b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
@@ -37,12 +37,6 @@ assert(code.match(/quotient/g).length === 1);
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function(y){return 'quotient = '+y;})(quotient);
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
index 0a19489a0b8..36cc5774e0e 100644
--- a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
+++ b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
@@ -11,12 +11,12 @@ dashedName: escape-sequences-in-strings
 
 引号不是字符串中唯一可以被转义（<dfn>escaped</dfn>）的字符。 使用转义字符有两个原因：
 
-1.  首先是可以让你使用无法输入的字符，例如退格。
+1.  To allow you to use characters you may not otherwise be able to type out, such as a newline.
 2.  其次是可以让你在一个字符串中表示多个引号，而不会出错。
 
 我们在之前的挑战中学到了这个。
 
-<table class='table table-striped'><thead><tr><th>代码</th><th>输出</th></tr></thead><tbody><tr><td><code>\'</code></td><td>单引号</td></tr><tr><td><code>\"</code></td><td>双引号</td></tr><tr><td><code>\\</code></td><td>反斜杠</td></tr><tr><td><code>\n</code></td><td>换行符</td></tr><tr><td><code>\r</code></td><td>回车符</td></tr><tr><td><code>\t</code></td><td>制表符</td></tr><tr><td><code>\b</code></td><td>退格</td></tr><tr><td><code>\f</code></td><td>换页符</td></tr></tbody></table>
+<table class='table table-striped'><thead><tr><th>代码</th><th>输出</th></tr></thead><tbody><tr><td><code>\'</code></td><td>单引号</td></tr><tr><td><code>\"</code></td><td>双引号</td></tr><tr><td><code>\\</code></td><td>反斜杠</td></tr><tr><td><code>\n</code></td><td>换行符</td></tr><tr><td><code>\t</code></td><td>tab</td></tr><tr><td><code>\r</code></td><td>carriage return</td></tr><tr><td><code>\b</code></td><td>退格</td></tr><tr><td><code>\f</code></td><td>换页符</td></tr></tbody></table>
 
 *请注意，必须对反斜杠本身进行转义，它才能显示为反斜杠。*
 
@@ -78,14 +78,6 @@ assert(myStr === 'FirstLine\n\t\\SecondLine\nThirdLine');
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function(){
-if (myStr !== undefined){
-console.log('myStr:\n' + myStr);}})();
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
index 317b064df48..588c689c7aa 100644
--- a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
+++ b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
@@ -31,12 +31,6 @@ assert(/var\s+a\s*=\s*9(\s*;?\s*)$/.test(code));
 
 # --seed--
 
-## --after-user-code--
-
-```js
-if(typeof a !== 'undefined') {(function(a){return "a = " + a;})(a);} else { (function() {return 'a is undefined';})(); }
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
index 255b74213c8..fee0ae114df 100644
--- a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
+++ b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
@@ -62,12 +62,6 @@ assert(code.match(/"/g).length === 4 && code.match(/'/g).length === 2);
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function() { return "myStr = " + myStr; })();
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
index 177b7bcc2f8..2d5604f954a 100644
--- a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
+++ b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
@@ -98,7 +98,7 @@ function nextInLine(arr, item) {
 }
 
 // Setup
-const testArr = [1, 2, 3, 4, 5];
+let testArr = [1, 2, 3, 4, 5];
 
 // Display code
 console.log("Before: " + JSON.stringify(testArr));
@@ -109,7 +109,7 @@ console.log("After: " + JSON.stringify(testArr));
 # --solutions--
 
 ```js
-const testArr = [1, 2, 3, 4, 5];
+let testArr = [1, 2, 3, 4, 5];
 
 function nextInLine(arr, item) {
     arr.push(item);
diff --git a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
index 1a0482dd519..8a371bcbbee 100644
--- a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
+++ b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
@@ -71,6 +71,13 @@ assert(
 );
 ```
 
+Global variables should not be used to cache the array.
+
+```js
+countdown(1)
+assert.deepStrictEqual(countdown(5), [5, 4, 3, 2, 1]);
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
index 751c0bb7523..ea22941ae38 100644
--- a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
+++ b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
@@ -56,6 +56,13 @@ assert.deepStrictEqual(rangeOfNumbers(6, 9), [6, 7, 8, 9]);
 assert.deepStrictEqual(rangeOfNumbers(4, 4), [4]);
 ```
 
+Global variables should not be used to cache the array.
+
+```js
+rangeOfNumbers(1, 3)
+assert.deepStrictEqual(rangeOfNumbers(6, 9), [6, 7, 8, 9]);
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
index 636aedb4884..640e4bfb6f7 100644
--- a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
+++ b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
@@ -12,24 +12,35 @@ ES6 提供了一个新的创建对象的语法，使用关键字 <dfn>class</dfn
 
 值得注意的是，`class` 只是一个语法糖，它并不像 Java、Python 或者 Ruby 这一类的语言一样，严格履行了面向对象的开发规范。
 
-在 ES5 里面，我们通常会定义一个构造函数 `constructor`，然后使用 `new` 关键字来实例化一个对象：
-
-```js
-var SpaceShuttle = function(targetPlanet){
-  this.targetPlanet = targetPlanet;
-}
-var zeus = new SpaceShuttle('Jupiter');
-```
-
-`class` 语法只是简单地替换了构造函数 `constructor` 的写法：
+In ES5, an object can be created by defining a `constructor` function and using the `new` keyword to instantiate the object.
+
+In ES6, a `class` declaration has a `constructor` method that is invoked with the `new` keyword. If the `constructor` method is not explicitly defined, then it is implicitly defined with no arguments.
 
 ```js
+// Explicit constructor
 class SpaceShuttle {
   constructor(targetPlanet) {
     this.targetPlanet = targetPlanet;
   }
+  takeOff() {
+    console.log("To " + this.targetPlanet + "!");
+  }
 }
+
+// Implicit constructor 
+class Rocket {
+  launch() {
+    console.log("To the moon!");
+  }
+}
+
 const zeus = new SpaceShuttle('Jupiter');
+// prints To Jupiter! in console
+zeus.takeOff();
+
+const atlas = new Rocket();
+// prints To the moon! in console
+atlas.launch();
 ```
 
 应该注意 `class` 关键字声明了一个新的函数，里面添加了一个构造函数。 当用 `new` 创建一个新的对象时，构造函数会被调用。
diff --git a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
index 066695ef966..b21c371322b 100644
--- a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
+++ b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
@@ -53,7 +53,8 @@ assert(
 `bicycle.setGear(48)` 应将 `gear` 的值改为 48。
 
 ```js
-assert(new bicycle.setGear(48).gear === 48);
+bicycle.setGear(48);
+assert(bicycle.gear === 48);
 ```
 
 # --seed--
diff --git a/curriculum/challenges/chinese/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/chinese/02-javascript-algorithms-and-data-structures/functional-programming/add-elements-to-the-end-of-an-array-using-concat-instead-of-push.md
index a8fa46301d5..06e79d7cabf 100644
--- a/curriculum/challenges/chinese/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/chinese/02-javascript-algorithms-and-data-structures/functional-programming/add-elements-to-the-end-of-an-array-using-concat-instead-of-push.md
@@ -10,20 +10,20 @@ dashedName: add-elements-to-the-end-of-an-array-using-concat-instead-of-push
 
 函数式编程就是创建和使用具有不变性的函数。
 
-上一个挑战介绍了 `concat` 方法，这是一种在不改变原始数组的前提下，将数组组合成新数组的方法。 将 `concat` 方法与 `push` 方法做比较。 `push` 将元素添加到调用它的数组的末尾，这样会改变该数组。 举个例子：
+The last challenge introduced the `concat` method as a way to merge arrays into a new array without mutating the original arrays. 将 `concat` 方法与 `push` 方法做比较。 `push` adds items to the end of the same array it is called on, which mutates that array. 举个例子：
 
 ```js
 const arr = [1, 2, 3];
-arr.push([4, 5, 6]);
+arr.push(4, 5, 6);
 ```
 
-`arr` 的值被修改为 `[1, 2, 3, [4, 5, 6]]`，这不是函数编程方式。
+`arr` would have a modified value of `[1, 2, 3, 4, 5, 6]`, which is not the functional programming way.
 
-`concat` 方法可以将新项目添加到数组末尾，而不产生副作用。
+`concat` offers a way to merge new items to the end of an array without any mutating side effects.
 
 # --instructions--
 
-修改 `nonMutatingPush` 函数，用 `concat` 替代 `push` 将 `newItem` 添加到 `original` 末尾。 该函数应返回一个数组。
+Change the `nonMutatingPush` function so it uses `concat` to merge `newItem` to the end of `original` without mutating `original` or `newItem` arrays. 该函数应返回一个数组。
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
index 3c24891a27b..0a8d48e6964 100644
--- a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
+++ b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
@@ -137,14 +137,6 @@ assert.strictEqual(
 
 # --seed--
 
-## --after-user-code--
-
-```js
-if(bob){
-  bob = new Person("Bob Ross");
-}
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
index de732831d06..1ce953ebb67 100644
--- a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
+++ b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
@@ -42,6 +42,13 @@ assert.deepEqual(steamrollArray([1, {}, [3, [[4]]]]), [1, {}, 3, 4]);
 assert(!code.match(/\.\s*flat\s*\(/) && !code.match(/\.\s*flatMap\s*\(/));
 ```
 
+Global variables should not be used.
+
+```js
+steamrollArray([1, {}, [3, [[4]]]])
+assert.deepEqual(steamrollArray([1, {}, [3, [[4]]]]), [1, {}, 3, 4])
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
index 1c60407c7d1..6c6b92d2310 100644
--- a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
+++ b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
@@ -47,28 +47,48 @@ sumPrimes(10);
 # --solutions--
 
 ```js
-function eratosthenesArray(n) {
-    var primes = [];
-    if (n > 2) {
-        var half = n>>1;
-        var sieve = Array(half);
-        for (var i = 1, limit = Math.sqrt(n)>>1; i <= limit; i++) {
-            if (!sieve[i]) {
-                for (var step = 2*i+1, j = (step*step)>>1; j < half; j+=step) {
-                    sieve[j] = true;
-                }
-            }
-        }
-        primes.push(2);
-        for (var p = 1; p < half; p++) {
-            if (!sieve[p]) primes.push(2*p+1);
+class PrimeSeive {
+  constructor(num) {
+    const seive = Array(Math.floor((num - 1) / 2)).fill(true);
+    const upper = Math.floor((num - 1) / 2);
+    const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+
+    for (let i = 0; i <= sqrtUpper; i++) {
+      if (seive[i]) {
+        // Mark value in seive array
+        const prime = 2 * i + 3;
+        // Mark all multiples of this number as false (not prime)
+        const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+        for (let j = primeSqaredIndex; j < upper; j += prime) {
+          seive[j] = false;
         }
+      }
     }
-    return primes;
-}
+
+    this._seive = seive;
+  }
+
+  isPrime(num) {
+    return num === 2
+      ? true
+      : num % 2 === 0
+        ? false
+        : this.isOddPrime(num);
+  }
+
+  isOddPrime(num) {
+    return this._seive[(num - 3) / 2];
+  }
+};
 
 function sumPrimes(num) {
-  return eratosthenesArray(num+1).reduce(function(a,b) {return a+b;}, 0);
+  const primeSeive = new PrimeSeive(num);
+
+  let sum = 2;
+  for (let i = 3; i <= num; i += 2) {
+    if (primeSeive.isOddPrime(i)) sum += i;
+  }
+  return sum;
 }
 
 sumPrimes(10);
diff --git a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
index 2d2bda77a8a..31ef10d49f4 100644
--- a/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
+++ b/curriculum/challenges/chinese/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
@@ -79,23 +79,55 @@ assert(beagle.constructor === Dog);
 `beagle.eat()` 应该记录字符串 `nom nom nom`
 
 ```js
-console.log = function (msg) {
-  throw msg;
-};
-assert.throws(() => beagle.eat(), 'nom nom nom');
+capture();
+beagle.eat();
+uncapture();
+assert(logOutput == 'nom nom nom');
 ```
 
 `beagle.bark()` 应该将字符串 `Woof!` 打印到控制台
 
 ```js
-console.log = function (msg) {
-  throw msg;
-};
-assert.throws(() => beagle.bark(), 'Woof!');
+capture();
+beagle.bark();
+uncapture();
+assert(logOutput == 'Woof!');
 ```
 
 # --seed--
 
+## --before-user-code--
+
+```js
+var logOutput = "";
+var originalConsole = console
+function capture() {
+    var nativeLog = console.log;
+    console.log = function (message) {
+        logOutput = message;
+        if(nativeLog.apply) {
+          nativeLog.apply(originalConsole, arguments);
+        } else {
+          var nativeMsg = Array.prototype.slice.apply(arguments).join(' ');
+          nativeLog(nativeMsg);
+        }
+    };
+}
+
+function uncapture() {
+  console.log = originalConsole.log;
+}
+
+capture();
+```
+
+## --after-user-code--
+
+```js
+uncapture();
+(function() { return logOutput || "console.log never called"; })();
+```
+
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/chinese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md b/curriculum/challenges/chinese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
index 20aac4014cb..ad1b10a6958 100644
--- a/curriculum/challenges/chinese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
+++ b/curriculum/challenges/chinese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
@@ -8,7 +8,7 @@ dashedName: build-a-25--5-clock
 
 # --description--
 
-**目标：** 构建一个应用，功能和 <a href="https://codepen.io/freeCodeCamp/full/XpKrrW" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/XpKrrW</a> 类似。
+**Objective:** Build an app that is functionally similar to this: <a href="https://25--5-clock.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://25--5-clock.freecodecamp.rocks</a>.
 
 完成以下需求，并且通过所有测试。 可以使用你需要的任何库或 API。 赋予它你自己的个人风格。
 
diff --git a/curriculum/challenges/chinese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md b/curriculum/challenges/chinese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
index 946d44618f8..710aa5c3b2f 100644
--- a/curriculum/challenges/chinese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
+++ b/curriculum/challenges/chinese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
@@ -8,7 +8,7 @@ dashedName: build-a-drum-machine
 
 # --description--
 
-**目标：** 构建一个应用，功能和 <a href="https://codepen.io/freeCodeCamp/full/MJyNMd" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/MJyNMd</a> 类似。
+**Objective:** Build an app that is functionally similar to this: <a href="https://drum-machine.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://drum-machine.freecodecamp.rocks/</a>.
 
 完成以下需求，并且通过所有测试。 可以使用你需要的任何库或 API。 赋予它你自己的个人风格。
 
diff --git a/curriculum/challenges/chinese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md b/curriculum/challenges/chinese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
index d2375f1671d..fa672c96114 100644
--- a/curriculum/challenges/chinese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
+++ b/curriculum/challenges/chinese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
@@ -8,7 +8,7 @@ dashedName: build-a-javascript-calculator
 
 # --description--
 
-**目标：** 构建一个应用，功能和 <a href="https://codepen.io/freeCodeCamp/full/wgGVVX" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/wgGVVX</a> 类似。
+**Objective:** Build an app that is functionally similar to this: <a href="https://javascript-calculator.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://javascript-calculator.freecodecamp.rocks/</a>.
 
 完成以下需求，并且通过所有测试。 可以使用你需要的任何库或 API。 赋予它你自己的个人风格。
 
diff --git a/curriculum/challenges/chinese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md b/curriculum/challenges/chinese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
index 3e1ce796f02..2f1caf79892 100644
--- a/curriculum/challenges/chinese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
+++ b/curriculum/challenges/chinese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
@@ -8,7 +8,7 @@ dashedName: build-a-markdown-previewer
 
 # --description--
 
-**目标：** 构建一个应用，功能和 <a href="https://codepen.io/freeCodeCamp/full/GrZVVO" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/GrZVVO</a> 类似。
+**Objective:** Build an app that is functionally similar to this: <a href="https://markdown-previewer.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://markdown-previewer.freecodecamp.rocks/</a>.
 
 完成以下需求，并且通过所有测试。 可以使用你需要的任何库或 API。 赋予它你自己的个人风格。
 
diff --git a/curriculum/challenges/chinese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md b/curriculum/challenges/chinese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
index dd2318ae982..a456f1d5ee6 100644
--- a/curriculum/challenges/chinese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
+++ b/curriculum/challenges/chinese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
@@ -8,7 +8,7 @@ dashedName: build-a-random-quote-machine
 
 # --description--
 
-**目标：** 构建一个应用，功能和 <a href="https://codepen.io/freeCodeCamp/full/qRZeGZ" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/qRZeGZ</a> 类似。
+**Objective:** Build an app that is functionally similar to this: <a href="https://random-quote-machine.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://random-quote-machine.freecodecamp.rocks/</a>.
 
 完成以下需求，并且通过所有测试。 可以使用你需要的任何库或 API。 赋予它你自己的个人风格。
 
diff --git a/curriculum/challenges/chinese/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md b/curriculum/challenges/chinese/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
index f5af9136f91..356c343b7d1 100644
--- a/curriculum/challenges/chinese/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
+++ b/curriculum/challenges/chinese/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
@@ -8,9 +8,9 @@ dashedName: visualize-data-with-a-bar-chart
 
 # --description--
 
-**目标：** 在 [CodePen.io](https://codepen.io) 上实现一个功能类似 <https://codepen.io/freeCodeCamp/full/GrZVaM> 的 App。
+**Objective:** Build an app that is functionally similar to this: <a href="https://bar-chart.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://bar-chart.freecodecamp.rocks</a>.
 
-在满足以下[需求](https://en.wikipedia.org/wiki/User_story)并能通过所有测试的前提下， 你可以根据自己的喜好来美化你的 app。
+完成以下需求，并且通过所有测试。 使用你需要的任何库或 API。 赋予它你自己的个人风格。
 
 你可以使用 HTML、JavaScript、CSS、以及基于 svg 的 D3 可视化库来完成这个挑战。 该任务需要使用 D3 的坐标轴属性生成坐标轴，这个属性会自动生成沿轴的刻度。 通过 D3 测试需要这些刻度，因为它们的位置被用来确定绘制元素的对齐方式。 你可以在这里 <https://github.com/d3/d3/blob/master/API.md#axes-d3-axis> 获取关于生成坐标轴的信息。 每次测试查询的元素都必须是非虚拟 DOM。 如果你使用了前端框架（例如 Vue），那么对于动态的内容测试结果可能不准确。 我们希望最终能够兼容这些框架，但 D3 项目目前还不支持它们。
 
@@ -42,7 +42,7 @@ dashedName: visualize-data-with-a-bar-chart
 
 以下是完成此项目所需的数据： `https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/GDP-data.json`
 
-你可以<a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>使用 CodePen 模板</a>来创建你的项目，点击 `Save` 即可创建你的项目。 或者你可以在任何你喜欢的环境中使用以下 CDN 链接来运行测试：`https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
+你可以<a href='https://codepen.io/pen?template=MJjpwO' target="_blank" rel="noopener noreferrer nofollow">使用 CodePen 模版</a>创建你的新项目，点击 `Save` 即可创建你的新项目。 或者你可以在任何你喜欢的环境中使用以下 CDN 链接来运行测试：`https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
 
 当你完成了本项目，并且该项目所有测试运行通过，请提交项目的 URL。
 
diff --git a/curriculum/challenges/chinese/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md b/curriculum/challenges/chinese/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
index a95e8b336c5..901a1d8dce3 100644
--- a/curriculum/challenges/chinese/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
+++ b/curriculum/challenges/chinese/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
@@ -8,9 +8,9 @@ dashedName: visualize-data-with-a-choropleth-map
 
 # --description--
 
-**目标：** 在 [CodePen.io](https://codepen.io) 上实现一个功能类似 <https://codepen.io/freeCodeCamp/full/EZKqza> 的 App。
+**Objective:** Build an app that is functionally similar to this: <a href="https://choropleth-map.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://choropleth-map.freecodecamp.rocks</a>.
 
-在满足以下[需求](https://en.wikipedia.org/wiki/User_story)并能通过所有测试的前提下， 你可以根据自己的喜好来美化你的 app。
+完成以下需求，并且通过所有测试。 你可以使用你需要的任何库或 API。 赋予它你自己的个人风格。
 
 你可以使用 HTML、JavaScript、CSS、以及基于 svg 的 D3 可视化库来完成这个挑战。 每次测试查询的元素都必须是非虚拟 DOM。 如果你使用了前端框架（例如 Vue），那么对于动态的内容测试结果可能不准确。 我们希望最终能够兼容这些框架，但 D3 项目目前还不支持它们。
 
@@ -41,7 +41,7 @@ dashedName: visualize-data-with-a-choropleth-map
 -   **US Education Data:** `https://cdn.freecodecamp.org/testable-projects-fcc/data/choropleth_map/for_user_education.json`
 -   **US County Data:** `https://cdn.freecodecamp.org/testable-projects-fcc/data/choropleth_map/counties.json`
 
-你可以<a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>使用 CodePen 模板</a>来创建你的项目，点击 `Save` 即可创建你的项目。 或者你可以在任何你喜欢的环境中使用以下 CDN 链接来运行测试：`https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
+你可以<a href='https://codepen.io/pen?template=MJjpwO' target="_blank" rel="noopener noreferrer nofollow">使用这份 CodePen 模版</a>来创建你的新项目，点击 `Save` 即可创建属于你自己的项目。 或者你可以在任何你喜欢的环境中使用以下 CDN 链接来运行测试：`https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
 
 当你完成了本项目，并且该项目所有测试运行通过，请提交项目的 URL。
 
diff --git a/curriculum/challenges/chinese/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md b/curriculum/challenges/chinese/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
index 061d24fac84..accae2145bb 100644
--- a/curriculum/challenges/chinese/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
+++ b/curriculum/challenges/chinese/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
@@ -8,9 +8,9 @@ dashedName: visualize-data-with-a-heat-map
 
 # --description--
 
-**目标：** 在 [CodePen.io](https://codepen.io) 上实现一个功能类似 <https://codepen.io/freeCodeCamp/full/JEXgeY> 的 App。
+**Objective:** Build an app that is functionally similar to this: <a href="https://heat-map.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://heat-map.freecodecamp.rocks</a>.
 
-在满足以下[需求](https://en.wikipedia.org/wiki/User_story)并能通过所有测试的前提下， 你可以根据自己的喜好来美化你的 app。
+完成以下需求，并且通过所有测试。 你可以使用你需要的任何库或 API。 赋予它你自己的个人风格。
 
 你可以使用 HTML、JavaScript、CSS、以及基于 svg 的 D3 可视化库来完成这个挑战。 每次测试查询的元素都必须是非虚拟 DOM。 如果你使用了前端框架（例如 Vue），那么对于动态的内容测试结果可能不准确。 我们希望最终能够兼容这些框架，但 D3 项目目前还不支持它们。
 
@@ -50,7 +50,7 @@ dashedName: visualize-data-with-a-heat-map
 
 以下是完成此项目所需的数据：`https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/global-temperature.json`
 
-你可以<a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>使用这个 CodePen 模板</a>来创建你的项目，点击 `Save` 即可创建你的项目。 或者你可以在任何你喜欢的环境中使用以下 CDN 链接来运行测试：`https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
+你可以<a href='https://codepen.io/pen?template=MJjpwO' target="_blank" rel="noopener noreferrer nofollow">使用 CodePen 模版</a>创建你的新项目，点击 `Save` 即可创建你的新项目。 或者你可以在任何你喜欢的环境中使用以下 CDN 链接来运行测试：`https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
 
 当你完成了本项目，并且该项目所有测试运行通过，请提交项目的 URL。
 
diff --git a/curriculum/challenges/chinese/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md b/curriculum/challenges/chinese/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
index e8d5b6027e4..8b6e0ed3e65 100644
--- a/curriculum/challenges/chinese/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
+++ b/curriculum/challenges/chinese/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
@@ -8,9 +8,9 @@ dashedName: visualize-data-with-a-scatterplot-graph
 
 # --description--
 
-**目标：** 在 [CodePen.io](https://codepen.io) 上实现一个功能类似 <https://codepen.io/freeCodeCamp/full/bgpXyK> 的 App。
+**Objective:** Build an app that is functionally similar to this: <a href="https://scatterplot-graph.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://scatterplot-graph.freecodecamp.rocks</a>.
 
-在满足以下[需求](https://en.wikipedia.org/wiki/User_story)并能通过所有测试的前提下， 你可以根据自己的喜好来美化你的 app。
+完成以下需求，并且通过所有测试。 你可以使用你需要的任何库或 API。 赋予它你自己的个人风格。
 
 你可以使用 HTML、JavaScript、CSS、以及基于 svg 的 D3 可视化库来完成这个挑战。 该任务需要使用 D3 的坐标轴属性生成坐标轴，这个属性会自动生成沿轴的刻度。 这些刻度是通过 D3 测试所必需的，因为它们的位置是用来确定图表元素的对齐方式。 你可以在这里 <https://github.com/d3/d3/blob/master/API.md#axes-d3-axis> 获取关于生成坐标轴的信息。 每次测试查询的元素都必须是非虚拟 DOM。 如果你使用了前端框架（例如 Vue），因为内容是动态渲染的，试结果可能不准确。 我们希望最终能够兼容这些框架，但 D3 框架目前还不支持它们。
 
@@ -46,7 +46,7 @@ dashedName: visualize-data-with-a-scatterplot-graph
 
 以下是完成此项目所需的数据：`https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/cyclist-data.json`
 
-你可以<a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>使用这个 CodePen 模板</a>来创建你的项目，点击 `Save` 即可创建你的项目。 或者你可以在任何你喜欢的环境中使用以下 CDN 链接来运行测试：`https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
+你可以<a href='https://codepen.io/pen?template=MJjpwO' target="_blank" rel="noopener noreferrer nofollow">使用 CodePen 模版</a>创建你的新项目，点击 `Save` 即可创建你的新项目。 或者你可以在任何你喜欢的环境中使用以下 CDN 链接来运行测试：`https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
 
 当你完成了本项目，并且项目通过所有测试，请提交项目的 URL。
 
diff --git a/curriculum/challenges/chinese/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md b/curriculum/challenges/chinese/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
index 293ecf91c14..6e15203525b 100644
--- a/curriculum/challenges/chinese/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
+++ b/curriculum/challenges/chinese/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
@@ -8,9 +8,9 @@ dashedName: visualize-data-with-a-treemap-diagram
 
 # --description--
 
-**目标：** 在 [CodePen.io](https://codepen.io) 上实现一个功能类似 <https://codepen.io/freeCodeCamp/full/KaNGNR> 的 App。
+**Objective:** Build an app that is functionally similar to this: <a href="https://treemap-diagram.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://treemap-diagram.freecodecamp.rocks</a>.
 
-在满足以下[需求](https://en.wikipedia.org/wiki/User_story)并能通过所有测试的前提下， 你可以根据自己的喜好来美化你的 app。
+完成以下需求，并且通过所有测试。 使用你需要的任何库或 API。 赋予它你自己的个人风格。
 
 你可以使用 HTML、JavaScript、CSS、以及基于 svg 的 D3 可视化库来完成这个挑战。 该任务需要使用 D3 的坐标轴属性生成坐标轴，这个属性会自动生成沿轴的刻度。 这些刻度是通过 D3 测试所必需的，因为它们的位置是用来确定图表元素的对齐方式。 你可以在这里 <https://github.com/d3/d3/blob/master/API.md#axes-d3-axis> 获取关于生成坐标轴的信息。 每次测试查询的元素都必须是非虚拟 DOM。 如果你使用了前端框架（例如 Vue），那么对于动态的内容测试结果可能不准确。 我们希望最终能够兼容这些框架，但 D3 项目目前还不支持它们。
 
@@ -42,7 +42,7 @@ dashedName: visualize-data-with-a-treemap-diagram
 -   **Movie Sales：** `https://cdn.freecodecamp.org/testable-projects-fcc/data/tree_map/movie-data.json`
 -   **Video Game Sales：** `https://cdn.freecodecamp.org/testable-projects-fcc/data/tree_map/video-game-sales-data.json`
 
-你可以<a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>使用 CodePen 模板</a>来创建你的项目，点击 `Save` 即可创建你的项目。 或者你可以在任何你喜欢的环境中使用以下 CDN 链接来运行测试：`https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
+你可以<a href='https://codepen.io/pen?template=MJjpwO' target="_blank" rel="noopener noreferrer nofollow">使用 CodePen 模版</a>创建你的新项目，点击 `Save` 即可创建你的新项目。 或者你可以在任何你喜欢的环境中使用以下 CDN 链接来运行测试：`https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
 
 当你完成了本项目，并且该项目所有测试运行通过，请提交项目的 URL。
 
diff --git a/curriculum/challenges/chinese/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md b/curriculum/challenges/chinese/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md
index 87921bac6b2..90897cbf5e1 100644
--- a/curriculum/challenges/chinese/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md
+++ b/curriculum/challenges/chinese/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md
@@ -10,9 +10,9 @@ dashedName: create-a-model
 
 **C** RUD 第一小节——CREATE
 
-首先，我们需要一个 Schema， 每一个 Schema 都对应一个 MongoDB 的 collection， 并且在相应的 collection 里定义 documents 的“样子”。 Schema 用于组成模型（Model）， 我们甚至可以通过嵌套 Schema 来创建复杂的模型。目前我们先从简。 我们可以根据模型创建实例，模型实例化后的对象称为 documents。
+First of all, we need a Schema. 每一个 Schema 都对应一个 MongoDB 的 collection， 并且在相应的 collection 里定义 documents 的“样子”。 Schemas are building blocks for Models. They can be nested to create complex models, but in this case, we'll keep things simple. 我们可以根据模型创建实例，模型实例化后的对象称为 documents。
 
-Replit 是一个真实的服务器，在其中，通过 handler 函数和数据库交互。 这些函数会在特定事件（比如有人调用了我们的服务器 API）发生时执行。 接下来的挑战题目即是以此为基础。 `done()` 是一个回调函数，它的作用是在一个异步操作（比如对数据库进行插入、查询、更新或删除）执行完成时，通知我们可以继续执行后续的其它代码。 这与 Node.js 中的处理方式十分类似，在 Node.js 中，我们会在（异步操作）成功时调用 `done(null, data)`，在失败时调用 `done(err)`。
+Replit is a real server, and in real servers, the interactions with the database happen in handler functions. 这些函数会在特定事件（比如有人调用了我们的服务器 API）发生时执行。 接下来的挑战题目即是以此为基础。 `done()` 是一个回调函数，它的作用是在一个异步操作（比如对数据库进行插入、查询、更新或删除）执行完成时，通知我们可以继续执行后续的其它代码。 这与 Node.js 中的处理方式十分类似，在 Node.js 中，我们会在（异步操作）成功时调用 `done(null, data)`，在失败时调用 `done(err)`。
 
 注意：与远程服务器进行交互时，我们需要考虑到发生错误的可能！
 
@@ -38,7 +38,7 @@ age :  number
 favoriteFoods : array of strings (*)
 ```
 
-采用 Mongoose 基础 schema 类型。 你如果还想添加更多的键，就请使用 required 或 unique 等简单的验证器（validators），并设置默认值。 详情请参考 [Mongoose 文档](http://mongoosejs.com/docs/guide.html)。
+采用 Mongoose 基础 schema 类型。 你如果还想添加更多的键，就请使用 required 或 unique 等简单的验证器（validators），并设置默认值。 查看我们的 <a href="https://www.freecodecamp.org/news/introduction-to-mongoose-for-mongodb-d2a7aa593c57/" target="_blank" rel="noopener noreferrer nofollow">Mongoose 文章</a>。
 
 请从 `personSchema` 创建一个名为 `Person` 的 model。
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/authentication-strategies.md b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/authentication-strategies.md
index ec3148ed670..aa0fc4a3561 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/authentication-strategies.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/authentication-strategies.md
@@ -8,9 +8,9 @@ dashedName: authentication-strategies
 
 # --description--
 
-策略是认证用户的一种方式。 如果你让用户在注册时填写了用户信息，那你就可以基于这些信息进行验证。或者也可以引入第三方登录，如 Google 或者 Github。 对于这个项目的验证策略，我们会采用自己搭建的方式完成。 可以[点击这里](http://passportjs.org/)访问 Passport 网站，查看数以百计的策略。
+策略是认证用户的一种方式。 如果你让用户在注册时填写了用户信息，那你就可以基于这些信息进行验证。或者也可以引入第三方登录，如 Google 或者 Github。 在这个项目中，我们将使用 Passport 中间件。 Passport 提供了一套全面的策略，支持使用用户名和密码、GitHub、谷歌等进行认证。
 
-引入 `passport-local@~1.0.0` 作为依赖，然后将它添加到服务器，就像这样：`const LocalStrategy = require('passport-local');`
+`passport-local@~1.0.0` has already been added as a dependency, so add it to your server as follows: `const LocalStrategy = require('passport-local');`
 
 然后，需要让 passport **使用**一个实例化的 LocalStrategy 对象，这个对象的一些设置已完成。 请注意，接下来的所有代码都应写在连接数据库的回调中，因为它们的执行都依赖数据库。
 
@@ -34,7 +34,7 @@ passport.use(new LocalStrategy(
 
 在下一个挑战中，我们会基于表单数据调用上面写好的验证策略。
 
-完成上述要求后，请提交你的页面链接。 如果你遇到任何问题，可以参考[这里](https://gist.github.com/camperbot/53b495c02b92adeee0aa1bd3f3be8a4b)的答案。
+完成上述要求后，请提交你的页面链接。 如果你在运行时遇到错误，可以点击此处查看<a href="https://gist.github.com/camperbot/53b495c02b92adeee0aa1bd3f3be8a4b" target="_blank" rel="noopener noreferrer nofollow">已执行项目的当前进度</a>。
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md
index 29c01baa96b..032947e62c6 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md
@@ -10,7 +10,7 @@ dashedName: authentication-with-socket-io
 
 目前，你还无法确定连接到服务器的用户身份。 虽然 `req.user` 包含用户信息，但这个只在用户直接与服务器交互时产生。当用户通过 web socket 与服务器连接时，由于不存在 `req` 对象，我们就无法获取用户数据。 解决这个问题的方法之一是通过读取和解析请求中包含 passport session 的 cookie，然后反序列化，进而获取用户信息对象。 幸运的是，NPM 上有可以让这个复杂的流程简单化的库。
 
-添加 `passport.socketio@~3.7.0`、`connect-mongo@~3.2.0`、`cookie-parser@~1.4.5` 作为依赖，把它们分别赋值给 `passportSocketIo`、`MongoStore`、`cookieParser`。 同时，我们需要从之前引入的 `express-session` 中开辟新的内存空间， 就像这样：
+`passport.socketio@~3.7.0`, `connect-mongo@~3.2.0`, and `cookie-parser@~1.4.5` have already been added as dependencies. Require them as `passportSocketIo`, `MongoStore`, and `cookieParser` respectively. Also, we need to initialize a new memory store, from `express-session` which we previously required. It should look like this:
 
 ```js
 const MongoStore = require('connect-mongo')(session);
@@ -65,7 +65,7 @@ console.log('user ' + socket.request.user.name + ' connected');
 
 它将在服务器控制台记录已连接的用户！
 
-完成以上要求后，请提交你的页面链接。 如果你遇到了问题，可以参考[这里](https://gist.github.com/camperbot/1414cc9433044e306dd7fd0caa1c6254)的答案。
+完成以上要求后，请提交你的页面链接。 If you're running into errors, you can check out the project up to this point <a href="https://gist.github.com/camperbot/1414cc9433044e306dd7fd0caa1c6254" target="_blank" rel="noopener noreferrer nofollow">https://gist.github.com/camperbot/1414cc9433044e306dd7fd0caa1c6254</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/clean-up-your-project-with-modules.md b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/clean-up-your-project-with-modules.md
index 8a38231ee21..ad639024ee8 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/clean-up-your-project-with-modules.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/clean-up-your-project-with-modules.md
@@ -26,7 +26,7 @@ module.exports = function (app, myDataBase) {
 
 现在，我们来把 server.js 中与验证相关的代码分离到 auth.js 中，例如序列化，设置验证策略等。 请正确添加依赖，并在 server.js 中调用 `auth(app, myDataBase)`。
 
-完成上述要求后，请提交你的页面链接。 如果你遇到了问题，可以参考[这里](https://gist.github.com/camperbot/2d06ac5c7d850d8cf073d2c2c794cc92)的答案。
+完成上述要求后，请提交你的页面链接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/2d06ac5c7d850d8cf073d2c2c794cc92" target="_blank" rel="noopener noreferrer nofollow">check out an example of the completed project</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/communicate-by-emitting.md b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/communicate-by-emitting.md
index a67314a3305..ca061b69ced 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/communicate-by-emitting.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/communicate-by-emitting.md
@@ -38,7 +38,7 @@ socket.on('user count', function(data) {
 
 现在你可以尝试启动你的 app 并登录，你会看到在客户端的控制台打印出了 “1”，这就表示目前连接到服务器的用户数为 1。 你可以试着通过打开多个 app 来验证数量是否会增加。
 
-完成上述要求后，请提交你的页面链接。 如果你遇到了问题，可以参考[这里](https://gist.github.com/camperbot/28ef7f1078f56eb48c7b1aeea35ba1f5)的答案。
+完成上述要求后，请提交你的页面链接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/28ef7f1078f56eb48c7b1aeea35ba1f5" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/create-new-middleware.md b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/create-new-middleware.md
index 0a9d1e1ffa5..0e06e93dc44 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/create-new-middleware.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/create-new-middleware.md
@@ -31,7 +31,7 @@ app
  });
 ```
 
-完成上述要求后，请提交你的页面链接。 如果你遇到了问题，可以参考[这里](https://gist.github.com/camperbot/ae49b8778cab87e93284a91343da0959)的答案。
+完成上述要求后，请提交你的页面链接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/ae49b8778cab87e93284a91343da0959" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/handle-a-disconnect.md b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/handle-a-disconnect.md
index 7ad3e7f7f19..76dfac1a880 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/handle-a-disconnect.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/handle-a-disconnect.md
@@ -22,7 +22,7 @@ socket.on('disconnect', () => {
 
 **注意：**和 `'disconnect'` 类似，所有 socket 可以发送到服务器的事件，我们都应该在有 “socket” 定义的连接监听器里处理。
 
-完成上述要求后，请提交你的页面链接。 如果你遇到了问题，可以参考[这里](https://gist.github.com/camperbot/ab1007b76069884fb45b215d3c4496fa)的答案。
+完成上述要求后，请提交你的页面链接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/ab1007b76069884fb45b215d3c4496fa" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/hashing-your-passwords.md b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/hashing-your-passwords.md
index 6f58c34640e..0886a14522a 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/hashing-your-passwords.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/hashing-your-passwords.md
@@ -10,7 +10,7 @@ dashedName: hashing-your-passwords
 
 回过头来看信息安全，你也许记得在数据库中存储明文密码是*绝对*禁止的。 现在，我们需要引入 BCrypt 来解决这个问题。
 
-添加 `bcrypt@~5.0.0` 作为依赖，并在服务端使用它。 你需要在两个步骤中使用哈希运算：注册和保存新账户，以及登录时检查密码是否正确。
+`bcrypt@~5.0.0` has already been added as a dependency, so require it in your server. 你需要在两个步骤中使用哈希运算：注册和保存新账户，以及登录时检查密码是否正确。
 
 目前处理注册的路由中，我们是这样把密码添加到数据库的：`password: req.body.password`。 保存哈希值的一个简单方式是在数据库逻辑中添加 `const hash = bcrypt.hashSync(req.body.password, 12);`，然后把 `req.body.password` 替换为 `password: hash`。
 
@@ -24,7 +24,7 @@ if (!bcrypt.compareSync(password, user.password)) {
 
 当你需要存储密码时，这样做可以有效地提升网站的安全性。
 
-完成上述要求后，请提交你的页面链接。 如果你遇到了问题，可以参考[这里](https://gist.github.com/camperbot/dc16cca09daea4d4151a9c36a1fab564)的答案。
+完成上述要求后，请提交你的页面链接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/dc16cca09daea4d4151a9c36a1fab564" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/how-to-put-a-profile-together.md b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/how-to-put-a-profile-together.md
index d3873840ead..c583e6aedcd 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/how-to-put-a-profile-together.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/how-to-put-a-profile-together.md
@@ -24,7 +24,7 @@ h2.center#welcome Welcome, #{username}!
 a(href='/logout') Logout
 ```
 
-完成上述要求后，请提交你的页面链接。 如果你遇到了问题，可以参考[这里](https://gist.github.com/camperbot/136b3ad611cc80b41cab6f74bb460f6a)的答案。
+完成上述要求后，请提交你的页面链接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/136b3ad611cc80b41cab6f74bb460f6a" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/how-to-use-passport-strategies.md b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/how-to-use-passport-strategies.md
index de932108f5e..5f657da8fc6 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/how-to-use-passport-strategies.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/how-to-use-passport-strategies.md
@@ -18,7 +18,7 @@ dashedName: how-to-use-passport-strategies
 
 这时，由于我们还没有实现注册功能，如果你在表单里输入了用户名和密码，路由将会重定向到主页 `/`，在服务端将会打印 `'User {USERNAME} attempted to log in.'`。
 
-完成上述要求后，请提交你的页面链接。 如果你遇到了问题，可以参考[这里](https://gist.github.com/camperbot/7ad011ac54612ad53188b500c5e99cb9)的答案。
+完成上述要求后，请提交你的页面链接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/7ad011ac54612ad53188b500c5e99cb9" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/implement-the-serialization-of-a-passport-user.md b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/implement-the-serialization-of-a-passport-user.md
index 4e350b869c4..016d5067491 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/implement-the-serialization-of-a-passport-user.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/implement-the-serialization-of-a-passport-user.md
@@ -10,7 +10,7 @@ dashedName: implement-the-serialization-of-a-passport-user
 
 截至目前，我们还没有配置完数据库，因此还无法加载用户数据。 实现这个的方式很多，但对于我们的项目，一旦服务器启动，那么只要有 app 实例在运行，数据库就应一直处于连接状态。 为此，你需要在环境变量 `MONGO_URI` 中添加你的数据库地址（比如：`mongodb+srv://:@cluster0-jvwxi.mongodb.net/?retryWrites=true&w=majority`）。 我们会在 `connection.js` 文件中调用它。
 
-*你可以在 [MongoDB Atlas](https://www.mongodb.com/cloud/atlas) 创建一个免费的数据库。*
+*If you are having issues setting up a free database on MongoDB Atlas, check out <a href="https://www.freecodecamp.org/news/get-started-with-mongodb-atlas/" target="_blank" rel="noopener noreferrer nofollow">tutorial</a>.*
 
 现在我们想要连接到数据库，然后开始监听请求。 这样做的目的是在连接数据库之前或者出现数据库错误时，不接收任何请求。 要实现这一点，你需要在以下代码中包含序列化和应用的路由：
 
@@ -40,7 +40,7 @@ myDB(async client => {
 
 记得要取消 `deserializeUser` 中 `myDataBase` 的注释，并把 `doc` 添加到 `done(null, null)`。
 
-完成上述要求后，请提交你的页面链接。 如果你遇到了问题，可以参考[这里](https://gist.github.com/camperbot/175f2f585a2d8034044c7e8857d5add7)的答案。
+完成上述要求后，请提交你的页面链接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/175f2f585a2d8034044c7e8857d5add7" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-ii.md b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-ii.md
index abcd53af582..e54d5d0a435 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-ii.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-ii.md
@@ -8,11 +8,13 @@ dashedName: implementation-of-social-authentication-ii
 
 # --description--
 
-设置 GitHub 验证的最后一步是创建策略本身。 为此，你需要在项目中添加 `passport-github@~1.1.0` 依赖，并在 `auth.js` 中请求它，作为 `GithubStrategy`，像这样：`const GitHubStrategy = require('passport-github').Strategy;`。 别忘了请求和配置 `dotenv`，使用你的环境变量。
+设置 GitHub 验证的最后一步是创建策略本身。 `passport-github@~1.1.0` has already been added as a dependency, so require it in your `auth.js` file as `GithubStrategy` like this: `const GitHubStrategy = require('passport-github').Strategy;`. 别忘了请求和配置 `dotenv`，使用你的环境变量。
 
-为了设置 GitHub 策略，我们需要在 Passport 中使用实例化的 `GitHubStrategy`，它可以接收两个参数：一个对象（包括 `clientID`、`clientSecret` 和 `callbackURL`），以及一个回调函数。在这个回调函数中，我们要处理验证成功时，判断用户是否已经在数据库中存在的逻辑，以及在用户数据库对象中最初保存哪些字段。 这种处理方式适用于绝大部分第三方验证策略，但有些策略会需要我们提供更多的信息，详情请参考相关策略的 GitHub README。 例如，Google 的验证策略会要求你提供一个 *scope*，用于标示用户成功登录后，你需要从返回的对象中获取那些信息。以及，这也需要经过用户同意，你才可以获取到。 你可以在[这里](https://github.com/jaredhanson/passport-github/)了解当前我们使用的验证策略的用法，不过我们也会在 freeCodeCamp 课程中进行详细讲解。
+为了设置 GitHub 策略，我们需要在 Passport 中使用实例化的 `GitHubStrategy`，它可以接收两个参数：一个对象（包括 `clientID`、`clientSecret` 和 `callbackURL`），以及一个回调函数。在这个回调函数中，我们要处理验证成功时，判断用户是否已经在数据库中存在的逻辑，以及在用户数据库对象中最初保存哪些字段。 这种处理方式适用于绝大部分第三方验证策略，但有些策略会需要我们提供更多的信息，详情请参考相关策略的 GitHub README。 例如，Google 的验证策略会要求你提供一个 *scope*，用于标示用户成功登录后，你需要从返回的对象中获取那些信息。以及，这也需要经过用户同意，你才可以获取到。
 
-你的新策略应该这样去实现：
+The current strategy we are implementing authenticates users using a GitHub account and OAuth 2.0 tokens. The client ID and secret obtained when creating an application are supplied as options when creating the strategy. The strategy also requires a `verify` callback, which receives the access token and optional refresh token, as well as `profile` which contains the authenticated user's GitHub profile. The `verify` callback must call `cb` providing a user to complete authentication.
+
+Here's how your new strategy should look at this point:
 
 ```js
 passport.use(new GitHubStrategy({
@@ -27,13 +29,13 @@ passport.use(new GitHubStrategy({
 ));
 ```
 
-目前，你的验证部分不会成功。由于没有数据库的逻辑和回调函数，你的代码目前还会报错。但如果你试一试，就可以在控制台里看到输出了你的 GitHub 个人信息。
+Your authentication won't be successful yet, and it will actually throw an error without the database logic and callback, but it should log your GitHub profile to your console if you try it!
 
-完成上述要求后，请提交你的页面链接。 如果你遇到了问题，可以参考[这里](https://gist.github.com/camperbot/ff3a1166684c1b184709ac0bee30dee6)的答案。
+Submit your page when you think you've got it right. If you're running into errors, you can <a href="https://gist.github.com/camperbot/ff3a1166684c1b184709ac0bee30dee6" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
-应正确添加依赖 passport-github。
+passport-github dependency should be added.
 
 ```js
 (getUserInput) =>
@@ -52,7 +54,7 @@ passport.use(new GitHubStrategy({
   );
 ```
 
-应正确请求依赖 passport-github。
+passport-github should be required.
 
 ```js
 (getUserInput) =>
@@ -70,7 +72,7 @@ passport.use(new GitHubStrategy({
   );
 ```
 
-到目前为止，Github 策略应正确设置。
+GitHub strategy should be setup correctly thus far.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-iii.md b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-iii.md
index 4da77b71391..885c31883b3 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-iii.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-iii.md
@@ -42,7 +42,7 @@ myDataBase.findOneAndUpdate(
 
 你现在应该可以登录你的应用了，试试吧。
 
-完成上述要求后，你可以在下方提交你的页面链接。 如果你遇到了问题，可以参考 [这里](https://gist.github.com/camperbot/183e968f0e01d81dde015d45ba9d2745) 的答案。
+完成上述要求后，你可以在下方提交你的页面链接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/183e968f0e01d81dde015d45ba9d2745" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication.md b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication.md
index bb5e92a85dd..25dd414b4f9 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication.md
@@ -18,7 +18,7 @@ dashedName: implementation-of-social-authentication
 
 在 OAuth 验证策略中，我们至少需要提供 *Client ID* 和 *Client Secret*，这样第三方平台就会获悉验证请求的来源，以及这个来源是否有效。 为此，需要去我们使用的第三方验证平台（比如 GitHub）获取这两个字段的值。 注意，我们获取到的这个值是唯一的，仅对我们的当前 app 有效——**因此，千万不要分享给别人**，更不要上传到公共仓库或者直接写在代码里。 通常，我们会把它们放在 `.env` 文件里，并通过 `process.env.GITHUB_CLIENT_ID` 获取。 对于这次挑战，我们将会使用 GitHub 作为验证平台。
 
-首先，你需要进入账户设置里的 “developer settings（开发者设置）”板块，在 '[OAuth applications](https://github.com/settings/developers)' 获取 *Client ID and Secret*。 点击 “Register a new application（注册一个新的应用）”，设置你的应用名称，然后把你的 Replit 主页地址（**不是项目代码的 url**）粘贴到 Homepage URL。然后，回调 url 需要设置成上面 Homepage URL 里你粘贴的地址，但后面要加上 `/auth/github/callback`。 这样在用户通过 Github 验证后才能跳转到我们指定的页面。 在你的 `.env` 文件里将返回的信息保存为 `'GITHUB_CLIENT_ID'` 和 `'GITHUB_CLIENT_SECRET'`。
+Obtaining your *Client ID and Secret* from GitHub is done in your account profile settings under 'developer settings', then <a href="https://github.com/settings/developers" target="_blank" rel="noopener noreferrer nofollow">'OAuth applications'</a>. 点击 “Register a new application（注册一个新的应用）”，设置你的应用名称，然后把你的 Replit 主页地址（**不是项目代码的 url**）粘贴到 Homepage URL。然后，回调 url 需要设置成上面 Homepage URL 里你粘贴的地址，但后面要加上 `/auth/github/callback`。 这样在用户通过 Github 验证后才能跳转到我们指定的页面。 在你的 `.env` 文件里将返回的信息保存为 `'GITHUB_CLIENT_ID'` 和 `'GITHUB_CLIENT_SECRET'`。
 
 在你的 `routes.js` 文件中，添加 `showSocialAuth: true` 到主页路由，在 `showRegistration: true` 的后面。 然后，为 `/auth/github` 和 `/auth/github/callback` 创建两个接收 GET 请求的路由。 第一个只需要通过调用 passport 来验证 `'github'`。 第二个应该调用 passport 来验证 `'github'`，但需要在失败时跳转回主页 `/`，成功时跳转到用户页面 `/profile`（跳转的逻辑与上一个项目中的逻辑一样）。
 
@@ -31,7 +31,7 @@ app.route('/login')
   });
 ```
 
-完成上述要求后，请提交你的页面链接。 如果你遇到了问题，可以参考[这里](https://gist.github.com/camperbot/1f7f6f76adb178680246989612bea21e)的答案。
+完成上述要求后，请提交你的页面链接。 If you're running into errors, you can check out the project up to this point <a href="https://gist.github.com/camperbot/1f7f6f76adb178680246989612bea21e" target="_blank" rel="noopener noreferrer nofollow">https://gist.github.com/camperbot/1f7f6f76adb178680246989612bea21e</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/logging-a-user-out.md b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/logging-a-user-out.md
index b913fc75cf0..c193cc1f688 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/logging-a-user-out.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/logging-a-user-out.md
@@ -30,11 +30,11 @@ app.use((req, res, next) => {
 });
 ```
 
-完成上述要求后，请提交你的页面链接。 如果你遇到了问题，可以参考[这里](https://gist.github.com/camperbot/c3eeb8a3ebf855e021fd0c044095a23b)的答案。
+完成上述要求后，请提交你的页面链接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/c3eeb8a3ebf855e021fd0c044095a23b" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
-`req.Logout` 应在 `/logout` 路由中调用。
+`req.logout()` should be called in your `/logout` route.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md
index 2079a3279c1..35709c4bd67 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md
@@ -47,7 +47,7 @@ app.route('/register')
   );
 ```
 
-完成上述要求后，请提交你的页面链接。 如果你遇到了问题，可以参考[这里](https://gist.github.com/camperbot/b230a5b3bbc89b1fa0ce32a2aa7b083e)的答案。
+完成上述要求后，请提交你的页面链接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/b230a5b3bbc89b1fa0ce32a2aa7b083e" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 **注意：**接下来的挑战可能会在运行 *picture-in-picture*（画中画）模式的浏览器中出现问题。 如果你使用的线上 IDE 提供在 IDE 内预览 app 的功能，请考虑打开新的标签页预览。
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md
index 294e0f2d126..29553b4f950 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md
@@ -28,7 +28,7 @@ socket.emit('chat message', messageToSend);
 
 至此，我们已经完成发送信息到所有客户端的功能。
 
-完成上述要求后，请提交你的页面链接。 如果你遇到了问题，可以参考[这里](https://gist.github.com/camperbot/d7af9864375207e254f73262976d2016)的答案。
+完成上述要求后，请提交你的页面链接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/d7af9864375207e254f73262976d2016" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md
index 32f805113b4..24ec080a681 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md
@@ -12,7 +12,7 @@ dashedName: serialization-of-a-user-object
 
 我们需要用到序列化和反序列化的方法来进行配置。 passport 为我们提供了 `passport.serializeUser( OURFUNCTION )` 和 `passport.deserializeUser( OURFUNCTION )` 两个方法。
 
-`serializeUser` 方法接收两个参数，分别是表示用户的对象和一个回调函数。 其中，回调函数的返回值应为这个用户的唯一标识符：最简单的写法就是让它返回用户的 `_id`。 它应当是唯一的，是由 MongoDB 产生的。 类似地，`deserializeUser` 也接收两个参数，分别是在序列化时生成的标识符以及一个回调函数。在回调函数里，我们需要根据根据传入的标识符（比如 \_id）返回表示用户的对象。 为了在 MongoDB 中通过 query（查询语句）获取 `_id` 字段，首先我们需要创建 `const ObjectID = require('mongodb').ObjectID;`；然后调用它：`new ObjectID(THE_ID)`。 确保添加 `mongodb@~3.6.0` 作为依赖项。 你可以在下面的例子中看到：
+`serializeUser` 方法接收两个参数，分别是表示用户的对象和一个回调函数。 其中，回调函数的返回值应为这个用户的唯一标识符：最简单的写法就是让它返回用户的 `_id`。 它应当是唯一的，是由 MongoDB 产生的。 类似地，`deserializeUser` 也接收两个参数，分别是在序列化时生成的标识符以及一个回调函数。在回调函数里，我们需要根据根据传入的标识符（比如 \_id）返回表示用户的对象。 为了在 MongoDB 中通过 query（查询语句）获取 `_id` 字段，首先我们需要创建 `const ObjectID = require('mongodb').ObjectID;`；然后调用它：`new ObjectID(THE_ID)`。 `mongodb@~3.6.0` has already been added as a dependency. 你可以在下面的例子中看到：
 
 ```js
 passport.serializeUser((user, done) => {
@@ -28,7 +28,7 @@ passport.deserializeUser((id, done) => {
 
 因此，在我们在下一步中配置 DB 前，`deserializeUser` 会抛出错误。所以，现在请先注释掉上面的代码，在 `deserializeUser` 中仅调用 `done(null, null)` 即可。
 
-完成上述要求后，请提交你的页面链接。 如果你遇到了问题，可以参考 [这里](https://gist.github.com/camperbot/7068a0d09e61ec7424572b366751f048) 的答案。
+完成上述要求后，请提交你的页面链接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/7068a0d09e61ec7424572b366751f048" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md
index 0ab27fe4c18..a434380692e 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md
@@ -10,25 +10,25 @@ dashedName: set-up-a-template-engine
 
 你可以采用下面的任意一种方式完成这些挑战：
 
-- 克隆[这个 GitHub 仓库](https://github.com/freeCodeCamp/boilerplate-advancednode/)，在本地完成这些挑战。
-- 使用[我们的 Replit 上的初始化项目](https://replit.com/github/freeCodeCamp/boilerplate-advancednode)来完成项目。
+- Clone <a href="https://github.com/freeCodeCamp/boilerplate-advancednode/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete these challenges locally.
+- Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-advancednode" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete these challenges.
 - 使用一个你选择的站点生成器来完成项目。 需要确定包含了我们 GitHub 仓库的所有文件。
 
 完成本项目后，请将一个正常运行的 demo（项目演示）托管在可以公开访问的平台。 然后在 `Solution Link` 框中提交你的项目 URL。
 
 你可以在应用的模版引擎中使用静态模板文件（如那些写在 *Pug* 里的）。 在运行时，模版引擎会用服务端的真实数据替换掉模版文件中的变量， 然后将模版转译成发送给客户端的 HTML 静态文件。 这样可以轻松地构造 HTML 页面，允许在页面直接显示变量内容而不需要从客户端发送 API 请求。
 
-在 `package.json` 文件中添加依赖 `pug@~3.0.0`。
+`pug@~3.0.0` has already been installed, and is listed as a dependency in your `package.json` file.
 
 Express 需要知道你正在使用哪个模板引擎。 我们将使用 `set` 方法来分配 `pug` 作为 `view engine` 属性的值： `app.set('view engine', 'pug')`。
 
-在正确渲染 `views/pug` 目录中的索引文件之后，加载页面。
+Your page will be blank until you correctly render the index file in the `views/pug` directory.
 
-修改 `/` 路由中 `res.render()` 声明的参数为 `views/pug` 目录的文件路径。 这个路径可以是相对路径（相对于 views），也可以是绝对路径，不需要文件扩展。
+To render the `pug` template, you need to use `res.render()` in the `/` route. Pass the file path to the `views/pug` directory as the argument to the method. The path can be a relative path (relative to views), or an absolute path, and does not require a file extension.
 
-如果一切顺利，那么你的应用主页不会再显示信息 “`Pug template is not defined.`”，而是会显示一个信息表明你已经成功渲染 Pug 模版！
+If all went as planned, your app home page will no longer be blank and will display a message indicating you've successfully rendered the Pug template!
 
-完成以上要求后，请提交你的页面链接。 如果你遇到问题，可以查看[这里](https://gist.github.com/camperbot/3515cd676ea4dfceab4e322f59a37791)的答案。
+完成以上要求后，请提交你的页面链接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/3515cd676ea4dfceab4e322f59a37791" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/set-up-passport.md b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/set-up-passport.md
index 978b71a7c7f..e9aac7b4ff5 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/set-up-passport.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/set-up-passport.md
@@ -8,15 +8,13 @@ dashedName: set-up-passport
 
 # --description--
 
-现在我们来创建 *Passport*，最终我们需要用它来实现用户注册和登录。 除了 Passport，我们还会用 Express-session 来处理 session（会话）。 在客户端，我们可以用这个中间件把 session id 储存到 cookie。同时，我们可以在服务器上通过这个 id 访问 session 数据。 通过这种方式，我们无需把用户的个人账号信息存到 cookie，来完成用户的验证。只需要用这个 id 作为 *key* 来访问服务器上用户的数据即可。
+现在我们来创建 *Passport*，最终我们需要用它来实现用户注册和登录。 除了 Passport，我们还会用 Express-session 来处理 session（会话）。 Express-session has a ton of advanced features you can use, but for now we're just going to use the basics! Using this middleware saves the session id as a cookie in the client and allows us to access the session data using that id on the server. This way we keep personal account information out of the cookie used by the client to verify to our server they are authenticated and just keep the *key* to access the data stored on the server.
 
-为了在你的项目中使用 Passport，首先你需要在 package.json 文件中添加依赖： `passport@~0.4.1`
+`passport@~0.4.1` and `express-session@~1.17.1` are already installed, and are both listed as dependencies in your `package.json` file.
 
-此外，还需要添加 Express-session 作为依赖。 Express-session 有许多高级特性，但我们暂时只需要了解其基础功能。 `express-session@~1.17.1`
+You will need to set up the session settings now and initialize Passport. Be sure to first create the variables 'session' and 'passport' to require 'express-session' and 'passport' respectively.
 
-现在，我们需要配置 session 并初始化 Passport。 请先创建变量 “session” 和 “passport” 来分别引入 “express-session” 和 “passport”。
-
-为了让 express 应用可以使用 session，我们需要添加一些基础选项。 请在 .env 文件中添加字段 “SESSION_SECRET”，并给它赋一个随机值， 便于加密 cookie、计算哈希。
+To set up your express app to use the session we'll define just a few basic options. Be sure to add 'SESSION_SECRET' to your .env file and give it a random value. This is used to compute the hash used to encrypt your cookie!
 
 ```js
 app.use(session({
@@ -27,13 +25,13 @@ app.use(session({
 }));
 ```
 
-还有，我们需要让 express **使用** “passport.initialize()” 和 “passport.session()”。 （例如，`app.use(passport.initialize());`）。
+As well you can go ahead and tell your express app to **use** 'passport.initialize()' and 'passport.session()'. (For example, `app.use(passport.initialize());`)
 
-完成上述要求后，请提交你的页面链接。 如果你遇到了问题，可以参考[这里](https://gist.github.com/camperbot/4068a7662a2f9f5d5011074397d6788c)的答案。
+Submit your page when you think you've got it right. If you're running into errors, you can <a href="https://gist.github.com/camperbot/4068a7662a2f9f5d5011074397d6788c" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
-应添加 Passort 和 express-session 作为依赖。
+Passport and Express-session should be dependencies.
 
 ```js
 (getUserInput) =>
@@ -57,7 +55,7 @@ app.use(session({
   );
 ```
 
-依赖应正确引入。
+Dependencies should be correctly required.
 
 ```js
 (getUserInput) =>
@@ -80,7 +78,7 @@ app.use(session({
   );
 ```
 
-Express app 可以使用新的依赖。
+Express app should use new dependencies.
 
 ```js
 (getUserInput) =>
@@ -103,7 +101,7 @@ Express app 可以使用新的依赖。
   );
 ```
 
-应正确设置 session 和 session secret。
+Session and session secret should be correctly set up.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md
index 7f202a8136d..365b48c155c 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md
@@ -10,7 +10,7 @@ dashedName: set-up-the-environment
 
 在接下来的挑战中，我们将会用到 `chat.pug` 文件。 首先，在你的 `routes.js` 文件中为 `/chat` 添加一个处理 GET 请求的路由，并给它传入 `ensureAuthenticated`。在回调函数中，我们需要让它渲染 `chat.pug` 文件，并在响应中包含 `{ user: req.user }` 信息。 现在，请修改 `/auth/github/callback` 路由，让它可以像这样设置 user_id：`req.session.user_id = req.user.id`，并在设置完成后重定向至 `/chat`。
 
-添加 `socket.io@~2.3.0` 作为依赖项，并且在你的服务器中和 `http` （内置在 Nodejs 中）一起导入/实例化。具体如下：
+`socket.io@~2.3.0` has already been added as a dependency, so require/instantiate it in your server as follows with `http` (comes built-in with Nodejs):
 
 ```javascript
 const http = require('http').createServer(app);
@@ -19,7 +19,7 @@ const io = require('socket.io')(http);
 
 现在我们的 *express 应用*已经包含了 *http* 服务，接下来我们需要监听 *http* 服务的事件。 为此，我们需要把 `app.listen` 更新为 `http.listen`。
 
-需要处理的第一件事是监听客户端的新连接。 <dfn>on</dfn> 关键字就是监听这个特定事件。 它需要 2 个参数：一个包含所发出事件标题的字符串，以及一个用于传递数据的函数。 在连接监听器中，我们用 *socket* 来代表它所包含的数据。 socket 就是指已连接到服务器的客户端。
+需要处理的第一件事是监听客户端的新连接。 <dfn>on</dfn> 关键字就是监听这个特定事件。 It requires 2 arguments: a string containing the title of the event that's emitted, and a function with which the data is passed through. 在连接监听器中，我们用 *socket* 来代表它所包含的数据。 socket 就是指已连接到服务器的客户端。
 
 为了可以监听服务器的连接事件，我们在数据库连接的部分加入如下代码：
 
@@ -42,7 +42,7 @@ let socket = io();
 
 **注意：**只有在连接到处于同一个 url/server 上的 socket 时，`io()`才可以正常执行。 如果需要连接到外部的 socket，就需要这样调用：`io.connect('URL');`。
 
-完成上述要求后，请提交你的页面链接。 如果你遇到了问题，可以参考[这里](https://gist.github.com/camperbot/aae41cf59debc1a4755c9a00ee3859d1)的答案。
+完成上述要求后，请提交你的页面链接。 If you're running into errors, you can <a href="https://gist.github.com/camperbot/aae41cf59debc1a4755c9a00ee3859d1" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md
index 3d5fb3a4b79..8258dfbaaab 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md
@@ -12,19 +12,43 @@ dashedName: use-a-template-engines-powers
 
 在 Pug 文件中，你可以用变量名来调用变量，比如写成 `#{variable_name}` 来实现行内调用，或像 `p=variable_name` 把元素与变量直接写在一起，这表示 p 元素的内容等价于这个变量。
 
-建议大家在 [Pug 的 README](https://github.com/pugjs/pug) 里看看它的语法和用法，这样你写出的代码会相对简练。 另外要注意，Pug 使用缩进来表示嵌套的代码块。
+ Pug is all about using whitespace and tabs to show nested elements and cutting down on the amount of code needed to make a beautiful site. Read the Pug documentation for more information on usage and syntax.
 
-在 pug 的 'index.pug' 文件中，我们使用了 *title* 和 *message* 两个变量。
+ Here is an example:
 
-为了从服务器传递这些信息，你需要给 *res.render* 的第二个参数传入一个对象，其中包含变量对应的值。 比如，如果你想传递对象 `{title: 'Hello', message: 'Please login'}` 到你的主页，
+ ```html
+ <!--Typing this using Pug-->
+ head
+    script(type='text/javascript').
+      if (foo) bar(1 + 5);
+  body
+    if youAreUsingPug
+        p You are amazing
+      else
+        p Get on it!
 
-看起来应该像这样：`res.render(process.cwd() + '/views/pug/index', {title: 'Hello', message: 'Please login'});`。现在刷新页面，你应该看到那些值就像在 index.pug 文件中一样被渲染在页面上正确的位置。
+<!--will lead to creating this code-->
+  <head>
+    <script type="text/javascript">
+      if (foo) bar(1 + 5);
+    </script>
+  </head>
+  <body>
+    <p>You are amazing</p>
+  </body>
+  ```
 
-完成上述要求后，请提交你的页面链接。 如果你遇到了问题，可以参考 [这里](https://gist.github.com/camperbot/4af125119ed36e6e6a8bb920db0c0871) 的答案。
+Looking at our pug file `index.pug` included in your project, we used the variables `title` and `message`.
+
+To pass those along from our server, you will need to add an object as a second argument to your `res.render` with the variables and their values. For example, pass this object along setting the variables for your index view: `{title: 'Hello', message: 'Please login'}`
+
+It should look like: `res.render(process.cwd() + '/views/pug/index', {title: 'Hello', message: 'Please login'});` Now refresh your page and you should see those values rendered in your view in the correct spot as laid out in your `index.pug` file!
+
+Submit your page when you think you've got it right. If you're running into errors, you can check out the <a href="https://gist.github.com/camperbot/4af125119ed36e6e6a8bb920db0c0871" target="_blank" rel="noopener noreferrer nofollow">project completed up to this point</a>.
 
 # --hints--
 
-Pug 应正确地展示变量。
+Pug should correctly render variables.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md
index bdc5b68e945..5517b53e85b 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md
@@ -8,7 +8,7 @@ dashedName: assert-deep-equality-with--deepequal-and--notdeepequal
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>  or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `deepEqual()` 断言两个对象是否深度相等。
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/compare-the-properties-of-two-elements.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/compare-the-properties-of-two-elements.md
index 80337e01bb6..8dd5ff29952 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/compare-the-properties-of-two-elements.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/compare-the-properties-of-two-elements.md
@@ -8,15 +8,15 @@ dashedName: compare-the-properties-of-two-elements
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 # --instructions--
 
-在 `tests/1_unit-tests.js` 中，在标有 `#8` 的 `Comparisons` 套件里，将每个 `assert` 改成 `assert.isAbove` 或 `assert.isAtMost` 方法，让测试通过（结果应该返回 `true`）。 不要改变传入断言的参数。
+Within `tests/1_unit-tests.js` under the test labelled `#8` in the `Comparisons` suite, change each `assert` to either `assert.isAbove` or `assert.isAtMost` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
 
 # --hints--
 
-不应有未通过的测试
+All tests should pass.
 
 ```js
 (getUserInput) =>
@@ -30,7 +30,7 @@ dashedName: compare-the-properties-of-two-elements
   );
 ```
 
-请为第一个断言选择正确的方法 — `isAbove` 或 `isAtMost`。
+You should choose the correct method for the first assertion - `isAbove` vs. `isAtMost`.
 
 ```js
 (getUserInput) =>
@@ -48,7 +48,7 @@ dashedName: compare-the-properties-of-two-elements
   );
 ```
 
-请为第二个断言选择正确的方法 — `isAbove` 或 `isAtMost`。
+You should choose the correct method for the second assertion - `isAbove` vs. `isAtMost`.
 
 ```js
 (getUserInput) =>
@@ -62,7 +62,7 @@ dashedName: compare-the-properties-of-two-elements
   );
 ```
 
-请为第三个断言选择正确的方法 — `isAbove` 或 `isAtMost`。
+You should choose the correct method for the third assertion - `isAbove` vs. `isAtMost`.
 
 ```js
 (getUserInput) =>
@@ -80,7 +80,7 @@ dashedName: compare-the-properties-of-two-elements
   );
 ```
 
-请为第四个断言选择正确的方法 — `isAbove` 或 `isAtMost`。
+You should choose the correct method for the fourth assertion - `isAbove` vs. `isAtMost`.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/learn-how-javascript-assertions-work.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/learn-how-javascript-assertions-work.md
index ab0aad7179d..5d47ffa3a05 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/learn-how-javascript-assertions-work.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/learn-how-javascript-assertions-work.md
@@ -10,8 +10,8 @@ dashedName: learn-how-javascript-assertions-work
 
 你可以采用下面的任意一种方式完成这些挑战：
 
-- 克隆[这个 GitHub 仓库](https://github.com/freeCodeCamp/boilerplate-mochachai/)并在本地完成项目。
-- 使用[我们的 Replit 上的初始化项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)来完成项目。
+- Clone <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete these challenges locally.
+- Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete these challenges.
 - 使用一个你喜欢的站点生成器来完成项目。 需要确定包含了我们 GitHub 仓库的所有文件。
 
 完成本项目后，请将一个正常运行的 demo（项目演示）托管在可以公开访问的平台。 然后在 `Solution Link` 框中提交你的项目 URL。
diff --git a/curriculum/challenges/chinese/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/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iii---put-method.md
index a134af48f39..ac4947ce864 100644
--- a/curriculum/challenges/chinese/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/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iii---put-method.md
@@ -8,7 +8,7 @@ dashedName: run-functional-tests-on-an-api-response-using-chai-http-iii---put-me
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 当你测试一个 `PUT` 请求时，你经常会随同它一起发送数据。 你在 `PUT` 请求中包含的数据被称为请求的主体。
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iv---put-method.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iv---put-method.md
index 909d37c71af..a89308674a1 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iv---put-method.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iv---put-method.md
@@ -8,7 +8,7 @@ dashedName: run-functional-tests-on-an-api-response-using-chai-http-iv---put-met
 
 # --description--
 
-请注意，本项目在 [这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai) 的基础上进行开发。你也可以从 [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 这个练习与上一个类似。
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http-ii.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http-ii.md
index 2c6c67a045f..6ad2e13cbd3 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http-ii.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http-ii.md
@@ -8,7 +8,7 @@ dashedName: run-functional-tests-on-api-endpoints-using-chai-http-ii
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http.md
index ecca29592ad..709237a0f57 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http.md
@@ -8,7 +8,7 @@ dashedName: run-functional-tests-on-api-endpoints-using-chai-http
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 Mocha 允许你使用名为 `chai-http` 的插件测试异步操作，例如调用 API 端点。
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser-ii.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser-ii.md
index 46882574df4..8aa261de9ff 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser-ii.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser-ii.md
@@ -8,11 +8,11 @@ dashedName: run-functional-tests-using-a-headless-browser-ii
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 # --instructions--
 
-在 `tests/2_functional-tests.js` 中，在 `'Submit the surname "Vespucci" in the HTML form'` 测试（`// #5`），自动执行以下操作：
+Within `tests/2_functional-tests.js`, in the `'Submit the surname "Vespucci" in the HTML form'` test (`// #6`), automate the following:
 
 1.  在表格中填写姓氏 `Vespucci`。
 2.  点击提交按钮
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser.md
index 3a0da4d635b..aa83e0f6282 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser.md
@@ -8,7 +8,7 @@ dashedName: run-functional-tests-using-a-headless-browser
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 在页面上有一个输入表单。 它将数据作为 AJAX 请求发送到 `PUT /travellers` 端点。
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/simulate-actions-using-a-headless-browser.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/simulate-actions-using-a-headless-browser.md
index 664e0e27628..45cb783c184 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/simulate-actions-using-a-headless-browser.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/simulate-actions-using-a-headless-browser.md
@@ -7,7 +7,7 @@ dashedName: simulate-actions-using-a-headless-browser
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 在接下来的挑战中，你将使用无头浏览器模拟人类与页面的交互。
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-for-truthiness.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-for-truthiness.md
index 9835cec6568..9109853eafa 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-for-truthiness.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-for-truthiness.md
@@ -8,7 +8,7 @@ dashedName: test-for-truthiness
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `isTrue()` 仅当给出的值为 Boolean 的 `true` 时可以通过测试；`isNotTrue()` 则会在给出除 `true` 以外的值时通过测试。
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-string-contains-a-substring.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-string-contains-a-substring.md
index 0a39f20428d..070e741f017 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-string-contains-a-substring.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-string-contains-a-substring.md
@@ -8,7 +8,7 @@ dashedName: test-if-a-string-contains-a-substring
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `include()` 和 `notInclude()` 同样可以用于字符串。 `include()` 用于断言字符串中包含某个子字符串。
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-falls-within-a-specific-range.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-falls-within-a-specific-range.md
index 1cf332b573b..a884f1933fd 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-falls-within-a-specific-range.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-falls-within-a-specific-range.md
@@ -8,7 +8,7 @@ dashedName: test-if-a-value-falls-within-a-specific-range
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 ```javascript
 .approximately(actual, expected, delta, [message])
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-a-string.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-a-string.md
index 5e81f9f32f5..0ad6dbbaf11 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-a-string.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-a-string.md
@@ -8,7 +8,7 @@ dashedName: test-if-a-value-is-a-string
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `isString` 或 `isNotString` 断言一个值是否为字符串。
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-of-a-specific-data-structure-type.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-of-a-specific-data-structure-type.md
index b06e5c8807e..8a4f77c4644 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-of-a-specific-data-structure-type.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-of-a-specific-data-structure-type.md
@@ -8,7 +8,7 @@ dashedName: test-if-a-value-is-of-a-specific-data-structure-type
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `#typeOf` 断言一个值的类型符合给定的类型，这个类型与 `Object.prototype.toString` 一致。
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-variable-or-function-is-defined.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-variable-or-function-is-defined.md
index 24f0d264b1f..1e6072a7ab8 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-variable-or-function-is-defined.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-variable-or-function-is-defined.md
@@ -8,7 +8,7 @@ dashedName: test-if-a-variable-or-function-is-defined
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-array-contains-an-item.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-array-contains-an-item.md
index 1ebabf61dfe..5c12314d747 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-array-contains-an-item.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-array-contains-an-item.md
@@ -8,7 +8,7 @@ dashedName: test-if-an-array-contains-an-item
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-has-a-property.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-has-a-property.md
index a0c539985c8..ac4e291289d 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-has-a-property.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-has-a-property.md
@@ -8,7 +8,7 @@ dashedName: test-if-an-object-has-a-property
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `property` 断言一个对象含有给定属性。
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-is-an-instance-of-a-constructor.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-is-an-instance-of-a-constructor.md
index a6b221546cb..f037fc61ce3 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-is-an-instance-of-a-constructor.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-is-an-instance-of-a-constructor.md
@@ -8,7 +8,7 @@ dashedName: test-if-an-object-is-an-instance-of-a-constructor
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `#instanceOf` 断言一个对象是一个构造器的实例。
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-one-value-is-below-or-at-least-as-large-as-another.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-one-value-is-below-or-at-least-as-large-as-another.md
index a7ea22e0364..8e18a8a9aee 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-one-value-is-below-or-at-least-as-large-as-another.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-one-value-is-below-or-at-least-as-large-as-another.md
@@ -8,7 +8,7 @@ dashedName: test-if-one-value-is-below-or-at-least-as-large-as-another
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-assert.isok-and-assert.isnotok.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-assert.isok-and-assert.isnotok.md
index a2fa1e36083..2bbf2a7a843 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-assert.isok-and-assert.isnotok.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-assert.isok-and-assert.isnotok.md
@@ -8,11 +8,11 @@ dashedName: use-assert-isok-and-assert-isnotok
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `isOk()` 用来测试值是否为真值，`isNotOk()` 用来测试值是否为假值。
 
-可以在[过滤数组中的假值](https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer)这个挑战中了解更多关于真值和假值的信息。
+To learn more about truthy and falsy values, try our <a href="https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer" target="_blank" rel="noopener noreferrer nofollow">Falsy Bouncer</a> challenge.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-regular-expressions-to-test-a-string.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-regular-expressions-to-test-a-string.md
index 7329dc61cd2..4abdc4d2ef4 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-regular-expressions-to-test-a-string.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-regular-expressions-to-test-a-string.md
@@ -8,7 +8,7 @@ dashedName: use-regular-expressions-to-test-a-string
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `match()` 断言一个值匹配一个正则表达式（第二个参数）。
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-double-equals-to-assert-equality.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-double-equals-to-assert-equality.md
index a19135fa491..b1c0d228cf4 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-double-equals-to-assert-equality.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-double-equals-to-assert-equality.md
@@ -8,7 +8,7 @@ dashedName: use-the-double-equals-to-assert-equality
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `equal()` 使用 `==` 比较对象。
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-triple-equals-to-assert-strict-equality.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-triple-equals-to-assert-strict-equality.md
index 34d6ec432ba..118aad97d78 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-triple-equals-to-assert-strict-equality.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-triple-equals-to-assert-strict-equality.md
@@ -8,7 +8,7 @@ dashedName: use-the-triple-equals-to-assert-strict-equality
 
 # --description--
 
-请注意，本项目在[这个 Replit 项目](https://replit.com/github/freeCodeCamp/boilerplate-mochachai)的基础上进行开发。你也可以从 [GitHub](https://repl.it/github/freeCodeCamp/boilerplate-mochachai) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `strictEqual()` 使用 `===` 比较对象。
 
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-projects/american-british-translator.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-projects/american-british-translator.md
index 98c56a70666..59551556047 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-projects/american-british-translator.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-projects/american-british-translator.md
@@ -8,10 +8,10 @@ dashedName: american-british-translator
 
 # --description--
 
-构建一个 JavaScript 的全栈应用，在功能上与这个应用相似：<https://american-british-translator.freecodecamp.rocks/>。 可以采用下面的任意一种方式完成这个挑战：
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://american-british-translator.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://american-british-translator.freecodecamp.rocks/</a>. 可以采用下面的任意一种方式完成这个挑战：
 
--   克隆 [这个 GitHub 仓库](https://github.com/freeCodeCamp/boilerplate-project-american-british-english-translator/) 并在本地完成项目。
--   使用[我们的 Replit 初始化项目](https://replit.com/github/freeCodeCamp/boilerplate-project-american-british-english-translator)来完成你的项目。
+-   Clone <a href="https://github.com/freeCodeCamp/boilerplate-project-american-british-english-translator/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete your project locally.
+-   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-american-british-english-translator" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 -   使用您选择的站点生成器来完成项目。 并确保包含了我们 GitHub 仓库的所有文件。
 
 当完成本项目，请确认有一个可以公开访问的正常运行 demo 。 然后将 URL 提交到 `Solution Link` 中。 此外，还可以将项目的源码提交到 `GitHub Link` 中。
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-projects/issue-tracker.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-projects/issue-tracker.md
index b13d6c0f169..f4192eb3cf1 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-projects/issue-tracker.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-projects/issue-tracker.md
@@ -8,10 +8,10 @@ dashedName: issue-tracker
 
 # --description--
 
-构建一个 JavaScript 的全栈应用，在功能上与这个应用相似： <https://issue-tracker.freecodecamp.rocks/>。 可以采用下面的任意一种方式完成这个挑战：
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://issue-tracker.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://issue-tracker.freecodecamp.rocks/</a>. 可以采用下面的任意一种方式完成这个挑战：
 
--   克隆 [GitHub 仓库](https://github.com/freeCodeCamp/boilerplate-project-issuetracker/) 并在本地完成你的项目。
--   使用[我们的 Replit 初始化项目](https://replit.com/github/freeCodeCamp/boilerplate-project-issuetracker)来完成你的项目。
+-   Clone <a href="https://github.com/freeCodeCamp/boilerplate-project-issuetracker/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete your project locally.
+-   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-issuetracker" target="_blank" rel="noopener noreferrer nofollow">this Replit starter project</a> to complete your project.
 -   使用一个你喜欢的站点生成器来完成项目。 需要确定包含了我们 GitHub 仓库的所有文件。
 
 完成本项目后，请将一个正常运行的 demo（项目演示）托管在可以公开访问的平台。 然后在 `Solution Link` 框中提交你的项目 URL。 此外，还可以将项目的源码提交到 `GitHub Link` 中。
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-projects/metric-imperial-converter.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-projects/metric-imperial-converter.md
index 215203d13f8..cc9f9c624f9 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-projects/metric-imperial-converter.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-projects/metric-imperial-converter.md
@@ -8,10 +8,10 @@ dashedName: metric-imperial-converter
 
 # --description--
 
-构建一个 JavaScript 的全栈应用，在功能上与这个应用相似：<https://metric-imperial-converter.freecodecamp.rocks/>。 可以采用下面的任意一种方式完成这个挑战：
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://metric-imperial-converter.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://metric-imperial-converter.freecodecamp.rocks/</a>. 可以采用下面的任意一种方式完成这个挑战：
 
-- 克隆 [GitHub 仓库](https://github.com/freeCodeCamp/boilerplate-project-metricimpconverter/) 并在本地完成你的项目。
-- 使用[我们的 Replit 初始化项目](https://replit.com/github/freeCodeCamp/boilerplate-project-metricimpconverter)来完成你的项目。
+- Clone <a href="https://github.com/freeCodeCamp/boilerplate-project-metricimpconverter/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete your project locally.
+- Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-metricimpconverter" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 - 使用一个你喜欢的站点生成器来完成项目。 需要确定包含了我们 GitHub 仓库的所有文件。
 
 完成本项目后，请将一个正常运行的 demo（项目演示）托管在可以公开访问的平台。 然后在 `Solution Link` 框中提交你的项目 URL。 此外，还可以将项目的源码提交到 `GitHub Link` 中。
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-projects/personal-library.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-projects/personal-library.md
index ed04ea0c126..7f9b3030fb8 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-projects/personal-library.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-projects/personal-library.md
@@ -8,10 +8,10 @@ dashedName: personal-library
 
 # --description--
 
-构建一个 JavaScript 的全栈应用，在功能上与这个应用相似：<https://personal-library.freecodecamp.rocks/>。 可以采用下面的任意一种方式完成这个挑战：
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://personal-library.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://personal-library.freecodecamp.rocks/</a>. 可以采用下面的任意一种方式完成这个挑战：
 
--   克隆 [这个 GitHub 仓库](https://github.com/freeCodeCamp/boilerplate-project-library) 并在本地完成项目。
--   使用[我们的 Replit 初始化项目](https://replit.com/github/freeCodeCamp/boilerplate-project-library)来完成你的项目。
+-   Clone <a href="https://github.com/freeCodeCamp/boilerplate-project-library" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete your project locally.
+-   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-library" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 -   使用一个你喜欢的站点生成器来完成项目。 需要确定包含了我们 GitHub 仓库的所有文件。
 
 完成本项目后，请将一个正常运行的 demo（项目演示）托管在可以公开访问的平台。 然后在 `Solution Link` 框中提交你的项目 URL。 此外，还可以将项目的源码提交到 `GitHub Link` 中。
diff --git a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-projects/sudoku-solver.md b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-projects/sudoku-solver.md
index b0cb46112b1..29ba42e8369 100644
--- a/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-projects/sudoku-solver.md
+++ b/curriculum/challenges/chinese/06-quality-assurance/quality-assurance-projects/sudoku-solver.md
@@ -8,10 +8,10 @@ dashedName: sudoku-solver
 
 # --description--
 
-构建一个 JavaScript 的全栈应用，在功能上与这个应用相似：<https://sudoku-solver.freecodecamp.rocks/>。 可以采用下面的任意一种方式完成这个挑战：
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://sudoku-solver.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://sudoku-solver.freecodecamp.rocks/</a>. 可以采用下面的任意一种方式完成这个挑战：
 
--   克隆 [GitHub 仓库](https://github.com/freecodecamp/boilerplate-project-sudoku-solver) 并在本地完成你的项目。
--   使用[我们的 Replit 初始化项目](https://replit.com/github/freeCodeCamp/boilerplate-project-sudoku-solver)来完成你的项目。
+-   Clone <a href="https://github.com/freecodecamp/boilerplate-project-sudoku-solver" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete your project locally.
+-   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-sudoku-solver" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 -   使用一个你喜欢的站点生成器来完成项目。 需要确定包含了我们 GitHub 仓库的所有文件。
 
 完成本项目后，请将一个正常运行的 demo（项目演示）托管在可以公开访问的平台。 然后在 `Solution Link` 框中提交你的项目 URL。 此外，还可以将项目的源码提交到 `GitHub Link` 中。
@@ -270,7 +270,7 @@ async (getUserInput) => {
 };
 ```
 
-如果提交给 `/api/check` 的对象缺失 `puzzle`、`coordinate` 或 `value`，返回的值将是 `{ error: Required field(s) missing }`
+If the object submitted to `/api/check` is missing `puzzle`, `coordinate` or `value`, the returned value will be `{ error: 'Required field(s) missing' }`
 
 ```js
 async (getUserInput) => {
@@ -324,7 +324,7 @@ async (getUserInput) => {
 };
 ```
 
-如果提交给 `/api/check` 的 `value` 不是一个介于 1 到 9 之间的数字，则返回的值将是 `{ error: 'Invalid value' }`
+If the `value` submitted to `/api/check` is not a number between 1 and 9, the returned value will be `{ error: 'Invalid value' }`
 
 ```js
 async (getUserInput) => {
@@ -353,9 +353,11 @@ async (getUserInput) => {
   try {
     const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
     assert.isArray(getTests);
-    const units = getTests.filter((el) => el.context.includes('UnitTests'));
-    assert.isAtLeast(units.length, 12, 'At least 12 tests passed');
-    units.forEach((test) => {
+    const unitTests = getTests.filter((test) => {
+      return !!test.context.match(/Unit\s*Tests/gi);
+    });
+    assert.isAtLeast(unitTests.length, 12, 'At least 12 tests passed');
+    unitTests.forEach((test) => {
       assert.equal(test.state, 'passed', 'Test in Passed State');
       assert.isAtLeast(
         test.assertions.length,
@@ -369,18 +371,18 @@ async (getUserInput) => {
 };
 ```
 
-所有 14 项功能测试都已完成并通过。 请参阅 `/tests/2_functional-tests.js` 来了解你应该编写的测试的功能。
+所有 14 项功能测试都已完成并通过。 See `/tests/2_functional-tests.js` for the expected functionality you should write tests for.
 
 ```js
 async (getUserInput) => {
   try {
     const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
     assert.isArray(getTests);
-    const funcs = getTests.filter((el) =>
-      el.context.includes('Functional Tests')
-    );
-    assert.isAtLeast(funcs.length, 14, 'At least 14 tests passed');
-    funcs.forEach((test) => {
+    const functTests = getTests.filter((test) => {
+      return !!test.context.match(/Functional\s*Tests/gi);
+    });
+    assert.isAtLeast(functTests.length, 14, 'At least 14 tests passed');
+    functTests.forEach((test) => {
       assert.equal(test.state, 'passed', 'Test in Passed State');
       assert.isAtLeast(
         test.assertions.length,
diff --git a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md
index 20a6e391c4c..f6b5c1a9940 100644
--- a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md
+++ b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md
@@ -14,7 +14,7 @@ dashedName: build-your-own-functions
 
 更多资源
 
-\- [练习](https://www.youtube.com/watch?v=ksvGhDsjtpw)
+\- <a href="https://www.youtube.com/watch?v=ksvGhDsjtpw" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md
index e9a016681f5..941c4f6f5cd 100644
--- a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md
+++ b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md
@@ -14,7 +14,7 @@ dashedName: comparing-and-sorting-tuples
 
 更多资源：
 
-\- [练习](https://www.youtube.com/watch?v=EhQxwzyT16E)
+\- <a href="https://www.youtube.com/watch?v=EhQxwzyT16E" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/data-visualization-mailing-lists.md b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/data-visualization-mailing-lists.md
index 7886cdb1c0f..a17bad4ed03 100644
--- a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/data-visualization-mailing-lists.md
+++ b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/data-visualization-mailing-lists.md
@@ -14,19 +14,19 @@ dashedName: data-visualization-mailing-lists
 
 更多资源：
 
-\- [练习：Geodata](https://www.youtube.com/watch?v=KfhslNzopxo)
+\- <a href="https://www.youtube.com/watch?v=KfhslNzopxo" target="_blank" rel="noopener noreferrer nofollow">练习：Geodata</a>
 
-\- [练习：Gmane 模型](https://www.youtube.com/watch?v=wSpl1-7afAk)
+\- <a href="https://www.youtube.com/watch?v=wSpl1-7afAk" target="_blank" rel="noopener noreferrer nofollow">练习：Gmane 模型</a>
 
-\- [练习：Gmane Spider](https://www.youtube.com/watch?v=H3w4lOFBUOI)
+\- <a href="https://www.youtube.com/watch?v=H3w4lOFBUOI" target="_blank" rel="noopener noreferrer nofollow">Exercise: Gmane Spider</a>
 
-\- [练习：Gmane Viz](https://www.youtube.com/watch?v=LRqVPMEXByw)
+\- <a href="https://www.youtube.com/watch?v=LRqVPMEXByw" target="_blank" rel="noopener noreferrer nofollow">Exercise: Gmane Viz</a>
 
-\- [练习：Page Rank](https://www.youtube.com/watch?v=yFRAZBkBDBs)
+\- <a href="https://www.youtube.com/watch?v=yFRAZBkBDBs" target="_blank" rel="noopener noreferrer nofollow">Exercise: Page Rank</a>
 
-\- [练习：Page Spider](https://www.youtube.com/watch?v=sXedPQ_AnWA)
+\- <a href="https://www.youtube.com/watch?v=sXedPQ_AnWA" target="_blank" rel="noopener noreferrer nofollow">Exercise: Page Spider</a>
 
-\- [练习: Page Viz](https://www.youtube.com/watch?v=Fm0hpkxsZoo)
+\- <a href="https://www.youtube.com/watch?v=Fm0hpkxsZoo" target="_blank" rel="noopener noreferrer nofollow">Exercise: Page Viz</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/dictionaries-and-loops.md b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/dictionaries-and-loops.md
index 018d5a26fdb..48549537107 100644
--- a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/dictionaries-and-loops.md
+++ b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/dictionaries-and-loops.md
@@ -14,7 +14,7 @@ dashedName: dictionaries-and-loops
 
 更多资源：
 
-\- [练习](https://www.youtube.com/watch?v=PrhZ9qwBDD8)
+\- <a href="https://www.youtube.com/watch?v=PrhZ9qwBDD8" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md
index f7ac215e9ac..fd33ec4f494 100644
--- a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md
+++ b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md
@@ -14,7 +14,7 @@ dashedName: files-as-a-sequence
 
 更多资源：
 
-\- [练习](https://www.youtube.com/watch?v=il1j4wkte2E)
+\- <a href="https://www.youtube.com/watch?v=il1j4wkte2E" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md
index 564c70c2c3d..766b4e06a8f 100644
--- a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md
+++ b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md
@@ -14,9 +14,9 @@ dashedName: intermediate-expressions
 
 更多资源：
 
-\- [练习 1](https://youtu.be/t_4DPwsaGDY)
+\- <a href="https://youtu.be/t_4DPwsaGDY" target="_blank" rel="noopener noreferrer nofollow">Exercise 1</a>
 
-\- [练习 2](https://youtu.be/wgkC8SxraAQ)
+\- <a href="https://youtu.be/wgkC8SxraAQ" target="_blank" rel="noopener noreferrer nofollow">Exercise 2</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/intermediate-strings.md b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/intermediate-strings.md
index 096d378ed22..731b081d1d4 100644
--- a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/intermediate-strings.md
+++ b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/intermediate-strings.md
@@ -14,7 +14,7 @@ dashedName: intermediate-strings
 
 更多资料：
 
-[练习](https://www.youtube.com/watch?v=1bSqHot-KwE)
+\- <a href="https://www.youtube.com/watch?v=1bSqHot-KwE" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md
index f9815777922..23d120aa8fe 100644
--- a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md
+++ b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md
@@ -18,9 +18,9 @@ dashedName: introduction-why-program
 
 更多资源：
 
-\- [Windows 系统安装 Python](https://youtu.be/F7mtLrYzZP8)
+\- <a href="https://youtu.be/F7mtLrYzZP8" target="_blank" rel="noopener noreferrer nofollow">Install Python on Windows</a>
 
-\- [MacOS 系统安装 Python](https://youtu.be/wfLnZP-4sZw)
+\- <a href="https://youtu.be/wfLnZP-4sZw" target="_blank" rel="noopener noreferrer nofollow">Install Python on MacOS</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md
index e5cf8f51fa9..36d7c92d74c 100644
--- a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md
+++ b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md
@@ -14,7 +14,7 @@ dashedName: iterations-more-patterns
 
 更多资源：
 
-\- [练习](https://www.youtube.com/watch?v=kjxXZQw0uPg)
+\- <a href="https://www.youtube.com/watch?v=kjxXZQw0uPg" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md
index 11e7d07694c..a180160faaa 100644
--- a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md
+++ b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md
@@ -14,9 +14,9 @@ dashedName: more-conditional-structures
 
 更多资源：
 
-\- [练习 1](https://www.youtube.com/watch?v=crLerB4ZxMI)
+\- <a href="https://www.youtube.com/watch?v=crLerB4ZxMI" target="_blank" rel="noopener noreferrer nofollow">Exercise 1</a>
 
-\- [练习 2](https://www.youtube.com/watch?v=KJN3-7HH6yk)
+\- <a href="https://www.youtube.com/watch?v=KJN3-7HH6yk" target="_blank" rel="noopener noreferrer nofollow">Exercise 2</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md
index ad5a6c08965..30e900cc2a7 100644
--- a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md
+++ b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md
@@ -14,11 +14,11 @@ dashedName: networking-web-scraping-with-python
 
 更多资料：
 
-\- [练习：socket1](https://www.youtube.com/watch?v=dWLdI143W-g)
+\- <a href="https://www.youtube.com/watch?v=dWLdI143W-g" target="_blank" rel="noopener noreferrer nofollow">Exercise: socket1</a>
 
-\- [练习：urllib](https://www.youtube.com/watch?v=8yis2DvbBkI)
+\- <a href="https://www.youtube.com/watch?v=8yis2DvbBkI" target="_blank" rel="noopener noreferrer nofollow">Exercise: urllib</a>
 
-\- [练习：urllinks](https://www.youtube.com/watch?v=g9flPDG9nnY)
+\- <a href="https://www.youtube.com/watch?v=g9flPDG9nnY" target="_blank" rel="noopener noreferrer nofollow">Exercise: urllinks</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md
index 538148408df..aed0cf30df7 100644
--- a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md
+++ b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md
@@ -10,15 +10,21 @@ bilibiliIds:
 dashedName: relational-databases-and-sqlite
 ---
 
+# --description--
+
+<a href="https://www.sqlite.org/download.html" target="_blank" rel="noopener noreferrer nofollow">Download SQLite</a>  
+<a href="https://sqlitebrowser.org/dl/" target="_blank" rel="noopener noreferrer nofollow">Download DB Browser for SQLite</a>  
+<a href="https://www.sqlite.org/famous.html" target="_blank" rel="noopener noreferrer nofollow">SQLite usage</a>
+
 # --question--
 
 ## --text--
 
-哪个不是数据库中主要的数据结构？
+哪一个不是数据库中的主要数据结构？
 
 ## --answers--
 
-指数
+索引
 
 ---
 
@@ -26,11 +32,11 @@ dashedName: relational-databases-and-sqlite
 
 ---
 
-一行
+行
 
 ---
 
-一列
+列
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md
index c26f2c89ffe..ef2419a56fc 100644
--- a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md
+++ b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md
@@ -14,15 +14,15 @@ dashedName: relational-databases-many-to-many-relationships
 
 更多资料：
 
-\- [练习：电子邮件](https://www.youtube.com/watch?v=uQ3Qv1z_Vao)
+\- <a href="https://www.youtube.com/watch?v=uQ3Qv1z_Vao" target="_blank" rel="noopener noreferrer nofollow">Exercise: Email</a>
 
-\- [练习：名册](https://www.youtube.com/watch?v=qEkUEAz8j3o)
+\- <a href="https://www.youtube.com/watch?v=qEkUEAz8j3o" target="_blank" rel="noopener noreferrer nofollow">Exercise: Roster</a>
 
-\- [练习：曲目](https://www.youtube.com/watch?v=I-E7avcPeSE)
+\- <a href="https://www.youtube.com/watch?v=I-E7avcPeSE" target="_blank" rel="noopener noreferrer nofollow">Exercise: Tracks</a>
 
-\- [练习：推特好友](https://www.youtube.com/watch?v=RZRAoBFIH6A)
+\- <a href="https://www.youtube.com/watch?v=RZRAoBFIH6A" target="_blank" rel="noopener noreferrer nofollow">Exercise: Twfriends</a>
 
-\- [练习：推特爬虫](https://www.youtube.com/watch?v=xBaJddvJL4A)
+\- <a href="https://www.youtube.com/watch?v=xBaJddvJL4A" target="_blank" rel="noopener noreferrer nofollow">Exercise: Twspider</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md
index 32064cb3944..2bf953abe5d 100644
--- a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md
+++ b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md
@@ -14,7 +14,7 @@ dashedName: strings-and-lists
 
 更多资源：
 
-\- [练习](https://www.youtube.com/watch?v=-9TfJF2dwHI)
+\- <a href="https://www.youtube.com/watch?v=-9TfJF2dwHI" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/web-services-api-rate-limiting-and-security.md b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/web-services-api-rate-limiting-and-security.md
index d2670e9b32b..0c37836f7ae 100644
--- a/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/web-services-api-rate-limiting-and-security.md
+++ b/curriculum/challenges/chinese/07-scientific-computing-with-python/python-for-everybody/web-services-api-rate-limiting-and-security.md
@@ -14,13 +14,13 @@ dashedName: web-services-api-rate-limiting-and-security
 
 更多资料：
 
-\- [练习：GeoJSON](https://www.youtube.com/watch?v=TJGJN0T8tak)
+\- <a href="https://www.youtube.com/watch?v=TJGJN0T8tak" target="_blank" rel="noopener noreferrer nofollow">Exercise: GeoJSON</a>
 
-\- [练习：JSON](https://www.youtube.com/watch?v=vTmw5RtfGMY)
+\- <a href="https://www.youtube.com/watch?v=vTmw5RtfGMY" target="_blank" rel="noopener noreferrer nofollow">Exercise: JSON</a>
 
-\- [练习：Twitter](https://www.youtube.com/watch?v=2c7YwhvpCro)
+\- <a href="https://www.youtube.com/watch?v=2c7YwhvpCro" target="_blank" rel="noopener noreferrer nofollow">Exercise: Twitter</a>
 
-\- [练习：XML](https://www.youtube.com/watch?v=AopYOlDa-vY)
+\- <a href="https://www.youtube.com/watch?v=AopYOlDa-vY" target="_blank" rel="noopener noreferrer nofollow">Exercise: XML</a>
 
 # --question--
 
diff --git a/curriculum/challenges/chinese/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md b/curriculum/challenges/chinese/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md
index d2e65d33484..74036e36a0b 100644
--- a/curriculum/challenges/chinese/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md
+++ b/curriculum/challenges/chinese/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md
@@ -8,7 +8,7 @@ dashedName: arithmetic-formatter
 
 # --description--
 
-你将[使用我们的 Replit 入门代码来完成这个项目](https://replit.com/github/freeCodeCamp/boilerplate-arithmetic-formatter)。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-arithmetic-formatter" target="_blank" rel="noopener noreferrer nofollow"> working on this project with our Replit starter code</a>.
 
 # --instructions--
 
@@ -64,7 +64,7 @@ arithmetic_arranger(["32 + 8", "1 - 3801", "9999 + 9999", "523 - 49"], True)
   - 每个数字（操作数）应该只包含数字。 否则，该函数将返回： `Error: Numbers must only contain digits.`
   - 每个操作数（也就是运算符两侧的数字）的宽度最多为四位。 否则，返回的错误字符串将为： `Error: Numbers cannot be more than four digits.`
 - 如果用户提供了正确格式的问题，返回的转换将遵循以下规则：
-  - 运算符和两个数中最长的一个之间应该有一个空格，运算符与第二个数在同一行，两个数的顺序与所提供的相同（第一个将是顶部的，而第二个将是底部。
+  - There should be a single space between the operator and the longest of the two operands, the operator will be on the same line as the second operand, both operands will be in the same order as provided (the first will be the top one and the second will be the bottom).
   - 数字应该右对齐。
   - 每个问题之间应该有四个空格。
   - 每个问题的底部都应该有破折号。 破折号应该单独沿着每个问题的整个长度延伸。 （上面的例子展示了这应该是什么样子。）
diff --git a/curriculum/challenges/chinese/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md b/curriculum/challenges/chinese/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md
index f997454a41e..c7d73db0b83 100644
--- a/curriculum/challenges/chinese/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md
+++ b/curriculum/challenges/chinese/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md
@@ -8,7 +8,7 @@ dashedName: budget-app
 
 # --description--
 
-你将[使用我们的 Replit 入门代码来完成这个项目](https://replit.com/github/freeCodeCamp/boilerplate-budget-app)。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-budget-app" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md b/curriculum/challenges/chinese/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md
index 5a178af72ec..a390bd20934 100644
--- a/curriculum/challenges/chinese/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md
+++ b/curriculum/challenges/chinese/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md
@@ -8,7 +8,7 @@ dashedName: polygon-area-calculator
 
 # --description--
 
-你将通过使用我们的[Replit 入门代码](https://replit.com/github/freeCodeCamp/boilerplate-polygon-area-calculator)来完成本项目。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-polygon-area-calculator" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md b/curriculum/challenges/chinese/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md
index 624826daab7..448d5f568ba 100644
--- a/curriculum/challenges/chinese/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md
+++ b/curriculum/challenges/chinese/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md
@@ -8,7 +8,7 @@ dashedName: probability-calculator
 
 # --description--
 
-你将通过使用我们的[Replit 入门代码](https://replit.com/github/freeCodeCamp/boilerplate-probability-calculator)来完成本项目。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-probability-calculator" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 # --instructions--
 
@@ -37,7 +37,7 @@ hat3 = Hat(red=5, orange=4, black=1, blue=0, pink=2, striped=9)
 
 `experiment` 函数应该返回一个概率。
 
-例如，假设你想确定当你从一个包含 6 个黑球、4 个红球和 3 个绿球的帽子中抽出 5 个球时，至少得到 2 个红球和 1 个绿球的概率。 为此，我们进行 `N` 次实验，记录其中我们至少得到 2 个红球和 1 个绿球的次数 `M`，并估计概率为`M/N`。 每个实验都包括从一顶装有指定球的帽子开始，抽取一些球，然后检查我们是否得到了我们想要得到的球。
+For example, if you want to determine the probability of getting at least two red balls and one green ball when you draw five balls from a hat containing six black, four red, and three green. To do this, you will perform `N` experiments, count how many times `M` you get at least two red balls and one green ball, and estimate the probability as `M/N`. Each experiment consists of starting with a hat containing the specified balls, drawing several balls, and checking if you got the balls you were attempting to draw.
 
 以下是基于上面的示例调用 `experiment` 函数的方法，其中包含 2000 个实验：
 
diff --git a/curriculum/challenges/chinese/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md b/curriculum/challenges/chinese/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md
index 55dc881119e..2002afbb6dd 100644
--- a/curriculum/challenges/chinese/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md
+++ b/curriculum/challenges/chinese/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md
@@ -8,7 +8,7 @@ dashedName: time-calculator
 
 # --description--
 
-你将通过使用我们的[Replit 入门代码](https://replit.com/github/freeCodeCamp/boilerplate-time-calculator)来完成本项目。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-time-calculator" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md b/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md
index bb62f751308..e63d7c64e04 100644
--- a/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md
+++ b/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md
@@ -11,16 +11,17 @@ dashedName: introduction-to-data-analysis
 ---
 
 # --description--
+数据分析是指通过清理、转换、处理原始数据，从而洞察数据价值的行为。
 
-以下有更多的资料：
+更多资源：
 
-\- [幻灯片](https://docs.google.com/presentation/d/1cUIt8b2ySz-85_ykfeuuWsurccwTAuFPn782pZBzFsU/edit?usp=sharing)
+\- <a href="https://chinese.freecodecamp.org/news/what-is-data-analysis/" rel="noopener noreferrer nofollow">专栏文章</a>
 
 # --question--
 
 ## --text--
 
-以下哪一项 **不是** 数据分析的一部分？
+以下哪一项**不属于**数据分析范畴？
 
 ## --answers--
 
@@ -28,7 +29,7 @@ dashedName: introduction-to-data-analysis
 
 ---
 
-为分析选择所需的结论。
+分析数据并得出结论。
 
 ---
 
diff --git a/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md b/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md
index 8f765f565d2..11f62cab08b 100644
--- a/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md
+++ b/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md
@@ -8,12 +8,13 @@ dashedName: demographic-data-analyzer
 
 # --description--
 
-你将通过使用我们的[Replit 入门代码](https://replit.com/github/freeCodeCamp/boilerplate-demographic-data-analyzer)来完成本项目。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-demographic-data-analyzer" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 我们仍在开发 Python 课程的交互式教学部分。 目前，你可以在 YouTube 上通过 freeCodeCamp.org 上传的一些视频学习这个项目相关的知识。
 
-- [Python for Everybody 视频课程](https://www.freecodecamp.org/news/python-for-everybody/)（14 小时）
-- [Learn Python 视频课程](https://www.freecodecamp.org/news/learn-python-video-course/)（10 小时）
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a> (14 hours)
+
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">How to Analyze Data with Python Pandas</a> (10 hours)
 
 # --instructions--
 
@@ -59,7 +60,7 @@ dashedName: demographic-data-analyzer
 
 ## 数据集源
 
-Dua, D. and Graff, C. (2019). [UCI Machine Learning Repository](http://archive.ics.uci.edu/ml). Irvine, CA: University of California, School of Information and Computer Science.
+Dua, D. and Graff, C. (2019). <a href="http://archive.ics.uci.edu/ml" target="_blank" rel="noopener noreferrer nofollow">UCI Machine Learning Repository</a>. Irvine, CA: University of California, School of Information and Computer Science.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md b/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md
index 272dc6a86e5..1e4ab7a67c0 100644
--- a/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md
+++ b/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md
@@ -8,12 +8,13 @@ dashedName: mean-variance-standard-deviation-calculator
 
 # --description--
 
-你将通过使用我们的[Replit 入门代码](https://replit.com/github/freeCodeCamp/boilerplate-mean-variance-standard-deviation-calculator)来完成本项目。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-mean-variance-standard-deviation-calculator" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 我们仍在开发 Python 课程的交互式教学部分。 目前，你可以在 YouTube 上通过 freeCodeCamp.org 上传的一些视频学习这个项目相关的知识。
 
-- [Python for Everybody 视频课程](https://www.freecodecamp.org/news/python-for-everybody/)（14 小时）
-- [Learn Python 视频课程](https://www.freecodecamp.org/news/learn-python-video-course/)（10 小时）
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a>(14 hours)
+
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">How to Analyze Data with Python Pandas</a> (10 hours)
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md b/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md
index 2866a7074eb..ebe71d95a7d 100644
--- a/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md
+++ b/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md
@@ -8,12 +8,13 @@ dashedName: medical-data-visualizer
 
 # --description--
 
-你将通过使用我们的[Replit 入门代码](https://replit.com/github/freeCodeCamp/boilerplate-medical-data-visualizer)来完成本项目。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-medical-data-visualizer" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 我们仍在开发 Python 课程的交互式教学部分。 目前，你可以在 YouTube 上通过 freeCodeCamp.org 上传的一些视频学习这个项目相关的知识。
 
-- [Python for Everybody 视频课程](https://www.freecodecamp.org/news/python-for-everybody/)（14 小时）
-- [Learn Python 视频课程](https://www.freecodecamp.org/news/learn-python-video-course/)（10 小时）
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a>(14 hours)
+
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">How to Analyze Data with Python Pandas</a> (10 hours)
 
 # --instructions--
 
@@ -25,20 +26,20 @@ dashedName: medical-data-visualizer
 
 文件名：medical_examination.csv
 
-|    项目    | 变量类型 |     变量名     |         变量值类型         |
-|:--------:|:----:|:-----------:|:---------------------:|
-|    年龄    | 客观特征 |     age     |      int (days)       |
-|    身高    | 客观特征 |   height    |       int (cm)        |
-|    体重    | 客观特征 |   weight    |      float (kg)       |
-|    性别    | 客观特征 |   gender    |         分类编码          |
-|   收缩压    | 检测特征 |    ap_hi    |          int          |
-|   舒张压    | 检测特征 |    ap_lo    |          int          |
-|   胆固醇    | 检测特征 | cholesterol | 1：正常，2：高于正常，3：远远高于正常值 |
-|   血糖值    | 检测特征 |    gluc     | 1：正常，2：高于正常，3：远远高于正常值 |
-|   吸烟问题   | 主观特征 |    smoke    |        binary         |
-|   饮酒量    | 主观特征 |    alco     |        binary         |
-|   体育活动   | 主观特征 |   active    |        binary         |
-| 是否有心血管疾病 | 目标变量 |   cardio    |        binary         |
+|    项目    | 变量类型 |      变量名      |         变量值类型         |
+|:--------:|:----:|:-------------:|:---------------------:|
+|    年龄    | 客观特征 |     `age`     |      int (days)       |
+|    身高    | 客观特征 |   `height`    |       int (cm)        |
+|    体重    | 客观特征 |   `weight`    |      float (kg)       |
+|    性别    | 客观特征 |   `gender`    |         分类编码          |
+|   收缩压    | 检测特征 |    `ap_hi`    |          int          |
+|   舒张压    | 检测特征 |    `ap_lo`    |          int          |
+|   胆固醇    | 检测特征 | `cholesterol` | 1：正常，2：高于正常，3：远远高于正常值 |
+|   血糖值    | 检测特征 |    `gluc`     | 1：正常，2：高于正常，3：远远高于正常值 |
+|   吸烟问题   | 主观特征 |    `smoke`    |        binary         |
+|   饮酒量    | 主观特征 |    `alco`     |        binary         |
+|   体育活动   | 主观特征 |   `active`    |        binary         |
+| 是否有心血管疾病 | 目标变量 |   `cardio`    |        binary         |
 
 ## 任务
 
diff --git a/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md b/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md
index 1cbc8be6c4b..5e188cdaf73 100644
--- a/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md
+++ b/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md
@@ -8,12 +8,13 @@ dashedName: page-view-time-series-visualizer
 
 # --description--
 
-你将通过使用我们的[Replit 入门代码](https://replit.com/github/freeCodeCamp/boilerplate-page-view-time-series-visualizer)来完成本项目。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-page-view-time-series-visualizer" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 我们仍在开发 Python 课程的交互式教学部分。 目前，你可以在 freeCodeCamp.org 的 YouTube 频道中通过视频学习到这个项目相关的所有知识
 
-- [Python for Everybody 视频课程](https://www.freecodecamp.org/news/python-for-everybody/)（14 小时）
-- [Learn Python 视频课程](https://www.freecodecamp.org/news/learn-python-video-course/)（10 小时）
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a>(14 hours)
+
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">How to Analyze Data with Python Pandas</a> (10 hours)
 
 # --instructions--
 
@@ -21,11 +22,11 @@ dashedName: page-view-time-series-visualizer
 
 使用数据完成以下任务：
 
-- 使用 Pandas 从 “fcc-forum-pageviews.csv” 导入数据。 将索引设置为 “date” 列。
+- 使用 Pandas 从 “fcc-forum-pageviews.csv” 导入数据。 Set the index to the `date` column.
 - 通过过滤掉页面浏览量位于数据集前 2.5% 或数据集后 2.5% 的日期来清理数据。
-- 创建一个 `draw_line_plot` 函数，该函数使用 Matplotlib 绘制类似于“examples/Figure_1.png”的折线图。 标题应为“Daily freeCodeCamp Forum Page Views 5/2016-12/2019”。 x 轴上的标签应为“Date”，y 轴上的标签应为“Page Views”。
-- 创建一个 `draw_bar_plot` 函数，用于绘制类似于“examples/Figure_2.png”的条形图。 它应该显示按年份分组的每个月的平均每日页面浏览量。 图例应显示月份标签并具有“Months”标题。 在图表上，x 轴上的标签应为“Years”，y 轴上的标签应为“Average Page Views”。
-- 创建一个 `draw_box_plot` 函数，该函数使用 Seaborn 绘制两个相邻的箱形图，类似于“examples/Figure_3.png”。 这些箱线图应显示值在给定年份或月份内的分布情况以及随时间推移的比较情况。 第一个图表的标题应为“Year-wise Box Plot (Trend)”，第二个图表的标题应为“Month-wise Box Plot (Seasonality)”。 确保底部的月份标签从“Jan”开始，并且 x 和 x 轴标记正确。 样板文件包括准备数据的命令。
+- 创建一个 `draw_line_plot` 函数，该函数使用 Matplotlib 绘制类似于“examples/Figure_1.png”的折线图。 The title should be `Daily freeCodeCamp Forum Page Views 5/2016-12/2019`. The label on the x axis should be `Date` and the label on the y axis should be `Page Views`.
+- 创建一个 `draw_bar_plot` 函数，用于绘制类似于“examples/Figure_2.png”的条形图。 它应该显示按年份分组的每个月的平均每日页面浏览量。 The legend should show month labels and have a title of `Months`. On the chart, the label on the x axis should be `Years` and the label on the y axis should be `Average Page Views`.
+- 创建一个 `draw_box_plot` 函数，该函数使用 Seaborn 绘制两个相邻的箱形图，类似于“examples/Figure_3.png”。 这些箱线图应显示值在给定年份或月份内的分布情况以及随时间推移的比较情况。 The title of the first chart should be `Year-wise Box Plot (Trend)` and the title of the second chart should be `Month-wise Box Plot (Seasonality)`. Make sure the month labels on bottom start at `Jan` and the x and y axis are labeled correctly. 样板文件包括准备数据的命令。
 
 对于每个图表，请确保使用数据框的副本。 单元测试是在 `test_module.py` 下为你编写的。
 
diff --git a/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md b/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md
index 1f959901d81..65f416b727a 100644
--- a/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md
+++ b/curriculum/challenges/chinese/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md
@@ -8,12 +8,13 @@ dashedName: sea-level-predictor
 
 # --description--
 
-你将通过使用我们的[Replit 入门代码](https://replit.com/github/freeCodeCamp/boilerplate-sea-level-predictor)来完成本项目。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-sea-level-predictor" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 我们仍在开发 Python 课程的交互式教学部分。 目前，你可以在 YouTube 上通过 freeCodeCamp.org 上传的一些视频学习这个项目相关的知识。
 
-- [Python for Everybody 视频课程](https://www.freecodecamp.org/news/python-for-everybody/)（14 小时）
-- [Learn Python 视频课程](https://www.freecodecamp.org/news/learn-python-video-course/)（10 小时）
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a>(14 hours)
+
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">How to Analyze Data with Python Pandas</a> (10 hours)
 
 # --instructions--
 
@@ -22,10 +23,10 @@ dashedName: sea-level-predictor
 使用数据完成以下任务：
 
 - 使用 Pandas 从 `epa-sea-level.csv` 导入数据。
-- 使用 matplotlib 创建散点图，使用“Year”列作为 x 轴，将“CSIRO Adjusted Sea Level”列作为 y 轴。
+- Use matplotlib to create a scatter plot using the `Year` column as the x-axis and the `CSIRO Adjusted Sea Level` column as the y-axix.
 - 使用 `scipy.stats` 中的 `linregress` 函数来获得最佳拟合线的斜率和 y 截距。 在散点图的顶部绘制最佳拟合线。 使线穿过 2050 年以预测 2050 年的海平面上升。
 - 仅使用数据集中从 2000 年到最近一年的数据绘制一条新的最佳拟合线。 如果上升速度继续与 2000 年一样，则使该线也经过 2050 年以预测 2050 年的海平面上升。
-- x 标签应为 “Year”，y 标签应为 “Sea Level (inches)”，标题应为 “Rise in Sea Level”。
+- The x label should be `Year`, the y label should be `Sea Level (inches)`, and the title should be `Rise in Sea Level`.
 
 单元测试是在 `test_module.py` 下为你编写的。
 
@@ -44,7 +45,8 @@ dashedName: sea-level-predictor
 复制项目的 URL 并将其提交给 freeCodeCamp。
 
 ## 数据源
-[Global Average Absolute Sea Level Change](https://datahub.io/core/sea-level-rise), 1880-2014 from the US Environmental Protection Agency using data from CSIRO, 2015; NOAA, 2015.
+
+<a href="https://datahub.io/core/sea-level-rise" target="_blank" rel="noopener noreferrer nofollow">Global Average Absolute Sea Level Change</a>, 1880-2014 from the US Environmental Protection Agency using data from CSIRO, 2015; NOAA, 2015.
 
 
 # --hints--
diff --git a/curriculum/challenges/chinese/09-information-security/information-security-projects/anonymous-message-board.md b/curriculum/challenges/chinese/09-information-security/information-security-projects/anonymous-message-board.md
index 89c14c053a4..ec2e6714efb 100644
--- a/curriculum/challenges/chinese/09-information-security/information-security-projects/anonymous-message-board.md
+++ b/curriculum/challenges/chinese/09-information-security/information-security-projects/anonymous-message-board.md
@@ -8,12 +8,12 @@ dashedName: anonymous-message-board
 
 # --description--
 
-构建一个功能上与此相似的全栈式 JavaScript 应用程序：<https://anonymous-message-board.freecodecamp.rocks/>。
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://anonymous-message-board.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://anonymous-message-board.freecodecamp.rocks/</a>.
 
 在这个项目中，你将使用以下方法之一编写你的代码：
 
--   克隆[这个 GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-messageboard/) 并在本地完成你的项目。
--   使用 [我们的 Replit 启动项目](https://replit.com/github/freeCodeCamp/boilerplate-project-messageboard)来完成你的项目。
+-   Clone <a href="https://github.com/freeCodeCamp/boilerplate-project-messageboard/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete your project locally.
+-   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-messageboard" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 -   使用一个你喜欢的站点生成器来完成项目。 需要确定包含了我们 GitHub 仓库的所有文件。
 
 完成本项目后，请将一个正常运行的 demo（项目演示）托管在可以公开访问的平台。 然后将 URL 提交到 `Solution Link` 中。 此外，还可以提交一个指向项目源码的 `GitHub Link`。
diff --git a/curriculum/challenges/chinese/09-information-security/information-security-projects/port-scanner.md b/curriculum/challenges/chinese/09-information-security/information-security-projects/port-scanner.md
index 2b035409c8c..cb0c9515339 100644
--- a/curriculum/challenges/chinese/09-information-security/information-security-projects/port-scanner.md
+++ b/curriculum/challenges/chinese/09-information-security/information-security-projects/port-scanner.md
@@ -9,13 +9,15 @@ dashedName: port-scanner
 
 # --description--
 
-你将通过使用我们的 [Replit 入门代码](https://replit.com/github/freeCodeCamp/boilerplate-port-scanner) 来完成本项目。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-port-scanner" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 我们仍在开发 Python 课程的交互式教学部分。 目前，你可以在 YouTube 上通过 freeCodeCamp.org 上传的一些视频学习这个项目相关的知识。
 
-- [Python for Everybody 视频课程](https://www.freecodecamp.org/news/python-for-everybody/)（14 小时）
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a> (14 hours)
 
-- [Learn Python 视频课程](https://www.freecodecamp.org/news/learn-python-video-course/)（10 小时）
+- <a href="https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/" target="_blank" rel="noopener noreferrer nofollow">Learn Python Basics in Depth</a> (4 hours)
+
+- <a href="https://www.freecodecamp.org/news/intermediate-python-course/" target="_blank" rel="noopener noreferrer nofollow">Intermediate Python Course</a> (6 hours)
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md b/curriculum/challenges/chinese/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md
index 453fe95fb4d..5fa5b4d65b6 100644
--- a/curriculum/challenges/chinese/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md
+++ b/curriculum/challenges/chinese/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md
@@ -8,21 +8,32 @@ dashedName: secure-real-time-multiplayer-game
 
 # --description--
 
-使用 HTML Canvas API 和 [Socket.io](https://socket.io/) 开发一个 2D 实时多人游戏，其功能与此类似：<https://secure-real-time-multiplayer-game.freecodecamp.rocks/>。 在这个项目中，你将使用以下方法之一编写你的代码：
+使用 HTML Canvas API 和 Socket.io 开发一个功能上类似于 <a href="https://secure-real-time-multiplayer-game.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://secure-real-time-multiplayer-game.freecodecamp.rocks/</a> 的 2D 实时多人游戏。 在这个项目中，你将使用以下方法之一编写你的代码：
 
--   克隆[这个 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)来完成你的项目。
+-   克隆<a href="https://github.com/freeCodeCamp/boilerplate-project-secure-real-time-multiplayer-game/" target="_blank" rel="noopener noreferrer nofollow">这个 GitHub 仓库</a>，并在本地完成你的项目。
+-   使用<a href="https://replit.com/github/freeCodeCamp/boilerplate-project-secure-real-time-multiplayer-game" target="_blank" rel="noopener noreferrer nofollow">我们在 Replit 上的初始化项目</a>来完成你的项目
 -   使用您选择的站点生成器来完成项目。 需要确定包含了我们 GitHub 仓库的所有文件。
 
 完成本项目后，请将一个正常运行的 demo（项目演示）托管在可以公开访问的平台。 然后在 `Solution Link` 框中提交你的项目 URL。 此外，还可以将项目的源码提交到 `GitHub Link` 中。
 
 # --instructions--
 
-**注意** ：`helmet@^3.21.3` 是用户故事所必需的。 这意味着你需要使用以前版本的 Helmet 的文档，了解如何实现用户故事的信息。
+创建一个安全的多人游戏，每名玩家可以移动他们的角色，并且这个游戏至少提供了一个可收集的道具，玩家的排名是根据他们的分数计算的。
+
+有关详细信息，请参考下面的测试。
+
+请确保你的游戏是安全的！ 包含以下安全措施：
+
+- 客户端不能猜测/嗅探 MIME 类型
+- 防止 XSS 攻击
+- 不要在客户端中缓存网站的任何信息
+- 在请求头中声明网站是由 `PHP 7.4.3` 提供技术支持
+
+**注意：** `helmet@^3.21.3` 是需求中所要求的。 这意味着你将需要使用之前版本的 Helmet 文档，来了解如何实现需求。
 
 # --hints--
 
-提交自己的项目，而不是示例的 URL。
+你应该提交你自己的项目，而不是示例 URL
 
 ```js
 (getUserInput) => {
@@ -34,91 +45,91 @@ dashedName: secure-real-time-multiplayer-game
 };
 ```
 
-多个玩家可以连接到一台服务器游玩。
+多名玩家可以连接到同一台服务器玩这个游戏。
 
 ```js
 
 ```
 
-每个玩家都有头像。
+每名玩家都有一个角色。
 
 ```js
 
 ```
 
-每个玩家都由在 `Player.mjs` 中创建的 `Player` 类对象来代表。
+每名玩家都由 `Player.mjs` 中的 `Player` 类创建的对象表示
 
 ```js
 
 ```
 
-至少，每个玩家对象应该包含一个唯一的 `id`、一个 `score`，以及代表玩家当前位置的 `x` 和 `y` 坐标。
+至少，每个玩家对象都应该包含一个唯一的 `id`、一个`score`，以及代表玩家当前位置的 `x` 和 `y` 坐标。
 
 ```js
 
 ```
 
-游戏至少有一种类型的可收藏物品。 在 `Collectible.mjs` 中完成 `Collectible` 类来实现这一点。
+游戏中至少有一种可收集道具。 在 `Collectible.mjs` 中完成 `Collectible` 类来实现这一点
 
 ```js
 
 ```
 
-至少，每个由 `Collectible` 类创建的可收集物品对象应该包含一个唯一的 `id`、一个 `value`，以及代表该物品当前位置的 `x` 和 `y` 坐标。
+至少，由 `Collectible` 类创建的每个可收集物品对象应该包含一个唯一的 `id`、一个 `value` 和代表物品的当前位置 `x` 和 `y` 坐标。
 
 ```js
 
 ```
 
-玩家可以使用 WASD 或方向键移动头像。 完成 `Player.mjs` 中的 `movePlayer` 方法来实现这一功能。
+玩家可以使用 WASD 和/或箭头键移动他们的角色。 完成 `Player.mjs` 中的 `movePlayer` 方法来实现这一功能。
 
 ```js
 
 ```
 
-`movePlayer` 方法应该接受两个参数：一个是 “up”、“down”、“left” 或 “right” 的字符串，另一个是玩家角色位置应该改变的像素数量。 `movePlayer` 应该调整它所调用的玩家对象的 `x` 和 `y` 坐标。
+`movePlayer` 方法应该接受两个参数：一个由 “up”、“down”、“left” 或 “right” 组成的字符串，以及一个表示玩家位置应该改变的像素数量的数字。 `movePlayer` 应该调整被调用的玩家对象的 `x` 和 `y` 坐标。
 
 ```js
 
 ```
 
-用玩家的分数来计算他们相对其他玩家的名次。 在 `Player` 类中完成 `calculateRank` 方法来实现这个。
+玩家的分数应该用来计算他们与其他玩家相比的排名。 完成 `Player` 类中的 `calculateRank` 方法来实现这个功能。
 
 ```js
 
 ```
 
-`calculateRank` 方法应该接受一个代表所有在线玩家的对象数组，并返回字符串 `Rank: currentRanking/totalPlayers`。 例如，在一局有两个玩家的游戏中，如果玩家 A 的分数是 3，玩家 B 的分数是 5，那么玩家 A 的 `calculateRank` 应该返回 `Rank: 2/2`。
+`calculateRank` 方法应该接受一个代表所有连接的玩家的对象数组，并返回字符串 `Rank: currentRanking/totalPlayers`（排名：当前排名/总玩家数）。 举个例子，在一个两人游戏中，如果玩家 A 有 3 分，玩家 B 有 5 分，那么玩家 A 的 `calculateRank` 应该返回 `Rank: 2/2`。
 
 ```js
 
 ```
 
-玩家可以与可收集物品发生碰撞。 完成 `Player.mjs` 中的 `collision` 方法来实现这一点。
+玩家可以与收集道具发生碰撞。 完成 `Player.mjs` 中的 `collision` 方法实现这一功能。
 
 ```js
 
 ```
 
-`collision` 方法应该接受一个可收集物品的对象作为参数。 如果玩家的头像与物品相交，`collision` 方法应该返回 `true`。
+`collision` 方法应该接受可收集物品的对象作为参数。 如果玩家的角色与道具重合，`collision` 方法应该返回 `true`。
 
 ```js
 
 ```
 
-所有玩家都保持游戏状态同步。
+所有玩家保持同步。
 
 ```js
 
 ```
 
-玩家可以随时断开与游戏的连接。
+玩家可以在任何时候退出游戏。
 
 ```js
 
 ```
 
-阻止客户端试图猜测/嗅探 MIME 类型。
+防止客户端尝试猜测/嗅探 MIME 类型。
 
 ```js
 async (getUserInput) => {
@@ -138,7 +149,7 @@ async (getUserInput) => {
 };
 ```
 
-客户端没有缓存任何网站内容。
+网站上的任何东西都不会被缓存到客户端中。
 
 ```js
 async (getUserInput) => {
@@ -154,7 +165,7 @@ async (getUserInput) => {
 };
 ```
 
-请求头显示该网站是由 “PHP 7.4.3” 驱动的，尽管实际并非如此（作为一种安全防御措施）。
+在请求头中声明该网站由 “PHP 7.4.3” 提供技术支持，尽管它并非如此（作为一种安全措施）。
 
 ```js
 async (getUserInput) => {
diff --git a/curriculum/challenges/chinese/09-information-security/information-security-projects/sha-1-password-cracker.md b/curriculum/challenges/chinese/09-information-security/information-security-projects/sha-1-password-cracker.md
index f990c94651f..f5ed76bfb17 100644
--- a/curriculum/challenges/chinese/09-information-security/information-security-projects/sha-1-password-cracker.md
+++ b/curriculum/challenges/chinese/09-information-security/information-security-projects/sha-1-password-cracker.md
@@ -9,13 +9,15 @@ dashedName: sha-1-password-cracker
 
 # --description--
 
-你将通过使用我们的 [Replit 入门代码](https://replit.com/github/freeCodeCamp/boilerplate-SHA-1-password-cracker) 来完成本项目。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-SHA-1-password-cracker" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 我们仍在开发 Python 课程的交互式教学部分。 目前，你可以在 YouTube 上通过 freeCodeCamp.org 上传的一些视频学习这个项目相关的知识。
 
-- [Python for Everybody 视频课程](https://www.freecodecamp.org/news/python-for-everybody/)（14 小时）
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a> (14 hours)
 
-- [Learn Python 视频课程](https://www.freecodecamp.org/news/learn-python-video-course/)（10 小时）
+- <a href="https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/" target="_blank" rel="noopener noreferrer nofollow">Learn Python Basics in Depth</a> (4 hours)
+
+- <a href="https://www.freecodecamp.org/news/intermediate-python-course/" target="_blank" rel="noopener noreferrer nofollow">Intermediate Python Course</a> (6 hours)
 
 # --instructions--
 
@@ -41,7 +43,7 @@ dashedName: sha-1-password-cracker
 - `da5a4e8cf89539e66097acd2f8af128acae2f8ae` 应该返回 “q1w2e3r4t5”
 - `ea3f62d498e3b98557f9f9cd0d905028b3b019e1` 应该返回 “bubbles1”
 
-`hashlib` 库已经为你导入。 你应该在你的代码中使用它。 [在此了解更多关于 “hashlib” 的信息](https://docs.python.org/3/library/hashlib.html)
+`hashlib` 库已经为你导入。 You should consider using it in your code. <a href="https://docs.python.org/3/library/hashlib.html" target="_blank" rel="noopener noreferrer nofollow">Learn more about "hashlib" here</a>.
 
 ## 开发
 
diff --git a/curriculum/challenges/chinese/09-information-security/information-security-projects/stock-price-checker.md b/curriculum/challenges/chinese/09-information-security/information-security-projects/stock-price-checker.md
index 05c9b096382..aa8bcbbe6ad 100644
--- a/curriculum/challenges/chinese/09-information-security/information-security-projects/stock-price-checker.md
+++ b/curriculum/challenges/chinese/09-information-security/information-security-projects/stock-price-checker.md
@@ -8,14 +8,14 @@ dashedName: stock-price-checker
 
 # --description--
 
-构建一个 JavaScript 的全栈应用，在功能上与这个应用相似：<https://stock-price-checker.freecodecamp.rocks/>。
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://stock-price-checker.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://stock-price-checker.freecodecamp.rocks/</a>.
 
-由于所有可靠的股票价格 API 都需要一个 API 密钥，我们已经建立了一个解决方案。 使用 [https://stock-price-checer-proxy.freecodecamp.rocks/](https://stock-price-checker-proxy.freecodecamp.rocks/) 获取最新的股票价格信息，而无需注册您自己的密钥。
+由于所有可靠的股票价格 API 都需要一个 API 密钥，我们已经建立了一个解决方案。 Use <a href="https://stock-price-checker-proxy.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://stock-price-checker-proxy.freecodecamp.rocks/</a> to get up-to-date stock price information without needing to sign up for your own key.
 
 可以采用下面的任意一种方式完成这个挑战：
 
--   克隆 [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-stockchecker/) 并在本地完成项目。
--   使用[我们的 Replit 启动项目](https://replit.com/github/freeCodeCamp/boilerplate-project-stockchecker)来完成你的项目。
+-   Clone <a href="https://github.com/freeCodeCamp/boilerplate-project-stockchecker/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete your project locally.
+-   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-stockchecker" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 -   使用你选择的网站生成器来完成项目。 需要包含我们 GitHub 仓库的所有文件。
 
 完成本项目后，请将一个正常运行的 demo（项目演示）托管在可以公开访问的平台。 然后将 URL 提交到 `Solution Link` 中。 此外，还可以将项目的源码提交到 `GitHub Link` 中。
diff --git a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md
index cdc890a4e1b..ea545510673 100644
--- a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md
+++ b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md
@@ -8,7 +8,7 @@ dashedName: ask-browsers-to-access-your-site-via-https-only-with-helmet-hsts
 
 # --description--
 
-请注意，本项目在[这个 Repl.it 项目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基础上进行开发。你也可以从 [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 HTTP 严格传输安全（HSTS）是一种网络安全策略，有助于保护网站免受协议降级攻击和 cookie 劫持。 如果你的网站可以通过 HTTPS 访问，你可以要求用户的浏览器避免使用不安全的 HTTP。 通过设置标头 Strict-Transport-Security，你告诉浏览器在指定时间内对未来的请求使用 HTTPS。 这将对初始请求之后的请求起作用。
 
diff --git a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md
index faf9647e20a..23a88b980e3 100644
--- a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md
+++ b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md
@@ -8,7 +8,7 @@ dashedName: avoid-inferring-the-response-mime-type-with-helmet-nosniff
 
 # --description--
 
-请注意，本项目在[这个 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`。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>. 浏览器可以使用内容或 MIME 嗅探来覆盖响应的 `Content-Type` 头，猜测并使用隐含的内容类型来处理数据。 虽然这在某些情况下可能很方便，但也可能导致一些危险的攻击。 该中间件将 X-Content-Type-Options 头设置为 `nosniff`，指示浏览器不要绕过所提供的 `Content-Type`。
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md
index 23ee9f49b1a..e91d402c5f1 100644
--- a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md
+++ b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md
@@ -8,7 +8,7 @@ dashedName: configure-helmet-using-the-parent-helmet-middleware
 
 # --description--
 
-请注意，本项目在[这个 Repl.it 项目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基础上进行开发。你也可以从 [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `app.use(helmet())` 将自动包括上面介绍的所有中间件，除了 `noCache()` 和 `contentSecurityPolicy()`，但如果有必要，这些可以被启用。 你也可以使用配置对象，单独禁用或配置任何其他中间件。
 
diff --git a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md
index cdbf7c12ebc..81fa669aa79 100644
--- a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md
+++ b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md
@@ -8,7 +8,7 @@ dashedName: disable-client-side-caching-with-helmet-nocache
 
 # --description--
 
-请注意，本项目在[这个 Repl.it 项目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基础上进行开发。 你也可以从[GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/)上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 如果你正在为你的网站发布更新，而你希望用户总是下载较新的版本，你可以（尝试）在客户的浏览器上禁用缓存。 它在开发中也很有用。 缓存具有性能优势，你将失去这些优势，因此只有在真正需要时才使用此选项。
 
diff --git a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md
index 90e2dd50b53..a1877b9595b 100644
--- a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md
+++ b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md
@@ -8,7 +8,7 @@ dashedName: disable-dns-prefetching-with-helmet-dnsprefetchcontrol
 
 # --description--
 
-请注意，本项目在[这个 Repl.it 项目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基础上进行开发。你也可以从 [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 为了提高性能，大部分浏览器都会为页面上的链接预先加载 DNS 记录。 这样当用户点击一个链接的时候浏览器已经知道其 IP 地址了。 但这也会造成 DNS 服务的过度使用（如果你有一个百万用户数量级的大型网站）、隐私问题（窃听者可以借此推测出你在访问哪个页面）、页面统计数据准确性（有些没访问过的链接会被标记成已访问）。 如果你对安全性要求比较高，你应该禁用 DNS 预加载。 当然，这样做会让你损失一些性能。
 
diff --git a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md
index cc82378b162..261d880bc4f 100644
--- a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md
+++ b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md
@@ -8,7 +8,7 @@ dashedName: hash-and-compare-passwords-asynchronously
 
 # --description--
 
-请注意，本项目在[这个 Repl.it 项目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基础上进行开发。 你也可以从[GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/)上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-bcrypt" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-bcrypt/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 由于哈希运算会占用很大计算机资源，并且会耗费比较多时间，因此比较推荐的做法是异步调用哈希算法，这样就不会因此阻止其它连接或请求了。 异步调用哈希方法非常简单，只需要：
 
diff --git a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md
index cb755f67dc9..f4dd1b3899e 100644
--- a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md
+++ b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md
@@ -8,7 +8,7 @@ dashedName: hash-and-compare-passwords-synchronously
 
 # --description--
 
-请注意，本项目在 [这个 Repl.it 项目](https://replit.com/github/freeCodeCamp/boilerplate-bcrypt) 的基础上进行开发。 你也可以从 [GitHub](https://github.com/freeCodeCamp/boilerplate-bcrypt/) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-bcrypt" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-bcrypt/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 同步执行哈希运算是非常简单的，但这会在哈希计算量大并且次数多的情况下造成延迟。 用这个方法哈希就像调用函数一样简单。
 
diff --git a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md
index af0b394ac2c..694b9c21633 100644
--- a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md
+++ b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md
@@ -8,7 +8,7 @@ dashedName: hide-potentially-dangerous-information-using-helmet-hidepoweredby
 
 # --description--
 
-请注意，本项目在[这个 Repl.it 项目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基础上进行开发。你也可以从 [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 如果黑客发现你的网站是用 Express 搭建的，那么他们就可以利用 Express 或 Node 现存的漏洞来攻击你的网站。 `X-Powered-By: Express` 默认在来自 Express 的每个请求中被发送。 使用 `helmet.hidePoweredBy()` 中间件来移除 X-Powered-By 头。
 
diff --git a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md
index 2aca76fc3bf..a5a4b46ee6e 100644
--- a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md
+++ b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md
@@ -10,8 +10,8 @@ dashedName: install-and-require-helmet
 
 你可以采用下面的任意一种编写代码的方式来完成这些挑战：
 
-- 克隆 [这个 GitHub 仓库](https://github.com/freeCodeCamp/boilerplate-infosec/) 并在本地完成这些挑战。
-- 使用[我们在 Repl.it 上的初始化项目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)来完成这些挑战。
+- 克隆<a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">这个 GitHub 仓库</a>，并在本地完成这些挑战。
+- 使用<a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">我们在 Replit 上的初始化项目</a>来完成这些挑战。
 - 使用你选择的网站生成器来完成项目。 需要包含我们 GitHub 仓库的所有文件。
 
 完成本项目后，请将一个正常运行的 demo（项目演示）托管在可以公开访问的平台。 然后在 `Solution Link` 字段中提交它的 URL。
@@ -22,7 +22,7 @@ Helmet 通过设置各种 HTTP 头来保护你的 Express 应用程序。
 
 你在这些课程中写的所有代码都在 `myApp.js` 文件中，在初始代码之间。 不要改变或删除我们为你添加的代码。
 
-安装 Helmet 的 `3.21.3` 版本，然后引入它。 你可以用 `npm install --save-exact package@version` 来安装一个特定版本的软件包，或者直接将其添加到你的 `package.json` 中。
+Helmet `3.21.3` 版已经安装完毕，所以在 `myApp.js` 中请求它作为 `helmet`。
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md
index c6517b096e8..c961402af91 100644
--- a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md
+++ b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md
@@ -8,7 +8,7 @@ dashedName: mitigate-the-risk-of-clickjacking-with-helmet-frameguard
 
 # --description--
 
-请注意，本项目在 [这个 Repl.it 项目](https://replit.com/github/freeCodeCamp/boilerplate-infosec) 的基础上进行开发。 你也可以从 [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 你的网页可能在未经你同意的情况下被放在 `<frame>` 或 `<iframe>` 中。 这可能会导致点击劫持攻击等情况。 点击劫持是一种欺骗用户的技术，使其与用户认为不同的页面进行互动。 这可以通过使用 iframe 的方式，在一个恶意的环境中执行你的页面而获得。 在这种情况下，黑客可以在你的页面上设置一个隐藏层。 隐藏的按钮可以被用来运行坏的脚本。 该中间件设置 X-Frame-Options 头。 它限制了谁可以把你的网站放在一个框架里。 它有三种模式：DENY、SAMEORIGIN 和 ALLOW-FROM。
 
diff --git a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md
index 9451427faa9..4d800b316fd 100644
--- a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md
+++ b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md
@@ -9,7 +9,7 @@ dashedName: mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet-xs
 
 # --description--
 
-请注意，本项目在 [这个 Repl.it 项目](https://replit.com/github/freeCodeCamp/boilerplate-infosec) 的基础上进行开发。你也可以从 [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 跨站脚本（XSS）是一种常见的攻击类型，恶意脚本被注入到易受攻击的页面，目的是窃取敏感数据，如会话 cookies 或密码。
 
diff --git a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md
index e8aba4ee39d..c27db326e73 100644
--- a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md
+++ b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md
@@ -8,7 +8,7 @@ dashedName: prevent-ie-from-opening-untrusted-html-with-helmet-ienoopen
 
 # --description--
 
-请注意，本项目在[这个 Repl.it 项目](https://replit.com/github/freeCodeCamp/boilerplate-infosec)的基础上进行开发。 你也可以从[GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/)上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 有些网站会下载不安全的 HTML 文件。 某些版本的 IE 默认情况下还会在你网站的作用域下打开这些 HTML 文件。 换句话说，这些不安全的 HTML 页面可以在你的网站做恶意行为。 我们可以通过中间件来设置 header 中的 X-Download-Options 字段，让它的值为 noopen。 这样就可以防止 IE 在不信任的网站下执行下载的文件。
 
diff --git a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md
index 36304d94e5b..b4fe072b3ec 100644
--- a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md
+++ b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md
@@ -8,7 +8,7 @@ dashedName: set-a-content-security-policy-with-helmet-contentsecuritypolicy
 
 # --description--
 
-请注意，本项目在 [这个 Repl.it 项目](https://replit.com/github/freeCodeCamp/boilerplate-infosec) 的基础上进行开发。你也可以从 [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) 上克隆。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 在这个挑战中，我们要重点讨论现代浏览器中一种能有效减轻安全风险和防御很多种类型常见攻击的安全防护。 通过设置和配置内容安全策略，你可以防止在页面中无意中注入任何内容。 这会让你的应用远离 XSS 漏洞、恶意追踪、恶意 frames 和很多其他攻击。 CSP 通过配置资源白名单来避免这些问题。 你可以给任何一种类型的页面资源（脚本、样式文件、字体、frames、媒体文件等）做这个配置。 它支持很多指令，所以网站管理员可以做细致的控制。 更多详情请参考 HTML 5 Rocks 和 KeyCDN。 不幸的是，一些旧的浏览器不支持 CSP。
 
diff --git a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md
index 202091284fd..320a666ff6d 100644
--- a/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md
+++ b/curriculum/challenges/chinese/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md
@@ -8,17 +8,17 @@ dashedName: understand-bcrypt-hashes
 
 # --description--
 
-在下面的挑战中，你将启动一个新的项目，这个项目与之前的项目不同。 你可以在 [Replit](https://replit.com/github/freeCodeCamp/boilerplate-bcrypt)上找到新的启动项目，或者从 [GitHub](https://github.com/freeCodeCamp/boilerplate-bcrypt/) 上克隆它。
+在下面的挑战中，你将启动一个新的项目，这个项目与之前的项目不同。 You can find the new starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-bcrypt" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or clone it from <a href="https://github.com/freeCodeCamp/boilerplate-bcrypt/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
-BCrypt 哈希值是非常安全的。 哈希值基本上是原始数据的指纹，总是唯一的。 这是通过将原始数据输入一个算法并返回一个固定长度的结果来实现的。 为了使这一过程更加复杂和安全，你还可以向你的哈希值 *加盐*。 对你的散列加盐处理包含了在散列过程之前向原始数据添加随机数据，这使得破解散列更加困难。
+BCrypt 哈希值是非常安全的。 哈希值基本上是原始数据的指纹，总是唯一的。 这是通过将原始数据输入一个算法并返回一个固定长度的结果来实现的。 为了使这一过程更加复杂和安全，你还可以向你的哈希值 *加盐*。 对你的哈希加盐处理包含了在哈希过程之前向原始数据添加随机数据，这使得破解哈希更加困难。
 
-BCrypt 哈希值总是看起来有像`$2a$13$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm` 的结构。 它遵循固定的结构，第一小节 `$2a` 说明了该哈希采用什么算法。 接下来的部分 `$13` 定义了 *成本*。 成本是指计算哈希值需要多少能量。 它在 2^cost 的对数尺度上，决定了数据要通过散列算法计算多少次。 例如，当 cost 为 10 时，你能够在普通计算机上每秒散列 10 个密码，然而当 cost 为 15 时，每次散列需要 3 秒...... 进一步说，当 cost 为 31 时，完成一次散列需要好几天。 通常 cost 为 12 的哈希运算就已经足够安全。 哈希结果的最后一部分 `$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm` 看起来像是由随机数字、点和字母组成的字符串，但实际上它有两部分内容。 前面 22 个字符是加入的盐，剩下的就是加密过的密码！
+BCrypt hashes will always look like `$2a$13$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm` which does have a structure. 第一小节 `$2a` 说明了该哈希采用什么算法。 接下来的部分 `$13` 定义了 *成本*。 成本是指计算哈希值需要多少能量。 它在 2^cost 的对数尺度上，决定了数据要通过哈希算法计算多少次。 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 take multiple days to complete a hash. 通常 cost 为 12 的哈希运算就已经足够安全。 哈希结果的最后一部分 `$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm` 看起来像是由随机数字、点和字母组成的字符串，但实际上它有两部分内容。 前面 22 个字符是加入的盐，剩下的就是加密过的密码！
 
 # --instructions--
 
-要开始使用 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` 文件中加入这些课程的所有代码，放在我们提供的代码之间。 不要改变或删除我们为你添加的代码。
+BCrypt has already been added as a dependency, so require it as `bcrypt` in your server.
 
 请在完成挑战后提交你的页面。
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md b/curriculum/challenges/chinese/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md
index 39010f06f0a..90e75400e9b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md
@@ -1,7 +1,7 @@
 ---
 id: a3f503de51cf954ede28891d
 title: 找到对称差异
-challengeType: 5
+challengeType: 1
 forumTopicId: 301611
 dashedName: find-the-symmetric-difference
 ---
@@ -54,7 +54,7 @@ assert.sameMembers(sym([1, 2, 3], [5, 2, 1, 4, 5]), [3, 4, 5]);
 assert.equal(sym([1, 2, 3], [5, 2, 1, 4, 5]).length, 3);
 ```
 
-`sym([1, 2, 5], [2, 3, 5], [3, 4, 5])` 应该返回 `[1, 4, 5]` 。
+`sym([1, 2, 5], [2, 3, 5], [3, 4, 5])` should return `[1, 4, 5]`.
 
 ```js
 assert.sameMembers(sym([1, 2, 5], [2, 3, 5], [3, 4, 5]), [1, 4, 5]);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md
index ea463b440bf..0e091fd1d42 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md
@@ -22,7 +22,7 @@ dashedName: add-a-new-element-to-a-binary-search-tree
 
 # --instructions--
 
-我们将从简单的内容开始。 我们在这里定义了一个二叉搜索树结构的骨架，此外还有一个为我们的树创建节点的函数。 注意观察每个节点可能有一个左值和右值。 如果子树存在，它们将被分配给对应的子树。 在我们的二叉搜索树中，你将创建一个方法来向我们的二叉搜索树添加新的值。 该方法应该被称为`add` ，它应该接受一个整数值来添加到树中。 注意保持二叉搜索树的不变量：每个左子项中的值应小于或等于父值，并且每个右子项中的值应大于或等于父值。 在这里，让我们确保我们的树不会含有重复的值。 如果我们尝试添加已存在的值，则该方法应返回`null` 。 否则，如果添加成功，则应返回`undefined` 。
+我们将从简单的内容开始。 我们在这里定义了一个二叉搜索树结构的骨架，此外还有一个为我们的树创建节点的函数。 注意观察每个节点可能有一个左值和右值。 如果子树存在，它们将被分配给对应的子树。 In our binary search tree, you will create a method to add new values to the tree. 该方法应该被称为`add` ，它应该接受一个整数值来添加到树中。 注意保持二叉搜索树的不变量：每个左子项中的值应小于或等于父值，并且每个右子项中的值应大于或等于父值。 在这里，让我们确保我们的树不会含有重复的值。 如果我们尝试添加已存在的值，则该方法应返回`null` 。 否则，如果添加成功，则应返回`undefined` 。
 
 **提示：** 树是自然的递归数据结构！
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.md
index 3ca9c8c0f4c..fcd2c01797f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.md
@@ -8,7 +8,7 @@ dashedName: add-elements-at-a-specific-index-in-a-linked-list
 
 # --description--
 
-Let's create a addAt(index,element) method that adds an element at a given index. Just like how we remove elements at a given index, we need to keep track of the currentIndex as we traverse the linked list. When the currentIndex matches the given index, we would need to reassign the previous node's next property to reference the new added node. And the new node should reference the next node in the currentIndex. Returning to the conga line example, a new person wants to join the line, but he wants to join in the middle. You are in the middle of the line, so you take your hands off of the person ahead of you. The new person walks over and puts his hands on the person you once had hands on, and you now have your hands on the new person.
+让我们创建一个 addAt(index,element) 方法，在给定的索引处添加一个元素。 就像我们如何删除给定索引处的元素一样，我们需要在遍历链表时跟踪 currentIndex。 当 currentIndex 与给定索引匹配时，我们需要重新分配上一个节点的下一个属性以引用新添加的节点。 并且新节点应该引用 currentIndex 中的下一个节点。 Returning to the conga line example, a new person wants to join the line, but he wants to join in the middle. You are in the middle of the line, so you take your hands off of the person ahead of you. The new person walks over and puts his hands on the person you once had hands on, and you now have your hands on the new person.
 
 # --instructions--
 
@@ -24,8 +24,8 @@ assert(
     var test = new LinkedList();
     test.add('cat');
     test.add('dog');
-    test.addAt(0, 'cat');
-    return test.head().element === 'cat';
+    test.addAt(0, 'fish');
+    return test.head().element === 'fish' && test.head().next.element === 'cat';
   })()
 );
 ```
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/adjacency-list.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/adjacency-list.md
index 72868a02d7d..e9b7f17e96f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/adjacency-list.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/adjacency-list.md
@@ -58,7 +58,7 @@ There should be an edge between `Jill` and `Jenny`.
 ```js
 assert(
   undirectedAdjList.Jill.indexOf('Jenny') !== -1 &&
-    undirectedAdjList.Jill.indexOf('Jenny') !== -1
+    undirectedAdjList.Jenny.indexOf('Jill') !== -1
 );
 ```
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md
index 42081a1355d..db3165a4b73 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md
@@ -39,6 +39,24 @@ assert(
 );
 ```
 
+`isBinarySearchTree()` should return false when checked with a tree that is not a binary search tree.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    test.push(1);
+    test.root.left = new Node(1);
+    return isBinarySearchTree(test) == false;
+  })()
+);
+```
+
 # --seed--
 
 ## --after-user-code--
@@ -114,7 +132,7 @@ function isBinarySearchTree(tree) {
     function checkTree(node) {
       if (node.left != null) {
         const left = node.left;
-        if (left.value > node.value) {
+        if (left.value >= node.value) {
           isBST = false;
         } else {
           checkTree(left);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-circular-queue.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-circular-queue.md
index 16ff688fabf..02fb02bbc10 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-circular-queue.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-circular-queue.md
@@ -46,7 +46,7 @@ This approach requires a constant amount of memory but allows files of a much la
 
 # --instructions--
 
-In this challenge we will implement a circular queue. The circular queue should provide `enqueue` and `dequeue` methods which allow you to read from and write to the queue. The class itself should also accept an integer argument which you can use to specify the size of the queue when created. We've written the starting version of this class for you in the code editor.
+In this challenge we will implement a circular queue. The circular queue should provide `enqueue` and `dequeue` methods which allow you to read from and write to the queue. The class itself should also accept an integer argument which you can use to specify the size of the queue when created. 我们已经在代码编辑器中为您编写了此类的起始版本。
 
 When you enqueue items to the queue, the write pointer should advance forward and loop back to the beginning once it reaches the end of the queue. The `enqueue` method should return the item you enqueued if it is successful; otherwise it will return `null`.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md
index 16c2e122fa7..b9f3f12d767 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md
@@ -20,7 +20,7 @@ Be careful to handle any possible edge cases when writing these methods, such as
 
 # --hints--
 
-The DoublyLinkedList data structure should exist.
+The `DoublyLinkedList` data structure should exist.
 
 ```js
 assert(
@@ -34,7 +34,7 @@ assert(
 );
 ```
 
-The DoublyLinkedList should have a method called add.
+The `DoublyLinkedList` should have a method called `add`.
 
 ```js
 assert(
@@ -51,7 +51,7 @@ assert(
 );
 ```
 
-The DoublyLinkedList should have a method called remove.
+The `DoublyLinkedList` should have a method called `remove`.
 
 ```js
 assert(
@@ -68,7 +68,7 @@ assert(
 );
 ```
 
-Removing an item from an empty list should return null.
+Removing an item from an empty list should return `null`.
 
 ```js
 assert(
@@ -82,7 +82,7 @@ assert(
 );
 ```
 
-The add method should add items to the list.
+The `add` method should add items to the list.
 
 ```js
 assert(
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-hash-table.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-hash-table.md
index a33c3d51787..035733ac109 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-hash-table.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-hash-table.md
@@ -24,7 +24,7 @@ Be sure to write your code to account for collisions!
 
 # --hints--
 
-The HashTable data structure should exist.
+The `HashTable` data structure should exist.
 
 ```js
 assert(
@@ -38,7 +38,7 @@ assert(
 );
 ```
 
-The HashTable should have an add method.
+The `HashTable` should have an `add` method.
 
 ```js
 assert(
@@ -52,7 +52,7 @@ assert(
 );
 ```
 
-The HashTable should have a lookup method.
+The `HashTable` should have a `lookup` method.
 
 ```js
 assert(
@@ -66,7 +66,7 @@ assert(
 );
 ```
 
-The HashTable should have a remove method.
+The `HashTable` should have a `remove` method.
 
 ```js
 assert(
@@ -80,7 +80,7 @@ assert(
 );
 ```
 
-The add method should add key value pairs and the lookup method should return the values associated with a given key.
+The `add` method should add key value pairs and the `lookup` method should return the values associated with a given key.
 
 ```js
 assert(
@@ -95,7 +95,7 @@ assert(
 );
 ```
 
-The remove method should accept a key as input and should remove the associated key value pair.
+The `remove` method should accept a key as input and should remove the associated key value pair.
 
 ```js
 assert(
@@ -113,7 +113,7 @@ assert(
 );
 ```
 
-The remove method should only remove the correct key value pair.
+The `remove` method should only remove the correct key value pair.
 
 ```js
 assert(
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-linked-list-class.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-linked-list-class.md
index 0c768cf0a28..d52a34cab7d 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-linked-list-class.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-linked-list-class.md
@@ -57,7 +57,8 @@ assert(
     var test = new LinkedList();
     test.add('cat');
     test.add('dog');
-    return test.head().next.element === 'dog';
+    test.add('fish');
+    return test.head().next.element === 'dog' && test.head().next.next.element === 'fish';
   })()
 );
 ```
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-map-data-structure.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-map-data-structure.md
index 0c32270e722..96a48181774 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-map-data-structure.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-map-data-structure.md
@@ -1,6 +1,6 @@
 ---
 id: 8d5823c8c441eddfaeb5bdef
-title: Create a Map Data Structure
+title: 创建映射数据结构
 challengeType: 1
 forumTopicId: 301629
 dashedName: create-a-map-data-structure
@@ -26,7 +26,7 @@ Let's get some practice creating our own map. Because JavaScript objects provide
 
 # --hints--
 
-The Map data structure should exist.
+The `Map` data structure should exist.
 
 ```js
 assert(
@@ -40,7 +40,7 @@ assert(
 );
 ```
 
-The Map object should have the following methods: add, remove, get, has, values, clear, and size.
+The `Map` object should have the following methods: `add`, `remove`, `get`, `has`, `values`, `clear`, and `size`.
 
 ```js
 assert(
@@ -62,7 +62,7 @@ assert(
 );
 ```
 
-The add method should add items to the map.
+The `add` method should add items to the map.
 
 ```js
 assert(
@@ -79,7 +79,7 @@ assert(
 );
 ```
 
-The has method should return true for added items and false for absent items.
+The `has` method should return `true` for added items and `false` for absent items.
 
 ```js
 assert(
@@ -94,7 +94,7 @@ assert(
 );
 ```
 
-The get method should accept keys as input and should return the associated values.
+The `get` method should accept keys as input and should return the associated values.
 
 ```js
 assert(
@@ -109,7 +109,7 @@ assert(
 );
 ```
 
-The values method should return all the values stored in the map as strings in an array.
+The `values` method should return all the values stored in the map as strings in an array.
 
 ```js
 assert(
@@ -131,7 +131,7 @@ assert(
 );
 ```
 
-The clear method should empty the map and the size method should return the number of items present in the map.
+The `clear` method should empty the map and the `size` method should return the number of items present in the map.
 
 ```js
 assert(
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md
index fb838c883e0..b1495efd441 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md
@@ -12,11 +12,11 @@ Here we will move on from binary search trees and take a look at another type of
 
 # --instructions--
 
-Let's create a trie to store words. It will accept words through an `add` method and store these in a trie data structure. It will also allow us to query if a given string is a word with an `isWord` method, and retrieve all the words entered into the trie with a `print` method. `isWord` should return a boolean value and print should return an array of all these words as string values. In order for us to verify that this data structure is implemented correctly, we've provided a `Node` structure for each node in the tree. Each node will be an object with a `keys` property which is a JavaScript Map object. This will hold the individual letters that are valid keys of each node. We've also created an `end` property on the nodes that can be set to `true` if the node represents the termination of a word.
+Let's create a trie to store words. It will accept words through an `add` method and store these in a trie data structure. It will also allow us to query if a given string is a word with an `isWord` method, and retrieve all the words entered into the trie with a `print` method. `isWord` should return a boolean value and `print` should return an array of all these words as string values. In order for us to verify that this data structure is implemented correctly, we've provided a `Node` structure for each node in the tree. Each node will be an object with a `keys` property which is a JavaScript Map object. This will hold the individual letters that are valid keys of each node. We've also created an `end` property on the nodes that can be set to `true` if the node represents the termination of a word.
 
 # --hints--
 
-The Trie should have an add method.
+The `Trie` should have an `add` method.
 
 ```js
 assert(
@@ -32,7 +32,7 @@ assert(
 );
 ```
 
-The Trie should have a print method.
+The `Trie` should have a `print` method.
 
 ```js
 assert(
@@ -48,7 +48,7 @@ assert(
 );
 ```
 
-The Trie should have an isWord method.
+The `Trie` should have an `isWord` method.
 
 ```js
 assert(
@@ -64,7 +64,7 @@ assert(
 );
 ```
 
-The print method should return all items added to the trie as strings in an array.
+The `print` method should return all items added to the trie as strings in an array.
 
 ```js
 assert(
@@ -93,7 +93,7 @@ assert(
 );
 ```
 
-The isWord method should return true only for words added to the trie and false for all other words.
+The `isWord` method should return `true` only for words added to the trie and `false` for all other words.
 
 ```js
 assert(
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md
index 7e6822ef676..02bcedd36db 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md
@@ -8,7 +8,15 @@ dashedName: create-an-es6-javascript-map
 
 # --description--
 
-The new version of JavaScript provides us with a built-in Map object which provides much of the functionality we wrote by hand in the last challenge. This Map object, although similar to regular JavaScript objects, provides some useful functionality that normal objects lack. For example, an ES6 Map tracks the insertion order of items that are added to it. Here is a more complete overview of its methods: `.has(key)` returns true or false based on the presence of a key `.get(key)` returns the value associated with a key `.set(key, value)` sets a new key, value pair `.delete(key)` removes a key, value pair `.clear()` removes all key, value pairs `.entries()` returns an array of all the keys in insertion order `.values()` returns an array of all the values in insertion order
+The new version of JavaScript provides us with a built-in Map object which provides much of the functionality we wrote by hand in the last challenge. This Map object, although similar to regular JavaScript objects, provides some useful functionality that normal objects lack. For example, an ES6 Map tracks the insertion order of items that are added to it. Here is a more complete overview of its methods:
+
+- `.has(key)` returns true or false based on the presence of a key
+- `.get(key)` returns the value associated with a key
+- `.set(key, value)` sets a new key, value pair
+- `.delete(key)` removes a key, value pair
+- `.clear()` removes all key, value pairs
+- `.entries()` returns an array of all the keys in insertion order
+- `.values()` returns an array of all the values in insertion order
 
 # --instructions--
 
@@ -16,13 +24,13 @@ Define a JavaScript Map object and assign to it a variable called myMap. Add the
 
 # --hints--
 
-The myMap object should exist.
+The `myMap` object should exist.
 
 ```js
 assert(typeof myMap === 'object');
 ```
 
-myMap should contain the key value pair `freeCodeCamp`, `Awesome!`.
+`myMap` should contain the key value pair `freeCodeCamp`, `Awesome!`.
 
 ```js
 assert(myMap.get('freeCodeCamp') === 'Awesome!');
@@ -39,5 +47,7 @@ assert(myMap.get('freeCodeCamp') === 'Awesome!');
 # --solutions--
 
 ```js
-// solution required
+const myMap = new Map();
+
+myMap.set("freeCodeCamp", "Awesome!");
 ```
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree.md
index 43d58845d26..a359575e5f7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree.md
@@ -46,6 +46,25 @@ assert(
 );
 ```
 
+Trying to remove an element from an empty tree should return `null`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    if (typeof test.remove !== 'function') {
+      return false;
+    }
+    return test.remove(100) == null;
+  })()
+);
+```
+
 Trying to remove an element that does not exist should return `null`.
 
 ```js
@@ -60,6 +79,8 @@ assert(
     if (typeof test.remove !== 'function') {
       return false;
     }
+    test.add(15);
+    test.add(30);
     return test.remove(100) == null;
   })()
 );
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.md
index db24b0b29ee..808d2f722ba 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.md
@@ -128,14 +128,15 @@ assert(
     if (typeof test.remove !== 'function') {
       return false;
     }
-    test.add(-1);
+    test.add(1);
+    test.add(4);
     test.add(3);
-    test.add(7);
-    test.add(16);
-    test.remove(16);
-    test.remove(7);
+    test.add(2);
+    test.add(6);
+    test.add(8);
+    test.remove(6);
     test.remove(3);
-    return test.inorder().join('') == '-1';
+    return test.inorder().join('') == '1248';
   })()
 );
 ```
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/depth-first-search.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/depth-first-search.md
index 8fedd91cc51..d03cf5a4b33 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/depth-first-search.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/depth-first-search.md
@@ -49,6 +49,23 @@ assert.sameMembers(
 );
 ```
 
+The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]` with a start node of `3` should return an array with `3`, `2`, `1`, and `0`.
+
+```js
+assert.sameMembers(
+  (function () {
+    var graph = [
+      [0, 1, 0, 0],
+      [1, 0, 1, 0],
+      [0, 1, 0, 1],
+      [0, 0, 1, 0]
+    ];
+    return dfs(graph, 3);
+  })(),
+  [3, 2, 1, 0]
+);
+```
+
 The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]` with a start node of `1` should return an array with four elements.
 
 ```js
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md
index 158817a64db..efc98e7be70 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md
@@ -18,7 +18,7 @@ Let's implement heap sort with a min heap. Feel free to adapt your max heap code
 
 # --hints--
 
-The MinHeap data structure should exist.
+The `MinHeap` data structure should exist.
 
 ```js
 assert(
@@ -32,7 +32,7 @@ assert(
 );
 ```
 
-MinHeap should have a method called insert.
+`MinHeap` should have a method called `insert`.
 
 ```js
 assert(
@@ -48,7 +48,7 @@ assert(
 );
 ```
 
-MinHeap should have a method called remove.
+`MinHeap` should have a method called `remove`.
 
 ```js
 assert(
@@ -64,7 +64,7 @@ assert(
 );
 ```
 
-MinHeap should have a method called sort.
+`MinHeap` should have a method called `sort`.
 
 ```js
 assert(
@@ -80,7 +80,7 @@ assert(
 );
 ```
 
-The sort method should return an array containing all items added to the min heap in sorted order.
+The `sort` method should return an array containing all items added to the min heap in sorted order.
 
 ```js
 assert(
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/incidence-matrix.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/incidence-matrix.md
index 068b629cdd8..5b5e174b7b0 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/incidence-matrix.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/incidence-matrix.md
@@ -18,7 +18,7 @@ Each column will represent a unique edge. Also, each edge connects two nodes. To
 
 <blockquote>    1<br>   ---<br>1 | 1<br>2 | 0<br>3 | 1</blockquote>
 
-Here is an example of an `incidence matrix` with 4 edges and 4 nodes. Remember, the columns are the edges and rows are the nodes themselves.
+Here is an example of an incidence matrix with 4 edges and 4 nodes. Remember, the columns are the edges and rows are the nodes themselves.
 
 <blockquote>    1 2 3 4<br>   --------<br>1 | 0 1 1 1<br>2 | 1 1 0 0<br>3 | 1 0 0 1<br>4 | 0 0 1 0</blockquote>
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
index e20657a87c8..3528a99be9a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
@@ -48,7 +48,7 @@ Finally, add a `print` method which returns an array of all the items that have
 
 # --hints--
 
-The MaxHeap data structure should exist.
+The `MaxHeap` data structure should exist.
 
 ```js
 assert(
@@ -62,7 +62,7 @@ assert(
 );
 ```
 
-MaxHeap should have a method called insert.
+`MaxHeap` should have a method called `insert`.
 
 ```js
 assert(
@@ -78,7 +78,7 @@ assert(
 );
 ```
 
-MaxHeap should have a method called print.
+`MaxHeap` should have a method called `print`.
 
 ```js
 assert(
@@ -94,7 +94,7 @@ assert(
 );
 ```
 
-The insert method should add elements according to the max heap property.
+The `insert` method should add elements according to the max heap property.
 
 ```js
 assert(
@@ -110,8 +110,12 @@ assert(
     test.insert(700);
     test.insert(32);
     test.insert(51);
-    let result = test.print();
-    return result.length == 5 ? result[0] == 700 : result[1] == 700;
+    test.insert(800);
+    const result = test.print();
+    const solution = JSON.stringify([null,800,51,700,32,50,100]);
+    const solutionWithoutNull = JSON.stringify([800,51,700,32,50,100]);
+
+    return (result.length == 6) ? (JSON.stringify(result) == solutionWithoutNull) : (JSON.stringify(result) == solution);
   })()
 );
 ```
@@ -133,20 +137,28 @@ var MaxHeap = function() {
 ```js
 var MaxHeap = function() {
     // Only change code below this line
-    this.heap = [null];
-    this.insert = (ele) => {
-        var index = this.heap.length;
-        var arr = [...this.heap];
-        arr.push(ele);
-        while (ele > arr[Math.floor(index / 2)] && index > 1) {
-            arr[index] = arr[Math.floor(index / 2)];
-            arr[Math.floor(index / 2)] = ele;
-            index = arr[Math.floor(index / 2)];
-        }
-        this.heap = arr;
+    this.heap = [];
+    this.parent = index => {
+      return Math.floor((index - 1) / 2);
+    }
+    this.insert = element => {
+      this.heap.push(element);
+      this.heapifyUp(this.heap.length - 1);
+    }
+    this.heapifyUp = index => {
+      let currentIndex = index,
+      parentIndex = this.parent(currentIndex);
+      while (currentIndex > 0 && this.heap[currentIndex] > this.heap[parentIndex]) {
+        this.swap(currentIndex, parentIndex);
+        currentIndex = parentIndex;
+        parentIndex = this.parent(parentIndex);
+      }
+    }
+    this.swap = (index1, index2) => {
+      [this.heap[index1], this.heap[index2]] = [this.heap[index2], this.heap[index1]];
     }
     this.print = () => {
-        return this.heap.slice(1);
+      return this.heap;
     }
     // Only change code above this line
 };
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md
index ea0caa1b3ed..0d97ef59352 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md
@@ -1,6 +1,6 @@
 ---
 id: 587d8254367417b2b2512c6f
-title: Perform a Subset Check on Two Sets of Data
+title: 对两组数据执行子集检查
 challengeType: 1
 forumTopicId: 301707
 dashedName: perform-a-subset-check-on-two-sets-of-data
@@ -8,13 +8,13 @@ dashedName: perform-a-subset-check-on-two-sets-of-data
 
 # --description--
 
-In this exercise, we are going to perform a subset test on 2 sets of data. We will create a method on our `Set` data structure called `isSubsetOf`. This will compare the first set against the second, and if the first set is fully contained within the second, it will return `true`.
+在本练习中，我们将对 2 组数据执行子集测试。 我们将在我们的 `Set` 数据结构上创建一个名为 `isSubsetOf` 的方法。 这将比较第一组与第二组，如果第一组完全包含在第二组中，则它将返回 `true`。
 
-For example, if `setA = ['a','b']` and `setB = ['a','b','c','d']`, then `setA` is a subset of `setB`, so `setA.isSubsetOf(setB)` should return `true`.
+例如，如果 `setA = ['a','b']` 和 `setB = ['a','b','c','d']`，那么 `setA` 是 `setB` 的子集，所以 `setA.isSubsetOf(setB)` 应该返回 `true`。
 
 # --hints--
 
-Your `Set` class should have a `isSubsetOf` method.
+你的 `Set` 类应该有一个 `isSubsetOf` 方法。
 
 ```js
 assert(
@@ -25,7 +25,7 @@ assert(
 );
 ```
 
-The first Set() should be contained in the second Set
+The first `Set` should be contained in the second `Set`.
 
 ```js
 assert(
@@ -43,7 +43,7 @@ assert(
 );
 ```
 
-`['a', 'b'].isSubsetOf(['a', 'b', 'c', 'd'])` should return `true`
+`['a', 'b'].isSubsetOf(['a', 'b', 'c', 'd'])` should return `true`.
 
 ```js
 assert(
@@ -62,7 +62,7 @@ assert(
 );
 ```
 
-`['a', 'b', 'c'].isSubsetOf(['a', 'b'])` should return `false`
+`['a', 'b', 'c'].isSubsetOf(['a', 'b'])` should return `false`.
 
 ```js
 assert(
@@ -80,7 +80,7 @@ assert(
 );
 ```
 
-`[].isSubsetOf([])` should return `true`
+`[].isSubsetOf([])` should return `true`.
 
 ```js
 assert(
@@ -93,7 +93,7 @@ assert(
 );
 ```
 
-`['a', 'b'].isSubsetOf(['c', 'd'])` should return `false`
+`['a', 'b'].isSubsetOf(['c', 'd'])` should return `false`.
 
 ```js
 assert(
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md
index 04ecfb767f8..3c5455892a6 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md
@@ -25,7 +25,7 @@ assert(
 );
 ```
 
-The union of a Set containing values ["a", "b", "c"] and a Set containing values ["c", "d"] should return a new Set containing values ["a", "b", "c", "d"].
+The union of a `Set` containing values `["a", "b", "c"]` and a `Set` containing values `["c", "d"]` should return a new `Set` containing values `["a", "b", "c", "d"]`.
 
 ```js
 assert(
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
index 858073f2112..ecd6876805a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
@@ -22,7 +22,7 @@ Instructions: Add a method to our max heap called `remove`. This method should r
 
 # --hints--
 
-The MaxHeap data structure should exist.
+The `MaxHeap` data structure should exist.
 
 ```js
 assert(
@@ -36,7 +36,7 @@ assert(
 );
 ```
 
-MaxHeap should have a method called print.
+`MaxHeap` should have a method called `print`.
 
 ```js
 assert(
@@ -52,7 +52,7 @@ assert(
 );
 ```
 
-MaxHeap should have a method called insert.
+`MaxHeap` should have a method called `insert`.
 
 ```js
 assert(
@@ -68,7 +68,7 @@ assert(
 );
 ```
 
-MaxHeap should have a method called remove.
+`MaxHeap` should have a method called `remove`.
 
 ```js
 assert(
@@ -84,7 +84,7 @@ assert(
 );
 ```
 
-The remove method should remove the greatest element from the max heap while maintaining the max heap property.
+The `remove` method should remove the greatest element from the max heap while maintaining the max heap property.
 
 ```js
 assert(
@@ -114,21 +114,29 @@ assert(
 ## --seed-contents--
 
 ```js
-var MaxHeap = function() {
-  this.heap = [null];
-  this.insert = (ele) => {
-    var index = this.heap.length;
-    var arr = [...this.heap];
-    arr.push(ele);
-    while (ele > arr[Math.floor(index / 2)] && index > 1) {
-      arr[index] = arr[Math.floor(index / 2)];
-      arr[Math.floor(index / 2)] = ele;
-      index = arr[Math.floor(index / 2)];
+var MaxHeap = function () {
+  this.heap = [];
+  this.parent = index => {
+    return Math.floor((index - 1) / 2);
+  }
+  this.insert = element => {
+    this.heap.push(element);
+    this.heapifyUp(this.heap.length - 1);
+  }
+  this.heapifyUp = index => {
+    let currentIndex = index,
+    parentIndex = this.parent(currentIndex);
+    while (currentIndex > 0 && this.heap[currentIndex] > this.heap[parentIndex]) {
+      this.swap(currentIndex, parentIndex);
+      currentIndex = parentIndex;
+      parentIndex = this.parent(parentIndex);
     }
-    this.heap = arr;
+  }
+  this.swap = (index1, index2) => {
+    [this.heap[index1], this.heap[index2]] = [this.heap[index2], this.heap[index1]];
   }
   this.print = () => {
-    return this.heap.slice(1);
+    return this.heap;
   }
   // Only change code below this line
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.md
index 9a8e59f77fc..56392c469ad 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.md
@@ -14,7 +14,7 @@ Let's write a `removeAt` method that removes the `element` at a given `index`. T
 
 A common technique used to iterate through the elements of a linked list involves a <dfn>'runner'</dfn>, or sentinel, that 'points' at the nodes that your code is comparing. In our case, starting at the `head` of our list, we start with a `currentIndex` variable that starts at `0`. The `currentIndex` should increment by one for each node we pass.
 
-Just like our `remove(element)` method, which [we covered in a previous lesson](/learn/coding-interview-prep/data-structures/remove-elements-from-a-linked-list), we need to be careful not to orphan the rest of our list when we remove the node in our `removeAt(index)` method. We keep our nodes contiguous by making sure that the node that has reference to the removed node has a reference to the next node.
+Just like our `remove(element)` method, which <a href="/learn/coding-interview-prep/data-structures/remove-elements-from-a-linked-list" target="_blank" rel="noopener noreferrer nofollow">we covered in a previous lesson</a>, we need to be careful not to orphan the rest of our list when we remove the node in our `removeAt(index)` method. We keep our nodes contiguous by making sure that the node that has reference to the removed node has a reference to the next node.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
index 58edfaa2a50..c26c4677db7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
@@ -12,7 +12,7 @@ Let's create one more method for our doubly linked list called reverse which rev
 
 # --hints--
 
-The DoublyLinkedList data structure should exist.
+The `DoublyLinkedList` data structure should exist.
 
 ```js
 assert(
@@ -26,7 +26,7 @@ assert(
 );
 ```
 
-The DoublyLinkedList should have a method called reverse.
+The `DoublyLinkedList` should have a method called `reverse`.
 
 ```js
 assert(
@@ -43,7 +43,7 @@ assert(
 );
 ```
 
-Reversing an empty list should return null.
+Reversing an empty list should return `null`.
 
 ```js
 assert(
@@ -57,7 +57,7 @@ assert(
 );
 ```
 
-The reverse method should reverse the list.
+The `reverse` method should reverse the list.
 
 ```js
 assert(
@@ -77,7 +77,7 @@ assert(
 );
 ```
 
-The next and previous references should be correctly maintained when a list is reversed.
+The `next` and `previous` references should be correctly maintained when a list is reversed.
 
 ```js
 assert(
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/search-within-a-linked-list.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/search-within-a-linked-list.md
index 03361689fef..aa2c05c8810 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/search-within-a-linked-list.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/search-within-a-linked-list.md
@@ -16,7 +16,7 @@ Let's also implement a method that does the opposite: an `elementAt` method that
 
 # --instructions--
 
-Write an `isEmpty` method that checks if the linked list is empty, an `indexOf` method that returns the `index` of a given element, and an `elementAt` that returns an `element` at a given `index.`
+Write an `isEmpty` method that checks if the linked list is empty, an `indexOf` method that returns the `index` of a given element, and an `elementAt` that returns an `element` at a given `index`.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md
index b02f10043d3..d8a38d9bb71 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md
@@ -8,13 +8,13 @@ dashedName: use-breadth-first-search-in-a-binary-search-tree
 
 # --description--
 
-Here we will introduce another tree traversal method: breadth-first search. In contrast to the depth-first search methods from the last challenge, breadth-first search explores all the nodes in a given level within a tree before continuing on to the next level. Typically, queues are utilized as helper data structures in the design of breadth-first search algorithms.
+这里我们将介绍另一种树遍历方法：广度优先搜索。 与上一次挑战中的深度优先搜索方法相比，广度优先搜索在继续进入下一级别之前探索树中给定级别中的所有节点。 通常，队列在广度优先搜索算法的设计中用作辅助数据结构。
 
-In this method, we start by adding the root node to a queue. Then we begin a loop where we dequeue the first item in the queue, add it to a new array, and then inspect both its child subtrees. If its children are not null, they are each enqueued. This process continues until the queue is empty.
+在此方法中，我们首先将根节点添加到队列中。 然后我们开始一个循环，我们将队列中的第一个项目出列，将其添加到一个新数组，然后检查它们的子子树。 If its children are not null, they are each enqueued. 此过程将继续，直到队列为空。
 
 # --instructions--
 
-Let's create a breadth-first search method in our tree called `levelOrder`. This method should return an array containing the values of all the tree nodes, explored in a breadth-first manner. Be sure to return the values in the array, not the nodes themselves. A level should be traversed from left to right. Next, let's write a similar method called `reverseLevelOrder` which performs the same search but in the reverse direction (right to left) at each level.
+Let's create a breadth-first search method in our tree called `levelOrder`. 此方法应返回一个包含所有树节点值的数组，并以广度优先的方式进行探索。 确保返回数组中的值，而不是节点本身。 应从左到右遍历一个级别。 接下来，让我们编写一个名为`reverseLevelOrder`的类似方法，它在每个级别执行相同的搜索，但是反向（从右到左）。
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5.md
index ff256d48a47..ad3c0179ac5 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5.md
@@ -1,44 +1,44 @@
 ---
 id: 5900f36e1000cf542c50fe80
-title: 'Problem 1: Multiples of 3 and 5'
-challengeType: 5
+title: '问题 1：3 或 5 的倍数'
+challengeType: 1
 forumTopicId: 301722
 dashedName: problem-1-multiples-of-3-and-5
 ---
 
 # --description--
 
-If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
+If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. 这些倍数的总和是 23。
 
-Find the sum of all the multiples of 3 or 5 below the provided parameter value `number`.
+在提供的参数值 `number` 下找到所有 3 或 5 的倍数之和。
 
 # --hints--
 
-`multiplesOf3and5(10)` should return a number.
+`multiplesOf3and5(10)` 应该返回一个数字。
 
 ```js
 assert(typeof multiplesOf3and5(10) === 'number');
 ```
 
-`multiplesOf3and5(49)` should return 543.
+`multiplesOf3and5(49)` 应该返回 543。
 
 ```js
 assert.strictEqual(multiplesOf3and5(49), 543);
 ```
 
-`multiplesOf3and5(1000)` should return 233168.
+`multiplesOf3and5(1000)` 应该返回 233168。
 
 ```js
 assert.strictEqual(multiplesOf3and5(1000), 233168);
 ```
 
-`multiplesOf3and5(8456)` should return 16687353.
+`multiplesOf3and5(8456)` 应该返回 16687353。
 
 ```js
 assert.strictEqual(multiplesOf3and5(8456), 16687353);
 ```
 
-`multiplesOf3and5(19564)` should return 89301183.
+`multiplesOf3and5(19564)` 应该返回 89301183。
 
 ```js
 assert.strictEqual(multiplesOf3and5(19564), 89301183);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
index d1194e13f33..39ab831dad7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3761000cf542c50fe89
 title: 'Problem 10: Summation of primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301723
 dashedName: problem-10-summation-of-primes
 ---
@@ -60,21 +60,46 @@ primeSummation(2000000);
 # --solutions--
 
 ```js
-function primeSummation(n) {
-  if (n < 3) { return 0 };
-  let nums = [0, 0, 2];
-  for (let i = 3; i < n; i += 2){
-    nums.push(i);
-    nums.push(0);
-  }
-  let sum = 2;
-  for (let i = 3; i < n; i += 2){
-    if (nums[i] !== 0){
-      sum += nums[i];
-      for (let j = i*i; j < n; j += i){
-        nums[j] = 0;
+class PrimeSeive {
+  constructor(num) {
+    const seive = Array(Math.floor((num - 1) / 2)).fill(true);
+    const upper = Math.floor((num - 1) / 2);
+    const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+
+    for (let i = 0; i <= sqrtUpper; i++) {
+      if (seive[i]) {
+        // Mark value in seive array
+        const prime = 2 * i + 3;
+        // Mark all multiples of this number as false (not prime)
+        const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+        for (let j = primeSqaredIndex; j < upper; j += prime) {
+          seive[j] = false;
+        }
       }
     }
+
+    this._seive = seive;
+  }
+
+  isPrime(num) {
+    return num === 2
+      ? true
+      : num % 2 === 0
+        ? false
+        : this.isOddPrime(num);
+  }
+
+  isOddPrime(num) {
+    return this._seive[(num - 3) / 2];
+  }
+};
+
+function primeSummation(num) {
+  const primeSeive = new PrimeSeive(num);
+
+  let sum = 2;
+  for (let i = 3; i < num; i += 2) {
+    if (primeSeive.isOddPrime(i)) sum += i;
   }
   return sum;
 }
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-100-arranged-probability.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-100-arranged-probability.md
index 1d44675e282..4507fa49c56 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-100-arranged-probability.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-100-arranged-probability.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d01000cf542c50fee3
 title: 'Problem 100: Arranged probability'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301724
 dashedName: problem-100-arranged-probability
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md
index cd51f0f2ecc..803f95dc33e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d21000cf542c50fee4
 title: 'Problem 101: Optimum polynomial'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301725
 dashedName: problem-101-optimum-polynomial
 ---
@@ -20,7 +20,9 @@ As a basis, if we were only given the first term of sequence, it would be most s
 
 Hence we obtain the following OPs for the cubic sequence:
 
-$$\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}$$
+$$\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 $\color{red}{red}$ above), we obtain 1 + 15 + 58 = 74. Consider the following tenth degree polynomial generating function:
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-102-triangle-containment.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-102-triangle-containment.md
index 9705afbc6f3..c90a827dda3 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-102-triangle-containment.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-102-triangle-containment.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d21000cf542c50fee5
 title: 'Problem 102: Triangle containment'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301726
 dashedName: problem-102-triangle-containment
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md
index 677153bd674..4d02b937660 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md
@@ -1,25 +1,28 @@
 ---
 id: 5900f3d61000cf542c50fee7
-title: 'Problem 103: Special subset sums: optimum'
-challengeType: 5
+title: '问题 103：特殊子集和：最优'
+challengeType: 1
 forumTopicId: 301727
 dashedName: problem-103-special-subset-sums-optimum
 ---
 
 # --description--
 
-Let $S(A)$ represent the sum of elements in set A of size n. We shall call it a special sum set if for any two non-empty disjoint subsets, B and C, the following properties are true:
+设 $S(A)$ 是大小为 n 的集合 A 中所有元素之和。 若任取集合 A 中任意两个非空且没有交集的集合 B 和 C，满足下列两个条件，那么我们就称集合 A 为特殊的和集：
 
-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)$.
+1. $S(B) ≠ S(C)$; 即任意子集所有元素的和均不相同。
+2. 如果集合 B 中的元素个数多于集合 C，那么 $S(B) > S(C)$。
 
-If $S(A)$ is minimised for a given n, we shall call it an optimum special sum set. The first five optimum special sum sets are given below.
+对于给定的数字 n，我们称使得 $S(A)$ 最小的集合 A 为最优特殊和集。 下面给出前五个最优特殊和集。
 
-$$\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}$$
+$$\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}$$
 
-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.
+由上述规律可以猜测，似乎对于一个给定的最优特殊和集 $A = \\{a_1, a_2, \ldots, a_n\\}$，下一个最优特殊和集将会是 $B = \\{b, a_1 + b, a_2 + b, \ldots, a_n + b\\}$，其中 b 是集合 A 的“中间”元素。
 
-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`.
+通过上述“规则”，我们猜测当 $n = 6$ 时，最优特殊和集应为 $A = \\{11, 17, 20, 22, 23, 24\\}$，且 $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.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.md
index 1c61ea7c2ed..baa7dcbfdbd 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d51000cf542c50fee6
 title: 'Problem 104: Pandigital Fibonacci ends'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301728
 dashedName: problem-104-pandigital-fibonacci-ends
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.md
index 0a5d611f908..d1507984f27 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d61000cf542c50fee8
-title: 'Problem 105: Special subset sums: testing'
-challengeType: 5
+title: '问题 105：特殊子集和：测试'
+challengeType: 1
 forumTopicId: 301729
 dashedName: problem-105-special-subset-sums-testing
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.md
index e771a72835d..3412e832ccc 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d71000cf542c50fee9
-title: 'Problem 106: Special subset sums: meta-testing'
-challengeType: 5
+title: '问题 106：特殊子集和：元测试'
+challengeType: 1
 forumTopicId: 301730
 dashedName: problem-106-special-subset-sums-meta-testing
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-107-minimal-network.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
index 312e9f33122..33dd08d3c83 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d91000cf542c50feea
-title: 'Problem 107: Minimal network'
-challengeType: 5
+title: '问题 107：最小网络'
+challengeType: 1
 forumTopicId: 301731
 dashedName: problem-107-minimal-network
 ---
@@ -27,7 +27,7 @@ The same network can be represented by the matrix below.
 
 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;" />
+<img class="img-responsive center-block" alt="Network with 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`.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md
index 3b8d6f014f3..56fbe532238 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d91000cf542c50feeb
 title: 'Problem 108: Diophantine Reciprocals I'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301732
 dashedName: problem-108-diophantine-reciprocals-i
 ---
@@ -14,7 +14,9 @@ $$\frac{1}{x} + \frac{1}{y} = \frac{1}{n}$$
 
 For `n` = 4 there are exactly three distinct solutions:
 
-$$\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}$$
+$$\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?
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-109-darts.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-109-darts.md
index 3b16fe7ac69..5064f7e146c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-109-darts.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-109-darts.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3db1000cf542c50feec
 title: 'Problem 109: Darts'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301733
 dashedName: problem-109-darts
 ---
@@ -20,7 +20,12 @@ There are many variations of rules but in the most popular game the players will
 
 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:
 
-$$\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}$$
+$$\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}$$
 
 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?
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid.md
index d7610e3ac39..0fca350ab46 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3781000cf542c50fe8a
-title: 'Problem 11: Largest product in a grid'
-challengeType: 5
+title: '问题 11：矩阵中最大的乘积'
+challengeType: 1
 forumTopicId: 301734
 dashedName: problem-11-largest-product-in-a-grid
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.md
index 79070c6654d..30b063f605d 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3db1000cf542c50feed
-title: 'Problem 110: Diophantine Reciprocals II'
-challengeType: 5
+title: '问题 110：丢番图倒数 II'
+challengeType: 1
 forumTopicId: 301735
 dashedName: problem-110-diophantine-reciprocals-ii
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md
index a6a9958de73..7f22fbffb6c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3db1000cf542c50feee
 title: 'Problem 111: Primes with runs'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301736
 dashedName: problem-111-primes-with-runs
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-112-bouncy-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-112-bouncy-numbers.md
index d2b8f071980..7599de29978 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-112-bouncy-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-112-bouncy-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3dd1000cf542c50feef
 title: 'Problem 112: Bouncy numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301738
 dashedName: problem-112-bouncy-numbers
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.md
index a06f41a9a5e..2f1c93d837d 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3dd1000cf542c50fef0
-title: 'Problem 113: Non-bouncy numbers'
-challengeType: 5
+title: '问题 113：非弹性数'
+challengeType: 1
 forumTopicId: 301739
 dashedName: problem-113-non-bouncy-numbers
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md
index c6690bddf5b..9258d6e0f9b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md
@@ -1,20 +1,20 @@
 ---
 id: 5900f3e01000cf542c50fef2
-title: 'Problem 114: Counting block combinations I'
-challengeType: 5
+title: '问题 114：计算块组合 I'
+challengeType: 1
 forumTopicId: 301740
 dashedName: problem-114-counting-block-combinations-i
 ---
 
 # --description--
 
-A row measuring seven units in length has red blocks with a minimum length of three units placed on it, such that any two red blocks (which are allowed to be different lengths) are separated by at least one black square. There are exactly seventeen ways of doing this.
+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. 有 17 种方法可以做到这一点。
 
 <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?
+有多少种方法可以填充长度为 50 个单位的行？
 
-**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).
+**Note:** Although the example above does not lend itself to the possibility, in general it is permitted to mix block sizes. 例如，在长度为 8 个单位的行上，你可以使用红色 (3)、黑色 (1) 和红色 (4)。
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md
index a88bc07a34a..2713a7ef2c0 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3e01000cf542c50fef3
 title: 'Problem 116: Red, green or blue tiles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301742
 dashedName: problem-116-red-green-or-blue-tiles
 ---
@@ -12,23 +12,23 @@ 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;" />
+<img class="img-responsive center-block" alt="将红色块放在长度为 5 个单元的一行中的可能方法" 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;" />
+<img class="img-responsive center-block" alt="将绿色块放在长度为 5 个单位的一行中的可能方法" 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.
 
-<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;" />
+<img class="img-responsive center-block" alt="将蓝色块放在长度为 5 个单位的一行中的可能方法" 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?
+假定颜色不能混合，则有 7 + 3 + 2 = 12 种方法来替换长度为 5 个单位的黑色瓷砖。 如果颜色不能混合且至少必须使用一个彩色瓷块，那么一行长度为50个单位的黑色瓷块可以有多少种不同的更换方式？
 
-**Note:** This is related to Problem 117.
+**注意：** 这与问题 117 有关。
 
 # --hints--
 
-`redGreenBlueOne()` should return `20492570929`.
+`redGreenBlueOne()` 应该返回 `20492570929`。
 
 ```js
 assert.strictEqual(redGreenBlueOne(), 20492570929);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md
index ed6d0355598..f8d29995d23 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3e21000cf542c50fef4
 title: 'Problem 117: Red, green, and blue tiles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301743
 dashedName: problem-117-red-green-and-blue-tiles
 ---
@@ -10,15 +10,15 @@ 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.
 
-<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;" />
+<img class="img-responsive center-block" alt="将红色、绿色和蓝色块放置在长度为 5 单位的一行中的可能方法" 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.
+**注意**：这一题与问题 116 有关。
 
 # --hints--
 
-`redGreenBlueTilesTwo()` should return `100808458960497`.
+`redGreenBlueTilesTwo()` 应该返回 `100808458960497`。
 
 ```js
 assert.strictEqual(redGreenBlueTilesTwo(), 100808458960497);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.md
index 00a0605319f..e58893c0981 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.md
@@ -1,20 +1,20 @@
 ---
 id: 5900f3e21000cf542c50fef5
-title: 'Problem 118: Pandigital prime sets'
-challengeType: 5
+title: '问题 118：全数字（Pandigital）素数集'
+challengeType: 1
 forumTopicId: 301744
 dashedName: problem-118-pandigital-prime-sets
 ---
 
 # --description--
 
-Using all of the digits 1 through 9 and concatenating them freely to form decimal integers, different sets can be formed. Interestingly with the set $\\{2, 5, 47, 89, 631\\}$, all of the elements belonging to it are prime.
+Using all of the digits 1 through 9 and concatenating them freely to form decimal integers, different sets can be formed. 有趣的是，对于集合 $\\{2, 5, 47, 89, 631\\}$，所有属于它的元素都是素数。
 
 How many distinct sets containing each of the digits one through nine exactly once contain only prime elements?
 
 # --hints--
 
-`pandigitalPrimeSets()` should return `44680`.
+`pandigitalPrimeSets()` 应该返回 `44680`。
 
 ```js
 assert.strictEqual(pandigitalPrimeSets(), 44680);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md
index 72ed8397d7b..f597b37fe86 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md
@@ -1,24 +1,24 @@
 ---
 id: 5900f3e41000cf542c50fef6
 title: 'Problem 119: Digit power sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301745
 dashedName: problem-119-digit-power-sum
 ---
 
 # --description--
 
-The number 512 is interesting because it is equal to the sum of its digits raised to some power: $5 + 1 + 2 = 8$, and $8^3 = 512$. Another example of a number with this property is $614656 = 28^4$.
+数字 512 很有趣，因为它等于其各位数字之和的某个幂：$5 + 1 + 2 = 8$，$8^3 = 512$。 Another example of a number with this property is $614656 = 28^4$.
 
-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.
+我们定义 $a_n$ 为这种序列中的第 $n-th$ 项，并要求这种序列至少包含两位数字。
 
-You are given that $a_2 = 512$ and $a_{10} = 614656$.
+已知 $a_2 = 512$ 而 $a_{10} = 614656$。
 
-Find $a_{30}$.
+求 $a_{30}$。
 
 # --hints--
 
-`digitPowerSum()` should return `248155780267521`.
+`digitPowerSum()` 应该返回 `248155780267521`
 
 ```js
 assert.strictEqual(digitPowerSum(), 248155780267521);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number.md
index b14276a81e7..ca750a8719a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f3781000cf542c50fe8b
 title: 'Problem 12: Highly divisible triangular number'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301746
 dashedName: problem-12-highly-divisible-triangular-number
 ---
 
 # --description--
 
-The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:
+The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. 序列的前十项是：
 
 <div style='text-align: center;'>1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...</div>
 
@@ -58,7 +58,7 @@ assert.strictEqual(divisibleTriangleNumber(167), 1385280);
 assert.strictEqual(divisibleTriangleNumber(374), 17907120);
 ```
 
-`divisibleTriangleNumber(500)` should return 76576500.
+`divisibleTriangleNumber(500)`应该返回76576500。
 
 ```js
 assert.strictEqual(divisibleTriangleNumber(500), 76576500);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.md
index 1cc716c41ca..25a9bf5ba17 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f3e51000cf542c50fef8
 title: 'Problem 121: Disc game prize fund'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301748
 dashedName: problem-121-disc-game-prize-fund
 ---
 
 # --description--
 
-A bag contains one red disc and one blue disc. In a game of chance a player takes a disc at random and its colour is noted. After each turn the disc is returned to the bag, an extra red disc is added, and another disc is taken at random.
+A bag contains one red disc and one blue disc. 在机会游戏中，玩家随机拿一张圆盘并记录它的颜色。 每转一圈后，将圆盘放回包中，额外添加一个红色圆盘，并随机取出另一圆盘。
 
-The player pays £1 to play and wins if they have taken more blue discs than red discs at the end of the game.
+玩家支付 1 英镑来参加游戏，如果他在游戏结束时获得的蓝盘比红盘多则获得胜利。
 
-If the game is played for four turns, the probability of a player winning is exactly 11/120, and so the maximum prize fund the banker should allocate for winning in this game would be £10 before they would expect to incur a loss. Note that any payout will be a whole number of pounds and also includes the original £1 paid to play the game, so in the example given the player actually wins £9.
+如果游戏进行四回合，那么玩家获胜的概率恰好是 11/120，因此庄家为这场游戏中分配的最高奖金应该是 10 英镑，以避免产生期望损失。 请注意，任何支付都将是一个整数英镑，包含为玩游戏而支付的原始 1 英镑，因此在给出的示例中，玩家实际上赢得了 9 英镑。
 
-Find the maximum prize fund that should be allocated to a single game in which fifteen turns are played.
+找到玩 15 个回合时分配给单局游戏的最大奖金。
 
 # --hints--
 
-`euler121()` should return 2269.
+`discGamePrize()` 应该返回 `2269`。
 
 ```js
-assert.strictEqual(euler121(), 2269);
+assert.strictEqual(discGamePrize(), 2269);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler121(), 2269);
 ## --seed-contents--
 
 ```js
-function euler121() {
+function discGamePrize() {
 
   return true;
 }
 
-euler121();
+discGamePrize();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md
index 7da1b4274e3..78c29aa7952 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md
@@ -1,35 +1,40 @@
 ---
 id: 5900f3e61000cf542c50fef9
 title: 'Problem 122: Efficient exponentiation'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301749
 dashedName: problem-122-efficient-exponentiation
 ---
 
 # --description--
 
-The most naive way of computing n15 requires fourteen multiplications:
+The most naive way of computing $n^{15}$ requires fourteen multiplications:
 
-n × n × ... × n = n15
+$$n × n × \ldots × n = n^{15}$$
 
 But using a "binary" method you can compute it in six multiplications:
 
-n × n = n2n2 × n2 = n4n4 × n4 = n8n8 × n4 = n12n12 × n2 = n14n14 × n = n15
+$$\begin{align}   & n × n = n^2\\\\
+  & n^2 × n^2 = n^4\\\\   & n^4 × n^4 = n^8\\\\
+  & n^8 × n^4 = n^{12}\\\\   & n^{12} × n^2 = n^{14}\\\\
+  & n^{14} × n = n^{15} \end{align}$$
 
 However it is yet possible to compute it in only five multiplications:
 
-n × n = n2n2 × n = n3n3 × n3 = n6n6 × n6 = n12n12 × n3 = n15
+$$\begin{align}   & n × n = n^2\\\\
+  & n^2 × n = n^3\\\\   & n^3 × n^3 = n^6\\\\
+  & n^6 × n^6 = n^{12}\\\\ & n^{12} × n^3 = n^{15} \end{align}$$
 
-We shall define m(k) to be the minimum number of multiplications to compute nk; for example m(15) = 5.
+We shall define $m(k)$ to be the minimum number of multiplications to compute $n^k$; for example $m(15) = 5$.
 
-For 1 ≤ k ≤ 200, find ∑ m(k).
+For $1 ≤ k ≤ 200$, find $\sum{m(k)}$.
 
 # --hints--
 
-`euler122()` should return 1582.
+`efficientExponentation()` should return `1582`.
 
 ```js
-assert.strictEqual(euler122(), 1582);
+assert.strictEqual(efficientExponentation(), 1582);
 ```
 
 # --seed--
@@ -37,12 +42,12 @@ assert.strictEqual(euler122(), 1582);
 ## --seed-contents--
 
 ```js
-function euler122() {
+function efficientExponentation() {
 
   return true;
 }
 
-euler122();
+efficientExponentation();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
index 1dfc34dc9b3..deb11f70f5c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
@@ -1,49 +1,125 @@
 ---
 id: 5900f3e81000cf542c50fefb
-title: 'Problem 124: Ordered radicals'
-challengeType: 5
+title: '问题 124：根数排序'
+challengeType: 1
 forumTopicId: 301751
 dashedName: problem-124-ordered-radicals
 ---
 
 # --description--
 
-The radical of n, rad(n), is the product of the distinct prime factors of n. For example, 504 = 23 × 32 × 7, so rad(504) = 2 × 3 × 7 = 42.
+The radical of $n$, $rad(n)$, is the product of the distinct prime factors of $n$. 例如 $504 = 2^3 × 3^2 × 7$，故 $rad(504) = 2 × 3 × 7 = 42$。
 
-If we calculate rad(n) for 1 ≤ n ≤ 10, then sort them on rad(n), and sorting on n if the radical values are equal, we get:
+如果我们为 $1 ≤ n ≤ 10$ 计算 $rad(n)$，然后按 $rad(n)$ 对它们进行排序，如果部首值相等则按 $n$ 排序，我们得到：
 
-Unsorted
+<div style="text-align: center;">
+  <table cellpadding="2" cellspacing="0" border="0" align="center">
+    <tbody>
+      <tr>
+        <td colspan="2">$Unsorted$</td>
+        <td></td>
+        <td colspan="3">$Sorted$</td>
+      </tr>
+      <tr>
+        <td>$n$</td>
+        <td>$rad(n)$</td>
+        <td></td>
+        <td>$n$</td>
+        <td>$rad(n)$</td>
+        <td>$k$</td>
+      </tr>
+      <tr>
+        <td>1</td>
+        <td>1</td>
+        <td></td>
+        <td>1</td>
+        <td>1</td>
+        <td>1</td>
+      </tr>
+      <tr>
+        <td>2</td>
+        <td>2</td>
+        <td></td>
+        <td>2</td>
+        <td>2</td>
+        <td>2</td>
+      </tr>
+      <tr>
+        <td>3</td>
+        <td>3</td>
+        <td></td>
+        <td>4</td>
+        <td>2</td>
+        <td>3</td>
+      </tr>
+      <tr>
+        <td>4</td>
+        <td>2</td>
+        <td></td>
+        <td>8</td>
+        <td>2</td>
+        <td>4</td>
+      </tr>
+      <tr>
+        <td>5</td>
+        <td>5</td>
+        <td></td>
+        <td>3</td>
+        <td>3</td>
+        <td>5</td>
+      </tr>
+      <tr>
+        <td>6</td>
+        <td>6</td>
+        <td></td>
+        <td>9</td>
+        <td>3</td>
+        <td>6</td>
+      </tr>
+      <tr>
+        <td>7</td>
+        <td>7</td>
+        <td></td>
+        <td>5</td>
+        <td>5</td>
+        <td>7</td>
+      </tr>
+      <tr>
+        <td>8</td>
+        <td>2</td>
+        <td></td>
+        <td>6</td>
+        <td>6</td>
+        <td>8</td>
+      </tr>
+      <tr>
+        <td>9</td>
+        <td>3</td>
+        <td></td>
+        <td>7</td>
+        <td>7</td>
+        <td>9</td>
+      </tr>
+      <tr>
+        <td>10</td>
+        <td>10</td>
+        <td></td>
+        <td>10</td>
+        <td>10</td>
+        <td>10</td>
+      </tr>
+    </tbody>
+  </table>
+</div><br>
 
-Sorted n rad(n)
-
-n rad(n) k 11
-
-111 22
-
-222 33
-
-423 42
-
-824 55
-
-335 66
-
-936 77
-
-557 82
-
-668 93
-
-779 1010
-
-101010 Let E(k) be the kth element in the sorted n column; for example, E(4) = 8 and E(6) = 9. If rad(n) is sorted for 1 ≤ n ≤ 100000, find E(10000).
+记 $E(k)$ 为已经排序的 $n$ 列中的第 $k$ 个元素；例如，$E(4) = 8$ 且 $E(6) = 9$。 如果 $rad(n)$ 按 $1 ≤ n ≤ 100000$ 排序，找到 $E(10000)$。
 
 # --hints--
 
-`euler124()` should return 21417.
+`orderedRadicals()` 应该返回 `21417`。
 
 ```js
-assert.strictEqual(euler124(), 21417);
+assert.strictEqual(orderedRadicals(), 21417);
 ```
 
 # --seed--
@@ -51,12 +127,12 @@ assert.strictEqual(euler124(), 21417);
 ## --seed-contents--
 
 ```js
-function euler124() {
+function orderedRadicals() {
 
   return true;
 }
 
-euler124();
+orderedRadicals();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-125-palindromic-sums.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-125-palindromic-sums.md
index 460f5e2a237..9e26dfa108e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-125-palindromic-sums.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-125-palindromic-sums.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f3e91000cf542c50fefc
 title: 'Problem 125: Palindromic sums'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301752
 dashedName: problem-125-palindromic-sums
 ---
 
 # --description--
 
-The palindromic number 595 is interesting because it can be written as the sum of consecutive squares: 62 + 72 + 82 + 92 + 102 + 112 + 122.
+The palindromic number 595 is interesting because it can be written as the sum of consecutive squares: $6^2 + 7^2 + 8^2 + 9^2 + 10^2 + 11^2 + 12^2$.
 
-There are exactly eleven palindromes below one-thousand that can be written as consecutive square sums, and the sum of these palindromes is 4164. Note that 1 = 02 + 12 has not been included as this problem is concerned with the squares of positive integers.
+There are exactly eleven palindromes below one-thousand that can be written as consecutive square sums, and the sum of these palindromes is 4164. Note that $1 = 0^2 + 1^2$ has not been included as this problem is concerned with the squares of positive integers.
 
-Find the sum of all the numbers less than 108 that are both palindromic and can be written as the sum of consecutive squares.
+Find the sum of all the numbers less than $10^8$ that are both palindromic and can be written as the sum of consecutive squares.
 
 # --hints--
 
-`euler125()` should return 2906969179.
+`palindromicSums()` should return `2906969179`.
 
 ```js
-assert.strictEqual(euler125(), 2906969179);
+assert.strictEqual(palindromicSums(), 2906969179);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler125(), 2906969179);
 ## --seed-contents--
 
 ```js
-function euler125() {
+function palindromicSums() {
 
   return true;
 }
 
-euler125();
+palindromicSums();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md
index fe9b4a6aa80..ed89e9cf5ac 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ea1000cf542c50fefd
 title: 'Problem 126: Cuboid layers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301753
 dashedName: problem-126-cuboid-layers
 ---
@@ -10,14 +10,24 @@ dashedName: problem-126-cuboid-layers
 
 The minimum number of cubes to cover every visible face on a cuboid measuring 3 x 2 x 1 is twenty-two.
 
-If we then add a second layer to this solid it would require forty-six cubes to cover every visible face, the third layer would require seventy-eight cubes, and the fourth layer would require one-hundred and eighteen cubes to cover every visible face. However, the first layer on a cuboid measuring 5 x 1 x 1 also requires twenty-two cubes; similarly the first layer on cuboids measuring 5 x 3 x 1, 7 x 2 x 1, and 11 x 1 x 1 all contain forty-six cubes. We shall define C(n) to represent the number of cuboids that contain n cubes in one of its layers. So C(22) = 2, C(46) = 4, C(78) = 5, and C(118) = 8. It turns out that 154 is the least value of n for which C(n) = 10. Find the least value of n for which C(n) = 1000.
+<img class="img-responsive center-block" alt="3x2x1 的长方体被 22 个 1x1x1 的立方体覆盖" src="https://cdn.freecodecamp.org/curriculum/project-euler/cuboid-layers.png" style="background-color: white; padding: 10px;" />
+
+如果我们再添加第二层来覆盖现在这个体的每一个可见面，则需要 64 个立方体，第三层需要 78 个立方体，第四层需要 118 个。
+
+而覆盖尺寸为 5 x 1 x 1 的长方体第一层同样也需要 22 个小立方体；类似的覆盖尺寸为 5 x 3 x 1，7 x 2 x 1，和 11 x 1 x 1 的第一层都需要 46 个立方体。
+
+我们定义 $C(n)$ 为可以用 $n$ 个小立方体覆盖其某一层表面的长方体的数目。 则 $C(22) = 2$，$C(46) = 4$，$C(78) = 5$，而 $C(118) = 8$。
+
+可以发现 154 是满足 $C(n) = 10$ 时 $n$ 的最小值。
+
+求满足 $C(n) = 1000$ 时，$n$ 的最小值。
 
 # --hints--
 
-`euler126()` should return 18522.
+`cuboidLayers()` 应该返回 `18522`。
 
 ```js
-assert.strictEqual(euler126(), 18522);
+assert.strictEqual(cuboidLayers(), 18522);
 ```
 
 # --seed--
@@ -25,12 +35,12 @@ assert.strictEqual(euler126(), 18522);
 ## --seed-contents--
 
 ```js
-function euler126() {
+function cuboidLayers() {
 
   return true;
 }
 
-euler126();
+cuboidLayers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-127-abc-hits.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-127-abc-hits.md
index 665e17c0a74..ad6b99d46e8 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-127-abc-hits.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-127-abc-hits.md
@@ -1,45 +1,39 @@
 ---
 id: 5900f3ec1000cf542c50fefe
 title: 'Problem 127: abc-hits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301754
 dashedName: problem-127-abc-hits
 ---
 
 # --description--
 
-The radical of n, rad(n), is the product of distinct prime factors of n. For example, 504 = 23 × 32 × 7, so rad(504) = 2 × 3 × 7 = 42.
+$n$ 的根数 $rad(n)$ 是 $n$ 的所有素数因子的积。 如 $504 = 2^3 × 3^2 × 7$，则 $rad(504) = 2 × 3 × 7 = 42$。
 
 We shall define the triplet of positive integers (a, b, c) to be an abc-hit if:
 
-GCD(a, b) = GCD(a, c) = GCD(b, c) = 1
+1. $GCD(a, b) = GCD(a, c) = GCD(b, c) = 1$ 即 a、b、c 两两互质
+2. $a &lt; b$
+3. $a + b = c$
+4. $rad(abc) &lt; c$
 
-a &lt; b
+例如， (5, 27, 32) 为 abc-hit，因为：
 
-a + b = c
+1. $GCD(5, 27) = GCD(5, 32) = GCD(27, 32) = 1$
+2. $5 &lt; 27$
+3. $5 + 27 = 32$
+4. $rad(4320) = 30 &lt; 32$
 
-rad(abc) &lt; c
+可以发现 abc-hits 非常罕见，对于 $c &lt; 1000$，只有 31 个 abc-hits，可得 $\sum{c} = 12523$。
 
-For example, (5, 27, 32) is an abc-hit, because:
-
-GCD(5, 27) = GCD(5, 32) = GCD(27, 32) = 1
-
-5 &lt; 27
-
-5 + 27 = 32
-
-rad(4320) = 30 &lt; 32
-
-It turns out that abc-hits are quite rare and there are only thirty-one abc-hits for c &lt; 1000, with ∑c = 12523.
-
-Find ∑c for c &lt; 120000.
+求 $c &lt; 120000$ 时的 $\sum{c}$。
 
 # --hints--
 
-`euler127()` should return 18407904.
+`abcHits()` 应该返回 `18407904`。
 
 ```js
-assert.strictEqual(euler127(), 18407904);
+assert.strictEqual(abcHits(), 18407904);
 ```
 
 # --seed--
@@ -47,12 +41,12 @@ assert.strictEqual(euler127(), 18407904);
 ## --seed-contents--
 
 ```js
-function euler127() {
+function abcHits() {
 
   return true;
 }
 
-euler127();
+abcHits();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
index 7bdd6242348..5a5725b9ba5 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ec1000cf542c50feff
 title: 'Problem 128: Hexagonal tile differences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301755
 dashedName: problem-128-hexagonal-tile-differences
 ---
@@ -12,14 +12,32 @@ A hexagonal tile with number 1 is surrounded by a ring of six hexagonal tiles, s
 
 New rings are added in the same fashion, with the next rings being numbered 8 to 19, 20 to 37, 38 to 61, and so on. The diagram below shows the first three rings.
 
-By finding the difference between tile n and each of its six neighbours we shall define PD(n) to be the number of those differences which are prime. For example, working clockwise around tile 8 the differences are 12, 29, 11, 6, 1, and 13. So PD(8) = 3. In the same way, the differences around tile 17 are 1, 17, 16, 1, 11, and 10, hence PD(17) = 2. It can be shown that the maximum value of PD(n) is 3. If all of the tiles for which PD(n) = 3 are listed in ascending order to form a sequence, the 10th tile would be 271. Find the 2000th tile in this sequence.
+<img class="img-responsive center-block" alt="前三圈排列好的六角砖，数字编号为 1 到 37，其中砖 8 和砖 17高亮" src="https://cdn.freecodecamp.org/curriculum/project-euler/hexagonal-tile-differences.png" style="background-color: white; padding: 10px;" />
+
+通过计算砖 $n$ 和它周围 6 块砖的数字差，我们定位 $PD(n)$ 为数字差中素数的个数。
+
+例如，围绕砖 8 顺时针方向的差额分别为 12、29、11、6、1 和 13。 则 $PD(8) = 3$。
+
+同理，围绕砖 17 的差额为 1、17、16、1、11 和 10，所以 $PD(17) = 2$。
+
+可以发现 $PD(n)$ 的最大值是 $3$。
+
+如果 $PD(n) = 3$ 的砖按升序排列，那么第 10 块砖将会是 271。
+
+求序列中的第 2000 块砖。
 
 # --hints--
 
-`euler128()` should return 14516824220.
+`hexagonalTile(10)` should return `271`.
 
 ```js
-assert.strictEqual(euler128(), 14516824220);
+assert.strictEqual(hexagonalTile(10), 271);
+```
+
+`hexagonalTile(2000)` should return `14516824220`.
+
+```js
+assert.strictEqual(hexagonalTile(2000), 14516824220);
 ```
 
 # --seed--
@@ -27,16 +45,62 @@ assert.strictEqual(euler128(), 14516824220);
 ## --seed-contents--
 
 ```js
-function euler128() {
+function hexagonalTile(tileIndex) {
 
   return true;
 }
 
-euler128();
+hexagonalTile(10);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+const NUM_PRIMES = 840000;
+const PRIME_SEIVE = Array(Math.floor((NUM_PRIMES-1)/2)).fill(true);
+(function initPrimes(num) {
+  const upper = Math.floor((num - 1) / 2);
+  const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+  for (let i = 0; i <= sqrtUpper; i++) {
+    if (PRIME_SEIVE[i]) {
+      // Mark value in PRIMES array
+      const prime = 2 * i + 3;
+      // Mark all multiples of this number as false (not prime)
+      const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+      for (let j = primeSqaredIndex; j < upper; j += prime) {
+        PRIME_SEIVE[j] = false;
+      }
+    }
+  }
+})(NUM_PRIMES);
+
+function isPrime(num) {
+  if (num === 2) return true;
+  else if (num % 2 === 0) return false
+  else return PRIME_SEIVE[(num - 3) / 2];
+}
+
+function hexagonalTile(tileIndex) {
+  let count = 1;
+  let n = 1;
+  let number = 0;
+
+  while (count < tileIndex) {
+    if (isPrime(6*n - 1) &&
+        isPrime(6*n + 1) &&
+        isPrime(12*n + 5)) {
+      number = 3*n*n - 3*n + 2;
+      count++;
+      if (count >= tileIndex) break;
+    }
+    if (isPrime(6*n + 5) &&
+        isPrime(6*n - 1) &&
+        isPrime(12*n - 7) && n != 1) {
+      number = 3*n*n + 3*n + 1;
+      count++;
+    }
+    n++;
+  }
+  return number;
+}
 ```
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-13-large-sum.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-13-large-sum.md
index 05775850cff..7e4db74fcb7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-13-large-sum.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-13-large-sum.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f37a1000cf542c50fe8c
 title: 'Problem 13: Large sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301757
 dashedName: problem-13-large-sum
 ---
@@ -278,7 +278,7 @@ function largeSum(arr) {
 
   sum = sum.toString(10);
 
-  sum = sum.substr(0, 1) + sum.substr(2);
+  sum = sum.substring(0, 1) + sum.substring(2);
 
   let firstTen = sum.slice(0, 10);
   return parseInt(firstTen, 10);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-135-same-differences.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-135-same-differences.md
index f0de3b5c589..3045467d61e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-135-same-differences.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-135-same-differences.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f3f31000cf542c50ff06
 title: 'Problem 135: Same differences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301763
 dashedName: problem-135-same-differences
 ---
 
 # --description--
 
-Given the positive integers, x, y, and z, are consecutive terms of an arithmetic progression, the least value of the positive integer, n, for which the equation, x2 − y2 − z2 = n, has exactly two solutions is n = 27:
+Given the positive integers, $x$, $y$, and $z$, are consecutive terms of an arithmetic progression, the least value of the positive integer, $n$, for which the equation, $x^2 − y^2 − z^2 = n$, has exactly two solutions is $n = 27$:
 
-342 − 272 − 202 = 122 − 92 − 62 = 27
+$$34^2 − 27^2 − 20^2 = 12^2 − 9^2 − 6^2 = 27$$
 
-It turns out that n = 1155 is the least value which has exactly ten solutions.
+It turns out that $n = 1155$ is the least value which has exactly ten solutions.
 
-How many values of n less than one million have exactly ten distinct solutions?
+How many values of $n$ less than one million have exactly ten distinct solutions?
 
 # --hints--
 
-`euler135()` should return 4989.
+`sameDifferences()` should return `4989`.
 
 ```js
-assert.strictEqual(euler135(), 4989);
+assert.strictEqual(sameDifferences(), 4989);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler135(), 4989);
 ## --seed-contents--
 
 ```js
-function euler135() {
+function sameDifferences() {
 
   return true;
 }
 
-euler135();
+sameDifferences();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-136-singleton-difference.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-136-singleton-difference.md
index 34fda8a4eeb..e3044501927 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-136-singleton-difference.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-136-singleton-difference.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f3f51000cf542c50ff07
 title: 'Problem 136: Singleton difference'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301764
 dashedName: problem-136-singleton-difference
 ---
 
 # --description--
 
-The positive integers, x, y, and z, are consecutive terms of an arithmetic progression. Given that n is a positive integer, the equation, x2 − y2 − z2 = n, has exactly one solution when n = 20:
+正整数 $x$、$y$ 和 $z$ 是算术级数的连续项。 已知 $n$ 为正整数，对于方程 $x^2 − y^2 − z^2 = n$，当 $n = 20$ 时存在唯一解:
 
-132 − 102 − 72 = 20
+$$13^2 − 10^2 − 7^2 = 20$$
 
-In fact there are twenty-five values of n below one hundred for which the equation has a unique solution.
+事实上，有 25 个 $n$ 小于 100 的值，使得方程有唯一解。
 
-How many values of n less than fifty million have exactly one solution?
+有多少小于五千万的 $n$ 使得方程有唯一解?
 
 # --hints--
 
-`euler136()` should return 2544559.
+`singletonDifference()` 应该返回 `2544559`。
 
 ```js
-assert.strictEqual(euler136(), 2544559);
+assert.strictEqual(singletonDifference(), 2544559);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler136(), 2544559);
 ## --seed-contents--
 
 ```js
-function euler136() {
+function singletonDifference() {
 
   return true;
 }
 
-euler136();
+singletonDifference();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md
index 800c0ccbab2..bfb2fb7065f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md
@@ -1,25 +1,29 @@
 ---
 id: 5900f3f71000cf542c50ff0a
-title: 'Problem 139: Pythagorean tiles'
-challengeType: 5
+title: '问题 139：毕达哥拉斯砖块'
+challengeType: 1
 forumTopicId: 301767
 dashedName: problem-139-pythagorean-tiles
 ---
 
 # --description--
 
-Let (a, b, c) represent the three sides of a right angle triangle with integral length sides. It is possible to place four such triangles together to form a square with length c.
+设（a，b，c）表示具有整数边长的直角三角形的三条边。 It is possible to place four such triangles together to form a square with length c.
 
-For example, (3, 4, 5) triangles can be placed together to form a 5 by 5 square with a 1 by 1 hole in the middle and it can be seen that the 5 by 5 square can be tiled with twenty-five 1 by 1 squares.
+例如，边长为（3，4，5）的三角形可以放在一起形成一个 5 乘 5 的正方形，中间有一个 1 乘 1 的小正方形，并且可以用 25 个 1 乘 1 的小正方形平埔填充 5 乘 5 的正方形。
 
-However, if (5, 12, 13) triangles were used then the hole would measure 7 by 7 and these could not be used to tile the 13 by 13 square. Given that the perimeter of the right triangle is less than one-hundred million, how many Pythagorean triangles would allow such a tiling to take place?
+<img class="img-responsive center-block" alt="两个 5 x 5 的正方形：第一个通过 4 个 3 x 4 x 5 的三角形组成，中心有个 1 x 1 小正方形；第二个通过 25 个 1 x 1 的小正方形平铺填充。" src="https://cdn.freecodecamp.org/curriculum/project-euler/pythagorean-tiles.png" style="background-color: white; padding: 10px;" />
+
+但是，如果使用（5，12，13）的三角形组成正方形，中间的小正方形是 7 乘 7 的。 而这些 7 x 7 的正方形将无法平铺填充 13 x 13 的正方形。
+
+请求出在周长小于 100,000,000 的直角三角形中，有多少个毕达哥斯拉三角形可以满足这种填充？
 
 # --hints--
 
-`euler139()` should return 10057761.
+`pythagoreanTiles()` 应该返回 `10057761`。
 
 ```js
-assert.strictEqual(euler139(), 10057761);
+assert.strictEqual(pythagoreanTiles(), 10057761);
 ```
 
 # --seed--
@@ -27,12 +31,12 @@ assert.strictEqual(euler139(), 10057761);
 ## --seed-contents--
 
 ```js
-function euler139() {
+function pythagoreanTiles() {
 
   return true;
 }
 
-euler139();
+pythagoreanTiles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-14-longest-collatz-sequence.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-14-longest-collatz-sequence.md
index 619a31ee72b..72a76318886 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-14-longest-collatz-sequence.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-14-longest-collatz-sequence.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f37a1000cf542c50fe8d
 title: '问题 14：最长考拉兹序列'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301768
 dashedName: problem-14-longest-collatz-sequence
 ---
@@ -22,7 +22,7 @@ dashedName: problem-14-longest-collatz-sequence
 
 求出在小于 `limit` 的数中，哪个可以产生最长的考拉兹序列？
 
-**注意：** 序列中数字的个数允许超过一百万。
+**Note:** Once the chain starts the terms are allowed to go above `limit`.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md
index 88d8b1e5a8d..fa50e4c2104 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md
@@ -1,29 +1,44 @@
 ---
 id: 5900f3fc1000cf542c50ff0f
-title: 'Problem 144: Investigating multiple reflections of a laser beam'
-challengeType: 5
+title: '问题 144：一束激光的多次反射研究'
+challengeType: 1
 forumTopicId: 301773
 dashedName: problem-144-investigating-multiple-reflections-of-a-laser-beam
 ---
 
 # --description--
 
-In laser physics, a "white cell" is a mirror system that acts as a delay line for the laser beam. The beam enters the cell, bounces around on the mirrors, and eventually works its way back out.
+激光物理学中，“白腔”是一个使激光束产生延迟的镜面系统。 激光束进入白腔后，会在镜面上不断反射，并最终射出。
 
-The specific white cell we will be considering is an ellipse with the equation 4x2 + y2 = 100
+本题中涉及的白腔是一个椭圆，对应方程为 $4{x}^2 + y^2 = 100$。
 
-The section corresponding to −0.01 ≤ x ≤ +0.01 at the top is missing, allowing the light to enter and exit through the hole.
+椭圆顶部削去了 $−0.01 ≤ x ≤ +0.01$ 的部分，使得激光束可以通过该部分进入和离开白腔。
 
-The light beam in this problem starts at the point (0.0,10.1) just outside the white cell, and the beam first impacts the mirror at (1.4,-9.6). Each time the laser beam hits the surface of the ellipse, it follows the usual law of reflection "angle of incidence equals angle of reflection." That is, both the incident and reflected beams make the same angle with the normal line at the point of incidence. In the figure on the left, the red line shows the first two points of contact between the laser beam and the wall of the white cell; the blue line shows the line tangent to the ellipse at the point of incidence of the first bounce.The slope m of the tangent line at any point (x,y) of the given ellipse is: m = −4x/yThe normal line is perpendicular to this tangent line at the point of incidence. The animation on the right shows the first 10 reflections of the beam.
+<div style="text-align: center">
+  <img class="img-responsive center-block" alt="激光束由点 (0.0, 10.1) 发出，并于点 (1.4, -9.6) 处击中镜面" src="https://cdn.freecodecamp.org/curriculum/project-euler/investigating-multiple-reflections-of-a-laser-beam-1.png" style="display: inline-block; background-color: white; padding: 10px;">
+  <img class="img-responsive center-block" alt="激光束前十次反射路径的动画" src="https://cdn.freecodecamp.org/curriculum/project-euler/investigating-multiple-reflections-of-a-laser-beam-2.gif" style="display: inline-block; background-color: white; padding: 10px;">
+</div><br>
 
-How many times does the beam hit the internal surface of the white cell before exiting?
+本题中，激光束从白腔外一点 (0.0, 10.1) 发出，首次接触镜面的点为 (1.4, -9.6)。
+
+每当激光束击中椭圆表面时，均遵循反射定律：“入射角等于反射角”。 即入射光束和反射光束与界面法线的夹角角度相等。
+
+左图中，红线展示了激光束击中白腔镜面的前两个接触点；蓝线表示第一次反射时在入射点处与椭圆的切线。
+
+对椭圆任意点 (x, y)，均有切线斜率 m 满足 $m = −4 × \frac{x}{y}$。
+
+法线垂直于入射点处的切线。
+
+右侧动画展示了激光束前十次反射的路径。
+
+请求出在激光束离开白腔前，它在椭圆的内表面上击中了多少次？
 
 # --hints--
 
-`euler144()` should return 354.
+`laserBeamReflections()` 应该返回 `354`。
 
 ```js
-assert.strictEqual(euler144(), 354);
+assert.strictEqual(laserBeamReflections(), 354);
 ```
 
 # --seed--
@@ -31,12 +46,12 @@ assert.strictEqual(euler144(), 354);
 ## --seed-contents--
 
 ```js
-function euler144() {
+function laserBeamReflections() {
 
   return true;
 }
 
-euler144();
+laserBeamReflections();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md
index 3b422811f69..ca954ab41c3 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md
@@ -1,27 +1,31 @@
 ---
 id: 5900f3ff1000cf542c50ff12
-title: 'Problem 147: Rectangles in cross-hatched grids'
-challengeType: 5
+title: '问题 147：交叉对角线网格中的矩形'
+challengeType: 1
 forumTopicId: 301776
 dashedName: problem-147-rectangles-in-cross-hatched-grids
 ---
 
 # --description--
 
-In a 3x2 cross-hatched grid, a total of 37 different rectangles could be situated within that grid as indicated in the sketch.
+如图所示，在 3 x 2 的交叉对角线网格中，共有 37 个不同的矩形可以放置于该网格内。
 
-There are 5 grids smaller than 3x2, vertical and horizontal dimensions being important, i.e. 1x1, 2x1, 3x1, 1x2 and 2x2. If each of them is cross-hatched, the following number of different rectangles could be situated within those smaller grids: 1x1: 1 2x1: 4 3x1: 8 1x2: 4 2x2: 18
+<img class="img-responsive center-block" alt="3 x 2 网格中放置不同矩形的方法" src="https://cdn.freecodecamp.org/curriculum/project-euler/rectangles-in-cross-hatched-grids.png" style="background-color: white; padding: 10px;" />
 
-Adding those to the 37 of the 3x2 grid, a total of 72 different rectangles could be situated within 3x2 and smaller grids.
+从长和宽的角度考虑，有 5 种小于 3 x 2 网格的矩形，即 1 x 1、2 x 1、3 x 1、1 x 2 和 2 x 2。 若画出上述矩形的交叉对角线，则有不同的矩形可以位于这些更小的网格中，对应数量如下：
 
-How many different rectangles could be situated within 47x43 and smaller grids?
+$$\begin{array}{|c|c|} \hline 1 \times 1 & 1  \\\\ \hline 2 \times 1 & 4  \\\\ \hline 3 \times 1 & 8  \\\\ \hline 1 \times 2 & 4  \\\\ \hline 2 \times 2 & 18 \\\\ \hline \end{array}$$
+
+上述个数与 3 x 2 网格中的 37 相加，可得对于 3 x 2 及其更小的网格，共有 72 个不同的矩形可以放置其中。
+
+请求出 47 x 43 及其更小的网格中，可以放置多少个不同的矩形？
 
 # --hints--
 
-`euler147()` should return 846910284.
+`crossHatchedRectangles()` 应该返回 `846910284`。
 
 ```js
-assert.strictEqual(euler147(), 846910284);
+assert.strictEqual(crossHatchedRectangles(), 846910284);
 ```
 
 # --seed--
@@ -29,12 +33,12 @@ assert.strictEqual(euler147(), 846910284);
 ## --seed-contents--
 
 ```js
-function euler147() {
+function crossHatchedRectangles() {
 
   return true;
 }
 
-euler147();
+crossHatchedRectangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-15-lattice-paths.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-15-lattice-paths.md
index 225a31ee93c..3cc175d4454 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-15-lattice-paths.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-15-lattice-paths.md
@@ -1,40 +1,40 @@
 ---
 id: 5900f37b1000cf542c50fe8e
-title: 'Problem 15: Lattice paths'
-challengeType: 5
+title: '问题 15：网格路径'
+challengeType: 1
 forumTopicId: 301780
 dashedName: problem-15-lattice-paths
 ---
 
 # --description--
 
-Starting in the top left corner of a 2×2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.
+从一个 2 × 2 的网格左上角出发，规定只允许向右或向下移动，则到达右下角的路径恰好有 6 条。
 
-<img class="img-responsive center-block" alt="a diagram of 6 2 by 2 grids showing all the routes to the bottom right corner" src="https://cdn-media-1.freecodecamp.org/project-euler/1Atixoj.gif" style="background-color: white; padding: 10px;" />
+<img class="img-responsive center-block" alt="图片展示了到达 2 × 2 网格右下角的所有 6 条路径" src="https://cdn-media-1.freecodecamp.org/project-euler/1Atixoj.gif" style="background-color: white; padding: 10px;" />
 
-How many such routes are there through a given `gridSize`?
+给定网格大小为 `gridSize`，请求出这样的路径有多少条?
 
 # --hints--
 
-`latticePaths(4)` should return a number.
+`latticePaths(4)` 应该返回一个数字。
 
 ```js
 assert(typeof latticePaths(4) === 'number');
 ```
 
-`latticePaths(4)` should return 70.
+`latticePaths(4)` 应该返回 70。
 
 ```js
 assert.strictEqual(latticePaths(4), 70);
 ```
 
-`latticePaths(9)` should return 48620.
+`latticePaths(9)` 应该返回 48620。
 
 ```js
 assert.strictEqual(latticePaths(9), 48620);
 ```
 
-`latticePaths(20)` should return 137846528820.
+`latticePaths(20)` 应该返回 137846528820。
 
 ```js
 assert.strictEqual(latticePaths(20), 137846528820);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md
index fa659c2f46e..7d7f0f37b9d 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md
@@ -2,7 +2,7 @@
 id: 5900f4031000cf542c50ff15
 title: >-
   Problem 150: Searching a triangular array for a sub-triangle having minimum-sum
-challengeType: 5
+challengeType: 1
 forumTopicId: 301781
 dashedName: problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum
 ---
@@ -11,17 +11,23 @@ dashedName: problem-150-searching-a-triangular-array-for-a-sub-triangle-having-m
 
 In a triangular array of positive and negative integers, we wish to find a sub-triangle such that the sum of the numbers it contains is the smallest possible.
 
-In the example below, it can be easily verified that the marked triangle satisfies this condition having a sum of −42.
+在下面的示例中，可以很容易地验证标记的三角形满足具有 -42 的总和的条件。
 
-We wish to make such a triangular array with one thousand rows, so we generate 500500 pseudo-random numbers sk in the range ±219, using a type of random number generator (known as a Linear Congruential Generator) as follows: t := 0
+<img class="img-responsive center-block" alt="三角形数组，带有标记的子三角形，总和 -42" src="https://cdn.freecodecamp.org/curriculum/project-euler/searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.gif" style="background-color: white; padding: 10px;" />
 
-for k = 1 up to k = 500500:
+我们希望制作一个包含一千行的三角形数组，因此我们使用一种随机数生成器（称为线性同余生成器）生成 500500 个伪随机数 $s_k$ ，范围为 $±2^{19}$，如下所示：
 
-t := (615949\*t + 797807) modulo 220 sk := t−219 Thus: s1 = 273519, s2 = −153582, s3 = 450905 etc Our triangular array is then formed using the pseudo-random numbers thus:
+$$\begin{align}   t := & \\ 0\\\\
+  \text{for}\\ & k = 1\\ \text{up to}\\ k = 500500:\\\\   & t := (615949 × t + 797807)\\ \text{modulo}\\ 2^{20}\\\\
+  & s_k := t − 219\\\\ \end{align}$$
 
-s1 s2 s3 s4 s5 s6
+例如：$s_1 = 273519$、$s_2 = −153582$、$s_3 = 450905$ 等。
 
-s7 s8 s9 s10 ...
+然后使用伪随机数组形成我们的三角形数组如下：
+
+$$ s_1 \\\\
+s_2\\;s_3 \\\\ s_4\\; s_5\\; s_6 \\\\
+s_7\\; s_8\\; s_9\\; s_{10} \\\\ \ldots $$
 
 Sub-triangles can start at any element of the array and extend down as far as we like (taking-in the two elements directly below it from the next row, the three elements directly below from the row after that, and so on).
 
@@ -31,10 +37,10 @@ Find the smallest possible sub-triangle sum.
 
 # --hints--
 
-`euler150()` should return -271248680.
+`smallestSubTriangleSum()` 应该返回 `-271248680`。
 
 ```js
-assert.strictEqual(euler150(), -271248680);
+assert.strictEqual(smallestSubTriangleSum(), -271248680);
 ```
 
 # --seed--
@@ -42,12 +48,12 @@ assert.strictEqual(euler150(), -271248680);
 ## --seed-contents--
 
 ```js
-function euler150() {
+function smallestSubTriangleSum() {
 
   return true;
 }
 
-euler150();
+smallestSubTriangleSum();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md
index e75e5a0fdfe..de67a269d4a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4031000cf542c50ff16
 title: 'Problem 151: Paper sheets of standard sizes: an expected-value problem'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301782
 dashedName: problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem
 ---
@@ -16,14 +16,20 @@ He proceeds to cut it in half, thus getting two sheets of size A2. Then he cuts
 
 All the unused sheets are placed back in the envelope.
 
-At the beginning of each subsequent batch, he takes from the envelope one sheet of paper at random. If it is of size A5, he uses it. If it is larger, he repeats the 'cut-in-half' procedure until he has what he needs and any remaining sheets are always placed back in the envelope. Excluding the first and last batch of the week, find the expected number of times (during each week) that the foreman finds a single sheet of paper in the envelope. Give your answer rounded to six decimal places using the format x.xxxxxx .
+<img class="img-responsive center-block" alt="A1 尺寸纸可以拆分为：A2、A3、A4 和两张 A5 纸" src="https://cdn.freecodecamp.org/curriculum/project-euler/paper-sheets-of-standard-sizes-an-expected-value-problem.png" style="background-color: white; padding: 10px;" />
+
+随后每批开始时，他随机从信封中拿走一张纸张。 If it is of size A5, he uses it. 如果它更大，他会重复“切成两半”的程序，直到他有他需要的东西，任何剩余的纸张总是放回信封里。
+
+排除一周的第一批和最后一批，求领班在信封中找到一张纸的预期次数（每周）。
+
+使用格式 `x.xxxxxx` 将您的答案四舍五入到小数点后六位。
 
 # --hints--
 
-`euler151()` should return 0.464399.
+`expectedValueProblem()` 应该返回 `0.464399`。
 
 ```js
-assert.strictEqual(euler151(), 0.464399);
+assert.strictEqual(expectedValueProblem(), 0.464399);
 ```
 
 # --seed--
@@ -31,12 +37,12 @@ assert.strictEqual(euler151(), 0.464399);
 ## --seed-contents--
 
 ```js
-function euler151() {
+function expectedValueProblem() {
 
   return true;
 }
 
-euler151();
+expectedValueProblem();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md
index 1acd9f0652e..079cfdd9daa 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md
@@ -1,25 +1,29 @@
 ---
 id: 5900f4041000cf542c50ff17
 title: 'Problem 152: Writing one half as a sum of inverse squares'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301783
 dashedName: problem-152-writing-one-half-as-a-sum-of-inverse-squares
 ---
 
 # --description--
 
-There are several ways to write the number 1/2 as a sum of inverse squares using distinct integers.
+有几种方法可以使用不同的整数将数字 $\frac{1}{2}$ 写成倒数平方和。
 
 For instance, the numbers {2,3,4,5,7,12,15,20,28,35} can be used:
 
-In fact, only using integers between 2 and 45 inclusive, there are exactly three ways to do it, the remaining two being: {2,3,4,6,7,9,10,20,28,35,36,45} and {2,3,4,6,7,9,12,15,28,30,35,36,45}. How many ways are there to write the number 1/2 as a sum of inverse squares using distinct integers between 2 and 80 inclusive?
+$$\frac{1}{2} = \frac{1}{2^2} + \frac{1}{3^2} + \frac{1}{4^2} + \frac{1}{5^2} + \frac{1}{7^2} + \frac{1}{{12}^2} + \frac{1}{{15}^2} + \frac{1}{{20}^2} + \frac{1}{{28}^2} + \frac{1}{{35}^2}$$
+
+In fact, only using integers between 2 and 45 inclusive, there are exactly three ways to do it, the remaining two being: {2,3,4,6,7,9,10,20,28,35,36,45} and {2,3,4,6,7,9,12,15,28,30,35,36,45}.
+
+使用 2 到 80 之间（含 2 和 80）的不同整数，有多少种方法可以将数字 $\frac{1}{2}$ 写成倒数平方和？
 
 # --hints--
 
-`euler152()` should return 301.
+`sumInverseSquares()` 应该返回 `301`。
 
 ```js
-assert.strictEqual(euler152(), 301);
+assert.strictEqual(sumInverseSquares(), 301);
 ```
 
 # --seed--
@@ -27,12 +31,12 @@ assert.strictEqual(euler152(), 301);
 ## --seed-contents--
 
 ```js
-function euler152() {
+function sumInverseSquares() {
 
   return true;
 }
 
-euler152();
+sumInverseSquares();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md
index b1eaa92c44b..df56bfd80b2 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md
@@ -1,53 +1,67 @@
 ---
 id: 5900f4051000cf542c50ff18
-title: 'Problem 153: Investigating Gaussian Integers'
-challengeType: 5
+title: '问题 153：研究高斯整数'
+challengeType: 1
 forumTopicId: 301784
 dashedName: problem-153-investigating-gaussian-integers
 ---
 
 # --description--
 
-As we all know the equation x2=-1 has no solutions for real x.
+众所周知，方程 $x^2 = -1$ 没有实数 $x$ 解。
 
-If we however introduce the imaginary number i this equation has two solutions: x=i and x=-i.
+然而，如果我们引入虚数 $i$，则该等式具有两个解： $x = i$ 与 $x = -i$。
 
-If we go a step further the equation (x-3)2=-4 has two complex solutions: x=3+2i and x=3-2i. x=3+2i and x=3-2i are called each others' complex conjugate.
+如果我们更进一步，方程式 ${(x - 3)}^2 = -4$ 有两个复数解： $x = 3 + 2i$ 和 $x = 3 - 2i$， 被称为共轭复数。
 
-Numbers of the form a+bi are called complex numbers.
+形式 $a + bi$ 的数字称为复数。
 
-In general a+bi and a−bi are each other's complex conjugate. A Gaussian Integer is a complex number a+bi such that both a and b are integers.
+通常 $a + bi$ 与 $a − bi$ 为共轭复数。 高斯整数是指复数 $a + bi$，$a$ 与 $b$ 都是整数。
 
-The regular integers are also Gaussian integers (with b=0).
+常规整数也是高斯整数（$b = 0$）。
 
-To distinguish them from Gaussian integers with b ≠ 0 we call such integers "rational integers."
+为了将它们与 $b ≠ 0$ 的高斯整数区分开来，我们称这样的整数为“有理整数”。
 
-A Gaussian integer is called a divisor of a rational integer n if the result is also a Gaussian integer.
+一个高斯整数可以作为有理整数 $n$ 的约数，如果得到的余数也是一个高斯整数。
 
-If for example we divide 5 by 1+2i we can simplify in the following manner:
+例如，如果我们将 5 除以 $1 + 2i$，我们可以通过以下方式进行简化：
 
-Multiply numerator and denominator by the complex conjugate of 1+2i: 1−2i.
+将分子和分母乘以 $1 + 2i$ 的复共轭：$1 − 2i$。
 
-The result is .
+结果是：
 
-So 1+2i is a divisor of 5.
+$$\frac{5}{1 + 2i} = \frac{5}{1 + 2i} \frac{1 - 2i}{1 - 2i} = \frac{5(1 - 2i)}{1 - {(2i)}^2} = \frac{5(1 - 2i)}{1 - (-4)} = \frac{5(1 - 2i)}{5} = 1 - 2i$$
 
-Note that 1+i is not a divisor of 5 because .
+所以 $1 + 2i$ 是 5 的约数.
 
-Note also that if the Gaussian Integer (a+bi) is a divisor of a rational integer n, then its complex conjugate (a−bi) is also a divisor of n. In fact, 5 has six divisors such that the real part is positive: {1, 1 + 2i, 1 − 2i, 2 + i, 2 − i, 5}.
+请注意，$1 + i$ 不是 5 的除数，因为：
 
-The following is a table of all of the divisors for the first five positive rational integers:
+$$\frac{5}{1 + i} = \frac{5}{2} - \frac{5}{2}i$$
 
-n Gaussian integer divisors with positive real partSum s(n) of these
+注意，如果高斯整数（$a + bi$）是有理整数 $n$ 的约数，则其共轭复数（$a − bi$）也是 $n$ 的因子。 事实上，5 有六个因数，使得实部为正数：{1, 1 + 2i, 1 − 2i, 2 + i, 2 − i, 5}。
 
-divisors111 21, 1+i, 1-i, 25 31, 34 41, 1+i, 1-i, 2, 2+2i, 2-2i,413 51, 1+2i, 1-2i, 2+i, 2-i, 512 For divisors with positive real parts, then, we have: . For 1 ≤ n ≤ 105, ∑ s(n)=17924657155. What is ∑ s(n) for 1 ≤ n ≤ 108?
+以下是前五个正整数的所有约数表：
+
+| n | 实数部分为正的高斯整数约数表                        | 这些除数的总和 s(n) |
+| - | ------------------------------------- | ------------ |
+| 1 | 1                                     | 1            |
+| 2 | 1, 1 + i, 1 - i, 2                    | 5            |
+| 3 | 1, 3                                  | 4            |
+| 4 | 1, 1 + i, 1 - i, 2, 2 + 2i, 2 - 2i, 4 | 13           |
+| 5 | 1, 1 + 2i, 1 - 2i, 2 + i, 2 - i, 5    | 12           |
+
+对于实数部分为正的约数，我们有：$\displaystyle\sum_{n=1}^5 s(n) = 35$。
+
+对于 $1 ≤ n ≤ {10}^5$, $\displaystyle\sum_{n = 1}^{{10}^5} s(n) = 17924657155$.
+
+求 $\displaystyle\sum_{n=1}^{{10}^8} s(n)$?
 
 # --hints--
 
-`euler153()` should return 17971254122360636.
+`sumGaussianIntegers()` 应得 `17971254122360636`。
 
 ```js
-assert.strictEqual(euler153(), 17971254122360636);
+assert.strictEqual(sumGaussianIntegers(), 17971254122360636);
 ```
 
 # --seed--
@@ -55,12 +69,12 @@ assert.strictEqual(euler153(), 17971254122360636);
 ## --seed-contents--
 
 ```js
-function euler153() {
+function sumGaussianIntegers() {
 
   return true;
 }
 
-euler153();
+sumGaussianIntegers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md
index 8d8abe0dfcd..828d330bab1 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4071000cf542c50ff19
-title: 'Problem 154: Exploring Pascal''s pyramid'
-challengeType: 5
+title: '问题 154：探索帕斯卡金字塔'
+challengeType: 1
 forumTopicId: 301785
 dashedName: problem-154-exploring-pascals-pyramid
 ---
@@ -10,14 +10,20 @@ dashedName: problem-154-exploring-pascals-pyramid
 
 A triangular pyramid is constructed using spherical balls so that each ball rests on exactly three balls of the next lower level.
 
-Then, we calculate the number of paths leading from the apex to each position: A path starts at the apex and progresses downwards to any of the three spheres directly below the current position. Consequently, the number of paths to reach a certain position is the sum of the numbers immediately above it (depending on the position, there are up to three numbers above it). The result is Pascal's pyramid and the numbers at each level n are the coefficients of the trinomial expansion (x + y + z)n. How many coefficients in the expansion of (x + y + z)200000 are multiples of 1012?
+<img class="img-responsive center-block" alt="用球形搭建的四级三角形金字塔" src="https://cdn.freecodecamp.org/curriculum/project-euler/exploring-pascals-pyramid.png" style="background-color: white; padding: 10px;" />
+
+然后，我们计算从顶点到每个位置的路径数量：路径从顶点开始并向下前进到当前位置正下方的三个球体中的任何一个。 因此，到达某个位置的路径数是紧接在其上方的数字的总和（取决于位置，在其上方最多有三个数字）。
+
+其结果是帕斯卡金字塔（Pascal's pyramid），每个级别 n 的数字是三项式 ${(x + y + z)}^n$ 展开的系数.
+
+${(x + y + z)}^{200000}$ 的展开式中有多少个系数是 ${10}^{12}$ 的倍数？
 
 # --hints--
 
-`euler154()` should return 479742450.
+`pascalsPyramid()` 应该返回 `479742450`。
 
 ```js
-assert.strictEqual(euler154(), 479742450);
+assert.strictEqual(pascalsPyramid(), 479742450);
 ```
 
 # --seed--
@@ -25,12 +31,12 @@ assert.strictEqual(euler154(), 479742450);
 ## --seed-contents--
 
 ```js
-function euler154() {
+function pascalsPyramid() {
 
   return true;
 }
 
-euler154();
+pascalsPyramid();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md
index 404c223c6a4..15714a74543 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4081000cf542c50ff1a
 title: 'Problem 155: Counting Capacitor Circuits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301786
 dashedName: problem-155-counting-capacitor-circuits
 ---
@@ -10,18 +10,24 @@ dashedName: problem-155-counting-capacitor-circuits
 
 An electric circuit uses exclusively identical capacitors of the same value C.
 
-The capacitors can be connected in series or in parallel to form sub-units, which can then be connected in series or in parallel with other capacitors or other sub-units to form larger sub-units, and so on up to a final circuit. Using this simple procedure and up to n identical capacitors, we can make circuits having a range of different total capacitances. For example, using up to n=3 capacitors of 60 F each, we can obtain the following 7 distinct total capacitance values:
+电容器可以串联或并联连接以形成子单元，子单元然后可以与其他电容器或其他子单元串联或并联连接以形成更大的子单元，以此类推直到最终电路。
 
-If we denote by D(n) the number of distinct total capacitance values we can obtain when using up to n equal-valued capacitors and the simple procedure described above, we have: D(1)=1, D(2)=3, D(3)=7 ... Find D(18). Reminder : When connecting capacitors C1, C2 etc in parallel, the total capacitance is CT = C1 + C2 +...,
+使用这个简单的程序和最多 n 个相同的电容器，我们可以制作具有不同总电容范围的电路。 例如，最多使用 $n = 3$ 个 $60 μF$ 的电容器， 我们可以获得以下 7 个不同的总电容值：
 
-whereas when connecting them in series, the overall capacitance is given by:
+<img class="img-responsive center-block" alt="示例电路最多有三个电容器，每个 60 μF" src="https://cdn.freecodecamp.org/curriculum/project-euler/counting-capacitor-circuits.gif" style="background-color: white; padding: 10px;" />
+
+如果我们用 $D(n)$ 表示当使用最多 $n$ 个等值电容器时，我们采用上述简单程序可以获得的不同总电容值的数量，我们得到：$D(1) = 1, D(2) = 3, D(3)=7, \ldots$。
+
+求 $D(18)$。
+
+提醒：当并连 $C_1$, $C_2$ 等电容器时，总容量为 $C_T = C_1 + C_2 + \cdots$；而当串连它们时，总容量为 $\frac{1}{C_T} = \frac{1}{C_1} + \frac{1}{C_2} + \cdots$。
 
 # --hints--
 
-`euler155()` should return 3857447.
+`capacitanceValues()` 应得 `3857447`。
 
 ```js
-assert.strictEqual(euler155(), 3857447);
+assert.strictEqual(capacitanceValues(), 3857447);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler155(), 3857447);
 ## --seed-contents--
 
 ```js
-function euler155() {
+function capacitanceValues() {
 
   return true;
 }
 
-euler155();
+capacitanceValues();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-156-counting-digits.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-156-counting-digits.md
index 3ab75c957bc..fb820e64aa0 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-156-counting-digits.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-156-counting-digits.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4091000cf542c50ff1b
 title: 'Problem 156: Counting Digits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301787
 dashedName: problem-156-counting-digits
 ---
@@ -12,24 +12,40 @@ Starting from zero the natural numbers are written down in base 10 like this:
 
 0 1 2 3 4 5 6 7 8 9 10 11 12....
 
-Consider the digit d=1. After we write down each number n, we will update the number of ones that have occurred and call this number f(n,1). The first values for f(n,1), then, are as follows:
+Consider the digit $d = 1$. After we write down each number n, we will update the number of ones that have occurred and call this number $f(n, 1)$. The first values for $f(n, 1)$, then, are as follows:
 
-nf(n,1) 00 11 21 31 41 51 61 71 81 91 102 114 125
+| $n$ | $f(n, 1)$ |
+| --- | --------- |
+| 0   | 0         |
+| 1   | 1         |
+| 2   | 1         |
+| 3   | 1         |
+| 4   | 1         |
+| 5   | 1         |
+| 6   | 1         |
+| 7   | 1         |
+| 8   | 1         |
+| 9   | 1         |
+| 10  | 2         |
+| 11  | 4         |
+| 12  | 5         |
 
-Note that f(n,1) never equals 3.
+Note that $f(n, 1)$ never equals 3.
 
-So the first two solutions of the equation f(n,1)=n are n=0 and n=1. The next solution is n=199981. In the same manner the function f(n,d) gives the total number of digits d that have been written down after the number n has been written.
+So the first two solutions of the equation $f(n, 1) = n$ are $n = 0$ and $n = 1$. The next solution is $n = 199981$. In the same manner the function $f(n, d)$ gives the total number of digits d that have been written down after the number $n$ has been written.
 
-In fact, for every digit d ≠ 0, 0 is the first solution of the equation f(n,d)=n. Let s(d) be the sum of all the solutions for which f(n,d)=n.
+In fact, for every digit $d ≠ 0$, 0 is the first solution of the equation $f(n, d) = n$. Let $s(d)$ be the sum of all the solutions for which $f(n, d) = n$.
 
-You are given that s(1)=22786974071. Find ∑ s(d) for 1 ≤ d ≤ 9. Note: if, for some n, f(n,d)=n for more than one value of d this value of n is counted again for every value of d for which f(n,d)=n.
+You are given that $s(1) = 22786974071$. Find $\sum{s(d)}$ for $1 ≤ d ≤ 9$.
+
+Note: if, for some $n$, $f(n, d) = n$ for more than one value of $d$ this value of $n$ is counted again for every value of $d$ for which $f(n, d) = n$.
 
 # --hints--
 
-`euler156()` should return 21295121502550.
+`countingDigits()` should return `21295121502550`.
 
 ```js
-assert.strictEqual(euler156(), 21295121502550);
+assert.strictEqual(countingDigits(), 21295121502550);
 ```
 
 # --seed--
@@ -37,12 +53,12 @@ assert.strictEqual(euler156(), 21295121502550);
 ## --seed-contents--
 
 ```js
-function euler156() {
+function countingDigits() {
 
   return true;
 }
 
-euler156();
+countingDigits();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md
index fa1e3270516..aa5e8185547 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md
@@ -1,65 +1,30 @@
 ---
 id: 5900f4091000cf542c50ff1c
 title: 'Problem 157: Solving the diophantine equation'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301788
 dashedName: problem-157-solving-the-diophantine-equation
 ---
 
 # --description--
 
-Consider the diophantine equation 1/a+1/b= p/10n with a, b, p, n positive integers and a ≤ b.
+Consider the diophantine equation $\frac{1}{a} + \frac{1}{b} = \frac{p}{{10}^n}$ with $a$, $b$, $p$, $n$ positive integers and $a ≤ b$.
 
-For n=1 this equation has 20 solutions that are listed below:
+For $n = 1$ this equation has 20 solutions that are listed below:
 
-1/1+1/1=20/10
+$$\begin{array}{lllll} \frac{1}{1}  + \frac{1}{1}  = \frac{20}{10} & \frac{1}{1} + \frac{1}{2}  = \frac{15}{10} & \frac{1}{1}  + \frac{1}{5}  = \frac{12}{10} & \frac{1}{1} + \frac{1}{10} = \frac{11}{10} & \frac{1}{2}  + \frac{1}{2}  = \frac{10}{10} \\\\
+  \frac{1}{2}  + \frac{1}{5}  = \frac{7}{10}   & \frac{1}{2} + \frac{1}{10} = \frac{6}{10} & \frac{1}{3}  + \frac{1}{6}  = \frac{5}{10}   & \frac{1}{3} + \frac{1}{15} = \frac{4}{10} & \frac{1}{4}  + \frac{1}{4}  = \frac{5}{10} \\\\
+  \frac{1}{4}  + \frac{1}{4}  = \frac{5}{10}  & \frac{1}{5}  + \frac{1}{5}  = \frac{4}{10} & \frac{1}{5}  + \frac{1}{10} = \frac{3}{10}  & \frac{1}{6}  + \frac{1}{30} = \frac{2}{10} & \frac{1}{10} + \frac{1}{10} = \frac{2}{10} \\\\
+  \frac{1}{11} + \frac{1}{110} = \frac{1}{10} & \frac{1}{12} + \frac{1}{60}  = \frac{1}{10} & \frac{1}{14} + \frac{1}{35}  = \frac{1}{10} & \frac{1}{15} + \frac{1}{30}  = \frac{1}{10} & \frac{1}{20} + \frac{1}{20}  = \frac{1}{10} \end{array}$$
 
-1/1+1/2=15/10
-
-1/1+1/5=12/10
-
-1/1+1/10=11/10
-
-1/2+1/2=10/10
-
-1/2+1/5=7/10
-
-1/2+1/10=6/10
-
-1/3+1/6=5/10
-
-1/3+1/15=4/10
-
-1/4+1/4=5/10
-
-1/4+1/20=3/10
-
-1/5+1/5=4/10
-
-1/5+1/10=3/10
-
-1/6+1/30=2/10
-
-1/10+1/10=2/10
-
-1/11+1/110=1/10
-
-1/12+1/60=1/10
-
-1/14+1/35=1/10
-
-1/15+1/30=1/10
-
-1/20+1/20=1/10
-
-How many solutions has this equation for 1 ≤ n ≤ 9?
+How many solutions has this equation for $1 ≤ n ≤ 9$?
 
 # --hints--
 
-`euler157()` should return 53490.
+`diophantineEquation()` should return `53490`.
 
 ```js
-assert.strictEqual(euler157(), 53490);
+assert.strictEqual(diophantineEquation(), 53490);
 ```
 
 # --seed--
@@ -67,12 +32,12 @@ assert.strictEqual(euler157(), 53490);
 ## --seed-contents--
 
 ```js
-function euler157() {
+function diophantineEquation() {
 
   return true;
 }
 
-euler157();
+diophantineEquation();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md
index 6b979cb0d7f..845e2be3303 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md
@@ -2,7 +2,7 @@
 id: 5900f40a1000cf542c50ff1d
 title: >-
   Problem 158: Exploring strings for which only one character comes lexicographically after its neighbour to the left
-challengeType: 5
+challengeType: 1
 forumTopicId: 301789
 dashedName: >-
   problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left
@@ -20,18 +20,18 @@ For 'hat' there is exactly one character that comes lexicographically after its
 
 In all there are 10400 strings of length 3 for which exactly one character comes lexicographically after its neighbour to the left.
 
-We now consider strings of n ≤ 26 different characters from the alphabet.
+We now consider strings of $n ≤ 26$ different characters from the alphabet.
 
-For every n, p(n) is the number of strings of length n for which exactly one character comes lexicographically after its neighbour to the left.
+For every $n$, $p(n)$ is the number of strings of length $n$ for which exactly one character comes lexicographically after its neighbour to the left.
 
-What is the maximum value of p(n)?
+What is the maximum value of $p(n)$?
 
 # --hints--
 
-`euler158()` should return 409511334375.
+`lexicographicNeighbours()` should return `409511334375`.
 
 ```js
-assert.strictEqual(euler158(), 409511334375);
+assert.strictEqual(lexicographicNeighbours(), 409511334375);
 ```
 
 # --seed--
@@ -39,12 +39,12 @@ assert.strictEqual(euler158(), 409511334375);
 ## --seed-contents--
 
 ```js
-function euler158() {
+function lexicographicNeighbours() {
 
   return true;
 }
 
-euler158();
+lexicographicNeighbours();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md
index b5e3b4945bd..07a2e4945a4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f40c1000cf542c50ff1e
 title: 'Problem 159: Digital root sums of factorisations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301790
 dashedName: problem-159-digital-root-sums-of-factorisations
 ---
@@ -12,13 +12,32 @@ A composite number can be factored many different ways.
 
 For instance, not including multiplication by one, 24 can be factored in 7 distinct ways:
 
-24 = 2x2x2x3 24 = 2x3x4 24 = 2x2x6 24 = 4x6 24 = 3x8 24 = 2x12 24 = 24
+$$\begin{align}   & 24 = 2 \times 2 \times 2 \times 3\\\\
+  & 24 = 2 \times 3 \times 4  \\\\   & 24 = 2 \times 2 \times 6  \\\\
+  & 24 = 4 \times 6    \\\\   & 24 = 3 \times 8    \\\\
+  & 24 = 2 \times 12   \\\\ & 24 = 24 \end{align}$$
 
-Recall that the digital root of a number, in base 10, is found by adding together the digits of that number, and repeating that process until a number is arrived at that is less than 10. Thus the digital root of 467 is 8. We shall call a Digital Root Sum (DRS) the sum of the digital roots of the individual factors of our number. The chart below demonstrates all of the DRS values for 24. FactorisationDigital Root Sum2x2x2x3 92x3x4 92x2x6 104x6 103x8 112x12 524 6The maximum Digital Root Sum of 24 is 11. The function mdrs(n) gives the maximum Digital Root Sum of n. So mdrs(24)=11. Find ∑mdrs(n) for 1 &lt; n &lt; 1,000,000.
+Recall that the digital root of a number, in base 10, is found by adding together the digits of that number, and repeating that process until a number arrives at less than 10. Thus the digital root of 467 is 8.
+
+We shall call a Digital Root Sum (DRS) the sum of the digital roots of the individual factors of our number. The chart below demonstrates all of the DRS values for 24.
+
+| Factorisation | Digital Root Sum |
+| ------------- | ---------------- |
+| 2x2x2x3       | 9                |
+| 2x3x4         | 9                |
+| 2x2x6         | 10               |
+| 4x6           | 10               |
+| 3x8           | 11               |
+| 2x12          | 5                |
+| 24            | 6                |
+
+The maximum Digital Root Sum of 24 is 11. The function $mdrs(n)$ gives the maximum Digital Root Sum of $n$. So $mdrs(24) = 11$.
+
+Find $\sum{mdrs(n)}$ for $1 &lt; n &lt; 1,000,000$.
 
 # --hints--
 
-`euler159()` should return 14489159.
+`euler159()` should return `14489159`.
 
 ```js
 assert.strictEqual(euler159(), 14489159);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-16-power-digit-sum.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-16-power-digit-sum.md
index b71b4800826..8ef1c137f88 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-16-power-digit-sum.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-16-power-digit-sum.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f37d1000cf542c50fe8f
 title: 'Problem 16: Power digit sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301791
 dashedName: problem-16-power-digit-sum
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md
index c7319ba84c3..19650118cac 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md
@@ -1,31 +1,28 @@
 ---
 id: 5900f40d1000cf542c50ff1f
-title: 'Problem 160: Factorial trailing digits'
-challengeType: 5
+title: '问题 160：因子尾随数字'
+challengeType: 1
 forumTopicId: 301794
 dashedName: problem-160-factorial-trailing-digits
 ---
 
 # --description--
 
-For any N, let f(N) be the last five digits before the trailing zeroes in N!.
+For any $N$, let $f(N)$ be the last five digits before the trailing zeroes in $N!$.
 
-For example,
+例如，
 
-9! = 362880 so f(9)=36288
+$$\begin{align}   & 9! = 362880 \\; \text{so} \\; f(9) = 36288 \\\\
+  & 10! = 3628800 \\; \text{so} \\; f(10) = 36288 \\\\ & 20! = 2432902008176640000 \\; \text{so} \\; f(20) = 17664 \end{align}$$
 
-10! = 3628800 so f(10)=36288
-
-20! = 2432902008176640000 so f(20)=17664
-
-Find f(1,000,000,000,000)
+Find $f(1,000,000,000,000)$
 
 # --hints--
 
-`euler160()` should return 16576.
+`factorialTrailingDigits()` should return `16576`.
 
 ```js
-assert.strictEqual(euler160(), 16576);
+assert.strictEqual(factorialTrailingDigits(), 16576);
 ```
 
 # --seed--
@@ -33,12 +30,12 @@ assert.strictEqual(euler160(), 16576);
 ## --seed-contents--
 
 ```js
-function euler160() {
+function factorialTrailingDigits() {
 
   return true;
 }
 
-euler160();
+factorialTrailingDigits();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-161-triominoes.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-161-triominoes.md
index ea369bae60d..8e0a070c788 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-161-triominoes.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-161-triominoes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f40d1000cf542c50ff20
 title: 'Problem 161: Triominoes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301795
 dashedName: problem-161-triominoes
 ---
@@ -12,18 +12,24 @@ A triomino is a shape consisting of three squares joined via the edges.
 
 There are two basic forms:
 
+<img class="img-responsive center-block" alt="two basic triominoes forms" src="https://cdn.freecodecamp.org/curriculum/project-euler/triominoes-1.gif" style="background-color: white; padding: 10px;" />
+
 If all possible orientations are taken into account there are six:
 
+<img class="img-responsive center-block" alt="triominoes forms including orientation" src="https://cdn.freecodecamp.org/curriculum/project-euler/triominoes-2.gif" style="background-color: white; padding: 10px;" />
+
 Any n by m grid for which nxm is divisible by 3 can be tiled with triominoes. If we consider tilings that can be obtained by reflection or rotation from another tiling as different there are 41 ways a 2 by 9 grid can be tiled with triominoes:
 
+<img class="img-responsive center-block" alt="animation showing 41 ways of filling 2x9 grid with triominoes" src="https://cdn.freecodecamp.org/curriculum/project-euler/triominoes-3.gif" style="background-color: white; padding: 10px;" />
+
 In how many ways can a 9 by 12 grid be tiled in this way by triominoes?
 
 # --hints--
 
-`euler161()` should return 20574308184277972.
+`triominoes()` should return `20574308184277972`.
 
 ```js
-assert.strictEqual(euler161(), 20574308184277972);
+assert.strictEqual(triominoes(), 20574308184277972);
 ```
 
 # --seed--
@@ -31,12 +37,12 @@ assert.strictEqual(euler161(), 20574308184277972);
 ## --seed-contents--
 
 ```js
-function euler161() {
+function triominoes() {
 
   return true;
 }
 
-euler161();
+triominoes();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.md
index 53a6bcd7722..9ad940349fe 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f40e1000cf542c50ff21
 title: 'Problem 162: Hexadecimal numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301796
 dashedName: problem-162-hexadecimal-numbers
 ---
@@ -10,9 +10,9 @@ dashedName: problem-162-hexadecimal-numbers
 
 In the hexadecimal number system numbers are represented using 16 different digits:
 
-0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F
+$$0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F$$
 
-The hexadecimal number AF when written in the decimal number system equals 10x16+15=175.
+The hexadecimal number AF when written in the decimal number system equals $10 \times 16 + 15 = 175$.
 
 In the 3-digit hexadecimal numbers 10A, 1A0, A10, and A01 the digits 0,1 and A are all present.
 
@@ -20,16 +20,22 @@ Like numbers written in base ten we write hexadecimal numbers without leading ze
 
 How many hexadecimal numbers containing at most sixteen hexadecimal digits exist with all of the digits 0,1, and A present at least once?
 
-Give your answer as a hexadecimal number.
+Give your answer with hexadecimal number as a string.
 
-(A,B,C,D,E and F in upper case, without any leading or trailing code that marks the number as hexadecimal and without leading zeroes , e.g. 1A3F and not: 1a3f and not 0x1a3f and not $1A3F and not #1A3F and not 0000001A3F)
+**Note:** (A,B,C,D,E and F in upper case, without any leading or trailing code that marks the number as hexadecimal and without leading zeroes , e.g. 1A3F and not: 1a3f and not 0x1a3f and not $1A3F and not #1A3F and not 0000001A3F)
 
 # --hints--
 
-`euler162()` should return 3D58725572C62302.
+`hexadecimalNumbers()` should return a string.
 
 ```js
-assert.strictEqual(euler162(), '3D58725572C62302');
+assert(typeof hexadecimalNumbers() === 'string');
+```
+
+`hexadecimalNumbers()` should return the string `3D58725572C62302`.
+
+```js
+assert.strictEqual(hexadecimalNumbers(), '3D58725572C62302');
 ```
 
 # --seed--
@@ -37,12 +43,12 @@ assert.strictEqual(euler162(), '3D58725572C62302');
 ## --seed-contents--
 
 ```js
-function euler162() {
+function hexadecimalNumbers() {
 
   return true;
 }
 
-euler162();
+hexadecimalNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md
index 72ed1158b19..e5fa50fb8e9 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f40f1000cf542c50ff22
 title: 'Problem 163: Cross-hatched triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301797
 dashedName: problem-163-cross-hatched-triangles
 ---
@@ -10,14 +10,25 @@ dashedName: problem-163-cross-hatched-triangles
 
 Consider an equilateral triangle in which straight lines are drawn from each vertex to the middle of the opposite side, such as in the size 1 triangle in the sketch below.
 
-Sixteen triangles of either different shape or size or orientation or location can now be observed in that triangle. Using size 1 triangles as building blocks, larger triangles can be formed, such as the size 2 triangle in the above sketch. One-hundred and four triangles of either different shape or size or orientation or location can now be observed in that size 2 triangle. It can be observed that the size 2 triangle contains 4 size 1 triangle building blocks. A size 3 triangle would contain 9 size 1 triangle building blocks and a size n triangle would thus contain n2 size 1 triangle building blocks. If we denote T(n) as the number of triangles present in a triangle of size n, then T(1) = 16 T(2) = 104 Find T(36).
+<img class="img-responsive center-block" alt="triangles with size 1 and size 2" src="https://cdn.freecodecamp.org/curriculum/project-euler/cross-hatched-triangles.gif" style="background-color: white; padding: 10px;" />
+
+Sixteen triangles of either different shape or size or orientation or location can now be observed in that triangle. Using size 1 triangles as building blocks, larger triangles can be formed, such as the size 2 triangle in the above sketch. One-hundred and four triangles of either different shape or size or orientation or location can now be observed in that size 2 triangle.
+
+It can be observed that the size 2 triangle contains 4 size 1 triangle building blocks. A size 3 triangle would contain 9 size 1 triangle building blocks and a size $n$ triangle would thus contain $n^2$ size 1 triangle building blocks.
+
+If we denote $T(n)$ as the number of triangles present in a triangle of size $n$, then
+
+$$\begin{align}   & T(1) = 16 \\\\
+  & T(2) = 104 \end{align}$$
+
+Find $T(36)$.
 
 # --hints--
 
-`euler163()` should return 343047.
+`crossHatchedTriangles()` should return `343047`.
 
 ```js
-assert.strictEqual(euler163(), 343047);
+assert.strictEqual(crossHatchedTriangles(), 343047);
 ```
 
 # --seed--
@@ -25,12 +36,12 @@ assert.strictEqual(euler163(), 343047);
 ## --seed-contents--
 
 ```js
-function euler163() {
+function crossHatchedTriangles() {
 
   return true;
 }
 
-euler163();
+crossHatchedTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md
index 8082f00bff3..83215f99ba4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md
@@ -2,7 +2,7 @@
 id: 5900f4111000cf542c50ff23
 title: >-
   Problem 164: Numbers for which no three consecutive digits have a sum greater than a given value
-challengeType: 5
+challengeType: 1
 forumTopicId: 301798
 dashedName: >-
   problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value
@@ -10,14 +10,14 @@ dashedName: >-
 
 # --description--
 
-How many 20 digit numbers n (without any leading zero) exist such that no three consecutive digits of n have a sum greater than 9?
+How many 20 digit numbers $n$ (without any leading zero) exist such that no three consecutive digits of $n$ have a sum greater than 9?
 
 # --hints--
 
-`euler164()` should return 378158756814587.
+`consecutiveDigitsSum()` should return `378158756814587`.
 
 ```js
-assert.strictEqual(euler164(), 378158756814587);
+assert.strictEqual(consecutiveDigitsSum(), 378158756814587);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler164(), 378158756814587);
 ## --seed-contents--
 
 ```js
-function euler164() {
+function consecutiveDigitsSum() {
 
   return true;
 }
 
-euler164();
+consecutiveDigitsSum();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-165-intersections.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-165-intersections.md
index a98373c3384..04fef3d3e53 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-165-intersections.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-165-intersections.md
@@ -1,29 +1,47 @@
 ---
 id: 5900f4111000cf542c50ff24
 title: 'Problem 165: Intersections'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301799
 dashedName: problem-165-intersections
 ---
 
 # --description--
 
-A segment is uniquely defined by its two endpoints. By considering two line segments in plane geometry there are three possibilities:
-
-the segments have zero points, one point, or infinitely many points in common.
+A segment is uniquely defined by its two endpoints. By considering two line segments in plane geometry there are three possibilities: the segments have zero points, one point, or infinitely many points in common.
 
 Moreover when two segments have exactly one point in common it might be the case that that common point is an endpoint of either one of the segments or of both. If a common point of two segments is not an endpoint of either of the segments it is an interior point of both segments.
 
-We will call a common point T of two segments L1 and L2 a true intersection point of L1 and L2 if T is the only common point of L1 and L2 and T is an interior point of both segments.
+We will call a common point $T$ of two segments $L_1$ and $L_2$ a true intersection point of $L_1$ and $L_2$ if $T$ is the only common point of $L_1$ and $L_2$ and $T$ is an interior point of both segments.
 
-Consider the three segments L1, L2, and L3: L1: (27, 44) to (12, 32) L2: (46, 53) to (17, 62) L3: (46, 70) to (22, 40) It can be verified that line segments L2 and L3 have a true intersection point. We note that as the one of the end points of L3: (22,40) lies on L1 this is not considered to be a true point of intersection. L1 and L2 have no common point. So among the three line segments, we find one true intersection point. Now let us do the same for 5000 line segments. To this end, we generate 20000 numbers using the so-called "Blum Blum Shub" pseudo-random number generator. s0 = 290797 sn+1 = sn×sn (modulo 50515093) tn = sn (modulo 500) To create each line segment, we use four consecutive numbers tn. That is, the first line segment is given by: (t1, t2) to (t3, t4) The first four numbers computed according to the above generator should be: 27, 144, 12 and 232. The first segment would thus be (27,144) to (12,232). How many distinct true intersection points are found among the 5000 line segments?
+Consider the three segments $L_1$, $L_2$, and $L_3$:
+
+$$\begin{align}   & L_1: (27, 44) \\;\text{to}\\; (12, 32) \\\\
+  & L_2: (46, 53) \\;\text{to}\\; (17, 62) \\\\   & L_3: (46, 70) \\;\text{to}\\; (22, 40) \\\\
+\end{align}$$
+
+It can be verified that line segments $L_2$ and $L_3$ have a true intersection point. We note that as the one of the end points of $L_3$: (22, 40) lies on $L_1$ this is not considered to be a true point of intersection. $L_1$ and $L_2$ have no common point. So among the three line segments, we find one true intersection point.
+
+Now let us do the same for 5000 line segments. To this end, we generate 20000 numbers using the so-called "Blum Blum Shub" pseudo-random number generator.
+
+$$\begin{align}   & s_0 = 290797 \\\\
+  & s_{n + 1} = s_n × s_n (\text{modulo}\\; 50515093) \\\\   & t_n = s_n (\text{modulo}\\; 500) \\\\
+\end{align}$$
+
+To create each line segment, we use four consecutive numbers $t_n$. That is, the first line segment is given by:
+
+($_t$1, $t_2$) to ($t_3$, $t_4$)
+
+The first four numbers computed according to the above generator should be: 27, 144, 12 and 232. The first segment would thus be (27, 144) to (12, 232).
+
+How many distinct true intersection points are found among the 5000 line segments?
 
 # --hints--
 
-`euler165()` should return 2868868.
+`distinctIntersections()` should return `2868868`.
 
 ```js
-assert.strictEqual(euler165(), 2868868);
+assert.strictEqual(distinctIntersections(), 2868868);
 ```
 
 # --seed--
@@ -31,12 +49,12 @@ assert.strictEqual(euler165(), 2868868);
 ## --seed-contents--
 
 ```js
-function euler165() {
+function distinctIntersections() {
 
   return true;
 }
 
-euler165();
+distinctIntersections();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-166-criss-cross.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-166-criss-cross.md
index 9f1db5cea49..f413a225835 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-166-criss-cross.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-166-criss-cross.md
@@ -1,29 +1,31 @@
 ---
 id: 5900f4131000cf542c50ff25
 title: 'Problem 166: Criss Cross'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301800
 dashedName: problem-166-criss-cross
 ---
 
 # --description--
 
-A 4x4 grid is filled with digits d, 0 ≤ d ≤ 9.
+A 4x4 grid is filled with digits $d$, $0 ≤ d ≤ 9$.
 
 It can be seen that in the grid
 
-6 3 3 0 5 0 4 3 0 7 1 4 1 2 4 5
+$$\begin{array}{}   6 & 3 & 3 & 0 \\\\
+  5 & 0 & 4 & 3 \\\\   0 & 7 & 1 & 4 \\\\
+  1 & 2 & 4 & 5 \end{array}$$
 
 the sum of each row and each column has the value 12. Moreover the sum of each diagonal is also 12.
 
-In how many ways can you fill a 4x4 grid with the digits d, 0 ≤ d ≤ 9 so that each row, each column, and both diagonals have the same sum?
+In how many ways can you fill a 4x4 grid with the digits $d$, $0 ≤ d ≤ 9$ so that each row, each column, and both diagonals have the same sum?
 
 # --hints--
 
-`euler166()` should return 7130034.
+`crissCross()` should return `7130034`.
 
 ```js
-assert.strictEqual(euler166(), 7130034);
+assert.strictEqual(crissCross(), 7130034);
 ```
 
 # --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler166(), 7130034);
 ## --seed-contents--
 
 ```js
-function euler166() {
+function crissCross() {
 
   return true;
 }
 
-euler166();
+crissCross();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.md
index 6f30b4b2729..37f3fd53c28 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.md
@@ -1,31 +1,29 @@
 ---
 id: 5900f4141000cf542c50ff26
 title: 'Problem 167: Investigating Ulam sequences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301801
 dashedName: problem-167-investigating-ulam-sequences
 ---
 
 # --description--
 
-For two positive integers a and b, the Ulam sequence U(a,b) is defined by U(a,b)1 = a, U(a,b)2 = b and for k > 2,
+For two positive integers $a$ and $b$, the Ulam sequence $U(a,b)$ is defined by ${U{(a,b)}\_1} = a$, ${U{(a,b)}\_2} = b$ and for $k > 2$, ${U{(a,b)}\_k}$ is the smallest integer greater than ${U{(a,b)}\_{(k-1)}}$ which can be written in exactly one way as the sum of two distinct previous members of $U(a,b)$.
 
-U(a,b)k is the smallest integer greater than U(a,b)(k-1) which can be written in exactly one way as the sum of two distinct previous members of U(a,b).
+For example, the sequence $U(1,2)$ begins with
 
-For example, the sequence U(1,2) begins with
+$$1, 2, 3 = 1 + 2, 4 = 1 + 3, 6 = 2 + 4, 8 = 2 + 6, 11 = 3 + 8$$
 
-1, 2, 3 = 1 + 2, 4 = 1 + 3, 6 = 2 + 4, 8 = 2 + 6, 11 = 3 + 8;
+5 does not belong to it because $5 = 1 + 4 = 2 + 3$ has two representations as the sum of two previous members, likewise $7 = 1 + 6 = 3 + 4$.
 
-5 does not belong to it because 5 = 1 + 4 = 2 + 3 has two representations as the sum of two previous members, likewise 7 = 1 + 6 = 3 + 4.
-
-Find ∑U(2,2n+1)k for 2 ≤ n ≤10, where k = 1011.
+Find $\sum {U(2, 2n + 1)_k}$ for $2 ≤ n ≤ 10$, where $k = {10}^{11}$.
 
 # --hints--
 
-`euler167()` should return 3916160068885.
+`ulamSequences()` should return `3916160068885`.
 
 ```js
-assert.strictEqual(euler167(), 3916160068885);
+assert.strictEqual(ulamSequences(), 3916160068885);
 ```
 
 # --seed--
@@ -33,12 +31,12 @@ assert.strictEqual(euler167(), 3916160068885);
 ## --seed-contents--
 
 ```js
-function euler167() {
+function ulamSequences() {
 
   return true;
 }
 
-euler167();
+ulamSequences();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-168-number-rotations.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-168-number-rotations.md
index 9ad5f78e64d..50802415375 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-168-number-rotations.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-168-number-rotations.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4151000cf542c50ff27
 title: 'Problem 168: Number Rotations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301802
 dashedName: problem-168-number-rotations
 ---
@@ -10,18 +10,24 @@ dashedName: problem-168-number-rotations
 
 Consider the number 142857. We can right-rotate this number by moving the last digit (7) to the front of it, giving us 714285.
 
-It can be verified that 714285=5×142857.
+It can be verified that $714285 = 5 × 142857$.
 
 This demonstrates an unusual property of 142857: it is a divisor of its right-rotation.
 
-Find the last 5 digits of the sum of all integers n, 10 &lt; n &lt; 10100, that have this property.
+For integer number of digits $a$ and $b$, find the last 5 digits of the sum of all integers $n$, $10^a &lt; n &lt; 10^b$, that have this property.
 
 # --hints--
 
-`euler168()` should return 59206.
+`numberRotations(2, 10)` should return `98311`.
 
 ```js
-assert.strictEqual(euler168(), 59206);
+assert.strictEqual(numberRotations(2, 10), 98311);
+```
+
+`numberRotations(2, 100)` should return `59206`.
+
+```js
+assert.strictEqual(numberRotations(2, 100), 59206);
 ```
 
 # --seed--
@@ -29,16 +35,48 @@ assert.strictEqual(euler168(), 59206);
 ## --seed-contents--
 
 ```js
-function euler168() {
+function numberRotations(a, b) {
 
-  return true;
+  return 0;
 }
 
-euler168();
+numberRotations();
 ```
 
 # --solutions--
 
 ```js
-// solution required
+function numberRotations(minDigits, maxDigits) {
+  const DIGITS_TO_KEEP = 100000n;
+  const powersOfTen = Array(maxDigits).fill(0);
+  powersOfTen[0] = 1n;
+  for (let i = 1; i < maxDigits; i++) {
+    powersOfTen[i] = powersOfTen[i - 1] * 10n;
+  }
+
+  // We want numbers of the form xd * m = dx
+  // Or more precisely:
+  //   (x * 10 + d) * m = d*10^(n-1) + x
+  // Solving for x:
+  //   x = d (10^(n-1) - m) / (10 * m - 1)
+  let total = 0n;
+  for (let numDigits = minDigits; numDigits <= maxDigits; numDigits++) {
+    // Check all multiplier - digit pairs to see if a candidate can be built
+    //  with the correct number of digits
+    for (let multiplier = 1n; multiplier < 10n; multiplier++) {
+      for (let lastDigit = 1n; lastDigit < 10n; lastDigit++) {
+        const numerator   = lastDigit * (powersOfTen[numDigits - 1] - multiplier);
+        const denominator = (powersOfTen[1] * multiplier - 1n);
+        if (numerator % denominator === 0n) {
+          const candidate = (numerator / denominator) * 10n + lastDigit;
+          if (candidate.toString().length === numDigits) {
+            total = (total + candidate) % DIGITS_TO_KEEP;
+          }
+        }
+      }
+    }
+  }
+
+  return parseInt(total);
+}
 ```
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
index e0bf8ea804d..52005157a98 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
@@ -2,7 +2,7 @@
 id: 5900f4151000cf542c50ff28
 title: >-
   Problem 169: Exploring the number of different ways a number can be expressed as a sum of powers of 2
-challengeType: 5
+challengeType: 1
 forumTopicId: 301803
 dashedName: >-
   problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2
@@ -10,26 +10,22 @@ dashedName: >-
 
 # --description--
 
-Define f(0)=1 and f(n) to be the number of different ways n can be expressed as a sum of integer powers of 2 using each power no more than twice.
+Define $f(0)=1$ and $f(n)$ to be the number of different ways $n$ can be expressed as a sum of integer powers of 2 using each power no more than twice.
 
-For example, f(10)=5 since there are five different ways to express 10:
+For example, $f(10)=5$ since there are five different ways to express 10:
 
-1 + 1 + 8
+$$\begin{align}   & 1 + 1 + 8 \\\\
+  & 1 + 1 + 4 + 4 \\\\   & 1 + 1 + 2 + 2 + 4 \\\\
+  & 2 + 4 + 4 \\\\ & 2 + 8 \end{align}$$
 
-1 + 1 + 4 + 41 + 1 + 2 + 2 + 4
-
-2 + 4 + 4
-
-2 + 8
-
-What is f(1025)?
+What is $f({10}^{25})$?
 
 # --hints--
 
-`euler169()` should return 178653872807.
+`numberOfWaysToExpress()` should return `178653872807`.
 
 ```js
-assert.strictEqual(euler169(), 178653872807);
+assert.strictEqual(numberOfWaysToExpress(), 178653872807);
 ```
 
 # --seed--
@@ -37,12 +33,12 @@ assert.strictEqual(euler169(), 178653872807);
 ## --seed-contents--
 
 ```js
-function euler169() {
+function numberOfWaysToExpress() {
 
   return true;
 }
 
-euler169();
+numberOfWaysToExpress();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-17-number-letter-counts.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-17-number-letter-counts.md
index 2b096d1d78b..026f72a3f46 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-17-number-letter-counts.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-17-number-letter-counts.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f37d1000cf542c50fe90
 title: 'Problem 17: Number letter counts'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301804
 dashedName: problem-17-number-letter-counts
 ---
@@ -28,13 +28,13 @@ assert(typeof numberLetterCounts(5) === 'number');
 assert.strictEqual(numberLetterCounts(5), 19);
 ```
 
-`numberLetterCounts(150)` should return 1903.
+`numberLetterCounts(150)` 应该返回 1903。
 
 ```js
 assert.strictEqual(numberLetterCounts(150), 1903);
 ```
 
-`numberLetterCounts(1000)` should return 21124.
+`numberLetterCounts(1000)` 应该返回 21124。
 
 ```js
 assert.strictEqual(numberLetterCounts(1000), 21124);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md
index 7a7e20558b5..b6886e18764 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md
@@ -2,7 +2,7 @@
 id: 5900f4161000cf542c50ff29
 title: >-
   Problem 170: Find the largest 0 to 9 pandigital that can be formed by concatenating products
-challengeType: 5
+challengeType: 1
 forumTopicId: 301805
 dashedName: >-
   problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products
@@ -12,9 +12,10 @@ dashedName: >-
 
 Take the number 6 and multiply it by each of 1273 and 9854:
 
-6 × 1273 = 7638 6 × 9854 = 59124
+$$\begin{align}   & 6 × 1273 = 7638 \\\\
+  & 6 × 9854 = 59124 \\\\ \end{align}$$
 
-By concatenating these products we get the 1 to 9 pandigital 763859124. We will call 763859124 the "concatenated product of 6 and (1273,9854)". Notice too, that the concatenation of the input numbers, 612739854, is also 1 to 9 pandigital.
+By concatenating these products we get the 1 to 9 pandigital 763859124. We will call 763859124 the "concatenated product of 6 and (1273, 9854)". Notice too, that the concatenation of the input numbers, 612739854, is also 1 to 9 pandigital.
 
 The same can be done for 0 to 9 pandigital numbers.
 
@@ -22,10 +23,10 @@ What is the largest 0 to 9 pandigital 10-digit concatenated product of an intege
 
 # --hints--
 
-`euler170()` should return 9857164023.
+`largestPandigital()` should return `9857164023`.
 
 ```js
-assert.strictEqual(euler170(), 9857164023);
+assert.strictEqual(largestPandigital(), 9857164023);
 ```
 
 # --seed--
@@ -33,12 +34,12 @@ assert.strictEqual(euler170(), 9857164023);
 ## --seed-contents--
 
 ```js
-function euler170() {
+function largestPandigital() {
 
   return true;
 }
 
-euler170();
+largestPandigital();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md
index 2b355e111f4..60133bf2e51 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md
@@ -2,7 +2,7 @@
 id: 5900f4181000cf542c50ff2a
 title: >-
   Problem 171: Finding numbers for which the sum of the squares of the digits is a square
-challengeType: 5
+challengeType: 1
 forumTopicId: 301806
 dashedName: >-
   problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square
@@ -10,22 +10,20 @@ dashedName: >-
 
 # --description--
 
-For a positive integer n, let f(n) be the sum of the squares of the digits (in base 10) of n, e.g.
+For a positive integer $n$, let $f(n)$ be the sum of the squares of the digits (in base 10) of $n$, e.g.
 
-f(3) = 32 = 9,
+$$\begin{align}   & f(3) = 3^2 = 9 \\\\
+  & f(25) = 2^2 + 5^2 = 4 + 25 = 29 \\\\   & f(442) = 4^2 + 4^2 + 2^2 = 16 + 16 + 4 = 36 \\\\
+\end{align}$$
 
-f(25) = 22 + 52 = 4 + 25 = 29,
-
-f(442) = 42 + 42 + 22 = 16 + 16 + 4 = 36
-
-Find the last nine digits of the sum of all n, 0 &lt; n &lt; 1020, such that f(n) is a perfect square.
+Find the last nine digits of the sum of all $n$, $0 &lt; n &lt; {10}^{20}$, such that $f(n)$ is a perfect square.
 
 # --hints--
 
-`euler171()` should return 142989277.
+`lastDigitsSumOfPerfectSquare()` should return `142989277`.
 
 ```js
-assert.strictEqual(euler171(), 142989277);
+assert.strictEqual(lastDigitsSumOfPerfectSquare(), 142989277);
 ```
 
 # --seed--
@@ -33,12 +31,12 @@ assert.strictEqual(euler171(), 142989277);
 ## --seed-contents--
 
 ```js
-function euler171() {
+function lastDigitsSumOfPerfectSquare() {
 
   return true;
 }
 
-euler171();
+lastDigitsSumOfPerfectSquare();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.md
index a25ab3224fd..cfc75b9ff19 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.md
@@ -1,21 +1,21 @@
 ---
 id: 5900f4181000cf542c50ff2b
 title: 'Problem 172: Investigating numbers with few repeated digits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301807
 dashedName: problem-172-investigating-numbers-with-few-repeated-digits
 ---
 
 # --description--
 
-How many 18-digit numbers n (without leading zeros) are there such that no digit occurs more than three times in n?
+How many 18-digit numbers $n$ (without leading zeros) are there such that no digit occurs more than three times in $n$?
 
 # --hints--
 
-`euler172()` should return 227485267000992000.
+`numbersWithRepeatedDigits()` should return `227485267000992000`.
 
 ```js
-assert.strictEqual(euler172(), 227485267000992000);
+assert.strictEqual(numbersWithRepeatedDigits(), 227485267000992000);
 ```
 
 # --seed--
@@ -23,12 +23,12 @@ assert.strictEqual(euler172(), 227485267000992000);
 ## --seed-contents--
 
 ```js
-function euler172() {
+function numbersWithRepeatedDigits() {
 
   return true;
 }
 
-euler172();
+numbersWithRepeatedDigits();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md
index 700b710e805..0488d662943 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md
@@ -2,7 +2,7 @@
 id: 5900f41a1000cf542c50ff2c
 title: >-
   Problem 173: Using up to one million tiles how many different "hollow" square laminae can be formed?
-challengeType: 5
+challengeType: 1
 forumTopicId: 301808
 dashedName: >-
   problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed
@@ -12,14 +12,16 @@ dashedName: >-
 
 We shall define a square lamina to be a square outline with a square "hole" so that the shape possesses vertical and horizontal symmetry. For example, using exactly thirty-two square tiles we can form two different square laminae:
 
+<img class="img-responsive center-block" alt="two square lamina with holes 2x2 and 7x7" src="https://cdn.freecodecamp.org/curriculum/project-euler/using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.gif" style="background-color: white; padding: 10px;" />
+
 With one-hundred tiles, and not necessarily using all of the tiles at one time, it is possible to form forty-one different square laminae. Using up to one million tiles how many different square laminae can be formed?
 
 # --hints--
 
-`euler173()` should return 1572729.
+`differentHollowSquareLaminae()` should return `1572729`.
 
 ```js
-assert.strictEqual(euler173(), 1572729);
+assert.strictEqual(differentHollowSquareLaminae(), 1572729);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler173(), 1572729);
 ## --seed-contents--
 
 ```js
-function euler173() {
+function differentHollowSquareLaminae() {
 
   return true;
 }
 
-euler173();
+differentHollowSquareLaminae();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md
index 13277919381..48843b6b0a9 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md
@@ -2,7 +2,7 @@
 id: 5900f41a1000cf542c50ff2d
 title: >-
   Problem 174: Counting the number of "hollow" square laminae that can form one, two, three, ... distinct arrangements
-challengeType: 5
+challengeType: 1
 forumTopicId: 301809
 dashedName: >-
   problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-----distinct-arrangements
@@ -14,14 +14,20 @@ We shall define a square lamina to be a square outline with a square "hole" so t
 
 Given eight tiles it is possible to form a lamina in only one way: 3x3 square with a 1x1 hole in the middle. However, using thirty-two tiles it is possible to form two distinct laminae.
 
-If t represents the number of tiles used, we shall say that t = 8 is type L(1) and t = 32 is type L(2). Let N(n) be the number of t ≤ 1000000 such that t is type L(n); for example, N(15) = 832. What is ∑ N(n) for 1 ≤ n ≤ 10?
+<img class="img-responsive center-block" alt="two square lamina with holes 2x2 and 7x7" src="https://cdn.freecodecamp.org/curriculum/project-euler/using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.gif" style="background-color: white; padding: 10px;" />
+
+If $t$ represents the number of tiles used, we shall say that $t = 8$ is type $L(1)$ and $t = 32$ is type $L(2)$.
+
+Let $N(n)$ be the number of $t ≤ 1000000$ such that $t$ is type $L(n)$; for example, $N(15) = 832$.
+
+What is $\sum N(n)$ for $1 ≤ n ≤ 10$?
 
 # --hints--
 
-`euler174()` should return 209566.
+`hollowSquareLaminaeDistinctArrangements()` should return `209566`.
 
 ```js
-assert.strictEqual(euler174(), 209566);
+assert.strictEqual(hollowSquareLaminaeDistinctArrangements(), 209566);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler174(), 209566);
 ## --seed-contents--
 
 ```js
-function euler174() {
+function hollowSquareLaminaeDistinctArrangements() {
 
   return true;
 }
 
-euler174();
+hollowSquareLaminaeDistinctArrangements();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
index cd3abbf807a..b3419c34823 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
@@ -2,7 +2,7 @@
 id: 5900f41c1000cf542c50ff2e
 title: >-
   Problem 175: Fractions involving the number of different ways a number can be expressed as a sum of powers of 2
-challengeType: 5
+challengeType: 1
 forumTopicId: 301810
 dashedName: >-
   problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2
@@ -10,18 +10,36 @@ dashedName: >-
 
 # --description--
 
-Define f(0)=1 and f(n) to be the number of ways to write n as a sum of powers of 2 where no power occurs more than twice.
+Define $f(0) = 1$ and $f(n)$ to be the number of ways to write $n$ as a sum of powers of 2 where no power occurs more than twice.
 
-For example, f(10)=5 since there are five different ways to express 10:10 = 8+2 = 8+1+1 = 4+4+2 = 4+2+2+1+1 = 4+4+1+1
+For example, $f(10) = 5$ since there are five different ways to express 10:
 
-It can be shown that for every fraction p/q (p>0, q>0) there exists at least one integer n such that f(n)/f(n-1)=p/q. For instance, the smallest n for which f(n)/f(n-1)=13/17 is 241. The binary expansion of 241 is 11110001. Reading this binary number from the most significant bit to the least significant bit there are 4 one's, 3 zeroes and 1 one. We shall call the string 4,3,1 the Shortened Binary Expansion of 241. Find the Shortened Binary Expansion of the smallest n for which f(n)/f(n-1)=123456789/987654321. Give your answer as comma separated integers, without any whitespaces.
+$$10 = 8 + 2 = 8 + 1 + 1 = 4 + 4 + 2 = 4 + 2 + 2 + 1 + 1 = 4 + 4 + 1 + 1$$
+
+It can be shown that for every fraction $\frac{p}{q}\\; (p>0, q>0)$ there exists at least one integer $n$ such that $\frac{f(n)}{f(n - 1)} = \frac{p}{q}$.
+
+For instance, the smallest $n$ for which $\frac{f(n)}{f(n - 1)} = \frac{13}{17}$ is 241. The binary expansion of 241 is 11110001.
+
+Reading this binary number from the most significant bit to the least significant bit there are 4 one's, 3 zeroes and 1 one. We shall call the string 4,3,1 the Shortened Binary Expansion of 241.
+
+Find the Shortened Binary Expansion of the smallest $n$ for which
+
+$$\frac{f(n)}{f(n - 1)} = \frac{123456789}{987654321}$$
+
+Give your answer as a string with comma separated integers, without any whitespaces.
 
 # --hints--
 
-`euler175()` should return 1, 13717420, 8.
+`shortenedBinaryExpansionOfNumber()` should return a string.
 
 ```js
-assert.strictEqual(euler175(), 1, 13717420, 8);
+assert(typeof shortenedBinaryExpansionOfNumber() === 'string');
+```
+
+`shortenedBinaryExpansionOfNumber()` should return the string `1,13717420,8`.
+
+```js
+assert.strictEqual(shortenedBinaryExpansionOfNumber(), '1,13717420,8');
 ```
 
 # --seed--
@@ -29,12 +47,12 @@ assert.strictEqual(euler175(), 1, 13717420, 8);
 ## --seed-contents--
 
 ```js
-function euler175() {
+function shortenedBinaryExpansionOfNumber() {
 
   return true;
 }
 
-euler175();
+shortenedBinaryExpansionOfNumber();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.md
index c3b6c090fed..01056496296 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f41c1000cf542c50ff2f
 title: 'Problem 176: Right-angled triangles that share a cathetus'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301811
 dashedName: problem-176-right-angled-triangles-that-share-a-cathetus
 ---
@@ -14,10 +14,10 @@ Find the smallest integer that can be the length of a cathetus of exactly 47547
 
 # --hints--
 
-`euler176()` should return 96818198400000.
+`trianglesSharingCathetus()` should return `96818198400000`.
 
 ```js
-assert.strictEqual(euler176(), 96818198400000);
+assert.strictEqual(trianglesSharingCathetus(), 96818198400000);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler176(), 96818198400000);
 ## --seed-contents--
 
 ```js
-function euler176() {
+function trianglesSharingCathetus() {
 
   return true;
 }
 
-euler176();
+trianglesSharingCathetus();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md
index 2e391146546..c6f7b8ee5c4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f41e1000cf542c50ff30
 title: 'Problem 177: Integer angled Quadrilaterals'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301812
 dashedName: problem-177-integer-angled-quadrilaterals
 ---
@@ -10,14 +10,22 @@ dashedName: problem-177-integer-angled-quadrilaterals
 
 Let ABCD be a convex quadrilateral, with diagonals AC and BD. At each vertex the diagonal makes an angle with each of the two sides, creating eight corner angles.
 
-For example, at vertex A, the two angles are CAD, CAB. We call such a quadrilateral for which all eight corner angles have integer values when measured in degrees an "integer angled quadrilateral". An example of an integer angled quadrilateral is a square, where all eight corner angles are 45°. Another example is given by DAC = 20°, BAC = 60°, ABD = 50°, CBD = 30°, BCA = 40°, DCA = 30°, CDB = 80°, ADB = 50°. What is the total number of non-similar integer angled quadrilaterals? Note: In your calculations you may assume that a calculated angle is integral if it is within a tolerance of 10-9 of an integer value.
+<img class="img-responsive center-block" alt="convex quadrilateral ABCD, with diagonals AC and BD" src="https://cdn.freecodecamp.org/curriculum/project-euler/integer-angled-quadrilaterals.gif" style="background-color: white; padding: 10px;" />
+
+For example, at vertex A, the two angles are CAD, CAB.
+
+We call such a quadrilateral for which all eight corner angles have integer values when measured in degrees an "integer angled quadrilateral". An example of an integer angled quadrilateral is a square, where all eight corner angles are 45°. Another example is given by DAC = 20°, BAC = 60°, ABD = 50°, CBD = 30°, BCA = 40°, DCA = 30°, CDB = 80°, ADB = 50°.
+
+What is the total number of non-similar integer angled quadrilaterals?
+
+**Note:** In your calculations you may assume that a calculated angle is integral if it is within a tolerance of ${10}^{-9}$ of an integer value.
 
 # --hints--
 
-`euler177()` should return 129325.
+`integerAngledQuadrilaterals()` should return `129325`.
 
 ```js
-assert.strictEqual(euler177(), 129325);
+assert.strictEqual(integerAngledQuadrilaterals(), 129325);
 ```
 
 # --seed--
@@ -25,12 +33,12 @@ assert.strictEqual(euler177(), 129325);
 ## --seed-contents--
 
 ```js
-function euler177() {
+function integerAngledQuadrilaterals() {
 
   return true;
 }
 
-euler177();
+integerAngledQuadrilaterals();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-178-step-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-178-step-numbers.md
index 12bad9c5ada..22f44139de6 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-178-step-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-178-step-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f41e1000cf542c50ff31
 title: 'Problem 178: Step Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301813
 dashedName: problem-178-step-numbers
 ---
@@ -16,14 +16,14 @@ A number for which every pair of consecutive digits has a difference of one is c
 
 A pandigital number contains every decimal digit from 0 to 9 at least once.
 
-How many pandigital step numbers less than 1040 are there?
+How many pandigital step numbers less than ${10}^{40}$ are there?
 
 # --hints--
 
-`euler178()` should return 126461847755.
+`stepNumbers()` should return `126461847755`.
 
 ```js
-assert.strictEqual(euler178(), 126461847755);
+assert.strictEqual(stepNumbers(), 126461847755);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler178(), 126461847755);
 ## --seed-contents--
 
 ```js
-function euler178() {
+function stepNumbers() {
 
   return true;
 }
 
-euler178();
+stepNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md
index 1811def962b..a159a7af8f6 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md
@@ -1,21 +1,21 @@
 ---
 id: 5900f41f1000cf542c50ff32
 title: 'Problem 179: Consecutive positive divisors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301814
 dashedName: problem-179-consecutive-positive-divisors
 ---
 
 # --description--
 
-Find the number of integers 1 &lt; n &lt; 107, for which n and n + 1 have the same number of positive divisors. For example, 14 has the positive divisors 1, 2, 7, 14 while 15 has 1, 3, 5, 15.
+Find the number of integers $1 &lt; n &lt; {10}^7$, for which $n$ and $n + 1$ have the same number of positive divisors. For example, 14 has the positive divisors 1, 2, 7, 14 while 15 has 1, 3, 5, 15.
 
 # --hints--
 
-`euler179()` should return 986262.
+`consecutivePositiveDivisors()` should return `986262`.
 
 ```js
-assert.strictEqual(euler179(), 986262);
+assert.strictEqual(consecutivePositiveDivisors(), 986262);
 ```
 
 # --seed--
@@ -23,12 +23,12 @@ assert.strictEqual(euler179(), 986262);
 ## --seed-contents--
 
 ```js
-function euler179() {
+function consecutivePositiveDivisors() {
 
   return true;
 }
 
-euler179();
+consecutivePositiveDivisors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-18-maximum-path-sum-i.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-18-maximum-path-sum-i.md
index 2ad9a7a7a6e..f0d97a950b2 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-18-maximum-path-sum-i.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-18-maximum-path-sum-i.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f37e1000cf542c50fe91
 title: 'Problem 18: Maximum path sum I'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301815
 dashedName: problem-18-maximum-path-sum-i
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.md
index 3b46677319d..9eed96d38b2 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.md
@@ -1,37 +1,36 @@
 ---
 id: 5900f4201000cf542c50ff33
 title: 'Problem 180: Rational zeros of a function of three variables'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301816
 dashedName: problem-180-rational-zeros-of-a-function-of-three-variables
 ---
 
 # --description--
 
-For any integer n, consider the three functions
+For any integer $n$, consider the three functions
 
-f1,n(x,y,z) = xn+1 + yn+1 − zn+1f2,n(x,y,z) = (xy + yz + zx)\*(xn-1 + yn-1 − zn-1)f3,n(x,y,z) = xyz\*(xn-2 + yn-2 − zn-2)
+$$\begin{align}   & f_{1,n}(x,y,z) = x^{n + 1} + y^{n + 1} − z^{n + 1}\\\\
+  & f_{2,n}(x,y,z) = (xy + yz + zx) \times (x^{n - 1} + y^{n - 1} − z^{n - 1})\\\\ & f_{3,n}(x,y,z) = xyz \times (x^{n - 2} + y^{n - 2} − z^{n - 2}) \end{align}$$
 
 and their combination
 
-fn(x,y,z) = f1,n(x,y,z) + f2,n(x,y,z) − f3,n(x,y,z)
+$$\begin{align} & f_n(x,y,z) = f_{1,n}(x,y,z) + f_{2,n}(x,y,z) − f_{3,n}(x,y,z) \end{align}$$
 
-We call (x,y,z) a golden triple of order k if x, y, and z are all rational numbers of the form a / b with
+We call $(x,y,z)$ a golden triple of order $k$ if $x$, $y$, and $z$ are all rational numbers of the form $\frac{a}{b}$ with $0 &lt; a &lt; b ≤ k$ and there is (at least) one integer $n$, so that $f_n(x,y,z) = 0$.
 
-0 &lt; a &lt; b ≤ k and there is (at least) one integer n, so that fn(x,y,z) = 0.
+Let $s(x,y,z) = x + y + z$.
 
-Let s(x,y,z) = x + y + z.
+Let $t = \frac{u}{v}$ be the sum of all distinct $s(x,y,z)$ for all golden triples $(x,y,z)$ of order 35. All the $s(x,y,z)$ and $t$ must be in reduced form.
 
-Let t = u / v be the sum of all distinct s(x,y,z) for all golden triples (x,y,z) of order 35. All the s(x,y,z) and t must be in reduced form.
-
-Find u + v.
+Find $u + v$.
 
 # --hints--
 
-`euler180()` should return 285196020571078980.
+`rationalZeros()` should return `285196020571078980`.
 
 ```js
-assert.strictEqual(euler180(), 285196020571078980);
+assert.strictEqual(rationalZeros(), 285196020571078980);
 ```
 
 # --seed--
@@ -39,12 +38,12 @@ assert.strictEqual(euler180(), 285196020571078980);
 ## --seed-contents--
 
 ```js
-function euler180() {
+function rationalZeros() {
 
   return true;
 }
 
-euler180();
+rationalZeros();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md
index 1aa8a4d0875..f98d3a71b9e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md
@@ -2,7 +2,7 @@
 id: 5900f4231000cf542c50ff34
 title: >-
   Problem 181: Investigating in how many ways objects of two different colours can be grouped
-challengeType: 5
+challengeType: 1
 forumTopicId: 301817
 dashedName: >-
   problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped
@@ -10,20 +10,18 @@ dashedName: >-
 
 # --description--
 
-Having three black objects B and one white object W they can be grouped in 7 ways like this:
+Having three black objects $B$ and one white object $W$ they can be grouped in 7 ways like this:
 
-(BBBW)(B,BBW)(B,B,BW)(B,B,B,W)
+$$(BBBW)\\;(B,BBW)\\;(B,B,BW)\\;(B,B,B,W)\\;(B,BB,W)\\;(BBB,W)\\;(BB,BW)$$
 
-(B,BB,W)(BBB,W)(BB,BW)
-
-In how many ways can sixty black objects B and forty white objects W be thus grouped?
+In how many ways can sixty black objects $B$ and forty white objects $W$ be thus grouped?
 
 # --hints--
 
-`euler181()` should return 83735848679360670.
+`colorsGrouping()` should return `83735848679360670`.
 
 ```js
-assert.strictEqual(euler181(), 83735848679360670);
+assert.strictEqual(colorsGrouping(), 83735848679360670);
 ```
 
 # --seed--
@@ -31,12 +29,12 @@ assert.strictEqual(euler181(), 83735848679360670);
 ## --seed-contents--
 
 ```js
-function euler181() {
+function colorsGrouping() {
 
   return true;
 }
 
-euler181();
+colorsGrouping();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md
index c739b6384ad..e971434b3e7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4231000cf542c50ff35
 title: 'Problem 182: RSA encryption'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301818
 dashedName: problem-182-rsa-encryption
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.md
index 0dcbca86fd5..7586be421e3 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.md
@@ -1,37 +1,37 @@
 ---
 id: 5900f4231000cf542c50ff36
 title: 'Problem 183: Maximum product of parts'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301819
 dashedName: problem-183-maximum-product-of-parts
 ---
 
 # --description--
 
-Let N be a positive integer and let N be split into k equal parts, r = N/k, so that N = r + r + ... + r.
+Let $N$ be a positive integer and let $N$ be split into $k$ equal parts, $r = \frac{N}{k}$, so that $N = r + r + \cdots + r$.
 
-Let P be the product of these parts, P = r × r × ... × r = rk.
+Let $P$ be the product of these parts, $P = r × r × \cdots × r = r^k$.
 
-For example, if 11 is split into five equal parts, 11 = 2.2 + 2.2 + 2.2 + 2.2 + 2.2, then P = 2.25 = 51.53632.
+For example, if 11 is split into five equal parts, 11 = 2.2 + 2.2 + 2.2 + 2.2 + 2.2, then $P = {2.2}^5 = 51.53632$.
 
-Let M(N) = Pmax for a given value of N.
+Let $M(N) = P_{max}$ for a given value of $N$.
 
-It turns out that the maximum for N = 11 is found by splitting eleven into four equal parts which leads to Pmax = (11/4)4; that is, M(11) = 14641/256 = 57.19140625, which is a terminating decimal.
+It turns out that the maximum for $N = 11$ is found by splitting eleven into four equal parts which leads to $P_{max} = {(\frac{11}{4})}^4$; that is, $M(11) = \frac{14641}{256} = 57.19140625$, which is a terminating decimal.
 
-However, for N = 8 the maximum is achieved by splitting it into three equal parts, so M(8) = 512/27, which is a non-terminating decimal.
+However, for $N = 8$ the maximum is achieved by splitting it into three equal parts, so $M(8) = \frac{512}{27}$, which is a non-terminating decimal.
 
-Let D(N) = N if M(N) is a non-terminating decimal and D(N) = -N if M(N) is a terminating decimal.
+Let $D(N) = N$ if $M(N)$ is a non-terminating decimal and $D(N) = -N$ if $M(N)$ is a terminating decimal.
 
-For example, ΣD(N) for 5 ≤ N ≤ 100 is 2438.
+For example, $\sum D(N)$ for $5 ≤ N ≤ 100$ is 2438.
 
-Find ΣD(N) for 5 ≤ N ≤ 10000.
+Find $\sum D(N)$ for $5 ≤ N ≤ 10000$.
 
 # --hints--
 
-`euler183()` should return 48861552.
+`maximumProductOfParts()` should return `48861552`.
 
 ```js
-assert.strictEqual(euler183(), 48861552);
+assert.strictEqual(maximumProductOfParts(), 48861552);
 ```
 
 # --seed--
@@ -39,12 +39,12 @@ assert.strictEqual(euler183(), 48861552);
 ## --seed-contents--
 
 ```js
-function euler183() {
+function maximumProductOfParts() {
 
   return true;
 }
 
-euler183();
+maximumProductOfParts();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md
index dd5855935b1..8d3eb0bfc9d 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f4241000cf542c50ff37
 title: 'Problem 184: Triangles containing the origin'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301820
 dashedName: problem-184-triangles-containing-the-origin
 ---
 
 # --description--
 
-Consider the set Ir of points (x,y) with integer coordinates in the interior of the circle with radius r, centered at the origin, i.e. x2 + y2 &lt; r2.
+Consider the set $I_r$ of points $(x,y)$ with integer coordinates in the interior of the circle with radius $r$, centered at the origin, i.e. $x^2 + y^2 &lt; r^2$.
 
-For a radius of 2, I2 contains the nine points (0,0), (1,0), (1,1), (0,1), (-1,1), (-1,0), (-1,-1), (0,-1) and (1,-1). There are eight triangles having all three vertices in I2 which contain the origin in the interior. Two of them are shown below, the others are obtained from these by rotation.
+For a radius of 2, $I_2$ contains the nine points (0,0), (1,0), (1,1), (0,1), (-1,1), (-1,0), (-1,-1), (0,-1) and (1,-1). There are eight triangles having all three vertices in $I_2$ which contain the origin in the interior. Two of them are shown below, the others are obtained from these by rotation.
 
-For a radius of 3, there are 360 triangles containing the origin in the interior and having all vertices in I3 and for I5 the number is 10600.
+<img class="img-responsive center-block" alt="circle with radius 2, centered at the origin, with nine marked points and two triangles - (-1,0), (0,1), (1,-1) and (-1,1), (0,-1), (1,1)" src="https://cdn.freecodecamp.org/curriculum/project-euler/triangles-containing-the-origin.gif" style="background-color: white; padding: 10px;" />
 
-How many triangles are there containing the origin in the interior and having all three vertices in I105?
+For a radius of 3, there are 360 triangles containing the origin in the interior and having all vertices in $I_3$ and for $I_5$ the number is 10600.
+
+How many triangles are there containing the origin in the interior and having all three vertices in $I_{105}$?
 
 # --hints--
 
-`euler184()` should return 1725323624056.
+`trianglesContainingOrigin()` should return `1725323624056`.
 
 ```js
-assert.strictEqual(euler184(), 1725323624056);
+assert.strictEqual(trianglesContainingOrigin(), 1725323624056);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler184(), 1725323624056);
 ## --seed-contents--
 
 ```js
-function euler184() {
+function trianglesContainingOrigin() {
 
   return true;
 }
 
-euler184();
+trianglesContainingOrigin();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-185-number-mind.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-185-number-mind.md
index bd8a8539373..820f0832166 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-185-number-mind.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-185-number-mind.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4251000cf542c50ff38
 title: 'Problem 185: Number Mind'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301821
 dashedName: problem-185-number-mind
 ---
@@ -12,20 +12,38 @@ The game Number Mind is a variant of the well known game Master Mind.
 
 Instead of coloured pegs, you have to guess a secret sequence of digits. After each guess you're only told in how many places you've guessed the correct digit. So, if the sequence was 1234 and you guessed 2036, you'd be told that you have one correct digit; however, you would NOT be told that you also have another digit in the wrong place.
 
-For instance, given the following guesses for a 5-digit secret sequence, 90342 ;2 correct 70794 ;0 correct 39458 ;2 correct 34109 ;1 correct 51545 ;2 correct 12531 ;1 correct The correct sequence 39542 is unique.
+For instance, given the following guesses for a 5-digit secret sequence,
+
+$$\begin{align}   & 90342 ;2\\;\text{correct}\\\\
+  & 70794 ;0\\;\text{correct}\\\\   & 39458 ;2\\;\text{correct}\\\\
+  & 34109 ;1\\;\text{correct}\\\\   & 51545 ;2\\;\text{correct}\\\\
+  & 12531 ;1\\;\text{correct} \end{align}$$
+
+The correct sequence 39542 is unique.
 
 Based on the following guesses,
 
-5616185650518293 ;2 correct 3847439647293047 ;1 correct 5855462940810587 ;3 correct 9742855507068353 ;3 correct 4296849643607543 ;3 correct 3174248439465858 ;1 correct 4513559094146117 ;2 correct 7890971548908067 ;3 correct 8157356344118483 ;1 correct 2615250744386899 ;2 correct 8690095851526254 ;3 correct 6375711915077050 ;1 correct 6913859173121360 ;1 correct 6442889055042768 ;2 correct 2321386104303845 ;0 correct 2326509471271448 ;2 correct 5251583379644322 ;2 correct 1748270476758276 ;3 correct 4895722652190306 ;1 correct 3041631117224635 ;3 correct 1841236454324589 ;3 correct 2659862637316867 ;2 correct
+$$\begin{align}   & 5616185650518293 ;2\\;\text{correct}\\\\
+  & 3847439647293047 ;1\\;\text{correct}\\\\   & 5855462940810587 ;3\\;\text{correct}\\\\
+  & 9742855507068353 ;3\\;\text{correct}\\\\   & 4296849643607543 ;3\\;\text{correct}\\\\
+  & 3174248439465858 ;1\\;\text{correct}\\\\   & 4513559094146117 ;2\\;\text{correct}\\\\
+  & 7890971548908067 ;3\\;\text{correct}\\\\   & 8157356344118483 ;1\\;\text{correct}\\\\
+  & 2615250744386899 ;2\\;\text{correct}\\\\   & 8690095851526254 ;3\\;\text{correct}\\\\
+  & 6375711915077050 ;1\\;\text{correct}\\\\   & 6913859173121360 ;1\\;\text{correct}\\\\
+  & 6442889055042768 ;2\\;\text{correct}\\\\   & 2321386104303845 ;0\\;\text{correct}\\\\
+  & 2326509471271448 ;2\\;\text{correct}\\\\   & 5251583379644322 ;2\\;\text{correct}\\\\
+  & 1748270476758276 ;3\\;\text{correct}\\\\   & 4895722652190306 ;1\\;\text{correct}\\\\
+  & 3041631117224635 ;3\\;\text{correct}\\\\   & 1841236454324589 ;3\\;\text{correct}\\\\
+  & 2659862637316867 ;2\\;\text{correct} \end{align}$$
 
 Find the unique 16-digit secret sequence.
 
 # --hints--
 
-`euler185()` should return 4640261571849533.
+`numberMind()` should return `4640261571849533`.
 
 ```js
-assert.strictEqual(euler185(), 4640261571849533);
+assert.strictEqual(numberMind(), 4640261571849533);
 ```
 
 # --seed--
@@ -33,12 +51,12 @@ assert.strictEqual(euler185(), 4640261571849533);
 ## --seed-contents--
 
 ```js
-function euler185() {
+function numberMind() {
 
   return true;
 }
 
-euler185();
+numberMind();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md
index 119501f8331..8d1fed78cdf 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4281000cf542c50ff39
 title: 'Problem 186: Connectedness of a network'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301822
 dashedName: problem-186-connectedness-of-a-network
 ---
@@ -10,22 +10,31 @@ dashedName: problem-186-connectedness-of-a-network
 
 Here are the records from a busy telephone system with one million users:
 
-RecNrCallerCalled120000710005326001835004393600863701497......... The telephone number of the caller and the called number in record n are Caller(n) = S2n-1 and Called(n) = S2n where S1,2,3,... come from the "Lagged Fibonacci Generator":
+| RecNr | Caller | Called |
+| ----- | ------ | ------ |
+| 1     | 200007 | 100053 |
+| 2     | 600183 | 500439 |
+| 3     | 600863 | 701497 |
+| ...   | ...    | ...    |
 
-For 1 ≤ k ≤ 55, Sk = \[100003 - 200003k + 300007k3] (modulo 1000000) For 56 ≤ k, Sk = \[Sk-24 + Sk-55] (modulo 1000000)
+The telephone number of the caller and the called number in record $n$ are $Caller(n) = S_{2n - 1}$ and $Called(n) = S_{2n}$ where ${S}_{1,2,3,\ldots}$ come from the "Lagged Fibonacci Generator":
 
-If Caller(n) = Called(n) then the user is assumed to have misdialled and the call fails; otherwise the call is successful.
+For $1 ≤ k ≤ 55$, $S_k = [100003 - 200003k + 300007{k}^3]\\;(\text{modulo}\\;1000000)$
 
-From the start of the records, we say that any pair of users X and Y are friends if X calls Y or vice-versa. Similarly, X is a friend of a friend of Z if X is a friend of Y and Y is a friend of Z; and so on for longer chains.
+For $56 ≤ k$, $S_k = [S_{k - 24} + S_{k - 55}]\\;(\text{modulo}\\;1000000)$
+
+If $Caller(n) = Called(n)$ then the user is assumed to have misdialled and the call fails; otherwise the call is successful.
+
+From the start of the records, we say that any pair of users $X$ and $Y$ are friends if $X$ calls $Y$ or vice-versa. Similarly, $X$ is a friend of a friend of $Z$ if $X$ is a friend of $Y$ and $Y$ is a friend of $Z$; and so on for longer chains.
 
 The Prime Minister's phone number is 524287. After how many successful calls, not counting misdials, will 99% of the users (including the PM) be a friend, or a friend of a friend etc., of the Prime Minister?
 
 # --hints--
 
-`euler186()` should return 2325629.
+`connectednessOfANetwork()` should return `2325629`.
 
 ```js
-assert.strictEqual(euler186(), 2325629);
+assert.strictEqual(connectednessOfANetwork(), 2325629);
 ```
 
 # --seed--
@@ -33,12 +42,12 @@ assert.strictEqual(euler186(), 2325629);
 ## --seed-contents--
 
 ```js
-function euler186() {
+function connectednessOfANetwork() {
 
   return true;
 }
 
-euler186();
+connectednessOfANetwork();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-187-semiprimes.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-187-semiprimes.md
index 043684a9d76..bcd6f324753 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-187-semiprimes.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-187-semiprimes.md
@@ -1,22 +1,22 @@
 ---
 id: 5900f4291000cf542c50ff3a
 title: 'Problem 187: Semiprimes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301823
 dashedName: problem-187-semiprimes
 ---
 
 # --description--
 
-A composite is a number containing at least two prime factors. For example, 15 = 3 × 5; 9 = 3 × 3; 12 = 2 × 2 × 3.
+A composite is a number containing at least two prime factors. For example, $15 = 3 × 5; 9 = 3 × 3; 12 = 2 × 2 × 3$.
 
 There are ten composites below thirty containing precisely two, not necessarily distinct, prime factors: 4, 6, 9, 10, 14, 15, 21, 22, 25, 26.
 
-How many composite integers, n &lt; 108, have precisely two, not necessarily distinct, prime factors?
+How many composite integers, $n &lt; {10}^8$, have precisely two, not necessarily distinct, prime factors?
 
 # --hints--
 
-`euler187()` should return 17427258.
+`semiPrimes()` should return `17427258`.
 
 ```js
 assert.strictEqual(euler187(), 17427258);
@@ -27,12 +27,12 @@ assert.strictEqual(euler187(), 17427258);
 ## --seed-contents--
 
 ```js
-function euler187() {
+function semiPrimes() {
 
   return true;
 }
 
-euler187();
+semiPrimes();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.md
index 8c24a2f8e95..1e0ae1dc9fa 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4291000cf542c50ff3b
 title: 'Problem 188: The hyperexponentiation of a number'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301824
 dashedName: problem-188-the-hyperexponentiation-of-a-number
 ---
 
 # --description--
 
-The hyperexponentiation or tetration of a number a by a positive integer b, denoted by a↑↑b or ba, is recursively defined by:
+The hyperexponentiation or tetration of a number $a$ by a positive integer $b$, denoted by $a↑↑b$ or ${}^ba$, is recursively defined by:
 
-a↑↑1 = a,
+$a↑↑1 = a$,
 
-a↑↑(k+1) = a(a↑↑k).
+$a↑↑(k+1) = a^{(a↑↑k)}$.
 
-Thus we have e.g. 3↑↑2 = 33 = 27, hence 3↑↑3 = 327 = 7625597484987 and 3↑↑4 is roughly 103.6383346400240996\*10^12. Find the last 8 digits of 1777↑↑1855.
+Thus we have e.g. $3↑↑2 = 3^3 = 27$, hence $3↑↑3 = 3^{27} = 7625597484987$ and $3↑↑4$ is roughly ${10}^{3.6383346400240996 \times {10}^{12}}$. Find the last 8 digits of $1777↑↑1855$.
 
 # --hints--
 
-`euler188()` should return 95962097.
+`hyperexponentation()` should return `95962097`.
 
 ```js
-assert.strictEqual(euler188(), 95962097);
+assert.strictEqual(hyperexponentation(), 95962097);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler188(), 95962097);
 ## --seed-contents--
 
 ```js
-function euler188() {
+function hyperexponentation() {
 
   return true;
 }
 
-euler188();
+hyperexponentation();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md
index 4153d584425..6ac8cedcec5 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4291000cf542c50ff3c
 title: 'Problem 189: Tri-colouring a triangular grid'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301825
 dashedName: problem-189-tri-colouring-a-triangular-grid
 ---
@@ -10,20 +10,24 @@ dashedName: problem-189-tri-colouring-a-triangular-grid
 
 Consider the following configuration of 64 triangles:
 
+<img class="img-responsive center-block" alt="64 triangles arranged to create larger triangle with side length of 8 triangles" src="https://cdn.freecodecamp.org/curriculum/project-euler/tri-colouring-a-triangular-grid-1.gif" style="background-color: white; padding: 10px;" />
+
 We wish to colour the interior of each triangle with one of three colours: red, green or blue, so that no two neighbouring triangles have the same colour. Such a colouring shall be called valid. Here, two triangles are said to be neighbouring if they share an edge. Note: if they only share a vertex, then they are not neighbours.
 
 For example, here is a valid colouring of the above grid:
 
+<img class="img-responsive center-block" alt="colored grid of 64 triangles" src="https://cdn.freecodecamp.org/curriculum/project-euler/tri-colouring-a-triangular-grid-2.gif" style="background-color: white; padding: 10px;" />
+
 A colouring C' which is obtained from a colouring C by rotation or reflection is considered distinct from C unless the two are identical.
 
 How many distinct valid colourings are there for the above configuration?
 
 # --hints--
 
-`euler189()` should return 10834893628237824.
+`triangularGridColoring()` should return `10834893628237824`.
 
 ```js
-assert.strictEqual(euler189(), 10834893628237824);
+assert.strictEqual(triangularGridColoring(), 10834893628237824);
 ```
 
 # --seed--
@@ -31,12 +35,12 @@ assert.strictEqual(euler189(), 10834893628237824);
 ## --seed-contents--
 
 ```js
-function euler189() {
+function triangularGridColoring() {
 
   return true;
 }
 
-euler189();
+triangularGridColoring();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-19-counting-sundays.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-19-counting-sundays.md
index c12d6d1c6b8..5a3e24cc431 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-19-counting-sundays.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-19-counting-sundays.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f37f1000cf542c50fe92
 title: 'Problem 19: Counting Sundays'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301827
 dashedName: problem-19-counting-sundays
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.md
index 143247df800..806332925e0 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f42b1000cf542c50ff3d
 title: 'Problem 190: Maximising a weighted product'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301828
 dashedName: problem-190-maximising-a-weighted-product
 ---
 
 # --description--
 
-Let Sm = (x1, x2, ... , xm) be the m-tuple of positive real numbers with x1 + x2 + ... + xm = m for which Pm = x1 \* x22 \* ... \* xmm is maximised.
+Let $S_m = (x_1, x_2, \ldots, x_m)$ be the $m$-tuple of positive real numbers with $x_1 + x_2 + \cdots + x_m = m$ for which $P_m = x_1 \times {x_2}^2 \times \cdots \times {x_m}^m$ is maximised.
 
-For example, it can be verified that \[P10] = 4112 (\[ ] is the integer part function).
+For example, it can be verified that $[P_{10}] = 4112$ ([ ] is the integer part function).
 
-Find Σ\[Pm] for 2 ≤ m ≤ 15.
+Find $\sum {[P_m]}$ for $2 ≤ m ≤ 15$.
 
 # --hints--
 
-`euler190()` should return 371048281.
+`maximisingWeightedProduct()` should return `371048281`.
 
 ```js
-assert.strictEqual(euler190(), 371048281);
+assert.strictEqual(maximisingWeightedProduct(), 371048281);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler190(), 371048281);
 ## --seed-contents--
 
 ```js
-function euler190() {
+function maximisingWeightedProduct() {
 
   return true;
 }
 
-euler190();
+maximisingWeightedProduct();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-191-prize-strings.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-191-prize-strings.md
index bd93cdca4c2..8e4e35e5736 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-191-prize-strings.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-191-prize-strings.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f42b1000cf542c50ff3e
 title: 'Problem 191: Prize Strings'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301829
 dashedName: problem-191-prize-strings
 ---
@@ -14,16 +14,22 @@ During an n-day period a trinary string is formed for each child consisting of L
 
 Although there are eighty-one trinary strings for a 4-day period that can be formed, exactly forty-three strings would lead to a prize:
 
-OOOO OOOA OOOL OOAO OOAA OOAL OOLO OOLA OAOO OAOA OAOL OAAO OAAL OALO OALA OLOO OLOA OLAO OLAA AOOO AOOA AOOL AOAO AOAA AOAL AOLO AOLA AAOO AAOA AAOL AALO AALA ALOO ALOA ALAO ALAA LOOO LOOA LOAO LOAA LAOO LAOA LAAO
+```markup
+OOOO OOOA OOOL OOAO OOAA OOAL OOLO OOLA OAOO OAOA
+OAOL OAAO OAAL OALO OALA OLOO OLOA OLAO OLAA AOOO
+AOOA AOOL AOAO AOAA AOAL AOLO AOLA AAOO AAOA AAOL
+AALO AALA ALOO ALOA ALAO ALAA LOOO LOOA LOAO LOAA
+LAOO LAOA LAAO
+```
 
 How many "prize" strings exist over a 30-day period?
 
 # --hints--
 
-`euler191()` should return 1918080160.
+`prizeStrings()` should return `1918080160`.
 
 ```js
-assert.strictEqual(euler191(), 1918080160);
+assert.strictEqual(prizeStrings(), 1918080160);
 ```
 
 # --seed--
@@ -31,12 +37,12 @@ assert.strictEqual(euler191(), 1918080160);
 ## --seed-contents--
 
 ```js
-function euler191() {
+function prizeStrings() {
 
   return true;
 }
 
-euler191();
+prizeStrings();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-192-best-approximations.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-192-best-approximations.md
index 6751cbffaf9..61889d4d47b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-192-best-approximations.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-192-best-approximations.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f42c1000cf542c50ff3f
 title: 'Problem 192: Best Approximations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301830
 dashedName: problem-192-best-approximations
 ---
 
 # --description--
 
-Let x be a real number.
+Let $x$ be a real number.
 
-A best approximation to x for the denominator bound d is a rational number r/s in reduced form, with s ≤ d, such that any rational number which is closer to x than r/s has a denominator larger than d:
+A best approximation to $x$ for the denominator bound $d$ is a rational number $\frac{r}{s}$ in reduced form, with $s ≤ d$, such that any rational number which is closer to $x$ than $\frac{r}{s}$ has a denominator larger than $d$:
 
-|p/q-x| &lt; |r/s-x| ⇒ q > d
+$$|\frac{p}{q} - x| &lt; |\frac{r}{s} - x| ⇒ q > d$$
 
-For example, the best approximation to √13 for the denominator bound 20 is 18/5 and the best approximation to √13 for the denominator bound 30 is 101/28.
+For example, the best approximation to $\sqrt{13}$ for the denominator bound $20$ is $\frac{18}{5}$ and the best approximation to $\sqrt{13}$ for the denominator bound $30$ is $\frac{101}{28}$.
 
-Find the sum of all denominators of the best approximations to √n for the denominator bound 1012, where n is not a perfect square and 1 &lt; n ≤ 100000.
+Find the sum of all denominators of the best approximations to $\sqrt{n}$ for the denominator bound ${10}^{12}$, where $n$ is not a perfect square and $1 &lt; n ≤ 100000$.
 
 # --hints--
 
-`euler192()` should return 57060635927998344.
+`bestApproximations()` should return `57060635927998344`.
 
 ```js
-assert.strictEqual(euler192(), 57060635927998344);
+assert.strictEqual(bestApproximations(), 57060635927998344);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler192(), 57060635927998344);
 ## --seed-contents--
 
 ```js
-function euler192() {
+function bestApproximations() {
 
   return true;
 }
 
-euler192();
+bestApproximations();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-193-squarefree-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-193-squarefree-numbers.md
index 1b9cc8d4900..7e17fd27c15 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-193-squarefree-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-193-squarefree-numbers.md
@@ -1,23 +1,23 @@
 ---
 id: 5900f42f1000cf542c50ff41
 title: 'Problem 193: Squarefree Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301831
 dashedName: problem-193-squarefree-numbers
 ---
 
 # --description--
 
-A positive integer n is called squarefree, if no square of a prime divides n, thus 1, 2, 3, 5, 6, 7, 10, 11 are squarefree, but not 4, 8, 9, 12.
+A positive integer $n$ is called squarefree, if no square of a prime divides $n$, thus 1, 2, 3, 5, 6, 7, 10, 11 are squarefree, but not 4, 8, 9, 12.
 
-How many squarefree numbers are there below 250?
+How many squarefree numbers are there below $2^{50}$?
 
 # --hints--
 
-`euler193()` should return 684465067343069.
+`squarefreeNumbers()` should return `684465067343069`.
 
 ```js
-assert.strictEqual(euler193(), 684465067343069);
+assert.strictEqual(squarefreeNumbers(), 684465067343069);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler193(), 684465067343069);
 ## --seed-contents--
 
 ```js
-function euler193() {
+function squarefreeNumbers() {
 
   return true;
 }
 
-euler193();
+squarefreeNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-194-coloured-configurations.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-194-coloured-configurations.md
index 947d65c7878..4d5b05af3d9 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-194-coloured-configurations.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-194-coloured-configurations.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f42f1000cf542c50ff40
 title: 'Problem 194: Coloured Configurations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301832
 dashedName: problem-194-coloured-configurations
 ---
@@ -9,23 +9,21 @@ dashedName: problem-194-coloured-configurations
 # --description--
 
 Consider graphs built with the units A:
+<img class="img-responsive" alt="graph unit A" src="https://cdn.freecodecamp.org/curriculum/project-euler/coloured-configurations-1.png" style="display: inline-block; background-color: white; padding: 10px;" />
+ and B: <img class="img-responsive" alt="graph unit B" src="https://cdn.freecodecamp.org/curriculum/project-euler/coloured-configurations-2.png" style="display: inline-block; background-color: white; padding: 10px;" />, where the units are glued along the vertical edges as in the graph <img class="img-responsive" alt="graph with four units glued along the vertical edges" src="https://cdn.freecodecamp.org/curriculum/project-euler/coloured-configurations-3.png" style="display: inline-block; background-color: white; padding: 10px;" />.
 
-and B: , where the units are glued along
+A configuration of type $(a,b,c)$ is a graph thus built of $a$ units A and $b$ units B, where the graph's vertices are coloured using up to $c$ colours, so that no two adjacent vertices have the same colour. The compound graph above is an example of a configuration of type $(2,2,6)$, in fact of type $(2,2,c)$ for all $c ≥ 4$
 
-the vertical edges as in the graph .
+Let $N(a,b,c)$ be the number of configurations of type $(a,b,c)$. For example, $N(1,0,3) = 24$, $N(0,2,4) = 92928$ and $N(2,2,3) = 20736$.
 
-A configuration of type (a,b,c) is a graph thus built of a units A and b units B, where the graph's vertices are coloured using up to c colours, so that no two adjacent vertices have the same colour. The compound graph above is an example of a configuration of type (2,2,6), in fact of type (2,2,c) for all c ≥ 4.
-
-Let N(a,b,c) be the number of configurations of type (a,b,c). For example, N(1,0,3) = 24, N(0,2,4) = 92928 and N(2,2,3) = 20736.
-
-Find the last 8 digits of N(25,75,1984).
+Find the last 8 digits of $N(25,75,1984)$.
 
 # --hints--
 
-`euler194()` should return 61190912.
+`coloredConfigurations()` should return `61190912`.
 
 ```js
-assert.strictEqual(euler194(), 61190912);
+assert.strictEqual(coloredConfigurations(), 61190912);
 ```
 
 # --seed--
@@ -33,12 +31,12 @@ assert.strictEqual(euler194(), 61190912);
 ## --seed-contents--
 
 ```js
-function euler194() {
+function coloredConfigurations() {
 
   return true;
 }
 
-euler194();
+coloredConfigurations();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md
index cd52202435f..18c2acd7592 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md
@@ -1,31 +1,29 @@
 ---
 id: 5900f4311000cf542c50ff43
 title: 'Problem 195: Inscribed circles of triangles with one angle of 60 degrees'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301833
 dashedName: problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees
 ---
 
 # --description--
 
-Let's call an integer sided triangle with exactly one angle of 60 degrees a 60-degree triangle.
+Let's call an integer sided triangle with exactly one angle of 60° a 60° triangle.
 
-Let r be the radius of the inscribed circle of such a 60-degree triangle.
+Let $r$ be the radius of the inscribed circle of such a 60° triangle.
 
-There are 1234 60-degree triangles for which r ≤ 100.
+There are 1234 60° triangles for which $r ≤ 100$.
 
-Let T(n) be the number of 60-degree triangles for which r ≤ n, so
+Let $T(n)$ be the number of 60° triangles for which $r ≤ n$, so $T(100) = 1234$, $T(1000) = 22767$, and $T(10000) = 359912$.
 
-T(100) = 1234, T(1000) = 22767, and T(10000) = 359912.
-
-Find T(1053779).
+Find $T(1053779)$.
 
 # --hints--
 
-`euler195()` should return 75085391.
+`inscribedCirclesOfTriangles()` should return `75085391`.
 
 ```js
-assert.strictEqual(euler195(), 75085391);
+assert.strictEqual(inscribedCirclesOfTriangles(), 75085391);
 ```
 
 # --seed--
@@ -33,12 +31,12 @@ assert.strictEqual(euler195(), 75085391);
 ## --seed-contents--
 
 ```js
-function euler195() {
+function inscribedCirclesOfTriangles() {
 
   return true;
 }
 
-euler195();
+inscribedCirclesOfTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-196-prime-triplets.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-196-prime-triplets.md
index 4ead4631ddc..d072c7689a1 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-196-prime-triplets.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-196-prime-triplets.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4301000cf542c50ff42
 title: 'Problem 196: Prime triplets'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301834
 dashedName: problem-196-prime-triplets
 ---
@@ -10,7 +10,13 @@ dashedName: problem-196-prime-triplets
 
 Build a triangle from all positive integers in the following way:
 
-1 2 3 4 5 6 7 8 9 1011 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 2829 30 31 32 33 34 35 3637 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 . . .
+$$\begin{array}{rrr}   &  1 \\\\
+  &  \color{red}{2} &  \color{red}{3} \\\\   &  4 & \color{red}{5} &  6 \\\\
+  &  \color{red}{7} &  8 &  9 & 10 \\\\   & \color{red}{11} & 12 & \color{red}{13} & 14 & 15  \\\\
+  & 16 & \color{red}{17} & 18 & \color{red}{19} & 20 & 21 \\\\   & 22 & \color{red}{23} & 24 & 25 & 26 & 27 & 28 \\\\
+  & \color{red}{29} & 30 & \color{red}{31} & 32 & 33 & 34 & 35 & 36 \\\\   & \color{red}{37} & 38 & 39 & 40 & \color{red}{41} & 42 & \color{red}{43} & 44 & 45 \\\\
+  & 46 & \color{red}{47} & 48 & 49 & 50 & 51 & 52 & \color{red}{53} & 54 & 55 \\\\   & 56 & 57 & 58 & \color{red}{59} & 60 & \color{red}{61} & 62 & 63 & 64 & 65 & 66 \\\\
+  & \cdots \end{array}$$
 
 Each positive integer has up to eight neighbours in the triangle.
 
@@ -20,18 +26,18 @@ For example, in the second row, the prime numbers 2 and 3 are elements of some p
 
 If row 8 is considered, it contains two primes which are elements of some prime triplet, i.e. 29 and 31. If row 9 is considered, it contains only one prime which is an element of some prime triplet: 37.
 
-Define S(n) as the sum of the primes in row n which are elements of any prime triplet. Then S(8)=60 and S(9)=37.
+Define $S(n)$ as the sum of the primes in row $n$ which are elements of any prime triplet. Then $S(8) = 60$ and $S(9) = 37$.
 
-You are given that S(10000)=950007619.
+You are given that $S(10000) = 950007619$.
 
-Find S(5678027) + S(7208785).
+Find $S(5678027) + S(7208785)$.
 
 # --hints--
 
-`euler196()` should return 322303240771079940.
+`primeTriplets()` should return `322303240771079940`.
 
 ```js
-assert.strictEqual(euler196(), 322303240771079940);
+assert.strictEqual(primeTriplets(), 322303240771079940);
 ```
 
 # --seed--
@@ -39,12 +45,12 @@ assert.strictEqual(euler196(), 322303240771079940);
 ## --seed-contents--
 
 ```js
-function euler196() {
+function primeTriplets() {
 
   return true;
 }
 
-euler196();
+primeTriplets();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md
index 1e2f3fe30d6..c5d618e4868 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md
@@ -1,25 +1,23 @@
 ---
 id: 5900f4311000cf542c50ff44
-title: 'Problem 197: Investigating the behaviour of a recursively defined sequence'
-challengeType: 5
+title: '问题 197：研究递归定义的序列的行为'
+challengeType: 1
 forumTopicId: 301835
 dashedName: problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence
 ---
 
 # --description--
 
-Given is the function f(x) = ⌊230.403243784-x2⌋ × 10-9 ( ⌊ ⌋ is the floor-function),
+Given is the function $f(x) = ⌊{2}^{30.403243784 - x^2}⌋ × {10}^{-9}$ ( ⌊ ⌋ is the floor-function), the sequence $u_n$ is defined by $u_0 = -1$ and $u_{n + 1} = f(u_n)$.
 
-the sequence un is defined by u0 = -1 and un+1 = f(un).
-
-Find un + un+1 for n = 1012. Give your answer with 9 digits after the decimal point.
+Find $u_n + u_{n + 1}$ for $n = {10}^{12}$. Give your answer with 9 digits after the decimal point.
 
 # --hints--
 
-`euler197()` should return 1.710637717.
+`recursivelyDefinedSequence()` should return `1.710637717`.
 
 ```js
-assert.strictEqual(euler197(), 1.710637717);
+assert.strictEqual(recursivelyDefinedSequence(), 1.710637717);
 ```
 
 # --seed--
@@ -27,12 +25,12 @@ assert.strictEqual(euler197(), 1.710637717);
 ## --seed-contents--
 
 ```js
-function euler197() {
+function recursivelyDefinedSequence() {
 
   return true;
 }
 
-euler197();
+recursivelyDefinedSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md
index a955aa7c37e..9d4adee3f62 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4331000cf542c50ff45
-title: 'Problem 198: Ambiguous Numbers'
-challengeType: 5
+title: '问题 198：模糊数字'
+challengeType: 1
 forumTopicId: 301836
 dashedName: problem-198-ambiguous-numbers
 ---
 
 # --description--
 
-A best approximation to a real number x for the denominator bound d is a rational number r/s (in reduced form) with s ≤ d, so that any rational number p/q which is closer to x than r/s has q > d.
+A best approximation to a real number $x$ for the denominator bound $d$ is a rational number $\frac{r}{s}$ (in reduced form) with $s ≤ d$, so that any rational number $\frac{p}{q}$ which is closer to $x$ than $\frac{r}{s}$ has $q > d$.
 
-Usually the best approximation to a real number is uniquely determined for all denominator bounds. However, there are some exceptions, e.g. 9/40 has the two best approximations 1/4 and 1/5 for the denominator bound 6. We shall call a real number x ambiguous, if there is at least one denominator bound for which x possesses two best approximations. Clearly, an ambiguous number is necessarily rational.
+Usually the best approximation to a real number is uniquely determined for all denominator bounds. However, there are some exceptions, e.g. $\frac{9}{40}$ has the two best approximations $\frac{1}{4}$ and $\frac{1}{5}$ for the denominator bound $6$. We shall call a real number $x$ ambiguous, if there is at least one denominator bound for which $x$ possesses two best approximations. Clearly, an ambiguous number is necessarily rational.
 
-How many ambiguous numbers x = p/q, 0 &lt; x &lt; 1/100, are there whose denominator q does not exceed 108?
+How many ambiguous numbers $x = \frac{p}{q}$, $0 &lt; x &lt; \frac{1}{100}$, are there whose denominator $q$ does not exceed ${10}^8$?
 
 # --hints--
 
-`euler198()` should return 52374425.
+`ambiguousNumbers()` should return `52374425`.
 
 ```js
-assert.strictEqual(euler198(), 52374425);
+assert.strictEqual(ambiguousNumbers(), 52374425);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler198(), 52374425);
 ## --seed-contents--
 
 ```js
-function euler198() {
+function ambiguousNumbers() {
 
   return true;
 }
 
-euler198();
+ambiguousNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md
index 0194bbb44d1..5c699d70320 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4341000cf542c50ff46
 title: 'Problem 199: Iterative Circle Packing'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301837
 dashedName: problem-199-iterative-circle-packing
 ---
@@ -10,7 +10,7 @@ dashedName: problem-199-iterative-circle-packing
 
 Three circles of equal radius are placed inside a larger circle such that each pair of circles is tangent to one another and the inner circles do not overlap. There are four uncovered "gaps" which are to be filled iteratively with more tangent circles.
 
-<img class="img-responsive center-block" alt="a diagram of non-overlapping concentric circles" src="https://cdn-media-1.freecodecamp.org/project-euler/199-circles-in-circles.gif" style="background-color: white; padding: 10px;" />
+<img class="img-responsive center-block" alt="a diagram of non-overlapping circles" src="https://cdn-media-1.freecodecamp.org/project-euler/199-circles-in-circles.gif" style="background-color: white; padding: 10px;" />
 
 At each iteration, a maximally sized circle is placed in each gap, which creates more gaps for the next iteration. After 3 iterations (pictured), there are 108 gaps and the fraction of the area which is not covered by circles is 0.06790342, rounded to eight decimal places.
 
@@ -24,13 +24,13 @@ What fraction of the area is not covered by circles after `n` iterations? Give y
 assert(typeof iterativeCirclePacking(10) === 'number');
 ```
 
-`iterativeCirclePacking(10)` should return 0.00396087.
+`iterativeCirclePacking(10)` should return `0.00396087`.
 
 ```js
 assert.strictEqual(iterativeCirclePacking(10), 0.00396087);
 ```
 
-`iterativeCirclePacking(3)` should return 0.06790342.
+`iterativeCirclePacking(3)` should return `0.06790342`.
 
 ```js
 assert.strictEqual(iterativeCirclePacking(3), 0.06790342);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md
index ecf2a8aa73a..64c6a8af217 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md
@@ -1,70 +1,70 @@
 ---
 id: 5900f36e1000cf542c50fe81
 title: 'Problem 2: Even Fibonacci Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301838
 dashedName: problem-2-even-fibonacci-numbers
 ---
 
 # --description--
 
-Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:
+Each new term in the Fibonacci sequence is generated by adding the previous two terms. 从 1 和 2 开始，前 10 项将是：
 
 <div style='text-align: center;'>1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...</div>
 
-By considering the terms in the Fibonacci sequence whose values do not exceed `n`, find the sum of the even-valued terms.
+通过考虑 Fibonacci 数列中值不超过 `n` 的项，找到偶数值项的总和。
 
 # --hints--
 
-`fiboEvenSum(10)` should return a number.
+`fiboEvenSum(10)` 应该返回数字类型的数据。
 
 ```js
 assert(typeof fiboEvenSum(10) === 'number');
 ```
 
-Your function should return an `even` value.
+Your function should return an even value.
 
 ```js
 assert.equal(fiboEvenSum(10) % 2 === 0, true);
 ```
 
-Your function should sum the even-valued Fibonacci numbers: `fiboEvenSum(8)` should return 10.
+您的函数应该把偶数值的 Fibonacci 数字相加： `fiboEvenSum(8)` 应该返回 10。
 
 ```js
 assert.strictEqual(fiboEvenSum(8), 10);
 ```
 
-`fiboEvenSum(10)` should return 10.
+`fiboEvenSum(10)` 应该返回 10。
 
 ```js
 assert.strictEqual(fiboEvenSum(10), 10);
 ```
 
-`fiboEvenSum(34)` should return 44.
+`fiboEvenSum(34)` 应返回 44。
 
 ```js
 assert.strictEqual(fiboEvenSum(34), 44);
 ```
 
-`fiboEvenSum(60)` should return 44.
+`fiboEvenSum(60)` 应该返回 44。
 
 ```js
 assert.strictEqual(fiboEvenSum(60), 44);
 ```
 
-`fiboEvenSum(1000)` should return 798.
+`fiboEvenSum(1000)` 应该返回 798。
 
 ```js
 assert.strictEqual(fiboEvenSum(1000), 798);
 ```
 
-`fiboEvenSum(100000)` should return 60696.
+`fiboEvenSum(100000)` 应该返回 60696。
 
 ```js
 assert.strictEqual(fiboEvenSum(100000), 60696);
 ```
 
-`fiboEvenSum(4000000)` should return 4613732.
+`fiboEvenSum(4000000)` 应该返回 4613732。
 
 ```js
 assert.strictEqual(fiboEvenSum(4000000), 4613732);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-20-factorial-digit-sum.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-20-factorial-digit-sum.md
index 579ac97f6f9..a109ff5f9b2 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-20-factorial-digit-sum.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-20-factorial-digit-sum.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3801000cf542c50fe93
 title: 'Problem 20: Factorial digit sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301839
 dashedName: problem-20-factorial-digit-sum
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md
index c6458059ce1..42d1a33d7c3 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md
@@ -2,7 +2,7 @@
 id: 5900f4351000cf542c50ff47
 title: >-
   Problem 200: Find the 200th prime-proof sqube containing the contiguous sub-string "200"
-challengeType: 5
+challengeType: 1
 forumTopicId: 301840
 dashedName: >-
   problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200
@@ -10,22 +10,22 @@ dashedName: >-
 
 # --description--
 
-We shall define a sqube to be a number of the form, p2q3, where p and q are distinct primes.
+We shall define a sqube to be a number of the form, ${p^2}{q^3}$, where $p$ and $q$ are distinct primes.
 
-For example, 200 = 5223 or 120072949 = 232613.
+For example, $200 = {5^2}{2^3}$ or $120072949 = {{23}^2}{{61}^3}$.
 
 The first five squbes are 72, 108, 200, 392, and 500.
 
-Interestingly, 200 is also the first number for which you cannot change any single digit to make a prime; we shall call such numbers, prime-proof. The next prime-proof sqube which contains the contiguous sub-string "200" is 1992008.
+有趣的是，200 也是第一个不能改变任何一位数来构成素数的数字；我们将称这些数字为素数证明。 The next prime-proof sqube which contains the contiguous sub-string `200` is 1992008.
 
-Find the 200th prime-proof sqube containing the contiguous sub-string "200".
+Find the 200th prime-proof sqube containing the contiguous sub-string `200`.
 
 # --hints--
 
-`euler200()` should return 229161792008.
+`primeProofSqubeWithSubString()` should return `229161792008`.
 
 ```js
-assert.strictEqual(euler200(), 229161792008);
+assert.strictEqual(primeProofSqubeWithSubString(), 229161792008);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler200(), 229161792008);
 ## --seed-contents--
 
 ```js
-function euler200() {
+function primeProofSqubeWithSubString() {
 
   return true;
 }
 
-euler200();
+primeProofSqubeWithSubString();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md
index 045fd9b2b8b..e0513d008ec 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md
@@ -1,31 +1,41 @@
 ---
 id: 5900f4361000cf542c50ff48
 title: 'Problem 201: Subsets with a unique sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301841
 dashedName: problem-201-subsets-with-a-unique-sum
 ---
 
 # --description--
 
-For any set A of numbers, let sum(A) be the sum of the elements of A.
+For any set $A$ of numbers, let $sum(A)$ be the sum of the elements of $A$.
 
-Consider the set B = {1,3,6,8,10,11}. There are 20 subsets of B containing three elements, and their sums are:
+Consider the set $B = \\{1,3,6,8,10,11\\}$. There are 20 subsets of $B$ containing three elements, and their sums are:
 
-sum({1,3,6}) = 10, sum({1,3,8}) = 12, sum({1,3,10}) = 14, sum({1,3,11}) = 15, sum({1,6,8}) = 15, sum({1,6,10}) = 17, sum({1,6,11}) = 18, sum({1,8,10}) = 19, sum({1,8,11}) = 20, sum({1,10,11}) = 22, sum({3,6,8}) = 17, sum({3,6,10}) = 19, sum({3,6,11}) = 20, sum({3,8,10}) = 21, sum({3,8,11}) = 22, sum({3,10,11}) = 24, sum({6,8,10}) = 24, sum({6,8,11}) = 25, sum({6,10,11}) = 27, sum({8,10,11}) = 29.
+$$\begin{align}   & sum(\\{1,3,6\\}) = 10 \\\\
+  & sum(\\{1,3,8\\}) = 12 \\\\   & sum(\\{1,3,10\\}) = 14 \\\\
+  & sum(\\{1,3,11\\}) = 15 \\\\   & sum(\\{1,6,8\\}) = 15 \\\\
+  & sum(\\{1,6,10\\}) = 17 \\\\   & sum(\\{1,6,11\\}) = 18 \\\\
+  & sum(\\{1,8,10\\}) = 19 \\\\   & sum(\\{1,8,11\\}) = 20 \\\\
+  & sum(\\{1,10,11\\}) = 22 \\\\   & sum(\\{3,6,8\\}) = 17 \\\\
+  & sum(\\{3,6,10\\}) = 19 \\\\   & sum(\\{3,6,11\\}) = 20 \\\\
+  & sum(\\{3,8,10\\}) = 21 \\\\   & sum(\\{3,8,11\\}) = 22 \\\\
+  & sum(\\{3,10,11\\}) = 24 \\\\   & sum(\\{6,8,10\\}) = 24 \\\\
+  & sum(\\{6,8,11\\}) = 25 \\\\   & sum(\\{6,10,11\\}) = 27 \\\\
+  & sum(\\{8,10,11\\}) = 29 \\end{align}$$
 
-Some of these sums occur more than once, others are unique. For a set A, let U(A,k) be the set of unique sums of k-element subsets of A, in our example we find U(B,3) = {10,12,14,18,21,25,27,29} and sum(U(B,3)) = 156.
+Some of these sums occur more than once, others are unique. For a set $A$, let $U(A,k)$ be the set of unique sums of $k$-element subsets of $A$, in our example we find $U(B,3) = \\{10,12,14,18,21,25,27,29\\}$ and $sum(U(B,3)) = 156$.
 
-Now consider the 100-element set S = {12, 22, ... , 1002}. S has 100891344545564193334812497256 50-element subsets.
+Now consider the $100$-element set $S = \\{1^2, 2^2, \ldots , {100}^2\\}$. $S$ has $100\\,891\\,344\\,545\\,564\\,193\\,334\\,812\\,497\\,256\\;$ $50$-element subsets.
 
-Determine the sum of all integers which are the sum of exactly one of the 50-element subsets of S, i.e. find sum(U(S,50)).
+Determine the sum of all integers which are the sum of exactly one of the $50$-element subsets of $S$, i.e. find $sum(U(S,50))$.
 
 # --hints--
 
-`euler201()` should return 115039000.
+`uniqueSubsetsSum()` should return `115039000`.
 
 ```js
-assert.strictEqual(euler201(), 115039000);
+assert.strictEqual(uniqueSubsetsSum(), 115039000);
 ```
 
 # --seed--
@@ -33,12 +43,12 @@ assert.strictEqual(euler201(), 115039000);
 ## --seed-contents--
 
 ```js
-function euler201() {
+function uniqueSubsetsSum() {
 
   return true;
 }
 
-euler201();
+uniqueSubsetsSum();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-202-laserbeam.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-202-laserbeam.md
index c42f68e4147..2090a152b22 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-202-laserbeam.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-202-laserbeam.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4371000cf542c50ff49
 title: 'Problem 202: Laserbeam'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301843
 dashedName: problem-202-laserbeam
 ---
@@ -10,18 +10,20 @@ dashedName: problem-202-laserbeam
 
 Three mirrors are arranged in the shape of an equilateral triangle, with their reflective surfaces pointing inwards. There is an infinitesimal gap at each vertex of the triangle through which a laser beam may pass.
 
-Label the vertices A, B and C. There are 2 ways in which a laser beam may enter vertex C, bounce off 11 surfaces, then exit through the same vertex: one way is shown below; the other is the reverse of that.
+Label the vertices $A$, $B$ and $C$. There are 2 ways in which a laser beam may enter vertex $C$, bounce off 11 surfaces, then exit through the same vertex: one way is shown below; the other is the reverse of that.
 
-There are 80840 ways in which a laser beam may enter vertex C, bounce off 1000001 surfaces, then exit through the same vertex.
+<img class="img-responsive center-block" alt="one way in which laser beam may enter vertex C, bounce off 11 surfaces and exit through the same vertex" src="https://cdn.freecodecamp.org/curriculum/project-euler/laserbeam.gif" style="background-color: white; padding: 10px;" />
 
-In how many ways can a laser beam enter at vertex C, bounce off 12017639147 surfaces, then exit through the same vertex?
+There are 80840 ways in which a laser beam may enter vertex $C$, bounce off 1000001 surfaces, then exit through the same vertex.
+
+In how many ways can a laser beam enter at vertex $C$, bounce off 12017639147 surfaces, then exit through the same vertex?
 
 # --hints--
 
-`euler202()` should return 1209002624.
+`laserbeam()` should return `1209002624`.
 
 ```js
-assert.strictEqual(euler202(), 1209002624);
+assert.strictEqual(laserbeam(), 1209002624);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler202(), 1209002624);
 ## --seed-contents--
 
 ```js
-function euler202() {
+function laserbeam() {
 
   return true;
 }
 
-euler202();
+laserbeam();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md
index 4ecf609e4b3..4e418715771 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md
@@ -1,16 +1,20 @@
 ---
 id: 5900f4381000cf542c50ff4a
 title: 'Problem 203: Squarefree Binomial Coefficients'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301844
 dashedName: problem-203-squarefree-binomial-coefficients
 ---
 
 # --description--
 
-The binomial coefficients nCk can be arranged in triangular form, Pascal's triangle, like this:
+The binomial coefficients $\displaystyle\binom{n}{k}$ can be arranged in triangular form, Pascal's triangle, like this:
 
-111121133114641151010511615201561172135352171 .........
+$$\begin{array}{ccccccccccccccc}    &   &   &   &    &    &    &  1 &    &    &    &   &   &   &   \\\\
+   &   &   &   &    &    &  1 &    & 1  &    &    &   &   &   &   \\\\    &   &   &   &    &  1 &    &  2 &    &  1 &    &   &   &   &   \\\\
+   &   &   &   &  1 &    &  3 &    &  3 &    &  1 &   &   &   &   \\\\    &   &   & 1 &    &  4 &    &  6 &    &  4 &    & 1 &   &   &   \\\\
+   &   & 1 &   &  5 &    & 10 &    & 10 &    &  5 &   & 1 &   &   \\\\    & 1 &   & 6 &    & 15 &    & 20 &    & 15 &    & 6 &   & 1 &   \\\\
+ 1 &   & 7 &   & 21 &    & 35 &    & 35 &    & 21 &   & 7 &   & 1 \\\\ &   &   &   &    &    &    & \ldots \end{array}$$
 
 It can be seen that the first eight rows of Pascal's triangle contain twelve distinct numbers: 1, 2, 3, 4, 5, 6, 7, 10, 15, 20, 21 and 35.
 
@@ -20,10 +24,10 @@ Find the sum of the distinct squarefree numbers in the first 51 rows of Pascal's
 
 # --hints--
 
-`euler203()` should return 34029210557338.
+`squarefreeBinomialCoefficients()` should return `34029210557338`.
 
 ```js
-assert.strictEqual(euler203(), 34029210557338);
+assert.strictEqual(squarefreeBinomialCoefficients(), 34029210557338);
 ```
 
 # --seed--
@@ -31,12 +35,12 @@ assert.strictEqual(euler203(), 34029210557338);
 ## --seed-contents--
 
 ```js
-function euler203() {
+function squarefreeBinomialCoefficients() {
 
   return true;
 }
 
-euler203();
+squarefreeBinomialCoefficients();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.md
index 4d81e08eea0..584cf57c132 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4381000cf542c50ff4b
 title: 'Problem 204: Generalised Hamming Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301845
 dashedName: problem-204-generalised-hamming-numbers
 ---
@@ -12,18 +12,18 @@ A Hamming number is a positive number which has no prime factor larger than 5.
 
 So the first few Hamming numbers are 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15.
 
-There are 1105 Hamming numbers not exceeding 108.
+There are 1105 Hamming numbers not exceeding ${10}^8$.
 
-We will call a positive number a generalised Hamming number of type n, if it has no prime factor larger than n. Hence the Hamming numbers are the generalised Hamming numbers of type 5.
+We will call a positive number a generalised Hamming number of type $n$, if it has no prime factor larger than $n$. Hence the Hamming numbers are the generalised Hamming numbers of type 5.
 
-How many generalised Hamming numbers of type 100 are there which don't exceed 109?
+How many generalised Hamming numbers of type 100 are there which don't exceed ${10}^9$?
 
 # --hints--
 
-`euler204()` should return 2944730.
+`generalisedHammingNumbers()` should return `2944730`.
 
 ```js
-assert.strictEqual(euler204(), 2944730);
+assert.strictEqual(generalisedHammingNumbers(), 2944730);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler204(), 2944730);
 ## --seed-contents--
 
 ```js
-function euler204() {
+function generalisedHammingNumbers() {
 
   return true;
 }
 
-euler204();
+generalisedHammingNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-205-dice-game.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-205-dice-game.md
index 41bf903b6d9..17614dbf03b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-205-dice-game.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-205-dice-game.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4391000cf542c50ff4c
 title: 'Problem 205: Dice Game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301846
 dashedName: problem-205-dice-game
 ---
@@ -18,10 +18,10 @@ What is the probability that Pyramidal Pete beats Cubic Colin? Give your answer
 
 # --hints--
 
-`euler205()` should return 0.5731441.
+`diceGame()` should return `0.5731441`.
 
 ```js
-assert.strictEqual(euler205(), 0.5731441);
+assert.strictEqual(diceGame(), 0.5731441);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler205(), 0.5731441);
 ## --seed-contents--
 
 ```js
-function euler205() {
+function diceGame() {
 
   return true;
 }
 
-euler205();
+diceGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-206-concealed-square.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-206-concealed-square.md
index eaedced890e..596f703da28 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-206-concealed-square.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-206-concealed-square.md
@@ -1,21 +1,21 @@
 ---
 id: 5900f43a1000cf542c50ff4d
 title: 'Problem 206: Concealed Square'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301847
 dashedName: problem-206-concealed-square
 ---
 
 # --description--
 
-Find the unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0, where each “\_” is a single digit.
+Find the unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0, where each "_" is a single digit.
 
 # --hints--
 
-`euler206()` should return 1389019170.
+`concealedSquare()` should return `1389019170`.
 
 ```js
-assert.strictEqual(euler206(), 1389019170);
+assert.strictEqual(concealedSquare(), 1389019170);
 ```
 
 # --seed--
@@ -23,16 +23,41 @@ assert.strictEqual(euler206(), 1389019170);
 ## --seed-contents--
 
 ```js
-function euler206() {
+function concealedSquare() {
 
   return true;
 }
 
-euler206();
+concealedSquare();
 ```
 
 # --solutions--
 
 ```js
-// solution required
+// Check if n**2 matches the pattern
+function squareMatchs(n) {
+  // Need BigInt due to size of values
+  let nSquared = (BigInt(n) * BigInt(n)).toString();
+
+  // Check if digits match pattern
+  for (let i = 1; i <= 9; i++) {
+    if (nSquared[2 * (i - 1)] != i) return false;
+  }
+  return true;
+}
+
+// Find integer whose square matches the pattern
+function concealedSquare() {
+  // Set bounds based upon max and min candidates
+  const minSquareRoot = Math.floor(Math.sqrt(10203040506070809) / 10) * 10;
+  const maxSquareRoot = Math.ceil(Math.sqrt(19293949596979899) / 10) * 10;
+
+  for (let x = maxSquareRoot; x >= minSquareRoot; x -= 10) {
+    // Note: 3*3 = 9 and 7*7 = 49 are only trailing digits
+    //       that can produce 9 as trailing digit in square
+    if (squareMatchs(x + 3)) return (x + 3)*10;
+    if (squareMatchs(x + 7)) return (x + 7)*10;
+  }
+  return -1;
+}
 ```
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md
index 19f1d12c8d4..29efa6bc5f6 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md
@@ -1,31 +1,39 @@
 ---
 id: 5900f43c1000cf542c50ff4e
 title: 'Problem 207: Integer partition equations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301848
 dashedName: problem-207-integer-partition-equations
 ---
 
 # --description--
 
-For some positive integers k, there exists an integer partition of the form 4t = 2t + k,
+For some positive integers $k$, there exists an integer partition of the form $4^t = 2^t + k$,
 
-where 4t, 2t, and k are all positive integers and t is a real number.
+where $4^t$, $2^t$, and $k$ are all positive integers and $t$ is a real number.
 
-The first two such partitions are 41 = 21 + 2 and 41.5849625... = 21.5849625... + 6.
+The first two such partitions are $4^1 = 2^1 + 2$ and $4^{1.584\\,962\\,5\ldots} = 2^{1.584\\,962\\,5\ldots} + 6$.
 
-Partitions where t is also an integer are called perfect. For any m ≥ 1 let P(m) be the proportion of such partitions that are perfect with k ≤ m. Thus P(6) = 1/2.
+Partitions where $t$ is also an integer are called perfect. For any $m ≥ 1$ let $P(m)$ be the proportion of such partitions that are perfect with $k ≤ m$.
 
-In the following table are listed some values of P(m) P(5) = 1/1 P(10) = 1/2 P(15) = 2/3 P(20) = 1/2 P(25) = 1/2 P(30) = 2/5 ... P(180) = 1/4 P(185) = 3/13
+Thus $P(6) = \frac{1}{2}$.
 
-Find the smallest m for which P(m) &lt; 1/12345
+In the following table are listed some values of $P(m)$
+
+$$\begin{align}   & P(5) = \frac{1}{1}    \\\\
+  & P(10) = \frac{1}{2}   \\\\   & P(15) = \frac{2}{3}   \\\\
+  & P(20) = \frac{1}{2}   \\\\   & P(25) = \frac{1}{2}   \\\\
+  & P(30) = \frac{2}{5}   \\\\   & \ldots                \\\\
+  & P(180) = \frac{1}{4}  \\\\ & P(185) = \frac{3}{13} \end{align}$$
+
+Find the smallest $m$ for which $P(m) &lt; \frac{1}{12\\,345}$
 
 # --hints--
 
-`euler207()` should return 44043947822.
+`integerPartitionEquations()` should return `44043947822`.
 
 ```js
-assert.strictEqual(euler207(), 44043947822);
+assert.strictEqual(integerPartitionEquations(), 44043947822);
 ```
 
 # --seed--
@@ -33,12 +41,12 @@ assert.strictEqual(euler207(), 44043947822);
 ## --seed-contents--
 
 ```js
-function euler207() {
+function integerPartitionEquations() {
 
   return true;
 }
 
-euler207();
+integerPartitionEquations();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-208-robot-walks.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-208-robot-walks.md
index 36d5a8fff53..63c4e63cf53 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-208-robot-walks.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-208-robot-walks.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f43f1000cf542c50ff51
 title: 'Problem 208: Robot Walks'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301849
 dashedName: problem-208-robot-walks
 ---
@@ -12,14 +12,18 @@ A robot moves in a series of one-fifth circular arcs (72°), with a free choice
 
 One of 70932 possible closed paths of 25 arcs starting northward is
 
-Given that the robot starts facing North, how many journeys of 70 arcs in length can it take that return it, after the final arc, to its starting position? (Any arc may be traversed multiple times.)
+<img class="img-responsive center-block" alt="closed path of 25 arcs, starting northward" src="https://cdn.freecodecamp.org/curriculum/project-euler/robot-walks.gif" style="background-color: white; padding: 10px;" />
+
+Given that the robot starts facing North, how many journeys of 70 arcs in length can it take that return it, after the final arc, to its starting position?
+
+**Note:** Any arc may be traversed multiple times.
 
 # --hints--
 
-`euler208()` should return 331951449665644800.
+`robotWalks()` should return `331951449665644800`.
 
 ```js
-assert.strictEqual(euler208(), 331951449665644800);
+assert.strictEqual(robotWalks(), 331951449665644800);
 ```
 
 # --seed--
@@ -27,12 +31,12 @@ assert.strictEqual(euler208(), 331951449665644800);
 ## --seed-contents--
 
 ```js
-function euler208() {
+function robotWalks() {
 
   return true;
 }
 
-euler208();
+robotWalks();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-209-circular-logic.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-209-circular-logic.md
index f7437447361..97190a72f20 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-209-circular-logic.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-209-circular-logic.md
@@ -1,27 +1,41 @@
 ---
 id: 5900f43e1000cf542c50ff4f
 title: 'Problem 209: Circular Logic'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301850
 dashedName: problem-209-circular-logic
 ---
 
 # --description--
 
-A k-input binary truth table is a map from k input bits
+A $k$-input binary truth table is a map from $k$ input bits (binary digits, 0 [false] or 1 [true]) to 1 output bit. For example, the $2$-input binary truth tables for the logical $AND$ and $XOR$ functions are:
 
-(binary digits, 0 \[false] or 1 \[true]) to 1 output bit. For example, the 2-input binary truth tables for the logical AND and XOR functions are:
+| x | y | x AND y |
+| - | - | ------- |
+| 0 | 0 | 0       |
+| 0 | 1 | 0       |
+| 1 | 0 | 0       |
+| 1 | 1 | 1       |
 
-x y x AND y000010100111x y x XOR y000011101110How many 6-input binary truth tables, τ, satisfy the formula
+| x | y | x XOR y |
+| - | - | ------- |
+| 0 | 0 | 0       |
+| 0 | 1 | 1       |
+| 1 | 0 | 1       |
+| 1 | 1 | 0       |
 
-τ(a, b, c, d, e, f) AND τ(b, c, d, e, f, a XOR (b AND c)) = 0 for all 6-bit inputs (a, b, c, d, e, f)?
+How many $6$-input binary truth tables, $τ$, satisfy the formula
+
+$$τ(a, b, c, d, e, f) \\; AND \\; τ(b, c, d, e, f, a \\; XOR \\; (b \\; AND \\; c)) = 0$$
+
+for all $6$-bit inputs ($a$, $b$, $c$, $d$, $e$, $f$)?
 
 # --hints--
 
-`euler209()` should return 15964587728784.
+`circularLogic()` should return `15964587728784`.
 
 ```js
-assert.strictEqual(euler209(), 15964587728784);
+assert.strictEqual(circularLogic(), 15964587728784);
 ```
 
 # --seed--
@@ -29,12 +43,12 @@ assert.strictEqual(euler209(), 15964587728784);
 ## --seed-contents--
 
 ```js
-function euler209() {
+function circularLogic() {
 
   return true;
 }
 
-euler209();
+circularLogic();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-21-amicable-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-21-amicable-numbers.md
index 58acfba70e1..df19c7d7c20 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-21-amicable-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-21-amicable-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3811000cf542c50fe94
 title: 'Problem 21: Amicable numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301851
 dashedName: problem-21-amicable-numbers
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md
index 1fc7d980330..0dbbed2f9b0 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f43e1000cf542c50ff50
 title: 'Problem 210: Obtuse Angled Triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301852
 dashedName: problem-210-obtuse-angled-triangles
 ---
 
 # --description--
 
-Consider the set S(r) of points (x,y) with integer coordinates satisfying |x| + |y| ≤ r.
+Consider the set $S(r)$ of points ($x$,$y$) with integer coordinates satisfying $|x| + |y| ≤ r$.
 
-Let O be the point (0,0) and C the point (r/4,r/4).
+Let $O$ be the point (0,0) and $C$ the point ($\frac{r}{4}$,$\frac{r}{4}$).
 
-Let N(r) be the number of points B in S(r), so that the triangle OBC has an obtuse angle, i.e. the largest angle α satisfies 90°&lt;α&lt;180°.
+Let $N(r)$ be the number of points $B$ in $S(r)$, so that the triangle $OBC$ has an obtuse angle, i.e. the largest angle $α$ satisfies $90°&lt;α&lt;180°$.
 
-So, for example, N(4)=24 and N(8)=100.
+So, for example, $N(4)=24$ and $N(8)=100$.
 
-What is N(1,000,000,000)?
+What is $N(1\\,000\\,000\\,000)$?
 
 # --hints--
 
-`euler210()` should return 1598174770174689500.
+`obtuseAngledTriangles()` should return `1598174770174689500`.
 
 ```js
-assert.strictEqual(euler210(), 1598174770174689500);
+assert.strictEqual(obtuseAngledTriangles(), 1598174770174689500);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler210(), 1598174770174689500);
 ## --seed-contents--
 
 ```js
-function euler210() {
+function obtuseAngledTriangles() {
 
   return true;
 }
 
-euler210();
+obtuseAngledTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md
index bde41e4a79e..828e558e426 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f43f1000cf542c50ff52
 title: 'Problem 211: Divisor Square Sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301853
 dashedName: problem-211-divisor-square-sum
 ---
 
 # --description--
 
-For a positive integer n, let σ2(n) be the sum of the squares of its divisors. For example,
+For a positive integer $n$, let $σ_2(n)$ be the sum of the squares of its divisors. 例如，
 
-σ2(10) = 1 + 4 + 25 + 100 = 130.
+$$σ_2(10) = 1 + 4 + 25 + 100 = 130$$
 
-Find the sum of all n, 0 &lt; n &lt; 64,000,000 such that σ2(n) is a perfect square.
+Find the sum of all $n$, $0 &lt; n &lt; 64\\,000\\,000$ such that $σ_2(n)$ is a perfect square.
 
 # --hints--
 
-`euler211()` should return 1922364685.
+`divisorSquareSum()` should return `1922364685`.
 
 ```js
-assert.strictEqual(euler211(), 1922364685);
+assert.strictEqual(divisorSquareSum(), 1922364685);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler211(), 1922364685);
 ## --seed-contents--
 
 ```js
-function euler211() {
+function divisorSquareSum() {
 
   return true;
 }
 
-euler211();
+divisorSquareSum();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md
index 901bbbc3d11..6fd271c483e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md
@@ -1,35 +1,40 @@
 ---
 id: 5900f4411000cf542c50ff53
 title: 'Problem 212: Combined Volume of Cuboids'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301854
 dashedName: problem-212-combined-volume-of-cuboids
 ---
 
 # --description--
 
-An axis-aligned cuboid, specified by parameters { (x0,y0,z0), (dx,dy,dz) }, consists of all points (X,Y,Z) such that x0 ≤ X ≤ x0+dx, y0 ≤ Y ≤ y0+dy and z0 ≤ Z ≤ z0+dz. The volume of the cuboid is the product, dx × dy × dz. The combined volume of a collection of cuboids is the volume of their union and will be less than the sum of the individual volumes if any cuboids overlap.
+An axis-aligned cuboid, specified by parameters $\{ (x_0,y_0,z_0), (dx,dy,dz) \}$, consists of all points ($X$,$Y$,$Z$) such that $x_0 ≤ X ≤ x_0 + dx$, $y_0 ≤ Y ≤ y_0 + dy$ and $z_0 ≤ Z ≤ z_0 + dz$. The volume of the cuboid is the product, $dx × dy × dz$. The combined volume of a collection of cuboids is the volume of their union and will be less than the sum of the individual volumes if any cuboids overlap.
 
-Let C1,...,C50000 be a collection of 50000 axis-aligned cuboids such that Cn has parameters
+Let $C_1, \ldots, C_{50000}$ be a collection of 50000 axis-aligned cuboids such that $C_n$ has parameters
 
-x0 = S6n-5 modulo 10000y0 = S6n-4 modulo 10000z0 = S6n-3 modulo 10000dx = 1 + (S6n-2 modulo 399)dy = 1 + (S6n-1 modulo 399)dz = 1 + (S6n modulo 399)
+$$\begin{align}   & x_0 = S_{6n - 5} \\; \text{modulo} \\; 10000    \\\\
+  & y_0 = S_{6n - 4} \\; \text{modulo} \\; 10000    \\\\   & z_0 = S_{6n - 3} \\; \text{modulo} \\; 10000    \\\\
+  & dx = 1 + (S_{6n - 2} \\; \text{modulo} \\; 399) \\\\   & dy = 1 + (S_{6n - 1} \\; \text{modulo} \\; 399) \\\\
+  & dz = 1 + (S_{6n} \\; \text{modulo} \\; 399)     \\\\ \end{align}$$
 
-where S1,...,S300000 come from the "Lagged Fibonacci Generator":
+where $S_1, \ldots, S_{300000}$ come from the "Lagged Fibonacci Generator":
 
-For 1 ≤ k ≤ 55, Sk = \[100003 - 200003k + 300007k3] (modulo 1000000)For 56 ≤ k, Sk = \[Sk-24 + Sk-55] (modulo 1000000)
+For $1 ≤ k ≤ 55$, $S_k = [100003 - 200003k + 300007k^3] \\; (modulo \\; 1000000)$
 
-Thus, C1 has parameters {(7,53,183),(94,369,56)}, C2 has parameters {(2383,3563,5079),(42,212,344)}, and so on.
+For $56 ≤ k$, $S_k = [S_{k - 24} + S_{k - 55}] \\; (modulo \\; 1000000)$
 
-The combined volume of the first 100 cuboids, C1,...,C100, is 723581599.
+Thus, $C_1$ has parameters $\{(7,53,183), (94,369,56)\}$, $C_2$ has parameters $\{(2383,3563,5079), (42,212,344)\}$, and so on.
 
-What is the combined volume of all 50000 cuboids, C1,...,C50000 ?
+The combined volume of the first 100 cuboids, $C_1, \ldots, C_{100}$, is 723581599.
+
+What is the combined volume of all 50000 cuboids, $C_1, \ldots, C_{50000}$?
 
 # --hints--
 
-`euler212()` should return 328968937309.
+`combinedValueOfCuboids()` should return `328968937309`.
 
 ```js
-assert.strictEqual(euler212(), 328968937309);
+assert.strictEqual(combinedValueOfCuboids(), 328968937309);
 ```
 
 # --seed--
@@ -37,12 +42,12 @@ assert.strictEqual(euler212(), 328968937309);
 ## --seed-contents--
 
 ```js
-function euler212() {
+function combinedValueOfCuboids() {
 
   return true;
 }
 
-euler212();
+combinedValueOfCuboids();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-213-flea-circus.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-213-flea-circus.md
index 2fbc23393c1..a18eb635255 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-213-flea-circus.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-213-flea-circus.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4411000cf542c50ff54
 title: 'Problem 213: Flea Circus'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301855
 dashedName: problem-213-flea-circus
 ---
@@ -16,10 +16,10 @@ What is the expected number of unoccupied squares after 50 rings of the bell? Gi
 
 # --hints--
 
-`euler213()` should return 330.721154.
+`fleaCircus()` should return `330.721154`.
 
 ```js
-assert.strictEqual(euler213(), 330.721154);
+assert.strictEqual(fleaCircus(), 330.721154);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler213(), 330.721154);
 ## --seed-contents--
 
 ```js
-function euler213() {
+function fleaCircus() {
 
   return true;
 }
 
-euler213();
+fleaCircus();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-214-totient-chains.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-214-totient-chains.md
index 754596cef69..98f8a365c4e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-214-totient-chains.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-214-totient-chains.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f4421000cf542c50ff55
-title: 'Problem 214: Totient Chains'
-challengeType: 5
+title: '问题 214：Totient 链'
+challengeType: 1
 forumTopicId: 301856
 dashedName: problem-214-totient-chains
 ---
 
 # --description--
 
-Let φ be Euler's totient function, i.e. for a natural number n,
+Let $φ$ be Euler's totient function, i.e. for a natural number $n$, $φ(n)$ is the number of $k$, $1 ≤ k ≤ n$, for which $gcd(k,n) = 1$.
 
-φ(n) is the number of k, 1 ≤ k ≤ n, for which gcd(k,n) = 1.
+By iterating $φ$, each positive integer generates a decreasing chain of numbers ending in 1. E.g. if we start with 5 the sequence 5,4,2,1 is generated. Here is a listing of all chains with length 4:
 
-By iterating φ, each positive integer generates a decreasing chain of numbers ending in 1. E.g. if we start with 5 the sequence 5,4,2,1 is generated. Here is a listing of all chains with length 4:
-
-5,4,2,1 7,6,2,1 8,4,2,1 9,6,2,1 10,4,2,1 12,4,2,1 14,6,2,1 18,6,2,1
+$$\begin{align}    5,4,2,1 & \\\\
+   7,6,2,1 & \\\\    8,4,2,1 & \\\\
+   9,6,2,1 & \\\\   10,4,2,1 & \\\\
+  12,4,2,1 & \\\\   14,6,2,1 & \\\\
+  18,6,2,1 & \end{align}$$
 
 Only two of these chains start with a prime, their sum is 12.
 
-What is the sum of all primes less than 40000000 which generate a chain of length 25?
+What is the sum of all primes less than $40\\,000\\,000$ which generate a chain of length 25?
 
 # --hints--
 
-`euler214()` should return 1677366278943.
+`totientChains()` should return `1677366278943`.
 
 ```js
-assert.strictEqual(euler214(), 1677366278943);
+assert.strictEqual(totientChains(), 1677366278943);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler214(), 1677366278943);
 ## --seed-contents--
 
 ```js
-function euler214() {
+function totientChains() {
 
   return true;
 }
 
-euler214();
+totientChains();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md
index 45f7f563e73..4e0f214b938 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4431000cf542c50ff56
 title: 'Problem 215: Crack-free Walls'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301857
 dashedName: problem-215-crack-free-walls
 ---
@@ -12,16 +12,18 @@ Consider the problem of building a wall out of 2×1 and 3×1 bricks (horizontal
 
 For example, the following 9×3 wall is not acceptable due to the running crack shown in red:
 
-There are eight ways of forming a crack-free 9×3 wall, written W(9,3) = 8.
+<img class="img-responsive center-block" alt="9x3 wall with one lined up gap between horizontally-adjacent bricks" src="https://cdn.freecodecamp.org/curriculum/project-euler/crack-free-walls.gif" style="background-color: white; padding: 10px;" />
 
-Calculate W(32,10).
+There are eight ways of forming a crack-free 9×3 wall, written $W(9,3) = 8$.
+
+Calculate $W(32,10)$.
 
 # --hints--
 
-`euler215()` should return 806844323190414.
+`crackFreeWalls()` should return `806844323190414`.
 
 ```js
-assert.strictEqual(euler215(), 806844323190414);
+assert.strictEqual(crackFreeWalls(), 806844323190414);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler215(), 806844323190414);
 ## --seed-contents--
 
 ```js
-function euler215() {
+function crackFreeWalls() {
 
   return true;
 }
 
-euler215();
+crackFreeWalls();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md
index e7591cd46f5..a528915ab9a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f4451000cf542c50ff57
 title: 'Problem 216: Investigating the primality of numbers of the form 2n2-1'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301858
 dashedName: problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1
 ---
 
 # --description--
 
-Consider numbers t(n) of the form t(n) = 2n2-1 with n > 1.
+Consider numbers $t(n)$ of the form $t(n) = 2n^2 - 1$ with $n > 1$.
 
 The first such numbers are 7, 17, 31, 49, 71, 97, 127 and 161.
 
-It turns out that only 49 = 7\*7 and 161 = 7\*23 are not prime.
+It turns out that only $49 = 7 \times 7$ and $161 = 7 \times 23$ are not prime.
 
-For n ≤ 10000 there are 2202 numbers t(n) that are prime.
+For $n ≤ 10000$ there are 2202 numbers $t(n)$ that are prime.
 
-How many numbers t(n) are prime for n ≤ 50,000,000 ?
+How many numbers $t(n)$ are prime for $n ≤ 50\\,000\\,000$?
 
 # --hints--
 
-`euler216()` should return 5437849.
+`primalityOfNumbers()` should return `5437849`.
 
 ```js
-assert.strictEqual(euler216(), 5437849);
+assert.strictEqual(primalityOfNumbers(), 5437849);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler216(), 5437849);
 ## --seed-contents--
 
 ```js
-function euler216() {
+function primalityOfNumbers() {
 
   return true;
 }
 
-euler216();
+primalityOfNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md
index 625b4a6c6d2..f685410fcd3 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f4461000cf542c50ff58
 title: 'Problem 217: Balanced Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301859
 dashedName: problem-217-balanced-numbers
 ---
 
 # --description--
 
-A positive integer with k (decimal) digits is called balanced if its first ⌈k/2⌉ digits sum to the same value as its last ⌈k/2⌉ digits, where ⌈x⌉, pronounced ceiling of x, is the smallest integer ≥ x, thus ⌈π⌉ = 4 and ⌈5⌉ = 5.
+A positive integer with $k$ (decimal) digits is called balanced if its first $⌈\frac{k}{2}⌉$ digits sum to the same value as its last $⌈\frac{k}{2}⌉$ digits, where $⌈x⌉$, pronounced ceiling of $x$, is the smallest integer $≥ x$, thus $⌈π⌉ = 4$ and $⌈5⌉ = 5$.
 
 So, for example, all palindromes are balanced, as is 13722.
 
-Let T(n) be the sum of all balanced numbers less than 10n.
+Let $T(n)$ be the sum of all balanced numbers less than $10^n$.
 
-Thus: T(1) = 45, T(2) = 540 and T(5) = 334795890.
+Thus: $T(1) = 45$, $T(2) = 540$ and $T(5) = 334\\,795\\,890$.
 
-Find T(47) mod 315
+Find $T(47)\\,mod\\,3^{15}$
 
 # --hints--
 
-`euler217()` should return 6273134.
+`balancedNumbers()` should return `6273134`.
 
 ```js
-assert.strictEqual(euler217(), 6273134);
+assert.strictEqual(balancedNumbers(), 6273134);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler217(), 6273134);
 ## --seed-contents--
 
 ```js
-function euler217() {
+function balancedNumbers() {
 
   return true;
 }
 
-euler217();
+balancedNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.md
index db91d74874e..1d29c005426 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.md
@@ -1,33 +1,39 @@
 ---
 id: 5900f4461000cf542c50ff59
 title: 'Problem 218: Perfect right-angled triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301860
 dashedName: problem-218-perfect-right-angled-triangles
 ---
 
 # --description--
 
-Consider the right angled triangle with sides a=7, b=24 and c=25.
+Consider the right-angled triangle with sides $a=7$, $b=24$ and $c=25$.
 
 The area of this triangle is 84, which is divisible by the perfect numbers 6 and 28.
 
-Moreover it is a primitive right angled triangle as gcd(a,b)=1 and gcd(b,c)=1.
+Moreover it is a primitive right-angled triangle as $gcd(a,b) = 1$ and $gcd(b,c) = 1$.
 
-Also c is a perfect square.
+Also $c$ is a perfect square.
 
-We will call a right angled triangle perfect if -it is a primitive right angled triangle -its hypotenuse is a perfect square
+We will call a right-angled triangle perfect if:
 
-We will call a right angled triangle super-perfect if -it is a perfect right angled triangle and -its area is a multiple of the perfect numbers 6 and 28.
+- it is a primitive right-angled triangle
+- its hypotenuse is a perfect square
 
-How many perfect right-angled triangles with c≤1016 exist that are not super-perfect?
+We will call a right-angled triangle super-perfect if:
+
+- it is a perfect right-angled triangle
+- its area is a multiple of the perfect numbers 6 and 28.
+
+How many perfect right-angled triangles with $c ≤ {10}^{16}$ exist that are not super-perfect?
 
 # --hints--
 
-`euler218()` should return 0.
+`perfectRightAngledTriangles()` should return `0`.
 
 ```js
-assert.strictEqual(euler218(), 0);
+assert.strictEqual(perfectRightAngledTriangles(), 0);
 ```
 
 # --seed--
@@ -35,12 +41,12 @@ assert.strictEqual(euler218(), 0);
 ## --seed-contents--
 
 ```js
-function euler218() {
+function perfectRightAngledTriangles() {
 
   return true;
 }
 
-euler218();
+perfectRightAngledTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-219-skew-cost-coding.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-219-skew-cost-coding.md
index 38d16eba872..f2d2b0f8721 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-219-skew-cost-coding.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-219-skew-cost-coding.md
@@ -1,33 +1,33 @@
 ---
 id: 5900f4481000cf542c50ff5a
 title: 'Problem 219: Skew-cost coding'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301861
 dashedName: problem-219-skew-cost-coding
 ---
 
 # --description--
 
-Let A and B be bit strings (sequences of 0's and 1's).
+Let $A$ and $B$ be bit strings (sequences of 0's and 1's).
 
-If A is equal to the leftmost length(A) bits of B, then A is said to be a prefix of B.
+If $A$ is equal to the <u>left</u>most length($A$) bits of $B$, then $A$ is said to be a prefix of $B$.
 
-For example, 00110 is a prefix of 001101001, but not of 00111 or 100110.
+For example, 00110 is a prefix of <u>00110</u>1001, but not of 00111 or 100110.
 
-A prefix-free code of size n is a collection of n distinct bit strings such that no string is a prefix of any other. For example, this is a prefix-free code of size 6:
+A prefix-free code of size $n$ is a collection of $n$ distinct bit strings such that no string is a prefix of any other. For example, this is a prefix-free code of size 6:
 
-0000, 0001, 001, 01, 10, 11
+$$0000, 0001, 001, 01, 10, 11$$
 
-Now suppose that it costs one penny to transmit a '0' bit, but four pence to transmit a '1'. Then the total cost of the prefix-free code shown above is 35 pence, which happens to be the cheapest possible for the skewed pricing scheme in question. In short, we write Cost(6) = 35.
+Now suppose that it costs one penny to transmit a '0' bit, but four pence to transmit a '1'. Then the total cost of the prefix-free code shown above is 35 pence, which happens to be the cheapest possible for the skewed pricing scheme in question. In short, we write $Cost(6) = 35$.
 
-What is Cost(109) ?
+What is $Cost(10^9)$?
 
 # --hints--
 
-`euler219()` should return 64564225042.
+`skewCostCoding()` should return `64564225042`.
 
 ```js
-assert.strictEqual(euler219(), 64564225042);
+assert.strictEqual(skewCostCoding(), 64564225042);
 ```
 
 # --seed--
@@ -35,12 +35,12 @@ assert.strictEqual(euler219(), 64564225042);
 ## --seed-contents--
 
 ```js
-function euler219() {
+function skewCostCoding() {
 
   return true;
 }
 
-euler219();
+skewCostCoding();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-22-names-scores.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-22-names-scores.md
index e93e40d6ef4..4c8df4383a7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-22-names-scores.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-22-names-scores.md
@@ -1,7 +1,7 @@
 ---
 id: 5a51eabcad78bf416f316e2a
 title: 'Problem 22: Names scores'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301862
 dashedName: problem-22-names-scores
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md
index 1fccaef107f..e58e3c3f3ec 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md
@@ -1,31 +1,40 @@
 ---
 id: 5900f4481000cf542c50ff5b
 title: 'Problem 220: Heighway Dragon'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301863
 dashedName: problem-220-heighway-dragon
 ---
 
 # --description--
 
-Let D0 be the two-letter string "Fa". For n≥1, derive Dn from Dn-1 by the string-rewriting rules:
+Let $D_0$ be the two-letter string "Fa". For $n ≥ 1$, derive $D_n$ from $D_{n - 1}$ by the string-rewriting rules:
 
-"a" → "aRbFR" "b" → "LFaLb"
+- "a" → "aRbFR"
+- "b" → "LFaLb"
 
-Thus, D0 = "Fa", D1 = "FaRbFR", D2 = "FaRbFRRLFaLbFR", and so on.
+Thus, $D_0$ = "Fa", $D_1$ = "FaRbFR", $D_2$ = "FaRbFRRLFaLbFR", and so on.
 
 These strings can be interpreted as instructions to a computer graphics program, with "F" meaning "draw forward one unit", "L" meaning "turn left 90 degrees", "R" meaning "turn right 90 degrees", and "a" and "b" being ignored. The initial position of the computer cursor is (0,0), pointing up towards (0,1).
 
-Then Dn is an exotic drawing known as the Heighway Dragon of order n. For example, D10 is shown below; counting each "F" as one step, the highlighted spot at (18,16) is the position reached after 500 steps.
+Then $D_n$ is an exotic drawing known as the Heighway Dragon of order $n$. For example, $D_{10}$ is shown below; counting each "F" as one step, the highlighted spot at (18,16) is the position reached after 500 steps.
 
-What is the position of the cursor after 1012 steps in D50 ? Give your answer in the form x,y with no spaces.
+<img class="img-responsive center-block" alt="drawing of the Heighway Dragon after 500 steps" src="https://cdn.freecodecamp.org/curriculum/project-euler/heighway-dragon.gif" style="background-color: white; padding: 10px;" />
+
+What is the position of the cursor after ${10}^{12}$ steps in $D_{50}$? Give your answer as a string in the form `x,y` with no spaces.
 
 # --hints--
 
-`euler220()` should return 139776, 963904.
+`heighwayDragon()` should return a string.
 
 ```js
-assert.strictEqual(euler220(), 139776, 963904);
+assert(typeof heighwayDragon() === 'string');
+```
+
+`heighwayDragon()` should return the string `139776,963904`.
+
+```js
+assert.strictEqual(heighwayDragon(), '139776,963904');
 ```
 
 # --seed--
@@ -33,12 +42,12 @@ assert.strictEqual(euler220(), 139776, 963904);
 ## --seed-contents--
 
 ```js
-function euler220() {
+function heighwayDragon() {
 
   return true;
 }
 
-euler220();
+heighwayDragon();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-221-alexandrian-integers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-221-alexandrian-integers.md
index 010d2bd57c9..e7fedf26f75 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-221-alexandrian-integers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-221-alexandrian-integers.md
@@ -1,27 +1,32 @@
 ---
 id: 5900f4491000cf542c50ff5c
 title: 'Problem 221: Alexandrian Integers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301864
 dashedName: problem-221-alexandrian-integers
 ---
 
 # --description--
 
-We shall call a positive integer A an "Alexandrian integer", if there exist integers p, q, r such that: A = p · q · r and 1/A = 1/p + 1/q + 1/r
+We shall call a positive integer $A$ an "Alexandrian integer", if there exist integers $p$, $q$, $r$ such that:
 
-<!-- TODO Use MathJax -->
+$$A = p \times q \times r$$
 
-For example, 630 is an Alexandrian integer (p = 5, q = −7, r = −18). In fact, 630 is the 6th Alexandrian integer, the first 6 Alexandrian integers being: 6, 42, 120, 156, 420 and 630.
+and
+
+$$\frac{1}{A} = \frac{1}{p} + \frac{1}{q} + \frac{1}{r}$$
+
+
+For example, 630 is an Alexandrian integer ($p = 5$, $q = −7$, $r = −18$). In fact, 630 is the 6th Alexandrian integer, the first 6 Alexandrian integers being: 6, 42, 120, 156, 420 and 630.
 
 Find the 150000th Alexandrian integer.
 
 # --hints--
 
-`euler221()` should return 1884161251122450.
+`alexandrianIntegers()` should return `1884161251122450`.
 
 ```js
-assert.strictEqual(euler221(), 1884161251122450);
+assert.strictEqual(alexandrianIntegers(), 1884161251122450);
 ```
 
 # --seed--
@@ -29,12 +34,12 @@ assert.strictEqual(euler221(), 1884161251122450);
 ## --seed-contents--
 
 ```js
-function euler221() {
+function alexandrianIntegers() {
 
   return true;
 }
 
-euler221();
+alexandrianIntegers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md
index 423ce7ff8e6..cdb6a9c3977 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f44b1000cf542c50ff5d
 title: 'Problem 222: Sphere Packing'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301865
 dashedName: problem-222-sphere-packing
 ---
@@ -10,14 +10,14 @@ dashedName: problem-222-sphere-packing
 
 What is the length of the shortest pipe, of internal radius 50mm, that can fully contain 21 balls of radii 30mm, 31mm, ..., 50mm?
 
-Give your answer in micrometres (10-6 m) rounded to the nearest integer.
+Give your answer in micrometres (${10}^{-6}$ m) rounded to the nearest integer.
 
 # --hints--
 
-`euler222()` should return 1590933.
+`spherePacking()` should return `1590933`.
 
 ```js
-assert.strictEqual(euler222(), 1590933);
+assert.strictEqual(spherePacking(), 1590933);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler222(), 1590933);
 ## --seed-contents--
 
 ```js
-function euler222() {
+function spherePacking() {
 
   return true;
 }
 
-euler222();
+spherePacking();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.md
index 28f8d8f2143..7fdbc36cbc6 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.md
@@ -1,23 +1,23 @@
 ---
 id: 5900f44b1000cf542c50ff5e
 title: 'Problem 223: Almost right-angled triangles I'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301866
 dashedName: problem-223-almost-right-angled-triangles-i
 ---
 
 # --description--
 
-Let us call an integer sided triangle with sides a ≤ b ≤ c barely acute if the sides satisfy a2 + b2 = c2 + 1.
+Let us call an integer sided triangle with sides $a ≤ b ≤ c$ barely acute if the sides satisfy $a^2 + b^2 = c^2 + 1$.
 
-How many barely acute triangles are there with perimeter ≤ 25,000,000?
+How many barely acute triangles are there with perimeter $≤ 25\\,000\\,000$?
 
 # --hints--
 
-`euler223()` should return 61614848.
+`almostRightAngledTrianglesOne()` should return `61614848`.
 
 ```js
-assert.strictEqual(euler223(), 61614848);
+assert.strictEqual(almostRightAngledTrianglesOne(), 61614848);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler223(), 61614848);
 ## --seed-contents--
 
 ```js
-function euler223() {
+function almostRightAngledTrianglesOne() {
 
   return true;
 }
 
-euler223();
+almostRightAngledTrianglesOne();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md
index d9f557fd4a9..c64e05aa777 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md
@@ -1,23 +1,23 @@
 ---
 id: 5900f44e1000cf542c50ff5f
-title: 'Problem 224: Almost right-angled triangles II'
-challengeType: 5
+title: '问题 224：几乎直角三角形 II'
+challengeType: 1
 forumTopicId: 301867
 dashedName: problem-224-almost-right-angled-triangles-ii
 ---
 
 # --description--
 
-Let us call an integer sided triangle with sides a ≤ b ≤ c barely obtuse if the sides satisfy a2 + b2 = c2 - 1.
+Let us call an integer sided triangle with sides $a ≤ b ≤ c$ barely obtuse if the sides satisfy $a^2 + b^2 = c^2 - 1$.
 
-How many barely obtuse triangles are there with perimeter ≤ 75,000,000?
+How many barely obtuse triangles are there with perimeter $≤ 75\\,000\\,000$?
 
 # --hints--
 
-`euler224()` should return 4137330.
+`almostRightAngledTrianglesTwo()` should return `4137330`.
 
 ```js
-assert.strictEqual(euler224(), 4137330);
+assert.strictEqual(almostRightAngledTrianglesTwo(), 4137330);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler224(), 4137330);
 ## --seed-contents--
 
 ```js
-function euler224() {
+function almostRightAngledTrianglesTwo() {
 
   return true;
 }
 
-euler224();
+almostRightAngledTrianglesTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md
index ff5fb05c1a7..2221b445314 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f44e1000cf542c50ff60
 title: 'Problem 225: Tribonacci non-divisors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301868
 dashedName: problem-225-tribonacci-non-divisors
 ---
@@ -10,18 +10,18 @@ dashedName: problem-225-tribonacci-non-divisors
 
 The sequence 1, 1, 1, 3, 5, 9, 17, 31, 57, 105, 193, 355, 653, 1201 ...
 
-is defined by T1 = T2 = T3 = 1 and Tn = Tn-1 + Tn-2 + Tn-3.
+is defined by $T_1 = T_2 = T_3 = 1$ and $T_n = T_{n - 1} + T_{n - 2} + T_{n - 3}$.
 
-It can be shown that 27 does not divide any terms of this sequence.In fact, 27 is the first odd number with this property.
+It can be shown that 27 does not divide any terms of this sequence. In fact, 27 is the first odd number with this property.
 
-Find the 124th odd number that does not divide any terms of the above sequence.
+Find the ${124}^{\text{th}}$ odd number that does not divide any terms of the above sequence.
 
 # --hints--
 
-`euler225()` should return 2009.
+`tribonacciNonDivisors()` should return `2009`.
 
 ```js
-assert.strictEqual(euler225(), 2009);
+assert.strictEqual(tribonacciNonDivisors(), 2009);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler225(), 2009);
 ## --seed-contents--
 
 ```js
-function euler225() {
+function tribonacciNonDivisors() {
 
   return true;
 }
 
-euler225();
+tribonacciNonDivisors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.md
index 3aadacc50b8..fd8031f2594 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f4511000cf542c50ff62
 title: 'Problem 226: A Scoop of Blancmange'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301869
 dashedName: problem-226-a-scoop-of-blancmange
 ---
 
 # --description--
 
-The blancmange curve is the set of points (x,y) such that 0 ≤ x ≤ 1 and ,where s(x) = the distance from x to the nearest integer.
+The blancmange curve is the set of points ($x$,$y$) such that $0 ≤ x ≤ 1$ and $\displaystyle y = \sum_{n = 0}^{\infty} \frac{s(2^nx)}{2^n}$, where $s(x)$ is the distance from $x$ to the nearest integer.
 
-The area under the blancmange curve is equal to ½, shown in pink in the diagram below.
+The area under the blancmange curve is equal to $\frac{1}{2}$, shown in pink in the diagram below.
 
-Let C be the circle with centre (¼,½) and radius ¼, shown in black in the diagram.
+<img class="img-responsive center-block" alt="diagram of blancmange curve, with circle C shown on diagram" src="https://cdn.freecodecamp.org/curriculum/project-euler/a-scoop-of-blancmange.gif" style="background-color: white; padding: 10px;" />
 
-What area under the blancmange curve is enclosed by C?Give your answer rounded to eight decimal places in the form 0.abcdefgh
+Let $C$ be the circle with centre ($\frac{1}{4}$,$\frac{1}{2}$) and radius $\frac{1}{4}$, shown in black in the diagram.
+
+What area under the blancmange curve is enclosed by $C$? Give your answer rounded to eight decimal places in the form 0.abcdefgh
 
 # --hints--
 
-`euler226()` should return 0.11316017.
+`scoopOfBlancmange()` should return `0.11316017`.
 
 ```js
-assert.strictEqual(euler226(), 0.11316017);
+assert.strictEqual(scoopOfBlancmange(), 0.11316017);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler226(), 0.11316017);
 ## --seed-contents--
 
 ```js
-function euler226() {
+function scoopOfBlancmange() {
 
   return true;
 }
 
-euler226();
+scoopOfBlancmange();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-227-the-chase.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-227-the-chase.md
index aff8e9b9340..3121c6ac8d8 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-227-the-chase.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-227-the-chase.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f44f1000cf542c50ff61
 title: 'Problem 227: The Chase'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301870
 dashedName: problem-227-the-chase
 ---
@@ -10,16 +10,24 @@ dashedName: problem-227-the-chase
 
 "The Chase" is a game played with two dice and an even number of players.
 
-The players sit around a table; the game begins with two opposite players having one die each. On each turn, the two players with a die roll it. If a player rolls a 1, he passes the die to his neighbour on the left; if he rolls a 6, he passes the die to his neighbour on the right; otherwise, he keeps the die for the next turn. The game ends when one player has both dice after they have been rolled and passed; that player has then lost.
+The players sit around a table; the game begins with two opposite players having one die each. On each turn, the two players with a die roll it.
+
+If the player rolls a 1, he passes the die to his neighbour on the left.
+
+If the player rolls a 6, he passes the die to his neighbour on the right.
+
+Otherwise, he keeps the die for the next turn.
+
+The game ends when one player has both dice after they have been rolled and passed; that player has then lost.
 
 In a game with 100 players, what is the expected number of turns the game lasts? Give your answer rounded to ten significant digits.
 
 # --hints--
 
-`euler227()` should return 3780.618622.
+`theChase()` should return `3780.618622`.
 
 ```js
-assert.strictEqual(euler227(), 3780.618622);
+assert.strictEqual(theChase(), 3780.618622);
 ```
 
 # --seed--
@@ -27,12 +35,12 @@ assert.strictEqual(euler227(), 3780.618622);
 ## --seed-contents--
 
 ```js
-function euler227() {
+function theChase() {
 
   return true;
 }
 
-euler227();
+theChase();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md
index 3ee325d2be7..3bccd240ed2 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md
@@ -1,41 +1,34 @@
 ---
 id: 5900f4511000cf542c50ff63
 title: 'Problem 228: Minkowski Sums'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301871
 dashedName: problem-228-minkowski-sums
 ---
 
 # --description--
 
-<!-- TODO Use MathJax and re-write from projecteuler.net -->
+Let $S_n$ be the regular $n$-sided polygon – or shape – whose vertices $v_k (k = 1, 2, \ldots, n)$ have coordinates:
 
-Let Sn be the regular n-sided polygon – or shape – whose vertices
+$$\begin{align}   & x_k = cos(\frac{2k - 1}{n} × 180°) \\\\
+  & y_k = sin(\frac{2k - 1}{n} × 180°) \end{align}$$
 
-vk (k = 1,2,…,n) have coordinates:
+Each $S_n$ is to be interpreted as a filled shape consisting of all points on the perimeter and in the interior.
 
-xk = cos( 2k-1/n ×180° )
+The Minkowski sum, $S + T$, of two shapes $S$ and $T$ is the result of adding every point in $S$ to every point in $T$, where point addition is performed coordinate-wise: $(u, v) + (x, y) = (u + x, v + y)$.
 
-yk = sin( 2k-1/n ×180° )
+For example, the sum of $S_3$ and $S_4$ is the six-sided shape shown in pink below:
 
-Each Sn is to be interpreted as a filled shape consisting of all points on the perimeter and in the interior.
+<img class="img-responsive center-block" alt="image showing S_3, S_4 and S_3 + S_4" src="https://cdn.freecodecamp.org/curriculum/project-euler/minkowski-sums.png" style="background-color: white; padding: 10px;" />
 
-The Minkowski sum, S+T, of two shapes S and T is the result of
-
-adding every point in S to every point in T, where point addition is performed coordinate-wise:
-
-(u, v) + (x, y) = (u+x, v+y).
-
-For example, the sum of S3 and S4 is the six-sided shape shown in pink below:
-
-How many sides does S1864 + S1865 + … + S1909 have?
+How many sides does $S_{1864} + S_{1865} + \ldots + S_{1909}$ have?
 
 # --hints--
 
-`euler228()` should return 86226.
+`minkowskiSums()` should return `86226`.
 
 ```js
-assert.strictEqual(euler228(), 86226);
+assert.strictEqual(minkowskiSums(), 86226);
 ```
 
 # --seed--
@@ -43,12 +36,12 @@ assert.strictEqual(euler228(), 86226);
 ## --seed-contents--
 
 ```js
-function euler228() {
+function minkowskiSums() {
 
   return true;
 }
 
-euler228();
+minkowskiSums();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md
index 0431ab815bd..3903d30320f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4521000cf542c50ff64
 title: 'Problem 229: Four Representations using Squares'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301872
 dashedName: problem-229-four-representations-using-squares
 ---
@@ -10,26 +10,30 @@ dashedName: problem-229-four-representations-using-squares
 
 Consider the number 3600. It is very special, because
 
-3600 = 482 + 362 3600 = 202 + 2×402 3600 = 302 + 3×302 3600 = 452 + 7×152
+$$\begin{align}   & 3600 = {48}^2 + {36}^2   \\\\
+  & 3600 = {20}^2 + {2×40}^2 \\\\   & 3600 = {30}^2 + {3×30}^2 \\\\
+  & 3600 = {45}^2 + {7×15}^2 \\\\ \end{align}$$
 
-Similarly, we find that 88201 = 992 + 2802 = 2872 + 2×542 = 2832 + 3×522 = 1972 + 7×842.
+Similarly, we find that $88201 = {99}^2 + {280}^2 = {287}^2 + 2 × {54}^2 = {283}^2 + 3 × {52}^2 = {197}^2 + 7 × {84}^2$.
 
-In 1747, Euler proved which numbers are representable as a sum of two squares. We are interested in the numbers n which admit representations of all of the following four types:
+In 1747, Euler proved which numbers are representable as a sum of two squares. We are interested in the numbers $n$ which admit representations of all of the following four types:
 
-n = a12 + b12n = a22 + 2 b22n = a32 + 3 b32n = a72 + 7 b72,
+$$\begin{align}   & n = {a_1}^2 + {b_1}^2  \\\\
+  & n = {a_2}^2 + 2{b_2}^2 \\\\   & n = {a_3}^2 + 3{b_3}^2 \\\\
+  & n = {a_7}^2 + 7{b_7}^2 \\\\ \end{align}$$
 
-where the ak and bk are positive integers.
+where the $a_k$ and $b_k$ are positive integers.
 
-There are 75373 such numbers that do not exceed 107.
+There are 75373 such numbers that do not exceed ${10}^7$.
 
-How many such numbers are there that do not exceed 2×109?
+How many such numbers are there that do not exceed $2 × {10}^9$?
 
 # --hints--
 
-`euler229()` should return 11325263.
+`representationsUsingSquares()` should return `11325263`.
 
 ```js
-assert.strictEqual(euler229(), 11325263);
+assert.strictEqual(representationsUsingSquares(), 11325263);
 ```
 
 # --seed--
@@ -37,12 +41,12 @@ assert.strictEqual(euler229(), 11325263);
 ## --seed-contents--
 
 ```js
-function euler229() {
+function representationsUsingSquares() {
 
   return true;
 }
 
-euler229();
+representationsUsingSquares();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-23-non-abundant-sums.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-23-non-abundant-sums.md
index ce8b2262e4a..cc7079af8c4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-23-non-abundant-sums.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-23-non-abundant-sums.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3831000cf542c50fe96
 title: 'Problem 23: Non-abundant sums'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301873
 dashedName: problem-23-non-abundant-sums
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md
index 16ea3131991..bc6cd70f1cc 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md
@@ -1,39 +1,47 @@
 ---
 id: 5900f4531000cf542c50ff65
 title: 'Problem 230: Fibonacci Words'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301874
 dashedName: problem-230-fibonacci-words
 ---
 
 # --description--
 
-For any two strings of digits, A and B, we define FA,B to be the sequence (A,B,AB,BAB,ABBAB,...) in which each term is the concatenation of the previous two.
+For any two strings of digits, $A$ and $B$, we define $F_{A,B}$ to be the sequence ($A, B, AB, BAB, ABBAB, \ldots$) in which each term is the concatenation of the previous two.
 
-Further, we define DA,B(n) to be the nth digit in the first term of FA,B that contains at least n digits.
+Further, we define $D_{A,B}(n)$ to be the $n^{\text{th}}$ digit in the first term of $F_{A,B}$ that contains at least $n$ digits.
 
 Example:
 
-Let A=1415926535, B=8979323846. We wish to find DA,B(35), say.
+Let $A = 1\\,415\\,926\\,535$, $B = 8\\,979\\,323\\,846$. We wish to find $D_{A,B}(35)$, say.
 
-The first few terms of FA,B are: 1415926535 8979323846 14159265358979323846 897932384614159265358979323846 14159265358979323846897932384614159265358979323846
+The first few terms of $F_{A,B}$ are:
 
-Then DA,B(35) is the 35th digit in the fifth term, which is 9.
+$$\begin{align}   & 1\\,415\\,926\\,535 \\\\
+  & 8\\,979\\,323\\,846 \\\\   & 14\\,159\\,265\\,358\\,979\\,323\\,846 \\\\
+  & 897\\,932\\,384\\,614\\,159\\,265\\,358\\,979\\,323\\,846 \\\\ & 14\\,159\\,265\\,358\\,979\\,323\\,846\\,897\\,932\\,384\\,614\\,15\color{red}{9}\\,265\\,358\\,979\\,323\\,846 \end{align}$$
 
-Now we use for A the first 100 digits of π behind the decimal point: 14159265358979323846264338327950288419716939937510 58209749445923078164062862089986280348253421170679
+Then $D_{A,B}(35)$ is the ${35}^{\text{th}}$ digit in the fifth term, which is 9.
 
-and for B the next hundred digits:
+Now we use for $A$ the first 100 digits of $π$ behind the decimal point:
 
-82148086513282306647093844609550582231725359408128 48111745028410270193852110555964462294895493038196 .
+$$\begin{align}   & 14\\,159\\,265\\,358\\,979\\,323\\,846\\,264\\,338\\,327\\,950\\,288\\,419\\,716\\,939\\,937\\,510 \\\\
+  & 58\\,209\\,749\\,445\\,923\\,078\\,164\\,062\\,862\\,089\\,986\\,280\\,348\\,253\\,421\\,170\\,679 \end{align}$$
 
-Find ∑n = 0,1,...,17 10n× DA,B((127+19n)×7n) .
+and for $B$ the next hundred digits:
+
+$$\begin{align}   & 82\\,148\\,086\\,513\\,282\\,306\\,647\\,093\\,844\\,609\\,550\\,582\\,231\\,725\\,359\\,408\\,128 \\\\
+  & 48\\,111\\,745\\,028\\,410\\,270\\,193\\,852\\,110\\,555\\,964\\,462\\,294\\,895\\,493\\,038\\,196 \end{align}$$
+
+Find $\sum_{n = 0, 1, \ldots, 17} {10}^n × D_{A,B}((127 + 19n) × 7^n)$.
 
 # --hints--
 
-`euler230()` should return 850481152593119200.
+`fibonacciWords()` should return `850481152593119200`.
 
 ```js
-assert.strictEqual(euler230(), 850481152593119200);
+assert.strictEqual(fibonacciWords(), 850481152593119200);
 ```
 
 # --seed--
@@ -41,12 +49,12 @@ assert.strictEqual(euler230(), 850481152593119200);
 ## --seed-contents--
 
 ```js
-function euler230() {
+function fibonacciWords() {
 
   return true;
 }
 
-euler230();
+fibonacciWords();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md
index c313225c729..498810cf48c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4531000cf542c50ff66
 title: 'Problem 231: The prime factorisation of binomial coefficients'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301875
 dashedName: problem-231-the-prime-factorisation-of-binomial-coefficients
 ---
 
 # --description--
 
-The binomial coefficient 10C3 = 120.
+The binomial coefficient $\displaystyle\binom{10}{3} = 120$.
 
-120 = 23 × 3 × 5 = 2 × 2 × 2 × 3 × 5, and 2 + 2 + 2 + 3 + 5 = 14.
+$120 = 2^3 × 3 × 5 = 2 × 2 × 2 × 3 × 5$, and $2 + 2 + 2 + 3 + 5 = 14$.
 
-So the sum of the terms in the prime factorisation of 10C3 is 14.
+So the sum of the terms in the prime factorisation of $\displaystyle\binom{10}{3}$ is $14$.
 
-Find the sum of the terms in the prime factorisation of 20000000C15000000.
+Find the sum of the terms in the prime factorisation of $\binom{20\\,000\\,000}{15\\,000\\,000}$.
 
 # --hints--
 
-`euler231()` should return 7526965179680.
+`primeFactorisation()` should return `7526965179680`.
 
 ```js
-assert.strictEqual(euler231(), 7526965179680);
+assert.strictEqual(primeFactorisation(), 7526965179680);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler231(), 7526965179680);
 ## --seed-contents--
 
 ```js
-function euler231() {
+function primeFactorisation() {
 
   return true;
 }
 
-euler231();
+primeFactorisation();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-232-the-race.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-232-the-race.md
index c109669bd8a..c03c0d687b3 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-232-the-race.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-232-the-race.md
@@ -1,16 +1,22 @@
 ---
 id: 5900f4551000cf542c50ff67
 title: 'Problem 232: The Race'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301876
 dashedName: problem-232-the-race
 ---
 
 # --description--
 
-Two players share an unbiased coin and take it in turns to play "The Race". On Player 1's turn, he tosses the coin once: if it comes up Heads, he scores one point; if it comes up Tails, he scores nothing. On Player 2's turn, she chooses a positive integer T and tosses the coin T times: if it comes up all Heads, she scores 2T-1 points; otherwise, she scores nothing. Player 1 goes first. The winner is the first to 100 or more points.
+Two players share an unbiased coin and take it in turns to play "The Race".
 
-On each turn Player 2 selects the number, T, of coin tosses that maximises the probability of her winning.
+On Player 1's turn, he tosses the coin once: if it comes up Heads, he scores one point; if it comes up Tails, he scores nothing.
+
+On Player 2's turn, she chooses a positive integer $T$ and tosses the coin $T$ times: if it comes up all Heads, she scores $2^{T - 1}$ points; otherwise, she scores nothing.
+
+Player 1 goes first. The winner is the first to 100 or more points.
+
+On each turn Player 2 selects the number, $T$, of coin tosses that maximises the probability of her winning.
 
 What is the probability that Player 2 wins?
 
@@ -18,10 +24,10 @@ Give your answer rounded to eight decimal places in the form 0.abcdefgh .
 
 # --hints--
 
-`euler232()` should return 0.83648556.
+`theRace()` should return `0.83648556`.
 
 ```js
-assert.strictEqual(euler232(), 0.83648556);
+assert.strictEqual(theRace(), 0.83648556);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler232(), 0.83648556);
 ## --seed-contents--
 
 ```js
-function euler232() {
+function theRace() {
 
   return true;
 }
 
-euler232();
+theRace();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.md
index 5903d7e8c95..db650947233 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4551000cf542c50ff68
 title: 'Problem 233: Lattice points on a circle'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301877
 dashedName: problem-233-lattice-points-on-a-circle
 ---
 
 # --description--
 
-Let f(N) be the number of points with integer coordinates that are on a circle passing through (0,0), (N,0),(0,N), and (N,N).
+Let $f(N)$ be the number of points with integer coordinates that are on a circle passing through $(0,0)$, $(N,0)$,$(0,N)$, and $(N,N)$.
 
-It can be shown that f(10000) = 36.
+It can be shown that $f(10000) = 36$.
 
-What is the sum of all positive integers N ≤ 1011 such that f(N) = 420 ?
+What is the sum of all positive integers $N ≤ {10}^{11}$ such that $f(N) = 420$?
 
 # --hints--
 
-`euler233()` should return 271204031455541300.
+`latticePointsOnACircle()` should return `271204031455541300`.
 
 ```js
-assert.strictEqual(euler233(), 271204031455541300);
+assert.strictEqual(latticePointsOnACircle(), 271204031455541300);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler233(), 271204031455541300);
 ## --seed-contents--
 
 ```js
-function euler233() {
+function latticePointsOnACircle() {
 
   return true;
 }
 
-euler233();
+latticePointsOnACircle();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.md
index edf39ca239d..ec01ca36a28 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f4571000cf542c50ff69
 title: 'Problem 234: Semidivisible numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301878
 dashedName: problem-234-semidivisible-numbers
 ---
 
 # --description--
 
-For an integer n ≥ 4, we define the lower prime square root of n, denoted by lps(n), as the largest prime ≤ √n and the upper prime square root of n, ups(n), as the smallest prime ≥ √n.
+For an integer $n ≥ 4$, we define the lower prime square root of $n$, denoted by $lps(n)$, as the $\text{largest prime} ≤ \sqrt{n}$ and the upper prime square root of $n$, $ups(n)$, as the $\text{smallest prime} ≥ \sqrt{n}$.
 
-So, for example, lps(4) = 2 = ups(4), lps(1000) = 31, ups(1000) = 37.
+So, for example, $lps(4) = 2 = ups(4)$, $lps(1000) = 31$, $ups(1000) = 37$.
 
-Let us call an integer n ≥ 4 semidivisible, if one of lps(n) and ups(n) divides n, but not both.
+Let us call an integer $n ≥ 4$ semidivisible, if one of $lps(n)$ and $ups(n)$ divides $n$, but not both.
 
-The sum of the semidivisible numbers not exceeding 15 is 30, the numbers are 8, 10 and 12. 15 is not semidivisible because it is a multiple of both lps(15) = 3 and ups(15) = 5. As a further example, the sum of the 92 semidivisible numbers up to 1000 is 34825.
+The sum of the semidivisible numbers not exceeding 15 is 30, the numbers are 8, 10 and 12. 15 is not semidivisible because it is a multiple of both $lps(15) = 3$ and $ups(15) = 5$. As a further example, the sum of the 92 semidivisible numbers up to 1000 is 34825.
 
-What is the sum of all semidivisible numbers not exceeding 999966663333 ?
+What is the sum of all semidivisible numbers not exceeding 999966663333?
 
 # --hints--
 
-`euler234()` should return 1259187438574927000.
+`semidivisibleNumbers()` should return `1259187438574927000`.
 
 ```js
-assert.strictEqual(euler234(), 1259187438574927000);
+assert.strictEqual(semidivisibleNumbers(), 1259187438574927000);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler234(), 1259187438574927000);
 ## --seed-contents--
 
 ```js
-function euler234() {
+function semidivisibleNumbers() {
 
   return true;
 }
 
-euler234();
+semidivisibleNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.md
index 549fc0275de..fa49a70f075 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4571000cf542c50ff6a
-title: 'Problem 235: An Arithmetic Geometric sequence'
-challengeType: 5
+title: '问题 235：算术几何序列'
+challengeType: 1
 forumTopicId: 301879
 dashedName: problem-235-an-arithmetic-geometric-sequence
 ---
 
 # --description--
 
-Given is the arithmetic-geometric sequence u(k) = (900-3k)rk-1.
+Given is the arithmetic-geometric sequence $u(k) = (900 - 3k)r^{k - 1}$.
 
-Let s(n) = Σk=1...nu(k).
+Let $s(n) = \sum_{k=1 \ldots n} u(k)$.
 
-Find the value of r for which s(5000) = -600,000,000,000.
+Find the value of $r$ for which $s(5000) = -600\\,000\\,000\\,000$.
 
 Give your answer rounded to 12 places behind the decimal point.
 
 # --hints--
 
-`euler235()` should return 1.002322108633.
+`arithmeticGeometricSequence()` should return `1.002322108633`.
 
 ```js
-assert.strictEqual(euler235(), 1.002322108633);
+assert.strictEqual(arithmeticGeometricSequence(), 1.002322108633);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler235(), 1.002322108633);
 ## --seed-contents--
 
 ```js
-function euler235() {
+function arithmeticGeometricSequence() {
 
   return true;
 }
 
-euler235();
+arithmeticGeometricSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md
index 01c7effbc3e..2ae12a0ab04 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4591000cf542c50ff6b
 title: 'Problem 236: Luxury Hampers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301881
 dashedName: problem-236-luxury-hampers
 ---
@@ -10,22 +10,39 @@ dashedName: problem-236-luxury-hampers
 
 Suppliers 'A' and 'B' provided the following numbers of products for the luxury hamper market:
 
-Product'A''B'Beluga Caviar5248640Christmas Cake13121888Gammon Joint26243776Vintage Port57603776Champagne Truffles39365664
+| Product            | 'A'  | 'B'  |
+| ------------------ | ---- | ---- |
+| Beluga Caviar      | 5248 | 640  |
+| Christmas Cake     | 1312 | 1888 |
+| Gammon Joint       | 2624 | 3776 |
+| Vintage Port       | 5760 | 3776 |
+| Champagne Truffles | 3936 | 5664 |
 
 Although the suppliers try very hard to ship their goods in perfect condition, there is inevitably some spoilage - i.e. products gone bad.
 
-The suppliers compare their performance using two types of statistic:The five per-product spoilage rates for each supplier are equal to the number of products gone bad divided by the number of products supplied, for each of the five products in turn. The overall spoilage rate for each supplier is equal to the total number of products gone bad divided by the total number of products provided by that supplier.To their surprise, the suppliers found that each of the five per-product spoilage rates was worse (higher) for 'B' than for 'A' by the same factor (ratio of spoilage rates), m>1; and yet, paradoxically, the overall spoilage rate was worse for 'A' than for 'B', also by a factor of m.
+The suppliers compare their performance using two types of statistic:
 
-There are thirty-five m>1 for which this surprising result could have occurred, the smallest of which is 1476/1475.
+- The five per-product spoilage rates for each supplier are equal to the number of products gone bad divided by the number of products supplied, for each of the five products in turn.
+- The overall spoilage rate for each supplier is equal to the total number of products gone bad divided by the total number of products provided by that supplier.
 
-What's the largest possible value of m? Give your answer as a fraction reduced to its lowest terms, in the form u/v.
+To their surprise, the suppliers found that each of the five per-product spoilage rates was worse (higher) for 'B' than for 'A' by the same factor (ratio of spoilage rates), $m > 1$; and yet, paradoxically, the overall spoilage rate was worse for 'A' than for 'B', also by a factor of $m$.
+
+There are thirty-five $m > 1$ for which this surprising result could have occurred, the smallest of which is $\frac{1476}{1475}$.
+
+What's the largest possible value of $m$? Give your answer as a string with fraction reduced to its lowest terms, in the form `u/v`.
 
 # --hints--
 
-`euler236()` should return 123 / 59.
+`luxuryHampers()` should return a string.
 
 ```js
-assert.strictEqual(euler236(), 123 / 59);
+assert(typeof luxuryHampers() === 'string');
+```
+
+`luxuryHampers()` should return the string `123/59`.
+
+```js
+assert.strictEqual(luxuryHampers(), '123/59');
 ```
 
 # --seed--
@@ -33,12 +50,12 @@ assert.strictEqual(euler236(), 123 / 59);
 ## --seed-contents--
 
 ```js
-function euler236() {
+function luxuryHampers() {
 
   return true;
 }
 
-euler236();
+luxuryHampers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md
index eec1076ec10..ef7c2a30c04 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md
@@ -1,33 +1,32 @@
 ---
 id: 5900f4591000cf542c50ff6c
 title: 'Problem 237: Tours on a 4 x n playing board'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301882
 dashedName: problem-237-tours-on-a-4-x-n-playing-board
 ---
 
 # --description--
 
-Let T(n) be the number of tours over a 4 × n playing board such that:
+Let $T(n)$ be the number of tours over a 4 × $n$ playing board such that:
 
-The tour starts in the top left corner.
-
-The tour consists of moves that are up, down, left, or right one square.
-
-The tour visits each square exactly once.
-
-The tour ends in the bottom left corner.
+- The tour starts in the top left corner.
+- The tour consists of moves that are up, down, left, or right one square.
+- The tour visits each square exactly once.
+- The tour ends in the bottom left corner.
 
 The diagram shows one tour over a 4 × 10 board:
 
-T(10) is 2329. What is T(1012) modulo 108?
+<img class="img-responsive center-block" alt="one tour over 4 x 10 board" src="https://cdn.freecodecamp.org/curriculum/project-euler/tours-on-a-4-x-n-playing-board.gif" style="background-color: white; padding: 10px;" />
+
+$T(10)$ is 2329. What is $T({10}^{12})$ modulo ${10}^8$?
 
 # --hints--
 
-`euler237()` should return 15836928.
+`toursOnPlayingBoard()` should return `15836928`.
 
 ```js
-assert.strictEqual(euler237(), 15836928);
+assert.strictEqual(toursOnPlayingBoard(), 15836928);
 ```
 
 # --seed--
@@ -35,12 +34,12 @@ assert.strictEqual(euler237(), 15836928);
 ## --seed-contents--
 
 ```js
-function euler237() {
+function toursOnPlayingBoard() {
 
   return true;
 }
 
-euler237();
+toursOnPlayingBoard();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md
index 4bb75276865..b617c60d1dd 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f45b1000cf542c50ff6d
 title: 'Problem 238: Infinite string tour'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301883
 dashedName: problem-238-infinite-string-tour
 ---
@@ -10,32 +10,33 @@ dashedName: problem-238-infinite-string-tour
 
 Create a sequence of numbers using the "Blum Blum Shub" pseudo-random number generator:
 
-s0 = 14025256 sn+1 = sn2 mod 20300713
+$$ s_0 = 14025256 \\\\
+s_{n + 1} = {s_n}^2 \\; mod \\; 20\\,300\\,713 $$
 
-Concatenate these numbers s0s1s2… to create a string w of infinite length. Then, w = 14025256741014958470038053646…
+Concatenate these numbers $s_0s_1s_2\ldots$ to create a string $w$ of infinite length. Then, $w = 14025256741014958470038053646\ldots$
 
-For a positive integer k, if no substring of w exists with a sum of digits equal to k, p(k) is defined to be zero. If at least one substring of w exists with a sum of digits equal to k, we define p(k) = z, where z is the starting position of the earliest such substring.
+For a positive integer $k$, if no substring of $w$ exists with a sum of digits equal to $k$, $p(k)$ is defined to be zero. If at least one substring of $w$ exists with a sum of digits equal to $k$, we define $p(k) = z$, where $z$ is the starting position of the earliest such substring.
 
-For instance:
+例如：
 
-The substrings 1, 14, 1402, … with respective sums of digits equal to 1, 5, 7, … start at position 1, hence p(1) = p(5) = p(7) = … = 1.
+The substrings 1, 14, 1402, … with respective sums of digits equal to 1, 5, 7, … start at position 1, hence $p(1) = p(5) = p(7) = \ldots = 1$.
 
-The substrings 4, 402, 4025, … with respective sums of digits equal to 4, 6, 11, … start at position 2, hence p(4) = p(6) = p(11) = … = 2.
+The substrings 4, 402, 4025, … with respective sums of digits equal to 4, 6, 11, … start at position 2, hence $p(4) = p(6) = p(11) = \ldots = 2$.
 
-The substrings 02, 0252, … with respective sums of digits equal to 2, 9, … start at position 3, hence p(2) = p(9) = … = 3.
+The substrings 02, 0252, … with respective sums of digits equal to 2, 9, … start at position 3, hence $p(2) = p(9) = \ldots = 3$.
 
-Note that substring 025 starting at position 3, has a sum of digits equal to 7, but there was an earlier substring (starting at position 1) with a sum of digits equal to 7, so p(7) = 1, not 3.
+Note that substring 025 starting at position 3, has a sum of digits equal to 7, but there was an earlier substring (starting at position 1) with a sum of digits equal to 7, so $p(7) = 1$, not 3.
 
-We can verify that, for 0 &lt; k ≤ 103, ∑ p(k) = 4742.
+We can verify that, for $0 &lt; k ≤ {10}^3$, $\sum p(k) = 4742$.
 
-Find ∑ p(k), for 0 &lt; k ≤ 2·1015.
+Find $\sum p(k)$, for $0 &lt; k ≤ 2 \times {10}^{15}$.
 
 # --hints--
 
-`euler238()` should return 9922545104535660.
+`infiniteStringTour()` should return `9922545104535660`.
 
 ```js
-assert.strictEqual(euler238(), 9922545104535660);
+assert.strictEqual(infiniteStringTour(), 9922545104535660);
 ```
 
 # --seed--
@@ -43,12 +44,12 @@ assert.strictEqual(euler238(), 9922545104535660);
 ## --seed-contents--
 
 ```js
-function euler238() {
+function infiniteStringTour() {
 
   return true;
 }
 
-euler238();
+infiniteStringTour();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.md
index b68783fecf6..9fff8274ba8 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f45c1000cf542c50ff6e
 title: 'Problem 239: Twenty-two Foolish Primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301884
 dashedName: problem-239-twenty-two-foolish-primes
 ---
@@ -16,10 +16,10 @@ Give your answer rounded to 12 places behind the decimal point in the form 0.abc
 
 # --hints--
 
-`euler239()` should return 0.001887854841.
+`twentyTwoFoolishPrimes()` should return `0.001887854841`.
 
 ```js
-assert.strictEqual(euler239(), 0.001887854841);
+assert.strictEqual(twentyTwoFoolishPrimes(), 0.001887854841);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler239(), 0.001887854841);
 ## --seed-contents--
 
 ```js
-function euler239() {
+function twentyTwoFoolishPrimes() {
 
   return true;
 }
 
-euler239();
+twentyTwoFoolishPrimes();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.md
index 49998335d2e..91572e2dd40 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3841000cf542c50fe97
 title: 'Problem 24: Lexicographic permutations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301885
 dashedName: problem-24-lexicographic-permutations
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-240-top-dice.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-240-top-dice.md
index 392edfa3dda..97f89f17305 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-240-top-dice.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-240-top-dice.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f45d1000cf542c50ff6f
 title: 'Problem 240: Top Dice'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301887
 dashedName: problem-240-top-dice
 ---
@@ -10,22 +10,18 @@ dashedName: problem-240-top-dice
 
 There are 1111 ways in which five 6-sided dice (sides numbered 1 to 6) can be rolled so that the top three sum to 15. Some examples are:
 
-D1,D2,D3,D4,D5 = 4,3,6,3,5
-
-D1,D2,D3,D4,D5 = 4,3,3,5,6
-
-D1,D2,D3,D4,D5 = 3,3,3,6,6
-
-D1,D2,D3,D4,D5 = 6,6,3,3,3
+$$\begin{align}   & D_1,D_2,D_3,D_4,D_5 = 4,3,6,3,5 \\\\
+  & D_1,D_2,D_3,D_4,D_5 = 4,3,3,5,6 \\\\   & D_1,D_2,D_3,D_4,D_5 = 3,3,3,6,6 \\\\
+  & D_1,D_2,D_3,D_4,D_5 = 6,6,3,3,3 \end{align}$$
 
 In how many ways can twenty 12-sided dice (sides numbered 1 to 12) be rolled so that the top ten sum to 70?
 
 # --hints--
 
-`euler240()` should return 7448717393364182000.
+`topDice()` should return `7448717393364182000`.
 
 ```js
-assert.strictEqual(euler240(), 7448717393364182000);
+assert.strictEqual(topDice(), 7448717393364182000);
 ```
 
 # --seed--
@@ -33,12 +29,12 @@ assert.strictEqual(euler240(), 7448717393364182000);
 ## --seed-contents--
 
 ```js
-function euler240() {
+function topDice() {
 
   return true;
 }
 
-euler240();
+topDice();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-241-perfection-quotients.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-241-perfection-quotients.md
index b80b7872cb4..492d3f61f8e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-241-perfection-quotients.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-241-perfection-quotients.md
@@ -1,25 +1,27 @@
 ---
 id: 5900f45d1000cf542c50ff70
 title: 'Problem 241: Perfection Quotients'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301888
 dashedName: problem-241-perfection-quotients
 ---
 
 # --description--
 
-For a positive integer n, let σ(n) be the sum of all divisors of n, so e.g. σ(6) = 1 + 2 + 3 + 6 = 12.
+For a positive integer $n$, let $σ(n)$ be the sum of all divisors of $n$, so e.g. $σ(6) = 1 + 2 + 3 + 6 = 12$.
 
-A perfect number, as you probably know, is a number with σ(n) = 2n.
+A perfect number, as you probably know, is a number with $σ(n) = 2n$.
 
-Let us define the perfection quotient of a positive integer asp(n)= σ(n)n . Find the sum of all positive integers n ≤ 1018 for which p(n) has the form k + 1⁄2, where k is an integer.
+Let us define the perfection quotient of a positive integer as $p(n) = \frac{σ(n)}{n}$.
+
+Find the sum of all positive integers $n ≤ {10}^{18}$ for which $p(n)$ has the form $k + \frac{1}{2}$, where $k$ is an integer.
 
 # --hints--
 
-`euler241()` should return 482316491800641150.
+`perfectionQuotients()` should return `482316491800641150`.
 
 ```js
-assert.strictEqual(euler241(), 482316491800641150);
+assert.strictEqual(perfectionQuotients(), 482316491800641150);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler241(), 482316491800641150);
 ## --seed-contents--
 
 ```js
-function euler241() {
+function perfectionQuotients() {
 
   return true;
 }
 
-euler241();
+perfectionQuotients();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-242-odd-triplets.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-242-odd-triplets.md
index c8eb8d360c5..abbcfca2a6a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-242-odd-triplets.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-242-odd-triplets.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f45f1000cf542c50ff71
 title: 'Problem 242: Odd Triplets'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301889
 dashedName: problem-242-odd-triplets
 ---
 
 # --description--
 
-Given the set {1,2,...,n}, we define f(n,k) as the number of its k-element subsets with an odd sum of elements. For example, f(5,3) = 4, since the set {1,2,3,4,5} has four 3-element subsets having an odd sum of elements, i.e.: {1,2,4}, {1,3,5}, {2,3,4} and {2,4,5}.
+Given the set {1,2,..., $n$}, we define $f(n, k)$ as the number of its $k$-element subsets with an odd sum of elements. For example, $f(5,3) = 4$, since the set {1,2,3,4,5} has four 3-element subsets having an odd sum of elements, i.e.: {1,2,4}, {1,3,5}, {2,3,4} and {2,4,5}.
 
-When all three values n, k and f(n,k) are odd, we say that they make an odd-triplet \[n,k,f(n,k)].
+When all three values $n$, $k$ and $f(n, k)$ are odd, we say that they make an odd-triplet $[n, k, f(n, k)]$.
 
-There are exactly five odd-triplets with n ≤ 10, namely: \[1,1,f(1,1) = 1], \[5,1,f(5,1) = 3], \[5,5,f(5,5) = 1], \[9,1,f(9,1) = 5] and \[9,9,f(9,9) = 1].
+There are exactly five odd-triplets with $n ≤ 10$, namely: $[1, 1, f(1, 1) = 1]$, $[5, 1, f(5, 1) = 3]$, $[5, 5, f(5, 5) = 1]$, $[9, 1, f(9, 1) = 5]$ and $[9, 9, f(9, 9) = 1]$.
 
-How many odd-triplets are there with n ≤ 1012 ?
+How many odd-triplets are there with $n ≤ {10}^{12}$?
 
 # --hints--
 
-`euler242()` should return 997104142249036700.
+`oddTriplets()` should return `997104142249036700`.
 
 ```js
-assert.strictEqual(euler242(), 997104142249036700);
+assert.strictEqual(oddTriplets(), 997104142249036700);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler242(), 997104142249036700);
 ## --seed-contents--
 
 ```js
-function euler242() {
+function oddTriplets() {
 
   return true;
 }
 
-euler242();
+oddTriplets();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-243-resilience.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-243-resilience.md
index 54c911233ab..67287eac731 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-243-resilience.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-243-resilience.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4601000cf542c50ff73
 title: 'Problem 243: Resilience'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301890
 dashedName: problem-243-resilience
 ---
@@ -10,18 +10,24 @@ dashedName: problem-243-resilience
 
 A positive fraction whose numerator is less than its denominator is called a proper fraction.
 
-For any denominator, d, there will be d−1 proper fractions; for example, with d = 12:1/12 , 2/12 , 3/12 , 4/12 , 5/12 , 6/12 , 7/12 , 8/12 , 9/12 , 10/12 , 11/12 .
+For any denominator, $d$, there will be $d−1$ proper fractions; for example, with $d = 12$:
 
-We shall call a fraction that cannot be cancelled down a resilient fraction. Furthermore we shall define the resilience of a denominator, R(d), to be the ratio of its proper fractions that are resilient; for example, R(12) = 4/11 . In fact, d = 12 is the smallest denominator having a resilience R(d) &lt; 4/10 .
+$$\frac{1}{12}, \frac{2}{12}, \frac{3}{12}, \frac{4}{12}, \frac{5}{12}, \frac{6}{12}, \frac{7}{12}, \frac{8}{12}, \frac{9}{12}, \frac{10}{12}, \frac{11}{12}$$
 
-Find the smallest denominator d, having a resilience R(d) &lt; 15499/94744 .
+We shall call a fraction that cannot be cancelled down a resilient fraction.
+
+Furthermore we shall define the resilience of a denominator, $R(d)$, to be the ratio of its proper fractions that are resilient; for example, $R(12) = \frac{4}{11}$.
+
+In fact, $d = 12$ is the smallest denominator having a resilience $R(d) &lt; \frac{4}{10}$.
+
+Find the smallest denominator $d$, having a resilience $R(d) &lt; \frac{15\\,499}{94\\,744}$.
 
 # --hints--
 
-`euler243()` should return 892371480.
+`resilience()` should return `892371480`.
 
 ```js
-assert.strictEqual(euler243(), 892371480);
+assert.strictEqual(resilience(), 892371480);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler243(), 892371480);
 ## --seed-contents--
 
 ```js
-function euler243() {
+function resilience() {
 
   return true;
 }
 
-euler243();
+resilience();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-244-sliders.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-244-sliders.md
index dfc2ef5931d..ebe4a76b838 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-244-sliders.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-244-sliders.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4601000cf542c50ff72
 title: 'Problem 244: Sliders'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301891
 dashedName: problem-244-sliders
 ---
@@ -10,28 +10,32 @@ dashedName: problem-244-sliders
 
 You probably know the game Fifteen Puzzle. Here, instead of numbered tiles, we have seven red tiles and eight blue tiles.
 
-A move is denoted by the uppercase initial of the direction (Left, Right, Up, Down) in which the tile is slid, e.g. starting from configuration (S), by the sequence LULUR we reach the configuration (E):
+A move is denoted by the uppercase initial of the direction (Left, Right, Up, Down) in which the tile is slid, e.g. starting from configuration ($S$), by the sequence $LULUR$ we reach the configuration ($E$):
 
-(S), (E)
+($S$) <img class="img-responsive" alt="configuration S" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliders-1.gif" style="display: inline-block; background-color: white; padding: 10px;" />, ($E$) <img class="img-responsive" alt="configuration E" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliders-2.gif" style="display: inline-block; background-color: white; padding: 10px;" />
 
 For each path, its checksum is calculated by (pseudocode):
 
-checksum = 0 checksum = (checksum × 243 + m1) mod 100 000 007 checksum = (checksum × 243 + m2) mod 100 000 007 … checksum = (checksum × 243 + mn) mod 100 000 007 where mk is the ASCII value of the kth letter in the move sequence and the ASCII values for the moves are:
+$$\begin{align}   & \text{checksum} = 0 \\\\
+  & \text{checksum} = (\text{checksum} × 243 + m_1) \\; \text{mod} \\; 100\\,000\\,007 \\\\   & \text{checksum} = (\text{checksum} × 243 + m_2) \\; \text{mod} \\; 100\\,000\\,007 \\\\
+  & \ldots \\\\ & \text{checksum} = (\text{checksum} × 243 + m_n) \\; \text{mod} \\; 100\\,000\\,007 \end{align}$$
 
-L76R82U85D68
+where $m_k$ is the ASCII value of the $k^{\text{th}}$ letter in the move sequence and the ASCII values for the moves are:
 
-For the sequence LULUR given above, the checksum would be 19761398. Now, starting from configuration (S), find all shortest ways to reach configuration (T).
+$$\begin{array}{|c|c|} \hline L & 76 \\\\ \hline R & 82 \\\\ \hline U & 85 \\\\ \hline D & 68 \\\\ \hline \end{array}$$
 
-(S), (T)
+For the sequence $LULUR$ given above, the checksum would be 19761398. Now, starting from configuration ($S$), find all shortest ways to reach configuration ($T$).
+
+($S$) <img class="img-responsive center-block" alt="configuration S" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliders-3.gif" style="display: inline-block; background-color: white; padding: 10px;" />, ($T$) <img class="img-responsive center-block" alt="configuration T" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliders-4.gif" style="display: inline-block; background-color: white; padding: 10px;" />
 
 What is the sum of all checksums for the paths having the minimal length?
 
 # --hints--
 
-`euler244()` should return 96356848.
+`sliders()` should return `96356848`.
 
 ```js
-assert.strictEqual(euler244(), 96356848);
+assert.strictEqual(sliders(), 96356848);
 ```
 
 # --seed--
@@ -39,12 +43,12 @@ assert.strictEqual(euler244(), 96356848);
 ## --seed-contents--
 
 ```js
-function euler244() {
+function sliders() {
 
   return true;
 }
 
-euler244();
+sliders();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-245-coresilience.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-245-coresilience.md
index 47fc69a5fab..c3e090d0edb 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-245-coresilience.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-245-coresilience.md
@@ -1,23 +1,31 @@
 ---
 id: 5900f4621000cf542c50ff74
 title: 'Problem 245: Coresilience'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301892
 dashedName: problem-245-coresilience
 ---
 
 # --description--
 
-We shall call a fraction that cannot be cancelled down a resilient fraction. Furthermore we shall define the resilience of a denominator, R(d), to be the ratio of its proper fractions that are resilient; for example, R(12) = 4⁄11.
+We shall call a fraction that cannot be cancelled down a resilient fraction.
 
-The resilience of a number d > 1 is then φ(d)d − 1 , where φ is Euler's totient function. We further define the coresilience of a number n > 1 as C(n)= n − φ(n)n − 1. The coresilience of a prime p is C(p) = 1p − 1. Find the sum of all composite integers 1 &lt; n ≤ 2×1011, for which C(n) is a unit fraction.
+Furthermore we shall define the resilience of a denominator, $R(d)$, to be the ratio of its proper fractions that are resilient; for example, $R(12) = \frac{4}{11}$.
+
+The resilience of a number $d > 1$ is then $\frac{φ(d)}{d − 1}$ , where $φ$ is Euler's totient function.
+
+We further define the coresilience of a number $n > 1$ as $C(n) = \frac{n − φ(n)}{n − 1}$.
+
+The coresilience of a prime $p$ is $C(p) = \frac{1}{p − 1}$.
+
+Find the sum of all composite integers $1 &lt; n ≤ 2 × {10}^{11}$, for which $C(n)$ is a unit fraction.
 
 # --hints--
 
-`euler245()` should return 288084712410001.
+`coresilience()` should return `288084712410001`.
 
 ```js
-assert.strictEqual(euler245(), 288084712410001);
+assert.strictEqual(coresilience(), 288084712410001);
 ```
 
 # --seed--
@@ -25,12 +33,12 @@ assert.strictEqual(euler245(), 288084712410001);
 ## --seed-contents--
 
 ```js
-function euler245() {
+function coresilience() {
 
   return true;
 }
 
-euler245();
+coresilience();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md
index 2d50a2e979d..50f031b33f7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4621000cf542c50ff75
-title: 'Problem 246: Tangents to an ellipse'
-challengeType: 5
+title: '问题 246：椭圆的切线'
+challengeType: 1
 forumTopicId: 301893
 dashedName: problem-246-tangents-to-an-ellipse
 ---
@@ -10,20 +10,32 @@ dashedName: problem-246-tangents-to-an-ellipse
 
 A definition for an ellipse is:
 
-Given a circle c with centre M and radius r and a point G such that d(G,M)
+Given a circle $c$ with centre $M$ and radius $r$ and a point $G$ such that $d(G, M) < r$, the locus of the points that are equidistant from $c$ and $G$ form an ellipse.
 
 The construction of the points of the ellipse is shown below.
 
-Given are the points M(-2000,1500) and G(8000,1500). Given is also the circle c with centre M and radius 15000. The locus of the points that are equidistant from G and c form an ellipse e. From a point P outside e the two tangents t1 and t2 to the ellipse are drawn. Let the points where t1 and t2 touch the ellipse be R and S.
+<img class="img-responsive center-block" alt="animation of ellipse construction" src="https://cdn.freecodecamp.org/curriculum/project-euler/tangents-to-an-ellipse-1.gif" style="background-color: white; padding: 10px;" />
 
-For how many lattice points P is angle RPS greater than 45 degrees?
+Given are the points $M(-2000, 1500)$ and $G(8000, 1500)$.
+
+Given is also the circle $c$ with centre $M$ and radius $15\\,000$.
+
+The locus of the points that are equidistant from $G$ and $c$ form an ellipse $e$.
+
+From a point $P$ outside $e$ the two tangents $t_1$ and $t_2$ to the ellipse are drawn.
+
+Let the points where $t_1$ and $t_2$ touch the ellipse be $R$ and $S$.
+
+<img class="img-responsive center-block" alt="circle c with the centre M, radius 15000, and point P outsie of ellipse e; from point P two tangents t_1 and t_2 are drawn to the ellipse, with points touching ellipse are R and S" src="https://cdn.freecodecamp.org/curriculum/project-euler/tangents-to-an-ellipse-2.gif" style="background-color: white; padding: 10px;" />
+
+For how many lattice points $P$ is angle $RPS$ greater than 45°?
 
 # --hints--
 
-`euler246()` should return 810834388.
+`tangentsToAnEllipse()` should return `810834388`.
 
 ```js
-assert.strictEqual(euler246(), 810834388);
+assert.strictEqual(tangentsToAnEllipse(), 810834388);
 ```
 
 # --seed--
@@ -31,12 +43,12 @@ assert.strictEqual(euler246(), 810834388);
 ## --seed-contents--
 
 ```js
-function euler246() {
+function tangentsToAnEllipse() {
 
   return true;
 }
 
-euler246();
+tangentsToAnEllipse();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md
index d9a5572eeac..d84036f8701 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md
@@ -1,27 +1,39 @@
 ---
 id: 5900f4641000cf542c50ff76
 title: 'Problem 247: Squares under a hyperbola'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301894
 dashedName: problem-247-squares-under-a-hyperbola
 ---
 
 # --description--
 
-Consider the region constrained by 1 ≤ x and 0 ≤ y ≤ 1/x.
+Consider the region constrained by $1 ≤ x$ and $0 ≤ y ≤ \frac{1}{x}$.
 
-Let S1 be the largest square that can fit under the curve. Let S2 be the largest square that fits in the remaining area, and so on. Let the index of Sn be the pair (left, below) indicating the number of squares to the left of Sn and the number of squares below Sn.
+Let $S_1$ be the largest square that can fit under the curve.
 
-The diagram shows some such squares labelled by number. S2 has one square to its left and none below, so the index of S2 is (1,0). It can be seen that the index of S32 is (1,1) as is the index of S50. 50 is the largest n for which the index of Sn is (1,1).
+Let $S_2$ be the largest square that fits in the remaining area, and so on.
 
-What is the largest n for which the index of Sn is (3,3)?
+Let the index of $S_n$ be the pair (left, below) indicating the number of squares to the left of $S_n$ and the number of squares below $S_n$.
+
+<img class="img-responsive center-block" alt="diagram with squares under the hyperbola" src="https://cdn.freecodecamp.org/curriculum/project-euler/squares-under-a-hyperbola.gif" style="background-color: white; padding: 10px;" />
+
+The diagram shows some such squares labelled by number.
+
+$S_2$ has one square to its left and none below, so the index of $S_2$ is (1, 0).
+
+It can be seen that the index of $S_{32}$ is (1,1) as is the index of $S_{50}$.
+
+50 is the largest $n$ for which the index of $S_n$ is (1, 1).
+
+What is the largest $n$ for which the index of $S_n$ is (3, 3)?
 
 # --hints--
 
-`euler247()` should return 782252.
+`squaresUnderAHyperbola()` should return `782252`.
 
 ```js
-assert.strictEqual(euler247(), 782252);
+assert.strictEqual(squaresUnderAHyperbola(), 782252);
 ```
 
 # --seed--
@@ -29,12 +41,12 @@ assert.strictEqual(euler247(), 782252);
 ## --seed-contents--
 
 ```js
-function euler247() {
+function squaresUnderAHyperbola() {
 
   return true;
 }
 
-euler247();
+squaresUnderAHyperbola();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md
index 1641fd73a25..0df6dd5226a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md
@@ -1,23 +1,23 @@
 ---
 id: 5900f4651000cf542c50ff77
 title: 'Problem 248: Numbers for which Euler’s totient function equals 13!'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301895
 dashedName: problem-248-numbers-for-which-eulers-totient-function-equals-13
 ---
 
 # --description--
 
-The first number n for which φ(n)=13! is 6227180929.
+The first number $n$ for which $φ(n) = 13!$ is $6\\,227\\,180\\,929$.
 
-Find the 150,000th such number.
+Find the ${150\\,000}^{\text{th}}$ such number.
 
 # --hints--
 
-`euler248()` should return 23507044290.
+`eulersTotientFunctionEquals()` should return `23507044290`.
 
 ```js
-assert.strictEqual(euler248(), 23507044290);
+assert.strictEqual(eulersTotientFunctionEquals(), 23507044290);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler248(), 23507044290);
 ## --seed-contents--
 
 ```js
-function euler248() {
+function eulersTotientFunctionEquals() {
 
   return true;
 }
 
-euler248();
+eulersTotientFunctionEquals();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md
index 71c8d1da197..b75c4e4ef9d 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4671000cf542c50ff79
 title: 'Problem 249: Prime Subset Sums'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301896
 dashedName: problem-249-prime-subset-sums
 ---
 
 # --description--
 
-Let S = {2, 3, 5, ..., 4999} be the set of prime numbers less than 5000.
+Let $S = \\{2, 3, 5, \ldots, 4999\\}$ be the set of prime numbers less than 5000.
 
-Find the number of subsets of S, the sum of whose elements is a prime number.
+Find the number of subsets of $S$, the sum of whose elements is a prime number.
 
-Enter the rightmost 16 digits as your answer.
+输入最右边的 16 位数字作为答案。
 
 # --hints--
 
-`euler249()` should return 9275262564250418.
+`primeSubsetSums()` should return `9275262564250418`.
 
 ```js
-assert.strictEqual(euler249(), 9275262564250418);
+assert.strictEqual(primeSubsetSums(), 9275262564250418);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler249(), 9275262564250418);
 ## --seed-contents--
 
 ```js
-function euler249() {
+function primeSubsetSums() {
 
   return true;
 }
 
-euler249();
+primeSubsetSums();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number.md
index ca7d277f447..3af09afe07f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f3851000cf542c50fe98
 title: 'Problem 25: 1000-digit Fibonacci number'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301897
 dashedName: problem-25-1000-digit-fibonacci-number
 ---
 
 # --description--
 
-The Fibonacci sequence is defined by the recurrence relation:
+斐波那契数列由递推关系定义：
 
 <div style='padding-left: 4em;'>F<sub>n</sub> = F<sub>n−1</sub> + F<sub>n−2</sub>, where F<sub>1</sub> = 1 and F<sub>2</sub> = 1.</div>
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-250-250250.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-250-250250.md
index 9c488260551..c526154b6e7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-250-250250.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-250-250250.md
@@ -1,21 +1,21 @@
 ---
 id: 5900f4661000cf542c50ff78
 title: 'Problem 250: 250250'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301898
 dashedName: problem-250-250250
 ---
 
 # --description--
 
-Find the number of non-empty subsets of {11, 22, 33,..., 250250250250}, the sum of whose elements is divisible by 250. Enter the rightmost 16 digits as your answer.
+Find the number of non-empty subsets of $\\{{1}^{1}, {2}^{2}, {3}^{3}, \ldots, {250250}^{250250}\\}$, the sum of whose elements is divisible by 250. Enter the rightmost 16 digits as your answer.
 
 # --hints--
 
-`euler250()` should return 1425480602091519.
+`twoHundredFifty()` should return `1425480602091519`.
 
 ```js
-assert.strictEqual(euler250(), 1425480602091519);
+assert.strictEqual(twoHundredFifty(), 1425480602091519);
 ```
 
 # --seed--
@@ -23,12 +23,12 @@ assert.strictEqual(euler250(), 1425480602091519);
 ## --seed-contents--
 
 ```js
-function euler250() {
+function twoHundredFifty() {
 
   return true;
 }
 
-euler250();
+twoHundredFifty();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.md
index 9023efb8182..8f4013595f3 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f4671000cf542c50ff7a
 title: 'Problem 251: Cardano Triplets'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301899
 dashedName: problem-251-cardano-triplets
 ---
 
 # --description--
 
-A triplet of positive integers (a,b,c) is called a Cardano Triplet if it satisfies the condition:
+A triplet of positive integers ($a$,$b$,$c$) is called a Cardano Triplet if it satisfies the condition:
+
+$$\sqrt[3]{a + b \sqrt{c}} + \sqrt[3]{a - b \sqrt{c}} = 1$$
 
 For example, (2,1,5) is a Cardano Triplet.
 
-There exist 149 Cardano Triplets for which a+b+c ≤ 1000.
+There exist 149 Cardano Triplets for which $a + b + c ≤ 1000$.
 
-Find how many Cardano Triplets exist such that a+b+c ≤ 110,000,000.
+Find how many Cardano Triplets exist such that $a + b + c ≤ 110\\,000\\,000$.
 
 # --hints--
 
-`euler251()` should return 18946051.
+`cardanoTriplets()` should return `18946051`.
 
 ```js
-assert.strictEqual(euler251(), 18946051);
+assert.strictEqual(cardanoTriplets(), 18946051);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler251(), 18946051);
 ## --seed-contents--
 
 ```js
-function euler251() {
+function cardanoTriplets() {
 
   return true;
 }
 
-euler251();
+cardanoTriplets();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-252-convex-holes.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-252-convex-holes.md
index 68251abd753..ec671c067aa 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-252-convex-holes.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-252-convex-holes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4691000cf542c50ff7b
 title: 'Problem 252: Convex Holes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301900
 dashedName: problem-252-convex-holes
 ---
@@ -12,9 +12,12 @@ Given a set of points on a plane, we define a convex hole to be a convex polygon
 
 As an example, the image below shows a set of twenty points and a few such convex holes. The convex hole shown as a red heptagon has an area equal to 1049694.5 square units, which is the highest possible area for a convex hole on the given set of points.
 
-For our example, we used the first 20 points (T2k−1, T2k), for k = 1,2,…,20, produced with the pseudo-random number generator:
+<img class="img-responsive center-block" alt="set of twenty points and convex holes on plane" src="https://cdn.freecodecamp.org/curriculum/project-euler/convex-holes.gif" style="background-color: white; padding: 10px;" />
 
-S0 = 290797 Sn+1 = Sn2 mod 50515093 Tn = ( Sn mod 2000 ) − 1000
+For our example, we used the first 20 points ($T_{2k − 1}$, $T_{2k}$), for $k = 1, 2, \ldots, 20$, produced with the pseudo-random number generator:
+
+$$\begin{align}   S_0 & = 290\\,797 \\\\
+  S_{n+1} & = {S_n}^2 \\; \text{mod} \\; 50\\,515\\,093 \\\\ T_n & = (S_n \\; \text{mod} \\; 2000) − 1000 \end{align}$$
 
 i.e. (527, 144), (−488, 732), (−454, −947), …
 
@@ -22,10 +25,10 @@ What is the maximum area for a convex hole on the set containing the first 500 p
 
 # --hints--
 
-`euler252()` should return 104924.
+`convexHoles()` should return `104924`.
 
 ```js
-assert.strictEqual(euler252(), 104924);
+assert.strictEqual(convexHoles(), 104924);
 ```
 
 # --seed--
@@ -33,12 +36,12 @@ assert.strictEqual(euler252(), 104924);
 ## --seed-contents--
 
 ```js
-function euler252() {
+function convexHoles() {
 
   return true;
 }
 
-euler252();
+convexHoles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-253-tidying-up.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-253-tidying-up.md
index 78efca2bdc3..c084198f053 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-253-tidying-up.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-253-tidying-up.md
@@ -1,35 +1,52 @@
 ---
 id: 5900f4691000cf542c50ff7c
 title: 'Problem 253: Tidying up'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301901
 dashedName: problem-253-tidying-up
 ---
 
 # --description--
 
-A small child has a “number caterpillar” consisting of forty jigsaw pieces, each with one number on it, which, when connected together in a line, reveal the numbers 1 to 40 in order.
+A small child has a "number caterpillar" consisting of forty jigsaw pieces, each with one number on it, which, when connected together in a line, reveal the numbers 1 to 40 in order.
 
-Every night, the child's father has to pick up the pieces of the caterpillar that have been scattered across the play room. He picks up the pieces at random and places them in the correct order. As the caterpillar is built up in this way, it forms distinct segments that gradually merge together. The number of segments starts at zero (no pieces placed), generally increases up to about eleven or twelve, then tends to drop again before finishing at a single segment (all pieces placed).
+Every night, the child's father has to pick up the pieces of the caterpillar that have been scattered across the play room. He picks up the pieces at random and places them in the correct order.
 
-For example:
+As the caterpillar is built up in this way, it forms distinct segments that gradually merge together. The number of segments starts at zero (no pieces placed), generally increases up to about eleven or twelve, then tends to drop again before finishing at a single segment (all pieces placed).
 
-Piece Placed Segments So Far121422936434554354……
+例如：
 
-Let M be the maximum number of segments encountered during a random tidy-up of the caterpillar. For a caterpillar of ten pieces, the number of possibilities for each M is
+| Piece Placed | Segments So Far |
+| ------------ | --------------- |
+| 12           | 1               |
+| 4            | 2               |
+| 29           | 3               |
+| 6            | 4               |
+| 34           | 5               |
+| 5            | 4               |
+| 35           | 4               |
+| …            | …               |
 
-M Possibilities1512 2250912 31815264 41418112 5144000
+Let $M$ be the maximum number of segments encountered during a random tidy-up of the caterpillar. For a caterpillar of ten pieces, the number of possibilities for each $M$ is
 
-so the most likely value of M is 3 and the average value is 385643⁄113400 = 3.400732, rounded to six decimal places.
+| M | Possibilities |
+| - | ------------- |
+| 1 | 512           |
+| 2 | 250912        |
+| 3 | 1815264       |
+| 4 | 1418112       |
+| 5 | 144000        |
 
-The most likely value of M for a forty-piece caterpillar is 11; but what is the average value of M? Give your answer rounded to six decimal places.
+so the most likely value of $M$ is 3 and the average value is $\frac{385\\,643}{113\\,400} = 3.400732$, rounded to six decimal places.
+
+The most likely value of $M$ for a forty-piece caterpillar is 11; but what is the average value of $M$? Give your answer rounded to six decimal places.
 
 # --hints--
 
-`euler253()` should return 11.492847.
+`tidyingUp()` should return `11.492847`.
 
 ```js
-assert.strictEqual(euler253(), 11.492847);
+assert.strictEqual(tidyingUp(), 11.492847);
 ```
 
 # --seed--
@@ -37,12 +54,12 @@ assert.strictEqual(euler253(), 11.492847);
 ## --seed-contents--
 
 ```js
-function euler253() {
+function tidyingUp() {
 
   return true;
 }
 
-euler253();
+tidyingUp();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.md
index 028f20783ef..3d91777d0a4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.md
@@ -1,31 +1,31 @@
 ---
 id: 5900f46b1000cf542c50ff7d
 title: 'Problem 254: Sums of Digit Factorials'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301902
 dashedName: problem-254-sums-of-digit-factorials
 ---
 
 # --description--
 
-Define f(n) as the sum of the factorials of the digits of n. For example, f(342) = 3! + 4! + 2! = 32.
+Define $f(n)$ as the sum of the factorials of the digits of $n$. For example, $f(342) = 3! + 4! + 2! = 32$.
 
-Define sf(n) as the sum of the digits of f(n). So sf(342) = 3 + 2 = 5.
+Define $sf(n)$ as the sum of the digits of $f(n)$. So $sf(342) = 3 + 2 = 5$.
 
-Define g(i) to be the smallest positive integer n such that sf(n) = i. Though sf(342) is 5, sf(25) is also 5, and it can be verified that g(5) is 25.
+Define $g(i)$ to be the smallest positive integer $n$ such that $sf(n) = i$. Though $sf(342)$ is 5, $sf(25)$ is also 5, and it can be verified that $g(5)$ is 25.
 
-Define sg(i) as the sum of the digits of g(i). So sg(5) = 2 + 5 = 7.
+Define $sg(i)$ as the sum of the digits of $g(i)$. So $sg(5) = 2 + 5 = 7$.
 
-Further, it can be verified that g(20) is 267 and ∑ sg(i) for 1 ≤ i ≤ 20 is 156.
+Further, it can be verified that $g(20)$ is 267 and $\sum sg(i)$ for $1 ≤ i ≤ 20$ is 156.
 
-What is ∑ sg(i) for 1 ≤ i ≤ 150?
+What is $\sum sg(i)$ for $1 ≤ i ≤ 150$?
 
 # --hints--
 
-`euler254()` should return 8184523820510.
+`sumsOfDigitFactorials()` should return `8184523820510`.
 
 ```js
-assert.strictEqual(euler254(), 8184523820510);
+assert.strictEqual(sumsOfDigitFactorials(), 8184523820510);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler254(), 8184523820510);
 ## --seed-contents--
 
 ```js
-function euler254() {
+function sumsOfDigitFactorials() {
 
   return true;
 }
 
-euler254();
+sumsOfDigitFactorials();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md
index 8c6acc7113e..0ea88979fce 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md
@@ -1,33 +1,50 @@
 ---
 id: 5900f46d1000cf542c50ff7f
 title: 'Problem 255: Rounded Square Roots'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301903
 dashedName: problem-255-rounded-square-roots
 ---
 
 # --description--
 
-We define the rounded-square-root of a positive integer n as the square root of n rounded to the nearest integer.
+We define the rounded-square-root of a positive integer $n$ as the square root of $n$ rounded to the nearest integer.
 
-The following procedure (essentially Heron's method adapted to integer arithmetic) finds the rounded-square-root of n: Let d be the number of digits of the number n. If d is odd, set x0 = 2×10(d-1)⁄2. If d is even, set x0 = 7×10(d-2)⁄2. Repeat:
+The following procedure (essentially Heron's method adapted to integer arithmetic) finds the rounded-square-root of $n$:
 
-until xk+1 = xk.
+Let $d$ be the number of digits of the number $n$.
 
-As an example, let us find the rounded-square-root of n = 4321.n has 4 digits, so x0 = 7×10(4-2)⁄2 = 70. Since x2 = x1, we stop here. So, after just two iterations, we have found that the rounded-square-root of 4321 is 66 (the actual square root is 65.7343137…).
+If $d$ is odd, set $x_0 = 2 × {10}^{\frac{d - 1}{2}}$.
 
-The number of iterations required when using this method is surprisingly low. For example, we can find the rounded-square-root of a 5-digit integer (10,000 ≤ n ≤ 99,999) with an average of 3.2102888889 iterations (the average value was rounded to 10 decimal places).
+If $d$ is even, set $x_0 = 7 × {10}^{\frac{d - 2}{2}}$.
 
-Using the procedure described above, what is the average number of iterations required to find the rounded-square-root of a 14-digit number (1013 ≤ n &lt; 1014)? Give your answer rounded to 10 decimal places.
+重复：
 
-Note: The symbols ⌊x⌋ and ⌈x⌉ represent the floor function and ceiling function respectively.
+$$x_{k + 1} = \left\lfloor\frac{x_k + \left\lceil\frac{n}{x_k}\right\rceil}{2}\right\rfloor$$
+
+until $x_{k + 1} = x_k$.
+
+As an example, let us find the rounded-square-root of $n = 4321$.
+
+$n$ has 4 digits, so $x_0 = 7 × {10}^{\frac{4-2}{2}} = 70$.
+
+$$x_1 = \left\lfloor\frac{70 + \left\lceil\frac{4321}{70}\right\rceil}{2}\right\rfloor = 66 \\\\
+x_2 = \left\lfloor\frac{66 + \left\lceil\frac{4321}{66}\right\rceil}{2}\right\rfloor = 66$$
+
+Since $x_2 = x_1$, we stop here. So, after just two iterations, we have found that the rounded-square-root of 4321 is 66 (the actual square root is 65.7343137…).
+
+The number of iterations required when using this method is surprisingly low. For example, we can find the rounded-square-root of a 5-digit integer ($10\\,000 ≤ n ≤ 99\\,999$) with an average of 3.2102888889 iterations (the average value was rounded to 10 decimal places).
+
+Using the procedure described above, what is the average number of iterations required to find the rounded-square-root of a 14-digit number (${10}^{13} ≤ n &lt; {10}^{14}$)? Give your answer rounded to 10 decimal places.
+
+**Note:** The symbols $⌊x⌋$ and $⌈x⌉$ represent the floor function and ceiling function respectively.
 
 # --hints--
 
-`euler255()` should return 4.447401118.
+`roundedSquareRoots()` should return `4.447401118`.
 
 ```js
-assert.strictEqual(euler255(), 4.447401118);
+assert.strictEqual(roundedSquareRoots(), 4.447401118);
 ```
 
 # --seed--
@@ -35,12 +52,12 @@ assert.strictEqual(euler255(), 4.447401118);
 ## --seed-contents--
 
 ```js
-function euler255() {
+function roundedSquareRoots() {
 
   return true;
 }
 
-euler255();
+roundedSquareRoots();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md
index 7a55e36abec..a1fba0b5f2a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f46c1000cf542c50ff7e
 title: 'Problem 256: Tatami-Free Rooms'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301904
 dashedName: problem-256-tatami-free-rooms
 ---
@@ -12,26 +12,28 @@ Tatami are rectangular mats, used to completely cover the floor of a room, witho
 
 Assuming that the only type of available tatami has dimensions 1×2, there are obviously some limitations for the shape and size of the rooms that can be covered.
 
-For this problem, we consider only rectangular rooms with integer dimensions a, b and even size s = a·b. We use the term 'size' to denote the floor surface area of the room, and — without loss of generality — we add the condition a ≤ b.
+For this problem, we consider only rectangular rooms with integer dimensions $a$, $b$ and even size $s = a \times b$. We use the term 'size' to denote the floor surface area of the room, and — without loss of generality — we add the condition $a ≤ b$.
 
 There is one rule to follow when laying out tatami: there must be no points where corners of four different mats meet. For example, consider the two arrangements below for a 4×4 room:
 
-The arrangement on the left is acceptable, whereas the one on the right is not: a red "X" in the middle, marks the point where four tatami meet.
+<img class="img-responsive center-block" alt="two arragements of mats in 4x4 room" src="https://cdn.freecodecamp.org/curriculum/project-euler/tatami-free-rooms.gif" style="background-color: white; padding: 10px;" />
 
-Because of this rule, certain even-sized rooms cannot be covered with tatami: we call them tatami-free rooms. Further, we define T(s) as the number of tatami-free rooms of size s.
+The arrangement on the left is acceptable, whereas the one on the right is not: a red "<strong><span style="color: red;">X</span></strong>" in the middle, marks the point where four tatami meet.
 
-The smallest tatami-free room has size s = 70 and dimensions 7×10. All the other rooms of size s = 70 can be covered with tatami; they are: 1×70, 2×35 and 5×14. Hence, T(70) = 1.
+Because of this rule, certain even-sized rooms cannot be covered with tatami: we call them tatami-free rooms. Further, we define $T(s)$ as the number of tatami-free rooms of size $s$.
 
-Similarly, we can verify that T(1320) = 5 because there are exactly 5 tatami-free rooms of size s = 1320: 20×66, 22×60, 24×55, 30×44 and 33×40. In fact, s = 1320 is the smallest room-size s for which T(s) = 5.
+The smallest tatami-free room has size $s = 70$ and dimensions 7×10. All the other rooms of size $s = 70$ can be covered with tatami; they are: 1×70, 2×35 and 5×14. Hence, $T(70) = 1$.
 
-Find the smallest room-size s for which T(s) = 200.
+Similarly, we can verify that $T(1320) = 5$ because there are exactly 5 tatami-free rooms of size $s = 1320$: 20×66, 22×60, 24×55, 30×44 and 33×40. In fact, $s = 1320$ is the smallest room-size $s$ for which $T(s) = 5$.
+
+Find the smallest room-size $s$ for which $T(s) = 200$.
 
 # --hints--
 
-`euler256()` should return 85765680.
+`tatamiFreeRooms()` should return `85765680`.
 
 ```js
-assert.strictEqual(euler256(), 85765680);
+assert.strictEqual(tatamiFreeRooms(), 85765680);
 ```
 
 # --seed--
@@ -39,12 +41,12 @@ assert.strictEqual(euler256(), 85765680);
 ## --seed-contents--
 
 ```js
-function euler256() {
+function tatamiFreeRooms() {
 
   return true;
 }
 
-euler256();
+tatamiFreeRooms();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
index 629b1f0340e..60864ac52e1 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f46e1000cf542c50ff80
 title: 'Problem 257: Angular Bisectors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301905
 dashedName: problem-257-angular-bisectors
 ---
 
 # --description--
 
-Given is an integer sided triangle ABC with sides a ≤ b ≤ c.
+Given is an integer sided triangle $ABC$ with sides $a ≤ b ≤ c$ ($AB = c$, $BC = a$ and $AC = b$).
 
-(AB = c, BC = a and AC = b).
+The angular bisectors of the triangle intersect the sides at points $E$, $F$ and $G$ (see picture below).
 
-The angular bisectors of the triangle intersect the sides at points E, F and G (see picture below).
+<img class="img-responsive center-block" alt="triangle ABC, with angular bisectors intersecting sides at the points E, F and G" src="https://cdn.freecodecamp.org/curriculum/project-euler/angular-bisectors.gif" style="background-color: white; padding: 10px;" />
 
-The segments EF, EG and FG partition the triangle ABC into four smaller triangles: AEG, BFE, CGF and EFG. It can be proven that for each of these four triangles the ratio area(ABC)/area(subtriangle) is rational. However, there exist triangles for which some or all of these ratios are integral.
+The segments $EF$, $EG$ and $FG$ partition the triangle $ABC$ into four smaller triangles: $AEG$, $BFE$, $CGF$ and $EFG$. It can be proven that for each of these four triangles the ratio $\frac{\text{area}(ABC)}{\text{area}(\text{subtriangle})}$ is rational. However, there exist triangles for which some or all of these ratios are integral.
 
-How many triangles ABC with perimeter≤100,000,000 exist so that the ratio area(ABC)/area(AEG) is integral?
+How many triangles $ABC$ with perimeter $≤ 100\\,000\\,000$ exist so that the ratio $\frac{\text{area}(ABC)}{\text{area}(AEG)}$ is integral?
 
 # --hints--
 
-`euler257()` should return 139012411.
+`angularBisectors()` should return `139012411`.
 
 ```js
-assert.strictEqual(euler257(), 139012411);
+assert.strictEqual(angularBisectors(), 139012411);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler257(), 139012411);
 ## --seed-contents--
 
 ```js
-function euler257() {
+function angularBisectors() {
 
   return true;
 }
 
-euler257();
+angularBisectors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.md
index 963b52807ec..fe96070791a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.md
@@ -1,23 +1,26 @@
 ---
 id: 5900f46e1000cf542c50ff81
 title: 'Problem 258: A lagged Fibonacci sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301906
 dashedName: problem-258-a-lagged-fibonacci-sequence
 ---
 
 # --description--
 
-A sequence is defined as:
+序列定义为：
 
-gk = 1, for 0 ≤ k ≤ 1999 gk = gk-2000 + gk-1999, for k ≥ 2000. Find gk mod 20092010 for k = 1018.
+- $g_k = 1$, for $0 ≤ k ≤ 1999$
+- $g_k = g_{k - 2000} + g_{k - 1999}$, for $k ≥ 2000$.
+
+Find $g_k$ mod 20092010 for $k = {10}^{18}$.
 
 # --hints--
 
-`euler258()` should return 12747994.
+`laggedFibonacciSequence()` should return `12747994`.
 
 ```js
-assert.strictEqual(euler258(), 12747994);
+assert.strictEqual(laggedFibonacciSequence(), 12747994);
 ```
 
 # --seed--
@@ -25,12 +28,12 @@ assert.strictEqual(euler258(), 12747994);
 ## --seed-contents--
 
 ```js
-function euler258() {
+function laggedFibonacciSequence() {
 
   return true;
 }
 
-euler258();
+laggedFibonacciSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-259-reachable-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-259-reachable-numbers.md
index c9eab8e6efd..a8fa3ceb470 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-259-reachable-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-259-reachable-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4701000cf542c50ff82
 title: 'Problem 259: Reachable Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301907
 dashedName: problem-259-reachable-numbers
 ---
@@ -10,16 +10,23 @@ dashedName: problem-259-reachable-numbers
 
 A positive integer will be called reachable if it can result from an arithmetic expression obeying the following rules:
 
-Uses the digits 1 through 9, in that order and exactly once each. Any successive digits can be concatenated (for example, using the digits 2, 3 and 4 we obtain the number 234). Only the four usual binary arithmetic operations (addition, subtraction, multiplication and division) are allowed. Each operation can be used any number of times, or not at all. Unary minus is not allowed. Any number of (possibly nested) parentheses may be used to define the order of operations. For example, 42 is reachable, since (1/23) *((4*5)-6) \* (78-9) = 42.
+- Uses the digits 1 through 9, in that order and exactly once each.
+- Any successive digits can be concatenated (for example, using the digits 2, 3 and 4 we obtain the number 234).
+- Only the four usual binary arithmetic operations (addition, subtraction, multiplication and division) are allowed.
+- Each operation can be used any number of times, or not at all.
+- Unary minus is not allowed.
+- Any number of (possibly nested) parentheses may be used to define the order of operations.
+
+For example, 42 is reachable, since $\frac{1}{23} \times ((4 \times 5) - 6) \times (78 - 9) = 42$.
 
 What is the sum of all positive reachable integers?
 
 # --hints--
 
-`euler259()` should return 20101196798.
+`reachableNumbers()` should return `20101196798`.
 
 ```js
-assert.strictEqual(euler259(), 20101196798);
+assert.strictEqual(reachableNumbers(), 20101196798);
 ```
 
 # --seed--
@@ -27,12 +34,12 @@ assert.strictEqual(euler259(), 20101196798);
 ## --seed-contents--
 
 ```js
-function euler259() {
+function reachableNumbers() {
 
   return true;
 }
 
-euler259();
+reachableNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-26-reciprocal-cycles.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-26-reciprocal-cycles.md
index d6ee972f907..580ba5807a3 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-26-reciprocal-cycles.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-26-reciprocal-cycles.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3861000cf542c50fe99
 title: 'Problem 26: Reciprocal cycles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301908
 dashedName: problem-26-reciprocal-cycles
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-260-stone-game.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-260-stone-game.md
index 55f0dccfd5d..d0724fd1214 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-260-stone-game.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-260-stone-game.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4701000cf542c50ff83
 title: 'Problem 260: Stone Game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301909
 dashedName: problem-260-stone-game
 ---
@@ -10,24 +10,34 @@ dashedName: problem-260-stone-game
 
 A game is played with three piles of stones and two players.
 
-At her turn, a player removes one or more stones from the piles. However, if she takes stones from more than one pile, she must remove the same number of stones from each of the selected piles.
+On each player's turn, the player removes one or more stones from the piles. However, if the player takes stones from more than one pile, the same number of stones must be removed from each of the selected piles.
 
-In other words, the player chooses some N>0 and removes: N stones from any single pile; or N stones from each of any two piles (2N total); or N stones from each of the three piles (3N total). The player taking the last stone(s) wins the game.
+In other words, the player chooses some $N > 0$ and removes:
 
-A winning configuration is one where the first player can force a win. For example, (0,0,13), (0,11,11) and (5,5,5) are winning configurations because the first player can immediately remove all stones.
+- $N$ stones from any single pile; or
+- $N$ stones from each of any two piles ($2N$ total); or
+- $N$ stones from each of the three piles ($3N$ total).
 
-A losing configuration is one where the second player can force a win, no matter what the first player does. For example, (0,1,2) and (1,3,3) are losing configurations: any legal move leaves a winning configuration for the second player.
+The player taking the last stone(s) wins the game.
 
-Consider all losing configurations (xi,yi,zi) where xi ≤ yi ≤ zi ≤ 100. We can verify that Σ(xi+yi+zi) = 173895 for these.
+A winning configuration is one where the first player can force a win.
 
-Find Σ(xi+yi+zi) where (xi,yi,zi) ranges over the losing configurations with xi ≤ yi ≤ zi ≤ 1000.
+For example, (0,0,13), (0,11,11) and (5,5,5) are winning configurations because the first player can immediately remove all stones.
+
+A losing configuration is one where the second player can force a win, no matter what the first player does.
+
+For example, (0,1,2) and (1,3,3) are losing configurations: any legal move leaves a winning configuration for the second player.
+
+Consider all losing configurations ($x_i$,$y_i$,$z_i$) where $x_i ≤ y_i ≤ z_i ≤ 100$. We can verify that $\sum (x_i + y_i + z_i) = 173\\,895$ for these.
+
+Find $\sum (x_i + y_i + z_i)$ where ($x_i$,$y_i$,$z_i$) ranges over the losing configurations with $x_i ≤ y_i ≤ z_i ≤ 1000$.
 
 # --hints--
 
-`euler260()` should return 167542057.
+`stoneGame()` should return `167542057`.
 
 ```js
-assert.strictEqual(euler260(), 167542057);
+assert.strictEqual(stoneGame(), 167542057);
 ```
 
 # --seed--
@@ -35,12 +45,12 @@ assert.strictEqual(euler260(), 167542057);
 ## --seed-contents--
 
 ```js
-function euler260() {
+function stoneGame() {
 
   return true;
 }
 
-euler260();
+stoneGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md
index b265e7910b2..af6e1b5aa27 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md
@@ -1,25 +1,31 @@
 ---
 id: 5900f4711000cf542c50ff84
 title: 'Problem 261: Pivotal Square Sums'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301910
 dashedName: problem-261-pivotal-square-sums
 ---
 
 # --description--
 
-Let us call a positive integer k a square-pivot, if there is a pair of integers m > 0 and n ≥ k, such that the sum of the (m+1) consecutive squares up to k equals the sum of the m consecutive squares from (n+1) on:
+Let us call a positive integer $k$ a square-pivot, if there is a pair of integers $m > 0$ and $n ≥ k$, such that the sum of the ($m + 1$) consecutive squares up to $k$ equals the sum of the $m$ consecutive squares from ($n + 1$) on:
 
-(k-m)2 + ... + k2 = (n+1)2 + ... + (n+m)2.
+$${(k - m)}^2 + \ldots + k^2 = {(n + 1)}^2 + \ldots + {(n + m)}^2$$
 
-Some small square-pivots are 4: 32 + 42 = 52 21: 202 + 212 = 292 24: 212 + 222 + 232 + 242 = 252 + 262 + 272 110: 1082 + 1092 + 1102 = 1332 + 1342Find the sum of all distinct square-pivots ≤ 1010.
+Some small square-pivots are
+
+$$\begin{align}   & \mathbf{4}: 3^2 + \mathbf{4}^2 = 5^2 \\\\
+  & \mathbf{21}: {20}^2 + \mathbf{21}^2 = {29}^2 \\\\   & \mathbf{24}: {21}^2 + {22}^2 + {23}^2 + \mathbf{24}^2 = {25}^2 + {26}^2 + {27}^2 \\\\
+  & \mathbf{110}: {108}^2 + {109}^2 + \mathbf{110}^2 = {133}^2 + {134}^2 \\\\ \end{align}$$
+
+Find the sum of all distinct square-pivots $≤ {10}^{10}$.
 
 # --hints--
 
-`euler261()` should return 238890850232021.
+`pivotalSquareSums()` should return `238890850232021`.
 
 ```js
-assert.strictEqual(euler261(), 238890850232021);
+assert.strictEqual(pivotalSquareSums(), 238890850232021);
 ```
 
 # --seed--
@@ -27,12 +33,12 @@ assert.strictEqual(euler261(), 238890850232021);
 ## --seed-contents--
 
 ```js
-function euler261() {
+function pivotalSquareSums() {
 
   return true;
 }
 
-euler261();
+pivotalSquareSums();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-262-mountain-range.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-262-mountain-range.md
index 01cc16de4e1..d340e834fa6 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-262-mountain-range.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-262-mountain-range.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f4731000cf542c50ff85
 title: 'Problem 262: Mountain Range'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301911
 dashedName: problem-262-mountain-range
 ---
 
 # --description--
 
-The following equation represents the continuous topography of a mountainous region, giving the elevation h at any point (x,y):
+The following equation represents the continuous topography of a mountainous region, giving the elevation $h$ at any point ($x$,$y$):
 
-A mosquito intends to fly from A(200,200) to B(1400,1400), without leaving the area given by 0 ≤ x, y ≤ 1600.
+$$h = \left(5000 - \frac{x^2 + y^2 + xy}{200} + \frac{25(x + y)}{2}\right) \times e^{-\left|\frac{x^2 + y^2}{1\\,000\\,000} - \frac{3(x + y)}{2000} + \frac{7}{10}\right|}$$
 
-Because of the intervening mountains, it first rises straight up to a point A', having elevation f. Then, while remaining at the same elevation f, it flies around any obstacles until it arrives at a point B' directly above B.
+A mosquito intends to fly from A(200,200) to B(1400,1400), without leaving the area given by $0 ≤ x$, $y ≤ 1600$.
 
-First, determine fmin which is the minimum constant elevation allowing such a trip from A to B, while remaining in the specified area. Then, find the length of the shortest path between A' and B', while flying at that constant elevation fmin.
+Because of the intervening mountains, it first rises straight up to a point A', having elevation $f$. Then, while remaining at the same elevation $f$, it flies around any obstacles until it arrives at a point B' directly above B.
+
+First, determine $f_{min}$ which is the minimum constant elevation allowing such a trip from A to B, while remaining in the specified area. Then, find the length of the shortest path between A' and B', while flying at that constant elevation $f_{min}$.
 
 Give that length as your answer, rounded to three decimal places.
 
-Note: For convenience, the elevation function shown above is repeated below, in a form suitable for most programming languages: h=( 5000-0.005*(x*x+y*y+x*y)+12.5*(x+y) )* exp( -abs(0.000001*(x*x+y*y)-0.0015*(x+y)+0.7) )
+**Note:** For convenience, the elevation function shown above is repeated below, in a form suitable for most programming languages: `h=( 5000-0.005*(x*x+y*y+x*y)+12.5*(x+y) )* exp( -abs(0.000001*(x*x+y*y)-0.0015*(x+y)+0.7) )`.
 
 # --hints--
 
-`euler262()` should return 2531.205.
+`mountainRange()` should return `2531.205`.
 
 ```js
-assert.strictEqual(euler262(), 2531.205);
+assert.strictEqual(mountainRange(), 2531.205);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler262(), 2531.205);
 ## --seed-contents--
 
 ```js
-function euler262() {
+function mountainRange() {
 
   return true;
 }
 
-euler262();
+mountainRange();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.md
index 24fca67d821..c90a065cb92 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.md
@@ -1,37 +1,40 @@
 ---
 id: 5900f4741000cf542c50ff86
-title: 'Problem 263: An engineers'' dream come true'
-challengeType: 5
+title: '问题 263：工程师的梦想成真'
+challengeType: 1
 forumTopicId: 301912
 dashedName: problem-263-an-engineers-dream-come-true
 ---
 
 # --description--
 
-Consider the number 6. The divisors of 6 are: 1,2,3 and 6.
+Consider the number 6. 6 的除数是：1、2、3 和 6。
 
 Every number from 1 up to and including 6 can be written as a sum of distinct divisors of 6:
 
-1=1, 2=2, 3=1+2, 4=1+3, 5=2+3, 6=6.
+$1 = 1$, $2 = 2$, $3 = 1 + 2$, $4 = 1 + 3$, $5 = 2 + 3$, $6 = 6$.
 
-A number n is called a practical number if every number from 1 up to and including n can be expressed as a sum of distinct divisors of n.
+A number $n$ is called a practical number if every number from 1 up to and including $n$ can be expressed as a sum of distinct divisors of $n$.
 
-A pair of consecutive prime numbers with a difference of six is called a sexy pair (since "sex" is the Latin word for "six"). The first sexy pair is (23, 29).
+A pair of consecutive prime numbers with a difference of six is called a sexy pair (since "sex" is the Latin word for "six"). 第一个性感的对是 (23, 29)。
 
 We may occasionally find a triple-pair, which means three consecutive sexy prime pairs, such that the second member of each pair is the first member of the next pair.
 
-We shall call a number n such that : (n-9, n-3), (n-3,n+3), (n+3, n+9) form a triple-pair, and the numbers n-8, n-4, n, n+4 and n+8 are all practical,
+We shall call a number $n$ such that:
 
-an engineers’ paradise.
+- ($n - 9$, $n - 3$), ($n - 3$, $n + 3$), ($n + 3$, $n + 9$) form a triple-pair, and
+- the numbers $n - 8$, $n - 4$, $n$, $n + 4$ and $n + 8$ are all practical,
+
+工程师的天堂。
 
 Find the sum of the first four engineers’ paradises.
 
 # --hints--
 
-`euler263()` should return 2039506520.
+`engineersDreamComeTrue()` should return `2039506520`.
 
 ```js
-assert.strictEqual(euler263(), 2039506520);
+assert.strictEqual(engineersDreamComeTrue(), 2039506520);
 ```
 
 # --seed--
@@ -39,12 +42,12 @@ assert.strictEqual(euler263(), 2039506520);
 ## --seed-contents--
 
 ```js
-function euler263() {
+function engineersDreamComeTrue() {
 
   return true;
 }
 
-euler263();
+engineersDreamComeTrue();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-264-triangle-centres.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-264-triangle-centres.md
index 34be7dede4c..dc22c0cf51b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-264-triangle-centres.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-264-triangle-centres.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4751000cf542c50ff87
 title: 'Problem 264: Triangle Centres'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301913
 dashedName: problem-264-triangle-centres
 ---
@@ -10,28 +10,45 @@ dashedName: problem-264-triangle-centres
 
 Consider all the triangles having:
 
-All their vertices on lattice points.
+- All their vertices on lattice points.
+- Circumcentre at the origin O.
+- Orthocentre at the point H(5, 0).
 
-Circumcentre at the origin O.
-
-Orthocentre at the point H(5, 0).
-
-There are nine such triangles having a perimeter ≤ 50.
+There are nine such triangles having a $\text{perimeter} ≤ 50$.
 
 Listed and shown in ascending order of their perimeter, they are:
 
-A(-4, 3), B(5, 0), C(4, -3) A(4, 3), B(5, 0), C(-4, -3) A(-3, 4), B(5, 0), C(3, -4) A(3, 4), B(5, 0), C(-3, -4) A(0, 5), B(5, 0), C(0, -5) A(1, 8), B(8, -1), C(-4, -7) A(8, 1), B(1, -8), C(-4, 7) A(2, 9), B(9, -2), C(-6, -7) A(9, 2), B(2, -9), C(-6, 7)
+<table>
+  <tbody>
+    <tr>
+      <td>
+A(-4, 3), B(5, 0), C(4, -3)<br>
+A(4, 3), B(5, 0), C(-4, -3)<br>
+A(-3, 4), B(5, 0), C(3, -4)<br>
+<br><br>
+A(3, 4), B(5, 0), C(-3, -4)<br>
+A(0, 5), B(5, 0), C(0, -5)<br>
+A(1, 8), B(8, -1), C(-4, -7)<br>
+<br><br>
+A(8, 1), B(1, -8), C(-4, 7)<br>
+A(2, 9), B(9, -2), C(-6, -7)<br>
+A(9, 2), B(2, -9), C(-6, 7)<br>
+      </td>
+      <td><img class="img-responsive center-block" alt="nine triangles ABC with perimeter ≤ 50" src="https://cdn.freecodecamp.org/curriculum/project-euler/triangle-centres.gif" style="background-color: white; padding: 10px;"></td>
+    </tr>
+  </tbody>
+</table>
 
 The sum of their perimeters, rounded to four decimal places, is 291.0089.
 
-Find all such triangles with a perimeter ≤ 105. Enter as your answer the sum of their perimeters rounded to four decimal places.
+Find all such triangles with a $\text{perimeter} ≤ {10}^5$. Enter as your answer the sum of their perimeters rounded to four decimal places.
 
 # --hints--
 
-`euler264()` should return 2816417.1055.
+`triangleCentres()` should return `2816417.1055`.
 
 ```js
-assert.strictEqual(euler264(), 2816417.1055);
+assert.strictEqual(triangleCentres(), 2816417.1055);
 ```
 
 # --seed--
@@ -39,12 +56,12 @@ assert.strictEqual(euler264(), 2816417.1055);
 ## --seed-contents--
 
 ```js
-function euler264() {
+function triangleCentres() {
 
   return true;
 }
 
-euler264();
+triangleCentres();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-265-binary-circles.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-265-binary-circles.md
index 0ed757aa65a..4262d97c798 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-265-binary-circles.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-265-binary-circles.md
@@ -1,31 +1,36 @@
 ---
 id: 5900f4761000cf542c50ff88
 title: 'Problem 265: Binary Circles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301914
 dashedName: problem-265-binary-circles
 ---
 
 # --description--
 
-2N binary digits can be placed in a circle so that all the N-digit clockwise subsequences are distinct.
+$2^N$ binary digits can be placed in a circle so that all the $N$-digit clockwise subsequences are distinct.
 
-For N=3, two such circular arrangements are possible, ignoring rotations:
+For $N = 3$, two such circular arrangements are possible, ignoring rotations:
+
+<img class="img-responsive center-block" alt="two circular arrangements for N = 3" src="https://cdn.freecodecamp.org/curriculum/project-euler/binary-circles.gif" style="background-color: white; padding: 10px;" />
 
 For the first arrangement, the 3-digit subsequences, in clockwise order, are: 000, 001, 010, 101, 011, 111, 110 and 100.
 
-Each circular arrangement can be encoded as a number by concatenating the binary digits starting with the subsequence of all zeros as the most significant bits and proceeding clockwise. The two arrangements for N=3 are thus represented as 23 and 29: 00010111 2 = 23 00011101 2 = 29
+Each circular arrangement can be encoded as a number by concatenating the binary digits starting with the subsequence of all zeros as the most significant bits and proceeding clockwise. The two arrangements for $N = 3$ are thus represented as 23 and 29:
 
-Calling S(N) the sum of the unique numeric representations, we can see that S(3) = 23 + 29 = 52.
+$${00010111}_2 = 23\\\\
+{00011101}_2 = 29$$
 
-Find S(5).
+Calling $S(N)$ the sum of the unique numeric representations, we can see that $S(3) = 23 + 29 = 52$.
+
+Find $S(5)$.
 
 # --hints--
 
-`euler265()` should return 209110240768.
+`binaryCircles()` should return `209110240768`.
 
 ```js
-assert.strictEqual(euler265(), 209110240768);
+assert.strictEqual(binaryCircles(), 209110240768);
 ```
 
 # --seed--
@@ -33,12 +38,12 @@ assert.strictEqual(euler265(), 209110240768);
 ## --seed-contents--
 
 ```js
-function euler265() {
+function binaryCircles() {
 
   return true;
 }
 
-euler265();
+binaryCircles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-266-pseudo-square-root.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-266-pseudo-square-root.md
index 18569d5b8e9..2b22e967efb 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-266-pseudo-square-root.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-266-pseudo-square-root.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4771000cf542c50ff89
 title: 'Problem 266: Pseudo Square Root'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301915
 dashedName: problem-266-pseudo-square-root
 ---
@@ -12,18 +12,18 @@ The divisors of 12 are: 1,2,3,4,6 and 12.
 
 The largest divisor of 12 that does not exceed the square root of 12 is 3.
 
-We shall call the largest divisor of an integer n that does not exceed the square root of n the pseudo square root (PSR) of n.
+We shall call the largest divisor of an integer $n$ that does not exceed the square root of $n$ the pseudo square root ($PSR$) of $n$.
 
-It can be seen that PSR(3102)=47.
+It can be seen that $PSR(3102) = 47$.
 
-Let p be the product of the primes below 190. Find PSR(p) mod 1016.
+Let $p$ be the product of the primes below 190. Find $PSR(p)\bmod {10}^{16}$.
 
 # --hints--
 
-`euler266()` should return 1096883702440585.
+`pseudoSquareRoot()` should return `1096883702440585`.
 
 ```js
-assert.strictEqual(euler266(), 1096883702440585);
+assert.strictEqual(pseudoSquareRoot(), 1096883702440585);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler266(), 1096883702440585);
 ## --seed-contents--
 
 ```js
-function euler266() {
+function pseudoSquareRoot() {
 
   return true;
 }
 
-euler266();
+pseudoSquareRoot();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-267-billionaire.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-267-billionaire.md
index 0c308ff3ec8..8dbe1d8ab66 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-267-billionaire.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-267-billionaire.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4771000cf542c50ff8a
 title: 'Problem 267: Billionaire'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301916
 dashedName: problem-267-billionaire
 ---
@@ -10,22 +10,22 @@ dashedName: problem-267-billionaire
 
 You are given a unique investment opportunity.
 
-Starting with £1 of capital, you can choose a fixed proportion, f, of your capital to bet on a fair coin toss repeatedly for 1000 tosses.
+Starting with £1 of capital, you can choose a fixed proportion, $f$, of your capital to bet on a fair coin toss repeatedly for 1000 tosses.
 
 Your return is double your bet for heads and you lose your bet for tails.
 
-For example, if f = 1/4, for the first toss you bet £0.25, and if heads comes up you win £0.5 and so then have £1.5. You then bet £0.375 and if the second toss is tails, you have £1.125.
+For example, if $f = \frac{1}{4}$, for the first toss you bet £0.25, and if heads comes up you win £0.5 and so then have £1.5. You then bet £0.375 and if the second toss is tails, you have £1.125.
 
-Choosing f to maximize your chances of having at least £1,000,000,000 after 1,000 flips, what is the chance that you become a billionaire?
+Choosing $f$ to maximize your chances of having at least £1,000,000,000 after 1,000 flips, what is the chance that you become a billionaire?
 
 All computations are assumed to be exact (no rounding), but give your answer rounded to 12 digits behind the decimal point in the form 0.abcdefghijkl.
 
 # --hints--
 
-`euler267()` should return 0.999992836187.
+`billionaire()` should return `0.999992836187`.
 
 ```js
-assert.strictEqual(euler267(), 0.999992836187);
+assert.strictEqual(billionaire(), 0.999992836187);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler267(), 0.999992836187);
 ## --seed-contents--
 
 ```js
-function euler267() {
+function billionaire() {
 
   return true;
 }
 
-euler267();
+billionaire();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md
index d11cb99eef8..9b062b4770a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md
@@ -1,8 +1,8 @@
 ---
 id: 5900f4791000cf542c50ff8b
 title: >-
-  Problem 268: Counting numbers with at least four distinct prime factors less than 100
-challengeType: 5
+  问题 268：计算至少有四个不同的质因数小于 100 的数
+challengeType: 1
 forumTopicId: 301917
 dashedName: >-
   problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100
@@ -10,16 +10,16 @@ dashedName: >-
 
 # --description--
 
-It can be verified that there are 23 positive integers less than 1000 that are divisible by at least four distinct primes less than 100.
+可以验证，有 23 个小于 1000 的正整数可以被至少四个不同的小于 100 的素数整除。
 
-Find how many positive integers less than 1016 are divisible by at least four distinct primes less than 100.
+Find how many positive integers less than ${10}^{16}$ are divisible by at least four distinct primes less than 100.
 
 # --hints--
 
-`euler268()` should return 785478606870985.
+`fourDistinctPrimeFactors()` should return `785478606870985`.
 
 ```js
-assert.strictEqual(euler268(), 785478606870985);
+assert.strictEqual(fourDistinctPrimeFactors(), 785478606870985);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler268(), 785478606870985);
 ## --seed-contents--
 
 ```js
-function euler268() {
+function fourDistinctPrimeFactors() {
 
   return true;
 }
 
-euler268();
+fourDistinctPrimeFactors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.md
index b4b26926105..3b66b2a2ab1 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.md
@@ -1,31 +1,37 @@
 ---
 id: 5900f4791000cf542c50ff8c
 title: 'Problem 269: Polynomials with at least one integer root'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301918
 dashedName: problem-269-polynomials-with-at-least-one-integer-root
 ---
 
 # --description--
 
-A root or zero of a polynomial P(x) is a solution to the equation P(x) = 0.
+A root or zero of a polynomial $P(x)$ is a solution to the equation $P(x) = 0$.
 
-Define Pn as the polynomial whose coefficients are the digits of n.
+Define $P_n$ as the polynomial whose coefficients are the digits of $n$.
 
-For example, P5703(x) = 5x3 + 7x2 + 3.
+For example, $P_{5703}(x) = 5x^3 + 7x^2 + 3$.
 
-We can see that:Pn(0) is the last digit of n, Pn(1) is the sum of the digits of n, Pn(10) is n itself.Define Z(k) as the number of positive integers, n, not exceeding k for which the polynomial Pn has at least one integer root.
+We can see that:
 
-It can be verified that Z(100 000) is 14696.
+- $P_n(0)$ is the last digit of $n$,
+- $P_n(1)$ is the sum of the digits of $n$,
+- $Pn(10)$ is $n$ itself.
 
-What is Z(1016)?
+Define $Z(k)$ as the number of positive integers, $n$, not exceeding $k$ for which the polynomial $P_n$ has at least one integer root.
+
+It can be verified that $Z(100\\,000)$ is 14696.
+
+What is $Z({10}^{16})$?
 
 # --hints--
 
-`euler269()` should return 1311109198529286.
+`polynomialsWithOneIntegerRoot()` should return `1311109198529286`.
 
 ```js
-assert.strictEqual(euler269(), 1311109198529286);
+assert.strictEqual(polynomialsWithOneIntegerRoot(), 1311109198529286);
 ```
 
 # --seed--
@@ -33,12 +39,12 @@ assert.strictEqual(euler269(), 1311109198529286);
 ## --seed-contents--
 
 ```js
-function euler269() {
+function polynomialsWithOneIntegerRoot() {
 
   return true;
 }
 
-euler269();
+polynomialsWithOneIntegerRoot();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-27-quadratic-primes.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-27-quadratic-primes.md
index a694ee2a595..e7c8ebe01eb 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-27-quadratic-primes.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-27-quadratic-primes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3871000cf542c50fe9a
 title: 'Problem 27: Quadratic primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301919
 dashedName: problem-27-quadratic-primes
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md
index 5d490e3b17a..6d7976182ea 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md
@@ -1,31 +1,31 @@
 ---
 id: 5900f47c1000cf542c50ff8e
-title: 'Problem 270: Cutting Squares'
-challengeType: 5
+title: '问题 270：切割方块'
+challengeType: 1
 forumTopicId: 301920
 dashedName: problem-270-cutting-squares
 ---
 
 # --description--
 
-A square piece of paper with integer dimensions N×N is placed with a corner at the origin and two of its sides along the x- and y-axes. Then, we cut it up respecting the following rules:
+A square piece of paper with integer dimensions $N×N$ is placed with a corner at the origin and two of its sides along the $x$- and $y$-axes. Then, we cut it up respecting the following rules:
 
-We only make straight cuts between two points lying on different sides of the square, and having integer coordinates.
+- We only make straight cuts between two points lying on different sides of the square, and having integer coordinates.
+- Two cuts cannot cross, but several cuts can meet at the same border point.
+- Proceed until no more legal cuts can be made.
 
-Two cuts cannot cross, but several cuts can meet at the same border point.
+Counting any reflections or rotations as distinct, we call $C(N)$ the number of ways to cut an $N×N$ square. For example, $C(1) = 2$ and $C(2) = 30$ (shown below).
 
-Proceed until no more legal cuts can be made.
+<img class="img-responsive center-block" alt="ways to cut 2x2 square, counting reflections and rotations as distinct" src="https://cdn.freecodecamp.org/curriculum/project-euler/cutting-squares.gif" style="background-color: white; padding: 10px;" />
 
-Counting any reflections or rotations as distinct, we call C(N) the number of ways to cut an N×N square. For example, C(1) = 2 and C(2) = 30 (shown below).
-
-What is C(30) mod 108 ?
+What is $C(30)\bmod {10}^8$ ?
 
 # --hints--
 
-`euler270()` should return 82282080.
+`cuttingSquares()` should return `82282080`.
 
 ```js
-assert.strictEqual(euler270(), 82282080);
+assert.strictEqual(cuttingSquares(), 82282080);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler270(), 82282080);
 ## --seed-contents--
 
 ```js
-function euler270() {
+function cuttingSquares() {
 
   return true;
 }
 
-euler270();
+cuttingSquares();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.md
index e9f9bb785cc..f1dbf4b5666 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f47b1000cf542c50ff8d
 title: 'Problem 271: Modular Cubes, part 1'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301921
 dashedName: problem-271-modular-cubes-part-1
 ---
 
 # --description--
 
-For a positive number n, define S(n) as the sum of the integers x, for which 1
+For a positive number $n$, define $S(n)$ as the sum of the integers $x$, for which $1 < x < n$ and $x^3 \equiv 1\bmod n$.
 
-When n=91, there are 8 possible values for x, namely : 9, 16, 22, 29, 53, 74, 79, 81. Thus, S(91)=9+16+22+29+53+74+79+81=363.
+When $n = 91$, there are 8 possible values for $x$, namely: 9, 16, 22, 29, 53, 74, 79, 81. Thus, $S(91) = 9 + 16 + 22 + 29 + 53 + 74 + 79 + 81 = 363$.
 
-Find S(13082761331670030).
+Find $S(13\\,082\\,761\\,331\\,670\\,030)$.
 
 # --hints--
 
-`euler271()` should return 4617456485273130000.
+`modularCubesOne()` should return `4617456485273130000`.
 
 ```js
-assert.strictEqual(euler271(), 4617456485273130000);
+assert.strictEqual(modularCubesOne(), 4617456485273130000);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler271(), 4617456485273130000);
 ## --seed-contents--
 
 ```js
-function euler271() {
+function modularCubesOne() {
 
   return true;
 }
 
-euler271();
+modularCubesOne();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.md
index 3cfb07b5b3f..d764ea6563b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f47d1000cf542c50ff8f
 title: 'Problem 272: Modular Cubes, part 2'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301922
 dashedName: problem-272-modular-cubes-part-2
 ---
 
 # --description--
 
-For a positive number n, define C(n) as the number of the integers x, for which 1
+For a positive number $n$, define $C(n)$ as the number of the integers $x$, for which $1 < x < n$ and $x^3 \equiv 1\bmod n$.
 
-When n=91, there are 8 possible values for x, namely : 9, 16, 22, 29, 53, 74, 79, 81. Thus, C(91)=8.
+When $n = 91$, there are 8 possible values for $x$, namely: 9, 16, 22, 29, 53, 74, 79, 81. Thus, $C(91) = 8$.
 
-Find the sum of the positive numbers n≤1011 for which C(n)=242.
+Find the sum of the positive numbers $n ≤ {10}^{11}$ for which $C(n)=242$.
 
 # --hints--
 
-`euler272()` should return 8495585919506151000.
+`modularCubesTwo()` should return `8495585919506151000`.
 
 ```js
-assert.strictEqual(euler272(), 8495585919506151000);
+assert.strictEqual(modularCubesTwo(), 8495585919506151000);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler272(), 8495585919506151000);
 ## --seed-contents--
 
 ```js
-function euler272() {
+function modularCubesTwo() {
 
   return true;
 }
 
-euler272();
+modularCubesTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-273-sum-of-squares.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-273-sum-of-squares.md
index 508c463ddd8..16a4fe8db1a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-273-sum-of-squares.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-273-sum-of-squares.md
@@ -1,23 +1,31 @@
 ---
 id: 5900f47e1000cf542c50ff90
-title: 'Problem 273: Sum of Squares'
-challengeType: 5
+title: '问题 273：正方形的总和'
+challengeType: 1
 forumTopicId: 301923
 dashedName: problem-273-sum-of-squares
 ---
 
 # --description--
 
-Consider equations of the form: a2 + b2 = N, 0 ≤ a ≤ b, a, b and N integer.
+Consider equations of the form: $a^2 + b^2 = N$, $0 ≤ a ≤ b$, $a$, $b$ and $N$ integer.
 
-For N=65 there are two solutions: a=1, b=8 and a=4, b=7. We call S(N) the sum of the values of a of all solutions of a2 + b2 = N, 0 ≤ a ≤ b, a, b and N integer. Thus S(65) = 1 + 4 = 5. Find ∑S(N), for all squarefree N only divisible by primes of the form 4k+1 with 4k+1 &lt; 150.
+For $N = 65$ there are two solutions:
+
+$a = 1, b = 8$ and $a = 4, b = 7$.
+
+We call $S(N)$ the sum of the values of $a$ of all solutions of $a^2 + b^2 = N$, $0 ≤ a ≤ b$, $a$, $b$ and $N$ integer.
+
+Thus $S(65) = 1 + 4 = 5$.
+
+Find $\sum S(N)$, for all squarefree $N$ only divisible by primes of the form $4k + 1$ with $4k + 1 &lt; 150$.
 
 # --hints--
 
-`euler273()` should return 2032447591196869000.
+`sumOfSquares()` should return `2032447591196869000`.
 
 ```js
-assert.strictEqual(euler273(), 2032447591196869000);
+assert.strictEqual(sumOfSquares(), 2032447591196869000);
 ```
 
 # --seed--
@@ -25,12 +33,12 @@ assert.strictEqual(euler273(), 2032447591196869000);
 ## --seed-contents--
 
 ```js
-function euler273() {
+function sumOfSquares() {
 
   return true;
 }
 
-euler273();
+sumOfSquares();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.md
index 7841b6ed8f3..bf56b697151 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.md
@@ -1,33 +1,35 @@
 ---
 id: 5900f47f1000cf542c50ff91
 title: 'Problem 274: Divisibility Multipliers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301924
 dashedName: problem-274-divisibility-multipliers
 ---
 
 # --description--
 
-For each integer p > 1 coprime to 10 there is a positive divisibility multiplier m &lt; p which preserves divisibility by p for the following function on any positive integer, n:
+For each integer $p > 1$ coprime to 10 there is a positive divisibility multiplier $m &lt; p$ which preserves divisibility by $p$ for the following function on any positive integer, $n$:
 
-f(n) = (all but the last digit of n) + (the last digit of n) \* m
+$f(n) = (\text{all but the last digit of} \\; n) + (\text{the last digit of} \\; n) \times m$
 
-That is, if m is the divisibility multiplier for p, then f(n) is divisible by p if and only if n is divisible by p.
+That is, if $m$ is the divisibility multiplier for $p$, then $f(n)$ is divisible by $p$ if and only if $n$ is divisible by $p$.
 
-(When n is much larger than p, f(n) will be less than n and repeated application of f provides a multiplicative divisibility test for p.)
+(When $n$ is much larger than $p$, $f(n)$ will be less than $n$ and repeated application of $f$ provides a multiplicative divisibility test for $p$.)
 
 For example, the divisibility multiplier for 113 is 34.
 
-f(76275) = 7627 + 5 *34 = 7797 : 76275 and 7797 are both divisible by 113f(12345) = 1234 + 5* 34 = 1404 : 12345 and 1404 are both not divisible by 113
+$f(76275) = 7627 + 5 \times 34 = 7797$: 76275 and 7797 are both divisible by 113
 
-The sum of the divisibility multipliers for the primes that are coprime to 10 and less than 1000 is 39517. What is the sum of the divisibility multipliers for the primes that are coprime to 10 and less than 107?
+$f(12345) = 1234 + 5 \times 34 = 1404$: 12345 and 1404 are both not divisible by 113
+
+The sum of the divisibility multipliers for the primes that are coprime to 10 and less than 1000 is 39517. What is the sum of the divisibility multipliers for the primes that are coprime to 10 and less than ${10}^7$?
 
 # --hints--
 
-`euler274()` should return 1601912348822.
+`divisibilityMultipliers()` should return `1601912348822`.
 
 ```js
-assert.strictEqual(euler274(), 1601912348822);
+assert.strictEqual(divisibilityMultipliers(), 1601912348822);
 ```
 
 # --seed--
@@ -35,12 +37,12 @@ assert.strictEqual(euler274(), 1601912348822);
 ## --seed-contents--
 
 ```js
-function euler274() {
+function divisibilityMultipliers() {
 
   return true;
 }
 
-euler274();
+divisibilityMultipliers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md
index a65dc0151c8..decc755a9ee 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md
@@ -1,33 +1,34 @@
 ---
 id: 5900f4801000cf542c50ff92
 title: 'Problem 275: Balanced Sculptures'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301925
 dashedName: problem-275-balanced-sculptures
 ---
 
 # --description--
 
-Let us define a balanced sculpture of order n as follows:
+Let us define a balanced sculpture of order $n$ as follows:
 
-A polyomino made up of n+1 tiles known as the blocks (n tiles) and the plinth (remaining tile);
+- A polyomino made up of $n + 1$ tiles known as the blocks ($n$ tiles) and the plinth (remaining tile);
+- the plinth has its centre at position ($x = 0$, $y = 0$);
+- the blocks have $y$-coordinates greater than zero (so the plinth is the unique lowest tile);
+- the centre of mass of all the blocks, combined, has $x$-coordinate equal to zero.
 
-the plinth has its centre at position (x = 0, y = 0);
+When counting the sculptures, any arrangements which are simply reflections about the $y$-axis, are <u>not</u> counted as distinct. For example, the 18 balanced sculptures of order 6 are shown below; note that each pair of mirror images (about the $y$-axis) is counted as one sculpture:
 
-the blocks have y-coordinates greater than zero (so the plinth is the unique lowest tile);
+<img class="img-responsive center-block" alt="18 balanced sculptures of order 6" src="https://cdn.freecodecamp.org/curriculum/project-euler/balanced-sculptures.gif" style="background-color: white; padding: 10px;" />
 
-the centre of mass of all the blocks, combined, has x-coordinate equal to zero.
+There are 964 balanced sculptures of order 10 and 360505 of order 15.
 
-When counting the sculptures, any arrangements which are simply reflections about the y-axis, are not counted as distinct. For example, the 18 balanced sculptures of order 6 are shown below; note that each pair of mirror images (about the y-axis) is counted as one sculpture:
-
-There are 964 balanced sculptures of order 10 and 360505 of order 15.How many balanced sculptures are there of order 18?
+How many balanced sculptures are there of order 18?
 
 # --hints--
 
-`euler275()` should return 15030564.
+`balancedSculptures()` should return `15030564`.
 
 ```js
-assert.strictEqual(euler275(), 15030564);
+assert.strictEqual(balancedSculptures(), 15030564);
 ```
 
 # --seed--
@@ -35,12 +36,12 @@ assert.strictEqual(euler275(), 15030564);
 ## --seed-contents--
 
 ```js
-function euler275() {
+function balancedSculptures() {
 
   return true;
 }
 
-euler275();
+balancedSculptures();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-276-primitive-triangles.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-276-primitive-triangles.md
index 0e8392e57be..26ce00839b4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-276-primitive-triangles.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-276-primitive-triangles.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4801000cf542c50ff93
 title: 'Problem 276: Primitive Triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301926
 dashedName: problem-276-primitive-triangles
 ---
 
 # --description--
 
-Consider the triangles with integer sides a, b and c with a ≤ b ≤ c.
+Consider the triangles with integer sides $a$, $b$ and $c$ with $a ≤ b ≤ c$.
 
-An integer sided triangle (a,b,c) is called primitive if gcd(a,b,c)=1.
+An integer sided triangle $(a,b,c)$ is called primitive if $gcd(a,b,c) = 1$.
 
-How many primitive integer sided triangles exist with a perimeter not exceeding 10 000 000?
+How many primitive integer sided triangles exist with a perimeter not exceeding $10\\,000\\,000$?
 
 # --hints--
 
-`euler276()` should return 5777137137739633000.
+`primitiveTriangles()` should return `5777137137739633000`.
 
 ```js
-assert.strictEqual(euler276(), 5777137137739633000);
+assert.strictEqual(primitiveTriangles(), 5777137137739633000);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler276(), 5777137137739633000);
 ## --seed-contents--
 
 ```js
-function euler276() {
+function primitiveTriangles() {
 
   return true;
 }
 
-euler276();
+primitiveTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.md
index 1f081396c26..c80635aa3d8 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.md
@@ -1,35 +1,39 @@
 ---
 id: 5900f4811000cf542c50ff94
 title: 'Problem 277: A Modified Collatz sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301927
 dashedName: problem-277-a-modified-collatz-sequence
 ---
 
 # --description--
 
-A modified Collatz sequence of integers is obtained from a starting value a1 in the following way:
+A modified Collatz sequence of integers is obtained from a starting value $a_1$ in the following way:
 
-an+1 = an/3 if an is divisible by 3. We shall denote this as a large downward step, "D".
+$a_{n + 1} = \frac{a_n}{3}$ if $a_n$ is divisible by 3. We shall denote this as a large downward step, "D".
 
-an+1 = (4an + 2)/3 if an divided by 3 gives a remainder of 1. We shall denote this as an upward step, "U".
+$a_{n + 1} = \frac{4a_n + 2}{3}$ if $a_n$ divided by 3 gives a remainder of 1. We shall denote this as an upward step, "U".
 
-an+1 = (2an - 1)/3 if an divided by 3 gives a remainder of 2. We shall denote this as a small downward step, "d".
+$a_{n + 1} = \frac{2a_n - 1}{3}$ if $a_n$ divided by 3 gives a remainder of 2. We shall denote this as a small downward step, "d".
 
-The sequence terminates when some an = 1.
+The sequence terminates when some $a_n = 1$.
 
-Given any integer, we can list out the sequence of steps. For instance if a1=231, then the sequence {an}={231,77,51,17,11,7,10,14,9,3,1} corresponds to the steps "DdDddUUdDD".
+Given any integer, we can list out the sequence of steps. For instance if $a_1 = 231$, then the sequence $\\{a_n\\} = \\{231, 77, 51, 17, 11, 7, 10, 14, 9, 3, 1\\}$ corresponds to the steps "DdDddUUdDD".
 
-Of course, there are other sequences that begin with that same sequence "DdDddUUdDD....". For instance, if a1=1004064, then the sequence is DdDddUUdDDDdUDUUUdDdUUDDDUdDD. In fact, 1004064 is the smallest possible a1 > 106 that begins with the sequence DdDddUUdDD.
+Of course, there are other sequences that begin with that same sequence "DdDddUUdDD....".
 
-What is the smallest a1 > 1015 that begins with the sequence "UDDDUdddDDUDDddDdDddDDUDDdUUDd"?
+For instance, if $a_1 = 1004064$, then the sequence is DdDddUUdDDDdUDUUUdDdUUDDDUdDD.
+
+In fact, 1004064 is the smallest possible $a_1 > {10}^6$ that begins with the sequence DdDddUUdDD.
+
+What is the smallest $a_1 > {10}^{15}$ that begins with the sequence "UDDDUdddDDUDDddDdDddDDUDDdUUDd"?
 
 # --hints--
 
-`euler277()` should return 1125977393124310.
+`modifiedCollatzSequence()` should return `1125977393124310`.
 
 ```js
-assert.strictEqual(euler277(), 1125977393124310);
+assert.strictEqual(modifiedCollatzSequence(), 1125977393124310);
 ```
 
 # --seed--
@@ -37,12 +41,12 @@ assert.strictEqual(euler277(), 1125977393124310);
 ## --seed-contents--
 
 ```js
-function euler277() {
+function modifiedCollatzSequence() {
 
   return true;
 }
 
-euler277();
+modifiedCollatzSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.md
index 6e26a6a316f..215c51cb036 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4831000cf542c50ff95
 title: 'Problem 278: Linear Combinations of Semiprimes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301928
 dashedName: problem-278-linear-combinations-of-semiprimes
 ---
 
 # --description--
 
-Given the values of integers 1 &lt; a1 &lt; a2 &lt;... &lt; an, consider the linear combination q1a1 + q2a2 + ... + qnan = b, using only integer values qk ≥ 0.
+Given the values of integers $1 &lt; a_1 &lt; a_2 &lt; \ldots &lt; a_n$, consider the linear combination $q_1a_1 + q_2a_2 + \ldots + q_na_n = b$, using only integer values $q_k ≥ 0$.
 
-Note that for a given set of ak, it may be that not all values of b are possible. For instance, if a1 = 5 and a2 = 7, there are no q1 ≥ 0 and q2 ≥ 0 such that b could be 1, 2, 3, 4, 6, 8, 9, 11, 13, 16, 18 or 23.
+Note that for a given set of $a_k$, it may be that not all values of $b$ are possible. For instance, if $a_1 = 5$ and $a_2 = 7$, there are no $q_1 ≥ 0$ and $q_2 ≥ 0$ such that $b$ could be 1, 2, 3, 4, 6, 8, 9, 11, 13, 16, 18 or 23.
 
-In fact, 23 is the largest impossible value of b for a1 = 5 and a2 = 7. We therefore call f(5, 7) = 23. Similarly, it can be shown that f(6, 10, 15)=29 and f(14, 22, 77) = 195.
+In fact, 23 is the largest impossible value of $b$ for $a_1 = 5$ and $a_2 = 7$. We therefore call $f(5, 7) = 23$. Similarly, it can be shown that $f(6, 10, 15)=29$ and $f(14, 22, 77) = 195$.
 
-Find ∑ f(p*q,p*r,q\*r), where p, q and r are prime numbers and p &lt; q &lt; r &lt; 5000.
+Find $\sum f(pq,pr,qr)$, where $p$, $q$ and $r$ are prime numbers and $p &lt; q &lt; r &lt; 5000$.
 
 # --hints--
 
-`euler278()` should return 1228215747273908500.
+`linearCombinationOfSemiprimes()` should return `1228215747273908500`.
 
 ```js
-assert.strictEqual(euler278(), 1228215747273908500);
+assert.strictEqual(linearCombinationOfSemiprimes(), 1228215747273908500);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler278(), 1228215747273908500);
 ## --seed-contents--
 
 ```js
-function euler278() {
+function linearCombinationOfSemiprimes() {
 
   return true;
 }
 
-euler278();
+linearCombinationOfSemiprimes();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.md
index 9fc673b5ea4..9d50a5ebc61 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.md
@@ -1,21 +1,21 @@
 ---
 id: 5900f4841000cf542c50ff96
 title: 'Problem 279: Triangles with integral sides and an integral angle'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301929
 dashedName: problem-279-triangles-with-integral-sides-and-an-integral-angle
 ---
 
 # --description--
 
-How many triangles are there with integral sides, at least one integral angle (measured in degrees), and a perimeter that does not exceed 108?
+How many triangles are there with integral sides, at least one integral angle (measured in degrees), and a perimeter that does not exceed ${10}^8$?
 
 # --hints--
 
-`euler279()` should return 416577688.
+`trianglesWithIntegralSidesAndAngle()` should return `416577688`.
 
 ```js
-assert.strictEqual(euler279(), 416577688);
+assert.strictEqual(trianglesWithIntegralSidesAndAngle(), 416577688);
 ```
 
 # --seed--
@@ -23,12 +23,12 @@ assert.strictEqual(euler279(), 416577688);
 ## --seed-contents--
 
 ```js
-function euler279() {
+function trianglesWithIntegralSidesAndAngle() {
 
   return true;
 }
 
-euler279();
+trianglesWithIntegralSidesAndAngle();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.md
index a476199d1dc..eee50073f68 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3881000cf542c50fe9b
 title: 'Problem 28: Number spiral diagonals'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301930
 dashedName: problem-28-number-spiral-diagonals
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-280-ant-and-seeds.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-280-ant-and-seeds.md
index 642a7d802f9..5057b8bd47c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-280-ant-and-seeds.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-280-ant-and-seeds.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4841000cf542c50ff97
 title: 'Problem 280: Ant and seeds'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301931
 dashedName: problem-280-ant-and-seeds
 ---
@@ -16,10 +16,10 @@ What's the expected number of steps until all seeds have been dropped in the top
 
 # --hints--
 
-`euler280()` should return 430.088247.
+`antAndSeeds()` should return `430.088247`.
 
 ```js
-assert.strictEqual(euler280(), 430.088247);
+assert.strictEqual(antAndSeeds(), 430.088247);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler280(), 430.088247);
 ## --seed-contents--
 
 ```js
-function euler280() {
+function antAndSeeds() {
 
   return true;
 }
 
-euler280();
+antAndSeeds();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md
index 9ac6cf33a6f..60b84a893f8 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f4861000cf542c50ff98
 title: 'Problem 281: Pizza Toppings'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301932
 dashedName: problem-281-pizza-toppings
 ---
 
 # --description--
 
-You are given a pizza (perfect circle) that has been cut into m·n equal pieces and you want to have exactly one topping on each slice.
+You are given a pizza (perfect circle) that has been cut into $m·n$ equal pieces and you want to have exactly one topping on each slice.
 
-Let f(m,n) denote the number of ways you can have toppings on the pizza with m different toppings (m ≥ 2), using each topping on exactly n slices (n ≥ 1). Reflections are considered distinct, rotations are not.
+Let $f(m,n)$ denote the number of ways you can have toppings on the pizza with $m$ different toppings ($m ≥ 2$), using each topping on exactly $n$ slices ($n ≥ 1$). Reflections are considered distinct, rotations are not.
 
-Thus, for instance, f(2,1) = 1, f(2,2) = f(3,1) = 2 and f(3,2) = 16. f(3,2) is shown below:
+Thus, for instance, $f(2,1) = 1$, $f(2,2) = f(3,1) = 2$ and $f(3,2) = 16$. $f(3,2)$ is shown below:
 
-Find the sum of all f(m,n) such that f(m,n) ≤ 1015.
+<img class="img-responsive center-block" alt="animation with 16 ways to have 3 different toppings on 2 slices each" src="https://cdn.freecodecamp.org/curriculum/project-euler/pizza-toppings.gif" style="background-color: white; padding: 10px;" />
+
+Find the sum of all $f(m,n)$ such that $f(m,n) ≤ {10}^{15}$.
 
 # --hints--
 
-`euler281()` should return 1485776387445623.
+`pizzaToppings()` should return `1485776387445623`.
 
 ```js
-assert.strictEqual(euler281(), 1485776387445623);
+assert.strictEqual(pizzaToppings(), 1485776387445623);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler281(), 1485776387445623);
 ## --seed-contents--
 
 ```js
-function euler281() {
+function pizzaToppings() {
 
   return true;
 }
 
-euler281();
+pizzaToppings();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md
index 5abd58ec44b..c9cbb75087d 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md
@@ -1,25 +1,28 @@
 ---
 id: 5900f4861000cf542c50ff99
 title: 'Problem 282: The Ackermann function'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301933
 dashedName: problem-282-the-ackermann-function
 ---
 
 # --description--
 
-For non-negative integers m, n, the Ackermann function A(m, n) is defined as follows:
+For non-negative integers $m$, $n$, the Ackermann function $A(m, n)$ is defined as follows:
 
-For example A(1, 0) = 2, A(2, 2) = 7 and A(3, 4) = 125.
+$$A(m, n) = \begin{cases} n + 1                 & \text{if $m = 0$}             \\\\
+A(m - 1, 1)           & \text{if $m > 0$ and $n = 0$} \\\\ A(m - 1, A(m, n - 1)) & \text{if $m > 0$ and $n > 0$} \end{cases}$$
 
-Find A(n, n) and give your answer mod 148.
+For example $A(1, 0) = 2$, $A(2, 2) = 7$ and $A(3, 4) = 125$.
+
+Find $\displaystyle\sum_{n = 0}^6 A(n, n)$ and give your answer mod ${14}^8$.
 
 # --hints--
 
-`euler282()` should return 1098988351.
+`ackermanFunction()` should return `1098988351`.
 
 ```js
-assert.strictEqual(euler282(), 1098988351);
+assert.strictEqual(ackermanFunction(), 1098988351);
 ```
 
 # --seed--
@@ -27,12 +30,12 @@ assert.strictEqual(euler282(), 1098988351);
 ## --seed-contents--
 
 ```js
-function euler282() {
+function ackermanFunction() {
 
   return true;
 }
 
-euler282();
+ackermanFunction();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md
index e15776ec08f..e32d0d74b9d 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md
@@ -1,8 +1,8 @@
 ---
 id: 5900f4881000cf542c50ff9a
 title: >-
-  Problem 283: Integer sided triangles for which the area * perimeter ratio is integral
-challengeType: 5
+  Problem 283: Integer sided triangles for which the area / perimeter ratio is integral
+challengeType: 1
 forumTopicId: 301934
 dashedName: >-
   problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral
@@ -12,20 +12,20 @@ dashedName: >-
 
 Consider the triangle with sides 6, 8 and 10. It can be seen that the perimeter and the area are both equal to 24.
 
-So the area/perimeter ratio is equal to 1.
+So the $\frac{\text{area}}{\text{perimeter}}$ ratio is equal to 1.
 
 Consider also the triangle with sides 13, 14 and 15. The perimeter equals 42 while the area is equal to 84.
 
-So for this triangle the area/perimeter ratio is equal to 2.
+So for this triangle the $\frac{\text{area}}{\text{perimeter}}$ ratio is equal to 2.
 
 Find the sum of the perimeters of all integer sided triangles for which the area/perimeter ratios are equal to positive integers not exceeding 1000.
 
 # --hints--
 
-`euler283()` should return 28038042525570324.
+`integralAreaPerimeterRatio()` should return `28038042525570324`.
 
 ```js
-assert.strictEqual(euler283(), 28038042525570324);
+assert.strictEqual(integralAreaPerimeterRatio(), 28038042525570324);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler283(), 28038042525570324);
 ## --seed-contents--
 
 ```js
-function euler283() {
+function integralAreaPerimeterRatio() {
 
   return true;
 }
 
-euler283();
+integralAreaPerimeterRatio();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-284-steady-squares.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-284-steady-squares.md
index 818483669ec..d6c86b00055 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-284-steady-squares.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-284-steady-squares.md
@@ -1,27 +1,33 @@
 ---
 id: 5900f4891000cf542c50ff9b
 title: 'Problem 284: Steady Squares'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301935
 dashedName: problem-284-steady-squares
 ---
 
 # --description--
 
-The 3-digit number 376 in the decimal numbering system is an example of numbers with the special property that its square ends with the same digits: 3762 = 141376. Let's call a number with this property a steady square.
+The 3-digit number 376 in the decimal numbering system is an example of numbers with the special property that its square ends with the same digits: ${376}^2 = 141376$. Let's call a number with this property a steady square.
 
-Steady squares can also be observed in other numbering systems. In the base 14 numbering system, the 3-digit number c37 is also a steady square: c372 = aa0c37, and the sum of its digits is c+3+7=18 in the same numbering system. The letters a, b, c and d are used for the 10, 11, 12 and 13 digits respectively, in a manner similar to the hexadecimal numbering system.
+Steady squares can also be observed in other numbering systems. In the base 14 numbering system, the 3-digit number $c37$ is also a steady square: $c37^2 = aa0c37$, and the sum of its digits is $c+3+7=18$ in the same numbering system. The letters $a$, $b$, $c$ and $d$ are used for the 10, 11, 12 and 13 digits respectively, in a manner similar to the hexadecimal numbering system.
 
-For 1 ≤ n ≤ 9, the sum of the digits of all the n-digit steady squares in the base 14 numbering system is 2d8 (582 decimal). Steady squares with leading 0's are not allowed.
+For $1 ≤ n ≤ 9$, the sum of the digits of all the $n$-digit steady squares in the base 14 numbering system is $2d8$ (582 decimal). Steady squares with leading 0's are not allowed.
 
-Find the sum of the digits of all the n-digit steady squares in the base 14 numbering system for 1 ≤ n ≤ 10000 (decimal) and give your answer in the base 14 system using lower case letters where necessary.
+Find the sum of the digits of all the $n$-digit steady squares in the base 14 numbering system for $1 ≤ n ≤ 10000$ (decimal) and give your answer as a string in the base 14 system using lower case letters where necessary.
 
 # --hints--
 
-`euler284()` should return 5a411d7b.
+`steadySquares()` should return a string.
 
 ```js
-assert.strictEqual(euler284(), '5a411d7b');
+assert(typeof steadySquares() === 'string');
+```
+
+`steadySquares()` should return the string `5a411d7b`.
+
+```js
+assert.strictEqual(steadySquares(), '5a411d7b');
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler284(), '5a411d7b');
 ## --seed-contents--
 
 ```js
-function euler284() {
+function steadySquares() {
 
   return true;
 }
 
-euler284();
+steadySquares();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-285-pythagorean-odds.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-285-pythagorean-odds.md
index 12ddabd7222..5c6e49167f9 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-285-pythagorean-odds.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-285-pythagorean-odds.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f48a1000cf542c50ff9c
 title: 'Problem 285: Pythagorean odds'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301936
 dashedName: problem-285-pythagorean-odds
 ---
 
 # --description--
 
-Albert chooses a positive integer k, then two real numbers a, b are randomly chosen in the interval \[0,1] with uniform distribution.
+Albert chooses a positive integer $k$, then two real numbers $a$, $b$ are randomly chosen in the interval [0,1] with uniform distribution.
 
-The square root of the sum (k·a+1)2 + (k·b+1)2 is then computed and rounded to the nearest integer. If the result is equal to k, he scores k points; otherwise he scores nothing.
+The square root of the sum ${(ka + 1)}^2 + {(kb + 1)}^2$ is then computed and rounded to the nearest integer. If the result is equal to $k$, he scores $k$ points; otherwise he scores nothing.
 
-For example, if k = 6, a = 0.2 and b = 0.85, then (k·a+1)2 + (k·b+1)2 = 42.05. The square root of 42.05 is 6.484... and when rounded to the nearest integer, it becomes 6. This is equal to k, so he scores 6 points.
+For example, if $k = 6$, $a = 0.2$ and $b = 0.85$, then ${(ka + 1)}^2 + {(kb + 1)}^2 = 42.05$. The square root of 42.05 is 6.484... and when rounded to the nearest integer, it becomes 6. This is equal to $k$, so he scores 6 points.
 
-It can be shown that if he plays 10 turns with k = 1, k = 2, ..., k = 10, the expected value of his total score, rounded to five decimal places, is 10.20914.
+It can be shown that if he plays 10 turns with $k = 1, k = 2, \ldots, k = 10$, the expected value of his total score, rounded to five decimal places, is 10.20914.
 
-If he plays 105 turns with k = 1, k = 2, k = 3, ..., k = 105, what is the expected value of his total score, rounded to five decimal places?
+If he plays ${10}^5$ turns with $k = 1, k = 2, k = 3, \ldots, k = {10}^5$, what is the expected value of his total score, rounded to five decimal places?
 
 # --hints--
 
-`euler285()` should return 157055.80999.
+`pythagoreanOdds()` should return `157055.80999`.
 
 ```js
-assert.strictEqual(euler285(), 157055.80999);
+assert.strictEqual(pythagoreanOdds(), 157055.80999);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler285(), 157055.80999);
 ## --seed-contents--
 
 ```js
-function euler285() {
+function pythagoreanOdds() {
 
   return true;
 }
 
-euler285();
+pythagoreanOdds();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-286-scoring-probabilities.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-286-scoring-probabilities.md
index abb357c47a2..0cdb23a5a44 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-286-scoring-probabilities.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-286-scoring-probabilities.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f48a1000cf542c50ff9d
-title: 'Problem 286: Scoring probabilities'
-challengeType: 5
+title: '问题 286：计分概率'
+challengeType: 1
 forumTopicId: 301937
 dashedName: problem-286-scoring-probabilities
 ---
 
 # --description--
 
-Barbara is a mathematician and a basketball player. She has found that the probability of scoring a point when shooting from a distance x is exactly (1 - x/q), where q is a real constant greater than 50.
+芭芭拉（Barbara）是数学家和篮球运动员。 She has found that the probability of scoring a point when shooting from a distance $x$ is exactly ($1 - \frac{x}{q}$), where $q$ is a real constant greater than 50.
 
-During each practice run, she takes shots from distances x = 1, x = 2, ..., x = 50 and, according to her records, she has precisely a 2 % chance to score a total of exactly 20 points.
+During each practice run, she takes shots from distances $x = 1, x = 2, \ldots, x = 50$ and, according to her records, she has precisely a 2 % chance to score a total of exactly 20 points.
 
-Find q and give your answer rounded to 10 decimal places.
+Find $q$ and give your answer rounded to 10 decimal places.
 
 # --hints--
 
-`euler286()` should return 52.6494571953.
+`scoringProbabilities()` should return `52.6494571953`.
 
 ```js
-assert.strictEqual(euler286(), 52.6494571953);
+assert.strictEqual(scoringProbabilities(), 52.6494571953);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler286(), 52.6494571953);
 ## --seed-contents--
 
 ```js
-function euler286() {
+function scoringProbabilities() {
 
   return true;
 }
 
-euler286();
+scoringProbabilities();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md
index 8d11a248e2f..3c41b354d82 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md
@@ -1,37 +1,42 @@
 ---
 id: 5900f48b1000cf542c50ff9e
 title: 'Problem 287: Quadtree encoding (a simple compression algorithm)'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301938
 dashedName: problem-287-quadtree-encoding-a-simple-compression-algorithm
 ---
 
 # --description--
 
-The quadtree encoding allows us to describe a 2N×2N black and white image as a sequence of bits (0 and 1). Those sequences are to be read from left to right like this:
+The quadtree encoding allows us to describe a $2^N×2^N$ black and white image as a sequence of bits (0 and 1). 这些序列应从左向右读取，如下所示：
 
-the first bit deals with the complete 2N×2N region;
+- the first bit deals with the complete $2^N×2^N$ region;
+- “ 0”表示拆分：
+  - the current $2^n×2^n$ region is divided into 4 sub-regions of dimension $2^{n - 1}×2^{n - 1}$,
+  - the next bits contains the description of the top left, top right, bottom left and bottom right sub-regions - in that order;
+- “10”表示当前区域只包含黑色像素；
+- "11" indicates that the current region contains only white pixels.
 
-"0" denotes a split:
+Consider the following 4×4 image (colored marks denote places where a split can occur):
 
-the current 2n×2n region is divided into 4 sub-regions of dimension 2n-1×2n-1,
+<img class="img-responsive center-block" alt="4x4 image with colored marks denoting place where split can occur" src="https://cdn.freecodecamp.org/curriculum/project-euler/quadtree-encoding-a-simple-compression-algorithm.gif" style="background-color: white; padding: 10px;" />
 
-the next bits contains the description of the top left, top right, bottom left and bottom right sub-regions - in that order;
+This image can be described by several sequences, for example : "<strong><span style="color: red">0</span></strong><strong><span style="color: blue">0</span></strong>10101010<strong><span style="color: green">0</span></strong>1011111011<strong><span style="color: orange">0</span></strong>10101010", of length 30, or "<strong><span style="color: red">0</span></strong>10<strong><span style="color: green">0</span></strong>101111101110", of length 16, which is the minimal sequence for this image.
 
-"10" indicates that the current region contains only black pixels;
+For a positive integer $N$, define $D_N$ as the $2^N×2^N$ image with the following coloring scheme:
 
-"11" indicates that the current region contains only white pixels.Consider the following 4×4 image (colored marks denote places where a split can occur):
+- the pixel with coordinates $x = 0$, $y = 0$ corresponds to the bottom left pixel,
+- if ${(x - 2^{N - 1})}^2 + {(y - 2^{N - 1})}^2 ≤ 2^{2N - 2}$ then the pixel is black,
+- otherwise the pixel is white.
 
-This image can be described by several sequences, for example : "001010101001011111011010101010", of length 30, or "0100101111101110", of length 16, which is the minimal sequence for this image.
-
-For a positive integer N, define DN as the 2N×2N image with the following coloring scheme: the pixel with coordinates x = 0, y = 0 corresponds to the bottom left pixel, if (x - 2N-1)2 + (y - 2N-1)2 ≤ 22N-2 then the pixel is black, otherwise the pixel is white.What is the length of the minimal sequence describing D24 ?
+What is the length of the minimal sequence describing $D_{24}$?
 
 # --hints--
 
-`euler287()` should return 313135496.
+`quadtreeEncoding()` should return `313135496`.
 
 ```js
-assert.strictEqual(euler287(), 313135496);
+assert.strictEqual(quadtreeEncoding(), 313135496);
 ```
 
 # --seed--
@@ -39,12 +44,12 @@ assert.strictEqual(euler287(), 313135496);
 ## --seed-contents--
 
 ```js
-function euler287() {
+function quadtreeEncoding() {
 
   return true;
 }
 
-euler287();
+quadtreeEncoding();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md
index 28a2e301ceb..cd92a15cd8c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md
@@ -1,31 +1,32 @@
 ---
 id: 5900f48d1000cf542c50ff9f
 title: 'Problem 288: An enormous factorial'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301939
 dashedName: problem-288-an-enormous-factorial
 ---
 
 # --description--
 
-For any prime p the number N(p,q) is defined by
+For any prime $p$ the number $N(p,q)$ is defined by $N(p,q) = \sum_{n=0}^q T_n \times p^n$ with $T_n$ generated by the following random number generator:
 
-N(p,q) = ∑n=0 to q Tn\*pn with Tn generated by the following random number generator:
+$$\begin{align}   & S_0 = 290797 \\\\
+  & S_{n + 1} = {S_n}^2\bmod 50\\,515\\,093 \\\\ & T_n = S_n\bmod p \end{align}$$
 
-S0 = 290797 Sn+1 = Sn2 mod 50515093 Tn = Sn mod p
+Let $Nfac(p,q)$ be the factorial of $N(p,q)$.
 
-Let Nfac(p,q) be the factorial of N(p,q). Let NF(p,q) be the number of factors p in Nfac(p,q).
+Let $NF(p,q)$ be the number of factors $p$ in $Nfac(p,q)$.
 
-You are given that NF(3,10000) mod 320=624955285.
+You are given that $NF(3,10000) \bmod 3^{20} = 624\\,955\\,285$.
 
-Find NF(61,107) mod 6110
+Find $NF(61,{10}^7)\bmod {61}^{10}$.
 
 # --hints--
 
-`euler288()` should return 605857431263982000.
+`enormousFactorial()` should return `605857431263982000`.
 
 ```js
-assert.strictEqual(euler288(), 605857431263982000);
+assert.strictEqual(enormousFactorial(), 605857431263982000);
 ```
 
 # --seed--
@@ -33,12 +34,12 @@ assert.strictEqual(euler288(), 605857431263982000);
 ## --seed-contents--
 
 ```js
-function euler288() {
+function enormousFactorial() {
 
   return true;
 }
 
-euler288();
+enormousFactorial();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md
index fcac68664d9..e491cab3612 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f48d1000cf542c50ffa0
 title: 'Problem 289: Eulerian Cycles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301940
 dashedName: problem-289-eulerian-cycles
 ---
 
 # --description--
 
-Let C(x,y) be a circle passing through the points (x, y), (x, y+1), (x+1, y) and (x+1, y+1).
+Let $C(x,y)$ be a circle passing through the points ($x$, $y$), ($x$, $y + 1$), ($x + 1$, $y$) and ($x + 1$, $y + 1$).
 
-For positive integers m and n, let E(m,n) be a configuration which consists of the m·n circles: { C(x,y): 0 ≤ x &lt; m, 0 ≤ y &lt; n, x and y are integers }
+For positive integers $m$ and $n$, let $E(m,n)$ be a configuration which consists of the $m·n$ circles: { $C(x,y)$: $0 ≤ x &lt; m$, $0 ≤ y &lt; n$, $x$ and $y$ are integers }
 
-An Eulerian cycle on E(m,n) is a closed path that passes through each arc exactly once. Many such paths are possible on E(m,n), but we are only interested in those which are not self-crossing: A non-crossing path just touches itself at lattice points, but it never crosses itself.
+An Eulerian cycle on $E(m,n)$ is a closed path that passes through each arc exactly once. Many such paths are possible on $E(m,n)$, but we are only interested in those which are not self-crossing: A non-crossing path just touches itself at lattice points, but it never crosses itself.
 
-The image below shows E(3,3) and an example of an Eulerian non-crossing path.
+The image below shows $E(3,3)$ and an example of an Eulerian non-crossing path.
 
-Let L(m,n) be the number of Eulerian non-crossing paths on E(m,n). For example, L(1,2) = 2, L(2,2) = 37 and L(3,3) = 104290.
+<img class="img-responsive center-block" alt="Eulerian cycle E(3, 3) and Eulerian non-crossing path" src="https://cdn.freecodecamp.org/curriculum/project-euler/eulerian-cycles.gif" style="background-color: white; padding: 10px;" />
 
-Find L(6,10) mod 1010.
+Let $L(m,n)$ be the number of Eulerian non-crossing paths on $E(m,n)$. For example, $L(1,2) = 2$, $L(2,2) = 37$ and $L(3,3) = 104290$.
+
+Find $L(6,10)\bmod {10}^{10}$.
 
 # --hints--
 
-`euler289()` should return 6567944538.
+`eulerianCycles()` should return `6567944538`.
 
 ```js
-assert.strictEqual(euler289(), 6567944538);
+assert.strictEqual(eulerianCycles(), 6567944538);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler289(), 6567944538);
 ## --seed-contents--
 
 ```js
-function euler289() {
+function eulerianCycles() {
 
   return true;
 }
 
-euler289();
+eulerianCycles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
index 28c05dfc85d..4b8f00162ee 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f3891000cf542c50fe9c
 title: 'Problem 29: Distinct powers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301941
 dashedName: problem-29-distinct-powers
 ---
 
 # --description--
 
-Consider all integer combinations of ab for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
+Consider all integer combinations of $a^b$ for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
 
 <div style='padding-left: 4em;'>
   2<sup>2</sup>=4, 2<sup>3</sup>=8, 2<sup>4</sup>=16, 2<sup>5</sup>=32 <br>
@@ -23,7 +23,7 @@ If they are then placed in numerical order, with any repeats removed, we get the
   4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
 </div>
 
-How many distinct terms are in the sequence generated by `ab` for 2 ≤ `a` ≤ `n` and 2 ≤ `b` ≤ `n`?
+How many distinct terms are in the sequence generated by $a^b$ for 2 ≤ `a` ≤ `n` and 2 ≤ `b` ≤ `n`?
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-290-digital-signature.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-290-digital-signature.md
index e46dfedd830..a6b3636eefd 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-290-digital-signature.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-290-digital-signature.md
@@ -1,21 +1,21 @@
 ---
 id: 5900f48f1000cf542c50ffa1
 title: 'Problem 290: Digital Signature'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301942
 dashedName: problem-290-digital-signature
 ---
 
 # --description--
 
-How many integers 0 ≤ n &lt; 1018 have the property that the sum of the digits of n equals the sum of digits of 137n?
+How many integers $0 ≤ n &lt; {10}^{18}$ have the property that the sum of the digits of $n$ equals the sum of digits of $137n$?
 
 # --hints--
 
-`euler290()` should return 20444710234716470.
+`digitalSignature()` should return `20444710234716470`.
 
 ```js
-assert.strictEqual(euler290(), 20444710234716470);
+assert.strictEqual(digitalSignature(), 20444710234716470);
 ```
 
 # --seed--
@@ -23,12 +23,12 @@ assert.strictEqual(euler290(), 20444710234716470);
 ## --seed-contents--
 
 ```js
-function euler290() {
+function digitalSignature() {
 
   return true;
 }
 
-euler290();
+digitalSignature();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.md
index 0c7d704d9f4..bb33727271a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.md
@@ -1,23 +1,23 @@
 ---
 id: 5900f48f1000cf542c50ffa2
 title: 'Problem 291: Panaitopol Primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301943
 dashedName: problem-291-panaitopol-primes
 ---
 
 # --description--
 
-A prime number p is called a Panaitopol prime if for some positive integersx and y.
+A prime number $p$ is called a Panaitopol prime if $p = \frac{x^4 - y^4}{x^3 + y^3}$ for some positive integers $x$ and $y$.
 
-Find how many Panaitopol primes are less than 5×1015.
+Find how many Panaitopol primes are less than $5 × {10}^{15}$.
 
 # --hints--
 
-`euler291()` should return 4037526.
+`panaitopolPrimes()` should return `4037526`.
 
 ```js
-assert.strictEqual(euler291(), 4037526);
+assert.strictEqual(panaitopolPrimes(), 4037526);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler291(), 4037526);
 ## --seed-contents--
 
 ```js
-function euler291() {
+function panaitopolPrimes() {
 
   return true;
 }
 
-euler291();
+panaitopolPrimes();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.md
index 446e8755315..8e0dd899454 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.md
@@ -1,31 +1,34 @@
 ---
 id: 5900f4911000cf542c50ffa3
 title: 'Problem 292: Pythagorean Polygons'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301944
 dashedName: problem-292-pythagorean-polygons
 ---
 
 # --description--
 
-We shall define a pythagorean polygon to be a convex polygon with the following properties:there are at least three vertices,
+We shall define a pythagorean polygon to be a convex polygon with the following properties:
 
-no three vertices are aligned,
+- there are at least three vertices,
+- no three vertices are aligned,
+- each vertex has integer coordinates,
+- each edge has integer length.
 
-each vertex has integer coordinates,
-
-each edge has integer length.For a given integer n, define P(n) as the number of distinct pythagorean polygons for which the perimeter is ≤ n.
+For a given integer $n$, define $P(n)$ as the number of distinct pythagorean polygons for which the perimeter is $≤ n$.
 
 Pythagorean polygons should be considered distinct as long as none is a translation of another.
 
-You are given that P(4) = 1, P(30) = 3655 and P(60) = 891045. Find P(120).
+You are given that $P(4) = 1$, $P(30) = 3655$ and $P(60) = 891045$.
+
+Find $P(120)$.
 
 # --hints--
 
-`euler292()` should return 3600060866.
+`pythagoreanPolygons()` should return `3600060866`.
 
 ```js
-assert.strictEqual(euler292(), 3600060866);
+assert.strictEqual(pythagoreanPolygons(), 3600060866);
 ```
 
 # --seed--
@@ -33,12 +36,12 @@ assert.strictEqual(euler292(), 3600060866);
 ## --seed-contents--
 
 ```js
-function euler292() {
+function pythagoreanPolygons() {
 
   return true;
 }
 
-euler292();
+pythagoreanPolygons();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.md
index 18307e7b042..565c786eaa5 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f4931000cf542c50ffa4
-title: 'Problem 293: Pseudo-Fortunate Numbers'
-challengeType: 5
+title: '问题 293：伪幸运数'
+challengeType: 1
 forumTopicId: 301945
 dashedName: problem-293-pseudo-fortunate-numbers
 ---
 
 # --description--
 
-An even positive integer N will be called admissible, if it is a power of 2 or its distinct prime factors are consecutive primes.
+An even positive integer $N$ will be called admissible, if it is a power of 2 or its distinct prime factors are consecutive primes.
 
-The first twelve admissible numbers are 2,4,6,8,12,16,18,24,30,32,36,48.
+The first twelve admissible numbers are 2, 4, 6, 8, 12, 16, 18, 24, 30, 32, 36, 48.
 
-If N is admissible, the smallest integer M > 1 such that N+M is prime, will be called the pseudo-Fortunate number for N.
+If $N$ is admissible, the smallest integer $M > 1$ such that $N + M$ is prime, will be called the pseudo-Fortunate number for $N$.
 
-For example, N=630 is admissible since it is even and its distinct prime factors are the consecutive primes 2,3,5 and 7. The next prime number after 631 is 641; hence, the pseudo-Fortunate number for 630 is M=11. It can also be seen that the pseudo-Fortunate number for 16 is 3.
+For example, $N = 630$ is admissible since it is even and its distinct prime factors are the consecutive primes 2, 3, 5 and 7. The next prime number after 631 is 641; hence, the pseudo-Fortunate number for 630 is $M = 11$. It can also be seen that the pseudo-Fortunate number for 16 is 3.
 
-Find the sum of all distinct pseudo-Fortunate numbers for admissible numbers N less than 109.
+Find the sum of all distinct pseudo-Fortunate numbers for admissible numbers $N$ less than ${10}^9$.
 
 # --hints--
 
-`euler293()` should return 2209.
+`pseudoFortunateNumbers()` should return `2209`.
 
 ```js
-assert.strictEqual(euler293(), 2209);
+assert.strictEqual(pseudoFortunateNumbers(), 2209);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler293(), 2209);
 ## --seed-contents--
 
 ```js
-function euler293() {
+function pseudoFortunateNumbers() {
 
   return true;
 }
 
-euler293();
+pseudoFortunateNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.md
index b7bc62a5f13..b32ebc882de 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.md
@@ -1,29 +1,30 @@
 ---
 id: 5900f4931000cf542c50ffa5
 title: 'Problem 294: Sum of digits - experience #23'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301946
 dashedName: problem-294-sum-of-digits---experience-23
 ---
 
 # --description--
 
-For a positive integer k, define d(k) as the sum of the digits of k in its usual decimal representation.
+For a positive integer $k$, define $d(k)$ as the sum of the digits of $k$ in its usual decimal representation. Thus $d(42) = 4 + 2 = 6$.
 
-Thus d(42) = 4+2 = 6.
+For a positive integer $n$, define $S(n)$ as the number of positive integers $k &lt; {10}^n$ with the following properties:
 
-For a positive integer n, define S(n) as the number of positive integers k &lt; 10n with the following properties : k is divisible by 23 and d(k) = 23.
+- $k$ is divisible by 23 and,
+- $d(k) = 23$.
 
-You are given that S(9) = 263626 and S(42) = 6377168878570056.
+You are given that $S(9) = 263\\,626$ and $S(42) = 6\\,377\\,168\\,878\\,570\\,056$.
 
-Find S(1112) and give your answer mod 109.
+Find $S({11}^{12})$ and give your answer $\bmod {10}^9$.
 
 # --hints--
 
-`euler294()` should return 789184709.
+`experience23()` should return `789184709`.
 
 ```js
-assert.strictEqual(euler294(), 789184709);
+assert.strictEqual(experience23(), 789184709);
 ```
 
 # --seed--
@@ -31,12 +32,12 @@ assert.strictEqual(euler294(), 789184709);
 ## --seed-contents--
 
 ```js
-function euler294() {
+function experience23() {
 
   return true;
 }
 
-euler294();
+experience23();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md
index 70d1de6d608..960e561d9c4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4931000cf542c50ffa6
 title: 'Problem 295: Lenticular holes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301947
 dashedName: problem-295-lenticular-holes
 ---
@@ -10,30 +10,33 @@ dashedName: problem-295-lenticular-holes
 
 We call the convex area enclosed by two circles a lenticular hole if:
 
-The centres of both circles are on lattice points.
+- 两个圆的中心都在晶格点上。
+- 两个圆在两个不同的晶格点处相交。
+- 被两个圆包围的凸区域的内部不包含任何晶格点。
 
-The two circles intersect at two distinct lattice points.
+Consider the circles:
 
-The interior of the convex area enclosed by both circles does not contain any lattice points.
+$$\begin{align}   & C_0: x^2 + y^2 = 25 \\\\
+  & C_1: {(x + 4)}^2 + {(y - 4)}^2 = 1 \\\\ & C_2: {(x - 12)}^2 + {(y - 4)}^2 = 65 \end{align}$$
 
-Consider the circles: C0: x2+y2=25 C1: (x+4)2+(y-4)2=1 C2: (x-12)2+(y-4)2=65
+The circles $C_0$, $C_1$ and $C_2$ are drawn in the picture below.
 
-The circles C0, C1 and C2 are drawn in the picture below.
+<img class="img-responsive center-block" alt="C_0, C_1 and C_2 circles" src="https://cdn.freecodecamp.org/curriculum/project-euler/lenticular-holes.gif" style="background-color: white; padding: 10px;" />
 
-C0 and C1 form a lenticular hole, as well as C0 and C2.
+$C_0$ and $C_1$ form a lenticular hole, as well as $C_0$ and $C_2$.
 
-We call an ordered pair of positive real numbers (r1, r2) a lenticular pair if there exist two circles with radii r1 and r2 that form a lenticular hole. We can verify that (1, 5) and (5, √65) are the lenticular pairs of the example above.
+We call an ordered pair of positive real numbers ($r_1$, $r_2$) a lenticular pair if there exist two circles with radii $r_1$ and $r_2$ that form a lenticular hole. We can verify that ($1$, $5$) and ($5$, $\sqrt{65}$) are the lenticular pairs of the example above.
 
-Let L(N) be the number of distinct lenticular pairs (r1, r2) for which 0 &lt; r1 ≤ r2 ≤ N. We can verify that L(10) = 30 and L(100) = 3442.
+Let $L(N)$ be the number of distinct lenticular pairs ($r_1$, $r_2$) for which $0 &lt; r_1 ≤ r_2 ≤ N$. We can verify that $L(10) = 30$ and $L(100) = 3442$.
 
-Find L(100 000).
+Find $L(100\\,000)$.
 
 # --hints--
 
-`euler295()` should return 4884650818.
+`lenticularHoles()` should return `4884650818`.
 
 ```js
-assert.strictEqual(euler295(), 4884650818);
+assert.strictEqual(lenticularHoles(), 4884650818);
 ```
 
 # --seed--
@@ -41,12 +44,12 @@ assert.strictEqual(euler295(), 4884650818);
 ## --seed-contents--
 
 ```js
-function euler295() {
+function lenticularHoles() {
 
   return true;
 }
 
-euler295();
+lenticularHoles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md
index 0d269dca3cc..660d66eabb4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md
@@ -1,25 +1,27 @@
 ---
 id: 5900f4941000cf542c50ffa7
 title: 'Problem 296: Angular Bisector and Tangent'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301948
 dashedName: problem-296-angular-bisector-and-tangent
 ---
 
 # --description--
 
-Given is an integer sided triangle ABC with BC ≤ AC ≤ AB.k is the angular bisector of angle ACB.m is the tangent at C to the circumscribed circle of ABC.n is a line parallel to m through B.
+Given is an integer sided triangle $ABC$ with $BC ≤ AC ≤ AB$. $k$ is the angular bisector of angle $ACB$. $m$ is the tangent at $C$ to the circumscribed circle of $ABC$. $n$ is a line parallel to $m$ through $B$.
 
-The intersection of n and k is called E.
+The intersection of $n$ and $k$ is called $E$.
 
-How many triangles ABC with a perimeter not exceeding 100 000 exist such that BE has integral length?
+<img class="img-responsive center-block" alt="triangle ABC, with k - the angular bisector of angle ACB, m - tangent at point C, n - line parallel to m through B, and point E - intersection of k and n" src="https://cdn.freecodecamp.org/curriculum/project-euler/angular-bisector-and-tangent.gif" style="background-color: white; padding: 10px;" />
+
+How many triangles $ABC$ with a perimeter not exceeding $100\\,000$ exist such that $BE$ has integral length?
 
 # --hints--
 
-`euler296()` should return 1137208419.
+`angularBisectorAndTangent()` should return `1137208419`.
 
 ```js
-assert.strictEqual(euler296(), 1137208419);
+assert.strictEqual(angularBisectorAndTangent(), 1137208419);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler296(), 1137208419);
 ## --seed-contents--
 
 ```js
-function euler296() {
+function angularBisectorAndTangent() {
 
   return true;
 }
 
-euler296();
+angularBisectorAndTangent();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.md
index 55d96b520c6..55f3adbfd1c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4951000cf542c50ffa8
 title: 'Problem 297: Zeckendorf Representation'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301949
 dashedName: problem-297-zeckendorf-representation
 ---
@@ -12,18 +12,24 @@ Each new term in the Fibonacci sequence is generated by adding the previous two
 
 Starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89.
 
-Every positive integer can be uniquely written as a sum of nonconsecutive terms of the Fibonacci sequence. For example, 100 = 3 + 8 + 89. Such a sum is called the Zeckendorf representation of the number.
+Every positive integer can be uniquely written as a sum of nonconsecutive terms of the Fibonacci sequence. For example, 100 = 3 + 8 + 89.
 
-For any integer n>0, let z(n) be the number of terms in the Zeckendorf representation of n. Thus, z(5) = 1, z(14) = 2, z(100) = 3 etc. Also, for 0&lt;n&lt;106, ∑ z(n) = 7894453.
+Such a sum is called the Zeckendorf representation of the number.
 
-Find ∑ z(n) for 0&lt;n&lt;1017.
+For any integer $n>0$, let $z(n)$ be the number of terms in the Zeckendorf representation of $n$.
+
+Thus, $z(5) = 1$, $z(14) = 2$, $z(100) = 3$ etc.
+
+Also, for $0 &lt; n &lt; {10}^6$, $\sum z(n) = 7\\,894\\,453$.
+
+Find $\sum z(n)$ for $0 &lt; n &lt; {10}^{17}$.
 
 # --hints--
 
-`euler297()` should return 2252639041804718000.
+`zeckendorfRepresentation()` should return `2252639041804718000`.
 
 ```js
-assert.strictEqual(euler297(), 2252639041804718000);
+assert.strictEqual(zeckendorfRepresentation(), 2252639041804718000);
 ```
 
 # --seed--
@@ -31,12 +37,12 @@ assert.strictEqual(euler297(), 2252639041804718000);
 ## --seed-contents--
 
 ```js
-function euler297() {
+function zeckendorfRepresentation() {
 
   return true;
 }
 
-euler297();
+zeckendorfRepresentation();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md
index a9c0c8ad7e0..b347161eaf2 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md
@@ -1,27 +1,40 @@
 ---
 id: 5900f4971000cf542c50ffa9
-title: 'Problem 298: Selective Amnesia'
-challengeType: 5
+title: '问题 298：选择性健忘症'
+challengeType: 1
 forumTopicId: 301950
 dashedName: problem-298-selective-amnesia
 ---
 
 # --description--
 
-Larry and Robin play a memory game involving of a sequence of random numbers between 1 and 10, inclusive, that are called out one at a time. Each player can remember up to 5 previous numbers. When the called number is in a player's memory, that player is awarded a point. If it's not, the player adds the called number to his memory, removing another number if his memory is full.
+拉里（Larry）和罗宾（Robin）玩着一场记忆游戏，其中涉及一个随机数序列，介于1到10之间（含1和10），每次被召唤一个。 每个玩家最多可以记住 5 个先前的数字。 当被叫号码在玩家的记忆中时，该玩家将获得积分。 如果不是，玩家将被叫号码添加到他的记忆中，如果他的记忆已满，则删除另一个号码。
 
-Both players start with empty memories. Both players always add new missed numbers to their memory but use a different strategy in deciding which number to remove: Larry's strategy is to remove the number that hasn't been called in the longest time. Robin's strategy is to remove the number that's been in the memory the longest time.
+两位选手都从空白的记忆开始。 两个玩家总是在他们的记忆中添加新的错过的号码，但在决定删除哪个号码时使用不同的策略：拉里的策略是删除最长时间没有被叫到的号码。 Robin 的策略是删除记忆中最长时间的数字。
 
-Example game:Turn Callednumber Larry'smemory Larry'sscore Robin'smemory Robin'sscore 1 1 1 0 1 0 2 2 1,2 0 1,2 0 3 4 1,2,4 0 1,2,4 0 4 6 1,2,4,6 0 1,2,4,6 0 5 1 1,2,4,6 1 1,2,4,6 1 6 8 1,2,4,6,8 1 1,2,4,6,8 1 7 10 1,4,6,8,10 1 2,4,6,8,10 1 8 2 1,2,6,8,10 1 2,4,6,8,10 2 9 4 1,2,4,8,10 1 2,4,6,8,10 3 10 1 1,2,4,8,10 2 1,4,6,8,10 3
+Example game:
 
-Denoting Larry's score by L and Robin's score by R, what is the expected value of |L-R| after 50 turns? Give your answer rounded to eight decimal places using the format x.xxxxxxxx .
+| Turn | Called number | Larry's memory | Larry's score | Robin's memory | Robin's score |
+| ---- | ------------- | --------------:| ------------- | -------------- | ------------- |
+| 1    | 1             |              1 | 0             | 1              | 0             |
+| 2    | 2             |            1,2 | 0             | 1,2            | 0             |
+| 3    | 4             |          1,2,4 | 0             | 1,2,4          | 0             |
+| 4    | 6             |        1,2,4,6 | 0             | 1,2,4,6        | 0             |
+| 5    | 1             |        1,2,4,6 | 1             | 1,2,4,6        | 1             |
+| 6    | 8             |      1,2,4,6,8 | 1             | 1,2,4,6,8      | 1             |
+| 7    | 10            |     1,4,6,8,10 | 1             | 2,4,6,8,10     | 1             |
+| 8    | 2             |     1,2,6,8,10 | 1             | 2,4,6,8,10     | 2             |
+| 9    | 4             |     1,2,4,8,10 | 1             | 2,4,6,8,10     | 3             |
+| 10   | 1             |     1,2,4,8,10 | 2             | 1,4,6,8,10     | 3             |
+
+Denoting Larry's score by $L$ and Robin's score by $R$, what is the expected value of $|L - R|$ after 50 turns? 使用 x.xxxxxxxx 格式将答案四舍五入到小数点后八位。
 
 # --hints--
 
-`euler298()` should return 1.76882294.
+`selectiveAmnesia()` should return `1.76882294`.
 
 ```js
-assert.strictEqual(euler298(), 1.76882294);
+assert.strictEqual(selectiveAmnesia(), 1.76882294);
 ```
 
 # --seed--
@@ -29,12 +42,12 @@ assert.strictEqual(euler298(), 1.76882294);
 ## --seed-contents--
 
 ```js
-function euler298() {
+function selectiveAmnesia() {
 
   return true;
 }
 
-euler298();
+selectiveAmnesia();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md
index 586b5890681..f279a7906d6 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md
@@ -1,33 +1,39 @@
 ---
 id: 5900f4971000cf542c50ffaa
-title: 'Problem 299: Three similar triangles'
-challengeType: 5
+title: '问题 299：三个相似的三角形'
+challengeType: 1
 forumTopicId: 301951
 dashedName: problem-299-three-similar-triangles
 ---
 
 # --description--
 
-Four points with integer coordinates are selected:A(a, 0), B(b, 0), C(0, c) and D(0, d),
+Four points with integer coordinates are selected:
 
-with 0 &lt; a &lt; b and 0 &lt; c &lt; d.
+$A(a, 0)$, $B(b, 0)$, $C(0, c)$ and $D(0, d)$, with $0 &lt; a &lt; b$ and $0 &lt; c &lt; d$.
 
-Point P, also with integer coordinates, is chosen on the line AC so that the three triangles ABP, CDP and BDP are all similar.
+Point $P$, also with integer coordinates, is chosen on the line $AC$ so that the three triangles $ABP$, $CDP$ and $BDP$ are all similar.
 
-It is easy to prove that the three triangles can be similar, only if a=c.
+<img class="img-responsive center-block" alt="points A, B, C, D and P creating three triangles: ABP, CDP, and BDP" src="https://cdn.freecodecamp.org/curriculum/project-euler/three-similar-triangles.gif" style="background-color: white; padding: 10px;" />
 
-So, given that a=c, we are looking for triplets (a,b,d) such that at least one point P (with integer coordinates) exists on AC, making the three triangles ABP, CDP and BDP all similar.
+It is easy to prove that the three triangles can be similar, only if $a = c$.
 
-For example, if (a,b,d)=(2,3,4), it can be easily verified that point P(1,1) satisfies the above condition. Note that the triplets (2,3,4) and (2,4,3) are considered as distinct, although point P(1,1) is common for both.
+So, given that $a = c$, we are looking for triplets ($a$, $b$, $d$) such that at least one point $P$ (with integer coordinates) exists on $AC$, making the three triangles $ABP$, $CDP$ and $BDP$ all similar.
 
-If b+d &lt; 100, there are 92 distinct triplets (a,b,d) such that point P exists. If b+d &lt; 100 000, there are 320471 distinct triplets (a,b,d) such that point P exists. If b+d &lt; 100 000 000, how many distinct triplets (a,b,d) are there such that point P exists?
+For example, if $(a, b, d) = (2, 3, 4)$, it can be easily verified that point $P(1, 1)$ satisfies the above condition. Note that the triplets (2,3,4) and (2,4,3) are considered as distinct, although point $P(1, 1)$ is common for both.
+
+If $b + d &lt; 100$, there are 92 distinct triplets ($a$, $b$, $d$) such that point $P$ exists.
+
+If $b + d &lt; 100\\,000$, there are 320471 distinct triplets ($a$, $b$, $d$) such that point $P$ exists.
+
+If $b + d &lt; 100\\,000\\,000$, how many distinct triplets ($a$, $b$, $d$) are there such that point $P$ exists?
 
 # --hints--
 
-`euler299()` should return 549936643.
+`threeSimilarTriangles()` should return `549936643`.
 
 ```js
-assert.strictEqual(euler299(), 549936643);
+assert.strictEqual(threeSimilarTriangles(), 549936643);
 ```
 
 # --seed--
@@ -35,12 +41,12 @@ assert.strictEqual(euler299(), 549936643);
 ## --seed-contents--
 
 ```js
-function euler299() {
+function threeSimilarTriangles() {
 
   return true;
 }
 
-euler299();
+threeSimilarTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-30-digit-n-powers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-30-digit-n-powers.md
index 1eb7fd409bb..1e7472bce84 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-30-digit-n-powers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-30-digit-n-powers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f38a1000cf542c50fe9d
 title: 'Problem 30: Digit n powers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301953
 dashedName: problem-30-digit-n-powers
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-300-protein-folding.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-300-protein-folding.md
index 52c5f272c6f..5270432d984 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-300-protein-folding.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-300-protein-folding.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f49a1000cf542c50ffac
-title: 'Problem 300: Protein folding'
-challengeType: 5
+title: '问题 300：蛋白质折叠'
+challengeType: 1
 forumTopicId: 301954
 dashedName: problem-300-protein-folding
 ---
@@ -10,24 +10,30 @@ dashedName: problem-300-protein-folding
 
 In a very simplified form, we can consider proteins as strings consisting of hydrophobic (H) and polar (P) elements, e.g. HHPPHHHPHHPH.
 
-For this problem, the orientation of a protein is important; e.g. HPP is considered distinct from PPH. Thus, there are 2n distinct proteins consisting of n elements.
+For this problem, the orientation of a protein is important; e.g. HPP is considered distinct from PPH. Thus, there are $2^n$ distinct proteins consisting of $n$ elements.
 
-When one encounters these strings in nature, they are always folded in such a way that the number of H-H contact points is as large as possible, since this is energetically advantageous. As a result, the H-elements tend to accumulate in the inner part, with the P-elements on the outside. Natural proteins are folded in three dimensions of course, but we will only consider protein folding in two dimensions.
+When one encounters these strings in nature, they are always folded in such a way that the number of H-H contact points is as large as possible, since this is energetically advantageous.
+
+As a result, the H-elements tend to accumulate in the inner part, with the P-elements on the outside.
+
+Natural proteins are folded in three dimensions of course, but we will only consider protein folding in <u>two dimensions</u>.
 
 The figure below shows two possible ways that our example protein could be folded (H-H contact points are shown with red dots).
 
+<img class="img-responsive center-block" alt="two possible ways to fold example protein" src="https://cdn.freecodecamp.org/curriculum/project-euler/protein-folding.gif" style="background-color: white; padding: 10px;" />
+
 The folding on the left has only six H-H contact points, thus it would never occur naturally. On the other hand, the folding on the right has nine H-H contact points, which is optimal for this string.
 
-Assuming that H and P elements are equally likely to occur in any position along the string, the average number of H-H contact points in an optimal folding of a random protein string of length 8 turns out to be 850 / 28=3.3203125.
+Assuming that H and P elements are equally likely to occur in any position along the string, the average number of H-H contact points in an optimal folding of a random protein string of length 8 turns out to be $\frac{850}{2^8} = 3.3203125$.
 
 What is the average number of H-H contact points in an optimal folding of a random protein string of length 15? Give your answer using as many decimal places as necessary for an exact result.
 
 # --hints--
 
-`euler300()` should return 8.0540771484375.
+`proteinFolding()` should return `8.0540771484375`.
 
 ```js
-assert.strictEqual(euler300(), 8.0540771484375);
+assert.strictEqual(proteinFolding(), 8.0540771484375);
 ```
 
 # --seed--
@@ -35,12 +41,12 @@ assert.strictEqual(euler300(), 8.0540771484375);
 ## --seed-contents--
 
 ```js
-function euler300() {
+function proteinFolding() {
 
   return true;
 }
 
-euler300();
+proteinFolding();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-301-nim.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-301-nim.md
index 8197d8abf58..ce622775526 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-301-nim.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-301-nim.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4991000cf542c50ffab
 title: 'Problem 301: Nim'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301955
 dashedName: problem-301-nim
 ---
@@ -12,25 +12,30 @@ Nim is a game played with heaps of stones, where two players take it in turn to
 
 We'll consider the three-heap normal-play version of Nim, which works as follows:
 
--   At the start of the game there are three heaps of stones.
--   On his turn the player removes any positive number of stones from any single heap.
--   The first player unable to move (because no stones remain) loses.
+- At the start of the game there are three heaps of stones.
+- On his turn the player removes any positive number of stones from any single heap.
+- The first player unable to move (because no stones remain) loses.
 
-If (n1,n2,n3) indicates a Nim position consisting of heaps of size n1, n2 and n3 then there is a simple function X(n1,n2,n3) — that you may look up or attempt to deduce for yourself — that returns: zero if, with perfect strategy, the player about to move will eventually lose; or non-zero if, with perfect strategy, the player about to move will eventually win. For example X(1,2,3) = 0 because, no matter what the current player does, his opponent can respond with a move that leaves two heaps of equal size, at which point every move by the current player can be mirrored by his opponent until no stones remain; so the current player loses. To illustrate:
+If ($n_1$, $n_2$, $n_3$) indicates a Nim position consisting of heaps of size $n_1$, $n_2$ and $n_3$ then there is a simple function $X(n_1,n_2,n_3)$ — that you may look up or attempt to deduce for yourself — that returns:
 
--   current player moves to (1,2,1)
--   opponent moves to (1,0,1)
--   current player moves to (0,0,1)
--   opponent moves to (0,0,0), and so wins.
+- zero if, with perfect strategy, the player about to move will eventually lose; or
+- non-zero if, with perfect strategy, the player about to move will eventually win.
 
-For how many positive integers n ≤ 230 does X(n,2n,3n) = 0 ?
+For example $X(1, 2, 3) = 0$ because, no matter what the current player does, his opponent can respond with a move that leaves two heaps of equal size, at which point every move by the current player can be mirrored by his opponent until no stones remain; so the current player loses. 为了显示：
+
+- current player moves to (1,2,1)
+- opponent moves to (1,0,1)
+- current player moves to (0,0,1)
+- opponent moves to (0,0,0), and so wins.
+
+For how many positive integers $n ≤ 2^{30}$ does $X(n, 2n, 3n) = 0$?
 
 # --hints--
 
-`euler301()` should return 2178309.
+`nim()` should return `2178309`.
 
 ```js
-assert.strictEqual(euler301(), 2178309);
+assert.strictEqual(nim(), 2178309);
 ```
 
 # --seed--
@@ -38,12 +43,12 @@ assert.strictEqual(euler301(), 2178309);
 ## --seed-contents--
 
 ```js
-function euler301() {
+function nim() {
 
   return true;
 }
 
-euler301();
+nim();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.md
index 78c112d626a..4c5301c49bf 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.md
@@ -1,33 +1,33 @@
 ---
 id: 5900f49b1000cf542c50ffad
 title: 'Problem 302: Strong Achilles Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301956
 dashedName: problem-302-strong-achilles-numbers
 ---
 
 # --description--
 
-A positive integer n is powerful if p2 is a divisor of n for every prime factor p in n.
+A positive integer $n$ is powerful if $p^2$ is a divisor of $n$ for every prime factor $p$ in $n$.
 
-A positive integer n is a perfect power if n can be expressed as a power of another positive integer.
+A positive integer $n$ is a perfect power if $n$ can be expressed as a power of another positive integer.
 
-A positive integer n is an Achilles number if n is powerful but not a perfect power. For example, 864 and 1800 are Achilles numbers: 864 = 25·33 and 1800 = 23·32·52.
+A positive integer $n$ is an Achilles number if $n$ is powerful but not a perfect power. For example, 864 and 1800 are Achilles numbers: $864 = 2^5 \times 3^3$ and $1800 = 2^3 \times 3^2 \times 5^2$.
 
-We shall call a positive integer S a Strong Achilles number if both S and φ(S) are Achilles numbers.1 For example, 864 is a Strong Achilles number: φ(864) = 288 = 25·32. However, 1800 isn't a Strong Achilles number because: φ(1800) = 480 = 25·31·51.
+We shall call a positive integer $S$ a Strong Achilles number if both $S$ and $φ(S)$ are Achilles numbers. $φ$ denotes Euler's totient function.
 
-There are 7 Strong Achilles numbers below 104 and 656 below 108.
+For example, 864 is a Strong Achilles number: $φ(864) = 288 = 2^5 \times 3^2$. However, 1800 isn't a Strong Achilles number because: $φ(1800) = 480 = 2^5 \times 3^1 \times 5^1$.
 
-How many Strong Achilles numbers are there below 1018?
+There are 7 Strong Achilles numbers below ${10}^4$ and 656 below ${10}^8$.
 
-1 φ denotes Euler's totient function.
+How many Strong Achilles numbers are there below ${10}^{18}$?
 
 # --hints--
 
-`euler302()` should return 1170060.
+`strongAchillesNumbers()` should return `1170060`.
 
 ```js
-assert.strictEqual(euler302(), 1170060);
+assert.strictEqual(strongAchillesNumbers(), 1170060);
 ```
 
 # --seed--
@@ -35,12 +35,12 @@ assert.strictEqual(euler302(), 1170060);
 ## --seed-contents--
 
 ```js
-function euler302() {
+function strongAchillesNumbers() {
 
   return true;
 }
 
-euler302();
+strongAchillesNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.md
index 1f9b36fad0d..108d8bd39fc 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f49b1000cf542c50ffae
 title: 'Problem 303: Multiples with small digits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301957
 dashedName: problem-303-multiples-with-small-digits
 ---
 
 # --description--
 
-For a positive integer n, define f(n) as the least positive multiple of n that, written in base 10, uses only digits ≤ 2.
+For a positive integer $n$, define $f(n)$ as the least positive multiple of $n$ that, written in base 10, uses only digits $≤ 2$.
 
-Thus f(2)=2, f(3)=12, f(7)=21, f(42)=210, f(89)=1121222.
+Thus $f(2) = 2$, $f(3) = 12$, $f(7) = 21$, $f(42) = 210$, $f(89) = 1\\,121\\,222$.
 
-Also, .
+Also, $\displaystyle\sum_{n = 1}^{100} \frac{f(n)}{n} = 11\\,363\\,107$.
 
-Find .
+Find $\displaystyle\sum_{n = 1}^{10\\,000} \frac{f(n)}{n}$.
 
 # --hints--
 
-`euler303()` should return 1111981904675169.
+`multiplesWithSmallDigits()` should return `1111981904675169`.
 
 ```js
-assert.strictEqual(euler303(), 1111981904675169);
+assert.strictEqual(multiplesWithSmallDigits(), 1111981904675169);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler303(), 1111981904675169);
 ## --seed-contents--
 
 ```js
-function euler303() {
+function multiplesWithSmallDigits() {
 
   return true;
 }
 
-euler303();
+multiplesWithSmallDigits();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-304-primonacci.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-304-primonacci.md
index aab56db5538..a4939940a8f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-304-primonacci.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-304-primonacci.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f49d1000cf542c50ffaf
 title: 'Problem 304: Primonacci'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301958
 dashedName: problem-304-primonacci
 ---
 
 # --description--
 
-For any positive integer n the function next_prime(n) returns the smallest prime p such that p>n.
+For any positive integer $n$ the function $\text{next_prime}(n)$ returns the smallest prime $p$ such that $p > n$.
 
-The sequence a(n) is defined by: a(1)=next_prime(1014) and a(n)=next_prime(a(n-1)) for n>1.
+The sequence $a(n)$ is defined by: $a(1) = \text{next_prime}({10}^{14})$ and $a(n) = \text{next_prime}(a(n - 1))$ for $n > 1$.
 
-The fibonacci sequence f(n) is defined by: f(0)=0, f(1)=1 and f(n)=f(n-1)+f(n-2) for n>1.
+The fibonacci sequence $f(n)$ is defined by: $f(0) = 0$, $f(1) = 1$ and $f(n) = f(n - 1) + f(n - 2)$ for $n > 1$.
 
-The sequence b(n) is defined as f(a(n)).
+The sequence $b(n)$ is defined as $f(a(n))$.
 
-Find ∑b(n) for 1≤n≤100 000. Give your answer mod 1234567891011.
+Find $\sum b(n)$ for $1≤n≤100\\,000$. Give your answer $\bmod 1\\,234\\,567\\,891\\,011$.
 
 # --hints--
 
-`euler304()` should return 283988410192.
+`primonacci()` should return `283988410192`.
 
 ```js
-assert.strictEqual(euler304(), 283988410192);
+assert.strictEqual(primonacci(), 283988410192);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler304(), 283988410192);
 ## --seed-contents--
 
 ```js
-function euler304() {
+function primonacci() {
 
   return true;
 }
 
-euler304();
+primonacci();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-305-reflexive-position.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-305-reflexive-position.md
index c42f1440383..566e7b7b76c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-305-reflexive-position.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-305-reflexive-position.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f49d1000cf542c50ffb0
 title: 'Problem 305: Reflexive Position'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301959
 dashedName: problem-305-reflexive-position
 ---
 
 # --description--
 
-Let's call S the (infinite) string that is made by concatenating the consecutive positive integers (starting from 1) written down in base 10.
+Let's call $S$ the (infinite) string that is made by concatenating the consecutive positive integers (starting from 1) written down in base 10.
 
-Thus, S = 1234567891011121314151617181920212223242...
+Thus, $S = 1234567891011121314151617181920212223242\ldots$
 
-It's easy to see that any number will show up an infinite number of times in S.
+It's easy to see that any number will show up an infinite number of times in $S$.
 
-Let's call f(n) the starting position of the nth occurrence of n in S. For example, f(1)=1, f(5)=81, f(12)=271 and f(7780)=111111365.
+Let's call $f(n)$ the starting position of the $n^{\text{th}}$ occurrence of $n$ in $S$. For example, $f(1) = 1$, $f(5) = 81$, $f(12) = 271$ and $f(7780) = 111\\,111\\,365$.
 
-Find ∑f(3k) for 1≤k≤13.
+Find $\sum f(3^k) for 1 ≤ k ≤ 13$.
 
 # --hints--
 
-`euler305()` should return 18174995535140.
+`reflexivePosition()` should return `18174995535140`.
 
 ```js
-assert.strictEqual(euler305(), 18174995535140);
+assert.strictEqual(reflexivePosition(), 18174995535140);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler305(), 18174995535140);
 ## --seed-contents--
 
 ```js
-function euler305() {
+function reflexivePosition() {
 
   return true;
 }
 
-euler305();
+reflexivePosition();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md
index d750803f3b2..3dd4604bc13 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f49f1000cf542c50ffb1
 title: 'Problem 306: Paper-strip Game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301960
 dashedName: problem-306-paper-strip-game
 ---
@@ -10,20 +10,28 @@ dashedName: problem-306-paper-strip-game
 
 The following game is a classic example of Combinatorial Game Theory:
 
-Two players start with a strip of n white squares and they take alternate turns. On each turn, a player picks two contiguous white squares and paints them black. The first player who cannot make a move loses.
+Two players start with a strip of $n$ white squares and they take alternate turns. On each turn, a player picks two contiguous white squares and paints them black. The first player who cannot make a move loses.
 
-If n = 1, there are no valid moves, so the first player loses automatically. If n = 2, there is only one valid move, after which the second player loses. If n = 3, there are two valid moves, but both leave a situation where the second player loses. If n = 4, there are three valid moves for the first player; she can win the game by painting the two middle squares. If n = 5, there are four valid moves for the first player (shown below in red); but no matter what she does, the second player (blue) wins.
+- $n = 1$: No valid moves, so the first player loses automatically.
+- $n = 2$: Only one valid move, after which the second player loses.
+- $n = 3$: Two valid moves, but both leave a situation where the second player loses.
+- $n = 4$: There are three valid moves for the first player; who is able to win the game by painting the two middle squares.
+- $n = 5$: Four valid moves for the first player (shown below in red); but no matter what the player does, the second player (blue) wins.
 
-So, for 1 ≤ n ≤ 5, there are 3 values of n for which the first player can force a win. Similarly, for 1 ≤ n ≤ 50, there are 40 values of n for which the first player can force a win.
+<img class="img-responsive center-block" alt="valid starting moves for strip with 5 squares" src="https://cdn.freecodecamp.org/curriculum/project-euler/paper-strip-game.gif" style="background-color: white; padding: 10px;" />
 
-For 1 ≤ n ≤ 1 000 000, how many values of n are there for which the first player can force a win?
+So, for $1 ≤ n ≤ 5$, there are 3 values of $n$ for which the first player can force a win.
+
+Similarly, for $1 ≤ n ≤ 50$, there are 40 values of $n$ for which the first player can force a win.
+
+For $1 ≤ n ≤ 1\\,000\\,000$, how many values of $n$ are there for which the first player can force a win?
 
 # --hints--
 
-`euler306()` should return 852938.
+`paperStripGame()` should return `852938`.
 
 ```js
-assert.strictEqual(euler306(), 852938);
+assert.strictEqual(paperStripGame(), 852938);
 ```
 
 # --seed--
@@ -31,12 +39,12 @@ assert.strictEqual(euler306(), 852938);
 ## --seed-contents--
 
 ```js
-function euler306() {
+function paperStripGame() {
 
   return true;
 }
 
-euler306();
+paperStripGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-307-chip-defects.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-307-chip-defects.md
index eac5e7e113d..3f0fd2be0cb 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-307-chip-defects.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-307-chip-defects.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4a01000cf542c50ffb2
 title: 'Problem 307: Chip Defects'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301961
 dashedName: problem-307-chip-defects
 ---
 
 # --description--
 
-k defects are randomly distributed amongst n integrated-circuit chips produced by a factory (any number of defects may be found on a chip and each defect is independent of the other defects).
+$k$ defects are randomly distributed amongst $n$ integrated-circuit chips produced by a factory (any number of defects may be found on a chip and each defect is independent of the other defects).
 
-Let p(k,n) represent the probability that there is a chip with at least 3 defects. For instance p(3,7) ≈ 0.0204081633.
+Let $p(k,n)$ represent the probability that there is a chip with at least 3 defects. For instance $p(3,7) ≈ 0.0204081633$.
 
-Find p(20 000, 1 000 000) and give your answer rounded to 10 decimal places in the form 0.abcdefghij
+Find $p(20\\,000, 1\\,000\\,000)$ and give your answer rounded to 10 decimal places in the form 0.abcdefghij
 
 # --hints--
 
-`euler307()` should return 0.7311720251.
+`chipDefects()` should return `0.7311720251`.
 
 ```js
-assert.strictEqual(euler307(), 0.7311720251);
+assert.strictEqual(chipDefects(), 0.7311720251);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler307(), 0.7311720251);
 ## --seed-contents--
 
 ```js
-function euler307() {
+function chipDefects() {
 
   return true;
 }
 
-euler307();
+chipDefects();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.md
index a0cfc2d8a96..22f3cabc900 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4a11000cf542c50ffb3
 title: 'Problem 308: An amazing Prime-generating Automaton'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301962
 dashedName: problem-308-an-amazing-prime-generating-automaton
 ---
@@ -12,18 +12,26 @@ A program written in the programming language Fractran consists of a list of fra
 
 The internal state of the Fractran Virtual Machine is a positive integer, which is initially set to a seed value. Each iteration of a Fractran program multiplies the state integer by the first fraction in the list which will leave it an integer.
 
-For example, one of the Fractran programs that John Horton Conway wrote for prime-generation consists of the following 14 fractions:1791 , 7885 , 1951 , 2338 , 2933 , 7729 , 9523 , 7719 , 117 , 1113 , 1311 , 152 , 17 , 551 . Starting with the seed integer 2, successive iterations of the program produce the sequence: 15, 825, 725, 1925, 2275, 425, ..., 68, 4, 30, ..., 136, 8, 60, ..., 544, 32, 240, ...
+For example, one of the Fractran programs that John Horton Conway wrote for prime-generation consists of the following 14 fractions:
 
-The powers of 2 that appear in this sequence are 22, 23, 25, ... It can be shown that all the powers of 2 in this sequence have prime exponents and that all the primes appear as exponents of powers of 2, in proper order!
+$$\frac{17}{91}, \frac{78}{85}, \frac{19}{51}, \frac{23}{38}, \frac{29}{33}, \frac{77}{29}, \frac{95}{23}, \frac{77}{19}, \frac{1}{17}, \frac{11}{13}, \frac{13}{11}, \frac{15}{2}, \frac{1}{7}, \frac{55}{1}$$
 
-If someone uses the above Fractran program to solve Project Euler Problem 7 (find the 10001st prime), how many iterations would be needed until the program produces 210001st prime ?
+Starting with the seed integer 2, successive iterations of the program produce the sequence:
+
+$$15, 825, 725, 1925, 2275, 425, \ldots, 68, \mathbf{4}, 30, \ldots, 136, \mathbf{8}, 60, \ldots, 544, \mathbf{32}, 240, \ldots$$
+
+The powers of 2 that appear in this sequence are $2^2, 2^3, 2^5, \ldots$.
+
+It can be shown that all the powers of 2 in this sequence have prime exponents and that all the primes appear as exponents of powers of 2, in proper order!
+
+If someone uses the above Fractran program to solve Project Euler Problem 7 (find the ${10001}^{\text{st}}$ prime), how many iterations would be needed until the program produces $2^{10001^{\text{st}}\text{ prime}}$?
 
 # --hints--
 
-`euler308()` should return 1539669807660924.
+`primeGeneratingAutomation()` should return `1539669807660924`.
 
 ```js
-assert.strictEqual(euler308(), 1539669807660924);
+assert.strictEqual(primeGeneratingAutomation(), 1539669807660924);
 ```
 
 # --seed--
@@ -31,12 +39,12 @@ assert.strictEqual(euler308(), 1539669807660924);
 ## --seed-contents--
 
 ```js
-function euler308() {
+function primeGeneratingAutomation() {
 
   return true;
 }
 
-euler308();
+primeGeneratingAutomation();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md
index 03d5603c1f9..721b756f533 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f4a11000cf542c50ffb4
 title: 'Problem 309: Integer Ladders'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301963
 dashedName: problem-309-integer-ladders
 ---
 
 # --description--
 
-In the classic "Crossing Ladders" problem, we are given the lengths x and y of two ladders resting on the opposite walls of a narrow, level street. We are also given the height h above the street where the two ladders cross and we are asked to find the width of the street (w).
+In the classic "Crossing Ladders" problem, we are given the lengths $x$ and $y$ of two ladders resting on the opposite walls of a narrow, level street. We are also given the height $h$ above the street where the two ladders cross and we are asked to find the width of the street ($w$).
 
-Here, we are only concerned with instances where all four variables are positive integers. For example, if x = 70, y = 119 and h = 30, we can calculate that w = 56.
+<img class="img-responsive center-block" alt="ladders x and y, crossing at the height h, and resting on opposite walls of the street of width w" src="https://cdn.freecodecamp.org/curriculum/project-euler/integer-ladders.gif" style="background-color: white; padding: 10px;" />
 
-In fact, for integer values x, y, h and 0 &lt; x &lt; y &lt; 200, there are only five triplets (x,y,h) producing integer solutions for w: (70, 119, 30), (74, 182, 21), (87, 105, 35), (100, 116, 35) and (119, 175, 40).
+Here, we are only concerned with instances where all four variables are positive integers. For example, if $x = 70$, $y = 119$ and $h = 30$, we can calculate that $w = 56$.
 
-For integer values x, y, h and 0 &lt; x &lt; y &lt; 1 000 000, how many triplets (x,y,h) produce integer solutions for w?
+In fact, for integer values $x$, $y$, $h$ and $0 &lt; x &lt; y &lt; 200$, there are only five triplets ($x$, $y$, $h$) producing integer solutions for $w$: (70, 119, 30), (74, 182, 21), (87, 105, 35), (100, 116, 35) and (119, 175, 40).
+
+For integer values $x$, $y$, $h$ and $0 &lt; x &lt; y &lt; 1\\,000\\,000$, how many triplets ($x$, $y$, $h$) produce integer solutions for $w$?
 
 # --hints--
 
-`euler309()` should return 210139.
+`integerLadders()` should return `210139`.
 
 ```js
-assert.strictEqual(euler309(), 210139);
+assert.strictEqual(integerLadders(), 210139);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler309(), 210139);
 ## --seed-contents--
 
 ```js
-function euler309() {
+function integerLadders() {
 
   return true;
 }
 
-euler309();
+integerLadders();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-31-coin-sums.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-31-coin-sums.md
index 0826a685f4c..ae4372cd69f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-31-coin-sums.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-31-coin-sums.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f38b1000cf542c50fe9e
 title: 'Problem 31: Coin sums'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301965
 dashedName: problem-31-coin-sums
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-310-nim-square.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-310-nim-square.md
index c93f2fd5315..4eacb352843 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-310-nim-square.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-310-nim-square.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4a21000cf542c50ffb5
 title: 'Problem 310: Nim Square'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301966
 dashedName: problem-310-nim-square
 ---
@@ -12,18 +12,18 @@ Alice and Bob play the game Nim Square.
 
 Nim Square is just like ordinary three-heap normal play Nim, but the players may only remove a square number of stones from a heap.
 
-The number of stones in the three heaps is represented by the ordered triple (a,b,c).
+The number of stones in the three heaps is represented by the ordered triple ($a$, $b$, $c$).
 
-If 0≤a≤b≤c≤29 then the number of losing positions for the next player is 1160.
+If $0 ≤ a ≤ b ≤ c ≤ 29$ then the number of losing positions for the next player is 1160.
 
-Find the number of losing positions for the next player if 0≤a≤b≤c≤100 000.
+Find the number of losing positions for the next player if $0 ≤ a ≤ b ≤ c ≤ 100\\,000$.
 
 # --hints--
 
-`euler310()` should return 2586528661783.
+`nimSquare()` should return `2586528661783`.
 
 ```js
-assert.strictEqual(euler310(), 2586528661783);
+assert.strictEqual(nimSquare(), 2586528661783);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler310(), 2586528661783);
 ## --seed-contents--
 
 ```js
-function euler310() {
+function nimSquare() {
 
   return true;
 }
 
-euler310();
+nimSquare();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md
index b5aee9d2b54..97736d98034 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f4a31000cf542c50ffb6
 title: 'Problem 311: Biclinic Integral Quadrilaterals'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301967
 dashedName: problem-311-biclinic-integral-quadrilaterals
 ---
 
 # --description--
 
-ABCD is a convex, integer sided quadrilateral with 1 ≤ AB &lt; BC &lt; CD &lt; AD.
+$ABCD$ is a convex, integer sided quadrilateral with $1 ≤ AB &lt; BC &lt; CD &lt; AD$.
 
-BD has integer length. O is the midpoint of BD. AO has integer length.
+$BD$ has integer length. $O$ is the midpoint of $BD$. $AO$ has integer length.
 
-We'll call ABCD a biclinic integral quadrilateral if AO = CO ≤ BO = DO.
+We'll call $ABCD$ a biclinic integral quadrilateral if $AO = CO ≤ BO = DO$.
 
-For example, the following quadrilateral is a biclinic integral quadrilateral: AB = 19, BC = 29, CD = 37, AD = 43, BD = 48 and AO = CO = 23.
+For example, the following quadrilateral is a biclinic integral quadrilateral: $AB = 19$, $BC = 29$, $CD = 37$, $AD = 43$, $BD = 48$ and $AO = CO = 23$.
 
-Let B(N) be the number of distinct biclinic integral quadrilaterals ABCD that satisfy AB2+BC2+CD2+AD2 ≤ N. We can verify that B(10 000) = 49 and B(1 000 000) = 38239.
+<img class="img-responsive center-block" alt="quadrilateral ABCD, with point O, an midpoint of BD" src="https://cdn.freecodecamp.org/curriculum/project-euler/biclinic-integral-quadrilaterals.gif" style="background-color: white; padding: 10px;" />
 
-Find B(10 000 000 000).
+Let $B(N)$ be the number of distinct biclinic integral quadrilaterals $ABCD$ that satisfy ${AB}^2 + {BC}^2 + {CD}^2 + {AD}^2 ≤ N$. We can verify that $B(10\\,000) = 49$ and $B(1\\,000\\,000) = 38239$.
+
+Find $B(10\\,000\\,000\\,000)$.
 
 # --hints--
 
-`euler311()` should return 2466018557.
+`biclinicIntegralQuadrilaterals()` should return `2466018557`.
 
 ```js
-assert.strictEqual(euler311(), 2466018557);
+assert.strictEqual(biclinicIntegralQuadrilaterals(), 2466018557);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler311(), 2466018557);
 ## --seed-contents--
 
 ```js
-function euler311() {
+function biclinicIntegralQuadrilaterals() {
 
   return true;
 }
 
-euler311();
+biclinicIntegralQuadrilaterals();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md
index b9083a73f0b..122f28f97dc 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md
@@ -1,29 +1,36 @@
 ---
 id: 5900f4a51000cf542c50ffb7
 title: 'Problem 312: Cyclic paths on Sierpiński graphs'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301968
 dashedName: problem-312-cyclic-paths-on-sierpiski-graphs
 ---
 
 # --description--
 
-\- A Sierpiński graph of order-1 (S1) is an equilateral triangle.
+- A Sierpiński graph of order-1 ($S_1$) is an equilateral triangle.
+- $S_{n + 1}$ is obtained from $S_n$ by positioning three copies of $S_n$ so that every pair of copies has one common corner.
 
-\- Sn+1 is obtained from Sn by positioning three copies of Sn so that every pair of copies has one common corner.
+<img class="img-responsive center-block" alt="Sierpinski graphs of order-1 to order-5" src="https://cdn.freecodecamp.org/curriculum/project-euler/cyclic-paths-on-sierpinski-graphs-1.gif" style="background-color: white; padding: 10px;" />
 
-Let C(n) be the number of cycles that pass exactly once through all the vertices of Sn. For example, C(3) = 8 because eight such cycles can be drawn on S3, as shown below:
+Let $C(n)$ be the number of cycles that pass exactly once through all the vertices of $S_n$. For example, $C(3) = 8$ because eight such cycles can be drawn on $S_3$, as shown below:
 
-It can also be verified that : C(1) = C(2) = 1 C(5) = 71328803586048 C(10 000) mod 108 = 37652224 C(10 000) mod 138 = 617720485
+<img class="img-responsive center-block" alt="eight cycles that pass exactly once through all vertices of S_3" src="https://cdn.freecodecamp.org/curriculum/project-euler/cyclic-paths-on-sierpinski-graphs-2.gif" style="background-color: white; padding: 10px;" />
 
-Find C(C(C(10 000))) mod 138.
+It can also be verified that:
+
+$$\begin{align}   & C(1) = C(2) = 1 \\\\
+  & C(5) = 71\\,328\\,803\\,586\\,048 \\\\   & C(10 000)\bmod {10}^8 = 37\\,652\\,224 \\\\
+  & C(10 000)\bmod {13}^8 = 617\\,720\\,485 \\\\ \end{align}$$
+
+Find $C(C(C(10\\,000)))\bmod {13}^8$.
 
 # --hints--
 
-`euler312()` should return 324681947.
+`pathsOnSierpinskiGraphs()` should return `324681947`.
 
 ```js
-assert.strictEqual(euler312(), 324681947);
+assert.strictEqual(pathsOnSierpinskiGraphs(), 324681947);
 ```
 
 # --seed--
@@ -31,12 +38,12 @@ assert.strictEqual(euler312(), 324681947);
 ## --seed-contents--
 
 ```js
-function euler312() {
+function pathsOnSierpinskiGraphs() {
 
   return true;
 }
 
-euler312();
+pathsOnSierpinskiGraphs();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-313-sliding-game.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-313-sliding-game.md
index dd6ec7cfb3a..8f5726b71f4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-313-sliding-game.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-313-sliding-game.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4a61000cf542c50ffb8
 title: 'Problem 313: Sliding game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301969
 dashedName: problem-313-sliding-game
 ---
@@ -10,18 +10,22 @@ dashedName: problem-313-sliding-game
 
 In a sliding game a counter may slide horizontally or vertically into an empty space. The objective of the game is to move the red counter from the top left corner of a grid to the bottom right corner; the space always starts in the bottom right corner. For example, the following sequence of pictures show how the game can be completed in five moves on a 2 by 2 grid.
 
-Let S(m,n) represent the minimum number of moves to complete the game on an m by n grid. For example, it can be verified that S(5,4) = 25.
+<img class="img-responsive center-block" alt="completing game in five moves on grid 2x2" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliding-game-1.gif" style="background-color: white; padding: 10px;" />
 
-There are exactly 5482 grids for which S(m,n) = p2, where p &lt; 100 is prime.
+Let $S(m, n)$ represent the minimum number of moves to complete the game on an $m$ by $n$ grid. For example, it can be verified that $S(5, 4) = 25$.
 
-How many grids does S(m,n) = p2, where p &lt; 106 is prime?
+<img class="img-responsive center-block" alt="initial grid state and final grid state for game on grid 5x4" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliding-game-2.gif" style="background-color: white; padding: 10px;" />
+
+There are exactly 5482 grids for which $S(m, n) = p^2$, where $p &lt; 100$ is prime.
+
+How many grids does $S(m, n) = p^2$, where $p &lt; {10}^6$ is prime?
 
 # --hints--
 
-`euler313()` should return 2057774861813004.
+`slidingGame()` should return `2057774861813004`.
 
 ```js
-assert.strictEqual(euler313(), 2057774861813004);
+assert.strictEqual(slidingGame(), 2057774861813004);
 ```
 
 # --seed--
@@ -29,12 +33,12 @@ assert.strictEqual(euler313(), 2057774861813004);
 ## --seed-contents--
 
 ```js
-function euler313() {
+function slidingGame() {
 
   return true;
 }
 
-euler313();
+slidingGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md
index 78cd0f1cf65..0bb0e4f9ab9 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4a71000cf542c50ffb9
 title: 'Problem 314: The Mouse on the Moon'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301970
 dashedName: problem-314-the-mouse-on-the-moon
 ---
@@ -10,20 +10,24 @@ dashedName: problem-314-the-mouse-on-the-moon
 
 The moon has been opened up, and land can be obtained for free, but there is a catch. You have to build a wall around the land that you stake out, and building a wall on the moon is expensive. Every country has been allotted a 500 m by 500 m square area, but they will possess only that area which they wall in. 251001 posts have been placed in a rectangular grid with 1 meter spacing. The wall must be a closed series of straight lines, each line running from post to post.
 
-The bigger countries of course have built a 2000 m wall enclosing the entire 250 000 m2 area. The Duchy of Grand Fenwick, has a tighter budget, and has asked you (their Royal Programmer) to compute what shape would get best maximum enclosed-area/wall-length ratio.
+The bigger countries of course have built a 2000 m wall enclosing the entire 250 000 $\text{m}^2$ area. The Duchy of Grand Fenwick, has a tighter budget, and has asked you (their Royal Programmer) to compute what shape would get best maximum $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio.
 
-You have done some preliminary calculations on a sheet of paper. For a 2000 meter wall enclosing the 250 000 m2 area the enclosed-area/wall-length ratio is 125. Although not allowed , but to get an idea if this is anything better: if you place a circle inside the square area touching the four sides the area will be equal to π*2502 m2 and the perimeter will be π*500 m, so the enclosed-area/wall-length ratio will also be 125.
+You have done some preliminary calculations on a sheet of paper. For a 2000 meter wall enclosing the 250 000 $\text{m}^2$ area the $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio is 125.
 
-However, if you cut off from the square four triangles with sides 75 m, 75 m and 75√2 m the total area becomes 238750 m2 and the perimeter becomes 1400+300√2 m. So this gives an enclosed-area/wall-length ratio of 130.87, which is significantly better.
+Although not allowed, but to get an idea if this is anything better: if you place a circle inside the square area touching the four sides the area will be equal to $π \times {250}^2 \text{m}^2$ and the perimeter will be $π \times 500 \text{m}$, so the $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio will also be 125.
 
-Find the maximum enclosed-area/wall-length ratio. Give your answer rounded to 8 places behind the decimal point in the form abc.defghijk.
+However, if you cut off from the square four triangles with sides 75 m, 75 m and $75\sqrt{2}$ m the total area becomes 238750 $\text{m}^2$ and the perimeter becomes $1400 + 300\sqrt{2}$ m. So this gives an $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio of 130.87, which is significantly better.
+
+<img class="img-responsive center-block" alt="picture showing difference in encosed-area between circle and square with cut off four triangles" src="https://cdn.freecodecamp.org/curriculum/project-euler/the-mouse-on-the-moon.gif" style="background-color: white; padding: 10px;" />
+
+Find the maximum $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio. Give your answer rounded to 8 places behind the decimal point in the form abc.defghijk.
 
 # --hints--
 
-`euler314()` should return 132.52756426.
+`theMouseOnTheMoon()` should return `132.52756426`.
 
 ```js
-assert.strictEqual(euler314(), 132.52756426);
+assert.strictEqual(theMouseOnTheMoon(), 132.52756426);
 ```
 
 # --seed--
@@ -31,12 +35,12 @@ assert.strictEqual(euler314(), 132.52756426);
 ## --seed-contents--
 
 ```js
-function euler314() {
+function theMouseOnTheMoon() {
 
   return true;
 }
 
-euler314();
+theMouseOnTheMoon();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md
index 38a2a69cca1..59389d4a7ff 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md
@@ -1,41 +1,55 @@
 ---
 id: 5900f4a71000cf542c50ffba
 title: 'Problem 315: Digital root clocks'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301971
 dashedName: problem-315-digital-root-clocks
 ---
 
 # --description--
 
+<img class="img-responsive center-block" alt="animation of Sam's and Max's clocks calculating digital roots starting from 137" src="https://cdn.freecodecamp.org/curriculum/project-euler/digital-root-clocks.gif" style="background-color: white; padding: 10px;" />
+
 Sam and Max are asked to transform two digital clocks into two "digital root" clocks.
 
 A digital root clock is a digital clock that calculates digital roots step by step.
 
-When a clock is fed a number, it will show it and then it will start the calculation, showing all the intermediate values until it gets to the result. For example, if the clock is fed the number 137, it will show: "137" → "11" → "2" and then it will go black, waiting for the next number.
+When a clock is fed a number, it will show it and then it will start the calculation, showing all the intermediate values until it gets to the result. For example, if the clock is fed the number 137, it will show: `137` → `11` → `2` and then it will go black, waiting for the next number.
 
-Every digital number consists of some light segments: three horizontal (top, middle, bottom) and four vertical (top-left, top-right, bottom-left, bottom-right). Number "1" is made of vertical top-right and bottom-right, number "4" is made by middle horizontal and vertical top-left, top-right and bottom-right. Number "8" lights them all.
+Every digital number consists of some light segments: three horizontal (top, middle, bottom) and four vertical (top-left, top-right, bottom-left, bottom-right). Number `1` is made of vertical top-right and bottom-right, number `4` is made by middle horizontal and vertical top-left, top-right and bottom-right. Number `8` lights them all.
 
-The clocks consume energy only when segments are turned on/off. To turn on a "2" will cost 5 transitions, while a "7" will cost only 4 transitions.
+The clocks consume energy only when segments are turned on/off. To turn on a `2` will cost 5 transitions, while a `7` will cost only 4 transitions.
 
 Sam and Max built two different clocks.
 
-Sam's clock is fed e.g. number 137: the clock shows "137", then the panel is turned off, then the next number ("11") is turned on, then the panel is turned off again and finally the last number ("2") is turned on and, after some time, off. For the example, with number 137, Sam's clock requires:"137" : (2 + 5 + 4) × 2 = 22 transitions ("137" on/off). "11" : (2 + 2) × 2 = 8 transitions ("11" on/off). "2" : (5) × 2 = 10 transitions ("2" on/off).
+Sam's clock is fed e.g. number 137: the clock shows `137`, then the panel is turned off, then the next number (`11`) is turned on, then the panel is turned off again and finally the last number (`2`) is turned on and, after some time, off.
+
+For the example, with number 137, Sam's clock requires:
+
+- `137`: $(2 + 5 + 4) × 2 = 22$ transitions (`137` on/off).
+- `11`: $(2 + 2) × 2 = 8$ transitions (`11` on/off).
+- `2`: $(5) × 2 = 10$ transitions (`2` on/off).
 
 For a grand total of 40 transitions.
 
-Max's clock works differently. Instead of turning off the whole panel, it is smart enough to turn off only those segments that won't be needed for the next number. For number 137, Max's clock requires:"137" : 2 + 5 + 4 = 11 transitions ("137" on) 7 transitions (to turn off the segments that are not needed for number "11"). "11" : 0 transitions (number "11" is already turned on correctly) 3 transitions (to turn off the first "1" and the bottom part of the second "1"; the top part is common with number "2"). "2" : 4 transitions (to turn on the remaining segments in order to get a "2") 5 transitions (to turn off number "2").
+Max's clock works differently. Instead of turning off the whole panel, it is smart enough to turn off only those segments that won't be needed for the next number.
+
+For number 137, Max's clock requires:
+
+- `137` : $2 + 5 + 4 = 11$ transitions (`137` on), $7$ transitions (to turn off the segments that are not needed for number `11`).
+- `11` : $0$ transitions (number `11` is already turned on correctly), $3$ transitions (to turn off the first `1` and the bottom part of the second `1`; the top part is common with number `2`).
+- `2` : $4$ transitions (to turn on the remaining segments in order to get a `2`), $5$ transitions (to turn off number `2`).
 
 For a grand total of 30 transitions.
 
-Of course, Max's clock consumes less power than Sam's one. The two clocks are fed all the prime numbers between A = 107 and B = 2×107. Find the difference between the total number of transitions needed by Sam's clock and that needed by Max's one.
+Of course, Max's clock consumes less power than Sam's one. The two clocks are fed all the prime numbers between $A = {10}^7$ and $B = 2 × {10}^7$. Find the difference between the total number of transitions needed by Sam's clock and that needed by Max's one.
 
 # --hints--
 
-`euler315()` should return 13625242.
+`digitalRootClocks()` should return `13625242`.
 
 ```js
-assert.strictEqual(euler315(), 13625242);
+assert.strictEqual(digitalRootClocks(), 13625242);
 ```
 
 # --seed--
@@ -43,12 +57,12 @@ assert.strictEqual(euler315(), 13625242);
 ## --seed-contents--
 
 ```js
-function euler315() {
+function digitalRootClocks() {
 
   return true;
 }
 
-euler315();
+digitalRootClocks();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.md
index 4a2821b24e7..84139ba3bc8 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.md
@@ -1,33 +1,41 @@
 ---
 id: 5900f4a81000cf542c50ffbb
-title: 'Problem 316: Numbers in decimal expansions'
-challengeType: 5
+title: '问题 316：十进制扩展中的数字'
+challengeType: 1
 forumTopicId: 301972
 dashedName: problem-316-numbers-in-decimal-expansions
 ---
 
 # --description--
 
-Let p = p1 p2 p3 ... be an infinite sequence of random digits, selected from {0,1,2,3,4,5,6,7,8,9} with equal probability.
+Let $p = p_1 p_2 p_3 \ldots$ be an infinite sequence of random digits, selected from {0,1,2,3,4,5,6,7,8,9} with equal probability.
 
-It can be seen that p corresponds to the real number 0.p1 p2 p3 ....
+It can be seen that $p$ corresponds to the real number $0.p_1 p_2 p_3 \ldots$.
 
-It can also be seen that choosing a random real number from the interval \[0,1) is equivalent to choosing an infinite sequence of random digits selected from {0,1,2,3,4,5,6,7,8,9} with equal probability.
+It can also be seen that choosing a random real number from the interval [0,1) is equivalent to choosing an infinite sequence of random digits selected from {0,1,2,3,4,5,6,7,8,9} with equal probability.
 
-For any positive integer n with d decimal digits, let k be the smallest index such that pk, pk+1, ...pk+d-1 are the decimal digits of n, in the same order. Also, let g(n) be the expected value of k; it can be proven that g(n) is always finite and, interestingly, always an integer number.
+For any positive integer $n$ with $d$ decimal digits, let $k$ be the smallest index such that $p_k, p_{k + 1}, \ldots p_{k + d - 1}$ are the decimal digits of $n$, in the same order.
 
-For example, if n = 535, then for p = 31415926535897...., we get k = 9 for p = 355287143650049560000490848764084685354..., we get k = 36 etc and we find that g(535) = 1008.
+Also, let $g(n)$ be the expected value of $k$; it can be proven that $g(n)$ is always finite and, interestingly, always an integer number.
 
-Given that , find
+For example, if $n = 535$, then
 
-Note: represents the floor function.
+for $p = 31415926\mathbf{535}897\ldots$, we get $k = 9$
+
+for $p = 35528714365004956000049084876408468\mathbf{535}4\ldots$, we get $k = 36$
+
+etc and we find that $g(535) = 1008$.
+
+Given that $\displaystyle\sum_{n = 2}^{999} g\left(\left\lfloor\frac{{10}^6}{n}\right\rfloor\right) = 27280188$, find $\displaystyle\sum_{n = 2}^{999\\,999} g\left(\left\lfloor\frac{{10}^{16}}{n}\right\rfloor\right)$.
+
+**Note:** $\lfloor x\rfloor$ represents the floor function.
 
 # --hints--
 
-`euler316()` should return 542934735751917760.
+`numbersInDecimalExpansion()` should return `542934735751917760`.
 
 ```js
-assert.strictEqual(euler316(), 542934735751917760);
+assert.strictEqual(numbersInDecimalExpansion(), 542934735751917760);
 ```
 
 # --seed--
@@ -35,12 +43,12 @@ assert.strictEqual(euler316(), 542934735751917760);
 ## --seed-contents--
 
 ```js
-function euler316() {
+function numbersInDecimalExpansion() {
 
   return true;
 }
 
-euler316();
+numbersInDecimalExpansion();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-317-firecracker.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-317-firecracker.md
index bb528a225aa..f9715cfd8df 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-317-firecracker.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-317-firecracker.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4aa1000cf542c50ffbc
 title: 'Problem 317: Firecracker'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301973
 dashedName: problem-317-firecracker
 ---
 
 # --description--
 
-A firecracker explodes at a height of 100 m above level ground. It breaks into a large number of very small fragments, which move in every direction; all of them have the same initial velocity of 20 m/s.
+A firecracker explodes at a height of 100 m above level ground. It breaks into a large number of very small fragments, which move in every direction; all of them have the same initial velocity of 20 $\frac{\text{m}}{\text{s}}$.
 
-We assume that the fragments move without air resistance, in a uniform gravitational field with g=9.81 m/s2.
+We assume that the fragments move without air resistance, in a uniform gravitational field with $g=9.81 \frac{\text{m}}{\text{s}^2}$.
 
-Find the volume (in m3) of the region through which the fragments move before reaching the ground. Give your answer rounded to four decimal places.
+Find the volume (in $\text{m}^3$) of the region through which the fragments move before reaching the ground. Give your answer rounded to four decimal places.
 
 # --hints--
 
-`euler317()` should return 1856532.8455.
+`firecracker()` should return `1856532.8455`.
 
 ```js
-assert.strictEqual(euler317(), 1856532.8455);
+assert.strictEqual(firecracker(), 1856532.8455);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler317(), 1856532.8455);
 ## --seed-contents--
 
 ```js
-function euler317() {
+function firecracker() {
 
   return true;
 }
 
-euler317();
+firecracker();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-318-2011-nines.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-318-2011-nines.md
index 1e8e9b8821e..f4b4f8315b5 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-318-2011-nines.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-318-2011-nines.md
@@ -1,51 +1,39 @@
 ---
 id: 5900f4ab1000cf542c50ffbd
 title: 'Problem 318: 2011 nines'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301974
 dashedName: problem-318-2011-nines
 ---
 
 # --description--
 
-Consider the real number √2+√3.
+Consider the real number $\sqrt{2} + \sqrt{3}$.
 
-When we calculate the even powers of √2+√3
+When we calculate the even powers of $\sqrt{2} + \sqrt{3}$ we get:
 
-we get:
+$$\begin{align}   & {(\sqrt{2} + \sqrt{3})}^2 = 9.898979485566356\ldots \\\\
+  & {(\sqrt{2} + \sqrt{3})}^4 = 97.98979485566356\ldots \\\\   & {(\sqrt{2} + \sqrt{3})}^6 = 969.998969071069263\ldots \\\\
+  & {(\sqrt{2} + \sqrt{3})}^8 = 9601.99989585502907\ldots \\\\   & {(\sqrt{2} + \sqrt{3})}^{10} = 95049.999989479221\ldots \\\\
+  & {(\sqrt{2} + \sqrt{3})}^{12} = 940897.9999989371855\ldots \\\\   & {(\sqrt{2} + \sqrt{3})}^{14} = 9313929.99999989263\ldots \\\\
+  & {(\sqrt{2} + \sqrt{3})}^{16} = 92198401.99999998915\ldots \\\\ \end{align}$$
 
-(√2+√3)2 = 9.898979485566356...
+It looks like that the number of consecutive nines at the beginning of the fractional part of these powers is non-decreasing. In fact it can be proven that the fractional part of ${(\sqrt{2} + \sqrt{3})}^{2n}$ approaches 1 for large $n$.
 
-(√2+√3)4 = 97.98979485566356...
+Consider all real numbers of the form $\sqrt{p} + \sqrt{q}$ with $p$ and $q$ positive integers and $p &lt; q$, such that the fractional part of ${(\sqrt{p} + \sqrt{q})}^{2n}$ approaches 1 for large $n$.
 
-(√2+√3)6 = 969.998969071069263...
+Let $C(p,q,n)$ be the number of consecutive nines at the beginning of the fractional part of ${(\sqrt{p} + \sqrt{q})}^{2n}$.
 
-(√2+√3)8 = 9601.99989585502907...
+Let $N(p,q)$ be the minimal value of $n$ such that $C(p,q,n) ≥ 2011$.
 
-(√2+√3)10 = 95049.999989479221...
-
-(√2+√3)12 = 940897.9999989371855...
-
-(√2+√3)14 = 9313929.99999989263...
-
-(√2+√3)16 = 92198401.99999998915...
-
-It looks like that the number of consecutive nines at the beginning of the fractional part of these powers is non-decreasing. In fact it can be proven that the fractional part of (√2+√3)2n approaches 1 for large n.
-
-Consider all real numbers of the form √p+√q with p and q positive integers and p&lt;q, such that the fractional part of (√p+√q)2n approaches 1 for large n.
-
-Let C(p,q,n) be the number of consecutive nines at the beginning of the fractional part of (√p+√q)2n.
-
-Let N(p,q) be the minimal value of n such that C(p,q,n) ≥ 2011.
-
-Find ∑N(p,q) for p+q ≤ 2011.
+Find $\sum N(p,q)$ for $p + q ≤ 2011$.
 
 # --hints--
 
-`euler318()` should return 709313889.
+`twoThousandElevenNines()` should return `709313889`.
 
 ```js
-assert.strictEqual(euler318(), 709313889);
+assert.strictEqual(twoThousandElevenNines(), 709313889);
 ```
 
 # --seed--
@@ -53,12 +41,12 @@ assert.strictEqual(euler318(), 709313889);
 ## --seed-contents--
 
 ```js
-function euler318() {
+function twoThousandElevenNines() {
 
   return true;
 }
 
-euler318();
+twoThousandElevenNines();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-319-bounded-sequences.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-319-bounded-sequences.md
index 687eeb26cd2..36341fac54b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-319-bounded-sequences.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-319-bounded-sequences.md
@@ -1,33 +1,31 @@
 ---
 id: 5900f4ab1000cf542c50ffbe
 title: 'Problem 319: Bounded Sequences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301975
 dashedName: problem-319-bounded-sequences
 ---
 
 # --description--
 
-Let x1, x2,..., xn be a sequence of length n such that:
+Let $x_1, x_2, \ldots, x_n$ be a sequence of length $n$ such that:
 
-x1 = 2
-
-for all 1 &lt; i ≤ n : xi-1 &lt; xi
-
-for all i and j with 1 ≤ i, j ≤ n : (xi) j &lt; (xj + 1)i
+- $x_1 = 2$
+- for all $1 &lt; i ≤ n : x_{i - 1} &lt; x_i$
+- for all $i$ and $j$ with $1 ≤ i, j ≤ n : {(x_i)}^j &lt; {(x_j + 1)}^i$
 
 There are only five such sequences of length 2, namely: {2,4}, {2,5}, {2,6}, {2,7} and {2,8}. There are 293 such sequences of length 5; three examples are given below: {2,5,11,25,55}, {2,6,14,36,88}, {2,8,22,64,181}.
 
-Let t(n) denote the number of such sequences of length n. You are given that t(10) = 86195 and t(20) = 5227991891.
+Let $t(n)$ denote the number of such sequences of length $n$. You are given that $t(10) = 86195$ and $t(20) = 5227991891$.
 
-Find t(1010) and give your answer modulo 109.
+Find $t({10}^{10})$ and give your answer modulo $10^9$.
 
 # --hints--
 
-`euler319()` should return 268457129.
+`boundedSequences()` should return `268457129`.
 
 ```js
-assert.strictEqual(euler319(), 268457129);
+assert.strictEqual(boundedSequences(), 268457129);
 ```
 
 # --seed--
@@ -35,12 +33,12 @@ assert.strictEqual(euler319(), 268457129);
 ## --seed-contents--
 
 ```js
-function euler319() {
+function boundedSequences() {
 
   return true;
 }
 
-euler319();
+boundedSequences();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-32-pandigital-products.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-32-pandigital-products.md
index fe1724d44f7..5fe7d0495c5 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-32-pandigital-products.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-32-pandigital-products.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f38c1000cf542c50fe9f
 title: 'Problem 32: Pandigital products'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301976
 dashedName: problem-32-pandigital-products
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.md
index 5171172f984..b0f0cc5c6ae 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4ae1000cf542c50ffbf
 title: 'Problem 320: Factorials divisible by a huge integer'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301977
 dashedName: problem-320-factorials-divisible-by-a-huge-integer
 ---
 
 # --description--
 
-Let N(i) be the smallest integer n such that n! is divisible by (i!)1234567890
+Let $N(i)$ be the smallest integer $n$ such that $n!$ is divisible by $(i!)^{1234567890}$
 
-Let S(u)=∑N(i) for 10 ≤ i ≤ u.
+Let $S(u) = \sum N(i)$ for $10 ≤ i ≤ u$.
 
-S(1000)=614538266565663.
+$S(1000)=614\\,538\\,266\\,565\\,663$.
 
-Find S(1 000 000) mod 1018.
+Find $S(1\\,000\\,000)\bmod {10}^{18}$.
 
 # --hints--
 
-`euler320()` should return 278157919195482660.
+`divisibleByHugeInteger()` should return `278157919195482660`.
 
 ```js
-assert.strictEqual(euler320(), 278157919195482660);
+assert.strictEqual(divisibleByHugeInteger(), 278157919195482660);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler320(), 278157919195482660);
 ## --seed-contents--
 
 ```js
-function euler320() {
+function divisibleByHugeInteger() {
 
   return true;
 }
 
-euler320();
+divisibleByHugeInteger();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md
index 34e52a4dea9..177610fd3c7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md
@@ -1,29 +1,35 @@
 ---
 id: 5900f4ae1000cf542c50ffc0
 title: 'Problem 321: Swapping Counters'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301978
 dashedName: problem-321-swapping-counters
 ---
 
 # --description--
 
-A horizontal row comprising of 2n + 1 squares has n red counters placed at one end and n blue counters at the other end, being separated by a single empty square in the centre. For example, when n = 3.
+A horizontal row comprising of $2n + 1$ squares has $n$ red counters placed at one end and $n$ blue counters at the other end, being separated by a single empty square in the center. For example, when $n = 3$.
+
+<img class="img-responsive center-block" alt="three squares with red and blue counters placed on opposite ends of the row, separated by one empty square" src="https://cdn.freecodecamp.org/curriculum/project-euler/swapping-counters-1.gif" style="background-color: white; padding: 10px;" />
 
 A counter can move from one square to the next (slide) or can jump over another counter (hop) as long as the square next to that counter is unoccupied.
 
-Let M(n) represent the minimum number of moves/actions to completely reverse the positions of the coloured counters; that is, move all the red counters to the right and all the blue counters to the left. It can be verified M(3) = 15, which also happens to be a triangle number.
+<img class="img-responsive center-block" alt="allowed moves of the counter" src="https://cdn.freecodecamp.org/curriculum/project-euler/swapping-counters-2.gif" style="background-color: white; padding: 10px;" />
 
-If we create a sequence based on the values of n for which M(n) is a triangle number then the first five terms would be: 1, 3, 10, 22, and 63, and their sum would be 99.
+Let $M(n)$ represent the minimum number of moves/actions to completely reverse the positions of the colored counters; that is, move all the red counters to the right and all the blue counters to the left.
+
+It can be verified $M(3) = 15$, which also happens to be a triangle number.
+
+If we create a sequence based on the values of n for which $M(n)$ is a triangle number then the first five terms would be: 1, 3, 10, 22, and 63, and their sum would be 99.
 
 Find the sum of the first forty terms of this sequence.
 
 # --hints--
 
-`euler321()` should return 2470433131948040.
+`swappingCounters()` should return `2470433131948040`.
 
 ```js
-assert.strictEqual(euler321(), 2470433131948040);
+assert.strictEqual(swappingCounters(), 2470433131948040);
 ```
 
 # --seed--
@@ -31,12 +37,12 @@ assert.strictEqual(euler321(), 2470433131948040);
 ## --seed-contents--
 
 ```js
-function euler321() {
+function swappingCounters() {
 
   return true;
 }
 
-euler321();
+swappingCounters();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.md
index 241c3a74f07..2c1725a5c4b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4af1000cf542c50ffc1
 title: 'Problem 322: Binomial coefficients divisible by 10'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301979
 dashedName: problem-322-binomial-coefficients-divisible-by-10
 ---
 
 # --description--
 
-Let T(m, n) be the number of the binomial coefficients iCn that are divisible by 10 for n ≤ i &lt; m(i, m and n are positive integers).
+Let $T(m, n)$ be the number of the binomial coefficients ${}^iC_n$ that are divisible by 10 for $n ≤ i &lt; m$ ($i$, $m$ and $n$ are positive integers).
 
-You are given that T(109, 107-10) = 989697000.
+You are given that $T({10}^9, {10}^7 - 10) = 989\\,697\\,000$.
 
-Find T(1018, 1012-10).
+Find $T({10}^{18}, {10}^{12} - 10)$.
 
 # --hints--
 
-`euler322()` should return 999998760323314000.
+`binomialCoefficientsDivisibleBy10()` should return `999998760323314000`.
 
 ```js
-assert.strictEqual(euler322(), 999998760323314000);
+assert.strictEqual(binomialCoefficientsDivisibleBy10(), 999998760323314000);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler322(), 999998760323314000);
 ## --seed-contents--
 
 ```js
-function euler322() {
+function binomialCoefficientsDivisibleBy10() {
 
   return true;
 }
 
-euler322();
+binomialCoefficientsDivisibleBy10();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
index b3367595620..7cd5acf36cc 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
@@ -1,31 +1,30 @@
 ---
 id: 5900f4b01000cf542c50ffc2
 title: 'Problem 323: Bitwise-OR operations on random integers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301980
 dashedName: problem-323-bitwise-or-operations-on-random-integers
 ---
 
 # --description--
 
-Let y0, y1, y2,... be a sequence of random unsigned 32 bit integers
+Let $y_0, y_1, y_2, \ldots$ be a sequence of random unsigned 32 bit integers (i.e. $0 ≤ y_i &lt; 2^{32}$, every value equally likely).
 
-(i.e. 0 ≤ yi &lt; 232, every value equally likely).
+For the sequence $x_i$ the following recursion is given:
 
-For the sequence xi the following recursion is given:x0 = 0 and
+- $x_0 = 0$ and
+- $x_i = x_{i - 1} \mathbf{|} y_{i - 1}$, for $i > 0$. ($\mathbf{|}$ is the bitwise-OR operator)
 
-xi = xi-1| yi-1, for i > 0. ( | is the bitwise-OR operator)
+It can be seen that eventually there will be an index $N$ such that $x_i = 2^{32} - 1$ (a bit-pattern of all ones) for all $i ≥ N$.
 
-It can be seen that eventually there will be an index N such that xi = 232 -1 (a bit-pattern of all ones) for all i ≥ N.
-
-Find the expected value of N. Give your answer rounded to 10 digits after the decimal point.
+Find the expected value of $N$. Give your answer rounded to 10 digits after the decimal point.
 
 # --hints--
 
-`euler323()` should return 6.3551758451.
+`bitwiseOrOnRandomIntegers()` should return `6.3551758451`.
 
 ```js
-assert.strictEqual(euler323(), 6.3551758451);
+assert.strictEqual(bitwiseOrOnRandomIntegers(), 6.3551758451);
 ```
 
 # --seed--
@@ -33,12 +32,12 @@ assert.strictEqual(euler323(), 6.3551758451);
 ## --seed-contents--
 
 ```js
-function euler323() {
+function bitwiseOrOnRandomIntegers() {
 
   return true;
 }
 
-euler323();
+bitwiseOrOnRandomIntegers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md
index 66ce4914777..e79296a5f0f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md
@@ -1,25 +1,29 @@
 ---
 id: 5900f4b11000cf542c50ffc3
 title: 'Problem 324: Building a tower'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301981
 dashedName: problem-324-building-a-tower
 ---
 
 # --description--
 
-Let f(n) represent the number of ways one can fill a 3×3×n tower with blocks of 2×1×1. You're allowed to rotate the blocks in any way you like; however, rotations, reflections etc of the tower itself are counted as distinct.
+Let $f(n)$ represent the number of ways one can fill a $3×3×n$ tower with blocks of $2×1×1$. You're allowed to rotate the blocks in any way you like; however, rotations, reflections etc of the tower itself are counted as distinct.
 
-For example (with q = 100000007) :f(2) = 229,f(4) = 117805,f(10) mod q = 96149360,f(103) mod q = 24806056,f(106) mod q = 30808124.
+For example (with $q = 100\\,000\\,007$):
 
-Find f(1010000) mod 100000007.
+$$\begin{align}   & f(2) = 229, \\\\
+  & f(4) = 117\\,805, \\\\   & f(10)\bmod q = 96\\,149\\,360, \\\\
+  & f({10}^3)\bmod q = 24\\,806\\,056, \\\\ & f({10}^6)\bmod q = 30\\,808\\,124. \end{align}$$
+
+Find $f({10}^{10000})\bmod 100\\,000\\,007$.
 
 # --hints--
 
-`euler324()` should return 96972774.
+`buildingTower()` should return `96972774`.
 
 ```js
-assert.strictEqual(euler324(), 96972774);
+assert.strictEqual(buildingTower(), 96972774);
 ```
 
 # --seed--
@@ -27,12 +31,12 @@ assert.strictEqual(euler324(), 96972774);
 ## --seed-contents--
 
 ```js
-function euler324() {
+function buildingTower() {
 
   return true;
 }
 
-euler324();
+buildingTower();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-325-stone-game-ii.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-325-stone-game-ii.md
index 6d0389b9fac..b1392c1e246 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-325-stone-game-ii.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-325-stone-game-ii.md
@@ -1,16 +1,16 @@
 ---
 id: 5900f4b11000cf542c50ffc4
 title: 'Problem 325: Stone Game II'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301982
 dashedName: problem-325-stone-game-ii
 ---
 
 # --description--
 
-A game is played with two piles of stones and two players. At her turn, a player removes a number of stones from the larger pile. The number of stones she removes must be a positive multiple of the number of stones in the smaller pile.
+A game is played with two piles of stones and two players. On each player's turn, the player may remove a number of stones from the larger pile. The number of stones removes must be a positive multiple of the number of stones in the smaller pile.
 
-E.g., let the ordered pair(6,14) describe a configuration with 6 stones in the smaller pile and 14 stones in the larger pile, then the first player can remove 6 or 12 stones from the larger pile.
+E.g., let the ordered pair (6,14) describe a configuration with 6 stones in the smaller pile and 14 stones in the larger pile, then the first player can remove 6 or 12 stones from the larger pile.
 
 The player taking all the stones from a pile wins the game.
 
@@ -18,16 +18,16 @@ A winning configuration is one where the first player can force a win. For examp
 
 A losing configuration is one where the second player can force a win, no matter what the first player does. For example, (2,3) and (3,4) are losing configurations: any legal move leaves a winning configuration for the second player.
 
-Define S(N) as the sum of (xi+yi) for all losing configurations (xi,yi), 0 &lt; xi &lt; yi ≤ N. We can verify that S(10) = 211 and S(104) = 230312207313.
+Define $S(N)$ as the sum of ($x_i + y_i$) for all losing configurations ($x_i$, $y_i$), $0 &lt; x_i &lt; y_i ≤ N$. We can verify that $S(10) = 211$ and $S({10}^4) = 230\\,312\\,207\\,313$.
 
-Find S(1016) mod 710.
+Find $S({10}^{16})\bmod 7^{10}$.
 
 # --hints--
 
-`euler325()` should return 54672965.
+`stoneGameTwo()` should return `54672965`.
 
 ```js
-assert.strictEqual(euler325(), 54672965);
+assert.strictEqual(stoneGameTwo(), 54672965);
 ```
 
 # --seed--
@@ -35,12 +35,12 @@ assert.strictEqual(euler325(), 54672965);
 ## --seed-contents--
 
 ```js
-function euler325() {
+function stoneGameTwo() {
 
   return true;
 }
 
-euler325();
+stoneGameTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md
index 1e6b648d9a0..e43a4a9f23c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f4b21000cf542c50ffc5
 title: 'Problem 326: Modulo Summations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301983
 dashedName: problem-326-modulo-summations
 ---
 
 # --description--
 
-Let an be a sequence recursively defined by: .
+Let $a_n$ be a sequence recursively defined by: $a_1 = 1$, $\displaystyle a_n = \left(\sum_{k = 1}^{n - 1} k \times a_k\right)\bmod n$.
 
-So the first 10 elements of an are: 1,1,0,3,0,3,5,4,1,9.
+So the first 10 elements of $a_n$ are: 1, 1, 0, 3, 0, 3, 5, 4, 1, 9.
 
-Let f(N,M) represent the number of pairs (p,q) such that:
+Let $f(N, M)$ represent the number of pairs $(p, q)$ such that:
 
-It can be seen that f(10,10)=4 with the pairs (3,3), (5,5), (7,9) and (9,10).
+$$ 1 \le p \le q \le N \\; \text{and} \\; \left(\sum_{i = p}^q a_i\right)\bmod M = 0$$
 
-You are also given that f(104,103)=97158.
+It can be seen that $f(10, 10) = 4$ with the pairs (3,3), (5,5), (7,9) and (9,10).
 
-Find f(1012,106).
+You are also given that $f({10}^4, {10}^3) = 97\\,158$.
+
+Find $f({10}^{12}, {10}^6)$.
 
 # --hints--
 
-`euler326()` should return 1966666166408794400.
+`moduloSummations()` should return `1966666166408794400`.
 
 ```js
-assert.strictEqual(euler326(), 1966666166408794400);
+assert.strictEqual(moduloSummations(), 1966666166408794400);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler326(), 1966666166408794400);
 ## --seed-contents--
 
 ```js
-function euler326() {
+function moduloSummations() {
 
   return true;
 }
 
-euler326();
+moduloSummations();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md
index 354596b1d74..e4e0c0b3ffc 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4b31000cf542c50ffc6
 title: 'Problem 327: Rooms of Doom'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301984
 dashedName: problem-327-rooms-of-doom
 ---
@@ -10,28 +10,36 @@ dashedName: problem-327-rooms-of-doom
 
 A series of three rooms are connected to each other by automatic doors.
 
-Each door is operated by a security card. Once you enter a room the door automatically closes and that security card cannot be used again. A machine at the start will dispense an unlimited number of cards, but each room (including the starting room) contains scanners and if they detect that you are holding more than three security cards or if they detect an unattended security card on the floor, then all the doors will become permanently locked. However, each room contains a box where you may safely store any number of security cards for use at a later stage.
+<img class="img-responsive center-block" alt="series of three rooms, connected to each other by automatic doors" src="https://cdn.freecodecamp.org/curriculum/project-euler/rooms-of-doom.gif" style="background-color: white; padding: 10px;" />
+
+每扇门都由安全卡操作。 Once you enter a room, the door automatically closes, and that security card cannot be used again. A machine will dispense an unlimited number of cards at the start, but each room (including the starting room) contains scanners. If they detect that you are holding more than three security cards or if they detect an unattended security card on the floor, then all the doors will become permanently locked. However, each room contains a box where you may safely store any number of security cards for use at a later stage.
 
 If you simply tried to travel through the rooms one at a time then as you entered room 3 you would have used all three cards and would be trapped in that room forever!
 
-However, if you make use of the storage boxes, then escape is possible. For example, you could enter room 1 using your first card, place one card in the storage box, and use your third card to exit the room back to the start. Then after collecting three more cards from the dispensing machine you could use one to enter room 1 and collect the card you placed in the box a moment ago. You now have three cards again and will be able to travel through the remaining three doors. This method allows you to travel through all three rooms using six security cards in total.
+但是，如果您使用存储箱，则可以进行逃生。 For example, you could enter room 1 using your first card, place one card in the storage box, and use your third card to exit the room back to the start. Then after collecting three more cards from the dispensing machine you could use one to enter room 1 and collect the card you placed in the box a moment ago. You now have three cards again and will be able to travel through the remaining three doors. This method allows you to travel through all three rooms using six security cards in total.
 
 It is possible to travel through six rooms using a total of 123 security cards while carrying a maximum of 3 cards.
 
-Let C be the maximum number of cards which can be carried at any time. Let R be the number of rooms to travel through. Let M(C,R) be the minimum number of cards required from the dispensing machine to travel through R rooms carrying up to a maximum of C cards at any time.
+Let $C$ be the maximum number of cards which can be carried at any time.
 
-For example, M(3,6)=123 and M(4,6)=23.And, ΣM(C,6)=146 for 3 ≤ C ≤ 4.
+Let $R$ be the number of rooms to travel through.
 
-You are given that ΣM(C,10)=10382 for 3 ≤ C ≤ 10.
+Let $M(C, R)$ be the minimum number of cards required from the dispensing machine to travel through $R$ rooms carrying up to a maximum of $C$ cards at any time.
 
-Find ΣM(C,30) for 3 ≤ C ≤ 40.
+For example, $M(3, 6) = 123$ and $M(4, 6) = 23$.
+
+And, $\sum M(C, 6) = 146$ for $3 ≤ C ≤ 4$.
+
+You are given that $\sum M(C, 10) = 10382$ for $3 ≤ C ≤ 10$.
+
+Find $\sum M(C, 30)$ for $3 ≤ C ≤ 40$.
 
 # --hints--
 
-`euler327()` should return 34315549139516.
+`roomsOfDoom()` should return `34315549139516`.
 
 ```js
-assert.strictEqual(euler327(), 34315549139516);
+assert.strictEqual(roomsOfDoom(), 34315549139516);
 ```
 
 # --seed--
@@ -39,12 +47,12 @@ assert.strictEqual(euler327(), 34315549139516);
 ## --seed-contents--
 
 ```js
-function euler327() {
+function roomsOfDoom() {
 
   return true;
 }
 
-euler327();
+roomsOfDoom();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-328-lowest-cost-search.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-328-lowest-cost-search.md
index 4a00f455cc1..3d3d44147e3 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-328-lowest-cost-search.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-328-lowest-cost-search.md
@@ -1,39 +1,39 @@
 ---
 id: 5900f4b41000cf542c50ffc7
 title: 'Problem 328: Lowest-cost Search'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301985
 dashedName: problem-328-lowest-cost-search
 ---
 
 # --description--
 
-We are trying to find a hidden number selected from the set of integers {1, 2, ..., n} by asking questions.
+We are trying to find a hidden number selected from the set of integers {1, 2, ..., $n$} by asking questions. Each number (question) we ask, has a <u>cost equal to the number asked</u> and we get one of three possible answers:
 
-Each number (question) we ask, has a cost equal to the number asked and we get one of three possible answers: "Your guess is lower than the hidden number", or
+- "Your guess is lower than the hidden number", or
+- "Yes, that's it!", or
+- "Your guess is higher than the hidden number".
 
-"Yes, that's it!", or
+Given the value of $n$, an optimal strategy minimizes the total cost (i.e. the sum of all the questions asked) <u>for the worst possible case</u>. E.g.
 
-"Your guess is higher than the hidden number".
+If $n = 3$, the best we can do is obviously to ask the number "<strong>2</strong>". The answer will immediately lead us to find the hidden number (at a total cost = 2).
 
-Given the value of n, an optimal strategy minimizes the total cost (i.e. the sum of all the questions asked) for the worst possible case. E.g.
+If $n = 8$, we might decide to use a "binary search" type of strategy: Our first question would be "<strong>4</strong>" and if the hidden number is higher than 4 we will need one or two additional questions. Let our second question be "<strong>6</strong>". If the hidden number is still higher than 6, we will need a third question in order to discriminate between 7 and 8. Thus, our third question will be "<strong>7</strong>" and the total cost for this worst-case scenario will be $4 + 6 + 7 = \mathbf{\color{red}{17}}$.
 
-If n=3, the best we can do is obviously to ask the number "2". The answer will immediately lead us to find the hidden number (at a total cost = 2).
+We can improve considerably the worst-case cost for $n = 8$, by asking "<strong>5</strong>" as our first question. If we are told that the hidden number is higher than 5, our second question will be "<strong>7</strong>", then we'll know for certain what the hidden number is (for a total cost of $5 + 7 = \mathbf{\color{blue}{12}}$). If we are told that the hidden number is lower than 5, our second question will be "<strong>3</strong>" and if the hidden number is lower than 3 our third question will be "<strong>1</strong>", giving a total cost of $5 + 3 + 1 = \mathbf{\color{blue}{9}}$. Since $\mathbf{\color{blue}{12 > 9}}$, the worst-case cost for this strategy is <strong><span style="color: red;">12</span></strong>. That's better than what we achieved previously with the "binary search" strategy; it is also better than or equal to any other strategy. So, in fact, we have just described an optimal strategy for $n = 8$.
 
-If n=8, we might decide to use a "binary search" type of strategy: Our first question would be "4" and if the hidden number is higher than 4 we will need one or two additional questions. Let our second question be "6". If the hidden number is still higher than 6, we will need a third question in order to discriminate between 7 and 8. Thus, our third question will be "7" and the total cost for this worst-case scenario will be 4+6+7=17.
+Let $C(n)$ be the worst-case cost achieved by an optimal strategy for $n$, as described above. Thus $C(1) = 0$, $C(2) = 1$, $C(3) = 2$ and $C(8) = 12$.
 
-We can improve considerably the worst-case cost for n=8, by asking "5" as our first question. If we are told that the hidden number is higher than 5, our second question will be "7", then we'll know for certain what the hidden number is (for a total cost of 5+7=12). If we are told that the hidden number is lower than 5, our second question will be "3" and if the hidden number is lower than 3 our third question will be "1", giving a total cost of 5+3+1=9. Since 12>9, the worst-case cost for this strategy is 12. That's better than what we achieved previously with the "binary search" strategy; it is also better than or equal to any other strategy. So, in fact, we have just described an optimal strategy for n=8.
+Similarly, $C(100) = 400$ and $\displaystyle\sum_{n = 1}^{100} C(n) = 17575$.
 
-Let C(n) be the worst-case cost achieved by an optimal strategy for n, as described above. Thus C(1) = 0, C(2) = 1, C(3) = 2 and C(8) = 12. Similarly, C(100) = 400 and C(n) = 17575.
-
-Find C(n).
+Find $\displaystyle\sum_{n = 1}^{200\\,000} C(n)$.
 
 # --hints--
 
-`euler328()` should return 260511850222.
+`lowestCostSearch()` should return `260511850222`.
 
 ```js
-assert.strictEqual(euler328(), 260511850222);
+assert.strictEqual(lowestCostSearch(), 260511850222);
 ```
 
 # --seed--
@@ -41,12 +41,12 @@ assert.strictEqual(euler328(), 260511850222);
 ## --seed-contents--
 
 ```js
-function euler328() {
+function lowestCostSearch() {
 
   return true;
 }
 
-euler328();
+lowestCostSearch();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-329-prime-frog.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-329-prime-frog.md
index 6b1e185daf9..e14df07e58a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-329-prime-frog.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-329-prime-frog.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4b51000cf542c50ffc8
 title: 'Problem 329: Prime Frog'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301986
 dashedName: problem-329-prime-frog
 ---
@@ -12,20 +12,26 @@ Susan has a prime frog.
 
 Her frog is jumping around over 500 squares numbered 1 to 500.
 
-He can only jump one square to the left or to the right, with equal probability, and he cannot jump outside the range \[1;500].(if it lands at either end, it automatically jumps to the only available square on the next move.)
+He can only jump one square to the left or to the right, with equal probability, and he cannot jump outside the range [1;500]. (if it lands at either end, it automatically jumps to the only available square on the next move.)
 
-When he is on a square with a prime number on it, he croaks 'P' (PRIME) with probability 2/3 or 'N' (NOT PRIME) with probability 1/3 just before jumping to the next square. When he is on a square with a number on it that is not a prime he croaks 'P' with probability 1/3 or 'N' with probability 2/3 just before jumping to the next square.
+When he is on a square with a prime number on it, he croaks 'P' (PRIME) with probability $\frac{2}{3}$ or 'N' (NOT PRIME) with probability $\frac{1}{3}$ just before jumping to the next square. When he is on a square with a number on it that is not a prime he croaks 'P' with probability $\frac{1}{3}$ or 'N' with probability $\frac{2}{3}$ just before jumping to the next square.
 
 Given that the frog's starting position is random with the same probability for every square, and given that she listens to his first 15 croaks, what is the probability that she hears the sequence PPPPNNPPPNPPNPN?
 
-Give your answer as a fraction p/q in reduced form.
+Give your answer as a string as a fraction `p/q` in reduced form.
 
 # --hints--
 
-`euler329()` should return 199740353 / 29386561536000.
+`primeFrog()` should return a string.
 
 ```js
-assert.strictEqual(euler329(), 199740353 / 29386561536000);
+assert(typeof primeFrog() === 'string');
+```
+
+`primeFrog()` should return the string `199740353/29386561536000`.
+
+```js
+assert.strictEqual(primeFrog(), '199740353/29386561536000');
 ```
 
 # --seed--
@@ -33,12 +39,12 @@ assert.strictEqual(euler329(), 199740353 / 29386561536000);
 ## --seed-contents--
 
 ```js
-function euler329() {
+function primeFrog() {
 
   return true;
 }
 
-euler329();
+primeFrog();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.md
index ec7756e9451..5419f2f8270 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f38d1000cf542c50fea0
 title: 'Problem 33: Digit cancelling fractions'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301987
 dashedName: problem-33-digit-cancelling-fractions
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-331-cross-flips.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-331-cross-flips.md
index 4d3d330a744..84e5ffbdd51 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-331-cross-flips.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-331-cross-flips.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4b71000cf542c50ffca
 title: 'Problem 331: Cross flips'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301989
 dashedName: problem-331-cross-flips
 ---
@@ -10,24 +10,26 @@ dashedName: problem-331-cross-flips
 
 N×N disks are placed on a square game board. Each disk has a black side and white side.
 
-At each turn, you may choose a disk and flip all the disks in the same row and the same column as this disk: thus 2×N-1 disks are flipped. The game ends when all disks show their white side. The following example shows a game on a 5×5 board.
+At each turn, you may choose a disk and flip all the disks in the same row and the same column as this disk: thus $2 × N - 1$ disks are flipped. The game ends when all disks show their white side. The following example shows a game on a 5×5 board.
+
+<img class="img-responsive center-block" alt="animation showing game on 5x5 board" src="https://cdn.freecodecamp.org/curriculum/project-euler/cross-flips.gif" style="background-color: white; padding: 10px;" />
 
 It can be proven that 3 is the minimal number of turns to finish this game.
 
-The bottom left disk on the N×N board has coordinates (0,0); the bottom right disk has coordinates (N-1,0) and the top left disk has coordinates (0,N-1).
+The bottom left disk on the $N×N$ board has coordinates (0, 0); the bottom right disk has coordinates ($N - 1$,$0$) and the top left disk has coordinates ($0$,$N - 1$).
 
-Let CN be the following configuration of a board with N×N disks: A disk at (x,y) satisfying , shows its black side; otherwise, it shows its white side. C5 is shown above.
+Let $C_N$ be the following configuration of a board with $N × N$ disks: A disk at ($x$, $y$) satisfying $N - 1 \le \sqrt{x^2 + y^2} \lt N$, shows its black side; otherwise, it shows its white side. $C_5$ is shown above.
 
-Let T(N) be the minimal number of turns to finish a game starting from configuration CN or 0 if configuration CN is unsolvable. We have shown that T(5)=3. You are also given that T(10)=29 and T(1 000)=395253.
+Let $T(N)$ be the minimal number of turns to finish a game starting from configuration $C_N$ or 0 if configuration $C_N$ is unsolvable. We have shown that $T(5) = 3$. You are also given that $T(10) = 29$ and $T(1\\,000) = 395\\,253$.
 
-Find .
+Find $\displaystyle \sum_{i = 3}^{31} T(2^i - i)$.
 
 # --hints--
 
-`euler331()` should return 467178235146843500.
+`crossFlips()` should return `467178235146843500`.
 
 ```js
-assert.strictEqual(euler331(), 467178235146843500);
+assert.strictEqual(crossFlips(), 467178235146843500);
 ```
 
 # --seed--
@@ -35,12 +37,12 @@ assert.strictEqual(euler331(), 467178235146843500);
 ## --seed-contents--
 
 ```js
-function euler331() {
+function crossFlips() {
 
   return true;
 }
 
-euler331();
+crossFlips();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md
index ea3a4d0c431..7dea7637703 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4b91000cf542c50ffcb
 title: 'Problem 332: Spherical triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301990
 dashedName: problem-332-spherical-triangles
 ---
@@ -10,18 +10,26 @@ dashedName: problem-332-spherical-triangles
 
 A spherical triangle is a figure formed on the surface of a sphere by three great circular arcs intersecting pairwise in three vertices.
 
-Let C(r) be the sphere with the centre (0,0,0) and radius r. Let Z(r) be the set of points on the surface of C(r) with integer coordinates. Let T(r) be the set of spherical triangles with vertices in Z(r). Degenerate spherical triangles, formed by three points on the same great arc, are not included in T(r). Let A(r) be the area of the smallest spherical triangle in T(r).
+<img class="img-responsive center-block" alt="spherical triangle formed on the surface of a sphere" src="https://cdn.freecodecamp.org/curriculum/project-euler/spherical-triangles.jpg" style="background-color: white; padding: 10px;" />
 
-For example A(14) is 3.294040 rounded to six decimal places.
+Let $C(r)$ be the sphere with the centre (0,0,0) and radius $r$.
 
-Find A(r). Give your answer rounded to six decimal places.
+Let $Z(r)$ be the set of points on the surface of $C(r)$ with integer coordinates.
+
+Let $T(r)$ be the set of spherical triangles with vertices in $Z(r)$. Degenerate spherical triangles, formed by three points on the same great arc, are <u>not</u> included in $T(r)$.
+
+Let $A(r)$ be the area of the smallest spherical triangle in $T(r)$.
+
+For example $A(14)$ is 3.294040 rounded to six decimal places.
+
+Find $\displaystyle \sum_{r = 1}^{50} A(r)$. 将您的答案四舍五入到小数点后六位。
 
 # --hints--
 
-`euler332()` should return 2717.751525.
+`sphericalTriangles()` should return `2717.751525`.
 
 ```js
-assert.strictEqual(euler332(), 2717.751525);
+assert.strictEqual(sphericalTriangles(), 2717.751525);
 ```
 
 # --seed--
@@ -29,12 +37,12 @@ assert.strictEqual(euler332(), 2717.751525);
 ## --seed-contents--
 
 ```js
-function euler332() {
+function sphericalTriangles() {
 
   return true;
 }
 
-euler332();
+sphericalTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-333-special-partitions.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-333-special-partitions.md
index 5af490eb7ea..15f1424b397 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-333-special-partitions.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-333-special-partitions.md
@@ -1,33 +1,36 @@
 ---
 id: 5900f4b91000cf542c50ffcc
-title: 'Problem 333: Special partitions'
-challengeType: 5
+title: '问题 333：特殊分区'
+challengeType: 1
 forumTopicId: 301991
 dashedName: problem-333-special-partitions
 ---
 
 # --description--
 
-All positive integers can be partitioned in such a way that each and every term of the partition can be expressed as 2ix3j, where i,j ≥ 0.
+All positive integers can be partitioned in such a way that each and every term of the partition can be expressed as $2^i \times 3^j$, where $i, j ≥ 0$.
 
-Let's consider only those such partitions where none of the terms can divide any of the other terms. For example, the partition of 17 = 2 + 6 + 9 = (21x30 + 21x31 + 20x32) would not be valid since 2 can divide 6. Neither would the partition 17 = 16 + 1 = (24x30 + 20x30) since 1 can divide 16. The only valid partition of 17 would be 8 + 9 = (23x30 + 20x32).
+Let's consider only those such partitions where none of the terms can divide any of the other terms. For example, the partition of $17 = 2 + 6 + 9 = (2^1 \times 3^0 + 2^1 \times 3^1 + 2^0 \times 3^2)$ would not be valid since 2 can divide 6. Neither would the partition $17 = 16 + 1 = (2^4 \times 3^0 + 2^0 \times 3^0)$ since 1 can divide 16. The only valid partition of 17 would be $8 + 9 = (2^3 \times 3^0 + 2^0 \times 3^2)$.
 
-Many integers have more than one valid partition, the first being 11 having the following two partitions. 11 = 2 + 9 = (21x30 + 20x32) 11 = 8 + 3 = (23x30 + 20x31)
+Many integers have more than one valid partition, the first being 11 having the following two partitions.
 
-Let's define P(n) as the number of valid partitions of n. For example, P(11) = 2.
+$$\begin{align}   & 11 = 2 + 9 = (2^1 \times 3^0 + 2^0 \times 3^2) \\\\
+  & 11 = 8 + 3 = (2^3 \times 3^0 + 2^0 \times 3^1) \end{align}$$
 
-Let's consider only the prime integers q which would have a single valid partition such as P(17).
+Let's define $P(n)$ as the number of valid partitions of $n$. For example, $P(11) = 2$.
 
-The sum of the primes q &lt;100 such that P(q)=1 equals 233.
+Let's consider only the prime integers $q$ which would have a single valid partition such as $P(17)$.
 
-Find the sum of the primes q &lt;1000000 such that P(q)=1.
+The sum of the primes $q &lt;100$ such that $P(q) = 1$ equals 233.
+
+Find the sum of the primes $q &lt; 1\\,000\\,000$ such that $P(q) = 1$.
 
 # --hints--
 
-`euler333()` should return 3053105.
+`specialPartitions()` should return `3053105`.
 
 ```js
-assert.strictEqual(euler333(), 3053105);
+assert.strictEqual(specialPartitions(), 3053105);
 ```
 
 # --seed--
@@ -35,12 +38,12 @@ assert.strictEqual(euler333(), 3053105);
 ## --seed-contents--
 
 ```js
-function euler333() {
+function specialPartitions() {
 
   return true;
 }
 
-euler333();
+specialPartitions();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md
index fe354cec8a1..d8be81c5efa 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4ba1000cf542c50ffcd
 title: 'Problem 334: Spilling the beans'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301992
 dashedName: problem-334-spilling-the-beans
 ---
@@ -12,20 +12,25 @@ In Plato's heaven, there exist an infinite number of bowls in a straight line. E
 
 For example, consider two adjacent bowls containing 2 and 3 beans respectively, all other bowls being empty. The following eight moves will finish the game:
 
-<!-- TODO Use MathJax and re-write from projecteuler.net -->
+<img class="img-responsive center-block" alt="animation of game when two adjacent bowls contains 2 and 3 beans respectivelly" src="https://cdn.freecodecamp.org/curriculum/project-euler/spilling-the-beans.gif" style="background-color: white; padding: 10px;" />
 
-You are given the following sequences: t0 = 123456. ti = ti-12, if ti-1 is even ti-12 926252, if ti-1 is odd where ⌊x⌋ is the floor function and is the bitwise XOR operator. bi = ( ti mod 211) + 1.
+You are given the following sequences:
 
-The first two terms of the last sequence are b1 = 289 and b2 = 145. If we start with b1 and b2 beans in two adjacent bowls, 3419100 moves would be required to finish the game.
+$$\begin{align}   & t_0 = 123456, \\\\
+  & t_i = \begin{cases}          \frac{t_{i - 1}}{2},               & \text{if $t_{i - 1}$ is even} \\\\
+         \left\lfloor\frac{t_{i - 1}}{2}\right\rfloor \oplus 926252, & \text{if $t_{i - 1}$ is odd}          \end{cases} \\\\
+         & \qquad \text{where $⌊x⌋$ is the floor function and $\oplus$ is the bitwise XOR operator.} \\\\ & b_i = (t_i\bmod 2^{11}) + 1. \end{align}$$
 
-Consider now 1500 adjacent bowls containing b1, b2,..., b1500 beans respectively, all other bowls being empty. Find how many moves it takes before the game ends.
+The first two terms of the last sequence are $b_1 = 289$ and $b_2 = 145$. If we start with $b_1$ and $b_2$ beans in two adjacent bowls, 3419100 moves would be required to finish the game.
+
+Consider now 1500 adjacent bowls containing $b_1, b_2, \ldots, b_{1500}$ beans respectively, all other bowls being empty. Find how many moves it takes before the game ends.
 
 # --hints--
 
-`euler334()` should return 150320021261690850.
+`spillingTheBeans()` should return `150320021261690850`.
 
 ```js
-assert.strictEqual(euler334(), 150320021261690850);
+assert.strictEqual(spillingTheBeans(), 150320021261690850);
 ```
 
 # --seed--
@@ -33,12 +38,12 @@ assert.strictEqual(euler334(), 150320021261690850);
 ## --seed-contents--
 
 ```js
-function euler334() {
+function spillingTheBeans() {
 
   return true;
 }
 
-euler334();
+spillingTheBeans();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md
index 0605e0d053f..c1b35177c9b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4bd1000cf542c50ffce
 title: 'Problem 335: Gathering the beans'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301993
 dashedName: problem-335-gathering-the-beans
 ---
@@ -10,18 +10,20 @@ dashedName: problem-335-gathering-the-beans
 
 Whenever Peter feels bored, he places some bowls, containing one bean each, in a circle. After this, he takes all the beans out of a certain bowl and drops them one by one in the bowls going clockwise. He repeats this, starting from the bowl he dropped the last bean in, until the initial situation appears again. For example with 5 bowls he acts as follows:
 
+<img class="img-responsive center-block" alt="animation of moving beans in 5 bowls" src="https://cdn.freecodecamp.org/curriculum/project-euler/gathering-the-beans.gif" style="background-color: white; padding: 10px;" />
+
 So with 5 bowls it takes Peter 15 moves to return to the initial situation.
 
-Let M(x) represent the number of moves required to return to the initial situation, starting with x bowls. Thus, M(5) = 15. It can also be verified that M(100) = 10920.
+Let $M(x)$ represent the number of moves required to return to the initial situation, starting with $x$ bowls. Thus, $M(5) = 15$. It can also be verified that $M(100) = 10920$.
 
-Find M(2k+1). Give your answer modulo 79.
+Find $\displaystyle\sum_{k = 0}^{{10}^{18}} M(2^k + 1)$. Give your answer modulo $7^9$.
 
 # --hints--
 
-`euler335()` should return 5032316.
+`gatheringTheBeans()` should return `5032316`.
 
 ```js
-assert.strictEqual(euler335(), 5032316);
+assert.strictEqual(gatheringTheBeans(), 5032316);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler335(), 5032316);
 ## --seed-contents--
 
 ```js
-function euler335() {
+function gatheringTheBeans() {
 
   return true;
 }
 
-euler335();
+gatheringTheBeans();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md
index 3dbf18111c6..c5df56c3d7b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md
@@ -1,33 +1,41 @@
 ---
 id: 5900f4bd1000cf542c50ffcf
 title: 'Problem 336: Maximix Arrangements'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301994
 dashedName: problem-336-maximix-arrangements
 ---
 
 # --description--
 
-A train is used to transport four carriages in the order: ABCD. However, sometimes when the train arrives to collect the carriages they are not in the correct order.
+A train is used to transport four carriages in the order: $ABCD$. However, sometimes when the train arrives to collect the carriages they are not in the correct order.
 
-To rearrange the carriages they are all shunted on to a large rotating turntable. After the carriages are uncoupled at a specific point the train moves off the turntable pulling the carriages still attached with it. The remaining carriages are rotated 180 degrees. All of the carriages are then rejoined and this process is repeated as often as necessary in order to obtain the least number of uses of the turntable.
+To rearrange the carriages, they are all shunted onto a large rotating turntable. After the carriages are uncoupled at a specific point, the train moves off the turntable pulling the carriages still attached with it. The remaining carriages are rotated 180°. All of the carriages are then rejoined and this process is repeated as often as necessary in order to obtain the least number of uses of the turntable.
 
-Some arrangements, such as ADCB, can be solved easily: the carriages are separated between A and D, and after DCB are rotated the correct order has been achieved.
+Some arrangements, such as $ADCB$, can be solved easily: the carriages are separated between $A$ and $D$, and after $DCB$ are rotated the correct order has been achieved.
 
-However, Simple Simon, the train driver, is not known for his efficiency, so he always solves the problem by initially getting carriage A in the correct place, then carriage B, and so on.
+However, Simple Simon, the train driver, is not known for his efficiency, so he always solves the problem by initially getting carriage $A$ in the correct place, then carriage $B$, and so on.
 
-Using four carriages, the worst possible arrangements for Simon, which we shall call maximix arrangements, are DACB and DBAC; each requiring him five rotations (although, using the most efficient approach, they could be solved using just three rotations). The process he uses for DACB is shown below.
+Using four carriages, the worst possible arrangements for Simon, which we shall call maximix arrangements, are $DACB$ and $DBAC$; each requiring him five rotations (although, using the most efficient approach, they could be solved using just three rotations). The process he uses for $DACB$ is shown below.
 
-It can be verified that there are 24 maximix arrangements for six carriages, of which the tenth lexicographic maximix arrangement is DFAECB.
+<img class="img-responsive center-block" alt="five rotations for maximix arrangement DACB" src="https://cdn.freecodecamp.org/curriculum/project-euler/maximix-arrangements.gif" style="background-color: white; padding: 10px;" />
 
-Find the 2011th lexicographic maximix arrangement for eleven carriages.
+It can be verified that there are 24 maximix arrangements for six carriages, of which the tenth lexicographic maximix arrangement is $DFAECB$.
+
+Find the ${2011}^{\text{th}}$ lexicographic maximix arrangement for eleven carriages.
 
 # --hints--
 
-`euler336()` should return CAGBIHEFJDK.
+`maximixArrangements()` should return a string.
 
 ```js
-assert.strictEqual(euler336(), CAGBIHEFJDK);
+assert(typeof maximixArrangements() === 'string');
+```
+
+`maximixArrangements()` should return the string `CAGBIHEFJDK`.
+
+```js
+assert.strictEqual(maximixArrangements(), 'CAGBIHEFJDK');
 ```
 
 # --seed--
@@ -35,12 +43,12 @@ assert.strictEqual(euler336(), CAGBIHEFJDK);
 ## --seed-contents--
 
 ```js
-function euler336() {
+function maximixArrangements() {
 
   return true;
 }
 
-euler336();
+maximixArrangements();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.md
index 677c918f053..ed090ed3f86 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.md
@@ -1,35 +1,35 @@
 ---
 id: 5900f4be1000cf542c50ffd0
 title: 'Problem 337: Totient Stairstep Sequences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301995
 dashedName: problem-337-totient-stairstep-sequences
 ---
 
 # --description--
 
-Let {a1, a2,..., an} be an integer sequence of length n such that:
+Let $\\{a_1, a_2, \ldots, a_n\\}$ be an integer sequence of length $n$ such that:
 
-a1 = 6
+- $a_1 = 6$
+- for all $1 ≤ i &lt; n$ : $φ(a_i) &lt; φ(a_{i + 1}) &lt; a_i &lt; a_{i + 1}$
 
-for all 1 ≤ i &lt; n : φ(ai) &lt; φ(ai+1) &lt; ai &lt; ai+11
+$φ$ denotes Euler's totient function.
 
-Let S(N) be the number of such sequences with an ≤ N.
+Let $S(N)$ be the number of such sequences with $a_n ≤ N$.
 
-For example, S(10) = 4: {6}, {6, 8}, {6, 8, 9} and {6, 10}.
+For example, $S(10) = 4$: {6}, {6, 8}, {6, 8, 9} and {6, 10}.
 
-We can verify that S(100) = 482073668 and S(10 000) mod 108 = 73808307.
+We can verify that $S(100) = 482\\,073\\,668$ and $S(10\\,000)\bmod {10}^8 = 73\\,808\\,307$.
 
-Find S(20 000 000) mod 108.
+Find $S(20\\,000\\,000)\bmod {10}^8$.
 
-1 φ denotes Euler's totient function.
 
 # --hints--
 
-`euler337()` should return 85068035.
+`totientStairstepSequences()` should return `85068035`.
 
 ```js
-assert.strictEqual(euler337(), 85068035);
+assert.strictEqual(totientStairstepSequences(), 85068035);
 ```
 
 # --seed--
@@ -37,12 +37,12 @@ assert.strictEqual(euler337(), 85068035);
 ## --seed-contents--
 
 ```js
-function euler337() {
+function totientStairstepSequences() {
 
   return true;
 }
 
-euler337();
+totientStairstepSequences();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md
index 514dc560b01..9a2143b65fd 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md
@@ -1,33 +1,35 @@
 ---
 id: 5900f4be1000cf542c50ffd1
 title: 'Problem 338: Cutting Rectangular Grid Paper'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301996
 dashedName: problem-338-cutting-rectangular-grid-paper
 ---
 
 # --description--
 
-A rectangular sheet of grid paper with integer dimensions w × h is given. Its grid spacing is 1.
+A rectangular sheet of grid paper with integer dimensions $w$ × $h$ is given. Its grid spacing is 1.
 
 When we cut the sheet along the grid lines into two pieces and rearrange those pieces without overlap, we can make new rectangles with different dimensions.
 
-For example, from a sheet with dimensions 9 × 4 , we can make rectangles with dimensions 18 × 2, 12 × 3 and 6 × 6 by cutting and rearranging as below:
+For example, from a sheet with dimensions 9 × 4, we can make rectangles with dimensions 18 × 2, 12 × 3 and 6 × 6 by cutting and rearranging as below:
 
-Similarly, from a sheet with dimensions 9 × 8 , we can make rectangles with dimensions 18 × 4 and 12 × 6 .
+<img class="img-responsive center-block" alt="sheet with 9 x 4 dimensions cut in three different ways to make rectangles with 18 x 2, 12 x 3 and 6 x 6 dimensions" src="https://cdn.freecodecamp.org/curriculum/project-euler/cutting-rectangular-grid-paper.gif" style="background-color: white; padding: 10px;" />
 
-For a pair w and h, let F(w,h) be the number of distinct rectangles that can be made from a sheet with dimensions w × h . For example, F(2,1) = 0, F(2,2) = 1, F(9,4) = 3 and F(9,8) = 2. Note that rectangles congruent to the initial one are not counted in F(w,h). Note also that rectangles with dimensions w × h and dimensions h × w are not considered distinct.
+Similarly, from a sheet with dimensions 9 × 8, we can make rectangles with dimensions 18 × 4 and 12 × 6.
 
-For an integer N, let G(N) be the sum of F(w,h) for all pairs w and h which satisfy 0 &lt; h ≤ w ≤ N. We can verify that G(10) = 55, G(103) = 971745 and G(105) = 9992617687.
+For a pair $w$ and $h$, let $F(w, h)$ be the number of distinct rectangles that can be made from a sheet with dimensions $w$ × $h$. For example, $F(2, 1) = 0$, $F(2, 2) = 1$, $F(9, 4) = 3$ and $F(9, 8) = 2$. Note that rectangles congruent to the initial one are not counted in $F(w, h)$. Note also that rectangles with dimensions $w$ × $h$ and dimensions $h$ × $w$ are not considered distinct.
 
-Find G(1012). Give your answer modulo 108.
+For an integer $N$, let $G(N)$ be the sum of $F(w, h)$ for all pairs $w$ and $h$ which satisfy $0 &lt; h ≤ w ≤ N$. We can verify that $G(10) = 55$, $G({10}^3) = 971\\,745$ and $G({10}^5) = 9\\,992\\,617\\,687$.
+
+Find $G({10}^{12})$. Give your answer modulo ${10}^8$.
 
 # --hints--
 
-`euler338()` should return 15614292.
+`cuttingRectangularGridPaper()` should return `15614292`.
 
 ```js
-assert.strictEqual(euler338(), 15614292);
+assert.strictEqual(cuttingRectangularGridPaper(), 15614292);
 ```
 
 # --seed--
@@ -35,12 +37,12 @@ assert.strictEqual(euler338(), 15614292);
 ## --seed-contents--
 
 ```js
-function euler338() {
+function cuttingRectangularGridPaper() {
 
   return true;
 }
 
-euler338();
+cuttingRectangularGridPaper();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.md
index 6844c7e65c9..7c1934c581b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.md
@@ -1,25 +1,27 @@
 ---
 id: 5900f4c01000cf542c50ffd2
 title: 'Problem 339: Peredur fab Efrawg'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301997
 dashedName: problem-339-peredur-fab-efrawg
 ---
 
 # --description--
 
-"And he came towards a valley, through which ran a river; and the borders of the valley were wooded, and on each side of the river were level meadows. And on one side of the river he saw a flock of white sheep, and on the other a flock of black sheep. And whenever one of the white sheep bleated, one of the black sheep would cross over and become white; and when one of the black sheep bleated, one of the white sheep would cross over and become black."en.wikisource.org
+"And he came towards a valley, through which ran a river; and the borders of the valley were wooded, and on each side of the river were level meadows. And on one side of the river he saw a flock of white sheep, and on the other a flock of black sheep. And whenever one of the white sheep bleated, one of the black sheep would cross over and become white; and when one of the black sheep bleated, one of the white sheep would cross over and become black." - Peredur the Son of Evrawc
 
-Initially each flock consists of n sheep. Each sheep (regardless of colour) is equally likely to be the next sheep to bleat. After a sheep has bleated and a sheep from the other flock has crossed over, Peredur may remove a number of white sheep in order to maximize the expected final number of black sheep. Let E(n) be the expected final number of black sheep if Peredur uses an optimal strategy.
+Initially, each flock consists of $n$ sheep. Each sheep (regardless of color) is equally likely to be the next sheep to bleat. After a sheep has bleated and a sheep from the other flock has crossed over, Peredur may remove a number of white sheep in order to maximize the expected final number of black sheep. Let $E(n)$ be the expected final number of black sheep if Peredur uses an optimal strategy.
 
-You are given that E(5) = 6.871346 rounded to 6 places behind the decimal point. Find E(10 000) and give your answer rounded to 6 places behind the decimal point.
+You are given that $E(5) = 6.871346$ rounded to 6 places behind the decimal point.
+
+Find $E(10\\,000)$ and give your answer rounded to 6 places behind the decimal point.
 
 # --hints--
 
-`euler339()` should return 19823.542204.
+`peredurFabEfrawg()` should return `19823.542204`.
 
 ```js
-assert.strictEqual(euler339(), 19823.542204);
+assert.strictEqual(peredurFabEfrawg(), 19823.542204);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler339(), 19823.542204);
 ## --seed-contents--
 
 ```js
-function euler339() {
+function peredurFabEfrawg() {
 
   return true;
 }
 
-euler339();
+peredurFabEfrawg();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md
index 080d068344e..7f7b3585805 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f38e1000cf542c50fea1
-title: 'Problem 34: Digit factorials'
-challengeType: 5
+title: '问题 34：数字阶乘'
+challengeType: 1
 forumTopicId: 301998
 dashedName: problem-34-digit-factorials
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-340-crazy-function.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-340-crazy-function.md
index 86b29f061e2..72da02c1095 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-340-crazy-function.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-340-crazy-function.md
@@ -1,31 +1,30 @@
 ---
 id: 5900f4c21000cf542c50ffd4
 title: 'Problem 340: Crazy Function'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301999
 dashedName: problem-340-crazy-function
 ---
 
 # --description--
 
-For fixed integers a, b, c, define the crazy function F(n) as follows:
+For fixed integers $a$, $b$, $c$, define the crazy function $F(n)$ as follows:
 
-F(n) = n - c for all n > b
+$$\begin{align}   & F(n) = n - c \\;\text{ for all } n > b \\\\
+  & F(n) = F(a + F(a + F(a + F(a + n)))) \\;\text{ for all } n ≤ b. \end{align}$$
 
-F(n) = F(a + F(a + F(a + F(a + n)))) for all n ≤ b.
+Also, define $S(a, b, c) = \displaystyle\sum_{n = 0}^b F(n)$.
 
-Also, define S(a, b, c) = .
+For example, if $a = 50$, $b = 2000$ and $c = 40$, then $F(0) = 3240$ and $F(2000) = 2040$. Also, $S(50, 2000, 40) = 5\\,204\\,240$.
 
-For example, if a = 50, b = 2000 and c = 40, then F(0) = 3240 and F(2000) = 2040. Also, S(50, 2000, 40) = 5204240.
-
-Find the last 9 digits of S(217, 721, 127).
+Find the last 9 digits of $S({21}^7, 7^{21}, {12}^7)$.
 
 # --hints--
 
-`euler340()` should return 291504964.
+`crazyFunction()` should return `291504964`.
 
 ```js
-assert.strictEqual(euler340(), 291504964);
+assert.strictEqual(crazyFunction(), 291504964);
 ```
 
 # --seed--
@@ -33,12 +32,12 @@ assert.strictEqual(euler340(), 291504964);
 ## --seed-contents--
 
 ```js
-function euler340() {
+function crazyFunction() {
 
   return true;
 }
 
-euler340();
+crazyFunction();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md
index 740ef0d7518..8de0284a4dc 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md
@@ -1,27 +1,30 @@
 ---
 id: 5900f4c11000cf542c50ffd3
-title: 'Problem 341: Golomb''s self-describing sequence'
-challengeType: 5
+title: '问题 341：Golomb 的自描述序列'
+challengeType: 1
 forumTopicId: 302000
 dashedName: problem-341-golombs-self-describing-sequence
 ---
 
 # --description--
 
-The Golomb's self-describing sequence {G(n)} is the only nondecreasing sequence of natural numbers such that n appears exactly G(n) times in the sequence. The values of G(n) for the first few n are
+The Golomb's self-describing sequence ($G(n)$) is the only nondecreasing sequence of natural numbers such that $n$ appears exactly $G(n)$ times in the sequence. The values of $G(n)$ for the first few $n$ are
 
-n123456789101112131415…G(n)122334445556666…
+$$\begin{array}{c}   n    & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 & 11 & 12 & 13 & 14 & 15 & \ldots \\\\
+  G(n) & 1 & 2 & 2 & 3 & 3 & 4 & 4 & 4 & 5 & 5  &  5 &  6 &  6 &  6 &  6 & \ldots \end{array}$$
 
-You are given that G(103) = 86, G(106) = 6137. You are also given that ΣG(n3) = 153506976 for 1 ≤ n &lt; 103.
+You are given that $G({10}^3) = 86$, $G({10}^6) = 6137$.
 
-Find ΣG(n3) for 1 ≤ n &lt; 106.
+You are also given that $\sum G(n^3) = 153\\,506\\,976$ for $1 ≤ n &lt; {10}^3$.
+
+Find $\sum G(n^3)$ for $1 ≤ n &lt; {10}^6$.
 
 # --hints--
 
-`euler341()` should return 56098610614277016.
+`golombsSequence()` should return `56098610614277016`.
 
 ```js
-assert.strictEqual(euler341(), 56098610614277016);
+assert.strictEqual(golombsSequence(), 56098610614277016);
 ```
 
 # --seed--
@@ -29,12 +32,12 @@ assert.strictEqual(euler341(), 56098610614277016);
 ## --seed-contents--
 
 ```js
-function euler341() {
+function golombsSequence() {
 
   return true;
 }
 
-euler341();
+golombsSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.md
index 2253ce390fb..85990bc5b54 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4c31000cf542c50ffd5
 title: 'Problem 342: The totient of a square is a cube'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302001
 dashedName: problem-342-the-totient-of-a-square-is-a-cube
 ---
@@ -10,20 +10,19 @@ dashedName: problem-342-the-totient-of-a-square-is-a-cube
 
 Consider the number 50.
 
-502 = 2500 = 22 × 54, so φ(2500) = 2 × 4 × 53 = 8 × 53 = 23 × 53. 1
+${50}^2 = 2500 = 2^2 × 5^4$, so $φ(2500) = 2 × 4 × 5^3 = 8 × 5^3 = 2^3 × 5^3$. $φ$ denotes Euler's totient function.
 
-So 2500 is a square and φ(2500) is a cube.
+So 2500 is a square and $φ(2500)$ is a cube.
 
-Find the sum of all numbers n, 1 &lt; n &lt; 1010 such that φ(n2) is a cube.
+Find the sum of all numbers $n$, $1 &lt; n &lt; {10}^{10}$ such that $φ(n^2)$ is a cube.
 
-1 φ denotes Euler's totient function.
 
 # --hints--
 
-`euler342()` should return 5943040885644.
+`totientOfSquare()` should return `5943040885644`.
 
 ```js
-assert.strictEqual(euler342(), 5943040885644);
+assert.strictEqual(totientOfSquare(), 5943040885644);
 ```
 
 # --seed--
@@ -31,12 +30,12 @@ assert.strictEqual(euler342(), 5943040885644);
 ## --seed-contents--
 
 ```js
-function euler342() {
+function totientOfSquare() {
 
   return true;
 }
 
-euler342();
+totientOfSquare();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-343-fractional-sequences.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-343-fractional-sequences.md
index 3102009e8c0..f284af9e94b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-343-fractional-sequences.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-343-fractional-sequences.md
@@ -1,39 +1,38 @@
 ---
 id: 5900f4c41000cf542c50ffd6
 title: 'Problem 343: Fractional Sequences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302002
 dashedName: problem-343-fractional-sequences
 ---
 
 # --description--
 
-For any positive integer k, a finite sequence ai of fractions xi/yi is defined by:
+For any positive integer $k$, a finite sequence $a_i$ of fractions $\frac{x_i}{y_i}$ is defined by:
 
-a1 = 1/k and
+- $a_1 = \displaystyle\frac{1}{k}$ and
+- $a_i = \displaystyle\frac{(x_{i - 1} + 1)}{(y_{i - 1} - 1)}$ reduced to lowest terms for $i > 1$.
 
-ai = (xi-1+1)/(yi-1-1) reduced to lowest terms for i>1.
+When $a_i$ reaches some integer $n$, the sequence stops. (That is, when $y_i = 1$.)
 
-When ai reaches some integer n, the sequence stops. (That is, when yi=1.)
+Define $f(k) = n$.
 
-Define f(k) = n.
+For example, for $k = 20$:
 
-For example, for k = 20:
+$$\frac{1}{20} → \frac{2}{19} → \frac{3}{18} = \frac{1}{6} → \frac{2}{5} → \frac{3}{4} → \frac{4}{3} → \frac{5}{2} → \frac{6}{1} = 6$$
 
-1/20 → 2/19 → 3/18 = 1/6 → 2/5 → 3/4 → 4/3 → 5/2 → 6/1 = 6
+So $f(20) = 6$.
 
-So f(20) = 6.
+Also $f(1) = 1$, $f(2) = 2$, $f(3) = 1$ and $\sum f(k^3) = 118\\,937$ for $1 ≤ k ≤ 100$.
 
-Also f(1) = 1, f(2) = 2, f(3) = 1 and Σf(k3) = 118937 for 1 ≤ k ≤ 100.
-
-Find Σf(k3) for 1 ≤ k ≤ 2×106.
+Find $\sum f(k^3)$ for $1 ≤ k ≤ 2 × {10}^6$.
 
 # --hints--
 
-`euler343()` should return 269533451410884200.
+`fractionalSequences()` should return `269533451410884200`.
 
 ```js
-assert.strictEqual(euler343(), 269533451410884200);
+assert.strictEqual(fractionalSequences(), 269533451410884200);
 ```
 
 # --seed--
@@ -41,12 +40,12 @@ assert.strictEqual(euler343(), 269533451410884200);
 ## --seed-contents--
 
 ```js
-function euler343() {
+function fractionalSequences() {
 
   return true;
 }
 
-euler343();
+fractionalSequences();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
index f4fb768b65b..0f9fcc5f2e6 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4c51000cf542c50ffd7
 title: 'Problem 344: Silver dollar game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302003
 dashedName: problem-344-silver-dollar-game
 ---
@@ -18,20 +18,22 @@ Alternatively, the player can choose to make the special move of pocketing the l
 
 The winner is the player who pockets the silver dollar.
 
+<img class="img-responsive center-block" alt="silver dollar game" src="https://cdn.freecodecamp.org/curriculum/project-euler/silver-dollar-game.gif" style="background-color: white; padding: 10px;" />
+
 A winning configuration is an arrangement of coins on the strip where the first player can force a win no matter what the second player does.
 
-Let W(n,c) be the number of winning configurations for a strip of n squares, c worthless coins and one silver dollar.
+Let $W(n, c)$ be the number of winning configurations for a strip of $n$ squares, $c$ worthless coins and one silver dollar.
 
-You are given that W(10,2) = 324 and W(100,10) = 1514704946113500.
+You are given that $W(10, 2) = 324$ and $W(100, 10) = 1\\,514\\,704\\,946\\,113\\,500$.
 
-Find W(1 000 000, 100) modulo the semiprime 1000 036 000 099 (= 1 000 003 · 1 000 033).
+Find $W(1\\,000\\,000, 100)$ modulo the semiprime $1000\\,036\\,000\\,099 (= 1\\,000\\,003 \times 1\\,000\\,033)$.
 
 # --hints--
 
-`euler344()` should return 65579304332.
+`silverDollarGame()` should return `65579304332`.
 
 ```js
-assert.strictEqual(euler344(), 65579304332);
+assert.strictEqual(silverDollarGame(), 65579304332);
 ```
 
 # --seed--
@@ -39,12 +41,12 @@ assert.strictEqual(euler344(), 65579304332);
 ## --seed-contents--
 
 ```js
-function euler344() {
+function silverDollarGame() {
 
   return true;
 }
 
-euler344();
+silverDollarGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md
index 9cb8157d07c..19aa26fd74f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md
@@ -1,27 +1,38 @@
 ---
 id: 5900f4c81000cf542c50ffda
 title: 'Problem 345: Matrix Sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302004
 dashedName: problem-345-matrix-sum
 ---
 
 # --description--
 
-We define the Matrix Sum of a matrix as the maximum sum of matrix elements with each element being the only one in his row and column. For example, the Matrix Sum of the matrix below equals 3315 ( = 863 + 383 + 343 + 959 + 767):
+We define the Matrix Sum of a matrix as the maximum sum of matrix elements with each element being the only one in his row and column.
 
-7 53 183 439 863 497 383 563 79 973 287 63 343 169 583 627 343 773 959 943767 473 103 699 303
+For example, the Matrix Sum of the matrix below equals $3315 ( = 863 + 383 + 343 + 959 + 767)$:
+
+$$\begin{array}{rrrrr}     7                &  53                & 183                & 439                & \color{lime}{863} \\\\
+  497                & \color{lime}{383} & 563                &  79                & 973 \\\\   287                &  63                & \color{lime}{343} & 169                & 583 \\\\
+  627                & 343                & 773                & \color{lime}{959} & 943 \\\\ \color{lime}{767} & 473                & 103                & 699                & 303 \end{array}$$
 
 Find the Matrix Sum of:
 
-7 53 183 439 863 497 383 563 79 973 287 63 343 169 583 627 343 773 959 943 767 473 103 699 303 957 703 583 639 913 447 283 463 29 23 487 463 993 119 883 327 493 423 159 743 217 623 3 399 853 407 103 983 89 463 290 516 212 462 350 960 376 682 962 300 780 486 502 912 800 250 346 172 812 350 870 456 192 162 593 473 915 45 989 873 823 965 425 329 803 973 965 905 919 133 673 665 235 509 613 673 815 165 992 326 322 148 972 962 286 255 941 541 265 323 925 281 601 95 973 445 721 11 525 473 65 511 164 138 672 18 428 154 448 848 414 456 310 312 798 104 566 520 302 248 694 976 430 392 198 184 829 373 181 631 101 969 613 840 740 778 458 284 760 390 821 461 843 513 17 901 711 993 293 157 274 94 192 156 574 34 124 4 878 450 476 712 914 838 669 875 299 823 329 699 815 559 813 459 522 788 168 586 966 232 308 833 251 631 107 813 883 451 509 615 77 281 613 459 205 380 274 302 35 805
+$$\\begin{array}{r}     7 &  53 & 183 & 439 & 863 & 497 & 383 & 563 &  79 & 973 & 287 &  63 & 343 & 169 & 583 \\\\
+  627 & 343 & 773 & 959 & 943 & 767 & 473 & 103 & 699 & 303 & 957 & 703 & 583 & 639 & 913 \\\\   447 & 283 & 463 &  29 &  23 & 487 & 463 & 993 & 119 & 883 & 327 & 493 & 423 & 159 & 743 \\\\
+  217 & 623 &   3 & 399 & 853 & 407 & 103 & 983 &  89 & 463 & 290 & 516 & 212 & 462 & 350 \\\\   960 & 376 & 682 & 962 & 300 & 780 & 486 & 502 & 912 & 800 & 250 & 346 & 172 & 812 & 350 \\\\
+  870 & 456 & 192 & 162 & 593 & 473 & 915 &  45 & 989 & 873 & 823 & 965 & 425 & 329 & 803 \\\\   973 & 965 & 905 & 919 & 133 & 673 & 665 & 235 & 509 & 613 & 673 & 815 & 165 & 992 & 326 \\\\
+  322 & 148 & 972 & 962 & 286 & 255 & 941 & 541 & 265 & 323 & 925 & 281 & 601 &  95 & 973 \\\\   445 & 721 &  11 & 525 & 473 &  65 & 511 & 164 & 138 & 672 &  18 & 428 & 154 & 448 & 848 \\\\
+  414 & 456 & 310 & 312 & 798 & 104 & 566 & 520 & 302 & 248 & 694 & 976 & 430 & 392 & 198 \\\\   184 & 829 & 373 & 181 & 631 & 101 & 969 & 613 & 840 & 740 & 778 & 458 & 284 & 760 & 390 \\\\
+  821 & 461 & 843 & 513 &  17 & 901 & 711 & 993 & 293 & 157 & 274 &  94 & 192 & 156 & 574 \\\\    34 & 124 &   4 & 878 & 450 & 476 & 712 & 914 & 838 & 669 & 875 & 299 & 823 & 329 & 699 \\\\
+  815 & 559 & 813 & 459 & 522 & 788 & 168 & 586 & 966 & 232 & 308 & 833 & 251 & 631 & 107 \\\\ 813 & 883 & 451 & 509 & 615 &  77 & 281 & 613 & 459 & 205 & 380 & 274 & 302 &  35 & 805 \end{array}$$
 
 # --hints--
 
-`euler345()` should return 13938.
+`matrixSum()` should return `13938`.
 
 ```js
-assert.strictEqual(euler345(), 13938);
+assert.strictEqual(matrixSum(), 13938);
 ```
 
 # --seed--
@@ -29,12 +40,12 @@ assert.strictEqual(euler345(), 13938);
 ## --seed-contents--
 
 ```js
-function euler345() {
+function matrixSum() {
 
   return true;
 }
 
-euler345();
+matrixSum();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md
index 49a1f6b2c25..98b7cc48b2f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4c71000cf542c50ffd8
 title: 'Problem 346: Strong Repunits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302005
 dashedName: problem-346-strong-repunits
 ---
 
 # --description--
 
-The number 7 is special, because 7 is 111 written in base 2, and 11 written in base 6 (i.e. 710 = 116 = 1112). In other words, 7 is a repunit in at least two bases b > 1.
+The number 7 is special, because 7 is 111 written in base 2, and 11 written in base 6 (i.e. $7_{10} = {11}_6 = {111}_2$). In other words, 7 is a repunit in at least two bases $b > 1$.
 
-We shall call a positive integer with this property a strong repunit. It can be verified that there are 8 strong repunits below 50: {1,7,13,15,21,31,40,43}. Furthermore, the sum of all strong repunits below 1000 equals 15864.
+We shall call a positive integer with this property a strong repunit. It can be verified that there are 8 strong repunits below 50: {1, 7, 13, 15, 21, 31, 40, 43}. Furthermore, the sum of all strong repunits below 1000 equals 15864.
 
-Find the sum of all strong repunits below 1012.
+Find the sum of all strong repunits below ${10}^{12}$.
 
 # --hints--
 
-`euler346()` should return 336108797689259260.
+`strongRepunits()` should return `336108797689259260`.
 
 ```js
-assert.strictEqual(euler346(), 336108797689259260);
+assert.strictEqual(strongRepunits(), 336108797689259260);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler346(), 336108797689259260);
 ## --seed-contents--
 
 ```js
-function euler346() {
+function strongRepunits() {
 
   return true;
 }
 
-euler346();
+strongRepunits();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.md
index 70845508fa3..15174e82655 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.md
@@ -1,31 +1,31 @@
 ---
 id: 5900f4c81000cf542c50ffd9
 title: 'Problem 347: Largest integer divisible by two primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302006
 dashedName: problem-347-largest-integer-divisible-by-two-primes
 ---
 
 # --description--
 
-The largest integer ≤ 100 that is only divisible by both the primes 2 and 3 is 96, as 96=32\*3=25\*3.
+The largest integer $≤ 100$ that is only divisible by both the primes 2 and 3 is 96, as $96 = 32 \times 3 = 2^5 \times 3$.
 
-For two distinct primes p and q let M(p,q,N) be the largest positive integer ≤N only divisible
+For two distinct primes $p$ and $q$ let $M(p, q, N)$ be the largest positive integer $≤ N$ only divisible by both $p$ and $q$ and $M(p, q, N)=0$ if such a positive integer does not exist.
 
-by both p and q and M(p,q,N)=0 if such a positive integer does not exist.
+E.g. $M(2, 3, 100) = 96$.
 
-E.g. M(2,3,100)=96. M(3,5,100)=75 and not 90 because 90 is divisible by 2 ,3 and 5. Also M(2,73,100)=0 because there does not exist a positive integer ≤ 100 that is divisible by both 2 and 73.
+$M(3, 5, 100) = 75$ and not 90 because 90 is divisible by 2, 3 and 5. Also $M(2, 73, 100) = 0$ because there does not exist a positive integer $≤ 100$ that is divisible by both 2 and 73.
 
-Let S(N) be the sum of all distinct M(p,q,N). S(100)=2262.
+Let $S(N)$ be the sum of all distinct $M(p, q, N)$. $S(100)=2262$.
 
-Find S(10 000 000).
+Find $S(10\\,000\\,000)$.
 
 # --hints--
 
-`euler347()` should return 11109800204052.
+`integerDivisibleByTwoPrimes()` should return `11109800204052`.
 
 ```js
-assert.strictEqual(euler347(), 11109800204052);
+assert.strictEqual(integerDivisibleByTwoPrimes(), 11109800204052);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler347(), 11109800204052);
 ## --seed-contents--
 
 ```js
-function euler347() {
+function integerDivisibleByTwoPrimes() {
 
   return true;
 }
 
-euler347();
+integerDivisibleByTwoPrimes();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md
index 2fe6e2bc137..8e69b16ca7a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4c81000cf542c50ffdb
 title: 'Problem 348: Sum of a square and a cube'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302007
 dashedName: problem-348-sum-of-a-square-and-a-cube
 ---
@@ -10,16 +10,22 @@ dashedName: problem-348-sum-of-a-square-and-a-cube
 
 Many numbers can be expressed as the sum of a square and a cube. Some of them in more than one way.
 
-Consider the palindromic numbers that can be expressed as the sum of a square and a cube, both greater than 1, in exactly 4 different ways. For example, 5229225 is a palindromic number and it can be expressed in exactly 4 different ways: 22852 + 203 22232 + 663 18102 + 1253 11972 + 1563
+Consider the palindromic numbers that can be expressed as the sum of a square and a cube, both greater than 1, in exactly 4 different ways.
+
+For example, 5229225 is a palindromic number and it can be expressed in exactly 4 different ways:
+
+$$\begin{align}   & {2285}^2 + {20}^3 \\\\
+  & {2223}^2 + {66}^3 \\\\   & {1810}^2 + {125}^3 \\\\
+  & {1197}^2 + {156}^3 \end{align}$$
 
 Find the sum of the five smallest such palindromic numbers.
 
 # --hints--
 
-`euler348()` should return 1004195061.
+`sumOfSquareAndCube()` should return `1004195061`.
 
 ```js
-assert.strictEqual(euler348(), 1004195061);
+assert.strictEqual(sumOfSquareAndCube(), 1004195061);
 ```
 
 # --seed--
@@ -27,12 +33,12 @@ assert.strictEqual(euler348(), 1004195061);
 ## --seed-contents--
 
 ```js
-function euler348() {
+function sumOfSquareAndCube() {
 
   return true;
 }
 
-euler348();
+sumOfSquareAndCube();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-349-langtons-ant.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-349-langtons-ant.md
index 239ba5a6a18..71fe17860a2 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-349-langtons-ant.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-349-langtons-ant.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4ca1000cf542c50ffdc
 title: 'Problem 349: Langton''s ant'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302008
 dashedName: problem-349-langtons-ant
 ---
@@ -12,18 +12,17 @@ An ant moves on a regular grid of squares that are coloured either black or whit
 
 The ant is always oriented in one of the cardinal directions (left, right, up or down) and moves from square to adjacent square according to the following rules:
 
-\- if it is on a black square, it flips the color of the square to white, rotates 90 degrees counterclockwise and moves forward one square.
+- if it is on a black square, it flips the color of the square to white, rotates 90° counterclockwise and moves forward one square.
+- if it is on a white square, it flips the color of the square to black, rotates 90° clockwise and moves forward one square.
 
-\- if it is on a white square, it flips the color of the square to black, rotates 90 degrees clockwise and moves forward one square.
-
-Starting with a grid that is entirely white, how many squares are black after 10<sup>18</sup> moves of the ant?
+Starting with a grid that is entirely white, how many squares are black after ${10}^{18}$ moves of the ant?
 
 # --hints--
 
-`euler349()` should return 115384615384614940.
+`langtonsAnt()` should return `115384615384614940`.
 
 ```js
-assert.strictEqual(euler349(), 115384615384614940);
+assert.strictEqual(langtonsAnt(), 115384615384614940);
 ```
 
 # --seed--
@@ -31,12 +30,12 @@ assert.strictEqual(euler349(), 115384615384614940);
 ## --seed-contents--
 
 ```js
-function euler349() {
+function langtonsAnt() {
 
   return true;
 }
 
-euler349();
+langtonsAnt();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-35-circular-primes.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-35-circular-primes.md
index d3d74989d65..e02ad55e55a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-35-circular-primes.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-35-circular-primes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f38f1000cf542c50fea2
 title: 'Problem 35: Circular primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302009
 dashedName: problem-35-circular-primes
 ---
@@ -14,7 +14,7 @@ There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73
 
 How many circular primes are there below `n`, whereas 100 ≤ `n` ≤ 1000000?
 
-**Note:**
+**注意:**
 
 Circular primes individual rotation can exceed `n`.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md
index ebc52998b58..353170dbe13 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f4cb1000cf542c50ffdd
 title: 'Problem 350: Constraining the least greatest and the greatest least'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302010
 dashedName: problem-350-constraining-the-least-greatest-and-the-greatest-least
 ---
 
 # --description--
 
-A list of size n is a sequence of n natural numbers. Examples are (2,4,6), (2,6,4), (10,6,15,6), and (11).
+A list of size $n$ is a sequence of $n$ natural numbers. Examples are (2, 4, 6), (2, 6, 4), (10, 6, 15, 6), and (11).
 
-The greatest common divisor, or gcd, of a list is the largest natural number that divides all entries of the list. Examples: gcd(2,6,4) = 2, gcd(10,6,15,6) = 1 and gcd(11) = 11.
+The greatest common divisor, or $gcd$, of a list is the largest natural number that divides all entries of the list. Examples: $gcd(2, 6, 4) = 2$, $gcd(10, 6, 15, 6) = 1$ and $gcd(11) = 11$.
 
-The least common multiple, or lcm, of a list is the smallest natural number divisible by each entry of the list. Examples: lcm(2,6,4) = 12, lcm(10,6,15,6) = 30 and lcm(11) = 11.
+The least common multiple, or $lcm$, of a list is the smallest natural number divisible by each entry of the list. Examples: $lcm(2, 6, 4) = 12$, $lcm(10, 6, 15, 6) = 30$ and $lcm(11) = 11$.
 
-Let f(G, L, N) be the number of lists of size N with gcd ≥ G and lcm ≤ L. For example:
+Let $f(G, L, N)$ be the number of lists of size $N$ with $gcd ≥ G$ and $lcm ≤ L$. 例如：
 
-f(10, 100, 1) = 91. f(10, 100, 2) = 327. f(10, 100, 3) = 1135. f(10, 100, 1000) mod 1014 = 3286053.
+$$\begin{align}   & f(10, 100, 1) = 91 \\\\
+  & f(10, 100, 2) = 327 \\\\   & f(10, 100, 3) = 1135 \\\\
+  & f(10, 100, 1000)\bmod {101}^4 = 3\\,286\\,053 \end{align}$$
 
-Find f(106, 1012, 1018) mod 1014.
+Find $f({10}^6, {10}^{12}, {10}^{18})\bmod {101}^4$.
 
 # --hints--
 
-`euler350()` should return 84664213.
+`leastGreatestAndGreatestLeast()` should return `84664213`.
 
 ```js
-assert.strictEqual(euler350(), 84664213);
+assert.strictEqual(leastGreatestAndGreatestLeast(), 84664213);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler350(), 84664213);
 ## --seed-contents--
 
 ```js
-function euler350() {
+function leastGreatestAndGreatestLeast() {
 
   return true;
 }
 
-euler350();
+leastGreatestAndGreatestLeast();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md
index 33f0089171f..fa6811e9185 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md
@@ -1,29 +1,31 @@
 ---
 id: 5900f4cb1000cf542c50ffde
 title: 'Problem 351: Hexagonal orchards'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302011
 dashedName: problem-351-hexagonal-orchards
 ---
 
 # --description--
 
-A hexagonal orchard of order n is a triangular lattice made up of points within a regular hexagon with side n. The following is an example of a hexagonal orchard of order 5:
+A hexagonal orchard of order $n$ is a triangular lattice made up of points within a regular hexagon with side $n$. The following is an example of a hexagonal orchard of order 5:
+
+<img class="img-responsive center-block" alt="hexagonal orchard of order 5, with highlighted in green points, which are hidden from the center by a point closer to it" src="https://cdn.freecodecamp.org/curriculum/project-euler/hexagonal-orchards.png" style="background-color: white; padding: 10px;" />
 
 Highlighted in green are the points which are hidden from the center by a point closer to it. It can be seen that for a hexagonal orchard of order 5, 30 points are hidden from the center.
 
-Let H(n) be the number of points hidden from the center in a hexagonal orchard of order n.
+Let $H(n)$ be the number of points hidden from the center in a hexagonal orchard of order $n$.
 
-H(5) = 30. H(10) = 138. H(1 000) = 1177848.
+$H(5) = 30$. $H(10) = 138$. $H(1\\,000)$ = $1\\,177\\,848$.
 
-Find H(100 000 000).
+Find $H(100\\,000\\,000)$.
 
 # --hints--
 
-`euler351()` should return 11762187201804552.
+`hexagonalOrchards()` should return `11762187201804552`.
 
 ```js
-assert.strictEqual(euler351(), 11762187201804552);
+assert.strictEqual(hexagonalOrchards(), 11762187201804552);
 ```
 
 # --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler351(), 11762187201804552);
 ## --seed-contents--
 
 ```js
-function euler351() {
+function hexagonalOrchards() {
 
   return true;
 }
 
-euler351();
+hexagonalOrchards();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-352-blood-tests.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-352-blood-tests.md
index 76af2f075c8..b0de4ec7213 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-352-blood-tests.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-352-blood-tests.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4cd1000cf542c50ffdf
 title: 'Problem 352: Blood tests'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302012
 dashedName: problem-352-blood-tests
 ---
@@ -12,28 +12,42 @@ Each one of the 25 sheep in a flock must be tested for a rare virus, known to af
 
 An accurate and extremely sensitive PCR test exists for blood samples, producing a clear positive / negative result, but it is very time-consuming and expensive.
 
-Because of the high cost, the vet-in-charge suggests that instead of performing 25 separate tests, the following procedure can be used instead: The sheep are split into 5 groups of 5 sheep in each group. For each group, the 5 samples are mixed together and a single test is performed. Then, If the result is negative, all the sheep in that group are deemed to be virus-free. If the result is positive, 5 additional tests will be performed (a separate test for each animal) to determine the affected individual(s).
+Because of the high cost, the vet-in-charge suggests that instead of performing 25 separate tests, the following procedure can be used instead:
 
-Since the probability of infection for any specific animal is only 0.02, the first test (on the pooled samples) for each group will be: Negative (and no more tests needed) with probability 0.985 = 0.9039207968. Positive (5 additional tests needed) with probability 1 - 0.9039207968 = 0.0960792032.
+The sheep are split into 5 groups of 5 sheep in each group. For each group, the 5 samples are mixed together and a single test is performed. Then,
 
-Thus, the expected number of tests for each group is 1 + 0.0960792032 × 5 = 1.480396016. Consequently, all 5 groups can be screened using an average of only 1.480396016 × 5 = 7.40198008 tests, which represents a huge saving of more than 70% !
+- If the result is negative, all the sheep in that group are deemed to be virus-free.
+- If the result is positive, 5 additional tests will be performed (a separate test for each animal) to determine the affected individual(s).
 
-Although the scheme we have just described seems to be very efficient, it can still be improved considerably (always assuming that the test is sufficiently sensitive and that there are no adverse effects caused by mixing different samples). E.g.: We may start by running a test on a mixture of all the 25 samples. It can be verified that in about 60.35% of the cases this test will be negative, thus no more tests will be needed. Further testing will only be required for the remaining 39.65% of the cases. If we know that at least one animal in a group of 5 is infected and the first 4 individual tests come out negative, there is no need to run a test on the fifth animal (we know that it must be infected). We can try a different number of groups / different number of animals in each group, adjusting those numbers at each level so that the total expected number of tests will be minimised.
+Since the probability of infection for any specific animal is only 0.02, the first test (on the pooled samples) for each group will be:
+
+- Negative (and no more tests needed) with probability ${0.98}^5 = 0.9039207968$.
+- Positive (5 additional tests needed) with probability $1 - 0.9039207968 = 0.0960792032$.
+
+Thus, the expected number of tests for each group is $1 + 0.0960792032 × 5 = 1.480396016$.
+
+Consequently, all 5 groups can be screened using an average of only $1.480396016 × 5 = \mathbf{7.40198008}$ tests, which represents a huge saving of more than 70%!
+
+Although the scheme we have just described seems to be very efficient, it can still be improved considerably (always assuming that the test is sufficiently sensitive and no adverse effects are caused by mixing different samples). E.g.:
+
+- We may start by running a test on a mixture of all the 25 samples. It can be verified that in about 60.35% of the cases this test will be negative, thus no more tests will be needed. Further testing will only be required for the remaining 39.65% of the cases.
+- If we know that at least one animal in a group of 5 is infected and the first 4 individual tests come out negative, there is no need to run a test on the fifth animal (we know that it must be infected).
+- We can try a different number of groups / different number of animals in each group, adjusting those numbers at each level so that the total expected number of tests will be minimised.
 
 To simplify the very wide range of possibilities, there is one restriction we place when devising the most cost-efficient testing scheme: whenever we start with a mixed sample, all the sheep contributing to that sample must be fully screened (i.e. a verdict of infected / virus-free must be reached for all of them) before we start examining any other animals.
 
-For the current example, it turns out that the most cost-efficient testing scheme (we'll call it the optimal strategy) requires an average of just 4.155452 tests!
+For the current example, it turns out that the most cost-efficient testing scheme (we'll call it the optimal strategy) requires an average of just <strong>4.155452</strong> tests!
 
-Using the optimal strategy, let T(s,p) represent the average number of tests needed to screen a flock of s sheep for a virus having probability p to be present in any individual. Thus, rounded to six decimal places, T(25, 0.02) = 4.155452 and T(25, 0.10) = 12.702124.
+Using the optimal strategy, let $T(s, p)$ represent the average number of tests needed to screen a flock of $s$ sheep for a virus having probability $p$ to be present in any individual. Thus, rounded to six decimal places, $T(25, 0.02) = 4.155452$ and $T(25, 0.10) = 12.702124$.
 
-Find ΣT(10000, p) for p=0.01, 0.02, 0.03, ... 0.50. Give your answer rounded to six decimal places.
+Find $\sum T(10\\,000, p)$ for $p = 0.01, 0.02, 0.03, \ldots 0.50$. Give your answer rounded to six decimal places.
 
 # --hints--
 
-`euler352()` should return 378563.260589.
+`bloodTests()` should return `378563.260589`.
 
 ```js
-assert.strictEqual(euler352(), 378563.260589);
+assert.strictEqual(bloodTests(), 378563.260589);
 ```
 
 # --seed--
@@ -41,12 +55,12 @@ assert.strictEqual(euler352(), 378563.260589);
 ## --seed-contents--
 
 ```js
-function euler352() {
+function bloodTests() {
 
   return true;
 }
 
-euler352();
+bloodTests();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-353-risky-moon.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-353-risky-moon.md
index 74faf24c26f..172b2bada04 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-353-risky-moon.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-353-risky-moon.md
@@ -1,35 +1,37 @@
 ---
 id: 5900f4cd1000cf542c50ffe0
-title: 'Problem 353: Risky moon'
-challengeType: 5
+title: '问题 353：危险的月亮'
+challengeType: 1
 forumTopicId: 302013
 dashedName: problem-353-risky-moon
 ---
 
 # --description--
 
-A moon could be described by the sphere C(r) with centre (0,0,0) and radius r.
+A moon could be described by the sphere $C(r)$ with centre (0, 0, 0) and radius $r$.
 
-There are stations on the moon at the points on the surface of C(r) with integer coordinates. The station at (0,0,r) is called North Pole station, the station at (0,0,-r) is called South Pole station.
+There are stations on the moon at the points on the surface of $C(r)$ with integer coordinates. The station at (0, 0, $r$) is called North Pole station, the station at (0, 0, $-r$) is called South Pole station.
 
-All stations are connected with each other via the shortest road on the great arc through the stations. A journey between two stations is risky. If d is the length of the road between two stations, (d/(π r))2 is a measure for the risk of the journey (let us call it the risk of the road). If the journey includes more than two stations, the risk of the journey is the sum of risks of the used roads.
+所有车站都通过车站的大弧上最短的道路相互连接。 两个站之间的旅程是有风险的。 If $d$ is the length of the road between two stations, $\{\left(\frac{d}{πr}\right)}^2$ is a measure for the risk of the journey (let us call it the risk of the road). 如果旅程包括两个以上的车站，则旅程的风险是使用过的道路的风险总和。
 
-A direct journey from the North Pole station to the South Pole station has the length πr and risk 1. The journey from the North Pole station to the South Pole station via (0,r,0) has the same length, but a smaller risk: (½πr/(πr))2+(½πr/(πr))2=0.5.
+A direct journey from the North Pole station to the South Pole station has the length $πr$ and risk 1. The journey from the North Pole station to the South Pole station via (0, $r$, 0) has the same length, but a smaller risk:
 
-The minimal risk of a journey from the North Pole station to the South Pole station on C(r) is M(r).
+$${\left(\frac{\frac{1}{2}πr}{πr}\right)}^2+{\left(\frac{\frac{1}{2}πr}{πr}\right)}^2 = 0.5$$
 
-You are given that M(7)=0.1784943998 rounded to 10 digits behind the decimal point.
+The minimal risk of a journey from the North Pole station to the South Pole station on $C(r)$ is $M(r)$.
 
-Find ∑M(2n-1) for 1≤n≤15.
+You are given that $M(7) = 0.178\\,494\\,399\\,8$ rounded to 10 digits behind the decimal point.
+
+Find $\displaystyle\sum_{n = 1}^{15} M(2^n - 1)$.
 
 Give your answer rounded to 10 digits behind the decimal point in the form a.bcdefghijk.
 
 # --hints--
 
-`euler353()` should return 1.2759860331.
+`riskyMoon()` should return `1.2759860331`.
 
 ```js
-assert.strictEqual(euler353(), 1.2759860331);
+assert.strictEqual(riskyMoon(), 1.2759860331);
 ```
 
 # --seed--
@@ -37,12 +39,12 @@ assert.strictEqual(euler353(), 1.2759860331);
 ## --seed-contents--
 
 ```js
-function euler353() {
+function riskyMoon() {
 
   return true;
 }
 
-euler353();
+riskyMoon();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md
index 346a1af4515..f7d023146ca 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4cf1000cf542c50ffe1
 title: 'Problem 354: Distances in a bee''s honeycomb'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302014
 dashedName: problem-354-distances-in-a-bees-honeycomb
 ---
@@ -10,16 +10,20 @@ dashedName: problem-354-distances-in-a-bees-honeycomb
 
 Consider a honey bee's honeycomb where each cell is a perfect regular hexagon with side length 1.
 
-One particular cell is occupied by the queen bee. For a positive real number L, let B(L) count the cells with distance L from the queen bee cell (all distances are measured from centre to centre); you may assume that the honeycomb is large enough to accommodate for any distance we wish to consider. For example, B(√3) = 6, B(√21) = 12 and B(111 111 111) = 54.
+<img class="img-responsive center-block" alt="honeycomb with hexagon sides of length 1" src="https://cdn.freecodecamp.org/curriculum/project-euler/distances-in-a-bees-honeycomb.png" style="background-color: white; padding: 10px;" />
 
-Find the number of L ≤ 5·1011 such that B(L) = 450.
+One particular cell is occupied by the queen bee. For a positive real number $L$, let $B(L)$ count the cells with distance $L$ from the queen bee cell (all distances are measured from centre to centre); you may assume that the honeycomb is large enough to accommodate for any distance we wish to consider.
+
+For example, $B(\sqrt{3}) = 6$, $B(\sqrt{21}) = 12$ and $B(111\\,111\\,111) = 54$.
+
+Find the number of $L ≤ 5 \times {10}^{11}$ such that $B(L) = 450$.
 
 # --hints--
 
-`euler354()` should return 58065134.
+`distancesInHoneycomb()` should return `58065134`.
 
 ```js
-assert.strictEqual(euler354(), 58065134);
+assert.strictEqual(distancesInHoneycomb(), 58065134);
 ```
 
 # --seed--
@@ -27,12 +31,12 @@ assert.strictEqual(euler354(), 58065134);
 ## --seed-contents--
 
 ```js
-function euler354() {
+function distancesInHoneycomb() {
 
   return true;
 }
 
-euler354();
+distancesInHoneycomb();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.md
index a166a1057ac..a7e2179ec87 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4d01000cf542c50ffe2
 title: 'Problem 355: Maximal coprime subset'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302015
 dashedName: problem-355-maximal-coprime-subset
 ---
 
 # --description--
 
-Define Co(n) to be the maximal possible sum of a set of mutually co-prime elements from {1, 2, ..., n}. For example Co(10) is 30 and hits that maximum on the subset {1, 5, 7, 8, 9}.
+Define $Co(n)$ to be the maximal possible sum of a set of mutually co-prime elements from $\\{1, 2, \ldots, n\\}$. For example $Co(10)$ is 30 and hits that maximum on the subset $\\{1, 5, 7, 8, 9\\}$.
 
-You are given that Co(30) = 193 and Co(100) = 1356.
+You are given that $Co(30) = 193$ and $Co(100) = 1356$.
 
-Find Co(200000).
+Find $Co(200\\,000)$.
 
 # --hints--
 
-`euler355()` should return 1726545007.
+`maximalCoprimeSubset()` should return `1726545007`.
 
 ```js
-assert.strictEqual(euler355(), 1726545007);
+assert.strictEqual(maximalCoprimeSubset(), 1726545007);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler355(), 1726545007);
 ## --seed-contents--
 
 ```js
-function euler355() {
+function maximalCoprimeSubset() {
 
   return true;
 }
 
-euler355();
+maximalCoprimeSubset();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
index 9027dcecf96..9cd6d394657 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4d01000cf542c50ffe3
-title: 'Problem 356: Largest roots of cubic polynomials'
-challengeType: 5
+title: '问题 356：三次多项式的最大根数'
+challengeType: 1
 forumTopicId: 302016
 dashedName: problem-356-largest-roots-of-cubic-polynomials
 ---
 
 # --description--
 
-Let an be the largest real root of a polynomial g(x) = x3 - 2n·x2 + n.
+Let $a_n$ be the largest real root of a polynomial $g(x) = x^3 - 2^n \times x^2 + n$.
 
-For example, a2 = 3.86619826...
+For example, $a_2 = 3.86619826\ldots$
 
-Find the last eight digits of.
+Find the last eight digits of $\displaystyle\sum_{i = 1}^{30} \lfloor {a_i}^{987654321}\rfloor$.
 
-Note: represents the floor function.
+**Note:** $\lfloor a\rfloor$ represents the floor function.
 
 # --hints--
 
-`euler356()` should return 28010159.
+`rootsOfCubicPolynomials()` should return `28010159`.
 
 ```js
-assert.strictEqual(euler356(), 28010159);
+assert.strictEqual(rootsOfCubicPolynomials(), 28010159);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler356(), 28010159);
 ## --seed-contents--
 
 ```js
-function euler356() {
+function rootsOfCubicPolynomials() {
 
   return true;
 }
 
-euler356();
+rootsOfCubicPolynomials();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-357-prime-generating-integers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-357-prime-generating-integers.md
index 1bb3f094a21..003fc35bdd6 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-357-prime-generating-integers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-357-prime-generating-integers.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4d11000cf542c50ffe4
 title: 'Problem 357: Prime generating integers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302017
 dashedName: problem-357-prime-generating-integers
 ---
 
 # --description--
 
-Consider the divisors of 30: 1,2,3,5,6,10,15,30.
+Consider the divisors of 30: 1, 2, 3, 5, 6, 10, 15, 30.
 
-It can be seen that for every divisor d of 30, d+30/d is prime.
+It can be seen that for every divisor $d$ of 30, $d + \frac{30}{d}$ is prime.
 
-Find the sum of all positive integers n not exceeding 100 000 000such that for every divisor d of n, d+n/d is prime.
+Find the sum of all positive integers $n$ not exceeding $100\\,000\\,000$ such that for every divisor $d$ of $n$, $d + \frac{n}{d}$ is prime.
 
 # --hints--
 
-`euler357()` should return 1739023853137.
+`primeGeneratingIntegers()` should return `1739023853137`.
 
 ```js
-assert.strictEqual(euler357(), 1739023853137);
+assert.strictEqual(primeGeneratingIntegers(), 1739023853137);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler357(), 1739023853137);
 ## --seed-contents--
 
 ```js
-function euler357() {
+function primeGeneratingIntegers() {
 
   return true;
 }
 
-euler357();
+primeGeneratingIntegers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md
index fb08a667a8b..9a7f94d3bff 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md
@@ -1,31 +1,40 @@
 ---
 id: 5900f4d21000cf542c50ffe5
 title: 'Problem 358: Cyclic numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302018
 dashedName: problem-358-cyclic-numbers
 ---
 
 # --description--
 
-A cyclic number with n digits has a very interesting property:
+A cyclic number with $n$ digits has a very interesting property:
 
-When it is multiplied by 1, 2, 3, 4, ... n, all the products have exactly the same digits, in the same order, but rotated in a circular fashion!
+When it is multiplied by 1, 2, 3, 4, ... $n$, all the products have exactly the same digits, in the same order, but rotated in a circular fashion!
 
-The smallest cyclic number is the 6-digit number 142857 : 142857 × 1 = 142857 142857 × 2 = 285714 142857 × 3 = 428571 142857 × 4 = 571428 142857 × 5 = 714285 142857 × 6 = 857142
+The smallest cyclic number is the 6-digit number 142857:
 
-The next cyclic number is 0588235294117647 with 16 digits : 0588235294117647 × 1 = 0588235294117647 0588235294117647 × 2 = 1176470588235294 0588235294117647 × 3 = 1764705882352941 ... 0588235294117647 × 16 = 9411764705882352
+$$\begin{align}   & 142857 × 1 = 142857 \\\\
+  & 142857 × 2 = 285714 \\\\   & 142857 × 3 = 428571 \\\\
+  & 142857 × 4 = 571428 \\\\   & 142857 × 5 = 714285 \\\\
+  & 142857 × 6 = 857142 \end{align}$$
+
+The next cyclic number is 0588235294117647 with 16 digits:
+
+$$\begin{align}   & 0588235294117647 × 1 = 0588235294117647 \\\\
+  & 0588235294117647 × 2 = 1176470588235294 \\\\   & 0588235294117647 × 3 = 1764705882352941 \\\\
+  & \ldots \\\\ & 0588235294117647 × 16 = 9411764705882352 \end{align}$$
 
 Note that for cyclic numbers, leading zeros are important.
 
-There is only one cyclic number for which, the eleven leftmost digits are 00000000137 and the five rightmost digits are 56789 (i.e., it has the form 00000000137...56789 with an unknown number of digits in the middle). Find the sum of all its digits.
+There is only one cyclic number for which, the eleven leftmost digits are 00000000137 and the five rightmost digits are 56789 (i.e., it has the form $00000000137\ldots56789$ with an unknown number of digits in the middle). Find the sum of all its digits.
 
 # --hints--
 
-`euler358()` should return 3284144505.
+`cyclicNumbers()` should return `3284144505`.
 
 ```js
-assert.strictEqual(euler358(), 3284144505);
+assert.strictEqual(cyclicNumbers(), 3284144505);
 ```
 
 # --seed--
@@ -33,12 +42,12 @@ assert.strictEqual(euler358(), 3284144505);
 ## --seed-contents--
 
 ```js
-function euler358() {
+function cyclicNumbers() {
 
   return true;
 }
 
-euler358();
+cyclicNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md
index 971ae0f4012..0cfd6a75f09 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4d31000cf542c50ffe6
 title: 'Problem 359: Hilbert''s New Hotel'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302019
 dashedName: problem-359-hilberts-new-hotel
 ---
@@ -10,22 +10,36 @@ dashedName: problem-359-hilberts-new-hotel
 
 An infinite number of people (numbered 1, 2, 3, etc.) are lined up to get a room at Hilbert's newest infinite hotel. The hotel contains an infinite number of floors (numbered 1, 2, 3, etc.), and each floor contains an infinite number of rooms (numbered 1, 2, 3, etc.).
 
-Initially the hotel is empty. Hilbert declares a rule on how the nth person is assigned a room: person n gets the first vacant room in the lowest numbered floor satisfying either of the following: the floor is empty the floor is not empty, and if the latest person taking a room in that floor is person m, then m + n is a perfect square
+Initially the hotel is empty. Hilbert declares a rule on how the $n^{\text{th}}$ person is assigned a room: person $n$ gets the first vacant room in the lowest numbered floor satisfying either of the following:
 
-Person 1 gets room 1 in floor 1 since floor 1 is empty. Person 2 does not get room 2 in floor 1 since 1 + 2 = 3 is not a perfect square. Person 2 instead gets room 1 in floor 2 since floor 2 is empty. Person 3 gets room 2 in floor 1 since 1 + 3 = 4 is a perfect square.
+- the floor is empty
+- the floor is not empty, and if the latest person taking a room in that floor is person $m$, then $m + n$ is a perfect square
+
+Person 1 gets room 1 in floor 1 since floor 1 is empty.
+
+Person 2 does not get room 2 in floor 1 since 1 + 2 = 3 is not a perfect square.
+
+Person 2 instead gets room 1 in floor 2 since floor 2 is empty.
+
+Person 3 gets room 2 in floor 1 since 1 + 3 = 4 is a perfect square.
 
 Eventually, every person in the line gets a room in the hotel.
 
-Define P(f, r) to be n if person n occupies room r in floor f, and 0 if no person occupies the room. Here are a few examples: P(1, 1) = 1 P(1, 2) = 3 P(2, 1) = 2 P(10, 20) = 440 P(25, 75) = 4863 P(99, 100) = 19454
+Define $P(f, r)$ to be $n$ if person $n$ occupies room $r$ in floor $f$, and 0 if no person occupies the room. Here are a few examples:
 
-Find the sum of all P(f, r) for all positive f and r such that f × r = 71328803586048 and give the last 8 digits as your answer.
+$$\begin{align}   & P(1, 1) = 1 \\\\
+  & P(1, 2) = 3 \\\\   & P(2, 1) = 2 \\\\
+  & P(10, 20) = 440 \\\\   & P(25, 75) = 4863 \\\\
+  & P(99, 100) = 19454 \end{align}$$
+
+Find the sum of all $P(f, r)$ for all positive $f$ and $r$ such that $f × r = 71\\,328\\,803\\,586\\,048$ and give the last 8 digits as your answer.
 
 # --hints--
 
-`euler359()` should return 40632119.
+`hilbertsNewHotel()` should return `40632119`.
 
 ```js
-assert.strictEqual(euler359(), 40632119);
+assert.strictEqual(hilbertsNewHotel(), 40632119);
 ```
 
 # --seed--
@@ -33,12 +47,12 @@ assert.strictEqual(euler359(), 40632119);
 ## --seed-contents--
 
 ```js
-function euler359() {
+function hilbertsNewHotel() {
 
   return true;
 }
 
-euler359();
+hilbertsNewHotel();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-36-double-base-palindromes.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-36-double-base-palindromes.md
index 359211b5301..9793d760c20 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-36-double-base-palindromes.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-36-double-base-palindromes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3901000cf542c50fea3
 title: 'Problem 36: Double-base palindromes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302020
 dashedName: problem-36-double-base-palindromes
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-360-scary-sphere.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-360-scary-sphere.md
index f028a5d58be..932a0a9dc4e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-360-scary-sphere.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-360-scary-sphere.md
@@ -1,27 +1,31 @@
 ---
 id: 5900f4d41000cf542c50ffe7
 title: 'Problem 360: Scary Sphere'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302021
 dashedName: problem-360-scary-sphere
 ---
 
 # --description--
 
-Given two points (x1,y1,z1) and (x2,y2,z2) in three dimensional space, the Manhattan distance between those points is defined as |x1-x2|+|y1-y2|+|z1-z2|.
+Given two points ($x_1$, $y_1$, $z_1$) and ($x_2$, $y_2$, $z_2$) in three dimensional space, the Manhattan distance between those points is defined as $|x_1 - x_2| + |y_1 - y_2| + |z_1 - z_2|$.
 
-Let C(r) be a sphere with radius r and center in the origin O(0,0,0). Let I(r) be the set of all points with integer coordinates on the surface of C(r). Let S(r) be the sum of the Manhattan distances of all elements of I(r) to the origin O.
+Let $C(r)$ be a sphere with radius $r$ and center in the origin $O(0, 0, 0)$.
 
-E.g. S(45)=34518.
+Let $I(r)$ be the set of all points with integer coordinates on the surface of $C(r)$.
 
-Find S(1010).
+Let $S(r)$ be the sum of the Manhattan distances of all elements of $I(r)$ to the origin $O$.
+
+E.g. $S(45)=34518$.
+
+Find $S({10}^{10})$.
 
 # --hints--
 
-`euler360()` should return 878825614395267100.
+`scarySphere()` should return `878825614395267100`.
 
 ```js
-assert.strictEqual(euler360(), 878825614395267100);
+assert.strictEqual(scarySphere(), 878825614395267100);
 ```
 
 # --seed--
@@ -29,12 +33,12 @@ assert.strictEqual(euler360(), 878825614395267100);
 ## --seed-contents--
 
 ```js
-function euler360() {
+function scarySphere() {
 
   return true;
 }
 
-euler360();
+scarySphere();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md
index bc131597891..efae1fb220c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md
@@ -1,37 +1,38 @@
 ---
 id: 5900f4d51000cf542c50ffe8
 title: 'Problem 361: Subsequence of Thue-Morse sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302022
 dashedName: problem-361-subsequence-of-thue-morse-sequence
 ---
 
 # --description--
 
-The Thue-Morse sequence {Tn} is a binary sequence satisfying:
+The Thue-Morse sequence $\\{T_n\\}$ is a binary sequence satisfying:
 
-T0 = 0
+- $T_0 = 0$
+- $T_{2n} = T_n$
+- $T_{2n + 1} = 1 - T_n$
 
-T2n = Tn
+The first several terms of $\\{T_n\\}$ are given as follows: $01101001\color{red}{10010}1101001011001101001\ldots$.
 
-T2n+1 = 1 - Tn
+We define $\\{A_n\\}$ as the sorted sequence of integers such that the binary expression of each element appears as a subsequence in $\\{T_n\\}$. For example, the decimal number 18 is expressed as 10010 in binary. 10010 appears in $\\{T_n\\}$ ($T_8$ to $T_{12}$), so 18 is an element of $\\{A_n\\}$. The decimal number 14 is expressed as 1110 in binary. 1110 never appears in $\\{T_n\\}$, so 14 is not an element of $\\{A_n\\}$.
 
-The first several terms of {Tn} are given as follows: 01101001100101101001011001101001....
+The first several terms of $A_n$ are given as follows:
 
-We define {An} as the sorted sequence of integers such that the binary expression of each element appears as a subsequence in {Tn}. For example, the decimal number 18 is expressed as 10010 in binary. 10010 appears in {Tn} (T8 to T12), so 18 is an element of {An}. The decimal number 14 is expressed as 1110 in binary. 1110 never appears in {Tn}, so 14 is not an element of {An}.
+$$\begin{array}{cr}   n   & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 &  8 &  9 & 10 & 11 & 12 & \ldots \\\\
+  A_n & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 9 & 10 & 11 & 12 & 13 & 18 & \ldots \end{array}$$
 
-The first several terms of An are given as follows: n0123456789101112…An012345691011121318…
+We can also verify that $A_{100} = 3251$ and $A_{1000} = 80\\,852\\,364\\,498$.
 
-We can also verify that A100 = 3251 and A1000 = 80852364498.
-
-Find the last 9 digits of .
+Find the last 9 digits of $\displaystyle\sum_{k = 1}^{18} A_{{10}^k}$.
 
 # --hints--
 
-`euler361()` should return 178476944.
+`subsequenceOfThueMorseSequence()` should return `178476944`.
 
 ```js
-assert.strictEqual(euler361(), 178476944);
+assert.strictEqual(subsequenceOfThueMorseSequence(), 178476944);
 ```
 
 # --seed--
@@ -39,12 +40,12 @@ assert.strictEqual(euler361(), 178476944);
 ## --seed-contents--
 
 ```js
-function euler361() {
+function subsequenceOfThueMorseSequence() {
 
   return true;
 }
 
-euler361();
+subsequenceOfThueMorseSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-362-squarefree-factors.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-362-squarefree-factors.md
index 4d6bc3f4a97..19f6b0f9cdc 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-362-squarefree-factors.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-362-squarefree-factors.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4d61000cf542c50ffe9
 title: 'Problem 362: Squarefree factors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302023
 dashedName: problem-362-squarefree-factors
 ---
@@ -12,24 +12,24 @@ Consider the number 54.
 
 54 can be factored in 7 distinct ways into one or more factors larger than 1:
 
-54, 2×27, 3×18, 6×9, 3×3×6, 2×3×9 and 2×3×3×3.
+$$54, 2 × 27, 3 × 18, 6 × 9, 3 × 3 × 6, 2 × 3 × 9 \text{ and } 2 × 3 × 3 × 3$$
 
-If we require that the factors are all squarefree only two ways remain: 3×3×6 and 2×3×3×3.
+If we require that the factors are all squarefree only two ways remain: $3 × 3 × 6$ and $2 × 3 × 3 × 3$.
 
-Let's call Fsf(n) the number of ways n can be factored into one or more squarefree factors larger than 1, so Fsf(54)=2.
+Let's call $Fsf(n)$ the number of ways $n$ can be factored into one or more squarefree factors larger than 1, so $Fsf(54) = 2$.
 
-Let S(n) be ∑Fsf(k) for k=2 to n.
+Let $S(n)$ be $\sum Fsf(k)$ for $k = 2$ to $n$.
 
-S(100)=193.
+$S(100) = 193$.
 
-Find S(10 000 000 000).
+Find $S(10\\,000\\,000\\,000)$.
 
 # --hints--
 
-`euler362()` should return 457895958010.
+`squarefreeFactors()` should return `457895958010`.
 
 ```js
-assert.strictEqual(euler362(), 457895958010);
+assert.strictEqual(squarefreeFactors(), 457895958010);
 ```
 
 # --seed--
@@ -37,12 +37,12 @@ assert.strictEqual(euler362(), 457895958010);
 ## --seed-contents--
 
 ```js
-function euler362() {
+function squarefreeFactors() {
 
   return true;
 }
 
-euler362();
+squarefreeFactors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md
index 2fde41d1eb0..df13df6a0c5 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md
@@ -1,31 +1,39 @@
 ---
 id: 5900f4d91000cf542c50ffeb
 title: 'Problem 363: Bézier Curves'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302024
 dashedName: problem-363-bzier-curves
 ---
 
 # --description--
 
-A cubic Bézier curve is defined by four points: P0, P1, P2 and P3.
+A cubic Bézier curve is defined by four points: $P_0$, $P_1$, $P_2$ and $P_3$.
 
-The curve is constructed as follows: On the segments P0P1, P1P2 and P2P3 the points Q0,Q1 and Q2 are drawn such that P0Q0 / P0P1 = P1Q1 / P1P2 = P2Q2 / P2P3 = t (t in \[0,1]). On the segments Q0Q1 and Q1Q2 the points R0 and R1 are drawn such that Q0R0 / Q0Q1 = Q1R1 / Q1Q2 = t for the same value of t. On the segment R0R1 the point B is drawn such that R0B / R0R1 = t for the same value of t. The Bézier curve defined by the points P0, P1, P2, P3 is the locus of B as Q0 takes all possible positions on the segment P0P1. (Please note that for all points the value of t is the same.)
+The curve is constructed as follows:
 
-At this (external) web address you will find an applet that allows you to drag the points P0, P1, P2 and P3 to see what the Bézier curve (green curve) defined by those points looks like. You can also drag the point Q0 along the segment P0P1.
+<img class="img-responsive center-block" alt="construction of Bézier curve" src="https://cdn.freecodecamp.org/curriculum/project-euler/bzier-curves.png" style="background-color: white; padding: 10px;" />
 
-From the construction it is clear that the Bézier curve will be tangent to the segments P0P1 in P0 and P2P3 in P3.
+On the segments $P_0P_1$, $P_1P_2$ and $P_2P_3$ the points $Q_0$,$Q_1$ and $Q_2$ are drawn such that $\frac{P_0Q_0}{P_0P_1} = \frac{P_1Q_1}{P_1P_2} = \frac{P_2Q_2}{P_2P_3} = t$, with $t$ in [0,1].
 
-A cubic Bézier curve with P0=(1,0), P1=(1,v), P2=(v,1) and P3=(0,1) is used to approximate a quarter circle. The value v > 0 is chosen such that the area enclosed by the lines OP0, OP3 and the curve is equal to π/4 (the area of the quarter circle).
+On the segments $Q_0Q_1$ and $Q_1Q_2$ the points $R_0$ and $R_1$ are drawn such that $\frac{Q_0R_0}{Q_0Q_1} = \frac{Q_1R_1}{Q_1Q_2} = t$ for the same value of $t$.
 
-By how many percent does the length of the curve differ from the length of the quarter circle? That is, if L is the length of the curve, calculate 100 × L − π/2π/2Give your answer rounded to 10 digits behind the decimal point.
+On the segment $R_0R_1$ the point $B$ is drawn such that $\frac{R_0B}{R_0R_1} = t$ for the same value of $t$.
+
+The Bézier curve defined by the points $P_0$, $P_1$, $P_2$, $P_3$ is the locus of $B$ as $Q_0$ takes all possible positions on the segment $P_0P_1$. (Please note that for all points the value of $t$ is the same.)
+
+From the construction it is clear that the Bézier curve will be tangent to the segments $P_0P_1$ in $P_0$ and $P_2P_3$ in $P_3$.
+
+A cubic Bézier curve with $P_0 = (1, 0)$, $P_1 = (1, v)$, $P_2 = (v, 1)$ and $P_3 = (0, 1)$ is used to approximate a quarter circle. The value $v > 0$ is chosen such that the area enclosed by the lines $OP_0$, $OP_3$ and the curve is equal to $\frac{π}{4}$ (the area of the quarter circle).
+
+By how many percent does the length of the curve differ from the length of the quarter circle? That is, if $L$ is the length of the curve, calculate $100 × \displaystyle\frac{L − \frac{π}{2}}{\frac{π}{2}}$. Give your answer rounded to 10 digits behind the decimal point.
 
 # --hints--
 
-`euler363()` should return 0.0000372091.
+`bezierCurves()` should return `0.0000372091`.
 
 ```js
-assert.strictEqual(euler363(), 0.0000372091);
+assert.strictEqual(bezierCurves(), 0.0000372091);
 ```
 
 # --seed--
@@ -33,12 +41,12 @@ assert.strictEqual(euler363(), 0.0000372091);
 ## --seed-contents--
 
 ```js
-function euler363() {
+function bezierCurves() {
 
   return true;
 }
 
-euler363();
+bezierCurves();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md
index 84637798b87..83f8f7ec5d4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f4d91000cf542c50ffea
 title: 'Problem 364: Comfortable distance'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302025
 dashedName: problem-364-comfortable-distance
 ---
 
 # --description--
 
-There are N seats in a row. N people come after each other to fill the seats according to the following rules:
+There are $N$ seats in a row. $N$ people come after each other to fill the seats according to the following rules:
 
-If there is any seat whose adjacent seat(s) are not occupied take such a seat.
+1. If there is any seat whose adjacent seat(s) are not occupied take such a seat.
+2. If there is no such seat and there is any seat for which only one adjacent seat is occupied take such a seat.
+3. Otherwise take one of the remaining available seats.
 
-If there is no such seat and there is any seat for which only one adjacent seat is occupied take such a seat.
+Let $T(N)$ be the number of possibilities that $N$ seats are occupied by $N$ people with the given rules. The following figure shows $T(4) = 8$.
 
-Otherwise take one of the remaining available seats.
+<img class="img-responsive center-block" alt="eight ways for N seats to be occupied by N people" src="https://cdn.freecodecamp.org/curriculum/project-euler/comfortable-distance.gif" style="background-color: white; padding: 10px;" />
 
-Let T(N) be the number of possibilities that N seats are occupied by N people with the given rules. The following figure shows T(4)=8.
+We can verify that $T(10) = 61\\,632$ and $T(1\\,000)\bmod 100\\,000\\,007 = 47\\,255\\,094$.
 
-We can verify that T(10) = 61632 and T(1 000) mod 100 000 007 = 47255094. Find T(1 000 000) mod 100 000 007.
+Find $T(1\\,000\\,000)\bmod 100\\,000\\,007$.
 
 # --hints--
 
-`euler364()` should return 44855254.
+`comfortableDistance()` should return `44855254`.
 
 ```js
-assert.strictEqual(euler364(), 44855254);
+assert.strictEqual(comfortableDistance(), 44855254);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler364(), 44855254);
 ## --seed-contents--
 
 ```js
-function euler364() {
+function comfortableDistance() {
 
   return true;
 }
 
-euler364();
+comfortableDistance();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.md
index 1647ff46ea4..46dc7abf5d6 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4da1000cf542c50ffec
 title: 'Problem 365: A huge binomial coefficient'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302026
 dashedName: problem-365-a-huge-binomial-coefficient
 ---
 
 # --description--
 
-The binomial coefficient C(1018,109) is a number with more than 9 billion (9×109) digits.
+The binomial coefficient $\displaystyle\binom{{10}^{18}}{{10}^9}$ is a number with more than 9 billion ($9 × {10}^9$) digits.
 
-Let M(n,k,m) denote the binomial coefficient C(n,k) modulo m.
+Let $M(n, k, m)$ denote the binomial coefficient $\displaystyle\binom{n}{k}$ modulo $m$.
 
-Calculate ∑M(1018,109,p*q*r) for 1000&lt;p&lt;q&lt;r&lt;5000 and p,q,r prime.
+Calculate $\sum M({10}^{18}, {10}^9, p \times q \times r)$ for $1000 &lt; p &lt; q &lt; r &lt; 5000$ and $p$, $q$, $r$ prime.
 
 # --hints--
 
-`euler365()` should return 162619462356610300.
+`hugeBinomialCoefficient()` should return `162619462356610300`.
 
 ```js
-assert.strictEqual(euler365(), 162619462356610300);
+assert.strictEqual(hugeBinomialCoefficient(), 162619462356610300);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler365(), 162619462356610300);
 ## --seed-contents--
 
 ```js
-function euler365() {
+function hugeBinomialCoefficient() {
 
   return true;
 }
 
-euler365();
+hugeBinomialCoefficient();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-366-stone-game-iii.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-366-stone-game-iii.md
index b7f832ebf4b..e4c51cb8c50 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-366-stone-game-iii.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-366-stone-game-iii.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4da1000cf542c50ffed
 title: 'Problem 366: Stone Game III'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302027
 dashedName: problem-366-stone-game-iii
 ---
@@ -10,7 +10,7 @@ dashedName: problem-366-stone-game-iii
 
 Two players, Anton and Bernhard, are playing the following game.
 
-There is one pile of n stones.
+There is one pile of $n$ stones.
 
 The first player may remove any positive number of stones, but not the whole pile.
 
@@ -18,20 +18,34 @@ Thereafter, each player may remove at most twice the number of stones his oppone
 
 The player who removes the last stone wins.
 
-E.g. n=5 If the first player takes anything more than one stone the next player will be able to take all remaining stones. If the first player takes one stone, leaving four, his opponent will take also one stone, leaving three stones. The first player cannot take all three because he may take at most 2x1=2 stones. So let's say he takes also one stone, leaving 2. The second player can take the two remaining stones and wins. So 5 is a losing position for the first player. For some winning positions there is more than one possible move for the first player. E.g. when n=17 the first player can remove one or four stones.
+E.g. $n = 5$
 
-Let M(n) be the maximum number of stones the first player can take from a winning position at his first turn and M(n)=0 for any other position.
+If the first player takes anything more than one stone the next player will be able to take all remaining stones.
 
-∑M(n) for n≤100 is 728.
+If the first player takes one stone, leaving four, his opponent will take also one stone, leaving three stones.
 
-Find ∑M(n) for n≤1018. Give your answer modulo 108.
+The first player cannot take all three because he may take at most $2 \times 1 = 2$ stones. So let's say he also takes one stone, leaving 2.
+
+The second player can take the two remaining stones and wins.
+
+So 5 is a losing position for the first player.
+
+For some winning positions there is more than one possible move for the first player.
+
+E.g. when $n = 17$ the first player can remove one or four stones.
+
+Let $M(n)$ be the maximum number of stones the first player can take from a winning position at his first turn and $M(n) = 0$ for any other position.
+
+$\sum M(n)$ for $n ≤ 100$ is 728.
+
+Find $\sum M(n)$ for $n ≤ {10}^{18}$. Give your answer modulo ${10}^8$.
 
 # --hints--
 
-`euler366()` should return 88351299.
+`stoneGameThree()` should return `88351299`.
 
 ```js
-assert.strictEqual(euler366(), 88351299);
+assert.strictEqual(stoneGameThree(), 88351299);
 ```
 
 # --seed--
@@ -39,12 +53,12 @@ assert.strictEqual(euler366(), 88351299);
 ## --seed-contents--
 
 ```js
-function euler366() {
+function stoneGameThree() {
 
   return true;
 }
 
-euler366();
+stoneGameThree();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-367-bozo-sort.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-367-bozo-sort.md
index 979702592a9..01a24b3c665 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-367-bozo-sort.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-367-bozo-sort.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4db1000cf542c50ffee
 title: 'Problem 367: Bozo sort'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302028
 dashedName: problem-367-bozo-sort
 ---
@@ -10,18 +10,30 @@ dashedName: problem-367-bozo-sort
 
 Bozo sort, not to be confused with the slightly less efficient bogo sort, consists out of checking if the input sequence is sorted and if not swapping randomly two elements. This is repeated until eventually the sequence is sorted.
 
-If we consider all permutations of the first 4 natural numbers as input the expectation value of the number of swaps, averaged over all 4! input sequences is 24.75. The already sorted sequence takes 0 steps.
+If we consider all permutations of the first 4 natural numbers as input the expectation value of the number of swaps, averaged over all $4!$ input sequences is $24.75$.
 
-In this problem we consider the following variant on bozo sort. If the sequence is not in order we pick three elements at random and shuffle these three elements randomly. All 3!=6 permutations of those three elements are equally likely. The already sorted sequence will take 0 steps. If we consider all permutations of the first 4 natural numbers as input the expectation value of the number of shuffles, averaged over all 4! input sequences is 27.5. Consider as input sequences the permutations of the first 11 natural numbers. Averaged over all 11! input sequences, what is the expected number of shuffles this sorting algorithm will perform?
+The already sorted sequence takes 0 steps.
 
-Give your answer rounded to the nearest integer.
+In this problem we consider the following variant on bozo sort.
+
+If the sequence is not in order we pick three elements at random and shuffle these three elements randomly.
+
+All $3! = 6$ permutations of those three elements are equally likely.
+
+The already sorted sequence will take 0 steps.
+
+If we consider all permutations of the first 4 natural numbers as input the expectation value of the number of shuffles, averaged over all $4!$ input sequences is $27.5$.
+
+Consider as input sequences the permutations of the first 11 natural numbers.
+
+Averaged over all $11!$ input sequences, what is the expected number of shuffles this sorting algorithm will perform? Give your answer rounded to the nearest integer.
 
 # --hints--
 
-`euler367()` should return 48271207.
+`bozoSort()` should return `48271207`.
 
 ```js
-assert.strictEqual(euler367(), 48271207);
+assert.strictEqual(bozoSort(), 48271207);
 ```
 
 # --seed--
@@ -29,12 +41,12 @@ assert.strictEqual(euler367(), 48271207);
 ## --seed-contents--
 
 ```js
-function euler367() {
+function bozoSort() {
 
   return true;
 }
 
-euler367();
+bozoSort();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.md
index dc9cf2f919b..afc2e6dc9b8 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.md
@@ -1,18 +1,23 @@
 ---
 id: 5900f4dd1000cf542c50ffef
 title: 'Problem 368: A Kempner-like series'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302029
 dashedName: problem-368-a-kempner-like-series
 ---
 
 # --description--
 
-The harmonic series $1 + \\dfrac{1}{2} + \\dfrac{1}{3} + \\dfrac{1}{4} + ...$ is well known to be divergent.
+The harmonic series $1 + \dfrac{1}{2} + \dfrac{1}{3} + \dfrac{1}{4} + \ldots$ is well known to be divergent.
 
 If we however omit from this series every term where the denominator has a 9 in it, the series remarkably enough converges to approximately 22.9206766193. This modified harmonic series is called the Kempner series.
 
-Let us now consider another modified harmonic series by omitting from the harmonic series every term where the denominator has 3 or more equal consecutive digits. One can verify that out of the first 1200 terms of the harmonic series, only 20 terms will be omitted. These 20 omitted terms are: $$\\dfrac{1}{111}, \\dfrac{1}{222}, \\dfrac{1}{333}, \\dfrac{1}{444}, \\dfrac{1}{555}, \\dfrac{1}{666}, \\dfrac{1}{777}, \\dfrac{1}{888}, \\dfrac{1}{999}, \\dfrac{1}{1000}, \\dfrac{1}{1110}, \\\\ \\dfrac{1}{1111}, \\dfrac{1}{1112}, \\dfrac{1}{1113}, \\dfrac{1}{1114}, \\dfrac{1}{1115}, \\dfrac{1}{1116}, \\dfrac{1}{1117}, \\dfrac{1}{1118}, \\dfrac{1}{1119}$$
+Let us now consider another modified harmonic series by omitting from the harmonic series every term where the denominator has 3 or more equal consecutive digits. One can verify that out of the first 1200 terms of the harmonic series, only 20 terms will be omitted.
+
+These 20 omitted terms are:
+
+$$\dfrac{1}{111}, \dfrac{1}{222}, \dfrac{1}{333}, \dfrac{1}{444}, \dfrac{1}{555}, \dfrac{1}{666}, \dfrac{1}{777}, \dfrac{1}{888}, \dfrac{1}{999}, \dfrac{1}{1000}, \dfrac{1}{1110}, \\\\
+\dfrac{1}{1111}, \dfrac{1}{1112}, \dfrac{1}{1113}, \dfrac{1}{1114}, \dfrac{1}{1115}, \dfrac{1}{1116}, \dfrac{1}{1117}, \dfrac{1}{1118}, \dfrac{1}{1119}$$
 
 This series converges as well.
 
@@ -20,10 +25,10 @@ Find the value the series converges to. Give your answer rounded to 10 digits be
 
 # --hints--
 
-`euler368()` should return 253.6135092068.
+`kempnerLikeSeries()` should return `253.6135092068`.
 
 ```js
-assert.strictEqual(euler368(), 253.6135092068);
+assert.strictEqual(kempnerLikeSeries(), 253.6135092068);
 ```
 
 # --seed--
@@ -31,12 +36,12 @@ assert.strictEqual(euler368(), 253.6135092068);
 ## --seed-contents--
 
 ```js
-function euler368() {
+function kempnerLikeSeries() {
 
   return true;
 }
 
-euler368();
+kempnerLikeSeries();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-369-badugi.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-369-badugi.md
index abdcb4c8102..b297bf965da 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-369-badugi.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-369-badugi.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4de1000cf542c50fff0
 title: 'Problem 369: Badugi'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302030
 dashedName: problem-369-badugi
 ---
@@ -10,16 +10,16 @@ dashedName: problem-369-badugi
 
 In a standard 52 card deck of playing cards, a set of 4 cards is a Badugi if it contains 4 cards with no pairs and no two cards of the same suit.
 
-Let f(n) be the number of ways to choose n cards with a 4 card subset that is a Badugi. For example, there are 2598960 ways to choose five cards from a standard 52 card deck, of which 514800 contain a 4 card subset that is a Badugi, so f(5) = 514800.
+Let $f(n)$ be the number of ways to choose $n$ cards with a 4 card subset that is a Badugi. For example, there are $2\\,598\\,960$ ways to choose five cards from a standard 52 card deck, of which $514\\,800$ contain a 4 card subset that is a Badugi, so $f(5) = 514800$.
 
-Find ∑f(n) for 4 ≤ n ≤ 13.
+Find $\sum f(n)$ for $4 ≤ n ≤ 13$.
 
 # --hints--
 
-`euler369()` should return 862400558448.
+`badugi()` should return `862400558448`.
 
 ```js
-assert.strictEqual(euler369(), 862400558448);
+assert.strictEqual(badugi(), 862400558448);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler369(), 862400558448);
 ## --seed-contents--
 
 ```js
-function euler369() {
+function badugi() {
 
   return true;
 }
 
-euler369();
+badugi();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-37-truncatable-primes.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-37-truncatable-primes.md
index 7cac6e4ddb3..5d4c80d5252 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-37-truncatable-primes.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-37-truncatable-primes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3911000cf542c50fea4
 title: 'Problem 37: Truncatable primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302031
 dashedName: problem-37-truncatable-primes
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-370-geometric-triangles.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-370-geometric-triangles.md
index 469f9151e03..dd37d167a05 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-370-geometric-triangles.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-370-geometric-triangles.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4de1000cf542c50fff1
 title: 'Problem 370: Geometric triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302032
 dashedName: problem-370-geometric-triangles
 ---
 
 # --description--
 
-Let us define a geometric triangle as an integer sided triangle with sides a ≤ b ≤ c so that its sides form a geometric progression, i.e. b2 = a · c .
+Let us define a geometric triangle as an integer sided triangle with sides $a ≤ b ≤ c$ so that its sides form a geometric progression, i.e. $b^2 = a \times c$.
 
-An example of such a geometric triangle is the triangle with sides a = 144, b = 156 and c = 169.
+An example of such a geometric triangle is the triangle with sides $a = 144$, $b = 156$ and $c = 169$.
 
-There are 861805 geometric triangles with perimeter ≤ 106 .
+There are $861\\,805$ geometric triangles with $\text{perimeter} ≤ {10}^6$.
 
-How many geometric triangles exist with perimeter ≤ 2.5·1013 ?
+How many geometric triangles exist with $\text{perimeter} ≤ 2.5 \times {10}^{13}$?
 
 # --hints--
 
-`euler370()` should return 41791929448408.
+`geometricTriangles()` should return `41791929448408`.
 
 ```js
-assert.strictEqual(euler370(), 41791929448408);
+assert.strictEqual(geometricTriangles(), 41791929448408);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler370(), 41791929448408);
 ## --seed-contents--
 
 ```js
-function euler370() {
+function geometricTriangles() {
 
   return true;
 }
 
-euler370();
+geometricTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-371-licence-plates.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-371-licence-plates.md
index 005b5aaf078..dee9928047e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-371-licence-plates.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-371-licence-plates.md
@@ -1,31 +1,31 @@
 ---
 id: 5900f4e01000cf542c50fff2
 title: 'Problem 371: Licence plates'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302033
 dashedName: problem-371-licence-plates
 ---
 
 # --description--
 
-Oregon licence plates consist of three letters followed by a three digit number (each digit can be from \[0..9]).
+Oregon licence plates consist of three letters followed by a three digit number (each digit can be from [0...9]).
 
 While driving to work Seth plays the following game:
 
 Whenever the numbers of two licence plates seen on his trip add to 1000 that's a win.
 
-E.g. MIC-012 and HAN-988 is a win and RYU-500 and SET-500 too. (as long as he sees them in the same trip).
+E.g. `MIC-012` and `HAN-988` is a win and `RYU-500` and `SET-500` too (as long as he sees them in the same trip).
 
 Find the expected number of plates he needs to see for a win. Give your answer rounded to 8 decimal places behind the decimal point.
 
-Note: We assume that each licence plate seen is equally likely to have any three digit number on it.
+**Note:** We assume that each licence plate seen is equally likely to have any three digit number on it.
 
 # --hints--
 
-`euler371()` should return 40.66368097.
+`licensePlates()` should return `40.66368097`.
 
 ```js
-assert.strictEqual(euler371(), 40.66368097);
+assert.strictEqual(licensePlates(), 40.66368097);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler371(), 40.66368097);
 ## --seed-contents--
 
 ```js
-function euler371() {
+function licensePlates() {
 
   return true;
 }
 
-euler371();
+licensePlates();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-372-pencils-of-rays.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-372-pencils-of-rays.md
index 1a04cacb71a..9a8e0ff315d 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-372-pencils-of-rays.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-372-pencils-of-rays.md
@@ -1,23 +1,27 @@
 ---
 id: 5900f4e11000cf542c50fff3
 title: 'Problem 372: Pencils of rays'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302034
 dashedName: problem-372-pencils-of-rays
 ---
 
 # --description--
 
-Let R(M, N) be the number of lattice points (x, y) which satisfy M
+Let $R(M, N)$ be the number of lattice points ($x$, $y$) which satisfy $M \lt x \le N$, $M \lt y \le N$ and $\left\lfloor\frac{y^2}{x^2}\right\rfloor$ is odd.
 
-Note: represents the floor function.
+We can verify that $R(0, 100) = 3\\,019$ and $R(100, 10\\,000) = 29\\,750\\,422$.
+
+Find $R(2 \times {10}^6, {10}^9)$.
+
+**Note:** $\lfloor x\rfloor$ represents the floor function.
 
 # --hints--
 
-`euler372()` should return 301450082318807040.
+`pencilsOfRays()` should return `301450082318807040`.
 
 ```js
-assert.strictEqual(euler372(), 301450082318807040);
+assert.strictEqual(pencilsOfRays(), 301450082318807040);
 ```
 
 # --seed--
@@ -25,12 +29,12 @@ assert.strictEqual(euler372(), 301450082318807040);
 ## --seed-contents--
 
 ```js
-function euler372() {
+function pencilsOfRays() {
 
   return true;
 }
 
-euler372();
+pencilsOfRays();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-373-circumscribed-circles.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-373-circumscribed-circles.md
index 534c32ea251..dbe4e1d47e4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-373-circumscribed-circles.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-373-circumscribed-circles.md
@@ -1,29 +1,27 @@
 ---
 id: 5900f4e11000cf542c50fff4
 title: 'Problem 373: Circumscribed Circles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302035
 dashedName: problem-373-circumscribed-circles
 ---
 
 # --description--
 
-Every triangle has a circumscribed circle that goes through the three vertices.
+Every triangle has a circumscribed circle that goes through the three vertices. Consider all integer sided triangles for which the radius of the circumscribed circle is integral as well.
 
-Consider all integer sided triangles for which the radius of the circumscribed circle is integral as well.
+Let $S(n)$ be the sum of the radii of the circumscribed circles of all such triangles for which the radius does not exceed $n$.
 
-Let S(n) be the sum of the radii of the circumscribed circles of all such triangles for which the radius does not exceed n.
+$S(100) = 4\\,950$ and $S(1\\,200) = 1\\,653\\,605$.
 
-S(100)=4950 and S(1200)=1653605.
-
-Find S(107).
+Find $S({10}^7)$.
 
 # --hints--
 
-`euler373()` should return 727227472448913.
+`circumscribedCircles()` should return `727227472448913`.
 
 ```js
-assert.strictEqual(euler373(), 727227472448913);
+assert.strictEqual(circumscribedCircles(), 727227472448913);
 ```
 
 # --seed--
@@ -31,12 +29,12 @@ assert.strictEqual(euler373(), 727227472448913);
 ## --seed-contents--
 
 ```js
-function euler373() {
+function circumscribedCircles() {
 
   return true;
 }
 
-euler373();
+circumscribedCircles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.md
index 10fe6218919..e2578270e64 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.md
@@ -1,35 +1,37 @@
 ---
 id: 5900f4e51000cf542c50fff6
 title: 'Problem 374: Maximum Integer Partition Product'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302036
 dashedName: problem-374-maximum-integer-partition-product
 ---
 
 # --description--
 
-An integer partition of a number n is a way of writing n as a sum of positive integers.
+An integer partition of a number $n$ is a way of writing $n$ as a sum of positive integers.
 
-Partitions that differ only in the order of their summands are considered the same. A partition of n into distinct parts is a partition of n in which every part occurs at most once.
+Partitions that differ only in the order of their summands are considered the same. A partition of $n$ into distinct parts is a partition of $n$ in which every part occurs at most once.
 
-The partitions of 5 into distinct parts are: 5, 4+1 and 3+2.
+The partitions of 5 into distinct parts are:
 
-Let f(n) be the maximum product of the parts of any such partition of n into distinct parts and let m(n) be the number of elements of any such partition of n with that product.
+5, 4 + 1 and 3 + 2.
 
-So f(5)=6 and m(5)=2.
+Let $f(n)$ be the maximum product of the parts of any such partition of $n$ into distinct parts and let $m(n)$ be the number of elements of any such partition of $n$ with that product.
 
-For n=10 the partition with the largest product is 10=2+3+5, which gives f(10)=30 and m(10)=3. And their product, f(10)·m(10) = 30·3 = 90
+So $f(5) = 6$ and $m(5) = 2$.
 
-It can be verified that ∑f(n)·m(n) for 1 ≤ n ≤ 100 = 1683550844462.
+For $n = 10$ the partition with the largest product is $10 = 2 + 3 + 5$, which gives $f(10) = 30$ and $m(10) = 3$. And their product, $f(10) \times m(10) = 30 \times 3 = 90$
 
-Find ∑f(n)·m(n) for 1 ≤ n ≤ 1014. Give your answer modulo 982451653, the 50 millionth prime.
+It can be verified that $\sum f(n) \times m(n)$ for $1 ≤ n ≤ 100 = 1\\,683\\,550\\,844\\,462$.
+
+Find $\sum f(n) \times m(n)$ for $1 ≤ n ≤ {10}^{14}$. Give your answer modulo $982\\,451\\,653$, the 50 millionth prime.
 
 # --hints--
 
-`euler374()` should return 334420941.
+`maximumIntegerPartitionProduct()` should return `334420941`.
 
 ```js
-assert.strictEqual(euler374(), 334420941);
+assert.strictEqual(maximumIntegerPartitionProduct(), 334420941);
 ```
 
 # --seed--
@@ -37,12 +39,12 @@ assert.strictEqual(euler374(), 334420941);
 ## --seed-contents--
 
 ```js
-function euler374() {
+function maximumIntegerPartitionProduct() {
 
   return true;
 }
 
-euler374();
+maximumIntegerPartitionProduct();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md
index 684613a2357..b8002379d0f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md
@@ -1,37 +1,30 @@
 ---
 id: 5900f4e41000cf542c50fff5
-title: 'Problem 375: Minimum of subsequences'
-challengeType: 5
+title: '问题 375：子序列的最小值'
+challengeType: 1
 forumTopicId: 302037
 dashedName: problem-375-minimum-of-subsequences
 ---
 
 # --description--
 
-Let Sn be an integer sequence produced with the following pseudo-random number generator:
+Let $S_n$ be an integer sequence produced with the following pseudo-random number generator:
 
-S0
+$$\begin{align}         S_0 & = 290\\,797 \\\\
+  S_{n + 1} & = {S_n}^2\bmod 50\\,515\\,093 \end{align}$$
 
-=
+Let $A(i, j)$ be the minimum of the numbers $S_i, S_{i + 1}, \ldots, S_j$ for $i ≤ j$. Let $M(N) = \sum A(i, j)$ for $1 ≤ i ≤ j ≤ N$.
 
-290797
+We can verify that $M(10) = 432\\,256\\,955$ and $M(10\\,000) = 3\\,264\\,567\\,774\\,119$.
 
-Sn+1
-
-=
-
-Sn2 mod 50515093
-
-Let A(i, j) be the minimum of the numbers Si, Si+1, ... , Sj for i ≤ j. Let M(N) = ΣA(i, j) for 1 ≤ i ≤ j ≤ N. We can verify that M(10) = 432256955 and M(10 000) = 3264567774119.
-
-Find M(2 000 000 000).
+Find $M(2\\,000\\,000\\,000)$.
 
 # --hints--
 
-`euler375()` should return 7435327983715286000.
+`minimumOfSubsequences()` should return `7435327983715286000`.
 
 ```js
-assert.strictEqual(euler375(), 7435327983715286000);
+assert.strictEqual(minimumOfSubsequences(), 7435327983715286000);
 ```
 
 # --seed--
@@ -39,12 +32,12 @@ assert.strictEqual(euler375(), 7435327983715286000);
 ## --seed-contents--
 
 ```js
-function euler375() {
+function minimumOfSubsequences() {
 
   return true;
 }
 
-euler375();
+minimumOfSubsequences();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.md
index b76c4d26e8f..344a1e84e90 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4e51000cf542c50fff7
 title: 'Problem 376: Nontransitive sets of dice'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302038
 dashedName: problem-376-nontransitive-sets-of-dice
 ---
@@ -10,28 +10,43 @@ dashedName: problem-376-nontransitive-sets-of-dice
 
 Consider the following set of dice with nonstandard pips:
 
-Die A: 1 4 4 4 4 4 Die B: 2 2 2 5 5 5 Die C: 3 3 3 3 3 6
+$$\begin{array}{}   \text{Die A: } & 1 & 4 & 4 & 4 & 4 & 4 \\\\
+  \text{Die B: } & 2 & 2 & 2 & 5 & 5 & 5 \\\\   \text{Die C: } & 3 & 3 & 3 & 3 & 3 & 6 \\\\
+\end{array}$$
 
 A game is played by two players picking a die in turn and rolling it. The player who rolls the highest value wins.
 
-If the first player picks die A and the second player picks die B we get P(second player wins) = 7/12 > 1/2
+If the first player picks die $A$ and the second player picks die $B$ we get
 
-If the first player picks die B and the second player picks die C we get P(second player wins) = 7/12 > 1/2
+$P(\text{second player wins}) = \frac{7}{12} > \frac{1}{2}$
 
-If the first player picks die C and the second player picks die A we get P(second player wins) = 25/36 > 1/2
+If the first player picks die $B$ and the second player picks die $C$ we get
+
+$P(\text{second player wins}) = \frac{7}{12} > \frac{1}{2}$
+
+If the first player picks die $C$ and the second player picks die $A$ we get
+
+$P(\text{second player wins}) = \frac{25}{36} > \frac{1}{2}$
 
 So whatever die the first player picks, the second player can pick another die and have a larger than 50% chance of winning. A set of dice having this property is called a nontransitive set of dice.
 
-We wish to investigate how many sets of nontransitive dice exist. We will assume the following conditions:There are three six-sided dice with each side having between 1 and N pips, inclusive. Dice with the same set of pips are equal, regardless of which side on the die the pips are located. The same pip value may appear on multiple dice; if both players roll the same value neither player wins. The sets of dice {A,B,C}, {B,C,A} and {C,A,B} are the same set.
+We wish to investigate how many sets of nontransitive dice exist. We will assume the following conditions:
 
-For N = 7 we find there are 9780 such sets. How many are there for N = 30 ?
+- There are three six-sided dice with each side having between 1 and $N$ pips, inclusive.
+- Dice with the same set of pips are equal, regardless of which side on the die the pips are located.
+- The same pip value may appear on multiple dice; if both players roll the same value neither player wins.
+- The sets of dice $\\{A, B, C\\}$, $\\{B, C, A\\}$ and $\\{C, A, B\\}$ are the same set.
+
+For $N = 7$ we find there are 9780 such sets.
+
+How many are there for $N = 30$?
 
 # --hints--
 
-`euler376()` should return 973059630185670.
+`nontransitiveSetsOfDice()` should return `973059630185670`.
 
 ```js
-assert.strictEqual(euler376(), 973059630185670);
+assert.strictEqual(nontransitiveSetsOfDice(), 973059630185670);
 ```
 
 # --seed--
@@ -39,12 +54,12 @@ assert.strictEqual(euler376(), 973059630185670);
 ## --seed-contents--
 
 ```js
-function euler376() {
+function nontransitiveSetsOfDice() {
 
   return true;
 }
 
-euler376();
+nontransitiveSetsOfDice();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.md
index 660508c2348..ff149a27b28 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4e51000cf542c50fff8
 title: 'Problem 377: Sum of digits, experience 13'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302039
 dashedName: problem-377-sum-of-digits-experience-13
 ---
@@ -14,16 +14,16 @@ There are 16 positive integers that do not have a zero in their digits and that
 
 Their sum is 17891.
 
-Let f(n) be the sum of all positive integers that do not have a zero in their digits and have a digital sum equal to n.
+Let $f(n)$ be the sum of all positive integers that do not have a zero in their digits and have a digital sum equal to $n$.
 
-Find $\\displaystyle \\sum\_{i=1}^{17} f(13^i)$. Give the last 9 digits as your answer.
+Find $\displaystyle\sum_{i=1}^{17} f(13^i)$. Give the last 9 digits as your answer.
 
 # --hints--
 
-`euler377()` should return 732385277.
+`experience13()` should return `732385277`.
 
 ```js
-assert.strictEqual(euler377(), 732385277);
+assert.strictEqual(experience13(), 732385277);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler377(), 732385277);
 ## --seed-contents--
 
 ```js
-function euler377() {
+function experience13() {
 
   return true;
 }
 
-euler377();
+experience13();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-378-triangle-triples.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-378-triangle-triples.md
index 22589747fe8..e72ba4316c9 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-378-triangle-triples.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-378-triangle-triples.md
@@ -1,31 +1,27 @@
 ---
 id: 5900f4e61000cf542c50fff9
 title: 'Problem 378: Triangle Triples'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302040
 dashedName: problem-378-triangle-triples
 ---
 
 # --description--
 
-Let T(n) be the nth triangle number, so T(n) =
+Let $T(n)$ be the $n^{\text{th}}$ triangle number, so $T(n) = \frac{n(n + 1)}{2}$.
 
-n (n+1)2
+Let $dT(n)$ be the number of divisors of $T(n)$. E.g.: $T(7) = 28$ and $dT(7) = 6$.
 
-.
+Let $Tr(n)$ be the number of triples ($i$, $j$, $k$) such that $1 ≤ i &lt; j &lt; k ≤ n$ and $dT(i) > dT(j) > dT(k)$. $Tr(20) = 14$, $Tr(100) = 5\\,772$ and $Tr(1000) = 11\\,174\\,776$.
 
-Let dT(n) be the number of divisors of T(n). E.g.: T(7) = 28 and dT(7) = 6.
-
-Let Tr(n) be the number of triples (i, j, k) such that 1 ≤ i &lt; j &lt; k ≤ n and dT(i) > dT(j) > dT(k). Tr(20) = 14, Tr(100) = 5772 and Tr(1000) = 11174776.
-
-Find Tr(60 000 000). Give the last 18 digits of your answer.
+Find $Tr(60\\,000\\,000)$. Give the last 18 digits of your answer.
 
 # --hints--
 
-`euler378()` should return 147534623725724700.
+`triangleTriples()` should return `147534623725724700`.
 
 ```js
-assert.strictEqual(euler378(), 147534623725724700);
+assert.strictEqual(triangleTriples(), 147534623725724700);
 ```
 
 # --seed--
@@ -33,12 +29,12 @@ assert.strictEqual(euler378(), 147534623725724700);
 ## --seed-contents--
 
 ```js
-function euler378() {
+function triangleTriples() {
 
   return true;
 }
 
-euler378();
+triangleTriples();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.md
index 3933d82ea2c..0f2fb896572 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4e81000cf542c50fffa
 title: 'Problem 379: Least common multiple count'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302041
 dashedName: problem-379-least-common-multiple-count
 ---
 
 # --description--
 
-Let f(n) be the number of couples (x,y) with x and y positive integers, x ≤ y and the least common multiple of x and y equal to n.
+Let $f(n)$ be the number of couples ($x$, $y$) with $x$ and $y$ positive integers, $x ≤ y$ and the least common multiple of $x$ and $y$ equal to $n$.
 
-Let g be the summatory function of f, i.e.: g(n) = ∑ f(i) for 1 ≤ i ≤ n.
+Let $g$ be the summatory function of $f$, i.e.: $g(n) = \sum f(i)$ for $1 ≤ i ≤ n$.
 
-You are given that g(106) = 37429395.
+You are given that $g({10}^6) = 37\\,429\\,395$.
 
-Find g(1012).
+Find $g({10}^{12})$.
 
 # --hints--
 
-`euler379()` should return 132314136838185.
+`leastCommonMultipleCount()` should return `132314136838185`.
 
 ```js
-assert.strictEqual(euler379(), 132314136838185);
+assert.strictEqual(leastCommonMultipleCount(), 132314136838185);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler379(), 132314136838185);
 ## --seed-contents--
 
 ```js
-function euler379() {
+function leastCommonMultipleCount() {
 
   return true;
 }
 
-euler379();
+leastCommonMultipleCount();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md
index 1c3f0c56c60..a1190e84f39 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3931000cf542c50fea5
 title: 'Problem 38: Pandigital multiples'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302042
 dashedName: problem-38-pandigital-multiples
 ---
@@ -10,7 +10,9 @@ dashedName: problem-38-pandigital-multiples
 
 Take the number 192 and multiply it by each of 1, 2, and 3:
 
-$$\begin{align} 192 × 1 = 192\\\\ 192 × 2 = 384\\\\ 192 × 3 = 576\\\\ \end{align}$$
+$$\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).
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md
index 8596f52fa78..6755479e936 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md
@@ -1,27 +1,37 @@
 ---
 id: 5900f4e81000cf542c50fffb
 title: 'Problem 380: Amazing Mazes!'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302044
 dashedName: problem-380-amazing-mazes
 ---
 
 # --description--
 
-An m×n maze is an m×n rectangular grid with walls placed between grid cells such that there is exactly one path from the top-left square to any other square. The following are examples of a 9×12 maze and a 15×20 maze:
+An $m×n$ maze is an $m×n$ rectangular grid with walls placed between grid cells such that there is exactly one path from the top-left square to any other square. The following are examples of a 9×12 maze and a 15×20 maze:
 
-Let C(m,n) be the number of distinct m×n mazes. Mazes which can be formed by rotation and reflection from another maze are considered distinct.
+<img class="img-responsive center-block" alt="9x12 maze and 15x20 maze" src="https://cdn.freecodecamp.org/curriculum/project-euler/amazing-mazes.gif" style="background-color: white; padding: 10px;" />
 
-It can be verified that C(1,1) = 1, C(2,2) = 4, C(3,4) = 2415, and C(9,12) = 2.5720e46 (in scientific notation rounded to 5 significant digits). Find C(100,500) and write your answer in scientific notation rounded to 5 significant digits.
+Let $C(m, n)$ be the number of distinct $m×n$ mazes. Mazes which can be formed by rotation and reflection from another maze are considered distinct.
 
-When giving your answer, use a lowercase e to separate mantissa and exponent. E.g. if the answer is 1234567891011 then the answer format would be 1.2346e12.
+It can be verified that $C(1, 1) = 1$, $C(2, 2) = 4$, $C(3, 4) = 2415$, and $C(9, 12) = 2.5720\mathrm{e}\\,46$ (in scientific notation rounded to 5 significant digits).
+
+Find $C(100, 500)$ and write your answer as a string in scientific notation rounded to 5 significant digits.
+
+When giving your answer, use a lowercase e to separate mantissa and exponent. 例如： if the answer is 1234567891011 then the answer format would be the string `1.2346e12`.
 
 # --hints--
 
-`euler380()` should return Infinity.
+`amazingMazes()` should return a string.
 
 ```js
-assert.strictEqual(euler380(), Infinity);
+assert(typeof amazingMazes() === 'string');
+```
+
+`amazingMazes()` should return the string `6.3202e25093`.
+
+```js
+assert.strictEqual(amazingMazes(), '6.3202e25093');
 ```
 
 # --seed--
@@ -29,12 +39,12 @@ assert.strictEqual(euler380(), Infinity);
 ## --seed-contents--
 
 ```js
-function euler380() {
+function amazingMazes() {
 
   return true;
 }
 
-euler380();
+amazingMazes();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-381-prime-k-factorial.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-381-prime-k-factorial.md
index f64768a5c7a..01090dbc3cb 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-381-prime-k-factorial.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-381-prime-k-factorial.md
@@ -1,27 +1,31 @@
 ---
 id: 5900f4ea1000cf542c50fffc
 title: 'Problem 381: (prime-k) factorial'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302045
 dashedName: problem-381-prime-k-factorial
 ---
 
 # --description--
 
-For a prime p let S(p) = (∑(p-k)!) mod(p) for 1 ≤ k ≤ 5.
+For a prime $p$ let $S(p) = (\sum (p - k)!)\bmod (p)$ for $1 ≤ k ≤ 5$.
 
-For example, if p=7, (7-1)! + (7-2)! + (7-3)! + (7-4)! + (7-5)! = 6! + 5! + 4! + 3! + 2! = 720+120+24+6+2 = 872. As 872 mod(7) = 4, S(7) = 4.
+For example, if $p = 7$,
 
-It can be verified that ∑S(p) = 480 for 5 ≤ p &lt; 100.
+$$(7 - 1)! + (7 - 2)! + (7 - 3)! + (7 - 4)! + (7 - 5)! = 6！ + 5！ + 4！ + 3！ + 2！ = 720 + 120 + 24 + 6 + 2 = 872$$
 
-Find ∑S(p) for 5 ≤ p &lt; 108.
+As $872\bmod (7) = 4$, $S(7) = 4$.
+
+It can be verified that $\sum S(p) = 480$ for $5 ≤ p &lt; 100$.
+
+Find $\sum S(p)$ for $5 ≤ p &lt; {10}^8$.
 
 # --hints--
 
-`euler381()` should return 139602943319822.
+`primeKFactorial()` should return `139602943319822`.
 
 ```js
-assert.strictEqual(euler381(), 139602943319822);
+assert.strictEqual(primeKFactorial(), 139602943319822);
 ```
 
 # --seed--
@@ -29,12 +33,12 @@ assert.strictEqual(euler381(), 139602943319822);
 ## --seed-contents--
 
 ```js
-function euler381() {
+function primeKFactorial() {
 
   return true;
 }
 
-euler381();
+primeKFactorial();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-382-generating-polygons.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-382-generating-polygons.md
index ae95128f6bb..605495d8fed 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-382-generating-polygons.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-382-generating-polygons.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4eb1000cf542c50fffd
 title: 'Problem 382: Generating polygons'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302046
 dashedName: problem-382-generating-polygons
 ---
@@ -10,22 +10,39 @@ dashedName: problem-382-generating-polygons
 
 A polygon is a flat shape consisting of straight line segments that are joined to form a closed chain or circuit. A polygon consists of at least three sides and does not self-intersect.
 
-A set S of positive numbers is said to generate a polygon P if: no two sides of P are the same length, the length of every side of P is in S, and S contains no other value.
+A set $S$ of positive numbers is said to generate a polygon $P$ if:
 
-For example: The set {3, 4, 5} generates a polygon with sides 3, 4, and 5 (a triangle). The set {6, 9, 11, 24} generates a polygon with sides 6, 9, 11, and 24 (a quadrilateral). The sets {1, 2, 3} and {2, 3, 4, 9} do not generate any polygon at all.
+- no two sides of $P$ are the same length,
+- the length of every side of $P$ is in $S$, and
+- $S$ contains no other value.
 
-Consider the sequence s, defined as follows:s1 = 1, s2 = 2, s3 = 3 sn = sn-1 + sn-3 for n > 3.
+For example:
 
-Let Un be the set {s1, s2, ..., sn}. For example, U10 = {1, 2, 3, 4, 6, 9, 13, 19, 28, 41}. Let f(n) be the number of subsets of Un which generate at least one polygon. For example, f(5) = 7, f(10) = 501 and f(25) = 18635853.
+The set {3, 4, 5} generates a polygon with sides 3, 4, and 5 (a triangle).
 
-Find the last 9 digits of f(1018).
+The set {6, 9, 11, 24} generates a polygon with sides 6, 9, 11, and 24 (a quadrilateral).
+
+The sets {1, 2, 3} and {2, 3, 4, 9} do not generate any polygon at all.
+
+Consider the sequence $s$, defined as follows:
+
+- $s_1 = 1$, $s_2 = 2$, $s_3 = 3$
+- $s_n = s_{n - 1} + s_{n - 3}$ for $n > 3$.
+
+Let $U_n$ be the set $\\{s_1, s_2, \ldots, s_n\\}$. For example, $U_{10} = \\{1, 2, 3, 4, 6, 9, 13, 19, 28, 41\\}$.
+
+Let $f(n)$ be the number of subsets of $U_n$ which generate at least one polygon.
+
+For example, $f(5) = 7$, $f(10) = 501$ and $f(25) = 18\\,635\\,853$.
+
+Find the last 9 digits of $f({10}^{18})$.
 
 # --hints--
 
-`euler382()` should return 697003956.
+`generatingPolygons()` should return `697003956`.
 
 ```js
-assert.strictEqual(euler382(), 697003956);
+assert.strictEqual(generatingPolygons(), 697003956);
 ```
 
 # --seed--
@@ -33,12 +50,12 @@ assert.strictEqual(euler382(), 697003956);
 ## --seed-contents--
 
 ```js
-function euler382() {
+function generatingPolygons() {
 
   return true;
 }
 
-euler382();
+generatingPolygons();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.md
index f199cb4f946..4a851985199 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f4ed1000cf542c50ffff
 title: 'Problem 383: Divisibility comparison between factorials'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302047
 dashedName: problem-383-divisibility-comparison-between-factorials
 ---
 
 # --description--
 
-Let f5(n) be the largest integer x for which 5x divides n.
+Let $f_5(n)$ be the largest integer $x$ for which $5^x$ divides $n$.
 
-For example, f5(625000) = 7.
+For example, $f_5(625\\,000) = 7$.
 
-Let T5(n) be the number of integers i which satisfy f5((2·i-1)!) &lt; 2·f5(i!) and 1 ≤ i ≤ n. It can be verified that T5(103) = 68 and T5(109) = 2408210.
+Let $T_5(n)$ be the number of integers $i$ which satisfy $f_5((2 \times i - 1)!) &lt; 2 \times f_5(i!)$ and $1 ≤ i ≤ n$.
 
-Find T5(1018).
+It can be verified that $T_5({10}^3) = 68$ and $T_5({10}^9) = 2\\,408\\,210$.
+
+Find $T_5({10}^{18})$.
 
 # --hints--
 
-`euler383()` should return 22173624649806.
+`factorialDivisibilityComparison()` should return `22173624649806`.
 
 ```js
-assert.strictEqual(euler383(), 22173624649806);
+assert.strictEqual(factorialDivisibilityComparison(), 22173624649806);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler383(), 22173624649806);
 ## --seed-contents--
 
 ```js
-function euler383() {
+function factorialDivisibilityComparison() {
 
   return true;
 }
 
-euler383();
+factorialDivisibilityComparison();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md
index c57f0ee2f96..9f11652c82f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md
@@ -1,37 +1,48 @@
 ---
 id: 5900f4ed1000cf542c50fffe
 title: 'Problem 384: Rudin-Shapiro sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302048
 dashedName: problem-384-rudin-shapiro-sequence
 ---
 
 # --description--
 
-Define the sequence a(n) as the number of adjacent pairs of ones in the binary expansion of n (possibly overlapping).
+Define the sequence $a(n)$ as the number of adjacent pairs of ones in the binary expansion of $n$ (possibly overlapping).
 
-E.g.: a(5) = a(1012) = 0, a(6) = a(1102) = 1, a(7) = a(1112) = 2
+E.g.: $a(5) = a({101}_2) = 0$, $a(6) = a({110}_2) = 1$, $a(7) = a({111}_2) = 2$
 
-Define the sequence b(n) = (-1)a(n). This sequence is called the Rudin-Shapiro sequence. Also consider the summatory sequence of b(n): .
+Define the sequence $b(n) = {(-1)}^{a(n)}$. This sequence is called the Rudin-Shapiro sequence.
 
-The first couple of values of these sequences are: n 0 1 2 3 4 5 6 7 a(n) 0 0 0 1 0 0 1 2 b(n) 1 1 1 -1 1 1 -1 1 s(n) 1 2 3 2 3 4 3 4
+Also consider the summatory sequence of $b(n)$: $s(n) = \displaystyle\sum_{i = 0}^{n} b(i)$.
 
-The sequence s(n) has the remarkable property that all elements are positive and every positive integer k occurs exactly k times.
+The first couple of values of these sequences are:
 
-Define g(t,c), with 1 ≤ c ≤ t, as the index in s(n) for which t occurs for the c'th time in s(n). E.g.: g(3,3) = 6, g(4,2) = 7 and g(54321,12345) = 1220847710.
+$$\begin{array}{lr}   n    & 0 & 1 & 2 &  3 & 4 & 5 &  6 & 7 \\\\
+  a(n) & 0 & 0 & 0 &  1 & 0 & 0 &  1 & 2 \\\\   b(n) & 1 & 1 & 1 & -1 & 1 & 1 & -1 & 1 \\\\
+  s(n) & 1 & 2 & 3 &  2 & 3 & 4 &  3 & 4 \end{array}$$
 
-Let F(n) be the fibonacci sequence defined by: F(0)=F(1)=1 and F(n)=F(n-1)+F(n-2) for n>1.
+The sequence $s(n)$ has the remarkable property that all elements are positive and every positive integer $k$ occurs exactly $k$ times.
 
-Define GF(t)=g(F(t),F(t-1)).
+Define $g(t, c)$, with $1 ≤ c ≤ t$, as the index in $s(n)$ for which $t$ occurs for the $c$'th time in $s(n)$.
 
-Find ΣGF(t) for 2≤t≤45.
+E.g.: $g(3, 3) = 6$, $g(4, 2) = 7$ and $g(54321, 12345) = 1\\,220\\,847\\,710$.
+
+Let $F(n)$ be the fibonacci sequence defined by:
+
+$$\begin{align}   & F(0) = F(1) = 1 \text{ and} \\\\
+  & F(n) = F(n - 1) + F(n - 2) \text{ for } n > 1. \end{align}$$
+
+Define $GF(t) = g(F(t), F(t - 1))$.
+
+Find $\sum GF(t)$ for$ 2 ≤ t ≤ 45$.
 
 # --hints--
 
-`euler384()` should return 3354706415856333000.
+`rudinShapiroSequence()` should return `3354706415856333000`.
 
 ```js
-assert.strictEqual(euler384(), 3354706415856333000);
+assert.strictEqual(rudinShapiroSequence(), 3354706415856333000);
 ```
 
 # --seed--
@@ -39,12 +50,12 @@ assert.strictEqual(euler384(), 3354706415856333000);
 ## --seed-contents--
 
 ```js
-function euler384() {
+function rudinShapiroSequence() {
 
   return true;
 }
 
-euler384();
+rudinShapiroSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md
index 3cb1e307632..96df0312f03 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md
@@ -1,36 +1,38 @@
 ---
 id: 5900f4ee1000cf542c510000
 title: 'Problem 385: Ellipses inside triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302049
 dashedName: problem-385-ellipses-inside-triangles
 ---
 
 # --description--
 
-For any triangle T in the plane, it can be shown that there is a unique ellipse with largest area that is completely inside T.
+For any triangle $T$ in the plane, it can be shown that there is a unique ellipse with largest area that is completely inside $T$.
 
-For a given n, consider triangles T such that:
+<img class="img-responsive center-block" alt="ellipse completely insisde of triangle" src="https://cdn.freecodecamp.org/curriculum/project-euler/ellipses-inside-triangles.png" style="background-color: white; padding: 10px;" />
 
--   the vertices of T have integer coordinates with absolute value ≤ n, and
--   the foci1 of the largest-area ellipse inside T are (√13,0) and (-√13,0).
+For a given $n$, consider triangles $T$ such that:
 
-Let A(n) be the sum of the areas of all such triangles.
+-   the vertices of $T$ have integer coordinates with absolute value $≤ n$, and
+-   the foci<sup>1</sup> of the largest-area ellipse inside $T$ are $(\sqrt{13}, 0)$ and $(-\sqrt{13}, 0)$.
 
-For example, if n = 8, there are two such triangles. Their vertices are (-4,-3),(-4,3),(8,0) and (4,3),(4,-3),(-8,0), and the area of each triangle is 36. Thus A(8) = 36 + 36 = 72.
+Let $A(n)$ be the sum of the areas of all such triangles.
 
-It can be verified that A(10) = 252, A(100) = 34632 and A(1000) = 3529008.
+For example, if $n = 8$, there are two such triangles. Their vertices are (-4,-3), (-4,3), (8,0) and (4,3), (4,-3), (-8,0), and the area of each triangle is 36. Thus $A(8) = 36 + 36 = 72$.
 
-Find A(1 000 000 000).
+It can be verified that $A(10) = 252$, $A(100) = 34\\,632$ and $A(1000) = 3\\,529\\,008$.
 
-1The foci (plural of focus) of an ellipse are two points A and B such that for every point P on the boundary of the ellipse, AP + PB is constant.
+Find $A(1\\,000\\,000\\,000)$.
+
+<sup>1</sup>The foci (plural of focus) of an ellipse are two points $A$ and $B$ such that for every point $P$ on the boundary of the ellipse, $AP + PB$ is constant.
 
 # --hints--
 
-`euler385()` should return 3776957309612154000.
+`ellipsesInsideTriangles()` should return `3776957309612154000`.
 
 ```js
-assert.strictEqual(euler385(), 3776957309612154000);
+assert.strictEqual(ellipsesInsideTriangles(), 3776957309612154000);
 ```
 
 # --seed--
@@ -38,12 +40,12 @@ assert.strictEqual(euler385(), 3776957309612154000);
 ## --seed-contents--
 
 ```js
-function euler385() {
+function ellipsesInsideTriangles() {
 
   return true;
 }
 
-euler385();
+ellipsesInsideTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.md
index 36a6ce965c8..de0614e4651 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.md
@@ -1,29 +1,33 @@
 ---
 id: 5900f4ef1000cf542c510001
 title: 'Problem 386: Maximum length of an antichain'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302050
 dashedName: problem-386-maximum-length-of-an-antichain
 ---
 
 # --description--
 
-Let n be an integer and S(n) be the set of factors of n.
+Let $n$ be an integer and $S(n)$ be the set of factors of $n$.
 
-A subset A of S(n) is called an antichain of S(n) if A contains only one element or if none of the elements of A divides any of the other elements of A.
+A subset $A$ of $S(n)$ is called an antichain of $S(n)$ if $A$ contains only one element or if none of the elements of $A$ divides any of the other elements of $A$.
 
-For example: S(30) = {1, 2, 3, 5, 6, 10, 15, 30} {2, 5, 6} is not an antichain of S(30). {2, 3, 5} is an antichain of S(30).
+For example: $S(30) = \\{1, 2, 3, 5, 6, 10, 15, 30\\}$
 
-Let N(n) be the maximum length of an antichain of S(n).
+$\\{2, 5, 6\\}$ is not an antichain of $S(30)$.
 
-Find ΣN(n) for 1 ≤ n ≤ 108
+$\\{2, 3, 5\\}$ is an antichain of $S(30)$.
+
+Let $N(n)$ be the maximum length of an antichain of $S(n)$.
+
+Find $\sum N(n)$ for $1 ≤ n ≤ {10}^8$
 
 # --hints--
 
-`euler386()` should return 528755790.
+`maximumLengthOfAntichain()` should return `528755790`.
 
 ```js
-assert.strictEqual(euler386(), 528755790);
+assert.strictEqual(maximumLengthOfAntichain(), 528755790);
 ```
 
 # --seed--
@@ -31,12 +35,12 @@ assert.strictEqual(euler386(), 528755790);
 ## --seed-contents--
 
 ```js
-function euler386() {
+function maximumLengthOfAntichain() {
 
   return true;
 }
 
-euler386();
+maximumLengthOfAntichain();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md
index aa3caddfe3e..2b2ccbbaa0e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4f11000cf542c510003
 title: 'Problem 387: Harshad Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302051
 dashedName: problem-387-harshad-numbers
 ---
@@ -18,20 +18,24 @@ When we truncate the last digit from 20, we get 2, which is also a Harshad numbe
 
 Let's call a Harshad number that, while recursively truncating the last digit, always results in a Harshad number a right truncatable Harshad number.
 
-Also: 201/3=67 which is prime. Let's call a Harshad number that, when divided by the sum of its digits, results in a prime a strong Harshad number.
+Also:
+
+$\frac{201}{3} = 67$ which is prime.
+
+Let's call a Harshad number that, when divided by the sum of its digits, results in a prime a strong Harshad number.
 
 Now take the number 2011 which is prime. When we truncate the last digit from it we get 201, a strong Harshad number that is also right truncatable. Let's call such primes strong, right truncatable Harshad primes.
 
 You are given that the sum of the strong, right truncatable Harshad primes less than 10000 is 90619.
 
-Find the sum of the strong, right truncatable Harshad primes less than 1014.
+Find the sum of the strong, right truncatable Harshad primes less than ${10}^{14}$.
 
 # --hints--
 
-`euler387()` should return 696067597313468.
+`harshadNumbers()` should return `696067597313468`.
 
 ```js
-assert.strictEqual(euler387(), 696067597313468);
+assert.strictEqual(harshadNumbers(), 696067597313468);
 ```
 
 # --seed--
@@ -39,12 +43,12 @@ assert.strictEqual(euler387(), 696067597313468);
 ## --seed-contents--
 
 ```js
-function euler387() {
+function harshadNumbers() {
 
   return true;
 }
 
-euler387();
+harshadNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md
index ba13e9be3cd..4ff7f140070 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4f11000cf542c510002
 title: 'Problem 388: Distinct Lines'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302052
 dashedName: problem-388-distinct-lines
 ---
 
 # --description--
 
-Consider all lattice points (a,b,c) with 0 ≤ a,b,c ≤ N.
+Consider all lattice points ($a$, $b$, $c$) with $0 ≤ a, b, c ≤ N$.
 
-From the origin O(0,0,0) all lines are drawn to the other lattice points. Let D(N) be the number of distinct such lines.
+From the origin $O(0, 0, 0)$ all lines are drawn to the other lattice points. Let $D(N)$ be the number of distinct such lines.
 
-You are given that D(1 000 000) = 831909254469114121.
+You are given that $D(1\\,000\\,000) = 831\\,909\\,254\\,469\\,114\\,121$.
 
-Find D(1010). Give as your answer the first nine digits followed by the last nine digits.
+Find $D({10}^{10})$. Give as your answer the first nine digits followed by the last nine digits.
 
 # --hints--
 
-`euler388()` should return 831907372805130000.
+`distinctLines()` should return `831907372805130000`.
 
 ```js
-assert.strictEqual(euler388(), 831907372805130000);
+assert.strictEqual(distinctLines(), 831907372805130000);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler388(), 831907372805130000);
 ## --seed-contents--
 
 ```js
-function euler388() {
+function distinctLines() {
 
   return true;
 }
 
-euler388();
+distinctLines();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-389-platonic-dice.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-389-platonic-dice.md
index 0fb6bb2688e..081791ffe3b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-389-platonic-dice.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-389-platonic-dice.md
@@ -1,23 +1,31 @@
 ---
 id: 5900f4f21000cf542c510004
 title: 'Problem 389: Platonic Dice'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302053
 dashedName: problem-389-platonic-dice
 ---
 
 # --description--
 
-An unbiased single 4-sided die is thrown and its value, T, is noted.T unbiased 6-sided dice are thrown and their scores are added together. The sum, C, is noted.C unbiased 8-sided dice are thrown and their scores are added together. The sum, O, is noted.O unbiased 12-sided dice are thrown and their scores are added together. The sum, D, is noted.D unbiased 20-sided dice are thrown and their scores are added together. The sum, I, is noted.
+An unbiased single 4-sided die is thrown and its value, $T$, is noted.
 
-Find the variance of I, and give your answer rounded to 4 decimal places.
+$T$ unbiased 6-sided dice are thrown and their scores are added together. The sum, $C$, is noted.
+
+$C$ unbiased 8-sided dice are thrown and their scores are added together. The sum, $O$, is noted.
+
+$O$ unbiased 12-sided dice are thrown and their scores are added together. The sum, $D$, is noted.
+
+$D$ unbiased 20-sided dice are thrown and their scores are added together. The sum, $I$, is noted.
+
+Find the variance of $I$, and give your answer rounded to 4 decimal places.
 
 # --hints--
 
-`euler389()` should return 2406376.3623.
+`platonicDice()` should return `2406376.3623`.
 
 ```js
-assert.strictEqual(euler389(), 2406376.3623);
+assert.strictEqual(platonicDice(), 2406376.3623);
 ```
 
 # --seed--
@@ -25,12 +33,12 @@ assert.strictEqual(euler389(), 2406376.3623);
 ## --seed-contents--
 
 ```js
-function euler389() {
+function platonicDice() {
 
   return true;
 }
 
-euler389();
+platonicDice();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-39-integer-right-triangles.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-39-integer-right-triangles.md
index d19bb816b7f..f1957262624 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-39-integer-right-triangles.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-39-integer-right-triangles.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3931000cf542c50fea6
 title: 'Problem 39: Integer right triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302054
 dashedName: problem-39-integer-right-triangles
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.md
index e582b23f2d7..fa9e6f08884 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.md
@@ -1,31 +1,29 @@
 ---
 id: 5900f4f21000cf542c510005
 title: 'Problem 390: Triangles with non rational sides and integral area'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302055
 dashedName: problem-390-triangles-with-non-rational-sides-and-integral-area
 ---
 
 # --description--
 
-Consider the triangle with sides √5, √65 and √68.
+Consider the triangle with sides $\sqrt{5}$, $\sqrt{65}$ and $\sqrt{68}$. It can be shown that this triangle has area 9.
 
-It can be shown that this triangle has area 9.
+$S(n)$ is the sum of the areas of all triangles with sides $\sqrt{1 + b^2}$, $\sqrt{1 + c^2}$ and $\sqrt{b^2 + c^2}$ (for positive integers $b$ and $c$) that have an integral area not exceeding $n$.
 
-S(n) is the sum of the areas of all triangles with sides √(1+b2), √(1+c2) and √(b2+c2) (for positive integers b and c ) that have an integral area not exceeding n.
+The example triangle has $b = 2$ and $c = 8$.
 
-The example triangle has b=2 and c=8.
+$S({10}^6) = 18\\,018\\,206$.
 
-S(106)=18018206.
-
-Find S(1010).
+Find $S({10}^{10})$.
 
 # --hints--
 
-`euler390()` should return 2919133642971.
+`nonRationalSidesAndIntegralArea()` should return `2919133642971`.
 
 ```js
-assert.strictEqual(euler390(), 2919133642971);
+assert.strictEqual(nonRationalSidesAndIntegralArea(), 2919133642971);
 ```
 
 # --seed--
@@ -33,12 +31,12 @@ assert.strictEqual(euler390(), 2919133642971);
 ## --seed-contents--
 
 ```js
-function euler390() {
+function nonRationalSidesAndIntegralArea() {
 
   return true;
 }
 
-euler390();
+nonRationalSidesAndIntegralArea();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-391-hopping-game.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-391-hopping-game.md
index 4eda36c0a45..e94e14e527b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-391-hopping-game.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-391-hopping-game.md
@@ -1,35 +1,42 @@
 ---
 id: 5900f4f31000cf542c510006
 title: 'Problem 391: Hopping Game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302056
 dashedName: problem-391-hopping-game
 ---
 
 # --description--
 
-Let sk be the number of 1’s when writing the numbers from 0 to k in binary.
+Let $s_k$ be the number of 1’s when writing the numbers from 0 to $k$ in binary.
 
-For example, writing 0 to 5 in binary, we have 0, 1, 10, 11, 100, 101. There are seven 1’s, so s5 = 7.
+For example, writing 0 to 5 in binary, we have 0, 1, 10, 11, 100, 101. There are seven 1’s, so $s_5 = 7$.
 
-The sequence S = {sk : k ≥ 0} starts {0, 1, 2, 4, 5, 7, 9, 12, ...}.
+The sequence $S = \\{s_k : k ≥ 0\\}$ starts $\\{0, 1, 2, 4, 5, 7, 9, 12, \ldots\\}$.
 
-A game is played by two players. Before the game starts, a number n is chosen. A counter c starts at 0. At each turn, the player chooses a number from 1 to n (inclusive) and increases c by that number. The resulting value of c must be a member of S. If there are no more valid moves, the player loses.
+A game is played by two players. Before the game starts, a number $n$ is chosen. A counter $c$ starts at 0. At each turn, the player chooses a number from 1 to $n$ (inclusive) and increases $c$ by that number. The resulting value of $c$ must be a member of $S$. If there are no more valid moves, the player loses.
 
-For example: Let n = 5. c starts at 0. Player 1 chooses 4, so c becomes 0 + 4 = 4. Player 2 chooses 5, so c becomes 4 + 5 = 9. Player 1 chooses 3, so c becomes 9 + 3 = 12. etc. Note that c must always belong to S, and each player can increase c by at most n.
+For example, with $n = 5$ and starting with $c = 0$:
 
-Let M(n) be the highest number the first player can choose at her first turn to force a win, and M(n) = 0 if there is no such move. For example, M(2) = 2, M(7) = 1 and M(20) = 4.
+- Player 1 chooses 4, so $c$ becomes $0 + 4 = 4$.
+- Player 2 chooses 5, so $c$ becomes $4 + 5 = 9$.
+- Player 1 chooses 3, so $c$ becomes $9 + 3 = 12$.
+- etc.
 
-Given Σ(M(n))3 = 8150 for 1 ≤ n ≤ 20.
+Note that $c$ must always belong to $S$, and each player can increase $c$ by at most $n$.
 
-Find Σ(M(n))3 for 1 ≤ n ≤ 1000.
+Let $M(n)$ be the highest number the first player can choose at her first turn to force a win, and $M(n) = 0$ if there is no such move. For example, $M(2) = 2$, $M(7) = 1$ and $M(20) = 4$.
+
+It can be verified $\sum M{(n)}^3 = 8150$ for $1 ≤ n ≤ 20$.
+
+Find $\sum M{(n)}^3$ for $1 ≤ n ≤ 1000$.
 
 # --hints--
 
-`euler391()` should return 61029882288.
+`hoppingGame()` should return `61029882288`.
 
 ```js
-assert.strictEqual(euler391(), 61029882288);
+assert.strictEqual(hoppingGame(), 61029882288);
 ```
 
 # --seed--
@@ -37,12 +44,12 @@ assert.strictEqual(euler391(), 61029882288);
 ## --seed-contents--
 
 ```js
-function euler391() {
+function hoppingGame() {
 
   return true;
 }
 
-euler391();
+hoppingGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md
index cd4d53f17da..7e40a574c29 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4f41000cf542c510007
 title: 'Problem 392: Enmeshed unit circle'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302057
 dashedName: problem-392-enmeshed-unit-circle
 ---
@@ -12,20 +12,30 @@ A rectilinear grid is an orthogonal grid where the spacing between the gridlines
 
 An example of such grid is logarithmic graph paper.
 
-Consider rectilinear grids in the Cartesian coordinate system with the following properties:The gridlines are parallel to the axes of the Cartesian coordinate system.There are N+2 vertical and N+2 horizontal gridlines. Hence there are (N+1) x (N+1) rectangular cells.The equations of the two outer vertical gridlines are x = -1 and x = 1.The equations of the two outer horizontal gridlines are y = -1 and y = 1.The grid cells are colored red if they overlap with the unit circle, black otherwise.For this problem we would like you to find the positions of the remaining N inner horizontal and N inner vertical gridlines so that the area occupied by the red cells is minimized.
+Consider rectilinear grids in the Cartesian coordinate system with the following properties:
 
-E.g. here is a picture of the solution for N = 10:
+- The gridlines are parallel to the axes of the Cartesian coordinate system.
+- There are $N + 2$ vertical and $N + 2$ horizontal gridlines. Hence there are $(N + 1) \times (N + 1)$ rectangular cells.
+- The equations of the two outer vertical gridlines are $x = -1$ and $x = 1$.
+- The equations of the two outer horizontal gridlines are $y = -1$ and $y = 1$.
+- The grid cells are colored red if they overlap with the unit circle, black otherwise.
 
-The area occupied by the red cells for N = 10 rounded to 10 digits behind the decimal point is 3.3469640797.
+For this problem we would like you to find the positions of the remaining $N$ inner horizontal and $N$ inner vertical gridlines so that the area occupied by the red cells is minimized.
 
-Find the positions for N = 400. Give as your answer the area occupied by the red cells rounded to 10 digits behind the decimal point.
+E.g. here is a picture of the solution for $N = 10$:
+
+<img class="img-responsive center-block" alt="solution for N = 10" src="https://cdn.freecodecamp.org/curriculum/project-euler/enmeshed-unit-circle.png" style="background-color: white; padding: 10px;" />
+
+The area occupied by the red cells for $N = 10$ rounded to 10 digits behind the decimal point is 3.3469640797.
+
+Find the positions for $N = 400$. Give as your answer the area occupied by the red cells rounded to 10 digits behind the decimal point.
 
 # --hints--
 
-`euler392()` should return 3.1486734435.
+`enmeshedUnitCircle()` should return `3.1486734435`.
 
 ```js
-assert.strictEqual(euler392(), 3.1486734435);
+assert.strictEqual(enmeshedUnitCircle(), 3.1486734435);
 ```
 
 # --seed--
@@ -33,12 +43,12 @@ assert.strictEqual(euler392(), 3.1486734435);
 ## --seed-contents--
 
 ```js
-function euler392() {
+function enmeshedUnitCircle() {
 
   return true;
 }
 
-euler392();
+enmeshedUnitCircle();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md
index 21f98ec10cc..28a0b4d745c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f4f61000cf542c510008
 title: 'Problem 393: Migrating ants'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302058
 dashedName: problem-393-migrating-ants
 ---
 
 # --description--
 
-An n×n grid of squares contains n2 ants, one ant per square.
+An $n × n$ grid of squares contains $n^2$ ants, one ant per square.
 
 All ants decide to move simultaneously to an adjacent square (usually 4 possibilities, except for ants on the edge of the grid or at the corners).
 
-We define f(n) to be the number of ways this can happen without any ants ending on the same square and without any two ants crossing the same edge between two squares.
+We define $f(n)$ to be the number of ways this can happen without any ants ending on the same square and without any two ants crossing the same edge between two squares.
 
-You are given that f(4) = 88. Find f(10).
+You are given that $f(4) = 88$.
+
+Find $f(10)$.
 
 # --hints--
 
-`euler393()` should return 112398351350823100.
+`migratingAnts()` should return `112398351350823100`.
 
 ```js
-assert.strictEqual(euler393(), 112398351350823100);
+assert.strictEqual(migratingAnts(), 112398351350823100);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler393(), 112398351350823100);
 ## --seed-contents--
 
 ```js
-function euler393() {
+function migratingAnts() {
 
   return true;
 }
 
-euler393();
+migratingAnts();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-394-eating-pie.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-394-eating-pie.md
index 26c7bce3a95..78c59fd56a6 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-394-eating-pie.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-394-eating-pie.md
@@ -1,35 +1,36 @@
 ---
 id: 5900f4f71000cf542c510009
-title: 'Problem 394: Eating pie'
-challengeType: 5
+title: '问题 394：吃馅饼'
+challengeType: 1
 forumTopicId: 302059
 dashedName: problem-394-eating-pie
 ---
 
 # --description--
 
-Jeff eats a pie in an unusual way.
+杰夫以一种不同寻常的方式吃馅饼。
 
-The pie is circular. He starts with slicing an initial cut in the pie along a radius.
+馅饼是圆形的。 他首先沿着半径切割馅饼中的初始切口。
 
-While there is at least a given fraction F of pie left, he performs the following procedure:
+While there is at least a given fraction $F$ of pie left, he performs the following procedure:
 
-\- He makes two slices from the pie centre to any point of what is remaining of the pie border, any point on the remaining pie border equally likely. This will divide the remaining pie into three pieces.
+- He makes two slices from the pie centre to any point of what is remaining of the pie border, any point on the remaining pie border equally likely. This will divide the remaining pie into three pieces.
+- Going counterclockwise from the initial cut, he takes the first two pie pieces and eats them.
 
-\- Going counterclockwise from the initial cut, he takes the first two pie pieces and eats them.
+When less than a fraction $F$ of pie remains, he does not repeat this procedure. Instead, he eats all of the remaining pie.
 
-When less than a fraction F of pie remains, he does not repeat this procedure. Instead, he eats all of the remaining pie.
+<img class="img-responsive center-block" alt="animation of pie slicing procedure" src="https://cdn.freecodecamp.org/curriculum/project-euler/eating-pie.gif" style="background-color: white; padding: 10px;" />
 
-For x ≥ 1, let E(x) be the expected number of times Jeff repeats the procedure above with F = 1/x. It can be verified that E(1) = 1, E(2) ≈ 1.2676536759, and E(7.5) ≈ 2.1215732071.
+For $x ≥ 1$, let $E(x)$ be the expected number of times Jeff repeats the procedure above with $F = \frac{1}{x}$. It can be verified that $E(1) = 1$, $E(2) ≈ 1.2676536759$, and $E(7.5) ≈ 2.1215732071$.
 
-Find E(40) rounded to 10 decimal places behind the decimal point.
+Find $E(40)$ rounded to 10 decimal places behind the decimal point.
 
 # --hints--
 
-`euler394()` should return 3.2370342194.
+`eatingPie()` should return `3.2370342194`.
 
 ```js
-assert.strictEqual(euler394(), 3.2370342194);
+assert.strictEqual(eatingPie(), 3.2370342194);
 ```
 
 # --seed--
@@ -37,12 +38,12 @@ assert.strictEqual(euler394(), 3.2370342194);
 ## --seed-contents--
 
 ```js
-function euler394() {
+function eatingPie() {
 
   return true;
 }
 
-euler394();
+eatingPie();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md
index 80903ac0ef5..cff705c06fb 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4f71000cf542c51000a
 title: 'Problem 395: Pythagorean tree'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302060
 dashedName: problem-395-pythagorean-tree
 ---
@@ -10,20 +10,26 @@ dashedName: problem-395-pythagorean-tree
 
 The Pythagorean tree is a fractal generated by the following procedure:
 
-Start with a unit square. Then, calling one of the sides its base (in the animation, the bottom side is the base): Attach a right triangle to the side opposite the base, with the hypotenuse coinciding with that side and with the sides in a 3-4-5 ratio. Note that the smaller side of the triangle must be on the 'right' side with respect to the base (see animation). Attach a square to each leg of the right triangle, with one of its sides coinciding with that leg. Repeat this procedure for both squares, considering as their bases the sides touching the triangle.
+Start with a unit square. Then, calling one of the sides its base (in the animation, the bottom side is the base):
+
+1. Attach a right triangle to the side opposite the base, with the hypotenuse coinciding with that side and with the sides in a 3-4-5 ratio. Note that the smaller side of the triangle must be on the 'right' side with respect to the base (see animation).
+2. Attach a square to each leg of the right triangle, with one of its sides coinciding with that leg.
+3. Repeat this procedure for both squares, considering as their bases the sides touching the triangle.
 
 The resulting figure, after an infinite number of iterations, is the Pythagorean tree.
 
+<img class="img-responsive center-block" alt="animation showing 8 iterations of the procedure" src="https://cdn.freecodecamp.org/curriculum/project-euler/pythagorean-tree.gif" style="background-color: white; padding: 10px;" />
+
 It can be shown that there exists at least one rectangle, whose sides are parallel to the largest square of the Pythagorean tree, which encloses the Pythagorean tree completely.
 
 Find the smallest area possible for such a bounding rectangle, and give your answer rounded to 10 decimal places.
 
 # --hints--
 
-`euler395()` should return 28.2453753155.
+`pythagoreanTree()` should return `28.2453753155`.
 
 ```js
-assert.strictEqual(euler395(), 28.2453753155);
+assert.strictEqual(pythagoreanTree(), 28.2453753155);
 ```
 
 # --seed--
@@ -31,12 +37,12 @@ assert.strictEqual(euler395(), 28.2453753155);
 ## --seed-contents--
 
 ```js
-function euler395() {
+function pythagoreanTree() {
 
   return true;
 }
 
-euler395();
+pythagoreanTree();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.md
index bb98b389ba5..33d738c128b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.md
@@ -1,37 +1,45 @@
 ---
 id: 5900f4f81000cf542c51000b
 title: 'Problem 396: Weak Goodstein sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302061
 dashedName: problem-396-weak-goodstein-sequence
 ---
 
 # --description--
 
-For any positive integer n, the nth weak Goodstein sequence {g1, g2, g3, ...} is defined as:
+For any positive integer $n$, the $n$th weak Goodstein sequence $\\{g1, g2, g3, \ldots\\}$ is defined as:
 
-g1 = n
+- $g_1 = n$
+- for $k > 1$, $g_k$ is obtained by writing $g_{k - 1}$ in base $k$, interpreting it as a base $k + 1$ number, and subtracting 1.
 
-for k > 1, gk is obtained by writing gk-1 in base k, interpreting it as a base k + 1 number, and subtracting 1.
+The sequence terminates when $g_k$ becomes 0.
 
-The sequence terminates when gk becomes 0.
+For example, the $6$th weak Goodstein sequence is $\\{6, 11, 17, 25, \ldots\\}$:
 
-For example, the 6th weak Goodstein sequence is {6, 11, 17, 25, ...}: g1 = 6. g2 = 11 since 6 = 1102, 1103 = 12, and 12 - 1 = 11. g3 = 17 since 11 = 1023, 1024 = 18, and 18 - 1 = 17. g4 = 25 since 17 = 1014, 1015 = 26, and 26 - 1 = 25.
+- $g_1 = 6$.
+- $g_2 = 11$ since $6 = 110_2$, $110_3 = 12$, and $12 - 1 = 11$.
+- $g_3 = 17$ since $11 = 102_3$, $102_4 = 18$, and $18 - 1 = 17$.
+- $g_4 = 25$ since $17 = 101_4$, $101_5 = 26$, and $26 - 1 = 25$.
 
 and so on.
 
 It can be shown that every weak Goodstein sequence terminates.
 
-Let G(n) be the number of nonzero elements in the nth weak Goodstein sequence. It can be verified that G(2) = 3, G(4) = 21 and G(6) = 381. It can also be verified that ΣG(n) = 2517 for 1 ≤ n &lt; 8.
+Let $G(n)$ be the number of nonzero elements in the $n$th weak Goodstein sequence.
 
-Find the last 9 digits of ΣG(n) for 1 ≤ n &lt; 16.
+It can be verified that $G(2) = 3$, $G(4) = 21$ and $G(6) = 381$.
+
+It can also be verified that $\sum G(n) = 2517$ for $1 ≤ n &lt; 8$.
+
+Find the last 9 digits of $\sum G(n)$ for $1 ≤ n &lt; 16$.
 
 # --hints--
 
-`euler396()` should return 173214653.
+`weakGoodsteinSequence()` should return `173214653`.
 
 ```js
-assert.strictEqual(euler396(), 173214653);
+assert.strictEqual(weakGoodsteinSequence(), 173214653);
 ```
 
 # --seed--
@@ -39,12 +47,12 @@ assert.strictEqual(euler396(), 173214653);
 ## --seed-contents--
 
 ```js
-function euler396() {
+function weakGoodsteinSequence() {
 
   return true;
 }
 
-euler396();
+weakGoodsteinSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.md
index d8d95c2dd3a..2d9fc181db3 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.md
@@ -1,25 +1,27 @@
 ---
 id: 5900f4f91000cf542c51000c
 title: 'Problem 397: Triangle on parabola'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302062
 dashedName: problem-397-triangle-on-parabola
 ---
 
 # --description--
 
-On the parabola y = x2/k, three points A(a, a2/k), B(b, b2/k) and C(c, c2/k) are chosen.
+On the parabola $y = \frac{x^2}{k}$, three points $A(a, \frac{a^2}{k})$, $B(b, \frac{b^2}{k})$ and $C(c, \frac{c^2}{k})$ are chosen.
 
-Let F(K, X) be the number of the integer quadruplets (k, a, b, c) such that at least one angle of the triangle ABC is 45-degree, with 1 ≤ k ≤ K and -X ≤ a &lt; b &lt; c ≤ X.
+Let $F(K, X)$ be the number of the integer quadruplets $(k, a, b, c)$ such that at least one angle of the triangle $ABC$ is 45°, with $1 ≤ k ≤ K$ and $-X ≤ a &lt; b &lt; c ≤ X$.
 
-For example, F(1, 10) = 41 and F(10, 100) = 12492. Find F(106, 109).
+For example, $F(1, 10) = 41$ and $F(10, 100) = 12\\,492$.
+
+Find $F({10}^6, {10}^9)$.
 
 # --hints--
 
-`euler397()` should return 141630459461893730.
+`triangleOnParabola()` should return `141630459461893730`.
 
 ```js
-assert.strictEqual(euler397(), 141630459461893730);
+assert.strictEqual(triangleOnParabola(), 141630459461893730);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler397(), 141630459461893730);
 ## --seed-contents--
 
 ```js
-function euler397() {
+function triangleOnParabola() {
 
   return true;
 }
 
-euler397();
+triangleOnParabola();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-398-cutting-rope.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-398-cutting-rope.md
index 4b145fdfbc2..ade33707928 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-398-cutting-rope.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-398-cutting-rope.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4fa1000cf542c51000d
 title: 'Problem 398: Cutting rope'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302063
 dashedName: problem-398-cutting-rope
 ---
 
 # --description--
 
-Inside a rope of length n, n-1 points are placed with distance 1 from each other and from the endpoints. Among these points, we choose m-1 points at random and cut the rope at these points to create m segments.
+Inside a rope of length $n$, $n - 1$ points are placed with distance 1 from each other and from the endpoints. Among these points, we choose $m - 1$ points at random and cut the rope at these points to create $m$ segments.
 
-Let E(n, m) be the expected length of the second-shortest segment. For example, E(3, 2) = 2 and E(8, 3) = 16/7. Note that if multiple segments have the same shortest length the length of the second-shortest segment is defined as the same as the shortest length.
+Let $E(n, m)$ be the expected length of the second-shortest segment. For example, $E(3, 2) = 2$ and $E(8, 3) = \frac{16}{7}$. Note that if multiple segments have the same shortest length the length of the second-shortest segment is defined as the same as the shortest length.
 
-Find E(107, 100). Give your answer rounded to 5 decimal places behind the decimal point.
+Find $E({10}^7, 100)$. Give your answer rounded to 5 decimal places behind the decimal point.
 
 # --hints--
 
-`euler398()` should return 2010.59096.
+`cuttingRope()` should return `2010.59096`.
 
 ```js
-assert.strictEqual(euler398(), 2010.59096);
+assert.strictEqual(cuttingRope(), 2010.59096);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler398(), 2010.59096);
 ## --seed-contents--
 
 ```js
-function euler398() {
+function cuttingRope() {
 
   return true;
 }
 
-euler398();
+cuttingRope();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.md
index b61d13a3365..4d2262f3a1a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.md
@@ -1,37 +1,43 @@
 ---
 id: 5900f4fc1000cf542c51000e
-title: 'Problem 399: Squarefree Fibonacci Numbers'
-challengeType: 5
+title: '问题 399：Squarefree 斐波那契数列'
+challengeType: 1
 forumTopicId: 302064
 dashedName: problem-399-squarefree-fibonacci-numbers
 ---
 
 # --description--
 
-The first 15 fibonacci numbers are:
+前 15 个斐波那契数是：
 
-1,1,2,3,5,8,13,21,34,55,89,144,233,377,610.
+$$1,1,2,3,5,8,13,21,34,55,89,144,233,377,610.$$
 
 It can be seen that 8 and 144 are not squarefree: 8 is divisible by 4 and 144 is divisible by 4 and by 9.
 
 So the first 13 squarefree fibonacci numbers are:
 
-1,1,2,3,5,13,21,34,55,89,233,377 and 610.
+$$1,1,2,3,5,13,21,34,55,89,233,377 \text{ and } 610.$$
 
-The 200th squarefree fibonacci number is: 971183874599339129547649988289594072811608739584170445. The last sixteen digits of this number are: 1608739584170445 and in scientific notation this number can be written as 9.7e53.
+The $200$th squarefree fibonacci number is: 971183874599339129547649988289594072811608739584170445. The last sixteen digits of this number are: 1608739584170445 and in scientific notation this number can be written as `9.7e53`.
 
-Find the 100 000 000th squarefree fibonacci number. Give as your answer its last sixteen digits followed by a comma followed by the number in scientific notation (rounded to one digit after the decimal point). For the 200th squarefree number the answer would have been: 1608739584170445,9.7e53
+Find the $100\\,000\\,000$th squarefree fibonacci number. Give as your answer as a string with its last sixteen digits followed by a comma followed by the number in scientific notation (rounded to one digit after the decimal point). For the $200$th squarefree number the answer would have been: `1608739584170445,9.7e53`
 
-Note: For this problem, assume that for every prime p, the first fibonacci number divisible by p is not divisible by p2 (this is part of Wall's conjecture). This has been verified for primes ≤ 3·1015, but has not been proven in general.
+**Note:** For this problem, assume that for every prime $p$, the first fibonacci number divisible by $p$ is not divisible by $p^2$ (this is part of Wall's conjecture). This has been verified for primes $≤ 3 \times {10}^{15}$, but has not been proven in general.
 
-If it happens that the conjecture is false, then the accepted answer to this problem isn't guaranteed to be the 100 000 000th squarefree fibonacci number, rather it represents only a lower bound for that number.
+If it happens that the conjecture is false, then the accepted answer to this problem isn't guaranteed to be the $100\\,000\\,000$th squarefree fibonacci number, rather it represents only a lower bound for that number.
 
 # --hints--
 
-`euler399()` should return 1508395636674243, 6.5e27330467.
+`squarefreeFibonacciNumbers()` should return a string.
 
 ```js
-assert.strictEqual(euler399(), 1508395636674243, 6.5e27330467);
+assert(typeof squarefreeFibonacciNumbers() === 'string');
+```
+
+`squarefreeFibonacciNumbers()` should return the string `1508395636674243,6.5e27330467`.
+
+```js
+assert.strictEqual(squarefreeFibonacciNumbers(), '1508395636674243,6.5e27330467');
 ```
 
 # --seed--
@@ -39,12 +45,12 @@ assert.strictEqual(euler399(), 1508395636674243, 6.5e27330467);
 ## --seed-contents--
 
 ```js
-function euler399() {
+function squarefreeFibonacciNumbers() {
 
   return true;
 }
 
-euler399();
+squarefreeFibonacciNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-4-largest-palindrome-product.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-4-largest-palindrome-product.md
index 34dbf96399d..f15f324f27e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-4-largest-palindrome-product.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-4-largest-palindrome-product.md
@@ -1,32 +1,32 @@
 ---
 id: 5900f3701000cf542c50fe83
-title: 'Problem 4: Largest palindrome product'
-challengeType: 5
+title: '问题 4：最大的回文积'
+challengeType: 1
 forumTopicId: 302065
 dashedName: problem-4-largest-palindrome-product
 ---
 
 # --description--
 
-A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.
+回文数字左右两种方式读取相同。 The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.
 
 Find the largest palindrome made from the product of two `n`-digit numbers.
 
 # --hints--
 
-`largestPalindromeProduct(2)` should return a number.
+`largestPalindromeProduct(2)` 应该返回一个数字。
 
 ```js
 assert(typeof largestPalindromeProduct(2) === 'number');
 ```
 
-`largestPalindromeProduct(2)` should return 9009.
+`largestPalindromeProduct(2)` 应返回 9009。
 
 ```js
 assert.strictEqual(largestPalindromeProduct(2), 9009);
 ```
 
-`largestPalindromeProduct(3)` should return 906609.
+`largestPalindromeProduct(3)` 应返回 906609。
 
 ```js
 assert.strictEqual(largestPalindromeProduct(3), 906609);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-40-champernownes-constant.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-40-champernownes-constant.md
index f7f6c8f51fb..c4386bd2d91 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-40-champernownes-constant.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-40-champernownes-constant.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3941000cf542c50fea7
 title: 'Problem 40: Champernowne''s constant'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302066
 dashedName: problem-40-champernownes-constant
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md
index 07e767a5ba6..2b2e220949c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md
@@ -1,35 +1,37 @@
 ---
 id: 5900f4fe1000cf542c510010
 title: 'Problem 400: Fibonacci tree game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302067
 dashedName: problem-400-fibonacci-tree-game
 ---
 
 # --description--
 
-A Fibonacci tree is a binary tree recursively defined as:T(0) is the empty tree.
+A Fibonacci tree is a binary tree recursively defined as:
 
-T(1) is the binary tree with only one node.
-
-T(k) consists of a root node that has T(k-1) and T(k-2) as children.
+- $T(0)$ is the empty tree.
+- $T(1)$ is the binary tree with only one node.
+- $T(k)$ consists of a root node that has $T(k - 1)$ and $T(k - 2)$ as children.
 
 On such a tree two players play a take-away game. On each turn a player selects a node and removes that node along with the subtree rooted at that node. The player who is forced to take the root node of the entire tree loses.
 
-Here are the winning moves of the first player on the first turn for T(k) from k=1 to k=6.
+Here are the winning moves of the first player on the first turn for $T(k)$ from $k = 1$ to $k = 6$.
 
-Let f(k) be the number of winning moves of the first player (i.e. the moves for which the second player has no winning strategy) on the first turn of the game when this game is played on T(k).
+<img class="img-responsive center-block" alt="winning moves of first player, on the first turn for k = 1 to k = 6" src="https://cdn.freecodecamp.org/curriculum/project-euler/fibonacci-tree-game.png" style="background-color: white; padding: 10px;" />
 
-For example, f(5) = 1 and f(10) = 17.
+Let $f(k)$ be the number of winning moves of the first player (i.e. the moves for which the second player has no winning strategy) on the first turn of the game when this game is played on $T(k)$.
 
-Find f(10000). Give the last 18 digits of your answer.
+For example, $f(5) = 1$ and $f(10) = 17$.
+
+Find $f(10000)$. Give the last 18 digits of your answer.
 
 # --hints--
 
-`euler400()` should return 438505383468410600.
+`fibonacciTreeGame()` should return `438505383468410600`.
 
 ```js
-assert.strictEqual(euler400(), 438505383468410600);
+assert.strictEqual(fibonacciTreeGame(), 438505383468410600);
 ```
 
 # --seed--
@@ -37,12 +39,12 @@ assert.strictEqual(euler400(), 438505383468410600);
 ## --seed-contents--
 
 ```js
-function euler400() {
+function fibonacciTreeGame() {
 
   return true;
 }
 
-euler400();
+fibonacciTreeGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.md
index d1c5ca48cc8..eb0c0459100 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f4fd1000cf542c51000f
 title: 'Problem 401: Sum of squares of divisors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302069
 dashedName: problem-401-sum-of-squares-of-divisors
 ---
 
 # --description--
 
-The divisors of 6 are 1,2,3 and 6.
+The divisors of 6 are 1, 2, 3 and 6.
 
-The sum of the squares of these numbers is 1+4+9+36=50.
+The sum of the squares of these numbers is $1 + 4 + 9 + 36 = 50$.
 
-Let sigma2(n) represent the sum of the squares of the divisors of n. Thus sigma2(6)=50.
+Let $\sigma_2(n)$ represent the sum of the squares of the divisors of $n$. Thus $\sigma_2(6) = 50$.
 
-Let SIGMA2 represent the summatory function of sigma2, that is SIGMA2(n)=∑sigma2(i) for i=1 to n. The first 6 values of SIGMA2 are: 1,6,16,37,63 and 113.
+Let $\Sigma_2$ represent the summatory function of $\sigma_2$, that is $\Sigma_2(n) = \sum \sigma_2(i)$ for $i=1$ to $n$. The first 6 values of $\Sigma_2$ are: 1, 6, 16, 37, 63 and 113.
 
-Find SIGMA2(1015) modulo 109.
+Find $\Sigma_2({10}^{15})$ modulo ${10}^9$.
 
 # --hints--
 
-`euler401()` should return 281632621.
+`sumOfSquaresDivisors()` should return `281632621`.
 
 ```js
-assert.strictEqual(euler401(), 281632621);
+assert.strictEqual(sumOfSquaresDivisors(), 281632621);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler401(), 281632621);
 ## --seed-contents--
 
 ```js
-function euler401() {
+function sumOfSquaresDivisors() {
 
   return true;
 }
 
-euler401();
+sumOfSquaresDivisors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.md
index b4c4a63fe8d..cdda26ea631 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.md
@@ -1,31 +1,34 @@
 ---
 id: 5900f4ff1000cf542c510011
 title: 'Problem 402: Integer-valued polynomials'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302070
 dashedName: problem-402-integer-valued-polynomials
 ---
 
 # --description--
 
-It can be shown that the polynomial n4 + 4n3 + 2n2 + 5n is a multiple of 6 for every integer n. It can also be shown that 6 is the largest integer satisfying this property.
+It can be shown that the polynomial $n^4 + 4n^3 + 2n^2 + 5n$ is a multiple of 6 for every integer $n$. It can also be shown that 6 is the largest integer satisfying this property.
 
-Define M(a, b, c) as the maximum m such that n4 + an3 + bn2 + cn is a multiple of m for all integers n. For example, M(4, 2, 5) = 6.
+Define $M(a, b, c)$ as the maximum $m$ such that $n^4 + an^3 + bn^2 + cn$ is a multiple of $m$ for all integers $n$. For example, $M(4, 2, 5) = 6$.
 
-Also, define S(N) as the sum of M(a, b, c) for all 0 &lt; a, b, c ≤ N.
+Also, define $S(N)$ as the sum of $M(a, b, c)$ for all $0 &lt; a, b, c ≤ N$.
 
-We can verify that S(10) = 1972 and S(10000) = 2024258331114.
+We can verify that $S(10) = 1\\,972$ and $S(10\\,000) = 2\\,024\\,258\\,331\\,114$.
 
-Let Fk be the Fibonacci sequence: F0 = 0, F1 = 1 and Fk = Fk-1 + Fk-2 for k ≥ 2.
+Let $F_k$ be the Fibonacci sequence:
 
-Find the last 9 digits of Σ S(Fk) for 2 ≤ k ≤ 1234567890123.
+- $F_0 = 0$, $F_1 = 1$ and
+- $F_k = F_{k - 1} + F_{k - 2}$ for $k ≥ 2$.
+
+Find the last 9 digits of $\sum S(F_k)$ for $2 ≤ k ≤ 1\\,234\\,567\\,890\\,123$.
 
 # --hints--
 
-`euler402()` should return 356019862.
+`integerValuedPolynomials()` should return `356019862`.
 
 ```js
-assert.strictEqual(euler402(), 356019862);
+assert.strictEqual(integerValuedPolynomials(), 356019862);
 ```
 
 # --seed--
@@ -33,12 +36,12 @@ assert.strictEqual(euler402(), 356019862);
 ## --seed-contents--
 
 ```js
-function euler402() {
+function integerValuedPolynomials() {
 
   return true;
 }
 
-euler402();
+integerValuedPolynomials();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.md
index d854a56f4ac..e3f8bfaae35 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f5001000cf542c510013
 title: 'Problem 403: Lattice points enclosed by parabola and line'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302071
 dashedName: problem-403-lattice-points-enclosed-by-parabola-and-line
 ---
 
 # --description--
 
-For integers a and b, we define D(a, b) as the domain enclosed by the parabola y = x2 and the line y = a·x + b:D(a, b) = { (x, y) | x2 ≤ y ≤ a·x + b }.
+For integers $a$ and $b$, we define $D(a, b)$ as the domain enclosed by the parabola $y = x^2$ and the line $y = ax + b: D(a, b) = \\{ (x, y) | x^2 ≤ y ≤ ax + b \\}$.
 
-L(a, b) is defined as the number of lattice points contained in D(a, b). For example, L(1, 2) = 8 and L(2, -1) = 1.
+$L(a, b)$ is defined as the number of lattice points contained in $D(a, b)$. For example, $L(1, 2) = 8$ and $L(2, -1) = 1$.
 
-We also define S(N) as the sum of L(a, b) for all the pairs (a, b) such that the area of D(a, b) is a rational number and |a|,|b| ≤ N. We can verify that S(5) = 344 and S(100) = 26709528.
+We also define $S(N)$ as the sum of $L(a, b)$ for all the pairs ($a$, $b$) such that the area of $D(a, b)$ is a rational number and $|a|,|b| ≤ N$.
 
-Find S(1012). Give your answer mod 108.
+We can verify that $S(5) = 344$ and $S(100) = 26\\,709\\,528$.
+
+Find $S({10}^{12})$. Give your answer $\bmod {10}^8$.
 
 # --hints--
 
-`euler403()` should return 18224771.
+`latticePoints()` should return `18224771`.
 
 ```js
-assert.strictEqual(euler403(), 18224771);
+assert.strictEqual(latticePoints(), 18224771);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler403(), 18224771);
 ## --seed-contents--
 
 ```js
-function euler403() {
+function latticePoints() {
 
   return true;
 }
 
-euler403();
+latticePoints();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md
index 6b7341cea49..5fe94f1e69c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md
@@ -1,29 +1,37 @@
 ---
 id: 5900f5001000cf542c510012
-title: 'Problem 404: Crisscross Ellipses'
-challengeType: 5
+title: '问题 404：交叉椭圆'
+challengeType: 1
 forumTopicId: 302072
 dashedName: problem-404-crisscross-ellipses
 ---
 
 # --description--
 
-Ea is an ellipse with an equation of the form x2 + 4y2 = 4a2.
+$E_a$ is an ellipse with an equation of the form $x^2 + 4y^2 = 4a^2$.
 
-Ea' is the rotated image of Ea by θ degrees counterclockwise around the origin O(0, 0) for 0° &lt; θ &lt; 90°.
+$E_a'$ is the rotated image of $E_a$ by $θ$ degrees counterclockwise around the origin $O(0, 0)$ for $0° &lt; θ &lt; 90°$.
 
-b is the distance to the origin of the two intersection points closest to the origin and c is the distance of the two other intersection points. We call an ordered triplet (a, b, c) a canonical ellipsoidal triplet if a, b and c are positive integers. For example, (209, 247, 286) is a canonical ellipsoidal triplet.
+<img class="img-responsive center-block" alt="ellipse E_a and ellipse rotated by θ degrees E_a'" src="https://cdn.freecodecamp.org/curriculum/project-euler/crisscross-ellipses.gif" style="background-color: white; padding: 10px;" />
 
-Let C(N) be the number of distinct canonical ellipsoidal triplets (a, b, c) for a ≤ N. It can be verified that C(103) = 7, C(104) = 106 and C(106) = 11845.
+$b$ is the distance to the origin of the two intersection points closest to the origin and $c$ is the distance of the two other intersection points.
 
-Find C(1017).
+We call an ordered triplet ($a$, $b$, $c$) a canonical ellipsoidal triplet if $a$, $b$ and $c$ are positive integers.
+
+For example, (209, 247, 286) is a canonical ellipsoidal triplet.
+
+Let $C(N)$ be the number of distinct canonical ellipsoidal triplets ($a$, $b$, $c$) for $a ≤ N$.
+
+It can be verified that $C({10}^3) = 7$, $C({10}^4) = 106$ and $C({10}^6) = 11\\,845$.
+
+Find $C({10}^{17})$.
 
 # --hints--
 
-`euler404()` should return 1199215615081353.
+`crisscrossEllipses()` should return `1199215615081353`.
 
 ```js
-assert.strictEqual(euler404(), 1199215615081353);
+assert.strictEqual(crisscrossEllipses(), 1199215615081353);
 ```
 
 # --seed--
@@ -31,12 +39,12 @@ assert.strictEqual(euler404(), 1199215615081353);
 ## --seed-contents--
 
 ```js
-function euler404() {
+function crisscrossEllipses() {
 
   return true;
 }
 
-euler404();
+crisscrossEllipses();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md
index 87f1f0c28f1..43ceb097a66 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5021000cf542c510014
 title: 'Problem 405: A rectangular tiling'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302073
 dashedName: problem-405-a-rectangular-tiling
 ---
@@ -10,22 +10,26 @@ dashedName: problem-405-a-rectangular-tiling
 
 We wish to tile a rectangle whose length is twice its width.
 
-Let T(0) be the tiling consisting of a single rectangle.
+Let $T(0)$ be the tiling consisting of a single rectangle.
 
-For n > 0, let T(n) be obtained from T(n-1) by replacing all tiles in the following manner:
+For $n > 0$, let $T(n)$ be obtained from $T( n- 1)$ by replacing all tiles in the following manner:
 
-The following animation demonstrates the tilings T(n) for n from 0 to 5:
+<img class="img-responsive center-block" alt="obtaining T(n) from T(n - 1)" src="https://cdn.freecodecamp.org/curriculum/project-euler/a-rectangular-tiling-1.png" style="background-color: white; padding: 10px;" />
 
-Let f(n) be the number of points where four tiles meet in T(n). For example, f(1) = 0, f(4) = 82 and f(109) mod 177 = 126897180.
+The following animation demonstrates the tilings $T(n)$ for $n$ from 0 to 5:
 
-Find f(10k) for k = 1018, give your answer modulo 177.
+<img class="img-responsive center-block" alt="animation with tilings T(n) for n from 0 to 5" src="https://cdn.freecodecamp.org/curriculum/project-euler/a-rectangular-tiling-2.gif" style="background-color: white; padding: 10px;" />
+
+Let $f(n)$ be the number of points where four tiles meet in $T(n)$. For example, $f(1) = 0$, $f(4) = 82$ and $f({10}^9)\bmod {17}^7 = 126\\,897\\,180$.
+
+Find $f({10}^k)$ for $k = {10}^{18}$, give your answer modulo ${17}^7$.
 
 # --hints--
 
-`euler405()` should return 237696125.
+`rectangularTiling()` should return `237696125`.
 
 ```js
-assert.strictEqual(euler405(), 237696125);
+assert.strictEqual(rectangularTiling(), 237696125);
 ```
 
 # --seed--
@@ -33,12 +37,12 @@ assert.strictEqual(euler405(), 237696125);
 ## --seed-contents--
 
 ```js
-function euler405() {
+function rectangularTiling() {
 
   return true;
 }
 
-euler405();
+rectangularTiling();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-406-guessing-game.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-406-guessing-game.md
index fd6535eb66d..6907ad6dae2 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-406-guessing-game.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-406-guessing-game.md
@@ -1,39 +1,51 @@
 ---
 id: 5900f5021000cf542c510015
 title: 'Problem 406: Guessing Game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302074
 dashedName: problem-406-guessing-game
 ---
 
 # --description--
 
-We are trying to find a hidden number selected from the set of integers {1, 2, ..., n} by asking questions.
+We are trying to find a hidden number selected from the set of integers {1, 2, ..., $n$} by asking questions. Each number (question) we ask, we get one of three possible answers:
 
-Each number (question) we ask, we get one of three possible answers: "Your guess is lower than the hidden number" (and you incur a cost of a), or
+- "Your guess is lower than the hidden number" (and you incur a cost of a), or
+- "Your guess is higher than the hidden number" (and you incur a cost of b), or
+- "Yes, that's it!" (and the game ends).
 
-"Your guess is higher than the hidden number" (and you incur a cost of b), or
+Given the value of $n$, $a$, and $b$, an optimal strategy minimizes the total cost <u>for the worst possible case</u>.
 
-"Yes, that's it!" (and the game ends).
+For example, if $n = 5$, $a = 2$, and $b = 3$, then we may begin by asking "<strong>2</strong>" as our first question.
 
-Given the value of n, a, and b, an optimal strategy minimizes the total cost for the worst possible case.
+If we are told that 2 is higher than the hidden number (for a cost of $b = 3$), then we are sure that "<strong>1</strong>" is the hidden number (for a total cost of <strong><span style="color: blue;">3</span></strong>).
 
-For example, if n = 5, a = 2, and b = 3, then we may begin by asking "2" as our first question.
+If we are told that 2 is lower than the hidden number (for a cost of $a = 2$), then our next question will be "<strong>4</strong>".
 
-If we are told that 2 is higher than the hidden number (for a cost of b=3), then we are sure that "1" is the hidden number (for a total cost of 3). If we are told that 2 is lower than the hidden number (for a cost of a=2), then our next question will be "4". If we are told that 4 is higher than the hidden number (for a cost of b=3), then we are sure that "3" is the hidden number (for a total cost of 2+3=5). If we are told that 4 is lower than the hidden number (for a cost of a=2), then we are sure that "5" is the hidden number (for a total cost of 2+2=4). Thus, the worst-case cost achieved by this strategy is 5. It can also be shown that this is the lowest worst-case cost that can be achieved. So, in fact, we have just described an optimal strategy for the given values of n, a, and b.
+If we are told that 4 is higher than the hidden number (for a cost of $b = 3$), then we are sure that "<strong>3</strong>" is the hidden number (for a total cost of $2 + 3 = \color{blue}{\mathbf{5}}$).
 
-Let C(n, a, b) be the worst-case cost achieved by an optimal strategy for the given values of n, a, and b.
+If we are told that 4 is lower than the hidden number (for a cost of $a = 2$), then we are sure that "<strong>5</strong>" is the hidden number (for a total cost of $2 + 2 = \color{blue}{\mathbf{4}}$).
 
-Here are a few examples: C(5, 2, 3) = 5 C(500, √2, √3) = 13.22073197... C(20000, 5, 7) = 82 C(2000000, √5, √7) = 49.63755955...
+Thus, the worst-case cost achieved by this strategy is <strong><span style="color: red">5</span></strong>. It can also be shown that this is the lowest worst-case cost that can be achieved. So, in fact, we have just described an optimal strategy for the given values of $n$, $a$, and $b$.
 
-Let Fk be the Fibonacci numbers: Fk = Fk-1 + Fk-2 with base cases F1 = F2 = 1.Find ∑1≤k≤30 C(1012, √k, √Fk), and give your answer rounded to 8 decimal places behind the decimal point.
+Let $C(n, a, b)$ be the worst-case cost achieved by an optimal strategy for the given values of $n$, $a$, and $b$.
+
+Here are a few examples:
+
+$$\begin{align}   & C(5, 2, 3) = 5 \\\\
+  & C(500, \sqrt{2}, \sqrt{3}) = 13.220\\,731\\,97\ldots \\\\   & C(20\\,000, 5, 7) = 82 \\\\
+  & C(2\\,000\\,000, √5, √7) = 49.637\\,559\\,55\ldots \\\\ \end{align}$$
+
+Let $F_k$ be the Fibonacci numbers: $F_k = F_{k - 1} + F_{k - 2}$ with base cases $F_1 = F_2 = 1$.
+
+Find $\displaystyle\sum_{k = 1}^{30} C({10}^{12}, \sqrt{k}, \sqrt{F_k})$, and give your answer rounded to 8 decimal places behind the decimal point.
 
 # --hints--
 
-`euler406()` should return 36813.12757207.
+`guessingGame()` should return `36813.12757207`.
 
 ```js
-assert.strictEqual(euler406(), 36813.12757207);
+assert.strictEqual(guessingGame(), 36813.12757207);
 ```
 
 # --seed--
@@ -41,12 +53,12 @@ assert.strictEqual(euler406(), 36813.12757207);
 ## --seed-contents--
 
 ```js
-function euler406() {
+function guessingGame() {
 
   return true;
 }
 
-euler406();
+guessingGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-407-idempotents.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-407-idempotents.md
index eb473f7ba0b..f676b0c5b6e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-407-idempotents.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-407-idempotents.md
@@ -1,25 +1,27 @@
 ---
 id: 5900f5041000cf542c510016
 title: 'Problem 407: Idempotents'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302075
 dashedName: problem-407-idempotents
 ---
 
 # --description--
 
-If we calculate a2 mod 6 for 0 ≤ a ≤ 5 we get: 0,1,4,3,4,1.
+If we calculate $a^2\bmod 6$ for $0 ≤ a ≤ 5$ we get: 0, 1, 4, 3, 4, 1.
 
-The largest value of a such that a2 ≡ a mod 6 is 4. Let's call M(n) the largest value of a &lt; n such that a2 ≡ a (mod n). So M(6) = 4.
+The largest value of a such that $a^2 ≡ a\bmod 6$ is $4$.
 
-Find ∑M(n) for 1 ≤ n ≤ 107.
+Let's call $M(n)$ the largest value of $a &lt; n$ such that $a^2 ≡ a (\text{mod } n)$. So $M(6) = 4$.
+
+Find $\sum M(n)$ for $1 ≤ n ≤ {10}^7$.
 
 # --hints--
 
-`euler407()` should return 39782849136421.
+`idempotents()` should return `39782849136421`.
 
 ```js
-assert.strictEqual(euler407(), 39782849136421);
+assert.strictEqual(idempotents(), 39782849136421);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler407(), 39782849136421);
 ## --seed-contents--
 
 ```js
-function euler407() {
+function idempotents() {
 
   return true;
 }
 
-euler407();
+idempotents();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.md
index 0c3decbbe7c..260a1917a56 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f5091000cf542c51001b
 title: 'Problem 408: Admissible paths through a grid'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302076
 dashedName: problem-408-admissible-paths-through-a-grid
 ---
 
 # --description--
 
-Let's call a lattice point (x, y) inadmissible if x, y and x + y are all positive perfect squares.
+Let's call a lattice point ($x$, $y$) inadmissible if $x$, $y$ and $x + y$ are all positive perfect squares.
 
 For example, (9, 16) is inadmissible, while (0, 4), (3, 1) and (9, 4) are not.
 
-Consider a path from point (x1, y1) to point (x2, y2) using only unit steps north or east. Let's call such a path admissible if none of its intermediate points are inadmissible.
+Consider a path from point ($x_1$, $y_1$) to point ($x_2$, $y_2$) using only unit steps north or east. Let's call such a path admissible if none of its intermediate points are inadmissible.
 
-Let P(n) be the number of admissible paths from (0, 0) to (n, n). It can be verified that P(5) = 252, P(16) = 596994440 and P(1000) mod 1 000 000 007 = 341920854.
+Let $P(n)$ be the number of admissible paths from (0, 0) to ($n$, $n$). It can be verified that $P(5) = 252$, $P(16) = 596\\,994\\,440$ and $P(1\\,000)\bmod 1\\,000\\,000\\,007 = 341\\,920\\,854$.
 
-Find P(10 000 000) mod 1 000 000 007.
+Find $P(10\\,000\\,000)\bmod 1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler408()` should return 299742733.
+`admissiblePaths()` should return `299742733`.
 
 ```js
-assert.strictEqual(euler408(), 299742733);
+assert.strictEqual(admissiblePaths(), 299742733);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler408(), 299742733);
 ## --seed-contents--
 
 ```js
-function euler408() {
+function admissiblePaths() {
 
   return true;
 }
 
-euler408();
+admissiblePaths();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-409-nim-extreme.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-409-nim-extreme.md
index d6dbeffce98..735a1c77781 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-409-nim-extreme.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-409-nim-extreme.md
@@ -1,31 +1,31 @@
 ---
 id: 5900f5061000cf542c510017
 title: 'Problem 409: Nim Extreme'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302077
 dashedName: problem-409-nim-extreme
 ---
 
 # --description--
 
-Let n be a positive integer. Consider nim positions where:There are n non-empty piles.
+Let $n$ be a positive integer. Consider nim positions where:
 
-Each pile has size less than 2n.
+- There are $n$ non-empty piles.
+- Each pile has size less than $2^n$.
+- No two piles have the same size.
 
-No two piles have the same size.
+Let $W(n)$ be the number of winning nim positions satisfying the above conditions (a position is winning if the first player has a winning strategy).
 
-Let W(n) be the number of winning nim positions satisfying the above
+For example, $W(1) = 1$, $W(2) = 6$, $W(3) = 168$, $W(5) = 19\\,764\\,360$ and $W(100)\bmod 1\\,000\\,000\\,007 = 384\\,777\\,056$.
 
-conditions (a position is winning if the first player has a winning strategy). For example, W(1) = 1, W(2) = 6, W(3) = 168, W(5) = 19764360 and W(100) mod 1 000 000 007 = 384777056.
-
-Find W(10 000 000) mod 1 000 000 007.
+Find $W(10\\,000\\,000)\bmod 1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler409()` should return 253223948.
+`nimExtreme()` should return `253223948`.
 
 ```js
-assert.strictEqual(euler409(), 253223948);
+assert.strictEqual(nimExtreme(), 253223948);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler409(), 253223948);
 ## --seed-contents--
 
 ```js
-function euler409() {
+function nimExtreme() {
 
   return true;
 }
 
-euler409();
+nimExtreme();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-41-pandigital-prime.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-41-pandigital-prime.md
index 41465478fc3..a774fa31167 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-41-pandigital-prime.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-41-pandigital-prime.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3951000cf542c50fea8
 title: 'Problem 41: Pandigital prime'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302078
 dashedName: problem-41-pandigital-prime
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.md
index cd55b71cbc0..fd9d28a1bab 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f5071000cf542c510018
 title: 'Problem 410: Circle and tangent line'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302079
 dashedName: problem-410-circle-and-tangent-line
 ---
 
 # --description--
 
-Let C be the circle with radius r, x2 + y2 = r2. We choose two points P(a, b) and Q(-a, c) so that the line passing through P and Q is tangent to C.
+Let $C$ be the circle with radius $r$, $x^2 + y^2 = r^2$. We choose two points $P(a, b)$ and $Q(-a, c)$ so that the line passing through $P$ and $Q$ is tangent to $C$.
 
-For example, the quadruplet (r, a, b, c) = (2, 6, 2, -7) satisfies this property.
+For example, the quadruplet $(r, a, b, c) = (2, 6, 2, -7)$ satisfies this property.
 
-Let F(R, X) be the number of the integer quadruplets (r, a, b, c) with this property, and with 0 &lt; r ≤ R and 0 &lt; a ≤ X.
+Let $F(R, X)$ be the number of the integer quadruplets $(r, a, b, c)$ with this property, and with $0 &lt; r ≤ R$ and $0 &lt; a ≤ X$.
 
-We can verify that F(1, 5) = 10, F(2, 10) = 52 and F(10, 100) = 3384. Find F(108, 109) + F(109, 108).
+We can verify that $F(1, 5) = 10$, $F(2, 10) = 52$ and $F(10, 100) = 3384$.
+
+Find $F({10}^8, {10}^9) + F({10}^9, {10}^8)$.
 
 # --hints--
 
-`euler410()` should return 799999783589946600.
+`circleAndTangentLine()` should return `799999783589946600`.
 
 ```js
-assert.strictEqual(euler410(), 799999783589946600);
+assert.strictEqual(circleAndTangentLine(), 799999783589946600);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler410(), 799999783589946600);
 ## --seed-contents--
 
 ```js
-function euler410() {
+function circleAndTangentLine() {
 
   return true;
 }
 
-euler410();
+circleAndTangentLine();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md
index db9dd2cb866..09ace26cdea 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md
@@ -1,29 +1,33 @@
 ---
 id: 5900f5081000cf542c510019
 title: 'Problem 411: Uphill paths'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302080
 dashedName: problem-411-uphill-paths
 ---
 
 # --description--
 
-Let n be a positive integer. Suppose there are stations at the coordinates (x, y) = (2i mod n, 3i mod n) for 0 ≤ i ≤ 2n. We will consider stations with the same coordinates as the same station.
+Let $n$ be a positive integer. Suppose there are stations at the coordinates $(x, y) = (2^i\bmod n, 3^i\bmod n)$ for $0 ≤ i ≤ 2n$. We will consider stations with the same coordinates as the same station.
 
-We wish to form a path from (0, 0) to (n, n) such that the x and y coordinates never decrease. Let S(n) be the maximum number of stations such a path can pass through.
+We wish to form a path from (0, 0) to ($n$, $n$) such that the $x$ and $y$ coordinates never decrease.
 
-For example, if n = 22, there are 11 distinct stations, and a valid path can pass through at most 5 stations. Therefore, S(22) = 5. The case is illustrated below, with an example of an optimal path:
+Let $S(n)$ be the maximum number of stations such a path can pass through.
 
-It can also be verified that S(123) = 14 and S(10000) = 48.
+For example, if $n = 22$, there are 11 distinct stations, and a valid path can pass through at most 5 stations. Therefore, $S(22) = 5$. The case is illustrated below, with an example of an optimal path:
 
-Find ∑ S(k5) for 1 ≤ k ≤ 30.
+<img class="img-responsive center-block" alt="valid path passing through 5 stations, for n = 22, with 11 distinct stations" src="https://cdn.freecodecamp.org/curriculum/project-euler/uphill-paths.png" style="background-color: white; padding: 10px;" />
+
+It can also be verified that $S(123) = 14$ and $S(10\\,000) = 48$.
+
+Find $\sum S(k^5)$ for $1 ≤ k ≤ 30$.
 
 # --hints--
 
-`euler411()` should return 9936352.
+`uphillPaths()` should return `9936352`.
 
 ```js
-assert.strictEqual(euler411(), 9936352);
+assert.strictEqual(uphillPaths(), 9936352);
 ```
 
 # --seed--
@@ -31,12 +35,12 @@ assert.strictEqual(euler411(), 9936352);
 ## --seed-contents--
 
 ```js
-function euler411() {
+function uphillPaths() {
 
   return true;
 }
 
-euler411();
+uphillPaths();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md
index f0dfab1bf60..ac00f985c10 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md
@@ -1,31 +1,35 @@
 ---
 id: 5900f5081000cf542c51001a
 title: 'Problem 412: Gnomon numbering'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302081
 dashedName: problem-412-gnomon-numbering
 ---
 
 # --description--
 
-For integers m, n (0 ≤ n &lt; m), let L(m, n) be an m×m grid with the top-right n×n grid removed.
+For integers $m$, $n$ ($0 ≤ n &lt; m$), let $L(m, n)$ be an $m×m$ grid with the top-right $n×n$ grid removed.
 
-For example, L(5, 3) looks like this:
+For example, $L(5, 3)$ looks like this:
 
-We want to number each cell of L(m, n) with consecutive integers 1, 2, 3, ... such that the number in every cell is smaller than the number below it and to the left of it.
+<img class="img-responsive center-block" alt="5x5 grid, with removed 3x3 grid from the top-right" src="https://cdn.freecodecamp.org/curriculum/project-euler/gnomon-numbering-1.png" style="background-color: white; padding: 10px;" />
 
-For example, here are two valid numberings of L(5, 3):
+We want to number each cell of $L(m, n)$ with consecutive integers 1, 2, 3, ... such that the number in every cell is smaller than the number below it and to the left of it.
 
-Let LC(m, n) be the number of valid numberings of L(m, n). It can be verified that LC(3, 0) = 42, LC(5, 3) = 250250, LC(6, 3) = 406029023400 and LC(10, 5) mod 76543217 = 61251715.
+For example, here are two valid numberings of $L(5, 3)$:
 
-Find LC(10000, 5000) mod 76543217.
+<img class="img-responsive center-block" alt="two valid numberings of L(5, 3)" src="https://cdn.freecodecamp.org/curriculum/project-euler/gnomon-numbering-2.png" style="background-color: white; padding: 10px;" />
+
+Let $LC(m, n)$ be the number of valid numberings of $L(m, n)$. It can be verified that $LC(3, 0) = 42$, $LC(5, 3) = 250\\,250$, $LC(6, 3) = 406\\,029\\,023\\,400$ and $LC(10, 5)\bmod 76\\,543\\,217 = 61\\,251\\,715$.
+
+Find $LC(10\\,000, 5\\,000)\bmod 76\\,543\\,217$.
 
 # --hints--
 
-`euler412()` should return 38788800.
+`gnomonNumbering()` should return `38788800`.
 
 ```js
-assert.strictEqual(euler412(), 38788800);
+assert.strictEqual(gnomonNumbering(), 38788800);
 ```
 
 # --seed--
@@ -33,12 +37,12 @@ assert.strictEqual(euler412(), 38788800);
 ## --seed-contents--
 
 ```js
-function euler412() {
+function gnomonNumbering() {
 
   return true;
 }
 
-euler412();
+gnomonNumbering();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-413-one-child-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-413-one-child-numbers.md
index a3a7ac23c57..8b120824417 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-413-one-child-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-413-one-child-numbers.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f50a1000cf542c51001c
 title: 'Problem 413: One-child Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302082
 dashedName: problem-413-one-child-numbers
 ---
 
 # --description--
 
-We say that a d-digit positive number (no leading zeros) is a one-child number if exactly one of its sub-strings is divisible by d.
+We say that a $d$-digit positive number (no leading zeros) is a one-child number if exactly one of its sub-strings is divisible by $d$.
 
-For example, 5671 is a 4-digit one-child number. Among all its sub-strings 5, 6, 7, 1, 56, 67, 71, 567, 671 and 5671, only 56 is divisible by 4. Similarly, 104 is a 3-digit one-child number because only 0 is divisible by 3. 1132451 is a 7-digit one-child number because only 245 is divisible by 7.
+例如，5671 是一个 4 位数的单子号码。 在它的所有子串 5、6、7、1、56、67、71、567、671 和 5671 中，只有 56 能被 4 整除。
 
-Let F(N) be the number of the one-child numbers less than N. We can verify that F(10) = 9, F(103) = 389 and F(107) = 277674.
+Similarly, 104 is a 3-digit one-child number because only 0 is divisible by 3. 1132451 is a 7-digit one-child number because only 245 is divisible by 7.
 
-Find F(1019).
+Let $F(N)$ be the number of the one-child numbers less than $N$. We can verify that $F(10) = 9$, $F({10}^3) = 389$ and $F({10}^7) = 277\\,674$.
+
+Find $F({10}^{19})$.
 
 # --hints--
 
-`euler413()` should return 3079418648040719.
+`oneChildNumbers()` should return `3079418648040719`.
 
 ```js
-assert.strictEqual(euler413(), 3079418648040719);
+assert.strictEqual(oneChildNumbers(), 3079418648040719);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler413(), 3079418648040719);
 ## --seed-contents--
 
 ```js
-function euler413() {
+function oneChildNumbers() {
 
   return true;
 }
 
-euler413();
+oneChildNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
index 9cf45b79ab3..e50ab2c9a7e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f50b1000cf542c51001d
 title: 'Problem 414: Kaprekar constant'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302083
 dashedName: problem-414-kaprekar-constant
 ---
 
 # --description--
 
-6174 is a remarkable number; if we sort its digits in increasing order and subtract that number from the number you get when you sort the digits in decreasing order, we get 7641-1467=6174.
+6174 is a remarkable number; if we sort its digits in increasing order and subtract that number from the number you get when you sort the digits in decreasing order, we get $7641 - 1467 = 6174$.
 
 Even more remarkable is that if we start from any 4 digit number and repeat this process of sorting and subtracting, we'll eventually end up with 6174 or immediately with 0 if all digits are equal.
 
@@ -16,28 +16,32 @@ This also works with numbers that have less than 4 digits if we pad the number w
 
 E.g. let's start with the number 0837:
 
-8730-0378=8352
-
-8532-2358=6174
+$$\begin{align}   & 8730 - 0378 = 8352 \\\\
+  & 8532 - 2358 = 6174 \end{align}$$
 
 6174 is called the Kaprekar constant. The process of sorting and subtracting and repeating this until either 0 or the Kaprekar constant is reached is called the Kaprekar routine.
 
-We can consider the Kaprekar routine for other bases and number of digits. Unfortunately, it is not guaranteed a Kaprekar constant exists in all cases; either the routine can end up in a cycle for some input numbers or the constant the routine arrives at can be different for different input numbers. However, it can be shown that for 5 digits and a base b = 6t+3≠9, a Kaprekar constant exists. E.g. base 15: (10,4,14,9,5)15 base 21: (14,6,20,13,7)21
+We can consider the Kaprekar routine for other bases and number of digits. Unfortunately, it is not guaranteed a Kaprekar constant exists in all cases; either the routine can end up in a cycle for some input numbers or the constant the routine arrives at can be different for different input numbers. However, it can be shown that for 5 digits and a base $b = 6t + 3 ≠ 9$, a Kaprekar constant exists.
 
-Define Cb to be the Kaprekar constant in base b for 5 digits. Define the function sb(i) to be 0 if i = Cb or if i written in base b consists of 5 identical digits the number of iterations it takes the Kaprekar routine in base b to arrive at Cb, otherwise
+E.g. base 15: ${(10, 4, 14, 9, 5)}\_{15}$ base 21: $(14, 6, 20, 13, 7)\_{21}$
 
-Note that we can define sb(i) for all integers i &lt; b5. If i written in base b takes less than 5 digits, the number is padded with leading zero digits until we have 5 digits before applying the Kaprekar routine.
+Define $C_b$ to be the Kaprekar constant in base $b$ for 5 digits. Define the function $sb(i)$ to be:
 
-Define S(b) as the sum of sb(i) for 0 &lt; i &lt; b5. E.g. S(15) = 5274369 S(111) = 400668930299
+- 0 if $i = C_b$ or if $i$ written in base $b$ consists of 5 identical digits
+- the number of iterations it takes the Kaprekar routine in base $b$ to arrive at $C_b$, otherwise
 
-Find the sum of S(6k+3) for 2 ≤ k ≤ 300. Give the last 18 digits as your answer.
+Note that we can define $sb(i)$ for all integers $i &lt; b^5$. If $i$ written in base $b$ takes less than 5 digits, the number is padded with leading zero digits until we have 5 digits before applying the Kaprekar routine.
+
+Define $S(b)$ as the sum of $sb(i)$ for $0 &lt; i &lt; b^5$. E.g. $S(15) = 5\\,274\\,369$ $S(111) = 400\\,668\\,930\\,299$
+
+Find the sum of $S(6k + 3)$ for $2 ≤ k ≤ 300$. Give the last 18 digits as your answer.
 
 # --hints--
 
-`euler414()` should return 552506775824935500.
+`kaprekarConstant()` should return `552506775824935500`.
 
 ```js
-assert.strictEqual(euler414(), 552506775824935500);
+assert.strictEqual(kaprekarConstant(), 552506775824935500);
 ```
 
 # --seed--
@@ -45,12 +49,12 @@ assert.strictEqual(euler414(), 552506775824935500);
 ## --seed-contents--
 
 ```js
-function euler414() {
+function kaprekarConstant() {
 
   return true;
 }
 
-euler414();
+kaprekarConstant();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-415-titanic-sets.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-415-titanic-sets.md
index 951684acc05..a03c026f9ae 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-415-titanic-sets.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-415-titanic-sets.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f50c1000cf542c51001e
 title: 'Problem 415: Titanic sets'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302084
 dashedName: problem-415-titanic-sets
 ---
 
 # --description--
 
-A set of lattice points S is called a titanic set if there exists a line passing through exactly two points in S.
+A set of lattice points $S$ is called a titanic set if there exists a line passing through exactly two points in $S$.
 
-An example of a titanic set is S = {(0, 0), (0, 1), (0, 2), (1, 1), (2, 0), (1, 0)}, where the line passing through (0, 1) and (2, 0) does not pass through any other point in S.
+An example of a titanic set is $S = \\{(0, 0), (0, 1), (0, 2), (1, 1), (2, 0), (1, 0)\\}$, where the line passing through (0, 1) and (2, 0) does not pass through any other point in $S$.
 
 On the other hand, the set {(0, 0), (1, 1), (2, 2), (4, 4)} is not a titanic set since the line passing through any two points in the set also passes through the other two.
 
-For any positive integer N, let T(N) be the number of titanic sets S whose every point (x, y) satisfies 0 ≤ x, y ≤ N. It can be verified that T(1) = 11, T(2) = 494, T(4) = 33554178, T(111) mod 108 = 13500401 and T(105) mod 108 = 63259062.
+For any positive integer $N$, let $T(N)$ be the number of titanic sets $S$ whose every point ($x$, $y$) satisfies $0 ≤ x$, $y ≤ N$. It can be verified that $T(1) = 11$, $T(2) = 494$, $T(4) = 33\\,554\\,178$, $T(111)\bmod {10}^8 = 13\\,500\\,401$ and $T({10}^5)\bmod {10}^8 = 63\\,259\\,062$.
 
-Find T(1011) mod 108.
+Find $T({10}^{11})\bmod {10}^8$.
 
 # --hints--
 
-`euler415()` should return 55859742.
+`titanicSets()` should return `55859742`.
 
 ```js
-assert.strictEqual(euler415(), 55859742);
+assert.strictEqual(titanicSets(), 55859742);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler415(), 55859742);
 ## --seed-contents--
 
 ```js
-function euler415() {
+function titanicSets() {
 
   return true;
 }
 
-euler415();
+titanicSets();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-416-a-frogs-trip.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-416-a-frogs-trip.md
index 96e9fe1bb0f..048adb254cd 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-416-a-frogs-trip.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-416-a-frogs-trip.md
@@ -1,25 +1,27 @@
 ---
 id: 5900f50e1000cf542c510020
 title: 'Problem 416: A frog''s trip'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302085
 dashedName: problem-416-a-frogs-trip
 ---
 
 # --description--
 
-A row of n squares contains a frog in the leftmost square. By successive jumps the frog goes to the rightmost square and then back to the leftmost square. On the outward trip he jumps one, two or three squares to the right, and on the homeward trip he jumps to the left in a similar manner. He cannot jump outside the squares. He repeats the round-trip travel m times.
+A row of $n$ squares contains a frog in the leftmost square. By successive jumps the frog goes to the rightmost square and then back to the leftmost square. On the outward trip he jumps one, two or three squares to the right, and on the homeward trip he jumps to the left in a similar manner. He cannot jump outside the squares. He repeats the round-trip travel $m$ times.
 
-Let F(m, n) be the number of the ways the frog can travel so that at most one square remains unvisited. For example, F(1, 3) = 4, F(1, 4) = 15, F(1, 5) = 46, F(2, 3) = 16 and F(2, 100) mod 109 = 429619151.
+Let $F(m, n)$ be the number of the ways the frog can travel so that at most one square remains unvisited.
 
-Find the last 9 digits of F(10, 1012).
+For example, $F(1, 3) = 4$, $F(1, 4) = 15$, $F(1, 5) = 46$, $F(2, 3) = 16$ and $F(2, 100)\bmod {10}^9 = 429\\,619\\,151$.
+
+Find the last 9 digits of $F(10, {10}^{12})$.
 
 # --hints--
 
-`euler416()` should return 898082747.
+`frogsTrip()` should return `898082747`.
 
 ```js
-assert.strictEqual(euler416(), 898082747);
+assert.strictEqual(frogsTrip(), 898082747);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler416(), 898082747);
 ## --seed-contents--
 
 ```js
-function euler416() {
+function frogsTrip() {
 
   return true;
 }
 
-euler416();
+frogsTrip();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md
index e73dd646e83..aa0880c13f4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f50d1000cf542c51001f
 title: 'Problem 417: Reciprocal cycles II'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302086
 dashedName: problem-417-reciprocal-cycles-ii
 ---
@@ -10,22 +10,27 @@ dashedName: problem-417-reciprocal-cycles-ii
 
 A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:
 
-1/2= 0.5 1/3= 0.(3) 1/4= 0.25 1/5= 0.2 1/6= 0.1(6) 1/7= 0.(142857) 1/8= 0.125 1/9= 0.(1) 1/10= 0.1
+$$\begin{align}   & \frac{1}{2}  = 0.5 \\\\
+  & \frac{1}{3}  = 0.(3) \\\\   & \frac{1}{4}  = 0.25 \\\\
+  & \frac{1}{5}  = 0.2 \\\\   & \frac{1}{6}  = 0.1(6) \\\\
+  & \frac{1}{7}  = 0.(142857) \\\\   & \frac{1}{8}  = 0.125 \\\\
+  & \frac{1}{9}  = 0.(1) \\\\   & \frac{1}{10} = 0.1 \\\\
+\end{align}$$
 
-Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that 1/7 has a 6-digit recurring cycle.
+Where $0.1(6)$ means $0.166666\ldots$, and has a 1-digit recurring cycle. It can be seen that $\frac{1}{7}$ has a 6-digit recurring cycle.
 
 Unit fractions whose denominator has no other prime factors than 2 and/or 5 are not considered to have a recurring cycle. We define the length of the recurring cycle of those unit fractions as 0.
 
-Let L(n) denote the length of the recurring cycle of 1/n. You are given that ∑L(n) for 3 ≤ n ≤ 1 000 000 equals 55535191115.
+Let $L(n)$ denote the length of the recurring cycle of $\frac{1}{n}$. You are given that $\sum L(n)$ for $3 ≤ n ≤ 1\\,000\\,000$ equals $55\\,535\\,191\\,115$.
 
-Find ∑L(n) for 3 ≤ n ≤ 100 000 000
+Find $\sum L(n)$ for $3 ≤ n ≤ 100\\,000\\,000$.
 
 # --hints--
 
-`euler417()` should return 446572970925740.
+`reciprocalCyclesTwo()` should return `446572970925740`.
 
 ```js
-assert.strictEqual(euler417(), 446572970925740);
+assert.strictEqual(reciprocalCyclesTwo(), 446572970925740);
 ```
 
 # --seed--
@@ -33,12 +38,12 @@ assert.strictEqual(euler417(), 446572970925740);
 ## --seed-contents--
 
 ```js
-function euler417() {
+function reciprocalCyclesTwo() {
 
   return true;
 }
 
-euler417();
+reciprocalCyclesTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-418-factorisation-triples.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-418-factorisation-triples.md
index ac11b1083f2..299303a1bf7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-418-factorisation-triples.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-418-factorisation-triples.md
@@ -1,29 +1,30 @@
 ---
 id: 5900f50f1000cf542c510021
 title: 'Problem 418: Factorisation triples'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302087
 dashedName: problem-418-factorisation-triples
 ---
 
 # --description--
 
-Let n be a positive integer. An integer triple (a, b, c) is called a factorisation triple of n if: 1 ≤ a ≤ b ≤ c
+Let $n$ be a positive integer. An integer triple ($a$, $b$, $c$) is called a factorisation triple of $n$ if:
 
-a·b·c = n.
+- $1 ≤ a ≤ b ≤ c$
+- $a \times b \times c = n$.
 
-Define f(n) to be a + b + c for the factorisation triple (a, b, c) of n which minimises c / a. One can show that this triple is unique.
+Define $f(n)$ to be $a + b + c$ for the factorisation triple ($a$, $b$, $c$) of $n$ which minimises $\frac{c}{a}$. 可以证明这一三元组是独特的。
 
-For example, f(165) = 19, f(100100) = 142 and f(20!) = 4034872.
+For example, $f(165) = 19$, $f(100\\,100) = 142$ and $f(20!) = 4\\,034\\,872$.
 
-Find f(43!).
+Find $f(43!)$.
 
 # --hints--
 
-`euler418()` should return 1177163565297340400.
+`factorisationTriples()` should return `1177163565297340400`.
 
 ```js
-assert.strictEqual(euler418(), 1177163565297340400);
+assert.strictEqual(factorisationTriples(), 1177163565297340400);
 ```
 
 # --seed--
@@ -31,12 +32,12 @@ assert.strictEqual(euler418(), 1177163565297340400);
 ## --seed-contents--
 
 ```js
-function euler418() {
+function factorisationTriples() {
 
   return true;
 }
 
-euler418();
+factorisationTriples();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.md
index 2d9f3650907..4143ab36ccb 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5101000cf542c510022
 title: 'Problem 419: Look and say sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302088
 dashedName: problem-419-look-and-say-sequence
 ---
@@ -14,28 +14,35 @@ The sequence starts with 1 and all other members are obtained by describing the
 
 It helps to do this out loud:
 
-1 is 'one one' → 11
+1 is 'one one' $→ 11$
 
-11 is 'two ones' → 21
+11 is 'two ones' $→ 21$
 
-21 is 'one two and one one' → 1211
+21 is 'one two and one one' $→ 1211$
 
-1211 is 'one one, one two and two ones' → 111221
+1211 is 'one one, one two and two ones' $→ 111221$
 
-111221 is 'three ones, two twos and one one' → 312211
+111221 is 'three ones, two twos and one one' $→ 312211$
 
 ...
 
-Define A(n), B(n) and C(n) as the number of ones, twos and threes in the n'th element of the sequence respectively. One can verify that A(40) = 31254, B(40) = 20259 and C(40) = 11625.
+Define $A(n)$, $B(n)$ and $C(n)$ as the number of ones, twos and threes in the $n$'th element of the sequence respectively. One can verify that $A(40) = 31\\,254$, $B(40) = 20\\,259$ and $C(40) = 11\\,625$.
 
-Find A(n), B(n) and C(n) for n = 1012. Give your answer modulo 230 and separate your values for A, B and C by a comma. E.g. for n = 40 the answer would be 31254,20259,11625
+Find $A(n)$, $B(n)$ and $C(n)$ for $n = {10}^{12}$. Give your answer modulo $2^{30}$ as a string and separate your values for $A$, $B$ and $C$ by a comma. E.g. for $n = 40$ the answer would be `31254,20259,11625`.
 
 # --hints--
 
-`euler419()` should return 998567458, 1046245404, 43363922.
+`lookAndSaySequence()` should return a string.
 
 ```js
-assert.strictEqual(euler419(), 998567458, 1046245404, 43363922);
+assert(typeof lookAndSaySequence() === 'string');
+```
+
+
+`lookAndSaySequence()` should return the string `998567458,1046245404,43363922`.
+
+```js
+assert.strictEqual(lookAndSaySequence(), '998567458,1046245404,43363922');
 ```
 
 # --seed--
@@ -43,12 +50,12 @@ assert.strictEqual(euler419(), 998567458, 1046245404, 43363922);
 ## --seed-contents--
 
 ```js
-function euler419() {
+function lookAndSaySequence() {
 
   return true;
 }
 
-euler419();
+lookAndSaySequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.md
index bc3de086231..abda6f2d137 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3961000cf542c50fea9
 title: 'Problem 42: Coded triangle numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302089
 dashedName: problem-42-coded-triangle-numbers
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md
index e65a335aada..327b5e9a696 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5111000cf542c510023
 title: 'Problem 420: 2x2 positive integer matrix'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302090
 dashedName: problem-420-2x2-positive-integer-matrix
 ---
@@ -10,18 +10,29 @@ dashedName: problem-420-2x2-positive-integer-matrix
 
 A positive integer matrix is a matrix whose elements are all positive integers.
 
-Some positive integer matrices can be expressed as a square of a positive integer matrix in two different ways. Here is an example:
+Some positive integer matrices can be expressed as a square of a positive integer matrix in two different ways. 这是一个例子：
 
-We define F(N) as the number of the 2x2 positive integer matrices which have a trace less than N and which can be expressed as a square of a positive integer matrix in two different ways. We can verify that F(50) = 7 and F(1000) = 1019.
+$$\begin{pmatrix}   40 & 12 \\\\
+  48 & 40 \end{pmatrix} =
+{\begin{pmatrix}
+  2 & 3 \\\\
+ 12 & 2 \end{pmatrix}}^2 =
+{\begin{pmatrix}
+  6 & 1 \\\\
+  4 & 6 \end{pmatrix}}^2$$
 
-Find F(107).
+We define $F(N)$ as the number of the 2x2 positive integer matrices which have a trace less than N and which can be expressed as a square of a positive integer matrix in two different ways.
+
+We can verify that $F(50) = 7$ and $F(1000) = 1019$.
+
+Find $F({10}^7)$.
 
 # --hints--
 
-`euler420()` should return 145159332.
+`positiveIntegerMatrix()` should return `145159332`.
 
 ```js
-assert.strictEqual(euler420(), 145159332);
+assert.strictEqual(positiveIntegerMatrix(), 145159332);
 ```
 
 # --seed--
@@ -29,12 +40,12 @@ assert.strictEqual(euler420(), 145159332);
 ## --seed-contents--
 
 ```js
-function euler420() {
+function positiveIntegerMatrix() {
 
   return true;
 }
 
-euler420();
+positiveIntegerMatrix();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md
index 61e0b86a92d..f94cb95bc48 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md
@@ -1,27 +1,33 @@
 ---
 id: 5900f5131000cf542c510024
-title: 'Problem 421: Prime factors of n15+1'
-challengeType: 5
+title: 'Problem 421: Prime factors of n^15+1'
+challengeType: 1
 forumTopicId: 302091
 dashedName: problem-421-prime-factors-of-n151
 ---
 
 # --description--
 
-Numbers of the form n15+1 are composite for every integer n > 1.
+Numbers of the form $n^{15} + 1$ are composite for every integer $n > 1$.
 
-For positive integers n and m let s(n,m) be defined as the sum of the distinct prime factors of n15+1 not exceeding m.
+For positive integers $n$ and $m$ let $s(n, m)$ be defined as the sum of the distinct prime factors of $n^{15} + 1$ not exceeding $m$.
 
-E.g. 215+1 = 3×3×11×331. So s(2,10) = 3 and s(2,1000) = 3+11+331 = 345.
+E.g. $2^{15} + 1 = 3 × 3 × 11 × 331$.
 
-Also 1015+1 = 7×11×13×211×241×2161×9091. So s(10,100) = 31 and s(10,1000) = 483. Find ∑ s(n,108) for 1 ≤ n ≤ 1011.
+So $s(2, 10) = 3$ and $s(2, 1000) = 3 + 11 + 331 = 345$.
+
+Also ${10}^{15} + 1 = 7 × 11 × 13 × 211 × 241 × 2161 × 9091$.
+
+So $s(10, 100) = 31$ and $s(10, 1000) = 483$.
+
+Find $\sum s(n, {10}^8)$ for $1 ≤ n ≤ {10}^{11}$.
 
 # --hints--
 
-`euler421()` should return 2304215802083466200.
+`primeFactorsOfN15Plus1()` should return `2304215802083466200`.
 
 ```js
-assert.strictEqual(euler421(), 2304215802083466200);
+assert.strictEqual(primeFactorsOfN15Plus1(), 2304215802083466200);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler421(), 2304215802083466200);
 ## --seed-contents--
 
 ```js
-function euler421() {
+function primeFactorsOfN15Plus1() {
 
   return true;
 }
 
-euler421();
+primeFactorsOfN15Plus1();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md
index cf7455ac9d6..7ea875b71ab 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md
@@ -1,29 +1,37 @@
 ---
 id: 5900f5131000cf542c510025
 title: 'Problem 422: Sequence of points on a hyperbola'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302092
 dashedName: problem-422-sequence-of-points-on-a-hyperbola
 ---
 
 # --description--
 
-Let H be the hyperbola defined by the equation 12x2 + 7xy - 12y2 = 625.
+Let $H$ be the hyperbola defined by the equation $12x^2 + 7xy - 12y^2 = 625$.
 
-Next, define X as the point (7, 1). It can be seen that X is in H.
+Next, define $X$ as the point (7, 1). It can be seen that $X$ is in $H$.
 
-Now we define a sequence of points in H, {Pi : i ≥ 1}, as: P1 = (13, 61/4). P2 = (-43/6, -4). For i > 2, Pi is the unique point in H that is different from Pi-1 and such that line PiPi-1 is parallel to line Pi-2X. It can be shown that Pi is well-defined, and that its coordinates are always rational. You are given that P3 = (-19/2, -229/24), P4 = (1267/144, -37/12) and P7 = (17194218091/143327232, 274748766781/1719926784).
+Now we define a sequence of points in $H, \\{P_i : i ≥ 1\\}$, as:
 
-Find Pn for n = 1114 in the following format:If Pn = (a/b, c/d) where the fractions are in lowest terms and the denominators are positive, then the answer is (a + b + c + d) mod 1 000 000 007.
+- $P_1 = (13, \frac{61}{4})$.
+- $P_2 = (\frac{-43}{6}, -4)$.
+- For $i > 2$, $P_i$ is the unique point in $H$ that is different from $P_{i - 1}$ and such that line $P_iP_{i - 1}$ is parallel to line $P_{i - 2}X$. It can be shown that $P_i$ is well-defined, and that its coordinates are always rational.
 
-For n = 7, the answer would have been: 806236837.
+<img class="img-responsive center-block" alt="animation showing defining points P_1 to P_6" src="https://cdn.freecodecamp.org/curriculum/project-euler/sequence-of-points-on-a-hyperbola.gif" style="background-color: white; padding: 10px;" />
+
+You are given that $P_3 = (\frac{-19}{2}, \frac{-229}{24})$, $P_4 = (\frac{1267}{144}, \frac{-37}{12})$ and $P_7 = (\frac{17\\,194\\,218\\,091}{143\\,327\\,232}, \frac{274\\,748\\,766\\,781}{1\\,719\\,926\\,784})$.
+
+Find $P_n$ for $n = {11}^{14}$ in the following format: If $P_n = (\frac{a}{b}, \frac{c}{d})$ where the fractions are in lowest terms and the denominators are positive, then the answer is $(a + b + c + d)\bmod 1\\,000\\,000\\,007$.
+
+For $n = 7$, the answer would have been: $806\\,236\\,837$.
 
 # --hints--
 
-`euler422()` should return 92060460.
+`sequenceOfPointsOnHyperbola()` should return `92060460`.
 
 ```js
-assert.strictEqual(euler422(), 92060460);
+assert.strictEqual(sequenceOfPointsOnHyperbola(), 92060460);
 ```
 
 # --seed--
@@ -31,12 +39,12 @@ assert.strictEqual(euler422(), 92060460);
 ## --seed-contents--
 
 ```js
-function euler422() {
+function sequenceOfPointsOnHyperbola() {
 
   return true;
 }
 
-euler422();
+sequenceOfPointsOnHyperbola();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md
index a19a5ce19d3..9969311f0de 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md
@@ -1,33 +1,42 @@
 ---
 id: 5900f5141000cf542c510027
 title: 'Problem 423: Consecutive die throws'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302093
 dashedName: problem-423-consecutive-die-throws
 ---
 
 # --description--
 
-Let n be a positive integer.
+Let $n$ be a positive integer.
 
-A 6-sided die is thrown n times. Let c be the number of pairs of consecutive throws that give the same value.
+A 6-sided die is thrown $n$ times. Let $c$ be the number of pairs of consecutive throws that give the same value.
 
-For example, if n = 7 and the values of the die throws are (1,1,5,6,6,6,3), then the following pairs of consecutive throws give the same value: (1,1,5,6,6,6,3) (1,1,5,6,6,6,3) (1,1,5,6,6,6,3) Therefore, c = 3 for (1,1,5,6,6,6,3).
+For example, if $n = 7$ and the values of the die throws are (1, 1, 5, 6, 6, 6, 3), then the following pairs of consecutive throws give the same value:
 
-Define C(n) as the number of outcomes of throwing a 6-sided die n times such that c does not exceed π(n).1 For example, C(3) = 216, C(4) = 1290, C(11) = 361912500 and C(24) = 4727547363281250000.
+$$\begin{align}   & (\underline{1}, \underline{1}, 5, 6, 6, 6, 3) \\\\
+  & (1, 1, 5, \underline{6}, \underline{6}, 6, 3) \\\\ & (1, 1, 5, 6, \underline{6}, \underline{6}, 3) \end{align}$$
 
-Define S(L) as ∑ C(n) for 1 ≤ n ≤ L. For example, S(50) mod 1 000 000 007 = 832833871.
+Therefore, $c = 3$ for (1, 1, 5, 6, 6, 6, 3).
 
-Find S(50 000 000) mod 1 000 000 007.
+Define $C(n)$ as the number of outcomes of throwing a 6-sided die $n$ times such that $c$ does not exceed $π(n)$.<sup>1</sup>
 
-1 π denotes the prime-counting function, i.e. π(n) is the number of primes ≤ n.
+For example, $C(3) = 216$, $C(4) = 1290$, $C(11) = 361\\,912\\,500$ and $C(24) = 4\\,727\\,547\\,363\\,281\\,250\\,000$.
+
+Define $S(L)$ as $\sum C(n)$ for $1 ≤ n ≤ L$.
+
+For example, $S(50)\bmod 1\\,000\\,000\\,007 = 832\\,833\\,871$.
+
+Find $S(50\\,000\\,000)\bmod 1\\,000\\,000\\,007$.
+
+<sup>1</sup> $π$ denotes the prime-counting function, i.e. $π(n)$ is the number of primes $≤ n$.
 
 # --hints--
 
-`euler423()` should return 653972374.
+`consecutiveDieThrows()` should return `653972374`.
 
 ```js
-assert.strictEqual(euler423(), 653972374);
+assert.strictEqual(consecutiveDieThrows(), 653972374);
 ```
 
 # --seed--
@@ -35,12 +44,12 @@ assert.strictEqual(euler423(), 653972374);
 ## --seed-contents--
 
 ```js
-function euler423() {
+function consecutiveDieThrows() {
 
   return true;
 }
 
-euler423();
+consecutiveDieThrows();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-424-kakuro.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-424-kakuro.md
index 827b969ce69..90b1b38773f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-424-kakuro.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-424-kakuro.md
@@ -1,50 +1,73 @@
 ---
 id: 5900f5141000cf542c510026
 title: 'Problem 424: Kakuro'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302094
 dashedName: problem-424-kakuro
 ---
 
 # --description--
 
+<img class="img-responsive center-block" alt="kakuro example" src="https://cdn.freecodecamp.org/curriculum/project-euler/kakuro.gif" style="background-color: white; padding: 10px;" />
+
 The above is an example of a cryptic kakuro (also known as cross sums, or even sums cross) puzzle, with its final solution on the right. (The common rules of kakuro puzzles can be found easily on numerous internet sites. Other related information can also be currently found at krazydad.com whose author has provided the puzzle data for this challenge.)
 
-The downloadable text file (kakuro200.txt) contains the description of 200 such puzzles, a mix of 5x5 and 6x6 types. The first puzzle in the file is the above example which is coded as follows:
+The `testPuzzles` array contains the description of 200 such puzzles, a mix of 5x5 and 6x6 types. The first puzzle in the file is the above example which is coded as string as follows:
 
-6,X,X,(vCC),(vI),X,X,X,(hH),B,O,(vCA),(vJE),X,(hFE,vD),O,O,O,O,(hA),O,I,(hJC,vB),O,O,(hJC),H,O,O,O,X,X,X,(hJE),O,O,X
+`6,X,X,(vCC),(vI),X,X,X,(hH),B,O,(vCA),(vJE),X,(hFE,vD),O,O,O,O,(hA),O,I,(hJC,vB),O,O,(hJC),H,O,O,O,X,X,X,(hJE),O,O,X`
 
 The first character is a numerical digit indicating the size of the information grid. It would be either a 6 (for a 5x5 kakuro puzzle) or a 7 (for a 6x6 puzzle) followed by a comma (,). The extra top line and left column are needed to insert information.
 
-The content of each cell is then described and followed by a comma, going left to right and starting with the top line. X = Gray cell, not required to be filled by a digit. O (upper case letter)= White empty cell to be filled by a digit. A = Or any one of the upper case letters from A to J to be replaced by its equivalent digit in the solved puzzle. ( ) = Location of the encrypted sums. Horizontal sums are preceded by a lower case "h" and vertical sums are preceded by a lower case "v". Those are followed by one or two upper case letters depending if the sum is a single digit or double digit one. For double digit sums, the first letter would be for the "tens" and the second one for the "units". When the cell must contain information for both a horizontal and a vertical sum, the first one is always for the horizontal sum and the two are separated by a comma within the same set of brackets, ex.: (hFE,vD). Each set of brackets is also immediately followed by a comma.
+The content of each cell is then described and followed by a comma, going left to right and starting with the top line.
+
+`X` = Gray cell, not required to be filled by a digit.
+
+`O` (upper case letter)= White empty cell to be filled by a digit.
+
+`A` = Or any one of the upper case letters from A to J to be replaced by its equivalent digit in the solved puzzle.
+
+`( )` = Location of the encrypted sums. Horizontal sums are preceded by a lower case "h" and vertical sums are preceded by a lower case "v". Those are followed by one or two upper case letters depending if the sum is a single digit or double digit one. For double digit sums, the first letter would be for the "tens" and the second one for the "units". When the cell must contain information for both a horizontal and a vertical sum, the first one is always for the horizontal sum and the two are separated by a comma within the same set of brackets, ex.: (hFE,vD). Each set of brackets is also immediately followed by a comma.
 
 The description of the last cell is followed by a Carriage Return/Line Feed (CRLF) instead of a comma.
 
 The required answer to each puzzle is based on the value of each letter necessary to arrive at the solution and according to the alphabetical order. As indicated under the example puzzle, its answer would be 8426039571. At least 9 out of the 10 encrypting letters are always part of the problem description. When only 9 are given, the missing one must be assigned the remaining digit.
 
-You are given that the sum of the answers for the first 10 puzzles in the file is 64414157580.
+You are given that the sum of the answers for the first 10 puzzles in `testPuzzles` is 64414157580.
 
-Find the sum of the answers for the 200 puzzles.
+Find the sum of the answers for `puzzles` array.
 
 # --hints--
 
-`euler424()` should return 1059760019628.
+`kakuro(testPuzzles)` should return `1059760019628`.
 
 ```js
-assert.strictEqual(euler424(), 1059760019628);
+assert.strictEqual(kakuro(_testPuzzles), 1059760019628);
 ```
 
 # --seed--
 
+
+## --after-user-code--
+
+```js
+const _testPuzzles = [
+  '6,X,X,(vCC),(vI),X,X,X,(hH),B,O,(vCA),(vJE),X,(hFE,vD),O,O,O,O,(hA),O,I,(hJC,vB),O,O,(hJC),H,O,O,O,X,X,X,(hJE),O,O,X','7,X,X,X,X,(vJJ),(vCD),X,X,X,X,(hCG),O,O,(vCE),X,X,X,(hCI,vJB),C,O,O,X,(vB),(hJF,vJF),O,F,O,O,(hJA),F,G,O,O,X,X,(hCA),O,A,O,X,X,X,X,(hCF),O,O,X,X,X','7,X,X,X,(vE),(vCB),X,X,X,X,(hJ),O,O,(vCA),X,X,(vCH),(hCG,vCJ),O,O,O,(vJ),(hCE),O,O,O,(hJ,vGG),O,O,(hD),I,O,(hCD,vCB),H,O,O,X,(hCE),O,O,E,X,X,X,X,(hCE),O,O,X,X','6,X,X,X,(vEA),(vJF),X,X,X,(hI),O,O,(vJA),X,(vA),(hEI,vEB),O,O,O,(hIG),C,O,J,O,D,(hJD),O,O,O,X,X,X,(hJD),O,O,X,X','7,X,(vH),(vG),X,X,(vI),(vDH),(hG),B,O,(vDI),(hDB,vDE),O,O,(hBC),I,O,F,O,O,J,X,X,(hG),O,O,X,X,X,(vDG),(hH,vDD),O,O,(vDJ),(vC),(hBI),O,O,O,O,O,O,(hDJ),O,O,X,(hA),O,O','6,X,(vID),(vIJ),X,X,X,(hH),F,I,(vF),(vIA),X,(hIA),G,B,O,C,X,X,(hID),O,O,O,(vIF),X,(hIA),E,O,I,O,X,X,X,(hII),O,G','6,X,X,(vAF),(vAI),X,X,X,(hJ,vAC),O,B,(vGJ),X,(hGH),J,O,O,O,(vAF),(hAG),O,O,(hH,vF),A,D,X,(hGF),O,E,O,O,X,X,(hD),O,O,X','7,X,X,X,X,(vCE),(vGB),X,X,(vJG),(vCI),(hCD,vCJ),O,O,X,(hCI),O,O,O,O,B,(vJB),(hCF),O,O,O,(hCA,vH),O,O,(hCJ),O,O,(hJB,vCJ),O,O,O,X,(hJD),O,O,O,O,O,X,(hF),I,O,X,X,X','7,X,(vBB),(vBD),X,X,X,X,(hBB),C,E,(vEE),(vEC),X,X,(hBC),O,O,O,O,X,X,X,(hEF),H,O,A,(vJ),X,X,X,(hBD),O,O,O,(vI),X,X,(hBE),F,O,O,O,X,X,X,X,(hG),O,O','7,X,X,(vGG),(vGD),X,(vI),(vGI),X,(hGB),O,O,(hGH,vIC),O,O,X,(hGA),O,O,O,J,O,X,X,(hGI),O,O,X,X,X,(vGD),(hE,vE),O,O,(vGF),X,(hIH),O,O,O,O,O,X,(hE),A,O,(hGF),O,O,X','6,X,(vIJ),(vIE),X,X,X,(hF),O,C,(vIA),X,X,(hCA),O,O,D,(vIH),X,X,(hIB),E,O,O,(vF),X,X,(hD),O,A,O,X,X,X,(hID),O,G','6,X,(vAD),(vGI),(vI),X,X,(hB),O,O,O,(vAF),X,(hGC),O,O,O,O,(vGA),(hGE),O,O,(hJ,vB),O,O,X,(hGD),D,O,E,O,X,X,(hAI),O,C,O','6,X,X,X,(vAB),(vFA),X,X,X,(hHI),O,O,(vHJ),X,(vA),(hFJ,vHE),I,D,O,(hFH),O,O,O,O,O,(hHJ),O,O,O,X,X,X,(hC),O,J,X,X','7,X,X,X,(vJ),(vEF),X,X,X,X,(hI,vGD),C,E,(vEF),(vA),X,(hEH),O,O,O,O,O,X,(hH,vJ),O,O,(hJ,vEJ),O,O,(hD),O,A,(hEF,vEB),O,O,X,(hCC),O,O,A,O,O,X,X,X,(hH),O,O,X,X','7,X,X,X,(vAG),(vAJ),(vFH),X,X,X,(hFD),O,O,O,X,X,(vH),(hAJ,vAB),O,O,O,(vB),(hAH),O,H,O,(hC,vAI),O,O,(hE),O,O,(hAI,vAE),O,O,O,X,(hJ),O,O,O,X,X,X,(hFG),E,O,O,X,X','7,X,(vAI),(vHB),X,X,(vJE),(vAA),(hD),O,O,X,(hG),O,O,(hAJ),O,O,(vE),(hAA,vAI),O,O,X,(hHF),O,O,O,O,X,X,(hJF,vAE),O,O,O,J,(vH),(hAI),D,O,X,(hB),O,O,(hAG),O,O,X,(hAA),O,O','7,X,X,(vHJ),(vC),(vAF),X,X,X,(hHF),O,O,O,(vHI),(vHD),X,(hHB,vAB),O,O,O,O,E,(hAI),O,O,X,(hAB),O,O,(hD),O,O,(vAB),(hAI,vE),J,O,(hHH),O,O,O,B,O,X,X,X,(hG),O,A,O,X','6,X,X,(vDF),(vHE),X,X,X,(hHJ,vE),C,O,X,X,(hHI),O,O,O,(vDF),(vHH),(hFA),A,O,B,O,O,X,X,(hE),O,I,O,X,X,(hHH),O,O,X','6,X,(vA),(vA),X,X,X,(hE),O,O,(vCJ),X,X,(hG),O,O,O,(vHI),X,X,(hHC),O,O,H,(vB),X,X,(hCE),O,O,D,X,X,X,(hE),O,O','6,X,X,X,X,(vEH),(vEC),X,X,X,(hEB,vEJ),O,O,X,X,(hEC,vEF),O,O,B,X,(hDD,vEI),O,B,C,X,(hB),O,D,A,X,X,(hEC),O,O,X,X,X','6,X,X,X,X,(vIF),(vH),X,X,X,(hIJ,vGJ),B,I,X,X,(hIB,vIC),O,O,G,X,(hIA,vC),O,O,O,X,(hE),O,O,O,X,X,(hIA),E,O,X,X,X','7,X,(vC),(vFB),X,X,X,X,(hFH),O,O,(vFA),(vFJ),(vC),X,(hFJ),O,O,O,O,O,X,X,X,(hA,vJ),O,O,O,X,X,(hG),D,O,O,(vC),(vFC),X,(hBH),A,O,O,O,E,X,X,X,X,(hFH),O,I','6,X,X,(vFD),(vC),X,X,X,(hDH),E,F,(vDG),(vDD),X,(hDF,vDI),O,O,A,O,(hDG),O,O,(hDG,vDG),O,O,(hDJ),O,D,J,O,X,X,X,(hJ),E,O,X','6,X,X,X,(vE),(vGH),(vIC),X,X,(hD,vIG),O,O,A,X,(hIF,vJ),O,J,E,O,(hJ),O,D,(hGG,vGH),O,O,(hGG),O,O,O,O,X,(hIC),O,O,O,X,X','7,X,X,X,X,(vAG),(vJA),(vH),X,X,X,(hAJ,vDJ),O,O,O,X,X,(hJF),O,O,O,O,X,X,(hG),D,O,X,X,X,(vJH),(hJE,vJD),C,I,X,X,(hAE),B,O,O,O,X,X,(hAJ),O,O,E,X,X,X','7,X,X,X,X,(vGG),(vIA),(vGF),X,X,X,(hGF),O,O,D,X,X,X,(hGJ,vIB),O,O,O,X,X,(hGH,vGD),O,O,O,X,X,(hII,vC),O,J,O,X,X,(hIH),J,O,O,X,X,X,(hGE),O,I,O,X,X,X','6,X,X,(vFA),(vEC),X,X,X,(hI,vFI),F,O,X,X,(hDE),O,O,O,(vFF),(vFF),(hDI),G,J,O,F,O,X,X,(hFJ),O,D,O,X,X,(hFH),J,A,X','7,X,X,X,X,X,(vID),(vBB),X,X,X,X,(hBC),O,I,X,X,(vIH),(vBH),(hBF,vF),O,O,X,(hIE,vD),O,O,I,O,O,(hAG),O,O,O,O,F,X,(hA),O,O,X,X,X,X,(hD),O,O,X,X,X,X','7,X,(vCD),(vCC),X,X,X,X,(hE),B,C,(vCE),X,X,X,(hCD),O,O,O,(vE),(vCG),X,X,(hCH),O,O,O,O,X,X,(hFC),B,J,G,O,(vCC),X,X,X,(hCI),O,O,O,X,X,X,X,(hG),O,O','7,X,X,X,(vID),(vD),(vFB),X,X,X,(hIB,vID),O,O,O,X,X,(hJE,vIA),J,C,O,D,(vF),(hIB),O,O,X,(hIG),O,O,(hIJ),O,O,(vD),(hA,vID),O,O,X,(hJF),O,O,O,O,X,X,(hIE),O,O,O,X,X','7,X,X,(vAC),(vAH),X,X,X,X,(hD),O,O,(vAD),X,X,X,(hCH,vAD),O,O,O,(vAA),(vF),(hAC),O,H,(hAB,vAJ),O,O,A,(hAE),O,O,O,(hD,vAD),O,O,X,X,(hAC),O,O,O,X,X,X,X,(hG),O,O,X','6,X,X,(vBB),(vBE),X,X,X,(hBH),O,I,(vBG),(vBB),X,(hHE,vBD),H,D,O,O,(hBA),C,O,(hA,vG),O,O,(hBF),I,O,O,O,X,X,X,(hG),O,O,X','6,X,X,(vEC),(vD),X,X,X,(hD,vH),O,O,(vIB),X,(hIA),O,O,O,O,(vE),(hII),O,F,(hII,vIG),O,O,X,(hIH),O,O,O,O,X,X,(hIA),O,D,X','6,X,X,X,X,(vEH),(vEG),X,X,X,(hEB,vEF),O,O,X,X,(hAC,vG),O,B,O,X,(hEE,vEC),O,D,O,X,(hEE),O,O,O,X,X,(hEJ),D,O,X,X,X','6,X,(vD),(vB),X,X,X,(hA),O,O,(vE),X,X,(hE),A,O,O,(vCJ),X,X,(hCH),O,A,O,(vCI),X,X,(hB),O,D,O,X,X,X,(hCB),G,O','7,X,X,X,X,(vHJ),(vIF),(vIB),X,X,X,(hIH,vJI),O,O,J,X,X,(hIA),O,O,O,F,X,X,(hIG),O,C,X,X,X,(vD),(hA,vIB),O,J,X,X,(hHB),O,O,O,O,X,X,(hHB),O,O,O,X,X,X','7,X,X,X,(vBJ),(vIB),X,X,X,(vIF),(hBB,vBB),O,O,(vBA),X,(hIC),O,O,O,O,O,(vBA),(hBD),O,O,(hC,vC),O,O,O,(hBJ),E,O,O,(hBC,vBI),G,H,X,(hBA),O,O,O,O,O,X,X,(hBF),O,O,X,X','7,X,(vHI),(vHE),X,X,X,X,(hA),O,O,X,X,X,X,(hHG),O,O,(vHH),(vHE),(vIJ),X,(hHA),O,O,O,O,O,(vHI),X,(hID),H,O,O,B,I,X,X,X,X,(hHB),F,O,X,X,X,X,(hHE),O,H','6,X,X,(vAJ),(vAJ),X,X,X,(hAF,vAA),G,A,X,X,(hDA),O,O,O,(vDE),(vAH),(hAJ),O,O,O,O,I,X,X,(hAG),D,C,O,X,X,(hAI),O,O,X','6,X,X,X,X,(vDH),(vDA),X,X,X,(hG,vDG),O,E,X,X,(hBJ,vBC),O,O,O,X,(hBI,vE),O,E,O,X,(hE),O,O,O,X,X,(hDH),O,E,X,X,X','6,X,X,X,X,(vHJ),(vHH),X,X,X,(hHE,vCC),O,O,X,X,(hF,vG),A,O,O,X,(hHC,vHJ),O,B,O,X,(hHH),O,O,O,X,X,(hHI),O,O,X,X,X','7,X,(vJ),(vDG),X,X,(vDF),(vEF),(hC),E,B,X,(hEA),O,O,(hEE),C,O,(vH),(hED,vEF),A,O,X,(hEC),O,O,O,O,X,X,(hDD,vEF),O,O,O,O,(vEA),(hEJ),O,F,X,(hJ),O,O,(hEF),O,O,X,(hEF),O,O','7,X,X,X,(vCC),(vD),X,X,X,(vJE),(hI,vCH),O,O,(vBF),X,(hCC),O,O,O,O,A,(vJB),(hCB),G,O,O,(hJA,vJF),O,O,(hJA),O,O,(hG,vH),O,O,O,X,(hCE),O,O,O,O,O,X,X,(hH),O,O,X,X','7,X,X,(vEI),(vEB),(vG),X,X,X,(hEF),E,O,O,(vHE),X,X,(hEF,vH),O,O,O,O,(vEI),(hH),O,O,X,(hEH),O,B,(hG),O,O,(vG),(hEI,vED),O,O,X,(hAG),C,O,O,O,X,X,X,(hEE),O,O,O,X','6,X,X,X,X,(vJE),(vF),X,X,X,(hI,vJJ),O,O,X,X,(hEC,vJJ),H,O,O,X,(hF,vJB),O,O,O,X,(hJI),A,C,E,X,X,(hJD),O,J,X,X,X','6,X,X,X,(vH),(vAE),X,X,X,(hCB,vCJ),O,O,(vCB),X,(hCA,vD),O,O,O,O,(hD),C,O,(hCC,vJ),O,O,(hAB),A,O,F,O,X,X,(hB),G,O,X,X','6,X,X,(vEC),(vEG),X,X,X,(hEF),O,O,(vFC),(vEI),X,(hHJ,vJ),E,O,O,A,(hJ),O,O,(hEA,vEA),O,O,(hHH),O,O,O,B,X,X,X,(hEF),O,O,X','7,X,(vEI),(vEC),X,X,X,X,(hH),O,O,X,X,X,X,(hED),O,O,(vEB),(vEG),(vGB),X,(hEJ),O,O,O,O,O,(vD),X,(hIA),O,O,O,O,C,X,X,X,X,(hA),O,I,X,X,X,X,(hEB),A,O','7,X,X,X,(vF),(vG),(vIB),X,X,(vG),(hBA,vIH),J,I,D,X,(hBG),O,O,O,O,O,(vBG),(hA),O,O,X,(hE),O,O,(hBB),O,C,(vA),(hBI,vBE),O,O,X,(hBA),O,O,O,O,O,X,(hBF),O,O,O,X,X','7,X,X,(vEF),(vDI),X,X,X,X,(hDG),O,O,(vDA),X,X,X,(hEA,vG),O,O,O,(vEJ),(vJ),(hF),O,G,(hDH,vDI),O,O,F,(hED),O,O,O,(hDD,vB),O,O,X,X,(hDB),O,O,A,X,X,X,X,(hH),O,O,X','7,X,X,X,X,(vJH),(vD),(vAJ),X,X,X,(hAC,vDH),O,O,O,X,X,(hAA),O,O,O,O,X,X,(hC),F,O,X,X,X,(vC),(hAJ,vAA),I,H,X,X,(hJA),O,D,O,G,X,X,(hJB),O,C,O,X,X,X','6,X,X,X,(vDC),(vG),X,X,X,(hA),O,O,(vCH),X,(vCI),(hCB,vB),O,O,O,(hDF),O,H,O,O,O,(hH),O,O,O,X,X,X,(hH),J,O,X,X','6,X,X,(vCG),(vGA),X,X,X,(hE),O,O,(vGG),(vGB),X,(hCI,vF),O,O,O,I,(hGI),O,O,(hI,vD),O,A,(hGH),O,B,O,O,X,X,X,(hA),O,O,X','6,X,X,X,(vJ),(vHF),X,X,(vF),(hHG,vHD),O,A,X,(hHI),A,O,O,O,(vHE),(hB),G,O,(hD,vHE),O,F,X,(hGJ),O,O,O,O,X,(hHD),O,O,X,X','6,X,X,X,X,(vBD),(vD),X,X,X,(hD,vBB),O,O,X,X,(hI,vHD),O,O,O,X,(hHD,vBE),O,O,A,X,(hHF),C,O,G,X,X,(hBI),O,O,X,X,X','7,X,(vJ),(vFB),(vDB),X,X,X,(hFC),O,O,O,(vFE),X,X,(hFB),O,O,O,O,X,X,X,X,(hG),I,O,X,X,X,X,(hA),O,O,(vFG),(vE),X,X,(hDD),O,O,O,A,X,X,X,(hFD),D,E,J','6,X,X,X,(vAD),(vAH),X,X,(vB),(hF,vEB),O,O,X,(hED),O,O,O,O,(vD),(hD),O,O,(hJ,vI),O,O,X,(hEH),O,A,O,C,X,(hB),G,O,X,X','6,X,X,X,X,(vFG),(vFB),X,X,X,(hFD,vB),O,O,X,X,(hFG,vFG),O,O,O,X,(hI,vH),O,O,C,X,(hGA),E,H,O,X,X,(hD),O,G,X,X,X','7,X,X,X,(vBH),(vBB),X,X,X,X,(hBJ,vBJ),I,O,(vHE),(vI),X,(hBF,vBA),O,O,O,O,O,(hBE),O,D,X,(hA),O,O,(hBC),O,O,(vA),(hBB,vBH),O,O,(hDA),B,H,O,O,O,X,X,X,(hI),O,O,X,X','7,X,X,X,(vEC),(vD),X,X,X,(vJ),(hEB,vEJ),O,O,X,X,(hFC),O,O,O,F,(vEG),X,(hG),O,O,(hH,vFI),O,E,(vEH),X,(hEB),A,O,(hED,vJ),O,O,X,X,(hFI),O,O,O,O,X,X,(hED),O,O,X,X','6,X,(vGH),(vGG),X,X,X,(hGE),O,O,(vFI),(vGJ),X,(hGF),O,O,D,O,X,X,(hGB),O,C,O,(vGG),X,(hFG),O,O,O,O,X,X,X,(hE),O,I','7,X,X,X,(vF),(vGI),X,X,X,(vJ),(hB,vGA),H,G,X,X,(hHF),O,O,O,A,(vHH),X,(hB),O,O,(hGB,vGA),C,O,(vC),X,(hGC),O,O,(hGI,vGF),O,O,X,X,(hHB),O,E,O,O,X,X,(hA),O,O,X,X','7,X,X,X,X,X,(vED),(vIG),X,X,X,X,(hEC),O,O,X,X,(vAC),(vA),(hH,vEG),O,O,X,(hAE,vB),O,O,H,O,O,(hIJ),O,O,O,B,O,X,(hEC),O,O,X,X,X,X,(hEI),O,O,X,X,X,X','7,X,X,(vAI),(vAA),X,X,X,X,(hAD,vAG),O,O,(vAE),X,X,(hAH),O,O,O,O,(vBH),(vD),(hG),O,O,(hI,vE),O,O,O,(hAI),O,O,O,(hG,vAC),D,F,X,X,(hAH),O,O,O,O,X,X,X,(hAJ),O,O,X','7,X,X,(vGD),(vFB),(vJ),X,X,X,(hGD),O,O,O,(vFA),(vGG),X,(hFA),O,O,O,O,O,X,(hGE,vGF),O,O,(hH,vFB),O,O,(hH),O,G,(hGC,vD),O,G,X,(hEB),O,O,O,O,O,X,X,X,(hGC),O,A,O,X','6,X,X,(vAD),(vEE),X,X,X,(hEC),G,O,(vAJ),(vH),X,(hEC,vEG),O,A,O,O,(hEG),F,O,(hEG,vEG),O,O,(hAB),O,E,F,A,X,X,X,(hEG),O,O,X','6,X,X,X,X,(vIB),(vJ),X,X,X,(hB,vIJ),O,O,X,X,(hE,vIF),O,O,C,X,(hFC,vIF),O,A,O,X,(hG),O,O,H,X,X,(hIJ),O,O,X,X,X','6,X,X,X,(vIB),(vEB),X,X,X,(hD,vAE),O,O,(vE),X,(hIJ,vE),O,O,O,O,(hII),O,O,(hJ,vC),H,O,(hAE),O,O,G,J,X,X,(hC),O,O,X,X','6,X,X,(vFF),(vB),X,X,X,(hC,vI),O,J,(vJE),X,(hJJ),O,O,I,G,(vA),(hJJ),O,O,(hJD,vJE),O,O,X,(hJB),O,O,F,O,X,X,(hJH),C,J,X','7,X,X,X,(vEI),(vJI),X,X,X,X,(hJA),O,O,(vJE),(vJJ),X,X,(hJI,vJB),O,E,O,D,X,(hJI,vC),O,H,(hJB,vJE),O,O,(hB),O,O,(hF,vD),O,O,X,(hJB),O,O,O,O,X,X,X,X,(hJE),O,O,X,X','7,X,(vJB),(vFD),X,X,(vFE),(vH),(hJF),O,O,X,(hH),O,O,(hJC),O,O,(vH),(hJF,vJF),O,O,X,(hJI),H,O,O,O,X,X,(hFJ,vJJ),J,O,O,O,(vJA),(hA),G,O,X,(hJF),O,C,(hJC),O,O,X,(hD),O,O','7,X,(vI),(vDH),X,X,X,X,(hB),O,I,X,X,X,X,(hC),O,O,(vA),(vI),(vDJ),X,(hDH),O,B,O,O,O,(vDH),X,(hGG),O,O,O,J,O,X,X,X,X,(hHH),B,O,X,X,X,X,(hHE),O,O','6,X,X,(vDI),(vE),X,X,X,(hA,vDA),E,O,(vHI),X,(hHI),F,A,O,O,(vDF),(hDD),O,O,(hDJ,vDJ),O,O,X,(hDG),O,O,H,O,X,X,(hB),O,D,X','6,X,(vJ),(vDH),X,X,X,(hDA),G,O,(vDA),(vDB),X,(hDB),O,O,I,F,X,X,(hG),O,F,O,(vDI),X,(hED),G,O,O,F,X,X,X,(hDE),O,H','6,X,X,(vCJ),(vD),X,X,X,(hG),O,O,(vAD),(vAE),X,(hCC,vI),O,O,A,O,(hJ),O,F,(hAD,vAD),I,H,(hCD),O,O,O,F,X,X,X,(hAJ),O,G,X','7,X,X,X,X,(vEF),(vEC),(vF),X,X,X,(hED,vEB),O,O,O,X,X,(hEB),O,O,O,O,X,X,(hC),O,D,X,X,X,(vI),(hB,vEE),O,O,X,X,(hEB),E,H,D,O,X,X,(hHJ),O,G,O,X,X,X','7,X,X,X,X,(vJF),(vIC),X,X,X,(vIA),(hD,vJE),O,O,X,X,(hIJ,vD),J,O,O,D,(vG),(hJC),I,O,O,(hJA,vC),O,O,(hJF),J,C,(hJF,vJE),O,O,O,X,(hIB),O,O,O,O,X,X,(hJF),O,O,X,X,X','6,X,(vH),(vJE),X,X,X,(hC),J,O,(vJJ),(vJC),X,(hJJ),A,I,O,H,X,X,(hD),O,O,A,(vC),X,(hAI),F,B,O,O,X,X,X,(hC),J,O','7,X,(vA),(vEE),X,X,(vD),(vF),(hEC),O,O,(vIH),(hI,vEB),O,O,(hBD),O,O,O,O,F,O,X,X,(hA),O,O,X,X,X,(vJ),(hEJ,vEG),F,O,(vA),(vG),(hBG),O,O,O,O,O,O,(hEH),O,O,X,(hG),O,O','6,X,X,X,(vFG),(vFC),X,X,(vE),(hFE,vFF),A,O,X,(hBF),O,O,O,O,(vH),(hE),O,O,(hD,vFF),I,O,X,(hFF),O,O,E,D,X,(hFI),O,O,X,X','6,X,X,(vHA),(vFH),X,X,X,(hFF),O,O,(vFH),(vE),X,(hDI,vFG),O,O,O,O,(hFG),B,O,(hC,vFB),O,O,(hDC),O,G,O,F,X,X,X,(hFF),O,O,X','7,X,X,(vBE),(vBB),(vA),X,X,X,(hH),O,O,O,(vBA),(vH),X,(hGI,vBB),O,J,O,O,O,(hBG),O,O,X,(hI),O,O,(hC),O,O,(vBG),(hE,vBD),H,C,(hBI),O,O,O,O,O,X,X,X,(hGG),O,O,O,X','7,X,X,X,X,X,(vHC),(vF),X,X,X,X,(hF,vC),O,E,X,X,(vEJ),(hEF,vEG),F,O,H,X,(hHD),C,O,O,O,X,X,(hHC,vI),A,O,O,O,X,(hJ),D,O,O,X,X,X,(hF),O,O,X,X,X,X','6,X,X,(vH),(vDC),X,X,X,(hCI,vCD),O,O,X,X,(hH),O,O,O,(vCA),(vCB),(hCJ),O,I,O,D,E,X,X,(hDI),E,H,O,X,X,(hG),O,O,X','7,X,X,X,X,(vJ),(vHE),X,X,X,X,(hHA,vHF),O,B,(vHE),X,X,(hEC,vHG),O,O,O,O,X,(hHE,vHG),O,O,(hA,vHB),O,O,(hJ),O,O,(hHE,vJ),O,O,X,(hED),O,J,O,O,X,X,X,(hB),O,O,X,X,X','6,X,X,(vJG),(vA),X,X,X,(hI),B,O,(vJC),(vJH),X,(hJH,vJC),O,E,O,O,(hB),O,O,(hJJ,vF),O,O,(hCE),O,O,D,I,X,X,X,(hB),O,H,X','6,X,X,X,X,(vDG),(vHH),X,X,(vDH),(hJ,vHB),O,O,X,(hJF),O,O,O,O,X,(hHF,vE),O,O,O,X,(hDJ),H,O,O,I,X,(hHC),G,O,X,X,X','7,X,(vAI),(vHC),X,X,X,X,(hD),O,G,X,X,(vHI),(vG),(hAJ),O,O,(vB),(hH,vAH),O,O,X,(hHF,vH),O,O,F,O,O,(hCA),O,O,O,O,O,(vF),(hH),O,O,X,(hG),O,O,X,X,X,X,(hAH),O,O','7,X,X,X,X,(vFG),(vFI),X,X,X,X,(hFI,vFB),O,O,(vFJ),X,(vFA),(hFG,vGA),O,B,O,O,(hIB),O,O,O,(hH,vJ),O,O,(hJ),O,O,(hFD,vD),O,C,O,(hII),O,O,O,O,X,X,X,(hE),O,O,X,X,X','7,X,X,X,(vI),(vEG),(vFD),X,X,(vED),(hA,vEB),O,O,O,X,(hJC),O,O,A,O,O,X,(hEG),O,O,(hEG,vEC),O,O,(vB),X,(hH),O,O,(hJ,vEB),O,O,X,(hEI),O,O,O,O,J,X,(hFF),O,H,O,X,X','6,X,X,(vEI),(vEB),X,X,X,(hEC,vB),O,O,(vEB),X,(hHC),J,O,O,F,(vEC),(hH),O,O,(hB,vEC),O,O,X,(hEH),O,O,O,O,X,X,(hEA),D,O,X','6,X,X,(vAF),(vBF),X,X,X,(hBI),O,G,(vAD),(vBD),X,(hBI,vF),O,J,O,E,(hBB),A,G,(hBI,vBI),O,H,(hAJ),B,O,O,O,X,X,X,(hBA),O,O,X','6,X,(vCB),(vJ),X,X,X,(hCE),A,O,(vCI),X,X,(hCG),D,O,O,(vCC),X,X,(hCA),O,O,O,(vB),X,X,(hB),O,E,G,X,X,X,(hG),O,H','7,X,X,X,X,X,(vFI),(vHG),X,X,X,X,(hHJ,vHH),O,O,X,X,(vHC),(hHD,vHG),O,O,O,X,(hHH),O,O,O,O,X,X,(hFE,vHC),O,O,O,D,X,(hHE),H,O,O,X,X,X,(hHE),I,A,X,X,X,X','7,X,X,(vFA),(vC),X,X,X,X,(hE),O,B,(vAC),(vGJ),X,X,(hFF,vG),O,O,O,O,(vAI),(hAA),O,D,(hAB,vAC),O,O,O,(hAH),O,O,O,(hAB,vAB),O,O,X,(hFJ),O,O,O,O,X,X,X,X,(hAH),O,J,X','7,X,X,X,(vIF),(vIB),X,X,X,X,(hID),O,O,(vC),X,X,(vIF),(hIH,vEE),O,O,O,(vII),(hEB),O,O,O,(hIB,vIF),D,J,(hIF),O,O,(hII,vIE),O,O,O,X,(hJ),O,G,O,X,X,X,X,(hIF),O,O,X,X','7,X,(vDJ),(vDB),X,X,X,X,(hDJ),O,O,(vDF),(vCE),(vI),X,(hCH),O,O,O,O,O,X,X,X,(hDC,vDB),O,A,G,X,X,(hFE),O,O,O,(vDJ),(vI),X,(hCF),O,O,O,O,O,X,X,X,X,(hDE),O,O','6,X,X,(vCI),(vJ),X,X,X,(hA),O,E,(vEG),(vCC),X,(hEG,vCF),O,O,D,O,(hJ),C,G,(hB,vCC),C,O,(hED),O,O,A,O,X,X,X,(hCD),O,O,X','6,X,X,X,(vG),(vFE),X,X,X,(hG,vBC),O,O,(vBC),X,(hFJ,vC),O,E,O,I,(hG),O,O,(hBF,vBC),O,O,(hEJ),O,O,O,O,X,X,(hBA),D,O,X,X','6,X,X,(vAJ),(vE),X,X,X,(hFH,vH),O,O,(vFA),X,(hFH),O,O,O,O,(vFI),(hI),O,C,(hFI,vFD),O,O,X,(hAC),O,O,I,G,X,X,(hC),O,O,X','6,X,X,X,(vE),(vCJ),X,X,(vFF),(hA,vHJ),C,O,X,(hFC),O,O,O,F,(vD),(hFI),O,O,(hFE,vFJ),O,O,X,(hFG),O,O,O,O,X,(hFD),O,O,X,X','7,X,X,X,(vBJ),(vBI),X,X,X,X,(hA),O,O,(vCH),(vBJ),X,(vCJ),(hCB,vG),H,O,I,B,(hBA),O,O,O,(hBE,vG),O,O,(hBB),F,O,(hBE,vBI),O,O,O,(hBI),O,O,O,O,X,X,X,X,(hBC),O,O,X,X','6,X,X,(vCJ),(vD),X,X,X,(hH),O,O,(vBD),(vJ),X,(hCI,vCH),O,J,F,O,(hCG),O,E,(hA,vCD),O,F,(hBF),O,O,O,O,X,X,X,(hCG),O,O,X','6,X,X,X,X,(vJB),(vG),X,X,X,(hA,vH),I,O,X,X,(hCD,vCG),O,O,B,X,(hCF,vCD),O,O,O,X,(hJD),O,H,O,X,X,(hB),O,O,X,X,X','7,X,(vI),(vEH),X,X,(vCC),(vF),(hG),O,O,X,(hH),O,C,(hJ),O,O,(vAD),(hAG,vG),O,O,X,(hEI),F,O,O,O,X,X,(hAD,vAB),O,O,I,O,(vI),(hG),O,O,X,(hC),O,O,(hAJ),O,O,X,(hAA),O,O','7,X,X,X,X,X,(vEC),(vEA),X,X,X,X,(hB),O,O,X,X,(vDF),(vEH),(hEC,vH),H,O,X,(hEA,vI),O,B,E,O,O,(hDB),E,J,O,D,O,X,(hEH),O,A,X,X,X,X,(hI),O,O,X,X,X,X','6,X,X,X,(vBC),(vBC),X,X,X,(hBJ,vEC),H,O,(vBB),X,(hBE,vA),D,J,O,O,(hC),O,O,(hBE,vBG),O,O,(hEG),H,O,B,O,X,X,(hBI),O,O,X,X','7,X,(vE),(vCF),X,X,X,X,(hJ),O,O,(vFB),X,X,X,(hCJ),O,O,A,(vFE),(vCA),X,X,(hIH),O,O,O,O,X,X,(hFF),O,O,O,B,(vFA),X,X,X,(hCI),O,O,O,X,X,X,X,(hFG),O,O','7,X,X,X,X,(vBH),(vH),X,X,X,X,(hI),O,O,(vE),X,X,X,(hJG,vBF),O,O,O,X,(vH),(hBA,vJE),O,O,O,O,(hDG),O,O,O,O,X,X,(hBG),O,F,O,X,X,X,X,(hA),J,O,X,X,X','7,X,X,X,X,X,(vIC),(vA),X,X,X,(vII),(hG,vIH),F,I,X,X,(hIG),O,O,O,D,X,X,(hC,vC),O,O,J,X,X,(hIF,vE),O,G,A,X,X,(hIH),O,O,O,O,X,X,(hJ),F,D,X,X,X,X','7,X,X,X,(vH),(vCJ),X,X,X,(vCG),(hCB,vEG),O,O,X,X,(hEF),O,I,O,O,(vCI),X,(hCD),O,J,(hCB,vCJ),E,O,(vCC),X,(hCE),O,O,(hCI,vH),O,O,X,X,(hEB),O,O,O,O,X,X,(hD),O,O,X,X','6,X,(vGA),(vBE),X,X,X,(hGC),H,O,(vGF),X,X,(hGG),O,O,O,(vGD),X,X,(hBG),O,J,O,(vGD),X,X,(hGD),O,O,E,X,X,X,(hGH),O,O','6,X,X,(vEE),(vEJ),X,X,X,(hI,vEF),O,O,(vEH),X,(hEA),O,O,O,E,(vB),(hEE),O,O,(hB,vB),O,O,X,(hEG),A,O,I,O,X,X,(hA),D,B,X','6,X,(vJ),(vHA),X,X,X,(hHH),D,O,(vHG),X,X,(hI),O,O,F,(vDG),X,X,(hDJ),O,O,O,(vHF),X,X,(hHF),O,O,E,X,X,X,(hHE),B,O','6,X,X,X,X,(vFI),(vE),X,X,X,(hH,vA),J,I,X,X,(hGF,vD),O,O,F,X,(hGF,vC),O,O,A,X,(hD),O,O,O,X,X,(hD),O,O,X,X,X','7,X,X,(vHG),(vE),X,X,X,X,(hGD),O,O,(vGA),(vHC),(vAJ),X,(hGD,vAC),O,O,O,O,O,(hGC),O,O,(hAA,vGC),O,O,O,(hAC),O,O,F,(hGD,vD),O,O,(hHB),O,O,O,O,O,X,X,X,X,(hI),O,D,X','7,X,X,(vBG),(vBJ),X,(vBD),(vE),X,(hC),O,O,(hBB,vAG),O,C,X,(hBE),O,O,O,O,D,X,(hBG),O,O,O,(vBE),X,X,(vE),(hBI,vJ),O,O,O,X,(hCG),F,G,O,O,O,X,(hC),O,O,(hBJ),O,O,X','7,X,X,X,X,X,(vEA),(vJJ),X,X,(vED),(vJI),(hF),O,O,X,(hB),O,O,(hJH,vB),O,O,X,(hED),O,B,O,O,X,X,(hJI,vJI),O,O,C,O,X,(hJH),O,O,(hJJ),O,O,X,(hF),J,E,X,X,X,X','6,X,(vF),(vED),X,X,X,(hEI),O,O,(vEA),X,X,(hEJ),O,O,J,(vB),X,X,(hB),O,O,O,(vG),X,X,(hJ),B,O,C,X,X,X,(hF),O,E','6,X,X,X,X,(vCH),(vCD),X,X,X,(hG,vCH),O,O,X,X,(hCH,vCI),O,O,O,X,(hFA,vCE),O,O,J,X,(hFF),O,O,O,X,X,(hI),F,C,X,X,X','6,X,X,(vCH),(vA),X,X,X,(hE,vE),D,O,(vAG),(vHC),(hHB),O,O,C,O,I,(hHA),O,O,(hE,vJ),O,O,(hCH),A,O,O,O,O,X,X,(hHD),O,O,X','7,X,(vF),(vDG),(vGD),X,X,X,(hA),O,D,O,(vI),(vGE),X,(hDG),O,C,O,O,O,X,(hGC),H,O,(hH,vA),O,O,(vGF),X,(hH),O,O,(hGB,vGD),O,O,X,(hDH),O,D,O,O,O,X,X,X,(hA),O,O,G','7,X,X,X,X,(vIG),(vIG),X,X,X,X,(hCJ),O,O,(vCE),X,X,X,(hIE,vEA),O,O,O,X,(vJ),(hEA,vIE),O,O,O,O,(hCH),O,F,O,O,X,X,(hCH),I,B,O,X,X,X,X,(hCH),O,O,X,X,X','7,X,X,X,X,(vJ),(vDB),X,X,X,X,(hDG,vH),O,O,X,X,(vB),(hJ,vEB),E,O,O,(vG),(hDJ),O,F,D,(hI,vDC),O,O,(hA),O,O,(hJ,vA),O,O,I,X,(hDA),O,O,O,X,X,X,(hDH),O,O,X,X,X','6,X,X,X,(vEE),(vJA),(vEI),X,X,(hD,vEE),O,F,O,X,(hED,vEC),O,O,O,O,(hJ),O,O,(hEH,vEI),O,O,(hIB),O,O,O,O,X,(hII),O,O,O,X,X','6,X,(vE),(vGH),X,X,X,(hC),O,J,(vFJ),X,X,(hGH),O,O,O,(vJ),X,X,(hFA),B,O,I,(vFF),X,X,(hFG),O,O,O,X,X,X,(hB),F,G','6,X,X,(vIF),(vIJ),X,X,X,(hD,vIC),O,O,X,X,(hIB),O,O,O,(vIG),(vA),(hBF),O,O,F,I,O,X,X,(hE),D,O,F,X,X,(hIF),O,C,X','7,X,(vCD),(vB),X,X,X,X,(hII),O,D,(vA),X,X,X,(hIJ),O,O,O,(vII),X,X,(hID),O,O,O,O,(vIJ),(vCJ),X,X,(hCA),H,O,F,O,X,X,X,(hA),O,O,G,X,X,X,X,(hII),J,O','7,X,(vC),(vFF),X,X,(vHF),(vD),(hFD),O,O,(vHG),(hA,vFJ),O,O,(hHF),O,O,O,O,O,O,X,X,(hFG,vFH),O,O,O,X,X,(hFB,vI),O,O,O,(vFB),(vB),(hIG),O,O,O,O,D,J,(hG),O,I,X,(hFE),O,O','7,X,(vHJ),(vDE),X,X,(vDI),(vHH),(hHG),O,J,(vHJ),(hJ),O,O,(hHE),O,O,O,(hHJ,vB),O,O,X,(hHH),O,O,O,O,X,X,(hDJ,vHA),D,O,E,O,(vF),(hHJ),O,O,(hA),O,O,E,(hHA),O,O,X,(hI),O,O','7,X,(vEH),(vFA),X,X,X,X,(hEB),O,O,(vFA),X,X,X,(hFD),O,O,O,(vEE),(vID),X,X,(hFB),O,O,O,O,X,X,(hFJ),O,O,O,O,(vEE),X,X,X,(hJ),O,B,O,X,X,X,X,(hEH),C,O','6,X,(vJ),(vE),X,X,X,(hA),B,C,(vCJ),X,X,(hCG),O,O,O,(vCD),X,X,(hHF),O,O,O,(vJ),X,X,(hE),O,O,H,X,X,X,(hCE),O,O','6,X,(vGC),(vGH),X,X,X,(hGG),O,O,(vGB),X,X,(hGI),E,O,I,(vGG),X,X,(hIJ),O,C,O,(vA),X,X,(hD),G,O,O,X,X,X,(hD),O,O','6,X,X,X,X,(vIG),(vII),X,X,X,(hE,vIA),I,G,X,X,(hGJ,vGF),O,C,O,X,(hIE,vII),D,O,O,X,(hGJ),O,B,O,X,X,(hA),O,J,X,X,X','6,X,X,X,X,(vIA),(vE),X,X,(vJB),(hB,vII),I,J,X,(hIF),O,O,O,H,X,(hIB,vG),D,J,O,X,(hJG),C,O,O,F,X,(hB),O,O,X,X,X','7,X,X,X,(vDB),(vGG),X,X,X,X,(hGH),O,O,(vGA),(vGA),X,X,(hGF,vGA),O,O,O,O,X,(hGA,vGE),B,O,(hGD,vI),O,O,(hJ),O,I,(hGE,vGG),O,O,X,(hDA),O,D,O,O,X,X,X,X,(hF),O,O,X,X','6,X,X,X,(vFB),(vI),X,X,X,(hGF),O,O,(vGA),X,(vH),(hGA,vFD),O,O,O,(hFF),O,A,O,O,C,(hGG),O,J,O,X,X,X,(hGH),O,D,X,X','6,X,X,(vGA),(vA),X,X,X,(hB,vGE),O,O,(vHJ),X,(hBD),O,O,O,O,(vGH),(hGC),O,O,(hGJ,vGE),O,O,X,(hGG),O,F,O,O,X,X,(hGC),O,O,X','7,X,X,(vCE),(vG),(vI),X,X,X,(hEE),A,O,E,(vCD),(vCH),X,(hEG,vCD),O,O,O,O,O,(hA),G,C,X,(hEH),O,O,(hEE),O,O,(vI),(hA,vD),O,O,(hCF),O,O,O,O,O,X,X,X,(hED),O,O,B,X','7,X,(vG),(vDC),X,(vBA),(vDG),X,(hJ),O,G,(hDA,vBA),O,O,X,(hBC),O,O,G,O,O,X,X,(hDH),O,O,O,(vG),X,X,X,(hG,vDI),O,O,O,(vJ),X,(hBB),E,O,O,O,O,X,(hH),O,J,(hB),O,O','6,X,X,X,(vJG),(vCG),X,X,(vJG),(hJB,vJH),O,O,X,(hJH),I,B,O,O,(vD),(hJB),O,O,(hA,vJG),O,O,X,(hJB),O,B,O,O,X,(hF),I,C,X,X','7,X,(vA),(vE),X,X,(vD),(vB),(hF),O,O,(vJJ),(hI,vGD),O,O,(hGD),O,O,O,O,I,O,X,X,(hJI),O,O,X,X,X,(vJE),(hA,vF),I,O,(vD),(vJJ),(hGA),O,O,O,J,O,O,(hH),O,O,X,(hI),O,O','7,X,X,(vEH),(vEF),X,X,X,X,(hEI,vIH),O,O,(vEI),X,X,(hEI),O,O,O,O,(vIE),(vEJ),(hD),O,O,(hEH,vH),O,O,O,(hEC),O,O,O,(hD,vC),H,G,X,X,(hIA),O,O,O,O,X,X,X,(hD),E,O,X','7,X,X,X,X,X,(vEA),(vCJ),X,X,X,X,(hCD,vCC),O,O,X,X,(vCI),(hCJ,vEH),O,O,O,X,(hDH),O,J,B,O,X,X,(hCH,vD),O,O,O,O,X,(hCJ),O,O,O,X,X,X,(hJ),O,G,X,X,X,X','7,X,(vB),(vFF),X,(vEI),(vFE),X,(hH),O,O,(hFC,vIB),G,O,X,(hFC),O,O,O,O,O,X,X,X,(hFH),O,D,X,X,X,X,(hFF,vFG),O,O,(vFE),(vFH),X,(hEE),O,O,J,O,O,X,(hFG),O,O,(hFG),O,O','6,X,(vHE),(vII),X,X,X,(hHB),O,O,(vHF),(vHJ),X,(hHD),B,O,O,O,X,X,(hG),H,O,O,(vHE),X,(hCA),O,O,E,B,X,X,X,(hHB),O,G','6,X,(vH),(vAF),X,X,X,(hAC),O,O,(vAD),X,X,(hDI),J,O,O,(vAH),X,X,(hAC),O,O,O,(vAI),X,X,(hH),O,O,B,X,X,X,(hAH),O,E','6,X,(vC),(vHA),X,X,X,(hC),O,J,(vHA),X,X,(hF),J,O,O,(vHC),X,X,(hI),O,J,O,(vF),X,X,(hEJ),O,O,B,X,X,X,(hG),O,O','6,X,X,X,(vFJ),(vJC),X,X,(vFF),(hFF,vJE),O,O,X,(hFH),O,F,O,O,(vD),(hFI),O,C,(hE,vH),D,O,X,(hJC),O,O,O,A,X,(hFG),O,J,X,X','7,X,X,X,X,X,(vDE),(vBB),X,(vC),(vDF),X,(hBF),O,O,(hH),O,O,(vE),(hH,vBI),B,O,(hDF),O,O,O,O,D,(vE),X,(hDI,vBE),O,O,C,O,B,(hBF),O,A,X,(hG),E,D,(hG),O,O,X,X,X,X','7,X,(vJ),(vFH),X,X,X,X,(hHH),F,A,X,X,(vGE),(vA),(hI),O,O,(vC),(hF,vD),O,O,X,(hHC,vF),H,O,O,O,O,(hGJ),O,O,O,O,O,(vE),(hE),O,O,X,(hHI),O,O,X,X,X,X,(hA),O,O','7,X,X,(vCD),(vCB),(vF),X,X,X,(hCA,vCJ),O,O,O,(vFH),X,(hCD),O,O,O,O,O,(vCB),(hH),O,O,X,(hI),O,O,(hCE),O,B,(vCE),(hCH,vCI),O,G,X,(hFA),O,G,O,O,O,X,X,(hBC),H,O,O,X','6,X,X,X,X,(vHD),(vHH),X,X,X,(hA,vHH),H,I,X,X,(hHJ,vIG),O,C,O,X,(hHC,vE),O,O,O,X,(hIG),J,O,O,X,X,(hHF),O,O,X,X,X','6,X,X,(vFD),(vJB),X,X,X,(hH,vH),O,O,(vJD),X,(hFH),O,O,O,O,(vJI),(hJD),O,O,(hJD,vG),J,E,X,(hJD),O,O,O,O,X,X,(hB),A,O,X','6,X,X,X,(vC),(vDC),X,X,(vF),(hHB,vDI),O,O,(vDJ),(hDG),O,O,E,O,O,(hHA),O,O,(hHD,vG),O,O,(hEJ),O,O,F,O,O,X,(hJ),O,O,X,X','7,X,X,X,X,X,(vEJ),(vG),X,X,X,X,(hD,vI),C,O,X,X,(vEG),(hFE,vFE),O,O,O,X,(hFD),O,O,O,O,X,X,(hEC,vFI),O,O,O,O,X,(hEC),B,O,H,X,X,X,(hJ),O,O,X,X,X,X','7,X,(vI),(vAC),X,X,(vAI),(vCG),(hB),O,I,X,(hCB,vCD),O,O,(hH),A,D,(hCD,vAF),O,O,O,X,(hAC),O,O,O,O,X,X,(hCF,vCC),O,O,O,O,(vB),(hCB),O,O,O,(hCF),O,O,(hCB),O,J,X,(hB),O,O','6,X,X,X,(vJB),(vIG),X,X,(vA),(hJI,vJC),O,F,X,(hJB),O,O,O,O,(vJE),(hJD),B,O,(hJB,vD),O,H,X,(hJG),O,I,O,O,X,(hA),O,E,X,X','7,X,X,X,X,(vCD),(vCC),(vB),X,X,X,(hCC,vEC),O,I,O,X,X,(hCH),C,O,O,O,X,X,(hCA),F,O,X,X,X,(vA),(hCH,vCE),O,E,X,X,(hGA),C,O,O,O,X,X,(hCE),O,O,O,X,X,X','6,X,X,X,X,(vJI),(vA),X,X,(vJH),(hJE,vJI),O,G,X,(hJE),F,O,O,D,X,(hC,vB),O,E,O,X,(hJH),O,O,O,O,X,(hJD),O,E,X,X,X','6,X,X,X,X,(vAJ),(vAJ),X,X,X,(hAF,vGB),O,O,X,X,(hAE,vD),O,O,O,X,(hAJ,vF),O,J,O,X,(hAF),O,O,H,X,X,(hB),O,I,X,X,X','7,X,X,X,X,(vH),(vIE),X,X,X,X,(hA,vA),O,O,X,X,(vID),(hF,vCH),O,O,A,(vIE),(hIH),O,O,O,(hIA,vIH),O,O,(hIE),O,O,(hIG,vIA),B,O,O,X,(hIF),O,G,A,X,X,X,(hIE),O,D,X,X,X','7,X,(vEF),(vB),(vFC),X,X,X,(hH),O,O,O,(vEA),X,X,(hED),C,O,O,O,X,X,X,X,(hEG),O,F,X,X,X,X,(hEI),O,O,(vEH),(vI),X,X,(hFH),O,O,O,O,X,X,X,(hEE),O,I,O','6,X,(vHI),(vDG),X,X,X,(hHE),J,O,(vDG),X,X,(hHC),H,O,O,(vHA),X,X,(hDH),F,O,G,(vHE),X,X,(hHC),O,O,O,X,X,X,(hHE),O,O','6,X,X,(vAD),(vAE),X,X,X,(hAA),O,O,(vAD),(vAA),X,(hAI,vI),O,F,D,J,(hC),A,O,(hB,vJ),A,E,(hAB),O,I,C,J,X,X,X,(hI),O,H,X','6,X,X,(vDA),(vE),X,X,X,(hJ,vDE),O,F,(vGG),X,(hDJ),O,O,O,O,(vC),(hDD),O,O,(hJ,vI),O,O,X,(hGG),O,D,O,O,X,X,(hDA),G,B,X','7,X,X,(vJD),(vG),(vI),X,X,X,(hG),O,O,H,(vEB),(vEF),X,(hEB),O,O,B,O,J,X,(hEJ,vA),O,H,(hEE,vEA),O,O,(hA),O,O,(hEJ,vG),O,O,X,(hJF),O,O,O,O,O,X,X,X,(hG),F,O,O,X','6,X,X,X,X,(vEJ),(vG),X,X,X,(hDE,vF),O,O,X,X,(hDJ,vF),O,O,O,X,(hA,vDA),O,O,O,X,(hDI),B,O,O,X,X,(hDE),C,O,X,X,X','6,X,X,(vAC),(vD),X,X,X,(hD,vEI),O,O,(vBC),X,(hBA),O,O,O,O,(vH),(hEF),O,O,(hEI,vF),O,O,X,(hEF),O,O,A,O,X,X,(hEE),G,D,X','6,X,X,(vGB),(vD),X,X,X,(hGG),A,C,(vGJ),(vC),X,(hGG,vGC),O,O,O,J,(hGH),O,O,(hE,vI),G,H,(hHF),O,H,O,O,X,X,X,(hE),O,O,X','6,X,X,(vIJ),(vCD),X,X,X,(hCD),O,O,(vCI),(vCG),X,(hIH,vCC),G,O,O,O,(hCE),O,I,(hCH,vCD),G,O,(hIC),B,D,O,O,X,X,X,(hA),O,O,X','7,X,(vII),(vDH),(vID),X,X,X,(hIG),O,O,O,X,X,X,(hDA),O,C,J,(vII),X,X,X,(hID),F,O,O,(vDH),X,X,X,(hID),O,O,O,(vID),X,X,X,(hIE),A,O,O,X,X,X,(hDD),O,O,O','7,X,(vEB),(vF),X,X,X,X,(hED),O,O,(vAJ),(vED),(vD),X,(hIB),O,O,O,G,O,X,X,X,(hF,vA),O,O,O,X,X,(hED),O,O,F,(vA),(vEB),X,(hIE),O,H,O,O,O,X,X,X,X,(hEE),O,O','7,X,X,X,X,(vCA),(vCE),(vB),X,X,X,(hF),O,O,O,X,X,X,(hJG,vCD),I,O,O,X,X,(hF,vB),O,O,O,X,X,(hJI,vCI),O,F,O,X,X,(hD),O,O,O,X,X,X,(hCI),O,O,O,X,X,X','6,X,(vJI),(vI),X,X,X,(hH),O,O,(vD),X,X,(hJA),F,O,O,(vJH),X,X,(hJI),C,G,O,(vJJ),X,X,(hD),O,O,O,X,X,X,(hJE),O,O','6,X,X,X,(vDC),(vAE),X,X,X,(hI),O,B,(vI),X,(vC),(hJ,vDE),O,O,O,(hAF),A,D,O,O,O,(hI),O,O,G,X,X,X,(hDA),H,O,X,X','7,X,X,X,(vFD),(vAF),X,X,X,(vFD),(hFE,vFA),B,O,X,X,(hHI),O,O,O,O,(vFF),X,(hFI),O,O,(hC,vG),O,H,(vFA),X,(hE),O,O,(hFB,vC),O,O,X,X,(hFJ),O,G,O,O,X,X,(hH),O,O,X,X','7,X,X,X,X,(vD),(vHD),X,X,X,(vDH),(hA,vJJ),O,O,(vE),X,(hHB,vJH),O,O,O,E,J,(hJE),H,O,O,(hD,vF),O,O,(hJG),E,O,(hJE,vJG),C,O,O,(hHH),J,O,O,O,O,X,X,(hJJ),O,O,X,X,X','7,X,X,X,X,(vBA),(vEB),X,X,X,(vBG),(hC,vBB),O,O,X,X,(hBD,vBA),O,O,O,O,(vBJ),(hBC),O,O,O,(hBG,vBD),A,O,(hBB),O,O,(hEE,vBF),O,O,D,X,(hBJ),O,O,O,I,X,X,(hBD),O,O,X,X,X','7,X,X,X,X,X,(vDG),(vC),X,(vB),(vFH),X,(hC),E,O,(hA),O,O,(vDD),(hH,vDB),O,O,(hDA),C,O,O,O,O,(vE),X,(hFH,vDE),O,O,H,O,F,(hDH),O,O,X,(hDI),O,O,(hJ),O,O,X,X,X,X','6,X,(vB),(vE),X,X,X,(hA),D,O,(vA),X,X,(hH),O,C,O,(vIG),X,X,(hDI),O,O,O,(vDF),X,X,(hIF),O,O,O,X,X,X,(hH),O,O','7,X,(vHF),(vC),X,X,(vC),(vHF),(hC),O,O,(vBC),(hA,vBF),O,O,(hBE),O,O,O,O,O,O,X,X,(hHD),A,O,X,X,X,(vD),(hJ,vHA),O,O,(vHI),(vC),(hCH),J,O,O,O,O,B,(hHH),O,O,X,(hE),O,O','6,X,X,X,(vJ),(vDA),X,X,(vFD),(hB,vFE),O,O,(vDA),(hDJ),O,O,O,O,O,(hDE),O,O,(hDA,vC),O,H,(hBA),O,I,O,G,O,X,(hJ),E,O,X,X','6,X,(vGA),(vA),X,X,X,(hGE),O,O,(vGD),X,X,(hGA),O,G,A,(vED),X,X,(hGE),O,O,O,(vGD),X,X,(hEB),C,H,F,X,X,X,(hGE),A,I','6,X,(vIC),(vFD),X,X,X,(hIG),O,C,(vIB),X,X,(hFJ),O,O,O,(vII),X,X,(hIE),O,O,F,(vIA),X,X,(hIJ),F,I,O,X,X,X,(hIC),O,O','6,X,X,X,(vJG),(vHH),X,X,X,(hHA),O,O,(vHD),X,(vE),(hJF,vHJ),O,O,O,(hHB),F,O,D,O,O,(hE),O,J,O,X,X,X,(hHE),I,O,X,X','7,X,X,X,(vGG),(vI),(vEC),X,X,(vBH),(hJ,vBI),O,O,O,X,(hBJ),O,O,O,O,O,(vJ),(hGJ),O,O,X,(hA),O,O,(hGC),O,O,(vC),(hGB,vGJ),O,O,X,(hBF),O,O,O,O,B,X,(hBH),O,O,O,X,X','7,X,X,X,X,X,(vD),(vHB),X,X,(vG),(vFC),(hHA,vAI),O,O,X,(hAB),O,O,O,O,O,X,(hAD),O,O,O,(vHB),X,X,(vF),(hAF,vHI),O,O,O,X,(hAB),O,O,O,O,O,X,(hB),O,E,X,X,X,X','6,X,(vBC),(vDF),X,X,X,(hBE),O,O,(vDB),X,X,(hDG),O,J,O,(vC),X,X,(hBI),O,O,O,(vBB),X,X,(hBA),O,O,D,X,X,X,(hBG),F,O','6,X,X,X,(vH),(vDC),(vGA),X,X,(hA,vIE),O,O,O,X,(hIG,vGG),O,O,O,O,(hF),O,O,(hGF,vJ),J,O,(hGA),O,O,O,O,X,(hIE),O,O,O,X,X','6,X,(vHC),(vHJ),X,X,X,(hHC),A,B,(vA),X,X,(hHI),O,O,O,(vHA),X,X,(hD),F,O,O,(vB),X,X,(hII),G,O,O,X,X,X,(hB),O,O','7,X,(vH),(vJA),X,X,(vIE),(vJI),(hJC),O,O,(vDG),(hJE,vIG),O,O,(hDD),I,O,O,O,O,O,X,X,(hII,vIG),O,O,O,X,X,(hIE,vJA),O,O,O,(vB),(vJI),(hDG),C,O,O,O,O,O,(hJF),O,O,X,(hH),O,O','7,X,(vHH),(vBE),X,X,X,X,(hE),B,O,X,(vHF),(vBJ),X,(hHI),C,O,(hJ,vHI),O,O,X,X,(hBC),D,O,O,O,X,X,(hHH),O,O,D,O,(vHF),X,(hHD),F,O,(hHD),G,O,X,X,X,X,(hHE),O,O','7,X,X,X,X,X,(vIF),(vI),X,X,X,X,(hB,vGF),O,O,X,X,(vEG),(hGG,vB),O,O,O,X,(hGJ),O,O,O,H,X,X,(hGA,vA),O,O,O,O,X,(hGC),I,H,O,X,X,X,(hH),G,J,X,X,X,X','7,X,X,X,X,X,(vJF),(vJF),X,X,X,X,(hJD),A,O,X,X,(vBG),(vJB),(hI,vI),O,O,X,(hBD,vJF),F,O,O,E,O,(hIB),O,O,O,O,C,X,(hJG),O,B,X,X,X,X,(hI),O,J,X,X,X,X','6,X,X,(vEI),(vC),X,X,X,(hH,vGG),O,O,(vGD),X,(hBJ),O,O,O,O,(vD),(hGI),O,O,(hD,vD),E,G,X,(hBG),O,O,A,O,X,X,(hJ),O,O,X','7,X,X,X,X,(vFI),(vJF),X,X,X,X,(hJH),O,O,(vJC),X,X,X,(hEE,vEC),O,O,O,X,(vJE),(hED,vEF),O,O,O,G,(hJB),O,O,O,O,X,X,(hEH),O,O,G,X,X,X,X,(hJG),O,O,X,X,X','7,X,X,X,(vJ),(vEI),X,X,X,X,(hJ,vEC),O,A,(vBD),X,X,(hHC,vEA),O,O,O,I,(vF),(hEE),O,O,(hEE,vHD),B,J,O,(hHE),O,O,O,(hG,vED),O,O,X,(hHD),O,O,O,O,X,X,X,(hEA),O,O,X,X','7,X,X,X,X,X,(vFH),(vED),X,X,X,X,(hEC,vEA),O,O,X,X,(vED),(hFI,vEH),O,O,O,X,(hEE),O,O,A,D,X,X,(hFB,vJ),O,O,O,J,X,(hFI),O,O,O,X,X,X,(hI),O,A,X,X,X,X','6,X,(vB),(vHI),X,X,X,(hHH),O,O,(vHJ),(vGA),X,(hHH),O,O,O,I,X,X,(hGE),O,A,O,(vHE),X,(hHJ),H,B,F,D,X,X,X,(hHJ),O,C'
+]
+```
+
 ## --seed-contents--
 
 ```js
-function euler424() {
+function kakuro(puzzles) {
 
   return true;
 }
 
-euler424();
+const testPuzzles = [
+  '6,X,X,(vCC),(vI),X,X,X,(hH),B,O,(vCA),(vJE),X,(hFE,vD),O,O,O,O,(hA),O,I,(hJC,vB),O,O,(hJC),H,O,O,O,X,X,X,(hJE),O,O,X','7,X,X,X,X,(vJJ),(vCD),X,X,X,X,(hCG),O,O,(vCE),X,X,X,(hCI,vJB),C,O,O,X,(vB),(hJF,vJF),O,F,O,O,(hJA),F,G,O,O,X,X,(hCA),O,A,O,X,X,X,X,(hCF),O,O,X,X,X','7,X,X,X,(vE),(vCB),X,X,X,X,(hJ),O,O,(vCA),X,X,(vCH),(hCG,vCJ),O,O,O,(vJ),(hCE),O,O,O,(hJ,vGG),O,O,(hD),I,O,(hCD,vCB),H,O,O,X,(hCE),O,O,E,X,X,X,X,(hCE),O,O,X,X','6,X,X,X,(vEA),(vJF),X,X,X,(hI),O,O,(vJA),X,(vA),(hEI,vEB),O,O,O,(hIG),C,O,J,O,D,(hJD),O,O,O,X,X,X,(hJD),O,O,X,X','7,X,(vH),(vG),X,X,(vI),(vDH),(hG),B,O,(vDI),(hDB,vDE),O,O,(hBC),I,O,F,O,O,J,X,X,(hG),O,O,X,X,X,(vDG),(hH,vDD),O,O,(vDJ),(vC),(hBI),O,O,O,O,O,O,(hDJ),O,O,X,(hA),O,O','6,X,(vID),(vIJ),X,X,X,(hH),F,I,(vF),(vIA),X,(hIA),G,B,O,C,X,X,(hID),O,O,O,(vIF),X,(hIA),E,O,I,O,X,X,X,(hII),O,G','6,X,X,(vAF),(vAI),X,X,X,(hJ,vAC),O,B,(vGJ),X,(hGH),J,O,O,O,(vAF),(hAG),O,O,(hH,vF),A,D,X,(hGF),O,E,O,O,X,X,(hD),O,O,X','7,X,X,X,X,(vCE),(vGB),X,X,(vJG),(vCI),(hCD,vCJ),O,O,X,(hCI),O,O,O,O,B,(vJB),(hCF),O,O,O,(hCA,vH),O,O,(hCJ),O,O,(hJB,vCJ),O,O,O,X,(hJD),O,O,O,O,O,X,(hF),I,O,X,X,X','7,X,(vBB),(vBD),X,X,X,X,(hBB),C,E,(vEE),(vEC),X,X,(hBC),O,O,O,O,X,X,X,(hEF),H,O,A,(vJ),X,X,X,(hBD),O,O,O,(vI),X,X,(hBE),F,O,O,O,X,X,X,X,(hG),O,O','7,X,X,(vGG),(vGD),X,(vI),(vGI),X,(hGB),O,O,(hGH,vIC),O,O,X,(hGA),O,O,O,J,O,X,X,(hGI),O,O,X,X,X,(vGD),(hE,vE),O,O,(vGF),X,(hIH),O,O,O,O,O,X,(hE),A,O,(hGF),O,O,X','6,X,(vIJ),(vIE),X,X,X,(hF),O,C,(vIA),X,X,(hCA),O,O,D,(vIH),X,X,(hIB),E,O,O,(vF),X,X,(hD),O,A,O,X,X,X,(hID),O,G','6,X,(vAD),(vGI),(vI),X,X,(hB),O,O,O,(vAF),X,(hGC),O,O,O,O,(vGA),(hGE),O,O,(hJ,vB),O,O,X,(hGD),D,O,E,O,X,X,(hAI),O,C,O','6,X,X,X,(vAB),(vFA),X,X,X,(hHI),O,O,(vHJ),X,(vA),(hFJ,vHE),I,D,O,(hFH),O,O,O,O,O,(hHJ),O,O,O,X,X,X,(hC),O,J,X,X','7,X,X,X,(vJ),(vEF),X,X,X,X,(hI,vGD),C,E,(vEF),(vA),X,(hEH),O,O,O,O,O,X,(hH,vJ),O,O,(hJ,vEJ),O,O,(hD),O,A,(hEF,vEB),O,O,X,(hCC),O,O,A,O,O,X,X,X,(hH),O,O,X,X','7,X,X,X,(vAG),(vAJ),(vFH),X,X,X,(hFD),O,O,O,X,X,(vH),(hAJ,vAB),O,O,O,(vB),(hAH),O,H,O,(hC,vAI),O,O,(hE),O,O,(hAI,vAE),O,O,O,X,(hJ),O,O,O,X,X,X,(hFG),E,O,O,X,X','7,X,(vAI),(vHB),X,X,(vJE),(vAA),(hD),O,O,X,(hG),O,O,(hAJ),O,O,(vE),(hAA,vAI),O,O,X,(hHF),O,O,O,O,X,X,(hJF,vAE),O,O,O,J,(vH),(hAI),D,O,X,(hB),O,O,(hAG),O,O,X,(hAA),O,O','7,X,X,(vHJ),(vC),(vAF),X,X,X,(hHF),O,O,O,(vHI),(vHD),X,(hHB,vAB),O,O,O,O,E,(hAI),O,O,X,(hAB),O,O,(hD),O,O,(vAB),(hAI,vE),J,O,(hHH),O,O,O,B,O,X,X,X,(hG),O,A,O,X','6,X,X,(vDF),(vHE),X,X,X,(hHJ,vE),C,O,X,X,(hHI),O,O,O,(vDF),(vHH),(hFA),A,O,B,O,O,X,X,(hE),O,I,O,X,X,(hHH),O,O,X','6,X,(vA),(vA),X,X,X,(hE),O,O,(vCJ),X,X,(hG),O,O,O,(vHI),X,X,(hHC),O,O,H,(vB),X,X,(hCE),O,O,D,X,X,X,(hE),O,O','6,X,X,X,X,(vEH),(vEC),X,X,X,(hEB,vEJ),O,O,X,X,(hEC,vEF),O,O,B,X,(hDD,vEI),O,B,C,X,(hB),O,D,A,X,X,(hEC),O,O,X,X,X','6,X,X,X,X,(vIF),(vH),X,X,X,(hIJ,vGJ),B,I,X,X,(hIB,vIC),O,O,G,X,(hIA,vC),O,O,O,X,(hE),O,O,O,X,X,(hIA),E,O,X,X,X','7,X,(vC),(vFB),X,X,X,X,(hFH),O,O,(vFA),(vFJ),(vC),X,(hFJ),O,O,O,O,O,X,X,X,(hA,vJ),O,O,O,X,X,(hG),D,O,O,(vC),(vFC),X,(hBH),A,O,O,O,E,X,X,X,X,(hFH),O,I','6,X,X,(vFD),(vC),X,X,X,(hDH),E,F,(vDG),(vDD),X,(hDF,vDI),O,O,A,O,(hDG),O,O,(hDG,vDG),O,O,(hDJ),O,D,J,O,X,X,X,(hJ),E,O,X','6,X,X,X,(vE),(vGH),(vIC),X,X,(hD,vIG),O,O,A,X,(hIF,vJ),O,J,E,O,(hJ),O,D,(hGG,vGH),O,O,(hGG),O,O,O,O,X,(hIC),O,O,O,X,X','7,X,X,X,X,(vAG),(vJA),(vH),X,X,X,(hAJ,vDJ),O,O,O,X,X,(hJF),O,O,O,O,X,X,(hG),D,O,X,X,X,(vJH),(hJE,vJD),C,I,X,X,(hAE),B,O,O,O,X,X,(hAJ),O,O,E,X,X,X','7,X,X,X,X,(vGG),(vIA),(vGF),X,X,X,(hGF),O,O,D,X,X,X,(hGJ,vIB),O,O,O,X,X,(hGH,vGD),O,O,O,X,X,(hII,vC),O,J,O,X,X,(hIH),J,O,O,X,X,X,(hGE),O,I,O,X,X,X','6,X,X,(vFA),(vEC),X,X,X,(hI,vFI),F,O,X,X,(hDE),O,O,O,(vFF),(vFF),(hDI),G,J,O,F,O,X,X,(hFJ),O,D,O,X,X,(hFH),J,A,X','7,X,X,X,X,X,(vID),(vBB),X,X,X,X,(hBC),O,I,X,X,(vIH),(vBH),(hBF,vF),O,O,X,(hIE,vD),O,O,I,O,O,(hAG),O,O,O,O,F,X,(hA),O,O,X,X,X,X,(hD),O,O,X,X,X,X','7,X,(vCD),(vCC),X,X,X,X,(hE),B,C,(vCE),X,X,X,(hCD),O,O,O,(vE),(vCG),X,X,(hCH),O,O,O,O,X,X,(hFC),B,J,G,O,(vCC),X,X,X,(hCI),O,O,O,X,X,X,X,(hG),O,O','7,X,X,X,(vID),(vD),(vFB),X,X,X,(hIB,vID),O,O,O,X,X,(hJE,vIA),J,C,O,D,(vF),(hIB),O,O,X,(hIG),O,O,(hIJ),O,O,(vD),(hA,vID),O,O,X,(hJF),O,O,O,O,X,X,(hIE),O,O,O,X,X','7,X,X,(vAC),(vAH),X,X,X,X,(hD),O,O,(vAD),X,X,X,(hCH,vAD),O,O,O,(vAA),(vF),(hAC),O,H,(hAB,vAJ),O,O,A,(hAE),O,O,O,(hD,vAD),O,O,X,X,(hAC),O,O,O,X,X,X,X,(hG),O,O,X','6,X,X,(vBB),(vBE),X,X,X,(hBH),O,I,(vBG),(vBB),X,(hHE,vBD),H,D,O,O,(hBA),C,O,(hA,vG),O,O,(hBF),I,O,O,O,X,X,X,(hG),O,O,X','6,X,X,(vEC),(vD),X,X,X,(hD,vH),O,O,(vIB),X,(hIA),O,O,O,O,(vE),(hII),O,F,(hII,vIG),O,O,X,(hIH),O,O,O,O,X,X,(hIA),O,D,X','6,X,X,X,X,(vEH),(vEG),X,X,X,(hEB,vEF),O,O,X,X,(hAC,vG),O,B,O,X,(hEE,vEC),O,D,O,X,(hEE),O,O,O,X,X,(hEJ),D,O,X,X,X','6,X,(vD),(vB),X,X,X,(hA),O,O,(vE),X,X,(hE),A,O,O,(vCJ),X,X,(hCH),O,A,O,(vCI),X,X,(hB),O,D,O,X,X,X,(hCB),G,O','7,X,X,X,X,(vHJ),(vIF),(vIB),X,X,X,(hIH,vJI),O,O,J,X,X,(hIA),O,O,O,F,X,X,(hIG),O,C,X,X,X,(vD),(hA,vIB),O,J,X,X,(hHB),O,O,O,O,X,X,(hHB),O,O,O,X,X,X','7,X,X,X,(vBJ),(vIB),X,X,X,(vIF),(hBB,vBB),O,O,(vBA),X,(hIC),O,O,O,O,O,(vBA),(hBD),O,O,(hC,vC),O,O,O,(hBJ),E,O,O,(hBC,vBI),G,H,X,(hBA),O,O,O,O,O,X,X,(hBF),O,O,X,X','7,X,(vHI),(vHE),X,X,X,X,(hA),O,O,X,X,X,X,(hHG),O,O,(vHH),(vHE),(vIJ),X,(hHA),O,O,O,O,O,(vHI),X,(hID),H,O,O,B,I,X,X,X,X,(hHB),F,O,X,X,X,X,(hHE),O,H','6,X,X,(vAJ),(vAJ),X,X,X,(hAF,vAA),G,A,X,X,(hDA),O,O,O,(vDE),(vAH),(hAJ),O,O,O,O,I,X,X,(hAG),D,C,O,X,X,(hAI),O,O,X','6,X,X,X,X,(vDH),(vDA),X,X,X,(hG,vDG),O,E,X,X,(hBJ,vBC),O,O,O,X,(hBI,vE),O,E,O,X,(hE),O,O,O,X,X,(hDH),O,E,X,X,X','6,X,X,X,X,(vHJ),(vHH),X,X,X,(hHE,vCC),O,O,X,X,(hF,vG),A,O,O,X,(hHC,vHJ),O,B,O,X,(hHH),O,O,O,X,X,(hHI),O,O,X,X,X','7,X,(vJ),(vDG),X,X,(vDF),(vEF),(hC),E,B,X,(hEA),O,O,(hEE),C,O,(vH),(hED,vEF),A,O,X,(hEC),O,O,O,O,X,X,(hDD,vEF),O,O,O,O,(vEA),(hEJ),O,F,X,(hJ),O,O,(hEF),O,O,X,(hEF),O,O','7,X,X,X,(vCC),(vD),X,X,X,(vJE),(hI,vCH),O,O,(vBF),X,(hCC),O,O,O,O,A,(vJB),(hCB),G,O,O,(hJA,vJF),O,O,(hJA),O,O,(hG,vH),O,O,O,X,(hCE),O,O,O,O,O,X,X,(hH),O,O,X,X','7,X,X,(vEI),(vEB),(vG),X,X,X,(hEF),E,O,O,(vHE),X,X,(hEF,vH),O,O,O,O,(vEI),(hH),O,O,X,(hEH),O,B,(hG),O,O,(vG),(hEI,vED),O,O,X,(hAG),C,O,O,O,X,X,X,(hEE),O,O,O,X','6,X,X,X,X,(vJE),(vF),X,X,X,(hI,vJJ),O,O,X,X,(hEC,vJJ),H,O,O,X,(hF,vJB),O,O,O,X,(hJI),A,C,E,X,X,(hJD),O,J,X,X,X','6,X,X,X,(vH),(vAE),X,X,X,(hCB,vCJ),O,O,(vCB),X,(hCA,vD),O,O,O,O,(hD),C,O,(hCC,vJ),O,O,(hAB),A,O,F,O,X,X,(hB),G,O,X,X','6,X,X,(vEC),(vEG),X,X,X,(hEF),O,O,(vFC),(vEI),X,(hHJ,vJ),E,O,O,A,(hJ),O,O,(hEA,vEA),O,O,(hHH),O,O,O,B,X,X,X,(hEF),O,O,X','7,X,(vEI),(vEC),X,X,X,X,(hH),O,O,X,X,X,X,(hED),O,O,(vEB),(vEG),(vGB),X,(hEJ),O,O,O,O,O,(vD),X,(hIA),O,O,O,O,C,X,X,X,X,(hA),O,I,X,X,X,X,(hEB),A,O','7,X,X,X,(vF),(vG),(vIB),X,X,(vG),(hBA,vIH),J,I,D,X,(hBG),O,O,O,O,O,(vBG),(hA),O,O,X,(hE),O,O,(hBB),O,C,(vA),(hBI,vBE),O,O,X,(hBA),O,O,O,O,O,X,(hBF),O,O,O,X,X','7,X,X,(vEF),(vDI),X,X,X,X,(hDG),O,O,(vDA),X,X,X,(hEA,vG),O,O,O,(vEJ),(vJ),(hF),O,G,(hDH,vDI),O,O,F,(hED),O,O,O,(hDD,vB),O,O,X,X,(hDB),O,O,A,X,X,X,X,(hH),O,O,X','7,X,X,X,X,(vJH),(vD),(vAJ),X,X,X,(hAC,vDH),O,O,O,X,X,(hAA),O,O,O,O,X,X,(hC),F,O,X,X,X,(vC),(hAJ,vAA),I,H,X,X,(hJA),O,D,O,G,X,X,(hJB),O,C,O,X,X,X','6,X,X,X,(vDC),(vG),X,X,X,(hA),O,O,(vCH),X,(vCI),(hCB,vB),O,O,O,(hDF),O,H,O,O,O,(hH),O,O,O,X,X,X,(hH),J,O,X,X','6,X,X,(vCG),(vGA),X,X,X,(hE),O,O,(vGG),(vGB),X,(hCI,vF),O,O,O,I,(hGI),O,O,(hI,vD),O,A,(hGH),O,B,O,O,X,X,X,(hA),O,O,X','6,X,X,X,(vJ),(vHF),X,X,(vF),(hHG,vHD),O,A,X,(hHI),A,O,O,O,(vHE),(hB),G,O,(hD,vHE),O,F,X,(hGJ),O,O,O,O,X,(hHD),O,O,X,X','6,X,X,X,X,(vBD),(vD),X,X,X,(hD,vBB),O,O,X,X,(hI,vHD),O,O,O,X,(hHD,vBE),O,O,A,X,(hHF),C,O,G,X,X,(hBI),O,O,X,X,X','7,X,(vJ),(vFB),(vDB),X,X,X,(hFC),O,O,O,(vFE),X,X,(hFB),O,O,O,O,X,X,X,X,(hG),I,O,X,X,X,X,(hA),O,O,(vFG),(vE),X,X,(hDD),O,O,O,A,X,X,X,(hFD),D,E,J','6,X,X,X,(vAD),(vAH),X,X,(vB),(hF,vEB),O,O,X,(hED),O,O,O,O,(vD),(hD),O,O,(hJ,vI),O,O,X,(hEH),O,A,O,C,X,(hB),G,O,X,X','6,X,X,X,X,(vFG),(vFB),X,X,X,(hFD,vB),O,O,X,X,(hFG,vFG),O,O,O,X,(hI,vH),O,O,C,X,(hGA),E,H,O,X,X,(hD),O,G,X,X,X','7,X,X,X,(vBH),(vBB),X,X,X,X,(hBJ,vBJ),I,O,(vHE),(vI),X,(hBF,vBA),O,O,O,O,O,(hBE),O,D,X,(hA),O,O,(hBC),O,O,(vA),(hBB,vBH),O,O,(hDA),B,H,O,O,O,X,X,X,(hI),O,O,X,X','7,X,X,X,(vEC),(vD),X,X,X,(vJ),(hEB,vEJ),O,O,X,X,(hFC),O,O,O,F,(vEG),X,(hG),O,O,(hH,vFI),O,E,(vEH),X,(hEB),A,O,(hED,vJ),O,O,X,X,(hFI),O,O,O,O,X,X,(hED),O,O,X,X','6,X,(vGH),(vGG),X,X,X,(hGE),O,O,(vFI),(vGJ),X,(hGF),O,O,D,O,X,X,(hGB),O,C,O,(vGG),X,(hFG),O,O,O,O,X,X,X,(hE),O,I','7,X,X,X,(vF),(vGI),X,X,X,(vJ),(hB,vGA),H,G,X,X,(hHF),O,O,O,A,(vHH),X,(hB),O,O,(hGB,vGA),C,O,(vC),X,(hGC),O,O,(hGI,vGF),O,O,X,X,(hHB),O,E,O,O,X,X,(hA),O,O,X,X','7,X,X,X,X,X,(vED),(vIG),X,X,X,X,(hEC),O,O,X,X,(vAC),(vA),(hH,vEG),O,O,X,(hAE,vB),O,O,H,O,O,(hIJ),O,O,O,B,O,X,(hEC),O,O,X,X,X,X,(hEI),O,O,X,X,X,X','7,X,X,(vAI),(vAA),X,X,X,X,(hAD,vAG),O,O,(vAE),X,X,(hAH),O,O,O,O,(vBH),(vD),(hG),O,O,(hI,vE),O,O,O,(hAI),O,O,O,(hG,vAC),D,F,X,X,(hAH),O,O,O,O,X,X,X,(hAJ),O,O,X','7,X,X,(vGD),(vFB),(vJ),X,X,X,(hGD),O,O,O,(vFA),(vGG),X,(hFA),O,O,O,O,O,X,(hGE,vGF),O,O,(hH,vFB),O,O,(hH),O,G,(hGC,vD),O,G,X,(hEB),O,O,O,O,O,X,X,X,(hGC),O,A,O,X','6,X,X,(vAD),(vEE),X,X,X,(hEC),G,O,(vAJ),(vH),X,(hEC,vEG),O,A,O,O,(hEG),F,O,(hEG,vEG),O,O,(hAB),O,E,F,A,X,X,X,(hEG),O,O,X','6,X,X,X,X,(vIB),(vJ),X,X,X,(hB,vIJ),O,O,X,X,(hE,vIF),O,O,C,X,(hFC,vIF),O,A,O,X,(hG),O,O,H,X,X,(hIJ),O,O,X,X,X','6,X,X,X,(vIB),(vEB),X,X,X,(hD,vAE),O,O,(vE),X,(hIJ,vE),O,O,O,O,(hII),O,O,(hJ,vC),H,O,(hAE),O,O,G,J,X,X,(hC),O,O,X,X','6,X,X,(vFF),(vB),X,X,X,(hC,vI),O,J,(vJE),X,(hJJ),O,O,I,G,(vA),(hJJ),O,O,(hJD,vJE),O,O,X,(hJB),O,O,F,O,X,X,(hJH),C,J,X','7,X,X,X,(vEI),(vJI),X,X,X,X,(hJA),O,O,(vJE),(vJJ),X,X,(hJI,vJB),O,E,O,D,X,(hJI,vC),O,H,(hJB,vJE),O,O,(hB),O,O,(hF,vD),O,O,X,(hJB),O,O,O,O,X,X,X,X,(hJE),O,O,X,X','7,X,(vJB),(vFD),X,X,(vFE),(vH),(hJF),O,O,X,(hH),O,O,(hJC),O,O,(vH),(hJF,vJF),O,O,X,(hJI),H,O,O,O,X,X,(hFJ,vJJ),J,O,O,O,(vJA),(hA),G,O,X,(hJF),O,C,(hJC),O,O,X,(hD),O,O','7,X,(vI),(vDH),X,X,X,X,(hB),O,I,X,X,X,X,(hC),O,O,(vA),(vI),(vDJ),X,(hDH),O,B,O,O,O,(vDH),X,(hGG),O,O,O,J,O,X,X,X,X,(hHH),B,O,X,X,X,X,(hHE),O,O','6,X,X,(vDI),(vE),X,X,X,(hA,vDA),E,O,(vHI),X,(hHI),F,A,O,O,(vDF),(hDD),O,O,(hDJ,vDJ),O,O,X,(hDG),O,O,H,O,X,X,(hB),O,D,X','6,X,(vJ),(vDH),X,X,X,(hDA),G,O,(vDA),(vDB),X,(hDB),O,O,I,F,X,X,(hG),O,F,O,(vDI),X,(hED),G,O,O,F,X,X,X,(hDE),O,H','6,X,X,(vCJ),(vD),X,X,X,(hG),O,O,(vAD),(vAE),X,(hCC,vI),O,O,A,O,(hJ),O,F,(hAD,vAD),I,H,(hCD),O,O,O,F,X,X,X,(hAJ),O,G,X','7,X,X,X,X,(vEF),(vEC),(vF),X,X,X,(hED,vEB),O,O,O,X,X,(hEB),O,O,O,O,X,X,(hC),O,D,X,X,X,(vI),(hB,vEE),O,O,X,X,(hEB),E,H,D,O,X,X,(hHJ),O,G,O,X,X,X','7,X,X,X,X,(vJF),(vIC),X,X,X,(vIA),(hD,vJE),O,O,X,X,(hIJ,vD),J,O,O,D,(vG),(hJC),I,O,O,(hJA,vC),O,O,(hJF),J,C,(hJF,vJE),O,O,O,X,(hIB),O,O,O,O,X,X,(hJF),O,O,X,X,X','6,X,(vH),(vJE),X,X,X,(hC),J,O,(vJJ),(vJC),X,(hJJ),A,I,O,H,X,X,(hD),O,O,A,(vC),X,(hAI),F,B,O,O,X,X,X,(hC),J,O','7,X,(vA),(vEE),X,X,(vD),(vF),(hEC),O,O,(vIH),(hI,vEB),O,O,(hBD),O,O,O,O,F,O,X,X,(hA),O,O,X,X,X,(vJ),(hEJ,vEG),F,O,(vA),(vG),(hBG),O,O,O,O,O,O,(hEH),O,O,X,(hG),O,O','6,X,X,X,(vFG),(vFC),X,X,(vE),(hFE,vFF),A,O,X,(hBF),O,O,O,O,(vH),(hE),O,O,(hD,vFF),I,O,X,(hFF),O,O,E,D,X,(hFI),O,O,X,X','6,X,X,(vHA),(vFH),X,X,X,(hFF),O,O,(vFH),(vE),X,(hDI,vFG),O,O,O,O,(hFG),B,O,(hC,vFB),O,O,(hDC),O,G,O,F,X,X,X,(hFF),O,O,X','7,X,X,(vBE),(vBB),(vA),X,X,X,(hH),O,O,O,(vBA),(vH),X,(hGI,vBB),O,J,O,O,O,(hBG),O,O,X,(hI),O,O,(hC),O,O,(vBG),(hE,vBD),H,C,(hBI),O,O,O,O,O,X,X,X,(hGG),O,O,O,X','7,X,X,X,X,X,(vHC),(vF),X,X,X,X,(hF,vC),O,E,X,X,(vEJ),(hEF,vEG),F,O,H,X,(hHD),C,O,O,O,X,X,(hHC,vI),A,O,O,O,X,(hJ),D,O,O,X,X,X,(hF),O,O,X,X,X,X','6,X,X,(vH),(vDC),X,X,X,(hCI,vCD),O,O,X,X,(hH),O,O,O,(vCA),(vCB),(hCJ),O,I,O,D,E,X,X,(hDI),E,H,O,X,X,(hG),O,O,X','7,X,X,X,X,(vJ),(vHE),X,X,X,X,(hHA,vHF),O,B,(vHE),X,X,(hEC,vHG),O,O,O,O,X,(hHE,vHG),O,O,(hA,vHB),O,O,(hJ),O,O,(hHE,vJ),O,O,X,(hED),O,J,O,O,X,X,X,(hB),O,O,X,X,X','6,X,X,(vJG),(vA),X,X,X,(hI),B,O,(vJC),(vJH),X,(hJH,vJC),O,E,O,O,(hB),O,O,(hJJ,vF),O,O,(hCE),O,O,D,I,X,X,X,(hB),O,H,X','6,X,X,X,X,(vDG),(vHH),X,X,(vDH),(hJ,vHB),O,O,X,(hJF),O,O,O,O,X,(hHF,vE),O,O,O,X,(hDJ),H,O,O,I,X,(hHC),G,O,X,X,X','7,X,(vAI),(vHC),X,X,X,X,(hD),O,G,X,X,(vHI),(vG),(hAJ),O,O,(vB),(hH,vAH),O,O,X,(hHF,vH),O,O,F,O,O,(hCA),O,O,O,O,O,(vF),(hH),O,O,X,(hG),O,O,X,X,X,X,(hAH),O,O','7,X,X,X,X,(vFG),(vFI),X,X,X,X,(hFI,vFB),O,O,(vFJ),X,(vFA),(hFG,vGA),O,B,O,O,(hIB),O,O,O,(hH,vJ),O,O,(hJ),O,O,(hFD,vD),O,C,O,(hII),O,O,O,O,X,X,X,(hE),O,O,X,X,X','7,X,X,X,(vI),(vEG),(vFD),X,X,(vED),(hA,vEB),O,O,O,X,(hJC),O,O,A,O,O,X,(hEG),O,O,(hEG,vEC),O,O,(vB),X,(hH),O,O,(hJ,vEB),O,O,X,(hEI),O,O,O,O,J,X,(hFF),O,H,O,X,X','6,X,X,(vEI),(vEB),X,X,X,(hEC,vB),O,O,(vEB),X,(hHC),J,O,O,F,(vEC),(hH),O,O,(hB,vEC),O,O,X,(hEH),O,O,O,O,X,X,(hEA),D,O,X','6,X,X,(vAF),(vBF),X,X,X,(hBI),O,G,(vAD),(vBD),X,(hBI,vF),O,J,O,E,(hBB),A,G,(hBI,vBI),O,H,(hAJ),B,O,O,O,X,X,X,(hBA),O,O,X','6,X,(vCB),(vJ),X,X,X,(hCE),A,O,(vCI),X,X,(hCG),D,O,O,(vCC),X,X,(hCA),O,O,O,(vB),X,X,(hB),O,E,G,X,X,X,(hG),O,H','7,X,X,X,X,X,(vFI),(vHG),X,X,X,X,(hHJ,vHH),O,O,X,X,(vHC),(hHD,vHG),O,O,O,X,(hHH),O,O,O,O,X,X,(hFE,vHC),O,O,O,D,X,(hHE),H,O,O,X,X,X,(hHE),I,A,X,X,X,X','7,X,X,(vFA),(vC),X,X,X,X,(hE),O,B,(vAC),(vGJ),X,X,(hFF,vG),O,O,O,O,(vAI),(hAA),O,D,(hAB,vAC),O,O,O,(hAH),O,O,O,(hAB,vAB),O,O,X,(hFJ),O,O,O,O,X,X,X,X,(hAH),O,J,X','7,X,X,X,(vIF),(vIB),X,X,X,X,(hID),O,O,(vC),X,X,(vIF),(hIH,vEE),O,O,O,(vII),(hEB),O,O,O,(hIB,vIF),D,J,(hIF),O,O,(hII,vIE),O,O,O,X,(hJ),O,G,O,X,X,X,X,(hIF),O,O,X,X','7,X,(vDJ),(vDB),X,X,X,X,(hDJ),O,O,(vDF),(vCE),(vI),X,(hCH),O,O,O,O,O,X,X,X,(hDC,vDB),O,A,G,X,X,(hFE),O,O,O,(vDJ),(vI),X,(hCF),O,O,O,O,O,X,X,X,X,(hDE),O,O','6,X,X,(vCI),(vJ),X,X,X,(hA),O,E,(vEG),(vCC),X,(hEG,vCF),O,O,D,O,(hJ),C,G,(hB,vCC),C,O,(hED),O,O,A,O,X,X,X,(hCD),O,O,X','6,X,X,X,(vG),(vFE),X,X,X,(hG,vBC),O,O,(vBC),X,(hFJ,vC),O,E,O,I,(hG),O,O,(hBF,vBC),O,O,(hEJ),O,O,O,O,X,X,(hBA),D,O,X,X','6,X,X,(vAJ),(vE),X,X,X,(hFH,vH),O,O,(vFA),X,(hFH),O,O,O,O,(vFI),(hI),O,C,(hFI,vFD),O,O,X,(hAC),O,O,I,G,X,X,(hC),O,O,X','6,X,X,X,(vE),(vCJ),X,X,(vFF),(hA,vHJ),C,O,X,(hFC),O,O,O,F,(vD),(hFI),O,O,(hFE,vFJ),O,O,X,(hFG),O,O,O,O,X,(hFD),O,O,X,X','7,X,X,X,(vBJ),(vBI),X,X,X,X,(hA),O,O,(vCH),(vBJ),X,(vCJ),(hCB,vG),H,O,I,B,(hBA),O,O,O,(hBE,vG),O,O,(hBB),F,O,(hBE,vBI),O,O,O,(hBI),O,O,O,O,X,X,X,X,(hBC),O,O,X,X','6,X,X,(vCJ),(vD),X,X,X,(hH),O,O,(vBD),(vJ),X,(hCI,vCH),O,J,F,O,(hCG),O,E,(hA,vCD),O,F,(hBF),O,O,O,O,X,X,X,(hCG),O,O,X','6,X,X,X,X,(vJB),(vG),X,X,X,(hA,vH),I,O,X,X,(hCD,vCG),O,O,B,X,(hCF,vCD),O,O,O,X,(hJD),O,H,O,X,X,(hB),O,O,X,X,X','7,X,(vI),(vEH),X,X,(vCC),(vF),(hG),O,O,X,(hH),O,C,(hJ),O,O,(vAD),(hAG,vG),O,O,X,(hEI),F,O,O,O,X,X,(hAD,vAB),O,O,I,O,(vI),(hG),O,O,X,(hC),O,O,(hAJ),O,O,X,(hAA),O,O','7,X,X,X,X,X,(vEC),(vEA),X,X,X,X,(hB),O,O,X,X,(vDF),(vEH),(hEC,vH),H,O,X,(hEA,vI),O,B,E,O,O,(hDB),E,J,O,D,O,X,(hEH),O,A,X,X,X,X,(hI),O,O,X,X,X,X','6,X,X,X,(vBC),(vBC),X,X,X,(hBJ,vEC),H,O,(vBB),X,(hBE,vA),D,J,O,O,(hC),O,O,(hBE,vBG),O,O,(hEG),H,O,B,O,X,X,(hBI),O,O,X,X','7,X,(vE),(vCF),X,X,X,X,(hJ),O,O,(vFB),X,X,X,(hCJ),O,O,A,(vFE),(vCA),X,X,(hIH),O,O,O,O,X,X,(hFF),O,O,O,B,(vFA),X,X,X,(hCI),O,O,O,X,X,X,X,(hFG),O,O','7,X,X,X,X,(vBH),(vH),X,X,X,X,(hI),O,O,(vE),X,X,X,(hJG,vBF),O,O,O,X,(vH),(hBA,vJE),O,O,O,O,(hDG),O,O,O,O,X,X,(hBG),O,F,O,X,X,X,X,(hA),J,O,X,X,X','7,X,X,X,X,X,(vIC),(vA),X,X,X,(vII),(hG,vIH),F,I,X,X,(hIG),O,O,O,D,X,X,(hC,vC),O,O,J,X,X,(hIF,vE),O,G,A,X,X,(hIH),O,O,O,O,X,X,(hJ),F,D,X,X,X,X','7,X,X,X,(vH),(vCJ),X,X,X,(vCG),(hCB,vEG),O,O,X,X,(hEF),O,I,O,O,(vCI),X,(hCD),O,J,(hCB,vCJ),E,O,(vCC),X,(hCE),O,O,(hCI,vH),O,O,X,X,(hEB),O,O,O,O,X,X,(hD),O,O,X,X','6,X,(vGA),(vBE),X,X,X,(hGC),H,O,(vGF),X,X,(hGG),O,O,O,(vGD),X,X,(hBG),O,J,O,(vGD),X,X,(hGD),O,O,E,X,X,X,(hGH),O,O','6,X,X,(vEE),(vEJ),X,X,X,(hI,vEF),O,O,(vEH),X,(hEA),O,O,O,E,(vB),(hEE),O,O,(hB,vB),O,O,X,(hEG),A,O,I,O,X,X,(hA),D,B,X','6,X,(vJ),(vHA),X,X,X,(hHH),D,O,(vHG),X,X,(hI),O,O,F,(vDG),X,X,(hDJ),O,O,O,(vHF),X,X,(hHF),O,O,E,X,X,X,(hHE),B,O','6,X,X,X,X,(vFI),(vE),X,X,X,(hH,vA),J,I,X,X,(hGF,vD),O,O,F,X,(hGF,vC),O,O,A,X,(hD),O,O,O,X,X,(hD),O,O,X,X,X','7,X,X,(vHG),(vE),X,X,X,X,(hGD),O,O,(vGA),(vHC),(vAJ),X,(hGD,vAC),O,O,O,O,O,(hGC),O,O,(hAA,vGC),O,O,O,(hAC),O,O,F,(hGD,vD),O,O,(hHB),O,O,O,O,O,X,X,X,X,(hI),O,D,X','7,X,X,(vBG),(vBJ),X,(vBD),(vE),X,(hC),O,O,(hBB,vAG),O,C,X,(hBE),O,O,O,O,D,X,(hBG),O,O,O,(vBE),X,X,(vE),(hBI,vJ),O,O,O,X,(hCG),F,G,O,O,O,X,(hC),O,O,(hBJ),O,O,X','7,X,X,X,X,X,(vEA),(vJJ),X,X,(vED),(vJI),(hF),O,O,X,(hB),O,O,(hJH,vB),O,O,X,(hED),O,B,O,O,X,X,(hJI,vJI),O,O,C,O,X,(hJH),O,O,(hJJ),O,O,X,(hF),J,E,X,X,X,X','6,X,(vF),(vED),X,X,X,(hEI),O,O,(vEA),X,X,(hEJ),O,O,J,(vB),X,X,(hB),O,O,O,(vG),X,X,(hJ),B,O,C,X,X,X,(hF),O,E','6,X,X,X,X,(vCH),(vCD),X,X,X,(hG,vCH),O,O,X,X,(hCH,vCI),O,O,O,X,(hFA,vCE),O,O,J,X,(hFF),O,O,O,X,X,(hI),F,C,X,X,X','6,X,X,(vCH),(vA),X,X,X,(hE,vE),D,O,(vAG),(vHC),(hHB),O,O,C,O,I,(hHA),O,O,(hE,vJ),O,O,(hCH),A,O,O,O,O,X,X,(hHD),O,O,X','7,X,(vF),(vDG),(vGD),X,X,X,(hA),O,D,O,(vI),(vGE),X,(hDG),O,C,O,O,O,X,(hGC),H,O,(hH,vA),O,O,(vGF),X,(hH),O,O,(hGB,vGD),O,O,X,(hDH),O,D,O,O,O,X,X,X,(hA),O,O,G','7,X,X,X,X,(vIG),(vIG),X,X,X,X,(hCJ),O,O,(vCE),X,X,X,(hIE,vEA),O,O,O,X,(vJ),(hEA,vIE),O,O,O,O,(hCH),O,F,O,O,X,X,(hCH),I,B,O,X,X,X,X,(hCH),O,O,X,X,X','7,X,X,X,X,(vJ),(vDB),X,X,X,X,(hDG,vH),O,O,X,X,(vB),(hJ,vEB),E,O,O,(vG),(hDJ),O,F,D,(hI,vDC),O,O,(hA),O,O,(hJ,vA),O,O,I,X,(hDA),O,O,O,X,X,X,(hDH),O,O,X,X,X','6,X,X,X,(vEE),(vJA),(vEI),X,X,(hD,vEE),O,F,O,X,(hED,vEC),O,O,O,O,(hJ),O,O,(hEH,vEI),O,O,(hIB),O,O,O,O,X,(hII),O,O,O,X,X','6,X,(vE),(vGH),X,X,X,(hC),O,J,(vFJ),X,X,(hGH),O,O,O,(vJ),X,X,(hFA),B,O,I,(vFF),X,X,(hFG),O,O,O,X,X,X,(hB),F,G','6,X,X,(vIF),(vIJ),X,X,X,(hD,vIC),O,O,X,X,(hIB),O,O,O,(vIG),(vA),(hBF),O,O,F,I,O,X,X,(hE),D,O,F,X,X,(hIF),O,C,X','7,X,(vCD),(vB),X,X,X,X,(hII),O,D,(vA),X,X,X,(hIJ),O,O,O,(vII),X,X,(hID),O,O,O,O,(vIJ),(vCJ),X,X,(hCA),H,O,F,O,X,X,X,(hA),O,O,G,X,X,X,X,(hII),J,O','7,X,(vC),(vFF),X,X,(vHF),(vD),(hFD),O,O,(vHG),(hA,vFJ),O,O,(hHF),O,O,O,O,O,O,X,X,(hFG,vFH),O,O,O,X,X,(hFB,vI),O,O,O,(vFB),(vB),(hIG),O,O,O,O,D,J,(hG),O,I,X,(hFE),O,O','7,X,(vHJ),(vDE),X,X,(vDI),(vHH),(hHG),O,J,(vHJ),(hJ),O,O,(hHE),O,O,O,(hHJ,vB),O,O,X,(hHH),O,O,O,O,X,X,(hDJ,vHA),D,O,E,O,(vF),(hHJ),O,O,(hA),O,O,E,(hHA),O,O,X,(hI),O,O','7,X,(vEH),(vFA),X,X,X,X,(hEB),O,O,(vFA),X,X,X,(hFD),O,O,O,(vEE),(vID),X,X,(hFB),O,O,O,O,X,X,(hFJ),O,O,O,O,(vEE),X,X,X,(hJ),O,B,O,X,X,X,X,(hEH),C,O','6,X,(vJ),(vE),X,X,X,(hA),B,C,(vCJ),X,X,(hCG),O,O,O,(vCD),X,X,(hHF),O,O,O,(vJ),X,X,(hE),O,O,H,X,X,X,(hCE),O,O','6,X,(vGC),(vGH),X,X,X,(hGG),O,O,(vGB),X,X,(hGI),E,O,I,(vGG),X,X,(hIJ),O,C,O,(vA),X,X,(hD),G,O,O,X,X,X,(hD),O,O','6,X,X,X,X,(vIG),(vII),X,X,X,(hE,vIA),I,G,X,X,(hGJ,vGF),O,C,O,X,(hIE,vII),D,O,O,X,(hGJ),O,B,O,X,X,(hA),O,J,X,X,X','6,X,X,X,X,(vIA),(vE),X,X,(vJB),(hB,vII),I,J,X,(hIF),O,O,O,H,X,(hIB,vG),D,J,O,X,(hJG),C,O,O,F,X,(hB),O,O,X,X,X','7,X,X,X,(vDB),(vGG),X,X,X,X,(hGH),O,O,(vGA),(vGA),X,X,(hGF,vGA),O,O,O,O,X,(hGA,vGE),B,O,(hGD,vI),O,O,(hJ),O,I,(hGE,vGG),O,O,X,(hDA),O,D,O,O,X,X,X,X,(hF),O,O,X,X','6,X,X,X,(vFB),(vI),X,X,X,(hGF),O,O,(vGA),X,(vH),(hGA,vFD),O,O,O,(hFF),O,A,O,O,C,(hGG),O,J,O,X,X,X,(hGH),O,D,X,X','6,X,X,(vGA),(vA),X,X,X,(hB,vGE),O,O,(vHJ),X,(hBD),O,O,O,O,(vGH),(hGC),O,O,(hGJ,vGE),O,O,X,(hGG),O,F,O,O,X,X,(hGC),O,O,X','7,X,X,(vCE),(vG),(vI),X,X,X,(hEE),A,O,E,(vCD),(vCH),X,(hEG,vCD),O,O,O,O,O,(hA),G,C,X,(hEH),O,O,(hEE),O,O,(vI),(hA,vD),O,O,(hCF),O,O,O,O,O,X,X,X,(hED),O,O,B,X','7,X,(vG),(vDC),X,(vBA),(vDG),X,(hJ),O,G,(hDA,vBA),O,O,X,(hBC),O,O,G,O,O,X,X,(hDH),O,O,O,(vG),X,X,X,(hG,vDI),O,O,O,(vJ),X,(hBB),E,O,O,O,O,X,(hH),O,J,(hB),O,O','6,X,X,X,(vJG),(vCG),X,X,(vJG),(hJB,vJH),O,O,X,(hJH),I,B,O,O,(vD),(hJB),O,O,(hA,vJG),O,O,X,(hJB),O,B,O,O,X,(hF),I,C,X,X','7,X,(vA),(vE),X,X,(vD),(vB),(hF),O,O,(vJJ),(hI,vGD),O,O,(hGD),O,O,O,O,I,O,X,X,(hJI),O,O,X,X,X,(vJE),(hA,vF),I,O,(vD),(vJJ),(hGA),O,O,O,J,O,O,(hH),O,O,X,(hI),O,O','7,X,X,(vEH),(vEF),X,X,X,X,(hEI,vIH),O,O,(vEI),X,X,(hEI),O,O,O,O,(vIE),(vEJ),(hD),O,O,(hEH,vH),O,O,O,(hEC),O,O,O,(hD,vC),H,G,X,X,(hIA),O,O,O,O,X,X,X,(hD),E,O,X','7,X,X,X,X,X,(vEA),(vCJ),X,X,X,X,(hCD,vCC),O,O,X,X,(vCI),(hCJ,vEH),O,O,O,X,(hDH),O,J,B,O,X,X,(hCH,vD),O,O,O,O,X,(hCJ),O,O,O,X,X,X,(hJ),O,G,X,X,X,X','7,X,(vB),(vFF),X,(vEI),(vFE),X,(hH),O,O,(hFC,vIB),G,O,X,(hFC),O,O,O,O,O,X,X,X,(hFH),O,D,X,X,X,X,(hFF,vFG),O,O,(vFE),(vFH),X,(hEE),O,O,J,O,O,X,(hFG),O,O,(hFG),O,O','6,X,(vHE),(vII),X,X,X,(hHB),O,O,(vHF),(vHJ),X,(hHD),B,O,O,O,X,X,(hG),H,O,O,(vHE),X,(hCA),O,O,E,B,X,X,X,(hHB),O,G','6,X,(vH),(vAF),X,X,X,(hAC),O,O,(vAD),X,X,(hDI),J,O,O,(vAH),X,X,(hAC),O,O,O,(vAI),X,X,(hH),O,O,B,X,X,X,(hAH),O,E','6,X,(vC),(vHA),X,X,X,(hC),O,J,(vHA),X,X,(hF),J,O,O,(vHC),X,X,(hI),O,J,O,(vF),X,X,(hEJ),O,O,B,X,X,X,(hG),O,O','6,X,X,X,(vFJ),(vJC),X,X,(vFF),(hFF,vJE),O,O,X,(hFH),O,F,O,O,(vD),(hFI),O,C,(hE,vH),D,O,X,(hJC),O,O,O,A,X,(hFG),O,J,X,X','7,X,X,X,X,X,(vDE),(vBB),X,(vC),(vDF),X,(hBF),O,O,(hH),O,O,(vE),(hH,vBI),B,O,(hDF),O,O,O,O,D,(vE),X,(hDI,vBE),O,O,C,O,B,(hBF),O,A,X,(hG),E,D,(hG),O,O,X,X,X,X','7,X,(vJ),(vFH),X,X,X,X,(hHH),F,A,X,X,(vGE),(vA),(hI),O,O,(vC),(hF,vD),O,O,X,(hHC,vF),H,O,O,O,O,(hGJ),O,O,O,O,O,(vE),(hE),O,O,X,(hHI),O,O,X,X,X,X,(hA),O,O','7,X,X,(vCD),(vCB),(vF),X,X,X,(hCA,vCJ),O,O,O,(vFH),X,(hCD),O,O,O,O,O,(vCB),(hH),O,O,X,(hI),O,O,(hCE),O,B,(vCE),(hCH,vCI),O,G,X,(hFA),O,G,O,O,O,X,X,(hBC),H,O,O,X','6,X,X,X,X,(vHD),(vHH),X,X,X,(hA,vHH),H,I,X,X,(hHJ,vIG),O,C,O,X,(hHC,vE),O,O,O,X,(hIG),J,O,O,X,X,(hHF),O,O,X,X,X','6,X,X,(vFD),(vJB),X,X,X,(hH,vH),O,O,(vJD),X,(hFH),O,O,O,O,(vJI),(hJD),O,O,(hJD,vG),J,E,X,(hJD),O,O,O,O,X,X,(hB),A,O,X','6,X,X,X,(vC),(vDC),X,X,(vF),(hHB,vDI),O,O,(vDJ),(hDG),O,O,E,O,O,(hHA),O,O,(hHD,vG),O,O,(hEJ),O,O,F,O,O,X,(hJ),O,O,X,X','7,X,X,X,X,X,(vEJ),(vG),X,X,X,X,(hD,vI),C,O,X,X,(vEG),(hFE,vFE),O,O,O,X,(hFD),O,O,O,O,X,X,(hEC,vFI),O,O,O,O,X,(hEC),B,O,H,X,X,X,(hJ),O,O,X,X,X,X','7,X,(vI),(vAC),X,X,(vAI),(vCG),(hB),O,I,X,(hCB,vCD),O,O,(hH),A,D,(hCD,vAF),O,O,O,X,(hAC),O,O,O,O,X,X,(hCF,vCC),O,O,O,O,(vB),(hCB),O,O,O,(hCF),O,O,(hCB),O,J,X,(hB),O,O','6,X,X,X,(vJB),(vIG),X,X,(vA),(hJI,vJC),O,F,X,(hJB),O,O,O,O,(vJE),(hJD),B,O,(hJB,vD),O,H,X,(hJG),O,I,O,O,X,(hA),O,E,X,X','7,X,X,X,X,(vCD),(vCC),(vB),X,X,X,(hCC,vEC),O,I,O,X,X,(hCH),C,O,O,O,X,X,(hCA),F,O,X,X,X,(vA),(hCH,vCE),O,E,X,X,(hGA),C,O,O,O,X,X,(hCE),O,O,O,X,X,X','6,X,X,X,X,(vJI),(vA),X,X,(vJH),(hJE,vJI),O,G,X,(hJE),F,O,O,D,X,(hC,vB),O,E,O,X,(hJH),O,O,O,O,X,(hJD),O,E,X,X,X','6,X,X,X,X,(vAJ),(vAJ),X,X,X,(hAF,vGB),O,O,X,X,(hAE,vD),O,O,O,X,(hAJ,vF),O,J,O,X,(hAF),O,O,H,X,X,(hB),O,I,X,X,X','7,X,X,X,X,(vH),(vIE),X,X,X,X,(hA,vA),O,O,X,X,(vID),(hF,vCH),O,O,A,(vIE),(hIH),O,O,O,(hIA,vIH),O,O,(hIE),O,O,(hIG,vIA),B,O,O,X,(hIF),O,G,A,X,X,X,(hIE),O,D,X,X,X','7,X,(vEF),(vB),(vFC),X,X,X,(hH),O,O,O,(vEA),X,X,(hED),C,O,O,O,X,X,X,X,(hEG),O,F,X,X,X,X,(hEI),O,O,(vEH),(vI),X,X,(hFH),O,O,O,O,X,X,X,(hEE),O,I,O','6,X,(vHI),(vDG),X,X,X,(hHE),J,O,(vDG),X,X,(hHC),H,O,O,(vHA),X,X,(hDH),F,O,G,(vHE),X,X,(hHC),O,O,O,X,X,X,(hHE),O,O','6,X,X,(vAD),(vAE),X,X,X,(hAA),O,O,(vAD),(vAA),X,(hAI,vI),O,F,D,J,(hC),A,O,(hB,vJ),A,E,(hAB),O,I,C,J,X,X,X,(hI),O,H,X','6,X,X,(vDA),(vE),X,X,X,(hJ,vDE),O,F,(vGG),X,(hDJ),O,O,O,O,(vC),(hDD),O,O,(hJ,vI),O,O,X,(hGG),O,D,O,O,X,X,(hDA),G,B,X','7,X,X,(vJD),(vG),(vI),X,X,X,(hG),O,O,H,(vEB),(vEF),X,(hEB),O,O,B,O,J,X,(hEJ,vA),O,H,(hEE,vEA),O,O,(hA),O,O,(hEJ,vG),O,O,X,(hJF),O,O,O,O,O,X,X,X,(hG),F,O,O,X','6,X,X,X,X,(vEJ),(vG),X,X,X,(hDE,vF),O,O,X,X,(hDJ,vF),O,O,O,X,(hA,vDA),O,O,O,X,(hDI),B,O,O,X,X,(hDE),C,O,X,X,X','6,X,X,(vAC),(vD),X,X,X,(hD,vEI),O,O,(vBC),X,(hBA),O,O,O,O,(vH),(hEF),O,O,(hEI,vF),O,O,X,(hEF),O,O,A,O,X,X,(hEE),G,D,X','6,X,X,(vGB),(vD),X,X,X,(hGG),A,C,(vGJ),(vC),X,(hGG,vGC),O,O,O,J,(hGH),O,O,(hE,vI),G,H,(hHF),O,H,O,O,X,X,X,(hE),O,O,X','6,X,X,(vIJ),(vCD),X,X,X,(hCD),O,O,(vCI),(vCG),X,(hIH,vCC),G,O,O,O,(hCE),O,I,(hCH,vCD),G,O,(hIC),B,D,O,O,X,X,X,(hA),O,O,X','7,X,(vII),(vDH),(vID),X,X,X,(hIG),O,O,O,X,X,X,(hDA),O,C,J,(vII),X,X,X,(hID),F,O,O,(vDH),X,X,X,(hID),O,O,O,(vID),X,X,X,(hIE),A,O,O,X,X,X,(hDD),O,O,O','7,X,(vEB),(vF),X,X,X,X,(hED),O,O,(vAJ),(vED),(vD),X,(hIB),O,O,O,G,O,X,X,X,(hF,vA),O,O,O,X,X,(hED),O,O,F,(vA),(vEB),X,(hIE),O,H,O,O,O,X,X,X,X,(hEE),O,O','7,X,X,X,X,(vCA),(vCE),(vB),X,X,X,(hF),O,O,O,X,X,X,(hJG,vCD),I,O,O,X,X,(hF,vB),O,O,O,X,X,(hJI,vCI),O,F,O,X,X,(hD),O,O,O,X,X,X,(hCI),O,O,O,X,X,X','6,X,(vJI),(vI),X,X,X,(hH),O,O,(vD),X,X,(hJA),F,O,O,(vJH),X,X,(hJI),C,G,O,(vJJ),X,X,(hD),O,O,O,X,X,X,(hJE),O,O','6,X,X,X,(vDC),(vAE),X,X,X,(hI),O,B,(vI),X,(vC),(hJ,vDE),O,O,O,(hAF),A,D,O,O,O,(hI),O,O,G,X,X,X,(hDA),H,O,X,X','7,X,X,X,(vFD),(vAF),X,X,X,(vFD),(hFE,vFA),B,O,X,X,(hHI),O,O,O,O,(vFF),X,(hFI),O,O,(hC,vG),O,H,(vFA),X,(hE),O,O,(hFB,vC),O,O,X,X,(hFJ),O,G,O,O,X,X,(hH),O,O,X,X','7,X,X,X,X,(vD),(vHD),X,X,X,(vDH),(hA,vJJ),O,O,(vE),X,(hHB,vJH),O,O,O,E,J,(hJE),H,O,O,(hD,vF),O,O,(hJG),E,O,(hJE,vJG),C,O,O,(hHH),J,O,O,O,O,X,X,(hJJ),O,O,X,X,X','7,X,X,X,X,(vBA),(vEB),X,X,X,(vBG),(hC,vBB),O,O,X,X,(hBD,vBA),O,O,O,O,(vBJ),(hBC),O,O,O,(hBG,vBD),A,O,(hBB),O,O,(hEE,vBF),O,O,D,X,(hBJ),O,O,O,I,X,X,(hBD),O,O,X,X,X','7,X,X,X,X,X,(vDG),(vC),X,(vB),(vFH),X,(hC),E,O,(hA),O,O,(vDD),(hH,vDB),O,O,(hDA),C,O,O,O,O,(vE),X,(hFH,vDE),O,O,H,O,F,(hDH),O,O,X,(hDI),O,O,(hJ),O,O,X,X,X,X','6,X,(vB),(vE),X,X,X,(hA),D,O,(vA),X,X,(hH),O,C,O,(vIG),X,X,(hDI),O,O,O,(vDF),X,X,(hIF),O,O,O,X,X,X,(hH),O,O','7,X,(vHF),(vC),X,X,(vC),(vHF),(hC),O,O,(vBC),(hA,vBF),O,O,(hBE),O,O,O,O,O,O,X,X,(hHD),A,O,X,X,X,(vD),(hJ,vHA),O,O,(vHI),(vC),(hCH),J,O,O,O,O,B,(hHH),O,O,X,(hE),O,O','6,X,X,X,(vJ),(vDA),X,X,(vFD),(hB,vFE),O,O,(vDA),(hDJ),O,O,O,O,O,(hDE),O,O,(hDA,vC),O,H,(hBA),O,I,O,G,O,X,(hJ),E,O,X,X','6,X,(vGA),(vA),X,X,X,(hGE),O,O,(vGD),X,X,(hGA),O,G,A,(vED),X,X,(hGE),O,O,O,(vGD),X,X,(hEB),C,H,F,X,X,X,(hGE),A,I','6,X,(vIC),(vFD),X,X,X,(hIG),O,C,(vIB),X,X,(hFJ),O,O,O,(vII),X,X,(hIE),O,O,F,(vIA),X,X,(hIJ),F,I,O,X,X,X,(hIC),O,O','6,X,X,X,(vJG),(vHH),X,X,X,(hHA),O,O,(vHD),X,(vE),(hJF,vHJ),O,O,O,(hHB),F,O,D,O,O,(hE),O,J,O,X,X,X,(hHE),I,O,X,X','7,X,X,X,(vGG),(vI),(vEC),X,X,(vBH),(hJ,vBI),O,O,O,X,(hBJ),O,O,O,O,O,(vJ),(hGJ),O,O,X,(hA),O,O,(hGC),O,O,(vC),(hGB,vGJ),O,O,X,(hBF),O,O,O,O,B,X,(hBH),O,O,O,X,X','7,X,X,X,X,X,(vD),(vHB),X,X,(vG),(vFC),(hHA,vAI),O,O,X,(hAB),O,O,O,O,O,X,(hAD),O,O,O,(vHB),X,X,(vF),(hAF,vHI),O,O,O,X,(hAB),O,O,O,O,O,X,(hB),O,E,X,X,X,X','6,X,(vBC),(vDF),X,X,X,(hBE),O,O,(vDB),X,X,(hDG),O,J,O,(vC),X,X,(hBI),O,O,O,(vBB),X,X,(hBA),O,O,D,X,X,X,(hBG),F,O','6,X,X,X,(vH),(vDC),(vGA),X,X,(hA,vIE),O,O,O,X,(hIG,vGG),O,O,O,O,(hF),O,O,(hGF,vJ),J,O,(hGA),O,O,O,O,X,(hIE),O,O,O,X,X','6,X,(vHC),(vHJ),X,X,X,(hHC),A,B,(vA),X,X,(hHI),O,O,O,(vHA),X,X,(hD),F,O,O,(vB),X,X,(hII),G,O,O,X,X,X,(hB),O,O','7,X,(vH),(vJA),X,X,(vIE),(vJI),(hJC),O,O,(vDG),(hJE,vIG),O,O,(hDD),I,O,O,O,O,O,X,X,(hII,vIG),O,O,O,X,X,(hIE,vJA),O,O,O,(vB),(vJI),(hDG),C,O,O,O,O,O,(hJF),O,O,X,(hH),O,O','7,X,(vHH),(vBE),X,X,X,X,(hE),B,O,X,(vHF),(vBJ),X,(hHI),C,O,(hJ,vHI),O,O,X,X,(hBC),D,O,O,O,X,X,(hHH),O,O,D,O,(vHF),X,(hHD),F,O,(hHD),G,O,X,X,X,X,(hHE),O,O','7,X,X,X,X,X,(vIF),(vI),X,X,X,X,(hB,vGF),O,O,X,X,(vEG),(hGG,vB),O,O,O,X,(hGJ),O,O,O,H,X,X,(hGA,vA),O,O,O,O,X,(hGC),I,H,O,X,X,X,(hH),G,J,X,X,X,X','7,X,X,X,X,X,(vJF),(vJF),X,X,X,X,(hJD),A,O,X,X,(vBG),(vJB),(hI,vI),O,O,X,(hBD,vJF),F,O,O,E,O,(hIB),O,O,O,O,C,X,(hJG),O,B,X,X,X,X,(hI),O,J,X,X,X,X','6,X,X,(vEI),(vC),X,X,X,(hH,vGG),O,O,(vGD),X,(hBJ),O,O,O,O,(vD),(hGI),O,O,(hD,vD),E,G,X,(hBG),O,O,A,O,X,X,(hJ),O,O,X','7,X,X,X,X,(vFI),(vJF),X,X,X,X,(hJH),O,O,(vJC),X,X,X,(hEE,vEC),O,O,O,X,(vJE),(hED,vEF),O,O,O,G,(hJB),O,O,O,O,X,X,(hEH),O,O,G,X,X,X,X,(hJG),O,O,X,X,X','7,X,X,X,(vJ),(vEI),X,X,X,X,(hJ,vEC),O,A,(vBD),X,X,(hHC,vEA),O,O,O,I,(vF),(hEE),O,O,(hEE,vHD),B,J,O,(hHE),O,O,O,(hG,vED),O,O,X,(hHD),O,O,O,O,X,X,X,(hEA),O,O,X,X','7,X,X,X,X,X,(vFH),(vED),X,X,X,X,(hEC,vEA),O,O,X,X,(vED),(hFI,vEH),O,O,O,X,(hEE),O,O,A,D,X,X,(hFB,vJ),O,O,O,J,X,(hFI),O,O,O,X,X,X,(hI),O,A,X,X,X,X','6,X,(vB),(vHI),X,X,X,(hHH),O,O,(vHJ),(vGA),X,(hHH),O,O,O,I,X,X,(hGE),O,A,O,(vHE),X,(hHJ),H,B,F,D,X,X,X,(hHJ),O,C'
+]
+
+kakuro(testPuzzles);
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-425-prime-connection.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-425-prime-connection.md
index d46740b0d58..dfba791e407 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-425-prime-connection.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-425-prime-connection.md
@@ -1,33 +1,36 @@
 ---
 id: 5900f5151000cf542c510028
 title: 'Problem 425: Prime connection'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302095
 dashedName: problem-425-prime-connection
 ---
 
 # --description--
 
-Two positive numbers A and B are said to be connected (denoted by "A ↔ B") if one of these conditions holds:
+Two positive numbers $A$ and $B$ are said to be connected (denoted by "$A ↔ B$") if one of these conditions holds:
 
-(1) A and B have the same length and differ in exactly one digit; for example, 123 ↔ 173.
+1. $A$ and $B$ have the same length and differ in exactly one digit; for example, $123 ↔ 173$.
+2. Adding one digit to the left of $A$ (or $B$) makes $B$ (or $A$); for example, $23 ↔ 223$ and $123 ↔ 23$.
 
-(2) Adding one digit to the left of A (or B) makes B (or A); for example, 23 ↔ 223 and 123 ↔ 23.
+We call a prime $P$ a 2's relative if there exists a chain of connected primes between 2 and $P$ and no prime in the chain exceeds $P$.
 
-We call a prime P a 2's relative if there exists a chain of connected primes between 2 and P and no prime in the chain exceeds P.
+For example, 127 is a 2's relative. One of the possible chains is shown below:
 
-For example, 127 is a 2's relative. One of the possible chains is shown below: 2 ↔ 3 ↔ 13 ↔ 113 ↔ 103 ↔ 107 ↔ 127 However, 11 and 103 are not 2's relatives.
+$$2 ↔ 3 ↔ 13 ↔ 113 ↔ 103 ↔ 107 ↔ 127$$
 
-Let F(N) be the sum of the primes ≤ N which are not 2's relatives. We can verify that F(103) = 431 and F(104) = 78728.
+However, 11 and 103 are not 2's relatives.
 
-Find F(107).
+Let $F(N)$ be the sum of the primes $≤ N$ which are not 2's relatives. We can verify that $F({10}^3) = 431$ and $F({10}^4) = 78\\,728$.
+
+Find $F({10}^7)$.
 
 # --hints--
 
-`euler425()` should return 46479497324.
+`primeConnection()` should return `46479497324`.
 
 ```js
-assert.strictEqual(euler425(), 46479497324);
+assert.strictEqual(primeConnection(), 46479497324);
 ```
 
 # --seed--
@@ -35,12 +38,12 @@ assert.strictEqual(euler425(), 46479497324);
 ## --seed-contents--
 
 ```js
-function euler425() {
+function primeConnection() {
 
   return true;
 }
 
-euler425();
+primeConnection();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md
index 5e2c48c34e0..89314f8aa76 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5171000cf542c510029
 title: 'Problem 426: Box-ball system'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302096
 dashedName: problem-426-box-ball-system
 ---
@@ -14,20 +14,31 @@ A turn consists of moving each ball exactly once according to the following rule
 
 After one turn the sequence (2, 2, 2, 1, 2) becomes (2, 2, 1, 2, 3) as can be seen below; note that we begin the new sequence starting at the first occupied box.
 
+<img class="img-responsive center-block" alt="animation showing one complete turn from (2, 2, 2, 1, 2) to (2, 2, 1, 2, 3)" src="https://cdn.freecodecamp.org/curriculum/project-euler/box-ball-system-1.gif" style="background-color: white; padding: 10px;" />
+
 A system like this is called a Box-Ball System or BBS for short.
 
-It can be shown that after a sufficient number of turns, the system evolves to a state where the consecutive numbers of occupied boxes is invariant. In the example below, the consecutive numbers of occupied boxes evolves to \[1, 2, 3]; we shall call this the final state.
+It can be shown that after a sufficient number of turns, the system evolves to a state where the consecutive numbers of occupied boxes is invariant. In the example below, the consecutive numbers of occupied boxes evolves to [1, 2, 3]; we shall call this the final state.
 
-We define the sequence {ti}:s0 = 290797 sk+1 = sk2 mod 50515093 tk = (sk mod 64) + 1
+<img class="img-responsive center-block" alt="four turns from occupied boxes [2, 2, 2] to final state [1, 2, 3]" src="https://cdn.freecodecamp.org/curriculum/project-euler/box-ball-system-2.gif" style="background-color: white; padding: 10px;" />
 
-Starting from the initial configuration (t0, t1, …, t10), the final state becomes \[1, 3, 10, 24, 51, 75]. Starting from the initial configuration (t0, t1, …, t10 000 000), find the final state. Give as your answer the sum of the squares of the elements of the final state. For example, if the final state is \[1, 2, 3] then 14 ( = 12 + 22 + 32) is your answer.
+We define the sequence $\\{t_i\\}$:
+
+$$\begin{align}   & s_0 = 290\\,797 \\\\
+  & s_{k + 1} = {s_k}^2\bmod 50\\,515\\,093 \\\\ & t_k = (s_k\bmod 64) + 1 \end{align}$$
+
+Starting from the initial configuration $(t_0, t_1, \ldots, t_{10})$, the final state becomes [1, 3, 10, 24, 51, 75].
+
+Starting from the initial configuration $(t_0, t_1, \ldots, t_{10\\,000\\,000})$, find the final state.
+
+Give as your answer the sum of the squares of the elements of the final state. For example, if the final state is [1, 2, 3] then $14 (= 1^2 + 2^2 + 3^2)$ is your answer.
 
 # --hints--
 
-`euler426()` should return 31591886008.
+`boxBallSystem()` should return `31591886008`.
 
 ```js
-assert.strictEqual(euler426(), 31591886008);
+assert.strictEqual(boxBallSystem(), 31591886008);
 ```
 
 # --seed--
@@ -35,12 +46,12 @@ assert.strictEqual(euler426(), 31591886008);
 ## --seed-contents--
 
 ```js
-function euler426() {
+function boxBallSystem() {
 
   return true;
 }
 
-euler426();
+boxBallSystem();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-427-n-sequences.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-427-n-sequences.md
index 8f399eeaf0a..3f244f7937c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-427-n-sequences.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-427-n-sequences.md
@@ -1,31 +1,31 @@
 ---
 id: 5900f5181000cf542c51002a
 title: 'Problem 427: n-sequences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302097
 dashedName: problem-427-n-sequences
 ---
 
 # --description--
 
-A sequence of integers S = {si} is called an n-sequence if it has n elements and each element si satisfies 1 ≤ si ≤ n. Thus there are nn distinct n-sequences in total.
+A sequence of integers $S = \\{s_i\\}$ is called an $n$-sequence if it has $n$ elements and each element $s_i$ satisfies $1 ≤ s_i ≤ n$. Thus there are $n^n$ distinct $n$-sequences in total.
 
-For example, the sequence S = {1, 5, 5, 10, 7, 7, 7, 2, 3, 7} is a 10-sequence.
+For example, the sequence $S = \\{1, 5, 5, 10, 7, 7, 7, 2, 3, 7\\}$ is a 10-sequence.
 
-For any sequence S, let L(S) be the length of the longest contiguous subsequence of S with the same value. For example, for the given sequence S above, L(S) = 3, because of the three consecutive 7's.
+For any sequence $S$, let $L(S)$ be the length of the longest contiguous subsequence of $S$ with the same value. For example, for the given sequence $S$ above, $L(S) = 3$, because of the three consecutive 7's.
 
-Let f(n) = ∑ L(S) for all n-sequences S.
+Let $f(n) = \sum L(S)$ for all $n$-sequences $S$.
 
-For example, f(3) = 45, f(7) = 1403689 and f(11) = 481496895121.
+For example, $f(3) = 45$, $f(7) = 1\\,403\\,689$ and $f(11) = 481\\,496\\,895\\,121$.
 
-Find f(7 500 000) mod 1 000 000 009.
+Find $f(7\\,500\\,000)\bmod 1\\,000\\,000\\,009$.
 
 # --hints--
 
-`euler427()` should return 97138867.
+`nSequences()` should return `97138867`.
 
 ```js
-assert.strictEqual(euler427(), 97138867);
+assert.strictEqual(nSequences(), 97138867);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler427(), 97138867);
 ## --seed-contents--
 
 ```js
-function euler427() {
+function nSequences() {
 
   return true;
 }
 
-euler427();
+nSequences();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md
index 5919151606c..2f7439fa72c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md
@@ -1,34 +1,39 @@
 ---
 id: 5900f5191000cf542c51002b
-title: 'Problem 428: Necklace of Circles'
-challengeType: 5
+title: '问题 428：圆圈项链'
+challengeType: 1
 forumTopicId: 302098
 dashedName: problem-428-necklace-of-circles
 ---
 
 # --description--
 
-Let `a`, `b` and `c` be positive numbers.
+令 $a$、$b$ 和 $c$ 为正数。
 
-Let W, X, Y, Z be four collinear points where |WX| = `a`, |XY| = `b`, |YZ| = `c` and |WZ| = `a` + `b` + `c`.
+令 $W$, $X$, $Y$, $Z$ 为在一条直线上的四个点，其中 $|WX| = a$, $|XY| = b$, $|YZ| = c$ 且 $|WZ| = a + b + c$。
 
-Let C<sub>in</sub> be the circle having the diameter XY.
+令 $C_{\text{in}}$ 是直径为 $XY$ 的圆。
 
-Let C<sub>out</sub> be the circle having the diameter WZ.
+令 $C_{\text{out}}$ 是直径为 $WZ$ 的圆。
 
-The triplet (`a`, `b`, `c`) is called a *necklace triplet* if you can place `k` ≥ 3 distinct circles C<sub>1</sub>, C<sub>2</sub>, ..., C<sub><var>k</var></sub> such that:
+定义三元组（$a$, $b$, $c$），如果可以同时放置 $k ≥ 3$ 个不同的圆 $C_1, C_2, \ldots, C_k$，且这些圆之间满足以下条件，则这个三元组被称为*项链三元组*：
 
-<ul><li>C<sub><var>i</var></sub> has no common interior points with any C<sub><var>j</var></sub> for 1 ≤ <var>i</var>, <var>j</var> ≤ <var>k</var> and <var>i</var> ≠ <var>j</var>,</li><li>C<sub><var>i</var></sub> is tangent to both C<sub>in</sub> and C<sub>out</sub> for 1 ≤ <var>i</var> ≤ <var>k</var>,</li><li>C<sub><var>i</var></sub> is tangent to C<sub><var>i</var>+1</sub> for 1 ≤ <var>i</var> &lt; <var>k</var>, and</li><li>C<sub><var>k</var></sub> is tangent to C<sub>1</sub>.</li></ul>
-For example, (5, 5, 5) and (4, 3, 21) are necklace triplets, while it can be shown that (2, 2, 5) is not.
-<img src="https://projecteuler.net/project/images/p428_necklace.png" alt="a visual representation of a necklace triplet" />
+- 对于任意的 $1 ≤ i$, $j ≤ k$ 且 $i ≠ j$，$C_i$ 与 $C_j$ 不相交。
+- 对于任意的 $1 ≤ i ≤ k$，$C_i$ 同时与 $C_{\text{in}}$ 和 $C_{\text{out}}$ 相切，
+- 对于任意的 $1 ≤ i &lt; k$，$C_i$ 与 $C_{i + 1}$ 相切。
+- $C_k$ 与 $C_1$ 相切。
 
-Let T(`n`) be the number of necklace triplets (`a`, `b`, `c`) such that `a`, `b` and `c` are positive integers, and `b` ≤ `n`. For example, T(1) = 9, T(20) = 732 and T(3000) = 438106.
+例如，(5, 5, 5) 与 (4, 3, 21) 是项链三元组，而 (2, 2, 5) 不是。
 
-Find T(1 000 000 000).
+<img class="img-responsive center-block" alt="项链三元组的视觉表现。" src="https://cdn.freecodecamp.org/curriculum/project-euler/necklace-of-circles.png" style="background-color: white; padding: 10px;" />
+
+定义 $T(n)$ 为项链三元组 $(a, b, c)$ 的数量，其中 $a$，$b$ 和 $c$ 为正整数，且 $b ≤ n$。 例如，$T(1) = 9$，$T(20) = 732$，$T(3\\,000) = 438\\,106$。
+
+请计算 $T(1\\,000\\,000\\,000)$。
 
 # --hints--
 
-`necklace(1000000000)` should return 747215561862.
+`necklace(1000000000)` 应该返回 `747215561862`。
 
 ```js
 assert.strictEqual(necklace(1000000000), 747215561862);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md
index 8b9c108829c..928c602299f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f5191000cf542c51002c
 title: 'Problem 429: Sum of squares of unitary divisors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302099
 dashedName: problem-429-sum-of-squares-of-unitary-divisors
 ---
 
 # --description--
 
-A unitary divisor d of a number n is a divisor of n that has the property gcd(d, n/d) = 1.
+A unitary divisor $d$ of a number $n$ is a divisor of $n$ that has the property $gcd(d, \frac{n}{d}) = 1$.
 
-The unitary divisors of 4! = 24 are 1, 3, 8 and 24.
+The unitary divisors of $4! = 24$ are 1, 3, 8 and 24.
 
-The sum of their squares is 12 + 32 + 82 + 242 = 650.
+The sum of their squares is $12 + 32 + 82 + 242 = 650$.
 
-Let S(n) represent the sum of the squares of the unitary divisors of n. Thus S(4!)=650.
+Let $S(n)$ represent the sum of the squares of the unitary divisors of $n$. Thus $S(4!) = 650$.
 
-Find S(100 000 000!) modulo 1 000 000 009.
+Find $S(100\\,000\\,000!)$ modulo $1\\,000\\,000\\,009$.
 
 # --hints--
 
-`euler429()` should return 98792821.
+`sumSquaresOfUnitaryDivisors()` should return `98792821`.
 
 ```js
-assert.strictEqual(euler429(), 98792821);
+assert.strictEqual(sumSquaresOfUnitaryDivisors(), 98792821);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler429(), 98792821);
 ## --seed-contents--
 
 ```js
-function euler429() {
+function sumSquaresOfUnitaryDivisors() {
 
   return true;
 }
 
-euler429();
+sumSquaresOfUnitaryDivisors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.md
index 7c3a5a83420..53ae7b50350 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3971000cf542c50feaa
 title: 'Problem 43: Sub-string divisibility'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302100
 dashedName: problem-43-sub-string-divisibility
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-430-range-flips.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-430-range-flips.md
index ba66983c7b3..d8838dbe162 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-430-range-flips.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-430-range-flips.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f51a1000cf542c51002d
 title: 'Problem 430: Range flips'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302101
 dashedName: problem-430-range-flips
 ---
 
 # --description--
 
-N disks are placed in a row, indexed 1 to N from left to right.
+$N$ disks are placed in a row, indexed 1 to $N$ from left to right.
 
 Each disk has a black side and white side. Initially all disks show their white side.
 
-At each turn, two, not necessarily distinct, integers A and B between 1 and N (inclusive) are chosen uniformly at random. All disks with an index from A to B (inclusive) are flipped.
+At each turn, two, not necessarily distinct, integers $A$ and $B$ between 1 and $N$ (inclusive) are chosen uniformly at random. All disks with an index from $A$ to $B$ (inclusive) are flipped.
 
-The following example shows the case N = 8. At the first turn A = 5 and B = 2, and at the second turn A = 4 and B = 6.
+The following example shows the case $N = 8$. At the first turn $A = 5$ and $B = 2$, and at the second turn $A = 4$ and $B = 6$.
 
-Let E(N, M) be the expected number of disks that show their white side after M turns. We can verify that E(3, 1) = 10/9, E(3, 2) = 5/3, E(10, 4) ≈ 5.157 and E(100, 10) ≈ 51.893.
+<img class="img-responsive center-block" alt="example for N = 8, with first turn A = 5 and B = 2, and second turn A = 4 and B = 6" src="https://cdn.freecodecamp.org/curriculum/project-euler/range-flips.gif" style="background-color: white; padding: 10px;" />
 
-Find E(1010, 4000). Give your answer rounded to 2 decimal places behind the decimal point.
+Let $E(N, M)$ be the expected number of disks that show their white side after $M$ turns. We can verify that $E(3, 1) = \frac{10}{9}$, $E(3, 2) = \frac{5}{3}$, $E(10, 4) ≈ 5.157$ and $E(100, 10) ≈ 51.893$.
+
+Find $E({10}^{10}, 4000)$. Give your answer rounded to 2 decimal places behind the decimal point.
 
 # --hints--
 
-`euler430()` should return 5000624921.38.
+`rangeFlips()` should return `5000624921.38`.
 
 ```js
-assert.strictEqual(euler430(), 5000624921.38);
+assert.strictEqual(rangeFlips(), 5000624921.38);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler430(), 5000624921.38);
 ## --seed-contents--
 
 ```js
-function euler430() {
+function rangeFlips() {
 
   return true;
 }
 
-euler430();
+rangeFlips();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md
index 51a104b47a0..4199819468b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f51b1000cf542c51002e
 title: 'Problem 431: Square Space Silo'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302102
 dashedName: problem-431-square-space-silo
 ---
@@ -10,20 +10,22 @@ dashedName: problem-431-square-space-silo
 
 Fred the farmer arranges to have a new storage silo installed on his farm and having an obsession for all things square he is absolutely devastated when he discovers that it is circular. Quentin, the representative from the company that installed the silo, explains that they only manufacture cylindrical silos, but he points out that it is resting on a square base. Fred is not amused and insists that it is removed from his property.
 
-Quick thinking Quentin explains that when granular materials are delivered from above a conical slope is formed and the natural angle made with the horizontal is called the angle of repose. For example if the angle of repose, $\\alpha = 30$ degrees, and grain is delivered at the centre of the silo then a perfect cone will form towards the top of the cylinder. In the case of this silo, which has a diameter of 6m, the amount of space wasted would be approximately 32.648388556 m3. However, if grain is delivered at a point on the top which has a horizontal distance of $x$ metres from the centre then a cone with a strangely curved and sloping base is formed. He shows Fred a picture.
+Quick thinking Quentin explains that when granular materials are delivered from above a conical slope is formed and the natural angle made with the horizontal is called the angle of repose. For example if the angle of repose, $\alpha = 30°$, and grain is delivered at the centre of the silo then a perfect cone will form towards the top of the cylinder. In the case of this silo, which has a diameter of 6m, the amount of space wasted would be approximately 32.648388556 m<sup>3</sup>. However, if grain is delivered at a point on the top which has a horizontal distance of $x$ metres from the centre then a cone with a strangely curved and sloping base is formed. He shows Fred a picture.
 
-We shall let the amount of space wasted in cubic metres be given by $V(x)$. If $x = 1.114785284$, which happens to have three squared decimal places, then the amount of space wasted, $V(1.114785284) \\approx 36$. Given the range of possible solutions to this problem there is exactly one other option: $V(2.511167869) \\approx 49$. It would be like knowing that the square is king of the silo, sitting in splendid glory on top of your grain.
+<img class="img-responsive center-block" alt="image presenting forming of the perfect cone towards the top of the cylinder" src="https://cdn.freecodecamp.org/curriculum/project-euler/square-space-silo.png" style="background-color: white; padding: 10px;" />
 
-Fred's eyes light up with delight at this elegant resolution, but on closer inspection of Quentin's drawings and calculations his happiness turns to despondency once more. Fred points out to Quentin that it's the radius of the silo that is 6 metres, not the diameter, and the angle of repose for his grain is 40 degrees. However, if Quentin can find a set of solutions for this particular silo then he will be more than happy to keep it.
+We shall let the amount of space wasted in cubic metres be given by $V(x)$. If $x = 1.114\\,785\\,284$, which happens to have three squared decimal places, then the amount of space wasted, $V(1.114\\,785\\,284) \approx 36$. Given the range of possible solutions to this problem there is exactly one other option: $V(2.511\\,167\\,869) \approx 49$. It would be like knowing that the square is king of the silo, sitting in splendid glory on top of your grain.
 
-If Quick thinking Quentin is to satisfy frustratingly fussy Fred the farmer's appetite for all things square then determine the values of $x$ for all possible square space wastage options and calculate $\\sum x$ correct to 9 decimal places.
+Fred's eyes light up with delight at this elegant resolution, but on closer inspection of Quentin's drawings and calculations his happiness turns to despondency once more. Fred points out to Quentin that it's the radius of the silo that is 6 metres, not the diameter, and the angle of repose for his grain is 40­°. However, if Quentin can find a set of solutions for this particular silo then he will be more than happy to keep it.
+
+If Quick thinking Quentin is to satisfy frustratingly fussy Fred the farmer's appetite for all things square then determine the values of $x$ for all possible square space wastage options and calculate $\sum x$ correct to 9 decimal places.
 
 # --hints--
 
-`euler431()` should return 23.386029052.
+`squareSpaceSilo()` should return `23.386029052`.
 
 ```js
-assert.strictEqual(euler431(), 23.386029052);
+assert.strictEqual(squareSpaceSilo(), 23.386029052);
 ```
 
 # --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler431(), 23.386029052);
 ## --seed-contents--
 
 ```js
-function euler431() {
+function squareSpaceSilo() {
 
   return true;
 }
 
-euler431();
+squareSpaceSilo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-432-totient-sum.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-432-totient-sum.md
index 4f0f5928ef5..2a3f5b744d9 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-432-totient-sum.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-432-totient-sum.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f51e1000cf542c510030
 title: 'Problem 432: Totient sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302103
 dashedName: problem-432-totient-sum
 ---
 
 # --description--
 
-Let S(n,m) = ∑φ(n × i) for 1 ≤ i ≤ m. (φ is Euler's totient function)
+Let $S(n, m) = \sum φ(n × i)$ for $1 ≤ i ≤ m$. ($φ$ is Euler's totient function)
 
-You are given that S(510510,106 )= 45480596821125120.
+You are given that $S(510\\,510, {10}^6) = 45\\,480\\,596\\,821\\,125\\,120$.
 
-Find S(510510,1011). Give the last 9 digits of your answer.
+Find $S(510\\,510, {10}^{11})$. Give the last 9 digits of your answer.
 
 # --hints--
 
-`euler432()` should return 754862080.
+`totientSum()` should return `754862080`.
 
 ```js
-assert.strictEqual(euler432(), 754862080);
+assert.strictEqual(totientSum(), 754862080);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler432(), 754862080);
 ## --seed-contents--
 
 ```js
-function euler432() {
+function totientSum() {
 
   return true;
 }
 
-euler432();
+totientSum();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.md
index 5423c8691c9..4db4c121e91 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.md
@@ -1,29 +1,34 @@
 ---
 id: 5900f51d1000cf542c51002f
 title: 'Problem 433: Steps in Euclid''s algorithm'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302104
 dashedName: problem-433-steps-in-euclids-algorithm
 ---
 
 # --description--
 
-Let E(x0, y0) be the number of steps it takes to determine the greatest common divisor of x0 and y0 with Euclid's algorithm. More formally:x1 = y0, y1 = x0 mod y0xn = yn-1, yn = xn-1 mod yn-1
+Let $E(x_0, y_0)$ be the number of steps it takes to determine the greatest common divisor of $x_0$ and $y_0$ with Euclid's algorithm. More formally:
 
-E(x0, y0) is the smallest n such that yn = 0.
+$$\begin{align}   & x_1 = y_0, y_1 = x_0\bmod y_0 \\\\
+  & x_n = y_{n - 1}, y_n = x_{n - 1}\bmod y_{n - 1} \end{align}$$
 
-We have E(1,1) = 1, E(10,6) = 3 and E(6,10) = 4.
+$E(x_0, y_0)$ is the smallest $n$ such that $y_n = 0$.
 
-Define S(N) as the sum of E(x,y) for 1 ≤ x,y ≤ N. We have S(1) = 1, S(10) = 221 and S(100) = 39826.
+We have $E(1, 1) = 1$, $E(10, 6) = 3$ and $E(6, 10) = 4$.
 
-Find S(5·106).
+Define $S(N)$ as the sum of $E(x, y)$ for $1 ≤ x$, $y ≤ N$.
+
+We have $S(1) = 1$, $S(10) = 221$ and $S(100) = 39\\,826$.
+
+Find $S(5 \times {10}^6)$.
 
 # --hints--
 
-`euler433()` should return 326624372659664.
+`stepsInEuclidsAlgorithm()` should return `326624372659664`.
 
 ```js
-assert.strictEqual(euler433(), 326624372659664);
+assert.strictEqual(stepsInEuclidsAlgorithm(), 326624372659664);
 ```
 
 # --seed--
@@ -31,12 +36,12 @@ assert.strictEqual(euler433(), 326624372659664);
 ## --seed-contents--
 
 ```js
-function euler433() {
+function stepsInEuclidsAlgorithm() {
 
   return true;
 }
 
-euler433();
+stepsInEuclidsAlgorithm();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md
index 48a01b7a3ba..a570e51bccb 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f51f1000cf542c510031
 title: 'Problem 434: Rigid graphs'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302105
 dashedName: problem-434-rigid-graphs
 ---
@@ -18,18 +18,32 @@ A rigid graph is an embedding of a graph which is not flexible.
 
 Informally, a graph is rigid if by replacing the vertices with fully rotating hinges and the edges with rods that are unbending and inelastic, no parts of the graph can be moved independently from the rest of the graph.
 
-The grid graphs embedded in the Euclidean plane are not rigid, as the following animation demonstrates: However, one can make them rigid by adding diagonal edges to the cells. For example, for the 2x3 grid graph, there are 19 ways to make the graph rigid: Note that for the purposes of this problem, we do not consider changing the orientation of a diagonal edge or adding both diagonal edges to a cell as a different way of making a grid graph rigid.
+The grid graphs embedded in the Euclidean plane are not rigid, as the following animation demonstrates:
 
-Let R(m,n) be the number of ways to make the m × n grid graph rigid. E.g. R(2,3) = 19 and R(5,5) = 23679901
+<img class="img-responsive center-block" alt="animation showing grid graphs are not rigid in Euclidean plane" src="https://cdn.freecodecamp.org/curriculum/project-euler/rigid-graphs-1.gif" style="background-color: white; padding: 10px;" />
 
-Define S(N) as ∑R(i,j) for 1 ≤ i, j ≤ N. E.g. S(5) = 25021721. Find S(100), give your answer modulo 1000000033
+However, one can make them rigid by adding diagonal edges to the cells. For example, for the 2x3 grid graph, there are 19 ways to make the graph rigid:
+
+<img class="img-responsive center-block" alt="19 ways to make 2x3 grid graph rigid" src="https://cdn.freecodecamp.org/curriculum/project-euler/rigid-graphs-2.png" style="background-color: white; padding: 10px;" />
+
+Note that for the purposes of this problem, we do not consider changing the orientation of a diagonal edge or adding both diagonal edges to a cell as a different way of making a grid graph rigid.
+
+Let $R(m, n)$ be the number of ways to make the $m × n$ grid graph rigid.
+
+E.g. $R(2, 3) = 19$ and $R(5, 5) = 23\\,679\\,901$.
+
+Define $S(N)$ as $\sum R(i, j)$ for $1 ≤ i$, $j ≤ N$.
+
+E.g. $S(5) = 25\\,021\\,721$.
+
+Find $S(100)$, give your answer modulo $1\\,000\\,000\\,033$.
 
 # --hints--
 
-`euler434()` should return 863253606.
+`rigidGraphs()` should return `863253606`.
 
 ```js
-assert.strictEqual(euler434(), 863253606);
+assert.strictEqual(rigidGraphs(), 863253606);
 ```
 
 # --seed--
@@ -37,12 +51,12 @@ assert.strictEqual(euler434(), 863253606);
 ## --seed-contents--
 
 ```js
-function euler434() {
+function rigidGraphs() {
 
   return true;
 }
 
-euler434();
+rigidGraphs();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.md
index ee078a73824..9df767adcee 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f5201000cf542c510032
 title: 'Problem 435: Polynomials of Fibonacci numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302106
 dashedName: problem-435-polynomials-of-fibonacci-numbers
 ---
 
 # --description--
 
-The Fibonacci numbers {fn, n ≥ 0} are defined recursively as fn = fn-1 + fn-2 with base cases f0 = 0 and f1 = 1.
+The Fibonacci numbers $\\{f_n, n ≥ 0\\}$ are defined recursively as $f_n = f_{n - 1} + f_{n - 2}$ with base cases $f_0 = 0$ and $f_1 = 1$.
 
-Define the polynomials {Fn, n ≥ 0} as Fn(x) = ∑fixi for 0 ≤ i ≤ n.
+Define the polynomials $\\{F_n, n ≥ 0\\}$ as $F_n(x) = \displaystyle\sum_{i = 0}^n f_ix^i$.
 
-For example, F7(x) = x + x2 + 2x3 + 3x4 + 5x5 + 8x6 + 13x7, and F7(11) = 268357683.
+For example, $F_7(x) = x + x^2 + 2x^3 + 3x^4 + 5x^5 + 8x^6 + 13x^7$, and $F_7(11) = 268\\,357\\,683$.
 
-Let n = 1015. Find the sum \[∑0≤x≤100 Fn(x)] mod 1307674368000 (= 15!).
+Let $n = {10}^{15}$. Find the sum $\displaystyle\sum_{x = 0}^{100} F_n(x)$ and give your answer modulo $1\\,307\\,674\\,368\\,000 \\, (= 15!)$.
 
 # --hints--
 
-`euler435()` should return 252541322550.
+`polynomialsOfFibonacciNumbers()` should return `252541322550`.
 
 ```js
-assert.strictEqual(euler435(), 252541322550);
+assert.strictEqual(polynomialsOfFibonacciNumbers(), 252541322550);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler435(), 252541322550);
 ## --seed-contents--
 
 ```js
-function euler435() {
+function polynomialsOfFibonacciNumbers() {
 
   return true;
 }
 
-euler435();
+polynomialsOfFibonacciNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-436-unfair-wager.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-436-unfair-wager.md
index 43b111b868f..444c6f95d1b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-436-unfair-wager.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-436-unfair-wager.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5221000cf542c510033
 title: 'Problem 436: Unfair wager'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302107
 dashedName: problem-436-unfair-wager
 ---
@@ -14,24 +14,26 @@ She suggests they play a game of chance to determine who will wash the dishes.
 
 For this game, they shall use a generator of independent random numbers uniformly distributed between 0 and 1.
 
-The game starts with S = 0.
+The game starts with $S = 0$.
 
-The first player, Louise, adds to S different random numbers from the generator until S > 1 and records her last random number 'x'.
+The first player, Louise, adds to $S$ different random numbers from the generator until $S > 1$ and records her last random number '$x$'.
 
-The second player, Julie, continues adding to S different random numbers from the generator until S > 2 and records her last random number 'y'.
+The second player, Julie, continues adding to $S$ different random numbers from the generator until $S > 2$ and records her last random number '$y$'.
 
-The player with the highest number wins and the loser washes the dishes, i.e. if y > x the second player wins.
+The player with the highest number wins and the loser washes the dishes, i.e. if $y > x$ the second player wins.
 
-For example, if the first player draws 0.62 and 0.44, the first player turn ends since 0.62+0.44 > 1 and x = 0.44. If the second players draws 0.1, 0.27 and 0.91, the second player turn ends since 0.62+0.44+0.1+0.27+0.91 > 2 and y = 0.91. Since y > x, the second player wins.
+For example, if the first player draws 0.62 and 0.44, the first player turn ends since $0.62 + 0.44 > 1$ and $x = 0.44$. If the second players draws 0.1, 0.27 and 0.91, the second player turn ends since $0.62 + 0.44 + 0.1 + 0.27 + 0.91 > 2$ and $y = 0.91$. Since $y > x$, the second player wins.
 
-Louise thinks about it for a second, and objects: "That's not fair". What is the probability that the second player wins? Give your answer rounded to 10 places behind the decimal point in the form 0.abcdefghij
+Louise thinks about it for a second, and objects: "That's not fair".
+
+What is the probability that the second player wins? Give your answer rounded to 10 places behind the decimal point in the form 0.abcdefghij
 
 # --hints--
 
-`euler436()` should return 0.5276662759.
+`unfairWager()` should return `0.5276662759`.
 
 ```js
-assert.strictEqual(euler436(), 0.5276662759);
+assert.strictEqual(unfairWager(), 0.5276662759);
 ```
 
 # --seed--
@@ -39,12 +41,12 @@ assert.strictEqual(euler436(), 0.5276662759);
 ## --seed-contents--
 
 ```js
-function euler436() {
+function unfairWager() {
 
   return true;
 }
 
-euler436();
+unfairWager();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md
index 0072d0f9a9b..47f1606285d 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f5241000cf542c510036
 title: 'Problem 437: Fibonacci primitive roots'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302108
 dashedName: problem-437-fibonacci-primitive-roots
 ---
 
 # --description--
 
-When we calculate 8n modulo 11 for n=0 to 9 we get: 1, 8, 9, 6, 4, 10, 3, 2, 5, 7.
+When we calculate $8^n$ modulo 11 for $n = 0$ to 9 we get: 1, 8, 9, 6, 4, 10, 3, 2, 5, 7.
 
 As we see all possible values from 1 to 10 occur. So 8 is a primitive root of 11.
 
@@ -16,32 +16,24 @@ But there is more:
 
 If we take a closer look we see:
 
-1+8=9
+$$\begin{align}   & 1 + 8 = 9 \\\\
+  & 8 + 9 = 17 ≡ 6\bmod 11 \\\\   & 9 + 6 = 15 ≡ 4\bmod 11 \\\\
+  & 6 + 4 = 10 \\\\   & 4 + 10 = 14 ≡ 3\bmod 11 \\\\
+  & 10 + 3 = 13 ≡ 2\bmod 11 \\\\   & 3 + 2 = 5 \\\\
+  & 2 + 5 = 7 \\\\ & 5 + 7 = 12 ≡ 1\bmod 11. \end{align}$$
 
-8+9=17≡6 mod 11
+So the powers of 8 mod 11 are cyclic with period 10, and $8^n + 8^{n + 1} ≡ 8^{n + 2} (\text{mod } 11)$. 8 is called a Fibonacci primitive root of 11.
 
-9+6=15≡4 mod 11
+Not every prime has a Fibonacci primitive root. There are 323 primes less than 10000 with one or more Fibonacci primitive roots and the sum of these primes is 1480491.
 
-6+4=10
-
-4+10=14≡3 mod 11
-
-10+3=13≡2 mod 11
-
-3+2=5
-
-2+5=7
-
-5+7=12≡1 mod 11.
-
-So the powers of 8 mod 11 are cyclic with period 10, and 8n + 8n+1 ≡ 8n+2 (mod 11). 8 is called a Fibonacci primitive root of 11. Not every prime has a Fibonacci primitive root. There are 323 primes less than 10000 with one or more Fibonacci primitive roots and the sum of these primes is 1480491. Find the sum of the primes less than 100,000,000 with at least one Fibonacci primitive root.
+Find the sum of the primes less than $100\\,000\\,000$ with at least one Fibonacci primitive root.
 
 # --hints--
 
-`euler437()` should return 74204709657207.
+`fibonacciPrimitiveRoots()` should return `74204709657207`.
 
 ```js
-assert.strictEqual(euler437(), 74204709657207);
+assert.strictEqual(fibonacciPrimitiveRoots(), 74204709657207);
 ```
 
 # --seed--
@@ -49,12 +41,12 @@ assert.strictEqual(euler437(), 74204709657207);
 ## --seed-contents--
 
 ```js
-function euler437() {
+function fibonacciPrimitiveRoots() {
 
   return true;
 }
 
-euler437();
+fibonacciPrimitiveRoots();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md
index 112326a2fa3..05c8bd7d4a5 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md
@@ -1,27 +1,34 @@
 ---
 id: 5900f5231000cf542c510034
 title: 'Problem 438: Integer part of polynomial equation''s solutions'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302109
 dashedName: problem-438-integer-part-of-polynomial-equations-solutions
 ---
 
 # --description--
 
-For an n-tuple of integers t = (a1, ..., an), let (x1, ..., xn) be the solutions of the polynomial equation xn + a1xn-1 + a2xn-2 + ... + an-1x + an = 0.
+For an $n$-tuple of integers $t = (a_1, \ldots, a_n)$, let $(x_1, \ldots, x_n)$ be the solutions of the polynomial equation $x^n + a_1x^{n - 1} + a_2x^{n - 2} + \ldots + a_{n - 1}x + a_n = 0$.
 
-Consider the following two conditions: x1, ..., xn are all real. If x1, ..., xn are sorted, ⌊xi⌋ = i for 1 ≤ i ≤ n. (⌊·⌋: floor function.)
+Consider the following two conditions:
 
-In the case of n = 4, there are 12 n-tuples of integers which satisfy both conditions. We define S(t) as the sum of the absolute values of the integers in t. For n = 4 we can verify that ∑S(t) = 2087 for all n-tuples t which satisfy both conditions.
+- $x_1, \ldots, x_n$ are all real.
+- If $x_1, ..., x_n$ are sorted, $⌊x_i⌋ = i$ for $1 ≤ i ≤ n$. ($⌊·⌋:$ floor function.)
 
-Find ∑S(t) for n = 7.
+In the case of $n = 4$, there are 12 $n$-tuples of integers which satisfy both conditions.
+
+We define $S(t)$ as the sum of the absolute values of the integers in $t$.
+
+For $n = 4$ we can verify that $\sum S(t) = 2087$ for all $n$-tuples $t$ which satisfy both conditions.
+
+Find $\sum S(t)$ for $n = 7$.
 
 # --hints--
 
-`euler438()` should return 2046409616809.
+`polynomialIntegerPart()` should return `2046409616809`.
 
 ```js
-assert.strictEqual(euler438(), 2046409616809);
+assert.strictEqual(polynomialIntegerPart(), 2046409616809);
 ```
 
 # --seed--
@@ -29,12 +36,12 @@ assert.strictEqual(euler438(), 2046409616809);
 ## --seed-contents--
 
 ```js
-function euler438() {
+function polynomialIntegerPart() {
 
   return true;
 }
 
-euler438();
+polynomialIntegerPart();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.md
index 4fb1871a853..bb5669ed088 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f5231000cf542c510035
 title: 'Problem 439: Sum of sum of divisors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302110
 dashedName: problem-439-sum-of-sum-of-divisors
 ---
 
 # --description--
 
-Let d(k) be the sum of all divisors of k.
+Let $d(k)$ be the sum of all divisors of $k$.
 
-We define the function S(N) = ∑1≤i≤N ∑1≤j≤Nd(i·j).
+We define the function $S(N) = \sum_{i = 1}^N \sum_{j = 1}^N d(i \times j)$.
 
-For example, S(3) = d(1) + d(2) + d(3) + d(2) + d(4) + d(6) + d(3) + d(6) + d(9) = 59.
+For example, $S(3) = d(1) + d(2) + d(3) + d(2) + d(4) + d(6) + d(3) + d(6) + d(9) = 59$.
 
-You are given that S(103) = 563576517282 and S(105) mod 109 = 215766508. Find S(1011) mod 109.
+You are given that $S({10}^3) = 563\\,576\\,517\\,282$ and $S({10}^5)\bmod {10}^9 = 215\\,766\\,508$.
+
+Find $S({10}^{11})\bmod {10}^9$.
 
 # --hints--
 
-`euler439()` should return 968697378.
+`sumOfSumOfDivisors()` should return `968697378`.
 
 ```js
-assert.strictEqual(euler439(), 968697378);
+assert.strictEqual(sumOfSumOfDivisors(), 968697378);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler439(), 968697378);
 ## --seed-contents--
 
 ```js
-function euler439() {
+function sumOfSumOfDivisors() {
 
   return true;
 }
 
-euler439();
+sumOfSumOfDivisors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-44-pentagon-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-44-pentagon-numbers.md
index 3b89176ca1a..44905c1be79 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-44-pentagon-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-44-pentagon-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3981000cf542c50feab
 title: 'Problem 44: Pentagon numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302111
 dashedName: problem-44-pentagon-numbers
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md
index a68f99a00ad..49afa9608aa 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md
@@ -1,31 +1,40 @@
 ---
 id: 5900f5241000cf542c510037
 title: 'Problem 440: GCD and Tiling'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302112
 dashedName: problem-440-gcd-and-tiling
 ---
 
 # --description--
 
-We want to tile a board of length n and height 1 completely, with either 1 × 2 blocks or 1 × 1 blocks with a single decimal digit on top:
+We want to tile a board of length $n$ and height 1 completely, with either 1 × 2 blocks or 1 × 1 blocks with a single decimal digit on top:
 
-For example, here are some of the ways to tile a board of length n = 8:
+<img class="img-responsive center-block" alt="ten blocks 1x1 with single decimal digit on top, and 1x2 block" src="https://cdn.freecodecamp.org/curriculum/project-euler/gcd-and-tiling-1.png" style="background-color: white; padding: 10px;" />
 
-Let T(n) be the number of ways to tile a board of length n as described above.
+For example, here are some of the ways to tile a board of length $n = 8$:
 
-For example, T(1) = 10 and T(2) = 101.
+<img class="img-responsive center-block" alt="examples of ways to tile a board of length n = 8" src="https://cdn.freecodecamp.org/curriculum/project-euler/gcd-and-tiling-2.png" style="background-color: white; padding: 10px;" />
 
-Let S(L) be the triple sum ∑a,b,c gcd(T(ca), T(cb)) for 1 ≤ a, b, c ≤ L. For example: S(2) = 10444 S(3) = 1292115238446807016106539989 S(4) mod 987 898 789 = 670616280.
+Let $T(n)$ be the number of ways to tile a board of length $n$ as described above.
 
-Find S(2000) mod 987 898 789.
+For example, $T(1) = 10$ and $T(2) = 101$.
+
+Let $S(L)$ be the triple sum $\sum_{a, b, c} gcd(T(c^a), T(c^b))$ for $1 ≤ a, b, c ≤ L$.
+
+For example:
+
+$$\begin{align}   & S(2) = 10\\,444 \\\\
+  & S(3) = 1\\,292\\,115\\,238\\,446\\,807\\,016\\,106\\,539\\,989 \\\\ & S(4)\bmod 987\\,898\\,789 = 670\\,616\\,280. \end{align}$$
+
+Find $S(2000)\bmod 987\\,898\\,789$.
 
 # --hints--
 
-`euler440()` should return 970746056.
+`gcdAndTiling()` should return `970746056`.
 
 ```js
-assert.strictEqual(euler440(), 970746056);
+assert.strictEqual(gcdAndTiling(), 970746056);
 ```
 
 # --seed--
@@ -33,12 +42,12 @@ assert.strictEqual(euler440(), 970746056);
 ## --seed-contents--
 
 ```js
-function euler440() {
+function gcdAndTiling() {
 
   return true;
 }
 
-euler440();
+gcdAndTiling();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.md
index 6cc5fd7e2eb..9c310a1f18d 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.md
@@ -1,27 +1,31 @@
 ---
 id: 5900f5261000cf542c510038
 title: 'Problem 441: The inverse summation of coprime couples'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302113
 dashedName: problem-441-the-inverse-summation-of-coprime-couples
 ---
 
 # --description--
 
-For an integer M, we define R(M) as the sum of 1/(p·q) for all the integer pairs p and q which satisfy all of these conditions:
+For an integer $M$, we define $R(M)$ as the sum of $\frac{1}{p·q}$ for all the integer pairs $p$ and $q$ which satisfy all of these conditions:
 
-1 ≤ p &lt; q ≤ M p + q ≥ M p and q are coprime.
+- $1 ≤ p &lt; q ≤ M$
+- $p + q ≥ M$
+- $p$ and $q$ are coprime.
 
-We also define S(N) as the sum of R(i) for 2 ≤ i ≤ N. We can verify that S(2) = R(2) = 1/2, S(10) ≈ 6.9147 and S(100) ≈ 58.2962.
+We also define $S(N)$ as the sum of $R(i)$ for $2 ≤ i ≤ N$.
 
-Find S(107). Give your answer rounded to four decimal places.
+We can verify that $S(2) = R(2) = \frac{1}{2}$, $S(10) ≈ 6.9147$ and $S(100) ≈ 58.2962$.
+
+Find $S({10}^7)$. Give your answer rounded to four decimal places.
 
 # --hints--
 
-`euler441()` should return 5000088.8395.
+`inverseSummationCoprimeCouples()` should return `5000088.8395`.
 
 ```js
-assert.strictEqual(euler441(), 5000088.8395);
+assert.strictEqual(inverseSummationCoprimeCouples(), 5000088.8395);
 ```
 
 # --seed--
@@ -29,12 +33,12 @@ assert.strictEqual(euler441(), 5000088.8395);
 ## --seed-contents--
 
 ```js
-function euler441() {
+function inverseSummationCoprimeCouples() {
 
   return true;
 }
 
-euler441();
+inverseSummationCoprimeCouples();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-442-eleven-free-integers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-442-eleven-free-integers.md
index e5b1e35319a..9e2e8d90986 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-442-eleven-free-integers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-442-eleven-free-integers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5271000cf542c510039
 title: 'Problem 442: Eleven-free integers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302114
 dashedName: problem-442-eleven-free-integers
 ---
@@ -12,16 +12,16 @@ An integer is called eleven-free if its decimal expansion does not contain any s
 
 For example, 2404 and 13431 are eleven-free, while 911 and 4121331 are not.
 
-Let E(n) be the nth positive eleven-free integer. For example, E(3) = 3, E(200) = 213 and E(500 000) = 531563.
+Let $E(n)$ be the $n$th positive eleven-free integer. For example, $E(3) = 3$, $E(200) = 213$ and $E(500\\,000) = 531\\,563$.
 
-Find E(1018).
+Find $E({10}^{18})$.
 
 # --hints--
 
-`euler442()` should return 1295552661530920200.
+`elevenFreeIntegers()` should return `1295552661530920200`.
 
 ```js
-assert.strictEqual(euler442(), 1295552661530920200);
+assert.strictEqual(elevenFreeIntegers(), 1295552661530920200);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler442(), 1295552661530920200);
 ## --seed-contents--
 
 ```js
-function euler442() {
+function elevenFreeIntegers() {
 
   return true;
 }
 
-euler442();
+elevenFreeIntegers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md
index 9afda46059a..cfcf641fc67 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f5271000cf542c51003a
 title: 'Problem 443: GCD sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302115
 dashedName: problem-443-gcd-sequence
 ---
 
 # --description--
 
-Let g(n) be a sequence defined as follows: g(4) = 13, g(n) = g(n-1) + gcd(n, g(n-1)) for n > 4.
+Let $g(n)$ be a sequence defined as follows:
 
-The first few values are:
+$$\begin{align}   & g(4) = 13, \\\\
+  & g(n) = g(n-1) + gcd(n, g(n - 1)) \text{ for } n > 4. \end{align}$$
 
-n 4567891011121314151617181920... g(n) 1314161718272829303132333451545560...
+前几个值是：
 
-<!-- TODO Use MathJax -->
+$$\begin{array}{l}   n    & 4  & 5  & 6  & 7  & 8  & 9  & 10 & 11 & 12 & 13 & 14 & 15 & 16 & 17 & 18 & 19 & 20 & \ldots \\\\
+  g(n) & 13 & 14 & 16 & 17 & 18 & 27 & 28 & 29 & 30 & 31 & 32 & 33 & 34 & 51 & 54 & 55 & 60 & \ldots \end{array}$$
 
-You are given that g(1 000) = 2524 and g(1 000 000) = 2624152.
+You are given that $g(1\\,000) = 2\\,524$ and $g(1\\,000\\,000) = 2\\,624\\,152$.
 
-Find g(1015).
+Find $g({10}^{15})$.
 
 # --hints--
 
-`euler443()` should return 2744233049300770.
+`gcdSequence()` should return `2744233049300770`.
 
 ```js
-assert.strictEqual(euler443(), 2744233049300770);
+assert.strictEqual(gcdSequence(), 2744233049300770);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler443(), 2744233049300770);
 ## --seed-contents--
 
 ```js
-function euler443() {
+function gcdSequence() {
 
   return true;
 }
 
-euler443();
+gcdSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.md
index 04d71de4854..9e52d4e52b4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f52a1000cf542c51003b
 title: 'Problem 444: The Roundtable Lottery'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302116
 dashedName: problem-444-the-roundtable-lottery
 ---
 
 # --description--
 
-A group of p people decide to sit down at a round table and play a lottery-ticket trading game. Each person starts off with a randomly-assigned, unscratched lottery ticket. Each ticket, when scratched, reveals a whole-pound prize ranging anywhere from £1 to £p, with no two tickets alike. The goal of the game is for each person to maximize his ticket winnings upon leaving the game.
+A group of $p$ people decide to sit down at a round table and play a lottery-ticket trading game. Each person starts off with a randomly-assigned, unscratched lottery ticket. Each ticket, when scratched, reveals a whole-pound prize ranging anywhere from £1 to £$p$, with no two tickets alike. The goal of the game is for each person to maximize his ticket winnings upon leaving the game.
 
 An arbitrary person is chosen to be the first player. Going around the table, each player has only one of two options:
 
@@ -19,18 +19,26 @@ The game ends once all tickets have been scratched. All players still remaining
 
 Assume that each player uses the optimal strategy for maximizing the expected value of his ticket winnings.
 
-Let E(p) represent the expected number of players left at the table when the game ends in a game consisting of p players (e.g. E(111) = 5.2912 when rounded to 5 significant digits).
+Let $E(p)$ represent the expected number of players left at the table when the game ends in a game consisting of $p$ players (e.g. $E(111) = 5.2912$ when rounded to 5 significant digits).
 
-Let S1(N) = E(p) Let Sk(N) = Sk-1(p) for k > 1
+Let $S_1(N) = \displaystyle\sum_{p = 1}^N E(p)$.
 
-Find S20(1014) and write the answer in scientific notation rounded to 10 significant digits. Use a lowercase e to separate mantissa and exponent (e.g. S3(100) = 5.983679014e5).
+Let $S_k(N) = \displaystyle\sum_{p = 1}^N S_{k - 1}(p)$ for $k > 1$.
+
+Find $S_{20}({10}^{14})$ and write the answer as a string in scientific notation rounded to 10 significant digits. Use a lowercase `e` to separate mantissa and exponent. For example, the answer for $S_3(100)$ would be `5.983679014e5`.
 
 # --hints--
 
-`euler444()` should return 1.200856722e+263.
+`roundtableLottery()` should return a string.
 
 ```js
-assert.strictEqual(euler444(), 1.200856722e263);
+assert(typeof roundtableLottery() === 'string');
+```
+
+`roundtableLottery()` should return the string `1.200856722e263`.
+
+```js
+assert.strictEqual(roundtableLottery(), '1.200856722e263');
 ```
 
 # --seed--
@@ -38,12 +46,12 @@ assert.strictEqual(euler444(), 1.200856722e263);
 ## --seed-contents--
 
 ```js
-function euler444() {
+function roundtableLottery() {
 
   return true;
 }
 
-euler444();
+roundtableLottery();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-445-retractions-a.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-445-retractions-a.md
index 39c80f706d7..841d3796c7d 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-445-retractions-a.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-445-retractions-a.md
@@ -1,27 +1,33 @@
 ---
 id: 5900f52a1000cf542c51003c
 title: 'Problem 445: Retractions A'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302117
 dashedName: problem-445-retractions-a
 ---
 
 # --description--
 
-For every integer n>1, the family of functions fn,a,b is defined
+For every integer $n > 1$, the family of functions $f_{n, a, b}$ is defined by:
 
-by fn,a,b(x)≡ax+b mod n for a,b,x integer and 0
+$f_{n, a, b}(x) ≡ ax + b\bmod n$ for $a, b, x$ integer and $0 \lt a \lt n$, $0 \le b \lt n$, $0 \le x \lt n$.
 
-You are given that ∑ R(c) for c=C(100 000,k), and 1 ≤ k ≤99 999 ≡628701600 (mod 1 000 000 007). (C(n,k) is the binomial coefficient).
+We will call $f_{n, a, b}$ a retraction if $f_{n, a, b}(f_{n, a, b}(x)) \equiv f_{n, a, b}(x)\bmod n$ for every $0 \le x \lt n$.
 
-Find ∑ R(c) for c=C(10 000 000,k), and 1 ≤k≤ 9 999 999. Give your answer modulo 1 000 000 007.
+Let $R(n)$ be the number of retractions for $n$.
+
+You are given that
+
+$$\sum_{k = 1}^{99\\,999} R(\displaystyle\binom{100\\,000}{k}) \equiv 628\\,701\\,600\bmod 1\\,000\\,000\\,007$$
+
+Find $$\sum_{k = 1}^{9\\,999\\,999} R(\displaystyle\binom{10\\,000\\,000}{k})$$ Give your answer modulo $1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler445()` should return 659104042.
+`retractionsA()` should return `659104042`.
 
 ```js
-assert.strictEqual(euler445(), 659104042);
+assert.strictEqual(retractionsA(), 659104042);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler445(), 659104042);
 ## --seed-contents--
 
 ```js
-function euler445() {
+function retractionsA() {
 
   return true;
 }
 
-euler445();
+retractionsA();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-446-retractions-b.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-446-retractions-b.md
index a46677999e8..f1919d426f5 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-446-retractions-b.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-446-retractions-b.md
@@ -1,27 +1,33 @@
 ---
 id: 5900f52c1000cf542c51003d
 title: 'Problem 446: Retractions B'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302118
 dashedName: problem-446-retractions-b
 ---
 
 # --description--
 
-For every integer n>1, the family of functions fn,a,b is defined
+For every integer $n > 1$, the family of functions $f_{n, a, b}$ is defined by:
 
-by fn,a,b(x)≡ax+b mod n for a,b,x integer and 0
+$f_{n, a, b}(x) ≡ ax + b\bmod n$ for $a, b, x$ integer and $0 \lt a \lt n$, $0 \le b \lt n$, $0 \le x \lt n$.
 
-F(N)=∑R(n4+4) for 1≤n≤N. F(1024)=77532377300600.
+We will call $f_{n, a, b}$ a retraction if $f_{n, a, b}(f_{n, a, b}(x)) \equiv f_{n, a, b}(x)\bmod n$ for every $0 \le x \lt n$.
 
-Find F(107) (mod 1 000 000 007)
+Let $R(n)$ be the number of retractions for $n$.
+
+$F(N) = \displaystyle\sum_{n = 1}^N R(n^4 + 4)$.
+
+$F(1024) = 77\\,532\\,377\\,300\\,600$.
+
+Find $F({10}^7)$. Give your answer modulo $1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler446()` should return 907803852.
+`retractionsB()` should return `907803852`.
 
 ```js
-assert.strictEqual(euler446(), 907803852);
+assert.strictEqual(retractionsB(), 907803852);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler446(), 907803852);
 ## --seed-contents--
 
 ```js
-function euler446() {
+function retractionsB() {
 
   return true;
 }
 
-euler446();
+retractionsB();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-447-retractions-c.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-447-retractions-c.md
index c8cb09065ca..882f61f24d0 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-447-retractions-c.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-447-retractions-c.md
@@ -1,27 +1,33 @@
 ---
 id: 5900f52c1000cf542c51003e
 title: 'Problem 447: Retractions C'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302119
 dashedName: problem-447-retractions-c
 ---
 
 # --description--
 
-For every integer n>1, the family of functions fn,a,b is defined
+For every integer $n > 1$, the family of functions $f_{n, a, b}$ is defined by:
 
-by fn,a,b(x)≡ax+b mod n for a,b,x integer and 0
+$f_{n, a, b}(x) ≡ ax + b\bmod n$ for $a, b, x$ integer and $0 \lt a \lt n$, $0 \le b \lt n$, $0 \le x \lt n$.
 
-F(N)=∑R(n) for 2≤n≤N. F(107)≡638042271 (mod 1 000 000 007).
+We will call $f_{n, a, b}$ a retraction if $f_{n, a, b}(f_{n, a, b}(x)) \equiv f_{n, a, b}(x)\bmod n$ for every $0 \le x \lt n$.
 
-Find F(1014) (mod 1 000 000 007).
+Let $R(n)$ be the number of retractions for $n$.
+
+$F(N) = \displaystyle\sum_{n = 2}^N R(n)$.
+
+$F({10}^7) ≡ 638\\,042\\,271\bmod 1\\,000\\,000\\,007$.
+
+Find $F({10}^{14})$. Give your answer modulo $1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler447()` should return 530553372.
+`retractionsC()` should return `530553372`.
 
 ```js
-assert.strictEqual(euler447(), 530553372);
+assert.strictEqual(retractionsC(), 530553372);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler447(), 530553372);
 ## --seed-contents--
 
 ```js
-function euler447() {
+function retractionsC() {
 
   return true;
 }
 
-euler447();
+retractionsC();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.md
index 6bf716c1d34..80f2f1ecb2c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.md
@@ -1,29 +1,31 @@
 ---
 id: 5900f52c1000cf542c51003f
-title: 'Problem 448: Average least common multiple'
-challengeType: 5
+title: '问题 448：平均最小公倍数'
+challengeType: 1
 forumTopicId: 302120
 dashedName: problem-448-average-least-common-multiple
 ---
 
 # --description--
 
-The function lcm(a,b) denotes the least common multiple of a and b.
+The function $lcm(a, b)$ denotes the least common multiple of $a$ and $b$.
 
-Let A(n) be the average of the values of lcm(n,i) for 1≤i≤n.
+Let $A(n)$ be the average of the values of $lcm(n, i)$ for $1 ≤ i ≤ n$.
 
-E.g: A(2)=(2+2)/2=2 and A(10)=(10+10+30+20+10+30+70+40+90+10)/10=32.
+E.g: $A(2) = \frac{2 + 2}{2} = 2$ and $A(10) = \frac{10 + 10 + 30 + 20 + 10 + 30 + 70 + 40 + 90 + 10}{10} = 32$.
 
-Let S(n)=∑A(k) for 1≤k≤n. S(100)=122726.
+Let $S(n) = \sum A(k)$ for $1 ≤ k ≤ n$.
 
-Find S(99999999019) mod 999999017.
+$S(100) = 122\\,726$.
+
+Find $S(99\\,999\\,999\\,019)\bmod 999\\,999\\,017$.
 
 # --hints--
 
-`euler448()` should return 106467648.
+`averageLCM()` should return `106467648`.
 
 ```js
-assert.strictEqual(euler448(), 106467648);
+assert.strictEqual(averageLCM(), 106467648);
 ```
 
 # --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler448(), 106467648);
 ## --seed-contents--
 
 ```js
-function euler448() {
+function averageLCM() {
 
   return true;
 }
 
-euler448();
+averageLCM();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.md
index 18c19230958..f312fd4ab49 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.md
@@ -1,31 +1,29 @@
 ---
 id: 5900f52d1000cf542c510040
 title: 'Problem 449: Chocolate covered candy'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302121
 dashedName: problem-449-chocolate-covered-candy
 ---
 
 # --description--
 
-Phil the confectioner is making a new batch of chocolate covered candy. Each candy centre is shaped like an ellipsoid of revolution defined by the equation: b2x2 + b2y2 + a2z2 = a2b2.
+Phil the confectioner is making a new batch of chocolate covered candy. Each candy centre is shaped like an ellipsoid of revolution defined by the equation: $b^2x^2 + b^2y^2 + a^2z^2 = a^2b^2$.
 
-Phil wants to know how much chocolate is needed to cover one candy centre with a uniform coat of chocolate one millimeter thick. If a=1 mm and b=1 mm, the amount of chocolate required is
+Phil wants to know how much chocolate is needed to cover one candy centre with a uniform coat of chocolate one millimeter thick.
 
-283 π mm3
+If $a = 1$ mm and $b = 1$ mm, the amount of chocolate required is $\frac{28}{3} \pi$ mm<sup>3</sup>
 
-<!-- TODO Use MathJax -->
+If $a = 2$ mm and $b = 1$ mm, the amount of chocolate required is approximately 60.35475635 mm<sup>3</sup>.
 
-If a=2 mm and b=1 mm, the amount of chocolate required is approximately 60.35475635 mm3.
-
-Find the amount of chocolate in mm3 required if a=3 mm and b=1 mm. Give your answer as the number rounded to 8 decimal places behind the decimal point.
+Find the amount of chocolate in mm<sup>3</sup> required if $a = 3$ mm and $b = 1$ mm. Give your answer as the number rounded to 8 decimal places behind the decimal point.
 
 # --hints--
 
-`euler449()` should return 103.37870096.
+`chocolateCoveredCandy()` should return `103.37870096`.
 
 ```js
-assert.strictEqual(euler449(), 103.37870096);
+assert.strictEqual(chocolateCoveredCandy(), 103.37870096);
 ```
 
 # --seed--
@@ -33,12 +31,12 @@ assert.strictEqual(euler449(), 103.37870096);
 ## --seed-contents--
 
 ```js
-function euler449() {
+function chocolateCoveredCandy() {
 
   return true;
 }
 
-euler449();
+chocolateCoveredCandy();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.md
index 5c3b224b4a1..e80bcc8dd50 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3991000cf542c50feac
 title: 'Problem 45: Triangular, pentagonal, and hexagonal'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302122
 dashedName: problem-45-triangular-pentagonal-and-hexagonal
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
index 17cf3af082d..9bfd7f5d15a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f52e1000cf542c510041
 title: 'Problem 450: Hypocycloid and Lattice points'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302123
 dashedName: problem-450-hypocycloid-and-lattice-points
 ---
@@ -10,34 +10,37 @@ dashedName: problem-450-hypocycloid-and-lattice-points
 
 A hypocycloid is the curve drawn by a point on a small circle rolling inside a larger circle. The parametric equations of a hypocycloid centered at the origin, and starting at the right most point is given by:
 
-$x(t) = (R - r) \\cos(t) + r \\cos(\\frac {R - r} r t)$
+$$x(t) = (R - r) \cos(t) + r \cos(\frac{R - r}{r}t)$$
 
-$y(t) = (R - r) \\sin(t) - r \\sin(\\frac {R - r} r t)$
+$$y(t) = (R - r) \sin(t) - r \sin(\frac{R - r}{r} t)$$
 
-Where R is the radius of the large circle and r the radius of the small circle.
+Where $R$ is the radius of the large circle and $r$ the radius of the small circle.
 
-Let $C(R, r)$ be the set of distinct points with integer coordinates on the hypocycloid with radius R and r and for which there is a corresponding value of t such that $\\sin(t)$ and $\\cos(t)$ are rational numbers.
+Let $C(R, r)$ be the set of distinct points with integer coordinates on the hypocycloid with radius $R$ and $r$ and for which there is a corresponding value of $t$ such that $\sin(t)$ and $\cos(t)$ are rational numbers.
 
-Let $S(R, r) = \\sum\_{(x,y) \\in C(R, r)} |x| + |y|$ be the sum of the absolute values of the x and y coordinates of the points in $C(R, r)$.
+Let $S(R, r) = \sum\_{(x,y) \in C(R, r)} |x| + |y|$ be the sum of the absolute values of the $x$ and $y$ coordinates of the points in $C(R, r)$.
 
-Let $T(N) = \\sum*{R = 3}^N \\sum*{r=1}^{\\lfloor \\frac {R - 1} 2 \\rfloor} S(R, r)$ be the sum of $S(R, r)$ for R and r positive integers, $R\\leq N$ and $2r &lt; R$.
+Let $T(N) = \sum_{R = 3}^N \sum_{r=1}^{\left\lfloor \frac{R - 1}{2} \right\rfloor} S(R, r)$ be the sum of $S(R, r)$ for $R$ and $r$ positive integers, $R\leq N$ and $2r &lt; R$.
 
-You are given:C(3, 1) = {(3, 0), (-1, 2), (-1,0), (-1,-2)} C(2500, 1000) = {(2500, 0), (772, 2376), (772, -2376), (516, 1792), (516, -1792), (500, 0), (68, 504), (68, -504),(-1356, 1088), (-1356, -1088), (-1500, 1000), (-1500, -1000)}
+You are given:
 
-Note: (-625, 0) is not an element of C(2500, 1000) because $\\sin(t)$ is not a rational number for the corresponding values of t.
+$$\begin{align}   C(3, 1) = & \\{(3, 0), (-1, 2), (-1,0), (-1,-2)\\} \\\\
+  C(2500, 1000) = & \\{(2500, 0), (772, 2376), (772, -2376), (516, 1792), (516, -1792), (500, 0), (68, 504), \\\\ &(68, -504),(-1356, 1088), (-1356, -1088), (-1500, 1000), (-1500, -1000)\\} \end{align}$$
 
-S(3, 1) = (|3| + |0|) + (|-1| + |2|) + (|-1| + |0|) + (|-1| + |-2|) = 10
+**Note:** (-625, 0) is not an element of $C(2500, 1000)$ because $\sin(t)$ is not a rational number for the corresponding values of $t$.
 
-T(3) = 10; T(10) = 524 ;T(100) = 580442; T(103) = 583108600.
+$S(3, 1) = (|3| + |0|) + (|-1| + |2|) + (|-1| + |0|) + (|-1| + |-2|) = 10$
 
-Find T(106).
+$T(3) = 10$; $T(10) = 524$; $T(100) = 580\\,442$; $T({10}^3) = 583\\,108\\,600$.
+
+Find $T({10}^6)$.
 
 # --hints--
 
-`euler450()` should return 583333163984220900.
+`hypocycloidAndLatticePoints()` should return `583333163984220900`.
 
 ```js
-assert.strictEqual(euler450(), 583333163984220900);
+assert.strictEqual(hypocycloidAndLatticePoints(), 583333163984220900);
 ```
 
 # --seed--
@@ -45,12 +48,12 @@ assert.strictEqual(euler450(), 583333163984220900);
 ## --seed-contents--
 
 ```js
-function euler450() {
+function hypocycloidAndLatticePoints() {
 
   return true;
 }
 
-euler450();
+hypocycloidAndLatticePoints();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md
index 1b12ec1c227..39ebff17846 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5311000cf542c510042
 title: 'Problem 451: Modular inverses'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302124
 dashedName: problem-451-modular-inverses
 ---
@@ -12,32 +12,27 @@ Consider the number 15.
 
 There are eight positive numbers less than 15 which are coprime to 15: 1, 2, 4, 7, 8, 11, 13, 14.
 
-The modular inverses of these numbers modulo 15 are: 1, 8, 4, 13, 2, 11, 7, 14
+The modular inverses of these numbers modulo 15 are: 1, 8, 4, 13, 2, 11, 7, 14 because
 
-because
+$$\begin{align}   & 1  \times 1\bmod 15 = 1 \\\\
+  & 2  \times 8  = 16\bmod 15 = 1 \\\\   & 4  \times 4  = 16\bmod 15 = 1 \\\\
+  & 7  \times 13 = 91\bmod 15 = 1 \\\\   & 11 \times 11 = 121\bmod 15 = 1 \\\\
+  & 14 \times 14 = 196\bmod 15 = 1 \end{align}$$
 
-1\*1 mod 15=1
+Let $I(n)$ be the largest positive number $m$ smaller than $n - 1$ such that the modular inverse of $m$ modulo $n$ equals $m$ itself.
 
-2\*8=16 mod 15=1
+So $I(15) = 11$.
 
-4\*4=16 mod 15=1
+Also $I(100) = 51$ and $I(7) = 1$.
 
-7\*13=91 mod 15=1
-
-11\*11=121 mod 15=1
-
-14\*14=196 mod 15=1
-
-Let I(n) be the largest positive number m smaller than n-1 such that the modular inverse of m modulo n equals m itself. So I(15)=11. Also I(100)=51 and I(7)=1.
-
-Find ∑I(n) for 3≤n≤2·107
+Find $\sum I(n)$ for $3 ≤ n ≤ 2 \times {10}^7$
 
 # --hints--
 
-`euler451()` should return 153651073760956.
+`modularInverses()` should return `153651073760956`.
 
 ```js
-assert.strictEqual(euler451(), 153651073760956);
+assert.strictEqual(modularInverses(), 153651073760956);
 ```
 
 # --seed--
@@ -45,12 +40,12 @@ assert.strictEqual(euler451(), 153651073760956);
 ## --seed-contents--
 
 ```js
-function euler451() {
+function modularInverses() {
 
   return true;
 }
 
-euler451();
+modularInverses();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-452-long-products.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-452-long-products.md
index b52ca22d506..abb043bcebe 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-452-long-products.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-452-long-products.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f5311000cf542c510043
 title: 'Problem 452: Long Products'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302125
 dashedName: problem-452-long-products
 ---
 
 # --description--
 
-Define F(m,n) as the number of n-tuples of positive integers for which the product of the elements doesn't exceed m.
+Define $F(m, n)$ as the number of $n$-tuples of positive integers for which the product of the elements doesn't exceed $m$.
 
-F(10, 10) = 571.
+$F(10, 10) = 571$.
 
-F(106, 106) mod 1 234 567 891 = 252903833.
+$F({10}^6, {10}^6)\bmod 1\\,234\\,567\\,891 = 252\\,903\\,833$.
 
-Find F(109, 109) mod 1 234 567 891.
+Find $F({10}^9, {10}^9)\bmod 1\\,234\\,567\\,891$.
 
 # --hints--
 
-`euler452()` should return 345558983.
+`longProducts()` should return `345558983`.
 
 ```js
-assert.strictEqual(euler452(), 345558983);
+assert.strictEqual(longProducts(), 345558983);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler452(), 345558983);
 ## --seed-contents--
 
 ```js
-function euler452() {
+function longProducts() {
 
   return true;
 }
 
-euler452();
+longProducts();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md
index 69b668a626e..f809ebc60a5 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5311000cf542c510044
 title: 'Problem 453: Lattice Quadrilaterals'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302126
 dashedName: problem-453-lattice-quadrilaterals
 ---
@@ -10,20 +10,22 @@ dashedName: problem-453-lattice-quadrilaterals
 
 A simple quadrilateral is a polygon that has four distinct vertices, has no straight angles and does not self-intersect.
 
-Let Q(m, n) be the number of simple quadrilaterals whose vertices are lattice points with coordinates (x,y) satisfying 0 ≤ x ≤ m and 0 ≤ y ≤ n.
+Let $Q(m, n)$ be the number of simple quadrilaterals whose vertices are lattice points with coordinates ($x$, $y$) satisfying $0 ≤ x ≤ m$ and $0 ≤ y ≤ n$.
 
-For example, Q(2, 2) = 94 as can be seen below:
+For example, $Q(2, 2) = 94$ as can be seen below:
 
-It can also be verified that Q(3, 7) = 39590, Q(12, 3) = 309000 and Q(123, 45) = 70542215894646.
+<img class="img-responsive center-block" alt="94 quadrilaterals whose vertices are lattice points with coordinates (x, y) satiffying 0 &le; x &le; m and 0 &le; y &le; n" src="https://cdn.freecodecamp.org/curriculum/project-euler/lattice-quadrilaterals.png" style="background-color: white; padding: 10px;" />
 
-Find Q(12345, 6789) mod 135707531.
+It can also be verified that $Q(3, 7) = 39\\,590$, $Q(12, 3) = 309\\,000$ and $Q(123, 45) = 70\\,542\\,215\\,894\\,646$.
+
+Find $Q(12\\,345, 6\\,789)\bmod 135\\,707\\,531$.
 
 # --hints--
 
-`euler453()` should return 104354107.
+`latticeQuadrilaterals()` should return `104354107`.
 
 ```js
-assert.strictEqual(euler453(), 104354107);
+assert.strictEqual(latticeQuadrilaterals(), 104354107);
 ```
 
 # --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler453(), 104354107);
 ## --seed-contents--
 
 ```js
-function euler453() {
+function latticeQuadrilaterals() {
 
   return true;
 }
 
-euler453();
+latticeQuadrilaterals();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.md
index 414cfab965d..b2fca3b4a6b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f5331000cf542c510045
 title: 'Problem 454: Diophantine reciprocals III'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302127
 dashedName: problem-454-diophantine-reciprocals-iii
 ---
 
 # --description--
 
-In the following equation x, y, and n are positive integers. 1/x + 1/y= 1/n
+In the following equation $x$, $y$, and $n$ are positive integers.
 
-<!-- TODO Use MathJax -->
+$$\frac{1}{x} + \frac{1}{y} = \frac{1}{n}$$
 
-For a limit L we define F(L) as the number of solutions which satisfy x &lt; y ≤ L.
+For a limit $L$ we define $F(L)$ as the number of solutions which satisfy $x &lt; y ≤ L$.
 
-We can verify that F(15) = 4 and F(1000) = 1069. Find F(1012).
+We can verify that $F(15) = 4$ and $F(1000) = 1069$.
+
+Find $F({10}^{12})$.
 
 # --hints--
 
-`euler454()` should return 5435004633092.
+`diophantineReciprocalsThree()` should return `5435004633092`.
 
 ```js
-assert.strictEqual(euler454(), 5435004633092);
+assert.strictEqual(diophantineReciprocalsThree(), 5435004633092);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler454(), 5435004633092);
 ## --seed-contents--
 
 ```js
-function euler454() {
+function diophantineReciprocalsThree() {
 
   return true;
 }
 
-euler454();
+diophantineReciprocalsThree();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md
index 71202a5f3f2..8e453a983c2 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md
@@ -1,25 +1,29 @@
 ---
 id: 5900f5331000cf542c510046
 title: 'Problem 455: Powers With Trailing Digits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302129
 dashedName: problem-455-powers-with-trailing-digits
 ---
 
 # --description--
 
-Let f(n) be the largest positive integer x less than 109 such that the last 9 digits of nx form the number x (including leading zeros), or zero if no such integer exists.
+Let $f(n)$ be the largest positive integer $x$ less than ${10}^9$ such that the last 9 digits of $n^x$ form the number $x$ (including leading zeros), or zero if no such integer exists.
 
 For example:
 
-f(4) = 411728896 (4411728896 = ...490411728896) f(10) = 0 f(157) = 743757 (157743757 = ...567000743757) Σf(n), 2 ≤ n ≤ 103 = 442530011399 Find Σf(n), 2 ≤ n ≤ 106.
+$$\begin{align}   & f(4) = 411\\,728\\,896 (4^{411\\,728\\,896} = ...490\underline{411728896}) \\\\
+  & f(10) = 0 \\\\   & f(157) = 743\\,757 (157^{743\\,757} = ...567\underline{000743757}) \\\\
+  & Σf(n), 2 ≤ n ≤ 103 = 442\\,530\\,011\\,399 \end{align}$$
+
+Find $\sum f(n)$, $2 ≤ n ≤ {10}^6$.
 
 # --hints--
 
-`euler455()` should return 450186511399999.
+`powersWithTrailingDigits()` should return `450186511399999`.
 
 ```js
-assert.strictEqual(euler455(), 450186511399999);
+assert.strictEqual(powersWithTrailingDigits(), 450186511399999);
 ```
 
 # --seed--
@@ -27,12 +31,12 @@ assert.strictEqual(euler455(), 450186511399999);
 ## --seed-contents--
 
 ```js
-function euler455() {
+function powersWithTrailingDigits() {
 
   return true;
 }
 
-euler455();
+powersWithTrailingDigits();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.md
index fba2743a699..b350043a07e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.md
@@ -1,31 +1,35 @@
 ---
 id: 5900f5351000cf542c510047
 title: 'Problem 456: Triangles containing the origin II'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302130
 dashedName: problem-456-triangles-containing-the-origin-ii
 ---
 
 # --description--
 
-Define:xn = (1248n mod 32323) - 16161yn = (8421n mod 30103) - 15051
+定义
 
-Pn = {(x1, y1), (x2, y2), ..., (xn, yn)}
+$$\begin{align}   & x_n = ({1248}^n\bmod 32323) - 16161 \\\\
+  & y_n = ({8421}^n\bmod 30103) - 15051 \\\\ & P_n = \\{(x_1, y_1), (x_2, y_2), \ldots, (x_n, y_n)\\} \end{align}$$
 
-For example, P8 = {(-14913, -6630), (-10161, 5625), (5226, 11896), (8340, -10778), (15852, -5203), (-15165, 11295), (-1427, -14495), (12407, 1060)}.
+For example, $$P_8 = \\{(-14913, -6630), (-10161, 5625), (5226, 11896), (8340, -10778), (15852, -5203), (-15165, 11295), (-1427, -14495), (12407, 1060)\\}$$
 
-Let C(n) be the number of triangles whose vertices are in Pn which contain the origin in the interior.
+Let $C(n)$ be the number of triangles whose vertices are in $P_n$ which contain the origin in the interior.
 
-Examples: C(8) = 20 C(600) = 8950634 C(40 000) = 2666610948988
+示例：
 
-Find C(2 000 000).
+$$\begin{align}   & C(8) = 20 \\\\
+  & C(600) = 8\\,950\\,634 \\\\ & C(40\\,000) = 2\\,666\\,610\\,948\\,988 \end{align}$$
+
+Find $C(2\\,000\\,000)$.
 
 # --hints--
 
-`euler456()` should return 333333208685971500.
+`trianglesContainingOriginTwo()` should return `333333208685971500`.
 
 ```js
-assert.strictEqual(euler456(), 333333208685971500);
+assert.strictEqual(trianglesContainingOriginTwo(), 333333208685971500);
 ```
 
 # --seed--
@@ -33,12 +37,12 @@ assert.strictEqual(euler456(), 333333208685971500);
 ## --seed-contents--
 
 ```js
-function euler456() {
+function trianglesContainingOriginTwo() {
 
   return true;
 }
 
-euler456();
+trianglesContainingOriginTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.md
index 77c3da532c9..b187b6c488a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f5361000cf542c510048
 title: 'Problem 457: A polynomial modulo the square of a prime'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302131
 dashedName: problem-457-a-polynomial-modulo-the-square-of-a-prime
 ---
 
 # --description--
 
-Let f(n) = n2 - 3n - 1.
+Let $f(n) = n^2 - 3n - 1$.
 
-Let p be a prime.
+Let $p$ be a prime.
 
-Let R(p) be the smallest positive integer n such that f(n) mod p2 = 0 if such an integer n exists, otherwise R(p) = 0.
+Let $R(p)$ be the smallest positive integer $n$ such that $f(n)\bmod p^2 = 0$ if such an integer $n$ exists, otherwise $R(p) = 0$.
 
-Let SR(L) be ∑R(p) for all primes not exceeding L.
+Let $SR(L)$ be $\sum R(p)$ for all primes not exceeding $L$.
 
-Find SR(107).
+Find $SR({10}^7)$.
 
 # --hints--
 
-`euler457()` should return 2647787126797397000.
+`polynomialModuloSquareOfPrime()` should return `2647787126797397000`.
 
 ```js
-assert.strictEqual(euler457(), 2647787126797397000);
+assert.strictEqual(polynomialModuloSquareOfPrime(), 2647787126797397000);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler457(), 2647787126797397000);
 ## --seed-contents--
 
 ```js
-function euler457() {
+function polynomialModuloSquareOfPrime() {
 
   return true;
 }
 
-euler457();
+polynomialModuloSquareOfPrime();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-458-permutations-of-project.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-458-permutations-of-project.md
index de844d0fe53..c368503124d 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-458-permutations-of-project.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-458-permutations-of-project.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f5361000cf542c510049
 title: 'Problem 458: Permutations of Project'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302132
 dashedName: problem-458-permutations-of-project
 ---
 
 # --description--
 
-Consider the alphabet A made out of the letters of the word "project": A={c,e,j,o,p,r,t}.
+Consider the alphabet $A$ made out of the letters of the word `project`: $A = \\{c, e, j, o, p, r, t\\}$.
 
-Let T(n) be the number of strings of length n consisting of letters from A that do not have a substring that is one of the 5040 permutations of "project".
+Let $T(n)$ be the number of strings of length $n$ consisting of letters from $A$ that do not have a substring that is one of the 5040 permutations of `project`.
 
-T(7)=77-7!=818503.
+$T(7) = 7^7 - 7! = 818\\,503$.
 
-Find T(1012). Give the last 9 digits of your answer.
+Find $T({10}^{12})$. Give the last 9 digits of your answer.
 
 # --hints--
 
-`euler458()` should return 423341841.
+`permutationsOfProject()` should return `423341841`.
 
 ```js
-assert.strictEqual(euler458(), 423341841);
+assert.strictEqual(permutationsOfProject(), 423341841);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler458(), 423341841);
 ## --seed-contents--
 
 ```js
-function euler458() {
+function permutationsOfProject() {
 
   return true;
 }
 
-euler458();
+permutationsOfProject();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-459-flipping-game.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-459-flipping-game.md
index 72134eec524..06a1053951c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-459-flipping-game.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-459-flipping-game.md
@@ -1,35 +1,45 @@
 ---
 id: 5900f5371000cf542c51004a
-title: 'Problem 459: Flipping game'
-challengeType: 5
+title: '问题 459：翻转游戏'
+challengeType: 1
 forumTopicId: 302133
 dashedName: problem-459-flipping-game
 ---
 
 # --description--
 
-The flipping game is a two player game played on a N by N square board.
+The flipping game is a two player game played on a $N$ by $N$ square board.
 
 Each square contains a disk with one side white and one side black.
 
 The game starts with all disks showing their white side.
 
-A turn consists of flipping all disks in a rectangle with the following properties: the upper right corner of the rectangle contains a white disk the rectangle width is a perfect square (1, 4, 9, 16, ...) the rectangle height is a triangular number (1, 3, 6, 10, ...)
+A turn consists of flipping all disks in a rectangle with the following properties:
+
+- the upper right corner of the rectangle contains a white disk
+- the rectangle width is a perfect square (1, 4, 9, 16, ...)
+- the rectangle height is a triangular number (1, 3, 6, 10, ...)
+
+<img class="img-responsive center-block" alt="flipping all disks in a 4x3 rectangle on a 5x5 board" src="https://cdn.freecodecamp.org/curriculum/project-euler/flipping-game-1.png" style="background-color: white; padding: 10px;" />
 
 Players alternate turns. A player wins by turning the grid all black.
 
-Let W(N) be the number of winning moves for the first player on a N by N board with all disks white, assuming perfect play. W(1) = 1, W(2) = 0, W(5) = 8 and W(102) = 31395.
+Let $W(N)$ be the number of winning moves for the first player on a $N$ by $N$ board with all disks white, assuming perfect play.
 
-For N=5, the first player's eight winning first moves are:
+$W(1) = 1$, $W(2) = 0$, $W(5) = 8$ and $W({10}^2) = 31\\,395$.
 
-Find W(106).
+For $N = 5$, the first player's eight winning first moves are:
+
+<img class="img-responsive center-block" alt="eight winning first moves for N = 5" src="https://cdn.freecodecamp.org/curriculum/project-euler/flipping-game-2.png" style="background-color: white; padding: 10px;" />
+
+Find $W({10}^6)$.
 
 # --hints--
 
-`euler459()` should return 3996390106631.
+`flippingGame()` should return `3996390106631`.
 
 ```js
-assert.strictEqual(euler459(), 3996390106631);
+assert.strictEqual(flippingGame(), 3996390106631);
 ```
 
 # --seed--
@@ -37,12 +47,12 @@ assert.strictEqual(euler459(), 3996390106631);
 ## --seed-contents--
 
 ```js
-function euler459() {
+function flippingGame() {
 
   return true;
 }
 
-euler459();
+flippingGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md
index 9cd82e5bdf2..1bcc859d05e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f39a1000cf542c50fead
 title: 'Problem 46: Goldbach''s other conjecture'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302134
 dashedName: problem-46-goldbachs-other-conjecture
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md
index 467a9693c3a..2bb68f203f4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md
@@ -1,31 +1,40 @@
 ---
 id: 5900f5381000cf542c51004b
 title: 'Problem 460: An ant on the move'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302135
 dashedName: problem-460-an-ant-on-the-move
 ---
 
 # --description--
 
-On the Euclidean plane, an ant travels from point A(0, 1) to point B(d, 1) for an integer d.
+On the Euclidean plane, an ant travels from point $A(0, 1)$ to point $B(d, 1)$ for an integer $d$.
 
-In each step, the ant at point (x0, y0) chooses one of the lattice points (x1, y1) which satisfy x1 ≥ 0 and y1 ≥ 1 and goes straight to (x1, y1) at a constant velocity v. The value of v depends on y0 and y1 as follows: If y0 = y1, the value of v equals y0. If y0 ≠ y1, the value of v equals (y1 - y0) / (ln(y1) - ln(y0)).
+In each step, the ant at point ($x_0$, $y_0$) chooses one of the lattice points ($x_1$, $y_1$) which satisfy $x_1 ≥ 0$ and $y_1 ≥ 1$ and goes straight to ($x_1$, $y_1$) at a constant velocity $v$. The value of $v$ depends on $y_0$ and $y_1$ as follows:
 
-The left image is one of the possible paths for d = 4. First the ant goes from A(0, 1) to P1(1, 3) at velocity (3 - 1) / (ln(3) - ln(1)) ≈ 1.8205. Then the required time is sqrt(5) / 1.8205 ≈ 1.2283. From P1(1, 3) to P2(3, 3) the ant travels at velocity 3 so the required time is 2 / 3 ≈ 0.6667. From P2(3, 3) to B(4, 1) the ant travels at velocity (1 - 3) / (ln(1) - ln(3)) ≈ 1.8205 so the required time is sqrt(5) / 1.8205 ≈ 1.2283. Thus the total required time is 1.2283 + 0.6667 + 1.2283 = 3.1233.
+- If $y_0 = y_1$, the value of $v$ equals $y_0$.
+- If $y_0 ≠ y_1$, the value of $v$ equals $\frac{y_1 - y_0}{\ln y_1 - \ln y_0}$.
 
-The right image is another path. The total required time is calculated as 0.98026 + 1 + 0.98026 = 2.96052. It can be shown that this is the quickest path for d = 4.
+The left image is one of the possible paths for $d = 4$. First the ant goes from $A(0, 1)$ to $P_1(1, 3)$ at velocity $\frac{3 - 1}{\ln 3 - \ln 1} ≈ 1.8205$. Then the required time is $\frac{\sqrt{5}}{1.820} ≈ 1.2283$.
 
-Let F(d) be the total required time if the ant chooses the quickest path. For example, F(4) ≈ 2.960516287. We can verify that F(10) ≈ 4.668187834 and F(100) ≈ 9.217221972.
+From $P_1(1, 3)$ to $P_2(3, 3)$ the ant travels at velocity 3 so the required time is $\frac{2}{3} ≈ 0.6667$. From $P_2(3, 3)$ to $B(4, 1)$ the ant travels at velocity $\frac{1 - 3}{\ln 1 - \ln 3} ≈ 1.8205$ so the required time is $\frac{\sqrt{5}}{1.8205} ≈ 1.2283$.
 
-Find F(10000). Give your answer rounded to nine decimal places.
+Thus the total required time is $1.2283 + 0.6667 + 1.2283 = 3.1233$.
+
+The right image is another path. The total required time is calculated as $0.98026 + 1 + 0.98026 = 2.96052$. It can be shown that this is the quickest path for $d = 4$.
+
+<img class="img-responsive center-block" alt="two possible paths for d = 4" src="https://cdn.freecodecamp.org/curriculum/project-euler/an-ant-on-the-move.jpg" style="background-color: white; padding: 10px;" />
+
+Let $F(d)$ be the total required time if the ant chooses the quickest path. For example, $F(4) ≈ 2.960\\,516\\,287$. We can verify that $F(10) ≈ 4.668\\,187\\,834$ and $F(100) ≈ 9.217\\,221\\,972$.
+
+Find $F(10\\,000)$. Give your answer rounded to nine decimal places.
 
 # --hints--
 
-`euler460()` should return 18.420738199.
+`antOnTheMove()` should return `18.420738199`.
 
 ```js
-assert.strictEqual(euler460(), 18.420738199);
+assert.strictEqual(antOnTheMove(), 18.420738199);
 ```
 
 # --seed--
@@ -33,12 +42,12 @@ assert.strictEqual(euler460(), 18.420738199);
 ## --seed-contents--
 
 ```js
-function euler460() {
+function antOnTheMove() {
 
   return true;
 }
 
-euler460();
+antOnTheMove();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-461-almost-pi.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-461-almost-pi.md
index 9903fbe0108..1ff7e49ee6b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-461-almost-pi.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-461-almost-pi.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f53a1000cf542c51004c
 title: 'Problem 461: Almost Pi'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302136
 dashedName: problem-461-almost-pi
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-462-permutation-of-3-smooth-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-462-permutation-of-3-smooth-numbers.md
index 6eb9550e454..b17dc1befcd 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-462-permutation-of-3-smooth-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-462-permutation-of-3-smooth-numbers.md
@@ -1,20 +1,18 @@
 ---
 id: 5900f53b1000cf542c51004d
 title: 'Problem 462: Permutation of 3-smooth numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302137
 dashedName: problem-462-permutation-of-3-smooth-numbers
 ---
 
 # --description--
 
-<!-- TODO use MathJax -->
+A 3-smooth number is an integer which has no prime factor larger than 3. For an integer $N$, we define $S(N)$ as the set of 3-smooth numbers less than or equal to $N$. For example, $S(20) = \\{1, 2, 3, 4, 6, 8, 9, 12, 16, 18\\}$.
 
-A 3-smooth number is an integer which has no prime factor larger than 3. For an integer N, we define S(N) as the set of 3-smooth numbers less than or equal to N . For example, S(20) = { 1, 2, 3, 4, 6, 8, 9, 12, 16, 18 }.
+We define $F(N)$ as the number of permutations of $S(N)$ in which each element comes after all of its proper divisors.
 
-We define F(N) as the number of permutations of S(N) in which each element comes after all of its proper divisors.
-
-This is one of the possible permutations for N = 20.
+This is one of the possible permutations for $N = 20$.
 
 -   1, 2, 4, 3, 9, 8, 16, 6, 18, 12.
 
@@ -22,14 +20,22 @@ This is not a valid permutation because 12 comes before its divisor 6.
 
 -   1, 2, 4, 3, 9, 8, 12, 16, 6, 18.
 
-We can verify that F(6) = 5, F(8) = 9, F(20) = 450 and F(1000) ≈ 8.8521816557e21. Find F(1018). Give as your answer its scientific notation rounded to ten digits after the decimal point. When giving your answer, use a lowercase e to separate mantissa and exponent. E.g. if the answer is 112,233,445,566,778,899 then the answer format would be 1.1223344557e17.
+We can verify that $F(6) = 5$, $F(8) = 9$, $F(20) = 450$ and $F(1000) ≈ 8.8521816557e\\,21$.
+
+Find $F({10}^{18})$. Give as your answer as a string in its scientific notation rounded to ten digits after the decimal point. When giving your answer, use a lowercase `e` to separate mantissa and exponent. E.g. if the answer is $112\\,233\\,445\\,566\\,778\\,899$ then the answer format would be `1.1223344557e17`.
 
 # --hints--
 
-`euler462()` should return Infinity.
+`permutationOf3SmoothNumbers()` should return a string.
 
 ```js
-assert.strictEqual(euler462(), Infinity);
+assert.strictEqual(typeof permutationOf3SmoothNumbers() === 'string');
+```
+
+`permutationOf3SmoothNumbers()` should return the string `5.5350769703e1512`.
+
+```js
+assert.strictEqual(permutationOf3SmoothNumbers(), '5.5350769703e1512');
 ```
 
 # --seed--
@@ -37,12 +43,12 @@ assert.strictEqual(euler462(), Infinity);
 ## --seed-contents--
 
 ```js
-function euler462() {
+function permutationOf3SmoothNumbers() {
 
   return true;
 }
 
-euler462();
+permutationOf3SmoothNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md
index 014935108f6..a8e3607195e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f53c1000cf542c51004e
 title: 'Problem 463: A weird recurrence relation'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302138
 dashedName: problem-463-a-weird-recurrence-relation
 ---
@@ -10,24 +10,22 @@ dashedName: problem-463-a-weird-recurrence-relation
 
 The function $f$ is defined for all positive integers as follows:
 
-$f(1)=1$
+$$\begin{align}   & f(1) = 1 \\\\
+  & f(3) = 3 \\\\   & f(2n) = f(n) \\\\
+  & f(4n + 1) = 2f(2n + 1) - f(n) \\\\ & f(4n + 3) = 3f(2n + 1) - 2f(n) \end{align}$$
 
-$f(3)=3$
+The function $S(n)$ is defined as $\sum_{i=1}^{n} f(i)$.
 
-$f(2n)=f(n)$
+$S(8) = 22$ and $S(100) = 3604$.
 
-$f(4n + 1)=2f(2n + 1) - f(n)$
-
-$f(4n + 3)=3f(2n + 1) - 2f(n)$
-
-The function $S(n)$ is defined as $\\sum\_{i=1}^{n}f(i)$. $S(8)=22$ and $S(100)=3604$. Find $S(3^{37})$. Give the last 9 digits of your answer.
+Find $S(3^{37})$. Give the last 9 digits of your answer.
 
 # --hints--
 
-`euler463()` should return 808981553.
+`weirdRecurrenceRelation()` should return `808981553`.
 
 ```js
-assert.strictEqual(euler463(), 808981553);
+assert.strictEqual(weirdRecurrenceRelation(), 808981553);
 ```
 
 # --seed--
@@ -35,12 +33,12 @@ assert.strictEqual(euler463(), 808981553);
 ## --seed-contents--
 
 ```js
-function euler463() {
+function weirdRecurrenceRelation() {
 
   return true;
 }
 
-euler463();
+weirdRecurrenceRelation();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.md
index 5b209dd1d75..d293fcda274 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.md
@@ -1,33 +1,40 @@
 ---
 id: 5900f53d1000cf542c51004f
 title: 'Problem 464: Möbius function and intervals'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302139
 dashedName: problem-464-mbius-function-and-intervals
 ---
 
 # --description--
 
-The Möbius function, denoted μ(n), is defined as:
+The Möbius function, denoted $μ(n)$, is defined as:
 
-μ(n) = (-1)ω(n) if n is squarefree (where ω(n) is the number of distinct prime factors of n)
+- $μ(n) = (-1)^{ω(n)}$ if $n$ is squarefree (where $ω(n)$ is the number of distinct prime factors of $n$)
+- $μ(n) = 0$ if $n$ is not squarefree.
 
-μ(n) = 0 if n is not squarefree.
+Let $P(a, b)$ be the number of integers $n$ in the interval $[a, b]$ such that $μ(n) = 1$.
 
-Let P(a,b) be the number of integers n in the interval \[a,b] such that μ(n) = 1. Let N(a,b) be the number of integers n in the interval \[a,b] such that μ(n) = -1. For example, P(2,10) = 2 and N(2,10) = 4.
+Let $N(a, b)$ be the number of integers $n$ in the interval $[a, b]$ such that $μ(n) = -1$.
 
-Let C(n) be the number of integer pairs (a,b) such that: 1 ≤ a ≤ b ≤ n, 99·N(a,b) ≤ 100·P(a,b), and 99·P(a,b) ≤ 100·N(a,b).
+For example, $P(2, 10) = 2$ and $N(2, 10) = 4$.
 
-For example, C(10) = 13, C(500) = 16676 and C(10 000) = 20155319.
+Let $C(n)$ be the number of integer pairs $(a, b)$ such that:
 
-Find C(20 000 000).
+- $1 ≤ a ≤ b ≤ n$,
+- $99 \times N(a, b) ≤ 100 \times P(a, b)$, and
+- $99 \times P(a, b) ≤ 100 \times N(a, b)$.
+
+For example, $C(10) = 13$, $C(500) = 16\\,676$ and $C(10\\,000) = 20\\,155\\,319$.
+
+Find $C(20\\,000\\,000)$.
 
 # --hints--
 
-`euler464()` should return 198775297232878.
+`mobiusFunctionAndIntervals()` should return `198775297232878`.
 
 ```js
-assert.strictEqual(euler464(), 198775297232878);
+assert.strictEqual(mobiusFunctionAndIntervals(), 198775297232878);
 ```
 
 # --seed--
@@ -35,12 +42,12 @@ assert.strictEqual(euler464(), 198775297232878);
 ## --seed-contents--
 
 ```js
-function euler464() {
+function mobiusFunctionAndIntervals() {
 
   return true;
 }
 
-euler464();
+mobiusFunctionAndIntervals();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md
index 2baaf0d7751..57ad5b291d6 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f53d1000cf542c510050
 title: 'Problem 465: Polar polygons'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302140
 dashedName: problem-465-polar-polygons
 ---
@@ -14,22 +14,24 @@ For this problem, a polygon can have collinear consecutive vertices. However, a
 
 For example, only the first of the following is a polar polygon (the kernels of the second, third, and fourth do not strictly contain the origin, and the fifth does not have a kernel at all):
 
+<img class="img-responsive center-block" alt="five example polygons" src="https://cdn.freecodecamp.org/curriculum/project-euler/polar-polygons.png" style="background-color: white; padding: 10px;" />
+
 Notice that the first polygon has three consecutive collinear vertices.
 
-Let P(n) be the number of polar polygons such that the vertices (x, y) have integer coordinates whose absolute values are not greater than n.
+Let $P(n)$ be the number of polar polygons such that the vertices $(x, y)$ have integer coordinates whose absolute values are not greater than $n$.
 
-Note that polygons should be counted as different if they have different set of edges, even if they enclose the same area. For example, the polygon with vertices \[(0,0),(0,3),(1,1),(3,0)] is distinct from the polygon with vertices \[(0,0),(0,3),(1,1),(3,0),(1,0)].
+Note that polygons should be counted as different if they have different set of edges, even if they enclose the same area. For example, the polygon with vertices [(0,0), (0,3), (1,1), (3,0)] is distinct from the polygon with vertices [(0,0), (0,3), (1,1), (3,0), (1,0)].
 
-For example, P(1) = 131, P(2) = 1648531, P(3) = 1099461296175 and P(343) mod 1 000 000 007 = 937293740.
+For example, $P(1) = 131$, $P(2) = 1\\,648\\,531$, $P(3) = 1\\,099\\,461\\,296\\,175$ and $P(343)\bmod 1\\,000\\,000\\,007 = 937\\,293\\,740$.
 
-Find P(713) mod 1 000 000 007.
+Find $P(7^{13})\bmod 1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler465()` should return 585965659.
+`polarPolygons()` should return `585965659`.
 
 ```js
-assert.strictEqual(euler465(), 585965659);
+assert.strictEqual(polarPolygons(), 585965659);
 ```
 
 # --seed--
@@ -37,12 +39,12 @@ assert.strictEqual(euler465(), 585965659);
 ## --seed-contents--
 
 ```js
-function euler465() {
+function polarPolygons() {
 
   return true;
 }
 
-euler465();
+polarPolygons();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md
index 3050ea410b1..cfefe6e7b9f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md
@@ -1,31 +1,37 @@
 ---
 id: 5900f53e1000cf542c510051
 title: 'Problem 466: Distinct terms in a multiplication table'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302141
 dashedName: problem-466-distinct-terms-in-a-multiplication-table
 ---
 
 # --description--
 
-Let P(m,n) be the number of distinct terms in an m×n multiplication table.
+Let $P(m,n)$ be the number of distinct terms in an $m×n$ multiplication table.
 
 For example, a 3×4 multiplication table looks like this:
 
-× 12341 12342 24683 36912
+$$\begin{array}{c}   ×          & \mathbf{1} & \mathbf{2} & \mathbf{3} & \mathbf{4}  \\\\
+  \mathbf{1} & 1          & 2          & 3          & 4  \\\\   \mathbf{2} & 2          & 4          & 6          & 8  \\\\
+  \mathbf{3} & 3          & 6          & 9          & 12 \end{array}$$
 
-There are 8 distinct terms {1,2,3,4,6,8,9,12}, therefore P(3,4) = 8.
+There are 8 distinct terms {1, 2, 3, 4, 6, 8, 9, 12}, therefore $P(3, 4) = 8$.
 
-You are given that: P(64,64) = 1263, P(12,345) = 1998, and P(32,1015) = 13826382602124302.
+You are given that:
 
-Find P(64,1016).
+$$\begin{align}   & P(64, 64) = 1\\,263, \\\\
+  & P(12, 345) = 1\\,998, \text{ and} \\\\   & P(32, {10}^{15}) = 13\\,826\\,382\\,602\\,124\\,302. \\\\
+\end{align}$$
+
+Find $P(64, {10}^{16})$.
 
 # --hints--
 
-`euler466()` should return 258381958195474750.
+`multiplicationTable()` should return `258381958195474750`.
 
 ```js
-assert.strictEqual(euler466(), 258381958195474750);
+assert.strictEqual(multiplicationTable(), 258381958195474750);
 ```
 
 # --seed--
@@ -33,12 +39,12 @@ assert.strictEqual(euler466(), 258381958195474750);
 ## --seed-contents--
 
 ```js
-function euler466() {
+function multiplicationTable() {
 
   return true;
 }
 
-euler466();
+multiplicationTable();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-467-superinteger.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-467-superinteger.md
index 8cfd9dc16ab..9b0caad1704 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-467-superinteger.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-467-superinteger.md
@@ -1,33 +1,42 @@
 ---
 id: 5900f5411000cf542c510052
 title: 'Problem 467: Superinteger'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302142
 dashedName: problem-467-superinteger
 ---
 
 # --description--
 
-An integer s is called a superinteger of another integer n if the digits of n form a subsequence of the digits of s.
+An integer $s$ is called a superinteger of another integer $n$ if the digits of $n$ form a subsequence of the digits of $s$.
 
 For example, 2718281828 is a superinteger of 18828, while 314159 is not a superinteger of 151.
 
-Let p(n) be the nth prime number, and let c(n) be the nth composite number. For example, p(1) = 2, p(10) = 29, c(1) = 4 and c(10) = 18. {p(i) : i ≥ 1} = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, ...} {c(i) : i ≥ 1} = {4, 6, 8, 9, 10, 12, 14, 15, 16, 18, ...}
+Let $p(n)$ be the $n$th prime number, and let $c(n)$ be the $n$th composite number. For example, $p(1) = 2$, $p(10) = 29$, $c(1) = 4$ and $c(10) = 18$.
 
-Let PD the sequence of the digital roots of {p(i)} (CD is defined similarly for {c(i)}): PD = {2, 3, 5, 7, 2, 4, 8, 1, 5, 2, ...} CD = {4, 6, 8, 9, 1, 3, 5, 6, 7, 9, ...}
+$$\begin{align}   & \\{p(i) : i ≥ 1\\} = \\{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, \ldots \\} \\\\
+  & \\{c(i) : i ≥ 1\\} = \\{4, 6, 8, 9, 10, 12, 14, 15, 16, 18, \ldots \\} \end{align}$$
 
-Let Pn be the integer formed by concatenating the first n elements of PD (Cn is defined similarly for CD). P10 = 2357248152 C10 = 4689135679
+Let $P^D$ the sequence of the digital roots of $\\{p(i)\\}$ ($C^D$ is defined similarly for $\\{c(i)\\}$):
 
-Let f(n) be the smallest positive integer that is a common superinteger of Pn and Cn. For example, f(10) = 2357246891352679, and f(100) mod 1 000 000 007 = 771661825.
+$$\begin{align}   & P^D = \\{2, 3, 5, 7, 2, 4, 8, 1, 5, 2, \ldots \\} \\\\
+  & C^D = \\{4, 6, 8, 9, 1, 3, 5, 6, 7, 9, \ldots \\} \end{align}$$
 
-Find f(10 000) mod 1 000 000 007.
+Let $P_n$ be the integer formed by concatenating the first $n$ elements of $P^D$ ($C_n$ is defined similarly for $C^D$).
+
+$$\begin{align}   & P_{10} = 2\\,357\\,248\\,152 \\\\
+  & C_{10} = 4\\,689\\,135\\,679 \end{align}$$
+
+Let $f(n)$ be the smallest positive integer that is a common superinteger of $P_n$ and $C_n$. For example, $f(10) = 2\\,357\\,246\\,891\\,352\\,679$, and $f(100)\bmod 1\\,000\\,000\\,007 = 771\\,661\\,825$.
+
+Find $f(10\\,000)\bmod 1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler467()` should return 775181359.
+`superinteger()` should return `775181359`.
 
 ```js
-assert.strictEqual(euler467(), 775181359);
+assert.strictEqual(superinteger(), 775181359);
 ```
 
 # --seed--
@@ -35,12 +44,12 @@ assert.strictEqual(euler467(), 775181359);
 ## --seed-contents--
 
 ```js
-function euler467() {
+function superinteger() {
 
   return true;
 }
 
-euler467();
+superinteger();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md
index 239d2cf56d4..d0fe5bd08f6 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md
@@ -1,27 +1,37 @@
 ---
 id: 5900f5411000cf542c510054
-title: 'Problem 468: Smooth divisors of binomial coefficients'
-challengeType: 5
+title: '问题 468：二项式系数的平滑除数'
+challengeType: 1
 forumTopicId: 302143
 dashedName: problem-468-smooth-divisors-of-binomial-coefficients
 ---
 
 # --description--
 
-An integer is called B-smooth if none of its prime factors is greater than B.
+An integer is called B-smooth if none of its prime factors is greater than $B$.
 
-Let SB(n) be the largest B-smooth divisor of n. Examples: S1(10) = 1 S4(2100) = 12 S17(2496144) = 5712
+Let $SB(n)$ be the largest B-smooth divisor of $n$.
 
-Define F(n) = ∑1≤B≤n ∑0≤r≤n SB(C(n,r)). Here, C(n,r) denotes the binomial coefficient. Examples: F(11) = 3132 F(1 111) mod 1 000 000 993 = 706036312 F(111 111) mod 1 000 000 993 = 22156169
+示例：
 
-Find F(11 111 111) mod 1 000 000 993.
+$$\begin{align}   & S_1(10) = 1 \\\\
+  & S_4(2\\,100) = 12 \\\\ & S_{17}(2\\,496\\,144) = 5\\,712 \end{align}$$
+
+Define $F(n) = \displaystyle\sum_{B = 1}^n \sum_{r = 0}^n S_B(\displaystyle\binom{n}{r})$. Here, $\displaystyle\binom{n}{r}$ denotes the binomial coefficient.
+
+示例：
+
+$$\begin{align}   & F(11) = 3132 \\\\
+  & F(1\\,111)\bmod 1\\,000\\,000\\,993 = 706\\,036\\,312 \\\\ & F(111\\,111)\bmod 1\\,000\\,000\\,993 = 22\\,156\\,169 \end{align}$$
+
+Find $F(11\\,111\\,111)\bmod 1\\,000\\,000\\,993$.
 
 # --hints--
 
-`euler468()` should return 852950321.
+`smoothDivisorsOfBinomialCoefficients()` should return `852950321`.
 
 ```js
-assert.strictEqual(euler468(), 852950321);
+assert.strictEqual(smoothDivisorsOfBinomialCoefficients(), 852950321);
 ```
 
 # --seed--
@@ -29,12 +39,12 @@ assert.strictEqual(euler468(), 852950321);
 ## --seed-contents--
 
 ```js
-function euler468() {
+function smoothDivisorsOfBinomialCoefficients() {
 
   return true;
 }
 
-euler468();
+smoothDivisorsOfBinomialCoefficients();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-469-empty-chairs.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-469-empty-chairs.md
index 4e8be025a2f..3dce49fdd9a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-469-empty-chairs.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-469-empty-chairs.md
@@ -1,29 +1,31 @@
 ---
 id: 5900f5411000cf542c510053
 title: 'Problem 469: Empty chairs'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302144
 dashedName: problem-469-empty-chairs
 ---
 
 # --description--
 
-In a room N chairs are placed around a round table.
+In a room $N$ chairs are placed around a round table.
 
 Knights enter the room one by one and choose at random an available empty chair.
 
 To have enough elbow room the knights always leave at least one empty chair between each other.
 
-When there aren't any suitable chairs left, the fraction C of empty chairs is determined. We also define E(N) as the expected value of C. We can verify that E(4) = 1/2 and E(6) = 5/9.
+When there aren't any suitable chairs left, the fraction $C$ of empty chairs is determined. We also define $E(N)$ as the expected value of $C$.
 
-Find E(1018). Give your answer rounded to fourteen decimal places in the form 0.abcdefghijklmn.
+We can verify that $E(4) = \frac{1}{2}$ and $E(6) = \frac{5}{9}$.
+
+Find $E({10}^{18})$. Give your answer rounded to fourteen decimal places in the form 0.abcdefghijklmn.
 
 # --hints--
 
-`euler469()` should return 0.56766764161831.
+`emptyChairs()` should return `0.56766764161831`.
 
 ```js
-assert.strictEqual(euler469(), 0.56766764161831);
+assert.strictEqual(emptyChairs(), 0.56766764161831);
 ```
 
 # --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler469(), 0.56766764161831);
 ## --seed-contents--
 
 ```js
-function euler469() {
+function emptyChairs() {
 
   return true;
 }
 
-euler469();
+emptyChairs();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md
index 998b035f79d..978b7affd9b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f39c1000cf542c50feae
 title: 'Problem 47: Distinct primes factors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302145
 dashedName: problem-47-distinct-primes-factors
 ---
@@ -67,47 +67,25 @@ distinctPrimeFactors(4, 4);
 # --solutions--
 
 ```js
+// Initalize factor count with seive
+const NUMFACTORS = Array(135000).fill(0);
+(function initFactors(num) {
+  for (let i = 2; i < num; i++)
+    if (NUMFACTORS[i] === 0)
+      for (let j = i; j < num; j += i)
+        NUMFACTORS[j]++;
+})(135000);
+
 function distinctPrimeFactors(targetNumPrimes, targetConsecutive) {
-  function numberOfPrimeFactors(n) {
-    let factors = 0;
-
-    //  Considering 2 as a special case
-    let firstFactor = true;
-    while (n % 2 == 0) {
-      n = n / 2;
-      if (firstFactor) {
-        factors++;
-        firstFactor = false;
-      }
-    }
-    // Adding other factors
-    for (let i = 3; i < Math.sqrt(n); i += 2) {
-      firstFactor = true;
-      while (n % i == 0) {
-        n = n / i;
-        if (firstFactor) {
-          factors++;
-          firstFactor = false;
-        }
-      }
-    }
-
-    if (n > 1) { factors++; }
-
-    return factors;
+  let numConsecutive = 0;
+  let currNumber = 10;
+  while (numConsecutive < targetConsecutive) {
+    if (NUMFACTORS[currNumber] === targetNumPrimes)
+      numConsecutive++;
+    else
+      numConsecutive = 0;
+    currNumber++;
   }
-
-  let number = 0;
-  let consecutive = 0;
-
-  while (consecutive < targetConsecutive) {
-    number++;
-    if (numberOfPrimeFactors(number) >= targetNumPrimes) {
-      consecutive++;
-    } else {
-      consecutive = 0;
-    }
-  }
-  return number - targetConsecutive + 1;
+  return currNumber - targetConsecutive;
 }
 ```
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-470-super-ramvok.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-470-super-ramvok.md
index 10ee6d95d8b..7d0f1aad0ee 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-470-super-ramvok.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-470-super-ramvok.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5431000cf542c510055
 title: 'Problem 470: Super Ramvok'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302146
 dashedName: problem-470-super-ramvok
 ---
@@ -10,24 +10,24 @@ dashedName: problem-470-super-ramvok
 
 Consider a single game of Ramvok:
 
-Let t represent the maximum number of turns the game lasts. If t = 0, then the game ends immediately. Otherwise, on each turn i, the player rolls a die. After rolling, if i &lt; t the player can either stop the game and receive a prize equal to the value of the current roll, or discard the roll and try again next turn. If i = t, then the roll cannot be discarded and the prize must be accepted. Before the game begins, t is chosen by the player, who must then pay an up-front cost ct for some constant c. For c = 0, t can be chosen to be infinite (with an up-front cost of 0). Let R(d, c) be the expected profit (i.e. net gain) that the player receives from a single game of optimally-played Ramvok, given a fair d-sided die and cost constant c. For example, R(4, 0.2) = 2.65. Assume that the player has sufficient funds for paying any/all up-front costs.
+Let $t$ represent the maximum number of turns the game lasts. If $t = 0$, then the game ends immediately. Otherwise, on each turn $i$, the player rolls a die. After rolling, if $i &lt; t$ the player can either stop the game and receive a prize equal to the value of the current roll, or discard the roll and try again next turn. If $i = t$, then the roll cannot be discarded and the prize must be accepted. Before the game begins, $t$ is chosen by the player, who must then pay an up-front cost $ct$ for some constant $c$. For $c = 0$, $t$ can be chosen to be infinite (with an up-front cost of 0). Let $R(d, c)$ be the expected profit (i.e. net gain) that the player receives from a single game of optimally-played Ramvok, given a fair $d$-sided die and cost constant $c$. For example, $R(4, 0.2) = 2.65$. Assume that the player has sufficient funds for paying any/all up-front costs.
 
 Now consider a game of Super Ramvok:
 
 In Super Ramvok, the game of Ramvok is played repeatedly, but with a slight modification. After each game, the die is altered. The alteration process is as follows: The die is rolled once, and if the resulting face has its pips visible, then that face is altered to be blank instead. If the face is already blank, then it is changed back to its original value. After the alteration is made, another game of Ramvok can begin (and during such a game, at each turn, the die is rolled until a face with a value on it appears). The player knows which faces are blank and which are not at all times. The game of Super Ramvok ends once all faces of the die are blank.
 
-Let S(d, c) be the expected profit that the player receives from an optimally-played game of Super Ramvok, given a fair d-sided die to start (with all sides visible), and cost constant c. For example, S(6, 1) = 208.3.
+Let $S(d, c)$ be the expected profit that the player receives from an optimally-played game of Super Ramvok, given a fair $d$-sided die to start (with all sides visible), and cost constant $c$. For example, $S(6, 1) = 208.3$.
 
-Let F(n) = ∑4≤d≤n ∑0≤c≤n S(d, c).
+Let $F(n) = \sum_{4 ≤ d ≤ n} \sum_{0 ≤ c ≤ n} S(d, c)$.
 
-Calculate F(20), rounded to the nearest integer.
+Calculate $F(20)$, rounded to the nearest integer.
 
 # --hints--
 
-`euler470()` should return 147668794.
+`superRamvok()` should return `147668794`.
 
 ```js
-assert.strictEqual(euler470(), 147668794);
+assert.strictEqual(superRamvok(), 147668794);
 ```
 
 # --seed--
@@ -35,12 +35,12 @@ assert.strictEqual(euler470(), 147668794);
 ## --seed-contents--
 
 ```js
-function euler470() {
+function superRamvok() {
 
   return true;
 }
 
-euler470();
+superRamvok();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md
index 95385ddec9c..87fba0ff50a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md
@@ -1,27 +1,43 @@
 ---
 id: 5900f5431000cf542c510056
 title: 'Problem 471: Triangle inscribed in ellipse'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302148
 dashedName: problem-471-triangle-inscribed-in-ellipse
 ---
 
 # --description--
 
-The triangle ΔABC is inscribed in an ellipse with equation $\\frac {x^2} {a^2} + \\frac {y^2} {b^2} = 1$, 0 &lt; 2b &lt; a, a and b integers.
+The triangle $ΔABC$ is inscribed in an ellipse with equation $\frac{x^2}{a^2} + \frac{y^2}{b^2} = 1$, $0 &lt; 2b &lt; a$, $a$ and $b$ integers.
 
-Let r(a,b) be the radius of the incircle of ΔABC when the incircle has center (2b, 0) and A has coordinates $\\left( \\frac a 2, \\frac {\\sqrt 3} 2 b\\right)$.
+Let $r(a, b)$ be the radius of the incircle of $ΔABC$ when the incircle has center $(2b, 0)$ and $A$ has coordinates $\left(\frac{a}{2}, \frac{\sqrt{3}}{2}b\right)$.
 
-For example, r(3,1) = ½, r(6,2) = 1, r(12,3) = 2.
+For example, $r(3, 1) = \frac{1}{2}, r(6, 2) = 1, r(12, 3) = 2$.
 
-Let $G(n) = \\sum*{a=3}^n \\sum*{b=1}^{\\lfloor \\frac {a - 1} 2 \\rfloor} r(a, b)$ You are given G(10) = 20.59722222, G(100) = 19223.60980 (rounded to 10 significant digits). Find G(1011). Give your answer in scientific notation rounded to 10 significant digits. Use a lowercase e to separate mantissa and exponent. For G(10) the answer would have been 2.059722222e1.
+<img class="img-responsive center-block" alt="triangle ΔABC inscribed in an ellipse, radius of the incircle of ΔABC r(6, 2) = 1" src="https://cdn.freecodecamp.org/curriculum/project-euler/triangle-inscribed-in-ellipse-1.png" style="background-color: white; padding: 10px;" />
+
+<img class="img-responsive center-block" alt="triangle ΔABC inscribed in an ellipse, radius of the incircle of ΔABC r(12, 3) = 2" src="https://cdn.freecodecamp.org/curriculum/project-euler/triangle-inscribed-in-ellipse-2.png" style="background-color: white; padding: 10px;" />
+
+Let $G(n) = \sum_{a = 3}^n \sum_{b = 1}^{\left\lfloor\frac{a - 1}{2} \right\rfloor} r(a, b)$
+
+You are given $G(10) = 20.59722222$, $G(100) = 19223.60980$ (rounded to 10 significant digits).
+
+Find $G({10}^{11})$. Give your answer as a string in scientific notation rounded to 10 significant digits. Use a lowercase `e` to separate mantissa and exponent.
+
+For $G(10)$ the answer would have been `2.059722222e1`
 
 # --hints--
 
-`euler471()` should return 1.895093981e+31.
+`triangleInscribedInEllipse()` should return a string.
 
 ```js
-assert.strictEqual(euler471(), 1.895093981e31);
+assert(typeof triangleInscribedInEllipse() === 'string');
+```
+
+`triangleInscribedInEllipse()` should return the string `1.895093981e31`.
+
+```js
+assert.strictEqual(triangleInscribedInEllipse(), '1.895093981e31');
 ```
 
 # --seed--
@@ -29,12 +45,12 @@ assert.strictEqual(euler471(), 1.895093981e31);
 ## --seed-contents--
 
 ```js
-function euler471() {
+function triangleInscribedInEllipse() {
 
   return true;
 }
 
-euler471();
+triangleInscribedInEllipse();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md
index f4e90155496..25c9c601cf6 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md
@@ -1,39 +1,39 @@
 ---
 id: 5900f5451000cf542c510057
 title: 'Problem 472: Comfortable Distance II'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302149
 dashedName: problem-472-comfortable-distance-ii
 ---
 
 # --description--
 
-There are N seats in a row. N people come one after another to fill the seats according to the following rules:
+There are $N$ seats in a row. $N$ people come one after another to fill the seats according to the following rules:
 
-No person sits beside another.
+1. No person sits beside another.
+1. The first person chooses any seat.
+1. Each subsequent person chooses the seat furthest from anyone else already seated, as long as it does not violate rule 1. If there is more than one choice satisfying this condition, then the person chooses the leftmost choice.
 
-The first person chooses any seat.
+Note that due to rule 1, some seats will surely be left unoccupied, and the maximum number of people that can be seated is less than $N$ (for $N > 1$).
 
-Each subsequent person chooses the seat furthest from anyone else already seated, as long as it does not violate rule 1. If there is more than one choice satisfying this condition, then the person chooses the leftmost choice.
+Here are the possible seating arrangements for $N = 15$:
 
-Note that due to rule 1, some seats will surely be left unoccupied, and the maximum number of people that can be seated is less than N (for N > 1).
-
-Here are the possible seating arrangements for N = 15:
+<img class="img-responsive center-block" alt="seating arrangements for N = 15" src="https://cdn.freecodecamp.org/curriculum/project-euler/comfortable-distance-ii.png" style="background-color: white; padding: 10px;" />
 
 We see that if the first person chooses correctly, the 15 seats can seat up to 7 people. We can also see that the first person has 9 choices to maximize the number of people that may be seated.
 
-Let f(N) be the number of choices the first person has to maximize the number of occupants for N seats in a row. Thus, f(1) = 1, f(15) = 9, f(20) = 6, and f(500) = 16.
+Let $f(N)$ be the number of choices the first person has to maximize the number of occupants for $N$ seats in a row. Thus, $f(1) = 1$, $f(15) = 9$, $f(20) = 6$, and $f(500) = 16$.
 
-Also, ∑f(N) = 83 for 1 ≤ N ≤ 20 and ∑f(N) = 13343 for 1 ≤ N ≤ 500.
+Also, $\sum f(N) = 83$ for $1 ≤ N ≤ 20$ and $\sum f(N) = 13\\,343$ for $1 ≤ N ≤ 500$.
 
-Find ∑f(N) for 1 ≤ N ≤ 1012. Give the last 8 digits of your answer.
+Find $\sum f(N)$ for $1 ≤ N ≤ {10}^{12}$. Give the last 8 digits of your answer.
 
 # --hints--
 
-`euler472()` should return 73811586.
+`comfortableDistanceTwo()` should return `73811586`.
 
 ```js
-assert.strictEqual(euler472(), 73811586);
+assert.strictEqual(comfortableDistanceTwo(), 73811586);
 ```
 
 # --seed--
@@ -41,12 +41,12 @@ assert.strictEqual(euler472(), 73811586);
 ## --seed-contents--
 
 ```js
-function euler472() {
+function comfortableDistanceTwo() {
 
   return true;
 }
 
-euler472();
+comfortableDistanceTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md
index 505c8a757ba..97a545fed4c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md
@@ -1,16 +1,16 @@
 ---
 id: 5900f5461000cf542c510058
 title: 'Problem 473: Phigital number base'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302150
 dashedName: problem-473-phigital-number-base
 ---
 
 # --description--
 
-Let $\\varphi$ be the golden ratio: $\\varphi=\\frac{1+\\sqrt{5}}{2}.$
+Let $\varphi$ be the golden ratio: $\varphi = \frac{1+\sqrt{5}}{2}.$
 
-Remarkably it is possible to write every positive integer as a sum of powers of $\\varphi$ even if we require that every power of $\\varphi$ is used at most once in this sum.
+Remarkably it is possible to write every positive integer as a sum of powers of $\varphi$ even if we require that every power of $\varphi$ is used at most once in this sum.
 
 Even then this representation is not unique.
 
@@ -18,9 +18,11 @@ We can make it unique by requiring that no powers with consecutive exponents are
 
 E.g:
 
-$2=\\varphi+\\varphi^{-2}$ and $3=\\varphi^{2}+\\varphi^{-2}$
+$2 = \varphi + \varphi^{-2}$ and $3 = \varphi^{2} + \varphi^{-2}$
 
-To represent this sum of powers of $\\varphi$ we use a string of 0's and 1's with a point to indicate where the negative exponents start. We call this the representation in the phigital numberbase. So $1=1*{\\varphi}$, $2=10.01*{\\varphi}$, $3=100.01*{\\varphi}$ and $14=100100.001001*{\\varphi}$. The strings representing 1, 2 and 14 in the phigital number base are palindromic, while the string representing 3 is not. (the phigital point is not the middle character).
+To represent this sum of powers of $\varphi$ we use a string of 0's and 1's with a point to indicate where the negative exponents start. We call this the representation in the phigital numberbase.
+
+So $1 = 1_{\varphi}$, $2 = 10.01_{\varphi}$, $3 = 100.01_{\varphi}$ and $14 = 100100.001001_{\varphi}$. The strings representing 1, 2 and 14 in the phigital number base are palindromic, while the string representing 3 is not (the phigital point is not the middle character).
 
 The sum of the positive integers not exceeding 1000 whose phigital representation is palindromic is 4345.
 
@@ -28,10 +30,10 @@ Find the sum of the positive integers not exceeding $10^{10}$ whose phigital rep
 
 # --hints--
 
-`euler473()` should return 35856681704365.
+`phigitalNumberBase()` should return `35856681704365`.
 
 ```js
-assert.strictEqual(euler473(), 35856681704365);
+assert.strictEqual(phigitalNumberBase(), 35856681704365);
 ```
 
 # --seed--
@@ -39,12 +41,12 @@ assert.strictEqual(euler473(), 35856681704365);
 ## --seed-contents--
 
 ```js
-function euler473() {
+function phigitalNumberBase() {
 
   return true;
 }
 
-euler473();
+phigitalNumberBase();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.md
index 5c77726bd25..e63a971d336 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f5471000cf542c510059
 title: 'Problem 474: Last digits of divisors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302151
 dashedName: problem-474-last-digits-of-divisors
 ---
 
 # --description--
 
-For a positive integer n and digits d, we define F(n, d) as the number of the divisors of n whose last digits equal d.
+For a positive integer $n$ and digits $d$, we define $F(n, d)$ as the number of the divisors of $n$ whose last digits equal $d$.
 
-For example, F(84, 4) = 3. Among the divisors of 84 (1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84), three of them (4, 14, 84) have the last digit 4.
+For example, $F(84, 4) = 3$. Among the divisors of 84 (1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84), three of them (4, 14, 84) have the last digit 4.
 
-We can also verify that F(12!, 12) = 11 and F(50!, 123) = 17888.
+We can also verify that $F(12!, 12) = 11$ and $F(50!, 123) = 17\\,888$.
 
-Find F(106!, 65432) modulo (1016 + 61).
+Find $F({10}^6!, 65\\,432) \text{ modulo } ({10}^{16} + 61)$.
 
 # --hints--
 
-`euler474()` should return 9690646731515010.
+`lastDigitsOfDivisors()` should return `9690646731515010`.
 
 ```js
-assert.strictEqual(euler474(), 9690646731515010);
+assert.strictEqual(lastDigitsOfDivisors(), 9690646731515010);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler474(), 9690646731515010);
 ## --seed-contents--
 
 ```js
-function euler474() {
+function lastDigitsOfDivisors() {
 
   return true;
 }
 
-euler474();
+lastDigitsOfDivisors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-475-music-festival.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-475-music-festival.md
index dd8cf3538b7..9f019e969d0 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-475-music-festival.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-475-music-festival.md
@@ -1,29 +1,31 @@
 ---
 id: 5900f5481000cf542c51005a
 title: 'Problem 475: Music festival'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302152
 dashedName: problem-475-music-festival
 ---
 
 # --description--
 
-12n musicians participate at a music festival. On the first day, they form 3n quartets and practice all day.
+$12n$ musicians participate at a music festival. On the first day, they form $3n$ quartets and practice all day.
 
 It is a disaster. At the end of the day, all musicians decide they will never again agree to play with any member of their quartet.
 
-On the second day, they form 4n trios, each musician avoiding his previous quartet partners.
+On the second day, they form $4n$ trios, each musician avoiding his previous quartet partners.
 
-Let f(12n) be the number of ways to organize the trios amongst the 12n musicians. You are given f(12) = 576 and f(24) mod 1 000 000 007 = 509089824.
+Let $f(12n)$ be the number of ways to organize the trios amongst the $12n$ musicians.
 
-Find f(600) mod 1 000 000 007.
+You are given $f(12) = 576$ and $f(24)\bmod 1\\,000\\,000\\,007 = 509\\,089\\,824$.
+
+Find $f(600)\bmod 1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler475()` should return 75780067.
+`musicFestival()` should return `75780067`.
 
 ```js
-assert.strictEqual(euler475(), 75780067);
+assert.strictEqual(musicFestival(), 75780067);
 ```
 
 # --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler475(), 75780067);
 ## --seed-contents--
 
 ```js
-function euler475() {
+function musicFestival() {
 
   return true;
 }
 
-euler475();
+musicFestival();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-476-circle-packing-ii.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-476-circle-packing-ii.md
index a5a8bf868b0..c6f88e38013 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-476-circle-packing-ii.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-476-circle-packing-ii.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f5481000cf542c51005b
 title: 'Problem 476: Circle Packing II'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302153
 dashedName: problem-476-circle-packing-ii
 ---
 
 # --description--
 
-Let R(a, b, c) be the maximum area covered by three non-overlapping circles inside a triangle with edge lengths a, b and c.
+Let $R(a, b, c)$ be the maximum area covered by three non-overlapping circles inside a triangle with edge lengths $a$, $b$ and $c$.
 
-Let S(n) be the average value of R(a, b, c) over all integer triplets (a, b, c) such that 1 ≤ a ≤ b ≤ c &lt; a + b ≤ n
+Let $S(n)$ be the average value of $R(a, b, c)$ over all integer triplets $(a, b, c)$ such that $1 ≤ a ≤ b ≤ c &lt; a + b ≤ n$.
 
-You are given S(2) = R(1, 1, 1) ≈ 0.31998, S(5) ≈ 1.25899.
+You are given $S(2) = R(1, 1, 1) ≈ 0.31998$, $S(5) ≈ 1.25899$.
 
-Find S(1803) rounded to 5 decimal places behind the decimal point.
+Find $S(1803)$ rounded to 5 decimal places behind the decimal point.
 
 # --hints--
 
-`euler476()` should return 110242.87794.
+`circlePackingTwo()` should return `110242.87794`.
 
 ```js
-assert.strictEqual(euler476(), 110242.87794);
+assert.strictEqual(circlePackingTwo(), 110242.87794);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler476(), 110242.87794);
 ## --seed-contents--
 
 ```js
-function euler476() {
+function circlePackingTwo() {
 
   return true;
 }
 
-euler476();
+circlePackingTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-477-number-sequence-game.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-477-number-sequence-game.md
index f4c95faba72..04a3dcf8246 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-477-number-sequence-game.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-477-number-sequence-game.md
@@ -1,49 +1,45 @@
 ---
 id: 5900f54a1000cf542c51005c
-title: 'Problem 477: Number Sequence Game'
-challengeType: 5
+title: '问题 477：数字序列游戏'
+challengeType: 1
 forumTopicId: 302154
 dashedName: problem-477-number-sequence-game
 ---
 
 # --description--
 
-The number sequence game starts with a sequence S of N numbers written on a line.
+The number sequence game starts with a sequence $S$ of $N$ numbers written on a line.
 
-Two players alternate turns. At his turn, a player must select and remove either the first or the last number remaining in the sequence.
+两名玩家交替轮流。 在轮到他时，玩家必须选择并删除序列中剩余的第一个或最后一个数字。
 
-The player score is the sum of all the numbers he has taken. Each player attempts to maximize his own sum.
+玩家得分是他所取所有数字的总和。 每个玩家都试图最大化自己的总和。
 
-If N = 4 and S = {1, 2, 10, 3}, then each player maximizes his score as follows:
+If $N = 4$ and $S = \\{1, 2, 10, 3\\}$, then each player maximizes his score as follows:
 
-Player 1: removes the first number (1)
+- Player 1: removes the first number (1)
+- Player 2: removes the last number from the remaining sequence (3)
+- Player 1: removes the last number from the remaining sequence (10)
+- Player 2: removes the remaining number (2)
 
-Player 2: removes the last number from the remaining sequence (3)
+Player 1 score is $1 + 10 = 11$.
 
-Player 1: removes the last number from the remaining sequence (10)
+Let $F(N)$ be the score of player 1 if both players follow the optimal strategy for the sequence $S = \\{s_1, s_2, \ldots, s_N\\}$ defined as:
 
-Player 2: removes the remaining number (2)
+- $s_1 = 0$
+- $s_{i + 1} = ({s_i}^2 + 45)$ modulo $1\\,000\\,000\\,007$
 
-Player 1 score is 1 + 10 = 11.
+The sequence begins with $S = \\{0, 45, 2\\,070, 4\\,284\\,945, 753\\,524\\,550, 478\\,107\\,844, 894\\,218\\,625, \ldots\\}$.
 
-Let F(N) be the score of player 1 if both players follow the optimal strategy for the sequence S = {s1, s2, ..., sN} defined as:
+You are given $F(2) = 45$, $F(4) = 4\\,284\\,990$, $F(100) = 26\\,365\\,463\\,243$, $F(104) = 2\\,495\\,838\\,522\\,951$.
 
-s1 = 0
-
-si+1 = (si2 + 45) modulo 1 000 000 007
-
-The sequence begins with S = {0, 45, 2070, 4284945, 753524550, 478107844, 894218625, ...}.
-
-You are given F(2) = 45, F(4) = 4284990, F(100) = 26365463243, F(104) = 2495838522951.
-
-Find F(108).
+Find $F({10}^8)$.
 
 # --hints--
 
-`euler477()` should return 25044905874565164.
+`numberSequenceGame()` should return `25044905874565164`.
 
 ```js
-assert.strictEqual(euler477(), 25044905874565164);
+assert.strictEqual(numberSequenceGame(), 25044905874565164);
 ```
 
 # --seed--
@@ -51,12 +47,12 @@ assert.strictEqual(euler477(), 25044905874565164);
 ## --seed-contents--
 
 ```js
-function euler477() {
+function numberSequenceGame() {
 
   return true;
 }
 
-euler477();
+numberSequenceGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-478-mixtures.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-478-mixtures.md
index 37e7681ecff..df41c85545a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-478-mixtures.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-478-mixtures.md
@@ -1,33 +1,39 @@
 ---
 id: 5900f54c1000cf542c51005e
-title: 'Problem 478: Mixtures'
-challengeType: 5
+title: '问题 478：混合物'
+challengeType: 1
 forumTopicId: 302155
 dashedName: problem-478-mixtures
 ---
 
 # --description--
 
-Let us consider mixtures of three substances: A, B and C. A mixture can be described by a ratio of the amounts of A, B, and C in it, i.e., (a : b : c). For example, a mixture described by the ratio (2 : 3 : 5) contains 20% A, 30% B and 50% C.
+Let us consider mixtures of three substances: $A$, $B$ and $C$. A mixture can be described by a ratio of the amounts of $A$, $B$, and $C$ in it, i.e., $(a : b : c)$. For example, a mixture described by the ratio (2 : 3 : 5) contains 20% $A$, 30% $B$ and 50% $C$.
 
 For the purposes of this problem, we cannot separate the individual components from a mixture. However, we can combine different amounts of different mixtures to form mixtures with new ratios.
 
-For example, say we have three mixtures with ratios (3 : 0 : 2), (3 : 6 : 11) and (3 : 3 : 4). By mixing 10 units of the first, 20 units of the second and 30 units of the third, we get a new mixture with ratio (6 : 5 : 9), since: (10·3/5 + 20·3/20 + 30·3/10 : 10·0/5 + 20·6/20 + 30·3/10 : 10·2/5 + 20·11/20 + 30·4/10) = (18 : 15 : 27) = (6 : 5 : 9)
+For example, say we have three mixtures with ratios (3 : 0 : 2), (3 : 6 : 11) and (3 : 3 : 4). By mixing 10 units of the first, 20 units of the second and 30 units of the third, we get a new mixture with ratio (6 : 5 : 9), since: ($10 \times \frac{3}{5} + 20 \times \frac{3}{20} + 30 \times \frac{3}{10}$ : $10 \times \frac{0}{5} + 20 \times \frac{6}{20} + 30 \times \frac{3}{10}$ : $10 \times \frac{2}{5} + 20 \times \frac{11}{20} + 30 \times \frac{4}{10}$) = (18 : 15 : 27) = (6 : 5 : 9)
 
-However, with the same three mixtures, it is impossible to form the ratio (3 : 2 : 1), since the amount of B is always less than the amount of C.
+However, with the same three mixtures, it is impossible to form the ratio (3 : 2 : 1), since the amount of $B$ is always less than the amount of $C$.
 
-Let n be a positive integer. Suppose that for every triple of integers (a, b, c) with 0 ≤ a, b, c ≤ n and gcd(a, b, c) = 1, we have a mixture with ratio (a : b : c). Let M(n) be the set of all such mixtures.
+Let $n$ be a positive integer. Suppose that for every triple of integers $(a, b, c)$ with $0 ≤ a, b, c ≤ n$ and $gcd(a, b, c) = 1$, we have a mixture with ratio $(a : b : c)$. Let $M(n)$ be the set of all such mixtures.
 
-For example, M(2) contains the 19 mixtures with the following ratios: {(0 : 0 : 1), (0 : 1 : 0), (0 : 1 : 1), (0 : 1 : 2), (0 : 2 : 1), (1 : 0 : 0), (1 : 0 : 1), (1 : 0 : 2), (1 : 1 : 0), (1 : 1 : 1), (1 : 1 : 2), (1 : 2 : 0), (1 : 2 : 1), (1 : 2 : 2), (2 : 0 : 1), (2 : 1 : 0), (2 : 1 : 1), (2 : 1 : 2), (2 : 2 : 1)}.
+For example, $M(2)$ contains the 19 mixtures with the following ratios:
 
-Let E(n) be the number of subsets of M(n) which can produce the mixture with ratio (1 : 1 : 1), i.e., the mixture with equal parts A, B and C. We can verify that E(1) = 103, E(2) = 520447, E(10) mod 118 = 82608406 and E(500) mod 118 = 13801403. Find E(10 000 000) mod 118.
+{(0 : 0 : 1), (0 : 1 : 0), (0 : 1 : 1), (0 : 1 : 2), (0 : 2 : 1), (1 : 0 : 0), (1 : 0 : 1), (1 : 0 : 2), (1 : 1 : 0), (1 : 1 : 1), (1 : 1 : 2), (1 : 2 : 0), (1 : 2 : 1), (1 : 2 : 2), (2 : 0 : 1), (2 : 1 : 0), (2 : 1 : 1), (2 : 1 : 2), (2 : 2 : 1)}.
+
+Let $E(n)$ be the number of subsets of $M(n)$ which can produce the mixture with ratio (1 : 1 : 1), i.e., the mixture with equal parts $A$, $B$ and $C$.
+
+We can verify that $E(1) = 103$, $E(2) = 520\\,447$, $E(10)\bmod {11}^8 = 82\\,608\\,406$ and $E(500)\bmod {11}^8 = 13\\,801\\,403$.
+
+Find $E(10\\,000\\,000)\bmod {11}^8$.
 
 # --hints--
 
-`euler478()` should return 59510340.
+`mixtures()` should return `59510340`.
 
 ```js
-assert.strictEqual(euler478(), 59510340);
+assert.strictEqual(mixtures(), 59510340);
 ```
 
 # --seed--
@@ -35,12 +41,12 @@ assert.strictEqual(euler478(), 59510340);
 ## --seed-contents--
 
 ```js
-function euler478() {
+function mixtures() {
 
   return true;
 }
 
-euler478();
+mixtures();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.md
index 202e7e04be7..b905a648468 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f54b1000cf542c51005d
 title: 'Problem 479: Roots on the Rise'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302156
 dashedName: problem-479-roots-on-the-rise
 ---
 
 # --description--
 
-Let ak, bk, and ck represent the three solutions (real or complex numbers) to the expression 1/x = (k/x)2(k+x2) - kx.
+Let $a_k$, $b_k$, and $c_k$ represent the three solutions (real or complex numbers) to the expression $\frac{1}{x} = {\left(\frac{k}{x} \right)}^2 (k + x^2) - kx$.
 
-For instance, for k = 5, we see that {a5, b5, c5} is approximately {5.727244, -0.363622+2.057397i, -0.363622-2.057397i}.
+For instance, for $k = 5$, we see that $\\{a_5, b_5, c_5\\}$ is approximately $\\{5.727244, -0.363622 + 2.057397i, -0.363622 - 2.057397i\\}$.
 
-Let S(n) = Σ (ak+bk)p(bk+ck)p(ck+ak)p for all integers p, k such that 1 ≤ p, k ≤ n.
+Let $S(n) = \displaystyle\sum_{p = 1}^n \sum_{k = 1}^n {(a_k + b_k)}^p {(b_k + c_k)}^p {(c_k + a_k)}^p$ for all integers $p$, $k$ such that $1 ≤ p, k ≤ n$.
 
-Interestingly, S(n) is always an integer. For example, S(4) = 51160.
+Interestingly, $S(n)$ is always an integer. For example, $S(4) = 51\\,160$.
 
-Find S(106) modulo 1 000 000 007.
+Find $S({10}^6) \text{ modulo } 1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler479()` should return 191541795.
+`rootsOnTheRise()` should return `191541795`.
 
 ```js
-assert.strictEqual(euler479(), 191541795);
+assert.strictEqual(rootsOnTheRise(), 191541795);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler479(), 191541795);
 ## --seed-contents--
 
 ```js
-function euler479() {
+function rootsOnTheRise() {
 
   return true;
 }
 
-euler479();
+rootsOnTheRise();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-48-self-powers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-48-self-powers.md
index 58e654f8938..d429c978791 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-48-self-powers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-48-self-powers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f39c1000cf542c50feaf
 title: 'Problem 48: Self powers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302157
 dashedName: problem-48-self-powers
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-480-the-last-question.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-480-the-last-question.md
index 9e2ac8d96d8..248189f1488 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-480-the-last-question.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-480-the-last-question.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f54c1000cf542c51005f
 title: 'Problem 480: The Last Question'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302158
 dashedName: problem-480-the-last-question
 ---
@@ -10,88 +10,56 @@ dashedName: problem-480-the-last-question
 
 Consider all the words which can be formed by selecting letters, in any order, from the phrase:
 
-thereisasyetinsufficientdataforameaningfulanswer
+$$\mathbf{\text{thereisasyetinsufficientdataforameaningfulanswer}}$$
 
 Suppose those with 15 letters or less are listed in alphabetical order and numbered sequentially starting at 1.
 
 The list would include:
 
-1 : a
+$$\begin{align}   & 1: \text{a} \\\\
+  & 2: \text{aa} \\\\   & 3: \text{aaa} \\\\
+  & 4: \text{aaaa} \\\\   & 5: \text{aaaaa} \\\\
+  & 6: \text{aaaaaa} \\\\   & 7: \text{aaaaaac} \\\\
+  & 8: \text{aaaaaacd} \\\\   & 9: \text{aaaaaacde} \\\\
+  & 10: \text{aaaaaacdee} \\\\   & 11: \text{aaaaaacdeee} \\\\
+  & 12: \text{aaaaaacdeeee} \\\\   & 13: \text{aaaaaacdeeeee} \\\\
+  & 14: \text{aaaaaacdeeeeee} \\\\   & 15: \text{aaaaaacdeeeeeef} \\\\
+  & 16: \text{aaaaaacdeeeeeeg} \\\\   & 17: \text{aaaaaacdeeeeeeh} \\\\
+  & \ldots \\\\   & 28: \text{aaaaaacdeeeeeey} \\\\
+  & 29: \text{aaaaaacdeeeeef} \\\\   & 30: \text{aaaaaacdeeeeefe} \\\\
+  & \ldots \\\\   & 115246685191495242: \text{euleoywuttttsss} \\\\
+  & 115246685191495243: \text{euler} \\\\   & 115246685191495244: \text{eulera} \\\\
+  & ... \\\\   & 525069350231428029: \text{ywuuttttssssrrr} \\\\
+\end{align}$$
 
-2 : aa
+Define $P(w)$ as the position of the word $w$.
 
-3 : aaa
+Define $W(p)$ as the word in position $p$.
 
-4 : aaaa
+We can see that $P(w)$ and $W(p)$ are inverses: $P(W(p)) = p$ and $W(P(w)) = w$.
 
-5 : aaaaa
+示例：
 
-6 : aaaaaa
+$$\begin{align}   & W(10) = \text{ aaaaaacdee} \\\\
+  & P(\text{aaaaaacdee}) = 10 \\\\   & W(115246685191495243) = \text{ euler} \\\\
+  & P(\text{euler}) = 115246685191495243 \\\\ \end{align}$$
 
-7 : aaaaaac
+Find $$W(P(\text{legionary}) + P(\text{calorimeters}) - P(\text{annihilate}) + P(\text{orchestrated}) - P(\text{fluttering})).$$
 
-8 : aaaaaacd
-
-9 : aaaaaacde
-
-10 : aaaaaacdee
-
-11 : aaaaaacdeee
-
-12 : aaaaaacdeeee
-
-13 : aaaaaacdeeeee
-
-14 : aaaaaacdeeeeee
-
-15 : aaaaaacdeeeeeef
-
-16 : aaaaaacdeeeeeeg
-
-17 : aaaaaacdeeeeeeh
-
-...
-
-28 : aaaaaacdeeeeeey
-
-29 : aaaaaacdeeeeef
-
-30 : aaaaaacdeeeeefe
-
-...
-
-115246685191495242: euleoywuttttsss
-
-115246685191495243: euler
-
-115246685191495244: eulera
-
-...
-
-525069350231428029: ywuuttttssssrrrDefine P(w) as the position of the word w.
-
-Define W(p) as the word in position p.
-
-We can see that P(w) and W(p) are inverses: P(W(p)) = p and W(P(w)) = w.
-
-Examples:
-
-W(10) = aaaaaacdee
-
-P(aaaaaacdee) = 10
-
-W(115246685191495243) = euler
-
-P(euler) = 115246685191495243Find W(P(legionary) + P(calorimeters) - P(annihilate) + P(orchestrated) - P(fluttering)).
-
-Give your answer using lowercase characters (no punctuation or space).
+使用小写字符（没有标点符号或空格）给出答案。
 
 # --hints--
 
-`euler480()` should return turnthestarson.
+`euler480()` should return a string.
 
 ```js
-assert.strictEqual(euler480(), turnthestarson);
+assert(typeof euler480() === 'string');
+```
+
+`euler480()` should return the string `turnthestarson`.
+
+```js
+assert.strictEqual(euler480(), 'turnthestarson');
 ```
 
 # --seed--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-49-prime-permutations.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-49-prime-permutations.md
index 0dc7ae0ddcf..3c0c1d3d362 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-49-prime-permutations.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-49-prime-permutations.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f39d1000cf542c50feb0
 title: 'Problem 49: Prime permutations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302159
 dashedName: problem-49-prime-permutations
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-5-smallest-multiple.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-5-smallest-multiple.md
index bdece251d77..f42665940ba 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-5-smallest-multiple.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-5-smallest-multiple.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3711000cf542c50fe84
 title: 'Problem 5: Smallest multiple'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302160
 dashedName: problem-5-smallest-multiple
 ---
@@ -10,41 +10,41 @@ dashedName: problem-5-smallest-multiple
 
 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
 
-What is the smallest positive number that is evenly divisible by all of the numbers from 1 to `n`?
+能被从 1 到 `n` 的所有数整除的最小正数是多少？
 
 # --hints--
 
-`smallestMult(5)` should return a number.
+`smallestMult(5)` 应该返回数字
 
 ```js
 assert(typeof smallestMult(5) === 'number');
 ```
 
-`smallestMult(5)` should return 60.
+`smallestMult(5)` 应该返回 60。
 
 ```js
 assert.strictEqual(smallestMult(5), 60);
 ```
 
-`smallestMult(7)` should return 420.
+`smallestMult(7)` 应该返回 420。
 
 ```js
 assert.strictEqual(smallestMult(7), 420);
 ```
 
-`smallestMult(10)` should return 2520.
+`smallestMult(10)` 应返回 2520。
 
 ```js
 assert.strictEqual(smallestMult(10), 2520);
 ```
 
-`smallestMult(13)` should return 360360.
+`smallestMult(13)` 应返回 360360。
 
 ```js
 assert.strictEqual(smallestMult(13), 360360);
 ```
 
-`smallestMult(20)` should return 232792560.
+`smallestMult(20)` 应该返回 232792560。
 
 ```js
 assert.strictEqual(smallestMult(20), 232792560);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.md
index 92924bf85e1..861a3e99a8e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f39e1000cf542c50feb1
 title: 'Problem 50: Consecutive prime sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302161
 dashedName: problem-50-consecutive-prime-sum
 ---
@@ -54,42 +54,70 @@ consecutivePrimeSum(1000000);
 # --solutions--
 
 ```js
-function consecutivePrimeSum(limit) {
-  function isPrime(num) {
-    if (num < 2) {
-      return false;
-    } else if (num === 2) {
-      return true;
-    }
-    const sqrtOfNum = Math.floor(num ** 0.5);
-    for (let i = 2; i <= sqrtOfNum + 1; i++) {
-      if (num % i === 0) {
-        return false;
-      }
+// Initalize prime number list with sieve
+const NUM_PRIMES = 1000000;
+const PRIMES = [2];
+const PRIME_SIEVE = Array(Math.floor((NUM_PRIMES-1)/2)).fill(true);
+(function initPrimes(num) {
+  const upper = Math.floor((num - 1) / 2);
+  const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+  for (let i = 0; i <= sqrtUpper; i++) {
+    if (PRIME_SIEVE[i]) {
+      // Mark value in PRIMES array
+      const prime = 2 * i + 3;
+      PRIMES.push(prime);
+      // Mark all multiples of this number as false (not prime)
+      const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+      for (let j = primeSqaredIndex; j < upper; j += prime)
+        PRIME_SIEVE[j] = false;
     }
+  }
+  for (let i = sqrtUpper + 1; i < upper; i++) {
+    if (PRIME_SIEVE[i])
+      PRIMES.push(2 * i + 3);
+  }
+})(NUM_PRIMES);
+
+function isPrime(num) {
+  if (num === 2)
     return true;
-  }
-  function getPrimes(limit) {
-    const primes = [];
-    for (let i = 0; i <= limit; i++) {
-      if (isPrime(i)) primes.push(i);
-    }
-    return primes;
-  }
+  else if (num % 2 === 0)
+    return false
+  else
+    return PRIME_SIEVE[(num - 3) / 2];
+}
 
-  const primes = getPrimes(limit);
-  let primeSum = [...primes];
-  primeSum.reduce((acc, n, i) => {
-    primeSum[i] += acc;
-    return acc += n;
-  }, 0);
+function consecutivePrimeSum(limit) {
+  // Initalize for longest sum < 100
+  let bestPrime = 41;
+  let bestI = 0;
+  let bestJ = 5;
 
-  for (let j = primeSum.length - 1; j >= 0; j--) {
-    for (let i = 0; i < j; i++) {
-      const sum = primeSum[j] - primeSum[i];
-      if (sum > limit) break;
-      if (isPrime(sum) && primes.indexOf(sum) > -1) return sum;
+  // Find longest sum < limit
+  let sumOfCurrRange = 41;
+  let i = 0, j = 5;
+  // -- Loop while current some starting at i is < limit
+  while (sumOfCurrRange < limit) {
+    let currSum = sumOfCurrRange;
+    // -- Loop while pushing j towards end of PRIMES list
+    //      keeping sum under limit
+    while (currSum < limit) {
+      if (isPrime(currSum)) {
+        bestPrime = sumOfCurrRange = currSum;
+        bestI = i;
+        bestJ = j;
+      }
+      // -- Increment inner loop
+      j++;
+      currSum += PRIMES[j];
     }
+    // -- Increment outer loop
+    i++;
+    j = i + (bestJ - bestI);
+    sumOfCurrRange -= PRIMES[i - 1];
+    sumOfCurrRange += PRIMES[j];
   }
+  // Return
+  return bestPrime;
 }
 ```
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.md
index d890d42133e..26aed0ce89a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f39f1000cf542c50feb2
 title: 'Problem 51: Prime digit replacements'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302162
 dashedName: problem-51-prime-digit-replacements
 ---
@@ -56,68 +56,71 @@ primeDigitReplacements(6);
 # --solutions--
 
 ```js
+const NUM_PRIMES = 1000000;
+const PRIME_SEIVE = Array(Math.floor((NUM_PRIMES-1)/2)).fill(true);
+(function initPrimes(num) {
+  const upper = Math.floor((num - 1) / 2);
+  const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+  for (let i = 0; i <= sqrtUpper; i++) {
+    if (PRIME_SEIVE[i]) {
+      // Mark value in PRIMES array
+      const prime = 2 * i + 3;
+      // Mark all multiples of this number as false (not prime)
+      const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+      for (let j = primeSqaredIndex; j < upper; j += prime) {
+        PRIME_SEIVE[j] = false;
+      }
+    }
+  }
+})(NUM_PRIMES);
+
+function isPrime(num) {
+  if (num === 2) return true;
+  else if (num % 2 === 0) return false
+  else return PRIME_SEIVE[(num - 3) / 2];
+}
+
 function primeDigitReplacements(n) {
-  function isNFamily(number, primesMap, n) {
+  function isNFamily(number, n) {
     const prime = number.toString();
     const lastDigit = prime[prime.length - 1];
+    return doesReplacingMakeFamily(prime, '0', n) ||
+      doesReplacingMakeFamily(prime, '2', n) ||
+      (lastDigit !== '1' && doesReplacingMakeFamily(prime, '1', n));
+  }
+
+  function doesReplacingMakeFamily(prime, digitToReplace, family) {
+    let miss = 0;
+    const base = parseInt(
+      prime
+        .split('')
+        .map(digit => digit == digitToReplace ? '0' : digit)
+        .join('')
+    );
+    const replacements = parseInt(
+      prime
+        .split('')
+        .map(digit => digit === digitToReplace ? '1' : '0')
+        .join('')
+    );
+    const start = prime[0] === digitToReplace ? 1 : 0;
+    for (let i = start; i < 10; i++) {
+      const nextNumber = base + i * replacements;
+      if (!isPartOfFamily(nextNumber, prime)) miss++;
+      if (10 - start - miss < family) break;
+    }
+    return 10 - start - miss === family;
+  }
+
+  function isPartOfFamily(number, prime) {
     return (
-      doesReplacingMakeFamily(prime, '0', primesMap, n) ||
-      (lastDigit !== '1' &&
-        doesReplacingMakeFamily(prime, '1', primesMap, n)) ||
-      doesReplacingMakeFamily(prime, '2', primesMap, n)
+      isPrime(number) && number.toString().length === prime.length
     );
   }
 
-  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;
-      }
+  for (let number = 1; number < 125000; number++) {
+    if (isPrime(number) && isNFamily(number, n)) {
+      return number;
     }
   }
   return -1;
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-52-permuted-multiples.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-52-permuted-multiples.md
index d5431d8135b..7a3886a6e27 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-52-permuted-multiples.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-52-permuted-multiples.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a01000cf542c50feb3
 title: 'Problem 52: Permuted multiples'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302163
 dashedName: problem-52-permuted-multiples
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-53-combinatoric-selections.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-53-combinatoric-selections.md
index dbd39ef9755..8d96ff14392 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-53-combinatoric-selections.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-53-combinatoric-selections.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a11000cf542c50feb4
 title: 'Problem 53: Combinatoric selections'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302164
 dashedName: problem-53-combinatoric-selections
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-54-poker-hands.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-54-poker-hands.md
index fd260cddf92..b08e9a13bda 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-54-poker-hands.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-54-poker-hands.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a21000cf542c50feb5
 title: 'Problem 54: Poker hands'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302165
 dashedName: problem-54-poker-hands
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-55-lychrel-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-55-lychrel-numbers.md
index 8b074ba2594..890c5b0997d 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-55-lychrel-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-55-lychrel-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a31000cf542c50feb6
 title: 'Problem 55: Lychrel numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302166
 dashedName: problem-55-lychrel-numbers
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.md
index 407314741ab..e445973f332 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a41000cf542c50feb7
 title: 'Problem 56: Powerful digit sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302167
 dashedName: problem-56-powerful-digit-sum
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-57-square-root-convergents.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-57-square-root-convergents.md
index 17103bc6fe5..034974d882c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-57-square-root-convergents.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-57-square-root-convergents.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a51000cf542c50feb8
 title: 'Problem 57: Square root convergents'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302168
 dashedName: problem-57-square-root-convergents
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-58-spiral-primes.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-58-spiral-primes.md
index 29a3012e447..70b80ebf2a1 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-58-spiral-primes.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-58-spiral-primes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a61000cf542c50feb9
 title: 'Problem 58: Spiral primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302169
 dashedName: problem-58-spiral-primes
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-59-xor-decryption.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-59-xor-decryption.md
index 683db15249a..0784e292908 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-59-xor-decryption.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-59-xor-decryption.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a81000cf542c50feba
 title: 'Problem 59: XOR decryption'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302170
 dashedName: problem-59-xor-decryption
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-6-sum-square-difference.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-6-sum-square-difference.md
index ec60601f106..65a460bd803 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-6-sum-square-difference.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-6-sum-square-difference.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3721000cf542c50fe85
 title: 'Problem 6: Sum square difference'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302171
 dashedName: problem-6-sum-square-difference
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-60-prime-pair-sets.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-60-prime-pair-sets.md
index 5acc6c21769..3fbc3537c20 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-60-prime-pair-sets.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-60-prime-pair-sets.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f3a81000cf542c50febb
 title: 'Problem 60: Prime pair sets'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302172
 dashedName: problem-60-prime-pair-sets
 ---
 
 # --description--
 
-The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 and 109, both 7109 and 1097 are prime. The sum of these four primes, 792, represents the lowest sum for a set of four primes with this property.
+质数 3、7、109 和 673 非常引人注目。 通过取任何两个素数并以任何顺序连接它们，结果将始终是素数。 例如，取 7 和 109，7109 和 1097 都是质数。 这四个素数的总和，792，代表具有此属性的一组四个素数的最低和。
 
 Find the lowest sum for a set of five primes for which any two primes concatenate to produce another prime.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md
index 8989f4171cf..04584622af0 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a91000cf542c50febc
 title: 'Problem 61: Cyclical figurate numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302173
 dashedName: problem-61-cyclical-figurate-numbers
 ---
@@ -12,10 +12,10 @@ Triangle, square, pentagonal, hexagonal, heptagonal, and octagonal numbers are a
 
 | Type of Number | Formula                       | Sequence              |
 | -------------- | ----------------------------- | --------------------- |
-| Triangle       | $P_3(n) = \frac{n(n+1)}{2}$  | 1, 3, 6, 10, 15, ...  |
+| 三角形            | $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, ... |
+| 五角形            | $P_5(n) = \frac{n(3n−1)}2$   | 1, 5, 12, 22, 35, ... |
+| 六角形            | $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, ... |
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md
index 82294e0708a..a89d136f83c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3aa1000cf542c50febd
 title: 'Problem 62: Cubic permutations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302174
 dashedName: problem-62-cubic-permutations
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md
index 02c96036851..2c8b0bb8cd6 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ab1000cf542c50febe
 title: 'Problem 63: Powerful digit counts'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302175
 dashedName: problem-63-powerful-digit-counts
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md
index 6cc017e1fb4..a6acdfc610e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ac1000cf542c50febf
 title: 'Problem 64: Odd period square roots'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302176
 dashedName: problem-64-odd-period-square-roots
 ---
@@ -12,7 +12,7 @@ All square roots are periodic when written as continued fractions and can be wri
 
 $\\displaystyle \\quad \\quad \\sqrt{N}=a_0+\\frac 1 {a_1+\\frac 1 {a_2+ \\frac 1 {a3+ \\dots}}}$
 
-For example, let us consider $\\sqrt{23}:$:
+For example, let us consider $\\sqrt{23}$:
 
 $\\quad \\quad \\sqrt{23}=4+\\sqrt{23}-4=4+\\frac 1 {\\frac 1 {\\sqrt{23}-4}}=4+\\frac 1 {1+\\frac{\\sqrt{23}-3}7}$
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-65-convergents-of-e.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-65-convergents-of-e.md
index 7a1383a7f0c..9aa62302442 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-65-convergents-of-e.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-65-convergents-of-e.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ad1000cf542c50fec0
 title: 'Problem 65: Convergents of e'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302177
 dashedName: problem-65-convergents-of-e
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-66-diophantine-equation.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-66-diophantine-equation.md
index 0eab98070b1..9e01ce1b0c5 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-66-diophantine-equation.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-66-diophantine-equation.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ae1000cf542c50fec1
 title: 'Problem 66: Diophantine equation'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302178
 dashedName: problem-66-diophantine-equation
 ---
@@ -40,25 +40,25 @@ assert(typeof diophantineEquation(7) === 'number');
 
 `diophantineEquation(7)` should return `5`.
 
-```
+```js
 assert.strictEqual(diophantineEquation(7), 5);
 ```
 
 `diophantineEquation(100)` should return `61`.
 
-```
+```js
 assert.strictEqual(diophantineEquation(100), 61);
 ```
 
 `diophantineEquation(409)` should return `409`.
 
-```
+```js
 assert.strictEqual(diophantineEquation(409), 409);
 ```
 
 `diophantineEquation(500)` should return `421`.
 
-```
+```js
 assert.strictEqual(diophantineEquation(500), 421);
 ```
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.md
index 9e1e818c9ce..c3aa2fb6e3b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b01000cf542c50fec2
 title: 'Problem 67: Maximum path sum II'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302179
 dashedName: problem-67-maximum-path-sum-ii
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md
index 1ae580513f2..7be38bfabe1 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b01000cf542c50fec3
 title: 'Problem 68: Magic 5-gon ring'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302180
 dashedName: problem-68-magic-5-gon-ring
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-69-totient-maximum.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-69-totient-maximum.md
index 2e538e324dc..e57b133fbe7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-69-totient-maximum.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-69-totient-maximum.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b11000cf542c50fec4
 title: 'Problem 69: Totient maximum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302181
 dashedName: problem-69-totient-maximum
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-7-10001st-prime.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-7-10001st-prime.md
index 18b18b2bf1a..6780c8fa2d1 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-7-10001st-prime.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-7-10001st-prime.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3731000cf542c50fe86
 title: 'Problem 7: 10001st prime'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302182
 dashedName: problem-7-10001st-prime
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-70-totient-permutation.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-70-totient-permutation.md
index 09c3e106281..1328f1ca1e7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-70-totient-permutation.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-70-totient-permutation.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b21000cf542c50fec5
 title: 'Problem 70: Totient permutation'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302183
 dashedName: problem-70-totient-permutation
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-71-ordered-fractions.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-71-ordered-fractions.md
index 55a2e9b72f6..267a17669b0 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-71-ordered-fractions.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-71-ordered-fractions.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b31000cf542c50fec6
 title: 'Problem 71: Ordered fractions'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302184
 dashedName: problem-71-ordered-fractions
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-72-counting-fractions.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-72-counting-fractions.md
index 3929bde7af7..dab392ae0ae 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-72-counting-fractions.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-72-counting-fractions.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b41000cf542c50fec7
 title: 'Problem 72: Counting fractions'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302185
 dashedName: problem-72-counting-fractions
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.md
index 10c1ae6ea87..b53ef258385 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b61000cf542c50fec8
 title: 'Problem 73: Counting fractions in a range'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302186
 dashedName: problem-73-counting-fractions-in-a-range
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md
index eb9a6e9d13f..45a759f08ef 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b61000cf542c50fec9
 title: 'Problem 74: Digit factorial chains'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302187
 dashedName: problem-74-digit-factorial-chains
 ---
@@ -10,15 +10,19 @@ 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:
 
-$$1! + 4! + 5! = 1 + 24 + 120 = 145$$
+$$1! + 4！ + 5！ = 1 + 24 + 120 = 145$$
 
 Perhaps less well known is 169, in that it produces the longest chain of numbers that link back to 169; it turns out that there are only three such loops that exist:
 
-$$\begin{align} &169 → 363601 → 1454 → 169\\\\ &871 → 45361 → 871\\\\ &872 → 45362 → 872\\\\ \end{align}$$
+$$\begin{align} &169 → 363601 → 1454 → 169\\\\
+&871 → 45361 → 871\\\\ &872 → 45362 → 872\\\\
+\end{align}$$
 
 It is not difficult to prove that EVERY starting number will eventually get stuck in a loop. For example,
 
-$$\begin{align} &69 → 363600 → 1454 → 169 → 363601\\ (→ 1454)\\\\ &78 → 45360 → 871 → 45361\\ (→ 871)\\\\ &540 → 145\\ (→ 145)\\\\ \end{align}$$
+$$\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.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.md
index a20c0a95eac..40ab4fb3e00 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b71000cf542c50feca
 title: 'Problem 75: Singular integer right triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302188
 dashedName: problem-75-singular-integer-right-triangles
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-76-counting-summations.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-76-counting-summations.md
index bbc9618245c..605177c8ce9 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-76-counting-summations.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-76-counting-summations.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f3b81000cf542c50fecb
-title: 'Problem 76: Counting summations'
-challengeType: 5
+title: '问题 76：计算加和'
+challengeType: 1
 forumTopicId: 302189
 dashedName: problem-76-counting-summations
 ---
 
 # --description--
 
-It is possible to write five as a sum in exactly six different ways:
+整数 5 是有可能通过六种不同的加和的方式得到：
 
 <div style='margin-left: 4em;'>
   4 + 1<br>
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-77-prime-summations.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-77-prime-summations.md
index bd26cc3c699..a5639dc73a4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-77-prime-summations.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-77-prime-summations.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b91000cf542c50fecc
 title: 'Problem 77: Prime summations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302190
 dashedName: problem-77-prime-summations
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md
index 61f145116f3..65d3ebad7e4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ba1000cf542c50fecd
 title: 'Problem 78: Coin partitions'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302191
 dashedName: problem-78-coin-partitions
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-79-passcode-derivation.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-79-passcode-derivation.md
index e9858fa5399..a17babe3520 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-79-passcode-derivation.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-79-passcode-derivation.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3bb1000cf542c50fece
 title: 'Problem 79: Passcode derivation'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302192
 dashedName: problem-79-passcode-derivation
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-8-largest-product-in-a-series.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-8-largest-product-in-a-series.md
index 0fd4703af75..c84d410e207 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-8-largest-product-in-a-series.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-8-largest-product-in-a-series.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3741000cf542c50fe87
 title: 'Problem 8: Largest product in a series'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302193
 dashedName: problem-8-largest-product-in-a-series
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.md
index a5523347055..34d7dd6eea4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3bc1000cf542c50fecf
 title: 'Problem 80: Square root digital expansion'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302194
 dashedName: problem-80-square-root-digital-expansion
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md
index 542d6ce39af..5fe3982048f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3bd1000cf542c50fed0
 title: 'Problem 81: Path sum: two ways'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302195
 dashedName: problem-81-path-sum-two-ways
 ---
@@ -10,7 +10,9 @@ dashedName: problem-81-path-sum-two-ways
 
 In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by **only moving to the right and down**, is indicated in bold red and is equal to `2427`.
 
-  $$\begin{pmatrix} \color{red}{131} & 673 & 234 & 103 & 18\\\\ \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\\\ 630 & 803 & \color{red}{746} & \color{red}{422} & 111\\\\ 537 & 699 & 497 & \color{red}{121} & 956\\\\ 805 & 732 & 524 & \color{red}{37} & \color{red}{331} \end{pmatrix}$$
+  $$\begin{pmatrix}   \color{red}{131} & 673 & 234 & 103 & 18\\\\
+  \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\\\   630 & 803 & \color{red}{746} & \color{red}{422} & 111\\\\
+  537 & 699 & 497 & \color{red}{121} & 956\\\\ 805 & 732 & 524 & \color{red}{37} & \color{red}{331} \end{pmatrix}$$
 
 Find the minimal path sum from the top left to the bottom right by only moving right and down in `matrix`, a 2D array representing a matrix. The maximum matrix size used in the tests will be 80 by 80.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md
index ec68b544e25..0895540d468 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3be1000cf542c50fed1
 title: 'Problem 82: Path sum: three ways'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302196
 dashedName: problem-82-path-sum-three-ways
 ---
@@ -12,7 +12,9 @@ dashedName: problem-82-path-sum-three-ways
 
 The minimal path sum in the 5 by 5 matrix below, by starting in any cell in the left column and finishing in any cell in the right column, and only moving up, down, and right, is indicated in red and bold; the sum is equal to `994`.
 
-  $$\begin{pmatrix} 131 & 673 & \color{red}{234} & \color{red}{103} & \color{red}{18}\\\\ \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\\\ 630 & 803 & 746 & 422 & 111\\\\ 537 & 699 & 497 & 121 & 956\\\\ 805 & 732 & 524 & 37 & 331 \end{pmatrix}$$
+  $$\begin{pmatrix}   131 & 673 & \color{red}{234} & \color{red}{103} & \color{red}{18}\\\\
+  \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\\\   630 & 803 & 746 & 422 & 111\\\\
+  537 & 699 & 497 & 121 & 956\\\\ 805 & 732 & 524 & 37 & 331 \end{pmatrix}$$
 
 Find the minimal path sum from the left column to the right column in `matrix`, a 2D array representing a matrix. The maximum matrix size used in tests will be 80 by 80.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md
index ce957c019f4..1bda7f8ce60 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3bf1000cf542c50fed2
-title: 'Problem 83: Path sum: four ways'
-challengeType: 5
+title: '问题 83：路径和：四种方式'
+challengeType: 1
 forumTopicId: 302197
 dashedName: problem-83-path-sum-four-ways
 ---
@@ -12,7 +12,9 @@ dashedName: problem-83-path-sum-four-ways
 
 In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by moving left, right, up, and down, is indicated in bold red and is equal to `2297`.
 
-  $$\begin{pmatrix} \color{red}{131} & 673 & \color{red}{234} & \color{red}{103} & \color{red}{18}\\\\ \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & \color{red}{150}\\\\ 630 & 803 & 746 & \color{red}{422} & \color{red}{111}\\\\ 537 & 699 & 497 & \color{red}{121} & 956\\\\ 805 & 732 & 524 & \color{red}{37} & \color{red}{331} \end{pmatrix}$$
+  $$\begin{pmatrix}   \color{red}{131} & 673 & \color{red}{234} & \color{red}{103} & \color{red}{18}\\\\
+  \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & \color{red}{150}\\\\   630 & 803 & 746 & \color{red}{422} & \color{red}{111}\\\\
+  537 & 699 & 497 & \color{red}{121} & 956\\\\ 805 & 732 & 524 & \color{red}{37} & \color{red}{331} \end{pmatrix}$$
 
 Find the minimal path sum from the top left to the bottom right by moving left, right, up, and down in `matrix`, a 2D array representing a matrix. The maximum matrix size used in tests will be 80 by 80.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-84-monopoly-odds.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-84-monopoly-odds.md
index 6870d2e4207..5f3c4e3432f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-84-monopoly-odds.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-84-monopoly-odds.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c11000cf542c50fed3
-title: 'Problem 84: Monopoly odds'
-challengeType: 5
+title: '问题 84：垄断赔率'
+challengeType: 1
 forumTopicId: 302198
 dashedName: problem-84-monopoly-odds
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md
index c6d4c9c2c6b..eafbccb8aee 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c11000cf542c50fed4
 title: 'Problem 85: Counting rectangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302199
 dashedName: problem-85-counting-rectangles
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md
index bcd935b24d4..39a860bd794 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c31000cf542c50fed5
 title: 'Problem 86: Cuboid route'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302200
 dashedName: problem-86-cuboid-route
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.md
index 57da5afe793..a6c51eff68d 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c51000cf542c50fed8
 title: 'Problem 87: Prime power triples'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302201
 dashedName: problem-87-prime-power-triples
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-88-product-sum-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-88-product-sum-numbers.md
index 3134d9cacf3..46779896396 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-88-product-sum-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-88-product-sum-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c51000cf542c50fed6
 title: 'Problem 88: Product-sum numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302203
 dashedName: problem-88-product-sum-numbers
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-89-roman-numerals.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-89-roman-numerals.md
index 3c0e7ac2aa5..52c03847a6b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-89-roman-numerals.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-89-roman-numerals.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c51000cf542c50fed7
 title: 'Problem 89: Roman numerals'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302204
 dashedName: problem-89-roman-numerals
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md
index 3ce9715e401..a853dd4415e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3761000cf542c50fe88
 title: 'Problem 9: Special Pythagorean triplet'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302205
 dashedName: problem-9-special-pythagorean-triplet
 ---
@@ -30,7 +30,7 @@ assert(typeof specialPythagoreanTriplet(24) === 'number');
 assert.strictEqual(specialPythagoreanTriplet(24), 480);
 ```
 
-`specialPythagoreanTriplet(120)` should return 49920, 55080 or 60000
+`specialPythagoreanTriplet(120)` should return 49920, 55080 or 60000.
 
 ```js
 assert([49920, 55080, 60000].includes(specialPythagoreanTriplet(120)));
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md
index ef2182b215d..3e1206b4c4f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c61000cf542c50fed9
 title: 'Problem 90: Cube digit pairs'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302207
 dashedName: problem-90-cube-digit-pairs
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md
index b920e69678d..7874cbab3fc 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c71000cf542c50feda
 title: 'Problem 91: Right triangles with integer coordinates'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302208
 dashedName: problem-91-right-triangles-with-integer-coordinates
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.md
index 81b5dce63a3..9312b98be1a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.md
@@ -1,16 +1,16 @@
 ---
 id: 5900f3ca1000cf542c50fedc
 title: 'Problem 93: Arithmetic expressions'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302210
 dashedName: problem-93-arithmetic-expressions
 ---
 
 # --description--
 
-By using each of the digits from the set, {1, 2, 3, 4}, exactly once, and making use of the four arithmetic operations (+, −, \*, /) and brackets/parentheses, it is possible to form different positive integer targets.
+使用集合 {1, 2, 3, 4} 中每个数字恰好一次、加减乘除（+, −, ∗, /）四则运算以及括号，可以得到不同的正整数。
 
-For example,
+例如：
 
 <div style='margin-left: 4em;'>
   8 = (4 * (1 + 3)) / 2<br>
@@ -19,7 +19,7 @@ For example,
   36 = 3 * 4 * (2 + 1)
 </div>
 
-Note that concatenations of the digits, like 12 + 34, are not allowed.
+需要注意的是，把数字直接连接起来是不被允许的，例如：12 + 34。
 
 Using the set, {1, 2, 3, 4}, it is possible to obtain thirty-one different target numbers of which 36 is the maximum, and each of the numbers 1 to 28 can be obtained before encountering the first non-expressible number.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.md
index ef0c095e035..dae7cdabccd 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.md
@@ -1,46 +1,46 @@
 ---
 id: 5900f3ca1000cf542c50fedd
 title: 'Problem 94: Almost equilateral triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302211
 dashedName: problem-94-almost-equilateral-triangles
 ---
 
 # --description--
 
-It is easily proved that no equilateral triangle exists with integral length sides and integral area. However, the almost equilateral triangle 5-5-6 has an area of 12 square units.
+很容易证明，不存在同时具有整数边长和整数面积的等边三角形。 但是，存在边长为 5-5-6 的几乎等边三角形，其面积恰为整数 12。
 
-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.
+我们定义<dfn>几乎等边三角形</dfn>是有两边一样长，且第三边与两边最多相差1的三角形。
 
-Find the sum of the perimeters of all almost equilateral triangles with integral side lengths and area and whose perimeters do not exceed `limit`.
+从周长不超过 `limit` 的三角形中，求出所有边长和面积均为整数的几乎等边三角形的周长之和。
 
 # --hints--
 
-`almostEquilateralTriangles(50)` should return a number.
+`almostEquilateralTriangles(50)` 应该返回一个数字。
 
 ```js
 assert(typeof almostEquilateralTriangles(50) === 'number');
 ```
 
-`almostEquilateralTriangles(50)` should return `66`.
+`almostEquilateralTriangles(50)` 应该返回 `66`。
 
 ```js
 assert.strictEqual(almostEquilateralTriangles(50), 66);
 ```
 
-`almostEquilateralTriangles(10000)` should return `3688`.
+`almostEquilateralTriangles(10000)` 应该返回 `3688`。
 
 ```js
 assert.strictEqual(almostEquilateralTriangles(10000), 3688);
 ```
 
-`almostEquilateralTriangles(10000000)` should return `9973078`.
+`almostEquilateralTriangles(10000000)` 应该返回 `9973078`。
 
 ```js
 assert.strictEqual(almostEquilateralTriangles(10000000), 9973078);
 ```
 
-`almostEquilateralTriangles(1000000000)` should return `518408346`.
+`almostEquilateralTriangles(1000000000)` 应该返回 `518408346`。
 
 ```js
 assert.strictEqual(almostEquilateralTriangles(1000000000), 518408346);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.md
index 15dafc79a9f..cabdb3486c9 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ce1000cf542c50fee0
 title: 'Problem 97: Large non-Mersenne prime'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302214
 dashedName: problem-97-large-non-mersenne-prime
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-98-anagramic-squares.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-98-anagramic-squares.md
index e63309053f3..f54ab71dd62 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-98-anagramic-squares.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-98-anagramic-squares.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3cf1000cf542c50fee1
 title: 'Problem 98: Anagramic squares'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302215
 dashedName: problem-98-anagramic-squares
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-99-largest-exponential.md b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-99-largest-exponential.md
index 07d9a48f01d..af44a7d0bd7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-99-largest-exponential.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-99-largest-exponential.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d01000cf542c50fee2
 title: 'Problem 99: Largest exponential'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302216
 dashedName: problem-99-largest-exponential
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/24-game.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/24-game.md
index f5a4c1da246..589bc792418 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/24-game.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/24-game.md
@@ -1,14 +1,14 @@
 ---
 id: 5951e88f64ebf159166a1176
 title: 24 点游戏
-challengeType: 5
+challengeType: 1
 forumTopicId: 302218
 dashedName: 24-game
 ---
 
 # --description--
 
-[24 点游戏](https://en.wikipedia.org/wiki/24_Game)测试一个人的心算能力。
+The 24 Game tests a person's mental arithmetic.
 
 游戏的目标是使四个数字的计算结果是 24。
 
@@ -39,28 +39,28 @@ dashedName: 24-game
 assert(typeof solve24 === 'function');
 ```
 
-`solve24("4878")` 应该返回 `(7-8/8)*4` 或 `4*(7-8/8)`。
+`solve24("4878")` should return `(7-8/8)*4`, `4*(7-8/8)`, or a similar valid string
 
 ```js
-assert(include(answers[0], removeParentheses(solve24(testCases[0]))));
+assert(isValidSolution_(solve24(testCases_[0])));
 ```
 
-`solve24("1234")` 应该返回 `1*2*3*4`。
+`solve24("1234")` should return `1*2*3*4` or a similar valid string
 
 ```js
-assert(include(answers[1], removeParentheses(solve24(testCases[1]))));
+assert(isValidSolution_(solve24(testCases_[1])));
 ```
 
-`solve24("6789")` 应该返回 `(6*8)/(9-7)` 或 `(8*6)/(9-7)`。
+`solve24("6789")` should return `(6*8)/(9-7)`, `(8*6)/(9-7)`, or a similar valid string
 
 ```js
-assert(include(answers[2], removeParentheses(solve24(testCases[2]))));
+assert(isValidSolution_(solve24(testCases_[2])));
 ```
 
-`solve24("1127")` 应该返回 `(1+7)*(1+2)`。
+`solve24("1127")` should return `(1+7)*(1+2)` or a similar valid string
 
 ```js
-assert(include(answers[3], removeParentheses(solve24(testCases[3]))));
+assert(isValidSolution_(solve24(testCases_[3])));
 ```
 
 # --seed--
@@ -68,56 +68,101 @@ assert(include(answers[3], removeParentheses(solve24(testCases[3]))));
 ## --after-user-code--
 
 ```js
-const testCases = [
+const testCases_ = [
   '4878',
   '1234',
   '6789',
   '1127'
 ];
 
-const answers = [
-  ['(7-8/8)*4', '4*(7-8/8)', '(4-8+7)*8', '(4+7-8)*8', '(7+4-8)*8', '(7-8+4)*8', '8*(4-8+7)', '8*(4+7-8)', '8*(7+4-8)', '8*(7-8+4)'],
-  ['1*2*3*4', '1*2*4*3', '1*3*2*4', '1*3*4*2', '1*4*2*3', '1*4*3*2', '2*1*3*4', '2*1*4*3', '2*3*1*4', '2*3*4*1', '2*4*3*1', '2*4*1*3', '3*1*2*4', '3*1*4*2', '3*2*1*4', '3*2*4*1', '3*4*1*2', '3*4*2*1', '4*1*2*3', '4*1*3*2', '4*2*1*3', '4*2*3*1', '4*3*1*2', '4*3*2*1', '(1+2+3)*4', '(1+3+2)*4', '(2+1+3)*4', '(2+3+1)*4', '(3+1+2)*4', '(3+2+1)*4', '4*(1+2+3)', '4*(2+1+3)', '4*(2+3+1)', '4*(3+1+2)', '4*(3+2+1)'],
-  ['(6*8)/(9-7)', '(8*6)/(9-7)', '6*8/(9-7)', '8*6/(9-7)'],
-  ['(1+7)*(2+1)', '(1+7)*(1+2)', '(1+2)*(1+7)', '(1+2)*(7+1)', '(2+1)*(1+7)', '(7+1)*(2+1)']
-];
-
-function include(ansArr, res) {
-  const index = ansArr.indexOf(res);
-  return index >= 0;
+const OPERATORS_ = {
+  "+": (a, b) => a + b,
+  "-": (a, b) => a - b,
+  "*": (a, b) => a * b,
+  "/": (a, b) => a / b,
 }
 
-//The main method for detecting single parentheses
-function removeParentheses(ans) {
-  for (let i = 0; i < ans.length; i++) {
-    if (!isNaN(ans[i])) {
-      ans = removeParenthesesHelper(ans, i);
+const PRECIDENCE_ = {
+  "+": 1,
+  "-": 1,
+  "*": 2,
+  "/": 2,
+}
+
+function evaluate_(expression) {
+  expression = expression.replace('/\s+/g', '');
+  const stack = [];
+  let postfix = "";
+
+  // Convert from infix to postfix
+  let head = 0;
+  while (head < expression.length) {
+    let c = expression[head];
+    switch (c) {
+      case "(":
+        stack.push(c);
+        break;
+      case ")":
+        let last = stack.pop();
+        while (last !== "(") {
+          postfix += last;
+          last = stack.pop();
+        }
+        break;
+      case "+":
+      case "-":
+      case "*":
+      case "/":
+        while (stack.length &&
+               PRECIDENCE_[c] <= PRECIDENCE_[stack[stack.length-1]]) {
+          postfix += stack.pop();
+        }
+        stack.push(c);
+        break;
+      case "0":
+      case "1":
+      case "2":
+      case "3":
+      case "4":
+      case "5":
+      case "6":
+      case "7":
+      case "8":
+      case "9":
+        postfix += c;
+        break;
+      default:
+        return false;
+    }
+    head++;
+  }
+
+  // Clear out stack
+  while (stack.length) {
+    postfix += stack.pop();
+  }
+
+  // Evaluate postfix
+  for (let c of postfix) {
+    switch (c) {
+      case "+":
+      case "-":
+      case "*":
+      case "/":
+        const b = +stack.pop();
+        const a = +stack.pop();
+        stack.push(OPERATORS_[c](a, b));
+        break;
+      default:
+        stack.push(c);
     }
   }
-  return ans;
+  return stack.pop();
 }
 
-//Helper to remove left and right parantheses
-function removeParenthesesHelper(ans, i) {
-  while (i > 0 && i < ans.length - 1) {
-    if (ans[i - 1] === '(' && ans[i + 1] === ')') {
-      //Paranthesis detected. Remove them.
-      ans = replaceChar(ans, '', i - 1);
-      ans = replaceChar(ans, '', i);
-      i--;
-    } else {
-      return ans;
-    }
-  }
-  return ans;
-}
-
-//Replace a character at a given index for the provided character
-function replaceChar(origString, replaceChar, index) {
-  let firstPart = origString.substr(0, index);
-  let lastPart = origString.substr(index + 1);
-  let newString = firstPart + replaceChar + lastPart;
-  return newString;
+// Check solution validity
+function isValidSolution_(userSolution) {
+  return evaluate_(userSolution) === 24;
 }
 ```
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md
index 125236ca75f..5e696417709 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md
@@ -1,14 +1,14 @@
 ---
 id: 5949b579404977fbaefcd736
 title: 9 billion names of God the integer
-challengeType: 5
+challengeType: 1
 forumTopicId: 302219
 dashedName: 9-billion-names-of-god-the-integer
 ---
 
 # --description--
 
-This task is a variation of the [short story by Arthur C. Clarke](https://en.wikipedia.org/wiki/The Nine Billion Names of God#Plot_summary "wp: The Nine Billion Names of God#Plot_summary").
+This task is a variation of the short story by Arthur C. Clarke.
 
 (Solvers should be aware of the consequences of completing this task.)
 
@@ -78,7 +78,7 @@ assert.equal(numberOfNames(23), 1255);
 assert.equal(numberOfNames(42), 53174);
 ```
 
-`numberOfNames(123)` should equal 2552338241.
+`numberOfNames(123)` 应等于 2552338241。
 
 ```js
 assert.equal(numberOfNames(123), 2552338241);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/abc-problem.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/abc-problem.md
index b42b619749d..36a7b23eeb7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/abc-problem.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/abc-problem.md
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339acc
 title: ABC Problem
-challengeType: 5
+challengeType: 1
 forumTopicId: 302220
 dashedName: abc-problem
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/abundant-deficient-and-perfect-number-classifications.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/abundant-deficient-and-perfect-number-classifications.md
index 33cbddb68ab..5626858b7d3 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/abundant-deficient-and-perfect-number-classifications.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/abundant-deficient-and-perfect-number-classifications.md
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339acd
 title: 'Abundant, deficient and perfect number classifications'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302221
 dashedName: abundant-deficient-and-perfect-number-classifications
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/accumulator-factory.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/accumulator-factory.md
index fd90df9f347..e3ee77daf90 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/accumulator-factory.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/accumulator-factory.md
@@ -1,14 +1,14 @@
 ---
 id: 594810f028c0303b75339ace
 title: Accumulator factory
-challengeType: 5
+challengeType: 1
 forumTopicId: 302222
 dashedName: accumulator-factory
 ---
 
 # --description--
 
-A problem posed by [Paul Graham](https://en.wikipedia.org/wiki/Paul_Graham_(programmer)) is that of creating a function that takes a single (numeric) argument and which returns another function that is an accumulator. The returned accumulator function in turn also takes a single numeric argument, and returns the sum of all the numeric values passed in so far to that accumulator (including the initial value passed when the accumulator was created).
+A problem posed by Paul Graham is that of creating a function that takes a single (numeric) argument and which returns another function that is an accumulator. The returned accumulator function in turn also takes a single numeric argument, and returns the sum of all the numeric values passed in so far to that accumulator (including the initial value passed when the accumulator was created).
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/ackermann-function.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/ackermann-function.md
index f80262dc40d..f6443aee8c4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/ackermann-function.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/ackermann-function.md
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339acf
 title: Ackermann function
-challengeType: 5
+challengeType: 1
 forumTopicId: 302223
 dashedName: ackermann-function
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/align-columns.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/align-columns.md
index 2b58a1e1d86..a5a6422abb4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/align-columns.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/align-columns.md
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339ad0
-title: Align columns
-challengeType: 5
+title: 对齐列
+challengeType: 1
 forumTopicId: 302224
 dashedName: align-columns
 ---
@@ -12,7 +12,7 @@ Given an array of many lines, where fields within a line are delineated by a sin
 
 # --instructions--
 
-Use the following text to test your programs:
+使用以下文本测试您的程序：
 
 ```js
 const testText = [
@@ -29,14 +29,14 @@ const testText = [
 ];
 ```
 
-**Note that:**
+**注意：**
 
 - 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.
+- 输出文本将在纯文本编辑器或基本终端上以等宽字体查看。 Lines in it should be joined using new line character (`\n`).
+- 列之间的最小间距应根据文本计算，而不是硬编码。
+- 不需要在列之间或列周围添加分隔字符。
 
 For example, one of the lines from the `testText`, after jusitifing to the right, left and center respectivelly:
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/amicable-pairs.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/amicable-pairs.md
index 207ab439f3f..da53936e08e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/amicable-pairs.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/amicable-pairs.md
@@ -1,24 +1,26 @@
 ---
 id: 5949b579404977fbaefcd737
 title: Amicable pairs
-challengeType: 5
+challengeType: 1
 forumTopicId: 302225
 dashedName: amicable-pairs
 ---
 
 # --description--
 
-Two integers $N$ and $M$ are said to be [amicable pairs](https://en.wikipedia.org/wiki/Amicable numbers "wp: Amicable numbers") if $N \\neq M$ and the sum of the [proper divisors](https://rosettacode.org/wiki/Proper divisors "Proper divisors") of $N$ ($\\mathrm{sum}(\\mathrm{propDivs}(N))$) $= M$ as well as $\\mathrm{sum}(\\mathrm{propDivs}(M)) = N$.
+Two integers $N$ and $M$ are said to be amicable pairs if $N \\neq M$ and the sum of the proper divisors of $N$ ($\\mathrm{sum}(\\mathrm{propDivs}(N))$) $= M$ as well as $\\mathrm{sum}(\\mathrm{propDivs}(M)) = N$.
 
-**Example:**
+**例如：**
 
 **1184** and **1210** are an amicable pair, with proper divisors:
 
 <ul>
-  <li>1, 2, 4, 8, 16, 32, 37, 74, 148, 296, 592  and</li>
-  <li>1, 2, 5, 10, 11, 22, 55, 110, 121, 242, 605   respectively.</li>
+  <li>1, 2, 4, 8, 16, 32, 37, 74, 148, 296, 592 and</li>
+  <li>1, 2, 5, 10, 11, 22, 55, 110, 121, 242, 605 respectively.</li>
 </ul>
 
+The sum of the divisors for the first value, **1184**, is **1210** and the sum of the divisors for the second value, **1210**, is **1184**.
+
 # --instructions--
 
 Calculate and show here the Amicable pairs below 20,000 (there are eight).
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/averages-mode.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/averages-mode.md
index 166050bd516..d65362b8929 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/averages-mode.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/averages-mode.md
@@ -1,14 +1,14 @@
 ---
 id: 594d8d0ab97724821379b1e6
 title: Averages/Mode
-challengeType: 5
+challengeType: 1
 forumTopicId: 302226
 dashedName: averagesmode
 ---
 
 # --description--
 
-Write a program to find the [mode](https://en.wikipedia.org/wiki/Mode (statistics) "wp: Mode (statistics)") value of a collection.
+Write a function `mode` to find the value that appears most in an array.
 
 The case where the collection is empty may be ignored. Care must be taken to handle the case where the mode is non-unique.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md
index 45425141e3b..772c6fb9da1 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md
@@ -1,14 +1,14 @@
 ---
 id: 594d966a1467eb84194f0086
 title: Averages/Pythagorean means
-challengeType: 5
+challengeType: 1
 forumTopicId: 302227
 dashedName: averagespythagorean-means
 ---
 
 # --description--
 
-Compute all three of the [Pythagorean means](https://en.wikipedia.org/wiki/Pythagorean means "wp: Pythagorean means") of the set of integers $1$ through $10$ (inclusive).
+Compute all three of the <a href="https://en.wikipedia.org/wiki/Pythagorean_means" target="_blank" rel="noopener noreferrer nofollow">Pythagorean means</a> of the set of integers $1$ through $10$ (inclusive).
 
 Show that $A(x_1,\\ldots,x_n) \\geq G(x_1,\\ldots,x_n) \\geq H(x_1,\\ldots,x_n)$ for this set of positive integers.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md
index d7bb3ef969c..f4dbbcbcca7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md
@@ -1,18 +1,16 @@
 ---
 id: 594da033de4190850b893874
 title: Averages/Root mean square
-challengeType: 5
+challengeType: 1
 forumTopicId: 302228
 dashedName: averagesroot-mean-square
 ---
 
 # --description--
 
-Compute the [Root mean square](https://en.wikipedia.org/wiki/Root mean square "wp: Root mean square") of the numbers 1 through 10 inclusive.
+Compute the Root Mean Square (RMS) of the numbers 1 through 10 inclusive.
 
-The *root mean square* is also known by its initials RMS (or rms), and as the **quadratic mean**.
-
-The RMS is calculated as the mean of the squares of the numbers, square-rooted:
+The <abbr title="Root mean square">RMS</abbr> is calculated by taking the square root of the mean of the squares of the numbers, given by the equation:
 
 $$x\_{\\mathrm{rms}} = \\sqrt {{{x_1}^2 + {x_2}^2 + \\cdots + {x_n}^2} \\over n}. $$
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/babbage-problem.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/babbage-problem.md
index 27054cccc54..84d5ed98879 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/babbage-problem.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/babbage-problem.md
@@ -1,14 +1,14 @@
 ---
 id: 594db4d0dedb4c06a2a4cefd
 title: Babbage problem
-challengeType: 5
+challengeType: 1
 forumTopicId: 302229
 dashedName: babbage-problem
 ---
 
 # --description--
 
-[Charles Babbage](https://en.wikipedia.org/wiki/Charles_Babbage "wp: Charles_Babbage"), looking ahead to the sorts of problems his Analytical Engine would be able to solve, gave this example:
+Charles Babbage, looking ahead to the sorts of problems his Analytical Engine would be able to solve, gave this example:
 
 <blockquote>
   What is the smallest positive integer whose square ends in the digits 269,696?
@@ -17,7 +17,7 @@ dashedName: babbage-problem
 
 He thought the answer might be 99,736, whose square is 9,947,269,696; but he couldn't be certain.
 
-The task is to find out if Babbage had the right answer.
+任务是找出巴贝奇是否有正确的答案。
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/balanced-brackets.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/balanced-brackets.md
index 5045fbd2cad..253e48f7289 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/balanced-brackets.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/balanced-brackets.md
@@ -1,7 +1,7 @@
 ---
 id: 594dc6c729e5700999302b45
 title: Balanced brackets
-challengeType: 5
+challengeType: 1
 forumTopicId: 302230
 dashedName: balanced-brackets
 ---
@@ -10,8 +10,8 @@ dashedName: balanced-brackets
 
 Determine whether a generated string of brackets is balanced; that is, whether it consists entirely of pairs of opening/closing brackets (in that order), none of which mis-nest.
 
-**Examples:**
-| Input                     | Output |
+**示例：**
+| 输入                        | Output |
 | ------------------------- | ------ |
 | <code>\[]</code> | true   |
 | <code>]\[</code> | false  |
@@ -22,115 +22,115 @@ Determine whether a generated string of brackets is balanced; that is, whether i
 
 # --hints--
 
-`isBalanced` should be a function.
+`isBalanced` 应该是一个函数。
 
 ```js
 assert(typeof isBalanced === 'function');
 ```
 
-`isBalanced("[]")` should return true.
+`isBalanced("[]")` 应该返回 true。
 
 ```js
 assert(isBalanced(testCases[0]));
 ```
 
-`isBalanced("]][[[][][][]][")` should return false.
+`isBalanced("]][[[][][][]][")` 应该返回 false。
 
 ```js
 assert(!isBalanced(testCases[1]));
 ```
 
-`isBalanced("[][[[[][][[[]]]]]]")` should return true.
+`isBalanced("[][[[[][][[[]]]]]]")` 应该返回真。
 
 ```js
 assert(isBalanced(testCases[2]));
 ```
 
-`isBalanced("][")` should return false.
+`isBalanced("][")` 应该返回 false。
 
 ```js
 assert(!isBalanced(testCases[3]));
 ```
 
-`isBalanced("[[[]]]][[]")` should return false.
+`isBalanced("[[[]]]][[]")` 应该返回 false。
 
 ```js
 assert(!isBalanced(testCases[4]));
 ```
 
-`isBalanced("][[]")` should return false.
+`isBalanced("][[]")` 应该返回 false。
 
 ```js
 assert(!isBalanced(testCases[5]));
 ```
 
-`isBalanced("][[][]][[[]]")` should return false.
+`isBalanced("][[][]][[[]]")` 应该返回 false。
 
 ```js
 assert(!isBalanced(testCases[6]));
 ```
 
-`isBalanced("[[][]]][")` should return false.
+`isBalanced("[[][]]][")` 应该返回 false。
 
 ```js
 assert(!isBalanced(testCases[7]));
 ```
 
-`isBalanced("[[[]]][[]]]][][[")` should return false.
+`isBalanced("[[[]]][[]]]][][[")` 应该返回 false。
 
 ```js
 assert(!isBalanced(testCases[8]));
 ```
 
-`isBalanced("[]][[]]][[[[][]]")` should return false.
+`isBalanced("[]][[]]][[[[][]]")` 应该返回 false。
 
 ```js
 assert(!isBalanced(testCases[9]));
 ```
 
-`isBalanced("][]][[][")` should return false.
+`isBalanced("][]][[][")` 应该返回 false。
 
 ```js
 assert(!isBalanced(testCases[10]));
 ```
 
-`isBalanced("[[]][[][]]")` should return true.
+`isBalanced("[[]][[][]]")` 应该返回真。
 
 ```js
 assert(isBalanced(testCases[11]));
 ```
 
-`isBalanced("[[]]")` should return true.
+`isBalanced("[[]]")` 应该返回 true。
 
 ```js
 assert(isBalanced(testCases[12]));
 ```
 
-`isBalanced("]][]][[]][[[")` should return false.
+`isBalanced("]][]][[]][[[")` 应该返回 false。
 
 ```js
 assert(!isBalanced(testCases[13]));
 ```
 
-`isBalanced("][]][][[")` should return false.
+`isBalanced("][]][][[")` 应该返回 false。
 
 ```js
 assert(!isBalanced(testCases[14]));
 ```
 
-`isBalanced("][][")` should return false.
+`isBalanced("][][")` 应该返回 false。
 
 ```js
 assert(!isBalanced(testCases[15]));
 ```
 
-`isBalanced("[]]]")` should return false.
+`isBalanced("[]]]")` 应该返回 false。
 
 ```js
 assert(!isBalanced(testCases[16]));
 ```
 
-`isBalanced("")` should return true.
+`isBalanced("")` 应该返回 true。
 
 ```js
 assert(isBalanced(testCases[17]));
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md
index bbd910fb6c5..2254ea4c44a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md
@@ -1,7 +1,7 @@
 ---
 id: 5951815dd895584b06884620
 title: Circles of given radius through two points
-challengeType: 5
+challengeType: 1
 forumTopicId: 302231
 dashedName: circles-of-given-radius-through-two-points
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/closest-pair-problem.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/closest-pair-problem.md
index 9221d424b31..06259fbc6a1 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/closest-pair-problem.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/closest-pair-problem.md
@@ -1,7 +1,7 @@
 ---
 id: 5951a53863c8a34f02bf1bdc
 title: Closest-pair problem
-challengeType: 5
+challengeType: 1
 forumTopicId: 302232
 dashedName: closest-pair-problem
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/combinations.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/combinations.md
index 27e9a3fa6d4..8ced3ef16f7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/combinations.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/combinations.md
@@ -1,7 +1,7 @@
 ---
 id: 5958469238c0d8d2632f46db
 title: Combinations
-challengeType: 5
+challengeType: 1
 forumTopicId: 302233
 dashedName: combinations
 ---
@@ -10,7 +10,7 @@ dashedName: combinations
 
 Given non-negative integers `m` and `n`, generate all size `m` combinations of the integers from `0` (zero) to `n-1` in sorted order (each combination is sorted and the entire table is sorted).
 
-**Example:**
+**例如：**
 
 `3` comb `5` is:
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/comma-quibbling.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/comma-quibbling.md
index 6223a523cee..28053f80b67 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/comma-quibbling.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/comma-quibbling.md
@@ -1,14 +1,14 @@
 ---
 id: 596e414344c3b2872167f0fe
 title: Comma quibbling
-challengeType: 5
+challengeType: 1
 forumTopicId: 302234
 dashedName: comma-quibbling
 ---
 
 # --description--
 
-Comma quibbling is a task originally set by Eric Lippert in his [blog](https://blogs.msdn.com/b/ericlippert/archive/2009/04/15/comma-quibbling.aspx).
+<a href="https://rosettacode.org/wiki/Comma_quibbling" target="_blank" rel="noopener noreferrer nofollow">Comma quibbling</a> is a task originally set by Eric Lippert in his blog.
 
 # --instructions--
 
@@ -52,19 +52,19 @@ assert(typeof quibble(['ABC']) === 'string');
 assert.equal(quibble(testCases[0]), results[0]);
 ```
 
-`quibble(["ABC"])` should return "{ABC}".
+`quibble(["ABC"])` should return `"{ABC}"`.
 
 ```js
 assert.equal(quibble(testCases[1]), results[1]);
 ```
 
-`quibble(["ABC", "DEF"])` should return "{ABC and DEF}".
+`quibble(["ABC", "DEF"])` should return `"{ABC and DEF}"`.
 
 ```js
 assert.equal(quibble(testCases[2]), results[2]);
 ```
 
-`quibble(["ABC", "DEF", "G", "H"])` should return "{ABC,DEF,G and H}".
+`quibble(["ABC", "DEF", "G", "H"])` should return `"{ABC, DEF, G and H}"`.
 
 ```js
 assert.equal(quibble(testCases[3]), results[3]);
@@ -76,7 +76,7 @@ assert.equal(quibble(testCases[3]), results[3]);
 
 ```js
 const testCases = [[], ["ABC"], ["ABC", "DEF"], ["ABC", "DEF", "G", "H"]];
-const results = ["{}", "{ABC}", "{ABC and DEF}", "{ABC,DEF,G and H}"];
+const results = ["{}", "{ABC}", "{ABC and DEF}", "{ABC, DEF, G and H}"];
 ```
 
 ## --seed-contents--
@@ -93,7 +93,7 @@ function quibble(words) {
 ```js
 function quibble(words) {
   return "{" +
-    words.slice(0, words.length - 1).join(",") +
+    words.slice(0, words.length - 1).join(", ") +
    (words.length > 1 ? " and " : "") +
    (words[words.length - 1] || '') +
   "}";
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
index 313cda7dcc3..df465f24694 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
@@ -1,14 +1,20 @@
 ---
 id: 596e457071c35c882915b3e4
 title: Compare a list of strings
-challengeType: 5
+challengeType: 1
 forumTopicId: 302235
 dashedName: compare-a-list-of-strings
 ---
 
 # --description--
 
-Given a [list](https://en.wikipedia.org/wiki/List_(abstract_data_type) "wp: List\_(abstract_data_type)") of arbitrarily many strings, implement a function for each of the following conditions:
+A list is a ordered set of values that may contain duplicates. Here is an example:
+
+```js
+const list = [['AA',  'BB', 'CC'], ['AA', 'ACB', 'AA'], [], ['AA']];
+```
+
+Given a list of arbitrarily many strings, implement a function for each of the following conditions:
 
 <ul>
   <li>test if they are all lexically equal</li>
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md
index e050e0d7d2a..683a565c301 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md
@@ -1,7 +1,7 @@
 ---
 id: 596fd036dc1ab896c5db98b1
 title: Convert seconds to compound duration
-challengeType: 5
+challengeType: 1
 forumTopicId: 302236
 dashedName: convert-seconds-to-compound-duration
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/count-occurrences-of-a-substring.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/count-occurrences-of-a-substring.md
index 50d6c16f8dd..c3274154b40 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/count-occurrences-of-a-substring.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/count-occurrences-of-a-substring.md
@@ -1,7 +1,7 @@
 ---
 id: 596fda99c69f779975a1b67d
 title: Count occurrences of a substring
-challengeType: 5
+challengeType: 1
 forumTopicId: 302237
 dashedName: count-occurrences-of-a-substring
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/count-the-coins.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/count-the-coins.md
index 3e6bd14d1d6..eb2bc8af330 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/count-the-coins.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/count-the-coins.md
@@ -1,58 +1,58 @@
 ---
 id: 59713bd26bdeb8a594fb9413
 title: Count the coins
-challengeType: 5
+challengeType: 1
 forumTopicId: 302238
 dashedName: count-the-coins
 ---
 
 # --description--
 
-There are four types of common coins in [US](https://en.wikipedia.org/wiki/United_States) currency:
+There are four types of common coins in US currency:
 
 <ul>
-  <li>quarters (25 cents)</li>
-  <li>dimes (10 cents)</li>
-  <li>nickels (5 cents), and</li>
-  <li>pennies (1 cent)</li>
+  <li>quarters 铜币(25 美分)</li>
+  <li>小铜币（10 美分）</li>
+  <li>镍币（5 美分），以及</li>
+  <li>pennies 便士(1美分)</li>
 </ul>
 
 <p>There are six ways to make change for 15 cents:</p>
 
 <ul>
-  <li>A dime and a nickel</li>
-  <li>A dime and 5 pennies</li>
-  <li>3 nickels</li>
-  <li>2 nickels and 5 pennies</li>
-  <li>A nickel and 10 pennies</li>
-  <li>15 pennies</li>
+  <li>1 个小铜币和 1 个镍币</li>
+  <li>一个小铜币和 5 便士</li>
+  <li>3 个镍币</li>
+  <li>2 个镍币和 5 便士</li>
+  <li>1 个镍币和 10 便士</li>
+  <li>15 便士</li>
 </ul>
 
 # --instructions--
 
-Implement a function to determine how many ways there are to make change for a given input, `cents`, that represents an amount of US pennies using these common coins.
+实现一个函数来确定有多少种对给定输入 `cents` 的找零方式， 找零可以使用一定数量的美国硬币。
 
 # --hints--
 
-`countCoins` should be a function.
+`countCoins` 应该是一个函数。
 
 ```js
 assert(typeof countCoins === 'function');
 ```
 
-`countCoins(15)` should return `6`.
+`countCoins(15)` 应该返回 `6`。
 
 ```js
 assert.equal(countCoins(15), 6);
 ```
 
-`countCoins(85)` shouls return `163`.
+`countCoins(85)` 应该返回 `163`。
 
 ```js
 assert.equal(countCoins(85), 163);
 ```
 
-`countCoins(100)` should return `242`.
+`countCoins(100)` 应该返回 `242`。
 
 ```js
 assert.equal(countCoins(100), 242);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/cramers-rule.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/cramers-rule.md
index 7580e28c50e..30f2e025528 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/cramers-rule.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/cramers-rule.md
@@ -1,16 +1,20 @@
 ---
 id: 59713da0a428c1a62d7db430
-title: Cramer's rule
-challengeType: 5
+title: 克莱姆法则
+challengeType: 1
 forumTopicId: 302239
 dashedName: cramers-rule
 ---
 
 # --description--
 
-In [linear algebra](https://en.wikipedia.org/wiki/linear algebra "wp: linear algebra"), [Cramer's rule](https://en.wikipedia.org/wiki/Cramer's rule "wp: Cramer's rule") is an explicit formula for the solution of a [system of linear equations](https://en.wikipedia.org/wiki/system of linear equations "wp: system of linear equations") with as many equations as unknowns, valid whenever the system has a unique solution. It expresses the solution in terms of the determinants of the (square) coefficient matrix and of matrices obtained from it by replacing one column by the vector of right hand sides of the equations.
+<a href="https://rosettacode.org/wiki/Cramer%27s_rule" target="_blank" rel="noopener noreferrer nofollow">Cramer's rule</a> is a formula for solving a system of linear equations by using the determinants of matrices formed from subsets of the coefficients and right hand side values.
 
-Given
+The determinant of a matrix with 2 rows and two columns is given by:
+
+$\begin{aligned}|A|={\begin{vmatrix}a&b\\\c&d\end{vmatrix}}=ad-bc.\end{aligned}$
+
+Given a system of linear equations:
 
 $\\left\\{\\begin{matrix}a_1x + b_1y + c_1z&= {\\color{red}d_1}\\\\a_2x + b_2y + c_2z&= {\\color{red}d_2}\\\\a_3x + b_3y + c_3z&= {\\color{red}d_3}\\end{matrix}\\right.$
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md
index 28aa14710d4..2802c448aaa 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md
@@ -1,14 +1,39 @@
 ---
 id: 5a23c84252665b21eecc7e03
 title: Cumulative standard deviation
-challengeType: 5
+challengeType: 1
 forumTopicId: 302240
 dashedName: cumulative-standard-deviation
 ---
 
 # --description--
 
-Write a function that takes an array of numbers as parameter and returns the [standard deviation](https://en.wikipedia.org/wiki/Standard Deviation) of the series.
+Suppose that the entire population of interest is eight students in a particular class. For a finite set of numbers, the population standard deviation is found by taking the square root of the average of the squared deviations of the values subtracted from their average value. The marks of a class of eight students (that is, a statistical population) are the following eight values:
+
+$2, 4, 4, 4, 5, 5, 7, 9$
+
+These eight data points have the mean (average) of 5:
+
+$$\mu ={\frac {2+4+4+4+5+5+7+9}{8}}={\frac {40}{8}}=5$$
+
+First, calculate the deviations of each data point from the mean, and square the result of each:
+
+| Deviations of each data | Square the result    |
+| ----------------------- | -------------------- |
+| $(2-5)^{2}=(-3)^{2}=9$  | $(5-5)^{2}=0^{2}=0$  |
+| $(4-5)^{2}=(-1)^{2}=1$  | $(5-5)^{2}=0^{2}=0$  |
+| $(4-5)^{2}=(-1)^{2}=1$  | $(7-5)^{2}=2^{2}=4$  |
+| $(4-5)^{2}=(-1)^{2}=1$  | $(9-5)^{2}=4^{2}=16$ |
+
+The variance is the mean of these values:
+
+$$\sigma ^{2}={\frac {9+1+1+1+0+0+4+16}{8}}={\frac {32}{8}}=4$$
+
+and the population standard deviation is equal to the square root of the variance:
+
+$$\sigma ={\sqrt {4}}=2$$
+
+Write a function that takes an array of numbers as parameter and returns the <a href="https://rosettacode.org/wiki/Standard_deviation" target="_blank" rel="noopener noreferrer nofollow">standard deviation</a> of the series.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/cusip.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/cusip.md
index 0daefa32937..b74ce598f4a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/cusip.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/cusip.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7e05
 title: CUSIP
-challengeType: 5
+challengeType: 1
 forumTopicId: 302241
 dashedName: cusip
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/cut-a-rectangle.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/cut-a-rectangle.md
index 74e9412a08a..446e3fddf1f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/cut-a-rectangle.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/cut-a-rectangle.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7e06
 title: Cut a rectangle
-challengeType: 5
+challengeType: 1
 forumTopicId: 302242
 dashedName: cut-a-rectangle
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/date-manipulation.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/date-manipulation.md
index 3412cd12fda..5aa465ceae6 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/date-manipulation.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/date-manipulation.md
@@ -1,14 +1,14 @@
 ---
 id: 5966c21cf732a95f1b67dd28
 title: Date manipulation
-challengeType: 5
+challengeType: 1
 forumTopicId: 302244
 dashedName: date-manipulation
 ---
 
 # --description--
 
-Given a date string in EST, output the given date as a string with 12 hours added to the time. Time zone should be preserved.
+给定 EST 中的日期字符串，将给定的日期输出为在时间上添加 12 小时的字符串。 Time zone should be preserved.
 
 Example input: `"March 6 2009 7:30pm EST"`
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/day-of-the-week.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/day-of-the-week.md
index 0260694251c..e41d1e48dae 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/day-of-the-week.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/day-of-the-week.md
@@ -1,7 +1,7 @@
 ---
 id: 5966f99c45e8976909a85575
 title: Day of the week
-challengeType: 5
+challengeType: 1
 forumTopicId: 302245
 dashedName: day-of-the-week
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md
index f9989155956..b6a78ff636a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md
@@ -1,18 +1,18 @@
 ---
 id: 59694356a6e7011f7f1c5f4e
 title: Deal cards for FreeCell
-challengeType: 5
+challengeType: 1
 forumTopicId: 302246
 dashedName: deal-cards-for-freecell
 ---
 
 # --description--
 
-*FreeCell* is the solitaire card game that Paul Alfille introduced to the PLATO system in 1978. Jim Horne, at Microsoft, changed the name to FreeCell and reimplemented the game for [DOS](https://rosettacode.org/wiki/DOS "DOS"), then [Windows](https://rosettacode.org/wiki/Windows "Windows"). This version introduced 32000 numbered deals.
+*FreeCell* is the solitaire card game that Paul Alfille introduced to the PLATO system in 1978. Jim Horne, at Microsoft, changed the name to FreeCell and reimplemented the game for DOS, then Windows. This version introduced 32000 numbered deals.
 
 As the game became popular, Jim Horne disclosed the algorithm, and other implementations of FreeCell began to reproduce the Microsoft deals. These deals are numbered from 1 to 32000. Newer versions from Microsoft have 1 million deals, numbered from 1 to 1000000; some implementations allow numbers outside that range.
 
-The algorithm uses this [linear congruential generator](https://rosettacode.org/wiki/linear congruential generator "linear congruential generator") from Microsoft C:
+The algorithm uses this linear congruential generator from Microsoft C:
 
 <ul>
   <li>$state_{n + 1} \equiv 214013 \times state_n + 2531011 \pmod{2^{31}}$</li>
@@ -24,7 +24,7 @@ The algorithm follows:
 
 <ol>
   <li>Seed the RNG with the number of the deal.
-  </li><li>Create an <a href='https://rosettacode.org/wiki/array' title='array' target='_blank'>array</a> of 52 cards: Ace of Clubs, Ace of Diamonds, Ace of Hearts, Ace of Spades, 2 of Clubs, 2 of Diamonds, and so on through the ranks: Ace, 2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King. The array indexes are 0 to 51, with Ace of Clubs at 0, and King of Spades at 51.</li>
+  </li><li>Create an array of 52 cards: Ace of Clubs, Ace of Diamonds, Ace of Hearts, Ace of Spades, 2 of Clubs, 2 of Diamonds, and so on through the ranks: Ace, 2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King. The array indexes are 0 to 51, with Ace of Clubs at 0, and King of Spades at 51.</li>
   <li>Until the array is empty:</li>
   <li>Choose a random card at index ≡ next random number (mod array length).</li>
     <ul>
@@ -79,8 +79,6 @@ The algorithm follows:
 
 Write a function to take a deal number and deal cards in the same order as this algorithm. The function must return a two dimensional array representing the FreeCell board.
 
-Deals can also be checked against [FreeCell solutions to 1000000 games](https://freecellgamesolutions.com/). (Summon a video solution, and it displays the initial deal.)
-
 # --hints--
 
 `dealFreeCell` should be a function.
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/deepcopy.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/deepcopy.md
index 24b950d8d55..dc7666cee51 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/deepcopy.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/deepcopy.md
@@ -1,7 +1,7 @@
 ---
 id: 596a8888ab7c01048de257d5
 title: Deepcopy
-challengeType: 5
+challengeType: 1
 forumTopicId: 302247
 dashedName: deepcopy
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/define-a-primitive-data-type.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/define-a-primitive-data-type.md
index 2bc3f2dd1b7..e7909424694 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/define-a-primitive-data-type.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/define-a-primitive-data-type.md
@@ -1,7 +1,7 @@
 ---
 id: 597089c87eec450c68aa1643
 title: Define a primitive data type
-challengeType: 5
+challengeType: 1
 forumTopicId: 302248
 dashedName: define-a-primitive-data-type
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/department-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/department-numbers.md
index 0eba1bec54a..cffc60a8ab3 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/department-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/department-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 59f40b17e79dbf1ab720ed7a
-title: Department Numbers
-challengeType: 5
+title: 部门编号
+challengeType: 1
 forumTopicId: 302249
 dashedName: department-numbers
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/discordian-date.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/discordian-date.md
index 811a3b867ec..bff43ccc37e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/discordian-date.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/discordian-date.md
@@ -1,14 +1,31 @@
 ---
 id: 59f4eafba0343628bb682785
 title: Discordian date
-challengeType: 5
+challengeType: 1
 forumTopicId: 302250
 dashedName: discordian-date
 ---
 
 # --description--
+The Gregorian calendar is a solar calendar with 12 months of 28-31 days each. A week consists of seven days, and there are 52 weeks and 1 day per year. The year consists of 365 days with a leap day added to February every leap year. A leap year occurs every four years, except for the first three centurial years of every 400 years.
 
-Convert a given date from the [Gregorian calendar](https://en.wikipedia.org/wiki/Gregorian calendar "wp: Gregorian calendar") to the [Discordian calendar](https://en.wikipedia.org/wiki/Discordian calendar "wp: Discordian calendar").
+The <a href="http://www.rosettacode.org/wiki/Discordian_date" target="_blank" rel="noopener noreferrer nofollow">Discordian calendar</a> is aligned with the Gregorian calendar, and begins on January 1. The week consists of five days, and there are 73 weeks per year. The year also consists of 365 days, with an extra day inserted between Chaos 59 and Chaos 60 every leap year.
+
+The months, weekdays, Apostle events, and Holidays in the Discordian calendar are given by:
+
+Seasons: `'Chaos', 'Discord', 'Confusion', 'Bureaucracy', 'The Aftermath'`.
+
+Weekdays: `'Sweetmorn', 'Boomtime', 'Pungenday', 'Prickle-Prickle', 'Setting Orange'`.
+
+Apostle: `'Mungday', 'Mojoday', 'Syaday', 'Zaraday', 'Maladay'`.
+
+Holidays: `'Chaoflux', 'Discoflux', 'Confuflux', 'Bureflux', 'Afflux'`.
+
+# --instructions--
+
+Convert a given date from the Gregorian calendar to the Discordian calendar.
+
+Note that the day Chaos 1, 3188 YOLD in the Discordian calendar is the day January 1, 2022 in the Gregorian calendar.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/dot-product.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/dot-product.md
index c1c61d1b124..0e0fb5c838a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/dot-product.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/dot-product.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7e1e
 title: Dot product
-challengeType: 5
+challengeType: 1
 forumTopicId: 302251
 dashedName: dot-product
 ---
 
 # --description--
 
-Create a function, to compute the **[dot product](https://en.wikipedia.org/wiki/Dot product)**, also known as the **scalar product** of two vectors.
+Create a function, to compute the **dot product**, also known as the **scalar product** of two vectors.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/element-wise-operations.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/element-wise-operations.md
index 52a15c8d11d..8f4b6d005a7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/element-wise-operations.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/element-wise-operations.md
@@ -1,7 +1,7 @@
 ---
 id: 599c333915e0ea32d04d4bec
 title: Element-wise operations
-challengeType: 5
+challengeType: 1
 forumTopicId: 302252
 dashedName: element-wise-operations
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/emirp-primes.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/emirp-primes.md
index 564476da7a7..97240396a41 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/emirp-primes.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/emirp-primes.md
@@ -1,7 +1,7 @@
 ---
 id: 599d0ba974141b0f508b37d5
 title: Emirp primes
-challengeType: 5
+challengeType: 1
 forumTopicId: 302253
 dashedName: emirp-primes
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/entropy.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/entropy.md
index 75d61ccc5d9..fa596bd4891 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/entropy.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/entropy.md
@@ -1,7 +1,7 @@
 ---
 id: 599d15309e88c813a40baf58
 title: Entropy
-challengeType: 5
+challengeType: 1
 forumTopicId: 302254
 dashedName: entropy
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/equilibrium-index.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/equilibrium-index.md
index a7a33f9d37a..22a6ffda9a5 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/equilibrium-index.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/equilibrium-index.md
@@ -1,7 +1,7 @@
 ---
 id: 5987fd532b954e0f21b5d3f6
-title: Equilibrium index
-challengeType: 5
+title: 均衡指数
+challengeType: 1
 forumTopicId: 302255
 dashedName: equilibrium-index
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/ethiopian-multiplication.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/ethiopian-multiplication.md
index a6d1c4cb349..a46d599aa1b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/ethiopian-multiplication.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/ethiopian-multiplication.md
@@ -1,7 +1,7 @@
 ---
 id: 599d1566a02b571412643b84
 title: Ethiopian multiplication
-challengeType: 5
+challengeType: 1
 forumTopicId: 302257
 dashedName: ethiopian-multiplication
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/euler-method.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/euler-method.md
index 4a17c09a25d..184c5a06891 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/euler-method.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/euler-method.md
@@ -1,14 +1,14 @@
 ---
 id: 59880443fb36441083c6c20e
 title: Euler method
-challengeType: 5
+challengeType: 1
 forumTopicId: 302258
 dashedName: euler-method
 ---
 
 # --description--
 
-Euler's method numerically approximates solutions of first-order ordinary differential equations (ODEs) with a given initial value. It is an explicit method for solving initial value problems (IVPs), as described in [the wikipedia page](https://en.wikipedia.org/wiki/Euler method "wp: Euler method").
+Euler's method numerically approximates solutions of first-order ordinary differential equations (ODEs) with a given initial value. It is an explicit method for solving initial value problems (IVPs), as described in <a href="https://www.freecodecamp.org/news/eulers-method-explained-with-examples/" title="Euler's Method Explained with Examples" target="_blank" rel="noopener noreferrer nofollow">this article</a>.
 
 The ODE has to be provided in the following form:
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/evaluate-binomial-coefficients.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/evaluate-binomial-coefficients.md
index 5b48751996c..30eeec21ba6 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/evaluate-binomial-coefficients.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/evaluate-binomial-coefficients.md
@@ -1,7 +1,7 @@
 ---
 id: 598de241872ef8353c58a7a2
 title: Evaluate binomial coefficients
-challengeType: 5
+challengeType: 1
 forumTopicId: 302259
 dashedName: evaluate-binomial-coefficients
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md
index cdc024dab4e..112483733bf 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md
@@ -1,146 +1,78 @@
 ---
 id: 59e09e6d412c5939baa02d16
 title: Execute a Markov algorithm
-challengeType: 5
+challengeType: 1
 forumTopicId: 302260
 dashedName: execute-a-markov-algorithm
 ---
 
 # --description--
 
-Create an interpreter for a [Markov Algorithm](https://en.wikipedia.org/wiki/Markov algorithm "wp: Markov algorithm").
+Markov Concepts are used in machine learning, because of its simple approach in data manipulation. With a set number of `rules` you can manipulate given `data` to create a desired `output`.
 
-Rules have the syntax:
+We have added in the background:
 
-<pre>[ruleset] ::= (([comment] | [rule]) [newline]+)*
-[comment] ::= # {[any character]}
-[rule] ::= [pattern] [whitespace] -> [whitespace] [.] [replacement]
-[whitespace] ::= ([tab] | [space]) [[whitespace]]
-</pre>
+The `rules` in the form of nested array, and the `data` in the form of array, too. And the desired `outputs`.
 
-There is one rule per line.
+The `rules`:
 
-If there is a `.` (period) present before the \[replacement], then this is a terminating rule in which case the interpreter must halt execution.
+```js
+let rules=[
+[
+"A -> apple","B -> bag","S -> shop","T -> the",
+"the shop -> my brother","a never used -> .terminating rule"
+],
 
-A ruleset consists of a sequence of rules, with optional comments.
+[
+ "A -> apple","B -> bag","S -> .shop","T -> the",
+ "the shop -> my brother","a never used -> .terminating rule"
+],
 
-Rulesets
+[
+ "A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag",
+ "->.* -> money","W -> WW","S -> .shop","T -> the",
+ "the shop -> my brother","a never used -> .terminating rule"
+],
 
-Use the following tests on entries:
+[
+ "_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX",
+ "X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y",
+ "1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "
+],
 
-**Ruleset 1:**
+[
+"A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11",
+"B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"
+]
 
-<pre># This rules file is extracted from Wikipedia:
-# <code>http://en.wikipedia.org/wiki/Markov_Algorithm</code>
-A -> apple
-B -> bag
-S -> shop
-T -> the
-the shop -> my brother
-a never used -> .terminating rule
-</pre>
+];
+```
 
-Sample text of `I bought a B of As from T S.` should generate the output `I bought a bag of apples from my brother.`
+The `data`:
 
-**Ruleset 2:**
+```js
+let data=[
+        "I bought a B of As from T S.",
+        "I bought a B of As from T S.",
+        "I bought a B of As W my Bgage from T S.",
+        "_1111*11111_",
+        "000000A000000"
+        ];
+```
 
-A test of the terminating rule
+The `outputs`:
 
-<pre># Slightly modified from the rules on Wikipedia
-A -> apple
-B -> bag
-S -> .shop
-T -> the
-the shop -> my brother
-a never used -> .terminating rule
-</pre>
+```js
+let outputs=[
+    "I bought a bag of apples from my brother.",
+    "I bought a bag of apples from T shop.",
+    "I bought a bag of apples with my money from T shop.",
+    "11111111111111111111",
+    "00011H1111000"
+    ]
+```
 
-Sample text of `I bought a B of As from T S.` should generate `I bought a bag of apples from T shop.`
-
-**Ruleset 3:**
-
-This tests for correct substitution order and may trap simple regexp based replacement routines if special regexp characters are not escaped.
-
-<pre># BNF Syntax testing rules
-A -> apple
-WWWW -> with
-Bgage -> ->.*
-B -> bag
-->.* -> money
-W -> WW
-S -> .shop
-T -> the
-the shop -> my brother
-a never used -> .terminating rule
-</pre>
-
-Sample text of `I bought a B of As W my Bgage from T S.` should generate `I bought a bag of apples with my money from T shop.`
-
-**Ruleset 4:**
-
-This tests for correct order of scanning of rules, and may trap replacement routines that scan in the wrong order. It implements a general unary multiplication engine. (Note that the input expression must be placed within underscores in this implementation.)
-
-<pre>### Unary Multiplication Engine, for testing Markov Algorithm implementations
-### By Donal Fellows.
-# Unary addition engine
-_+1 -> _1+
-1+1 -> 11+
-# Pass for converting from the splitting of multiplication into ordinary
-# addition
-1! -> !1
-,! -> !+
-_! -> _
-# Unary multiplication by duplicating left side, right side times
-1*1 -> x,@y
-1x -> xX
-X, -> 1,1
-X1 -> 1X
-_x -> _X
-,x -> ,X
-y1 -> 1y
-y_ -> _
-# Next phase of applying
-1@1 -> x,@y
-1@_ -> @_
-,@_ -> !_
-++ -> +
-# Termination cleanup for addition
-_1 -> 1
-1+_ -> 1
-_+_ ->
-</pre>
-
-Sample text of `_1111*11111_` should generate the output `11111111111111111111`
-
-**Ruleset 5:**
-
-A simple [Turing machine](http://en.wikipedia.org/wiki/Turing_machine "link: http&#x3A;//en.wikipedia.org/wiki/Turing_machine"), implementing a three-state [busy beaver](http://en.wikipedia.org/wiki/Busy_beaver "link: http&#x3A;//en.wikipedia.org/wiki/Busy_beaver").
-
-The tape consists of `0`s and `1`s, the states are `A`, `B`, `C` and `H` (for `H`alt), and the head position is indicated by writing the state letter before the character where the head is. All parts of the initial tape the machine operates on have to be given in the input.
-
-Besides demonstrating that the Markov algorithm is Turing-complete, it also made me catch a bug in the C++ implementation which wasn't caught by the first four rulesets.
-
-<pre># Turing machine: three-state busy beaver
-#
-# state A, symbol 0 => write 1, move right, new state B
-A0 -> 1B
-# state A, symbol 1 => write 1, move left, new state C
-0A1 -> C01
-1A1 -> C11
-# state B, symbol 0 => write 1, move left, new state A
-0B0 -> A01
-1B0 -> A11
-# state B, symbol 1 => write 1, move right, new state B
-B1 -> 1B
-# state C, symbol 0 => write 1, move left, new state B
-0C0 -> B01
-1C0 -> B11
-# state C, symbol 1 => write 1, move left, halt
-0C1 -> H01
-1C1 -> H11
-</pre>
-
-This ruleset should turn `000000A000000` into `00011H1111000`
+Using Markov Algorithm, change the `data` into the desired `outputs` using the `rules` provided for you.
 
 # --hints--
 
@@ -150,34 +82,34 @@ This ruleset should turn `000000A000000` into `00011H1111000`
 assert(typeof markov === 'function');
 ```
 
-`markov(["A -> apple","B -> bag","S -> shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` should return "I bought a bag of apples from my brother.".
+`markov(["A -> apple","B -> bag","S -> shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` should return the string `I bought a bag of apples from my brother.`.
 
 ```js
-assert.deepEqual(markov(rules[0], tests[0]), outputs[0]);
+assert.deepEqual(markov(rules[0], datas[0]), outputs[0]);
 ```
 
-`markov(["A -> apple","B -> bag","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` should return "I bought a bag of apples from T shop.".
+`markov(["A -> apple","B -> bag","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` should return the string `I bought a bag of apples from T shop.`.
 
 ```js
-assert.deepEqual(markov(rules[1], tests[1]), outputs[1]);
+assert.deepEqual(markov(rules[1], datas[1]), outputs[1]);
 ```
 
-`markov(["A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag","->.* -> money","W -> WW","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As W my Bgage from T S.")` should return "I bought a bag of apples with my money from T shop.".
+`markov(["A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag","->.* -> money","W -> WW","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As W my Bgage from T S.")` should return the string `I bought a bag of apples with my money from T shop.`.
 
 ```js
-assert.deepEqual(markov(rules[2], tests[2]), outputs[2]);
+assert.deepEqual(markov(rules[2], datas[2]), outputs[2]);
 ```
 
-`markov(["_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX","X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y","1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "],"_1111*11111_")` should return "11111111111111111111".
+`markov(["_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX","X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y","1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "],"_1111*11111_")` should return the string `11111111111111111111`.
 
 ```js
-assert.deepEqual(markov(rules[3], tests[3]), outputs[3]);
+assert.deepEqual(markov(rules[3], datas[3]), outputs[3]);
 ```
 
-`markov(["A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11","B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"],"")` should return "00011H1111000".
+`markov(["A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11","B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"],"")` should return the string `00011H1111000`.
 
 ```js
-assert.deepEqual(markov(rules[4], tests[4]), outputs[4]);
+assert.deepEqual(markov(rules[4], datas[4]), outputs[4]);
 ```
 
 # --seed--
@@ -191,7 +123,7 @@ let rules=[["A -> apple","B -> bag","S -> shop","T -> the","the shop -> my broth
             ["A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag","->.* -> money","W -> WW","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],
             ["_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX","X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y","1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "],
             ["A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11","B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"]];
-let tests=["I bought a B of As from T S.",
+let datas=["I bought a B of As from T S.",
             "I bought a B of As from T S.",
             "I bought a B of As W my Bgage from T S.",
             "_1111*11111_",
@@ -208,7 +140,7 @@ let outputs=["I bought a bag of apples from my brother.",
 ## --seed-contents--
 
 ```js
-function markov(rules,test) {
+function markov(rules,data) {
 
 }
 ```
@@ -216,9 +148,9 @@ function markov(rules,test) {
 # --solutions--
 
 ```js
-function markov(rules,test) {
+function markov(rules,data) {
     let pattern = new RegExp("^([^#]*?)\\s+->\\s+(\\.?)(.*)");
-    let origTest = test;
+    let origData = data;
 
     let captures = [];
 
@@ -229,18 +161,18 @@ function markov(rules,test) {
         captures.push(m);
     });
 
-    test = origTest;
-    let copy = test;
+    data = origData;
+    let copy = data;
     for (let j = 0; j < captures.length; j++) {
         let c = captures[j];
-        test = test.replace(c[0], c[2]);
+        data = data.replace(c[0], c[2]);
         if (c[1]==".")
             break;
-        if (test!=copy) {
+        if (data!=copy) {
             j = -1;
-            copy = test;
+            copy = data;
         }
     }
-    return test;
+    return data;
 }
 ```
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/execute-brain.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/execute-brain.md
index 7504589e582..468f57b6117 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/execute-brain.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/execute-brain.md
@@ -1,7 +1,7 @@
 ---
 id: 59e0a8df964e4540d5abe599
-title: Execute Brain****
-challengeType: 5
+title: 执行脑 ****
+challengeType: 1
 forumTopicId: 302261
 dashedName: execute-brain
 ---
@@ -10,21 +10,21 @@ dashedName: execute-brain
 
 Write a function to implement a Brain\*\*\*\* interpreter. The function will take a string as a parameter and should return a string as the output. More details are given below:
 
-RCBF is a set of [Brainf\*\*\*](https://rosettacode.org/wiki/Brainf*** "Brainf\*\*\*") compilers and interpreters written for Rosetta Code in a variety of languages.
+RCBF is a set of <a href="https://rosettacode.org/wiki/Brainf***" target="_blank" rel="noopener noreferrer nofollow">Brainf\*\*\*</a> compilers and interpreters written for Rosetta Code in a variety of languages.
 
 Below are links to each of the versions of RCBF.
 
 An implementation need only properly implement the following instructions:
 
-| Command                   | Description                                                                                |
-| ------------------------- | ------------------------------------------------------------------------------------------ |
-| <code>></code> | Move the pointer to the right                                                              |
-| <code>&lt;</code> | Move the pointer to the left                                                               |
-| <code>+</code> | Increment the memory cell under the pointer                                                |
-| <code>-</code> | Decrement the memory cell under the pointer                                                |
-| <code>.</code> | Output the character signified by the cell at the pointer                                  |
-| <code>,</code> | Input a character and store it in the cell at the pointer                                  |
-| <code>\[</code> | Jump past the matching <code>]</code> if the cell under the pointer is 0          |
+| Command                   | 描述                                                                                          |
+| ------------------------- | ------------------------------------------------------------------------------------------- |
+| <code>></code> | Move the pointer to the right                                                               |
+| <code>&lt;</code> | Move the pointer to the left                                                                |
+| <code>+</code> | Increment the memory cell under the pointer                                                 |
+| <code>-</code> | Decrement the memory cell under the pointer                                                 |
+| <code>.</code> | Output the character signified by the cell at the pointer                                   |
+| <code>,</code> | Input a character and store it in the cell at the pointer                                   |
+| <code>\[</code> | Jump past the matching <code>]</code> if the cell under the pointer is 0           |
 | <code>]</code> | Jump back to the matching <code>\[</code> if the cell under the pointer is nonzero |
 
 Any cell size is allowed, EOF (*E*nd-*O*-*F*ile) support is optional, as is whether you have bounded or unbounded memory.
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/extensible-prime-generator.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/extensible-prime-generator.md
index 620da453ffe..cb9eb69faeb 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/extensible-prime-generator.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/extensible-prime-generator.md
@@ -1,14 +1,14 @@
 ---
 id: 598ee8b91b410510ae82efef
 title: Extensible prime generator
-challengeType: 5
+challengeType: 1
 forumTopicId: 302262
 dashedName: extensible-prime-generator
 ---
 
 # --description--
 
-Write a generator of prime numbers, in order, that will automatically adjust to accommodate the generation of any reasonably high prime.
+按顺序编写一个素数生成器，它会自动调整以适应任何合理的高素数的生成。
 
 The generator should be able to:
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/factorial.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/factorial.md
index f58bdffe25e..55b8b7f23d4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/factorial.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/factorial.md
@@ -1,7 +1,7 @@
 ---
 id: 597b2b2a2702b44414742771
-title: Factorial
-challengeType: 5
+title: 阶乘
+challengeType: 1
 forumTopicId: 302263
 dashedName: factorial
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
index 0e5a414555c..31facecd931 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
@@ -1,7 +1,7 @@
 ---
 id: 598eea87e5cf4b116c3ff81a
-title: Factors of a Mersenne number
-challengeType: 5
+title: 梅森数的因数
+challengeType: 1
 forumTopicId: 302264
 dashedName: factors-of-a-mersenne-number
 ---
@@ -12,7 +12,7 @@ A Mersenne number is a number in the form of <code>2<sup>P</sup>-1</code>.
 
 If `P` is prime, the Mersenne number may be a Mersenne prime. (If `P` is not prime, the Mersenne number is also not prime.)
 
-In the search for Mersenne prime numbers it is advantageous to eliminate exponents by finding a small factor before starting a, potentially lengthy, [Lucas-Lehmer test](https://rosettacode.org/wiki/Lucas-Lehmer test "Lucas-Lehmer test").
+In the search for Mersenne prime numbers it is advantageous to eliminate exponents by finding a small factor before starting a, potentially lengthy, <a href="https://rosettacode.org/wiki/Lucas-Lehmer test" target="_blank" rel="noopener noreferrer nofollow">Lucas-Lehmer test</a>.
 
 There are very efficient algorithms for determining if a number divides <code>2<sup>P</sup>-1</code> (or equivalently, if <code>2<sup>P</sup> mod (the number) = 1</code>).
 
@@ -22,7 +22,7 @@ The following is how to implement this modPow yourself:
 
 For example, let's compute <code>2<sup>23</sup> mod 47</code>.
 
-Convert the exponent 23 to binary, you get 10111. Starting with <code><tt>square</tt> = 1</code>, repeatedly square it.
+将指数 23 转换为二进制，得到 10111。 Starting with <code><tt>square</tt> = 1</code>, repeatedly square it.
 
 Remove the top bit of the exponent, and if it's 1 multiply `square` by the base of the exponentiation (2), then compute <code><tt>square</tt> modulo 47</code>.
 
@@ -48,7 +48,7 @@ Further properties of Mersenne numbers allow us to refine the process even more.
 
 Any factor `q` of <code>2<sup>P</sup>-1</code> must be of the form `2kP+1`, `k` being a positive integer or zero. Furthermore, `q` must be `1` or `7 mod 8`.
 
-Finally any potential factor `q` must be [prime](https://rosettacode.org/wiki/Primality by Trial Division "Primality by Trial Division").
+Finally any potential factor `q` must be <a href="https://rosettacode.org/wiki/Primality_by_trial_division" target="_blank" rel="noopener noreferrer nofollow">prime</a>.
 
 As in other trial division algorithms, the algorithm stops when `2kP+1 > sqrt(N)`.These primarily tests only work on Mersenne numbers where `P` is prime. For example, <code>M<sub>4</sub>=15</code> yields no factors using these techniques, but factors into 3 and 5, neither of which fit `2kP+1`.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/factors-of-an-integer.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/factors-of-an-integer.md
index 31d9b722b7f..8de06b3c4f0 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/factors-of-an-integer.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/factors-of-an-integer.md
@@ -1,7 +1,7 @@
 ---
 id: 597f1e7fbc206f0e9ba95dc4
 title: Factors of an integer
-challengeType: 5
+challengeType: 1
 forumTopicId: 302265
 dashedName: factors-of-an-integer
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/farey-sequence.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/farey-sequence.md
index 59b4edc9a54..f549221deb3 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/farey-sequence.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/farey-sequence.md
@@ -1,14 +1,14 @@
 ---
 id: 59c3ec9f15068017c96eb8a3
 title: Farey sequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 302266
 dashedName: farey-sequence
 ---
 
 # --description--
 
-The [Farey sequence](https://en.wikipedia.org/wiki/Farey sequence "wp: Farey sequence") <code>F<sub>n</sub></code> of order `n` is the sequence of completely reduced fractions between `0` and `1` which, when in lowest terms, have denominators less than or equal to `n`, arranged in order of increasing size.
+The Farey sequence <code>F<sub>n</sub></code> of order `n` is the sequence of completely reduced fractions between `0` and `1` which, when in lowest terms, have denominators less than or equal to `n`, arranged in order of increasing size.
 
 The *Farey sequence* is sometimes incorrectly called a *Farey series*.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md
index 456b87de792..540c7372b1e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md
@@ -1,14 +1,14 @@
 ---
 id: 598eef80ba501f1268170e1e
 title: Fibonacci n-step number sequences
-challengeType: 5
+challengeType: 1
 forumTopicId: 302267
 dashedName: fibonacci-n-step-number-sequences
 ---
 
 # --description--
 
-These number series are an expansion of the ordinary [Fibonacci sequence](https://rosettacode.org/wiki/Fibonacci sequence "Fibonacci sequence") where:
+These number series are an expansion of the ordinary Fibonacci sequence where:
 
 <ol>
   <li>For $n = 2$ we have the Fibonacci sequence; with initial values $[1, 1]$ and $F_k^2 = F_{k-1}^2 + F_{k-2}^2$</li>
@@ -17,7 +17,7 @@ These number series are an expansion of the ordinary [Fibonacci sequence](https:
   <li>For general $n>2$ we have the Fibonacci $n$-step sequence - $F_k^n$; with initial values of the first $n$ values of the $(n-1)$'th Fibonacci $n$-step sequence $F_k^{n-1}$; and $k$'th value of this $n$'th sequence being $F_k^n = \sum_{i=1}^{(n)} {F_{k-i}^{(n)}}$</li>
 </ol>
 
-For small values of $n$, [Greek numeric prefixes](https://en.wikipedia.org/wiki/Number prefix#Greek_series "wp: Number prefix#Greek_series") are sometimes used to individually name each series.
+For small values of $n$, Greek numeric prefixes are sometimes used to individually name each series.
 
 Fibonacci $n$-step sequences:
 
@@ -33,7 +33,7 @@ Fibonacci $n$-step sequences:
 | 9   | nonanacci   | 1 1 2 4 8 16 32 64 128 256 511 1021 2040 4076 8144 ... |
 | 10  | decanacci   | 1 1 2 4 8 16 32 64 128 256 512 1023 2045 4088 8172 ... |
 
-Allied sequences can be generated where the initial values are changed: The [Lucas series](https://en.wikipedia.org/wiki/Lucas number "wp: Lucas number") sums the two preceding values like the fibonacci series for $n=2$ but uses $\[2, 1]$ as its initial values.
+Allied sequences can be generated where the initial values are changed: The Lucas series sums the two preceding values like the fibonacci series for $n=2$ but uses $\[2, 1]$ as its initial values.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/fibonacci-sequence.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/fibonacci-sequence.md
index 2cce69c1856..4e60775b086 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/fibonacci-sequence.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/fibonacci-sequence.md
@@ -1,7 +1,7 @@
 ---
 id: 597f24c1dda4e70f53c79c81
 title: Fibonacci sequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 302268
 dashedName: fibonacci-sequence
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/fibonacci-word.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/fibonacci-word.md
index 708f743add3..464f03b61b7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/fibonacci-word.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/fibonacci-word.md
@@ -1,14 +1,14 @@
 ---
 id: 5992e222d397f00d21122931
 title: Fibonacci word
-challengeType: 5
+challengeType: 1
 forumTopicId: 302269
 dashedName: fibonacci-word
 ---
 
 # --description--
 
-The Fibonacci Word may be created in a manner analogous to the Fibonacci Sequence [as described here](https://hal.archives-ouvertes.fr/docs/00/36/79/72/PDF/The_Fibonacci_word_fractal.pdf):
+The Fibonacci Word Sequence may be created in a manner analogous to the Fibonacci Sequence, but it focuses on iterating concatenation.
 
 <pre>Define  F_Word<sub>1</sub>  as  <strong>1</strong>
 Define  F_Word<sub>2</sub>  as  <strong>0</strong>
@@ -16,9 +16,11 @@ Form   F_Word<sub>3</sub>  as  F_Word<sub>2</sub>   concatenated with  F_Word<su
 Form   F_Word<sub>n</sub>  as  F_Word<sub>n-1</sub>  concatenated with  F_word<sub>n-2</sub>
 </pre>
 
+Entropy calculation is required in this challenge, <a href="https://www.freecodecamp.org/learn/coding-interview-prep/rosetta-code/entropy" target="_blank" rel="noopener noreferrer nofollow">as shown in this Rosetta Code challenge</a>
+
 # --instructions--
 
-Write a function to return the Fibonacci Words up to `n`. `n` will be provided as a parameter to the function. The function should return an array of objects. The objects should be of the form: `{ N: 1, Length: 1, Entropy: 0, Word: '1' }`.
+Write a function to return the first `n` Fibonacci Words. The number of `n` is provided as a parameter to the function. The function should return an array of objects. The objects should be of the form: `{ N: 1, Length: 1, Entropy: 0, Word: '1' }`. `Entropy` is computed for the string `Word` and rounded to 8 decimal digits of accuracy. Note that the indices of this sequence start at `1`.
 
 # --hints--
 
@@ -34,10 +36,16 @@ assert(typeof fibWord === 'function');
 assert(Array.isArray(fibWord(5)));
 ```
 
-`fibWord(5)` should return `[{ N:1, Length:1, Entropy:0, Word:"1" },{ N:2, Length:1, Entropy:0, Word:"0" },{ N:3, Length:2, Entropy:1, Word:"01" },{ N:4, Length:3, Entropy:0.9182958340544896, Word:"010" },{ N:5, Length:5, Entropy:0.9709505944546688, Word:"01001" }]`.
+`fibWord(5)` should return `[{ N:1, Length:1, Entropy:0, Word:"1" },{ N:2, Length:1, Entropy:0, Word:"0" },{ N:3, Length:2, Entropy:1, Word:"01" },{ N:4, Length:3, Entropy:0.91829583, Word:"010" },{ N:5, Length:5, Entropy:0.97095059, Word:"01001" }]`.
 
 ```js
-assert.deepEqual(fibWord(5), ans);
+assert.deepEqual(fibWord(5), words5);
+```
+
+`fibWord(7)` should return `[{ N:1, Length:1, Entropy:0, Word:"1" },{ N:2, Length:1, Entropy:0, Word:"0" },{ N:3, Length:2, Entropy:1, Word:"01" },{ N:4, Length:3, Entropy:0.91829583, Word:"010" },{ N:5, Length:5, Entropy:0.97095059, Word:"01001" }, { N:6, Length:8, Entropy:0.954434, Word:'01001010' }, { N:7, Length:13, Entropy:0.9612366, Word:'0100101001001' }]`.
+
+```js
+assert.deepEqual(fibWord(7), words7);
 ```
 
 # --seed--
@@ -45,15 +53,23 @@ assert.deepEqual(fibWord(5), ans);
 ## --after-user-code--
 
 ```js
-let ans=[ { N: 1, Length: 1, Entropy: 0, Word: '1' },
-
+const words5 = [
+  { N: 1, Length: 1, Entropy: 0, Word: '1' },
   { N: 2, Length: 1, Entropy: 0, Word: '0' },
-
   { N: 3, Length: 2, Entropy: 1, Word: '01' },
+  { N: 4, Length: 3, Entropy: 0.91829583, Word: '010' },
+  { N: 5, Length: 5, Entropy: 0.97095059, Word: '01001' }
+];
 
-  { N: 4, Length: 3, Entropy: 0.9182958340544896, Word: '010' },
-
-  { N: 5, Length: 5, Entropy: 0.9709505944546688, Word: '01001' }];
+const words7 = [
+  { N: 1, Length: 1, Entropy: 0, Word: '1' },
+  { N: 2, Length: 1, Entropy: 0, Word: '0' },
+  { N: 3, Length: 2, Entropy: 1, Word: '01' },
+  { N: 4, Length: 3, Entropy: 0.91829583, Word: '010' },
+  { N: 5, Length: 5, Entropy: 0.97095059, Word: '01001' },
+  { N: 6, Length: 8, Entropy: 0.954434, Word: '01001010' },
+  { N: 7, Length: 13, Entropy: 0.9612366, Word: '0100101001001' }
+];
 ```
 
 ## --seed-contents--
@@ -67,55 +83,33 @@ function fibWord(n) {
 # --solutions--
 
 ```js
+// Round to digits
+function roundFloat(num, digits) {
+  return Math.round(num * 10.0**digits) / (10.0**digits);
+}
+
+// Entropy calculation for string with only 0 and 1
+function entropy(word) {
+  function digitEntropy(count) {
+    return count < 1 ? 0
+      : - count / word.length * Math.log2(count / word.length);
+  }
+  const numZeros = word.split('').filter(e => e === '0').length;
+  const numOnes  = word.length - numZeros;
+  return roundFloat(digitEntropy(numZeros) + digitEntropy(numOnes), 8);
+}
+
+// Compute array of Fibonacci words
 function fibWord(n) {
-    function entropy(s) {
-         //create an object containing each individual char
-      //and the amount of iterations per char
-        function prob(s) {
-            var h = Object.create(null);
-            s.split('').forEach(function(c) {
-               h[c] && h[c]++ || (h[c] = 1);
-            });
-            return h;
-        }
-
-        s = s.toString(); //just in case
-        var e = 0, l = s.length, h = prob(s);
-
-        for (var i in h ) {
-            var p = h[i]/l;
-            e -= p * Math.log(p) / Math.log(2);
-        }
-        return e;
-    }
-    var wOne = "1", wTwo = "0", wNth = [wOne, wTwo], w = "", o = [];
-
-    for (var i = 0; i < n; i++) {
-        if (i === 0 || i === 1) {
-            w = wNth[i];
-        } else {
-            w = wNth[i - 1] + wNth[i - 2];
-            wNth.push(w);
-        }
-        var l = w.length;
-        var e = entropy(w);
-
-        if (l <= 21) {
-            o.push({
-                N: i + 1,
-                Length: l,
-                Entropy: e,
-                Word: w
-            });
-        } else {
-            o.push({
-                N: i + 1,
-                Length: l,
-                Entropy: e,
-                Word: "..."
-            });
-        }
-    }
-  return o;
+  return [...Array(n).keys()]
+    .reduce((words, i) => {
+      const word = i === 0 ? "1"
+                 : i === 1 ? "0"
+                 : words[i - 1].Word + words[i - 2].Word;
+      words.push(
+        { N: i + 1, Length: word.length, Entropy: entropy(word), Word: word }
+      );
+      return words;
+    }, []);
 }
 ```
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/fizzbuzz.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/fizzbuzz.md
index 9839933b099..400625c512e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/fizzbuzz.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/fizzbuzz.md
@@ -1,7 +1,7 @@
 ---
 id: 5e9ddb06ec35240f39657419
 title: FizzBuzz
-challengeType: 5
+challengeType: 1
 forumTopicId: 385370
 dashedName: fizzbuzz
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/fractran.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/fractran.md
index 0bcda09bdec..4e3daccf125 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/fractran.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/fractran.md
@@ -1,14 +1,14 @@
 ---
 id: 5a7dad05be01840e1778a0d1
 title: Fractran
-challengeType: 5
+challengeType: 1
 forumTopicId: 302270
 dashedName: fractran
 ---
 
 # --description--
 
-[FRACTRAN](https://en.wikipedia.org/wiki/FRACTRAN "wp: FRACTRAN") is a Turing-complete esoteric programming language invented by the mathematician [John Horton Conway](https://en.wikipedia.org/wiki/John Horton Conway "wp: John Horton Conway").
+FRACTRAN is a Turing-complete esoteric programming language invented by the mathematician John Horton Conway.
 
 A FRACTRAN program is an ordered list of positive fractions $P = (f_1, f_2, \\ldots, f_m)$, together with an initial positive integer input $n$.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/gamma-function.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/gamma-function.md
index f105a0a1bd5..91b6b01786a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/gamma-function.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/gamma-function.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7e76
 title: Gamma function
-challengeType: 5
+challengeType: 1
 forumTopicId: 302271
 dashedName: gamma-function
 ---
 
 # --description--
 
-Implement one algorithm (or more) to compute the [Gamma](https://en.wikipedia.org/wiki/Gamma function) ($\\Gamma$) function (in the real field only).
+Implement one algorithm (or more) to compute the Gamma function (in the real field only).
 
 The Gamma function can be defined as:
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/gaussian-elimination.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/gaussian-elimination.md
index 2e5adf4bd9e..53b7860f1fc 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/gaussian-elimination.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/gaussian-elimination.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7e77
 title: Gaussian elimination
-challengeType: 5
+challengeType: 1
 forumTopicId: 302272
 dashedName: gaussian-elimination
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md
index 4af8e94f0e3..168406d9457 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7e78
 title: General FizzBuzz
-challengeType: 5
+challengeType: 1
 forumTopicId: 302273
 dashedName: general-fizzbuzz
 ---
 
 # --description--
 
-Write a generalized version of [FizzBuzz](https://rosettacode.org/wiki/FizzBuzz) that works for any list of factors, along with their words.
+Write a generalized version of <a href="https://rosettacode.org/wiki/FizzBuzz" target="_blank" rel="noopener noreferrer nofollow">FizzBuzz</a> that works for any list of factors, along with their words.
 
 This is basically a "fizzbuzz" implementation where the rules of the game are supplied to the user. Create a function to implement this. The function should take two parameters.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.md
index 5f643c3a38b..eb31c80170b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7e7a
 title: Generate lower case ASCII alphabet
-challengeType: 5
+challengeType: 1
 forumTopicId: 302274
 dashedName: generate-lower-case-ascii-alphabet
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/generator-exponential.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/generator-exponential.md
index f888e8dff04..6b15a7ca62e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/generator-exponential.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/generator-exponential.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7e7b
 title: Generator/Exponential
-challengeType: 5
+challengeType: 1
 forumTopicId: 302275
 dashedName: generatorexponential
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/gray-code.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/gray-code.md
index f46350f0be6..ba0f2ad1234 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/gray-code.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/gray-code.md
@@ -1,24 +1,24 @@
 ---
 id: 5a23c84252665b21eecc7e80
 title: Gray code
-challengeType: 5
+challengeType: 1
 forumTopicId: 302276
 dashedName: gray-code
 ---
 
 # --description--
 
-[Gray code](https://en.wikipedia.org/wiki/Gray code) is a form of binary encoding where transitions between consecutive numbers differ by only one bit.
+Gray code is a form of binary encoding where transitions between consecutive numbers differ by only one bit.
 
 This is a useful encoding for reducing hardware data hazards with values that change rapidly and/or connect to slower hardware as inputs.
 
-It is also useful for generating inputs for [Karnaugh maps](https://en.wikipedia.org/wiki/Karnaugh map) in order from left to right or top to bottom.
+It is also useful for generating inputs for Karnaugh maps in order from left to right or top to bottom.
 
 # --instructions--
 
 Create a function to encode a number to and decode a number from Gray code. The function should will have 2 parameters.
 
-The first would be a boolean. The function should encode for true and decode for false. The second parameter would be the number to be encoded/decoded.
+第一个是布尔值。 该函数应编码为 true，解码为 false。 第二个参数是要编码/解码的数字。
 
 Display the normal binary representations, Gray code representations, and decoded Gray code values for all 5-bit binary numbers (0-31 inclusive, leading 0's not necessary).
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md
index 60b96750188..8e960936bb6 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7e82
 title: Greatest common divisor
-challengeType: 5
+challengeType: 1
 forumTopicId: 302277
 dashedName: greatest-common-divisor
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.md
index 4a90c111fe2..6b8eebaf0e8 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7e84
 title: Greatest subsequential sum
-challengeType: 5
+challengeType: 1
 forumTopicId: 302278
 dashedName: greatest-subsequential-sum
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/hailstone-sequence.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/hailstone-sequence.md
index 37768d8cd36..2c688341cdd 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/hailstone-sequence.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/hailstone-sequence.md
@@ -1,14 +1,14 @@
 ---
 id: 595608ff8bcd7a50bd490181
 title: Hailstone sequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 302279
 dashedName: hailstone-sequence
 ---
 
 # --description--
 
-The Hailstone sequence of numbers can be generated from a starting positive integer, `n` by:
+Hailstone 数字序列可以从一个起始正整数 `n` 生成：
 
 - If `n` is `1` then the sequence ends
 - If `n` is `even` then the next `n` of the sequence `= n/2`
@@ -25,7 +25,7 @@ The hailstone sequence is also known as hailstone numbers (because the values ar
 
 # --hints--
 
-`hailstoneSequence` should be a function.
+`hailstoneSequence` 应该是一个函数。
 
 ```js
 assert(typeof hailstoneSequence === 'function');
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/happy-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/happy-numbers.md
index 6cb33dbcaf6..43ab0ef8989 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/happy-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/happy-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 594810f028c0303b75339ad1
 title: Happy numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 302280
 dashedName: happy-numbers
 ---
 
 # --description--
 
-A [happy number](https://en.wikipedia.org/wiki/Happy_number) is defined by the following process:
+A happy number is defined by the following process:
 
 Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals `1` (where it will stay), or it loops endlessly in a cycle which does not include `1`. Those numbers for which this process ends in `1` are happy numbers, while those that do not end in `1` are unhappy numbers.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.md
index 400e9513344..ff626d6671d 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.md
@@ -1,7 +1,7 @@
 ---
 id: 595668ca4cfe1af2fb9818d4
 title: Harshad or Niven series
-challengeType: 5
+challengeType: 1
 forumTopicId: 302281
 dashedName: harshad-or-niven-series
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
index d5a9a396bb9..75facd682ab 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
@@ -1,20 +1,24 @@
 ---
 id: 595671d4d2cdc305f0d5b36f
 title: Hash from two arrays
-challengeType: 5
+challengeType: 1
 forumTopicId: 302283
 dashedName: hash-from-two-arrays
 ---
 
 # --description--
 
-Using two Arrays of equal length, create a Hash object where the elements from one array (the keys) are linked to the elements of the other (the values).
+Given two arrays, create a hash object where the elements from one array (the keys) are linked to the elements of the other (the values).
 
-**Related task:**
+Example:
 
-<ul>
-  <li><a href='https://rosettacode.org/wiki/Associative arrays/Creation' title='Associative arrays/Creation' target='_blank'>Associative arrays/Creation</a></li>
-</ul>
+```js
+const firstArr = [1, 2, 3];
+const secondArr = ["a", "b", "c"];
+const hashObj = arrToObj(firstArr, secondArr);
+```
+
+The hash object created from the arrays above will be `{1: "a", 2: "b", 3: "c"}`.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/hash-join.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/hash-join.md
index 7dc6b729cb6..a334f630cbc 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/hash-join.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/hash-join.md
@@ -1,19 +1,19 @@
 ---
 id: 5956795bc9e2c415eb244de1
 title: Hash join
-challengeType: 5
+challengeType: 1
 forumTopicId: 302284
 dashedName: hash-join
 ---
 
 # --description--
 
-An [inner join](https://en.wikipedia.org/wiki/Join_(SQL)#Inner_join "wp: Join\_(SQL)#Inner_join") is an operation that combines two data tables into one table, based on matching column values. The simplest way of implementing this operation is the [nested loop join](https://en.wikipedia.org/wiki/Nested loop join "wp: Nested loop join") algorithm, but a more scalable alternative is the [hash join](https://en.wikipedia.org/wiki/hash join "wp: hash join") algorithm.
+An inner join is an operation that combines two data tables into one table, based on matching column values. The simplest way of implementing this operation is the nested loop join algorithm, but a more scalable alternative is the hash join algorithm.
 
-The "hash join" algorithm consists of two steps:
+“哈希连接”算法包括两个步骤：
 
 <ol>
-  <li><strong>Hash phase:</strong> Create a <a href='https://en.wikipedia.org/wiki/Multimap' title='wp: Multimap' target='_blank'>multimap</a> from one of the two tables, mapping from each join column value to all the rows that contain it.</li>
+  <li><strong>Hash phase:</strong> Create a multimap from one of the two tables, mapping from each join column value to all the rows that contain it.</li>
   <ul>
     <li>The multimap must support hash-based lookup which scales better than a simple linear search, because that's the whole point of this algorithm.</li>
     <li>Ideally we should create the multimap for the smaller table, thus minimizing its creation time and memory size.</li>
@@ -41,7 +41,7 @@ In pseudo-code, the algorithm could be expressed as follows:
 
 Implement the "hash join" algorithm as a function and demonstrate that it passes the test-case listed below. The function should accept two arrays of objects and return an array of combined objects.
 
-**Input**
+**输入**
 
 <table>
   <tr>
@@ -127,7 +127,7 @@ Implement the "hash join" algorithm as a function and demonstrate that it passes
   </tr>
 </table>
 
-**Output**
+**输出**
 
 | A_age | A_name | B_character | B_nemesis |
 | ----- | ------ | ----------- | --------- |
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/heronian-triangles.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/heronian-triangles.md
index 2162dc57eb4..35c83855e3c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/heronian-triangles.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/heronian-triangles.md
@@ -1,14 +1,14 @@
 ---
 id: 595b98f8b5a2245e243aa831
 title: Heronian triangles
-challengeType: 5
+challengeType: 1
 forumTopicId: 302285
 dashedName: heronian-triangles
 ---
 
 # --description--
 
-[Hero's formula](https://en.wikipedia.org/wiki/Heron's formula "wp: Heron's formula") for the area of a triangle given the length of its three sides `a`, `b`, and `c` is given by:
+Hero's formula for the area of a triangle given the length of its three sides `a`, `b`, and `c` is given by:
 
 $A = \\sqrt{s(s-a)(s-b)(s-c)},$
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
index 1b5b864eda0..e05d87270f2 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
@@ -1,43 +1,35 @@
 ---
 id: 59622f89e4e137560018a40e
 title: Hofstadter Figure-Figure sequences
-challengeType: 5
+challengeType: 1
 forumTopicId: 302286
 dashedName: hofstadter-figure-figure-sequences
 ---
 
 # --description--
 
-These two sequences of positive integers are defined as:
+The Hofstadter Figure-Figure sequences $R_n$ and $S_n$ are given by
 
-$R(1)=1\\ ;\\ S(1)=2 \\\\R(n)=R(n-1)+S(n-1), \\quad n>1.$
+$R_1 = 1\\ ;\\ S_1 = 2 \\\\R_n = R_{n-1} + S_{n-1}, \\quad n>1.$
 
-The sequence $S(n)$ is further defined as the sequence of positive integers not present in $R(n)$.
-
-Sequence $R$ starts:
+Specifically, the sequence $R_n$ contains the values
 
 <pre>1, 3, 7, 12, 18, ...</pre>
 
-Sequence $S$ starts:
+and the sequence $S_n$ contains the values
 
 <pre>2, 4, 5, 6, 8, ...</pre>
 
+The sequence $R_n$ is defined by the recurrence relation $R_n = R_{n-1} + S_{n-1}$, while $S_n$ is defined as sequence of positive integers that are not included in the sequence $R_n$.
+
 # --instructions--
 
-Create two functions named `ffr` and `ffs` that when given `n` return `R(n)` or `S(n)` respectively. (Note that R(1) = 1 and S(1) = 2 to avoid off-by-one errors).
+Create two functions named `ffr` and `ffs` that return `R(n)` or `S(n)`, respectively, for any index `n`. Note that the Hofstadter Figure-Figure sequences are 1-indexed, with $R_1 = 1$ and $S_1 = 2$.
 
 No maximum value for `n` should be assumed.
 
-**References**
+**References**<p>Rosetta: <a href='https://rosettacode.org/wiki/Hofstadter_Figure-Figure_sequences' target='_blank'>Hofstadter Figure-Figure sequences</a></p>.
 
-<ul>
-  <li>
-    Sloane's <a href='https://oeis.org/A005228' target='_blank'>A005228</a> and <a href='https://oeis.org/A030124' target='_blank'>A030124</a>.
-  </li>
-  <li>
-    Wikipedia: <a href='https://en.wikipedia.org/wiki/Hofstadter_sequence#Hofstadter_Figure-Figure_sequences' title='wp: Hofstadter_sequence#Hofstadter_Figure-Figure_sequences' target='_blank'>Hofstadter Figure-Figure sequences</a>.
-  </li>
-</ul>
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
index c8ab7d438ce..27c1bdb4dba 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
@@ -1,18 +1,18 @@
 ---
 id: 59637c4d89f6786115efd814
 title: Hofstadter Q sequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 302287
 dashedName: hofstadter-q-sequence
 ---
 
 # --description--
 
-The [Hofstadter Q sequence](https://en.wikipedia.org/wiki/Hofstadter_sequence#Hofstadter_Q_sequence "wp: Hofstadter_sequence#Hofstadter_Q_sequence") is defined as:
+The Hofstadter Q sequence is defined as:
 
 $Q(1)=Q(2)=1, \\\\ Q(n)=Q\\big(n-Q(n-1)\\big)+Q\\big(n-Q(n-2)), \\quad n>2.$
 
-It is defined like the [Fibonacci sequence](https://rosettacode.org/wiki/Fibonacci sequence "Fibonacci sequence"), but whereas the next term in the Fibonacci sequence is the sum of the previous two terms, in the Q sequence the previous two terms tell you how far to go back in the Q sequence to find the two numbers to sum to make the next term of the sequence.
+It is defined like the Fibonacci sequence, but whereas the next term in the Fibonacci sequence is the sum of the previous two terms, in the Q sequence the previous two terms tell you how far to go back in the Q sequence to find the two numbers to sum to make the next term of the sequence.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md
index afac6dc5121..48c6af21893 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7eb0
-title: I before E except after C
-challengeType: 5
+title: I 在 E 之前，除了 C 之后
+challengeType: 1
 forumTopicId: 302288
 dashedName: i-before-e-except-after-c
 ---
 
 # --description--
 
-The phrase ["I before E, except after C"](https://en.wikipedia.org/wiki/I before E except after C) is a widely known mnemonic which is supposed to help when spelling English words.
+**<a href="http://www.rosettacode.org/wiki/I_before_E_except_after_C" target="_blank" rel="noopener noreferrer nofollow">"I before E, except after C"</a>** is a general rule for English language spelling. If one is unsure whether a word is spelled with the digraph `ei` or `ie`, the rhyme suggests that the correct order is `ie` unless the preceding letter is `c`, in which case it may be `ei`.
 
 Using the words provided, check if the two sub-clauses of the phrase are plausible individually:
 
@@ -21,7 +21,7 @@ Using the words provided, check if the two sub-clauses of the phrase are plausib
   </li>
 </ol>
 
-If both sub-phrases are plausible then the original phrase can be said to be plausible.
+如果两个子短语都是合理的，则原始短语可以说是合理的。
 
 # --instructions--
 
@@ -29,49 +29,49 @@ Write a function that accepts a word and check if the word follows this rule. Th
 
 # --hints--
 
-`IBeforeExceptC` should be a function.
+`IBeforeExceptC` 应该是一个函数。
 
 ```js
 assert(typeof IBeforeExceptC == 'function');
 ```
 
-`IBeforeExceptC("receive")` should return a boolean.
+`IBeforeExceptC("receive")` 应该返回一个布尔值。
 
 ```js
 assert(typeof IBeforeExceptC('receive') == 'boolean');
 ```
 
-`IBeforeExceptC("receive")` should return `true`.
+`IBeforeExceptC("receive")` 应该返回 `true`。
 
 ```js
 assert.equal(IBeforeExceptC('receive'), true);
 ```
 
-`IBeforeExceptC("science")` should return `false`.
+`IBeforeExceptC("science")` 应该返回 `false`。
 
 ```js
 assert.equal(IBeforeExceptC('science'), false);
 ```
 
-`IBeforeExceptC("imperceivable")` should return `true`.
+`IBeforeExceptC("imperceivable")` 应该返回 `true`。
 
 ```js
 assert.equal(IBeforeExceptC('imperceivable'), true);
 ```
 
-`IBeforeExceptC("inconceivable")` should return `true`.
+`IBeforeExceptC("inconceivable")` 应该返回 `true`。
 
 ```js
 assert.equal(IBeforeExceptC('inconceivable'), true);
 ```
 
-`IBeforeExceptC("insufficient")` should return `false`.
+`IBeforeExceptC("insufficient")` 应该返回 `false`.
 
 ```js
 assert.equal(IBeforeExceptC('insufficient'), false);
 ```
 
-`IBeforeExceptC("omniscient")` should return `false`.
+`IBeforeExceptC("omniscient")` 应该返回 `false`.
 
 ```js
 assert.equal(IBeforeExceptC('omniscient'), false);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/iban.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/iban.md
index 666c50a6be8..dde7926e041 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/iban.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/iban.md
@@ -1,19 +1,19 @@
 ---
 id: 5a23c84252665b21eecc7eaf
 title: IBAN
-challengeType: 5
+challengeType: 1
 forumTopicId: 302289
 dashedName: iban
 ---
 
 # --description--
 
-The [International Bank Account Number (IBAN)](https://en.wikipedia.org/wiki/International_Bank_Account_Number) is an internationally agreed means of identifying bank accounts across national borders with a reduced risk of propagating [transcription errors](https://en.wikipedia.org/wiki/Transcription_error).
+The International Bank Account Number (IBAN) is an internationally agreed means of identifying bank accounts across national borders with a reduced risk of propagating transcription errors.
 
-The IBAN consists of up to 34 alphanumeric characters:
+The <abbr title="International Bank Account Number">IBAN</abbr> consists of up to 34 alphanumeric characters:
 
 <ul>
-  <li>first the two-letter ISO 3166-1 alpha-2 country code</li>
+  <li>first the two-letter <abbr title="International Organization for Standardization">ISO</abbr> 3166-1 alpha-2 country code</li>
   <li>then two check digits, and</li>
   <li>finally a country-specific Basic Bank Account Number (BBAN).</li>
 </ul>
@@ -95,10 +95,10 @@ function isValid(iban) {
     iban = __helpers.removeWhiteSpace(iban)
     if (!iban.match(/^[\dA-Z]+$/)) return false
     var len = iban.length
-    if (len != ibanLen[iban.substr(0,2)]) return false
-    iban = iban.substr(4) + iban.substr(0,4)
+    if (len != ibanLen[iban.substring(0,2)]) return false
+    iban = iban.substring(4) + iban.substring(0,4)
     for (var s='', i=0; i<len; i+=1) s+=parseInt(iban.charAt(i),36)
-    for (var m=s.substr(0,15)%97, s=s.substr(15); s; s=s.substr(13)) m=(m+s.substr(0,13))%97
+    for (var m=s.substring(0,15)%97, s=s.substring(15); s; s=s.substring(13)) m=(m+s.substring(0,13))%97
     return m == 1
 }
 ```
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/identity-matrix.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/identity-matrix.md
index a8465da648c..dba37b7cafa 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/identity-matrix.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/identity-matrix.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7eb1
 title: Identity matrix
-challengeType: 5
+challengeType: 1
 forumTopicId: 302290
 dashedName: identity-matrix
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/iterated-digits-squaring.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/iterated-digits-squaring.md
index bbed591151a..c64fdc125d7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/iterated-digits-squaring.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/iterated-digits-squaring.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ec1
 title: Iterated digits squaring
-challengeType: 5
+challengeType: 1
 forumTopicId: 302291
 dashedName: iterated-digits-squaring
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/jaro-distance.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/jaro-distance.md
index d348acaee73..40476e8efab 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/jaro-distance.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/jaro-distance.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ec2
 title: Jaro distance
-challengeType: 5
+challengeType: 1
 forumTopicId: 302292
 dashedName: jaro-distance
 ---
@@ -27,7 +27,7 @@ Two characters from \\(s_1\\) and \\(s_2\\) respectively, are considered *matchi
 
 Each character of \\(s_1\\) is compared with all its matching characters in \\(s_2\\) . The number of matching (but different sequence order) characters divided by 2 defines the number of *transpositions*.
 
-**Example**
+**示例**
 
 Given the strings \\(s_1\\) *DWAYNE* and \\(s_2\\) *DUANE* we find:
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/jortsort.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/jortsort.md
index 0f121b99ee4..1bb9d70e909 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/jortsort.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/jortsort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7ec4
 title: JortSort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302293
 dashedName: jortsort
 ---
 
 # --description--
 
-jortSort is a sorting toolset that makes the user do the work and guarantees efficiency because you don't have to sort ever again. It was originally presented by Jenn "Moneydollars" Schiffer at the prestigious [JSConf](https://www.youtube.com/watch?v=pj4U_W0OFoE).
+jortSort is a sorting toolset that makes the user do the work and guarantees efficiency because you don't have to sort ever again. It was originally presented by Jenn "Moneydollars" Schiffer at the prestigious JSConf2014.
 
 jortSort should be a function that takes a single array of comparable objects as its argument. It then sorts the array in ascending order and compares the sorted array to the originally provided array. If the arrays match (i.e. the original array was already sorted), the function returns true. If the arrays do not match (i.e. the original array was not sorted), the function returns false.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/josephus-problem.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/josephus-problem.md
index 6e8314e204c..d7e28e5e0c4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/josephus-problem.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/josephus-problem.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7ec5
 title: Josephus problem
-challengeType: 5
+challengeType: 1
 forumTopicId: 302294
 dashedName: josephus-problem
 ---
 
 # --description--
 
-[Josephus problem](https://en.wikipedia.org/wiki/Josephus problem) is a math puzzle with a grim description: $n$ prisoners are standing on a circle, sequentially numbered from $0$ to $n-1$.
+Josephus problem is a math puzzle with a grim description: $n$ prisoners are standing on a circle, sequentially numbered from $0$ to $n-1$.
 
 An executioner walks along the circle, starting from prisoner $0$, removing every $k$-th prisoner and killing him.
 
@@ -26,7 +26,7 @@ Which number was he?
 
 # --instructions--
 
-Write a function that takes the initial number of prisoners and 'k' as parameter and returns the number of the prisoner that survives.
+Write a function that takes the initial number of prisoners and `k` as parameters and returns the number of the prisoner that survives.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/k-d-tree.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/k-d-tree.md
index 5cb0e1f78fc..9f038dd908d 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/k-d-tree.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/k-d-tree.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ecb
 title: K-d tree
-challengeType: 5
+challengeType: 1
 forumTopicId: 302295
 dashedName: k-d-tree
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md
index 7b2530f4c62..ffef92f7819 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md
@@ -1,27 +1,27 @@
 ---
 id: 5a23c84252665b21eecc7eca
 title: Kaprekar numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 302296
 dashedName: kaprekar-numbers
 ---
 
 # --description--
 
-A positive integer is a [Kaprekar number](https://en.wikipedia.org/wiki/Kaprekar number) if:
+A positive integer is a Kaprekar number if:
 
 <ul>
   <li>It is 1, or,</li>
   <li>The decimal representation of its square may be split once into two parts consisting of positive integers which sum to the original number. </li>
 </ul>
 
-Note that a split resulting in a part consisting purely of 0s is not valid, as 0 is not considered positive.Example
+Note that a split resulting in a part consisting purely of 0s is not valid, as 0 is not considered positive.
 
-Kaprekar numbers:
+Example Kaprekar numbers:
 
 <ul>
   <li><code>2223</code> is a Kaprekar number, as <code>2223 * 2223 = 4941729</code>, <code>4941729</code> may be split to <code>494</code> and <code>1729</code>, and <code>494 + 1729 = 2223</code></li>
-  <li>The series of Kaprekar numbers is known as <a href='https://oeis.org/A006886' target='_blank'>A006886</a>, and begins as <code>1, 9, 45, 55, ...</code></li>
+  <li>The series of Kaprekar numbers is known as A006886, and begins as <code>1, 9, 45, 55, ...</code></li>
 </ul>
 
 # --instructions--
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/knapsack-problem-0-1.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/knapsack-problem-0-1.md
index 4112f63fb20..ab84dea2631 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/knapsack-problem-0-1.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/knapsack-problem-0-1.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ed1
 title: Knapsack problem/0-1
-challengeType: 5
+challengeType: 1
 forumTopicId: 323649
 dashedName: knapsack-problem0-1
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/knapsack-problem-bounded.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/knapsack-problem-bounded.md
index dfcde45510a..2af68ccd123 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/knapsack-problem-bounded.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/knapsack-problem-bounded.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ed2
 title: Knapsack problem/Bounded
-challengeType: 5
+challengeType: 1
 forumTopicId: 323652
 dashedName: knapsack-problembounded
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/knapsack-problem-continuous.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/knapsack-problem-continuous.md
index c106a4a7438..cb6879ac2d9 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/knapsack-problem-continuous.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/knapsack-problem-continuous.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ed3
 title: Knapsack problem/Continuous
-challengeType: 5
+challengeType: 1
 forumTopicId: 323654
 dashedName: knapsack-problemcontinuous
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/knapsack-problem-unbounded.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/knapsack-problem-unbounded.md
index 74e1ad8916a..62bb6116126 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/knapsack-problem-unbounded.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/knapsack-problem-unbounded.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ed4
 title: Knapsack problem/Unbounded
-challengeType: 5
+challengeType: 1
 forumTopicId: 323655
 dashedName: knapsack-problemunbounded
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/knights-tour.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/knights-tour.md
index c7a4b0693de..154df0c3ee4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/knights-tour.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/knights-tour.md
@@ -1,18 +1,18 @@
 ---
 id: 5a23c84252665b21eecc7ed5
 title: Knight's tour
-challengeType: 5
+challengeType: 1
 forumTopicId: 302297
 dashedName: knights-tour
 ---
 
 # --description--
 
-[Knight's Tour](https://en.wikipedia.org/wiki/Knight%27s_tour) Problem: You have an empty `w` \* `h` chessboard, but for a single knight on some square. The knight must perform a sequence of legal moves that result in the knight visiting every square on the chessboard exactly once. Note that it is *not* a requirement that the tour be "closed"; that is, the knight need not end within a single move of its start position.
+Knight's Tour Problem: You have an empty `width` \* `height` chessboard, but for a single knight on some square. The knight must perform a sequence of legal moves that result in the knight visiting every square on the chessboard exactly once. Note that it is *not* a requirement that the tour be "closed"; that is, the knight need not end within a single move of its start position.
 
 # --instructions--
 
-Write a function that takes `w` and `h` as parameters and returns the number of initial positions from where it is possible to achieve the task stated above.
+Write a function that takes `width` and `height` as parameters and returns the number of initial positions from where it is possible to achieve the task stated above.
 
 # --hints--
 
@@ -63,7 +63,7 @@ assert.equal(knightTour(8, 6), 48);
 ## --seed-contents--
 
 ```js
-function knightTour(w, h) {
+function knightTour(width, height) {
 
 }
 ```
@@ -71,7 +71,7 @@ function knightTour(w, h) {
 # --solutions--
 
 ```js
-function knightTour(w, h) {
+function knightTour(width, height) {
   function createBoards(rows, columns) {
     const board = [];
     const visited = [];
@@ -210,11 +210,11 @@ function knightTour(w, h) {
     [1, -2]
   ];
 
-  const [baseBoard, baseVisited] = createBoards(h, w);
+  const [baseBoard, baseVisited] = createBoards(height, width);
   fillAllowedMovesCounts(baseBoard);
   let solvedCount = 0;
-  for (let row = 0; row < h; row++) {
-    for (let column = 0; column < w; column++) {
+  for (let row = 0; row < height; row++) {
+    for (let column = 0; column < width; column++) {
       if (solveStart(baseBoard, baseVisited, row, column)) {
         solvedCount++;
       }
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/largest-int-from-concatenated-ints.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/largest-int-from-concatenated-ints.md
index f8938faa66f..91f5ba030ba 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/largest-int-from-concatenated-ints.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/largest-int-from-concatenated-ints.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7edb
 title: Largest int from concatenated ints
-challengeType: 5
+challengeType: 1
 forumTopicId: 302298
 dashedName: largest-int-from-concatenated-ints
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/last-friday-of-each-month.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/last-friday-of-each-month.md
index e8a6170f549..7ebd6a1b71a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/last-friday-of-each-month.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/last-friday-of-each-month.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7edc
 title: Last Friday of each month
-challengeType: 5
+challengeType: 1
 forumTopicId: 302299
 dashedName: last-friday-of-each-month
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/last-letter-first-letter.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/last-letter-first-letter.md
index a20f5b4df35..f6bb3eafe56 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/last-letter-first-letter.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/last-letter-first-letter.md
@@ -1,7 +1,7 @@
 ---
 id: 5e4ce2b6ac708cc68c1df25e
 title: Last letter-first letter
-challengeType: 5
+challengeType: 1
 forumTopicId: 385256
 dashedName: last-letter-first-letter
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/leap-year.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/leap-year.md
index cf41748dba4..ae2f6773c80 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/leap-year.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/leap-year.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ede
 title: Leap year
-challengeType: 5
+challengeType: 1
 forumTopicId: 302300
 dashedName: leap-year
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/least-common-multiple.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/least-common-multiple.md
index aa27446cbe9..d84da1b8b61 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/least-common-multiple.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/least-common-multiple.md
@@ -1,14 +1,16 @@
 ---
 id: 5a23c84252665b21eecc7edf
 title: Least common multiple
-challengeType: 5
+challengeType: 1
 forumTopicId: 302301
 dashedName: least-common-multiple
 ---
 
 # --description--
 
-The least common multiple of 12 and 18 is 36, because 12 is a factor (12 × 3 = 36), and 18 is a factor (18 × 2 = 36), and there is no positive integer less than 36 that has both factors. As a special case, if either *m* or *n* is zero, then the least common multiple is zero. One way to calculate the least common multiple is to iterate all the multiples of *m*, until you find one that is also a multiple of *n*. If you already have *gcd* for [greatest common divisor](https://rosettacode.org/wiki/greatest common divisor), then this formula calculates *lcm*. ( \\operatorname{lcm}(m, n) = \\frac{|m \\times n|}{\\operatorname{gcd}(m, n)} )
+The least common multiple of 12 and 18 is 36, because 12 is a factor (12 × 3 = 36), and 18 is a factor (18 × 2 = 36), and there is no positive integer less than 36 that has both factors. As a special case, if either $m$ or $n$ is zero, then the least common multiple is zero. One way to calculate the least common multiple is to iterate all the multiples of $m$, until you find one that is also a multiple of $n$. If you already have $gcd$ for <a href="https://rosettacode.org/wiki/Greatest_common_divisor" target="_blank" rel="noopener noreferrer nofollow">greatest common divisor</a>, then this formula calculates $lcm$.
+
+$$ \\operatorname{lcm}(m, n) = \\frac{|m \\times n|}{\\operatorname{gcd}(m, n)} $$
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/left-factorials.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/left-factorials.md
index 36c2761d93e..6f589d1f1e1 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/left-factorials.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/left-factorials.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ee0
 title: Left factorials
-challengeType: 5
+challengeType: 1
 forumTopicId: 302302
 dashedName: left-factorials
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/letter-frequency.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/letter-frequency.md
index d7c0a30349b..1efeade3f64 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/letter-frequency.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/letter-frequency.md
@@ -1,7 +1,7 @@
 ---
 id: 5e4ce2bbac708cc68c1df25f
 title: Letter frequency
-challengeType: 5
+challengeType: 1
 forumTopicId: 385263
 dashedName: letter-frequency
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/levenshtein-distance.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/levenshtein-distance.md
index 2737ad5436a..6894c754274 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/levenshtein-distance.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/levenshtein-distance.md
@@ -1,16 +1,16 @@
 ---
 id: 5e4ce2eaac708cc68c1df260
 title: Levenshtein distance
-challengeType: 5
+challengeType: 1
 forumTopicId: 385264
 dashedName: levenshtein-distance
 ---
 
 # --description--
 
-In information theory and computer science, the **Levenshtein distance** is a [metric](https://en.wikipedia.org/wiki/string metric) for measuring the amount of difference between two sequences (i.e. an [edit distance](https://en.wikipedia.org/wiki/edit distance)). The Levenshtein distance between two strings is defined as the minimum number of edits needed to transform one string into the other, with the allowable edit operations being insertion, deletion, or substitution of a single character.
+In information theory and computer science, the **Levenshtein distance** is a metric for measuring the amount of difference between two sequences (i.e. an edit distance). The Levenshtein distance between two strings is defined as the minimum number of edits needed to transform one string into the other, with the allowable edit operations being insertion, deletion, or substitution of a single character.
 
-Example:
+例如：
 
 The Levenshtein distance between "**kitten**" and "**sitting**" is 3, since the following three edits change one into the other, and there isn't a way to do it with fewer than three edits:
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
index 0448399ccbe..9b7ff866168 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
@@ -1,14 +1,14 @@
 ---
 id: 5e4ce2f5ac708cc68c1df261
 title: Linear congruential generator
-challengeType: 5
+challengeType: 1
 forumTopicId: 385266
 dashedName: linear-congruential-generator
 ---
 
 # --description--
 
-The [linear congruential generator](https://en.wikipedia.org/wiki/linear congruential generator) is a very simple example of a [random number generator](http://rosettacode.org/wiki/random number generator). All linear congruential generators use this formula:
+A linear congruential generator (LCG) is an <em>algorithm</em> that yields a sequence of pseudo-randomized numbers calculated with a discontinuous piecewise linear equation. All linear congruential generators use this formula:
 
 $$r_{n + 1} = (a \times r_n + c) \bmod m$$
 
@@ -22,7 +22,7 @@ Where:
 
 If one chooses the values of $a$, $c$ and $m$ with care, then the generator produces a uniform distribution of integers from $0$ to $m - 1$.
 
-LCG numbers have poor quality. $r_n$ and $r\_{n + 1}$ are not independent, as true random numbers would be. Anyone who knows $r_n$ can predict $r\_{n + 1}$, therefore LCG is not cryptographically secure. The LCG is still good enough for simple tasks like [Miller-Rabin primality test](http://rosettacode.org/wiki/Miller-Rabin primality test), or [FreeCell deals](http://rosettacode.org/wiki/deal cards for FreeCell). Among the benefits of the LCG, one can easily reproduce a sequence of numbers, from the same $r_0$. One can also reproduce such sequence with a different programming language, because the formula is so simple.
+<abbr title="linear congruential generator">LCG</abbr> numbers have poor quality. $r_n$ and $r\_{n + 1}$ are not independent, as true random numbers would be. Anyone who knows $r_n$ can predict $r\_{n + 1}$, therefore <abbr title="linear congruential generator">LCG</abbr> is not cryptographically secure. The <abbr title="linear congruential generator">LCG</abbr> is still good enough for simple tasks like Miller-Rabin primality test, or FreeCell deals. Among the benefits of the <abbr title="linear congruential generator">LCG</abbr>, one can easily reproduce a sequence of numbers, from the same $r_0$. One can also reproduce such sequence with a different programming language, because the formula is so simple.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/long-multiplication.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/long-multiplication.md
index fb4e2456cf3..174bde82794 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/long-multiplication.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/long-multiplication.md
@@ -1,14 +1,14 @@
 ---
 id: 5e4ce2a1ac708cc68c1df25d
 title: Long multiplication
-challengeType: 5
+challengeType: 1
 forumTopicId: 385269
 dashedName: long-multiplication
 ---
 
 # --description--
 
-Explicitly implement [long multiplication](https://en.wikipedia.org/wiki/long multiplication).
+Explicitly implement long multiplication.
 
 This is one possible approach to arbitrary-precision integer algebra.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
index b027a10f5ea..5b4f0d4c1d3 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
@@ -1,29 +1,23 @@
 ---
 id: 5e6dd1278e6ca105cde40ea9
 title: Longest common subsequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 385271
 dashedName: longest-common-subsequence
 ---
 
 # --description--
 
-The **longest common subsequence** (or [**LCS**](http://en.wikipedia.org/wiki/Longest_common_subsequence_problem)) of groups A and B is the longest group of elements from A and B that are common between the two groups and in the same order in each group. For example, the sequences "1234" and "1224533324" have an LCS of "1234":
+The **longest common subsequence** (or **LCS**) of groups A and B is the longest group of elements from A and B that are common between the two groups and in the same order in each group. For example, the sequences `1234` and `1224533324` have an LCS of `1234`:<u>1234</u>
+<u>12</u>245<u>3</u>332<u>4</u>
 
-***1234***
+For a string example, consider the sequences `thisisatest` and `testing123testing`. An LCS would be `tsitest`:
+<u>t</u>hi<u>si</u>sa<u>test</u>
 
-***12***245***3***332***4***
-
-For a string example, consider the sequences "thisisatest" and "testing123testing". An LCS would be "tsitest":
-
-***t***hi***si***sa***test***
-
-***t***e***s***t***i***ng123***test***ing.
+<u>t</u>e<u>s</u>t<u>i</u>ng123<u>test</u>ing.
 
 Your code only needs to deal with strings.
 
-For more information on this problem please see [Wikipedia](https://en.wikipedia.org/wiki/Longest_common_subsequence_problem).
-
 # --instructions--
 
 Write a case-sensitive function that returns the LCS of two strings. You don't need to show multiple LCS's.
@@ -86,8 +80,8 @@ function lcs(a, b) {
 
 ```js
 function lcs(a, b) {
-  var aSub = a.substr(0, a.length - 1);
-  var bSub = b.substr(0, b.length - 1);
+  var aSub = a.substring(0, a.length - 1);
+  var bSub = b.substring(0, b.length - 1);
 
   if (a.length === 0 || b.length === 0) {
     return '';
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md
index 0ba5661f6c8..0cd96a6d6cc 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md
@@ -1,7 +1,7 @@
 ---
 id: 5e6dd139859c290b6ab80292
 title: Longest increasing subsequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 385272
 dashedName: longest-increasing-subsequence
 ---
@@ -12,14 +12,14 @@ The longest increasing subsequence problem is to find a subsequence of a given s
 
 For the following array:
 
-$\\{3, 10, 2, 1, 20\\}$
+```js
+const array = [3, 10, 2, 1, 20];
+```
 
 Longest increasing sequence is:
 
 $\\{3, 10, 20\\}$
 
-For more information on this problem please see [Wikipedia](https://en.wikipedia.org/wiki/Longest increasing subsequence).
-
 # --instructions--
 
 Write a function that takes an array of numbers as a parameter and returns the longest increasing subsequence.
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/longest-string-challenge.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/longest-string-challenge.md
index 06a0c9d5503..f4bedb96bcc 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/longest-string-challenge.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/longest-string-challenge.md
@@ -1,7 +1,7 @@
 ---
 id: 5e6dd14192286d95fc43046e
 title: Longest string challenge
-challengeType: 5
+challengeType: 1
 forumTopicId: 385275
 dashedName: longest-string-challenge
 ---
@@ -28,7 +28,7 @@ assert(typeof longestString == 'function');
 assert(Array.isArray(longestString(['a', 'bb', 'ccc', 'ee', 'f', 'ggg'])));
 ```
 
-`longestString(["a", "bb", "ccc", "ee", "f", "ggg"])` should return `["ccc", "ggg"]'`.
+`longestString(["a", "bb", "ccc", "ee", "f", "ggg"])` should return `["ccc", "ggg"]`.
 
 ```js
 assert.deepEqual(longestString(['a', 'bb', 'ccc', 'ee', 'f', 'ggg']), [
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md
index ed09269a091..464d824a0c9 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md
@@ -1,14 +1,14 @@
 ---
 id: 5e6dd14797f5ce267c2f19d0
 title: Look-and-say sequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 385277
 dashedName: look-and-say-sequence
 ---
 
 # --description--
 
-The [Look and say sequence](https://en.wikipedia.org/wiki/Look and say sequence) is a recursively defined sequence of numbers.
+The Look and say sequence is a recursively defined sequence of numbers.
 
 Sequence Definition
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/loop-over-multiple-arrays-simultaneously.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/loop-over-multiple-arrays-simultaneously.md
index e8924ccd287..d0bd62b8726 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/loop-over-multiple-arrays-simultaneously.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/loop-over-multiple-arrays-simultaneously.md
@@ -1,7 +1,7 @@
 ---
 id: 5e6dd15004c88cf00d2a78b3
 title: Loop over multiple arrays simultaneously
-challengeType: 5
+challengeType: 1
 forumTopicId: 385279
 dashedName: loop-over-multiple-arrays-simultaneously
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/lu-decomposition.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/lu-decomposition.md
index 1b2442f3056..45759df22aa 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/lu-decomposition.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/lu-decomposition.md
@@ -1,20 +1,20 @@
 ---
 id: 5e6decd8ec8d7db960950d1c
 title: LU decomposition
-challengeType: 5
+challengeType: 1
 forumTopicId: 385280
 dashedName: lu-decomposition
 ---
 
 # --description--
 
-Every square matrix $A$ can be decomposed into a product of a lower triangular matrix $L$ and a upper triangular matrix $U$, as described in [LU decomposition](https://en.wikipedia.org/wiki/LU decomposition).
+Every square matrix $A$ can be decomposed into a product of a lower triangular matrix $L$ and a upper triangular matrix $U$. This is known as the LU decomposition.
 
 $A = LU$
 
 It is a modified form of Gaussian elimination.
 
-While the [Cholesky decomposition](http://rosettacode.org/wiki/Cholesky decomposition) only works for symmetric, positive definite matrices, the more general LU decomposition works for any square matrix.
+While the Cholesky decomposition only works for symmetric, positive definite matrices, the more general LU decomposition works for any square matrix.
 
 There are several algorithms for calculating $L$ and $U$.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/lucas-lehmer-test.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/lucas-lehmer-test.md
index 83d3d2bbfaf..e909f6b3f6a 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/lucas-lehmer-test.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/lucas-lehmer-test.md
@@ -1,7 +1,7 @@
 ---
 id: 5e6dee7749a0b85a3f1fc7d5
 title: Lucas-Lehmer test
-challengeType: 5
+challengeType: 1
 forumTopicId: 385281
 dashedName: lucas-lehmer-test
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/ludic-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/ludic-numbers.md
index 0e7be774f58..703017aa539 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/ludic-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/ludic-numbers.md
@@ -1,22 +1,22 @@
 ---
 id: 5ea281203167d2b0bdefca00
-title: Ludic numbers
-challengeType: 5
+title: 卢迪数
+challengeType: 1
 forumTopicId: 385282
 dashedName: ludic-numbers
 ---
 
 # --description--
 
-[Ludic numbers](https://oeis.org/wiki/Ludic_numbers) are related to prime numbers as they are generated by a sieve quite like the [Sieve of Eratosthenes](https://rosettacode.org/wiki/Sieve_of_Eratosthenes) is used to generate prime numbers.
+Ludic numbers are related to prime numbers as they are generated by a sieve quite like the Sieve of Eratosthenes is used to generate prime numbers.
 
-The first ludic number is 1.
+第一个 ludic 数字是 1。
 
-To generate succeeding ludic numbers create an array of increasing integers starting from 2.
+要生成连续的 ludic 数字，请创建一个从 2 开始递增的整数数组。
 
 <code style='margin-left: 2em;'><span style='color:blue;font-weight:bold'>2</span> 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 ...</code>
 
-(Loop)
+（循环）
 
 <ul>
   <li>Take the first member of the resultant array as the next ludic number <span style='color:blue;font-weight:bold'>2</span>.</li>
@@ -56,43 +56,43 @@ Write a function that returns all the ludic numbers less than or equal to the gi
 
 # --hints--
 
-`ludic` should be a function.
+`ludic`应该是一个函数。
 
 ```js
 assert(typeof ludic === 'function', '<code>ludic</code> should be a function.');
 ```
 
-`ludic(2)` should return a array.
+`ludic(2)` 应该返回一个数组。
 
 ```js
 assert(Array.isArray(ludic(2)));
 ```
 
-`ludic(2)` should return `[1, 2]`.
+`ludic(2)` 应该返回 `[1, 2]`.
 
 ```js
 assert.deepEqual(ludic(2), [1, 2]);
 ```
 
-`ludic(3)` should return `[1, 2, 3]`.
+`ludic(3)` 返回数组 `[1, 2, 3]`.
 
 ```js
 assert.deepEqual(ludic(3), [1, 2, 3]);
 ```
 
-`ludic(5)` should return `[1, 2, 3, 5]`.
+`ludic(5)` 返回数组 `[1, 2, 3, 5]`.
 
 ```js
 assert.deepEqual(ludic(5), [1, 2, 3, 5]);
 ```
 
-`ludic(20)` should return `[1, 2, 3, 5, 7, 11, 13, 17]`.
+`ludic(20)` 返回数组 `[1, 2, 3, 5, 7, 11, 13, 17]`。
 
 ```js
 assert.deepEqual(ludic(20), [1, 2, 3, 5, 7, 11, 13, 17]);
 ```
 
-`ludic(26)` should return `[1, 2, 3, 5, 7, 11, 13, 17, 23, 25]`.
+`ludic(26)`返回数组`[1, 2, 3, 5, 7, 11, 13, 17, 23, 25]`.
 
 ```js
 assert.deepEqual(ludic(26), [1, 2, 3, 5, 7, 11, 13, 17, 23, 25]);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md
index 4fcc90502ab..56bc3c9da08 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 5ea28156e79528a9ab248f27
 title: Luhn test of credit card numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 385284
 dashedName: luhn-test-of-credit-card-numbers
 ---
 
 # --description--
 
-The [Luhn test](https://en.wikipedia.org/wiki/Luhn algorithm) is used by some credit card companies to distinguish valid credit card numbers from what could be a random selection of digits.
+The Luhn test is used by some credit card companies to distinguish valid credit card numbers from what could be a random selection of digits.
 
 Those companies using credit card numbers that can be validated by the Luhn test have numbers that pass the following test:
 
@@ -44,7 +44,7 @@ s1 + s2 = 70 which ends in zero which means that 49927398716 passes the Luhn tes
 
 # --instructions--
 
-Write a function that will validate a number with the Luhn test. Return true if it's a valid number. Otherwise, return false.
+Write a function that will validate a number with the Luhn test. Return true if it's a valid number. 否则，返回 false。
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/lychrel-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/lychrel-numbers.md
index 5ffc202ebd9..c6cf24208c9 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/lychrel-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/lychrel-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5ea2815a8640bcc6cb7dab3c
 title: Lychrel numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 385287
 dashedName: lychrel-numbers
 ---
@@ -64,7 +64,7 @@ Because of this we can further split the Lychrel numbers into true **Seed** Lych
 
 # --instructions--
 
-Write a function that takes a number as a parameter. Return true if the number is a Lynchrel number. Otherwise, return false. Remember that the iteration limit is 500.
+Write a function that takes a number as a parameter. Return true if the number is a Lynchrel number. 否则，返回 false。 Remember that the iteration limit is 500.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/lzw-compression.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/lzw-compression.md
index ccde98aa946..e4aa0f6e571 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/lzw-compression.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/lzw-compression.md
@@ -1,7 +1,7 @@
 ---
 id: 5ea2815e364d9a2222ea55f8
 title: LZW compression
-challengeType: 5
+challengeType: 1
 forumTopicId: 385288
 dashedName: lzw-compression
 ---
@@ -10,8 +10,6 @@ dashedName: lzw-compression
 
 The Lempel-Ziv-Welch (LZW) algorithm provides loss-less data compression.
 
-You can read a complete description of it in the [Wikipedia article](https://en.wikipedia.org/wiki/Lempel-Ziv-Welch) on the subject.
-
 # --instructions--
 
 Write a function that takes two parameters. The first parameter is a boolean where `true` indicates compress and `false` indicates decompress. The second parameter is either a string or an array to be processed. If it is a string to be compressed, return an array of numbers. If it's an array of numbers to be decompressed, return a string.
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/s-expressions.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/s-expressions.md
index 19304897ae8..332ad9f402f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/s-expressions.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/s-expressions.md
@@ -1,14 +1,14 @@
 ---
 id: 59667989bf71cf555dd5d2ff
-title: S-Expressions
-challengeType: 5
+title: S-表达式
+challengeType: 1
 forumTopicId: 302303
 dashedName: s-expressions
 ---
 
 # --description--
 
-[S-Expressions](https://en.wikipedia.org/wiki/S-Expression "wp: S-Expression") are one convenient way to parse and store data.
+<a href="https://rosettacode.org/wiki/S-expressions" target="_blank" rel="noopener noreferrer nofollow">S-Expressions</a> are one convenient way to parse and store data.
 
 # --instructions--
 
@@ -24,25 +24,25 @@ Handling escaped quotes inside a string is optional; thus "`(foo"bar)`" may be t
 
 For this, the reader need not recognize `\` for escaping, but should, in addition, recognize numbers if the language has appropriate data types.
 
-Note that with the exception of `()"` (`\` if escaping is supported) and whitespace, there are no special characters. Anything else is allowed without quotes.
+Note that with the exception of `()"` (`\` if escaping is supported) and whitespace, there are no special characters. 其他任何内容都是允许的，不带引号。
 
-The reader should be able to read the following input
+读者应该能够阅读以下输入
 
 <pre>((data "quoted data" 123 4.5)
 (data (!@# (4.5) "(more" "data)")))
 </pre>
 
-and turn it into a native data structure. (See the [Pike](https://rosettacode.org/wiki/S-Expressions#Pike "\#Pike"), [Python](https://rosettacode.org/wiki/S-Expressions#Python "\#Python") and [Ruby](https://rosettacode.org/wiki/S-Expressions#Ruby "\#Ruby") implementations for examples of native data structures.)
+and turn it into a native data structure.
 
 # --hints--
 
-`parseSexpr` should be a function.
+`parseSexpr` 是一个函数。
 
 ```js
 assert(typeof parseSexpr === 'function');
 ```
 
-`parseSexpr('(data1 data2 data3)')` should return `['data1', 'data2', 'data3']`
+`parseSexpr('(data1 data2 data3)')` 应该返回 `['data1', 'data2', 'data3']`
 
 ```js
 assert.deepEqual(parseSexpr(simpleSExpr), simpleSolution);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
index ec8a0c6e2db..8117215835e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
@@ -1,23 +1,24 @@
 ---
 id: 59da22823d04c95919d46269
 title: 'Sailors, coconuts and a monkey problem'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302304
 dashedName: sailors-coconuts-and-a-monkey-problem
 ---
 
 # --description--
 
-Five sailors are shipwrecked on an island and collect a large pile of coconuts during the day. That night the first sailor wakes up and decides to take his first share early so tries to divide the pile of coconuts equally into five piles but finds that there is one coconut left over, so he tosses it to a monkey and then hides "his" one of the five equally sized piles of coconuts and pushes the other four piles together to form a single visible pile of coconuts again and goes to bed. To cut a long story short, each of the sailors in turn gets up once during the night and performs the same actions of dividing the coconut pile into five, finding that one coconut is left over and giving that single remainder coconut to the monkey. In the morning (after the surreptitious and separate action of each of the five sailors during the night), the remaining coconuts are divided into five equal piles for each of the sailors, whereupon it is found that the pile of coconuts divides equally amongst the sailors with no remainder. (Nothing for the monkey in the morning.)
+Five sailors are shipwrecked on an island and collect a large pile of coconuts during the day.
+
+That night the first sailor wakes up and decides to take his first share early so tries to divide the pile of coconuts equally into five piles but finds that there is one coconut left over, so he tosses it to a monkey and then hides "his" one of the five equally sized piles of coconuts and pushes the other four piles together to form a single visible pile of coconuts again and goes to bed.
+
+To cut a long story short, each of the sailors in turn gets up once during the night and performs the same actions of dividing the coconut pile into five, finding that one coconut is left over and giving that single remainder coconut to the monkey, then push the other four piles together to form a single pile.
+
+In the morning (after the surreptitious and separate action of each of the five sailors during the night), the remaining coconuts are divided into five equal piles for each of the sailors, whereupon it is found that the pile of coconuts divides equally amongst the sailors with no remainder. (Nothing for the monkey in the morning.)
 
 # --instructions--
 
-Create a function that returns the minimum possible size of the initial pile of coconuts collected during the day for `N` sailors. **Note:** Of course the tale is told in a world where the collection of any amount of coconuts in a day and multiple divisions of the pile, etc. can occur in time fitting the story line, so as not to affect the mathematics. **C.f:**
-
-<ul>
-  <li><a href="https://www.youtube.com/watch?v=U9qU20VmvaU" target="_blank"> Monkeys and Coconuts - Numberphile</a> (Video) Analytical solution.</li>
-  <li><a href="https://oeis.org/A002021" target="_blank">A002021 Pile of coconuts problem</a> The On-Line Encyclopedia of Integer Sequences. (Although some of its references may use the alternate form of the tale).</li>
-</ul>
+Create a function that returns the minimum possible size of the initial pile of coconuts collected during the day for `N` sailors. **Note:** Of course the tale is told in a world where the collection of any number of coconuts in a day and multiple divisions of the pile, etc. can occur in time fitting the story line, so as not to affect mathematics.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/search-a-list-of-records.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/search-a-list-of-records.md
index f4fa1a4452e..439ece2740e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/search-a-list-of-records.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/search-a-list-of-records.md
@@ -1,7 +1,7 @@
 ---
 id: 5eb3e497b8d6d7f63c5517ea
 title: Search a list of records
-challengeType: 5
+challengeType: 1
 forumTopicId: 385315
 dashedName: search-a-list-of-records
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sedols.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sedols.md
index 9d5ce33e9d3..9ace124614e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sedols.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sedols.md
@@ -1,14 +1,16 @@
 ---
 id: 59d9c6bc214c613ba73ff012
 title: SEDOLs
-challengeType: 5
+challengeType: 1
 forumTopicId: 302305
 dashedName: sedols
 ---
 
 # --description--
 
-For each number list of 6-digit [SEDOL](https://en.wikipedia.org/wiki/SEDOL "wp: SEDOL")s, calculate and append the checksum digit. That is, given the input string on the left, your function should return the corresponding string on the right:
+<abbr title="Stock Exchange Daily Official List">SEDOL</abbr> is a list of securities identification numbers issued by the London Stock Exchange.
+
+For each number list of 6-digit <abbr title="Stock Exchange Daily Official List">SEDOL</abbr>s, calculate and append the checksum digit. That is, given the input string on the left, your function should return the corresponding string on the right:
 
 <pre>
 710889 => 7108899
@@ -64,8 +66,9 @@ assert(sedol('228276') === '2282765');
 
 ```js
 function sedol(input) {
+  const checkSum = 0
 
-  return true;
+  return checkSum;
 }
 ```
 
@@ -90,7 +93,7 @@ function sedolCheckDigit(char6) {
   for (let i = 0; i < char6.length; i++) {
     sum += weight[i] * parseInt(char6.charAt(i), 36);
   }
-  const check = (10 - (sum % 10)) % 10;
-  return check.toString();
+  const checkSum = (10 - (sum % 10)) % 10;
+  return checkSum.toString();
 }
 ```
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/self-describing-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
index df2a88508fb..fdb8f8d0da7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 5eaf48389ee512d4d103684b
 title: Self Describing Numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 385289
 dashedName: self-describing-numbers
 ---
 
 # --description--
 
-There are several so-called "self describing" or ["self-descriptive"](https://en.wikipedia.org/wiki/Self-descriptive_number) integers.
+There are several so-called "self-describing" or "self-descriptive" integers.
 
 An integer is said to be "self-describing" if it has the property that, when digit positions are labeled 0 to N-1, the digit in each position is equal to the number of times that digit appears in the number.
 
@@ -25,7 +25,7 @@ Self-describing numbers &lt; 100,000,000 are: 1210, 2020, 21200, 3211000, 421010
 
 # --instructions--
 
-Write a function that takes a positive integer as a parameter. If it is self-describing return true. Otherwise, return false.
+Write a function that takes a positive integer as a parameter. If it is self-describing return true. 否则，返回 false。
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/self-referential-sequence.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/self-referential-sequence.md
index 11beda8ba0b..086840b687f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/self-referential-sequence.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/self-referential-sequence.md
@@ -1,14 +1,14 @@
 ---
 id: 5eb3e4a21f462f409d656c73
 title: Self-referential sequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 385317
 dashedName: self-referential-sequence
 ---
 
 # --description--
 
-There are several ways to generate a self-referential sequence. One very common one (the [Look-and-say sequence](https://rosettacode.org/wiki/Look-and-say sequence)) is to start with a positive integer, then generate the next term by concatenating enumerated groups of adjacent alike digits:
+There are several ways to generate a self-referential sequence. One very common one (the <a href="https://rosettacode.org/wiki/Look-and-say_sequence" target="_blank" rel="noopener noreferrer nofollow">Look-and-say sequence</a>) is to start with a positive integer, then generate the next term by concatenating enumerated groups of adjacent alike digits:
 
 <pre>0, 10, 1110, 3110, 132110, 1113122110, 311311222110 ...</pre>
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/semiprime.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/semiprime.md
index 961f13632fd..590e77332ef 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/semiprime.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/semiprime.md
@@ -1,14 +1,14 @@
 ---
 id: 5eb3e4aa847216613aa81983
 title: Semiprime
-challengeType: 5
+challengeType: 1
 forumTopicId: 385318
 dashedName: semiprime
 ---
 
 # --description--
 
-Semiprime numbers are natural numbers that are products of exactly two (possibly equal) [prime numbers](https://rosettacode.org/wiki/prime_number).
+Semiprime numbers are natural numbers that are products of exactly two (possibly equal) <a href="https://rosettacode.org/wiki/prime_number" target="_blank" rel="noopener noreferrer nofollow">prime numbers</a>.
 
 <pre>1679  =  23 x 73</pre>
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/set-consolidation.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/set-consolidation.md
index 3a97b090b37..07a585e0875 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/set-consolidation.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/set-consolidation.md
@@ -1,7 +1,7 @@
 ---
 id: 5eb3e4af7d0e7b760b46cedc
 title: Set consolidation
-challengeType: 5
+challengeType: 1
 forumTopicId: 385319
 dashedName: set-consolidation
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/set-of-real-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/set-of-real-numbers.md
index 7633b59b8a4..addfc4c751b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/set-of-real-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/set-of-real-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5eb3e4b20aa93c437f9e9717
 title: Set of real numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 385322
 dashedName: set-of-real-numbers
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sha-1.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sha-1.md
index 6756db3d6b9..15a5f333a19 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sha-1.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sha-1.md
@@ -1,7 +1,7 @@
 ---
 id: 5eb3e4b5f629b9a07429a5d2
 title: SHA-1
-challengeType: 5
+challengeType: 1
 forumTopicId: 385326
 dashedName: sha-1
 ---
@@ -16,7 +16,7 @@ BitTorrent 使用 SHA-1 来验证下载内容。
 
 Git 和 Mercurial 使用 SHA-1 摘要来核验提交内容。
 
-美国政府标准 [FIPS 180-1](https://rosettacode.org/wiki/SHA-1/FIPS-180-1) 了定义 SHA-1。
+A US government standard, <a href="https://rosettacode.org/wiki/SHA-1/FIPS-180-1" target="_blank" rel="noopener noreferrer nofollow">FIPS 180-1</a>, defines SHA-1.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sort-an-array-of-composite-structures.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sort-an-array-of-composite-structures.md
index e2a4065371e..124644791f7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sort-an-array-of-composite-structures.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sort-an-array-of-composite-structures.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ffe
 title: Sort an array of composite structures
-challengeType: 5
+challengeType: 1
 forumTopicId: 302306
 dashedName: sort-an-array-of-composite-structures
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md
index b6647f28247..8f1ef877e53 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8000
 title: Sort disjoint sublist
-challengeType: 5
+challengeType: 1
 forumTopicId: 302307
 dashedName: sort-disjoint-sublist
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sort-stability.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sort-stability.md
index 3f57407b6af..0820e0c2d77 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sort-stability.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sort-stability.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8014
 title: Sort stability
-challengeType: 5
+challengeType: 1
 forumTopicId: 302308
 dashedName: sort-stability
 ---
 
 # --description--
 
-When sorting records in a table by a particular column or field, a [stable sort](https://en.wikipedia.org/wiki/Stable_sort#Stability) will always retain the relative order of records that have the same key.
+When sorting records in a table by a particular column or field, a <a href="https://www.freecodecamp.org/news/stability-in-sorting-algorithms-a-treatment-of-equality-fa3140a5a539/" target="_blank" rel="noopener noreferrer nofollow">stable sort</a> will always retain the relative order of records that have the same key.
 
 For example, in this table of countries and cities, a stable sort on the **second** column, the cities, would keep the US Birmingham above the UK Birmingham. (Although an unstable sort *might*, in this case, place the US Birmingham above the UK Birmingham, a stable sort routine would *guarantee* it).
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sort-using-a-custom-comparator.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sort-using-a-custom-comparator.md
index e7e7919d0be..175dd475233 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sort-using-a-custom-comparator.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sort-using-a-custom-comparator.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8016
 title: Sort using a custom comparator
-challengeType: 5
+challengeType: 1
 forumTopicId: 302309
 dashedName: sort-using-a-custom-comparator
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md
index 02b836f4de3..302bb1e6654 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md
@@ -1,20 +1,20 @@
 ---
 id: 5a23c84252665b21eecc8001
 title: Sorting algorithms/Bead sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302310
 dashedName: sorting-algorithmsbead-sort
 ---
 
 # --description--
 
-Sort an array of positive integers using the [Bead Sort Algorithm](https://en.wikipedia.org/wiki/Bead_sort).
+A *bead sort* starts by creating a matrix of zeroes whose length is equal to the value of the largest element in the input array. The matrix is transformed by adding one to all elements between the zeroth index and the index indicated by the current element. This process is repeated, until you have filled the matrix.
 
-A *bead sort* is also known as a *gravity sort*.
+Iterating over the matrix, summing the number of elements greater than zero, then decreasing the value of each element by one yields the sorted array.
 
-The algorithm has O(S), where S is the sum of the integers in the input set: Each bead is moved individually.
+**Note:** Each element in the input array is unique.
 
-This is the case when bead sort is implemented without a mechanism to assist in finding empty spaces below the beads, such as in software implementations.
+Sort an array of positive integers using the Bead Sort Algorithm.
 
 # --hints--
 
@@ -90,31 +90,31 @@ function beadSort(arr) {
 
 ```js
 function beadSort(arr) {
-  var max = 0;
-  for (var i = 0; i < arr.length; i++) if (arr[i] > max) max = arr[i];
-  var grid = new Array(arr.length);
-  for (var i = 0; i < grid.length; i++) {
+  let max = 0;
+  for (let i = 0; i < arr.length; i++) if (arr[i] > max) max = arr[i];
+  const grid = new Array(arr.length);
+  for (let i = 0; i < grid.length; i++) {
     grid[i] = new Array(max);
   }
-  var levelcount = new Array(max);
+  const levelcount = new Array(max);
   levelcount.fill(0);
-  for (var i = 0; i < max; i++) {
+  for (let i = 0; i < max; i++) {
     levelcount[i] = 0;
-    for (var j = 0; j < arr.length; j++) grid[j][i] = '_';
+    for (let j = 0; j < arr.length; j++) grid[j][i] = '_';
   }
-  for (var i = 0; i < arr.length; i++) {
-    var num = arr[i];
-    for (var j = 0; num > 0; j++) {
+  for (let i = 0; i < arr.length; i++) {
+    let num = arr[i];
+    for (let j = 0; num > 0; j++) {
       grid[levelcount[j]++][j] = '*';
       num--;
     }
   }
-  var sorted = new Array(arr.length);
+  const sorted = new Array(arr.length);
   sorted.fill(0);
-  for (var i = 0; i < arr.length; i++) {
-    var putt = 0;
+  for (let i = 0; i < arr.length; i++) {
+    let putt = 0;
     for (
-      var j = 0;
+      let j = 0;
       j < max &&
       (function(c) {
         return c.charCodeAt == null ? c : c.charCodeAt(0);
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md
index 2a7b74b5e3a..638b56d7ea2 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8002
 title: Sorting algorithms/Bogosort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302311
 dashedName: sorting-algorithmsbogosort
 ---
 
 # --description--
 
-[Bogosort](https://en.wikipedia.org/wiki/Bogosort) a list of numbers.
+Bogosort a list of numbers.
 
 Bogosort simply shuffles a collection randomly until it is sorted.
 
@@ -18,7 +18,7 @@ Its average run-time is O(n!) because the chance that any given shuffle of a set
 
 Its best case is O(n) since a single pass through the elements may suffice to order them.
 
-Pseudocode:
+伪代码：
 
 <pre><b>while not</b> InOrder(list) <b>do</b>
   Shuffle(list)
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
index f4c1b63f681..9f8a3bcb821 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
@@ -1,36 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8004
 title: Sorting algorithms/Cocktail sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302312
 dashedName: sorting-algorithmscocktail-sort
 ---
 
 # --description--
 
-The cocktail shaker sort is an improvement on the [Bubble Sort](https://rosettacode.org/wiki/Bubble Sort). The improvement is basically that values "bubble" both directions through the array, because on each iteration the cocktail shaker sort bubble sorts once forwards and once backwards. Pseudocode for the algorithm (from [wikipedia](https://en.wikipedia.org/wiki/Cocktail sort)):
-
-<pre><b>function</b> <i>cocktailSort</i>( A : list of sortable items )
-  <b>do</b>
-    swapped := false
-    <b>for each</b> i <b>in</b> 0 <b>to</b> length( A ) - 2 <b>do</b>
-      <b>if</b> A[ i ] > A[ i+1 ] <b>then</b> <i>// test whether the two</i>
-                                <i>// elements are in the wrong</i>
-                                <i>// order</i>
-        swap( A[ i ], A[ i+1 ] ) <i>// let the two elements</i>
-                                 <i>// change places</i>
-        swapped := true;
-    <b>if</b> swapped = false <b>then</b>
-      <i>// we can exit the outer loop here if no swaps occurred.</i>
-      <b>break do-while loop</b>;
-    swapped := false
-    <b>for each</b> i <b>in</b> length( A ) - 2 <b>down to</b> 0 <b>do</b>
-      <b>if</b> A[ i ] > A[ i+1 ] <b>then</b>
-        swap( A[ i ], A[ i+1 ] )
-        swapped := true;
-  <b>while</b> swapped; <i>// if no elements have been swapped,</i>
-                <i>// then the list is sorted</i>
-</pre>
+The <a href="https://rosettacode.org/wiki/Sorting_algorithms/Cocktail_sort" target="_blank" rel="noopener noreferrer nofollow">cocktail sort</a> is an improvement on the Bubble Sort. Given an array of numbers, the cocktail sort will traverse the array from start to finish, moving the largest number to the end. Then, it will traverse the array backwards and move the smallest number to the start. It repeats these two passes, moving the next largest/smallest number to its correct position in the array until it is sorted.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
index 472ce20af5a..5f19360a31f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8005
 title: Sorting algorithms/Comb sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302313
 dashedName: sorting-algorithmscomb-sort
 ---
@@ -10,20 +10,14 @@ dashedName: sorting-algorithmscomb-sort
 
 Implement a *comb sort*.
 
-The **Comb Sort** is a variant of the [Bubble Sort](https://rosettacode.org/wiki/Bubble Sort).
+The **Comb Sort** is a variant of the Bubble Sort.
 
-Like the [Shell sort](https://rosettacode.org/wiki/Shell sort), the Comb Sort increases the gap used in comparisons and exchanges.
+Like the Shell sort, the Comb Sort increases the gap used in comparisons and exchanges.
 
 Dividing the gap by $(1-e^{-\\varphi})^{-1} \\approx 1.247330950103979$ works best, but 1.3 may be more practical.
 
 Some implementations use the insertion sort once the gap is less than a certain amount.
 
-**Also see**
-
-<ul>
-  <li>the Wikipedia article: <a href='https://en.wikipedia.org/wiki/Comb sort' target='_blank'>Comb sort</a>.</li>
-</ul>
-
 Variants:
 
 <ul>
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
index e3162404d9b..c0315d5275f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8007
 title: Sorting algorithms/Gnome sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302314
 dashedName: sorting-algorithmsgnome-sort
 ---
 
 # --description--
 
-Gnome sort is a sorting algorithm which is similar to [Insertion sort](https://rosettacode.org/wiki/Insertion sort), except that moving an element to its proper place is accomplished by a series of swaps, as in [Bubble Sort](https://rosettacode.org/wiki/Bubble Sort).
+Gnome sort is a sorting algorithm which is similar to <a href="https://rosettacode.org/wiki/Insertion_sort" target="_blank" rel="noopener noreferrer nofollow">Insertion sort</a>, except that moving an element to its proper place is accomplished by a series of swaps, as in <a href="https://rosettacode.org/wiki/Bubble" target="_blank" rel="noopener noreferrer nofollow">Bubble Sort</a>.
 
 The pseudocode for the algorithm is:
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md
index f107df7b79a..f93ad1aac07 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc800b
 title: Sorting algorithms/Pancake sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302315
 dashedName: sorting-algorithmspancake-sort
 ---
 
 # --description--
 
-Write a function to sort an array of integers (of any convenient size) into ascending order using [Pancake sorting](https://en.wikipedia.org/wiki/Pancake sorting). The function should return the sorted array.
+Write a function to sort an array of integers (of any convenient size) into ascending order using Pancake sorting. The function should return the sorted array.
 
 In short, instead of individual elements being sorted, the only operation allowed is to "flip" one end of the list, like so:
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-permutation-sort.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-permutation-sort.md
index d5fc1e3b083..6de2e851229 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-permutation-sort.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-permutation-sort.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc800c
 title: Sorting algorithms/Permutation sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302316
 dashedName: sorting-algorithmspermutation-sort
 ---
@@ -10,7 +10,7 @@ dashedName: sorting-algorithmspermutation-sort
 
 Write a function to implement a permutation sort, which proceeds by generating the possible permutations of the input array until discovering the sorted one. The function should return the sorted array.
 
-Pseudocode:
+伪代码：
 
 <pre><b>while not</b> InOrder(list) <b>do</b>
   nextPermutation(list)
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md
index 09403447320..53f76a0a3a2 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8010
 title: Sorting algorithms/Shell sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302317
 dashedName: sorting-algorithmsshell-sort
 ---
 
 # --description--
 
-Write a function to sort an array of elements using the [Shell sort](https://en.wikipedia.org/wiki/Shell sort) algorithm, a diminishing increment sort. The function should return the sorted array.
+Write a function to sort an array of elements using the Shell sort algorithm, a diminishing increment sort. The function should return the sorted array.
 
 The Shell sort (also known as Shellsort or Shell's method) is named after its inventor, Donald Shell, who published the algorithm in 1959.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md
index ec108886c1f..23819a80eb9 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8012
 title: Sorting algorithms/Stooge sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302318
 dashedName: sorting-algorithmsstooge-sort
 ---
 
 # --description--
 
-Write a function to perform [Stooge Sort](https://en.wikipedia.org/wiki/Stooge sort) on an array of integers. The function should return a sorted array.
+Write a function to perform Stooge Sort on an array of integers. The function should return a sorted array.
 
 The Stooge Sort algorithm is as follows:
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
index d8408782db5..af66009395b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
@@ -1,16 +1,28 @@
 ---
 id: 5a23c84252665b21eecc8013
 title: Sorting algorithms/Strand sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302319
 dashedName: sorting-algorithmsstrand-sort
 ---
 
 # --description--
 
-Write a function to sort an array using the [Strand sort](https://en.wikipedia.org/wiki/Strand sort). The function should return the sorted array.
+The **Strand sort** creates sorted subsets that are merged to create the final result.
+
+Consider an `unsortedArray = [3, 1, 4, 2]`. Pick the first item `3` and copy it into a separate array. Search for any bigger item following this item. When you find the a larger item, in this case `4`, copy it to the separate array, `[3, 4]`, and compare the following items to this new value, `4`.
+
+After you have reached the end of the array, remove the items you copied, `[3, 4]`, and start again with the first item remaining in the `unsortedArray`, in this case `1`.
+
+Following this process results in two sorted arrays, `[3, 4]` and `[1, 2]`. Merge these two arrays to create the `strandSortedArray`.
+
+```js
+const unsortedArray = [3, 1, 4, 2];
+const strandsortedArray = [1, 2, 3, 4];
+```
+
+Write a function to sort an array using the **Strand sort**. The function should return the sorted array.
 
-This is a way of sorting numbers by extracting shorter sequences of already sorted numbers from an unsorted list.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/soundex.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/soundex.md
index b7574b38375..b51c5bc6b71 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/soundex.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/soundex.md
@@ -1,14 +1,24 @@
 ---
 id: 5a23c84252665b21eecc8017
 title: Soundex
-challengeType: 5
+challengeType: 1
 forumTopicId: 302320
 dashedName: soundex
 ---
 
 # --description--
 
-Soundex is an algorithm for creating indices for words based on their pronunciation. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling (from [the WP article](https://en.wikipedia.org/wiki/soundex)). There is a major issue in many of the implementations concerning the separation of two consonants that have the same soundex code! According to the [official Rules](https://www.archives.gov/research/census/soundex.html). So check for instance if **Ashcraft** is coded to **A-261**.
+**Soundex Algorithm** deals with the *intentions* of the words. It creates a representation for similar sounding words.
+
+It is used for searching <em>names</em> and <em>addresses</em>. This means that the person who filled in the <em>name</em>, can focus on how it sounds instead of correcting the spelling of <em>names</em>.
+
+For example:
+
+If you are hearing the name `Quenci` for the first time, and misspelled it, you will get **Soundex** code `Q520`.
+
+When you spell the name `Quincy` correctly next time, you will still get the same code `Q520`, which means you can link multiple name pronunciations into the same <em>person</em> without the need for adding every spelling.
+
+Here is the rules: 
 
 <ul>
   <li>If a vowel (A, E, I, O, U) separates two consonants that have the same soundex code, the consonant to the right of the vowel is coded. Tymczak is coded as T-522 (T, 5 for the M, 2 for the C, Z ignored (see "Side-by-Side" rule above), 2 for the K). Since the vowel "A" separates the Z and K, the K is coded.</li>
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/spiral-matrix.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/spiral-matrix.md
index 14da95f5a2f..fbdd024181b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/spiral-matrix.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/spiral-matrix.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc801c
 title: Spiral matrix
-challengeType: 5
+challengeType: 1
 forumTopicId: 302321
 dashedName: spiral-matrix
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/split-a-character-string-based-on-change-of-character.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/split-a-character-string-based-on-change-of-character.md
index 4bb28fba9a6..5a7cd85889d 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/split-a-character-string-based-on-change-of-character.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/split-a-character-string-based-on-change-of-character.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc801d
 title: Split a character string based on change of character
-challengeType: 5
+challengeType: 1
 forumTopicId: 302322
 dashedName: split-a-character-string-based-on-change-of-character
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/state-name-puzzle.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/state-name-puzzle.md
index d22ef19220a..841319d1bda 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/state-name-puzzle.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/state-name-puzzle.md
@@ -1,18 +1,21 @@
 ---
 id: 5a23c84252665b21eecc8024
 title: State name puzzle
-challengeType: 5
+challengeType: 1
 forumTopicId: 302323
 dashedName: state-name-puzzle
 ---
 
 # --description--
 
-This task is inspired by Mark Nelson's DDJ Column "Wordplay" and one of the weekly puzzle challenges from Will Shortz on NPR Weekend Edition [\[1\]](https://www.npr.org/templates/story/story.php?storyId=9264290) and originally attributed to David Edelheit. The challenge was to take the names of two U.S. States, mix them all together, then rearrange the letters to form the names of two *different* U.S. States (so that all four state names differ from one another). What states are these? The problem was reissued on [the Unicon Discussion Web](https://tapestry.tucson.az.us/twiki/bin/view/Main/StateNamesPuzzle) which includes several solutions with analysis. Several techniques may be helpful and you may wish to refer to [Gödel numbering](https://en.wikipedia.org/wiki/Goedel_numbering), [equivalence relations](https://en.wikipedia.org/wiki/Equivalence_relation), and [equivalence classes](https://en.wikipedia.org/wiki/Equivalence_classes). The basic merits of these were discussed in the Unicon Discussion Web. A second challenge in the form of a set of fictitious new states was also presented.
+**State name** is a <em>word puzzle</em> in which you take the letters from two U.S. state names and rearrange them to form the names of two different U.S. states.
+
 
 # --instructions--
 
-Write a function to solve the challenge for the given array of names of states. The function should return an array. Each element should be an object in this form: `{"from":[],"to":[]}`. The "from" array should contain the original names and the "to" array should contain the resultant names.
+Write a function to solve the challenge for a given array of actual U.S. state names, and for fictional state names.
+
+The function should return an array. Each element should be an object in this form: `{"from":[],"to":[]}`. The `"from"` array should contain the original names and the `"to"` array should contain the resultant names.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
index 55580822989..a0030994da2 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8028
 title: Stern-Brocot sequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 302324
 dashedName: stern-brocot-sequence
 ---
 
 # --description--
 
-For this task, the Stern-Brocot sequence is to be generated by an algorithm similar to that employed in generating the [Fibonacci sequence](https://rosettacode.org/wiki/Fibonacci sequence).
+For this task, the Stern-Brocot sequence is to be generated by an algorithm similar to that employed in generating the <a href="https://rosettacode.org/wiki/Fibonacci_sequence" target="_blank" rel="noopener noreferrer nofollow">Fibonacci sequence</a>.
 
 <ol>
   <li>The first and second members of the sequence are both 1:</li>
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md
index e89ca872e69..6181ad81245 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md
@@ -1,14 +1,20 @@
 ---
 id: 5a23c84252665b21eecc8029
 title: Straddling checkerboard
-challengeType: 5
+challengeType: 1
 forumTopicId: 302325
 dashedName: straddling-checkerboard
 ---
 
 # --description--
 
-Implement functions to encrypt and decrypt a message using the [straddling checkerboard](https://en.wikipedia.org/wiki/Straddling_checkerboard) method. The functions will take a string and an array as parameters. The array has 3 strings representing the 3 rows of the checkerboard. The output will be a series of decimal digits. Numbers should be encrypted by inserting the escape character before each digit, then including the digit unencrypted. This should be reversed for decryption.
+Implement functions to encrypt and decrypt a message using the **straddling checkerboard** method.
+
+Each function will take two arguments, a `message` string and an `alphabet` array. The `alphabet` array will contain 3 strings representing the 3 rows of the straddling checkerboard.
+
+The output of the `straddle()` function should be a series of decimal digits. Numbers should be encrypted by inserting the escape character before each digit, then including the digit <em>unencrypted</em>.
+
+This should be reversed for decryption with the `unstraddle()` function.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/stream-merge.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/stream-merge.md
index 234158bb509..9e2c93138d7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/stream-merge.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/stream-merge.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc802a
 title: Stream Merge
-challengeType: 5
+challengeType: 1
 forumTopicId: 302326
 dashedName: stream-merge
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/strip-control-codes-and-extended-characters-from-a-string.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/strip-control-codes-and-extended-characters-from-a-string.md
index 317f9dd7b7e..5207f260b42 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/strip-control-codes-and-extended-characters-from-a-string.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/strip-control-codes-and-extended-characters-from-a-string.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8036
 title: Strip control codes and extended characters from a string
-challengeType: 5
+challengeType: 1
 forumTopicId: 302327
 dashedName: strip-control-codes-and-extended-characters-from-a-string
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/subleq.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/subleq.md
index d302bb9f993..1dc7987cf77 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/subleq.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/subleq.md
@@ -1,37 +1,29 @@
 ---
 id: 5a23c84252665b21eecc8038
 title: Subleq
-challengeType: 5
+challengeType: 1
 forumTopicId: 302328
 dashedName: subleq
 ---
 
 # --description--
 
-[Subleq](https://rosettacode.org/wiki/eso:Subleq) is an example of a [One-Instruction Set Computer (OISC)](https://en.wikipedia.org/wiki/One_instruction_set_computer).
+Subleq is an example of a One-Instruction Set Computer (OISC).
 
-It is named after its only instruction, which is **SU**btract and **B**ranch if **L**ess than or **EQ**ual
-
-to zero.
+It is named after its only instruction, which is **SU**btract and **B**ranch if **L**ess than or **EQ**ual to zero.
 
 Your task is to create an interpreter which emulates such a machine.
 
-The machine's memory consists of an array of signed integers. Any reasonable word size is fine, but the memory must be
-
-able to hold negative as well as positive numbers.
+The machine's memory consists of an array of signed integers. Any reasonable word size is fine, but the memory must be able to hold negative as well as positive numbers.
 
 Execution begins with the instruction pointer aimed at the first word, which is address 0. It proceeds as follows:
 
 <ol>
   <li>Let A, B, and C be the value stored in the three consecutive words in memory starting at the instruction pointer.</li>
   <li>Advance the instruction pointer 3 words to point at the address after the one containing C.</li>
-  <li>If A is -1, then a character is read from standard input and its code point stored in the address given by B. C
-    is unused.</li>
-  <li>If B is -1, then the number contained in the address given by A is interpreted as a code point and the
-    corresponding character output. C is again unused.</li>
-  <li>Otherwise, both A and B are treated as the addresses of memory locations. The number contained in the address
-    given by A is subtracted from the number at the address given by B (and the result stored back in address B). If
-    the result is zero or negative, the value C becomes the new instruction pointer.</li>
+  <li>If A is -1, then a character is read from standard input and its code point stored in the address given by B. C is unused.</li>
+  <li>If B is -1, then the number contained in the address given by A is interpreted as a code point and the corresponding character output. C is again unused.</li>
+  <li>Otherwise, both A and B are treated as the addresses of memory locations. The number contained in the address given by A is subtracted from the number at the address given by B (and the result stored back in address B). If the result is zero or negative, the value C becomes the new instruction pointer.</li>
   <li>If the instruction pointer becomes negative, execution halts.</li>
 </ol>
 
@@ -39,15 +31,7 @@ Other negative addresses besides -1 may be treated as equivalent to -1, or gener
 
 Your solution should accept a program to execute on the machine, separately from the input fed to the program itself.
 
-This program should be in raw subleq "machine code" - whitespace-separated decimal numbers, with no symbolic names or
-
-other assembly-level extensions, to be loaded into memory starting at address 0. Show the output of your solution when
-
-fed this "Hello, world!" program. (Note that the example assumes ASCII or a superset of it, such as any of the Latin-N
-
-character sets or Unicode. You may translate it into another character set if your implementation is on a
-
-non-ASCiI-compatible environment.)
+This program should be in raw subleq "machine code" - whitespace-separated decimal numbers, with no symbolic names or other assembly-level extensions, to be loaded into memory starting at address 0. Show the output of your solution when fed this "Hello, world!" program. (Note that the example assumes ASCII or a superset of it, such as any of the Latin-N character sets or Unicode. You may translate it into another character set if your implementation is on a non-ASCiI-compatible environment.)
 
 <pre>15 17 -1 17 -1 -1 16 1 -1 16 3 -1 15 15 0 0 -1 72 101 108 108 111 44 32 119 111 114 108 100 33 10 0</pre>
 
@@ -66,9 +50,7 @@ message: "Hello, world!\n\0"
 
 # --instructions--
 
-Write a function that takes an array of integers as a parameter. This represents the memory elements. The function
-
-should interpret the sequence and return the output string. For this task, assume that there is no standard input.
+Write a function that takes an array of integers as a parameter. This represents the memory elements. The function should interpret the sequence and return the output string. For this task, assume that there is no standard input.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sudoku.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sudoku.md
index e0f6864a89e..01bdc0854df 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sudoku.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sudoku.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc803c
 title: Sudoku
-challengeType: 5
+challengeType: 1
 forumTopicId: 302329
 dashedName: sudoku
 ---
 
 # --description--
 
-Write a function to solve a partially filled-in normal 9x9 [Sudoku](https://en.wikipedia.org/wiki/Sudoku) grid and return the result. The blank fields are represented by `-1`. [Algorithmics of Sudoku](https://en.wikipedia.org/wiki/Algorithmics_of_sudoku) may help implement this.
+Write a function to solve a partially filled-in normal 9x9 Sudoku grid and return the result. The blank fields are represented by `-1`.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sum-digits-of-an-integer.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sum-digits-of-an-integer.md
index d13a1bdb030..077d606d4c7 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sum-digits-of-an-integer.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sum-digits-of-an-integer.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc803f
 title: Sum digits of an integer
-challengeType: 5
+challengeType: 1
 forumTopicId: 302331
 dashedName: sum-digits-of-an-integer
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sum-multiples-of-3-and-5.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sum-multiples-of-3-and-5.md
index f92d5b9d218..d5f7e93da8f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sum-multiples-of-3-and-5.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sum-multiples-of-3-and-5.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8040
 title: Sum multiples of 3 and 5
-challengeType: 5
+challengeType: 1
 forumTopicId: 302332
 dashedName: sum-multiples-of-3-and-5
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sum-of-a-series.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sum-of-a-series.md
index 6ffa6d152f7..7d649eee959 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sum-of-a-series.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sum-of-a-series.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8041
 title: Sum of a series
-challengeType: 5
+challengeType: 1
 forumTopicId: 302333
 dashedName: sum-of-a-series
 ---
 
 # --description--
 
-Compute the **n**<sup>th</sup> term of a [series](https://en.wikipedia.org/wiki/Series (mathematics)), i.e. the sum of the **n** first terms of the corresponding [sequence](https://en.wikipedia.org/wiki/sequence). Informally this value, or its limit when **n** tends to infinity, is also called the *sum of the series*, thus the title of this task. For this task, use: $S_n = \displaystyle\sum_{k=1}^n \frac{1}{k^2}$.
+Compute the **n**<sup>th</sup> term of a <em>series</em>, i.e. the sum of the **n** first terms of the corresponding <em>sequence</em>. 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/10-coding-interview-prep/rosetta-code/sum-of-squares.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sum-of-squares.md
index d211cbc1657..ee55a5bfea5 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sum-of-squares.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sum-of-squares.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8042
 title: Sum of squares
-challengeType: 5
+challengeType: 1
 forumTopicId: 302334
 dashedName: sum-of-squares
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sum-to-100.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sum-to-100.md
index f30b422ba87..e616195233d 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sum-to-100.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sum-to-100.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8043
 title: Sum to 100
-challengeType: 5
+challengeType: 1
 forumTopicId: 302335
 dashedName: sum-to-100
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
index 50fe64ed639..50ad887d282 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8045
 title: Sutherland-Hodgman polygon clipping
-challengeType: 5
+challengeType: 1
 forumTopicId: 302336
 dashedName: sutherland-hodgman-polygon-clipping
 ---
 
 # --description--
 
-The [Sutherland-Hodgman clipping algorithm](https://en.wikipedia.org/wiki/Sutherland-Hodgman clipping algorithm) finds the polygon that is the intersection between an arbitrary polygon (the "subject polygon") and a convex polygon (the "clip polygon"). It is used in computer graphics (especially 2D graphics) to reduce the complexity of a scene being displayed by eliminating parts of a polygon that do not need to be displayed. Take the closed polygon defined by the points:
+The Sutherland-Hodgman clipping algorithm finds the polygon that is the intersection between an arbitrary polygon (the "subject polygon") and a convex polygon (the "clip polygon"). It is used in computer graphics (especially 2D graphics) to reduce the complexity of a scene being displayed by eliminating parts of a polygon that do not need to be displayed. Take the closed polygon defined by the points:
 
 <pre>[(50, 150), (200, 50), (350, 150), (350, 300), (250, 300), (200, 250), (150, 350), (100, 250), (100, 200)]</pre>
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/symmetric-difference.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/symmetric-difference.md
index 7009bce4617..bf8d98a2c7f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/symmetric-difference.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/symmetric-difference.md
@@ -1,14 +1,18 @@
 ---
 id: 5a23c84252665b21eecc8046
 title: Symmetric difference
-challengeType: 5
+challengeType: 1
 forumTopicId: 16086
 dashedName: symmetric-difference
 ---
 
 # --description--
 
-Given two [set](https://rosettacode.org/wiki/set)s *A* and *B*, compute $(A \\setminus B) \\cup (B \\setminus A).$ That is, enumerate the items that are in *A* or *B* but not both. This set is called the [symmetric difference](https://en.wikipedia.org/wiki/Symmetric difference) of *A* and *B*. In other words: $(A \\cup B) \\setminus (A \\cap B)$ (the set of items that are in at least one of *A* or *B* minus the set of items that are in both *A* and *B*).
+Given two sets *A* and *B*, compute $(A \\setminus B) \\cup (B \\setminus A).$ That is, enumerate the items that are in *A* or *B* but not both. This set is called the symmetric difference of *A* and *B*. In other words: $(A \\cup B) \\setminus (A \\cap B)$ (the set of items that are in at least one of *A* or *B* minus the set of items that are in both *A* and *B*).
+
+Example:
+
+For sets `A = [1, 2, 3]`, and `B = [1, 3, 4]`, the symmetric difference of *A* and *B* is `[2, 4]`.
 
 # --instructions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/taxicab-numbers.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/taxicab-numbers.md
index 895b46ef050..e968d091577 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/taxicab-numbers.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/taxicab-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 594ecc0d9a8cf816e3340187
 title: Taxicab numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 302337
 dashedName: taxicab-numbers
 ---
 
 # --description--
 
-A [taxicab number](https://en.wikipedia.org/wiki/Hardy–Ramanujan number "wp: Hardy–Ramanujan number") (the definition that is being used here) is a positive integer that can be expressed as the sum of two positive cubes in more than one way.
+A taxicab number (the definition that is being used here) is a positive integer that can be expressed as the sum of two positive cubes in more than one way.
 
 The first taxicab number is `1729`, which is:
 
@@ -29,13 +29,6 @@ Taxicab numbers are also known as:
 
 Write a function that returns the lowest `n` taxicab numbers. For each of the taxicab numbers, show the number as well as its constituent cubes.
 
-**See also:**
-
-<ul>
-  <li><a href='https://oeis.org/A001235' target='_blank'>A001235 taxicab numbers</a> on The On-Line Encyclopedia of Integer Sequences.</li>
-  <li><a href='https://en.wikipedia.org/wiki/Taxicab_number' target='_blank'>taxicab number</a> on Wikipedia.</li>
-</ul>
-
 # --hints--
 
 `taxicabNumbers` should be a function.
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/tokenize-a-string-with-escaping.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/tokenize-a-string-with-escaping.md
index 24a65a163e8..6c5110c3f1c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/tokenize-a-string-with-escaping.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/tokenize-a-string-with-escaping.md
@@ -1,14 +1,14 @@
 ---
 id: 594faaab4e2a8626833e9c3d
-title: Tokenize a string with escaping
-challengeType: 5
+title: 使用转义标记字符串
+challengeType: 1
 forumTopicId: 302338
 dashedName: tokenize-a-string-with-escaping
 ---
 
 # --description--
 
-Write a function or program that can split a string at each non-escaped occurrence of a separator character.
+编写一个函数或程序，可以在分隔符的每个非转义出现处拆分字符串。
 
 It should accept three input parameters:
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/top-rank-per-group.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/top-rank-per-group.md
index 56cd2843797..b32c3f2a2a6 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/top-rank-per-group.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/top-rank-per-group.md
@@ -1,7 +1,7 @@
 ---
 id: 595011cba5a81735713873bd
 title: Top rank per group
-challengeType: 5
+challengeType: 1
 forumTopicId: 302339
 dashedName: top-rank-per-group
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/topological-sort.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/topological-sort.md
index f57d218e66c..8b9939feb29 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/topological-sort.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/topological-sort.md
@@ -1,7 +1,7 @@
 ---
 id: 594fa2746886f41f7d8bf225
 title: Topological sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302340
 dashedName: topological-sort
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
index 4de9c851ba4..596164f14b5 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
@@ -1,20 +1,20 @@
 ---
 id: 5951ed8945deab770972ae56
 title: Towers of Hanoi
-challengeType: 5
+challengeType: 1
 forumTopicId: 302341
 dashedName: towers-of-hanoi
 ---
 
 # --description--
 
-Solve the [Towers of Hanoi](https://en.wikipedia.org/wiki/Towers_of_Hanoi "wp: Towers_of_Hanoi") problem.
+Solve the Towers of Hanoi problem. The number of objects will be given as the first parameter, followed by the strings used to identify each stack of objects. Create a nested array containing the list of moves, `["source", "destination"]`.
 
-Your solution should accept the number of discs as the first parameters, and three string used to identify each of the three stacks of discs, for example `towerOfHanoi(4, 'A', 'B', 'C')`. The function should return an array of arrays containing the list of moves, source -> destination.
+For example, the parameters `(4, 'A', 'B', 'C')`, will result in nested array of moves `[['A', 'C'], ['B', 'A']]`, indicating that the 1st move was to move an object from stack `A` to `C` and the 2nd move was to move an object from stack `B` to `A`.
 
-For example, the array `[['A', 'C'], ['B', 'A']]` indicates that the 1st move was to move a disc from stack A to C, and the 2nd move was to move a disc from stack B to A.
+# --instructions--
 
-<p></p>
+Write a function that returns the moves to stack the objects in a nested array.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/vector-cross-product.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/vector-cross-product.md
index 4dab99b445a..3c3f7d17f99 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/vector-cross-product.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/vector-cross-product.md
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339ad2
 title: Vector cross product
-challengeType: 5
+challengeType: 1
 forumTopicId: 302342
 dashedName: vector-cross-product
 ---
@@ -12,7 +12,7 @@ A vector is defined as having three dimensions as being represented by an ordere
 
 # --instructions--
 
-Write a function that takes two vectors (arrays) as input and computes their cross product. Your function should return `null` on invalid inputs such as vectors of different lengths.
+Write a function that takes two vectors (arrays) as input and computes their cross product. 该函数应该在无效输入（例如不同长度的向量）上返回 `null`。
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/vector-dot-product.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/vector-dot-product.md
index fb8ae242aed..447edc27d7f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/vector-dot-product.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/vector-dot-product.md
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339ad3
 title: Vector dot product
-challengeType: 5
+challengeType: 1
 forumTopicId: 302343
 dashedName: vector-dot-product
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/word-frequency.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/word-frequency.md
index 70d2d054dca..aff883e5d51 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/word-frequency.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/word-frequency.md
@@ -1,7 +1,7 @@
 ---
 id: 5e94a54cc7b022105bf0fd2c
 title: Word frequency
-challengeType: 5
+challengeType: 1
 forumTopicId: 393913
 dashedName: word-frequency
 ---
@@ -12,7 +12,7 @@ Given a text string and an integer n, return the n most common words in the file
 
 # --instructions--
 
-Write a function to count the occurrences of each word and return the n most commons words along with the number of their occurences in decreasing frequency.
+Write a function to count the occurrences of each word and return the n most commons words along with the number of their occurrences in decreasing frequency.
 
 The function should return a 2D array with each of the elements in the following form: `[word, freq]`. `word` should be the lowercase version of the word and `freq` the number denoting the count.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/word-wrap.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/word-wrap.md
index 344be87802e..5ea8d8161da 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/word-wrap.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/word-wrap.md
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339ad4
 title: Word wrap
-challengeType: 5
+challengeType: 1
 forumTopicId: 302344
 dashedName: word-wrap
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/y-combinator.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/y-combinator.md
index f76ab91e3c8..0c867176bc4 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/y-combinator.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/y-combinator.md
@@ -1,22 +1,20 @@
 ---
 id: 594810f028c0303b75339ad5
 title: Y combinator
-challengeType: 5
+challengeType: 1
 forumTopicId: 302345
 dashedName: y-combinator
 ---
 
 # --description--
 
-In strict [functional programming](https://en.wikipedia.org/wiki/Functional programming "wp: functional programming") and the [lambda calculus](https://en.wikipedia.org/wiki/lambda calculus "wp: lambda calculus"), functions (lambda expressions) don't have state and are only allowed to refer to arguments of enclosing functions. This rules out the usual definition of a recursive function wherein a function is associated with the state of a variable and this variable's state is used in the body of the function. The [Y combinator](https://mvanier.livejournal.com/2897.html) is itself a stateless function that, when applied to another stateless function, returns a recursive version of the function. The Y combinator is the simplest of the class of such functions, called [fixed-point combinators](https://en.wikipedia.org/wiki/Fixed-point combinator "wp: fixed-point combinator").
+In strict <a href="https://www.freecodecamp.org/news/the-principles-of-functional-programming/" target="_blank" rel="noopener noreferrer nofollow">functional programming</a> and the lambda calculus, functions (lambda expressions) don't have state and are only allowed to refer to arguments of enclosing functions. This rules out the usual definition of a recursive function wherein a function is associated with the state of a variable and this variable's state is used in the body of the function.
+
+The Y combinator is itself a stateless function that, when applied to another stateless function, returns a recursive version of the function. The Y combinator is the simplest of the class of such functions, called fixed-point combinators.
 
 # --instructions--
 
-Define the stateless Y combinator function and use it to compute [factorial](https://en.wikipedia.org/wiki/Factorial "wp: factorial"). The `factorial(N)` function is already given to you. **See also:**
-
-<ul>
-  <li><a href="https://vimeo.com/45140590" target="_blank">Jim Weirich: Adventures in Functional Programming</a>.</li>
-</ul>
+Define the stateless Y combinator function and use it to compute the factorials. The `factorial(N)` function is already given to you.
 
 # --hints--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/zeckendorf-number-representation.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/zeckendorf-number-representation.md
index 7794021986e..27ab1af3d3c 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/zeckendorf-number-representation.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/zeckendorf-number-representation.md
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339ad6
 title: Zeckendorf number representation
-challengeType: 5
+challengeType: 1
 forumTopicId: 302346
 dashedName: zeckendorf-number-representation
 ---
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
index d3970f2f72c..ceaafe5ba5d 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339ad7
 title: Zhang-Suen thinning algorithm
-challengeType: 5
+challengeType: 1
 forumTopicId: 302347
 dashedName: zhang-suen-thinning-algorithm
 ---
@@ -40,7 +40,7 @@ It produces the thinned output:
   '                               ' ];
 ```
 
-## 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:
 
@@ -51,7 +51,7 @@ Obviously the boundary pixels of the image cannot have the full eight neighbours
 - 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:**
+**步骤 1：**
 
 All pixels are tested and pixels satisfying all the following conditions (simultaneously) are just noted at this stage.
 
@@ -63,7 +63,7 @@ All pixels are tested and pixels satisfying all the following conditions (simult
 
 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:**
+**步骤 2：**
 
 All pixels are again tested and pixels satisfying all the following conditions are just noted at this stage.
 
@@ -73,11 +73,11 @@ All pixels are again tested and pixels satisfying all the following conditions a
 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.
+在迭代图像并收集满足所有步骤 2 条件的所有像​​素后，所有这些满足条件的像素再次设置为白色。
 
 **Iteration:**
 
-If any pixels were set in this round of either step 1 or step 2 then all steps are repeated until no image pixels are so changed.
+如果在这轮步骤 1 或步骤 2 中设置了任何像素，则重复所有步骤，直到没有图像像素发生如此变化。
 
 # --instructions--
 
@@ -85,19 +85,19 @@ Write a routine to perform Zhang-Suen thinning on the provided `image`, an array
 
 # --hints--
 
-`thinImage` should be a function.
+`thinImage` 应该是一个函数。
 
 ```js
 assert.equal(typeof thinImage, 'function');
 ```
 
-`thinImage` should return an array.
+`thinImage` 应该返回一个数组。
 
 ```js
 assert(Array.isArray(thinImage(_testImage1)));
 ```
 
-`thinImage` should return an array of strings.
+`thinImage` 应该返回一个字符串数组。
 
 ```js
 assert.equal(typeof thinImage(_testImage1)[0], 'string');
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md
index 4f5277c28ad..bcda651cb26 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md
@@ -1,14 +1,14 @@
 ---
 id: 594810f028c0303b75339ad8
-title: Zig-zag matrix
-challengeType: 5
+title: 之字形矩阵
+challengeType: 1
 forumTopicId: 302348
 dashedName: zig-zag-matrix
 ---
 
 # --description--
 
-A 'zig-zag' array is a square arrangement of the first $N^2$ integers, where the numbers increase sequentially as you zig-zag along the array's [anti-diagonals](https://en.wiktionary.org/wiki/antidiagonal).
+A 'zig-zag' array is a square arrangement of the first $N^2$ integers, where the numbers increase sequentially as you zig-zag along the array's anti-diagonals.
 
 For example, for the input `5`, the following result should be produced:
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
index 35f9887785d..c42f5e31a11 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
@@ -8,9 +8,9 @@ dashedName: build-a-freecodecamp-forum-homepage
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/JqdoMV>.
+**Objective:** Build an app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/JqdoMV>.
 
-Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+Fulfill the below user stories and get all of the tests to pass. 使用你需要的任何库或 API。 赋予它你自己的个人风格。
 
 **User Story:** I can see a list of the most recent posts on the freeCodeCamp forum.
 
@@ -20,9 +20,9 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 **Hint:** To get the 30 most recent forum posts: <https://forum-proxy.freecodecamp.rocks/latest>.
 
-When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+完成后，单击“我已完成此挑战”按钮并包含指向 CodePen 的链接。
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
index 5cf03cdd2a3..a53cb6ea547 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
@@ -8,27 +8,27 @@ dashedName: build-a-light-bright-app
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/eyLYXE>.
+**Objective:** Build an app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/eyLYXE>.
 
-**Rule #1:** Don't look at the example project's code. Figure it out for yourself.
+**规则＃1：** 不要查看示例项目的代码。 自己搞清楚。
 
-**Rule #2:** Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+**Rule #2:** Fulfill the below user stories and get all of the tests to pass. 使用你需要的任何库或 API。 赋予它你自己的个人风格。
 
-**User Story:** I can click or drag the mouse cursor to color the circles.
+**用户故事：** 我可以单击或拖动鼠标光标为圆圈着色。
 
-**User Story:** I can double-click on a colored circle to remove the color.
+**用户故事：** 我可以双击彩色圆圈去除颜色。
 
-**User Story:** I can click on a colored circle to change its color.
+**用户故事：** 我可以点击彩色圆圈来改变它的颜色。
 
-**User Story:** I should get a circle of different color on each click.
+**用户故事：** 每次点击我都会得到一个不同颜色的圆圈。
 
-**User Story:** I can click on the 'Reset' button to remove the recent color.
+**用户故事：** 我可以点击“重置”按钮删除最近的颜色。
 
-**User Story:** I can click on the 'Reset All' button to remove all the colors from the circles.
+**用户故事：** 我可以单击“全部重置”按钮删除圆圈中的所有颜色。
 
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
index 5d39e057a64..2c43d6b8853 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
@@ -1,6 +1,6 @@
 ---
 id: bd7158d8c443eddfaeb5bdff
-title: Build a Nightlife Coordination App
+title: 建立夜生活协调应用程序
 challengeType: 4
 forumTopicId: 302351
 dashedName: build-a-nightlife-coordination-app
@@ -8,19 +8,19 @@ dashedName: build-a-nightlife-coordination-app
 
 # --description--
 
-Build a full stack JavaScript app that is functionally similar to this: <https://yoyo44.herokuapp.com/>. Use a site builder of your choice to complete the project.
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://yoyo44.herokuapp.com/" target="_blank" rel="noopener noreferrer nofollow">https://yoyo44.herokuapp.com/</a>. Use a site builder of your choice to complete the project.
 
 Here are the specific user stories you should implement for this project:
 
 **User Story:** As an unauthenticated user, you can view all bars in my area.
 
-**User Story:** As an authenticated user, you can add myself to a bar to indicate you am going there tonight.
+**用户故事：** 作为一名经过身份验证的用户，我可以将自己添加到一个栏中，以表明我今晚要去那里。
 
-**User Story:** As an authenticated user, you can remove myself from a bar if you no longer want to go there.
+**用户故事：** 作为一名经过身份验证的用户，如果我不想再去那里，我可以将自己从酒吧中删除。
 
-**User Story:** As an unauthenticated user, when you login you should not have to search again.
+**用户故事：** 作为未经身份验证的用户，当我登录时，我不需要再次搜索。
 
-**Hint:** Try using the [Yelp API](https://www.yelp.com/developers/documentation/v3) to find venues in the cities your users search for. If you use Yelp's API, be sure to mention so in your app.
+**Hint:** Try using the Yelp API to find venues in the cities your users search for. 如果使用 Yelp 的 API，请务必在应用中提及。
 
 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.
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
index bd190875b3b..3020d0b7ee8 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
@@ -8,9 +8,9 @@ dashedName: build-a-pinterest-clone
 
 # --description--
 
-**Objective:** Build a [Replit](https://replit.com/) app that is functionally similar to this: <https://build-a-pinterest-clone.freecodecamp.rocks/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://build-a-pinterest-clone.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://build-a-pinterest-clone.freecodecamp.rocks/</a>.
 
-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.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** As an unauthenticated user, I can login with GitHub.
 
@@ -24,11 +24,11 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 **User Story:** As an authenticated user, if I upload an image that is broken, it will be replaced by a placeholder image. (can use jQuery broken image detection)
 
-**Hint:** [Masonry.js](https://masonry.desandro.com/) is a library that allows for Pinterest-style image grids.
+**Hint:** Masonry.js is a library that allows for Pinterest-style image grids.
 
 Once you've finished implementing these user stories, enter the URL to your live app and, optionally, your GitHub repository. Then click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-pong-game.md b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
index cfa0cc598b6..2281c76d67f 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
@@ -8,23 +8,23 @@ dashedName: build-a-pong-game
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/satyamdev/full/pdMmBp>.
+**Objective:** Build an app that is functionally similar to this: <https://codepen.io/satyamdev/full/pdMmBp>.
 
-**Rule #1:** Don't look at the example project's code. Figure it out for yourself.
+**规则＃1：** 不要查看示例项目的代码。 自己搞清楚。
 
-**Rule #2:** Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+**Rule #2:** Fulfill the below user stories and get all of the tests to pass. 使用你需要的任何库或 API。 赋予它你自己的个人风格。
 
 **User Story:** I can control a paddle.
 
-**User Story:** The computer can control the other paddle.
+**用户故事：** 计算机可以控制另一个拨片。
 
-**User Story:** The computer's paddle is unbeatable. It should never miss the ball.
+**用户故事：** 计算机的拨片是无法战胜的。 它绝不应该错过球。
 
-**User Story:** The game keeps track of the player and computer's score.
+**用户故事：** 游戏记录玩家和计算机的分数。
 
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
index 7817e26951d..c457e33ccc1 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
@@ -8,9 +8,9 @@ dashedName: build-a-recipe-box
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/dNVazZ/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/dNVazZ/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/dNVazZ/</a>.
 
-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.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I can create recipes that have names and ingredients.
 
@@ -28,7 +28,7 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
index de57859782b..e9e8a78a4a1 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
@@ -1,6 +1,6 @@
 ---
 id: bd7153d8c242eddfaeb5bd13
-title: Build a Roguelike Dungeon Crawler Game
+title: 建立一个 Roguelike Dungeon Crawler 游戏
 challengeType: 3
 forumTopicId: 302355
 dashedName: build-a-roguelike-dungeon-crawler-game
@@ -8,9 +8,9 @@ dashedName: build-a-roguelike-dungeon-crawler-game
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/apLXEJ/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/apLXEJ/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/apLXEJ/</a>.
 
-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.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I have health, a level, and a weapon. I can pick up a better weapon. I can pick up health items.
 
@@ -32,7 +32,7 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-simon-game.md b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
index 5bc458abb1d..2ff2d760541 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
@@ -8,9 +8,9 @@ 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/freeCodeCamp/full/obYBjE).
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/obYBjE" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/obYBjE</a>.
 
-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.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I am presented with a random series of button presses.
 
@@ -32,7 +32,7 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
index bf79eae711d..2f79f73178e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
@@ -8,9 +8,9 @@ dashedName: build-a-tic-tac-toe-game
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/KzXQgy/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/KzXQgy/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/KzXQgy/</a>.
 
-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.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I can play a game of Tic Tac Toe with the computer.
 
@@ -20,7 +20,7 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-voting-app.md b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-voting-app.md
index 3e6e257ce88..c5e1f8c05dd 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-voting-app.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-voting-app.md
@@ -8,7 +8,7 @@ dashedName: build-a-voting-app
 
 # --description--
 
-Build a full stack JavaScript app that is functionally similar to this: <https://voting-app.freecodecamp.rocks/>. Use a site builder of your choice to complete the project.
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://voting-app.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://voting-app.freecodecamp.rocks/</a>. Use a site builder of your choice to complete the project.
 
 Here are the specific user stories you should implement for this project:
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
index d4cf3b350f7..adcef83386e 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
@@ -8,23 +8,21 @@ dashedName: build-a-wikipedia-viewer
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/wGqEga/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/wGqEga/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/wGqEga/</a>.
 
-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.
+The MediaWiki software powers Wikipedia, and it helps you collect and organize knowledge and make it available to people.
+
+Using the MediaWiki API, replicate the search function and random article function, similar to the example app above. You can use Wikipedia as your data source.
+
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I can search Wikipedia entries in a search box and see the resulting Wikipedia entries.
 
 **User Story:** I can click a button to see a random Wikipedia entry.
 
-Hint #1: Here's a URL you can use to get a random Wikipedia article: `https://en.wikipedia.org/wiki/Special:Random`.
-
-Hint #2: Here's an entry on using Wikipedia's API: `https://www.mediawiki.org/wiki/API:Main_page`.
-
-Hint #3: Use this [link](https://en.wikipedia.org/wiki/Special:ApiSandbox#action=query&titles=Main%20Page&prop=revisions&rvprop=content&format=jsonfm) to experiment with Wikipedia's API.
-
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md
index a17732de47f..47cee2ababe 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md
@@ -8,7 +8,7 @@ dashedName: build-an-image-search-abstraction-layer
 
 # --description--
 
-Build a full stack JavaScript app that allows you to search for images like this: <https://image-search-abstraction-layer.freecodecamp.rocks/query/lolcats%20funny?page=10> and browse recent search queries like this: <https://image-search-abstraction-layer.freecodecamp.rocks/recent/>. Use a site builder of your choice to complete the project.
+Build a full stack JavaScript app that allows you to search for images like this: <a href="https://image-search-abstraction-layer.freecodecamp.rocks/query/lolcats%20funny?page=10" target="_blank" rel="noopener noreferrer nofollow">https://image-search-abstraction-layer.freecodecamp.rocks/query/lolcats%20funny?page=10</a> and browse recent search queries like this: <a href="https://image-search-abstraction-layer.freecodecamp.rocks/recent/" target="_blank" rel="noopener noreferrer nofollow">https://image-search-abstraction-layer.freecodecamp.rocks/recent/</a>. Use a site builder of your choice to complete the project.
 
 Here are the specific user stories you should implement for this project:
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
index 498b2a027a2..8a07168f613 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
@@ -8,9 +8,20 @@ dashedName: build-the-game-of-life
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/BpwMZv/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/BpwMZv/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/BpwMZv/</a>.
 
-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.
+The Game of Life is a cellular automaton devised by the British mathematician John Horton Conway. It is a <em>zero-player game</em>, meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and observing how it evolves.
+
+The universe of the Game of Life is an infinite, two-dimensional orthogonal grid of square cells, each of which is in one of two possible states, populated and unpopulated. Every cell interacts with its eight neighbours, which are the cells that are horizontally, vertically, or diagonally adjacent.
+
+At each step in time, the following transitions occur:
+
+- Any live cell with fewer than two live neighbours dies, as if by underpopulation.
+- Any live cell with two or three live neighbours lives on to the next generation.
+- Any live cell with more than three live neighbours dies, as if by overpopulation.
+- Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.
+
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** When I first arrive at the game, it will randomly generate a board and start playing.
 
@@ -24,13 +35,9 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 **User Story:** Each time the board changes, I can see how many generations have gone by.
 
-**Hint:** Here's an explanation of Conway's Game of Life from John Conway himself: <https://www.youtube.com/watch?v=E8kUJL04ELA>
+When you are finished, include a link to your project and click the "I've completed this challenge" button.
 
-**Hint:** Here's an overview of Conway's Game of Life with rules for your reference: [https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life](https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life)
-
-When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
-
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md
index fbae3e461ad..a5562365284 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md
@@ -8,7 +8,7 @@ dashedName: chart-the-stock-market
 
 # --description--
 
-Build a full stack JavaScript app that is functionally similar to this: <https://chart-the-stock-market.freecodecamp.rocks/>. Use a site builder of your choice to complete the project.
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://chart-the-stock-market.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://chart-the-stock-market.freecodecamp.rocks/</a>. Use a site builder of your choice to complete the project.
 
 Here are the specific user stories you should implement for this project:
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
index 5a5420d7713..fca6420cdc5 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
@@ -8,9 +8,9 @@ dashedName: manage-a-book-trading-club
 
 # --description--
 
-**Objective:** Build a [Replit](https://replit.com/) app that is functionally similar to this: <https://manage-a-book-trading-club.freecodecamp.rocks/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://manage-a-book-trading-club.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://manage-a-book-trading-club.freecodecamp.rocks/</a>.
 
-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.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I can view all books posted by every user.
 
@@ -22,7 +22,7 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 Once you've finished implementing these user stories, enter the URL to your live app and, optionally, your GitHub repository. Then click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
index aa1dcc3a84a..6055134191b 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
@@ -1,6 +1,6 @@
 ---
 id: bd7108d8c242eddfaeb5bd13
-title: Map Data Across the Globe
+title: 全球地图数据
 challengeType: 3
 forumTopicId: 302365
 dashedName: map-data-across-the-globe
@@ -8,9 +8,9 @@ dashedName: map-data-across-the-globe
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/mVEJag>.
+**Objective:** Build an app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/mVEJag>.
 
-Fulfill the following [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I can see where all Meteorites landed on a world map.
 
@@ -22,7 +22,7 @@ Fulfill the following [user stories](https://en.wikipedia.org/wiki/User_story).
 
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md
index 6070f83ea88..590a5bb4a00 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md
@@ -8,9 +8,9 @@ dashedName: p2p-video-chat-application
 
 # --description--
 
-**Objective:** Build a [Replit](https://replit.com/) app that is functionally similar to this: <https://p2p-video-chat-application.freecodecamp.rocks/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://p2p-video-chat-application.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://p2p-video-chat-application.freecodecamp.rocks/</a>.
 
-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.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** Upon arriving, the browser will prompt me to access my camera and microphone.
 
@@ -32,7 +32,7 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 Once you've finished implementing these user stories, enter the URL to your live app and, optionally, your GitHub repository. Then click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
index 9e83b937f40..23f76537c24 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
@@ -8,9 +8,9 @@ dashedName: show-national-contiguity-with-a-force-directed-graph
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/xVopBo>.
+**Objective:** Build an app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/XWEONRz>.
 
-Fulfill the following [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I can see a Force-directed Graph that shows which countries share borders.
 
@@ -22,7 +22,7 @@ Fulfill the following [user stories](https://en.wikipedia.org/wiki/User_story).
 
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/show-the-local-weather.md b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
index 9d470d6b1cf..d5b751f8a62 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
@@ -8,11 +8,11 @@ dashedName: show-the-local-weather
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/bELRjV>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/bELRjV" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/bELRjV</a>.
 
 **Rule #1:** Don't look at the example project's code. Figure it out for yourself.
 
-**Rule #2:** Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+**Rule #2:** Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I can see the weather in my current location.
 
@@ -20,11 +20,11 @@ dashedName: show-the-local-weather
 
 **User Story:** I can push a button to toggle between Fahrenheit and Celsius.
 
-**Note:** Many internet browsers now require an HTTP Secure (`https://`) connection to obtain a user's locale via HTML5 Geolocation. For this reason, we recommend using HTML5 Geolocation to get user location and then use the freeCodeCamp Weather API <https://weather-proxy.freecodecamp.rocks/> which uses an HTTP Secure connection for the weather. Also, be sure to connect to [CodePen.io](https://codepen.io) via `https://`.
+**Note:** Many internet browsers now require an HTTP Secure (`https://`) connection to obtain a user's locale via HTML5 Geolocation. For this reason, we recommend using HTML5 Geolocation to get user location and then use the freeCodeCamp Weather API <a href="https://weather-proxy.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://weather-proxy.freecodecamp.rocks/</a> which uses an HTTP Secure connection for the weather. Also, be sure to connect to <a href="https://codepen.io" target="_blank" rel="noopener noreferrer nofollow">CodePen.io</a> via `https://`.
 
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
index 55d17b1745f..242279ce6d1 100644
--- a/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
+++ b/curriculum/challenges/chinese/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
@@ -1,6 +1,6 @@
 ---
 id: bd7158d8c442eddfaeb5bd1f
-title: Use the Twitch JSON API
+title: 使用 Twitch JSON API
 challengeType: 3
 forumTopicId: 19541
 dashedName: use-the-twitch-json-api
@@ -8,25 +8,25 @@ dashedName: use-the-twitch-json-api
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/Myvqmo/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/Myvqmo/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/Myvqmo/</a>.
 
-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.
+The Twitch API is a RESTful API that lets developers build creative integrations for the broader Twitch community.
+
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I can see whether freeCodeCamp is currently streaming on Twitch.tv.
 
 **User Story:** I can click the status output and be sent directly to the freeCodeCamp's Twitch.tv channel.
 
-**User Story:** if a Twitch user is currently streaming, I can see additional details about what they are streaming.
-
-**Hint:** The relevant documentation about Twitch.tv's JSON API is here: <https://dev.twitch.tv/docs/api/reference/#get-streams>.
+**User Story:** If a Twitch user is currently streaming, I can see additional details about what they are streaming.
 
 **Hint:** Here's an array of the Twitch.tv usernames of people who regularly stream: `["ESL_SC2", "OgamingSC2", "cretetion", "freecodecamp", "storbeck", "habathcx", "RobotCaleb", "noobs2ninjas"]`
 
-**UPDATE:** Due to a change in conditions on API usage, Twitch.tv requires an API key, but we've built a workaround. Use <https://twitch-proxy.freecodecamp.rocks/> instead of Twitch's API base URL (i.e. `https://api.twitch.tv/helix` ) and you'll still be able to get account information, without needing to sign up for an API key.
+**UPDATE:** Due to a change in conditions on API usage, Twitch.tv requires an API key, but we've built a workaround. Use <a href="https://twitch-proxy.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://twitch-proxy.freecodecamp.rocks/</a> instead of Twitch's API base URL and you'll still be able to get account information, without needing to sign up for an API key.
 
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/chinese/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md b/curriculum/challenges/chinese/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md
index 3e575988bdf..14eb0bf582d 100644
--- a/curriculum/challenges/chinese/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md
+++ b/curriculum/challenges/chinese/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md
@@ -8,19 +8,52 @@ dashedName: book-recommendation-engine-using-knn
 
 # --description--
 
-在这个挑战中，你将使用 K-近邻算法创建一个书籍推荐算法。
+You will be <a href="https://colab.research.google.com/github/freeCodeCamp/boilerplate-book-recommendation-engine/blob/master/fcc_book_recommendation_knn.ipynb" target="_blank" rel="noopener noreferrer nofollow">working on this project with Google Colaboratory</a>.
 
-你将使用 Book-Crossings 数据集。 该数据集包括 90,000 名用户对 270,000 册书籍的 110 万份评分（评分从 1至 10）。
+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."
 
-你可以[在 Replit 上查看整个项目的具体描述和初始代码](https://colab.research.google.com/github/freeCodeCamp/boilerplate-book-recommendation-engine/blob/master/fcc_book_recommendation_knn.ipynb)。
+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.
 
-进入该链接后，在你自己的账户或本地创建一个笔记本的副本。 一旦你完成项目并通过链接中的测试，请在下面提交你的项目链接。 如果你提交的是 Google Colaboratory 的链接，请确保打开链接共享时选择 “anyone with the link”。
+# --instructions--
 
-我们仍在开发机器学习课程的交互式课程部分。 现在，你可以通过这个认证视频挑战。 你可能还需要寻找额外的学习资源，类似于你在现实世界项目上所做的工作。
+In this challenge, you will create a book recommendation algorithm using **K-Nearest Neighbors**.
+
+You will use the <a href="http://www2.informatik.uni-freiburg.de/~cziegler/BX/" target="_blank" rel="noopener noreferrer nofollow">Book-Crossings dataset</a>. This dataset contains 1.1 million ratings (scale of 1-10) of 270,000 books by 90,000 users.
+
+After importing and cleaning the data, use `NearestNeighbors` from `sklearn.neighbors` to develop a model that shows books that are similar to a given book. The Nearest Neighbors algorithm measures the distance to determine the “closeness” of instances.
+
+Create a function named `get_recommends` that takes a book title (from the dataset) as an argument and returns a list of 5 similar books with their distances from the book argument.
+
+This code:
+
+```py
+get_recommends("The Queen of the Damned (Vampire Chronicles (Paperback))")
+```
+
+should return:
+
+```py
+[
+  'The Queen of the Damned (Vampire Chronicles (Paperback))',
+  [
+    ['Catch 22', 0.793983519077301], 
+    ['The Witching Hour (Lives of the Mayfair Witches)', 0.7448656558990479], 
+    ['Interview with the Vampire', 0.7345068454742432],
+    ['The Tale of the Body Thief (Vampire Chronicles (Paperback))', 0.5376338362693787],
+    ['The Vampire Lestat (Vampire Chronicles, Book II)', 0.5178412199020386]
+  ]
+]
+```
+
+Notice that the data returned from `get_recommends()` is a list. The first element in the list is the book title passed into the function. The second element in the list is a list of five more lists. Each of the five lists contains a recommended book and the distance from the recommended book to the book passed into the function.
+
+If you graph the dataset (optional), you will notice that most books are not rated frequently. To ensure statistical significance, remove from the dataset users with less than 200 ratings and books with less than 100 ratings.
+
+The first three cells import libraries you may need and the data to use. The final cell is for testing. Write all your code in between those cells.
 
 # --hints--
 
-它应该通过所有的 Python 测试。
+It should pass all Python tests.
 
 ```js
 
diff --git a/curriculum/challenges/chinese/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md b/curriculum/challenges/chinese/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md
index b64b4c73448..3c0ea2a6d5e 100644
--- a/curriculum/challenges/chinese/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md
+++ b/curriculum/challenges/chinese/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md
@@ -8,17 +8,101 @@ dashedName: cat-and-dog-image-classifier
 
 # --description--
 
-在这个挑战中，你将使用 TensorFlow 2.0 和 Keras 创建一个卷积神经网络，对猫和狗的图像进行正确分类，准确率至少达到 63%。
+You will be <a href="https://colab.research.google.com/github/freeCodeCamp/boilerplate-cat-and-dog-image-classifier/blob/master/fcc_cat_dog.ipynb" target="_blank" rel="noopener noreferrer nofollow">working on this project with Google Colaboratory</a>.
 
-你可以访问 [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.
 
-我们仍在开发机器学习课程的交互式课程部分。 现在，你可以通过这个认证视频挑战。 你可能还需要寻找额外的学习资源，类似于你在真实世界项目中的工作。
+# --instructions--
+
+For this challenge, you will complete the code  to classify images of dogs and cats. You will use TensorFlow 2.0 and Keras to create a convolutional neural network that correctly classifies images of cats and dogs at least 63% of the time. (Extra credit if you get it to 70% accuracy!)
+
+Some of the code is given to you but some code you must fill in to complete this challenge. Read the instruction in each text cell so you will know what you have to do in each code cell.
+
+The first code cell imports the required libraries. The second code cell downloads the data and sets key variables. The third cell is the first place you will write your own code.
+
+The structure of the dataset files that are downloaded looks like this (You will notice that the test directory has no subdirectories and the images are not labeled):
+
+```py
+cats_and_dogs
+|__ train:
+    |______ cats: [cat.0.jpg, cat.1.jpg ...]
+    |______ dogs: [dog.0.jpg, dog.1.jpg ...]
+|__ validation:
+    |______ cats: [cat.2000.jpg, cat.2001.jpg ...]
+    |______ dogs: [dog.2000.jpg, dog.2001.jpg ...]
+|__ test: [1.jpg, 2.jpg ...]
+```
+
+You can tweak epochs and batch size if you like, but it is not required.
+
+The following instructions correspond to specific cell numbers, indicated with a comment at the top of the cell (such as `# 3`).
+
+## Cell 3
+
+Now it is your turn! Set each of the variables in this cell correctly. (They should no longer equal `None`.)
+
+Create image generators for each of the three image data sets (train, validation, test). Use `ImageDataGenerator` to read / decode the images and convert them into floating point tensors. Use the `rescale` argument (and no other arguments for now) to rescale the tensors from values between 0 and 255 to values between 0 and 1.
+
+For the `*_data_gen` variables, use the `flow_from_directory` method. Pass in the batch size, directory, target size (`(IMG_HEIGHT, IMG_WIDTH)`), class mode, and anything else required. `test_data_gen` will be the trickiest one. For `test_data_gen`, make sure to pass in `shuffle=False` to the `flow_from_directory` method. This will make sure the final predictions stay is in the order that our test expects. For `test_data_gen` it will also be helpful to observe the directory structure.
+
+
+After you run the code, the output should look like this:
+
+```py
+Found 2000 images belonging to 2 classes.
+Found 1000 images belonging to 2 classes.
+Found 50 images belonging to 1 class.
+```
+
+## Cell 4
+
+The `plotImages` function will be used a few times to plot images. It takes an array of images and a probabilities list, although the probabilities list is optional. This code is given to you. If you created the `train_data_gen` variable correctly, then running this cell will plot five random training images.
+
+## Cell 5
+
+Recreate the `train_image_generator` using `ImageDataGenerator`.
+
+Since there are a small number of training examples, there is a risk of overfitting. One way to fix this problem is by creating more training data from existing training examples by using random transformations.
+
+Add 4-6 random transformations as arguments to `ImageDataGenerator`. Make sure to rescale the same as before.
+
+## Cell 6
+
+You don't have to do anything for this cell. `train_data_gen` is created just like before but with the new `train_image_generator`. Then, a single image is plotted five different times using different variations.
+
+## Cell 7
+
+In this cell, create a model for the neural network that outputs class probabilities. It should use the Keras Sequential model. It will probably involve a stack of Conv2D and MaxPooling2D layers and then a fully connected layer on top that is activated by a ReLU activation function.
+
+Compile the model passing the arguments to set the optimizer and loss. Also pass in `metrics=['accuracy']` to view training and validation accuracy for each training epoch.
+
+## Cell 8
+
+Use the `fit` method on your `model` to train the network. Make sure to pass in arguments for `x`, `steps_per_epoch`, `epochs`, `validation_data`, and `validation_steps`.
+
+## Cell 9
+
+Run this cell to visualize the accuracy and loss of the model.
+
+## Cell 10
+
+Now it is time to use your model to predict whether a brand new image is a cat or a dog.
+
+In this cell, get the probability that each test image (from `test_data_gen`) is a dog or a cat. `probabilities` should be a list of integers.
+
+Call the `plotImages` function and pass in the test images and the probabilities corresponding to each test image.
+
+After you run the cell, you should see all 50 test images with a label showing the percentage of "sure" that the image is a cat or a dog. The accuracy will correspond to the accuracy shown in the graph above (after running the previous cell). More training images could lead to a higher accuracy.
+
+## Cell 11
+
+Run this final cell to see if you passed the challenge or if you need to keep trying.
 
 # --hints--
 
-它应该通过所有的 Python 测试。
+It should pass all Python tests.
 
 ```js
 
diff --git a/curriculum/challenges/chinese/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md b/curriculum/challenges/chinese/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md
index cb20265b14d..1cf49022b61 100644
--- a/curriculum/challenges/chinese/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md
+++ b/curriculum/challenges/chinese/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md
@@ -8,19 +8,33 @@ dashedName: linear-regression-health-costs-calculator
 
 # --description--
 
-在这个挑战中，你将使用回归算法预测医疗费用。
+You will be <a href="https://colab.research.google.com/github/freeCodeCamp/boilerplate-linear-regression-health-costs-calculator/blob/master/fcc_predict_health_costs_with_regression.ipynb" target="_blank" rel="noopener noreferrer nofollow">working on this project with Google Colaboratory</a>.
 
-你会得到一个数据集，其中包含不同人的信息，包括他们的医疗费用。 用数据来预测基于新数据的医疗费用。
+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 上的完整项目说明和启动代码](https://colab.research.google.com/github/freeCodeCamp/boilerplate-linear-regression-health-costs-calculator/blob/master/fcc_predict_health_costs_with_regression.ipynb)。
+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.
 
-进入该链接后，在你自己的账户或本地创建一个笔记本的副本。 一旦你完成项目并通过链接中的测试，请在下面提交你的项目链接。 如果你提交的是 Google Colaboratory 的链接，请确保打开链接共享时选择 “anyone with the link”。
+# --instructions--
 
-我们仍在开发机器学习课程的交互式课程部分。 现在，你可以通过这个认证中的视频挑战。 你可能还需要寻找额外的学习资源，类似于你在真实世界项目中的工作。
+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.
+
+The first two cells of this notebook import libraries and the data.
+
+Make sure to convert categorical data to numbers. Use 80% of the data as the `train_dataset` and 20% of the data as the `test_dataset`.
+
+`pop` off the "expenses" column from these datasets to create new datasets called `train_labels` and `test_labels`. Use these labels when training your model.
+
+Create a model and train it with the `train_dataset`. Run the final cell in this notebook to check your model. The final cell will use the unseen `test_dataset` to check how well the model generalizes.
+
+To pass the challenge, `model.evaluate` must return a Mean Absolute Error of under 3500. This means it predicts health care costs correctly within $3500.
+
+The final cell will also predict expenses using the `test_dataset` and graph the results.
 
 # --hints--
 
-它应该通过所有的 Python 测试。
+It should pass all Python tests.
 
 ```js
 
diff --git a/curriculum/challenges/chinese/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md b/curriculum/challenges/chinese/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md
index 55c8ebcfe90..066dad631c7 100644
--- a/curriculum/challenges/chinese/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md
+++ b/curriculum/challenges/chinese/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md
@@ -8,17 +8,25 @@ dashedName: neural-network-sms-text-classifier
 
 # --description--
 
-在这个挑战中，你需要创建一个机器学习模型，将短信分类为 “ham” 或 “spam”。 “ham” 信息是由一个朋友发送的普通信息。 “spam” 是一个公司发送的广告或信息。
+You will be <a href="https://colab.research.google.com/github/freeCodeCamp/boilerplate-neural-network-sms-text-classifier/blob/master/fcc_sms_text_classification.ipynb" target="_blank" rel="noopener noreferrer nofollow">working on this project with Google Colaboratory</a>.
 
-你可以访问 [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.
 
-我们仍在开发机器学习课程的交互式课程部分。 现在，你可以通过这个认证中的视频挑战。 你可能还需要寻找额外的学习资源，类似于你在真实世界项目中的工作。
+# --instructions--
+
+In this challenge, you need to create a machine learning model that will classify SMS messages as either "ham" or "spam". A "ham" message is a normal message sent by a friend. A "spam" message is an advertisement or a message sent by a company.
+
+You should create a function called `predict_message` that takes a message string as an argument and returns a list. The first element in the list should be a number between zero and one that indicates the likeliness of "ham" (0) or "spam" (1). The second element in the list should be the word "ham" or "spam", depending on which is most likely.
+
+For this challenge, you will use the <a href="http://www.dt.fee.unicamp.br/~tiago/smsspamcollection/" target="_blank" rel="noopener noreferrer nofollow">SMS Spam Collection</a> dataset. The dataset has already been grouped into train data and test data.
+
+The first two cells import the libraries and data. The final cell tests your model and function. Add your code in between these cells.
 
 # --hints--
 
-它应该通过所有的 Python 测试。
+It should pass all Python tests.
 
 ```js
 
diff --git a/curriculum/challenges/chinese/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md b/curriculum/challenges/chinese/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
index c916b370ff0..7f882a150f9 100644
--- a/curriculum/challenges/chinese/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
+++ b/curriculum/challenges/chinese/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
@@ -8,17 +8,57 @@ dashedName: rock-paper-scissors
 
 # --description--
 
-在这个挑战中，你将创建一个程序来玩石头、剪刀、布。 一个随机选取的程序通常会有 50% 的时间获胜。 要通过这一挑战，你的程序必须与四个不同的机器人进行对战，并达到至少 60% 胜率。
+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.
 
-你可以访问 [Replit 上的完整项目描述和启动代码](https://replit.com/github/freeCodeCamp/boilerplate-rock-paper-scissors)。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-rock-paper-scissors" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
-进入该链接后，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.
 
-我们仍在开发机器学习课程的交互式课程部分。 现在，你需要使用其他资源来学习如何通过这一挑战。
+# --instructions--
+
+In the file `RPS.py` you are provided with a function called `player`. The function takes an argument that is a string describing the last move of the opponent ("R", "P", or "S"). The function should return a string representing the next move for it to play ("R", "P", or "S").
+
+A player function will receive an empty string as an argument for the first game in a match since there is no previous play.
+
+The file `RPS.py` shows an example function that you will need to update. The example function is defined with two arguments (`player(prev_play, opponent_history = [])`). The function is never called with a second argument so that one is completely optional. The reason why the example function contains a second argument (`opponent_history = []`) is because that is the only way to save state between consecutive calls of the `player` function. You only need the `opponent_history` argument if you want to keep track of the opponent_history.
+
+*Hint: To defeat all four opponents, your program may need to have multiple strategies that change depending on the plays of the opponent.*
+
+## Development
+
+Do not modify `RPS_game.py`. Write all your code in `RPS.py`. For development, you can use `main.py` to test your code.
+
+`main.py` imports the game function and bots from `RPS_game.py`.
+
+To test your code, play a game with the `play` function. The `play` function takes four arguments:
+
+- two players to play against each other (the players are actually functions)
+- the number of games to play in the match
+- an optional argument to see a log of each game. Set it to `True` to see these messages.
+
+```py
+play(player1, player2, num_games[, verbose])
+```
+
+For example, here is how you would call the function if you want `player` and `quincy` to play 1000 games against each other and you want to see the results of each game:
+
+```py
+play(player, quincy, 1000, verbose=True)
+```
+
+Click the "run" button and `main.py` will run.
+
+## Testing
+
+The unit tests for this project are in `test_module.py`. We imported the tests from `test_module.py` to `main.py` for your convenience. If you uncomment the last line in `main.py`, the tests will run automatically whenever you hit the "run" button.
+
+## Submitting
+
+Copy your project's URL and submit it below.
 
 # --hints--
 
-它应该通过所有的 Python 测试。
+It should pass all Python tests.
 
 ```js
 
diff --git a/curriculum/challenges/chinese/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md b/curriculum/challenges/chinese/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md
index 96ac34bf0de..935adc37e66 100644
--- a/curriculum/challenges/chinese/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md
+++ b/curriculum/challenges/chinese/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md
@@ -14,7 +14,7 @@ dashedName: neural-networks-activation-functions
 
 ## --text--
 
-哪个激活函数在 -1 和 1 之间切换值？
+Which activation function squishes values between -1 and 1?
 
 ## --answers--
 
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md b/curriculum/challenges/chinese/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md
index d70515df0e7..6f444d2befd 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md
@@ -91,7 +91,7 @@ const el = document.getElementById('name')
 assert(!!el && el.required)
 ```
 
-你的 `#name` 元素应该是 `#survey-form` 元素的子元素。
+Your `#name` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #name')
@@ -119,7 +119,7 @@ const el = document.getElementById('email')
 assert(!!el && el.required)
 ```
 
-你的 `#email` 元素应该是 `#survey-form` 元素的子元素。
+Your `#email` should be a descendant of `#survey-form`
 
 ```js
 const el = document.querySelector('#survey-form #email')
@@ -133,7 +133,7 @@ const el = document.getElementById('number')
 assert(!!el && el.tagName === 'INPUT')
 ```
 
-你的 `#number` 元素应该是 `#survey-form` 元素的子元素。
+Your `#number` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #number')
@@ -203,21 +203,21 @@ const el = document.getElementById('number-label')
 assert(!!el && el.innerText.length > 0)
 ```
 
-你的 `#name-label` 元素应该是 `#survey-form` 元素的子元素。
+Your `#name-label` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #name-label')
 assert(!!el)
 ```
 
-你的 `#email-label` 元素应该是 `#survey-form` 元素的子元素。
+Your `#email-label` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #email-label')
 assert(!!el)
 ```
 
-你的 `#number-label` 元素应该是 `#survey-form` 元素的子元素。
+Your `#number-label` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #number-label')
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
index cd15ed70b56..a7061f6177b 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
@@ -9,7 +9,7 @@ dashedName: step-56
 
 要使 `input` 框彼此对齐，请将所有 `.info` 元素内 `input` 和 `label` 元素的 `display` 属性设置为 `inline-block`。
 
-此外，将文本向右对齐。
+Also, align the `label` element's text to the right.
 
 # --hints--
 
@@ -28,22 +28,14 @@ const display = gs('.info > label, .info > input') ?? gs('.info label, .info inp
 assert.equal(display, 'inline-block');
 ```
 
-你应该给 `input` 和 `label` 元素添加 `text-align` 值为 `right`。
+You should give the `label` element a `text-align` of `right`.
 
 ```js
 const gs = (s) => new __helpers.CSSHelp(document).getStyle(s)?.textAlign;
-const textAlign = gs('.info > label, .info > input') ?? gs('.info label, .info input') ?? gs('.info > input, .info > label') ?? gs('.info input, .info label');
+const textAlign = gs('.info > label') ?? gs('.info label');
 assert.equal(textAlign, 'right');
 ```
 
-你应该在 `.info input` 规则之前设置 `text-align: right` 属性。
-
-```js
-const gs = (s) => new __helpers.CSSHelp(document).getStyleRule(s);
-assert(gs('.info input').isDeclaredAfter('.info label, .info input') || gs('.info input').isDeclaredAfter('.info > label, .info > input') || gs('.info input').isDeclaredAfter('.info > input, .info > label') || gs('.info input').isDeclaredAfter('.info input, .info label'));
-
-```
-
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
index 706591f665c..538e8919242 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
@@ -286,7 +286,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -297,6 +296,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 --fcc-editable-region--
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
index 5e132a37f68..29b5bbbee34 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
@@ -272,7 +272,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -283,6 +282,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
index f128f3dcbe2..2e808560587 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
@@ -262,7 +262,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -273,6 +272,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
index be51d9f82dd..718c30eb2e8 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
@@ -260,7 +260,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -271,6 +270,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
index ac90b42f154..0eba2e562a6 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
@@ -300,7 +300,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -311,6 +310,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
index e75f75520ca..ff4cda1ab1d 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
@@ -266,7 +266,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -277,6 +276,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
index b7fdf81e4fc..ae45e6cadbb 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
@@ -280,7 +280,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -291,6 +290,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
index a58136051a0..33f6cf2f670 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
@@ -278,7 +278,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -289,6 +288,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
index 48059c54bc2..dd7e25cd03d 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
@@ -260,7 +260,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -271,6 +270,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
index 094d4d6e2bc..69f39f5befe 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
@@ -278,7 +278,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -289,6 +288,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
index db6e4388c26..4a38cc8c276 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
@@ -280,7 +280,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -291,6 +290,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
@@ -603,12 +603,12 @@ input {
 .info label,
 .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .info input {
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
index 2b1e66db6c6..c7f71944c70 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
@@ -7,38 +7,33 @@ dashedName: step-5
 
 # --description--
 
-咖啡厅的名称是 `CAMPER CAFE`。 你的 `body` 元素中应该有一个 `h1` 元素。 用大写字母显示咖啡店名，使其突出显示。
+It's time to add some menu content. Add a `main` element within the existing `body` element. It will eventually contain pricing information about coffee and desserts offered by the cafe.
 
 # --hints--
 
-你应该有一个 `<h1>` 开始标签。
+Your code should have an opening `<main>` tag.
 
 ```js
-assert(code.match(/<h1>/i));
+assert(code.match(/<main>/i));
 ```
 
-你应该有一个 `</h1>` 结束标签。
+Your code should have a closing `</main>` tag.
 
 ```js
-assert(code.match(/<\/h1>/i));
+assert(code.match(/<\/main>/i));
 ```
 
-你不应该改变你现有的 `body`元素。
+You should not change your `body` element. Make sure you don't accidentally delete your closing tag.
 
 ```js
 assert($('body').length === 1);
 ```
 
-你的 `h1` 元素应该嵌套在你的 `body` 元素中。
+Your `main` tag should be within your `body` tag.
 
 ```js
-assert($('h1')[0].parentElement.tagName === "BODY");
-```
-
-你的 `h1` 元素应该有文字 `CAMPER CAFE`。
-
-```js
-assert(code.match(/<h1>CAMPER CAFE<\/h1>/));
+const main = document.querySelector('main');
+assert(main.parentElement.tagName === 'BODY');
 ```
 
 # --seed--
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
index 738fab36502..559de728d5c 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
@@ -7,38 +7,38 @@ dashedName: step-6
 
 # --description--
 
-为了让游客知道这家咖啡馆成立于 2020 年，在 `h1` 元素下面添加一个 `p`元素，文字为 `Est. 2020`。
+The name of the cafe is `CAMPER CAFE`. Add an `h1` element within your `main` element. Give it the name of the cafe in capitalized letters to make it stand out.
 
 # --hints--
 
-你应该有一个 `<p>` 开始标签。
+You should have an opening `<h1>` tag.
 
 ```js
-assert(code.match(/<p>/i));
+assert(code.match(/<h1>/i));
 ```
 
-你应该有一个 `</p>` 结束标签。
+You should have a closing `</h1>` tag.
 
 ```js
-assert(code.match(/<\/p>/i));
+assert(code.match(/<\/h1>/i));
 ```
 
-你不应该改变你现有的 `h1` 元素。 确认你没有删除结束标签。
+You should not change your existing `main` element.
 
 ```js
-assert($('h1').length === 1);
+assert($('main').length === 1);
 ```
 
-你的 `p` 元素应该在 `h1` 元素的下面。
+Your `h1` element should be nested in your `main` element.
 
 ```js
-assert($('p')[0].previousElementSibling.tagName === 'H1');
+assert($('h1')[0].parentElement.tagName === "MAIN");
 ```
 
-你的 `p` 元素应该有文本 `Est. 2020`。
+Your `h1` element should have the text `CAMPER CAFE`.
 
 ```js
-assert(document.querySelector("p").innerText === "Est. 2020");
+assert(code.match(/<h1>CAMPER CAFE<\/h1>/));
 ```
 
 # --seed--
@@ -54,7 +54,8 @@ assert(document.querySelector("p").innerText === "Est. 2020");
   </head>
   <body>
 --fcc-editable-region--
-    <h1>CAMPER CAFE</h1>
+    <main>
+    </main>
 --fcc-editable-region--
   </body>
 </html>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
index 43508e44700..5306d129ab5 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
@@ -7,34 +7,38 @@ dashedName: step-7
 
 # --description--
 
-由于上一步添加的 `p` 元素提供了关于咖啡馆的补充信息，因此将 `h1` 和 `p` 元素都嵌套在一个 `header`元素中。
+To let visitors know the cafe was founded in 2020, add a `p` element below the `h1` element with the text `Est. 2020`.
 
 # --hints--
 
-你应该有一个 `<header>` 开始标签。
+You should have an opening `<p>` tag.
 
 ```js
-assert(code.match(/<header>/i));
+assert(code.match(/<p>/i));
 ```
 
-你应该有一个 `</header>` 结束标签。
+You should have a closing `</p>` tag.
 
 ```js
-assert(code.match(/<\/header>/i));
+assert(code.match(/<\/p>/i));
 ```
 
-你的 `h1` 元素应该嵌套在你的 `header` 元素中。
+You should not change your existing `h1` element. Make sure you did not delete the closing tag.
 
 ```js
-const header = document.querySelectorAll('header')[0];
-assert(header.children[0].tagName === 'H1');
+assert($('h1').length === 1);
 ```
 
-你的 `p` 元素应该嵌套在你的 `header`元素中。
+Your `p` element should be below your `h1` element.
 
 ```js
-const header = document.querySelectorAll('header')[0];
-assert(header.children[1].tagName === "P");
+assert($('p')[0].previousElementSibling.tagName === 'H1');
+```
+
+Your `p` element should have the text `Est. 2020`.
+
+```js
+assert(document.querySelector("p").innerText === "Est. 2020");
 ```
 
 # --seed--
@@ -49,10 +53,11 @@ assert(header.children[1].tagName === "P");
     <title>Cafe Menu</title>
   </head>
   <body>
+    <main>
 --fcc-editable-region--
-    <h1>CAMPER CAFE</h1>
-    <p>Est. 2020</p>
+      <h1>CAMPER CAFE</h1>
 --fcc-editable-region--
+    </main>
   </body>
 </html>
 ```
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md
index 88ef57d81c2..6ccb88d8bce 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344f9c805cd193c33d829c
-title: 步骤 12
+title: Step 11
 challengeType: 0
-dashedName: step-12
+dashedName: step-11
 ---
 
 # --description--
@@ -56,11 +56,9 @@ assert(h1TextAlign === 'center');
 --fcc-editable-region--
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md
index 8a08ce9b7e7..40e5db656e9 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fad8bf01691e71a30eb
-title: 步骤 11
+title: Step 10
 challengeType: 0
-dashedName: step-11
+dashedName: step-10
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(code.match(/<head\s*>[\w\W\s]*<style\s*>[\w\W\s]*<\/style\s*>[\w\W\s]*<\/
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md
index 58bb45c68cd..a20dce463a4 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fbc22624a2976425065
-title: 步骤 10
+title: Step 9
 challengeType: 0
-dashedName: step-10
+dashedName: step-9
 ---
 
 # --description--
@@ -55,11 +55,9 @@ assert(h2.innerText === 'Coffee');
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
 --fcc-editable-region--
       <section>
       </section>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
index 8d411e44fbf..bc75a53eb33 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fc1520b6719f2e35605
-title: 步骤 9
+title: Step 8
 challengeType: 0
-dashedName: step-9
+dashedName: step-8
 ---
 
 # --description--
@@ -32,8 +32,9 @@ assert($('main').length === 1);
 你的 `section`元素应该在你的 `main` 元素中。
 
 ```js
-const main = document.querySelectorAll('main')?.[0];
-assert(main.children[0].tagName === 'SECTION');
+const main = document.querySelector('main');
+const section = document.querySelector('section');
+assert(section.parentElement === main);
 ```
 
 # --seed--
@@ -48,12 +49,10 @@ assert(main.children[0].tagName === 'SECTION');
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
-      <h1>CAMPER CAFE</h1>
-      <p>Est. 2020</p>
-    </header>
 --fcc-editable-region--
     <main>
+      <h1>CAMPER CAFE</h1>
+      <p>Est. 2020</p>
     </main>
 --fcc-editable-region--
   </body>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md
index deab576c8f8..88d1d60ab99 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477ae34c1239cafe128be
-title: 步骤 14
+title: Step 13
 challengeType: 0
-dashedName: step-14
+dashedName: step-13
 ---
 
 # --description--
@@ -58,11 +58,9 @@ assert(selectors.length === 1);
 --fcc-editable-region--
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md
index 4cfd792d98c..ce8f7af504a 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477ae8466a9a3d2cc953c
-title: 步骤 16
+title: Step 15
 challengeType: 0
-dashedName: step-16
+dashedName: step-15
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert(!code.match(/style/i));
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md
index cd21d64f198..dc180014f91 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md
@@ -1,13 +1,13 @@
 ---
 id: 5f3477ae9675db8bb7655b30
-title: 步骤 13
+title: Step 12
 challengeType: 0
-dashedName: step-13
+dashedName: step-12
 ---
 
 # --description--
 
-在上一步中，你使用 <dfn>类型选择器</dfn> 来设置 `h1` 元素的样式。 继续将 `h2` 和 `p` 元素居中，每个元素都有一个新的类型选择器。
+在上一步中，你使用 <dfn>类型选择器</dfn> 来设置 `h1` 元素的样式。 Center the `h2` and `p` elements by adding a new type selector for each one to the existing `style` element.
 
 # --hints--
 
@@ -18,35 +18,42 @@ const hasH1 = new __helpers.CSSHelp(document).getStyle('h1');
 assert(hasH1);
 ```
 
-你应该添加一个新的 `h2` 选择器。
+You should not add a new `style` tag. Add the new CSS rules to the existing `style` tag.
+
+```js
+const hasManyStyleTags = document.querySelectorAll('style').length > 1;
+assert(!hasManyStyleTags);
+```
+
+You should add a new `h2` selector.
 
 ```js
 const hasH2 = new __helpers.CSSHelp(document).getStyle('h2');
 assert(hasH2);
 ```
 
-你应该添加一个新的 `p` 选择器。
+You should add a new `p` selector.
 
 ```js
 const hasP = new __helpers.CSSHelp(document).getStyle('p');
 assert(hasP);
 ```
 
-你的 `h1` 元素应该有一个 `text-align` 值为 `center`。
+Your `h1` element should have a `text-align` of `center`.
 
 ```js
 const h1TextAlign = new __helpers.CSSHelp(document).getStyle('h1')?.getPropertyValue('text-align');
 assert(h1TextAlign === 'center');
 ```
 
-你的 `h2` 元素应该有一个 `text-align` 值为 `center`。
+Your `h2` element should have a `text-align` of `center`.
 
 ```js
 const h2TextAlign = new __helpers.CSSHelp(document).getStyle('h2')?.getPropertyValue('text-align');
 assert(h2TextAlign === 'center');
 ```
 
-你的 `p` 元素应该有一个 `text-align` 值为 `center`。
+Your `p` element should have a `text-align` of `center`.
 
 ```js
 const pTextAlign = new __helpers.CSSHelp(document).getStyle('p')?.getPropertyValue('text-align');
@@ -72,11 +79,9 @@ assert(pTextAlign === 'center');
 --fcc-editable-region--
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
index c9cd07701bd..01ff82d0dd3 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477aefa51bfc29327200b
-title: 步骤 15
+title: Step 14
 challengeType: 0
-dashedName: step-15
+dashedName: step-14
 ---
 
 # --description--
@@ -54,11 +54,9 @@ dashedName: step-15
     </style>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md
index 96768d68776..5c68a234fff 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477cb2e27333b1ab2b955
-title: 步骤 17
+title: Step 16
 challengeType: 0
-dashedName: step-17
+dashedName: step-16
 ---
 
 # --description--
@@ -68,11 +68,9 @@ assert(link.dataset.href == 'styles.css')
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md
index f403b9047ef..da7fcf084de 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477cb303c5cb61b43aa9b
-title: 步骤 19
+title: Step 18
 challengeType: 0
-dashedName: step-19
+dashedName: step-18
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert(bodyBackground === 'brown');
     <link href="styles.css" rel="stylesheet"/>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md
index 4c7d48c844a..5584480e0a2 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477cbcb6ba47918c1da92
-title: 步骤 18
+title: Step 17
 challengeType: 0
-dashedName: step-18
+dashedName: step-17
 ---
 
 # --description--
@@ -52,11 +52,9 @@ assert(meta[0].outerHTML.match(/content=('|")width=device-width, initial-scale=1
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md
index 331b8707e91..2ec0e66fe42 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md
@@ -1,8 +1,8 @@
 ---
 id: 5f34a1fd611d003edeafd681
-title: 步骤 20
+title: Step 19
 challengeType: 0
-dashedName: step-20
+dashedName: step-19
 ---
 
 # --description--
@@ -39,11 +39,9 @@ assert(bodyBackground === 'burlywood');
     <link href="styles.css" rel="stylesheet"/>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
index 4be7235a962..8a66938f221 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed60785e1f3e9850b6e
-title: 步骤 25
+title: Step 24
 challengeType: 0
-dashedName: step-25
+dashedName: step-24
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(!hasWidth);
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
index 517b4754997..5df2cadaecc 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
@@ -1,9 +1,9 @@
 ---
 id: 5f356ed60a5decd94ab66986
-title: 步骤 23
+title: Step 22
 challengeType: 0
 removeComments: false
-dashedName: step-23
+dashedName: step-22
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(bodyCSS === "rgba(0, 0, 0, 0)")
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
index 12a7aa9b2eb..7cc873ef8ee 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed6199b0cdef1d2be8f
-title: 步骤 27
+title: Step 26
 challengeType: 0
-dashedName: step-27
+dashedName: step-26
 ---
 
 # --description--
@@ -48,11 +48,9 @@ assert(!hasDiv);
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
index 3a6b580fa61..5e82ca38370 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed63c7807a4f1e6d054
-title: 步骤 22
+title: Step 21
 challengeType: 0
-dashedName: step-22
+dashedName: step-21
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(divWidth === '300px');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
index c6abf73f052..1fe5144c632 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed63e0fa262326eef05
-title: 步骤 24
+title: Step 23
 challengeType: 0
-dashedName: step-24
+dashedName: step-23
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(divBackground === 'burlywood');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
index f3a6ab1b45d..91a5cff6dfa 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed656a336993abd9f7c
-title: 步骤 26
+title: Step 25
 challengeType: 0
-dashedName: step-26
+dashedName: step-25
 ---
 
 # --description--
@@ -49,11 +49,9 @@ assert(divMarginLeft === 'auto');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
index 8203aa45aad..144470b825a 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed69db0a491745e2bb6
-title: 步骤 28
+title: Step 27
 challengeType: 0
-dashedName: step-28
+dashedName: step-27
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert($('div').attr('class').includes('menu'));
 --fcc-editable-region--
     <div>
 --fcc-editable-region--
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
index c269496c621..d576bfe6e0d 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed6cf6eab5f15f5cfe6
-title: 步骤 21
+title: Step 20
 challengeType: 0
-dashedName: step-21
+dashedName: step-20
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(div.parentElement.tagName === 'BODY');
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md
index 7547e7fc85c..48e66c6101d 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md
@@ -1,8 +1,8 @@
 ---
 id: 5f35e5c4321f818cdc4bed30
-title: 步骤 30
+title: Step 29
 challengeType: 0
-dashedName: step-30
+dashedName: step-29
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(article.previousElementSibling.tagName === 'H2');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
 --fcc-editable-region--
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md
index 5383d4e8cd8..94dc8c4a42e 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f35e5c44359872a137bd98f
-title: 步骤 29
+title: Step 28
 challengeType: 0
-dashedName: step-29
+dashedName: step-28
 ---
 
 # --description--
@@ -55,11 +55,9 @@ assert(bodyBackground === `url("https://cdn.freecodecamp.org/curriculum/css-cafe
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
index 4a8053b1d46..77ab902fc89 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d0fc037f7311b4ac8
-title: 步骤 39
+title: Step 38
 challengeType: 0
-dashedName: step-39
+dashedName: step-38
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(priceWidth === '50%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
index 61787c77cbe..b505952ba5c 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d28d7ad0de6470505
-title: 步骤 33
+title: Step 32
 challengeType: 0
-dashedName: step-33
+dashedName: step-32
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert($('.flavor')[0].innerText.match(/French Vanilla/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
index d607bb2c4bb..1f9653b97bb 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d5414453fc2d7b480
-title: 步骤 32
+title: Step 31
 challengeType: 0
-dashedName: step-32
+dashedName: step-31
 ---
 
 # --description--
@@ -90,11 +90,9 @@ assert(children[1].innerText.match(/4\.50/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
 --fcc-editable-region--
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
index 30ac90e523f..48b879290c3 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866daec9a49519871816
-title: 步骤 31
+title: Step 30
 challengeType: 0
-dashedName: step-31
+dashedName: step-30
 ---
 
 # --description--
@@ -52,11 +52,9 @@ assert(secondP.innerText.match(/3\.00/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
 --fcc-editable-region--
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
index e8194014b5e..4e615eac382 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866dbf362f99b9a0c6d0
-title: 步骤 38
+title: Step 37
 challengeType: 0
-dashedName: step-38
+dashedName: step-37
 ---
 
 # --description--
@@ -53,11 +53,9 @@ assert(itemPDisplay === 'inline-block');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md
index 6e5ed70b586..020e0a9a80b 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866dd0d0275f01d4d847
-title: 步骤 40
+title: Step 39
 challengeType: 0
-dashedName: step-40
+dashedName: step-39
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(priceWidth === '49%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md
index 40ccd2b811a..3066be22182 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866de7a5b784048f94b1
-title: 步骤 37
+title: Step 36
 challengeType: 0
-dashedName: step-37
+dashedName: step-36
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert($('article')[0].className === 'item');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
 --fcc-editable-region--
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md
index 3bb751993e1..93a404fcf6f 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade94c6576e7f7b7953f
-title: 步骤 42
+title: Step 41
 challengeType: 0
-dashedName: step-42
+dashedName: step-41
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(priceWidth === '50%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md
index 6ec8d987258..d813897467d 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade9993019e26313fa8e
-title: 步骤 43
+title: Step 42
 challengeType: 0
-dashedName: step-43
+dashedName: step-42
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(articles[4] === items[4]);
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md
index 870b760f401..7144e52081d 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade99dda4e6071a85dfd
-title: 步骤 47
+title: Step 46
 challengeType: 0
-dashedName: step-47
+dashedName: step-46
 ---
 
 # --description--
@@ -50,11 +50,9 @@ assert($('main').children('section').length === 2);
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
 --fcc-editable-region--
         <section>
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md
index 46658bd3322..bb43b47111a 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade9fa77275d9f4efe62
-title: 步骤 41
+title: Step 40
 challengeType: 0
-dashedName: step-41
+dashedName: step-40
 ---
 
 # --description--
@@ -34,11 +34,9 @@ assert(code.match(/Vanilla<\/p><p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md
index 2787e1d3ca6..7082746acca 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md
@@ -1,15 +1,15 @@
 ---
 id: 5f3ef6e01f288a026d709587
-title: 步骤 67
+title: Step 66
 challengeType: 0
-dashedName: step-67
+dashedName: step-66
 ---
 
 # --description--
 
 你可以使用 `hr` 元素在不同内容的部分之间显示一个分隔符。
 
-首先，在第一个 `header` 元素和 `main` 元素之间添加一个 `hr`元素。 注意：`hr` 元素是没有结束标签的。
+First, add an `hr` element between the `p` element with the class `established` and the first `section` element. 注意：`hr` 元素是没有结束标签的。
 
 # --hints--
 
@@ -20,10 +20,10 @@ assert(code.match(/<hr\s?\/?>/i));
 assert(!code.match(/<\/hr>/i));
 ```
 
-你不应该改变你现有的 `header` 元素。
+You should not change your existing `p` element with the class `established`.
 
 ```js
-assert($('header').length === 1);
+assert($('p.established').length === 1);
 ```
 
 你不应该改变你现有的 `main` 元素。
@@ -32,11 +32,11 @@ assert($('header').length === 1);
 assert($('main').length === 1);
 ```
 
-你的 `hr` 元素应该在你的 `header` 元素和 `main` 元素之间。
+Your `hr` element should be between your `p` element and your `section` element.
 
 ```js
-assert($('hr')[0].previousElementSibling.tagName === 'HEADER');
-assert($('hr')[0].nextElementSibling.tagName === 'MAIN');
+assert($('hr')[0].previousElementSibling.tagName === 'P');
+assert($('hr')[0].nextElementSibling.tagName === 'SECTION');
 ```
 
 # --seed--
@@ -55,11 +55,9 @@ assert($('hr')[0].nextElementSibling.tagName === 'MAIN');
   <body>
     <div class="menu">
 --fcc-editable-region--
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
index d8cab013337..1e31958c007 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e03d719d5ac4738993
-title: 步骤 57
+title: Step 56
 challengeType: 0
-dashedName: step-57
+dashedName: step-56
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(menuMaxWidth === '500px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
index c80a7544437..93e511a2d8a 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e04559b939080db057
-title: 步骤 56
+title: Step 55
 challengeType: 0
-dashedName: step-56
+dashedName: step-55
 ---
 
 # --description--
@@ -64,11 +64,9 @@ assert(menuPadding === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
index 46575ead2c9..3783999b048 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e050279c7a4a7101d3
-title: 步骤 55
+title: Step 54
 challengeType: 0
-dashedName: step-55
+dashedName: step-54
 ---
 
 # --description--
@@ -63,11 +63,9 @@ assert(menuPaddingBottom === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
index ac00420eb67..f6cfef39c9e 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e05473f91f948724ab
-title: 步骤 58
+title: Step 57
 challengeType: 0
-dashedName: step-58
+dashedName: step-57
 ---
 
 # --description--
@@ -41,11 +41,9 @@ assert(bodyFontFamily === 'sans-serif');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
index f4e8c208a4f..fced1d04276 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e056bdde6ae6892ba2
-title: 步骤 59
+title: Step 58
 challengeType: 0
-dashedName: step-59
+dashedName: step-58
 ---
 
 # --description--
@@ -54,11 +54,9 @@ assert($('h2').css('font-family').match(/impact/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
index 87305bc916f..a8db0264446 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e06d34faac0447fc44
-title: 步骤 61
+title: Step 60
 challengeType: 0
-dashedName: step-61
+dashedName: step-60
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(establishedFontStyle === 'italic');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md
index 6f96eed9268..9695891e9e9 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e07276f782bb46b93d
-title: 步骤 64
+title: Step 63
 challengeType: 0
-dashedName: step-64
+dashedName: step-63
 ---
 
 # --description--
@@ -51,12 +51,10 @@ assert(footer.previousElementSibling.tagName === 'MAIN');
   </head>
   <body>
     <div class="menu">
-      <header>
-        <h1>CAMPER CAFE</h1>
-        <p class="established">Est. 2020</p>
-      </header>
 --fcc-editable-region--
       <main>
+        <h1>CAMPER CAFE</h1>
+        <p class="established">Est. 2020</p>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
index ec71504bac6..e4e8b2bd6bb 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0819d4f23ca7285e6
-title: 步骤 49
+title: Step 48
 challengeType: 0
-dashedName: step-49
+dashedName: step-48
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('section')[1].children[1].className === 'item');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
index a6667439754..ea1f409fa20 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e087d56ed3ffdc36be
-title: 步骤 62
+title: Step 61
 challengeType: 0
-dashedName: step-62
+dashedName: step-61
 ---
 
 # --description--
@@ -45,13 +45,11 @@ assert($('.established').css('font-style') === 'italic');
   </head>
   <body>
     <div class="menu">
+      <main>
 --fcc-editable-region--
-      <header>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
 --fcc-editable-region--
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
index 67c80b16c4e..1685f75b9ca 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0a81099d9a697b550
-title: 步骤 65
+title: Step 64
 challengeType: 0
-dashedName: step-65
+dashedName: step-64
 ---
 
 # --description--
@@ -58,11 +58,9 @@ assert(document.querySelector("footer > p > a")?.href === "https://www.freecodec
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md
index d4ff588abb6..1a2a2d575cc 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0b431cc215bb16f55
-title: 步骤 66
+title: Step 65
 challengeType: 0
-dashedName: step-66
+dashedName: step-65
 ---
 
 # --description--
@@ -38,11 +38,9 @@ assert($('footer').children('p').last().text().match(/123 Free Code Camp Drive/i
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md
index 54256b3b193..4721d11cf0c 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0e0c3feaebcf647ad
-title: 步骤 48
+title: Step 47
 challengeType: 0
-dashedName: step-48
+dashedName: step-47
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('h2')[1].innerText.match(/Desserts/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md
index 5bd35d1260b..77fe57aee04 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0e9629bad967cd71e
-title: 步骤 60
+title: Step 59
 challengeType: 0
-dashedName: step-60
+dashedName: step-59
 ---
 
 # --description--
@@ -35,11 +35,9 @@ assert(fontFamily === 'Impact, serif');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md
index 649086b1d47..b2467df5dde 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0eaa7da26e3d34d78
-title: 步骤 54
+title: Step 53
 challengeType: 0
-dashedName: step-54
+dashedName: step-53
 ---
 
 # --description--
@@ -56,11 +56,9 @@ assert(menuPaddingRight === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md
index c7bafac41c2..adb7cf19a03 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0f8c230bdd2349716
-title: 步骤 63
+title: Step 62
 challengeType: 0
-dashedName: step-63
+dashedName: step-62
 ---
 
 # --description--
@@ -56,11 +56,9 @@ assert(h2FontSize === '30px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
index 0041b80a0ad..b1012c1405e 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3f26fa39591db45e5cd7a0
-title: 步骤 68
+title: Step 67
 challengeType: 0
-dashedName: step-68
+dashedName: step-67
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(hrHeight === '3px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md
index d5647c4ee6a..0428d654e88 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459225127805351a6ad057
-title: 步骤 69
+title: Step 68
 challengeType: 0
-dashedName: step-69
+dashedName: step-68
 ---
 
 # --description--
@@ -39,12 +39,10 @@ assert(hrBackgroundColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
index 0562fe8da69..fe5c8f022e0 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459a7ceb8b5c446656d88b
-title: 步骤 70
+title: Step 69
 challengeType: 0
-dashedName: step-70
+dashedName: step-69
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(hrBorderColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
index 424e03af947..c43ab5aa234 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459cf202c2a3472fae6a9f
-title: 步骤 71
+title: Step 70
 challengeType: 0
-dashedName: step-71
+dashedName: step-70
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(hrHeight === '2px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
index 74d8749fb9d..4afb8693a39 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459fd48bdc98491ca6d1a3
-title: 步骤 72
+title: Step 71
 challengeType: 0
-dashedName: step-72
+dashedName: step-71
 ---
 
 # --description--
@@ -39,13 +39,11 @@ assert($('hr')[1].nextElementSibling.tagName === 'FOOTER');
   </head>
   <body>
     <div class="menu">
-      <header>
-        <h1>CAMPER CAFE</h1>
-        <p class="established">Est. 2020</p>
-      </header>
-      <hr>
 --fcc-editable-region--
       <main>
+        <h1>CAMPER CAFE</h1>
+        <p class="established">Est. 2020</p>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md
index 6e09ea20aa0..77952bed49d 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a05977e2fa49d9119437
-title: 步骤 73
+title: Step 72
 challengeType: 0
-dashedName: step-73
+dashedName: step-72
 ---
 
 # --description--
@@ -39,12 +39,10 @@ assert(bodyPadding === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md
index 096bd6355ad..79459ee8497 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a276c093334f0f6e9df4
-title: 步骤 74
+title: Step 73
 challengeType: 0
-dashedName: step-74
+dashedName: step-73
 ---
 
 # --description--
@@ -63,12 +63,10 @@ assert(itemPMarginBottom === '5px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md
index 4a8c781c40a..0d61e36476c 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a5a7c49a8251f0bdb527
-title: 步骤 75
+title: Step 74
 challengeType: 0
-dashedName: step-75
+dashedName: step-74
 ---
 
 # --description--
@@ -47,12 +47,10 @@ assert(itemPFontSize === '18px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md
index 7da1dfdb24b..b39df045bd5 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a66d4a2b0453301e5a26
-title: 步骤 79
+title: Step 78
 challengeType: 0
-dashedName: step-79
+dashedName: step-78
 ---
 
 # --description--
@@ -54,12 +54,10 @@ assert(footerFontSize === '14px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md
index c12a344e0f1..227f8c8d809 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b0731d39e15d54df4dfc
-title: 步骤 80
+title: Step 79
 challengeType: 0
-dashedName: step-80
+dashedName: step-79
 ---
 
 # --description--
@@ -48,12 +48,10 @@ assert(aColor === 'black');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md
index b1bf368a35f..875f956ec60 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b25e7ec2405f166b9de1
-title: 步骤 81
+title: Step 80
 challengeType: 0
-dashedName: step-81
+dashedName: step-80
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(aVisitedColor === 'grey' || aVisitedColor === 'gray');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md
index 31f892db130..f75345fe582 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b3c93c027860d9298dbd
-title: 步骤 82
+title: Step 81
 challengeType: 0
-dashedName: step-82
+dashedName: step-81
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(aHoverColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md
index a5e98ea90ee..6360bd1a978 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b45d099f3e621fbbb256
-title: 步骤 83
+title: Step 82
 challengeType: 0
-dashedName: step-83
+dashedName: step-82
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(aActiveColor === 'white');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md
index 72abf5d7176..539aceffc46 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b4c81cea7763550e40df
-title: 步骤 84
+title: Step 83
 challengeType: 0
-dashedName: step-84
+dashedName: step-83
 ---
 
 # --description--
@@ -40,12 +40,10 @@ assert(aActiveColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md
index 63b43d9cdf8..54baa411a7f 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b715301bbf667badc04a
-title: 步骤 85
+title: Step 84
 challengeType: 0
-dashedName: step-85
+dashedName: step-84
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(h1MarginTop === '0px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md
index c87b761cffa..ca094fe89d5 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e270702a8456a664f0df
-title: 步骤 86
+title: Step 85
 challengeType: 0
-dashedName: step-86
+dashedName: step-85
 ---
 
 # --description--
@@ -40,12 +40,10 @@ assert(h1MarginBottom === '15px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md
index 22fbd9dc187..60a1ce8d8eb 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e36e745ead58487aabf2
-title: 步骤 87
+title: Step 86
 challengeType: 0
-dashedName: step-87
+dashedName: step-86
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(addressMarginBottom === '5px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md
index 9ec1a4ea9c0..0014ea4aa10 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e7a4750dd05b5a673920
-title: 步骤 88
+title: Step 87
 challengeType: 0
-dashedName: step-88
+dashedName: step-87
 ---
 
 # --description--
@@ -44,12 +44,10 @@ assert($('.address')[0].innerText.match(/123 Free Code Camp Drive/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md
index dd07a8095c8..75314c44693 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e8284aae155c83015dee
-title: 步骤 89
+title: Step 88
 challengeType: 0
-dashedName: step-89
+dashedName: step-88
 ---
 
 # --description--
@@ -46,12 +46,10 @@ assert($('img').attr('alt').match(/coffee icon/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
 --fcc-editable-region--
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md
index c6cb660e181..2e83eedb61b 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46ede1ff8fec5ba656b44c
-title: 步骤 78
+title: Step 77
 challengeType: 0
-dashedName: step-78
+dashedName: step-77
 ---
 
 # --description--
@@ -32,12 +32,10 @@ assert(code.match(/\/\*\s*FOOTER\s*\*\//i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md
index 516b7a0a3b5..8e32bc31f1f 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46fc57528aa1c4b5ea7c2e
-title: 步骤 76
+title: Step 75
 challengeType: 0
-dashedName: step-76
+dashedName: step-75
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(bottomLineMargin === '25px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md
index 252a6b02c0a..2925ab5c5c5 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md
@@ -1,8 +1,8 @@
 ---
 id: 5f4701b942c824109626c3d8
-title: 步骤 77
+title: Step 76
 challengeType: 0
-dashedName: step-77
+dashedName: step-76
 ---
 
 # --description--
@@ -38,12 +38,10 @@ assert($('hr')[1].className === 'bottom-line');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
index d21dbbab9e0..a63c8fcb373 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
@@ -1,8 +1,8 @@
 ---
 id: 5f475bb508746c16c9431d42
-title: 步骤 90
+title: Step 89
 challengeType: 0
-dashedName: step-90
+dashedName: step-89
 ---
 
 # --description--
@@ -72,12 +72,10 @@ assert(imgMarginRight === 'auto');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
index 4b871832f20..8e925900623 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f475e1c7f71a61d913836c6
-title: 步骤 91
+title: Step 90
 challengeType: 0
-dashedName: step-91
+dashedName: step-90
 ---
 
 # --description--
@@ -44,12 +44,10 @@ assert($('img').last().attr('alt').match(/pie icon/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md
index 70c8b508fa5..227d2c2b86d 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f47633757ae3469f2d33d2e
-title: 步骤 46
+title: Step 45
 challengeType: 0
-dashedName: step-46
+dashedName: step-45
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(priceWidth === '25%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md
index c9b8ce89de8..bddcc1fbb0b 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f47fe7e31980053a8d4403b
-title: 步骤 92
+title: Step 91
 challengeType: 0
-dashedName: step-92
+dashedName: step-91
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(imgMarginTop === '-25px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
@@ -209,12 +207,10 @@ a:active {
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
index 327772b3ab3..81e2d09e1c2 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
@@ -1,8 +1,8 @@
 ---
 id: 5f716ad029ee4053c7027a7a
-title: 步骤 50
+title: Step 49
 challengeType: 0
-dashedName: step-50
+dashedName: step-49
 ---
 
 # --description--
@@ -50,11 +50,9 @@ assert($('article').last().children('p')[1].innerText.match(/1\.50/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
index e8a33cbb02d..4873004b3c5 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
@@ -1,8 +1,8 @@
 ---
 id: 5f716bee5838c354c728a7c5
-title: 步骤 53
+title: Step 52
 challengeType: 0
-dashedName: step-53
+dashedName: step-52
 ---
 
 # --description--
@@ -84,11 +84,9 @@ assert(!code.match(/<\/p>\s+<p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md
index 93ca6087d66..609fddfd7d4 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7691dafd882520797cd2f0
-title: 步骤 44
+title: Step 43
 challengeType: 0
-dashedName: step-44
+dashedName: step-43
 ---
 
 # --description--
@@ -32,11 +32,9 @@ assert(!code.match(/<\/p>\s+<p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md
index 372bbe75c82..372d331c9f1 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7692f7c5b3ce22a57788b6
-title: 步骤 45
+title: Step 44
 challengeType: 0
-dashedName: step-45
+dashedName: step-44
 ---
 
 # --description--
@@ -62,11 +62,9 @@ assert(p[10] === price[4]);
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md
index f2b298a528b..3d087ad56dc 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f769541be494f25449b292f
-title: 步骤 34
+title: Step 33
 challengeType: 0
-dashedName: step-34
+dashedName: step-33
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(flavorTextAlign === 'left');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md
index bdf195b5c4e..ae024446b69 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md
@@ -1,8 +1,8 @@
 ---
 id: 5f76967fad478126d6552b0d
-title: 步骤 35
+title: Step 34
 challengeType: 0
-dashedName: step-35
+dashedName: step-34
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('.price')[0].innerText.match(/3\.00/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md
index f32062dc44f..4e29f6ad304 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md
@@ -1,8 +1,8 @@
 ---
 id: 5f769702e6e33127d14aa120
-title: 步骤 36
+title: Step 35
 challengeType: 0
-dashedName: step-36
+dashedName: step-35
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('.price').css('text-align') === 'right');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md
index 5052c09c8e7..deb5088a187 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7b87422a560036fd03ccff
-title: 步骤 51
+title: Step 50
 challengeType: 0
-dashedName: step-51
+dashedName: step-50
 ---
 
 # --description--
@@ -50,11 +50,9 @@ assert(!code.match(/<\/p>\s+<p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
index 00dfc227fa4..609a183d8b2 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7b88d37b1f98386f04edc0
-title: 步骤 52
+title: Step 51
 challengeType: 0
-dashedName: step-52
+dashedName: step-51
 ---
 
 # --description--
@@ -35,11 +35,9 @@ assert(selector)
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md
index 87e47dba79c..f975da55a79 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md
@@ -7,30 +7,29 @@ dashedName: step-5
 
 # --description--
 
-最后，使用 `viewport` `<meta>` 标签确保你的页面在所有设备上看起来都一样。
-
-在 `head` 中嵌套一个自闭合的 `meta` 元素。 给它一个 `name` 属性值为 `viewport`，和一个 `content` 属性值为 `width=device-width, initial-scale=1.0`。
+Add another self-closing `meta` element within the `head`. Give it a `name` attribute set to `viewport` and a `content` attribute set to `width=device-width, initial-scale=1.0` so your page looks the same on all devices.
 
 # --hints--
 
-你应该有两个 `meta` 元素。
+You should have two `meta` elements.
 
 ```js
 const meta = document.querySelectorAll('meta');
 assert(meta?.length === 2);
 ```
 
-你的新 `meta` 元素应该是一个自闭合元素。
+Your new `meta` element should be a self-closing element.
 
 ```js
 assert(code.match(/<\/meta>/i) === null);
 ```
 
-你的新 `meta` 元素应将 `name` 属性设置为 `viewport`，并将 `content` 属性设置为 `width=device-width, initial-scale=1.0`。
+Your new `meta` element should have a `name` attribute set to `viewport`, and a `content` attribute set to `width=device-width, initial-scale=1.0`.
 
 ```js
 const meta = [...document.querySelectorAll('meta')];
-const target = meta?.find(m => m?.getAttribute('name') === 'viewport' && m?.getAttribute('content') === 'width=device-width, initial-scale=1.0');
+const reValidContent = /^\s*width\s*=\s*device-width\s*,\s*initial-scale\s*=\s*1(?:\.0)?\s*$/;
+const target = meta?.find(m => m?.getAttribute('name') === 'viewport' && reValidContent.test(m?.getAttribute('content')));
 assert.exists(target);
 ```
 
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3952facd25a83fe8083.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3952facd25a83fe8083.md
index 46682d1f9a8..cbc22d99d4d 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3952facd25a83fe8083.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3952facd25a83fe8083.md
@@ -7,7 +7,7 @@ dashedName: step-20
 
 # --description--
 
-`::after` 用来创建一个伪元素，作为已选中元素的最后一个子元素。 我们可以用它在最后一个图像后添加一个空元素。 如果设置其 `width` 为和 images 相同，如果是两列布局，它会将最后一张图像挤到左边。 现在它居中显示，因为我们在 flex 容器上设置了 `justify-content: center`。
+`::after` 用来创建一个伪元素，作为已选中元素的最后一个子元素。 You can use it to add an empty element after the last image. If you give it the same `width` as the images it will push the last image to the left when the gallery is in a two-column layout. Right now, it is in the center because you set `justify-content: center` on the flex container.
 
 例如：
 
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md
index 4fa88195608..b1a097cfaf0 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md
@@ -9,7 +9,7 @@ dashedName: step-5
 
 HTML5 有些元素能够指明不同的内容区域。 这些元素能让你的 HTML 易于阅读，并有助于搜索引擎优化（SEO）和无障碍访问。
 
-指明一个主要区域，可通过在 `h1` 元素后面添加一个 `<main>` 开始标签，并在 `p` 元素后面添加一个 `</main>` 结束标签来实现。
+Identify the main section of this page by adding a `<main>` opening tag before the `h1` element, and a `</main>` closing tag after the `p` element.
 
 # --hints--
 
@@ -25,20 +25,20 @@ assert(document.querySelector('main'));
 assert(code.match(/<\/main\>/));
 ```
 
-你的 `main` 元素的开始标签应该在 `h1` 元素的下方。 你把顺序写错了。
+Your `main` element's opening tag should be below the `body` element. 你把顺序写错了。
 
 ```js
 const main = document.querySelector('main');
-assert.equal(main?.previousElementSibling?.tagName, "H1");
+assert.equal(main?.previousElementSibling, null);
 ```
 
-你的 `main` 元素的开始标签应该在 `h2` 元素上方。 你把顺序写错了。
+Your `main` element's opening tag should be above the `h1` element. 你把顺序写错了。
 
 ```js
-const collection = [...document.querySelectorAll('main,h2')].map(
+const collection = [...document.querySelectorAll('main,h1')].map(
   (node) => node.nodeName
 );
-assert(collection.indexOf('MAIN') < collection.indexOf('H2'));
+assert(collection.indexOf('MAIN') < collection.indexOf('H1'));
 ```
 
 你的 `main` 元素的开始标签应该在 `p` 元素的下方。 你把顺序写错了。
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md
index dc9d0412dd6..16357f8cd0f 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md
@@ -7,9 +7,9 @@ dashedName: step-6
 
 # --description--
 
-在上一步中，你将 `h2` 元素、注释和 `p` 元素嵌套在 `main` 元素中。 这叫作 *嵌套*。 嵌套的元素（子元素）的位置应该放在被他们嵌套的元素（父元素）中新的一行并且右侧保留两个空格的间距的后面。 这个间距被称为缩进，它被用来使 HTML 更容易读。
+In the previous step, you put the `h1`, `h2`, comment, and `p` elements inside the `main` element. 这叫作 *嵌套*。 嵌套的元素（子元素）的位置应该放在被他们嵌套的元素（父元素）中新的一行并且右侧保留两个空格的间距的后面。 这个间距被称为缩进，它被用来使 HTML 更容易读。
 
-`h2` 元素和注释比下面代码中的 `main` 元素多缩进了两个空格。 使用键盘上的空格键在 `p` 元素前面再添加两个空格，使其缩进得当。
+The `h1` element, `h2` element and the comment are indented two spaces more than the `main` element in the code below. 使用键盘上的空格键在 `p` 元素前面再添加两个空格，使其缩进得当。
 
 # --hints--
 
@@ -34,7 +34,7 @@ assert(
 不应更改 `h2` 元素行上的缩进。 它的开始标签前应该有 6 个空格。 可以重启步骤来恢复原始缩进。
 
 ```js
-assert(code.toLowerCase().match(/<main\>\s*\n\s{6}<h2>/));
+assert(code.toLowerCase().match(/<\/h1\>\s*\n\s{6}<h2>/));
 ```
 
 你的代码应该有注释。 你从之前的步骤中删除了注释。
@@ -89,9 +89,9 @@ assert(code.toLowerCase().match(/-->\s*\n\s{6}<p>/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
---fcc-editable-region--
+    --fcc-editable-region--
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
     <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md
index cfbc92b8785..01409f81b8f 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md
@@ -47,8 +47,8 @@ assert(collection.indexOf('P') < collection.indexOf('IMG'));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md
index 66f9ff82c4b..fd0608e2da5 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md
@@ -46,8 +46,8 @@ assert(!/\<img\s+src\s*=\s*https:\/\/cdn\.freecodecamp\.org\/curriculum\/cat-pho
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md
index c4f992a863c..eaf2a5bc774 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md
@@ -44,8 +44,8 @@ assert(altText.match(/A cute orange cat lying on its back\.?$/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md
index b09d37e4f9a..34880ce53a3 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md
@@ -64,8 +64,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md
index d722653594f..b4051cf13e4 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md
@@ -9,7 +9,7 @@ dashedName: step-11
 
 链接的文本必须放置在锚点元素（`a`）的起始和闭合标签之间。 例如，`<a href="https://www.freecodecamp.org">click here to go to freeCodeCamp.org</a>` 就是一个包含着文本 `click here to go to freeCodeCamp.org` 的链接。
 
-将锚点文本 `cat photos` 添加到锚点元素中。 这将成为链接的文本。
+Add the anchor text `link to cat pictures` to the anchor element. 这将成为链接的文本。
 
 # --hints--
 
@@ -25,12 +25,12 @@ assert(document.querySelector('a'));
 assert(code.match(/<\/a\>/));
 ```
 
-你的锚点元素（`a`）中的文本应该是 `cat photos`。 确保将链接的文本放置在锚点元素（`a`）的起始和闭合标签之间。
+Your anchor (`a`) element's text should be `link to cat pictures`. 确保将链接的文本放置在锚点元素（`a`）的起始和闭合标签之间。
 
 ```js
 assert(
   document.querySelector('a').innerText.toLowerCase().replace(/\s+/g, ' ') ===
-    'cat photos'
+    'link to cat pictures'
 );
 ```
 
@@ -41,8 +41,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md
index 8f1163c283d..95acd2d3254 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md
@@ -7,9 +7,10 @@ dashedName: step-12
 
 # --description--
 
-你现在可以在预览中看到图像旁边带下划线的字样 `cat photos`。 那是你的链接，点击它一下。
+In the previous step you turned the words `link to cat pictures` into a link by placing them between opening and closing anchor (`a`) tags. You can do the same to words inside of an element, such as a `p` element.
+
+In the text of your `p` element, turn the words `cat photos` into a link to `https://freecatphotoapp.com` by adding opening and closing anchor (`a`) tags around these words.
 
-在你的 `p` 元素的文本中，将单词 `cat photos` 转换为指向 `https://freecatphotoapp.com` 的链接，将这些单词放到新创建的锚点元素内。
 
 # --hints--
 
@@ -19,7 +20,7 @@ dashedName: step-12
 assert($('p > a').length);
 ```
 
-链接的 href 值应为 `https://freecatphotoapp.com`。 你可能忽略了 href 值或者有拼写错误。
+The link's `href` value should be `https://freecatphotoapp.com`. You have either omitted the `href` value or have a typo.
 
 ```js
 const nestedAnchor = $('p > a')[0];
@@ -54,13 +55,13 @@ assert(pText.match(/click here to view more cat photos\.?$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
       <p>Click here to view more cat photos.</p>
-      <a href="https://freecatphotoapp.com">cat photos</a>
+      <a href="https://freecatphotoapp.com">link to cat pictures</a>
 --fcc-editable-region--
       <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back.">
     </main>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md
index 3c9b9f1e8dd..b32ae389149 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md
@@ -40,8 +40,8 @@ assert(document.querySelector('a').getAttribute('target') === '_blank');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md
index c03de2fc53d..734004cf85a 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md
@@ -73,8 +73,8 @@ assert(document.querySelector('img').parentNode.nodeName === 'A');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md
index f6e0f91b86a..cde3be5c167 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md
index 19796cefd7d..5c5c5a4e67f 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md
@@ -64,8 +64,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md
index 55e380653ef..f609fc6e898 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md
@@ -37,10 +37,10 @@ assert(secondSectionLastElemNode.nodeName === 'UL');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
-      <h2>Cat Photos</h2>
+        <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
         <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
         <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
index 3a619d22c39..be9320ab574 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md
index 1b8d9ee6450..783ad2ad48c 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md
@@ -68,8 +68,8 @@ assert(!/\<img\s+.+\s+src\s*=\s*https:\/\/cdn\.freecodecamp\.org\/curriculum\/ca
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md
index cc65a7aa15c..7aab1cbd55f 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md
@@ -48,11 +48,11 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
-      <h2>Cat Photos</h2>
-      <!-- TODO: Add link to cat photos -->
+        <h2>Cat Photos</h2>
+        <!-- TODO: Add link to cat photos -->
         <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
         <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
       </section>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md
index 6d7eba8814a..2ed025ffda8 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md
@@ -69,8 +69,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md
index bd5b485926f..14ffa6487d8 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md
@@ -55,8 +55,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md
index 261a0895527..4f0cb883c8c 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md
@@ -51,8 +51,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
index 5dca42af6fa..001d41b5bd5 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
@@ -62,8 +62,8 @@ assert.deepStrictEqual(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md
index c8a3a899184..7baeb9e4511 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md
@@ -36,8 +36,8 @@ assert($('main > section')[1].lastElementChild.nodeName === 'FIGURE');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md
index 86300cbc940..e5761d9f2f5 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
index 4dd4e9af622..8799df80a7b 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
@@ -63,8 +63,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md
index 6b3b15bf035..1342e0378a9 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md
@@ -45,8 +45,8 @@ assert($('form')[0].innerHTML.trim().length === 0);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md
index a4eb13f93bb..ab8679b471d 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md
@@ -71,8 +71,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md
index 407e83a5275..b733129eae0 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md
@@ -64,8 +64,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md
index 26878a7e3a8..79f422df220 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md
@@ -58,8 +58,8 @@ assert(!/\<\s*input\s+placeholder\s*=\s*cat\s+photo\s+url/i.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md
index c5ecd272038..6f28e8e58c8 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md
@@ -47,8 +47,8 @@ assert(collection.indexOf('INPUT') < collection.indexOf('BUTTON'));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md
index 52e73469aff..7ce2ad2a598 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md
@@ -45,8 +45,8 @@ assert($('input')[0].getAttribute('required') === '');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
index a0e6c2d833e..bb9447de2af 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
@@ -90,8 +90,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
index fda90c0f2be..a0150ed2bb6 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md
index 219097434af..d192b7271a4 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md
@@ -57,8 +57,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md
index cdb466bbaf0..d692dfad377 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md
@@ -47,8 +47,8 @@ assert($('input')[0].id.match(/^indoor$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md
index 38e20d43dc5..736d5f77dae 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md
@@ -53,8 +53,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
index 2f02cb8aaae..a98407d3c46 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
@@ -75,8 +75,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md
index d0ead0c3979..18a09cfd429 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md
@@ -66,8 +66,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md
index abae6084ffb..dfe1a469aea 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md
@@ -59,8 +59,8 @@ assert(!$('input[type="checkbox"]')[2].hasAttribute('checked'));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md
index add16f3f4c9..230c5191cb5 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md
@@ -44,8 +44,8 @@ assert(document.querySelector('main').nextElementSibling.nodeName === 'FOOTER');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md
index d97340a9fae..8f20b5dab07 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md
@@ -44,8 +44,8 @@ assert(extraSpacesRemoved.match(/No Copyright - freeCodeCamp\.org$/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md
index 66d433baac6..2c44c3eadc0 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md
@@ -55,8 +55,8 @@ assert(pText.match(/^no copyright - freecodecamp.org$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md
index 680e1119ee6..8d31e8ef89c 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md
@@ -46,8 +46,8 @@ assert(noSpaces.match(/\<\/head\>\<body\>/));
 <html>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
index 53a9a44d356..3a9becf3cc3 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
@@ -51,8 +51,8 @@ assert(document.title && document.title.toLowerCase() === 'catphotoapp');
   </head>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
index 52b60aea513..5589e0919fb 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
@@ -44,8 +44,8 @@ assert(code.match(/<html\s+lang\s*=\s*('|")en\1\s*>/gi));
     <title>CatPhotoApp</title>
   </head>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md
index fc104d0ef03..71832551a28 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md
@@ -38,8 +38,8 @@ assert(noSpaces.match(/^\<\!DOCTYPEhtml\>\<html/));
   </head>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md
index a5c080d228a..1bfbc9cd1f6 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md
@@ -61,8 +61,8 @@ assert(!/\<img\s+.+\s+src\s*=\s*https:\/\/cdn\.freecodecamp\.org\/curriculum\/ca
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md
index d10eac3060c..7aac90ae0e2 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md
@@ -60,8 +60,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md
index b28c4c01c1f..f08c53674a6 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md
@@ -84,8 +84,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md
index eb69c1157e5..3fdcf75fe9a 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md
@@ -58,8 +58,8 @@ assert(!/\<input\s+type\s*=\s*text/.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md
index e18fcb3684a..4eba1c7d279 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md
@@ -54,8 +54,8 @@ assert(!/\<\s*button\s+type\s*=\s*submit/i.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
index 9e1b6ac2112..e24c3ca6da6 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
@@ -80,8 +80,8 @@ assert(labelElem.textContent.replace(/\s/g, '').match(/Loving/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md
index dbd6d2eafd8..c111546df9e 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md
@@ -42,8 +42,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md
index 06af613bcf3..4fa64945e8d 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md
@@ -30,8 +30,8 @@ assert($('input[type="checkbox"]')[0].id.match(/^loving$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md
index b1939f419a9..ab88974b729 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md
@@ -67,8 +67,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
index 74026ea0500..c9474b89a43 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
@@ -88,8 +88,8 @@ assert(code.match(/<\/label>\s*<label\s*>\s*<input [^>]+>\s*Outdoor/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md
index b239ca06f58..673a8376563 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md
@@ -9,7 +9,7 @@ dashedName: step-16
 
 在添加任何新内容之前，你应该使用 `section` 元素将猫咪照片内容与未来的内容分开。
 
-将当前位于 `main` 元素中的所有元素嵌套在 `section` 元素中。
+Take your `h2`, comment, `p`, and anchor (`a`) elements and nest them in a `section` element.
 
 # --hints--
 
@@ -35,10 +35,18 @@ assert(document.querySelector('section').parentNode.nodeName === 'MAIN');
 
 ```js
 const childrenOfSection = [...document.querySelector('section').childNodes];
-const foundElems = childrenOfSection.filter((child) => {
+const foundElements = childrenOfSection.filter((child) => {
   return ['H2', 'A', 'P'].includes(child.nodeName);
 });
-assert(foundElems.length === 3);
+assert(foundElements.length === 3);
+```
+
+The `h1` element should not be nested in the `section` element.
+
+```js
+const childrenOfSection = [...document.querySelector('section').childNodes];
+const includesH1 = childrenOfSection.some((child) => child.nodeName === 'H1');
+assert.isFalse(includesH1);
 ```
 
 # --seed--
@@ -48,9 +56,9 @@ assert(foundElems.length === 3);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
---fcc-editable-region--
+    --fcc-editable-region--
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md
index a164a7b84be..48593e1e726 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md
@@ -64,8 +64,8 @@ assert(foundElems.length === 2);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
 --fcc-editable-region--
       <section>
         <h2>Cat Photos</h2>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md
index 3a0b7896038..8088805f9af 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md
@@ -58,37 +58,37 @@ assert($('main > section')[2].children.length === 0);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
-      <h2>Cat Photos</h2>
-      <!-- TODO: Add link to cat photos -->
-      <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
-      <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
+        <h2>Cat Photos</h2>
+        <!-- TODO: Add link to cat photos -->
+        <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
+        <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
       </section>
 --fcc-editable-region--
       <section>
-      <h2>Cat Lists</h2>
-      <h3>Things cats love:</h3>
-      <ul>
-        <li>cat nip</li>
-        <li>laser pointers</li>
-        <li>lasagna</li>
-      </ul>
-      <figure>
-        <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/lasagna.jpg" alt="A slice of lasagna on a plate.">
-        <figcaption>Cats <em>love</em> lasagna.</figcaption>  
-      </figure>
-      <h3>Top 3 things cats hate:</h3>
-      <ol>
-        <li>flea treatment</li>
-        <li>thunder</li>
-        <li>other cats</li>
-      </ol>
-      <figure>
-        <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/cats.jpg" alt="Five cats looking around a field.">
-        <figcaption>Cats <strong>hate</strong> other cats.</figcaption>  
-      </figure>
+        <h2>Cat Lists</h2>
+        <h3>Things cats love:</h3>
+        <ul>
+          <li>cat nip</li>
+          <li>laser pointers</li>
+          <li>lasagna</li>
+        </ul>
+        <figure>
+          <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/lasagna.jpg" alt="A slice of lasagna on a plate.">
+          <figcaption>Cats <em>love</em> lasagna.</figcaption>  
+        </figure>
+        <h3>Top 3 things cats hate:</h3>
+        <ol>
+          <li>flea treatment</li>
+          <li>thunder</li>
+          <li>other cats</li>
+        </ol>
+        <figure>
+          <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/cats.jpg" alt="Five cats looking around a field.">
+          <figcaption>Cats <strong>hate</strong> other cats.</figcaption>  
+        </figure>
       </section>
 --fcc-editable-region--
     </main>
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md
index 07d0d24ad7e..b6080091618 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md
@@ -54,8 +54,8 @@ assert(extraSpacesRemoved.match(/Is your cat an indoor or outdoor cat\??$/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md
index d71446dbe8f..bbdc8299b52 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md
@@ -76,8 +76,8 @@ assert(fieldsetChildren[0].length > fieldsetChildren[1].length);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md
index 62c0966e05f..cc80427139d 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md
@@ -60,8 +60,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md
index 2ef9b91da54..f087c32f079 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md
@@ -60,8 +60,8 @@ assert(outdoorRadioButton.getAttribute('value').match(/^outdoor$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md
index 14d7e8c70fa..0283577cb4d 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md
@@ -48,8 +48,8 @@ assert(energeticCheckbox.getAttribute('value').match(/^energetic$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md
index 1ea63ed0dd4..81681d0b242 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md
@@ -37,8 +37,8 @@ assert.equal(document.querySelector('head > meta')?.getAttribute('charset')?.toL
   </head>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
@@ -106,8 +106,8 @@ assert.equal(document.querySelector('head > meta')?.getAttribute('charset')?.toL
     <title>CatPhotoApp</title>
   </head>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md
index 312d1d0bf91..723bad07957 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md
@@ -69,8 +69,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md
index 7e8e8b120a0..bf9ab8e71ef 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md
@@ -57,8 +57,8 @@ assert(!/\<\s*input\s+.*\s*=\s*catphotourl/.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md
index 35ef49a82e3..8607ffb11a8 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md
@@ -6,24 +6,25 @@ dashedName: step-8
 ---
 
 # --description--
+The `vh` unit stands for viewport height, and is relative to 1% of the `height` of the viewport.
 
-添加一些 CSS 来美化项目。 设置 `body` 的 `width` 为 `100%`，`height` 为 `100vh`。
+It is time to spruce the project up with some CSS. Begin by giving the `body` a `width` of `100%`, and a `height` of `100vh`.
 
 # --hints--
 
-应该使用 `body` 元素选择器。
+You should use the `body` element selector.
 
 ```js
 assert.exists(new __helpers.CSSHelp(document).getStyle('body'));
 ```
 
-应该把 `body` 元素的 `width` 属性值设置为 `100%`。
+You should give the `body` a `width` of `100%`.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.width, '100%');
 ```
 
-应该把 `body` 的 `height` 设置为 `100vh`。
+You should give the `body` a `height` of `100vh`.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.height, '100vh');
diff --git a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md
index dbf33dedf28..1241245cda1 100644
--- a/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md
+++ b/curriculum/challenges/chinese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md
@@ -6,24 +6,25 @@ dashedName: step-15
 ---
 
 # --description--
+The `rem` unit stands for root `em`, and is relative to the font size of the `html` element.
 
-由于 `label` 元素默认是 inline 行内元素，它们出现在其标签文本的同一行，使得文本难以阅读。 给 `label` 元素添加 `display: block`，并设置其 `margin` 为 `0.5rem 0`，来使其显示在不同的行，并且行之间有一定的距离。
+As `label` elements are inline by default, they are all displayed side by side on the same line, making their text hard to read. To make them appear on separate lines, add `display: block` to the `label` element, and add a `margin` of `0.5rem 0`, to separate them from each other.
 
 # --hints--
 
-应该使用 `label` 选择器。
+You should use the `label` selector.
 
 ```js
 assert.exists(new __helpers.CSSHelp(document).getStyle('label'));
 ```
 
-应该将 `display` 属性设置为 `block`。
+You should add a `display` property of value `block`.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('label')?.display, 'block');
 ```
 
-应该将 `margin` 属性设置为 `0.5rem 0`。
+You should add a `margin` property of value `0.5rem 0`.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('label')?.margin, '0.5rem 0px');
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md
index 490ea3e8e2f..3cc2e9eb620 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md
@@ -14,7 +14,7 @@ const info = document.querySelector("#info");
 info.innerText = "Hello World";
 ```
 
-This code would change the element assigned to the `div` variable to have the text `Hello World`. 
+This code would change the element assigned to the `div` variable to have the text `Hello World`.
 
 When a player clicks your `Go to store` button, you want to change the buttons and text. Remove the code inside the `goStore` function and add a line that updates the text of `button1` to say `Buy 10 health (10 gold)`.
 
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md
index d5c3664e5ed..28ff0bb1ad6 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md
@@ -135,7 +135,7 @@ const monsterHealthText =document.querySelector("#monsterHealth");
 --fcc-editable-region--
 const locations = [
     {
-        
+
     }
 ];
 --fcc-editable-region--
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
index d91e6245ebe..8f9a534ce96 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
@@ -206,7 +206,7 @@ function buyWeapon() {
     gold -= 30;
     currentWeapon++;
     goldText.innerText = gold;
-    
+
     text.innerText = "You now have a new weapon.";
   }
 }
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
index 4b1f8fb6cb6..95d244d0f28 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
@@ -7,7 +7,7 @@ dashedName: step-90
 
 # --description--
 
-You can insert variables into a string with the <dfn>concatenation operator</dfn> `+`. Update the `You now have a new weapon.` string to say `You now have a ` and the name of the new weapon. Remember to end the sentence with a period.
+You can insert variables into a string with the <dfn>concatenation operator</dfn> `+`. Update the `You now have a new weapon.` string to say `You now have a` and the name of the new weapon. Remember to end the sentence with a period.
 
 Here is an example that creates the string `Hello, our name is freeCodeCamp.`:
 
@@ -18,7 +18,7 @@ const ourStr = "Hello, our name is " + ourName + ".";
 
 # --hints--
 
-You should update the `text.innerText` assignment to start with the string `You now have a `.
+You should update the `text.innerText` assignment to start with the string `You now have a`.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*=\s*('|")You now have a \1/);
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
index 748ab4d2f08..0adfafd5584 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
@@ -214,7 +214,7 @@ function buyWeapon() {
     goldText.innerText = gold;
     let newWeapon = weapons[currentWeapon].name;
     text.innerText = "You now have a " + newWeapon + ".";
-    
+
   }
 }
 --fcc-editable-region--
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
index b7219fb9be1..4037d95c48c 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
@@ -7,7 +7,7 @@ dashedName: step-92
 
 # --description--
 
-Up until now, any time `text.innerText` was updated the old text was erased. This time, use the `+=` operator to add text to the end of `text.innerText`. Add the string ` In your inventory you have: ` - include the spaces at the beginning and the end.
+Up until now, any time `text.innerText` was updated the old text was erased. This time, use the `+=` operator to add text to the end of `text.innerText`. Add the string `In your inventory you have:` - include the spaces at the beginning and the end.
 
 # --hints--
 
@@ -24,7 +24,7 @@ You should use the `+=` operator to add to `text.innerText`.
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*/)
 ```
 
-You should add the string ` In your inventory you have: ` to the end of `text.innerText`. Mind the spaces!
+You should add the string `In your inventory you have:` to the end of `text.innerText`. Mind the spaces!
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*('|")\sIn your inventory you have:\s\1/)
@@ -203,7 +203,7 @@ function buyWeapon() {
     let newWeapon = weapons[currentWeapon].name;
     text.innerText = "You now have a " + newWeapon + ".";
     inventory.push(newWeapon);
-    
+
   }
 }
 --fcc-editable-region--
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
index 098be4a56e6..908c77e836c 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
@@ -11,7 +11,7 @@ At the end of the second `text.innerText` string you just added, use the concate
 
 # --hints--
 
-You should not change the ` In your inventory you have: ` string.
+You should not change the `In your inventory you have:` string.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*('|")\sIn your inventory you have:\s\1/)
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
index 03e5cceea99..59e7717ce5b 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
@@ -7,7 +7,7 @@ dashedName: step-105
 
 # --description--
 
-After your `currentWeapon`, use the concatenation operator to set `text.innerText` to the string `You sold a `, then `currentWeapon`, then the string `.`.
+After your `currentWeapon`, use the concatenation operator to set `text.innerText` to the string `You sold a`, then `currentWeapon`, then the string `.`.
 
 # --hints--
 
@@ -17,13 +17,13 @@ You should use the assignment operator with `text.innerText`.
 assert.match(sellWeapon.toString(), /text\.innerText\s*=/);
 ```
 
-You should add `You sold a ` to `text.innerText`. Spacing is important.
+You should add `You sold a` to `text.innerText`. Spacing is important.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*=\s*('|")You sold a \1/);
 ```
 
-You should add the value of `currentWeapon` to the `You sold a ` string. Use the concatenation operator to do this on the same line.
+You should add the value of `currentWeapon` to the `You sold a` string. Use the concatenation operator to do this on the same line.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*=\s*('|")You sold a\s\1\s*\+\s*\_currentWeapon/);
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
index bc8435faa22..ab3661c3b47 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
@@ -7,7 +7,7 @@ dashedName: step-106
 
 # --description--
 
-Now use the `+=` operator to add the string ` In your inventory you have: ` and the contents of `inventory` to the `text.innerText`. Make sure to include the space at the beginning and end of the ` In your inventory you have: ` string.
+Now use the `+=` operator to add the string `In your inventory you have:` and the contents of `inventory` to the `text.innerText`. Make sure to include the space at the beginning and end of the `In your inventory you have:` string.
 
 # --hints--
 
@@ -25,7 +25,7 @@ const matches = sellWeapon.toString().match(/text\.innerText\s*\+=/g);
 assert.equal(matches.length, 1);
 ```
 
-You should add the string ` In your inventory you have: ` to the second `text.innerText` line. Spacing matters.
+You should add the string `In your inventory you have:` to the second `text.innerText` line. Spacing matters.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*\+=\s*('|") In your inventory you have: \1/);
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
index 229ca08f2a2..d332dfa1870 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
@@ -17,19 +17,19 @@ You should use dot notation to access the `innerText` property of `text`.
 assert.match(attack.toString(), /text\.innerText/);
 ```
 
-You should assign the string `The ` to `innerText` property of `text`.
+You should assign the string `The` to `innerText` property of `text`.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1/);
 ```
 
-You should use the concatenation operator to add the value of `monsters[fighting].name` to the `The ` string.
+You should use the concatenation operator to add the value of `monsters[fighting].name` to the `The` string.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1\s*\+\s*monsters\[fighting\]\.name/);
 ```
 
-You should use the concatenation operator to add the string ` attacks.` to the `monsters[fighting].name` string.
+You should use the concatenation operator to add the string `attacks.` to the `monsters[fighting].name` string.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1\s*\+\s*monsters\[fighting\]\.name\s*\+\s*('|") attacks\.\2/);
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
index 6566de3802a..a96685f85e9 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
@@ -7,7 +7,7 @@ dashedName: step-119
 
 # --description--
 
-On a new line, add the string ` You attack it with your [weapon].` to the `text` value, replacing `[weapon]` with the player's current weapon.
+On a new line, add the string `You attack it with your [weapon].` to the `text` value, replacing `[weapon]` with the player's current weapon.
 
 # --hints--
 
@@ -24,7 +24,7 @@ You should use compound assignment with `text.innerText`.
 assert.match(attack.toString(), /text\.innerText\s*\+=/);
 ```
 
-You should add the string ` You attack it with your ` to the `text.innerText` value. Remember that spacing matters.
+You should add the string `You attack it with your` to the `text.innerText` value. Remember that spacing matters.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|") You attack it with your \1/);
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
index a2c6fde768a..5e0e6059dff 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
@@ -279,7 +279,7 @@ function attack() {
   text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
   health -= monsters[fighting].level;
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
index acf1efd38b0..055ca35f7fe 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
@@ -275,7 +275,7 @@ function attack() {
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
   healthText.innerText = health;
   monsterHealthText.innerText = monsterHealth;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
index 3524f53b4a3..74b7964b09f 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
@@ -11,7 +11,7 @@ Inside the `dodge` function, set `text.innerText` equal to the string `You dodge
 
 # --hints--
 
-You should assign the string `You dodge the attack from the ` to the `text.innerText` property. Remember that spacing matters.
+You should assign the string `You dodge the attack from the` to the `text.innerText` property. Remember that spacing matters.
 
 ```js
 assert.match(dodge.toString(), /text\.innerText\s*=\s*('|")You dodge the attack from the \1/);
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
index cb9eadcb3ec..c2913614de6 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
@@ -283,7 +283,7 @@ function dodge() {
 function defeatMonster() {
   gold += Math.floor(monsters[fighting].level * 6.7);
   xp += monsters[fighting].level;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
index ca92f837431..0101b5e2285 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
@@ -285,7 +285,7 @@ function defeatMonster() {
   xp += monsters[fighting].level;
   goldText.innerText = gold;
   xpText.innerText = xp;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
index dd0068655fd..93d46489227 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
@@ -10,7 +10,7 @@ dashedName: step-132
 Your `locations` array doesn't have a fifth element, so `locations[4]` doesn't work. Add a new object at the end of the `locations` array, following the same structure as the other objects. Set `name` to `kill monster`, set `button text` to an array with three `Go to town square` strings, set `button functions` to an array with three `goTown` variables, and set `text` to `The monster screams Arg! as it dies. You gain experience points and find gold.`.
 
 # --hints--
- 
+
 Your `locations` array should have five values.
 
 ```js
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
index 3e9df421573..6b3bc12e219 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
@@ -280,7 +280,7 @@ function attack() {
   text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
   health -= getMonsterAttackValue(monsters[fighting].level);
   if (isMonsterHit()) {
-    
+
   }
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
   healthText.innerText = health;
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
index 88836e37794..8bf8c85ac0e 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
@@ -7,7 +7,7 @@ dashedName: step-150
 
 # --description--
 
-Add an `else` statement to your `if` statement. In the `else` statement, use the `+=` operator to add the text ` You miss.` to the end of `text.innerText`.
+Add an `else` statement to your `if` statement. In the `else` statement, use the `+=` operator to add the text `You miss.` to the end of `text.innerText`.
 
 # --hints--
 
@@ -17,7 +17,7 @@ You should add an `else` block after your `if (isMonsterHit())` block.
 assert.match(attack.toString(), /if\s*\(isMonsterHit\(\)\s*\)\s*\{\s*monsterHealth\s*-=\s*weapons\[currentWeapon\]\.power\s*\+\s*Math\.floor\(Math\.random\(\)\s*\*\s*xp\)\s*\+\s*1;\s*\}\s*else/)
 ```
 
-You should add the text ` You miss.` to the end of `text.innerText`. Remember to use compound assignment.
+You should add the text `You miss.` to the end of `text.innerText`. Remember to use compound assignment.
 
 ```js
 assert.match(attack.toString(), /if\s*\(isMonsterHit\(\)\s*\)\s*\{\s*monsterHealth\s*-=\s*weapons\[currentWeapon\]\.power\s*\+\s*Math\.floor\(Math\.random\(\)\s*\*\s*xp\)\s*\+\s*1;\s*\}\s*else\s*\{\s*text\.innerText\s*\+=\s*('|")\sYou miss\.\1/)
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
index 4210b69f7a8..02ffeb838f6 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
@@ -7,7 +7,7 @@ dashedName: step-154
 
 # --description--
 
-Use the `+=` operator to add ` Your [weapon] breaks.` to the end of `text.innerText`, replacing `weapon` with the last item in the `inventory` array. You can get this last item by using `inventory.pop()`, which will remove the last item in the array AND return it so it appears in your string.
+Use the `+=` operator to add `Your [weapon] breaks.` to the end of `text.innerText`, replacing `weapon` with the last item in the `inventory` array. You can get this last item by using `inventory.pop()`, which will remove the last item in the array AND return it so it appears in your string.
 
 # --hints--
 
@@ -30,14 +30,14 @@ You should add the string " Your " to `text.innerText`. Remember that spacing ma
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1/);
 ```
 
-You should add the return value of `inventory.pop()` to the ` Your ` string.
+You should add the return value of `inventory.pop()` to the `Your` string.
 
 ```js
 console.log(attack.toString());
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1\s*\+\s*inventory\.pop\(\)/);
 ```
 
-You should add ` breaks.` to the ` "Your " + inventory.pop()` string.
+You should add `breaks.` to the `"Your " + inventory.pop()` string.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1\s*\+\s*inventory\.pop\(\)\s*\+\s*('|")\sbreaks\.\2/);
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
index b043a04a1a5..bb3a88b2824 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
@@ -375,7 +375,7 @@ function pickEight() {
 --fcc-editable-region--
 function pick(guess) {
   let numbers = [];
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
index ac85513b88f..c0e732491ac 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
@@ -11,13 +11,13 @@ After the `while` loop, set `text.innerText` to equal `You picked [guess]. Here
 
 # --hints--
 
-You should set `text.innerText` to the string `You picked `. Remember that spacing matters.
+You should set `text.innerText` to the string `You picked`. Remember that spacing matters.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1/);
 ```
 
-You should use the concatenation operator to add the value of the `guess` parameter to your `You picked ` string.
+You should use the concatenation operator to add the value of the `guess` parameter to your `You picked` string.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1\s*\+\s*guess/);
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
index 3b20e162326..7b34447692f 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
@@ -11,7 +11,7 @@ Before the final quote in that string you added, insert the new line escape char
 
 # --hints--
 
-You should add the new line escape character `\n` to your `. Here are the random numbers: ` string.
+You should add the new line escape character `\n` to your `. Here are the random numbers:` string.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1\s*\+\s*guess\s*\+\s*('|")\.\sHere are the random numbers:\\n\2/);
diff --git a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
index 180270940d6..c57f4d75914 100644
--- a/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
+++ b/curriculum/challenges/chinese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
@@ -369,7 +369,7 @@ function pick(guess) {
     numbers.push(Math.floor(Math.random() * 11));
   }
   text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/espanol/01-responsive-web-design/responsive-web-design-projects/build-a-survey-form.md b/curriculum/challenges/espanol/01-responsive-web-design/responsive-web-design-projects/build-a-survey-form.md
index 3fcb65777aa..a692dc18f03 100644
--- a/curriculum/challenges/espanol/01-responsive-web-design/responsive-web-design-projects/build-a-survey-form.md
+++ b/curriculum/challenges/espanol/01-responsive-web-design/responsive-web-design-projects/build-a-survey-form.md
@@ -119,7 +119,7 @@ const el = document.getElementById('email')
 assert(!!el && el.required)
 ```
 
-Tú `#email` debe ser un descendiente de `#survey-form`
+Tu `#email` debe ser descendiente de `#survey-form`
 
 ```js
 const el = document.querySelector('#survey-form #email')
diff --git a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md
index af6936c58be..1ac4811b280 100644
--- a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md
+++ b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md
@@ -8,7 +8,7 @@ dashedName: falsy-bouncer
 
 # --description--
 
-Quita todos los valores falsos de un arreglo.
+Elimina todos los valores falsos de un arreglo. Devuelve un nuevo arreglo; no alteres el arreglo original.
 
 Los valores falsos en JavaScript son `false`, `null`, `0`, `""`, `undefined` y `NaN`.
 
@@ -40,6 +40,14 @@ assert.deepEqual(bouncer([false, null, 0, NaN, undefined, '']), []);
 assert.deepEqual(bouncer([null, NaN, 1, 2, undefined]), [1, 2]);
 ```
 
+No debes alterar `arr`.
+
+```js
+const arr = ['a', false, 0, 'Naomi'];
+bouncer(arr);
+assert.deepEqual(arr, ['a', false, 0, 'Naomi'])
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
index f5460a90165..3bc96d303ae 100644
--- a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
+++ b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
@@ -37,12 +37,6 @@ assert(code.match(/quotient/g).length === 1);
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function(y){return 'quotient = '+y;})(quotient);
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
index 30bf2a478e5..ea5faa23445 100644
--- a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
+++ b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
@@ -11,12 +11,12 @@ dashedName: escape-sequences-in-strings
 
 Las comillas no son los únicos caracteres que pueden ser <dfn>escapados</dfn> dentro de una cadena. Hay dos razones para usar caracteres de escape:
 
-1.  Para permitir el uso de caracteres que de otra manera no te sería posible escribir, como un retorno de carro.
+1.  Para permitirte usar caracteres que de otra manera no se podrían representar dentro de una cadena, como el carácter nueva línea.
 2.  Para permitirte representar múltiples comillas en una cadena sin que JavaScript malinterprete lo que quieres decir.
 
 Esto lo aprendimos en el desafío anterior.
 
-<table class='table table-striped'><thead><tr><th>Código</th><th>Resultado</th></tr></thead><tbody><tr><td><code>\'</code></td><td>comilla simple</td></tr><tr><td><code>\"</code></td><td>comilla doble</td></tr><tr><td><code>\\</code></td><td>barra invertida</td></tr><tr><td><code>\n</code></td><td>línea nueva</td></tr><tr><td><code>\r</code></td><td>retorno de carro</td></tr><tr><td><code>\t</code></td><td>tabulación</td></tr><tr><td><code>\b</code></td><td>límite de palabra</td></tr><tr><td><code>\f</code></td><td>fuente de formulario</td></tr></tbody></table>
+<table class='table table-striped'><thead><tr><th>Código</th><th>Resultado</th></tr></thead><tbody><tr><td><code>\'</code></td><td>comilla simple</td></tr><tr><td><code>\"</code></td><td>comilla doble</td></tr><tr><td><code>\\</code></td><td>barra invertida</td></tr><tr><td><code>\n</code></td><td>línea nueva</td></tr><tr><td><code>\t</code></td><td>tabulador</td></tr><tr><td><code>\r</code></td><td>retorno del carro</td></tr><tr><td><code>\b</code></td><td>límite de palabra</td></tr><tr><td><code>\f</code></td><td>fuente de formulario</td></tr></tbody></table>
 
 *Ten en cuenta que la barra invertida en sí debe ser escapada para poder mostrarla como una barra invertida.*
 
@@ -78,14 +78,6 @@ assert(myStr === 'FirstLine\n\t\\SecondLine\nThirdLine');
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function(){
-if (myStr !== undefined){
-console.log('myStr:\n' + myStr);}})();
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
index 53e9008b3d6..65b18efb7c1 100644
--- a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
+++ b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
@@ -31,12 +31,6 @@ assert(/var\s+a\s*=\s*9(\s*;?\s*)$/.test(code));
 
 # --seed--
 
-## --after-user-code--
-
-```js
-if(typeof a !== 'undefined') {(function(a){return "a = " + a;})(a);} else { (function() {return 'a is undefined';})(); }
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
index 5854d92ad44..6c462626a2c 100644
--- a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
+++ b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
@@ -62,12 +62,6 @@ assert(code.match(/"/g).length === 4 && code.match(/'/g).length === 2);
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function() { return "myStr = " + myStr; })();
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
index 6a0ebe9d785..c08f220988a 100644
--- a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
+++ b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
@@ -98,7 +98,7 @@ function nextInLine(arr, item) {
 }
 
 // Setup
-const testArr = [1, 2, 3, 4, 5];
+let testArr = [1, 2, 3, 4, 5];
 
 // Display code
 console.log("Before: " + JSON.stringify(testArr));
@@ -109,7 +109,7 @@ console.log("After: " + JSON.stringify(testArr));
 # --solutions--
 
 ```js
-const testArr = [1, 2, 3, 4, 5];
+let testArr = [1, 2, 3, 4, 5];
 
 function nextInLine(arr, item) {
     arr.push(item);
diff --git a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
index 69acdec7e29..53fc78c4eac 100644
--- a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
+++ b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
@@ -71,6 +71,13 @@ assert(
 );
 ```
 
+No se debe usar variables globales como almacenamiento temporal del array.
+
+```js
+countdown(1)
+assert.deepStrictEqual(countdown(5), [5, 4, 3, 2, 1]);
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
index dc86e0fd785..1cd7d40d742 100644
--- a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
+++ b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
@@ -56,6 +56,13 @@ assert.deepStrictEqual(rangeOfNumbers(6, 9), [6, 7, 8, 9]);
 assert.deepStrictEqual(rangeOfNumbers(4, 4), [4]);
 ```
 
+No se debe usar variables globales como almacenamiento temporal del array.
+
+```js
+rangeOfNumbers(1, 3)
+assert.deepStrictEqual(rangeOfNumbers(6, 9), [6, 7, 8, 9]);
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
index cb33f49a4ea..58355b11e7a 100644
--- a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
+++ b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
@@ -12,24 +12,35 @@ ES6 proporciona una nueva sintaxis para crear objetos, usando la palabra clave <
 
 Debemos notar que la sintaxis `class` es sólo sintaxis, y no una implementación completa basada en clases de un paradigma orientado a objetos, a diferencia de lenguajes como Java, Python, Ruby, etc.
 
-En ES5, normalmente definimos una función `constructor` y usamos la palabra clave `new` para instanciar un objeto.
-
-```js
-var SpaceShuttle = function(targetPlanet){
-  this.targetPlanet = targetPlanet;
-}
-var zeus = new SpaceShuttle('Jupiter');
-```
-
-La sintaxis `class` simplemente reemplaza la creación de la función `constructor`:
+En ES5, se puede crear un objeto definiendo una funcion `constructor` y usando la palabra clave `new` para instanciar el objeto.
+
+En ES6, una declaración `class` tiene un método `constructor` que se invoca con la palabra clave `new`. Si el método `constructor` no se define explícitamente, entonces se define implícitamente sin argumentos.
 
 ```js
+// Explicit constructor
 class SpaceShuttle {
   constructor(targetPlanet) {
     this.targetPlanet = targetPlanet;
   }
+  takeOff() {
+    console.log("To " + this.targetPlanet + "!");
+  }
 }
+
+// Implicit constructor 
+class Rocket {
+  launch() {
+    console.log("To the moon!");
+  }
+}
+
 const zeus = new SpaceShuttle('Jupiter');
+// prints To Jupiter! in console
+zeus.takeOff();
+
+const atlas = new Rocket();
+// prints To the moon! in console
+atlas.launch();
 ```
 
 Debe tenerse en cuenta que la palabra clave `class` declara una nueva función, a la cual se añade un constructor. Este constructor se invoca cuando `new` es llamado para crear un nuevo objeto.
diff --git a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
index b95869da43f..e6700e0636c 100644
--- a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
+++ b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
@@ -53,7 +53,8 @@ assert(
 `bicycle.setGear(48)` debe cambiar el valor de `gear` a 48.
 
 ```js
-assert(new bicycle.setGear(48).gear === 48);
+bicycle.setGear(48);
+assert(bicycle.gear === 48);
 ```
 
 # --seed--
diff --git a/curriculum/challenges/espanol/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/espanol/02-javascript-algorithms-and-data-structures/functional-programming/add-elements-to-the-end-of-an-array-using-concat-instead-of-push.md
index 1310e076931..d1c4177fdf6 100644
--- a/curriculum/challenges/espanol/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/espanol/02-javascript-algorithms-and-data-structures/functional-programming/add-elements-to-the-end-of-an-array-using-concat-instead-of-push.md
@@ -10,20 +10,20 @@ dashedName: add-elements-to-the-end-of-an-array-using-concat-instead-of-push
 
 La programación funcional consiste en crear y utilizar funciones no mutantes.
 
-El último desafío introdujo el método `concat` como una forma de combinar arreglos en uno nuevo sin mutar los arreglos originales. Compara `concat` con el método `push`. `push` añade un elemento al final del arreglo desde el que se llama, lo cual muta ese arreglo. Aquí hay un ejemplo:
+En el reto anterior se introdujo el método `concat` como una forma de unir varios arreglos en uno nuevo sin alterar los arreglos originales. Compara `concat` con el método `push`. `push` añade elementos al final del propio arreglo sobre el que es invocado, alterando dicho arreglo. Aquí hay un ejemplo:
 
 ```js
 const arr = [1, 2, 3];
-arr.push([4, 5, 6]);
+arr.push(4, 5, 6);
 ```
 
-`arr` tendría un valor modificado de `[1, 2, 3, [4, 5, 6]]`, que no encaja con el paradigma de la programación funcional.
+`arr` habría sido modificado a `[1, 2, 3, 4, 5, 6]`, hecho que no cumple con los principios de la programación funcional.
 
-`concat` ofrece una forma de añadir nuevos elementos al final de un arreglo, sin provocar ningún efecto de mutación.
+`concat` ofrece una manera de unir nuevos elementos al final del arreglo sin ningún efecto colateral.
 
 # --instructions--
 
-Cambia la función `nonMutatingPush` para que use `concat` para añadir `newItem` al final de `original` en lugar de `push`. La función debe devolver un arreglo.
+Cambia la función `nonMutatingPush` de manera que utilice `concat` para unir `newItem` al final de `original` sin alterar los arreglos `original` o `newItem`. La función debe devolver un arreglo.
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
index 9817ea54080..d0991d9eb4f 100644
--- a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
+++ b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
@@ -137,14 +137,6 @@ assert.strictEqual(
 
 # --seed--
 
-## --after-user-code--
-
-```js
-if(bob){
-  bob = new Person("Bob Ross");
-}
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
index e9a0a662639..9fb66cc6175 100644
--- a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
+++ b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
@@ -42,6 +42,13 @@ Tu solución no debe utilizar los métodos `Array.prototype.flat()` o `Array.pro
 assert(!code.match(/\.\s*flat\s*\(/) && !code.match(/\.\s*flatMap\s*\(/));
 ```
 
+Las variables globales no deben ser usadas.
+
+```js
+steamrollArray([1, {}, [3, [[4]]]])
+assert.deepEqual(steamrollArray([1, {}, [3, [[4]]]]), [1, {}, 3, 4])
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
index 65bd8895464..ebc50c90d83 100644
--- a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
+++ b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
@@ -47,28 +47,48 @@ sumPrimes(10);
 # --solutions--
 
 ```js
-function eratosthenesArray(n) {
-    var primes = [];
-    if (n > 2) {
-        var half = n>>1;
-        var sieve = Array(half);
-        for (var i = 1, limit = Math.sqrt(n)>>1; i <= limit; i++) {
-            if (!sieve[i]) {
-                for (var step = 2*i+1, j = (step*step)>>1; j < half; j+=step) {
-                    sieve[j] = true;
-                }
-            }
-        }
-        primes.push(2);
-        for (var p = 1; p < half; p++) {
-            if (!sieve[p]) primes.push(2*p+1);
+class PrimeSeive {
+  constructor(num) {
+    const seive = Array(Math.floor((num - 1) / 2)).fill(true);
+    const upper = Math.floor((num - 1) / 2);
+    const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+
+    for (let i = 0; i <= sqrtUpper; i++) {
+      if (seive[i]) {
+        // Mark value in seive array
+        const prime = 2 * i + 3;
+        // Mark all multiples of this number as false (not prime)
+        const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+        for (let j = primeSqaredIndex; j < upper; j += prime) {
+          seive[j] = false;
         }
+      }
     }
-    return primes;
-}
+
+    this._seive = seive;
+  }
+
+  isPrime(num) {
+    return num === 2
+      ? true
+      : num % 2 === 0
+        ? false
+        : this.isOddPrime(num);
+  }
+
+  isOddPrime(num) {
+    return this._seive[(num - 3) / 2];
+  }
+};
 
 function sumPrimes(num) {
-  return eratosthenesArray(num+1).reduce(function(a,b) {return a+b;}, 0);
+  const primeSeive = new PrimeSeive(num);
+
+  let sum = 2;
+  for (let i = 3; i <= num; i += 2) {
+    if (primeSeive.isOddPrime(i)) sum += i;
+  }
+  return sum;
 }
 
 sumPrimes(10);
diff --git a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
index f989482b749..5f210599c77 100644
--- a/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
+++ b/curriculum/challenges/espanol/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
@@ -79,23 +79,55 @@ assert(beagle.constructor === Dog);
 `beagle.eat()` debe imprimir la cadena `nom nom nom`
 
 ```js
-console.log = function (msg) {
-  throw msg;
-};
-assert.throws(() => beagle.eat(), 'nom nom nom');
+capture();
+beagle.eat();
+uncapture();
+assert(logOutput == 'nom nom nom');
 ```
 
 `beagle.bark()` debe imprimir la cadena `Woof!`
 
 ```js
-console.log = function (msg) {
-  throw msg;
-};
-assert.throws(() => beagle.bark(), 'Woof!');
+capture();
+beagle.bark();
+uncapture();
+assert(logOutput == 'Woof!');
 ```
 
 # --seed--
 
+## --before-user-code--
+
+```js
+var logOutput = "";
+var originalConsole = console
+function capture() {
+    var nativeLog = console.log;
+    console.log = function (message) {
+        logOutput = message;
+        if(nativeLog.apply) {
+          nativeLog.apply(originalConsole, arguments);
+        } else {
+          var nativeMsg = Array.prototype.slice.apply(arguments).join(' ');
+          nativeLog(nativeMsg);
+        }
+    };
+}
+
+function uncapture() {
+  console.log = originalConsole.log;
+}
+
+capture();
+```
+
+## --after-user-code--
+
+```js
+uncapture();
+(function() { return logOutput || "console.log never called"; })();
+```
+
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/espanol/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md b/curriculum/challenges/espanol/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
index 7a4ebb394d2..4fd531e79b8 100644
--- a/curriculum/challenges/espanol/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
+++ b/curriculum/challenges/espanol/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
@@ -8,7 +8,7 @@ dashedName: build-a-25--5-clock
 
 # --description--
 
-**Objetivo:** Crea una aplicación que sea funcionalmente similar a esto: <a href="https://codepen.io/freeCodeCamp/full/XpKrrW" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/XpKrrW</a>.
+**Objetivo:** Construye una aplicación que sea funcionalmente similar a esta: <a href="https://25--5-clock.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://25--5-clock.freecodecamp.rocks</a>.
 
 Completa las historias de usuario a continuación y obtén todas las pruebas para aprobar. Utiliza cualquier librería o API que necesites. Dale tu propio estilo.
 
diff --git a/curriculum/challenges/espanol/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md b/curriculum/challenges/espanol/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
index 0f736000f83..592b8c4df58 100644
--- a/curriculum/challenges/espanol/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
+++ b/curriculum/challenges/espanol/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
@@ -8,7 +8,7 @@ dashedName: build-a-drum-machine
 
 # --description--
 
-**Objetivo:** Crea una aplicación que sea funcionalmente similar a esta: <a href="https://codepen.io/freeCodeCamp/full/MJyNMd" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/MJyNMd</a>.
+**Objetivo:**Construye una aplicación que sea funcionalmente similar a esta: <a href="https://drum-machine.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://drum-machine.freecodecamp.rocks/</a>.
 
 Completa las historias de usuario a continuación y obtén todas las pruebas para aprobar. Utiliza cualquier librería o API que necesites. Dale tu propio estilo.
 
diff --git a/curriculum/challenges/espanol/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md b/curriculum/challenges/espanol/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
index 79af810e54e..036c4cd75b1 100644
--- a/curriculum/challenges/espanol/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
+++ b/curriculum/challenges/espanol/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
@@ -8,7 +8,7 @@ dashedName: build-a-javascript-calculator
 
 # --description--
 
-**Objetivo:** Crea una aplicación que sea funcionalmente similar a esta: <a href="https://codepen.io/freeCodeCamp/full/wgGVVX" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/wgGVVX</a>.
+**Objetivo:** Construye una aplicación que sea funcionalmente similar a esta: <a href="https://javascript-calculator.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://javascript-calculator.freecodecamp.rocks/</a>.
 
 Completa las historias de usuario a continuación y obtén todas las pruebas para aprobar. Utiliza cualquier librería o API que necesites. Dale tu propio estilo.
 
diff --git a/curriculum/challenges/espanol/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md b/curriculum/challenges/espanol/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
index 6bb74e95253..d82b46795c5 100644
--- a/curriculum/challenges/espanol/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
+++ b/curriculum/challenges/espanol/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
@@ -8,7 +8,7 @@ dashedName: build-a-markdown-previewer
 
 # --description--
 
-**Objetivo:** Crea una aplicación con funciones similares a esta: <a href="https://codepen.io/freeCodeCamp/full/GrZVVO" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/GrZVVO</a>.
+**Objetivo:** Construye una aplicación que sea funcionalmente similar a esta: <a href="https://markdown-previewer.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://markdown-previewer.freecodecamp.rocks/</a>.
 
 Completa las historias de usuario a continuación y obtén todas las pruebas para aprobar. Utiliza cualquier librería o API que necesites. Dale tu propio estilo.
 
diff --git a/curriculum/challenges/espanol/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md b/curriculum/challenges/espanol/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
index 0b7f87e3862..f6ee0575de0 100644
--- a/curriculum/challenges/espanol/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
+++ b/curriculum/challenges/espanol/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
@@ -8,7 +8,7 @@ dashedName: build-a-random-quote-machine
 
 # --description--
 
-**Objetivo:** Crea una aplicación con funciones similares a esta: <a href="https://codepen.io/freeCodeCamp/full/qRZeGZ" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/qRZeGZ</a>.
+**Objetivo:** Construye una aplicación que sea funcionalmente similar a esta: <a href="https://random-quote-machine.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://random-quote-machine.freecodecamp.rocks/</a>.
 
 Completa las historias de usuario a continuación y obtén todas las pruebas para aprobar. Utiliza cualquier librería o API que necesites. Dale tu propio estilo.
 
diff --git a/curriculum/challenges/espanol/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md b/curriculum/challenges/espanol/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
index 1ea45f740d2..9ea376e3bb6 100644
--- a/curriculum/challenges/espanol/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
+++ b/curriculum/challenges/espanol/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
@@ -8,7 +8,7 @@ dashedName: visualize-data-with-a-bar-chart
 
 # --description--
 
-**Objetivo** Crea una aplicación que funcione similar a esto: <a href="https://codepen.io/freeCodeCamp/full/GrZVaM" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/GrZVaM</a>.
+**Objetivo:** crea una app que sea funcionalmente similar a esta: <a href="https://bar-chart.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://bar-chart.freecodecamp.rocks</a>.
 
 Completa las historias de usuario a continuación y obtén todas las pruebas para aprobar. Utiliza cualquier librería o API que necesites. Dale tu propio estilo.
 
diff --git a/curriculum/challenges/espanol/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md b/curriculum/challenges/espanol/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
index 09a430de972..dc8e77ae5b4 100644
--- a/curriculum/challenges/espanol/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
+++ b/curriculum/challenges/espanol/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
@@ -8,7 +8,7 @@ dashedName: visualize-data-with-a-choropleth-map
 
 # --description--
 
-**Objetivo:** Crea una aplicación que sea funcionalmente similar a esta<a href="https://codepen.io/freeCodeCamp/full/EZKqza" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/EZKqza</a>.
+**Objetivo:** crea una app que sea funcionalmente similar a esta: <a href="https://choropleth-map.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://choropleth-map.freecodecamp.rocks</a>.
 
 Completa las historias de usuario a continuación y obtén todas las pruebas para aprobar. Utiliza cualquier librería o API que necesites. Dale tu propio estilo.
 
diff --git a/curriculum/challenges/espanol/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md b/curriculum/challenges/espanol/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
index c341e71bfef..1b650952d27 100644
--- a/curriculum/challenges/espanol/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
+++ b/curriculum/challenges/espanol/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
@@ -8,7 +8,7 @@ dashedName: visualize-data-with-a-heat-map
 
 # --description--
 
-**Objetivo:** Crea una aplicación que sea funcionalmente similar a <a href="https://codepen.io/freeCodeCamp/full/JEXgeY" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/JEXgeY</a>.
+**Objetivo:** crea una app que sea funcionalmente similar a esta: <a href="https://heat-map.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://heat-map.freecodecamp.rocks</a>.
 
 Completa las historias de usuario a continuación y obtén todas las pruebas para aprobar. Utiliza cualquier librería o API que necesites. Dale tu propio estilo.
 
diff --git a/curriculum/challenges/espanol/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md b/curriculum/challenges/espanol/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
index df1a789b128..c097b791c4a 100644
--- a/curriculum/challenges/espanol/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
+++ b/curriculum/challenges/espanol/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
@@ -8,7 +8,7 @@ dashedName: visualize-data-with-a-scatterplot-graph
 
 # --description--
 
-**Objetivo:** Crea una aplicación que sea funcionalmente similar a <a href="https://codepen.io/freeCodeCamp/full/bgpXyK" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/bgpXyK</a>.
+**Objetivo:** crea una app que sea funcionalmente similar a esta: <a href="https://scatterplot-graph.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://scatterplot-graph.freecodecamp.rocks</a>.
 
 Completa las historias de usuario a continuación y obtén todas las pruebas para aprobar. Utiliza cualquier librería o API que necesites. Dale tu propio estilo.
 
diff --git a/curriculum/challenges/espanol/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md b/curriculum/challenges/espanol/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
index b904883101b..ed05ddb1782 100644
--- a/curriculum/challenges/espanol/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
+++ b/curriculum/challenges/espanol/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
@@ -8,7 +8,7 @@ dashedName: visualize-data-with-a-treemap-diagram
 
 # --description--
 
-**Objetivo:** Crea una aplicación que sea funcionalmente similar a <a href="https://codepen.io/freeCodeCamp/full/KaNGNR" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/KaNGNR</a>.
+**Objetivo:** crea una app que sea funcionalmente similar a esta: <a href="https://treemap-diagram.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://treemap-diagram.freecodecamp.rocks</a>.
 
 Completa las historias de usuario a continuación y obtén todas las pruebas para aprobar. Utiliza cualquier librería o API que necesites. Dale tu propio estilo.
 
diff --git a/curriculum/challenges/espanol/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md b/curriculum/challenges/espanol/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md
index c5ecedf3ed6..bac6fe18834 100644
--- a/curriculum/challenges/espanol/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md
+++ b/curriculum/challenges/espanol/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md
@@ -12,7 +12,7 @@ dashedName: create-a-model
 
 En primer lugar, necesitamos un esquema. Cada esquema asigna a una colección de MongoDB. Define la forma de los documentos dentro de esa colección. Los esquemas son bloques de construcción para los modelos. Pueden ser anidados para crear modelos complejos, pero en este caso las cosas serán sencillas. Un modelo te permite crear instancias de tus objetos, llamados documentos.
 
-Replit es un servidor real, y en servidores reales las interacciones con la base de datos ocurren en funciones gestoras (handler functions). Estas funciones se ejecutan cuando ocurre algún evento (por ejemplo, alguien golpea un endpoint en tu API). Seguiremos el mismo enfoque en estos ejercicios. La función `done()` es un callback que nos dice que podemos proceder después de completar una operación asincrónica como insertar, buscar, actualizar o eliminar. Sigue la convención de Node, y debe ser llamado como `done(null, data)` en caso de éxito, o `done(err)` en caso de error.
+Replit es un servidor real, y en los servidores reales, las interacciones con la base de datos ocurren en funciones de manejo. Estas funciones se ejecutan cuando ocurre algún evento (por ejemplo, alguien golpea un endpoint en tu API). Seguiremos el mismo enfoque en estos ejercicios. La función `done()` es un callback que nos dice que podemos proceder después de completar una operación asincrónica como insertar, buscar, actualizar o eliminar. Sigue la convención de Node, y debe ser llamado como `done(null, data)` en caso de éxito, o `done(err)` en caso de error.
 
 Advertencia: ¡Al interactuar con servicios remotos, pueden ocurrir errores!
 
diff --git a/curriculum/challenges/espanol/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md b/curriculum/challenges/espanol/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md
index af500274d4b..209d72e376e 100644
--- a/curriculum/challenges/espanol/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md
+++ b/curriculum/challenges/espanol/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md
@@ -8,7 +8,7 @@ dashedName: assert-deep-equality-with--deepequal-and--notdeepequal
 
 # --description--
 
-Como recordatorio, este proyecto esta siendo construído con base en el siquiente proyecto inicial,<a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>  o clonado de  <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
+Para este proyecto, puedes usar el siguiente código inicial en <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>  o clonarlo de <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `deepEqual()` confirma que dos objetos son iguales en profundidad.
 
diff --git a/curriculum/challenges/espanol/09-information-security/information-security-projects/port-scanner.md b/curriculum/challenges/espanol/09-information-security/information-security-projects/port-scanner.md
index d4b4d6cb893..73bce5873dc 100644
--- a/curriculum/challenges/espanol/09-information-security/information-security-projects/port-scanner.md
+++ b/curriculum/challenges/espanol/09-information-security/information-security-projects/port-scanner.md
@@ -1,6 +1,6 @@
 ---
 id: 5e46f979ac417301a38fb932
-title: Port Scanner
+title: Escáner de puertos
 challengeType: 10
 forumTopicId: 462372
 helpCategory: Python
@@ -9,26 +9,80 @@ dashedName: port-scanner
 
 # --description--
 
-Create a port scanner using Python.
+En este proyecto, vas a trabajar con nuestra <a href="https://replit.com/github/freeCodeCamp/boilerplate-port-scanner" target="_blank" rel="noopener noreferrer nofollow">plantilla de Replit</a>.
 
-You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-port-scanner).
+Todavía estamos desarrollando la parte interactiva del currículo de Python. Por ahora, aquí hay algunos videos en el canal de YouTube de freeCodeCamp.org que te enseñaran todo lo que necesitas saber para completar este proyecto:
 
-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.
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a> (14 hours)
 
-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:
+- <a href="https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/" target="_blank" rel="noopener noreferrer nofollow">Learn Python Basics in Depth</a> (4 hours)
 
-<ul>
-  <li>
-    <a href='https://www.freecodecamp.org/news/python-for-everybody/'>Python for Everybody Video Course</a> (14 hours)
-  </li>
-  <li>
-    <a href='https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/'>Learn Python Video Course</a> (2 hours)
-  </li>
-</ul>
+- <a href="https://www.freecodecamp.org/news/intermediate-python-course/" target="_blank" rel="noopener noreferrer nofollow">Intermediate Python Course</a> (6 hours)
+
+# --instructions--
+
+Crear un escáner de puerto usando Python.
+
+En el archivo `port_scanner.py`, crea una función llamada `get_open_ports`, esta tomara un argumento `target` y otro argumento llamado `port_range`. El `target` puede ser un URL o una dirección IP. El `port_range` es un lista de dos numeros, indicando el primer y ultimo numero del rango de los puertos a verificar.
+
+Aquí hay unos ejemplos de como la función debe ser llamada:
+
+```py
+get_open_ports("209.216.230.240", [440, 445])
+get_open_ports("www.stackoverflow.com", [79, 82])
+```
+
+La función debe retornar una lista de puertos abiertos en el rango dado.
+
+La función `get_open_ports` también debería tomar un tercer argumento opcional de `True` para indicar de forma "Detallada". Si este es establecido como verdadero, la función debe retornar una cadena descriptiva en lugar de una lista de puertos.
+
+Este es el formato de la cadena que debe retornarse en modo detallado (el texto dentro de las `{}` indica la información que debe aparecer):
+
+```bash
+Open ports for {URL} ({IP address})
+PORT     SERVICE
+{port}   {service name}
+{port}   {service name}
+```
+
+Puedes usar el diccionario en `common_ports.py` para obtener el nombre del servicio correcto para cada puerto.
+
+Por ejemplo, si la función es llamada así:
+
+```py
+port_scanner.get_open_ports("scanme.nmap.org", [20, 80], True)
+```
+
+Esto debe retornar lo siguiente:
+
+```bash
+Open ports for scanme.nmap.org (45.33.32.156)
+PORT     SERVICE
+22       ssh
+80       http
+```
+
+Asegúrese de incluir el espacio adecuado y los caracteres de la nueva línea.
+
+Si el URL pasado dentro de la función `get_open_ports` es invalido, la función debe retornar la cadena de texto: "Error: Invalid hostname".
+
+Si la dirección IP pasada dentro de la función `get_open_ports` es invalida, la función debe retornar la cadena de texto: "Error: Invalid IP address".
+
+## Desarrollo
+
+Escribe tu codigo en `port_scanner.py`. Para el desarrollo, puedes usar `main.py` para probar tu código. Haz click en el botón "Ejecutar" y `main.py` se ejecutará.
+
+## Pruebas
+
+Las pruebas unitarias para este proyecto están en `test_module.py`. Importamos las pruebas de `test_module.py` a `main.py` para su comodidad. Las pruebas se ejecutarán automaticamente cada vez que presione el botón de "Ejecutar".
+
+## Envío
+
+Copia la URL de tu proyecto y envíalo a freeCodeCamp.
 
 # --hints--
 
-It should pass all Python tests.
+Debe pasar todas las pruebas de Python.
 
 ```js
 
diff --git a/curriculum/challenges/espanol/09-information-security/information-security-projects/sha-1-password-cracker.md b/curriculum/challenges/espanol/09-information-security/information-security-projects/sha-1-password-cracker.md
index 50bb715271a..1d0058de63f 100644
--- a/curriculum/challenges/espanol/09-information-security/information-security-projects/sha-1-password-cracker.md
+++ b/curriculum/challenges/espanol/09-information-security/information-security-projects/sha-1-password-cracker.md
@@ -1,6 +1,6 @@
 ---
 id: 5e46f983ac417301a38fb933
-title: SHA-1 Password Cracker
+title: Cracker de contraseñas SHA-1
 challengeType: 10
 forumTopicId: 462374
 helpCategory: Python
@@ -9,26 +9,57 @@ 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.
+Para este proyecto, trabajarás con nuestra <a href="https://replit.com/github/freeCodeCamp/boilerplate-SHA-1-password-cracker" target="_blank" rel="noopener noreferrer nofollow">plantilla en Replit</a>.
 
-You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-SHA-1-password-cracker).
+Estamos desarrollando las instrucciones interactivas del currículo de Python. Aunque puedes encontrar los siguientes videos en el canal de YouTube de freeCodeCamp.org que te enseñaran lo necesario para realizar este proyecto:
 
-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.
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a> (14 hours)
 
-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:
+- <a href="https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/" target="_blank" rel="noopener noreferrer nofollow">Learn Python Basics in Depth</a> (4 hours)
 
-<ul>
-  <li>
-    <a href='https://www.freecodecamp.org/news/python-for-everybody/'>Python for Everybody Video Course</a> (14 hours)
-  </li>
-  <li>
-    <a href='https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/'>Learn Python Video Course</a> (2 hours)
-  </li>
-</ul>
+- <a href="https://www.freecodecamp.org/news/intermediate-python-course/" target="_blank" rel="noopener noreferrer nofollow">Intermediate Python Course</a> (6 hours)
+
+# --instructions--
+
+Las contraseñas nunca deberían de guardarse en texto plano. Deberían de guardarse cifradas, por si alguien externo accede a la lista de contraseñas. Sin embargo no todos los cifrados son creados de la misma manera.
+
+En este proyecto aprenderemos la importancia de tener una buena contraseña. Creando un cracker de contraseñas, para conseguir las contraseñas que fueron cifradas usando el algoritmo SHA-1.
+
+Crea una función que toma como parametro una contraseña cifrada creada con el agoritmo SHA-1 y retornarla decifrada si es una de las 10,000 contraseñas más usadas. Si la contraseña cifrada no se encuentra en la base de datos, retorna "LA CONTRASEÑA NO SE ENCUENTRA EN LA BASE DE DATOS".
+
+Para decifrar la contraceña la función deberá cifrar cada una de las contraseñas del archivo `top-10000-passwords.txt` (las 10,000 contrasñas más usadas) y compararlas con la contraseña cifrada introducida.
+
+La función tomará un segundo argumento opcional llamado `use_salts`. Si su valor es verdadero, cada salt string del archivo `known-salts.txt` debera ser agregado al final de cada contrasña del archivo `top-10000-passwords.txt` antes de cifrarlas y comparlas con la contraseña cifrada pasada con la función.
+
+Estás son algunas contraseñas cifradas para probar la función:
+
+- `b305921a3723cd5d70a375cd21a61e60aabb84ec` debería devolver "sammy123"
+- `c7ab388a5ebefbf4d550652f1eb4d833e5316e3e` debería devolver "abacab"
+- `5baa61e4c9b93f3f0682250b6cf8331b7ee68fd8` debería devolver "password"
+
+Estás son algunas contraseñas cifradas para probar la función cuando el valor de `use_salts` es `True`:
+
+- `53d8b3dc9d39f0184144674e310185e41a87ffd5` debería devolver "superman"
+- `da5a4e8cf89539e66097acd2f8af128acae2f8ae` debería devolver "q1w2e3r4t5"
+- `ea3f62d498e3b98557f9f9cd0d905028b3b019e1` debería devolver "bubbles1"
+
+La librería `hashlib` ya viene importada. Deberías considerar usarla en tu código. <a href="https://docs.python.org/3/library/hashlib.html" target="_blank" rel="noopener noreferrer nofollow">Aprende más sobre "hashlib" aquí</a>.
+
+## Desarrollo
+
+Escribe tu código en `password_cracker.py`. Para el desarrollo, puedes usar `main.py` para probar tu código. Haz clic en el botón "ejecutar" para ejecutar tu código en `main.py`.
+
+## Pruebas
+
+Las pruebas unitarias para este proyecto están en `test_module.py`. Por defecto las pruebas del archivo `test_module.py` ya están importadas en el archivo `main.py` para su comodidad. Las pruebas se ejecutarán automaticamente cada vez que presione el botón de "Ejecutar".
+
+## Enviar
+
+Copia la URL de tu proyecto y envíalo a freeCodeCamp.
 
 # --hints--
 
-It should pass all Python tests.
+Debería pasar todas las pruebas de Python.
 
 ```js
 
diff --git a/curriculum/challenges/espanol/09-information-security/information-security-projects/stock-price-checker.md b/curriculum/challenges/espanol/09-information-security/information-security-projects/stock-price-checker.md
index 2a0a1ea2fd2..5194ccd5e69 100644
--- a/curriculum/challenges/espanol/09-information-security/information-security-projects/stock-price-checker.md
+++ b/curriculum/challenges/espanol/09-information-security/information-security-projects/stock-price-checker.md
@@ -1,6 +1,6 @@
 ---
 id: 587d824a367417b2b2512c44
-title: Stock Price Checker
+title: Comprobador de precios de acciones
 challengeType: 4
 forumTopicId: 301572
 dashedName: stock-price-checker
@@ -8,24 +8,26 @@ dashedName: stock-price-checker
 
 # --description--
 
-Build a full stack JavaScript app that is functionally similar to this: <https://stock-price-checker.freecodecamp.rocks/>.
+Construye una aplicacion Javascript full stack que funcione similarmente a esta: <a href="https://stock-price-checker.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://stock-price-checker.freecodecamp.rocks/</a>.
 
-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.
+Como todas las API de precios de acciones fiables requieren una clave de API, hemos creado una solución. Utilice <a href="https://stock-price-checker-proxy.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://stock-price-checker-proxy.freecodecamp.rocks/</a> para obtener información actualizada del precio de las acciones sin necesidad de registrarte para tu propia clave.
 
-Working on this project will involve you writing your code using one of the following methods:
+Trabajar en este proyecto implicará escribir tu código utilizando uno de los siguientes métodos:
 
--   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-stockchecker/) and complete your project locally.
--   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-stockchecker) to complete your project.
--   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+-   Clone este repositorio de <a href="https://github.com/freeCodeCamp/boilerplate-project-stockchecker/" target="_blank" rel="noopener noreferrer nofollow"> GitHub</a> y complete estos desafíos localmente.
+-   Usa este <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-stockchecker" target="_blank" rel="noopener noreferrer nofollow"> proyecto inicial de Replit</a> para completar tu proyecto.
+-   Utiliza un constructor de sitios de tu elección para completar el proyecto. Asegúrate de incorporar todos los archivos de nuestro repositorio 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.
+Cuando hayas terminado, asegúrate de que un demo funcional de tu proyecto esté alojado en algún lugar público. Luego, envía la URL en el campo `Solution Link`. Opcionalmente, envíe un enlace al código fuente de su proyecto en el campo `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`
+2.  Completa el proyecto en `routes/api.js` o creando un manejador/controlador
+3.  Añadirás cualquier característica de seguridad a `server.js`
+4.  Crearás todas las pruebas funcionales en `tests/2_functional-tests.js`
+
+**Note** Privacy Considerations: Due to the requirement that only 1 like per IP should be accepted, you will have to save IP addresses. Es importante seguir cumpliendo con leyes de privacidad como el Reglamento General de Protección de Datos. Una opción es obtener permiso para guardar los datos del usuario, pero es mucho más simple hacerlo anónimo. Para este desafío, recuerde anonimizar las direcciones IP antes de guardarlas en la base de datos. If you need ideas on how to do this, you may choose to hash the data, truncate it, or set part of the IP address to 0.
 
 Write the following tests in `tests/2_functional-tests.js`:
 
diff --git a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md
index 9d5cba3e752..baca88a2e0a 100644
--- a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md
+++ b/curriculum/challenges/espanol/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: Pide a los navegadores que accedan a tu sitio a través de HTTPS sólo con helmet.hsts()
 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 [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
-HTTP Strict Transport Security (HSTS) is a web security policy which helps to protect websites against protocol downgrade attacks and cookie hijacking. If your website can be accessed via HTTPS you can ask user’s browsers to avoid using insecure HTTP. By setting the header Strict-Transport-Security, you tell the browsers to use HTTPS for the future requests in a specified amount of time. This will work for the requests coming after the initial request.
+HTTP Strict Transport Security (HSTS) es una política de seguridad web que ayuda a proteger a los sitios web contra ataques de degradación de protocolo y secuestro de cookies. Si se puede acceder a tu sitio web a través de HTTPS, puedes pedirle a los navegadores de los usuarios que eviten el uso de HTTP inseguro. Al configurar el encabezado Strict-Transport-Security, le dices a los navegadores que usen HTTPS para las solicitudes futuras en un período de tiempo específico. Esto funcionará para las solicitudes que vengan después de la solicitud inicial.
 
 # --instructions--
 
-Configure `helmet.hsts()` to use HTTPS for the next 90 days. Pass the config object `{maxAge: timeInSeconds, force: true}`. You can create a variable `ninetyDaysInSeconds = 90*24*60*60;` to use for the `timeInSeconds`. Replit already has hsts enabled. To override its settings you need to set the field "force" to true in the config object. We will intercept and restore the Replit header, after inspecting it for testing.
+Configura `helmet.hsts()` para usar HTTPS durante los próximos 90 días. Pasa el objeto de configuración `{maxAge: timeInSeconds, force: true}`. Puedes crear una variable `ninetyDaysInSeconds = 90*24*60*60;` para usar con `timeInSeconds`. Replit ya tiene hsts habilitados. Para anular su configuración, debes establecer el campo "force" a true en el objeto config. Interceptaremos y restauraremos el encabezado Replit, después de inspeccionarlo para probarlo.
 
-Note: Configuring HTTPS on a custom website requires the acquisition of a domain, and a SSL/TLS Certificate.
+Nota: La configuración de HTTPS en un sitio web personalizado requiere la adquisición de un dominio, y un certificado SSL/TLS.
 
 # --hints--
 
-helmet.hsts() middleware should be mounted correctly
+el middleware helmet.hsts() debe ser montado correctamente
 
 ```js
 (getUserInput) =>
@@ -35,7 +35,7 @@ helmet.hsts() middleware should be mounted correctly
   );
 ```
 
-maxAge should be equal to 7776000 s (90 days)
+maxAge debe ser igual a 7776000 s (90 días)
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md
index 1ea172a9366..bdfe0a5f4e0 100644
--- a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md
+++ b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md
@@ -8,7 +8,7 @@ dashedName: avoid-inferring-the-response-mime-type-with-helmet-nosniff
 
 # --description--
 
-As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/). Browsers can use content or MIME sniffing to override response `Content-Type` headers to guess and process the data using an implicit content type. While this can be convenient in some scenarios, it can also lead to some dangerous attacks. This middleware sets the X-Content-Type-Options header to `nosniff`, instructing the browser to not bypass the provided `Content-Type`.
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>. Browsers can use content or MIME sniffing to override response `Content-Type` headers to guess and process the data using an implicit content type. While this can be convenient in some scenarios, it can also lead to some dangerous attacks. This middleware sets the X-Content-Type-Options header to `nosniff`, instructing the browser to not bypass the provided `Content-Type`.
 
 # --instructions--
 
diff --git a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md
index 8f96da298a0..f295006c265 100644
--- a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md
+++ b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md
@@ -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 [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+Como recordatorio, este proyecto se basa en el siguiente proyecto inicial en <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, o clonado de <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `app.use(helmet())` will automatically include all the middleware introduced above, except `noCache()`, and `contentSecurityPolicy()`, but these can be enabled if necessary. You can also disable or configure any other middleware individually, using a configuration object.
 
-**Example:**
+**Ejemplo:**
 
 ```js
 app.use(helmet({
diff --git a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md
index b12dedf8de8..e41d8a3d310 100644
--- a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md
+++ b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md
@@ -8,7 +8,7 @@ dashedName: disable-client-side-caching-with-helmet-nocache
 
 # --description--
 
-As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 If you are releasing an update for your website, and you want the users to always download the newer version, you can (try to) disable caching on client’s browser. It can be useful in development too. Caching has performance benefits, which you will lose, so only use this option when there is a real need.
 
diff --git a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md
index 3a855aebb73..9b715020cf4 100644
--- a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md
+++ b/curriculum/challenges/espanol/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: Desactivar Prefetching DNS con helmet.dnsPrefetchControl()
 challengeType: 2
 forumTopicId: 301577
 dashedName: disable-dns-prefetching-with-helmet-dnsprefetchcontrol
@@ -8,7 +8,7 @@ dashedName: disable-dns-prefetching-with-helmet-dnsprefetchcontrol
 
 # --description--
 
-As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 To improve performance, most browsers prefetch DNS records for the links in a page. In that way the destination ip is already known when the user clicks on a link. This may lead to over-use of the DNS service (if you own a big website, visited by millions people…), privacy issues (one eavesdropper could infer that you are on a certain page), or page statistics alteration (some links may appear visited even if they are not). If you have high security needs you can disable DNS prefetching, at the cost of a performance penalty.
 
diff --git a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md
index 0165afc950d..95ee77e4d28 100644
--- a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md
+++ b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md
@@ -8,7 +8,7 @@ dashedName: hash-and-compare-passwords-asynchronously
 
 # --description--
 
-As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-bcrypt), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-bcrypt/).
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-bcrypt" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-bcrypt/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 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
 
@@ -20,7 +20,7 @@ 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.
+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.
 
@@ -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.
+Add this into your existing hash function (since you need to wait for the hash to complete before calling the compare function) after you log the completed hash and log 'res' to the console within the compare. You should see in the console a hash then 'true' is printed! If you change 'myPlaintextPassword' in the compare function to 'someOtherPlaintextPassword' then it should say false.
 
 ```js
 bcrypt.hash('passw0rd!', 13, (err, hash) => {
@@ -43,7 +43,7 @@ bcrypt.hash('passw0rd!', 13, (err, hash) => {
 
 ```
 
-Submit your page when you think you've got it right.
+Envía tu página cuando creas que está correcto.
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md
index fbf4faceb1e..c1cd789591e 100644
--- a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md
+++ b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md
@@ -8,7 +8,7 @@ dashedName: hide-potentially-dangerous-information-using-helmet-hidepoweredby
 
 # --description--
 
-As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 Hackers can exploit known vulnerabilities in Express/Node if they see that your site is powered by Express. `X-Powered-By: Express` is sent in every request coming from Express by default. Use the `helmet.hidePoweredBy()` middleware to remove the X-Powered-By header.
 
diff --git a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md
index 33b43cd3be8..6b032da9b70 100644
--- a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md
+++ b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md
@@ -8,7 +8,7 @@ dashedName: mitigate-the-risk-of-clickjacking-with-helmet-frameguard
 
 # --description--
 
-As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 Your page could be put in a `<frame>` or `<iframe>` without your consent. This can result in clickjacking attacks, among other things. Clickjacking is a technique of tricking a user into interacting with a page different from what the user thinks it is. This can be obtained executing your page in a malicious context, by mean of iframing. In that context a hacker can put a hidden layer over your page. Hidden buttons can be used to run bad scripts. This middleware sets the X-Frame-Options header. It restricts who can put your site in a frame. It has three modes: DENY, SAMEORIGIN, and ALLOW-FROM.
 
diff --git a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md
index 701f65a0cd0..2ec2f36fb95 100644
--- a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md
+++ b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md
@@ -9,7 +9,7 @@ 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 [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 Cross-site scripting (XSS) is a frequent type of attack where malicious scripts are injected into vulnerable pages, with the purpose of stealing sensitive data like session cookies, or passwords.
 
diff --git a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md
index 995e6f8fc5a..aaf3167793c 100644
--- a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md
+++ b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md
@@ -8,7 +8,7 @@ dashedName: prevent-ie-from-opening-untrusted-html-with-helmet-ienoopen
 
 # --description--
 
-As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 Some web applications will serve untrusted HTML for download. Some versions of Internet Explorer by default open those HTML files in the context of your site. This means that an untrusted HTML page could start doing bad things in the context of your pages. This middleware sets the X-Download-Options header to noopen. This will prevent IE users from executing downloads in the trusted site’s context.
 
diff --git a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md
index 8c75941837a..bdb2cb50d10 100644
--- a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md
+++ b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md
@@ -8,7 +8,7 @@ dashedName: set-a-content-security-policy-with-helmet-contentsecuritypolicy
 
 # --description--
 
-As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 This challenge highlights one promising new defense that can significantly reduce the risk and impact of many type of attacks in modern browsers. By setting and configuring a Content Security Policy you can prevent the injection of anything unintended into your page. This will protect your app from XSS vulnerabilities, undesired tracking, malicious frames, and much more. CSP works by defining 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.
 
diff --git a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md
index 673ecb35c8a..d4b8934a069 100644
--- a/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md
+++ b/curriculum/challenges/espanol/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md
@@ -8,19 +8,19 @@ dashedName: understand-bcrypt-hashes
 
 # --description--
 
-For the following challenges, you will be working with a new starter project that is different from the previous one. You can find the new starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-bcrypt), or clone it from [GitHub](https://github.com/freeCodeCamp/boilerplate-bcrypt/).
+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 <a href="https://replit.com/github/freeCodeCamp/boilerplate-bcrypt" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or clone it from <a href="https://github.com/freeCodeCamp/boilerplate-bcrypt/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 BCrypt hashes are very secure. A hash is basically a fingerprint of the original data- always unique. This is accomplished by feeding the original data into an algorithm and returning a fixed length result. To further complicate this process and make it more secure, you can also *salt* your hash. Salting your hash involves adding random data to the original data before the hashing process which makes it even harder to crack the hash.
 
-BCrypt hashes will always looks like `$2a$13$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm` which does have a structure. The first small bit of data `$2a` is defining what kind of hash algorithm was used. The next portion `$13` defines the *cost*. Cost is about how much power it takes to compute the hash. It is on a logarithmic scale of 2^cost and determines how many times the data is put through the hashing algorithm. For example, at a cost of 10 you are able to hash 10 passwords a second on an average computer, however at a cost of 15 it takes 3 seconds per hash... and to take it further, at a cost of 31 it would takes multiple days to complete a hash. A cost of 12 is considered very secure at this time. The last portion of your hash `$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm`, looks like one large string of numbers, periods, and letters but it is actually two separate pieces of information. The first 22 characters is the salt in plain text, and the rest is the hashed password!
+BCrypt hashes will always look 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 take multiple days to complete a hash. A cost of 12 is considered very secure at this time. The last portion of your hash `$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm`, looks like one large string of numbers, periods, and letters but it is actually two separate pieces of information. The first 22 characters is the salt in plain text, and the rest is the hashed password!
 
 # --instructions--
 
-To begin using BCrypt, add it as a dependency in your project and require it as 'bcrypt' in your server.
-
 Add all your code for these lessons in the `server.js` file between the code we have started you off with. Do not change or delete the code we have added for you.
 
-Submit your page when you think you've got it right.
+BCrypt has already been added as a dependency, so require it as `bcrypt` in your server.
+
+Envía tu página cuando creas que está correcto.
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md b/curriculum/challenges/espanol/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
index 858073f2112..443bbd9c395 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
@@ -8,11 +8,11 @@ dashedName: remove-an-element-from-a-max-heap
 
 # --description--
 
-Now that we can add elements to our heap let's see how we can remove elements. Removing and inserting elements both require similar logic. In a max heap you will usually want to remove the greatest value, so this involves simply extracting it from the root of our tree. This will break the heap property of our tree, so we must reestablish it in some way. Typically, for a max heap this is done in the following way:
+Ahora que podemos añadir elementos a nuestra pila veamos cómo podemos eliminar los elementos. Quitar e insertar elementos requieren una lógica similar. En un montón máximo normalmente querrá eliminar el mayor valor, por lo que esto implica simplemente extraerlo de la raíz de nuestro árbol. This will break the heap property of our tree, so we must reestablish it in some way. Typically, for a max heap this is done in the following way:
 
 <ol>
   <li>Move the last element in the heap into the root position.</li>
-  <li>If either child of the root is greater than it, swap the root with the child of greater value.</li>
+  <li>Si cualquiera de los dos hijos de la raíz es mayor que ella, intercambia la raíz con el hijo de mayor valor.</li>
   <li>Continue swapping until the parent is greater than both children or you reach the last level in the tree.</li>
 </ol>
 
@@ -22,7 +22,7 @@ Instructions: Add a method to our max heap called `remove`. This method should r
 
 # --hints--
 
-The MaxHeap data structure should exist.
+The `MaxHeap` data structure should exist.
 
 ```js
 assert(
@@ -36,7 +36,7 @@ assert(
 );
 ```
 
-MaxHeap should have a method called print.
+`MaxHeap` should have a method called `print`.
 
 ```js
 assert(
@@ -52,7 +52,7 @@ assert(
 );
 ```
 
-MaxHeap should have a method called insert.
+`MaxHeap` should have a method called `insert`.
 
 ```js
 assert(
@@ -68,7 +68,7 @@ assert(
 );
 ```
 
-MaxHeap should have a method called remove.
+`MaxHeap` should have a method called `remove`.
 
 ```js
 assert(
@@ -84,7 +84,7 @@ assert(
 );
 ```
 
-The remove method should remove the greatest element from the max heap while maintaining the max heap property.
+The `remove` method should remove the greatest element from the max heap while maintaining the max heap property.
 
 ```js
 assert(
@@ -114,21 +114,29 @@ assert(
 ## --seed-contents--
 
 ```js
-var MaxHeap = function() {
-  this.heap = [null];
-  this.insert = (ele) => {
-    var index = this.heap.length;
-    var arr = [...this.heap];
-    arr.push(ele);
-    while (ele > arr[Math.floor(index / 2)] && index > 1) {
-      arr[index] = arr[Math.floor(index / 2)];
-      arr[Math.floor(index / 2)] = ele;
-      index = arr[Math.floor(index / 2)];
+var MaxHeap = function () {
+  this.heap = [];
+  this.parent = index => {
+    return Math.floor((index - 1) / 2);
+  }
+  this.insert = element => {
+    this.heap.push(element);
+    this.heapifyUp(this.heap.length - 1);
+  }
+  this.heapifyUp = index => {
+    let currentIndex = index,
+    parentIndex = this.parent(currentIndex);
+    while (currentIndex > 0 && this.heap[currentIndex] > this.heap[parentIndex]) {
+      this.swap(currentIndex, parentIndex);
+      currentIndex = parentIndex;
+      parentIndex = this.parent(parentIndex);
     }
-    this.heap = arr;
+  }
+  this.swap = (index1, index2) => {
+    [this.heap[index1], this.heap[index2]] = [this.heap[index2], this.heap[index1]];
   }
   this.print = () => {
-    return this.heap.slice(1);
+    return this.heap;
   }
   // Only change code below this line
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md b/curriculum/challenges/espanol/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md
index b02f10043d3..73c51e7b939 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md
@@ -1,6 +1,6 @@
 ---
 id: 587d8258367417b2b2512c7f
-title: Use Breadth First Search in a Binary Search Tree
+title: Usa la busqueda Breadth First en una busqueda de arbol binario
 challengeType: 1
 forumTopicId: 301718
 dashedName: use-breadth-first-search-in-a-binary-search-tree
@@ -8,9 +8,9 @@ dashedName: use-breadth-first-search-in-a-binary-search-tree
 
 # --description--
 
-Here we will introduce another tree traversal method: breadth-first search. In contrast to the depth-first search methods from the last challenge, breadth-first search explores all the nodes in a given level within a tree before continuing on to the next level. Typically, queues are utilized as helper data structures in the design of breadth-first search algorithms.
+Aquí introduciremos otro método de arbol transversal: la busqueda breadth-first. En contraste al método de busqueda depth-first del último reto, la busqueda breadth-first explora todos los nodos en un nivel dado dentro del arbol antes de continuar con el siguiente nivel. Normalmente, las colas son utilizadas como estructuras de datos de apoyo en el diseño de los algoritmos de busqueda breadth-first.
 
-In this method, we start by adding the root node to a queue. Then we begin a loop where we dequeue the first item in the queue, add it to a new array, and then inspect both its child subtrees. If its children are not null, they are each enqueued. This process continues until the queue is empty.
+En este método, empezamos agregando el nodo raíz a la cola. Luego empezamos un ciclo donde obtenemos el primer elemento de la cola, lo agregamos a un nuevo array, y luego inspeccionamos ambos sub-arboles hijos. Si sus hijos no son nulos, entonces ambos serán encolados. Este proceso continua hasta que la cola está vacía.
 
 # --instructions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
index e5059816bf1..f1b3a5ea5e3 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
@@ -60,32 +60,46 @@ primeSummation(2000000);
 # --solutions--
 
 ```js
-const NUM_PRIMES = 2000000;
-const PRIME_SEIVE = Array(Math.floor((NUM_PRIMES-1)/2)).fill(true);
-(function initPrimes(num) {
-  const upper = Math.floor((num - 1) / 2);
-  const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
-  for (let i = 0; i <= sqrtUpper; i++) {
-    if (PRIME_SEIVE[i]) {
-      // Mark value in PRIMES array
-      const prime = 2 * i + 3;
-      // Mark all multiples of this number as false (not prime)
-      const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
-      for (let j = primeSqaredIndex; j < upper; j += prime) {
-        PRIME_SEIVE[j] = false;
+class PrimeSeive {
+  constructor(num) {
+    const seive = Array(Math.floor((num - 1) / 2)).fill(true);
+    const upper = Math.floor((num - 1) / 2);
+    const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+
+    for (let i = 0; i <= sqrtUpper; i++) {
+      if (seive[i]) {
+        // Mark value in seive array
+        const prime = 2 * i + 3;
+        // Mark all multiples of this number as false (not prime)
+        const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+        for (let j = primeSqaredIndex; j < upper; j += prime) {
+          seive[j] = false;
+        }
       }
     }
+
+    this._seive = seive;
   }
-})(NUM_PRIMES);
 
-function isOddNumberPrime(num) {
-  return PRIME_SEIVE[(num - 3) / 2];
-}
+  isPrime(num) {
+    return num === 2
+      ? true
+      : num % 2 === 0
+        ? false
+        : this.isOddPrime(num);
+  }
+
+  isOddPrime(num) {
+    return this._seive[(num - 3) / 2];
+  }
+};
+
+function primeSummation(num) {
+  const primeSeive = new PrimeSeive(num);
 
-function primeSummation(n) {
   let sum = 2;
-  for (let i = 3; i < n; i += 2) {
-    if (isOddNumberPrime(i)) sum += i;
+  for (let i = 3; i < num; i += 2) {
+    if (primeSeive.isOddPrime(i)) sum += i;
   }
   return sum;
 }
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-100-arranged-probability.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-100-arranged-probability.md
index 1d44675e282..4507fa49c56 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-100-arranged-probability.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-100-arranged-probability.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d01000cf542c50fee3
 title: 'Problem 100: Arranged probability'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301724
 dashedName: problem-100-arranged-probability
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md
index cd51f0f2ecc..803f95dc33e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d21000cf542c50fee4
 title: 'Problem 101: Optimum polynomial'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301725
 dashedName: problem-101-optimum-polynomial
 ---
@@ -20,7 +20,9 @@ As a basis, if we were only given the first term of sequence, it would be most s
 
 Hence we obtain the following OPs for the cubic sequence:
 
-$$\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}$$
+$$\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 $\color{red}{red}$ above), we obtain 1 + 15 + 58 = 74. Consider the following tenth degree polynomial generating function:
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-102-triangle-containment.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-102-triangle-containment.md
index 9705afbc6f3..c90a827dda3 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-102-triangle-containment.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-102-triangle-containment.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d21000cf542c50fee5
 title: 'Problem 102: Triangle containment'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301726
 dashedName: problem-102-triangle-containment
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md
index 677153bd674..bf85eef1f76 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d61000cf542c50fee7
 title: 'Problem 103: Special subset sums: optimum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301727
 dashedName: problem-103-special-subset-sums-optimum
 ---
@@ -15,7 +15,10 @@ Let $S(A)$ represent the sum of elements in set A of size n. We shall call it a
 
 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}$$
+$$\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}$$
 
 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.
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.md
index 1c61ea7c2ed..baa7dcbfdbd 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d51000cf542c50fee6
 title: 'Problem 104: Pandigital Fibonacci ends'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301728
 dashedName: problem-104-pandigital-fibonacci-ends
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.md
index 0a5d611f908..1636463728d 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d61000cf542c50fee8
 title: 'Problem 105: Special subset sums: testing'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301729
 dashedName: problem-105-special-subset-sums-testing
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.md
index e771a72835d..da97f85ee7e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d71000cf542c50fee9
 title: 'Problem 106: Special subset sums: meta-testing'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301730
 dashedName: problem-106-special-subset-sums-meta-testing
 ---
@@ -19,7 +19,7 @@ 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.
+**Nota:** Este problema está relacionado con el problema 103 y el problema 105.
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-107-minimal-network.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
index 312e9f33122..3b69363096d 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d91000cf542c50feea
 title: 'Problem 107: Minimal network'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301731
 dashedName: problem-107-minimal-network
 ---
@@ -27,7 +27,7 @@ The same network can be represented by the matrix below.
 
 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;" />
+<img class="img-responsive center-block" alt="Network with 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`.
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md
index 3b8d6f014f3..56fbe532238 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d91000cf542c50feeb
 title: 'Problem 108: Diophantine Reciprocals I'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301732
 dashedName: problem-108-diophantine-reciprocals-i
 ---
@@ -14,7 +14,9 @@ $$\frac{1}{x} + \frac{1}{y} = \frac{1}{n}$$
 
 For `n` = 4 there are exactly three distinct solutions:
 
-$$\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}$$
+$$\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?
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-109-darts.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-109-darts.md
index 3b16fe7ac69..5064f7e146c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-109-darts.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-109-darts.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3db1000cf542c50feec
 title: 'Problem 109: Darts'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301733
 dashedName: problem-109-darts
 ---
@@ -20,7 +20,12 @@ There are many variations of rules but in the most popular game the players will
 
 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:
 
-$$\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}$$
+$$\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}$$
 
 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?
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.md
index 79070c6654d..9bbeb3dd075 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3db1000cf542c50feed
 title: 'Problem 110: Diophantine Reciprocals II'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301735
 dashedName: problem-110-diophantine-reciprocals-ii
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md
index a6a9958de73..7f22fbffb6c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3db1000cf542c50feee
 title: 'Problem 111: Primes with runs'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301736
 dashedName: problem-111-primes-with-runs
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-112-bouncy-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-112-bouncy-numbers.md
index d2b8f071980..7599de29978 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-112-bouncy-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-112-bouncy-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3dd1000cf542c50feef
 title: 'Problem 112: Bouncy numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301738
 dashedName: problem-112-bouncy-numbers
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.md
index a06f41a9a5e..868909ef6b2 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3dd1000cf542c50fef0
 title: 'Problem 113: Non-bouncy numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301739
 dashedName: problem-113-non-bouncy-numbers
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md
index c6690bddf5b..3e1b2f85927 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3e01000cf542c50fef2
 title: 'Problem 114: Counting block combinations I'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301740
 dashedName: problem-114-counting-block-combinations-i
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.md
index 1e65da56105..a659ea34ad1 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3df1000cf542c50fef1
 title: 'Problem 115: Counting block combinations II'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301741
 dashedName: problem-115-counting-block-combinations-ii
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md
index a88bc07a34a..b0b1969a3df 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3e01000cf542c50fef3
 title: 'Problem 116: Red, green or blue tiles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301742
 dashedName: problem-116-red-green-or-blue-tiles
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md
index ed6d0355598..4a4873aac95 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3e21000cf542c50fef4
 title: 'Problem 117: Red, green, and blue tiles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301743
 dashedName: problem-117-red-green-and-blue-tiles
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.md
index 00a0605319f..d98541e4bfa 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3e21000cf542c50fef5
 title: 'Problem 118: Pandigital prime sets'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301744
 dashedName: problem-118-pandigital-prime-sets
 ---
@@ -14,7 +14,7 @@ How many distinct sets containing each of the digits one through nine exactly on
 
 # --hints--
 
-`pandigitalPrimeSets()` should return `44680`.
+`pandigitalPrimeSets()` debería devolver `44680`.
 
 ```js
 assert.strictEqual(pandigitalPrimeSets(), 44680);
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md
index 72ed8397d7b..87bf836b33a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3e41000cf542c50fef6
 title: 'Problem 119: Digit power sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301745
 dashedName: problem-119-digit-power-sum
 ---
@@ -10,7 +10,7 @@ dashedName: problem-119-digit-power-sum
 
 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 $n-th$ term of this sequence and insist that a number must contain at least two digits to have a sum.
+We shall define $a_n$ 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 $a_2 = 512$ and $a_{10} = 614656$.
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-120-square-remainders.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-120-square-remainders.md
index 828f12b9066..d42c224e3db 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-120-square-remainders.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-120-square-remainders.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3e41000cf542c50fef7
 title: 'Problem 120: Square remainders'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301747
 dashedName: problem-120-square-remainders
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.md
index 1cc716c41ca..0f23b7fdd50 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3e51000cf542c50fef8
 title: 'Problem 121: Disc game prize fund'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301748
 dashedName: problem-121-disc-game-prize-fund
 ---
@@ -18,10 +18,10 @@ Find the maximum prize fund that should be allocated to a single game in which f
 
 # --hints--
 
-`euler121()` should return 2269.
+`discGamePrize()` should return `2269`.
 
 ```js
-assert.strictEqual(euler121(), 2269);
+assert.strictEqual(discGamePrize(), 2269);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler121(), 2269);
 ## --seed-contents--
 
 ```js
-function euler121() {
+function discGamePrize() {
 
   return true;
 }
 
-euler121();
+discGamePrize();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md
index 7da1b4274e3..78c29aa7952 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md
@@ -1,35 +1,40 @@
 ---
 id: 5900f3e61000cf542c50fef9
 title: 'Problem 122: Efficient exponentiation'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301749
 dashedName: problem-122-efficient-exponentiation
 ---
 
 # --description--
 
-The most naive way of computing n15 requires fourteen multiplications:
+The most naive way of computing $n^{15}$ requires fourteen multiplications:
 
-n × n × ... × n = n15
+$$n × n × \ldots × n = n^{15}$$
 
 But using a "binary" method you can compute it in six multiplications:
 
-n × n = n2n2 × n2 = n4n4 × n4 = n8n8 × n4 = n12n12 × n2 = n14n14 × n = n15
+$$\begin{align}   & n × n = n^2\\\\
+  & n^2 × n^2 = n^4\\\\   & n^4 × n^4 = n^8\\\\
+  & n^8 × n^4 = n^{12}\\\\   & n^{12} × n^2 = n^{14}\\\\
+  & n^{14} × n = n^{15} \end{align}$$
 
 However it is yet possible to compute it in only five multiplications:
 
-n × n = n2n2 × n = n3n3 × n3 = n6n6 × n6 = n12n12 × n3 = n15
+$$\begin{align}   & n × n = n^2\\\\
+  & n^2 × n = n^3\\\\   & n^3 × n^3 = n^6\\\\
+  & n^6 × n^6 = n^{12}\\\\ & n^{12} × n^3 = n^{15} \end{align}$$
 
-We shall define m(k) to be the minimum number of multiplications to compute nk; for example m(15) = 5.
+We shall define $m(k)$ to be the minimum number of multiplications to compute $n^k$; for example $m(15) = 5$.
 
-For 1 ≤ k ≤ 200, find ∑ m(k).
+For $1 ≤ k ≤ 200$, find $\sum{m(k)}$.
 
 # --hints--
 
-`euler122()` should return 1582.
+`efficientExponentation()` should return `1582`.
 
 ```js
-assert.strictEqual(euler122(), 1582);
+assert.strictEqual(efficientExponentation(), 1582);
 ```
 
 # --seed--
@@ -37,12 +42,12 @@ assert.strictEqual(euler122(), 1582);
 ## --seed-contents--
 
 ```js
-function euler122() {
+function efficientExponentation() {
 
   return true;
 }
 
-euler122();
+efficientExponentation();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-123-prime-square-remainders.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-123-prime-square-remainders.md
index cb7b7afda10..743089b64e3 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-123-prime-square-remainders.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-123-prime-square-remainders.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f3e71000cf542c50fefa
 title: 'Problem 123: Prime square remainders'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301750
 dashedName: problem-123-prime-square-remainders
 ---
 
 # --description--
 
-Let pn be the nth prime: 2, 3, 5, 7, 11, ..., and let r be the remainder when (pn−1)n + (pn+1)n is divided by pn2.
+Let $p_n$ be the $n$th prime: 2, 3, 5, 7, 11, ..., and let $r$ be the remainder when ${(p_n−1)}^n + {(p_n+1)}^n$ is divided by ${p_n}^2$.
 
-For example, when n = 3, p3 = 5, and 43 + 63 = 280 ≡ 5 mod 25.
+For example, when $n = 3, p_3 = 5$, and $4^3 + 6^3 = 280 ≡ 5\\ mod\\ 25$.
 
-The least value of n for which the remainder first exceeds 109 is 7037.
+The least value of $n$ for which the remainder first exceeds $10^9$ is 7037.
 
-Find the least value of n for which the remainder first exceeds 1010.
+Find the least value of $n$ for which the remainder first exceeds $10^{10}$.
 
 # --hints--
 
-`euler123()` should return 21035.
+`primeSquareRemainders()` should return `21035`.
 
 ```js
-assert.strictEqual(euler123(), 21035);
+assert.strictEqual(primeSquareRemainders(), 21035);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler123(), 21035);
 ## --seed-contents--
 
 ```js
-function euler123() {
+function primeSquareRemainders() {
 
   return true;
 }
 
-euler123();
+primeSquareRemainders();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
index 1dfc34dc9b3..899171a9731 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
@@ -1,49 +1,125 @@
 ---
 id: 5900f3e81000cf542c50fefb
 title: 'Problem 124: Ordered radicals'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301751
 dashedName: problem-124-ordered-radicals
 ---
 
 # --description--
 
-The radical of n, rad(n), is the product of the distinct prime factors of n. For example, 504 = 23 × 32 × 7, so rad(504) = 2 × 3 × 7 = 42.
+The radical of $n$, $rad(n)$, is the product of the distinct prime factors of $n$. For example, $504 = 2^3 × 3^2 × 7$, so $rad(504) = 2 × 3 × 7 = 42$.
 
-If we calculate rad(n) for 1 ≤ n ≤ 10, then sort them on rad(n), and sorting on n if the radical values are equal, we get:
+If we calculate $rad(n)$ for $1 ≤ n ≤ 10$, then sort them on $rad(n)$, and sorting on $n$ if the radical values are equal, we get:
 
-Unsorted
+<div style="text-align: center;">
+  <table cellpadding="2" cellspacing="0" border="0" align="center">
+    <tbody>
+      <tr>
+        <td colspan="2">$Unsorted$</td>
+        <td></td>
+        <td colspan="3">$Sorted$</td>
+      </tr>
+      <tr>
+        <td>$n$</td>
+        <td>$rad(n)$</td>
+        <td></td>
+        <td>$n$</td>
+        <td>$rad(n)$</td>
+        <td>$k$</td>
+      </tr>
+      <tr>
+        <td>1</td>
+        <td>1</td>
+        <td></td>
+        <td>1</td>
+        <td>1</td>
+        <td>1</td>
+      </tr>
+      <tr>
+        <td>2</td>
+        <td>2</td>
+        <td></td>
+        <td>2</td>
+        <td>2</td>
+        <td>2</td>
+      </tr>
+      <tr>
+        <td>3</td>
+        <td>3</td>
+        <td></td>
+        <td>4</td>
+        <td>2</td>
+        <td>3</td>
+      </tr>
+      <tr>
+        <td>4</td>
+        <td>2</td>
+        <td></td>
+        <td>8</td>
+        <td>2</td>
+        <td>4</td>
+      </tr>
+      <tr>
+        <td>5</td>
+        <td>5</td>
+        <td></td>
+        <td>3</td>
+        <td>3</td>
+        <td>5</td>
+      </tr>
+      <tr>
+        <td>6</td>
+        <td>6</td>
+        <td></td>
+        <td>9</td>
+        <td>3</td>
+        <td>6</td>
+      </tr>
+      <tr>
+        <td>7</td>
+        <td>7</td>
+        <td></td>
+        <td>5</td>
+        <td>5</td>
+        <td>7</td>
+      </tr>
+      <tr>
+        <td>8</td>
+        <td>2</td>
+        <td></td>
+        <td>6</td>
+        <td>6</td>
+        <td>8</td>
+      </tr>
+      <tr>
+        <td>9</td>
+        <td>3</td>
+        <td></td>
+        <td>7</td>
+        <td>7</td>
+        <td>9</td>
+      </tr>
+      <tr>
+        <td>10</td>
+        <td>10</td>
+        <td></td>
+        <td>10</td>
+        <td>10</td>
+        <td>10</td>
+      </tr>
+    </tbody>
+  </table>
+</div><br>
 
-Sorted n rad(n)
-
-n rad(n) k 11
-
-111 22
-
-222 33
-
-423 42
-
-824 55
-
-335 66
-
-936 77
-
-557 82
-
-668 93
-
-779 1010
-
-101010 Let E(k) be the kth element in the sorted n column; for example, E(4) = 8 and E(6) = 9. If rad(n) is sorted for 1 ≤ n ≤ 100000, find E(10000).
+Let $E(k)$ be the $k$th element in the sorted $n$ column; for example, $E(4) = 8$ and $E(6) = 9$. If $rad(n)$ is sorted for $1 ≤ n ≤ 100000$, find $E(10000)$.
 
 # --hints--
 
-`euler124()` should return 21417.
+`orderedRadicals()` should return `21417`.
 
 ```js
-assert.strictEqual(euler124(), 21417);
+assert.strictEqual(orderedRadicals(), 21417);
 ```
 
 # --seed--
@@ -51,12 +127,12 @@ assert.strictEqual(euler124(), 21417);
 ## --seed-contents--
 
 ```js
-function euler124() {
+function orderedRadicals() {
 
   return true;
 }
 
-euler124();
+orderedRadicals();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md
index fe9b4a6aa80..d089c18aff0 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ea1000cf542c50fefd
 title: 'Problem 126: Cuboid layers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301753
 dashedName: problem-126-cuboid-layers
 ---
@@ -10,14 +10,24 @@ dashedName: problem-126-cuboid-layers
 
 The minimum number of cubes to cover every visible face on a cuboid measuring 3 x 2 x 1 is twenty-two.
 
-If we then add a second layer to this solid it would require forty-six cubes to cover every visible face, the third layer would require seventy-eight cubes, and the fourth layer would require one-hundred and eighteen cubes to cover every visible face. However, the first layer on a cuboid measuring 5 x 1 x 1 also requires twenty-two cubes; similarly the first layer on cuboids measuring 5 x 3 x 1, 7 x 2 x 1, and 11 x 1 x 1 all contain forty-six cubes. We shall define C(n) to represent the number of cuboids that contain n cubes in one of its layers. So C(22) = 2, C(46) = 4, C(78) = 5, and C(118) = 8. It turns out that 154 is the least value of n for which C(n) = 10. Find the least value of n for which C(n) = 1000.
+<img class="img-responsive center-block" alt="3x2x1 cuboid covered by twenty-two 1x1x1 cubes" src="https://cdn.freecodecamp.org/curriculum/project-euler/cuboid-layers.png" style="background-color: white; padding: 10px;" />
+
+If we add a second layer to this solid it would require forty-six cubes to cover every visible face, the third layer would require seventy-eight cubes, and the fourth layer would require one-hundred and eighteen cubes to cover every visible face.
+
+However, the first layer on a cuboid measuring 5 x 1 x 1 also requires twenty-two cubes; similarly, the first layer on cuboids measuring 5 x 3 x 1, 7 x 2 x 1, and 11 x 1 x 1 all contain forty-six cubes.
+
+We shall define $C(n)$ to represent the number of cuboids that contain $n$ cubes in one of its layers. So $C(22) = 2$, $C(46) = 4$, $C(78) = 5$, and $C(118) = 8$.
+
+It turns out that 154 is the least value of $n$ for which $C(n) = 10$.
+
+Find the least value of $n$ for which $C(n) = 1000$.
 
 # --hints--
 
-`euler126()` should return 18522.
+`cuboidLayers()` should return `18522`.
 
 ```js
-assert.strictEqual(euler126(), 18522);
+assert.strictEqual(cuboidLayers(), 18522);
 ```
 
 # --seed--
@@ -25,12 +35,12 @@ assert.strictEqual(euler126(), 18522);
 ## --seed-contents--
 
 ```js
-function euler126() {
+function cuboidLayers() {
 
   return true;
 }
 
-euler126();
+cuboidLayers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-127-abc-hits.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-127-abc-hits.md
index 665e17c0a74..2f7f927858e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-127-abc-hits.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-127-abc-hits.md
@@ -1,45 +1,39 @@
 ---
 id: 5900f3ec1000cf542c50fefe
 title: 'Problem 127: abc-hits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301754
 dashedName: problem-127-abc-hits
 ---
 
 # --description--
 
-The radical of n, rad(n), is the product of distinct prime factors of n. For example, 504 = 23 × 32 × 7, so rad(504) = 2 × 3 × 7 = 42.
+The radical of $n$, $rad(n)$, is the product of distinct prime factors of $n$. For example, $504 = 2^3 × 3^2 × 7$, so $rad(504) = 2 × 3 × 7 = 42$.
 
 We shall define the triplet of positive integers (a, b, c) to be an abc-hit if:
 
-GCD(a, b) = GCD(a, c) = GCD(b, c) = 1
-
-a &lt; b
-
-a + b = c
-
-rad(abc) &lt; c
+1. $GCD(a, b) = GCD(a, c) = GCD(b, c) = 1$
+2. $a &lt; b$
+3. $a + b = c$
+4. $rad(abc) &lt; c$
 
 For example, (5, 27, 32) is an abc-hit, because:
 
-GCD(5, 27) = GCD(5, 32) = GCD(27, 32) = 1
+1. $GCD(5, 27) = GCD(5, 32) = GCD(27, 32) = 1$
+2. $5 &lt; 27$
+3. $5 + 27 = 32$
+4. $rad(4320) = 30 &lt; 32$
 
-5 &lt; 27
+It turns out that abc-hits are quite rare and there are only thirty-one abc-hits for $c &lt; 1000$, with $\sum{c} = 12523$.
 
-5 + 27 = 32
-
-rad(4320) = 30 &lt; 32
-
-It turns out that abc-hits are quite rare and there are only thirty-one abc-hits for c &lt; 1000, with ∑c = 12523.
-
-Find ∑c for c &lt; 120000.
+Find $\sum{c}$ for $c &lt; 120000$.
 
 # --hints--
 
-`euler127()` should return 18407904.
+`abcHits()` should return `18407904`.
 
 ```js
-assert.strictEqual(euler127(), 18407904);
+assert.strictEqual(abcHits(), 18407904);
 ```
 
 # --seed--
@@ -47,12 +41,12 @@ assert.strictEqual(euler127(), 18407904);
 ## --seed-contents--
 
 ```js
-function euler127() {
+function abcHits() {
 
   return true;
 }
 
-euler127();
+abcHits();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
index 7bdd6242348..7e8bea5482e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ec1000cf542c50feff
 title: 'Problem 128: Hexagonal tile differences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301755
 dashedName: problem-128-hexagonal-tile-differences
 ---
@@ -12,14 +12,32 @@ A hexagonal tile with number 1 is surrounded by a ring of six hexagonal tiles, s
 
 New rings are added in the same fashion, with the next rings being numbered 8 to 19, 20 to 37, 38 to 61, and so on. The diagram below shows the first three rings.
 
-By finding the difference between tile n and each of its six neighbours we shall define PD(n) to be the number of those differences which are prime. For example, working clockwise around tile 8 the differences are 12, 29, 11, 6, 1, and 13. So PD(8) = 3. In the same way, the differences around tile 17 are 1, 17, 16, 1, 11, and 10, hence PD(17) = 2. It can be shown that the maximum value of PD(n) is 3. If all of the tiles for which PD(n) = 3 are listed in ascending order to form a sequence, the 10th tile would be 271. Find the 2000th tile in this sequence.
+<img class="img-responsive center-block" alt="three first rings of arranged hexagonal tiles with numbers 1 to 37, and with highlighted tiles 8 and 17" src="https://cdn.freecodecamp.org/curriculum/project-euler/hexagonal-tile-differences.png" style="background-color: white; padding: 10px;" />
+
+By finding the difference between tile $n$ and each of its six neighbours we shall define $PD(n)$ to be the number of those differences which are prime.
+
+For example, working clockwise around tile 8 the differences are 12, 29, 11, 6, 1, and 13. So $PD(8) = 3$.
+
+In the same way, the differences around tile 17 are 1, 17, 16, 1, 11, and 10, hence $PD(17) = 2$.
+
+It can be shown that the maximum value of $PD(n)$ is $3$.
+
+If all of the tiles for which $PD(n) = 3$ are listed in ascending order to form a sequence, the 10th tile would be 271.
+
+Find the 2000th tile in this sequence.
 
 # --hints--
 
-`euler128()` should return 14516824220.
+`hexagonalTile(10)` should return `271`.
 
 ```js
-assert.strictEqual(euler128(), 14516824220);
+assert.strictEqual(hexagonalTile(10), 271);
+```
+
+`hexagonalTile(2000)` should return `14516824220`.
+
+```js
+assert.strictEqual(hexagonalTile(2000), 14516824220);
 ```
 
 # --seed--
@@ -27,16 +45,62 @@ assert.strictEqual(euler128(), 14516824220);
 ## --seed-contents--
 
 ```js
-function euler128() {
+function hexagonalTile(tileIndex) {
 
   return true;
 }
 
-euler128();
+hexagonalTile(10);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+const NUM_PRIMES = 840000;
+const PRIME_SEIVE = Array(Math.floor((NUM_PRIMES-1)/2)).fill(true);
+(function initPrimes(num) {
+  const upper = Math.floor((num - 1) / 2);
+  const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+  for (let i = 0; i <= sqrtUpper; i++) {
+    if (PRIME_SEIVE[i]) {
+      // Mark value in PRIMES array
+      const prime = 2 * i + 3;
+      // Mark all multiples of this number as false (not prime)
+      const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+      for (let j = primeSqaredIndex; j < upper; j += prime) {
+        PRIME_SEIVE[j] = false;
+      }
+    }
+  }
+})(NUM_PRIMES);
+
+function isPrime(num) {
+  if (num === 2) return true;
+  else if (num % 2 === 0) return false
+  else return PRIME_SEIVE[(num - 3) / 2];
+}
+
+function hexagonalTile(tileIndex) {
+  let count = 1;
+  let n = 1;
+  let number = 0;
+
+  while (count < tileIndex) {
+    if (isPrime(6*n - 1) &&
+        isPrime(6*n + 1) &&
+        isPrime(12*n + 5)) {
+      number = 3*n*n - 3*n + 2;
+      count++;
+      if (count >= tileIndex) break;
+    }
+    if (isPrime(6*n + 5) &&
+        isPrime(6*n - 1) &&
+        isPrime(12*n - 7) && n != 1) {
+      number = 3*n*n + 3*n + 1;
+      count++;
+    }
+    n++;
+  }
+  return number;
+}
 ```
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-129-repunit-divisibility.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-129-repunit-divisibility.md
index 0d8f6c2916c..e7f423f96d5 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-129-repunit-divisibility.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-129-repunit-divisibility.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f3ef1000cf542c50ff01
 title: 'Problem 129: Repunit divisibility'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301756
 dashedName: problem-129-repunit-divisibility
 ---
 
 # --description--
 
-A number consisting entirely of ones is called a repunit. We shall define R(k) to be a repunit of length k; for example, R(6) = 111111.
+A number consisting entirely of ones is called a repunit. We shall define $R(k)$ to be a repunit of length $k$; for example, $R(6) = 111111$.
 
-Given that n is a positive integer and GCD(n, 10) = 1, it can be shown that there always exists a value, k, for which R(k) is divisible by n, and let A(n) be the least such value of k; for example, A(7) = 6 and A(41) = 5.
+Given that $n$ is a positive integer and $GCD(n, 10) = 1$, it can be shown that there always exists a value, $k$, for which $R(k)$ is divisible by $n$, and let $A(n)$ be the least such value of $k$; for example, $A(7) = 6$ and $A(41) = 5$.
 
-The least value of n for which A(n) first exceeds ten is 17.
+The least value of $n$ for which $A(n)$ first exceeds ten is 17.
 
-Find the least value of n for which A(n) first exceeds one-million.
+Find the least value of $n$ for which $A(n)$ first exceeds one-million.
 
 # --hints--
 
-`euler129()` should return 1000023.
+`repunitDivisibility()` should return `1000023`.
 
 ```js
-assert.strictEqual(euler129(), 1000023);
+assert.strictEqual(repunitDivisibility(), 1000023);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler129(), 1000023);
 ## --seed-contents--
 
 ```js
-function euler129() {
+function repunitDivisibility() {
 
   return true;
 }
 
-euler129();
+repunitDivisibility();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-130-composites-with-prime-repunit-property.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-130-composites-with-prime-repunit-property.md
index 0f3c2c7a3cc..48f7149e5a6 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-130-composites-with-prime-repunit-property.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-130-composites-with-prime-repunit-property.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f3ee1000cf542c50ff00
 title: 'Problem 130: Composites with prime repunit property'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301758
 dashedName: problem-130-composites-with-prime-repunit-property
 ---
 
 # --description--
 
-A number consisting entirely of ones is called a repunit. We shall define R(k) to be a repunit of length k; for example, R(6) = 111111.
+A number consisting entirely of ones is called a repunit. We shall define $R(k)$ to be a repunit of length $k$; for example, $R(6) = 111111$.
 
-Given that n is a positive integer and GCD(n, 10) = 1, it can be shown that there always exists a value, k, for which R(k) is divisible by n, and let A(n) be the least such value of k; for example, A(7) = 6 and A(41) = 5.
+Given that $n$ is a positive integer and $GCD(n, 10) = 1$, it can be shown that there always exists a value, $k$, for which $R(k)$ is divisible by $n$, and let $A(n)$ be the least such value of $k$; for example, $A(7) = 6$ and $A(41) = 5$.
 
-You are given that for all primes, p > 5, that p − 1 is divisible by A(p). For example, when p = 41, A(41) = 5, and 40 is divisible by 5.
+You are given that for all primes, $p > 5$, that $p − 1$ is divisible by $A(p)$. For example, when $p = 41, A(41) = 5$, and 40 is divisible by 5.
 
 However, there are rare composite values for which this is also true; the first five examples being 91, 259, 451, 481, and 703.
 
-Find the sum of the first twenty-five composite values of n for whichGCD(n, 10) = 1 and n − 1 is divisible by A(n).
+Find the sum of the first twenty-five composite values of $n$ for which $GCD(n, 10) = 1$ and $n − 1$ is divisible by $A(n)$.
 
 # --hints--
 
-`euler130()` should return 149253.
+`compositeRepunit()` should return `149253`.
 
 ```js
-assert.strictEqual(euler130(), 149253);
+assert.strictEqual(compositeRepunit(), 149253);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler130(), 149253);
 ## --seed-contents--
 
 ```js
-function euler130() {
+function compositeRepunit() {
 
   return true;
 }
 
-euler130();
+compositeRepunit();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-131-prime-cube-partnership.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-131-prime-cube-partnership.md
index 729f8689fba..73e7e8e7490 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-131-prime-cube-partnership.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-131-prime-cube-partnership.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f3ef1000cf542c50ff02
 title: 'Problem 131: Prime cube partnership'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301759
 dashedName: problem-131-prime-cube-partnership
 ---
 
 # --description--
 
-There are some prime values, p, for which there exists a positive integer, n, such that the expression n3 + n2p is a perfect cube.
+There are some prime values, $p$, for which there exists a positive integer, $n$, such that the expression $n^3 + n^{2}p$ is a perfect cube.
 
-For example, when p = 19, 83 + 82×19 = 123.
+For example, when $p = 19,\\ 8^3 + 8^2 × 19 = {12}^3$.
 
-What is perhaps most surprising is that for each prime with this property the value of n is unique, and there are only four such primes below one-hundred.
+What is perhaps most surprising is that the value of $n$ is unique for each prime with this property, and there are only four such primes below one hundred.
 
 How many primes below one million have this remarkable property?
 
 # --hints--
 
-`euler131()` should return 173.
+`primeCubePartnership()` should return `173`.
 
 ```js
-assert.strictEqual(euler131(), 173);
+assert.strictEqual(primeCubePartnership(), 173);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler131(), 173);
 ## --seed-contents--
 
 ```js
-function euler131() {
+function primeCubePartnership() {
 
   return true;
 }
 
-euler131();
+primeCubePartnership();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-133-repunit-nonfactors.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-133-repunit-nonfactors.md
index 649dd7f1f33..ee861a14420 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-133-repunit-nonfactors.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-133-repunit-nonfactors.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f3f21000cf542c50ff04
 title: 'Problem 133: Repunit nonfactors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301761
 dashedName: problem-133-repunit-nonfactors
 ---
 
 # --description--
 
-A number consisting entirely of ones is called a repunit. We shall define R(k) to be a repunit of length k; for example, R(6) = 111111.
+A number consisting entirely of ones is called a repunit. We shall define $R(k)$ to be a repunit of length $k$; for example, $R(6) = 111111$.
 
-Let us consider repunits of the form R(10n).
+Let us consider repunits of the form $R({10}^n)$.
 
-Although R(10), R(100), or R(1000) are not divisible by 17, R(10000) is divisible by 17. Yet there is no value of n for which R(10n) will divide by 19. In fact, it is remarkable that 11, 17, 41, and 73 are the only four primes below one-hundred that can be a factor of R(10n).
+Although $R(10)$, $R(100)$, or $R(1000)$ are not divisible by 17, $R(10000)$ is divisible by 17. Yet there is no value of n for which $R({10}^n)$ will divide by 19. Remarkably, 11, 17, 41, and 73 are the only four primes below one-hundred that can be a factor of $R({10}^n)$.
 
-Find the sum of all the primes below one-hundred thousand that will never be a factor of R(10n).
+Find the sum of all the primes below one-hundred thousand that will never be a factor of $R({10}^n)$.
 
 # --hints--
 
-`euler133()` should return 453647705.
+`repunitNonfactors()` should return `453647705`.
 
 ```js
-assert.strictEqual(euler133(), 453647705);
+assert.strictEqual(repunitNonfactors(), 453647705);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler133(), 453647705);
 ## --seed-contents--
 
 ```js
-function euler133() {
+function repunitNonfactors() {
 
   return true;
 }
 
-euler133();
+repunitNonfactors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-134-prime-pair-connection.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-134-prime-pair-connection.md
index a21b71ea01a..d6629ef1579 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-134-prime-pair-connection.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-134-prime-pair-connection.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f3f21000cf542c50ff05
 title: 'Problem 134: Prime pair connection'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301762
 dashedName: problem-134-prime-pair-connection
 ---
 
 # --description--
 
-Consider the consecutive primes p1 = 19 and p2 = 23. It can be verified that 1219 is the smallest number such that the last digits are formed by p1 whilst also being divisible by p2.
+Consider the consecutive primes $p_1 = 19$ and $p_2 = 23$. It can be verified that 1219 is the smallest number such that the last digits are formed by $p_1$ whilst also being divisible by $p_2$.
 
-In fact, with the exception of p1 = 3 and p2 = 5, for every pair of consecutive primes, p2 > p1, there exist values of n for which the last digits are formed by p1 and n is divisible by p2. Let S be the smallest of these values of n.
+In fact, with the exception of $p_1 = 3$ and $p_2 = 5$, for every pair of consecutive primes, $p_2 > p_1$, there exist values of $n$ for which the last digits are formed by $p_1$ and $n$ is divisible by $p_2$. Let $S$ be the smallest of these values of $n$.
 
-Find ∑ S for every pair of consecutive primes with 5 ≤ p1 ≤ 1000000.
+Find $\sum{S}$ for every pair of consecutive primes with $5 ≤ p_1 ≤ 1000000$.
 
 # --hints--
 
-`euler134()` should return 18613426663617120.
+`primePairConnection()` should return `18613426663617120`.
 
 ```js
-assert.strictEqual(euler134(), 18613426663617120);
+assert.strictEqual(primePairConnection(), 18613426663617120);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler134(), 18613426663617120);
 ## --seed-contents--
 
 ```js
-function euler134() {
+function primePairConnection() {
 
   return true;
 }
 
-euler134();
+primePairConnection();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-135-same-differences.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-135-same-differences.md
index f0de3b5c589..3045467d61e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-135-same-differences.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-135-same-differences.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f3f31000cf542c50ff06
 title: 'Problem 135: Same differences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301763
 dashedName: problem-135-same-differences
 ---
 
 # --description--
 
-Given the positive integers, x, y, and z, are consecutive terms of an arithmetic progression, the least value of the positive integer, n, for which the equation, x2 − y2 − z2 = n, has exactly two solutions is n = 27:
+Given the positive integers, $x$, $y$, and $z$, are consecutive terms of an arithmetic progression, the least value of the positive integer, $n$, for which the equation, $x^2 − y^2 − z^2 = n$, has exactly two solutions is $n = 27$:
 
-342 − 272 − 202 = 122 − 92 − 62 = 27
+$$34^2 − 27^2 − 20^2 = 12^2 − 9^2 − 6^2 = 27$$
 
-It turns out that n = 1155 is the least value which has exactly ten solutions.
+It turns out that $n = 1155$ is the least value which has exactly ten solutions.
 
-How many values of n less than one million have exactly ten distinct solutions?
+How many values of $n$ less than one million have exactly ten distinct solutions?
 
 # --hints--
 
-`euler135()` should return 4989.
+`sameDifferences()` should return `4989`.
 
 ```js
-assert.strictEqual(euler135(), 4989);
+assert.strictEqual(sameDifferences(), 4989);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler135(), 4989);
 ## --seed-contents--
 
 ```js
-function euler135() {
+function sameDifferences() {
 
   return true;
 }
 
-euler135();
+sameDifferences();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-136-singleton-difference.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-136-singleton-difference.md
index 34fda8a4eeb..d73ff59f63b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-136-singleton-difference.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-136-singleton-difference.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f3f51000cf542c50ff07
 title: 'Problem 136: Singleton difference'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301764
 dashedName: problem-136-singleton-difference
 ---
 
 # --description--
 
-The positive integers, x, y, and z, are consecutive terms of an arithmetic progression. Given that n is a positive integer, the equation, x2 − y2 − z2 = n, has exactly one solution when n = 20:
+The positive integers, $x$, $y$, and $z$, are consecutive terms of an arithmetic progression. Given that $n$ is a positive integer, the equation, $x^2 − y^2 − z^2 = n$, has exactly one solution when $n = 20$:
 
-132 − 102 − 72 = 20
+$$13^2 − 10^2 − 7^2 = 20$$
 
-In fact there are twenty-five values of n below one hundred for which the equation has a unique solution.
+In fact, there are twenty-five values of $n$ below one hundred for which the equation has a unique solution.
 
-How many values of n less than fifty million have exactly one solution?
+How many values of $n$ less than fifty million have exactly one solution?
 
 # --hints--
 
-`euler136()` should return 2544559.
+`singletonDifference()` should return `2544559`.
 
 ```js
-assert.strictEqual(euler136(), 2544559);
+assert.strictEqual(singletonDifference(), 2544559);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler136(), 2544559);
 ## --seed-contents--
 
 ```js
-function euler136() {
+function singletonDifference() {
 
   return true;
 }
 
-euler136();
+singletonDifference();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.md
index 2863f66aa1a..b700dba62d0 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.md
@@ -1,37 +1,42 @@
 ---
 id: 5900f3f51000cf542c50ff08
 title: 'Problem 137: Fibonacci golden nuggets'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301765
 dashedName: problem-137-fibonacci-golden-nuggets
 ---
 
 # --description--
 
-Consider the infinite polynomial series AF(x) = xF1 + x2F2 + x3F3 + ..., where Fk is the kth term in the Fibonacci sequence: 1, 1, 2, 3, 5, 8, ... ; that is, Fk = Fk−1 + Fk−2, F1 = 1 and F2 = 1.
+Consider the infinite polynomial series $A_{F}(x) = xF_1 + x^2F_2 + x^3F_3 + \ldots$, where $F_k$ is the $k$th term in the Fibonacci sequence: $1, 1, 2, 3, 5, 8, \ldots$; that is, $F_k = F_{k − 1} + F_{k − 2}, F_1 = 1$ and $F_2 = 1$.
 
-For this problem we shall be interested in values of x for which AF(x) is a positive integer.
+For this problem we shall be interested in values of $x$ for which $A_{F}(x)$ is a positive integer.
 
-Surprisingly AF(1/2)
+Surprisingly
 
-=
+$$\begin{align} A_F(\frac{1}{2}) & = (\frac{1}{2}) × 1 + {(\frac{1}{2})}^2 × 1 + {(\frac{1}{2})}^3 × 2 + {(\frac{1}{2})}^4 × 3 + {(\frac{1}{2})}^5 × 5 + \cdots \\\\
+                 & = \frac{1}{2} + \frac{1}{4} + \frac{2}{8} + \frac{3}{16} + \frac{5}{32} + \cdots \\\\ & = 2 \end{align}$$
 
-(1/2).1 + (1/2)2.1 + (1/2)3.2 + (1/2)4.3 + (1/2)5.5 + ...
+The corresponding values of $x$ for the first five natural numbers are shown below.
 
-= 1/2 + 1/4 + 2/8 + 3/16 + 5/32 + ...
+| $x$                         | $A_F(x)$ |
+| --------------------------- | -------- |
+| $\sqrt{2} − 1$             | $1$      |
+| $\frac{1}{2}$              | $2$      |
+| $\frac{\sqrt{13} − 2}{3}$ | $3$      |
+| $\frac{\sqrt{89} − 5}{8}$ | $4$      |
+| $\frac{\sqrt{34} − 3}{5}$ | $5$      |
 
-= 2 The corresponding values of x for the first five natural numbers are shown below.
+We shall call $A_F(x)$ a golden nugget if $x$ is rational, because they become increasingly rarer; for example, the 10th golden nugget is 74049690.
 
-xAF(x) √2−11 1/22 (√13−2)/33 (√89−5)/84 (√34−3)/55
-
-We shall call AF(x) a golden nugget if x is rational, because they become increasingly rarer; for example, the 10th golden nugget is 74049690. Find the 15th golden nugget.
+Find the 15th golden nugget.
 
 # --hints--
 
-`euler137()` should return 1120149658760.
+`goldenNugget()` should return `1120149658760`.
 
 ```js
-assert.strictEqual(euler137(), 1120149658760);
+assert.strictEqual(goldenNugget(), 1120149658760);
 ```
 
 # --seed--
@@ -39,12 +44,12 @@ assert.strictEqual(euler137(), 1120149658760);
 ## --seed-contents--
 
 ```js
-function euler137() {
+function goldenNugget() {
 
   return true;
 }
 
-euler137();
+goldenNugget();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md
index 800c0ccbab2..19f12579cb2 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3f71000cf542c50ff0a
 title: 'Problem 139: Pythagorean tiles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301767
 dashedName: problem-139-pythagorean-tiles
 ---
@@ -12,14 +12,18 @@ Let (a, b, c) represent the three sides of a right angle triangle with integral
 
 For example, (3, 4, 5) triangles can be placed together to form a 5 by 5 square with a 1 by 1 hole in the middle and it can be seen that the 5 by 5 square can be tiled with twenty-five 1 by 1 squares.
 
-However, if (5, 12, 13) triangles were used then the hole would measure 7 by 7 and these could not be used to tile the 13 by 13 square. Given that the perimeter of the right triangle is less than one-hundred million, how many Pythagorean triangles would allow such a tiling to take place?
+<img class="img-responsive center-block" alt="two 5 x 5 squares: one with four 3x4x5 triangles placed to create 1x1 hole in the middle; second with twenty-five 1x1 squares" src="https://cdn.freecodecamp.org/curriculum/project-euler/pythagorean-tiles.png" style="background-color: white; padding: 10px;" />
+
+However, if (5, 12, 13) triangles were used, the hole would measure 7 by 7. These 7 by 7 squares could not be used to tile the 13 by 13 square.
+
+Given that the perimeter of the right triangle is less than one-hundred million, how many Pythagorean triangles would allow such a tiling to occur?
 
 # --hints--
 
-`euler139()` should return 10057761.
+`pythagoreanTiles()` should return `10057761`.
 
 ```js
-assert.strictEqual(euler139(), 10057761);
+assert.strictEqual(pythagoreanTiles(), 10057761);
 ```
 
 # --seed--
@@ -27,12 +31,12 @@ assert.strictEqual(euler139(), 10057761);
 ## --seed-contents--
 
 ```js
-function euler139() {
+function pythagoreanTiles() {
 
   return true;
 }
 
-euler139();
+pythagoreanTiles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.md
index 01664be7aef..bdd6612a63c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.md
@@ -1,29 +1,35 @@
 ---
 id: 5900f3fa1000cf542c50ff0c
 title: 'Problem 140: Modified Fibonacci golden nuggets'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301769
 dashedName: problem-140-modified-fibonacci-golden-nuggets
 ---
 
 # --description--
 
-Consider the infinite polynomial series AG(x) = xG1 + x2G2 + x3G3 + ..., where Gk is the kth term of the second order recurrence relation Gk = Gk−1 + Gk−2, G1 = 1 and G2 = 4; that is, 1, 4, 5, 9, 14, 23, ... .
+Consider the infinite polynomial series $A_G(x) = xG_1 + x^2G_2 + x^3G_3 + \cdots$, where $G_k$ is the $k$th term of the second order recurrence relation $G_k = G_{k − 1} + G_{k − 2}, G_1 = 1$ and $G_2 = 4$; that is, $1, 4, 5, 9, 14, 23, \ldots$.
 
-For this problem we shall be concerned with values of x for which AG(x) is a positive integer.
+For this problem we shall be concerned with values of $x$ for which $A_G(x)$ is a positive integer.
 
-The corresponding values of x for the first five natural numbers are shown below.
+The corresponding values of $x$ for the first five natural numbers are shown below.
 
-xAG(x) (√5−1)/41 2/52 (√22−2)/63 (√137−5)/144 1/25
+| $x$                           | $A_G(x)$ |
+| ----------------------------- | -------- |
+| $\frac{\sqrt{5} − 1}{4}$    | $1$      |
+| $\frac{2}{5}$                | $2$      |
+| $\frac{\sqrt{22} − 2}{6}$   | $3$      |
+| $\frac{\sqrt{137} − 5}{14}$ | $4$      |
+| $\frac{1}{2}$                | $5$      |
 
-We shall call AG(x) a golden nugget if x is rational, because they become increasingly rarer; for example, the 20th golden nugget is 211345365. Find the sum of the first thirty golden nuggets.
+We shall call $A_G(x)$ a golden nugget if $x$ is rational because they become increasingly rarer; for example, the 20th golden nugget is 211345365. Find the sum of the first thirty golden nuggets.
 
 # --hints--
 
-`euler140()` should return 5673835352990.
+`modifiedGoldenNuggets()` should return `5673835352990`
 
 ```js
-assert.strictEqual(euler140(), 5673835352990);
+assert.strictEqual(modifiedGoldenNuggets(), 5673835352990);
 ```
 
 # --seed--
@@ -31,12 +37,12 @@ assert.strictEqual(euler140(), 5673835352990);
 ## --seed-contents--
 
 ```js
-function euler140() {
+function modifiedGoldenNuggets() {
 
   return true;
 }
 
-euler140();
+modifiedGoldenNuggets();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-141-investigating-progressive-numbers-n-which-are-also-square.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-141-investigating-progressive-numbers-n-which-are-also-square.md
index 4bcd7e069a6..9f1e9d3bb45 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-141-investigating-progressive-numbers-n-which-are-also-square.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-141-investigating-progressive-numbers-n-which-are-also-square.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f3f91000cf542c50ff0b
 title: 'Problem 141: Investigating progressive numbers, n, which are also square'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301770
 dashedName: problem-141-investigating-progressive-numbers-n-which-are-also-square
 ---
 
 # --description--
 
-A positive integer, n, is divided by d and the quotient and remainder are q and r respectively. In addition d, q, and r are consecutive positive integer terms in a geometric sequence, but not necessarily in that order.
+A positive integer, $n$, is divided by $d$ and the quotient and remainder are $q$ and $r$ respectively. In addition $d$, $q$, and $r$ are consecutive positive integer terms in a geometric sequence, but not necessarily in that order.
 
-For example, 58 divided by 6 has quotient 9 and remainder 4. It can also be seen that 4, 6, 9 are consecutive terms in a geometric sequence (common ratio 3/2).
+For example, 58 divided by 6 has a quotient of 9 and a remainder of 4. It can also be seen that 4, 6, 9 are consecutive terms in a geometric sequence (common ratio $\frac{3}{2}$).
 
-We will call such numbers, n, progressive.
+We will call such numbers, $n$, progressive.
 
-Some progressive numbers, such as 9 and 10404 = 1022, happen to also be perfect squares. The sum of all progressive perfect squares below one hundred thousand is 124657.
+Some progressive numbers, such as 9 and 10404 = ${102}^2$, also happen to be perfect squares. The sum of all progressive perfect squares below one hundred thousand is 124657.
 
-Find the sum of all progressive perfect squares below one trillion (1012).
+Find the sum of all progressive perfect squares below one trillion (${10}^{12}$).
 
 # --hints--
 
-`euler141()` should return 878454337159.
+`progressivePerfectSquares()` should return `878454337159`.
 
 ```js
-assert.strictEqual(euler141(), 878454337159);
+assert.strictEqual(progressivePerfectSquares(), 878454337159);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler141(), 878454337159);
 ## --seed-contents--
 
 ```js
-function euler141() {
+function progressivePerfectSquares() {
 
   return true;
 }
 
-euler141();
+progressivePerfectSquares();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-142-perfect-square-collection.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-142-perfect-square-collection.md
index 03d921eac9a..17a07958833 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-142-perfect-square-collection.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-142-perfect-square-collection.md
@@ -1,21 +1,21 @@
 ---
 id: 5900f3fa1000cf542c50ff0d
 title: 'Problem 142: Perfect Square Collection'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301771
 dashedName: problem-142-perfect-square-collection
 ---
 
 # --description--
 
-Find the smallest x + y + z with integers x > y > z > 0 such that x + y, x − y, x + z, x − z, y + z, y − z are all perfect squares.
+Find the smallest $x + y + z$ with integers $x > y > z > 0$ such that $x + y$, $x − y$, $x + z$, $x − z$, $y + z$, $y − z$ are all perfect squares.
 
 # --hints--
 
-`euler142()` should return 1006193.
+`perfectSquareCollection()` should return `1006193`.
 
 ```js
-assert.strictEqual(euler142(), 1006193);
+assert.strictEqual(perfectSquareCollection(), 1006193);
 ```
 
 # --seed--
@@ -23,12 +23,12 @@ assert.strictEqual(euler142(), 1006193);
 ## --seed-contents--
 
 ```js
-function euler142() {
+function perfectSquareCollection() {
 
   return true;
 }
 
-euler142();
+perfectSquareCollection();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.md
index fd11d827b7d..8051dd4317d 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f3fc1000cf542c50ff0e
 title: 'Problem 143: Investigating the Torricelli point of a triangle'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301772
 dashedName: problem-143-investigating-the-torricelli-point-of-a-triangle
 ---
 
 # --description--
 
-Let ABC be a triangle with all interior angles being less than 120 degrees. Let X be any point inside the triangle and let XA = p, XC = q, and XB = r.
+Let ABC be a triangle with all interior angles being less than 120 degrees. Let X be any point inside the triangle and let $XA = p$, $XC = q$, and $XB = r$.
 
 Fermat challenged Torricelli to find the position of X such that p + q + r was minimised.
 
-Torricelli was able to prove that if equilateral triangles AOB, BNC and AMC are constructed on each side of triangle ABC, the circumscribed circles of AOB, BNC, and AMC will intersect at a single point, T, inside the triangle. Moreover he proved that T, called the Torricelli/Fermat point, minimises p + q + r. Even more remarkable, it can be shown that when the sum is minimised, AN = BM = CO = p + q + r and that AN, BM and CO also intersect at T.
+Torricelli was able to prove that if equilateral triangles AOB, BNC and AMC are constructed on each side of triangle ABC, the circumscribed circles of AOB, BNC, and AMC will intersect at a single point, T, inside the triangle. Moreover he proved that T, called the Torricelli/Fermat point, minimises $p + q + r$. Even more remarkable, it can be shown that when the sum is minimised, $AN = BM = CO = p + q + r$ and that AN, BM and CO also intersect at T.
 
-If the sum is minimised and a, b, c, p, q and r are all positive integers we shall call triangle ABC a Torricelli triangle. For example, a = 399, b = 455, c = 511 is an example of a Torricelli triangle, with p + q + r = 784. Find the sum of all distinct values of p + q + r ≤ 120000 for Torricelli triangles.
+<img class="img-responsive center-block" alt="equilateral triangles AOB, BNC and AMC constructed on each side of triangle ABC; with the circumscribed circles of AOB, BNC, and AMC will intersecting at a single point, T, inside the triangle" src="https://cdn.freecodecamp.org/curriculum/project-euler/investigating-the-torricelli-point-of-a-triangle.png" style="background-color: white; padding: 10px;" />
+
+If the sum is minimised and a, b, c, p, q and r are all positive integers we shall call triangle ABC a Torricelli triangle. For example, $a = 399$, $b = 455$, $c = 511$ is an example of a Torricelli triangle, with $p + q + r = 784$. Find the sum of all distinct values of $p + q + r ≤ 120000$ for Torricelli triangles.
 
 # --hints--
 
-`euler143()` should return 30758397.
+`sumTorricelliTriangles()` should return `30758397`.
 
 ```js
-assert.strictEqual(euler143(), 30758397);
+assert.strictEqual(sumTorricelliTriangles(), 30758397);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler143(), 30758397);
 ## --seed-contents--
 
 ```js
-function euler143() {
+function sumTorricelliTriangles() {
 
   return true;
 }
 
-euler143();
+sumTorricelliTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md
index 88d8b1e5a8d..7bc0d2b1137 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3fc1000cf542c50ff0f
 title: 'Problem 144: Investigating multiple reflections of a laser beam'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301773
 dashedName: problem-144-investigating-multiple-reflections-of-a-laser-beam
 ---
@@ -10,20 +10,35 @@ dashedName: problem-144-investigating-multiple-reflections-of-a-laser-beam
 
 In laser physics, a "white cell" is a mirror system that acts as a delay line for the laser beam. The beam enters the cell, bounces around on the mirrors, and eventually works its way back out.
 
-The specific white cell we will be considering is an ellipse with the equation 4x2 + y2 = 100
+The specific white cell we will be considering is an ellipse with the equation $4{x}^2 + y^2 = 100$
 
-The section corresponding to −0.01 ≤ x ≤ +0.01 at the top is missing, allowing the light to enter and exit through the hole.
+The section corresponding to $−0.01 ≤ x ≤ +0.01$ at the top is missing, allowing the light to enter and exit through the hole.
 
-The light beam in this problem starts at the point (0.0,10.1) just outside the white cell, and the beam first impacts the mirror at (1.4,-9.6). Each time the laser beam hits the surface of the ellipse, it follows the usual law of reflection "angle of incidence equals angle of reflection." That is, both the incident and reflected beams make the same angle with the normal line at the point of incidence. In the figure on the left, the red line shows the first two points of contact between the laser beam and the wall of the white cell; the blue line shows the line tangent to the ellipse at the point of incidence of the first bounce.The slope m of the tangent line at any point (x,y) of the given ellipse is: m = −4x/yThe normal line is perpendicular to this tangent line at the point of incidence. The animation on the right shows the first 10 reflections of the beam.
+<div style="text-align: center">
+  <img class="img-responsive center-block" alt="light beam starting at point (0.0, 10.1), and impacing the mirror at point (1.4, -9.6)" src="https://cdn.freecodecamp.org/curriculum/project-euler/investigating-multiple-reflections-of-a-laser-beam-1.png" style="display: inline-block; background-color: white; padding: 10px;">
+  <img class="img-responsive center-block" alt="animation with first 10 relfections of the beam" src="https://cdn.freecodecamp.org/curriculum/project-euler/investigating-multiple-reflections-of-a-laser-beam-2.gif" style="display: inline-block; background-color: white; padding: 10px;">
+</div><br>
+
+The light beam in this problem starts at the point (0.0, 10.1) just outside the white cell, and the beam first impacts the mirror at (1.4, -9.6).
+
+Each time the laser beam hits the surface of the ellipse, it follows the usual law of reflection "angle of incidence equals angle of reflection." That is, both the incident and reflected beams make the same angle with the normal line at the point of incidence.
+
+In the figure on the left, the red line shows the first two points of contact between the laser beam and the wall of the white cell; the blue line shows the line tangent to the ellipse at the point of incidence of the first bounce.
+
+The slope m of the tangent line at any point (x, y) of the given ellipse is: $m = −4 × \frac{x}{y}$
+
+The normal line is perpendicular to this tangent line at the point of incidence.
+
+The animation on the right shows the first 10 reflections of the beam.
 
 How many times does the beam hit the internal surface of the white cell before exiting?
 
 # --hints--
 
-`euler144()` should return 354.
+`laserBeamReflections()` should return `354`.
 
 ```js
-assert.strictEqual(euler144(), 354);
+assert.strictEqual(laserBeamReflections(), 354);
 ```
 
 # --seed--
@@ -31,12 +46,12 @@ assert.strictEqual(euler144(), 354);
 ## --seed-contents--
 
 ```js
-function euler144() {
+function laserBeamReflections() {
 
   return true;
 }
 
-euler144();
+laserBeamReflections();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-145-how-many-reversible-numbers-are-there-below-one-billion.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-145-how-many-reversible-numbers-are-there-below-one-billion.md
index 0ec3679a6f9..f30799446b2 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-145-how-many-reversible-numbers-are-there-below-one-billion.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-145-how-many-reversible-numbers-are-there-below-one-billion.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f3fd1000cf542c50ff10
 title: 'Problem 145: How many reversible numbers are there below one-billion?'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301774
 dashedName: problem-145-how-many-reversible-numbers-are-there-below-one-billion
 ---
 
 # --description--
 
-Some positive integers n have the property that the sum \[ n + reverse(n) ] consists entirely of odd (decimal) digits. For instance, 36 + 63 = 99 and 409 + 904 = 1313. We will call such numbers reversible; so 36, 63, 409, and 904 are reversible. Leading zeroes are not allowed in either n or reverse(n).
+Some positive integers $n$ have the property that the sum [ $n + reverse(n)$ ] consists entirely of odd (decimal) digits. For instance, $36 + 63 = 99$ and $409 + 904 = 1313$. We will call such numbers reversible; so 36, 63, 409, and 904 are reversible. Leading zeroes are not allowed in either $n$ or $reverse(n)$.
 
 There are 120 reversible numbers below one-thousand.
 
-How many reversible numbers are there below one-billion (109)?
+How many reversible numbers are there below one-billion (${10}^9$)?
 
 # --hints--
 
-`euler145()` should return 608720.
+`reversibleNumbers()` should return `608720`.
 
 ```js
-assert.strictEqual(euler145(), 608720);
+assert.strictEqual(reversibleNumbers(), 608720);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler145(), 608720);
 ## --seed-contents--
 
 ```js
-function euler145() {
+function reversibleNumbers() {
 
   return true;
 }
 
-euler145();
+reversibleNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.md
index ddfec6766b2..6407520a81a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.md
@@ -1,23 +1,23 @@
 ---
 id: 5900f3fe1000cf542c50ff11
 title: 'Problem 146: Investigating a Prime Pattern'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301775
 dashedName: problem-146-investigating-a-prime-pattern
 ---
 
 # --description--
 
-The smallest positive integer n for which the numbers n2+1, n2+3, n2+7, n2+9, n2+13, and n2+27 are consecutive primes is 10. The sum of all such integers n below one-million is 1242490.
+The smallest positive integer $n$ for which the numbers $n^2 + 1$, $n^2 + 3$, $n^2 + 7$, $n^2 + 9$, $n^2 + 13$, and $n^2 + 27$ are consecutive primes is 10. The sum of all such integers $n$ below one-million is 1242490.
 
-What is the sum of all such integers n below 150 million?
+What is the sum of all such integers $n$ below 150 million?
 
 # --hints--
 
-`euler146()` should return 676333270.
+`primePattern()` should return `676333270`.
 
 ```js
-assert.strictEqual(euler146(), 676333270);
+assert.strictEqual(primePattern(), 676333270);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler146(), 676333270);
 ## --seed-contents--
 
 ```js
-function euler146() {
+function primePattern() {
 
   return true;
 }
 
-euler146();
+primePattern();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md
index 3b422811f69..40978bdd4ef 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ff1000cf542c50ff12
 title: 'Problem 147: Rectangles in cross-hatched grids'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301776
 dashedName: problem-147-rectangles-in-cross-hatched-grids
 ---
@@ -10,7 +10,11 @@ dashedName: problem-147-rectangles-in-cross-hatched-grids
 
 In a 3x2 cross-hatched grid, a total of 37 different rectangles could be situated within that grid as indicated in the sketch.
 
-There are 5 grids smaller than 3x2, vertical and horizontal dimensions being important, i.e. 1x1, 2x1, 3x1, 1x2 and 2x2. If each of them is cross-hatched, the following number of different rectangles could be situated within those smaller grids: 1x1: 1 2x1: 4 3x1: 8 1x2: 4 2x2: 18
+<img class="img-responsive center-block" alt="ways of situating different rectangles wihtin cross-hatched 3x2 grid" src="https://cdn.freecodecamp.org/curriculum/project-euler/rectangles-in-cross-hatched-grids.png" style="background-color: white; padding: 10px;" />
+
+There are 5 grids smaller than 3x2, vertical and horizontal dimensions being important, i.e. 1x1, 2x1, 3x1, 1x2 and 2x2. If each of them is cross-hatched, the following number of different rectangles could be situated within those smaller grids:
+
+$$\begin{array}{|c|c|} \hline 1 \times 1 & 1  \\\\ \hline 2 \times 1 & 4  \\\\ \hline 3 \times 1 & 8  \\\\ \hline 1 \times 2 & 4  \\\\ \hline 2 \times 2 & 18 \\\\ \hline \end{array}$$
 
 Adding those to the 37 of the 3x2 grid, a total of 72 different rectangles could be situated within 3x2 and smaller grids.
 
@@ -18,10 +22,10 @@ How many different rectangles could be situated within 47x43 and smaller grids?
 
 # --hints--
 
-`euler147()` should return 846910284.
+`crossHatchedRectangles()` should return `846910284`.
 
 ```js
-assert.strictEqual(euler147(), 846910284);
+assert.strictEqual(crossHatchedRectangles(), 846910284);
 ```
 
 # --seed--
@@ -29,12 +33,12 @@ assert.strictEqual(euler147(), 846910284);
 ## --seed-contents--
 
 ```js
-function euler147() {
+function crossHatchedRectangles() {
 
   return true;
 }
 
-euler147();
+crossHatchedRectangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.md
index 13babe893b0..d30e62b5442 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4021000cf542c50ff14
 title: 'Problem 148: Exploring Pascal''s triangle'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301777
 dashedName: problem-148-exploring-pascals-triangle
 ---
@@ -10,7 +10,7 @@ dashedName: problem-148-exploring-pascals-triangle
 
 We can easily verify that none of the entries in the first seven rows of Pascal's triangle are divisible by 7:
 
-<pre>
+```markup
             1
           1   1
         1   2   1
@@ -18,20 +18,20 @@ We can easily verify that none of the entries in the first seven rows of Pascal'
     1   4   6   4   1
   1   5   10  10  5   1
 1   6   15  20  15  6   1
-</pre>
+```
 
 However, if we check the first one hundred rows, we will find that only 2361 of the 5050 entries are not divisible by 7.
 
 # --instructions--
 
-Find the number of entries which are not divisible by 7 in the first one billion (10<sup>9</sup>) rows of Pascal's triangle.
+Find the number of entries which are not divisible by 7 in the first one billion (${10}^9$) rows of Pascal's triangle.
 
 # --hints--
 
-`euler148()` should return 2129970655314432.
+`entriesOfPascalsTriangle()` should return `2129970655314432`.
 
 ```js
-assert.strictEqual(euler148(), 2129970655314432);
+assert.strictEqual(entriesOfPascalsTriangle(), 2129970655314432);
 ```
 
 # --seed--
@@ -39,12 +39,12 @@ assert.strictEqual(euler148(), 2129970655314432);
 ## --seed-contents--
 
 ```js
-function euler148() {
+function entriesOfPascalsTriangle() {
 
   return true;
 }
 
-euler148();
+entriesOfPascalsTriangle();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.md
index c76d5370c24..c1fbd34962d 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.md
@@ -1,35 +1,37 @@
 ---
 id: 5900f4021000cf542c50ff13
 title: 'Problem 149: Searching for a maximum-sum subsequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301778
 dashedName: problem-149-searching-for-a-maximum-sum-subsequence
 ---
 
 # --description--
 
-Looking at the table below, it is easy to verify that the maximum possible sum of adjacent numbers in any direction (horizontal, vertical, diagonal or anti-diagonal) is 16 (= 8 + 7 + 1).
+Looking at the table below, it is easy to verify that the maximum possible sum of adjacent numbers in any direction (horizontal, vertical, diagonal or anti-diagonal) is $16 (= 8 + 7 + 1)$.
 
-−25329−6513273−18−4 8
+$$\begin{array}{|r|r|r|r|} \hline −2 &  5 &  3 & 2 \\\\ \hline 9 & −6 &  5 & 1 \\\\ \hline 3 &  2 &  7 & 3 \\\\ \hline −1 &  8 & −4 & 8 \\\\ \hline \end{array}$$
 
 Now, let us repeat the search, but on a much larger scale:
 
 First, generate four million pseudo-random numbers using a specific form of what is known as a "Lagged Fibonacci Generator":
 
-For 1 ≤ k ≤ 55, sk = \[100003 − 200003k + 300007k3] (modulo 1000000) − 500000. For 56 ≤ k ≤ 4000000, sk = \[sk−24 + sk−55 + 1000000] (modulo 1000000) − 500000.
+For $1 ≤ k ≤ 55$, $s_k = (100003 − 200003k + 300007{k}^3) \\ (modulo\\ 1000000) − 500000$.
 
-Thus, s10 = −393027 and s100 = 86613.
+For $56 ≤ k ≤ 4000000$, $s_k = (s_{k − 24} + s_{k − 55} + 1000000) \\ (modulo\\ 1000000) − 500000$.
 
-The terms of s are then arranged in a 2000×2000 table, using the first 2000 numbers to fill the first row (sequentially), the next 2000 numbers to fill the second row, and so on.
+Thus, $s_{10} = −393027$ and $s_{100} = 86613$.
+
+The terms of $s$ are then arranged in a 2000×2000 table, using the first 2000 numbers to fill the first row (sequentially), the next 2000 numbers to fill the second row, and so on.
 
 Finally, find the greatest sum of (any number of) adjacent entries in any direction (horizontal, vertical, diagonal or anti-diagonal).
 
 # --hints--
 
-`euler149()` should return 52852124.
+`maximumSubSequence()` should return `52852124`.
 
 ```js
-assert.strictEqual(euler149(), 52852124);
+assert.strictEqual(maximumSubSequence(), 52852124);
 ```
 
 # --seed--
@@ -37,12 +39,12 @@ assert.strictEqual(euler149(), 52852124);
 ## --seed-contents--
 
 ```js
-function euler149() {
+function maximumSubSequence() {
 
   return true;
 }
 
-euler149();
+maximumSubSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md
index fa659c2f46e..366d5dd9bd0 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md
@@ -2,7 +2,7 @@
 id: 5900f4031000cf542c50ff15
 title: >-
   Problem 150: Searching a triangular array for a sub-triangle having minimum-sum
-challengeType: 5
+challengeType: 1
 forumTopicId: 301781
 dashedName: problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum
 ---
@@ -13,15 +13,21 @@ In a triangular array of positive and negative integers, we wish to find a sub-t
 
 In the example below, it can be easily verified that the marked triangle satisfies this condition having a sum of −42.
 
-We wish to make such a triangular array with one thousand rows, so we generate 500500 pseudo-random numbers sk in the range ±219, using a type of random number generator (known as a Linear Congruential Generator) as follows: t := 0
+<img class="img-responsive center-block" alt="triangular array, with marked sub-triangle, having sum of -42" src="https://cdn.freecodecamp.org/curriculum/project-euler/searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.gif" style="background-color: white; padding: 10px;" />
 
-for k = 1 up to k = 500500:
+We wish to make such a triangular array with one thousand rows, so we generate 500500 pseudo-random numbers $s_k$ in the range $±2^{19}$, using a type of random number generator (known as a Linear Congruential Generator) as follows:
 
-t := (615949\*t + 797807) modulo 220 sk := t−219 Thus: s1 = 273519, s2 = −153582, s3 = 450905 etc Our triangular array is then formed using the pseudo-random numbers thus:
+$$\begin{align}   t := & \\ 0\\\\
+  \text{for}\\ & k = 1\\ \text{up to}\\ k = 500500:\\\\   & t := (615949 × t + 797807)\\ \text{modulo}\\ 2^{20}\\\\
+  & s_k := t − 219\\\\ \end{align}$$
 
-s1 s2 s3 s4 s5 s6
+Thus: $s_1 = 273519$, $s_2 = −153582$, $s_3 = 450905$ etc.
 
-s7 s8 s9 s10 ...
+Our triangular array is then formed using the pseudo-random numbers thus:
+
+$$ s_1 \\\\
+s_2\\;s_3 \\\\ s_4\\; s_5\\; s_6 \\\\
+s_7\\; s_8\\; s_9\\; s_{10} \\\\ \ldots $$
 
 Sub-triangles can start at any element of the array and extend down as far as we like (taking-in the two elements directly below it from the next row, the three elements directly below from the row after that, and so on).
 
@@ -31,10 +37,10 @@ Find the smallest possible sub-triangle sum.
 
 # --hints--
 
-`euler150()` should return -271248680.
+`smallestSubTriangleSum()` should return `-271248680`.
 
 ```js
-assert.strictEqual(euler150(), -271248680);
+assert.strictEqual(smallestSubTriangleSum(), -271248680);
 ```
 
 # --seed--
@@ -42,12 +48,12 @@ assert.strictEqual(euler150(), -271248680);
 ## --seed-contents--
 
 ```js
-function euler150() {
+function smallestSubTriangleSum() {
 
   return true;
 }
 
-euler150();
+smallestSubTriangleSum();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md
index e75e5a0fdfe..47f785ed97b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4031000cf542c50ff16
 title: 'Problem 151: Paper sheets of standard sizes: an expected-value problem'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301782
 dashedName: problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem
 ---
@@ -16,14 +16,20 @@ He proceeds to cut it in half, thus getting two sheets of size A2. Then he cuts
 
 All the unused sheets are placed back in the envelope.
 
-At the beginning of each subsequent batch, he takes from the envelope one sheet of paper at random. If it is of size A5, he uses it. If it is larger, he repeats the 'cut-in-half' procedure until he has what he needs and any remaining sheets are always placed back in the envelope. Excluding the first and last batch of the week, find the expected number of times (during each week) that the foreman finds a single sheet of paper in the envelope. Give your answer rounded to six decimal places using the format x.xxxxxx .
+<img class="img-responsive center-block" alt="A1-size sheet split into: A2, A3, A4 and two A5 sheets" src="https://cdn.freecodecamp.org/curriculum/project-euler/paper-sheets-of-standard-sizes-an-expected-value-problem.png" style="background-color: white; padding: 10px;" />
+
+At the beginning of each subsequent batch, he takes one sheet of paper from the envelope at random. If it is of size A5, he uses it. If it is larger, he repeats the 'cut-in-half' procedure until he has what he needs, and any remaining sheets are always placed back in the envelope.
+
+Excluding the first and last batch of the week, find the expected number of times (during each week) that the foreman finds a single sheet of paper in the envelope.
+
+Give your answer rounded to six decimal places using the format `x.xxxxxx`.
 
 # --hints--
 
-`euler151()` should return 0.464399.
+`expectedValueProblem()` should return `0.464399`.
 
 ```js
-assert.strictEqual(euler151(), 0.464399);
+assert.strictEqual(expectedValueProblem(), 0.464399);
 ```
 
 # --seed--
@@ -31,12 +37,12 @@ assert.strictEqual(euler151(), 0.464399);
 ## --seed-contents--
 
 ```js
-function euler151() {
+function expectedValueProblem() {
 
   return true;
 }
 
-euler151();
+expectedValueProblem();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md
index 1acd9f0652e..c03197b781f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md
@@ -1,25 +1,29 @@
 ---
 id: 5900f4041000cf542c50ff17
 title: 'Problem 152: Writing one half as a sum of inverse squares'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301783
 dashedName: problem-152-writing-one-half-as-a-sum-of-inverse-squares
 ---
 
 # --description--
 
-There are several ways to write the number 1/2 as a sum of inverse squares using distinct integers.
+There are several ways to write the number $\frac{1}{2}$ as a sum of inverse squares using distinct integers.
 
 For instance, the numbers {2,3,4,5,7,12,15,20,28,35} can be used:
 
-In fact, only using integers between 2 and 45 inclusive, there are exactly three ways to do it, the remaining two being: {2,3,4,6,7,9,10,20,28,35,36,45} and {2,3,4,6,7,9,12,15,28,30,35,36,45}. How many ways are there to write the number 1/2 as a sum of inverse squares using distinct integers between 2 and 80 inclusive?
+$$\frac{1}{2} = \frac{1}{2^2} + \frac{1}{3^2} + \frac{1}{4^2} + \frac{1}{5^2} + \frac{1}{7^2} + \frac{1}{{12}^2} + \frac{1}{{15}^2} + \frac{1}{{20}^2} + \frac{1}{{28}^2} + \frac{1}{{35}^2}$$
+
+In fact, only using integers between 2 and 45 inclusive, there are exactly three ways to do it, the remaining two being: {2,3,4,6,7,9,10,20,28,35,36,45} and {2,3,4,6,7,9,12,15,28,30,35,36,45}.
+
+How many ways are there to write the number $\frac{1}{2}$ as a sum of inverse squares using distinct integers between 2 and 80 inclusive?
 
 # --hints--
 
-`euler152()` should return 301.
+`sumInverseSquares()` should return `301`.
 
 ```js
-assert.strictEqual(euler152(), 301);
+assert.strictEqual(sumInverseSquares(), 301);
 ```
 
 # --seed--
@@ -27,12 +31,12 @@ assert.strictEqual(euler152(), 301);
 ## --seed-contents--
 
 ```js
-function euler152() {
+function sumInverseSquares() {
 
   return true;
 }
 
-euler152();
+sumInverseSquares();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md
index b1eaa92c44b..a66c05c4f97 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md
@@ -1,53 +1,67 @@
 ---
 id: 5900f4051000cf542c50ff18
 title: 'Problem 153: Investigating Gaussian Integers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301784
 dashedName: problem-153-investigating-gaussian-integers
 ---
 
 # --description--
 
-As we all know the equation x2=-1 has no solutions for real x.
+As we all know the equation $x^2 = -1$ has no solutions for real $x$.
 
-If we however introduce the imaginary number i this equation has two solutions: x=i and x=-i.
+If we however introduce the imaginary number $i$ this equation has two solutions: $x = i$ and $x = -i$.
 
-If we go a step further the equation (x-3)2=-4 has two complex solutions: x=3+2i and x=3-2i. x=3+2i and x=3-2i are called each others' complex conjugate.
+If we go a step further the equation ${(x - 3)}^2 = -4$ has two complex solutions: $x = 3 + 2i$ and $x = 3 - 2i$, which are called each others' complex conjugate.
 
-Numbers of the form a+bi are called complex numbers.
+Numbers of the form $a + bi$ are called complex numbers.
 
-In general a+bi and a−bi are each other's complex conjugate. A Gaussian Integer is a complex number a+bi such that both a and b are integers.
+In general $a + bi$ and $a − bi$ are each other's complex conjugate. A Gaussian Integer is a complex number $a + bi$ such that both $a$ and $b$ are integers.
 
-The regular integers are also Gaussian integers (with b=0).
+The regular integers are also Gaussian integers (with $b = 0$).
 
-To distinguish them from Gaussian integers with b ≠ 0 we call such integers "rational integers."
+To distinguish them from Gaussian integers with $b ≠ 0$ we call such integers "rational integers."
 
-A Gaussian integer is called a divisor of a rational integer n if the result is also a Gaussian integer.
+A Gaussian integer is called a divisor of a rational integer $n$ if the result is also a Gaussian integer.
 
-If for example we divide 5 by 1+2i we can simplify in the following manner:
+If for example we divide 5 by $1 + 2i$ we can simplify in the following manner:
 
-Multiply numerator and denominator by the complex conjugate of 1+2i: 1−2i.
+Multiply numerator and denominator by the complex conjugate of $1 + 2i$: $1 − 2i$.
 
-The result is .
+The result is:
 
-So 1+2i is a divisor of 5.
+$$\frac{5}{1 + 2i} = \frac{5}{1 + 2i} \frac{1 - 2i}{1 - 2i} = \frac{5(1 - 2i)}{1 - {(2i)}^2} = \frac{5(1 - 2i)}{1 - (-4)} = \frac{5(1 - 2i)}{5} = 1 - 2i$$
 
-Note that 1+i is not a divisor of 5 because .
+So $1 + 2i$ is a divisor of 5.
 
-Note also that if the Gaussian Integer (a+bi) is a divisor of a rational integer n, then its complex conjugate (a−bi) is also a divisor of n. In fact, 5 has six divisors such that the real part is positive: {1, 1 + 2i, 1 − 2i, 2 + i, 2 − i, 5}.
+Note that $1 + i$ is not a divisor of 5 because:
+
+$$\frac{5}{1 + i} = \frac{5}{2} - \frac{5}{2}i$$
+
+Note also that if the Gaussian Integer ($a + bi$) is a divisor of a rational integer $n$, then its complex conjugate ($a − bi$) is also a divisor of $n$. In fact, 5 has six divisors such that the real part is positive: {1, 1 + 2i, 1 − 2i, 2 + i, 2 − i, 5}.
 
 The following is a table of all of the divisors for the first five positive rational integers:
 
-n Gaussian integer divisors with positive real partSum s(n) of these
+| n | Gaussian integer divisors with positive real part | Sum s(n) of these divisors |
+| - | ------------------------------------------------- | -------------------------- |
+| 1 | 1                                                 | 1                          |
+| 2 | 1, 1 + i, 1 - i, 2                                | 5                          |
+| 3 | 1, 3                                              | 4                          |
+| 4 | 1, 1 + i, 1 - i, 2, 2 + 2i, 2 - 2i, 4             | 13                         |
+| 5 | 1, 1 + 2i, 1 - 2i, 2 + i, 2 - i, 5                | 12                         |
 
-divisors111 21, 1+i, 1-i, 25 31, 34 41, 1+i, 1-i, 2, 2+2i, 2-2i,413 51, 1+2i, 1-2i, 2+i, 2-i, 512 For divisors with positive real parts, then, we have: . For 1 ≤ n ≤ 105, ∑ s(n)=17924657155. What is ∑ s(n) for 1 ≤ n ≤ 108?
+For divisors with positive real parts, then, we have: $\displaystyle\sum_{n=1}^5 s(n) = 35$.
+
+For $1 ≤ n ≤ {10}^5$, $\displaystyle\sum_{n = 1}^{{10}^5} s(n) = 17924657155$.
+
+What is $\displaystyle\sum_{n=1}^{{10}^8} s(n)$?
 
 # --hints--
 
-`euler153()` should return 17971254122360636.
+`sumGaussianIntegers()` should return `17971254122360636`.
 
 ```js
-assert.strictEqual(euler153(), 17971254122360636);
+assert.strictEqual(sumGaussianIntegers(), 17971254122360636);
 ```
 
 # --seed--
@@ -55,12 +69,12 @@ assert.strictEqual(euler153(), 17971254122360636);
 ## --seed-contents--
 
 ```js
-function euler153() {
+function sumGaussianIntegers() {
 
   return true;
 }
 
-euler153();
+sumGaussianIntegers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md
index 8d8abe0dfcd..40533ba38f8 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4071000cf542c50ff19
 title: 'Problem 154: Exploring Pascal''s pyramid'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301785
 dashedName: problem-154-exploring-pascals-pyramid
 ---
@@ -10,14 +10,20 @@ dashedName: problem-154-exploring-pascals-pyramid
 
 A triangular pyramid is constructed using spherical balls so that each ball rests on exactly three balls of the next lower level.
 
-Then, we calculate the number of paths leading from the apex to each position: A path starts at the apex and progresses downwards to any of the three spheres directly below the current position. Consequently, the number of paths to reach a certain position is the sum of the numbers immediately above it (depending on the position, there are up to three numbers above it). The result is Pascal's pyramid and the numbers at each level n are the coefficients of the trinomial expansion (x + y + z)n. How many coefficients in the expansion of (x + y + z)200000 are multiples of 1012?
+<img class="img-responsive center-block" alt="triangular pyramid constructed using spherical balls with four levels" src="https://cdn.freecodecamp.org/curriculum/project-euler/exploring-pascals-pyramid.png" style="background-color: white; padding: 10px;" />
+
+Then, we calculate the number of paths leading from the apex to each position: A path starts at the apex and progresses downwards to any of the three spheres directly below the current position. Consequently, the number of paths to reach a certain position is the sum of the numbers immediately above it (depending on the position, there are up to three numbers above it).
+
+The result is Pascal's pyramid and the numbers at each level n are the coefficients of the trinomial expansion ${(x + y + z)}^n$.
+
+How many coefficients in the expansion of ${(x + y + z)}^{200000}$ are multiples of ${10}^{12}$?
 
 # --hints--
 
-`euler154()` should return 479742450.
+`pascalsPyramid()` should return `479742450`.
 
 ```js
-assert.strictEqual(euler154(), 479742450);
+assert.strictEqual(pascalsPyramid(), 479742450);
 ```
 
 # --seed--
@@ -25,12 +31,12 @@ assert.strictEqual(euler154(), 479742450);
 ## --seed-contents--
 
 ```js
-function euler154() {
+function pascalsPyramid() {
 
   return true;
 }
 
-euler154();
+pascalsPyramid();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md
index 404c223c6a4..ee1b1f97d9b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4081000cf542c50ff1a
 title: 'Problem 155: Counting Capacitor Circuits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301786
 dashedName: problem-155-counting-capacitor-circuits
 ---
@@ -10,18 +10,24 @@ dashedName: problem-155-counting-capacitor-circuits
 
 An electric circuit uses exclusively identical capacitors of the same value C.
 
-The capacitors can be connected in series or in parallel to form sub-units, which can then be connected in series or in parallel with other capacitors or other sub-units to form larger sub-units, and so on up to a final circuit. Using this simple procedure and up to n identical capacitors, we can make circuits having a range of different total capacitances. For example, using up to n=3 capacitors of 60 F each, we can obtain the following 7 distinct total capacitance values:
+The capacitors can be connected in series or in parallel to form sub-units, which can then be connected in series or in parallel with other capacitors or other sub-units to form larger sub-units, and so on up to a final circuit.
 
-If we denote by D(n) the number of distinct total capacitance values we can obtain when using up to n equal-valued capacitors and the simple procedure described above, we have: D(1)=1, D(2)=3, D(3)=7 ... Find D(18). Reminder : When connecting capacitors C1, C2 etc in parallel, the total capacitance is CT = C1 + C2 +...,
+Using this simple procedure and up to n identical capacitors, we can make circuits having a range of different total capacitances. For example, using up to $n = 3$ capacitors of $60 μF$ each, we can obtain the following 7 distinct total capacitance values:
 
-whereas when connecting them in series, the overall capacitance is given by:
+<img class="img-responsive center-block" alt="example circuits having up to three capacitors, each of 60 μF" src="https://cdn.freecodecamp.org/curriculum/project-euler/counting-capacitor-circuits.gif" style="background-color: white; padding: 10px;" />
+
+If we denote by $D(n)$ the number of distinct total capacitance values we can obtain when using up to $n$ equal-valued capacitors and the simple procedure described above, we have: $D(1) = 1, D(2) = 3, D(3)=7, \ldots$
+
+Find $D(18)$.
+
+Reminder: When connecting capacitors $C_1$, $C_2$ etc in parallel, the total capacitance is $C_T = C_1 + C_2 + \cdots$, whereas when connecting them in series, the overall capacitance is given by: $\frac{1}{C_T} = \frac{1}{C_1} + \frac{1}{C_2} + \cdots$.
 
 # --hints--
 
-`euler155()` should return 3857447.
+`capacitanceValues()` should return `3857447`.
 
 ```js
-assert.strictEqual(euler155(), 3857447);
+assert.strictEqual(capacitanceValues(), 3857447);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler155(), 3857447);
 ## --seed-contents--
 
 ```js
-function euler155() {
+function capacitanceValues() {
 
   return true;
 }
 
-euler155();
+capacitanceValues();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-156-counting-digits.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-156-counting-digits.md
index 3ab75c957bc..fb820e64aa0 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-156-counting-digits.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-156-counting-digits.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4091000cf542c50ff1b
 title: 'Problem 156: Counting Digits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301787
 dashedName: problem-156-counting-digits
 ---
@@ -12,24 +12,40 @@ Starting from zero the natural numbers are written down in base 10 like this:
 
 0 1 2 3 4 5 6 7 8 9 10 11 12....
 
-Consider the digit d=1. After we write down each number n, we will update the number of ones that have occurred and call this number f(n,1). The first values for f(n,1), then, are as follows:
+Consider the digit $d = 1$. After we write down each number n, we will update the number of ones that have occurred and call this number $f(n, 1)$. The first values for $f(n, 1)$, then, are as follows:
 
-nf(n,1) 00 11 21 31 41 51 61 71 81 91 102 114 125
+| $n$ | $f(n, 1)$ |
+| --- | --------- |
+| 0   | 0         |
+| 1   | 1         |
+| 2   | 1         |
+| 3   | 1         |
+| 4   | 1         |
+| 5   | 1         |
+| 6   | 1         |
+| 7   | 1         |
+| 8   | 1         |
+| 9   | 1         |
+| 10  | 2         |
+| 11  | 4         |
+| 12  | 5         |
 
-Note that f(n,1) never equals 3.
+Note that $f(n, 1)$ never equals 3.
 
-So the first two solutions of the equation f(n,1)=n are n=0 and n=1. The next solution is n=199981. In the same manner the function f(n,d) gives the total number of digits d that have been written down after the number n has been written.
+So the first two solutions of the equation $f(n, 1) = n$ are $n = 0$ and $n = 1$. The next solution is $n = 199981$. In the same manner the function $f(n, d)$ gives the total number of digits d that have been written down after the number $n$ has been written.
 
-In fact, for every digit d ≠ 0, 0 is the first solution of the equation f(n,d)=n. Let s(d) be the sum of all the solutions for which f(n,d)=n.
+In fact, for every digit $d ≠ 0$, 0 is the first solution of the equation $f(n, d) = n$. Let $s(d)$ be the sum of all the solutions for which $f(n, d) = n$.
 
-You are given that s(1)=22786974071. Find ∑ s(d) for 1 ≤ d ≤ 9. Note: if, for some n, f(n,d)=n for more than one value of d this value of n is counted again for every value of d for which f(n,d)=n.
+You are given that $s(1) = 22786974071$. Find $\sum{s(d)}$ for $1 ≤ d ≤ 9$.
+
+Note: if, for some $n$, $f(n, d) = n$ for more than one value of $d$ this value of $n$ is counted again for every value of $d$ for which $f(n, d) = n$.
 
 # --hints--
 
-`euler156()` should return 21295121502550.
+`countingDigits()` should return `21295121502550`.
 
 ```js
-assert.strictEqual(euler156(), 21295121502550);
+assert.strictEqual(countingDigits(), 21295121502550);
 ```
 
 # --seed--
@@ -37,12 +53,12 @@ assert.strictEqual(euler156(), 21295121502550);
 ## --seed-contents--
 
 ```js
-function euler156() {
+function countingDigits() {
 
   return true;
 }
 
-euler156();
+countingDigits();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md
index fa1e3270516..aa5e8185547 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md
@@ -1,65 +1,30 @@
 ---
 id: 5900f4091000cf542c50ff1c
 title: 'Problem 157: Solving the diophantine equation'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301788
 dashedName: problem-157-solving-the-diophantine-equation
 ---
 
 # --description--
 
-Consider the diophantine equation 1/a+1/b= p/10n with a, b, p, n positive integers and a ≤ b.
+Consider the diophantine equation $\frac{1}{a} + \frac{1}{b} = \frac{p}{{10}^n}$ with $a$, $b$, $p$, $n$ positive integers and $a ≤ b$.
 
-For n=1 this equation has 20 solutions that are listed below:
+For $n = 1$ this equation has 20 solutions that are listed below:
 
-1/1+1/1=20/10
+$$\begin{array}{lllll} \frac{1}{1}  + \frac{1}{1}  = \frac{20}{10} & \frac{1}{1} + \frac{1}{2}  = \frac{15}{10} & \frac{1}{1}  + \frac{1}{5}  = \frac{12}{10} & \frac{1}{1} + \frac{1}{10} = \frac{11}{10} & \frac{1}{2}  + \frac{1}{2}  = \frac{10}{10} \\\\
+  \frac{1}{2}  + \frac{1}{5}  = \frac{7}{10}   & \frac{1}{2} + \frac{1}{10} = \frac{6}{10} & \frac{1}{3}  + \frac{1}{6}  = \frac{5}{10}   & \frac{1}{3} + \frac{1}{15} = \frac{4}{10} & \frac{1}{4}  + \frac{1}{4}  = \frac{5}{10} \\\\
+  \frac{1}{4}  + \frac{1}{4}  = \frac{5}{10}  & \frac{1}{5}  + \frac{1}{5}  = \frac{4}{10} & \frac{1}{5}  + \frac{1}{10} = \frac{3}{10}  & \frac{1}{6}  + \frac{1}{30} = \frac{2}{10} & \frac{1}{10} + \frac{1}{10} = \frac{2}{10} \\\\
+  \frac{1}{11} + \frac{1}{110} = \frac{1}{10} & \frac{1}{12} + \frac{1}{60}  = \frac{1}{10} & \frac{1}{14} + \frac{1}{35}  = \frac{1}{10} & \frac{1}{15} + \frac{1}{30}  = \frac{1}{10} & \frac{1}{20} + \frac{1}{20}  = \frac{1}{10} \end{array}$$
 
-1/1+1/2=15/10
-
-1/1+1/5=12/10
-
-1/1+1/10=11/10
-
-1/2+1/2=10/10
-
-1/2+1/5=7/10
-
-1/2+1/10=6/10
-
-1/3+1/6=5/10
-
-1/3+1/15=4/10
-
-1/4+1/4=5/10
-
-1/4+1/20=3/10
-
-1/5+1/5=4/10
-
-1/5+1/10=3/10
-
-1/6+1/30=2/10
-
-1/10+1/10=2/10
-
-1/11+1/110=1/10
-
-1/12+1/60=1/10
-
-1/14+1/35=1/10
-
-1/15+1/30=1/10
-
-1/20+1/20=1/10
-
-How many solutions has this equation for 1 ≤ n ≤ 9?
+How many solutions has this equation for $1 ≤ n ≤ 9$?
 
 # --hints--
 
-`euler157()` should return 53490.
+`diophantineEquation()` should return `53490`.
 
 ```js
-assert.strictEqual(euler157(), 53490);
+assert.strictEqual(diophantineEquation(), 53490);
 ```
 
 # --seed--
@@ -67,12 +32,12 @@ assert.strictEqual(euler157(), 53490);
 ## --seed-contents--
 
 ```js
-function euler157() {
+function diophantineEquation() {
 
   return true;
 }
 
-euler157();
+diophantineEquation();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md
index 6b979cb0d7f..1ec878b0e9c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md
@@ -1,8 +1,8 @@
 ---
 id: 5900f40a1000cf542c50ff1d
 title: >-
-  Problem 158: Exploring strings for which only one character comes lexicographically after its neighbour to the left
-challengeType: 5
+  Problema 158: Explorando cadenas para las que sólo un carácter viene lexicográficamente después de su vecino a la izquierda
+challengeType: 1
 forumTopicId: 301789
 dashedName: >-
   problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left
@@ -10,7 +10,7 @@ dashedName: >-
 
 # --description--
 
-Taking three different letters from the 26 letters of the alphabet, character strings of length three can be formed.
+Tomando tres letras diferentes desde las 26 letras del abecedario pueden formarse cadenas de longitud 3.
 
 Examples are 'abc', 'hat' and 'zyx'.
 
@@ -20,18 +20,18 @@ For 'hat' there is exactly one character that comes lexicographically after its
 
 In all there are 10400 strings of length 3 for which exactly one character comes lexicographically after its neighbour to the left.
 
-We now consider strings of n ≤ 26 different characters from the alphabet.
+We now consider strings of $n ≤ 26$ different characters from the alphabet.
 
-For every n, p(n) is the number of strings of length n for which exactly one character comes lexicographically after its neighbour to the left.
+For every $n$, $p(n)$ is the number of strings of length $n$ for which exactly one character comes lexicographically after its neighbour to the left.
 
-What is the maximum value of p(n)?
+What is the maximum value of $p(n)$?
 
 # --hints--
 
-`euler158()` should return 409511334375.
+`lexicographicNeighbours()` should return `409511334375`.
 
 ```js
-assert.strictEqual(euler158(), 409511334375);
+assert.strictEqual(lexicographicNeighbours(), 409511334375);
 ```
 
 # --seed--
@@ -39,12 +39,12 @@ assert.strictEqual(euler158(), 409511334375);
 ## --seed-contents--
 
 ```js
-function euler158() {
+function lexicographicNeighbours() {
 
   return true;
 }
 
-euler158();
+lexicographicNeighbours();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md
index b5e3b4945bd..07a2e4945a4 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f40c1000cf542c50ff1e
 title: 'Problem 159: Digital root sums of factorisations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301790
 dashedName: problem-159-digital-root-sums-of-factorisations
 ---
@@ -12,13 +12,32 @@ A composite number can be factored many different ways.
 
 For instance, not including multiplication by one, 24 can be factored in 7 distinct ways:
 
-24 = 2x2x2x3 24 = 2x3x4 24 = 2x2x6 24 = 4x6 24 = 3x8 24 = 2x12 24 = 24
+$$\begin{align}   & 24 = 2 \times 2 \times 2 \times 3\\\\
+  & 24 = 2 \times 3 \times 4  \\\\   & 24 = 2 \times 2 \times 6  \\\\
+  & 24 = 4 \times 6    \\\\   & 24 = 3 \times 8    \\\\
+  & 24 = 2 \times 12   \\\\ & 24 = 24 \end{align}$$
 
-Recall that the digital root of a number, in base 10, is found by adding together the digits of that number, and repeating that process until a number is arrived at that is less than 10. Thus the digital root of 467 is 8. We shall call a Digital Root Sum (DRS) the sum of the digital roots of the individual factors of our number. The chart below demonstrates all of the DRS values for 24. FactorisationDigital Root Sum2x2x2x3 92x3x4 92x2x6 104x6 103x8 112x12 524 6The maximum Digital Root Sum of 24 is 11. The function mdrs(n) gives the maximum Digital Root Sum of n. So mdrs(24)=11. Find ∑mdrs(n) for 1 &lt; n &lt; 1,000,000.
+Recall that the digital root of a number, in base 10, is found by adding together the digits of that number, and repeating that process until a number arrives at less than 10. Thus the digital root of 467 is 8.
+
+We shall call a Digital Root Sum (DRS) the sum of the digital roots of the individual factors of our number. The chart below demonstrates all of the DRS values for 24.
+
+| Factorisation | Digital Root Sum |
+| ------------- | ---------------- |
+| 2x2x2x3       | 9                |
+| 2x3x4         | 9                |
+| 2x2x6         | 10               |
+| 4x6           | 10               |
+| 3x8           | 11               |
+| 2x12          | 5                |
+| 24            | 6                |
+
+The maximum Digital Root Sum of 24 is 11. The function $mdrs(n)$ gives the maximum Digital Root Sum of $n$. So $mdrs(24) = 11$.
+
+Find $\sum{mdrs(n)}$ for $1 &lt; n &lt; 1,000,000$.
 
 # --hints--
 
-`euler159()` should return 14489159.
+`euler159()` should return `14489159`.
 
 ```js
 assert.strictEqual(euler159(), 14489159);
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md
index c7319ba84c3..6582df47355 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md
@@ -1,31 +1,28 @@
 ---
 id: 5900f40d1000cf542c50ff1f
 title: 'Problem 160: Factorial trailing digits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301794
 dashedName: problem-160-factorial-trailing-digits
 ---
 
 # --description--
 
-For any N, let f(N) be the last five digits before the trailing zeroes in N!.
+For any $N$, let $f(N)$ be the last five digits before the trailing zeroes in $N!$.
 
-For example,
+Por ejemplo,
 
-9! = 362880 so f(9)=36288
+$$\begin{align}   & 9! = 362880 \\; \text{so} \\; f(9) = 36288 \\\\
+  & 10! = 3628800 \\; \text{so} \\; f(10) = 36288 \\\\ & 20! = 2432902008176640000 \\; \text{so} \\; f(20) = 17664 \end{align}$$
 
-10! = 3628800 so f(10)=36288
-
-20! = 2432902008176640000 so f(20)=17664
-
-Find f(1,000,000,000,000)
+Find $f(1,000,000,000,000)$
 
 # --hints--
 
-`euler160()` should return 16576.
+`factorialTrailingDigits()` should return `16576`.
 
 ```js
-assert.strictEqual(euler160(), 16576);
+assert.strictEqual(factorialTrailingDigits(), 16576);
 ```
 
 # --seed--
@@ -33,12 +30,12 @@ assert.strictEqual(euler160(), 16576);
 ## --seed-contents--
 
 ```js
-function euler160() {
+function factorialTrailingDigits() {
 
   return true;
 }
 
-euler160();
+factorialTrailingDigits();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-161-triominoes.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-161-triominoes.md
index ea369bae60d..8e0a070c788 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-161-triominoes.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-161-triominoes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f40d1000cf542c50ff20
 title: 'Problem 161: Triominoes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301795
 dashedName: problem-161-triominoes
 ---
@@ -12,18 +12,24 @@ A triomino is a shape consisting of three squares joined via the edges.
 
 There are two basic forms:
 
+<img class="img-responsive center-block" alt="two basic triominoes forms" src="https://cdn.freecodecamp.org/curriculum/project-euler/triominoes-1.gif" style="background-color: white; padding: 10px;" />
+
 If all possible orientations are taken into account there are six:
 
+<img class="img-responsive center-block" alt="triominoes forms including orientation" src="https://cdn.freecodecamp.org/curriculum/project-euler/triominoes-2.gif" style="background-color: white; padding: 10px;" />
+
 Any n by m grid for which nxm is divisible by 3 can be tiled with triominoes. If we consider tilings that can be obtained by reflection or rotation from another tiling as different there are 41 ways a 2 by 9 grid can be tiled with triominoes:
 
+<img class="img-responsive center-block" alt="animation showing 41 ways of filling 2x9 grid with triominoes" src="https://cdn.freecodecamp.org/curriculum/project-euler/triominoes-3.gif" style="background-color: white; padding: 10px;" />
+
 In how many ways can a 9 by 12 grid be tiled in this way by triominoes?
 
 # --hints--
 
-`euler161()` should return 20574308184277972.
+`triominoes()` should return `20574308184277972`.
 
 ```js
-assert.strictEqual(euler161(), 20574308184277972);
+assert.strictEqual(triominoes(), 20574308184277972);
 ```
 
 # --seed--
@@ -31,12 +37,12 @@ assert.strictEqual(euler161(), 20574308184277972);
 ## --seed-contents--
 
 ```js
-function euler161() {
+function triominoes() {
 
   return true;
 }
 
-euler161();
+triominoes();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.md
index 53a6bcd7722..9ad940349fe 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f40e1000cf542c50ff21
 title: 'Problem 162: Hexadecimal numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301796
 dashedName: problem-162-hexadecimal-numbers
 ---
@@ -10,9 +10,9 @@ dashedName: problem-162-hexadecimal-numbers
 
 In the hexadecimal number system numbers are represented using 16 different digits:
 
-0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F
+$$0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F$$
 
-The hexadecimal number AF when written in the decimal number system equals 10x16+15=175.
+The hexadecimal number AF when written in the decimal number system equals $10 \times 16 + 15 = 175$.
 
 In the 3-digit hexadecimal numbers 10A, 1A0, A10, and A01 the digits 0,1 and A are all present.
 
@@ -20,16 +20,22 @@ Like numbers written in base ten we write hexadecimal numbers without leading ze
 
 How many hexadecimal numbers containing at most sixteen hexadecimal digits exist with all of the digits 0,1, and A present at least once?
 
-Give your answer as a hexadecimal number.
+Give your answer with hexadecimal number as a string.
 
-(A,B,C,D,E and F in upper case, without any leading or trailing code that marks the number as hexadecimal and without leading zeroes , e.g. 1A3F and not: 1a3f and not 0x1a3f and not $1A3F and not #1A3F and not 0000001A3F)
+**Note:** (A,B,C,D,E and F in upper case, without any leading or trailing code that marks the number as hexadecimal and without leading zeroes , e.g. 1A3F and not: 1a3f and not 0x1a3f and not $1A3F and not #1A3F and not 0000001A3F)
 
 # --hints--
 
-`euler162()` should return 3D58725572C62302.
+`hexadecimalNumbers()` should return a string.
 
 ```js
-assert.strictEqual(euler162(), '3D58725572C62302');
+assert(typeof hexadecimalNumbers() === 'string');
+```
+
+`hexadecimalNumbers()` should return the string `3D58725572C62302`.
+
+```js
+assert.strictEqual(hexadecimalNumbers(), '3D58725572C62302');
 ```
 
 # --seed--
@@ -37,12 +43,12 @@ assert.strictEqual(euler162(), '3D58725572C62302');
 ## --seed-contents--
 
 ```js
-function euler162() {
+function hexadecimalNumbers() {
 
   return true;
 }
 
-euler162();
+hexadecimalNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md
index 72ed1158b19..e5fa50fb8e9 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f40f1000cf542c50ff22
 title: 'Problem 163: Cross-hatched triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301797
 dashedName: problem-163-cross-hatched-triangles
 ---
@@ -10,14 +10,25 @@ dashedName: problem-163-cross-hatched-triangles
 
 Consider an equilateral triangle in which straight lines are drawn from each vertex to the middle of the opposite side, such as in the size 1 triangle in the sketch below.
 
-Sixteen triangles of either different shape or size or orientation or location can now be observed in that triangle. Using size 1 triangles as building blocks, larger triangles can be formed, such as the size 2 triangle in the above sketch. One-hundred and four triangles of either different shape or size or orientation or location can now be observed in that size 2 triangle. It can be observed that the size 2 triangle contains 4 size 1 triangle building blocks. A size 3 triangle would contain 9 size 1 triangle building blocks and a size n triangle would thus contain n2 size 1 triangle building blocks. If we denote T(n) as the number of triangles present in a triangle of size n, then T(1) = 16 T(2) = 104 Find T(36).
+<img class="img-responsive center-block" alt="triangles with size 1 and size 2" src="https://cdn.freecodecamp.org/curriculum/project-euler/cross-hatched-triangles.gif" style="background-color: white; padding: 10px;" />
+
+Sixteen triangles of either different shape or size or orientation or location can now be observed in that triangle. Using size 1 triangles as building blocks, larger triangles can be formed, such as the size 2 triangle in the above sketch. One-hundred and four triangles of either different shape or size or orientation or location can now be observed in that size 2 triangle.
+
+It can be observed that the size 2 triangle contains 4 size 1 triangle building blocks. A size 3 triangle would contain 9 size 1 triangle building blocks and a size $n$ triangle would thus contain $n^2$ size 1 triangle building blocks.
+
+If we denote $T(n)$ as the number of triangles present in a triangle of size $n$, then
+
+$$\begin{align}   & T(1) = 16 \\\\
+  & T(2) = 104 \end{align}$$
+
+Find $T(36)$.
 
 # --hints--
 
-`euler163()` should return 343047.
+`crossHatchedTriangles()` should return `343047`.
 
 ```js
-assert.strictEqual(euler163(), 343047);
+assert.strictEqual(crossHatchedTriangles(), 343047);
 ```
 
 # --seed--
@@ -25,12 +36,12 @@ assert.strictEqual(euler163(), 343047);
 ## --seed-contents--
 
 ```js
-function euler163() {
+function crossHatchedTriangles() {
 
   return true;
 }
 
-euler163();
+crossHatchedTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md
index 8082f00bff3..123b4513e46 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md
@@ -1,8 +1,8 @@
 ---
 id: 5900f4111000cf542c50ff23
 title: >-
-  Problem 164: Numbers for which no three consecutive digits have a sum greater than a given value
-challengeType: 5
+  Problema N° 164: Números para los que no hay tres dígitos consecutivos tienen una suma mayor que un valor dado
+challengeType: 1
 forumTopicId: 301798
 dashedName: >-
   problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value
@@ -10,14 +10,14 @@ dashedName: >-
 
 # --description--
 
-How many 20 digit numbers n (without any leading zero) exist such that no three consecutive digits of n have a sum greater than 9?
+¿Cuántos números de 20 dígitos $n$ (sin cero) existen de tal manera que no hay tres dígitos consecutivos de $n$ con una suma mayor de 9?
 
 # --hints--
 
-`euler164()` should return 378158756814587.
+`consecutiveDigitsSum()` deveria retornar `378158756814587`.
 
 ```js
-assert.strictEqual(euler164(), 378158756814587);
+assert.strictEqual(consecutiveDigitsSum(), 378158756814587);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler164(), 378158756814587);
 ## --seed-contents--
 
 ```js
-function euler164() {
+function consecutiveDigitsSum() {
 
   return true;
 }
 
-euler164();
+consecutiveDigitsSum();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-165-intersections.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-165-intersections.md
index a98373c3384..04fef3d3e53 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-165-intersections.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-165-intersections.md
@@ -1,29 +1,47 @@
 ---
 id: 5900f4111000cf542c50ff24
 title: 'Problem 165: Intersections'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301799
 dashedName: problem-165-intersections
 ---
 
 # --description--
 
-A segment is uniquely defined by its two endpoints. By considering two line segments in plane geometry there are three possibilities:
-
-the segments have zero points, one point, or infinitely many points in common.
+A segment is uniquely defined by its two endpoints. By considering two line segments in plane geometry there are three possibilities: the segments have zero points, one point, or infinitely many points in common.
 
 Moreover when two segments have exactly one point in common it might be the case that that common point is an endpoint of either one of the segments or of both. If a common point of two segments is not an endpoint of either of the segments it is an interior point of both segments.
 
-We will call a common point T of two segments L1 and L2 a true intersection point of L1 and L2 if T is the only common point of L1 and L2 and T is an interior point of both segments.
+We will call a common point $T$ of two segments $L_1$ and $L_2$ a true intersection point of $L_1$ and $L_2$ if $T$ is the only common point of $L_1$ and $L_2$ and $T$ is an interior point of both segments.
 
-Consider the three segments L1, L2, and L3: L1: (27, 44) to (12, 32) L2: (46, 53) to (17, 62) L3: (46, 70) to (22, 40) It can be verified that line segments L2 and L3 have a true intersection point. We note that as the one of the end points of L3: (22,40) lies on L1 this is not considered to be a true point of intersection. L1 and L2 have no common point. So among the three line segments, we find one true intersection point. Now let us do the same for 5000 line segments. To this end, we generate 20000 numbers using the so-called "Blum Blum Shub" pseudo-random number generator. s0 = 290797 sn+1 = sn×sn (modulo 50515093) tn = sn (modulo 500) To create each line segment, we use four consecutive numbers tn. That is, the first line segment is given by: (t1, t2) to (t3, t4) The first four numbers computed according to the above generator should be: 27, 144, 12 and 232. The first segment would thus be (27,144) to (12,232). How many distinct true intersection points are found among the 5000 line segments?
+Consider the three segments $L_1$, $L_2$, and $L_3$:
+
+$$\begin{align}   & L_1: (27, 44) \\;\text{to}\\; (12, 32) \\\\
+  & L_2: (46, 53) \\;\text{to}\\; (17, 62) \\\\   & L_3: (46, 70) \\;\text{to}\\; (22, 40) \\\\
+\end{align}$$
+
+It can be verified that line segments $L_2$ and $L_3$ have a true intersection point. We note that as the one of the end points of $L_3$: (22, 40) lies on $L_1$ this is not considered to be a true point of intersection. $L_1$ and $L_2$ have no common point. So among the three line segments, we find one true intersection point.
+
+Now let us do the same for 5000 line segments. To this end, we generate 20000 numbers using the so-called "Blum Blum Shub" pseudo-random number generator.
+
+$$\begin{align}   & s_0 = 290797 \\\\
+  & s_{n + 1} = s_n × s_n (\text{modulo}\\; 50515093) \\\\   & t_n = s_n (\text{modulo}\\; 500) \\\\
+\end{align}$$
+
+To create each line segment, we use four consecutive numbers $t_n$. That is, the first line segment is given by:
+
+($_t$1, $t_2$) to ($t_3$, $t_4$)
+
+The first four numbers computed according to the above generator should be: 27, 144, 12 and 232. The first segment would thus be (27, 144) to (12, 232).
+
+How many distinct true intersection points are found among the 5000 line segments?
 
 # --hints--
 
-`euler165()` should return 2868868.
+`distinctIntersections()` should return `2868868`.
 
 ```js
-assert.strictEqual(euler165(), 2868868);
+assert.strictEqual(distinctIntersections(), 2868868);
 ```
 
 # --seed--
@@ -31,12 +49,12 @@ assert.strictEqual(euler165(), 2868868);
 ## --seed-contents--
 
 ```js
-function euler165() {
+function distinctIntersections() {
 
   return true;
 }
 
-euler165();
+distinctIntersections();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-166-criss-cross.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-166-criss-cross.md
index 9f1db5cea49..f413a225835 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-166-criss-cross.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-166-criss-cross.md
@@ -1,29 +1,31 @@
 ---
 id: 5900f4131000cf542c50ff25
 title: 'Problem 166: Criss Cross'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301800
 dashedName: problem-166-criss-cross
 ---
 
 # --description--
 
-A 4x4 grid is filled with digits d, 0 ≤ d ≤ 9.
+A 4x4 grid is filled with digits $d$, $0 ≤ d ≤ 9$.
 
 It can be seen that in the grid
 
-6 3 3 0 5 0 4 3 0 7 1 4 1 2 4 5
+$$\begin{array}{}   6 & 3 & 3 & 0 \\\\
+  5 & 0 & 4 & 3 \\\\   0 & 7 & 1 & 4 \\\\
+  1 & 2 & 4 & 5 \end{array}$$
 
 the sum of each row and each column has the value 12. Moreover the sum of each diagonal is also 12.
 
-In how many ways can you fill a 4x4 grid with the digits d, 0 ≤ d ≤ 9 so that each row, each column, and both diagonals have the same sum?
+In how many ways can you fill a 4x4 grid with the digits $d$, $0 ≤ d ≤ 9$ so that each row, each column, and both diagonals have the same sum?
 
 # --hints--
 
-`euler166()` should return 7130034.
+`crissCross()` should return `7130034`.
 
 ```js
-assert.strictEqual(euler166(), 7130034);
+assert.strictEqual(crissCross(), 7130034);
 ```
 
 # --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler166(), 7130034);
 ## --seed-contents--
 
 ```js
-function euler166() {
+function crissCross() {
 
   return true;
 }
 
-euler166();
+crissCross();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.md
index 6f30b4b2729..37f3fd53c28 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.md
@@ -1,31 +1,29 @@
 ---
 id: 5900f4141000cf542c50ff26
 title: 'Problem 167: Investigating Ulam sequences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301801
 dashedName: problem-167-investigating-ulam-sequences
 ---
 
 # --description--
 
-For two positive integers a and b, the Ulam sequence U(a,b) is defined by U(a,b)1 = a, U(a,b)2 = b and for k > 2,
+For two positive integers $a$ and $b$, the Ulam sequence $U(a,b)$ is defined by ${U{(a,b)}\_1} = a$, ${U{(a,b)}\_2} = b$ and for $k > 2$, ${U{(a,b)}\_k}$ is the smallest integer greater than ${U{(a,b)}\_{(k-1)}}$ which can be written in exactly one way as the sum of two distinct previous members of $U(a,b)$.
 
-U(a,b)k is the smallest integer greater than U(a,b)(k-1) which can be written in exactly one way as the sum of two distinct previous members of U(a,b).
+For example, the sequence $U(1,2)$ begins with
 
-For example, the sequence U(1,2) begins with
+$$1, 2, 3 = 1 + 2, 4 = 1 + 3, 6 = 2 + 4, 8 = 2 + 6, 11 = 3 + 8$$
 
-1, 2, 3 = 1 + 2, 4 = 1 + 3, 6 = 2 + 4, 8 = 2 + 6, 11 = 3 + 8;
+5 does not belong to it because $5 = 1 + 4 = 2 + 3$ has two representations as the sum of two previous members, likewise $7 = 1 + 6 = 3 + 4$.
 
-5 does not belong to it because 5 = 1 + 4 = 2 + 3 has two representations as the sum of two previous members, likewise 7 = 1 + 6 = 3 + 4.
-
-Find ∑U(2,2n+1)k for 2 ≤ n ≤10, where k = 1011.
+Find $\sum {U(2, 2n + 1)_k}$ for $2 ≤ n ≤ 10$, where $k = {10}^{11}$.
 
 # --hints--
 
-`euler167()` should return 3916160068885.
+`ulamSequences()` should return `3916160068885`.
 
 ```js
-assert.strictEqual(euler167(), 3916160068885);
+assert.strictEqual(ulamSequences(), 3916160068885);
 ```
 
 # --seed--
@@ -33,12 +31,12 @@ assert.strictEqual(euler167(), 3916160068885);
 ## --seed-contents--
 
 ```js
-function euler167() {
+function ulamSequences() {
 
   return true;
 }
 
-euler167();
+ulamSequences();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-168-number-rotations.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-168-number-rotations.md
index 9ad5f78e64d..50802415375 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-168-number-rotations.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-168-number-rotations.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4151000cf542c50ff27
 title: 'Problem 168: Number Rotations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301802
 dashedName: problem-168-number-rotations
 ---
@@ -10,18 +10,24 @@ dashedName: problem-168-number-rotations
 
 Consider the number 142857. We can right-rotate this number by moving the last digit (7) to the front of it, giving us 714285.
 
-It can be verified that 714285=5×142857.
+It can be verified that $714285 = 5 × 142857$.
 
 This demonstrates an unusual property of 142857: it is a divisor of its right-rotation.
 
-Find the last 5 digits of the sum of all integers n, 10 &lt; n &lt; 10100, that have this property.
+For integer number of digits $a$ and $b$, find the last 5 digits of the sum of all integers $n$, $10^a &lt; n &lt; 10^b$, that have this property.
 
 # --hints--
 
-`euler168()` should return 59206.
+`numberRotations(2, 10)` should return `98311`.
 
 ```js
-assert.strictEqual(euler168(), 59206);
+assert.strictEqual(numberRotations(2, 10), 98311);
+```
+
+`numberRotations(2, 100)` should return `59206`.
+
+```js
+assert.strictEqual(numberRotations(2, 100), 59206);
 ```
 
 # --seed--
@@ -29,16 +35,48 @@ assert.strictEqual(euler168(), 59206);
 ## --seed-contents--
 
 ```js
-function euler168() {
+function numberRotations(a, b) {
 
-  return true;
+  return 0;
 }
 
-euler168();
+numberRotations();
 ```
 
 # --solutions--
 
 ```js
-// solution required
+function numberRotations(minDigits, maxDigits) {
+  const DIGITS_TO_KEEP = 100000n;
+  const powersOfTen = Array(maxDigits).fill(0);
+  powersOfTen[0] = 1n;
+  for (let i = 1; i < maxDigits; i++) {
+    powersOfTen[i] = powersOfTen[i - 1] * 10n;
+  }
+
+  // We want numbers of the form xd * m = dx
+  // Or more precisely:
+  //   (x * 10 + d) * m = d*10^(n-1) + x
+  // Solving for x:
+  //   x = d (10^(n-1) - m) / (10 * m - 1)
+  let total = 0n;
+  for (let numDigits = minDigits; numDigits <= maxDigits; numDigits++) {
+    // Check all multiplier - digit pairs to see if a candidate can be built
+    //  with the correct number of digits
+    for (let multiplier = 1n; multiplier < 10n; multiplier++) {
+      for (let lastDigit = 1n; lastDigit < 10n; lastDigit++) {
+        const numerator   = lastDigit * (powersOfTen[numDigits - 1] - multiplier);
+        const denominator = (powersOfTen[1] * multiplier - 1n);
+        if (numerator % denominator === 0n) {
+          const candidate = (numerator / denominator) * 10n + lastDigit;
+          if (candidate.toString().length === numDigits) {
+            total = (total + candidate) % DIGITS_TO_KEEP;
+          }
+        }
+      }
+    }
+  }
+
+  return parseInt(total);
+}
 ```
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
index e0bf8ea804d..52005157a98 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
@@ -2,7 +2,7 @@
 id: 5900f4151000cf542c50ff28
 title: >-
   Problem 169: Exploring the number of different ways a number can be expressed as a sum of powers of 2
-challengeType: 5
+challengeType: 1
 forumTopicId: 301803
 dashedName: >-
   problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2
@@ -10,26 +10,22 @@ dashedName: >-
 
 # --description--
 
-Define f(0)=1 and f(n) to be the number of different ways n can be expressed as a sum of integer powers of 2 using each power no more than twice.
+Define $f(0)=1$ and $f(n)$ to be the number of different ways $n$ can be expressed as a sum of integer powers of 2 using each power no more than twice.
 
-For example, f(10)=5 since there are five different ways to express 10:
+For example, $f(10)=5$ since there are five different ways to express 10:
 
-1 + 1 + 8
+$$\begin{align}   & 1 + 1 + 8 \\\\
+  & 1 + 1 + 4 + 4 \\\\   & 1 + 1 + 2 + 2 + 4 \\\\
+  & 2 + 4 + 4 \\\\ & 2 + 8 \end{align}$$
 
-1 + 1 + 4 + 41 + 1 + 2 + 2 + 4
-
-2 + 4 + 4
-
-2 + 8
-
-What is f(1025)?
+What is $f({10}^{25})$?
 
 # --hints--
 
-`euler169()` should return 178653872807.
+`numberOfWaysToExpress()` should return `178653872807`.
 
 ```js
-assert.strictEqual(euler169(), 178653872807);
+assert.strictEqual(numberOfWaysToExpress(), 178653872807);
 ```
 
 # --seed--
@@ -37,12 +33,12 @@ assert.strictEqual(euler169(), 178653872807);
 ## --seed-contents--
 
 ```js
-function euler169() {
+function numberOfWaysToExpress() {
 
   return true;
 }
 
-euler169();
+numberOfWaysToExpress();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md
index 7a7e20558b5..b6886e18764 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md
@@ -2,7 +2,7 @@
 id: 5900f4161000cf542c50ff29
 title: >-
   Problem 170: Find the largest 0 to 9 pandigital that can be formed by concatenating products
-challengeType: 5
+challengeType: 1
 forumTopicId: 301805
 dashedName: >-
   problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products
@@ -12,9 +12,10 @@ dashedName: >-
 
 Take the number 6 and multiply it by each of 1273 and 9854:
 
-6 × 1273 = 7638 6 × 9854 = 59124
+$$\begin{align}   & 6 × 1273 = 7638 \\\\
+  & 6 × 9854 = 59124 \\\\ \end{align}$$
 
-By concatenating these products we get the 1 to 9 pandigital 763859124. We will call 763859124 the "concatenated product of 6 and (1273,9854)". Notice too, that the concatenation of the input numbers, 612739854, is also 1 to 9 pandigital.
+By concatenating these products we get the 1 to 9 pandigital 763859124. We will call 763859124 the "concatenated product of 6 and (1273, 9854)". Notice too, that the concatenation of the input numbers, 612739854, is also 1 to 9 pandigital.
 
 The same can be done for 0 to 9 pandigital numbers.
 
@@ -22,10 +23,10 @@ What is the largest 0 to 9 pandigital 10-digit concatenated product of an intege
 
 # --hints--
 
-`euler170()` should return 9857164023.
+`largestPandigital()` should return `9857164023`.
 
 ```js
-assert.strictEqual(euler170(), 9857164023);
+assert.strictEqual(largestPandigital(), 9857164023);
 ```
 
 # --seed--
@@ -33,12 +34,12 @@ assert.strictEqual(euler170(), 9857164023);
 ## --seed-contents--
 
 ```js
-function euler170() {
+function largestPandigital() {
 
   return true;
 }
 
-euler170();
+largestPandigital();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md
index 2b355e111f4..60133bf2e51 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md
@@ -2,7 +2,7 @@
 id: 5900f4181000cf542c50ff2a
 title: >-
   Problem 171: Finding numbers for which the sum of the squares of the digits is a square
-challengeType: 5
+challengeType: 1
 forumTopicId: 301806
 dashedName: >-
   problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square
@@ -10,22 +10,20 @@ dashedName: >-
 
 # --description--
 
-For a positive integer n, let f(n) be the sum of the squares of the digits (in base 10) of n, e.g.
+For a positive integer $n$, let $f(n)$ be the sum of the squares of the digits (in base 10) of $n$, e.g.
 
-f(3) = 32 = 9,
+$$\begin{align}   & f(3) = 3^2 = 9 \\\\
+  & f(25) = 2^2 + 5^2 = 4 + 25 = 29 \\\\   & f(442) = 4^2 + 4^2 + 2^2 = 16 + 16 + 4 = 36 \\\\
+\end{align}$$
 
-f(25) = 22 + 52 = 4 + 25 = 29,
-
-f(442) = 42 + 42 + 22 = 16 + 16 + 4 = 36
-
-Find the last nine digits of the sum of all n, 0 &lt; n &lt; 1020, such that f(n) is a perfect square.
+Find the last nine digits of the sum of all $n$, $0 &lt; n &lt; {10}^{20}$, such that $f(n)$ is a perfect square.
 
 # --hints--
 
-`euler171()` should return 142989277.
+`lastDigitsSumOfPerfectSquare()` should return `142989277`.
 
 ```js
-assert.strictEqual(euler171(), 142989277);
+assert.strictEqual(lastDigitsSumOfPerfectSquare(), 142989277);
 ```
 
 # --seed--
@@ -33,12 +31,12 @@ assert.strictEqual(euler171(), 142989277);
 ## --seed-contents--
 
 ```js
-function euler171() {
+function lastDigitsSumOfPerfectSquare() {
 
   return true;
 }
 
-euler171();
+lastDigitsSumOfPerfectSquare();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.md
index a25ab3224fd..cfc75b9ff19 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.md
@@ -1,21 +1,21 @@
 ---
 id: 5900f4181000cf542c50ff2b
 title: 'Problem 172: Investigating numbers with few repeated digits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301807
 dashedName: problem-172-investigating-numbers-with-few-repeated-digits
 ---
 
 # --description--
 
-How many 18-digit numbers n (without leading zeros) are there such that no digit occurs more than three times in n?
+How many 18-digit numbers $n$ (without leading zeros) are there such that no digit occurs more than three times in $n$?
 
 # --hints--
 
-`euler172()` should return 227485267000992000.
+`numbersWithRepeatedDigits()` should return `227485267000992000`.
 
 ```js
-assert.strictEqual(euler172(), 227485267000992000);
+assert.strictEqual(numbersWithRepeatedDigits(), 227485267000992000);
 ```
 
 # --seed--
@@ -23,12 +23,12 @@ assert.strictEqual(euler172(), 227485267000992000);
 ## --seed-contents--
 
 ```js
-function euler172() {
+function numbersWithRepeatedDigits() {
 
   return true;
 }
 
-euler172();
+numbersWithRepeatedDigits();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md
index 700b710e805..0488d662943 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md
@@ -2,7 +2,7 @@
 id: 5900f41a1000cf542c50ff2c
 title: >-
   Problem 173: Using up to one million tiles how many different "hollow" square laminae can be formed?
-challengeType: 5
+challengeType: 1
 forumTopicId: 301808
 dashedName: >-
   problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed
@@ -12,14 +12,16 @@ dashedName: >-
 
 We shall define a square lamina to be a square outline with a square "hole" so that the shape possesses vertical and horizontal symmetry. For example, using exactly thirty-two square tiles we can form two different square laminae:
 
+<img class="img-responsive center-block" alt="two square lamina with holes 2x2 and 7x7" src="https://cdn.freecodecamp.org/curriculum/project-euler/using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.gif" style="background-color: white; padding: 10px;" />
+
 With one-hundred tiles, and not necessarily using all of the tiles at one time, it is possible to form forty-one different square laminae. Using up to one million tiles how many different square laminae can be formed?
 
 # --hints--
 
-`euler173()` should return 1572729.
+`differentHollowSquareLaminae()` should return `1572729`.
 
 ```js
-assert.strictEqual(euler173(), 1572729);
+assert.strictEqual(differentHollowSquareLaminae(), 1572729);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler173(), 1572729);
 ## --seed-contents--
 
 ```js
-function euler173() {
+function differentHollowSquareLaminae() {
 
   return true;
 }
 
-euler173();
+differentHollowSquareLaminae();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md
index 13277919381..48843b6b0a9 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md
@@ -2,7 +2,7 @@
 id: 5900f41a1000cf542c50ff2d
 title: >-
   Problem 174: Counting the number of "hollow" square laminae that can form one, two, three, ... distinct arrangements
-challengeType: 5
+challengeType: 1
 forumTopicId: 301809
 dashedName: >-
   problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-----distinct-arrangements
@@ -14,14 +14,20 @@ We shall define a square lamina to be a square outline with a square "hole" so t
 
 Given eight tiles it is possible to form a lamina in only one way: 3x3 square with a 1x1 hole in the middle. However, using thirty-two tiles it is possible to form two distinct laminae.
 
-If t represents the number of tiles used, we shall say that t = 8 is type L(1) and t = 32 is type L(2). Let N(n) be the number of t ≤ 1000000 such that t is type L(n); for example, N(15) = 832. What is ∑ N(n) for 1 ≤ n ≤ 10?
+<img class="img-responsive center-block" alt="two square lamina with holes 2x2 and 7x7" src="https://cdn.freecodecamp.org/curriculum/project-euler/using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.gif" style="background-color: white; padding: 10px;" />
+
+If $t$ represents the number of tiles used, we shall say that $t = 8$ is type $L(1)$ and $t = 32$ is type $L(2)$.
+
+Let $N(n)$ be the number of $t ≤ 1000000$ such that $t$ is type $L(n)$; for example, $N(15) = 832$.
+
+What is $\sum N(n)$ for $1 ≤ n ≤ 10$?
 
 # --hints--
 
-`euler174()` should return 209566.
+`hollowSquareLaminaeDistinctArrangements()` should return `209566`.
 
 ```js
-assert.strictEqual(euler174(), 209566);
+assert.strictEqual(hollowSquareLaminaeDistinctArrangements(), 209566);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler174(), 209566);
 ## --seed-contents--
 
 ```js
-function euler174() {
+function hollowSquareLaminaeDistinctArrangements() {
 
   return true;
 }
 
-euler174();
+hollowSquareLaminaeDistinctArrangements();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
index cd3abbf807a..b3419c34823 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
@@ -2,7 +2,7 @@
 id: 5900f41c1000cf542c50ff2e
 title: >-
   Problem 175: Fractions involving the number of different ways a number can be expressed as a sum of powers of 2
-challengeType: 5
+challengeType: 1
 forumTopicId: 301810
 dashedName: >-
   problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2
@@ -10,18 +10,36 @@ dashedName: >-
 
 # --description--
 
-Define f(0)=1 and f(n) to be the number of ways to write n as a sum of powers of 2 where no power occurs more than twice.
+Define $f(0) = 1$ and $f(n)$ to be the number of ways to write $n$ as a sum of powers of 2 where no power occurs more than twice.
 
-For example, f(10)=5 since there are five different ways to express 10:10 = 8+2 = 8+1+1 = 4+4+2 = 4+2+2+1+1 = 4+4+1+1
+For example, $f(10) = 5$ since there are five different ways to express 10:
 
-It can be shown that for every fraction p/q (p>0, q>0) there exists at least one integer n such that f(n)/f(n-1)=p/q. For instance, the smallest n for which f(n)/f(n-1)=13/17 is 241. The binary expansion of 241 is 11110001. Reading this binary number from the most significant bit to the least significant bit there are 4 one's, 3 zeroes and 1 one. We shall call the string 4,3,1 the Shortened Binary Expansion of 241. Find the Shortened Binary Expansion of the smallest n for which f(n)/f(n-1)=123456789/987654321. Give your answer as comma separated integers, without any whitespaces.
+$$10 = 8 + 2 = 8 + 1 + 1 = 4 + 4 + 2 = 4 + 2 + 2 + 1 + 1 = 4 + 4 + 1 + 1$$
+
+It can be shown that for every fraction $\frac{p}{q}\\; (p>0, q>0)$ there exists at least one integer $n$ such that $\frac{f(n)}{f(n - 1)} = \frac{p}{q}$.
+
+For instance, the smallest $n$ for which $\frac{f(n)}{f(n - 1)} = \frac{13}{17}$ is 241. The binary expansion of 241 is 11110001.
+
+Reading this binary number from the most significant bit to the least significant bit there are 4 one's, 3 zeroes and 1 one. We shall call the string 4,3,1 the Shortened Binary Expansion of 241.
+
+Find the Shortened Binary Expansion of the smallest $n$ for which
+
+$$\frac{f(n)}{f(n - 1)} = \frac{123456789}{987654321}$$
+
+Give your answer as a string with comma separated integers, without any whitespaces.
 
 # --hints--
 
-`euler175()` should return 1, 13717420, 8.
+`shortenedBinaryExpansionOfNumber()` should return a string.
 
 ```js
-assert.strictEqual(euler175(), 1, 13717420, 8);
+assert(typeof shortenedBinaryExpansionOfNumber() === 'string');
+```
+
+`shortenedBinaryExpansionOfNumber()` should return the string `1,13717420,8`.
+
+```js
+assert.strictEqual(shortenedBinaryExpansionOfNumber(), '1,13717420,8');
 ```
 
 # --seed--
@@ -29,12 +47,12 @@ assert.strictEqual(euler175(), 1, 13717420, 8);
 ## --seed-contents--
 
 ```js
-function euler175() {
+function shortenedBinaryExpansionOfNumber() {
 
   return true;
 }
 
-euler175();
+shortenedBinaryExpansionOfNumber();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.md
index c3b6c090fed..01056496296 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f41c1000cf542c50ff2f
 title: 'Problem 176: Right-angled triangles that share a cathetus'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301811
 dashedName: problem-176-right-angled-triangles-that-share-a-cathetus
 ---
@@ -14,10 +14,10 @@ Find the smallest integer that can be the length of a cathetus of exactly 47547
 
 # --hints--
 
-`euler176()` should return 96818198400000.
+`trianglesSharingCathetus()` should return `96818198400000`.
 
 ```js
-assert.strictEqual(euler176(), 96818198400000);
+assert.strictEqual(trianglesSharingCathetus(), 96818198400000);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler176(), 96818198400000);
 ## --seed-contents--
 
 ```js
-function euler176() {
+function trianglesSharingCathetus() {
 
   return true;
 }
 
-euler176();
+trianglesSharingCathetus();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md
index 2e391146546..c6f7b8ee5c4 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f41e1000cf542c50ff30
 title: 'Problem 177: Integer angled Quadrilaterals'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301812
 dashedName: problem-177-integer-angled-quadrilaterals
 ---
@@ -10,14 +10,22 @@ dashedName: problem-177-integer-angled-quadrilaterals
 
 Let ABCD be a convex quadrilateral, with diagonals AC and BD. At each vertex the diagonal makes an angle with each of the two sides, creating eight corner angles.
 
-For example, at vertex A, the two angles are CAD, CAB. We call such a quadrilateral for which all eight corner angles have integer values when measured in degrees an "integer angled quadrilateral". An example of an integer angled quadrilateral is a square, where all eight corner angles are 45°. Another example is given by DAC = 20°, BAC = 60°, ABD = 50°, CBD = 30°, BCA = 40°, DCA = 30°, CDB = 80°, ADB = 50°. What is the total number of non-similar integer angled quadrilaterals? Note: In your calculations you may assume that a calculated angle is integral if it is within a tolerance of 10-9 of an integer value.
+<img class="img-responsive center-block" alt="convex quadrilateral ABCD, with diagonals AC and BD" src="https://cdn.freecodecamp.org/curriculum/project-euler/integer-angled-quadrilaterals.gif" style="background-color: white; padding: 10px;" />
+
+For example, at vertex A, the two angles are CAD, CAB.
+
+We call such a quadrilateral for which all eight corner angles have integer values when measured in degrees an "integer angled quadrilateral". An example of an integer angled quadrilateral is a square, where all eight corner angles are 45°. Another example is given by DAC = 20°, BAC = 60°, ABD = 50°, CBD = 30°, BCA = 40°, DCA = 30°, CDB = 80°, ADB = 50°.
+
+What is the total number of non-similar integer angled quadrilaterals?
+
+**Note:** In your calculations you may assume that a calculated angle is integral if it is within a tolerance of ${10}^{-9}$ of an integer value.
 
 # --hints--
 
-`euler177()` should return 129325.
+`integerAngledQuadrilaterals()` should return `129325`.
 
 ```js
-assert.strictEqual(euler177(), 129325);
+assert.strictEqual(integerAngledQuadrilaterals(), 129325);
 ```
 
 # --seed--
@@ -25,12 +33,12 @@ assert.strictEqual(euler177(), 129325);
 ## --seed-contents--
 
 ```js
-function euler177() {
+function integerAngledQuadrilaterals() {
 
   return true;
 }
 
-euler177();
+integerAngledQuadrilaterals();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-178-step-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-178-step-numbers.md
index 12bad9c5ada..22f44139de6 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-178-step-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-178-step-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f41e1000cf542c50ff31
 title: 'Problem 178: Step Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301813
 dashedName: problem-178-step-numbers
 ---
@@ -16,14 +16,14 @@ A number for which every pair of consecutive digits has a difference of one is c
 
 A pandigital number contains every decimal digit from 0 to 9 at least once.
 
-How many pandigital step numbers less than 1040 are there?
+How many pandigital step numbers less than ${10}^{40}$ are there?
 
 # --hints--
 
-`euler178()` should return 126461847755.
+`stepNumbers()` should return `126461847755`.
 
 ```js
-assert.strictEqual(euler178(), 126461847755);
+assert.strictEqual(stepNumbers(), 126461847755);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler178(), 126461847755);
 ## --seed-contents--
 
 ```js
-function euler178() {
+function stepNumbers() {
 
   return true;
 }
 
-euler178();
+stepNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md
index 1811def962b..a159a7af8f6 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md
@@ -1,21 +1,21 @@
 ---
 id: 5900f41f1000cf542c50ff32
 title: 'Problem 179: Consecutive positive divisors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301814
 dashedName: problem-179-consecutive-positive-divisors
 ---
 
 # --description--
 
-Find the number of integers 1 &lt; n &lt; 107, for which n and n + 1 have the same number of positive divisors. For example, 14 has the positive divisors 1, 2, 7, 14 while 15 has 1, 3, 5, 15.
+Find the number of integers $1 &lt; n &lt; {10}^7$, for which $n$ and $n + 1$ have the same number of positive divisors. For example, 14 has the positive divisors 1, 2, 7, 14 while 15 has 1, 3, 5, 15.
 
 # --hints--
 
-`euler179()` should return 986262.
+`consecutivePositiveDivisors()` should return `986262`.
 
 ```js
-assert.strictEqual(euler179(), 986262);
+assert.strictEqual(consecutivePositiveDivisors(), 986262);
 ```
 
 # --seed--
@@ -23,12 +23,12 @@ assert.strictEqual(euler179(), 986262);
 ## --seed-contents--
 
 ```js
-function euler179() {
+function consecutivePositiveDivisors() {
 
   return true;
 }
 
-euler179();
+consecutivePositiveDivisors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.md
index 3b46677319d..9eed96d38b2 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.md
@@ -1,37 +1,36 @@
 ---
 id: 5900f4201000cf542c50ff33
 title: 'Problem 180: Rational zeros of a function of three variables'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301816
 dashedName: problem-180-rational-zeros-of-a-function-of-three-variables
 ---
 
 # --description--
 
-For any integer n, consider the three functions
+For any integer $n$, consider the three functions
 
-f1,n(x,y,z) = xn+1 + yn+1 − zn+1f2,n(x,y,z) = (xy + yz + zx)\*(xn-1 + yn-1 − zn-1)f3,n(x,y,z) = xyz\*(xn-2 + yn-2 − zn-2)
+$$\begin{align}   & f_{1,n}(x,y,z) = x^{n + 1} + y^{n + 1} − z^{n + 1}\\\\
+  & f_{2,n}(x,y,z) = (xy + yz + zx) \times (x^{n - 1} + y^{n - 1} − z^{n - 1})\\\\ & f_{3,n}(x,y,z) = xyz \times (x^{n - 2} + y^{n - 2} − z^{n - 2}) \end{align}$$
 
 and their combination
 
-fn(x,y,z) = f1,n(x,y,z) + f2,n(x,y,z) − f3,n(x,y,z)
+$$\begin{align} & f_n(x,y,z) = f_{1,n}(x,y,z) + f_{2,n}(x,y,z) − f_{3,n}(x,y,z) \end{align}$$
 
-We call (x,y,z) a golden triple of order k if x, y, and z are all rational numbers of the form a / b with
+We call $(x,y,z)$ a golden triple of order $k$ if $x$, $y$, and $z$ are all rational numbers of the form $\frac{a}{b}$ with $0 &lt; a &lt; b ≤ k$ and there is (at least) one integer $n$, so that $f_n(x,y,z) = 0$.
 
-0 &lt; a &lt; b ≤ k and there is (at least) one integer n, so that fn(x,y,z) = 0.
+Let $s(x,y,z) = x + y + z$.
 
-Let s(x,y,z) = x + y + z.
+Let $t = \frac{u}{v}$ be the sum of all distinct $s(x,y,z)$ for all golden triples $(x,y,z)$ of order 35. All the $s(x,y,z)$ and $t$ must be in reduced form.
 
-Let t = u / v be the sum of all distinct s(x,y,z) for all golden triples (x,y,z) of order 35. All the s(x,y,z) and t must be in reduced form.
-
-Find u + v.
+Find $u + v$.
 
 # --hints--
 
-`euler180()` should return 285196020571078980.
+`rationalZeros()` should return `285196020571078980`.
 
 ```js
-assert.strictEqual(euler180(), 285196020571078980);
+assert.strictEqual(rationalZeros(), 285196020571078980);
 ```
 
 # --seed--
@@ -39,12 +38,12 @@ assert.strictEqual(euler180(), 285196020571078980);
 ## --seed-contents--
 
 ```js
-function euler180() {
+function rationalZeros() {
 
   return true;
 }
 
-euler180();
+rationalZeros();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md
index 1aa8a4d0875..f98d3a71b9e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md
@@ -2,7 +2,7 @@
 id: 5900f4231000cf542c50ff34
 title: >-
   Problem 181: Investigating in how many ways objects of two different colours can be grouped
-challengeType: 5
+challengeType: 1
 forumTopicId: 301817
 dashedName: >-
   problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped
@@ -10,20 +10,18 @@ dashedName: >-
 
 # --description--
 
-Having three black objects B and one white object W they can be grouped in 7 ways like this:
+Having three black objects $B$ and one white object $W$ they can be grouped in 7 ways like this:
 
-(BBBW)(B,BBW)(B,B,BW)(B,B,B,W)
+$$(BBBW)\\;(B,BBW)\\;(B,B,BW)\\;(B,B,B,W)\\;(B,BB,W)\\;(BBB,W)\\;(BB,BW)$$
 
-(B,BB,W)(BBB,W)(BB,BW)
-
-In how many ways can sixty black objects B and forty white objects W be thus grouped?
+In how many ways can sixty black objects $B$ and forty white objects $W$ be thus grouped?
 
 # --hints--
 
-`euler181()` should return 83735848679360670.
+`colorsGrouping()` should return `83735848679360670`.
 
 ```js
-assert.strictEqual(euler181(), 83735848679360670);
+assert.strictEqual(colorsGrouping(), 83735848679360670);
 ```
 
 # --seed--
@@ -31,12 +29,12 @@ assert.strictEqual(euler181(), 83735848679360670);
 ## --seed-contents--
 
 ```js
-function euler181() {
+function colorsGrouping() {
 
   return true;
 }
 
-euler181();
+colorsGrouping();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md
index c739b6384ad..e971434b3e7 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4231000cf542c50ff35
 title: 'Problem 182: RSA encryption'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301818
 dashedName: problem-182-rsa-encryption
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.md
index 0dcbca86fd5..7586be421e3 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.md
@@ -1,37 +1,37 @@
 ---
 id: 5900f4231000cf542c50ff36
 title: 'Problem 183: Maximum product of parts'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301819
 dashedName: problem-183-maximum-product-of-parts
 ---
 
 # --description--
 
-Let N be a positive integer and let N be split into k equal parts, r = N/k, so that N = r + r + ... + r.
+Let $N$ be a positive integer and let $N$ be split into $k$ equal parts, $r = \frac{N}{k}$, so that $N = r + r + \cdots + r$.
 
-Let P be the product of these parts, P = r × r × ... × r = rk.
+Let $P$ be the product of these parts, $P = r × r × \cdots × r = r^k$.
 
-For example, if 11 is split into five equal parts, 11 = 2.2 + 2.2 + 2.2 + 2.2 + 2.2, then P = 2.25 = 51.53632.
+For example, if 11 is split into five equal parts, 11 = 2.2 + 2.2 + 2.2 + 2.2 + 2.2, then $P = {2.2}^5 = 51.53632$.
 
-Let M(N) = Pmax for a given value of N.
+Let $M(N) = P_{max}$ for a given value of $N$.
 
-It turns out that the maximum for N = 11 is found by splitting eleven into four equal parts which leads to Pmax = (11/4)4; that is, M(11) = 14641/256 = 57.19140625, which is a terminating decimal.
+It turns out that the maximum for $N = 11$ is found by splitting eleven into four equal parts which leads to $P_{max} = {(\frac{11}{4})}^4$; that is, $M(11) = \frac{14641}{256} = 57.19140625$, which is a terminating decimal.
 
-However, for N = 8 the maximum is achieved by splitting it into three equal parts, so M(8) = 512/27, which is a non-terminating decimal.
+However, for $N = 8$ the maximum is achieved by splitting it into three equal parts, so $M(8) = \frac{512}{27}$, which is a non-terminating decimal.
 
-Let D(N) = N if M(N) is a non-terminating decimal and D(N) = -N if M(N) is a terminating decimal.
+Let $D(N) = N$ if $M(N)$ is a non-terminating decimal and $D(N) = -N$ if $M(N)$ is a terminating decimal.
 
-For example, ΣD(N) for 5 ≤ N ≤ 100 is 2438.
+For example, $\sum D(N)$ for $5 ≤ N ≤ 100$ is 2438.
 
-Find ΣD(N) for 5 ≤ N ≤ 10000.
+Find $\sum D(N)$ for $5 ≤ N ≤ 10000$.
 
 # --hints--
 
-`euler183()` should return 48861552.
+`maximumProductOfParts()` should return `48861552`.
 
 ```js
-assert.strictEqual(euler183(), 48861552);
+assert.strictEqual(maximumProductOfParts(), 48861552);
 ```
 
 # --seed--
@@ -39,12 +39,12 @@ assert.strictEqual(euler183(), 48861552);
 ## --seed-contents--
 
 ```js
-function euler183() {
+function maximumProductOfParts() {
 
   return true;
 }
 
-euler183();
+maximumProductOfParts();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md
index dd5855935b1..8d3eb0bfc9d 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f4241000cf542c50ff37
 title: 'Problem 184: Triangles containing the origin'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301820
 dashedName: problem-184-triangles-containing-the-origin
 ---
 
 # --description--
 
-Consider the set Ir of points (x,y) with integer coordinates in the interior of the circle with radius r, centered at the origin, i.e. x2 + y2 &lt; r2.
+Consider the set $I_r$ of points $(x,y)$ with integer coordinates in the interior of the circle with radius $r$, centered at the origin, i.e. $x^2 + y^2 &lt; r^2$.
 
-For a radius of 2, I2 contains the nine points (0,0), (1,0), (1,1), (0,1), (-1,1), (-1,0), (-1,-1), (0,-1) and (1,-1). There are eight triangles having all three vertices in I2 which contain the origin in the interior. Two of them are shown below, the others are obtained from these by rotation.
+For a radius of 2, $I_2$ contains the nine points (0,0), (1,0), (1,1), (0,1), (-1,1), (-1,0), (-1,-1), (0,-1) and (1,-1). There are eight triangles having all three vertices in $I_2$ which contain the origin in the interior. Two of them are shown below, the others are obtained from these by rotation.
 
-For a radius of 3, there are 360 triangles containing the origin in the interior and having all vertices in I3 and for I5 the number is 10600.
+<img class="img-responsive center-block" alt="circle with radius 2, centered at the origin, with nine marked points and two triangles - (-1,0), (0,1), (1,-1) and (-1,1), (0,-1), (1,1)" src="https://cdn.freecodecamp.org/curriculum/project-euler/triangles-containing-the-origin.gif" style="background-color: white; padding: 10px;" />
 
-How many triangles are there containing the origin in the interior and having all three vertices in I105?
+For a radius of 3, there are 360 triangles containing the origin in the interior and having all vertices in $I_3$ and for $I_5$ the number is 10600.
+
+How many triangles are there containing the origin in the interior and having all three vertices in $I_{105}$?
 
 # --hints--
 
-`euler184()` should return 1725323624056.
+`trianglesContainingOrigin()` should return `1725323624056`.
 
 ```js
-assert.strictEqual(euler184(), 1725323624056);
+assert.strictEqual(trianglesContainingOrigin(), 1725323624056);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler184(), 1725323624056);
 ## --seed-contents--
 
 ```js
-function euler184() {
+function trianglesContainingOrigin() {
 
   return true;
 }
 
-euler184();
+trianglesContainingOrigin();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-185-number-mind.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-185-number-mind.md
index bd8a8539373..820f0832166 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-185-number-mind.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-185-number-mind.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4251000cf542c50ff38
 title: 'Problem 185: Number Mind'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301821
 dashedName: problem-185-number-mind
 ---
@@ -12,20 +12,38 @@ The game Number Mind is a variant of the well known game Master Mind.
 
 Instead of coloured pegs, you have to guess a secret sequence of digits. After each guess you're only told in how many places you've guessed the correct digit. So, if the sequence was 1234 and you guessed 2036, you'd be told that you have one correct digit; however, you would NOT be told that you also have another digit in the wrong place.
 
-For instance, given the following guesses for a 5-digit secret sequence, 90342 ;2 correct 70794 ;0 correct 39458 ;2 correct 34109 ;1 correct 51545 ;2 correct 12531 ;1 correct The correct sequence 39542 is unique.
+For instance, given the following guesses for a 5-digit secret sequence,
+
+$$\begin{align}   & 90342 ;2\\;\text{correct}\\\\
+  & 70794 ;0\\;\text{correct}\\\\   & 39458 ;2\\;\text{correct}\\\\
+  & 34109 ;1\\;\text{correct}\\\\   & 51545 ;2\\;\text{correct}\\\\
+  & 12531 ;1\\;\text{correct} \end{align}$$
+
+The correct sequence 39542 is unique.
 
 Based on the following guesses,
 
-5616185650518293 ;2 correct 3847439647293047 ;1 correct 5855462940810587 ;3 correct 9742855507068353 ;3 correct 4296849643607543 ;3 correct 3174248439465858 ;1 correct 4513559094146117 ;2 correct 7890971548908067 ;3 correct 8157356344118483 ;1 correct 2615250744386899 ;2 correct 8690095851526254 ;3 correct 6375711915077050 ;1 correct 6913859173121360 ;1 correct 6442889055042768 ;2 correct 2321386104303845 ;0 correct 2326509471271448 ;2 correct 5251583379644322 ;2 correct 1748270476758276 ;3 correct 4895722652190306 ;1 correct 3041631117224635 ;3 correct 1841236454324589 ;3 correct 2659862637316867 ;2 correct
+$$\begin{align}   & 5616185650518293 ;2\\;\text{correct}\\\\
+  & 3847439647293047 ;1\\;\text{correct}\\\\   & 5855462940810587 ;3\\;\text{correct}\\\\
+  & 9742855507068353 ;3\\;\text{correct}\\\\   & 4296849643607543 ;3\\;\text{correct}\\\\
+  & 3174248439465858 ;1\\;\text{correct}\\\\   & 4513559094146117 ;2\\;\text{correct}\\\\
+  & 7890971548908067 ;3\\;\text{correct}\\\\   & 8157356344118483 ;1\\;\text{correct}\\\\
+  & 2615250744386899 ;2\\;\text{correct}\\\\   & 8690095851526254 ;3\\;\text{correct}\\\\
+  & 6375711915077050 ;1\\;\text{correct}\\\\   & 6913859173121360 ;1\\;\text{correct}\\\\
+  & 6442889055042768 ;2\\;\text{correct}\\\\   & 2321386104303845 ;0\\;\text{correct}\\\\
+  & 2326509471271448 ;2\\;\text{correct}\\\\   & 5251583379644322 ;2\\;\text{correct}\\\\
+  & 1748270476758276 ;3\\;\text{correct}\\\\   & 4895722652190306 ;1\\;\text{correct}\\\\
+  & 3041631117224635 ;3\\;\text{correct}\\\\   & 1841236454324589 ;3\\;\text{correct}\\\\
+  & 2659862637316867 ;2\\;\text{correct} \end{align}$$
 
 Find the unique 16-digit secret sequence.
 
 # --hints--
 
-`euler185()` should return 4640261571849533.
+`numberMind()` should return `4640261571849533`.
 
 ```js
-assert.strictEqual(euler185(), 4640261571849533);
+assert.strictEqual(numberMind(), 4640261571849533);
 ```
 
 # --seed--
@@ -33,12 +51,12 @@ assert.strictEqual(euler185(), 4640261571849533);
 ## --seed-contents--
 
 ```js
-function euler185() {
+function numberMind() {
 
   return true;
 }
 
-euler185();
+numberMind();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md
index 119501f8331..8d1fed78cdf 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4281000cf542c50ff39
 title: 'Problem 186: Connectedness of a network'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301822
 dashedName: problem-186-connectedness-of-a-network
 ---
@@ -10,22 +10,31 @@ dashedName: problem-186-connectedness-of-a-network
 
 Here are the records from a busy telephone system with one million users:
 
-RecNrCallerCalled120000710005326001835004393600863701497......... The telephone number of the caller and the called number in record n are Caller(n) = S2n-1 and Called(n) = S2n where S1,2,3,... come from the "Lagged Fibonacci Generator":
+| RecNr | Caller | Called |
+| ----- | ------ | ------ |
+| 1     | 200007 | 100053 |
+| 2     | 600183 | 500439 |
+| 3     | 600863 | 701497 |
+| ...   | ...    | ...    |
 
-For 1 ≤ k ≤ 55, Sk = \[100003 - 200003k + 300007k3] (modulo 1000000) For 56 ≤ k, Sk = \[Sk-24 + Sk-55] (modulo 1000000)
+The telephone number of the caller and the called number in record $n$ are $Caller(n) = S_{2n - 1}$ and $Called(n) = S_{2n}$ where ${S}_{1,2,3,\ldots}$ come from the "Lagged Fibonacci Generator":
 
-If Caller(n) = Called(n) then the user is assumed to have misdialled and the call fails; otherwise the call is successful.
+For $1 ≤ k ≤ 55$, $S_k = [100003 - 200003k + 300007{k}^3]\\;(\text{modulo}\\;1000000)$
 
-From the start of the records, we say that any pair of users X and Y are friends if X calls Y or vice-versa. Similarly, X is a friend of a friend of Z if X is a friend of Y and Y is a friend of Z; and so on for longer chains.
+For $56 ≤ k$, $S_k = [S_{k - 24} + S_{k - 55}]\\;(\text{modulo}\\;1000000)$
+
+If $Caller(n) = Called(n)$ then the user is assumed to have misdialled and the call fails; otherwise the call is successful.
+
+From the start of the records, we say that any pair of users $X$ and $Y$ are friends if $X$ calls $Y$ or vice-versa. Similarly, $X$ is a friend of a friend of $Z$ if $X$ is a friend of $Y$ and $Y$ is a friend of $Z$; and so on for longer chains.
 
 The Prime Minister's phone number is 524287. After how many successful calls, not counting misdials, will 99% of the users (including the PM) be a friend, or a friend of a friend etc., of the Prime Minister?
 
 # --hints--
 
-`euler186()` should return 2325629.
+`connectednessOfANetwork()` should return `2325629`.
 
 ```js
-assert.strictEqual(euler186(), 2325629);
+assert.strictEqual(connectednessOfANetwork(), 2325629);
 ```
 
 # --seed--
@@ -33,12 +42,12 @@ assert.strictEqual(euler186(), 2325629);
 ## --seed-contents--
 
 ```js
-function euler186() {
+function connectednessOfANetwork() {
 
   return true;
 }
 
-euler186();
+connectednessOfANetwork();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-187-semiprimes.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-187-semiprimes.md
index 043684a9d76..bcd6f324753 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-187-semiprimes.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-187-semiprimes.md
@@ -1,22 +1,22 @@
 ---
 id: 5900f4291000cf542c50ff3a
 title: 'Problem 187: Semiprimes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301823
 dashedName: problem-187-semiprimes
 ---
 
 # --description--
 
-A composite is a number containing at least two prime factors. For example, 15 = 3 × 5; 9 = 3 × 3; 12 = 2 × 2 × 3.
+A composite is a number containing at least two prime factors. For example, $15 = 3 × 5; 9 = 3 × 3; 12 = 2 × 2 × 3$.
 
 There are ten composites below thirty containing precisely two, not necessarily distinct, prime factors: 4, 6, 9, 10, 14, 15, 21, 22, 25, 26.
 
-How many composite integers, n &lt; 108, have precisely two, not necessarily distinct, prime factors?
+How many composite integers, $n &lt; {10}^8$, have precisely two, not necessarily distinct, prime factors?
 
 # --hints--
 
-`euler187()` should return 17427258.
+`semiPrimes()` should return `17427258`.
 
 ```js
 assert.strictEqual(euler187(), 17427258);
@@ -27,12 +27,12 @@ assert.strictEqual(euler187(), 17427258);
 ## --seed-contents--
 
 ```js
-function euler187() {
+function semiPrimes() {
 
   return true;
 }
 
-euler187();
+semiPrimes();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.md
index 8c24a2f8e95..1e0ae1dc9fa 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4291000cf542c50ff3b
 title: 'Problem 188: The hyperexponentiation of a number'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301824
 dashedName: problem-188-the-hyperexponentiation-of-a-number
 ---
 
 # --description--
 
-The hyperexponentiation or tetration of a number a by a positive integer b, denoted by a↑↑b or ba, is recursively defined by:
+The hyperexponentiation or tetration of a number $a$ by a positive integer $b$, denoted by $a↑↑b$ or ${}^ba$, is recursively defined by:
 
-a↑↑1 = a,
+$a↑↑1 = a$,
 
-a↑↑(k+1) = a(a↑↑k).
+$a↑↑(k+1) = a^{(a↑↑k)}$.
 
-Thus we have e.g. 3↑↑2 = 33 = 27, hence 3↑↑3 = 327 = 7625597484987 and 3↑↑4 is roughly 103.6383346400240996\*10^12. Find the last 8 digits of 1777↑↑1855.
+Thus we have e.g. $3↑↑2 = 3^3 = 27$, hence $3↑↑3 = 3^{27} = 7625597484987$ and $3↑↑4$ is roughly ${10}^{3.6383346400240996 \times {10}^{12}}$. Find the last 8 digits of $1777↑↑1855$.
 
 # --hints--
 
-`euler188()` should return 95962097.
+`hyperexponentation()` should return `95962097`.
 
 ```js
-assert.strictEqual(euler188(), 95962097);
+assert.strictEqual(hyperexponentation(), 95962097);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler188(), 95962097);
 ## --seed-contents--
 
 ```js
-function euler188() {
+function hyperexponentation() {
 
   return true;
 }
 
-euler188();
+hyperexponentation();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md
index 4153d584425..6ac8cedcec5 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4291000cf542c50ff3c
 title: 'Problem 189: Tri-colouring a triangular grid'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301825
 dashedName: problem-189-tri-colouring-a-triangular-grid
 ---
@@ -10,20 +10,24 @@ dashedName: problem-189-tri-colouring-a-triangular-grid
 
 Consider the following configuration of 64 triangles:
 
+<img class="img-responsive center-block" alt="64 triangles arranged to create larger triangle with side length of 8 triangles" src="https://cdn.freecodecamp.org/curriculum/project-euler/tri-colouring-a-triangular-grid-1.gif" style="background-color: white; padding: 10px;" />
+
 We wish to colour the interior of each triangle with one of three colours: red, green or blue, so that no two neighbouring triangles have the same colour. Such a colouring shall be called valid. Here, two triangles are said to be neighbouring if they share an edge. Note: if they only share a vertex, then they are not neighbours.
 
 For example, here is a valid colouring of the above grid:
 
+<img class="img-responsive center-block" alt="colored grid of 64 triangles" src="https://cdn.freecodecamp.org/curriculum/project-euler/tri-colouring-a-triangular-grid-2.gif" style="background-color: white; padding: 10px;" />
+
 A colouring C' which is obtained from a colouring C by rotation or reflection is considered distinct from C unless the two are identical.
 
 How many distinct valid colourings are there for the above configuration?
 
 # --hints--
 
-`euler189()` should return 10834893628237824.
+`triangularGridColoring()` should return `10834893628237824`.
 
 ```js
-assert.strictEqual(euler189(), 10834893628237824);
+assert.strictEqual(triangularGridColoring(), 10834893628237824);
 ```
 
 # --seed--
@@ -31,12 +35,12 @@ assert.strictEqual(euler189(), 10834893628237824);
 ## --seed-contents--
 
 ```js
-function euler189() {
+function triangularGridColoring() {
 
   return true;
 }
 
-euler189();
+triangularGridColoring();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.md
index 143247df800..806332925e0 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f42b1000cf542c50ff3d
 title: 'Problem 190: Maximising a weighted product'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301828
 dashedName: problem-190-maximising-a-weighted-product
 ---
 
 # --description--
 
-Let Sm = (x1, x2, ... , xm) be the m-tuple of positive real numbers with x1 + x2 + ... + xm = m for which Pm = x1 \* x22 \* ... \* xmm is maximised.
+Let $S_m = (x_1, x_2, \ldots, x_m)$ be the $m$-tuple of positive real numbers with $x_1 + x_2 + \cdots + x_m = m$ for which $P_m = x_1 \times {x_2}^2 \times \cdots \times {x_m}^m$ is maximised.
 
-For example, it can be verified that \[P10] = 4112 (\[ ] is the integer part function).
+For example, it can be verified that $[P_{10}] = 4112$ ([ ] is the integer part function).
 
-Find Σ\[Pm] for 2 ≤ m ≤ 15.
+Find $\sum {[P_m]}$ for $2 ≤ m ≤ 15$.
 
 # --hints--
 
-`euler190()` should return 371048281.
+`maximisingWeightedProduct()` should return `371048281`.
 
 ```js
-assert.strictEqual(euler190(), 371048281);
+assert.strictEqual(maximisingWeightedProduct(), 371048281);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler190(), 371048281);
 ## --seed-contents--
 
 ```js
-function euler190() {
+function maximisingWeightedProduct() {
 
   return true;
 }
 
-euler190();
+maximisingWeightedProduct();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-192-best-approximations.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-192-best-approximations.md
index 6751cbffaf9..61889d4d47b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-192-best-approximations.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-192-best-approximations.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f42c1000cf542c50ff3f
 title: 'Problem 192: Best Approximations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301830
 dashedName: problem-192-best-approximations
 ---
 
 # --description--
 
-Let x be a real number.
+Let $x$ be a real number.
 
-A best approximation to x for the denominator bound d is a rational number r/s in reduced form, with s ≤ d, such that any rational number which is closer to x than r/s has a denominator larger than d:
+A best approximation to $x$ for the denominator bound $d$ is a rational number $\frac{r}{s}$ in reduced form, with $s ≤ d$, such that any rational number which is closer to $x$ than $\frac{r}{s}$ has a denominator larger than $d$:
 
-|p/q-x| &lt; |r/s-x| ⇒ q > d
+$$|\frac{p}{q} - x| &lt; |\frac{r}{s} - x| ⇒ q > d$$
 
-For example, the best approximation to √13 for the denominator bound 20 is 18/5 and the best approximation to √13 for the denominator bound 30 is 101/28.
+For example, the best approximation to $\sqrt{13}$ for the denominator bound $20$ is $\frac{18}{5}$ and the best approximation to $\sqrt{13}$ for the denominator bound $30$ is $\frac{101}{28}$.
 
-Find the sum of all denominators of the best approximations to √n for the denominator bound 1012, where n is not a perfect square and 1 &lt; n ≤ 100000.
+Find the sum of all denominators of the best approximations to $\sqrt{n}$ for the denominator bound ${10}^{12}$, where $n$ is not a perfect square and $1 &lt; n ≤ 100000$.
 
 # --hints--
 
-`euler192()` should return 57060635927998344.
+`bestApproximations()` should return `57060635927998344`.
 
 ```js
-assert.strictEqual(euler192(), 57060635927998344);
+assert.strictEqual(bestApproximations(), 57060635927998344);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler192(), 57060635927998344);
 ## --seed-contents--
 
 ```js
-function euler192() {
+function bestApproximations() {
 
   return true;
 }
 
-euler192();
+bestApproximations();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-193-squarefree-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-193-squarefree-numbers.md
index 1b9cc8d4900..7e17fd27c15 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-193-squarefree-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-193-squarefree-numbers.md
@@ -1,23 +1,23 @@
 ---
 id: 5900f42f1000cf542c50ff41
 title: 'Problem 193: Squarefree Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301831
 dashedName: problem-193-squarefree-numbers
 ---
 
 # --description--
 
-A positive integer n is called squarefree, if no square of a prime divides n, thus 1, 2, 3, 5, 6, 7, 10, 11 are squarefree, but not 4, 8, 9, 12.
+A positive integer $n$ is called squarefree, if no square of a prime divides $n$, thus 1, 2, 3, 5, 6, 7, 10, 11 are squarefree, but not 4, 8, 9, 12.
 
-How many squarefree numbers are there below 250?
+How many squarefree numbers are there below $2^{50}$?
 
 # --hints--
 
-`euler193()` should return 684465067343069.
+`squarefreeNumbers()` should return `684465067343069`.
 
 ```js
-assert.strictEqual(euler193(), 684465067343069);
+assert.strictEqual(squarefreeNumbers(), 684465067343069);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler193(), 684465067343069);
 ## --seed-contents--
 
 ```js
-function euler193() {
+function squarefreeNumbers() {
 
   return true;
 }
 
-euler193();
+squarefreeNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-194-coloured-configurations.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-194-coloured-configurations.md
index 947d65c7878..4d5b05af3d9 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-194-coloured-configurations.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-194-coloured-configurations.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f42f1000cf542c50ff40
 title: 'Problem 194: Coloured Configurations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301832
 dashedName: problem-194-coloured-configurations
 ---
@@ -9,23 +9,21 @@ dashedName: problem-194-coloured-configurations
 # --description--
 
 Consider graphs built with the units A:
+<img class="img-responsive" alt="graph unit A" src="https://cdn.freecodecamp.org/curriculum/project-euler/coloured-configurations-1.png" style="display: inline-block; background-color: white; padding: 10px;" />
+ and B: <img class="img-responsive" alt="graph unit B" src="https://cdn.freecodecamp.org/curriculum/project-euler/coloured-configurations-2.png" style="display: inline-block; background-color: white; padding: 10px;" />, where the units are glued along the vertical edges as in the graph <img class="img-responsive" alt="graph with four units glued along the vertical edges" src="https://cdn.freecodecamp.org/curriculum/project-euler/coloured-configurations-3.png" style="display: inline-block; background-color: white; padding: 10px;" />.
 
-and B: , where the units are glued along
+A configuration of type $(a,b,c)$ is a graph thus built of $a$ units A and $b$ units B, where the graph's vertices are coloured using up to $c$ colours, so that no two adjacent vertices have the same colour. The compound graph above is an example of a configuration of type $(2,2,6)$, in fact of type $(2,2,c)$ for all $c ≥ 4$
 
-the vertical edges as in the graph .
+Let $N(a,b,c)$ be the number of configurations of type $(a,b,c)$. For example, $N(1,0,3) = 24$, $N(0,2,4) = 92928$ and $N(2,2,3) = 20736$.
 
-A configuration of type (a,b,c) is a graph thus built of a units A and b units B, where the graph's vertices are coloured using up to c colours, so that no two adjacent vertices have the same colour. The compound graph above is an example of a configuration of type (2,2,6), in fact of type (2,2,c) for all c ≥ 4.
-
-Let N(a,b,c) be the number of configurations of type (a,b,c). For example, N(1,0,3) = 24, N(0,2,4) = 92928 and N(2,2,3) = 20736.
-
-Find the last 8 digits of N(25,75,1984).
+Find the last 8 digits of $N(25,75,1984)$.
 
 # --hints--
 
-`euler194()` should return 61190912.
+`coloredConfigurations()` should return `61190912`.
 
 ```js
-assert.strictEqual(euler194(), 61190912);
+assert.strictEqual(coloredConfigurations(), 61190912);
 ```
 
 # --seed--
@@ -33,12 +31,12 @@ assert.strictEqual(euler194(), 61190912);
 ## --seed-contents--
 
 ```js
-function euler194() {
+function coloredConfigurations() {
 
   return true;
 }
 
-euler194();
+coloredConfigurations();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md
index cd52202435f..fc074c97a32 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md
@@ -1,31 +1,29 @@
 ---
 id: 5900f4311000cf542c50ff43
 title: 'Problem 195: Inscribed circles of triangles with one angle of 60 degrees'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301833
 dashedName: problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees
 ---
 
 # --description--
 
-Let's call an integer sided triangle with exactly one angle of 60 degrees a 60-degree triangle.
+Let's call an integer sided triangle with exactly one angle of 60° a 60° triangle.
 
-Let r be the radius of the inscribed circle of such a 60-degree triangle.
+Let $r$ be the radius of the inscribed circle of such a 60° triangle.
 
-There are 1234 60-degree triangles for which r ≤ 100.
+There are 1234 60° triangles for which $r ≤ 100$.
 
-Let T(n) be the number of 60-degree triangles for which r ≤ n, so
+Let $T(n)$ be the number of 60° triangles for which $r ≤ n$, so $T(100) = 1234$, $T(1000) = 22767$, and $T(10000) = 359912$.
 
-T(100) = 1234, T(1000) = 22767, and T(10000) = 359912.
-
-Find T(1053779).
+Encuentra $T(1053779)$.
 
 # --hints--
 
-`euler195()` should return 75085391.
+`inscribedCirclesOfTriangles()` should return `75085391`.
 
 ```js
-assert.strictEqual(euler195(), 75085391);
+assert.strictEqual(inscribedCirclesOfTriangles(), 75085391);
 ```
 
 # --seed--
@@ -33,12 +31,12 @@ assert.strictEqual(euler195(), 75085391);
 ## --seed-contents--
 
 ```js
-function euler195() {
+function inscribedCirclesOfTriangles() {
 
   return true;
 }
 
-euler195();
+inscribedCirclesOfTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md
index 1e2f3fe30d6..608f288e3e9 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md
@@ -1,25 +1,23 @@
 ---
 id: 5900f4311000cf542c50ff44
 title: 'Problem 197: Investigating the behaviour of a recursively defined sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301835
 dashedName: problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence
 ---
 
 # --description--
 
-Given is the function f(x) = ⌊230.403243784-x2⌋ × 10-9 ( ⌊ ⌋ is the floor-function),
+Given is the function $f(x) = ⌊{2}^{30.403243784 - x^2}⌋ × {10}^{-9}$ ( ⌊ ⌋ is the floor-function), the sequence $u_n$ is defined by $u_0 = -1$ and $u_{n + 1} = f(u_n)$.
 
-the sequence un is defined by u0 = -1 and un+1 = f(un).
-
-Find un + un+1 for n = 1012. Give your answer with 9 digits after the decimal point.
+Find $u_n + u_{n + 1}$ for $n = {10}^{12}$. Give your answer with 9 digits after the decimal point.
 
 # --hints--
 
-`euler197()` should return 1.710637717.
+`recursivelyDefinedSequence()` should return `1.710637717`.
 
 ```js
-assert.strictEqual(euler197(), 1.710637717);
+assert.strictEqual(recursivelyDefinedSequence(), 1.710637717);
 ```
 
 # --seed--
@@ -27,12 +25,12 @@ assert.strictEqual(euler197(), 1.710637717);
 ## --seed-contents--
 
 ```js
-function euler197() {
+function recursivelyDefinedSequence() {
 
   return true;
 }
 
-euler197();
+recursivelyDefinedSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md
index a955aa7c37e..69c2ba856dc 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4331000cf542c50ff45
 title: 'Problem 198: Ambiguous Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301836
 dashedName: problem-198-ambiguous-numbers
 ---
 
 # --description--
 
-A best approximation to a real number x for the denominator bound d is a rational number r/s (in reduced form) with s ≤ d, so that any rational number p/q which is closer to x than r/s has q > d.
+A best approximation to a real number $x$ for the denominator bound $d$ is a rational number $\frac{r}{s}$ (in reduced form) with $s ≤ d$, so that any rational number $\frac{p}{q}$ which is closer to $x$ than $\frac{r}{s}$ has $q > d$.
 
-Usually the best approximation to a real number is uniquely determined for all denominator bounds. However, there are some exceptions, e.g. 9/40 has the two best approximations 1/4 and 1/5 for the denominator bound 6. We shall call a real number x ambiguous, if there is at least one denominator bound for which x possesses two best approximations. Clearly, an ambiguous number is necessarily rational.
+Usually the best approximation to a real number is uniquely determined for all denominator bounds. However, there are some exceptions, e.g. $\frac{9}{40}$ has the two best approximations $\frac{1}{4}$ and $\frac{1}{5}$ for the denominator bound $6$. We shall call a real number $x$ ambiguous, if there is at least one denominator bound for which $x$ possesses two best approximations. Clearly, an ambiguous number is necessarily rational.
 
-How many ambiguous numbers x = p/q, 0 &lt; x &lt; 1/100, are there whose denominator q does not exceed 108?
+How many ambiguous numbers $x = \frac{p}{q}$, $0 &lt; x &lt; \frac{1}{100}$, are there whose denominator $q$ does not exceed ${10}^8$?
 
 # --hints--
 
-`euler198()` should return 52374425.
+`ambiguousNumbers()` should return `52374425`.
 
 ```js
-assert.strictEqual(euler198(), 52374425);
+assert.strictEqual(ambiguousNumbers(), 52374425);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler198(), 52374425);
 ## --seed-contents--
 
 ```js
-function euler198() {
+function ambiguousNumbers() {
 
   return true;
 }
 
-euler198();
+ambiguousNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md
index 0194bbb44d1..5c699d70320 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4341000cf542c50ff46
 title: 'Problem 199: Iterative Circle Packing'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301837
 dashedName: problem-199-iterative-circle-packing
 ---
@@ -10,7 +10,7 @@ dashedName: problem-199-iterative-circle-packing
 
 Three circles of equal radius are placed inside a larger circle such that each pair of circles is tangent to one another and the inner circles do not overlap. There are four uncovered "gaps" which are to be filled iteratively with more tangent circles.
 
-<img class="img-responsive center-block" alt="a diagram of non-overlapping concentric circles" src="https://cdn-media-1.freecodecamp.org/project-euler/199-circles-in-circles.gif" style="background-color: white; padding: 10px;" />
+<img class="img-responsive center-block" alt="a diagram of non-overlapping circles" src="https://cdn-media-1.freecodecamp.org/project-euler/199-circles-in-circles.gif" style="background-color: white; padding: 10px;" />
 
 At each iteration, a maximally sized circle is placed in each gap, which creates more gaps for the next iteration. After 3 iterations (pictured), there are 108 gaps and the fraction of the area which is not covered by circles is 0.06790342, rounded to eight decimal places.
 
@@ -24,13 +24,13 @@ What fraction of the area is not covered by circles after `n` iterations? Give y
 assert(typeof iterativeCirclePacking(10) === 'number');
 ```
 
-`iterativeCirclePacking(10)` should return 0.00396087.
+`iterativeCirclePacking(10)` should return `0.00396087`.
 
 ```js
 assert.strictEqual(iterativeCirclePacking(10), 0.00396087);
 ```
 
-`iterativeCirclePacking(3)` should return 0.06790342.
+`iterativeCirclePacking(3)` should return `0.06790342`.
 
 ```js
 assert.strictEqual(iterativeCirclePacking(3), 0.06790342);
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md
index c6458059ce1..e35cfa0a550 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md
@@ -2,7 +2,7 @@
 id: 5900f4351000cf542c50ff47
 title: >-
   Problem 200: Find the 200th prime-proof sqube containing the contiguous sub-string "200"
-challengeType: 5
+challengeType: 1
 forumTopicId: 301840
 dashedName: >-
   problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200
@@ -10,22 +10,22 @@ dashedName: >-
 
 # --description--
 
-We shall define a sqube to be a number of the form, p2q3, where p and q are distinct primes.
+We shall define a sqube to be a number of the form, ${p^2}{q^3}$, where $p$ and $q$ are distinct primes.
 
-For example, 200 = 5223 or 120072949 = 232613.
+For example, $200 = {5^2}{2^3}$ or $120072949 = {{23}^2}{{61}^3}$.
 
 The first five squbes are 72, 108, 200, 392, and 500.
 
-Interestingly, 200 is also the first number for which you cannot change any single digit to make a prime; we shall call such numbers, prime-proof. The next prime-proof sqube which contains the contiguous sub-string "200" is 1992008.
+Interestingly, 200 is also the first number for which you cannot change any single digit to make a prime; we shall call such numbers, prime-proof. The next prime-proof sqube which contains the contiguous sub-string `200` is 1992008.
 
-Find the 200th prime-proof sqube containing the contiguous sub-string "200".
+Find the 200th prime-proof sqube containing the contiguous sub-string `200`.
 
 # --hints--
 
-`euler200()` should return 229161792008.
+`primeProofSqubeWithSubString()` should return `229161792008`.
 
 ```js
-assert.strictEqual(euler200(), 229161792008);
+assert.strictEqual(primeProofSqubeWithSubString(), 229161792008);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler200(), 229161792008);
 ## --seed-contents--
 
 ```js
-function euler200() {
+function primeProofSqubeWithSubString() {
 
   return true;
 }
 
-euler200();
+primeProofSqubeWithSubString();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md
index 045fd9b2b8b..e0513d008ec 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md
@@ -1,31 +1,41 @@
 ---
 id: 5900f4361000cf542c50ff48
 title: 'Problem 201: Subsets with a unique sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301841
 dashedName: problem-201-subsets-with-a-unique-sum
 ---
 
 # --description--
 
-For any set A of numbers, let sum(A) be the sum of the elements of A.
+For any set $A$ of numbers, let $sum(A)$ be the sum of the elements of $A$.
 
-Consider the set B = {1,3,6,8,10,11}. There are 20 subsets of B containing three elements, and their sums are:
+Consider the set $B = \\{1,3,6,8,10,11\\}$. There are 20 subsets of $B$ containing three elements, and their sums are:
 
-sum({1,3,6}) = 10, sum({1,3,8}) = 12, sum({1,3,10}) = 14, sum({1,3,11}) = 15, sum({1,6,8}) = 15, sum({1,6,10}) = 17, sum({1,6,11}) = 18, sum({1,8,10}) = 19, sum({1,8,11}) = 20, sum({1,10,11}) = 22, sum({3,6,8}) = 17, sum({3,6,10}) = 19, sum({3,6,11}) = 20, sum({3,8,10}) = 21, sum({3,8,11}) = 22, sum({3,10,11}) = 24, sum({6,8,10}) = 24, sum({6,8,11}) = 25, sum({6,10,11}) = 27, sum({8,10,11}) = 29.
+$$\begin{align}   & sum(\\{1,3,6\\}) = 10 \\\\
+  & sum(\\{1,3,8\\}) = 12 \\\\   & sum(\\{1,3,10\\}) = 14 \\\\
+  & sum(\\{1,3,11\\}) = 15 \\\\   & sum(\\{1,6,8\\}) = 15 \\\\
+  & sum(\\{1,6,10\\}) = 17 \\\\   & sum(\\{1,6,11\\}) = 18 \\\\
+  & sum(\\{1,8,10\\}) = 19 \\\\   & sum(\\{1,8,11\\}) = 20 \\\\
+  & sum(\\{1,10,11\\}) = 22 \\\\   & sum(\\{3,6,8\\}) = 17 \\\\
+  & sum(\\{3,6,10\\}) = 19 \\\\   & sum(\\{3,6,11\\}) = 20 \\\\
+  & sum(\\{3,8,10\\}) = 21 \\\\   & sum(\\{3,8,11\\}) = 22 \\\\
+  & sum(\\{3,10,11\\}) = 24 \\\\   & sum(\\{6,8,10\\}) = 24 \\\\
+  & sum(\\{6,8,11\\}) = 25 \\\\   & sum(\\{6,10,11\\}) = 27 \\\\
+  & sum(\\{8,10,11\\}) = 29 \\end{align}$$
 
-Some of these sums occur more than once, others are unique. For a set A, let U(A,k) be the set of unique sums of k-element subsets of A, in our example we find U(B,3) = {10,12,14,18,21,25,27,29} and sum(U(B,3)) = 156.
+Some of these sums occur more than once, others are unique. For a set $A$, let $U(A,k)$ be the set of unique sums of $k$-element subsets of $A$, in our example we find $U(B,3) = \\{10,12,14,18,21,25,27,29\\}$ and $sum(U(B,3)) = 156$.
 
-Now consider the 100-element set S = {12, 22, ... , 1002}. S has 100891344545564193334812497256 50-element subsets.
+Now consider the $100$-element set $S = \\{1^2, 2^2, \ldots , {100}^2\\}$. $S$ has $100\\,891\\,344\\,545\\,564\\,193\\,334\\,812\\,497\\,256\\;$ $50$-element subsets.
 
-Determine the sum of all integers which are the sum of exactly one of the 50-element subsets of S, i.e. find sum(U(S,50)).
+Determine the sum of all integers which are the sum of exactly one of the $50$-element subsets of $S$, i.e. find $sum(U(S,50))$.
 
 # --hints--
 
-`euler201()` should return 115039000.
+`uniqueSubsetsSum()` should return `115039000`.
 
 ```js
-assert.strictEqual(euler201(), 115039000);
+assert.strictEqual(uniqueSubsetsSum(), 115039000);
 ```
 
 # --seed--
@@ -33,12 +43,12 @@ assert.strictEqual(euler201(), 115039000);
 ## --seed-contents--
 
 ```js
-function euler201() {
+function uniqueSubsetsSum() {
 
   return true;
 }
 
-euler201();
+uniqueSubsetsSum();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-202-laserbeam.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-202-laserbeam.md
index c42f68e4147..2090a152b22 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-202-laserbeam.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-202-laserbeam.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4371000cf542c50ff49
 title: 'Problem 202: Laserbeam'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301843
 dashedName: problem-202-laserbeam
 ---
@@ -10,18 +10,20 @@ dashedName: problem-202-laserbeam
 
 Three mirrors are arranged in the shape of an equilateral triangle, with their reflective surfaces pointing inwards. There is an infinitesimal gap at each vertex of the triangle through which a laser beam may pass.
 
-Label the vertices A, B and C. There are 2 ways in which a laser beam may enter vertex C, bounce off 11 surfaces, then exit through the same vertex: one way is shown below; the other is the reverse of that.
+Label the vertices $A$, $B$ and $C$. There are 2 ways in which a laser beam may enter vertex $C$, bounce off 11 surfaces, then exit through the same vertex: one way is shown below; the other is the reverse of that.
 
-There are 80840 ways in which a laser beam may enter vertex C, bounce off 1000001 surfaces, then exit through the same vertex.
+<img class="img-responsive center-block" alt="one way in which laser beam may enter vertex C, bounce off 11 surfaces and exit through the same vertex" src="https://cdn.freecodecamp.org/curriculum/project-euler/laserbeam.gif" style="background-color: white; padding: 10px;" />
 
-In how many ways can a laser beam enter at vertex C, bounce off 12017639147 surfaces, then exit through the same vertex?
+There are 80840 ways in which a laser beam may enter vertex $C$, bounce off 1000001 surfaces, then exit through the same vertex.
+
+In how many ways can a laser beam enter at vertex $C$, bounce off 12017639147 surfaces, then exit through the same vertex?
 
 # --hints--
 
-`euler202()` should return 1209002624.
+`laserbeam()` should return `1209002624`.
 
 ```js
-assert.strictEqual(euler202(), 1209002624);
+assert.strictEqual(laserbeam(), 1209002624);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler202(), 1209002624);
 ## --seed-contents--
 
 ```js
-function euler202() {
+function laserbeam() {
 
   return true;
 }
 
-euler202();
+laserbeam();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md
index 4ecf609e4b3..4e418715771 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md
@@ -1,16 +1,20 @@
 ---
 id: 5900f4381000cf542c50ff4a
 title: 'Problem 203: Squarefree Binomial Coefficients'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301844
 dashedName: problem-203-squarefree-binomial-coefficients
 ---
 
 # --description--
 
-The binomial coefficients nCk can be arranged in triangular form, Pascal's triangle, like this:
+The binomial coefficients $\displaystyle\binom{n}{k}$ can be arranged in triangular form, Pascal's triangle, like this:
 
-111121133114641151010511615201561172135352171 .........
+$$\begin{array}{ccccccccccccccc}    &   &   &   &    &    &    &  1 &    &    &    &   &   &   &   \\\\
+   &   &   &   &    &    &  1 &    & 1  &    &    &   &   &   &   \\\\    &   &   &   &    &  1 &    &  2 &    &  1 &    &   &   &   &   \\\\
+   &   &   &   &  1 &    &  3 &    &  3 &    &  1 &   &   &   &   \\\\    &   &   & 1 &    &  4 &    &  6 &    &  4 &    & 1 &   &   &   \\\\
+   &   & 1 &   &  5 &    & 10 &    & 10 &    &  5 &   & 1 &   &   \\\\    & 1 &   & 6 &    & 15 &    & 20 &    & 15 &    & 6 &   & 1 &   \\\\
+ 1 &   & 7 &   & 21 &    & 35 &    & 35 &    & 21 &   & 7 &   & 1 \\\\ &   &   &   &    &    &    & \ldots \end{array}$$
 
 It can be seen that the first eight rows of Pascal's triangle contain twelve distinct numbers: 1, 2, 3, 4, 5, 6, 7, 10, 15, 20, 21 and 35.
 
@@ -20,10 +24,10 @@ Find the sum of the distinct squarefree numbers in the first 51 rows of Pascal's
 
 # --hints--
 
-`euler203()` should return 34029210557338.
+`squarefreeBinomialCoefficients()` should return `34029210557338`.
 
 ```js
-assert.strictEqual(euler203(), 34029210557338);
+assert.strictEqual(squarefreeBinomialCoefficients(), 34029210557338);
 ```
 
 # --seed--
@@ -31,12 +35,12 @@ assert.strictEqual(euler203(), 34029210557338);
 ## --seed-contents--
 
 ```js
-function euler203() {
+function squarefreeBinomialCoefficients() {
 
   return true;
 }
 
-euler203();
+squarefreeBinomialCoefficients();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.md
index 4d81e08eea0..584cf57c132 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4381000cf542c50ff4b
 title: 'Problem 204: Generalised Hamming Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301845
 dashedName: problem-204-generalised-hamming-numbers
 ---
@@ -12,18 +12,18 @@ A Hamming number is a positive number which has no prime factor larger than 5.
 
 So the first few Hamming numbers are 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15.
 
-There are 1105 Hamming numbers not exceeding 108.
+There are 1105 Hamming numbers not exceeding ${10}^8$.
 
-We will call a positive number a generalised Hamming number of type n, if it has no prime factor larger than n. Hence the Hamming numbers are the generalised Hamming numbers of type 5.
+We will call a positive number a generalised Hamming number of type $n$, if it has no prime factor larger than $n$. Hence the Hamming numbers are the generalised Hamming numbers of type 5.
 
-How many generalised Hamming numbers of type 100 are there which don't exceed 109?
+How many generalised Hamming numbers of type 100 are there which don't exceed ${10}^9$?
 
 # --hints--
 
-`euler204()` should return 2944730.
+`generalisedHammingNumbers()` should return `2944730`.
 
 ```js
-assert.strictEqual(euler204(), 2944730);
+assert.strictEqual(generalisedHammingNumbers(), 2944730);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler204(), 2944730);
 ## --seed-contents--
 
 ```js
-function euler204() {
+function generalisedHammingNumbers() {
 
   return true;
 }
 
-euler204();
+generalisedHammingNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-205-dice-game.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-205-dice-game.md
index 41bf903b6d9..17614dbf03b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-205-dice-game.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-205-dice-game.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4391000cf542c50ff4c
 title: 'Problem 205: Dice Game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301846
 dashedName: problem-205-dice-game
 ---
@@ -18,10 +18,10 @@ What is the probability that Pyramidal Pete beats Cubic Colin? Give your answer
 
 # --hints--
 
-`euler205()` should return 0.5731441.
+`diceGame()` should return `0.5731441`.
 
 ```js
-assert.strictEqual(euler205(), 0.5731441);
+assert.strictEqual(diceGame(), 0.5731441);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler205(), 0.5731441);
 ## --seed-contents--
 
 ```js
-function euler205() {
+function diceGame() {
 
   return true;
 }
 
-euler205();
+diceGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-206-concealed-square.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-206-concealed-square.md
index eaedced890e..596f703da28 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-206-concealed-square.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-206-concealed-square.md
@@ -1,21 +1,21 @@
 ---
 id: 5900f43a1000cf542c50ff4d
 title: 'Problem 206: Concealed Square'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301847
 dashedName: problem-206-concealed-square
 ---
 
 # --description--
 
-Find the unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0, where each “\_” is a single digit.
+Find the unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0, where each "_" is a single digit.
 
 # --hints--
 
-`euler206()` should return 1389019170.
+`concealedSquare()` should return `1389019170`.
 
 ```js
-assert.strictEqual(euler206(), 1389019170);
+assert.strictEqual(concealedSquare(), 1389019170);
 ```
 
 # --seed--
@@ -23,16 +23,41 @@ assert.strictEqual(euler206(), 1389019170);
 ## --seed-contents--
 
 ```js
-function euler206() {
+function concealedSquare() {
 
   return true;
 }
 
-euler206();
+concealedSquare();
 ```
 
 # --solutions--
 
 ```js
-// solution required
+// Check if n**2 matches the pattern
+function squareMatchs(n) {
+  // Need BigInt due to size of values
+  let nSquared = (BigInt(n) * BigInt(n)).toString();
+
+  // Check if digits match pattern
+  for (let i = 1; i <= 9; i++) {
+    if (nSquared[2 * (i - 1)] != i) return false;
+  }
+  return true;
+}
+
+// Find integer whose square matches the pattern
+function concealedSquare() {
+  // Set bounds based upon max and min candidates
+  const minSquareRoot = Math.floor(Math.sqrt(10203040506070809) / 10) * 10;
+  const maxSquareRoot = Math.ceil(Math.sqrt(19293949596979899) / 10) * 10;
+
+  for (let x = maxSquareRoot; x >= minSquareRoot; x -= 10) {
+    // Note: 3*3 = 9 and 7*7 = 49 are only trailing digits
+    //       that can produce 9 as trailing digit in square
+    if (squareMatchs(x + 3)) return (x + 3)*10;
+    if (squareMatchs(x + 7)) return (x + 7)*10;
+  }
+  return -1;
+}
 ```
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md
index 19f1d12c8d4..29efa6bc5f6 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md
@@ -1,31 +1,39 @@
 ---
 id: 5900f43c1000cf542c50ff4e
 title: 'Problem 207: Integer partition equations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301848
 dashedName: problem-207-integer-partition-equations
 ---
 
 # --description--
 
-For some positive integers k, there exists an integer partition of the form 4t = 2t + k,
+For some positive integers $k$, there exists an integer partition of the form $4^t = 2^t + k$,
 
-where 4t, 2t, and k are all positive integers and t is a real number.
+where $4^t$, $2^t$, and $k$ are all positive integers and $t$ is a real number.
 
-The first two such partitions are 41 = 21 + 2 and 41.5849625... = 21.5849625... + 6.
+The first two such partitions are $4^1 = 2^1 + 2$ and $4^{1.584\\,962\\,5\ldots} = 2^{1.584\\,962\\,5\ldots} + 6$.
 
-Partitions where t is also an integer are called perfect. For any m ≥ 1 let P(m) be the proportion of such partitions that are perfect with k ≤ m. Thus P(6) = 1/2.
+Partitions where $t$ is also an integer are called perfect. For any $m ≥ 1$ let $P(m)$ be the proportion of such partitions that are perfect with $k ≤ m$.
 
-In the following table are listed some values of P(m) P(5) = 1/1 P(10) = 1/2 P(15) = 2/3 P(20) = 1/2 P(25) = 1/2 P(30) = 2/5 ... P(180) = 1/4 P(185) = 3/13
+Thus $P(6) = \frac{1}{2}$.
 
-Find the smallest m for which P(m) &lt; 1/12345
+In the following table are listed some values of $P(m)$
+
+$$\begin{align}   & P(5) = \frac{1}{1}    \\\\
+  & P(10) = \frac{1}{2}   \\\\   & P(15) = \frac{2}{3}   \\\\
+  & P(20) = \frac{1}{2}   \\\\   & P(25) = \frac{1}{2}   \\\\
+  & P(30) = \frac{2}{5}   \\\\   & \ldots                \\\\
+  & P(180) = \frac{1}{4}  \\\\ & P(185) = \frac{3}{13} \end{align}$$
+
+Find the smallest $m$ for which $P(m) &lt; \frac{1}{12\\,345}$
 
 # --hints--
 
-`euler207()` should return 44043947822.
+`integerPartitionEquations()` should return `44043947822`.
 
 ```js
-assert.strictEqual(euler207(), 44043947822);
+assert.strictEqual(integerPartitionEquations(), 44043947822);
 ```
 
 # --seed--
@@ -33,12 +41,12 @@ assert.strictEqual(euler207(), 44043947822);
 ## --seed-contents--
 
 ```js
-function euler207() {
+function integerPartitionEquations() {
 
   return true;
 }
 
-euler207();
+integerPartitionEquations();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-208-robot-walks.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-208-robot-walks.md
index 36d5a8fff53..63c4e63cf53 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-208-robot-walks.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-208-robot-walks.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f43f1000cf542c50ff51
 title: 'Problem 208: Robot Walks'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301849
 dashedName: problem-208-robot-walks
 ---
@@ -12,14 +12,18 @@ A robot moves in a series of one-fifth circular arcs (72°), with a free choice
 
 One of 70932 possible closed paths of 25 arcs starting northward is
 
-Given that the robot starts facing North, how many journeys of 70 arcs in length can it take that return it, after the final arc, to its starting position? (Any arc may be traversed multiple times.)
+<img class="img-responsive center-block" alt="closed path of 25 arcs, starting northward" src="https://cdn.freecodecamp.org/curriculum/project-euler/robot-walks.gif" style="background-color: white; padding: 10px;" />
+
+Given that the robot starts facing North, how many journeys of 70 arcs in length can it take that return it, after the final arc, to its starting position?
+
+**Note:** Any arc may be traversed multiple times.
 
 # --hints--
 
-`euler208()` should return 331951449665644800.
+`robotWalks()` should return `331951449665644800`.
 
 ```js
-assert.strictEqual(euler208(), 331951449665644800);
+assert.strictEqual(robotWalks(), 331951449665644800);
 ```
 
 # --seed--
@@ -27,12 +31,12 @@ assert.strictEqual(euler208(), 331951449665644800);
 ## --seed-contents--
 
 ```js
-function euler208() {
+function robotWalks() {
 
   return true;
 }
 
-euler208();
+robotWalks();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-209-circular-logic.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-209-circular-logic.md
index f7437447361..97190a72f20 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-209-circular-logic.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-209-circular-logic.md
@@ -1,27 +1,41 @@
 ---
 id: 5900f43e1000cf542c50ff4f
 title: 'Problem 209: Circular Logic'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301850
 dashedName: problem-209-circular-logic
 ---
 
 # --description--
 
-A k-input binary truth table is a map from k input bits
+A $k$-input binary truth table is a map from $k$ input bits (binary digits, 0 [false] or 1 [true]) to 1 output bit. For example, the $2$-input binary truth tables for the logical $AND$ and $XOR$ functions are:
 
-(binary digits, 0 \[false] or 1 \[true]) to 1 output bit. For example, the 2-input binary truth tables for the logical AND and XOR functions are:
+| x | y | x AND y |
+| - | - | ------- |
+| 0 | 0 | 0       |
+| 0 | 1 | 0       |
+| 1 | 0 | 0       |
+| 1 | 1 | 1       |
 
-x y x AND y000010100111x y x XOR y000011101110How many 6-input binary truth tables, τ, satisfy the formula
+| x | y | x XOR y |
+| - | - | ------- |
+| 0 | 0 | 0       |
+| 0 | 1 | 1       |
+| 1 | 0 | 1       |
+| 1 | 1 | 0       |
 
-τ(a, b, c, d, e, f) AND τ(b, c, d, e, f, a XOR (b AND c)) = 0 for all 6-bit inputs (a, b, c, d, e, f)?
+How many $6$-input binary truth tables, $τ$, satisfy the formula
+
+$$τ(a, b, c, d, e, f) \\; AND \\; τ(b, c, d, e, f, a \\; XOR \\; (b \\; AND \\; c)) = 0$$
+
+for all $6$-bit inputs ($a$, $b$, $c$, $d$, $e$, $f$)?
 
 # --hints--
 
-`euler209()` should return 15964587728784.
+`circularLogic()` should return `15964587728784`.
 
 ```js
-assert.strictEqual(euler209(), 15964587728784);
+assert.strictEqual(circularLogic(), 15964587728784);
 ```
 
 # --seed--
@@ -29,12 +43,12 @@ assert.strictEqual(euler209(), 15964587728784);
 ## --seed-contents--
 
 ```js
-function euler209() {
+function circularLogic() {
 
   return true;
 }
 
-euler209();
+circularLogic();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md
index 1fc7d980330..0dbbed2f9b0 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f43e1000cf542c50ff50
 title: 'Problem 210: Obtuse Angled Triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301852
 dashedName: problem-210-obtuse-angled-triangles
 ---
 
 # --description--
 
-Consider the set S(r) of points (x,y) with integer coordinates satisfying |x| + |y| ≤ r.
+Consider the set $S(r)$ of points ($x$,$y$) with integer coordinates satisfying $|x| + |y| ≤ r$.
 
-Let O be the point (0,0) and C the point (r/4,r/4).
+Let $O$ be the point (0,0) and $C$ the point ($\frac{r}{4}$,$\frac{r}{4}$).
 
-Let N(r) be the number of points B in S(r), so that the triangle OBC has an obtuse angle, i.e. the largest angle α satisfies 90°&lt;α&lt;180°.
+Let $N(r)$ be the number of points $B$ in $S(r)$, so that the triangle $OBC$ has an obtuse angle, i.e. the largest angle $α$ satisfies $90°&lt;α&lt;180°$.
 
-So, for example, N(4)=24 and N(8)=100.
+So, for example, $N(4)=24$ and $N(8)=100$.
 
-What is N(1,000,000,000)?
+What is $N(1\\,000\\,000\\,000)$?
 
 # --hints--
 
-`euler210()` should return 1598174770174689500.
+`obtuseAngledTriangles()` should return `1598174770174689500`.
 
 ```js
-assert.strictEqual(euler210(), 1598174770174689500);
+assert.strictEqual(obtuseAngledTriangles(), 1598174770174689500);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler210(), 1598174770174689500);
 ## --seed-contents--
 
 ```js
-function euler210() {
+function obtuseAngledTriangles() {
 
   return true;
 }
 
-euler210();
+obtuseAngledTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md
index bde41e4a79e..4ad8395c749 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f43f1000cf542c50ff52
 title: 'Problem 211: Divisor Square Sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301853
 dashedName: problem-211-divisor-square-sum
 ---
 
 # --description--
 
-For a positive integer n, let σ2(n) be the sum of the squares of its divisors. For example,
+For a positive integer $n$, let $σ_2(n)$ be the sum of the squares of its divisors. Por ejemplo,
 
-σ2(10) = 1 + 4 + 25 + 100 = 130.
+$$σ_2(10) = 1 + 4 + 25 + 100 = 130$$
 
-Find the sum of all n, 0 &lt; n &lt; 64,000,000 such that σ2(n) is a perfect square.
+Find the sum of all $n$, $0 &lt; n &lt; 64\\,000\\,000$ such that $σ_2(n)$ is a perfect square.
 
 # --hints--
 
-`euler211()` should return 1922364685.
+`divisorSquareSum()` should return `1922364685`.
 
 ```js
-assert.strictEqual(euler211(), 1922364685);
+assert.strictEqual(divisorSquareSum(), 1922364685);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler211(), 1922364685);
 ## --seed-contents--
 
 ```js
-function euler211() {
+function divisorSquareSum() {
 
   return true;
 }
 
-euler211();
+divisorSquareSum();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md
index 901bbbc3d11..6fd271c483e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md
@@ -1,35 +1,40 @@
 ---
 id: 5900f4411000cf542c50ff53
 title: 'Problem 212: Combined Volume of Cuboids'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301854
 dashedName: problem-212-combined-volume-of-cuboids
 ---
 
 # --description--
 
-An axis-aligned cuboid, specified by parameters { (x0,y0,z0), (dx,dy,dz) }, consists of all points (X,Y,Z) such that x0 ≤ X ≤ x0+dx, y0 ≤ Y ≤ y0+dy and z0 ≤ Z ≤ z0+dz. The volume of the cuboid is the product, dx × dy × dz. The combined volume of a collection of cuboids is the volume of their union and will be less than the sum of the individual volumes if any cuboids overlap.
+An axis-aligned cuboid, specified by parameters $\{ (x_0,y_0,z_0), (dx,dy,dz) \}$, consists of all points ($X$,$Y$,$Z$) such that $x_0 ≤ X ≤ x_0 + dx$, $y_0 ≤ Y ≤ y_0 + dy$ and $z_0 ≤ Z ≤ z_0 + dz$. The volume of the cuboid is the product, $dx × dy × dz$. The combined volume of a collection of cuboids is the volume of their union and will be less than the sum of the individual volumes if any cuboids overlap.
 
-Let C1,...,C50000 be a collection of 50000 axis-aligned cuboids such that Cn has parameters
+Let $C_1, \ldots, C_{50000}$ be a collection of 50000 axis-aligned cuboids such that $C_n$ has parameters
 
-x0 = S6n-5 modulo 10000y0 = S6n-4 modulo 10000z0 = S6n-3 modulo 10000dx = 1 + (S6n-2 modulo 399)dy = 1 + (S6n-1 modulo 399)dz = 1 + (S6n modulo 399)
+$$\begin{align}   & x_0 = S_{6n - 5} \\; \text{modulo} \\; 10000    \\\\
+  & y_0 = S_{6n - 4} \\; \text{modulo} \\; 10000    \\\\   & z_0 = S_{6n - 3} \\; \text{modulo} \\; 10000    \\\\
+  & dx = 1 + (S_{6n - 2} \\; \text{modulo} \\; 399) \\\\   & dy = 1 + (S_{6n - 1} \\; \text{modulo} \\; 399) \\\\
+  & dz = 1 + (S_{6n} \\; \text{modulo} \\; 399)     \\\\ \end{align}$$
 
-where S1,...,S300000 come from the "Lagged Fibonacci Generator":
+where $S_1, \ldots, S_{300000}$ come from the "Lagged Fibonacci Generator":
 
-For 1 ≤ k ≤ 55, Sk = \[100003 - 200003k + 300007k3] (modulo 1000000)For 56 ≤ k, Sk = \[Sk-24 + Sk-55] (modulo 1000000)
+For $1 ≤ k ≤ 55$, $S_k = [100003 - 200003k + 300007k^3] \\; (modulo \\; 1000000)$
 
-Thus, C1 has parameters {(7,53,183),(94,369,56)}, C2 has parameters {(2383,3563,5079),(42,212,344)}, and so on.
+For $56 ≤ k$, $S_k = [S_{k - 24} + S_{k - 55}] \\; (modulo \\; 1000000)$
 
-The combined volume of the first 100 cuboids, C1,...,C100, is 723581599.
+Thus, $C_1$ has parameters $\{(7,53,183), (94,369,56)\}$, $C_2$ has parameters $\{(2383,3563,5079), (42,212,344)\}$, and so on.
 
-What is the combined volume of all 50000 cuboids, C1,...,C50000 ?
+The combined volume of the first 100 cuboids, $C_1, \ldots, C_{100}$, is 723581599.
+
+What is the combined volume of all 50000 cuboids, $C_1, \ldots, C_{50000}$?
 
 # --hints--
 
-`euler212()` should return 328968937309.
+`combinedValueOfCuboids()` should return `328968937309`.
 
 ```js
-assert.strictEqual(euler212(), 328968937309);
+assert.strictEqual(combinedValueOfCuboids(), 328968937309);
 ```
 
 # --seed--
@@ -37,12 +42,12 @@ assert.strictEqual(euler212(), 328968937309);
 ## --seed-contents--
 
 ```js
-function euler212() {
+function combinedValueOfCuboids() {
 
   return true;
 }
 
-euler212();
+combinedValueOfCuboids();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-213-flea-circus.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-213-flea-circus.md
index 2fbc23393c1..a18eb635255 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-213-flea-circus.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-213-flea-circus.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4411000cf542c50ff54
 title: 'Problem 213: Flea Circus'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301855
 dashedName: problem-213-flea-circus
 ---
@@ -16,10 +16,10 @@ What is the expected number of unoccupied squares after 50 rings of the bell? Gi
 
 # --hints--
 
-`euler213()` should return 330.721154.
+`fleaCircus()` should return `330.721154`.
 
 ```js
-assert.strictEqual(euler213(), 330.721154);
+assert.strictEqual(fleaCircus(), 330.721154);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler213(), 330.721154);
 ## --seed-contents--
 
 ```js
-function euler213() {
+function fleaCircus() {
 
   return true;
 }
 
-euler213();
+fleaCircus();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-214-totient-chains.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-214-totient-chains.md
index 754596cef69..497d541bc82 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-214-totient-chains.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-214-totient-chains.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f4421000cf542c50ff55
 title: 'Problem 214: Totient Chains'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301856
 dashedName: problem-214-totient-chains
 ---
 
 # --description--
 
-Let φ be Euler's totient function, i.e. for a natural number n,
+Let $φ$ be Euler's totient function, i.e. for a natural number $n$, $φ(n)$ is the number of $k$, $1 ≤ k ≤ n$, for which $gcd(k,n) = 1$.
 
-φ(n) is the number of k, 1 ≤ k ≤ n, for which gcd(k,n) = 1.
+By iterating $φ$, each positive integer generates a decreasing chain of numbers ending in 1. E.g. if we start with 5 the sequence 5,4,2,1 is generated. Here is a listing of all chains with length 4:
 
-By iterating φ, each positive integer generates a decreasing chain of numbers ending in 1. E.g. if we start with 5 the sequence 5,4,2,1 is generated. Here is a listing of all chains with length 4:
-
-5,4,2,1 7,6,2,1 8,4,2,1 9,6,2,1 10,4,2,1 12,4,2,1 14,6,2,1 18,6,2,1
+$$\begin{align}    5,4,2,1 & \\\\
+   7,6,2,1 & \\\\    8,4,2,1 & \\\\
+   9,6,2,1 & \\\\   10,4,2,1 & \\\\
+  12,4,2,1 & \\\\   14,6,2,1 & \\\\
+  18,6,2,1 & \end{align}$$
 
 Only two of these chains start with a prime, their sum is 12.
 
-What is the sum of all primes less than 40000000 which generate a chain of length 25?
+What is the sum of all primes less than $40\\,000\\,000$ which generate a chain of length 25?
 
 # --hints--
 
-`euler214()` should return 1677366278943.
+`totientChains()` should return `1677366278943`.
 
 ```js
-assert.strictEqual(euler214(), 1677366278943);
+assert.strictEqual(totientChains(), 1677366278943);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler214(), 1677366278943);
 ## --seed-contents--
 
 ```js
-function euler214() {
+function totientChains() {
 
   return true;
 }
 
-euler214();
+totientChains();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md
index 45f7f563e73..4e0f214b938 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4431000cf542c50ff56
 title: 'Problem 215: Crack-free Walls'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301857
 dashedName: problem-215-crack-free-walls
 ---
@@ -12,16 +12,18 @@ Consider the problem of building a wall out of 2×1 and 3×1 bricks (horizontal
 
 For example, the following 9×3 wall is not acceptable due to the running crack shown in red:
 
-There are eight ways of forming a crack-free 9×3 wall, written W(9,3) = 8.
+<img class="img-responsive center-block" alt="9x3 wall with one lined up gap between horizontally-adjacent bricks" src="https://cdn.freecodecamp.org/curriculum/project-euler/crack-free-walls.gif" style="background-color: white; padding: 10px;" />
 
-Calculate W(32,10).
+There are eight ways of forming a crack-free 9×3 wall, written $W(9,3) = 8$.
+
+Calculate $W(32,10)$.
 
 # --hints--
 
-`euler215()` should return 806844323190414.
+`crackFreeWalls()` should return `806844323190414`.
 
 ```js
-assert.strictEqual(euler215(), 806844323190414);
+assert.strictEqual(crackFreeWalls(), 806844323190414);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler215(), 806844323190414);
 ## --seed-contents--
 
 ```js
-function euler215() {
+function crackFreeWalls() {
 
   return true;
 }
 
-euler215();
+crackFreeWalls();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md
index e7591cd46f5..a528915ab9a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f4451000cf542c50ff57
 title: 'Problem 216: Investigating the primality of numbers of the form 2n2-1'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301858
 dashedName: problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1
 ---
 
 # --description--
 
-Consider numbers t(n) of the form t(n) = 2n2-1 with n > 1.
+Consider numbers $t(n)$ of the form $t(n) = 2n^2 - 1$ with $n > 1$.
 
 The first such numbers are 7, 17, 31, 49, 71, 97, 127 and 161.
 
-It turns out that only 49 = 7\*7 and 161 = 7\*23 are not prime.
+It turns out that only $49 = 7 \times 7$ and $161 = 7 \times 23$ are not prime.
 
-For n ≤ 10000 there are 2202 numbers t(n) that are prime.
+For $n ≤ 10000$ there are 2202 numbers $t(n)$ that are prime.
 
-How many numbers t(n) are prime for n ≤ 50,000,000 ?
+How many numbers $t(n)$ are prime for $n ≤ 50\\,000\\,000$?
 
 # --hints--
 
-`euler216()` should return 5437849.
+`primalityOfNumbers()` should return `5437849`.
 
 ```js
-assert.strictEqual(euler216(), 5437849);
+assert.strictEqual(primalityOfNumbers(), 5437849);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler216(), 5437849);
 ## --seed-contents--
 
 ```js
-function euler216() {
+function primalityOfNumbers() {
 
   return true;
 }
 
-euler216();
+primalityOfNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md
index 625b4a6c6d2..f685410fcd3 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f4461000cf542c50ff58
 title: 'Problem 217: Balanced Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301859
 dashedName: problem-217-balanced-numbers
 ---
 
 # --description--
 
-A positive integer with k (decimal) digits is called balanced if its first ⌈k/2⌉ digits sum to the same value as its last ⌈k/2⌉ digits, where ⌈x⌉, pronounced ceiling of x, is the smallest integer ≥ x, thus ⌈π⌉ = 4 and ⌈5⌉ = 5.
+A positive integer with $k$ (decimal) digits is called balanced if its first $⌈\frac{k}{2}⌉$ digits sum to the same value as its last $⌈\frac{k}{2}⌉$ digits, where $⌈x⌉$, pronounced ceiling of $x$, is the smallest integer $≥ x$, thus $⌈π⌉ = 4$ and $⌈5⌉ = 5$.
 
 So, for example, all palindromes are balanced, as is 13722.
 
-Let T(n) be the sum of all balanced numbers less than 10n.
+Let $T(n)$ be the sum of all balanced numbers less than $10^n$.
 
-Thus: T(1) = 45, T(2) = 540 and T(5) = 334795890.
+Thus: $T(1) = 45$, $T(2) = 540$ and $T(5) = 334\\,795\\,890$.
 
-Find T(47) mod 315
+Find $T(47)\\,mod\\,3^{15}$
 
 # --hints--
 
-`euler217()` should return 6273134.
+`balancedNumbers()` should return `6273134`.
 
 ```js
-assert.strictEqual(euler217(), 6273134);
+assert.strictEqual(balancedNumbers(), 6273134);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler217(), 6273134);
 ## --seed-contents--
 
 ```js
-function euler217() {
+function balancedNumbers() {
 
   return true;
 }
 
-euler217();
+balancedNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.md
index db91d74874e..1d29c005426 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.md
@@ -1,33 +1,39 @@
 ---
 id: 5900f4461000cf542c50ff59
 title: 'Problem 218: Perfect right-angled triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301860
 dashedName: problem-218-perfect-right-angled-triangles
 ---
 
 # --description--
 
-Consider the right angled triangle with sides a=7, b=24 and c=25.
+Consider the right-angled triangle with sides $a=7$, $b=24$ and $c=25$.
 
 The area of this triangle is 84, which is divisible by the perfect numbers 6 and 28.
 
-Moreover it is a primitive right angled triangle as gcd(a,b)=1 and gcd(b,c)=1.
+Moreover it is a primitive right-angled triangle as $gcd(a,b) = 1$ and $gcd(b,c) = 1$.
 
-Also c is a perfect square.
+Also $c$ is a perfect square.
 
-We will call a right angled triangle perfect if -it is a primitive right angled triangle -its hypotenuse is a perfect square
+We will call a right-angled triangle perfect if:
 
-We will call a right angled triangle super-perfect if -it is a perfect right angled triangle and -its area is a multiple of the perfect numbers 6 and 28.
+- it is a primitive right-angled triangle
+- its hypotenuse is a perfect square
 
-How many perfect right-angled triangles with c≤1016 exist that are not super-perfect?
+We will call a right-angled triangle super-perfect if:
+
+- it is a perfect right-angled triangle
+- its area is a multiple of the perfect numbers 6 and 28.
+
+How many perfect right-angled triangles with $c ≤ {10}^{16}$ exist that are not super-perfect?
 
 # --hints--
 
-`euler218()` should return 0.
+`perfectRightAngledTriangles()` should return `0`.
 
 ```js
-assert.strictEqual(euler218(), 0);
+assert.strictEqual(perfectRightAngledTriangles(), 0);
 ```
 
 # --seed--
@@ -35,12 +41,12 @@ assert.strictEqual(euler218(), 0);
 ## --seed-contents--
 
 ```js
-function euler218() {
+function perfectRightAngledTriangles() {
 
   return true;
 }
 
-euler218();
+perfectRightAngledTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md
index 1fccaef107f..e58e3c3f3ec 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md
@@ -1,31 +1,40 @@
 ---
 id: 5900f4481000cf542c50ff5b
 title: 'Problem 220: Heighway Dragon'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301863
 dashedName: problem-220-heighway-dragon
 ---
 
 # --description--
 
-Let D0 be the two-letter string "Fa". For n≥1, derive Dn from Dn-1 by the string-rewriting rules:
+Let $D_0$ be the two-letter string "Fa". For $n ≥ 1$, derive $D_n$ from $D_{n - 1}$ by the string-rewriting rules:
 
-"a" → "aRbFR" "b" → "LFaLb"
+- "a" → "aRbFR"
+- "b" → "LFaLb"
 
-Thus, D0 = "Fa", D1 = "FaRbFR", D2 = "FaRbFRRLFaLbFR", and so on.
+Thus, $D_0$ = "Fa", $D_1$ = "FaRbFR", $D_2$ = "FaRbFRRLFaLbFR", and so on.
 
 These strings can be interpreted as instructions to a computer graphics program, with "F" meaning "draw forward one unit", "L" meaning "turn left 90 degrees", "R" meaning "turn right 90 degrees", and "a" and "b" being ignored. The initial position of the computer cursor is (0,0), pointing up towards (0,1).
 
-Then Dn is an exotic drawing known as the Heighway Dragon of order n. For example, D10 is shown below; counting each "F" as one step, the highlighted spot at (18,16) is the position reached after 500 steps.
+Then $D_n$ is an exotic drawing known as the Heighway Dragon of order $n$. For example, $D_{10}$ is shown below; counting each "F" as one step, the highlighted spot at (18,16) is the position reached after 500 steps.
 
-What is the position of the cursor after 1012 steps in D50 ? Give your answer in the form x,y with no spaces.
+<img class="img-responsive center-block" alt="drawing of the Heighway Dragon after 500 steps" src="https://cdn.freecodecamp.org/curriculum/project-euler/heighway-dragon.gif" style="background-color: white; padding: 10px;" />
+
+What is the position of the cursor after ${10}^{12}$ steps in $D_{50}$? Give your answer as a string in the form `x,y` with no spaces.
 
 # --hints--
 
-`euler220()` should return 139776, 963904.
+`heighwayDragon()` should return a string.
 
 ```js
-assert.strictEqual(euler220(), 139776, 963904);
+assert(typeof heighwayDragon() === 'string');
+```
+
+`heighwayDragon()` should return the string `139776,963904`.
+
+```js
+assert.strictEqual(heighwayDragon(), '139776,963904');
 ```
 
 # --seed--
@@ -33,12 +42,12 @@ assert.strictEqual(euler220(), 139776, 963904);
 ## --seed-contents--
 
 ```js
-function euler220() {
+function heighwayDragon() {
 
   return true;
 }
 
-euler220();
+heighwayDragon();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-221-alexandrian-integers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-221-alexandrian-integers.md
index 010d2bd57c9..df3a59ffbb0 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-221-alexandrian-integers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-221-alexandrian-integers.md
@@ -1,27 +1,32 @@
 ---
 id: 5900f4491000cf542c50ff5c
 title: 'Problem 221: Alexandrian Integers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301864
 dashedName: problem-221-alexandrian-integers
 ---
 
 # --description--
 
-We shall call a positive integer A an "Alexandrian integer", if there exist integers p, q, r such that: A = p · q · r and 1/A = 1/p + 1/q + 1/r
+We shall call a positive integer $A$ an "Alexandrian integer", if there exist integers $p$, $q$, $r$ such that:
 
-<!-- TODO Use MathJax -->
+$$A = p \times q \times r$$
 
-For example, 630 is an Alexandrian integer (p = 5, q = −7, r = −18). In fact, 630 is the 6th Alexandrian integer, the first 6 Alexandrian integers being: 6, 42, 120, 156, 420 and 630.
+y
+
+$$\frac{1}{A} = \frac{1}{p} + \frac{1}{q} + \frac{1}{r}$$
+
+
+For example, 630 is an Alexandrian integer ($p = 5$, $q = −7$, $r = −18$). In fact, 630 is the 6th Alexandrian integer, the first 6 Alexandrian integers being: 6, 42, 120, 156, 420 and 630.
 
 Find the 150000th Alexandrian integer.
 
 # --hints--
 
-`euler221()` should return 1884161251122450.
+`alexandrianIntegers()` should return `1884161251122450`.
 
 ```js
-assert.strictEqual(euler221(), 1884161251122450);
+assert.strictEqual(alexandrianIntegers(), 1884161251122450);
 ```
 
 # --seed--
@@ -29,12 +34,12 @@ assert.strictEqual(euler221(), 1884161251122450);
 ## --seed-contents--
 
 ```js
-function euler221() {
+function alexandrianIntegers() {
 
   return true;
 }
 
-euler221();
+alexandrianIntegers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md
index 423ce7ff8e6..cdb6a9c3977 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f44b1000cf542c50ff5d
 title: 'Problem 222: Sphere Packing'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301865
 dashedName: problem-222-sphere-packing
 ---
@@ -10,14 +10,14 @@ dashedName: problem-222-sphere-packing
 
 What is the length of the shortest pipe, of internal radius 50mm, that can fully contain 21 balls of radii 30mm, 31mm, ..., 50mm?
 
-Give your answer in micrometres (10-6 m) rounded to the nearest integer.
+Give your answer in micrometres (${10}^{-6}$ m) rounded to the nearest integer.
 
 # --hints--
 
-`euler222()` should return 1590933.
+`spherePacking()` should return `1590933`.
 
 ```js
-assert.strictEqual(euler222(), 1590933);
+assert.strictEqual(spherePacking(), 1590933);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler222(), 1590933);
 ## --seed-contents--
 
 ```js
-function euler222() {
+function spherePacking() {
 
   return true;
 }
 
-euler222();
+spherePacking();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.md
index 28f8d8f2143..7fdbc36cbc6 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.md
@@ -1,23 +1,23 @@
 ---
 id: 5900f44b1000cf542c50ff5e
 title: 'Problem 223: Almost right-angled triangles I'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301866
 dashedName: problem-223-almost-right-angled-triangles-i
 ---
 
 # --description--
 
-Let us call an integer sided triangle with sides a ≤ b ≤ c barely acute if the sides satisfy a2 + b2 = c2 + 1.
+Let us call an integer sided triangle with sides $a ≤ b ≤ c$ barely acute if the sides satisfy $a^2 + b^2 = c^2 + 1$.
 
-How many barely acute triangles are there with perimeter ≤ 25,000,000?
+How many barely acute triangles are there with perimeter $≤ 25\\,000\\,000$?
 
 # --hints--
 
-`euler223()` should return 61614848.
+`almostRightAngledTrianglesOne()` should return `61614848`.
 
 ```js
-assert.strictEqual(euler223(), 61614848);
+assert.strictEqual(almostRightAngledTrianglesOne(), 61614848);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler223(), 61614848);
 ## --seed-contents--
 
 ```js
-function euler223() {
+function almostRightAngledTrianglesOne() {
 
   return true;
 }
 
-euler223();
+almostRightAngledTrianglesOne();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md
index d9f557fd4a9..c9f9b44cb3f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md
@@ -1,23 +1,23 @@
 ---
 id: 5900f44e1000cf542c50ff5f
 title: 'Problem 224: Almost right-angled triangles II'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301867
 dashedName: problem-224-almost-right-angled-triangles-ii
 ---
 
 # --description--
 
-Let us call an integer sided triangle with sides a ≤ b ≤ c barely obtuse if the sides satisfy a2 + b2 = c2 - 1.
+Let us call an integer sided triangle with sides $a ≤ b ≤ c$ barely obtuse if the sides satisfy $a^2 + b^2 = c^2 - 1$.
 
-How many barely obtuse triangles are there with perimeter ≤ 75,000,000?
+How many barely obtuse triangles are there with perimeter $≤ 75\\,000\\,000$?
 
 # --hints--
 
-`euler224()` should return 4137330.
+`almostRightAngledTrianglesTwo()` should return `4137330`.
 
 ```js
-assert.strictEqual(euler224(), 4137330);
+assert.strictEqual(almostRightAngledTrianglesTwo(), 4137330);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler224(), 4137330);
 ## --seed-contents--
 
 ```js
-function euler224() {
+function almostRightAngledTrianglesTwo() {
 
   return true;
 }
 
-euler224();
+almostRightAngledTrianglesTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md
index ff5fb05c1a7..2221b445314 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f44e1000cf542c50ff60
 title: 'Problem 225: Tribonacci non-divisors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301868
 dashedName: problem-225-tribonacci-non-divisors
 ---
@@ -10,18 +10,18 @@ dashedName: problem-225-tribonacci-non-divisors
 
 The sequence 1, 1, 1, 3, 5, 9, 17, 31, 57, 105, 193, 355, 653, 1201 ...
 
-is defined by T1 = T2 = T3 = 1 and Tn = Tn-1 + Tn-2 + Tn-3.
+is defined by $T_1 = T_2 = T_3 = 1$ and $T_n = T_{n - 1} + T_{n - 2} + T_{n - 3}$.
 
-It can be shown that 27 does not divide any terms of this sequence.In fact, 27 is the first odd number with this property.
+It can be shown that 27 does not divide any terms of this sequence. In fact, 27 is the first odd number with this property.
 
-Find the 124th odd number that does not divide any terms of the above sequence.
+Find the ${124}^{\text{th}}$ odd number that does not divide any terms of the above sequence.
 
 # --hints--
 
-`euler225()` should return 2009.
+`tribonacciNonDivisors()` should return `2009`.
 
 ```js
-assert.strictEqual(euler225(), 2009);
+assert.strictEqual(tribonacciNonDivisors(), 2009);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler225(), 2009);
 ## --seed-contents--
 
 ```js
-function euler225() {
+function tribonacciNonDivisors() {
 
   return true;
 }
 
-euler225();
+tribonacciNonDivisors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.md
index 3aadacc50b8..fd8031f2594 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f4511000cf542c50ff62
 title: 'Problem 226: A Scoop of Blancmange'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301869
 dashedName: problem-226-a-scoop-of-blancmange
 ---
 
 # --description--
 
-The blancmange curve is the set of points (x,y) such that 0 ≤ x ≤ 1 and ,where s(x) = the distance from x to the nearest integer.
+The blancmange curve is the set of points ($x$,$y$) such that $0 ≤ x ≤ 1$ and $\displaystyle y = \sum_{n = 0}^{\infty} \frac{s(2^nx)}{2^n}$, where $s(x)$ is the distance from $x$ to the nearest integer.
 
-The area under the blancmange curve is equal to ½, shown in pink in the diagram below.
+The area under the blancmange curve is equal to $\frac{1}{2}$, shown in pink in the diagram below.
 
-Let C be the circle with centre (¼,½) and radius ¼, shown in black in the diagram.
+<img class="img-responsive center-block" alt="diagram of blancmange curve, with circle C shown on diagram" src="https://cdn.freecodecamp.org/curriculum/project-euler/a-scoop-of-blancmange.gif" style="background-color: white; padding: 10px;" />
 
-What area under the blancmange curve is enclosed by C?Give your answer rounded to eight decimal places in the form 0.abcdefgh
+Let $C$ be the circle with centre ($\frac{1}{4}$,$\frac{1}{2}$) and radius $\frac{1}{4}$, shown in black in the diagram.
+
+What area under the blancmange curve is enclosed by $C$? Give your answer rounded to eight decimal places in the form 0.abcdefgh
 
 # --hints--
 
-`euler226()` should return 0.11316017.
+`scoopOfBlancmange()` should return `0.11316017`.
 
 ```js
-assert.strictEqual(euler226(), 0.11316017);
+assert.strictEqual(scoopOfBlancmange(), 0.11316017);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler226(), 0.11316017);
 ## --seed-contents--
 
 ```js
-function euler226() {
+function scoopOfBlancmange() {
 
   return true;
 }
 
-euler226();
+scoopOfBlancmange();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-227-the-chase.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-227-the-chase.md
index aff8e9b9340..3121c6ac8d8 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-227-the-chase.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-227-the-chase.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f44f1000cf542c50ff61
 title: 'Problem 227: The Chase'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301870
 dashedName: problem-227-the-chase
 ---
@@ -10,16 +10,24 @@ dashedName: problem-227-the-chase
 
 "The Chase" is a game played with two dice and an even number of players.
 
-The players sit around a table; the game begins with two opposite players having one die each. On each turn, the two players with a die roll it. If a player rolls a 1, he passes the die to his neighbour on the left; if he rolls a 6, he passes the die to his neighbour on the right; otherwise, he keeps the die for the next turn. The game ends when one player has both dice after they have been rolled and passed; that player has then lost.
+The players sit around a table; the game begins with two opposite players having one die each. On each turn, the two players with a die roll it.
+
+If the player rolls a 1, he passes the die to his neighbour on the left.
+
+If the player rolls a 6, he passes the die to his neighbour on the right.
+
+Otherwise, he keeps the die for the next turn.
+
+The game ends when one player has both dice after they have been rolled and passed; that player has then lost.
 
 In a game with 100 players, what is the expected number of turns the game lasts? Give your answer rounded to ten significant digits.
 
 # --hints--
 
-`euler227()` should return 3780.618622.
+`theChase()` should return `3780.618622`.
 
 ```js
-assert.strictEqual(euler227(), 3780.618622);
+assert.strictEqual(theChase(), 3780.618622);
 ```
 
 # --seed--
@@ -27,12 +35,12 @@ assert.strictEqual(euler227(), 3780.618622);
 ## --seed-contents--
 
 ```js
-function euler227() {
+function theChase() {
 
   return true;
 }
 
-euler227();
+theChase();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md
index 3ee325d2be7..3bccd240ed2 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md
@@ -1,41 +1,34 @@
 ---
 id: 5900f4511000cf542c50ff63
 title: 'Problem 228: Minkowski Sums'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301871
 dashedName: problem-228-minkowski-sums
 ---
 
 # --description--
 
-<!-- TODO Use MathJax and re-write from projecteuler.net -->
+Let $S_n$ be the regular $n$-sided polygon – or shape – whose vertices $v_k (k = 1, 2, \ldots, n)$ have coordinates:
 
-Let Sn be the regular n-sided polygon – or shape – whose vertices
+$$\begin{align}   & x_k = cos(\frac{2k - 1}{n} × 180°) \\\\
+  & y_k = sin(\frac{2k - 1}{n} × 180°) \end{align}$$
 
-vk (k = 1,2,…,n) have coordinates:
+Each $S_n$ is to be interpreted as a filled shape consisting of all points on the perimeter and in the interior.
 
-xk = cos( 2k-1/n ×180° )
+The Minkowski sum, $S + T$, of two shapes $S$ and $T$ is the result of adding every point in $S$ to every point in $T$, where point addition is performed coordinate-wise: $(u, v) + (x, y) = (u + x, v + y)$.
 
-yk = sin( 2k-1/n ×180° )
+For example, the sum of $S_3$ and $S_4$ is the six-sided shape shown in pink below:
 
-Each Sn is to be interpreted as a filled shape consisting of all points on the perimeter and in the interior.
+<img class="img-responsive center-block" alt="image showing S_3, S_4 and S_3 + S_4" src="https://cdn.freecodecamp.org/curriculum/project-euler/minkowski-sums.png" style="background-color: white; padding: 10px;" />
 
-The Minkowski sum, S+T, of two shapes S and T is the result of
-
-adding every point in S to every point in T, where point addition is performed coordinate-wise:
-
-(u, v) + (x, y) = (u+x, v+y).
-
-For example, the sum of S3 and S4 is the six-sided shape shown in pink below:
-
-How many sides does S1864 + S1865 + … + S1909 have?
+How many sides does $S_{1864} + S_{1865} + \ldots + S_{1909}$ have?
 
 # --hints--
 
-`euler228()` should return 86226.
+`minkowskiSums()` should return `86226`.
 
 ```js
-assert.strictEqual(euler228(), 86226);
+assert.strictEqual(minkowskiSums(), 86226);
 ```
 
 # --seed--
@@ -43,12 +36,12 @@ assert.strictEqual(euler228(), 86226);
 ## --seed-contents--
 
 ```js
-function euler228() {
+function minkowskiSums() {
 
   return true;
 }
 
-euler228();
+minkowskiSums();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md
index 0431ab815bd..3903d30320f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4521000cf542c50ff64
 title: 'Problem 229: Four Representations using Squares'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301872
 dashedName: problem-229-four-representations-using-squares
 ---
@@ -10,26 +10,30 @@ dashedName: problem-229-four-representations-using-squares
 
 Consider the number 3600. It is very special, because
 
-3600 = 482 + 362 3600 = 202 + 2×402 3600 = 302 + 3×302 3600 = 452 + 7×152
+$$\begin{align}   & 3600 = {48}^2 + {36}^2   \\\\
+  & 3600 = {20}^2 + {2×40}^2 \\\\   & 3600 = {30}^2 + {3×30}^2 \\\\
+  & 3600 = {45}^2 + {7×15}^2 \\\\ \end{align}$$
 
-Similarly, we find that 88201 = 992 + 2802 = 2872 + 2×542 = 2832 + 3×522 = 1972 + 7×842.
+Similarly, we find that $88201 = {99}^2 + {280}^2 = {287}^2 + 2 × {54}^2 = {283}^2 + 3 × {52}^2 = {197}^2 + 7 × {84}^2$.
 
-In 1747, Euler proved which numbers are representable as a sum of two squares. We are interested in the numbers n which admit representations of all of the following four types:
+In 1747, Euler proved which numbers are representable as a sum of two squares. We are interested in the numbers $n$ which admit representations of all of the following four types:
 
-n = a12 + b12n = a22 + 2 b22n = a32 + 3 b32n = a72 + 7 b72,
+$$\begin{align}   & n = {a_1}^2 + {b_1}^2  \\\\
+  & n = {a_2}^2 + 2{b_2}^2 \\\\   & n = {a_3}^2 + 3{b_3}^2 \\\\
+  & n = {a_7}^2 + 7{b_7}^2 \\\\ \end{align}$$
 
-where the ak and bk are positive integers.
+where the $a_k$ and $b_k$ are positive integers.
 
-There are 75373 such numbers that do not exceed 107.
+There are 75373 such numbers that do not exceed ${10}^7$.
 
-How many such numbers are there that do not exceed 2×109?
+How many such numbers are there that do not exceed $2 × {10}^9$?
 
 # --hints--
 
-`euler229()` should return 11325263.
+`representationsUsingSquares()` should return `11325263`.
 
 ```js
-assert.strictEqual(euler229(), 11325263);
+assert.strictEqual(representationsUsingSquares(), 11325263);
 ```
 
 # --seed--
@@ -37,12 +41,12 @@ assert.strictEqual(euler229(), 11325263);
 ## --seed-contents--
 
 ```js
-function euler229() {
+function representationsUsingSquares() {
 
   return true;
 }
 
-euler229();
+representationsUsingSquares();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md
index 16ea3131991..32adf3c6d3a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md
@@ -1,39 +1,47 @@
 ---
 id: 5900f4531000cf542c50ff65
 title: 'Problem 230: Fibonacci Words'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301874
 dashedName: problem-230-fibonacci-words
 ---
 
 # --description--
 
-For any two strings of digits, A and B, we define FA,B to be the sequence (A,B,AB,BAB,ABBAB,...) in which each term is the concatenation of the previous two.
+For any two strings of digits, $A$ and $B$, we define $F_{A,B}$ to be the sequence ($A, B, AB, BAB, ABBAB, \ldots$) in which each term is the concatenation of the previous two.
 
-Further, we define DA,B(n) to be the nth digit in the first term of FA,B that contains at least n digits.
+Further, we define $D_{A,B}(n)$ to be the $n^{\text{th}}$ digit in the first term of $F_{A,B}$ that contains at least $n$ digits.
 
-Example:
+Ejemplo:
 
-Let A=1415926535, B=8979323846. We wish to find DA,B(35), say.
+Let $A = 1\\,415\\,926\\,535$, $B = 8\\,979\\,323\\,846$. We wish to find $D_{A,B}(35)$, say.
 
-The first few terms of FA,B are: 1415926535 8979323846 14159265358979323846 897932384614159265358979323846 14159265358979323846897932384614159265358979323846
+The first few terms of $F_{A,B}$ are:
 
-Then DA,B(35) is the 35th digit in the fifth term, which is 9.
+$$\begin{align}   & 1\\,415\\,926\\,535 \\\\
+  & 8\\,979\\,323\\,846 \\\\   & 14\\,159\\,265\\,358\\,979\\,323\\,846 \\\\
+  & 897\\,932\\,384\\,614\\,159\\,265\\,358\\,979\\,323\\,846 \\\\ & 14\\,159\\,265\\,358\\,979\\,323\\,846\\,897\\,932\\,384\\,614\\,15\color{red}{9}\\,265\\,358\\,979\\,323\\,846 \end{align}$$
 
-Now we use for A the first 100 digits of π behind the decimal point: 14159265358979323846264338327950288419716939937510 58209749445923078164062862089986280348253421170679
+Then $D_{A,B}(35)$ is the ${35}^{\text{th}}$ digit in the fifth term, which is 9.
 
-and for B the next hundred digits:
+Now we use for $A$ the first 100 digits of $π$ behind the decimal point:
 
-82148086513282306647093844609550582231725359408128 48111745028410270193852110555964462294895493038196 .
+$$\begin{align}   & 14\\,159\\,265\\,358\\,979\\,323\\,846\\,264\\,338\\,327\\,950\\,288\\,419\\,716\\,939\\,937\\,510 \\\\
+  & 58\\,209\\,749\\,445\\,923\\,078\\,164\\,062\\,862\\,089\\,986\\,280\\,348\\,253\\,421\\,170\\,679 \end{align}$$
 
-Find ∑n = 0,1,...,17 10n× DA,B((127+19n)×7n) .
+and for $B$ the next hundred digits:
+
+$$\begin{align}   & 82\\,148\\,086\\,513\\,282\\,306\\,647\\,093\\,844\\,609\\,550\\,582\\,231\\,725\\,359\\,408\\,128 \\\\
+  & 48\\,111\\,745\\,028\\,410\\,270\\,193\\,852\\,110\\,555\\,964\\,462\\,294\\,895\\,493\\,038\\,196 \end{align}$$
+
+Find $\sum_{n = 0, 1, \ldots, 17} {10}^n × D_{A,B}((127 + 19n) × 7^n)$.
 
 # --hints--
 
-`euler230()` should return 850481152593119200.
+`fibonacciWords()` should return `850481152593119200`.
 
 ```js
-assert.strictEqual(euler230(), 850481152593119200);
+assert.strictEqual(fibonacciWords(), 850481152593119200);
 ```
 
 # --seed--
@@ -41,12 +49,12 @@ assert.strictEqual(euler230(), 850481152593119200);
 ## --seed-contents--
 
 ```js
-function euler230() {
+function fibonacciWords() {
 
   return true;
 }
 
-euler230();
+fibonacciWords();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md
index c313225c729..bab6a6a0c19 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4531000cf542c50ff66
-title: 'Problem 231: The prime factorisation of binomial coefficients'
-challengeType: 5
+title: 'Problema 231: Factorización prima de coeficientes binomiales'
+challengeType: 1
 forumTopicId: 301875
 dashedName: problem-231-the-prime-factorisation-of-binomial-coefficients
 ---
 
 # --description--
 
-The binomial coefficient 10C3 = 120.
+El coeficiente binomial $\displaystyle\binom{10}{3} = 120$.
 
-120 = 23 × 3 × 5 = 2 × 2 × 2 × 3 × 5, and 2 + 2 + 2 + 3 + 5 = 14.
+$120 = 2^3 × 3 × 5 = 2 × 2 × 2 × 3 × 5$, y $2 + 2 + 2 + 3 + 5 = 14$.
 
-So the sum of the terms in the prime factorisation of 10C3 is 14.
+Entonces la suma de los términos en la factorización prima de $\displaystyle\binom{10}{3}$ es $14$.
 
-Find the sum of the terms in the prime factorisation of 20000000C15000000.
+Encuentra la suma de los términos en la factorización prima de $\binom{20\\,000\\,000}{15\\,000\\,000}$.
 
 # --hints--
 
-`euler231()` should return 7526965179680.
+`primeFactorisation()` debe devolver `7526965179680`.
 
 ```js
-assert.strictEqual(euler231(), 7526965179680);
+assert.strictEqual(primeFactorisation(), 7526965179680);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler231(), 7526965179680);
 ## --seed-contents--
 
 ```js
-function euler231() {
+function primeFactorisation() {
 
   return true;
 }
 
-euler231();
+primeFactorisation();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-232-the-race.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-232-the-race.md
index c109669bd8a..c03c0d687b3 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-232-the-race.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-232-the-race.md
@@ -1,16 +1,22 @@
 ---
 id: 5900f4551000cf542c50ff67
 title: 'Problem 232: The Race'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301876
 dashedName: problem-232-the-race
 ---
 
 # --description--
 
-Two players share an unbiased coin and take it in turns to play "The Race". On Player 1's turn, he tosses the coin once: if it comes up Heads, he scores one point; if it comes up Tails, he scores nothing. On Player 2's turn, she chooses a positive integer T and tosses the coin T times: if it comes up all Heads, she scores 2T-1 points; otherwise, she scores nothing. Player 1 goes first. The winner is the first to 100 or more points.
+Two players share an unbiased coin and take it in turns to play "The Race".
 
-On each turn Player 2 selects the number, T, of coin tosses that maximises the probability of her winning.
+On Player 1's turn, he tosses the coin once: if it comes up Heads, he scores one point; if it comes up Tails, he scores nothing.
+
+On Player 2's turn, she chooses a positive integer $T$ and tosses the coin $T$ times: if it comes up all Heads, she scores $2^{T - 1}$ points; otherwise, she scores nothing.
+
+Player 1 goes first. The winner is the first to 100 or more points.
+
+On each turn Player 2 selects the number, $T$, of coin tosses that maximises the probability of her winning.
 
 What is the probability that Player 2 wins?
 
@@ -18,10 +24,10 @@ Give your answer rounded to eight decimal places in the form 0.abcdefgh .
 
 # --hints--
 
-`euler232()` should return 0.83648556.
+`theRace()` should return `0.83648556`.
 
 ```js
-assert.strictEqual(euler232(), 0.83648556);
+assert.strictEqual(theRace(), 0.83648556);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler232(), 0.83648556);
 ## --seed-contents--
 
 ```js
-function euler232() {
+function theRace() {
 
   return true;
 }
 
-euler232();
+theRace();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.md
index 5903d7e8c95..db650947233 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4551000cf542c50ff68
 title: 'Problem 233: Lattice points on a circle'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301877
 dashedName: problem-233-lattice-points-on-a-circle
 ---
 
 # --description--
 
-Let f(N) be the number of points with integer coordinates that are on a circle passing through (0,0), (N,0),(0,N), and (N,N).
+Let $f(N)$ be the number of points with integer coordinates that are on a circle passing through $(0,0)$, $(N,0)$,$(0,N)$, and $(N,N)$.
 
-It can be shown that f(10000) = 36.
+It can be shown that $f(10000) = 36$.
 
-What is the sum of all positive integers N ≤ 1011 such that f(N) = 420 ?
+What is the sum of all positive integers $N ≤ {10}^{11}$ such that $f(N) = 420$?
 
 # --hints--
 
-`euler233()` should return 271204031455541300.
+`latticePointsOnACircle()` should return `271204031455541300`.
 
 ```js
-assert.strictEqual(euler233(), 271204031455541300);
+assert.strictEqual(latticePointsOnACircle(), 271204031455541300);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler233(), 271204031455541300);
 ## --seed-contents--
 
 ```js
-function euler233() {
+function latticePointsOnACircle() {
 
   return true;
 }
 
-euler233();
+latticePointsOnACircle();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.md
index edf39ca239d..ec01ca36a28 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f4571000cf542c50ff69
 title: 'Problem 234: Semidivisible numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301878
 dashedName: problem-234-semidivisible-numbers
 ---
 
 # --description--
 
-For an integer n ≥ 4, we define the lower prime square root of n, denoted by lps(n), as the largest prime ≤ √n and the upper prime square root of n, ups(n), as the smallest prime ≥ √n.
+For an integer $n ≥ 4$, we define the lower prime square root of $n$, denoted by $lps(n)$, as the $\text{largest prime} ≤ \sqrt{n}$ and the upper prime square root of $n$, $ups(n)$, as the $\text{smallest prime} ≥ \sqrt{n}$.
 
-So, for example, lps(4) = 2 = ups(4), lps(1000) = 31, ups(1000) = 37.
+So, for example, $lps(4) = 2 = ups(4)$, $lps(1000) = 31$, $ups(1000) = 37$.
 
-Let us call an integer n ≥ 4 semidivisible, if one of lps(n) and ups(n) divides n, but not both.
+Let us call an integer $n ≥ 4$ semidivisible, if one of $lps(n)$ and $ups(n)$ divides $n$, but not both.
 
-The sum of the semidivisible numbers not exceeding 15 is 30, the numbers are 8, 10 and 12. 15 is not semidivisible because it is a multiple of both lps(15) = 3 and ups(15) = 5. As a further example, the sum of the 92 semidivisible numbers up to 1000 is 34825.
+The sum of the semidivisible numbers not exceeding 15 is 30, the numbers are 8, 10 and 12. 15 is not semidivisible because it is a multiple of both $lps(15) = 3$ and $ups(15) = 5$. As a further example, the sum of the 92 semidivisible numbers up to 1000 is 34825.
 
-What is the sum of all semidivisible numbers not exceeding 999966663333 ?
+What is the sum of all semidivisible numbers not exceeding 999966663333?
 
 # --hints--
 
-`euler234()` should return 1259187438574927000.
+`semidivisibleNumbers()` should return `1259187438574927000`.
 
 ```js
-assert.strictEqual(euler234(), 1259187438574927000);
+assert.strictEqual(semidivisibleNumbers(), 1259187438574927000);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler234(), 1259187438574927000);
 ## --seed-contents--
 
 ```js
-function euler234() {
+function semidivisibleNumbers() {
 
   return true;
 }
 
-euler234();
+semidivisibleNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.md
index 549fc0275de..893687367a5 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4571000cf542c50ff6a
 title: 'Problem 235: An Arithmetic Geometric sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301879
 dashedName: problem-235-an-arithmetic-geometric-sequence
 ---
 
 # --description--
 
-Given is the arithmetic-geometric sequence u(k) = (900-3k)rk-1.
+Given is the arithmetic-geometric sequence $u(k) = (900 - 3k)r^{k - 1}$.
 
-Let s(n) = Σk=1...nu(k).
+Let $s(n) = \sum_{k=1 \ldots n} u(k)$.
 
-Find the value of r for which s(5000) = -600,000,000,000.
+Find the value of $r$ for which $s(5000) = -600\\,000\\,000\\,000$.
 
 Give your answer rounded to 12 places behind the decimal point.
 
 # --hints--
 
-`euler235()` should return 1.002322108633.
+`arithmeticGeometricSequence()` should return `1.002322108633`.
 
 ```js
-assert.strictEqual(euler235(), 1.002322108633);
+assert.strictEqual(arithmeticGeometricSequence(), 1.002322108633);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler235(), 1.002322108633);
 ## --seed-contents--
 
 ```js
-function euler235() {
+function arithmeticGeometricSequence() {
 
   return true;
 }
 
-euler235();
+arithmeticGeometricSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md
index 01c7effbc3e..2ae12a0ab04 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4591000cf542c50ff6b
 title: 'Problem 236: Luxury Hampers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301881
 dashedName: problem-236-luxury-hampers
 ---
@@ -10,22 +10,39 @@ dashedName: problem-236-luxury-hampers
 
 Suppliers 'A' and 'B' provided the following numbers of products for the luxury hamper market:
 
-Product'A''B'Beluga Caviar5248640Christmas Cake13121888Gammon Joint26243776Vintage Port57603776Champagne Truffles39365664
+| Product            | 'A'  | 'B'  |
+| ------------------ | ---- | ---- |
+| Beluga Caviar      | 5248 | 640  |
+| Christmas Cake     | 1312 | 1888 |
+| Gammon Joint       | 2624 | 3776 |
+| Vintage Port       | 5760 | 3776 |
+| Champagne Truffles | 3936 | 5664 |
 
 Although the suppliers try very hard to ship their goods in perfect condition, there is inevitably some spoilage - i.e. products gone bad.
 
-The suppliers compare their performance using two types of statistic:The five per-product spoilage rates for each supplier are equal to the number of products gone bad divided by the number of products supplied, for each of the five products in turn. The overall spoilage rate for each supplier is equal to the total number of products gone bad divided by the total number of products provided by that supplier.To their surprise, the suppliers found that each of the five per-product spoilage rates was worse (higher) for 'B' than for 'A' by the same factor (ratio of spoilage rates), m>1; and yet, paradoxically, the overall spoilage rate was worse for 'A' than for 'B', also by a factor of m.
+The suppliers compare their performance using two types of statistic:
 
-There are thirty-five m>1 for which this surprising result could have occurred, the smallest of which is 1476/1475.
+- The five per-product spoilage rates for each supplier are equal to the number of products gone bad divided by the number of products supplied, for each of the five products in turn.
+- The overall spoilage rate for each supplier is equal to the total number of products gone bad divided by the total number of products provided by that supplier.
 
-What's the largest possible value of m? Give your answer as a fraction reduced to its lowest terms, in the form u/v.
+To their surprise, the suppliers found that each of the five per-product spoilage rates was worse (higher) for 'B' than for 'A' by the same factor (ratio of spoilage rates), $m > 1$; and yet, paradoxically, the overall spoilage rate was worse for 'A' than for 'B', also by a factor of $m$.
+
+There are thirty-five $m > 1$ for which this surprising result could have occurred, the smallest of which is $\frac{1476}{1475}$.
+
+What's the largest possible value of $m$? Give your answer as a string with fraction reduced to its lowest terms, in the form `u/v`.
 
 # --hints--
 
-`euler236()` should return 123 / 59.
+`luxuryHampers()` should return a string.
 
 ```js
-assert.strictEqual(euler236(), 123 / 59);
+assert(typeof luxuryHampers() === 'string');
+```
+
+`luxuryHampers()` should return the string `123/59`.
+
+```js
+assert.strictEqual(luxuryHampers(), '123/59');
 ```
 
 # --seed--
@@ -33,12 +50,12 @@ assert.strictEqual(euler236(), 123 / 59);
 ## --seed-contents--
 
 ```js
-function euler236() {
+function luxuryHampers() {
 
   return true;
 }
 
-euler236();
+luxuryHampers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md
index eec1076ec10..ef7c2a30c04 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md
@@ -1,33 +1,32 @@
 ---
 id: 5900f4591000cf542c50ff6c
 title: 'Problem 237: Tours on a 4 x n playing board'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301882
 dashedName: problem-237-tours-on-a-4-x-n-playing-board
 ---
 
 # --description--
 
-Let T(n) be the number of tours over a 4 × n playing board such that:
+Let $T(n)$ be the number of tours over a 4 × $n$ playing board such that:
 
-The tour starts in the top left corner.
-
-The tour consists of moves that are up, down, left, or right one square.
-
-The tour visits each square exactly once.
-
-The tour ends in the bottom left corner.
+- The tour starts in the top left corner.
+- The tour consists of moves that are up, down, left, or right one square.
+- The tour visits each square exactly once.
+- The tour ends in the bottom left corner.
 
 The diagram shows one tour over a 4 × 10 board:
 
-T(10) is 2329. What is T(1012) modulo 108?
+<img class="img-responsive center-block" alt="one tour over 4 x 10 board" src="https://cdn.freecodecamp.org/curriculum/project-euler/tours-on-a-4-x-n-playing-board.gif" style="background-color: white; padding: 10px;" />
+
+$T(10)$ is 2329. What is $T({10}^{12})$ modulo ${10}^8$?
 
 # --hints--
 
-`euler237()` should return 15836928.
+`toursOnPlayingBoard()` should return `15836928`.
 
 ```js
-assert.strictEqual(euler237(), 15836928);
+assert.strictEqual(toursOnPlayingBoard(), 15836928);
 ```
 
 # --seed--
@@ -35,12 +34,12 @@ assert.strictEqual(euler237(), 15836928);
 ## --seed-contents--
 
 ```js
-function euler237() {
+function toursOnPlayingBoard() {
 
   return true;
 }
 
-euler237();
+toursOnPlayingBoard();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md
index 4bb75276865..20f64eba19b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f45b1000cf542c50ff6d
 title: 'Problem 238: Infinite string tour'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301883
 dashedName: problem-238-infinite-string-tour
 ---
@@ -10,32 +10,33 @@ dashedName: problem-238-infinite-string-tour
 
 Create a sequence of numbers using the "Blum Blum Shub" pseudo-random number generator:
 
-s0 = 14025256 sn+1 = sn2 mod 20300713
+$$ s_0 = 14025256 \\\\
+s_{n + 1} = {s_n}^2 \\; mod \\; 20\\,300\\,713 $$
 
-Concatenate these numbers s0s1s2… to create a string w of infinite length. Then, w = 14025256741014958470038053646…
+Concatenate these numbers $s_0s_1s_2\ldots$ to create a string $w$ of infinite length. Then, $w = 14025256741014958470038053646\ldots$
 
-For a positive integer k, if no substring of w exists with a sum of digits equal to k, p(k) is defined to be zero. If at least one substring of w exists with a sum of digits equal to k, we define p(k) = z, where z is the starting position of the earliest such substring.
+For a positive integer $k$, if no substring of $w$ exists with a sum of digits equal to $k$, $p(k)$ is defined to be zero. If at least one substring of $w$ exists with a sum of digits equal to $k$, we define $p(k) = z$, where $z$ is the starting position of the earliest such substring.
 
-For instance:
+Por ejemplo:
 
-The substrings 1, 14, 1402, … with respective sums of digits equal to 1, 5, 7, … start at position 1, hence p(1) = p(5) = p(7) = … = 1.
+The substrings 1, 14, 1402, … with respective sums of digits equal to 1, 5, 7, … start at position 1, hence $p(1) = p(5) = p(7) = \ldots = 1$.
 
-The substrings 4, 402, 4025, … with respective sums of digits equal to 4, 6, 11, … start at position 2, hence p(4) = p(6) = p(11) = … = 2.
+The substrings 4, 402, 4025, … with respective sums of digits equal to 4, 6, 11, … start at position 2, hence $p(4) = p(6) = p(11) = \ldots = 2$.
 
-The substrings 02, 0252, … with respective sums of digits equal to 2, 9, … start at position 3, hence p(2) = p(9) = … = 3.
+The substrings 02, 0252, … with respective sums of digits equal to 2, 9, … start at position 3, hence $p(2) = p(9) = \ldots = 3$.
 
-Note that substring 025 starting at position 3, has a sum of digits equal to 7, but there was an earlier substring (starting at position 1) with a sum of digits equal to 7, so p(7) = 1, not 3.
+Note that substring 025 starting at position 3, has a sum of digits equal to 7, but there was an earlier substring (starting at position 1) with a sum of digits equal to 7, so $p(7) = 1$, not 3.
 
-We can verify that, for 0 &lt; k ≤ 103, ∑ p(k) = 4742.
+We can verify that, for $0 &lt; k ≤ {10}^3$, $\sum p(k) = 4742$.
 
-Find ∑ p(k), for 0 &lt; k ≤ 2·1015.
+Find $\sum p(k)$, for $0 &lt; k ≤ 2 \times {10}^{15}$.
 
 # --hints--
 
-`euler238()` should return 9922545104535660.
+`infiniteStringTour()` should return `9922545104535660`.
 
 ```js
-assert.strictEqual(euler238(), 9922545104535660);
+assert.strictEqual(infiniteStringTour(), 9922545104535660);
 ```
 
 # --seed--
@@ -43,12 +44,12 @@ assert.strictEqual(euler238(), 9922545104535660);
 ## --seed-contents--
 
 ```js
-function euler238() {
+function infiniteStringTour() {
 
   return true;
 }
 
-euler238();
+infiniteStringTour();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.md
index b68783fecf6..9fff8274ba8 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f45c1000cf542c50ff6e
 title: 'Problem 239: Twenty-two Foolish Primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301884
 dashedName: problem-239-twenty-two-foolish-primes
 ---
@@ -16,10 +16,10 @@ Give your answer rounded to 12 places behind the decimal point in the form 0.abc
 
 # --hints--
 
-`euler239()` should return 0.001887854841.
+`twentyTwoFoolishPrimes()` should return `0.001887854841`.
 
 ```js
-assert.strictEqual(euler239(), 0.001887854841);
+assert.strictEqual(twentyTwoFoolishPrimes(), 0.001887854841);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler239(), 0.001887854841);
 ## --seed-contents--
 
 ```js
-function euler239() {
+function twentyTwoFoolishPrimes() {
 
   return true;
 }
 
-euler239();
+twentyTwoFoolishPrimes();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-240-top-dice.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-240-top-dice.md
index 392edfa3dda..97f89f17305 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-240-top-dice.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-240-top-dice.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f45d1000cf542c50ff6f
 title: 'Problem 240: Top Dice'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301887
 dashedName: problem-240-top-dice
 ---
@@ -10,22 +10,18 @@ dashedName: problem-240-top-dice
 
 There are 1111 ways in which five 6-sided dice (sides numbered 1 to 6) can be rolled so that the top three sum to 15. Some examples are:
 
-D1,D2,D3,D4,D5 = 4,3,6,3,5
-
-D1,D2,D3,D4,D5 = 4,3,3,5,6
-
-D1,D2,D3,D4,D5 = 3,3,3,6,6
-
-D1,D2,D3,D4,D5 = 6,6,3,3,3
+$$\begin{align}   & D_1,D_2,D_3,D_4,D_5 = 4,3,6,3,5 \\\\
+  & D_1,D_2,D_3,D_4,D_5 = 4,3,3,5,6 \\\\   & D_1,D_2,D_3,D_4,D_5 = 3,3,3,6,6 \\\\
+  & D_1,D_2,D_3,D_4,D_5 = 6,6,3,3,3 \end{align}$$
 
 In how many ways can twenty 12-sided dice (sides numbered 1 to 12) be rolled so that the top ten sum to 70?
 
 # --hints--
 
-`euler240()` should return 7448717393364182000.
+`topDice()` should return `7448717393364182000`.
 
 ```js
-assert.strictEqual(euler240(), 7448717393364182000);
+assert.strictEqual(topDice(), 7448717393364182000);
 ```
 
 # --seed--
@@ -33,12 +29,12 @@ assert.strictEqual(euler240(), 7448717393364182000);
 ## --seed-contents--
 
 ```js
-function euler240() {
+function topDice() {
 
   return true;
 }
 
-euler240();
+topDice();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-241-perfection-quotients.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-241-perfection-quotients.md
index b80b7872cb4..492d3f61f8e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-241-perfection-quotients.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-241-perfection-quotients.md
@@ -1,25 +1,27 @@
 ---
 id: 5900f45d1000cf542c50ff70
 title: 'Problem 241: Perfection Quotients'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301888
 dashedName: problem-241-perfection-quotients
 ---
 
 # --description--
 
-For a positive integer n, let σ(n) be the sum of all divisors of n, so e.g. σ(6) = 1 + 2 + 3 + 6 = 12.
+For a positive integer $n$, let $σ(n)$ be the sum of all divisors of $n$, so e.g. $σ(6) = 1 + 2 + 3 + 6 = 12$.
 
-A perfect number, as you probably know, is a number with σ(n) = 2n.
+A perfect number, as you probably know, is a number with $σ(n) = 2n$.
 
-Let us define the perfection quotient of a positive integer asp(n)= σ(n)n . Find the sum of all positive integers n ≤ 1018 for which p(n) has the form k + 1⁄2, where k is an integer.
+Let us define the perfection quotient of a positive integer as $p(n) = \frac{σ(n)}{n}$.
+
+Find the sum of all positive integers $n ≤ {10}^{18}$ for which $p(n)$ has the form $k + \frac{1}{2}$, where $k$ is an integer.
 
 # --hints--
 
-`euler241()` should return 482316491800641150.
+`perfectionQuotients()` should return `482316491800641150`.
 
 ```js
-assert.strictEqual(euler241(), 482316491800641150);
+assert.strictEqual(perfectionQuotients(), 482316491800641150);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler241(), 482316491800641150);
 ## --seed-contents--
 
 ```js
-function euler241() {
+function perfectionQuotients() {
 
   return true;
 }
 
-euler241();
+perfectionQuotients();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-242-odd-triplets.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-242-odd-triplets.md
index c8eb8d360c5..abbcfca2a6a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-242-odd-triplets.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-242-odd-triplets.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f45f1000cf542c50ff71
 title: 'Problem 242: Odd Triplets'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301889
 dashedName: problem-242-odd-triplets
 ---
 
 # --description--
 
-Given the set {1,2,...,n}, we define f(n,k) as the number of its k-element subsets with an odd sum of elements. For example, f(5,3) = 4, since the set {1,2,3,4,5} has four 3-element subsets having an odd sum of elements, i.e.: {1,2,4}, {1,3,5}, {2,3,4} and {2,4,5}.
+Given the set {1,2,..., $n$}, we define $f(n, k)$ as the number of its $k$-element subsets with an odd sum of elements. For example, $f(5,3) = 4$, since the set {1,2,3,4,5} has four 3-element subsets having an odd sum of elements, i.e.: {1,2,4}, {1,3,5}, {2,3,4} and {2,4,5}.
 
-When all three values n, k and f(n,k) are odd, we say that they make an odd-triplet \[n,k,f(n,k)].
+When all three values $n$, $k$ and $f(n, k)$ are odd, we say that they make an odd-triplet $[n, k, f(n, k)]$.
 
-There are exactly five odd-triplets with n ≤ 10, namely: \[1,1,f(1,1) = 1], \[5,1,f(5,1) = 3], \[5,5,f(5,5) = 1], \[9,1,f(9,1) = 5] and \[9,9,f(9,9) = 1].
+There are exactly five odd-triplets with $n ≤ 10$, namely: $[1, 1, f(1, 1) = 1]$, $[5, 1, f(5, 1) = 3]$, $[5, 5, f(5, 5) = 1]$, $[9, 1, f(9, 1) = 5]$ and $[9, 9, f(9, 9) = 1]$.
 
-How many odd-triplets are there with n ≤ 1012 ?
+How many odd-triplets are there with $n ≤ {10}^{12}$?
 
 # --hints--
 
-`euler242()` should return 997104142249036700.
+`oddTriplets()` should return `997104142249036700`.
 
 ```js
-assert.strictEqual(euler242(), 997104142249036700);
+assert.strictEqual(oddTriplets(), 997104142249036700);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler242(), 997104142249036700);
 ## --seed-contents--
 
 ```js
-function euler242() {
+function oddTriplets() {
 
   return true;
 }
 
-euler242();
+oddTriplets();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-243-resilience.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-243-resilience.md
index 54c911233ab..67287eac731 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-243-resilience.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-243-resilience.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4601000cf542c50ff73
 title: 'Problem 243: Resilience'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301890
 dashedName: problem-243-resilience
 ---
@@ -10,18 +10,24 @@ dashedName: problem-243-resilience
 
 A positive fraction whose numerator is less than its denominator is called a proper fraction.
 
-For any denominator, d, there will be d−1 proper fractions; for example, with d = 12:1/12 , 2/12 , 3/12 , 4/12 , 5/12 , 6/12 , 7/12 , 8/12 , 9/12 , 10/12 , 11/12 .
+For any denominator, $d$, there will be $d−1$ proper fractions; for example, with $d = 12$:
 
-We shall call a fraction that cannot be cancelled down a resilient fraction. Furthermore we shall define the resilience of a denominator, R(d), to be the ratio of its proper fractions that are resilient; for example, R(12) = 4/11 . In fact, d = 12 is the smallest denominator having a resilience R(d) &lt; 4/10 .
+$$\frac{1}{12}, \frac{2}{12}, \frac{3}{12}, \frac{4}{12}, \frac{5}{12}, \frac{6}{12}, \frac{7}{12}, \frac{8}{12}, \frac{9}{12}, \frac{10}{12}, \frac{11}{12}$$
 
-Find the smallest denominator d, having a resilience R(d) &lt; 15499/94744 .
+We shall call a fraction that cannot be cancelled down a resilient fraction.
+
+Furthermore we shall define the resilience of a denominator, $R(d)$, to be the ratio of its proper fractions that are resilient; for example, $R(12) = \frac{4}{11}$.
+
+In fact, $d = 12$ is the smallest denominator having a resilience $R(d) &lt; \frac{4}{10}$.
+
+Find the smallest denominator $d$, having a resilience $R(d) &lt; \frac{15\\,499}{94\\,744}$.
 
 # --hints--
 
-`euler243()` should return 892371480.
+`resilience()` should return `892371480`.
 
 ```js
-assert.strictEqual(euler243(), 892371480);
+assert.strictEqual(resilience(), 892371480);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler243(), 892371480);
 ## --seed-contents--
 
 ```js
-function euler243() {
+function resilience() {
 
   return true;
 }
 
-euler243();
+resilience();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-244-sliders.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-244-sliders.md
index dfc2ef5931d..ebe4a76b838 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-244-sliders.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-244-sliders.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4601000cf542c50ff72
 title: 'Problem 244: Sliders'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301891
 dashedName: problem-244-sliders
 ---
@@ -10,28 +10,32 @@ dashedName: problem-244-sliders
 
 You probably know the game Fifteen Puzzle. Here, instead of numbered tiles, we have seven red tiles and eight blue tiles.
 
-A move is denoted by the uppercase initial of the direction (Left, Right, Up, Down) in which the tile is slid, e.g. starting from configuration (S), by the sequence LULUR we reach the configuration (E):
+A move is denoted by the uppercase initial of the direction (Left, Right, Up, Down) in which the tile is slid, e.g. starting from configuration ($S$), by the sequence $LULUR$ we reach the configuration ($E$):
 
-(S), (E)
+($S$) <img class="img-responsive" alt="configuration S" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliders-1.gif" style="display: inline-block; background-color: white; padding: 10px;" />, ($E$) <img class="img-responsive" alt="configuration E" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliders-2.gif" style="display: inline-block; background-color: white; padding: 10px;" />
 
 For each path, its checksum is calculated by (pseudocode):
 
-checksum = 0 checksum = (checksum × 243 + m1) mod 100 000 007 checksum = (checksum × 243 + m2) mod 100 000 007 … checksum = (checksum × 243 + mn) mod 100 000 007 where mk is the ASCII value of the kth letter in the move sequence and the ASCII values for the moves are:
+$$\begin{align}   & \text{checksum} = 0 \\\\
+  & \text{checksum} = (\text{checksum} × 243 + m_1) \\; \text{mod} \\; 100\\,000\\,007 \\\\   & \text{checksum} = (\text{checksum} × 243 + m_2) \\; \text{mod} \\; 100\\,000\\,007 \\\\
+  & \ldots \\\\ & \text{checksum} = (\text{checksum} × 243 + m_n) \\; \text{mod} \\; 100\\,000\\,007 \end{align}$$
 
-L76R82U85D68
+where $m_k$ is the ASCII value of the $k^{\text{th}}$ letter in the move sequence and the ASCII values for the moves are:
 
-For the sequence LULUR given above, the checksum would be 19761398. Now, starting from configuration (S), find all shortest ways to reach configuration (T).
+$$\begin{array}{|c|c|} \hline L & 76 \\\\ \hline R & 82 \\\\ \hline U & 85 \\\\ \hline D & 68 \\\\ \hline \end{array}$$
 
-(S), (T)
+For the sequence $LULUR$ given above, the checksum would be 19761398. Now, starting from configuration ($S$), find all shortest ways to reach configuration ($T$).
+
+($S$) <img class="img-responsive center-block" alt="configuration S" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliders-3.gif" style="display: inline-block; background-color: white; padding: 10px;" />, ($T$) <img class="img-responsive center-block" alt="configuration T" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliders-4.gif" style="display: inline-block; background-color: white; padding: 10px;" />
 
 What is the sum of all checksums for the paths having the minimal length?
 
 # --hints--
 
-`euler244()` should return 96356848.
+`sliders()` should return `96356848`.
 
 ```js
-assert.strictEqual(euler244(), 96356848);
+assert.strictEqual(sliders(), 96356848);
 ```
 
 # --seed--
@@ -39,12 +43,12 @@ assert.strictEqual(euler244(), 96356848);
 ## --seed-contents--
 
 ```js
-function euler244() {
+function sliders() {
 
   return true;
 }
 
-euler244();
+sliders();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-245-coresilience.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-245-coresilience.md
index 47fc69a5fab..c3e090d0edb 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-245-coresilience.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-245-coresilience.md
@@ -1,23 +1,31 @@
 ---
 id: 5900f4621000cf542c50ff74
 title: 'Problem 245: Coresilience'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301892
 dashedName: problem-245-coresilience
 ---
 
 # --description--
 
-We shall call a fraction that cannot be cancelled down a resilient fraction. Furthermore we shall define the resilience of a denominator, R(d), to be the ratio of its proper fractions that are resilient; for example, R(12) = 4⁄11.
+We shall call a fraction that cannot be cancelled down a resilient fraction.
 
-The resilience of a number d > 1 is then φ(d)d − 1 , where φ is Euler's totient function. We further define the coresilience of a number n > 1 as C(n)= n − φ(n)n − 1. The coresilience of a prime p is C(p) = 1p − 1. Find the sum of all composite integers 1 &lt; n ≤ 2×1011, for which C(n) is a unit fraction.
+Furthermore we shall define the resilience of a denominator, $R(d)$, to be the ratio of its proper fractions that are resilient; for example, $R(12) = \frac{4}{11}$.
+
+The resilience of a number $d > 1$ is then $\frac{φ(d)}{d − 1}$ , where $φ$ is Euler's totient function.
+
+We further define the coresilience of a number $n > 1$ as $C(n) = \frac{n − φ(n)}{n − 1}$.
+
+The coresilience of a prime $p$ is $C(p) = \frac{1}{p − 1}$.
+
+Find the sum of all composite integers $1 &lt; n ≤ 2 × {10}^{11}$, for which $C(n)$ is a unit fraction.
 
 # --hints--
 
-`euler245()` should return 288084712410001.
+`coresilience()` should return `288084712410001`.
 
 ```js
-assert.strictEqual(euler245(), 288084712410001);
+assert.strictEqual(coresilience(), 288084712410001);
 ```
 
 # --seed--
@@ -25,12 +33,12 @@ assert.strictEqual(euler245(), 288084712410001);
 ## --seed-contents--
 
 ```js
-function euler245() {
+function coresilience() {
 
   return true;
 }
 
-euler245();
+coresilience();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md
index 2d50a2e979d..16c5d89e23b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4621000cf542c50ff75
 title: 'Problem 246: Tangents to an ellipse'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301893
 dashedName: problem-246-tangents-to-an-ellipse
 ---
@@ -10,20 +10,32 @@ dashedName: problem-246-tangents-to-an-ellipse
 
 A definition for an ellipse is:
 
-Given a circle c with centre M and radius r and a point G such that d(G,M)
+Given a circle $c$ with centre $M$ and radius $r$ and a point $G$ such that $d(G, M) < r$, the locus of the points that are equidistant from $c$ and $G$ form an ellipse.
 
 The construction of the points of the ellipse is shown below.
 
-Given are the points M(-2000,1500) and G(8000,1500). Given is also the circle c with centre M and radius 15000. The locus of the points that are equidistant from G and c form an ellipse e. From a point P outside e the two tangents t1 and t2 to the ellipse are drawn. Let the points where t1 and t2 touch the ellipse be R and S.
+<img class="img-responsive center-block" alt="animation of ellipse construction" src="https://cdn.freecodecamp.org/curriculum/project-euler/tangents-to-an-ellipse-1.gif" style="background-color: white; padding: 10px;" />
 
-For how many lattice points P is angle RPS greater than 45 degrees?
+Given are the points $M(-2000, 1500)$ and $G(8000, 1500)$.
+
+Given is also the circle $c$ with centre $M$ and radius $15\\,000$.
+
+The locus of the points that are equidistant from $G$ and $c$ form an ellipse $e$.
+
+From a point $P$ outside $e$ the two tangents $t_1$ and $t_2$ to the ellipse are drawn.
+
+Let the points where $t_1$ and $t_2$ touch the ellipse be $R$ and $S$.
+
+<img class="img-responsive center-block" alt="circle c with the centre M, radius 15000, and point P outsie of ellipse e; from point P two tangents t_1 and t_2 are drawn to the ellipse, with points touching ellipse are R and S" src="https://cdn.freecodecamp.org/curriculum/project-euler/tangents-to-an-ellipse-2.gif" style="background-color: white; padding: 10px;" />
+
+For how many lattice points $P$ is angle $RPS$ greater than 45°?
 
 # --hints--
 
-`euler246()` should return 810834388.
+`tangentsToAnEllipse()` should return `810834388`.
 
 ```js
-assert.strictEqual(euler246(), 810834388);
+assert.strictEqual(tangentsToAnEllipse(), 810834388);
 ```
 
 # --seed--
@@ -31,12 +43,12 @@ assert.strictEqual(euler246(), 810834388);
 ## --seed-contents--
 
 ```js
-function euler246() {
+function tangentsToAnEllipse() {
 
   return true;
 }
 
-euler246();
+tangentsToAnEllipse();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md
index d9a5572eeac..d84036f8701 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md
@@ -1,27 +1,39 @@
 ---
 id: 5900f4641000cf542c50ff76
 title: 'Problem 247: Squares under a hyperbola'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301894
 dashedName: problem-247-squares-under-a-hyperbola
 ---
 
 # --description--
 
-Consider the region constrained by 1 ≤ x and 0 ≤ y ≤ 1/x.
+Consider the region constrained by $1 ≤ x$ and $0 ≤ y ≤ \frac{1}{x}$.
 
-Let S1 be the largest square that can fit under the curve. Let S2 be the largest square that fits in the remaining area, and so on. Let the index of Sn be the pair (left, below) indicating the number of squares to the left of Sn and the number of squares below Sn.
+Let $S_1$ be the largest square that can fit under the curve.
 
-The diagram shows some such squares labelled by number. S2 has one square to its left and none below, so the index of S2 is (1,0). It can be seen that the index of S32 is (1,1) as is the index of S50. 50 is the largest n for which the index of Sn is (1,1).
+Let $S_2$ be the largest square that fits in the remaining area, and so on.
 
-What is the largest n for which the index of Sn is (3,3)?
+Let the index of $S_n$ be the pair (left, below) indicating the number of squares to the left of $S_n$ and the number of squares below $S_n$.
+
+<img class="img-responsive center-block" alt="diagram with squares under the hyperbola" src="https://cdn.freecodecamp.org/curriculum/project-euler/squares-under-a-hyperbola.gif" style="background-color: white; padding: 10px;" />
+
+The diagram shows some such squares labelled by number.
+
+$S_2$ has one square to its left and none below, so the index of $S_2$ is (1, 0).
+
+It can be seen that the index of $S_{32}$ is (1,1) as is the index of $S_{50}$.
+
+50 is the largest $n$ for which the index of $S_n$ is (1, 1).
+
+What is the largest $n$ for which the index of $S_n$ is (3, 3)?
 
 # --hints--
 
-`euler247()` should return 782252.
+`squaresUnderAHyperbola()` should return `782252`.
 
 ```js
-assert.strictEqual(euler247(), 782252);
+assert.strictEqual(squaresUnderAHyperbola(), 782252);
 ```
 
 # --seed--
@@ -29,12 +41,12 @@ assert.strictEqual(euler247(), 782252);
 ## --seed-contents--
 
 ```js
-function euler247() {
+function squaresUnderAHyperbola() {
 
   return true;
 }
 
-euler247();
+squaresUnderAHyperbola();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md
index 1641fd73a25..0df6dd5226a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md
@@ -1,23 +1,23 @@
 ---
 id: 5900f4651000cf542c50ff77
 title: 'Problem 248: Numbers for which Euler’s totient function equals 13!'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301895
 dashedName: problem-248-numbers-for-which-eulers-totient-function-equals-13
 ---
 
 # --description--
 
-The first number n for which φ(n)=13! is 6227180929.
+The first number $n$ for which $φ(n) = 13!$ is $6\\,227\\,180\\,929$.
 
-Find the 150,000th such number.
+Find the ${150\\,000}^{\text{th}}$ such number.
 
 # --hints--
 
-`euler248()` should return 23507044290.
+`eulersTotientFunctionEquals()` should return `23507044290`.
 
 ```js
-assert.strictEqual(euler248(), 23507044290);
+assert.strictEqual(eulersTotientFunctionEquals(), 23507044290);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler248(), 23507044290);
 ## --seed-contents--
 
 ```js
-function euler248() {
+function eulersTotientFunctionEquals() {
 
   return true;
 }
 
-euler248();
+eulersTotientFunctionEquals();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md
index 71c8d1da197..09232c7c178 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4671000cf542c50ff79
 title: 'Problem 249: Prime Subset Sums'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301896
 dashedName: problem-249-prime-subset-sums
 ---
 
 # --description--
 
-Let S = {2, 3, 5, ..., 4999} be the set of prime numbers less than 5000.
+Let $S = \\{2, 3, 5, \ldots, 4999\\}$ be the set of prime numbers less than 5000.
 
-Find the number of subsets of S, the sum of whose elements is a prime number.
+Find the number of subsets of $S$, the sum of whose elements is a prime number.
 
 Enter the rightmost 16 digits as your answer.
 
 # --hints--
 
-`euler249()` should return 9275262564250418.
+`primeSubsetSums()` should return `9275262564250418`.
 
 ```js
-assert.strictEqual(euler249(), 9275262564250418);
+assert.strictEqual(primeSubsetSums(), 9275262564250418);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler249(), 9275262564250418);
 ## --seed-contents--
 
 ```js
-function euler249() {
+function primeSubsetSums() {
 
   return true;
 }
 
-euler249();
+primeSubsetSums();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-250-250250.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-250-250250.md
index 9c488260551..c526154b6e7 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-250-250250.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-250-250250.md
@@ -1,21 +1,21 @@
 ---
 id: 5900f4661000cf542c50ff78
 title: 'Problem 250: 250250'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301898
 dashedName: problem-250-250250
 ---
 
 # --description--
 
-Find the number of non-empty subsets of {11, 22, 33,..., 250250250250}, the sum of whose elements is divisible by 250. Enter the rightmost 16 digits as your answer.
+Find the number of non-empty subsets of $\\{{1}^{1}, {2}^{2}, {3}^{3}, \ldots, {250250}^{250250}\\}$, the sum of whose elements is divisible by 250. Enter the rightmost 16 digits as your answer.
 
 # --hints--
 
-`euler250()` should return 1425480602091519.
+`twoHundredFifty()` should return `1425480602091519`.
 
 ```js
-assert.strictEqual(euler250(), 1425480602091519);
+assert.strictEqual(twoHundredFifty(), 1425480602091519);
 ```
 
 # --seed--
@@ -23,12 +23,12 @@ assert.strictEqual(euler250(), 1425480602091519);
 ## --seed-contents--
 
 ```js
-function euler250() {
+function twoHundredFifty() {
 
   return true;
 }
 
-euler250();
+twoHundredFifty();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.md
index 9023efb8182..8f4013595f3 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f4671000cf542c50ff7a
 title: 'Problem 251: Cardano Triplets'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301899
 dashedName: problem-251-cardano-triplets
 ---
 
 # --description--
 
-A triplet of positive integers (a,b,c) is called a Cardano Triplet if it satisfies the condition:
+A triplet of positive integers ($a$,$b$,$c$) is called a Cardano Triplet if it satisfies the condition:
+
+$$\sqrt[3]{a + b \sqrt{c}} + \sqrt[3]{a - b \sqrt{c}} = 1$$
 
 For example, (2,1,5) is a Cardano Triplet.
 
-There exist 149 Cardano Triplets for which a+b+c ≤ 1000.
+There exist 149 Cardano Triplets for which $a + b + c ≤ 1000$.
 
-Find how many Cardano Triplets exist such that a+b+c ≤ 110,000,000.
+Find how many Cardano Triplets exist such that $a + b + c ≤ 110\\,000\\,000$.
 
 # --hints--
 
-`euler251()` should return 18946051.
+`cardanoTriplets()` should return `18946051`.
 
 ```js
-assert.strictEqual(euler251(), 18946051);
+assert.strictEqual(cardanoTriplets(), 18946051);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler251(), 18946051);
 ## --seed-contents--
 
 ```js
-function euler251() {
+function cardanoTriplets() {
 
   return true;
 }
 
-euler251();
+cardanoTriplets();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-252-convex-holes.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-252-convex-holes.md
index 68251abd753..ec671c067aa 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-252-convex-holes.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-252-convex-holes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4691000cf542c50ff7b
 title: 'Problem 252: Convex Holes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301900
 dashedName: problem-252-convex-holes
 ---
@@ -12,9 +12,12 @@ Given a set of points on a plane, we define a convex hole to be a convex polygon
 
 As an example, the image below shows a set of twenty points and a few such convex holes. The convex hole shown as a red heptagon has an area equal to 1049694.5 square units, which is the highest possible area for a convex hole on the given set of points.
 
-For our example, we used the first 20 points (T2k−1, T2k), for k = 1,2,…,20, produced with the pseudo-random number generator:
+<img class="img-responsive center-block" alt="set of twenty points and convex holes on plane" src="https://cdn.freecodecamp.org/curriculum/project-euler/convex-holes.gif" style="background-color: white; padding: 10px;" />
 
-S0 = 290797 Sn+1 = Sn2 mod 50515093 Tn = ( Sn mod 2000 ) − 1000
+For our example, we used the first 20 points ($T_{2k − 1}$, $T_{2k}$), for $k = 1, 2, \ldots, 20$, produced with the pseudo-random number generator:
+
+$$\begin{align}   S_0 & = 290\\,797 \\\\
+  S_{n+1} & = {S_n}^2 \\; \text{mod} \\; 50\\,515\\,093 \\\\ T_n & = (S_n \\; \text{mod} \\; 2000) − 1000 \end{align}$$
 
 i.e. (527, 144), (−488, 732), (−454, −947), …
 
@@ -22,10 +25,10 @@ What is the maximum area for a convex hole on the set containing the first 500 p
 
 # --hints--
 
-`euler252()` should return 104924.
+`convexHoles()` should return `104924`.
 
 ```js
-assert.strictEqual(euler252(), 104924);
+assert.strictEqual(convexHoles(), 104924);
 ```
 
 # --seed--
@@ -33,12 +36,12 @@ assert.strictEqual(euler252(), 104924);
 ## --seed-contents--
 
 ```js
-function euler252() {
+function convexHoles() {
 
   return true;
 }
 
-euler252();
+convexHoles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-253-tidying-up.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-253-tidying-up.md
index 78efca2bdc3..5f03b74dfe9 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-253-tidying-up.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-253-tidying-up.md
@@ -1,35 +1,52 @@
 ---
 id: 5900f4691000cf542c50ff7c
 title: 'Problem 253: Tidying up'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301901
 dashedName: problem-253-tidying-up
 ---
 
 # --description--
 
-A small child has a “number caterpillar” consisting of forty jigsaw pieces, each with one number on it, which, when connected together in a line, reveal the numbers 1 to 40 in order.
+A small child has a "number caterpillar" consisting of forty jigsaw pieces, each with one number on it, which, when connected together in a line, reveal the numbers 1 to 40 in order.
 
-Every night, the child's father has to pick up the pieces of the caterpillar that have been scattered across the play room. He picks up the pieces at random and places them in the correct order. As the caterpillar is built up in this way, it forms distinct segments that gradually merge together. The number of segments starts at zero (no pieces placed), generally increases up to about eleven or twelve, then tends to drop again before finishing at a single segment (all pieces placed).
+Every night, the child's father has to pick up the pieces of the caterpillar that have been scattered across the play room. He picks up the pieces at random and places them in the correct order.
 
-For example:
+As the caterpillar is built up in this way, it forms distinct segments that gradually merge together. The number of segments starts at zero (no pieces placed), generally increases up to about eleven or twelve, then tends to drop again before finishing at a single segment (all pieces placed).
 
-Piece Placed Segments So Far121422936434554354……
+Por ejemplo:
 
-Let M be the maximum number of segments encountered during a random tidy-up of the caterpillar. For a caterpillar of ten pieces, the number of possibilities for each M is
+| Piece Placed | Segments So Far |
+| ------------ | --------------- |
+| 12           | 1               |
+| 4            | 2               |
+| 29           | 3               |
+| 6            | 4               |
+| 34           | 5               |
+| 5            | 4               |
+| 35           | 4               |
+| …            | …               |
 
-M Possibilities1512 2250912 31815264 41418112 5144000
+Let $M$ be the maximum number of segments encountered during a random tidy-up of the caterpillar. For a caterpillar of ten pieces, the number of possibilities for each $M$ is
 
-so the most likely value of M is 3 and the average value is 385643⁄113400 = 3.400732, rounded to six decimal places.
+| M | Possibilities |
+| - | ------------- |
+| 1 | 512           |
+| 2 | 250912        |
+| 3 | 1815264       |
+| 4 | 1418112       |
+| 5 | 144000        |
 
-The most likely value of M for a forty-piece caterpillar is 11; but what is the average value of M? Give your answer rounded to six decimal places.
+so the most likely value of $M$ is 3 and the average value is $\frac{385\\,643}{113\\,400} = 3.400732$, rounded to six decimal places.
+
+The most likely value of $M$ for a forty-piece caterpillar is 11; but what is the average value of $M$? Give your answer rounded to six decimal places.
 
 # --hints--
 
-`euler253()` should return 11.492847.
+`tidyingUp()` should return `11.492847`.
 
 ```js
-assert.strictEqual(euler253(), 11.492847);
+assert.strictEqual(tidyingUp(), 11.492847);
 ```
 
 # --seed--
@@ -37,12 +54,12 @@ assert.strictEqual(euler253(), 11.492847);
 ## --seed-contents--
 
 ```js
-function euler253() {
+function tidyingUp() {
 
   return true;
 }
 
-euler253();
+tidyingUp();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.md
index 028f20783ef..3d91777d0a4 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.md
@@ -1,31 +1,31 @@
 ---
 id: 5900f46b1000cf542c50ff7d
 title: 'Problem 254: Sums of Digit Factorials'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301902
 dashedName: problem-254-sums-of-digit-factorials
 ---
 
 # --description--
 
-Define f(n) as the sum of the factorials of the digits of n. For example, f(342) = 3! + 4! + 2! = 32.
+Define $f(n)$ as the sum of the factorials of the digits of $n$. For example, $f(342) = 3! + 4! + 2! = 32$.
 
-Define sf(n) as the sum of the digits of f(n). So sf(342) = 3 + 2 = 5.
+Define $sf(n)$ as the sum of the digits of $f(n)$. So $sf(342) = 3 + 2 = 5$.
 
-Define g(i) to be the smallest positive integer n such that sf(n) = i. Though sf(342) is 5, sf(25) is also 5, and it can be verified that g(5) is 25.
+Define $g(i)$ to be the smallest positive integer $n$ such that $sf(n) = i$. Though $sf(342)$ is 5, $sf(25)$ is also 5, and it can be verified that $g(5)$ is 25.
 
-Define sg(i) as the sum of the digits of g(i). So sg(5) = 2 + 5 = 7.
+Define $sg(i)$ as the sum of the digits of $g(i)$. So $sg(5) = 2 + 5 = 7$.
 
-Further, it can be verified that g(20) is 267 and ∑ sg(i) for 1 ≤ i ≤ 20 is 156.
+Further, it can be verified that $g(20)$ is 267 and $\sum sg(i)$ for $1 ≤ i ≤ 20$ is 156.
 
-What is ∑ sg(i) for 1 ≤ i ≤ 150?
+What is $\sum sg(i)$ for $1 ≤ i ≤ 150$?
 
 # --hints--
 
-`euler254()` should return 8184523820510.
+`sumsOfDigitFactorials()` should return `8184523820510`.
 
 ```js
-assert.strictEqual(euler254(), 8184523820510);
+assert.strictEqual(sumsOfDigitFactorials(), 8184523820510);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler254(), 8184523820510);
 ## --seed-contents--
 
 ```js
-function euler254() {
+function sumsOfDigitFactorials() {
 
   return true;
 }
 
-euler254();
+sumsOfDigitFactorials();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md
index 8c6acc7113e..abfbcfe2047 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md
@@ -1,33 +1,50 @@
 ---
 id: 5900f46d1000cf542c50ff7f
 title: 'Problem 255: Rounded Square Roots'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301903
 dashedName: problem-255-rounded-square-roots
 ---
 
 # --description--
 
-We define the rounded-square-root of a positive integer n as the square root of n rounded to the nearest integer.
+We define the rounded-square-root of a positive integer $n$ as the square root of $n$ rounded to the nearest integer.
 
-The following procedure (essentially Heron's method adapted to integer arithmetic) finds the rounded-square-root of n: Let d be the number of digits of the number n. If d is odd, set x0 = 2×10(d-1)⁄2. If d is even, set x0 = 7×10(d-2)⁄2. Repeat:
+The following procedure (essentially Heron's method adapted to integer arithmetic) finds the rounded-square-root of $n$:
 
-until xk+1 = xk.
+Let $d$ be the number of digits of the number $n$.
 
-As an example, let us find the rounded-square-root of n = 4321.n has 4 digits, so x0 = 7×10(4-2)⁄2 = 70. Since x2 = x1, we stop here. So, after just two iterations, we have found that the rounded-square-root of 4321 is 66 (the actual square root is 65.7343137…).
+If $d$ is odd, set $x_0 = 2 × {10}^{\frac{d - 1}{2}}$.
 
-The number of iterations required when using this method is surprisingly low. For example, we can find the rounded-square-root of a 5-digit integer (10,000 ≤ n ≤ 99,999) with an average of 3.2102888889 iterations (the average value was rounded to 10 decimal places).
+If $d$ is even, set $x_0 = 7 × {10}^{\frac{d - 2}{2}}$.
 
-Using the procedure described above, what is the average number of iterations required to find the rounded-square-root of a 14-digit number (1013 ≤ n &lt; 1014)? Give your answer rounded to 10 decimal places.
+Repeat:
 
-Note: The symbols ⌊x⌋ and ⌈x⌉ represent the floor function and ceiling function respectively.
+$$x_{k + 1} = \left\lfloor\frac{x_k + \left\lceil\frac{n}{x_k}\right\rceil}{2}\right\rfloor$$
+
+until $x_{k + 1} = x_k$.
+
+As an example, let us find the rounded-square-root of $n = 4321$.
+
+$n$ has 4 digits, so $x_0 = 7 × {10}^{\frac{4-2}{2}} = 70$.
+
+$$x_1 = \left\lfloor\frac{70 + \left\lceil\frac{4321}{70}\right\rceil}{2}\right\rfloor = 66 \\\\
+x_2 = \left\lfloor\frac{66 + \left\lceil\frac{4321}{66}\right\rceil}{2}\right\rfloor = 66$$
+
+Since $x_2 = x_1$, we stop here. So, after just two iterations, we have found that the rounded-square-root of 4321 is 66 (the actual square root is 65.7343137…).
+
+The number of iterations required when using this method is surprisingly low. For example, we can find the rounded-square-root of a 5-digit integer ($10\\,000 ≤ n ≤ 99\\,999$) with an average of 3.2102888889 iterations (the average value was rounded to 10 decimal places).
+
+Using the procedure described above, what is the average number of iterations required to find the rounded-square-root of a 14-digit number (${10}^{13} ≤ n &lt; {10}^{14}$)? Give your answer rounded to 10 decimal places.
+
+**Note:** The symbols $⌊x⌋$ and $⌈x⌉$ represent the floor function and ceiling function respectively.
 
 # --hints--
 
-`euler255()` should return 4.447401118.
+`roundedSquareRoots()` should return `4.447401118`.
 
 ```js
-assert.strictEqual(euler255(), 4.447401118);
+assert.strictEqual(roundedSquareRoots(), 4.447401118);
 ```
 
 # --seed--
@@ -35,12 +52,12 @@ assert.strictEqual(euler255(), 4.447401118);
 ## --seed-contents--
 
 ```js
-function euler255() {
+function roundedSquareRoots() {
 
   return true;
 }
 
-euler255();
+roundedSquareRoots();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md
index 7a55e36abec..a1fba0b5f2a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f46c1000cf542c50ff7e
 title: 'Problem 256: Tatami-Free Rooms'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301904
 dashedName: problem-256-tatami-free-rooms
 ---
@@ -12,26 +12,28 @@ Tatami are rectangular mats, used to completely cover the floor of a room, witho
 
 Assuming that the only type of available tatami has dimensions 1×2, there are obviously some limitations for the shape and size of the rooms that can be covered.
 
-For this problem, we consider only rectangular rooms with integer dimensions a, b and even size s = a·b. We use the term 'size' to denote the floor surface area of the room, and — without loss of generality — we add the condition a ≤ b.
+For this problem, we consider only rectangular rooms with integer dimensions $a$, $b$ and even size $s = a \times b$. We use the term 'size' to denote the floor surface area of the room, and — without loss of generality — we add the condition $a ≤ b$.
 
 There is one rule to follow when laying out tatami: there must be no points where corners of four different mats meet. For example, consider the two arrangements below for a 4×4 room:
 
-The arrangement on the left is acceptable, whereas the one on the right is not: a red "X" in the middle, marks the point where four tatami meet.
+<img class="img-responsive center-block" alt="two arragements of mats in 4x4 room" src="https://cdn.freecodecamp.org/curriculum/project-euler/tatami-free-rooms.gif" style="background-color: white; padding: 10px;" />
 
-Because of this rule, certain even-sized rooms cannot be covered with tatami: we call them tatami-free rooms. Further, we define T(s) as the number of tatami-free rooms of size s.
+The arrangement on the left is acceptable, whereas the one on the right is not: a red "<strong><span style="color: red;">X</span></strong>" in the middle, marks the point where four tatami meet.
 
-The smallest tatami-free room has size s = 70 and dimensions 7×10. All the other rooms of size s = 70 can be covered with tatami; they are: 1×70, 2×35 and 5×14. Hence, T(70) = 1.
+Because of this rule, certain even-sized rooms cannot be covered with tatami: we call them tatami-free rooms. Further, we define $T(s)$ as the number of tatami-free rooms of size $s$.
 
-Similarly, we can verify that T(1320) = 5 because there are exactly 5 tatami-free rooms of size s = 1320: 20×66, 22×60, 24×55, 30×44 and 33×40. In fact, s = 1320 is the smallest room-size s for which T(s) = 5.
+The smallest tatami-free room has size $s = 70$ and dimensions 7×10. All the other rooms of size $s = 70$ can be covered with tatami; they are: 1×70, 2×35 and 5×14. Hence, $T(70) = 1$.
 
-Find the smallest room-size s for which T(s) = 200.
+Similarly, we can verify that $T(1320) = 5$ because there are exactly 5 tatami-free rooms of size $s = 1320$: 20×66, 22×60, 24×55, 30×44 and 33×40. In fact, $s = 1320$ is the smallest room-size $s$ for which $T(s) = 5$.
+
+Find the smallest room-size $s$ for which $T(s) = 200$.
 
 # --hints--
 
-`euler256()` should return 85765680.
+`tatamiFreeRooms()` should return `85765680`.
 
 ```js
-assert.strictEqual(euler256(), 85765680);
+assert.strictEqual(tatamiFreeRooms(), 85765680);
 ```
 
 # --seed--
@@ -39,12 +41,12 @@ assert.strictEqual(euler256(), 85765680);
 ## --seed-contents--
 
 ```js
-function euler256() {
+function tatamiFreeRooms() {
 
   return true;
 }
 
-euler256();
+tatamiFreeRooms();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
index 629b1f0340e..60864ac52e1 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f46e1000cf542c50ff80
 title: 'Problem 257: Angular Bisectors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301905
 dashedName: problem-257-angular-bisectors
 ---
 
 # --description--
 
-Given is an integer sided triangle ABC with sides a ≤ b ≤ c.
+Given is an integer sided triangle $ABC$ with sides $a ≤ b ≤ c$ ($AB = c$, $BC = a$ and $AC = b$).
 
-(AB = c, BC = a and AC = b).
+The angular bisectors of the triangle intersect the sides at points $E$, $F$ and $G$ (see picture below).
 
-The angular bisectors of the triangle intersect the sides at points E, F and G (see picture below).
+<img class="img-responsive center-block" alt="triangle ABC, with angular bisectors intersecting sides at the points E, F and G" src="https://cdn.freecodecamp.org/curriculum/project-euler/angular-bisectors.gif" style="background-color: white; padding: 10px;" />
 
-The segments EF, EG and FG partition the triangle ABC into four smaller triangles: AEG, BFE, CGF and EFG. It can be proven that for each of these four triangles the ratio area(ABC)/area(subtriangle) is rational. However, there exist triangles for which some or all of these ratios are integral.
+The segments $EF$, $EG$ and $FG$ partition the triangle $ABC$ into four smaller triangles: $AEG$, $BFE$, $CGF$ and $EFG$. It can be proven that for each of these four triangles the ratio $\frac{\text{area}(ABC)}{\text{area}(\text{subtriangle})}$ is rational. However, there exist triangles for which some or all of these ratios are integral.
 
-How many triangles ABC with perimeter≤100,000,000 exist so that the ratio area(ABC)/area(AEG) is integral?
+How many triangles $ABC$ with perimeter $≤ 100\\,000\\,000$ exist so that the ratio $\frac{\text{area}(ABC)}{\text{area}(AEG)}$ is integral?
 
 # --hints--
 
-`euler257()` should return 139012411.
+`angularBisectors()` should return `139012411`.
 
 ```js
-assert.strictEqual(euler257(), 139012411);
+assert.strictEqual(angularBisectors(), 139012411);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler257(), 139012411);
 ## --seed-contents--
 
 ```js
-function euler257() {
+function angularBisectors() {
 
   return true;
 }
 
-euler257();
+angularBisectors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.md
index 963b52807ec..d21eb673b78 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f46e1000cf542c50ff81
 title: 'Problem 258: A lagged Fibonacci sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301906
 dashedName: problem-258-a-lagged-fibonacci-sequence
 ---
@@ -10,14 +10,17 @@ dashedName: problem-258-a-lagged-fibonacci-sequence
 
 A sequence is defined as:
 
-gk = 1, for 0 ≤ k ≤ 1999 gk = gk-2000 + gk-1999, for k ≥ 2000. Find gk mod 20092010 for k = 1018.
+- $g_k = 1$, for $0 ≤ k ≤ 1999$
+- $g_k = g_{k - 2000} + g_{k - 1999}$, for $k ≥ 2000$.
+
+Find $g_k$ mod 20092010 for $k = {10}^{18}$.
 
 # --hints--
 
-`euler258()` should return 12747994.
+`laggedFibonacciSequence()` should return `12747994`.
 
 ```js
-assert.strictEqual(euler258(), 12747994);
+assert.strictEqual(laggedFibonacciSequence(), 12747994);
 ```
 
 # --seed--
@@ -25,12 +28,12 @@ assert.strictEqual(euler258(), 12747994);
 ## --seed-contents--
 
 ```js
-function euler258() {
+function laggedFibonacciSequence() {
 
   return true;
 }
 
-euler258();
+laggedFibonacciSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-259-reachable-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-259-reachable-numbers.md
index c9eab8e6efd..a8fa3ceb470 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-259-reachable-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-259-reachable-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4701000cf542c50ff82
 title: 'Problem 259: Reachable Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301907
 dashedName: problem-259-reachable-numbers
 ---
@@ -10,16 +10,23 @@ dashedName: problem-259-reachable-numbers
 
 A positive integer will be called reachable if it can result from an arithmetic expression obeying the following rules:
 
-Uses the digits 1 through 9, in that order and exactly once each. Any successive digits can be concatenated (for example, using the digits 2, 3 and 4 we obtain the number 234). Only the four usual binary arithmetic operations (addition, subtraction, multiplication and division) are allowed. Each operation can be used any number of times, or not at all. Unary minus is not allowed. Any number of (possibly nested) parentheses may be used to define the order of operations. For example, 42 is reachable, since (1/23) *((4*5)-6) \* (78-9) = 42.
+- Uses the digits 1 through 9, in that order and exactly once each.
+- Any successive digits can be concatenated (for example, using the digits 2, 3 and 4 we obtain the number 234).
+- Only the four usual binary arithmetic operations (addition, subtraction, multiplication and division) are allowed.
+- Each operation can be used any number of times, or not at all.
+- Unary minus is not allowed.
+- Any number of (possibly nested) parentheses may be used to define the order of operations.
+
+For example, 42 is reachable, since $\frac{1}{23} \times ((4 \times 5) - 6) \times (78 - 9) = 42$.
 
 What is the sum of all positive reachable integers?
 
 # --hints--
 
-`euler259()` should return 20101196798.
+`reachableNumbers()` should return `20101196798`.
 
 ```js
-assert.strictEqual(euler259(), 20101196798);
+assert.strictEqual(reachableNumbers(), 20101196798);
 ```
 
 # --seed--
@@ -27,12 +34,12 @@ assert.strictEqual(euler259(), 20101196798);
 ## --seed-contents--
 
 ```js
-function euler259() {
+function reachableNumbers() {
 
   return true;
 }
 
-euler259();
+reachableNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-260-stone-game.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-260-stone-game.md
index 55f0dccfd5d..d0724fd1214 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-260-stone-game.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-260-stone-game.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4701000cf542c50ff83
 title: 'Problem 260: Stone Game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301909
 dashedName: problem-260-stone-game
 ---
@@ -10,24 +10,34 @@ dashedName: problem-260-stone-game
 
 A game is played with three piles of stones and two players.
 
-At her turn, a player removes one or more stones from the piles. However, if she takes stones from more than one pile, she must remove the same number of stones from each of the selected piles.
+On each player's turn, the player removes one or more stones from the piles. However, if the player takes stones from more than one pile, the same number of stones must be removed from each of the selected piles.
 
-In other words, the player chooses some N>0 and removes: N stones from any single pile; or N stones from each of any two piles (2N total); or N stones from each of the three piles (3N total). The player taking the last stone(s) wins the game.
+In other words, the player chooses some $N > 0$ and removes:
 
-A winning configuration is one where the first player can force a win. For example, (0,0,13), (0,11,11) and (5,5,5) are winning configurations because the first player can immediately remove all stones.
+- $N$ stones from any single pile; or
+- $N$ stones from each of any two piles ($2N$ total); or
+- $N$ stones from each of the three piles ($3N$ total).
 
-A losing configuration is one where the second player can force a win, no matter what the first player does. For example, (0,1,2) and (1,3,3) are losing configurations: any legal move leaves a winning configuration for the second player.
+The player taking the last stone(s) wins the game.
 
-Consider all losing configurations (xi,yi,zi) where xi ≤ yi ≤ zi ≤ 100. We can verify that Σ(xi+yi+zi) = 173895 for these.
+A winning configuration is one where the first player can force a win.
 
-Find Σ(xi+yi+zi) where (xi,yi,zi) ranges over the losing configurations with xi ≤ yi ≤ zi ≤ 1000.
+For example, (0,0,13), (0,11,11) and (5,5,5) are winning configurations because the first player can immediately remove all stones.
+
+A losing configuration is one where the second player can force a win, no matter what the first player does.
+
+For example, (0,1,2) and (1,3,3) are losing configurations: any legal move leaves a winning configuration for the second player.
+
+Consider all losing configurations ($x_i$,$y_i$,$z_i$) where $x_i ≤ y_i ≤ z_i ≤ 100$. We can verify that $\sum (x_i + y_i + z_i) = 173\\,895$ for these.
+
+Find $\sum (x_i + y_i + z_i)$ where ($x_i$,$y_i$,$z_i$) ranges over the losing configurations with $x_i ≤ y_i ≤ z_i ≤ 1000$.
 
 # --hints--
 
-`euler260()` should return 167542057.
+`stoneGame()` should return `167542057`.
 
 ```js
-assert.strictEqual(euler260(), 167542057);
+assert.strictEqual(stoneGame(), 167542057);
 ```
 
 # --seed--
@@ -35,12 +45,12 @@ assert.strictEqual(euler260(), 167542057);
 ## --seed-contents--
 
 ```js
-function euler260() {
+function stoneGame() {
 
   return true;
 }
 
-euler260();
+stoneGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md
index b265e7910b2..af6e1b5aa27 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md
@@ -1,25 +1,31 @@
 ---
 id: 5900f4711000cf542c50ff84
 title: 'Problem 261: Pivotal Square Sums'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301910
 dashedName: problem-261-pivotal-square-sums
 ---
 
 # --description--
 
-Let us call a positive integer k a square-pivot, if there is a pair of integers m > 0 and n ≥ k, such that the sum of the (m+1) consecutive squares up to k equals the sum of the m consecutive squares from (n+1) on:
+Let us call a positive integer $k$ a square-pivot, if there is a pair of integers $m > 0$ and $n ≥ k$, such that the sum of the ($m + 1$) consecutive squares up to $k$ equals the sum of the $m$ consecutive squares from ($n + 1$) on:
 
-(k-m)2 + ... + k2 = (n+1)2 + ... + (n+m)2.
+$${(k - m)}^2 + \ldots + k^2 = {(n + 1)}^2 + \ldots + {(n + m)}^2$$
 
-Some small square-pivots are 4: 32 + 42 = 52 21: 202 + 212 = 292 24: 212 + 222 + 232 + 242 = 252 + 262 + 272 110: 1082 + 1092 + 1102 = 1332 + 1342Find the sum of all distinct square-pivots ≤ 1010.
+Some small square-pivots are
+
+$$\begin{align}   & \mathbf{4}: 3^2 + \mathbf{4}^2 = 5^2 \\\\
+  & \mathbf{21}: {20}^2 + \mathbf{21}^2 = {29}^2 \\\\   & \mathbf{24}: {21}^2 + {22}^2 + {23}^2 + \mathbf{24}^2 = {25}^2 + {26}^2 + {27}^2 \\\\
+  & \mathbf{110}: {108}^2 + {109}^2 + \mathbf{110}^2 = {133}^2 + {134}^2 \\\\ \end{align}$$
+
+Find the sum of all distinct square-pivots $≤ {10}^{10}$.
 
 # --hints--
 
-`euler261()` should return 238890850232021.
+`pivotalSquareSums()` should return `238890850232021`.
 
 ```js
-assert.strictEqual(euler261(), 238890850232021);
+assert.strictEqual(pivotalSquareSums(), 238890850232021);
 ```
 
 # --seed--
@@ -27,12 +33,12 @@ assert.strictEqual(euler261(), 238890850232021);
 ## --seed-contents--
 
 ```js
-function euler261() {
+function pivotalSquareSums() {
 
   return true;
 }
 
-euler261();
+pivotalSquareSums();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-262-mountain-range.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-262-mountain-range.md
index 01cc16de4e1..d340e834fa6 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-262-mountain-range.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-262-mountain-range.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f4731000cf542c50ff85
 title: 'Problem 262: Mountain Range'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301911
 dashedName: problem-262-mountain-range
 ---
 
 # --description--
 
-The following equation represents the continuous topography of a mountainous region, giving the elevation h at any point (x,y):
+The following equation represents the continuous topography of a mountainous region, giving the elevation $h$ at any point ($x$,$y$):
 
-A mosquito intends to fly from A(200,200) to B(1400,1400), without leaving the area given by 0 ≤ x, y ≤ 1600.
+$$h = \left(5000 - \frac{x^2 + y^2 + xy}{200} + \frac{25(x + y)}{2}\right) \times e^{-\left|\frac{x^2 + y^2}{1\\,000\\,000} - \frac{3(x + y)}{2000} + \frac{7}{10}\right|}$$
 
-Because of the intervening mountains, it first rises straight up to a point A', having elevation f. Then, while remaining at the same elevation f, it flies around any obstacles until it arrives at a point B' directly above B.
+A mosquito intends to fly from A(200,200) to B(1400,1400), without leaving the area given by $0 ≤ x$, $y ≤ 1600$.
 
-First, determine fmin which is the minimum constant elevation allowing such a trip from A to B, while remaining in the specified area. Then, find the length of the shortest path between A' and B', while flying at that constant elevation fmin.
+Because of the intervening mountains, it first rises straight up to a point A', having elevation $f$. Then, while remaining at the same elevation $f$, it flies around any obstacles until it arrives at a point B' directly above B.
+
+First, determine $f_{min}$ which is the minimum constant elevation allowing such a trip from A to B, while remaining in the specified area. Then, find the length of the shortest path between A' and B', while flying at that constant elevation $f_{min}$.
 
 Give that length as your answer, rounded to three decimal places.
 
-Note: For convenience, the elevation function shown above is repeated below, in a form suitable for most programming languages: h=( 5000-0.005*(x*x+y*y+x*y)+12.5*(x+y) )* exp( -abs(0.000001*(x*x+y*y)-0.0015*(x+y)+0.7) )
+**Note:** For convenience, the elevation function shown above is repeated below, in a form suitable for most programming languages: `h=( 5000-0.005*(x*x+y*y+x*y)+12.5*(x+y) )* exp( -abs(0.000001*(x*x+y*y)-0.0015*(x+y)+0.7) )`.
 
 # --hints--
 
-`euler262()` should return 2531.205.
+`mountainRange()` should return `2531.205`.
 
 ```js
-assert.strictEqual(euler262(), 2531.205);
+assert.strictEqual(mountainRange(), 2531.205);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler262(), 2531.205);
 ## --seed-contents--
 
 ```js
-function euler262() {
+function mountainRange() {
 
   return true;
 }
 
-euler262();
+mountainRange();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.md
index 24fca67d821..8fec64cc250 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4741000cf542c50ff86
 title: 'Problem 263: An engineers'' dream come true'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301912
 dashedName: problem-263-an-engineers-dream-come-true
 ---
@@ -12,15 +12,18 @@ Consider the number 6. The divisors of 6 are: 1,2,3 and 6.
 
 Every number from 1 up to and including 6 can be written as a sum of distinct divisors of 6:
 
-1=1, 2=2, 3=1+2, 4=1+3, 5=2+3, 6=6.
+$1 = 1$, $2 = 2$, $3 = 1 + 2$, $4 = 1 + 3$, $5 = 2 + 3$, $6 = 6$.
 
-A number n is called a practical number if every number from 1 up to and including n can be expressed as a sum of distinct divisors of n.
+A number $n$ is called a practical number if every number from 1 up to and including $n$ can be expressed as a sum of distinct divisors of $n$.
 
 A pair of consecutive prime numbers with a difference of six is called a sexy pair (since "sex" is the Latin word for "six"). The first sexy pair is (23, 29).
 
 We may occasionally find a triple-pair, which means three consecutive sexy prime pairs, such that the second member of each pair is the first member of the next pair.
 
-We shall call a number n such that : (n-9, n-3), (n-3,n+3), (n+3, n+9) form a triple-pair, and the numbers n-8, n-4, n, n+4 and n+8 are all practical,
+We shall call a number $n$ such that:
+
+- ($n - 9$, $n - 3$), ($n - 3$, $n + 3$), ($n + 3$, $n + 9$) form a triple-pair, and
+- the numbers $n - 8$, $n - 4$, $n$, $n + 4$ and $n + 8$ are all practical,
 
 an engineers’ paradise.
 
@@ -28,10 +31,10 @@ Find the sum of the first four engineers’ paradises.
 
 # --hints--
 
-`euler263()` should return 2039506520.
+`engineersDreamComeTrue()` should return `2039506520`.
 
 ```js
-assert.strictEqual(euler263(), 2039506520);
+assert.strictEqual(engineersDreamComeTrue(), 2039506520);
 ```
 
 # --seed--
@@ -39,12 +42,12 @@ assert.strictEqual(euler263(), 2039506520);
 ## --seed-contents--
 
 ```js
-function euler263() {
+function engineersDreamComeTrue() {
 
   return true;
 }
 
-euler263();
+engineersDreamComeTrue();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-264-triangle-centres.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-264-triangle-centres.md
index 34be7dede4c..dc22c0cf51b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-264-triangle-centres.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-264-triangle-centres.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4751000cf542c50ff87
 title: 'Problem 264: Triangle Centres'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301913
 dashedName: problem-264-triangle-centres
 ---
@@ -10,28 +10,45 @@ dashedName: problem-264-triangle-centres
 
 Consider all the triangles having:
 
-All their vertices on lattice points.
+- All their vertices on lattice points.
+- Circumcentre at the origin O.
+- Orthocentre at the point H(5, 0).
 
-Circumcentre at the origin O.
-
-Orthocentre at the point H(5, 0).
-
-There are nine such triangles having a perimeter ≤ 50.
+There are nine such triangles having a $\text{perimeter} ≤ 50$.
 
 Listed and shown in ascending order of their perimeter, they are:
 
-A(-4, 3), B(5, 0), C(4, -3) A(4, 3), B(5, 0), C(-4, -3) A(-3, 4), B(5, 0), C(3, -4) A(3, 4), B(5, 0), C(-3, -4) A(0, 5), B(5, 0), C(0, -5) A(1, 8), B(8, -1), C(-4, -7) A(8, 1), B(1, -8), C(-4, 7) A(2, 9), B(9, -2), C(-6, -7) A(9, 2), B(2, -9), C(-6, 7)
+<table>
+  <tbody>
+    <tr>
+      <td>
+A(-4, 3), B(5, 0), C(4, -3)<br>
+A(4, 3), B(5, 0), C(-4, -3)<br>
+A(-3, 4), B(5, 0), C(3, -4)<br>
+<br><br>
+A(3, 4), B(5, 0), C(-3, -4)<br>
+A(0, 5), B(5, 0), C(0, -5)<br>
+A(1, 8), B(8, -1), C(-4, -7)<br>
+<br><br>
+A(8, 1), B(1, -8), C(-4, 7)<br>
+A(2, 9), B(9, -2), C(-6, -7)<br>
+A(9, 2), B(2, -9), C(-6, 7)<br>
+      </td>
+      <td><img class="img-responsive center-block" alt="nine triangles ABC with perimeter ≤ 50" src="https://cdn.freecodecamp.org/curriculum/project-euler/triangle-centres.gif" style="background-color: white; padding: 10px;"></td>
+    </tr>
+  </tbody>
+</table>
 
 The sum of their perimeters, rounded to four decimal places, is 291.0089.
 
-Find all such triangles with a perimeter ≤ 105. Enter as your answer the sum of their perimeters rounded to four decimal places.
+Find all such triangles with a $\text{perimeter} ≤ {10}^5$. Enter as your answer the sum of their perimeters rounded to four decimal places.
 
 # --hints--
 
-`euler264()` should return 2816417.1055.
+`triangleCentres()` should return `2816417.1055`.
 
 ```js
-assert.strictEqual(euler264(), 2816417.1055);
+assert.strictEqual(triangleCentres(), 2816417.1055);
 ```
 
 # --seed--
@@ -39,12 +56,12 @@ assert.strictEqual(euler264(), 2816417.1055);
 ## --seed-contents--
 
 ```js
-function euler264() {
+function triangleCentres() {
 
   return true;
 }
 
-euler264();
+triangleCentres();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-265-binary-circles.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-265-binary-circles.md
index 0ed757aa65a..4262d97c798 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-265-binary-circles.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-265-binary-circles.md
@@ -1,31 +1,36 @@
 ---
 id: 5900f4761000cf542c50ff88
 title: 'Problem 265: Binary Circles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301914
 dashedName: problem-265-binary-circles
 ---
 
 # --description--
 
-2N binary digits can be placed in a circle so that all the N-digit clockwise subsequences are distinct.
+$2^N$ binary digits can be placed in a circle so that all the $N$-digit clockwise subsequences are distinct.
 
-For N=3, two such circular arrangements are possible, ignoring rotations:
+For $N = 3$, two such circular arrangements are possible, ignoring rotations:
+
+<img class="img-responsive center-block" alt="two circular arrangements for N = 3" src="https://cdn.freecodecamp.org/curriculum/project-euler/binary-circles.gif" style="background-color: white; padding: 10px;" />
 
 For the first arrangement, the 3-digit subsequences, in clockwise order, are: 000, 001, 010, 101, 011, 111, 110 and 100.
 
-Each circular arrangement can be encoded as a number by concatenating the binary digits starting with the subsequence of all zeros as the most significant bits and proceeding clockwise. The two arrangements for N=3 are thus represented as 23 and 29: 00010111 2 = 23 00011101 2 = 29
+Each circular arrangement can be encoded as a number by concatenating the binary digits starting with the subsequence of all zeros as the most significant bits and proceeding clockwise. The two arrangements for $N = 3$ are thus represented as 23 and 29:
 
-Calling S(N) the sum of the unique numeric representations, we can see that S(3) = 23 + 29 = 52.
+$${00010111}_2 = 23\\\\
+{00011101}_2 = 29$$
 
-Find S(5).
+Calling $S(N)$ the sum of the unique numeric representations, we can see that $S(3) = 23 + 29 = 52$.
+
+Find $S(5)$.
 
 # --hints--
 
-`euler265()` should return 209110240768.
+`binaryCircles()` should return `209110240768`.
 
 ```js
-assert.strictEqual(euler265(), 209110240768);
+assert.strictEqual(binaryCircles(), 209110240768);
 ```
 
 # --seed--
@@ -33,12 +38,12 @@ assert.strictEqual(euler265(), 209110240768);
 ## --seed-contents--
 
 ```js
-function euler265() {
+function binaryCircles() {
 
   return true;
 }
 
-euler265();
+binaryCircles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-266-pseudo-square-root.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-266-pseudo-square-root.md
index 18569d5b8e9..2b22e967efb 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-266-pseudo-square-root.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-266-pseudo-square-root.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4771000cf542c50ff89
 title: 'Problem 266: Pseudo Square Root'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301915
 dashedName: problem-266-pseudo-square-root
 ---
@@ -12,18 +12,18 @@ The divisors of 12 are: 1,2,3,4,6 and 12.
 
 The largest divisor of 12 that does not exceed the square root of 12 is 3.
 
-We shall call the largest divisor of an integer n that does not exceed the square root of n the pseudo square root (PSR) of n.
+We shall call the largest divisor of an integer $n$ that does not exceed the square root of $n$ the pseudo square root ($PSR$) of $n$.
 
-It can be seen that PSR(3102)=47.
+It can be seen that $PSR(3102) = 47$.
 
-Let p be the product of the primes below 190. Find PSR(p) mod 1016.
+Let $p$ be the product of the primes below 190. Find $PSR(p)\bmod {10}^{16}$.
 
 # --hints--
 
-`euler266()` should return 1096883702440585.
+`pseudoSquareRoot()` should return `1096883702440585`.
 
 ```js
-assert.strictEqual(euler266(), 1096883702440585);
+assert.strictEqual(pseudoSquareRoot(), 1096883702440585);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler266(), 1096883702440585);
 ## --seed-contents--
 
 ```js
-function euler266() {
+function pseudoSquareRoot() {
 
   return true;
 }
 
-euler266();
+pseudoSquareRoot();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-267-billionaire.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-267-billionaire.md
index 0c308ff3ec8..8dbe1d8ab66 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-267-billionaire.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-267-billionaire.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4771000cf542c50ff8a
 title: 'Problem 267: Billionaire'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301916
 dashedName: problem-267-billionaire
 ---
@@ -10,22 +10,22 @@ dashedName: problem-267-billionaire
 
 You are given a unique investment opportunity.
 
-Starting with £1 of capital, you can choose a fixed proportion, f, of your capital to bet on a fair coin toss repeatedly for 1000 tosses.
+Starting with £1 of capital, you can choose a fixed proportion, $f$, of your capital to bet on a fair coin toss repeatedly for 1000 tosses.
 
 Your return is double your bet for heads and you lose your bet for tails.
 
-For example, if f = 1/4, for the first toss you bet £0.25, and if heads comes up you win £0.5 and so then have £1.5. You then bet £0.375 and if the second toss is tails, you have £1.125.
+For example, if $f = \frac{1}{4}$, for the first toss you bet £0.25, and if heads comes up you win £0.5 and so then have £1.5. You then bet £0.375 and if the second toss is tails, you have £1.125.
 
-Choosing f to maximize your chances of having at least £1,000,000,000 after 1,000 flips, what is the chance that you become a billionaire?
+Choosing $f$ to maximize your chances of having at least £1,000,000,000 after 1,000 flips, what is the chance that you become a billionaire?
 
 All computations are assumed to be exact (no rounding), but give your answer rounded to 12 digits behind the decimal point in the form 0.abcdefghijkl.
 
 # --hints--
 
-`euler267()` should return 0.999992836187.
+`billionaire()` should return `0.999992836187`.
 
 ```js
-assert.strictEqual(euler267(), 0.999992836187);
+assert.strictEqual(billionaire(), 0.999992836187);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler267(), 0.999992836187);
 ## --seed-contents--
 
 ```js
-function euler267() {
+function billionaire() {
 
   return true;
 }
 
-euler267();
+billionaire();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md
index d11cb99eef8..bd295d89e67 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md
@@ -2,7 +2,7 @@
 id: 5900f4791000cf542c50ff8b
 title: >-
   Problem 268: Counting numbers with at least four distinct prime factors less than 100
-challengeType: 5
+challengeType: 1
 forumTopicId: 301917
 dashedName: >-
   problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100
@@ -12,14 +12,14 @@ dashedName: >-
 
 It can be verified that there are 23 positive integers less than 1000 that are divisible by at least four distinct primes less than 100.
 
-Find how many positive integers less than 1016 are divisible by at least four distinct primes less than 100.
+Find how many positive integers less than ${10}^{16}$ are divisible by at least four distinct primes less than 100.
 
 # --hints--
 
-`euler268()` should return 785478606870985.
+`fourDistinctPrimeFactors()` should return `785478606870985`.
 
 ```js
-assert.strictEqual(euler268(), 785478606870985);
+assert.strictEqual(fourDistinctPrimeFactors(), 785478606870985);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler268(), 785478606870985);
 ## --seed-contents--
 
 ```js
-function euler268() {
+function fourDistinctPrimeFactors() {
 
   return true;
 }
 
-euler268();
+fourDistinctPrimeFactors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.md
index b4b26926105..3b66b2a2ab1 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.md
@@ -1,31 +1,37 @@
 ---
 id: 5900f4791000cf542c50ff8c
 title: 'Problem 269: Polynomials with at least one integer root'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301918
 dashedName: problem-269-polynomials-with-at-least-one-integer-root
 ---
 
 # --description--
 
-A root or zero of a polynomial P(x) is a solution to the equation P(x) = 0.
+A root or zero of a polynomial $P(x)$ is a solution to the equation $P(x) = 0$.
 
-Define Pn as the polynomial whose coefficients are the digits of n.
+Define $P_n$ as the polynomial whose coefficients are the digits of $n$.
 
-For example, P5703(x) = 5x3 + 7x2 + 3.
+For example, $P_{5703}(x) = 5x^3 + 7x^2 + 3$.
 
-We can see that:Pn(0) is the last digit of n, Pn(1) is the sum of the digits of n, Pn(10) is n itself.Define Z(k) as the number of positive integers, n, not exceeding k for which the polynomial Pn has at least one integer root.
+We can see that:
 
-It can be verified that Z(100 000) is 14696.
+- $P_n(0)$ is the last digit of $n$,
+- $P_n(1)$ is the sum of the digits of $n$,
+- $Pn(10)$ is $n$ itself.
 
-What is Z(1016)?
+Define $Z(k)$ as the number of positive integers, $n$, not exceeding $k$ for which the polynomial $P_n$ has at least one integer root.
+
+It can be verified that $Z(100\\,000)$ is 14696.
+
+What is $Z({10}^{16})$?
 
 # --hints--
 
-`euler269()` should return 1311109198529286.
+`polynomialsWithOneIntegerRoot()` should return `1311109198529286`.
 
 ```js
-assert.strictEqual(euler269(), 1311109198529286);
+assert.strictEqual(polynomialsWithOneIntegerRoot(), 1311109198529286);
 ```
 
 # --seed--
@@ -33,12 +39,12 @@ assert.strictEqual(euler269(), 1311109198529286);
 ## --seed-contents--
 
 ```js
-function euler269() {
+function polynomialsWithOneIntegerRoot() {
 
   return true;
 }
 
-euler269();
+polynomialsWithOneIntegerRoot();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-27-quadratic-primes.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-27-quadratic-primes.md
index a694ee2a595..ac2971b256f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-27-quadratic-primes.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-27-quadratic-primes.md
@@ -1,58 +1,58 @@
 ---
 id: 5900f3871000cf542c50fe9a
-title: 'Problem 27: Quadratic primes'
-challengeType: 5
+title: 'Problema 27: Primos cuadráticos'
+challengeType: 1
 forumTopicId: 301919
 dashedName: problem-27-quadratic-primes
 ---
 
 # --description--
 
-Euler discovered the remarkable quadratic formula:
+Euler descubrió la notable fórmula cuadrática:
 
 <div style='margin-left: 4em;'>$n^2 + n + 41$</div>
 
-It turns out that the formula will produce 40 primes for the consecutive integer values $0 \\le n \\le 39$. However, when $n = 40, 40^2 + 40 + 41 = 40(40 + 1) + 41$ is divisible by 41, and certainly when $n = 41, 41^2 + 41 + 41$ is clearly divisible by 41.
+Esta fórmula genera 40 primos para todos los enteros consecutivos $0 \\le n \\le 39$. Sin embargo, cuando $n = 40, 40^2 + 40 + 41 = 40(40 + 1) + 41$ es divisible por 41, y si $n = 41, 41^2 + 41 + 41$ también es, claramente, divisible por 41.
 
-The incredible formula $n^2 - 79n + 1601$ was discovered, which produces 80 primes for the consecutive values $0 \\le n \\le 79$. The product of the coefficients, −79 and 1601, is −126479.
+La increíble fórmula $n^2 - 79n + 1601$ genera 80 primos para los valores consecutivos $0 \\le n \\le 79$. El producto de los coeficientes, −79 y 1601, es −126479.
 
-Considering quadratics of the form:
+Considerando polinomios cuadráticos de la forma:
 
 <div style='margin-left: 4em;'>
-  $n^2 + an + b$, where $|a| < range$ and $|b| \le range$<br>
-  where $|n|$ is the modulus/absolute value of $n$<br>
-  e.g. $|11| = 11$ and $|-4| = 4$<br>
+  $n^2 + an + b$, donde $|a| < intervalo$ y $|b| \le intervalo$<br>
+  donde $|n|$ es el valor absoluto de $n$<br>
+  e.g. $|11| = 11$ y $|-4| = 4$<br>
 </div>
 
-Find the product of the coefficients, $a$ and $b$, for the quadratic expression that produces the maximum number of primes for consecutive values of $n$, starting with $n = 0$.
+Encuentra el producto de los coeficientes, $a$ and $b$, de la expresión cuadrática que genera el máximo número de primos para valores consecutivos de $n$, comenzando por $n = 0$.
 
 # --hints--
 
-`quadraticPrimes(200)` should return a number.
+`quadraticPrimes(200)` debe devolver un número.
 
 ```js
 assert(typeof quadraticPrimes(200) === 'number');
 ```
 
-`quadraticPrimes(200)` should return -4925.
+`quadraticPrimes(200)` debe devolver -4925.
 
 ```js
 assert(quadraticPrimes(200) == -4925);
 ```
 
-`quadraticPrimes(500)` should return -18901.
+`quadraticPrimes(500)` debe devolver -18901.
 
 ```js
 assert(quadraticPrimes(500) == -18901);
 ```
 
-`quadraticPrimes(800)` should return -43835.
+`quadraticPrimes(800)` debe devolver -43835.
 
 ```js
 assert(quadraticPrimes(800) == -43835);
 ```
 
-`quadraticPrimes(1000)` should return -59231.
+`quadraticPrimes(1000)` debe devolver -59231.
 
 ```js
 assert(quadraticPrimes(1000) == -59231);
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md
index 5d490e3b17a..0458e257f05 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md
@@ -1,31 +1,31 @@
 ---
 id: 5900f47c1000cf542c50ff8e
 title: 'Problem 270: Cutting Squares'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301920
 dashedName: problem-270-cutting-squares
 ---
 
 # --description--
 
-A square piece of paper with integer dimensions N×N is placed with a corner at the origin and two of its sides along the x- and y-axes. Then, we cut it up respecting the following rules:
+A square piece of paper with integer dimensions $N×N$ is placed with a corner at the origin and two of its sides along the $x$- and $y$-axes. Then, we cut it up respecting the following rules:
 
-We only make straight cuts between two points lying on different sides of the square, and having integer coordinates.
+- We only make straight cuts between two points lying on different sides of the square, and having integer coordinates.
+- Two cuts cannot cross, but several cuts can meet at the same border point.
+- Proceed until no more legal cuts can be made.
 
-Two cuts cannot cross, but several cuts can meet at the same border point.
+Counting any reflections or rotations as distinct, we call $C(N)$ the number of ways to cut an $N×N$ square. For example, $C(1) = 2$ and $C(2) = 30$ (shown below).
 
-Proceed until no more legal cuts can be made.
+<img class="img-responsive center-block" alt="ways to cut 2x2 square, counting reflections and rotations as distinct" src="https://cdn.freecodecamp.org/curriculum/project-euler/cutting-squares.gif" style="background-color: white; padding: 10px;" />
 
-Counting any reflections or rotations as distinct, we call C(N) the number of ways to cut an N×N square. For example, C(1) = 2 and C(2) = 30 (shown below).
-
-What is C(30) mod 108 ?
+What is $C(30)\bmod {10}^8$ ?
 
 # --hints--
 
-`euler270()` should return 82282080.
+`cuttingSquares()` should return `82282080`.
 
 ```js
-assert.strictEqual(euler270(), 82282080);
+assert.strictEqual(cuttingSquares(), 82282080);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler270(), 82282080);
 ## --seed-contents--
 
 ```js
-function euler270() {
+function cuttingSquares() {
 
   return true;
 }
 
-euler270();
+cuttingSquares();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.md
index e9f9bb785cc..f1dbf4b5666 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f47b1000cf542c50ff8d
 title: 'Problem 271: Modular Cubes, part 1'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301921
 dashedName: problem-271-modular-cubes-part-1
 ---
 
 # --description--
 
-For a positive number n, define S(n) as the sum of the integers x, for which 1
+For a positive number $n$, define $S(n)$ as the sum of the integers $x$, for which $1 < x < n$ and $x^3 \equiv 1\bmod n$.
 
-When n=91, there are 8 possible values for x, namely : 9, 16, 22, 29, 53, 74, 79, 81. Thus, S(91)=9+16+22+29+53+74+79+81=363.
+When $n = 91$, there are 8 possible values for $x$, namely: 9, 16, 22, 29, 53, 74, 79, 81. Thus, $S(91) = 9 + 16 + 22 + 29 + 53 + 74 + 79 + 81 = 363$.
 
-Find S(13082761331670030).
+Find $S(13\\,082\\,761\\,331\\,670\\,030)$.
 
 # --hints--
 
-`euler271()` should return 4617456485273130000.
+`modularCubesOne()` should return `4617456485273130000`.
 
 ```js
-assert.strictEqual(euler271(), 4617456485273130000);
+assert.strictEqual(modularCubesOne(), 4617456485273130000);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler271(), 4617456485273130000);
 ## --seed-contents--
 
 ```js
-function euler271() {
+function modularCubesOne() {
 
   return true;
 }
 
-euler271();
+modularCubesOne();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.md
index 3cfb07b5b3f..d764ea6563b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f47d1000cf542c50ff8f
 title: 'Problem 272: Modular Cubes, part 2'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301922
 dashedName: problem-272-modular-cubes-part-2
 ---
 
 # --description--
 
-For a positive number n, define C(n) as the number of the integers x, for which 1
+For a positive number $n$, define $C(n)$ as the number of the integers $x$, for which $1 < x < n$ and $x^3 \equiv 1\bmod n$.
 
-When n=91, there are 8 possible values for x, namely : 9, 16, 22, 29, 53, 74, 79, 81. Thus, C(91)=8.
+When $n = 91$, there are 8 possible values for $x$, namely: 9, 16, 22, 29, 53, 74, 79, 81. Thus, $C(91) = 8$.
 
-Find the sum of the positive numbers n≤1011 for which C(n)=242.
+Find the sum of the positive numbers $n ≤ {10}^{11}$ for which $C(n)=242$.
 
 # --hints--
 
-`euler272()` should return 8495585919506151000.
+`modularCubesTwo()` should return `8495585919506151000`.
 
 ```js
-assert.strictEqual(euler272(), 8495585919506151000);
+assert.strictEqual(modularCubesTwo(), 8495585919506151000);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler272(), 8495585919506151000);
 ## --seed-contents--
 
 ```js
-function euler272() {
+function modularCubesTwo() {
 
   return true;
 }
 
-euler272();
+modularCubesTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-273-sum-of-squares.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-273-sum-of-squares.md
index 508c463ddd8..d5ffc27c633 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-273-sum-of-squares.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-273-sum-of-squares.md
@@ -1,23 +1,31 @@
 ---
 id: 5900f47e1000cf542c50ff90
 title: 'Problem 273: Sum of Squares'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301923
 dashedName: problem-273-sum-of-squares
 ---
 
 # --description--
 
-Consider equations of the form: a2 + b2 = N, 0 ≤ a ≤ b, a, b and N integer.
+Consider equations of the form: $a^2 + b^2 = N$, $0 ≤ a ≤ b$, $a$, $b$ and $N$ integer.
 
-For N=65 there are two solutions: a=1, b=8 and a=4, b=7. We call S(N) the sum of the values of a of all solutions of a2 + b2 = N, 0 ≤ a ≤ b, a, b and N integer. Thus S(65) = 1 + 4 = 5. Find ∑S(N), for all squarefree N only divisible by primes of the form 4k+1 with 4k+1 &lt; 150.
+For $N = 65$ there are two solutions:
+
+$a = 1, b = 8$ and $a = 4, b = 7$.
+
+We call $S(N)$ the sum of the values of $a$ of all solutions of $a^2 + b^2 = N$, $0 ≤ a ≤ b$, $a$, $b$ and $N$ integer.
+
+Thus $S(65) = 1 + 4 = 5$.
+
+Find $\sum S(N)$, for all squarefree $N$ only divisible by primes of the form $4k + 1$ with $4k + 1 &lt; 150$.
 
 # --hints--
 
-`euler273()` should return 2032447591196869000.
+`sumOfSquares()` should return `2032447591196869000`.
 
 ```js
-assert.strictEqual(euler273(), 2032447591196869000);
+assert.strictEqual(sumOfSquares(), 2032447591196869000);
 ```
 
 # --seed--
@@ -25,12 +33,12 @@ assert.strictEqual(euler273(), 2032447591196869000);
 ## --seed-contents--
 
 ```js
-function euler273() {
+function sumOfSquares() {
 
   return true;
 }
 
-euler273();
+sumOfSquares();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.md
index 7841b6ed8f3..bf56b697151 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.md
@@ -1,33 +1,35 @@
 ---
 id: 5900f47f1000cf542c50ff91
 title: 'Problem 274: Divisibility Multipliers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301924
 dashedName: problem-274-divisibility-multipliers
 ---
 
 # --description--
 
-For each integer p > 1 coprime to 10 there is a positive divisibility multiplier m &lt; p which preserves divisibility by p for the following function on any positive integer, n:
+For each integer $p > 1$ coprime to 10 there is a positive divisibility multiplier $m &lt; p$ which preserves divisibility by $p$ for the following function on any positive integer, $n$:
 
-f(n) = (all but the last digit of n) + (the last digit of n) \* m
+$f(n) = (\text{all but the last digit of} \\; n) + (\text{the last digit of} \\; n) \times m$
 
-That is, if m is the divisibility multiplier for p, then f(n) is divisible by p if and only if n is divisible by p.
+That is, if $m$ is the divisibility multiplier for $p$, then $f(n)$ is divisible by $p$ if and only if $n$ is divisible by $p$.
 
-(When n is much larger than p, f(n) will be less than n and repeated application of f provides a multiplicative divisibility test for p.)
+(When $n$ is much larger than $p$, $f(n)$ will be less than $n$ and repeated application of $f$ provides a multiplicative divisibility test for $p$.)
 
 For example, the divisibility multiplier for 113 is 34.
 
-f(76275) = 7627 + 5 *34 = 7797 : 76275 and 7797 are both divisible by 113f(12345) = 1234 + 5* 34 = 1404 : 12345 and 1404 are both not divisible by 113
+$f(76275) = 7627 + 5 \times 34 = 7797$: 76275 and 7797 are both divisible by 113
 
-The sum of the divisibility multipliers for the primes that are coprime to 10 and less than 1000 is 39517. What is the sum of the divisibility multipliers for the primes that are coprime to 10 and less than 107?
+$f(12345) = 1234 + 5 \times 34 = 1404$: 12345 and 1404 are both not divisible by 113
+
+The sum of the divisibility multipliers for the primes that are coprime to 10 and less than 1000 is 39517. What is the sum of the divisibility multipliers for the primes that are coprime to 10 and less than ${10}^7$?
 
 # --hints--
 
-`euler274()` should return 1601912348822.
+`divisibilityMultipliers()` should return `1601912348822`.
 
 ```js
-assert.strictEqual(euler274(), 1601912348822);
+assert.strictEqual(divisibilityMultipliers(), 1601912348822);
 ```
 
 # --seed--
@@ -35,12 +37,12 @@ assert.strictEqual(euler274(), 1601912348822);
 ## --seed-contents--
 
 ```js
-function euler274() {
+function divisibilityMultipliers() {
 
   return true;
 }
 
-euler274();
+divisibilityMultipliers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md
index a65dc0151c8..c6dded75ac3 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md
@@ -1,33 +1,34 @@
 ---
 id: 5900f4801000cf542c50ff92
 title: 'Problem 275: Balanced Sculptures'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301925
 dashedName: problem-275-balanced-sculptures
 ---
 
 # --description--
 
-Let us define a balanced sculpture of order n as follows:
+Definamos una escultura equilibrada de orden $n$ como se indica a continuación:
 
-A polyomino made up of n+1 tiles known as the blocks (n tiles) and the plinth (remaining tile);
+- A polyomino made up of $n + 1$ tiles known as the blocks ($n$ tiles) and the plinth (remaining tile);
+- the plinth has its centre at position ($x = 0$, $y = 0$);
+- the blocks have $y$-coordinates greater than zero (so the plinth is the unique lowest tile);
+- the centre of mass of all the blocks, combined, has $x$-coordinate equal to zero.
 
-the plinth has its centre at position (x = 0, y = 0);
+When counting the sculptures, any arrangements which are simply reflections about the $y$-axis, are <u>not</u> counted as distinct. For example, the 18 balanced sculptures of order 6 are shown below; note that each pair of mirror images (about the $y$-axis) is counted as one sculpture:
 
-the blocks have y-coordinates greater than zero (so the plinth is the unique lowest tile);
+<img class="img-responsive center-block" alt="18 balanced sculptures of order 6" src="https://cdn.freecodecamp.org/curriculum/project-euler/balanced-sculptures.gif" style="background-color: white; padding: 10px;" />
 
-the centre of mass of all the blocks, combined, has x-coordinate equal to zero.
+There are 964 balanced sculptures of order 10 and 360505 of order 15.
 
-When counting the sculptures, any arrangements which are simply reflections about the y-axis, are not counted as distinct. For example, the 18 balanced sculptures of order 6 are shown below; note that each pair of mirror images (about the y-axis) is counted as one sculpture:
-
-There are 964 balanced sculptures of order 10 and 360505 of order 15.How many balanced sculptures are there of order 18?
+How many balanced sculptures are there of order 18?
 
 # --hints--
 
-`euler275()` should return 15030564.
+`balancedSculptures()` should return `15030564`.
 
 ```js
-assert.strictEqual(euler275(), 15030564);
+assert.strictEqual(balancedSculptures(), 15030564);
 ```
 
 # --seed--
@@ -35,12 +36,12 @@ assert.strictEqual(euler275(), 15030564);
 ## --seed-contents--
 
 ```js
-function euler275() {
+function balancedSculptures() {
 
   return true;
 }
 
-euler275();
+balancedSculptures();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.md
index 1f081396c26..c80635aa3d8 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.md
@@ -1,35 +1,39 @@
 ---
 id: 5900f4811000cf542c50ff94
 title: 'Problem 277: A Modified Collatz sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301927
 dashedName: problem-277-a-modified-collatz-sequence
 ---
 
 # --description--
 
-A modified Collatz sequence of integers is obtained from a starting value a1 in the following way:
+A modified Collatz sequence of integers is obtained from a starting value $a_1$ in the following way:
 
-an+1 = an/3 if an is divisible by 3. We shall denote this as a large downward step, "D".
+$a_{n + 1} = \frac{a_n}{3}$ if $a_n$ is divisible by 3. We shall denote this as a large downward step, "D".
 
-an+1 = (4an + 2)/3 if an divided by 3 gives a remainder of 1. We shall denote this as an upward step, "U".
+$a_{n + 1} = \frac{4a_n + 2}{3}$ if $a_n$ divided by 3 gives a remainder of 1. We shall denote this as an upward step, "U".
 
-an+1 = (2an - 1)/3 if an divided by 3 gives a remainder of 2. We shall denote this as a small downward step, "d".
+$a_{n + 1} = \frac{2a_n - 1}{3}$ if $a_n$ divided by 3 gives a remainder of 2. We shall denote this as a small downward step, "d".
 
-The sequence terminates when some an = 1.
+The sequence terminates when some $a_n = 1$.
 
-Given any integer, we can list out the sequence of steps. For instance if a1=231, then the sequence {an}={231,77,51,17,11,7,10,14,9,3,1} corresponds to the steps "DdDddUUdDD".
+Given any integer, we can list out the sequence of steps. For instance if $a_1 = 231$, then the sequence $\\{a_n\\} = \\{231, 77, 51, 17, 11, 7, 10, 14, 9, 3, 1\\}$ corresponds to the steps "DdDddUUdDD".
 
-Of course, there are other sequences that begin with that same sequence "DdDddUUdDD....". For instance, if a1=1004064, then the sequence is DdDddUUdDDDdUDUUUdDdUUDDDUdDD. In fact, 1004064 is the smallest possible a1 > 106 that begins with the sequence DdDddUUdDD.
+Of course, there are other sequences that begin with that same sequence "DdDddUUdDD....".
 
-What is the smallest a1 > 1015 that begins with the sequence "UDDDUdddDDUDDddDdDddDDUDDdUUDd"?
+For instance, if $a_1 = 1004064$, then the sequence is DdDddUUdDDDdUDUUUdDdUUDDDUdDD.
+
+In fact, 1004064 is the smallest possible $a_1 > {10}^6$ that begins with the sequence DdDddUUdDD.
+
+What is the smallest $a_1 > {10}^{15}$ that begins with the sequence "UDDDUdddDDUDDddDdDddDDUDDdUUDd"?
 
 # --hints--
 
-`euler277()` should return 1125977393124310.
+`modifiedCollatzSequence()` should return `1125977393124310`.
 
 ```js
-assert.strictEqual(euler277(), 1125977393124310);
+assert.strictEqual(modifiedCollatzSequence(), 1125977393124310);
 ```
 
 # --seed--
@@ -37,12 +41,12 @@ assert.strictEqual(euler277(), 1125977393124310);
 ## --seed-contents--
 
 ```js
-function euler277() {
+function modifiedCollatzSequence() {
 
   return true;
 }
 
-euler277();
+modifiedCollatzSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.md
index 6e26a6a316f..215c51cb036 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4831000cf542c50ff95
 title: 'Problem 278: Linear Combinations of Semiprimes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301928
 dashedName: problem-278-linear-combinations-of-semiprimes
 ---
 
 # --description--
 
-Given the values of integers 1 &lt; a1 &lt; a2 &lt;... &lt; an, consider the linear combination q1a1 + q2a2 + ... + qnan = b, using only integer values qk ≥ 0.
+Given the values of integers $1 &lt; a_1 &lt; a_2 &lt; \ldots &lt; a_n$, consider the linear combination $q_1a_1 + q_2a_2 + \ldots + q_na_n = b$, using only integer values $q_k ≥ 0$.
 
-Note that for a given set of ak, it may be that not all values of b are possible. For instance, if a1 = 5 and a2 = 7, there are no q1 ≥ 0 and q2 ≥ 0 such that b could be 1, 2, 3, 4, 6, 8, 9, 11, 13, 16, 18 or 23.
+Note that for a given set of $a_k$, it may be that not all values of $b$ are possible. For instance, if $a_1 = 5$ and $a_2 = 7$, there are no $q_1 ≥ 0$ and $q_2 ≥ 0$ such that $b$ could be 1, 2, 3, 4, 6, 8, 9, 11, 13, 16, 18 or 23.
 
-In fact, 23 is the largest impossible value of b for a1 = 5 and a2 = 7. We therefore call f(5, 7) = 23. Similarly, it can be shown that f(6, 10, 15)=29 and f(14, 22, 77) = 195.
+In fact, 23 is the largest impossible value of $b$ for $a_1 = 5$ and $a_2 = 7$. We therefore call $f(5, 7) = 23$. Similarly, it can be shown that $f(6, 10, 15)=29$ and $f(14, 22, 77) = 195$.
 
-Find ∑ f(p*q,p*r,q\*r), where p, q and r are prime numbers and p &lt; q &lt; r &lt; 5000.
+Find $\sum f(pq,pr,qr)$, where $p$, $q$ and $r$ are prime numbers and $p &lt; q &lt; r &lt; 5000$.
 
 # --hints--
 
-`euler278()` should return 1228215747273908500.
+`linearCombinationOfSemiprimes()` should return `1228215747273908500`.
 
 ```js
-assert.strictEqual(euler278(), 1228215747273908500);
+assert.strictEqual(linearCombinationOfSemiprimes(), 1228215747273908500);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler278(), 1228215747273908500);
 ## --seed-contents--
 
 ```js
-function euler278() {
+function linearCombinationOfSemiprimes() {
 
   return true;
 }
 
-euler278();
+linearCombinationOfSemiprimes();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.md
index 9fc673b5ea4..9d50a5ebc61 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.md
@@ -1,21 +1,21 @@
 ---
 id: 5900f4841000cf542c50ff96
 title: 'Problem 279: Triangles with integral sides and an integral angle'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301929
 dashedName: problem-279-triangles-with-integral-sides-and-an-integral-angle
 ---
 
 # --description--
 
-How many triangles are there with integral sides, at least one integral angle (measured in degrees), and a perimeter that does not exceed 108?
+How many triangles are there with integral sides, at least one integral angle (measured in degrees), and a perimeter that does not exceed ${10}^8$?
 
 # --hints--
 
-`euler279()` should return 416577688.
+`trianglesWithIntegralSidesAndAngle()` should return `416577688`.
 
 ```js
-assert.strictEqual(euler279(), 416577688);
+assert.strictEqual(trianglesWithIntegralSidesAndAngle(), 416577688);
 ```
 
 # --seed--
@@ -23,12 +23,12 @@ assert.strictEqual(euler279(), 416577688);
 ## --seed-contents--
 
 ```js
-function euler279() {
+function trianglesWithIntegralSidesAndAngle() {
 
   return true;
 }
 
-euler279();
+trianglesWithIntegralSidesAndAngle();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.md
index a476199d1dc..4b361d9af9c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f3881000cf542c50fe9b
-title: 'Problem 28: Number spiral diagonals'
-challengeType: 5
+title: 'Problema 28: Diagonales de la espiral numérica'
+challengeType: 1
 forumTopicId: 301930
 dashedName: problem-28-number-spiral-diagonals
 ---
 
 # --description--
 
-Starting with the number 1 and moving to the right in a clockwise direction a 5 by 5 spiral is formed as follows:
+Comenzando por el 1 y moviéndose hacia la derecha en sentido horario, se genera una espiral de dimensiones 5 por 5, como se muestra a continuación:
 
 <div style='padding-left: 4em;'>
   <div style='color: red; display: inline;'>21</div> 22 23 24 <div style='color: red; display: inline;'>25</div><br>
@@ -18,37 +18,37 @@ Starting with the number 1 and moving to the right in a clockwise direction a 5
   <div style='color: red; display: inline;'>17</div> 16 15 14 <div style='color: red; display: inline;'>13</div><br>
 </div>
 
-It can be verified that the sum of the numbers on the diagonals is 101.
+Se comprueba que la suma de los números en ambas diagonales es 101.
 
-What is the sum of the numbers on the diagonals in an `n` by `n` spiral formed in the same way?
+¿Cuál es la suma de los números en las diagonales de una espiral `n` por `n` formada de la misma manera?
 
 # --hints--
 
-`spiralDiagonals(101)` should return a number.
+`spiralDiagonals(101)` debe devolver un número.
 
 ```js
 assert(typeof spiralDiagonals(101) === 'number');
 ```
 
-`spiralDiagonals(101)` should return 692101.
+`spiralDiagonals(101)` debe devolver 692101.
 
 ```js
 assert(spiralDiagonals(101) == 692101);
 ```
 
-`spiralDiagonals(303)` should return 18591725.
+`spiralDiagonals(303)` debe devolver 18591725.
 
 ```js
 assert(spiralDiagonals(303) == 18591725);
 ```
 
-`spiralDiagonals(505)` should return 85986601.
+`spiralDiagonals(505)` debe devolver 85986601.
 
 ```js
 assert(spiralDiagonals(505) == 85986601);
 ```
 
-`spiralDiagonals(1001)` should return 669171001.
+`spiralDiagonals(1001)` debe devolver 669171001.
 
 ```js
 assert(spiralDiagonals(1001) == 669171001);
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-280-ant-and-seeds.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-280-ant-and-seeds.md
index 642a7d802f9..5057b8bd47c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-280-ant-and-seeds.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-280-ant-and-seeds.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4841000cf542c50ff97
 title: 'Problem 280: Ant and seeds'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301931
 dashedName: problem-280-ant-and-seeds
 ---
@@ -16,10 +16,10 @@ What's the expected number of steps until all seeds have been dropped in the top
 
 # --hints--
 
-`euler280()` should return 430.088247.
+`antAndSeeds()` should return `430.088247`.
 
 ```js
-assert.strictEqual(euler280(), 430.088247);
+assert.strictEqual(antAndSeeds(), 430.088247);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler280(), 430.088247);
 ## --seed-contents--
 
 ```js
-function euler280() {
+function antAndSeeds() {
 
   return true;
 }
 
-euler280();
+antAndSeeds();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md
index 9ac6cf33a6f..60b84a893f8 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f4861000cf542c50ff98
 title: 'Problem 281: Pizza Toppings'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301932
 dashedName: problem-281-pizza-toppings
 ---
 
 # --description--
 
-You are given a pizza (perfect circle) that has been cut into m·n equal pieces and you want to have exactly one topping on each slice.
+You are given a pizza (perfect circle) that has been cut into $m·n$ equal pieces and you want to have exactly one topping on each slice.
 
-Let f(m,n) denote the number of ways you can have toppings on the pizza with m different toppings (m ≥ 2), using each topping on exactly n slices (n ≥ 1). Reflections are considered distinct, rotations are not.
+Let $f(m,n)$ denote the number of ways you can have toppings on the pizza with $m$ different toppings ($m ≥ 2$), using each topping on exactly $n$ slices ($n ≥ 1$). Reflections are considered distinct, rotations are not.
 
-Thus, for instance, f(2,1) = 1, f(2,2) = f(3,1) = 2 and f(3,2) = 16. f(3,2) is shown below:
+Thus, for instance, $f(2,1) = 1$, $f(2,2) = f(3,1) = 2$ and $f(3,2) = 16$. $f(3,2)$ is shown below:
 
-Find the sum of all f(m,n) such that f(m,n) ≤ 1015.
+<img class="img-responsive center-block" alt="animation with 16 ways to have 3 different toppings on 2 slices each" src="https://cdn.freecodecamp.org/curriculum/project-euler/pizza-toppings.gif" style="background-color: white; padding: 10px;" />
+
+Find the sum of all $f(m,n)$ such that $f(m,n) ≤ {10}^{15}$.
 
 # --hints--
 
-`euler281()` should return 1485776387445623.
+`pizzaToppings()` should return `1485776387445623`.
 
 ```js
-assert.strictEqual(euler281(), 1485776387445623);
+assert.strictEqual(pizzaToppings(), 1485776387445623);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler281(), 1485776387445623);
 ## --seed-contents--
 
 ```js
-function euler281() {
+function pizzaToppings() {
 
   return true;
 }
 
-euler281();
+pizzaToppings();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md
index 5abd58ec44b..c9cbb75087d 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md
@@ -1,25 +1,28 @@
 ---
 id: 5900f4861000cf542c50ff99
 title: 'Problem 282: The Ackermann function'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301933
 dashedName: problem-282-the-ackermann-function
 ---
 
 # --description--
 
-For non-negative integers m, n, the Ackermann function A(m, n) is defined as follows:
+For non-negative integers $m$, $n$, the Ackermann function $A(m, n)$ is defined as follows:
 
-For example A(1, 0) = 2, A(2, 2) = 7 and A(3, 4) = 125.
+$$A(m, n) = \begin{cases} n + 1                 & \text{if $m = 0$}             \\\\
+A(m - 1, 1)           & \text{if $m > 0$ and $n = 0$} \\\\ A(m - 1, A(m, n - 1)) & \text{if $m > 0$ and $n > 0$} \end{cases}$$
 
-Find A(n, n) and give your answer mod 148.
+For example $A(1, 0) = 2$, $A(2, 2) = 7$ and $A(3, 4) = 125$.
+
+Find $\displaystyle\sum_{n = 0}^6 A(n, n)$ and give your answer mod ${14}^8$.
 
 # --hints--
 
-`euler282()` should return 1098988351.
+`ackermanFunction()` should return `1098988351`.
 
 ```js
-assert.strictEqual(euler282(), 1098988351);
+assert.strictEqual(ackermanFunction(), 1098988351);
 ```
 
 # --seed--
@@ -27,12 +30,12 @@ assert.strictEqual(euler282(), 1098988351);
 ## --seed-contents--
 
 ```js
-function euler282() {
+function ackermanFunction() {
 
   return true;
 }
 
-euler282();
+ackermanFunction();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md
index e15776ec08f..e32d0d74b9d 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md
@@ -1,8 +1,8 @@
 ---
 id: 5900f4881000cf542c50ff9a
 title: >-
-  Problem 283: Integer sided triangles for which the area * perimeter ratio is integral
-challengeType: 5
+  Problem 283: Integer sided triangles for which the area / perimeter ratio is integral
+challengeType: 1
 forumTopicId: 301934
 dashedName: >-
   problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral
@@ -12,20 +12,20 @@ dashedName: >-
 
 Consider the triangle with sides 6, 8 and 10. It can be seen that the perimeter and the area are both equal to 24.
 
-So the area/perimeter ratio is equal to 1.
+So the $\frac{\text{area}}{\text{perimeter}}$ ratio is equal to 1.
 
 Consider also the triangle with sides 13, 14 and 15. The perimeter equals 42 while the area is equal to 84.
 
-So for this triangle the area/perimeter ratio is equal to 2.
+So for this triangle the $\frac{\text{area}}{\text{perimeter}}$ ratio is equal to 2.
 
 Find the sum of the perimeters of all integer sided triangles for which the area/perimeter ratios are equal to positive integers not exceeding 1000.
 
 # --hints--
 
-`euler283()` should return 28038042525570324.
+`integralAreaPerimeterRatio()` should return `28038042525570324`.
 
 ```js
-assert.strictEqual(euler283(), 28038042525570324);
+assert.strictEqual(integralAreaPerimeterRatio(), 28038042525570324);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler283(), 28038042525570324);
 ## --seed-contents--
 
 ```js
-function euler283() {
+function integralAreaPerimeterRatio() {
 
   return true;
 }
 
-euler283();
+integralAreaPerimeterRatio();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-284-steady-squares.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-284-steady-squares.md
index 818483669ec..d6c86b00055 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-284-steady-squares.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-284-steady-squares.md
@@ -1,27 +1,33 @@
 ---
 id: 5900f4891000cf542c50ff9b
 title: 'Problem 284: Steady Squares'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301935
 dashedName: problem-284-steady-squares
 ---
 
 # --description--
 
-The 3-digit number 376 in the decimal numbering system is an example of numbers with the special property that its square ends with the same digits: 3762 = 141376. Let's call a number with this property a steady square.
+The 3-digit number 376 in the decimal numbering system is an example of numbers with the special property that its square ends with the same digits: ${376}^2 = 141376$. Let's call a number with this property a steady square.
 
-Steady squares can also be observed in other numbering systems. In the base 14 numbering system, the 3-digit number c37 is also a steady square: c372 = aa0c37, and the sum of its digits is c+3+7=18 in the same numbering system. The letters a, b, c and d are used for the 10, 11, 12 and 13 digits respectively, in a manner similar to the hexadecimal numbering system.
+Steady squares can also be observed in other numbering systems. In the base 14 numbering system, the 3-digit number $c37$ is also a steady square: $c37^2 = aa0c37$, and the sum of its digits is $c+3+7=18$ in the same numbering system. The letters $a$, $b$, $c$ and $d$ are used for the 10, 11, 12 and 13 digits respectively, in a manner similar to the hexadecimal numbering system.
 
-For 1 ≤ n ≤ 9, the sum of the digits of all the n-digit steady squares in the base 14 numbering system is 2d8 (582 decimal). Steady squares with leading 0's are not allowed.
+For $1 ≤ n ≤ 9$, the sum of the digits of all the $n$-digit steady squares in the base 14 numbering system is $2d8$ (582 decimal). Steady squares with leading 0's are not allowed.
 
-Find the sum of the digits of all the n-digit steady squares in the base 14 numbering system for 1 ≤ n ≤ 10000 (decimal) and give your answer in the base 14 system using lower case letters where necessary.
+Find the sum of the digits of all the $n$-digit steady squares in the base 14 numbering system for $1 ≤ n ≤ 10000$ (decimal) and give your answer as a string in the base 14 system using lower case letters where necessary.
 
 # --hints--
 
-`euler284()` should return 5a411d7b.
+`steadySquares()` should return a string.
 
 ```js
-assert.strictEqual(euler284(), '5a411d7b');
+assert(typeof steadySquares() === 'string');
+```
+
+`steadySquares()` should return the string `5a411d7b`.
+
+```js
+assert.strictEqual(steadySquares(), '5a411d7b');
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler284(), '5a411d7b');
 ## --seed-contents--
 
 ```js
-function euler284() {
+function steadySquares() {
 
   return true;
 }
 
-euler284();
+steadySquares();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-285-pythagorean-odds.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-285-pythagorean-odds.md
index 12ddabd7222..5c6e49167f9 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-285-pythagorean-odds.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-285-pythagorean-odds.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f48a1000cf542c50ff9c
 title: 'Problem 285: Pythagorean odds'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301936
 dashedName: problem-285-pythagorean-odds
 ---
 
 # --description--
 
-Albert chooses a positive integer k, then two real numbers a, b are randomly chosen in the interval \[0,1] with uniform distribution.
+Albert chooses a positive integer $k$, then two real numbers $a$, $b$ are randomly chosen in the interval [0,1] with uniform distribution.
 
-The square root of the sum (k·a+1)2 + (k·b+1)2 is then computed and rounded to the nearest integer. If the result is equal to k, he scores k points; otherwise he scores nothing.
+The square root of the sum ${(ka + 1)}^2 + {(kb + 1)}^2$ is then computed and rounded to the nearest integer. If the result is equal to $k$, he scores $k$ points; otherwise he scores nothing.
 
-For example, if k = 6, a = 0.2 and b = 0.85, then (k·a+1)2 + (k·b+1)2 = 42.05. The square root of 42.05 is 6.484... and when rounded to the nearest integer, it becomes 6. This is equal to k, so he scores 6 points.
+For example, if $k = 6$, $a = 0.2$ and $b = 0.85$, then ${(ka + 1)}^2 + {(kb + 1)}^2 = 42.05$. The square root of 42.05 is 6.484... and when rounded to the nearest integer, it becomes 6. This is equal to $k$, so he scores 6 points.
 
-It can be shown that if he plays 10 turns with k = 1, k = 2, ..., k = 10, the expected value of his total score, rounded to five decimal places, is 10.20914.
+It can be shown that if he plays 10 turns with $k = 1, k = 2, \ldots, k = 10$, the expected value of his total score, rounded to five decimal places, is 10.20914.
 
-If he plays 105 turns with k = 1, k = 2, k = 3, ..., k = 105, what is the expected value of his total score, rounded to five decimal places?
+If he plays ${10}^5$ turns with $k = 1, k = 2, k = 3, \ldots, k = {10}^5$, what is the expected value of his total score, rounded to five decimal places?
 
 # --hints--
 
-`euler285()` should return 157055.80999.
+`pythagoreanOdds()` should return `157055.80999`.
 
 ```js
-assert.strictEqual(euler285(), 157055.80999);
+assert.strictEqual(pythagoreanOdds(), 157055.80999);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler285(), 157055.80999);
 ## --seed-contents--
 
 ```js
-function euler285() {
+function pythagoreanOdds() {
 
   return true;
 }
 
-euler285();
+pythagoreanOdds();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-286-scoring-probabilities.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-286-scoring-probabilities.md
index abb357c47a2..26e3e198604 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-286-scoring-probabilities.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-286-scoring-probabilities.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f48a1000cf542c50ff9d
 title: 'Problem 286: Scoring probabilities'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301937
 dashedName: problem-286-scoring-probabilities
 ---
 
 # --description--
 
-Barbara is a mathematician and a basketball player. She has found that the probability of scoring a point when shooting from a distance x is exactly (1 - x/q), where q is a real constant greater than 50.
+Barbara is a mathematician and a basketball player. She has found that the probability of scoring a point when shooting from a distance $x$ is exactly ($1 - \frac{x}{q}$), where $q$ is a real constant greater than 50.
 
-During each practice run, she takes shots from distances x = 1, x = 2, ..., x = 50 and, according to her records, she has precisely a 2 % chance to score a total of exactly 20 points.
+During each practice run, she takes shots from distances $x = 1, x = 2, \ldots, x = 50$ and, according to her records, she has precisely a 2 % chance to score a total of exactly 20 points.
 
-Find q and give your answer rounded to 10 decimal places.
+Find $q$ and give your answer rounded to 10 decimal places.
 
 # --hints--
 
-`euler286()` should return 52.6494571953.
+`scoringProbabilities()` should return `52.6494571953`.
 
 ```js
-assert.strictEqual(euler286(), 52.6494571953);
+assert.strictEqual(scoringProbabilities(), 52.6494571953);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler286(), 52.6494571953);
 ## --seed-contents--
 
 ```js
-function euler286() {
+function scoringProbabilities() {
 
   return true;
 }
 
-euler286();
+scoringProbabilities();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md
index 8d11a248e2f..707a6fa97e7 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md
@@ -1,37 +1,42 @@
 ---
 id: 5900f48b1000cf542c50ff9e
 title: 'Problem 287: Quadtree encoding (a simple compression algorithm)'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301938
 dashedName: problem-287-quadtree-encoding-a-simple-compression-algorithm
 ---
 
 # --description--
 
-The quadtree encoding allows us to describe a 2N×2N black and white image as a sequence of bits (0 and 1). Those sequences are to be read from left to right like this:
+The quadtree encoding allows us to describe a $2^N×2^N$ black and white image as a sequence of bits (0 and 1). Those sequences are to be read from left to right like this:
 
-the first bit deals with the complete 2N×2N region;
+- the first bit deals with the complete $2^N×2^N$ region;
+- "0" denotes a split:
+  - the current $2^n×2^n$ region is divided into 4 sub-regions of dimension $2^{n - 1}×2^{n - 1}$,
+  - the next bits contains the description of the top left, top right, bottom left and bottom right sub-regions - in that order;
+- "10" indicates that the current region contains only black pixels;
+- "11" indicates that the current region contains only white pixels.
 
-"0" denotes a split:
+Consider the following 4×4 image (colored marks denote places where a split can occur):
 
-the current 2n×2n region is divided into 4 sub-regions of dimension 2n-1×2n-1,
+<img class="img-responsive center-block" alt="4x4 image with colored marks denoting place where split can occur" src="https://cdn.freecodecamp.org/curriculum/project-euler/quadtree-encoding-a-simple-compression-algorithm.gif" style="background-color: white; padding: 10px;" />
 
-the next bits contains the description of the top left, top right, bottom left and bottom right sub-regions - in that order;
+This image can be described by several sequences, for example : "<strong><span style="color: red">0</span></strong><strong><span style="color: blue">0</span></strong>10101010<strong><span style="color: green">0</span></strong>1011111011<strong><span style="color: orange">0</span></strong>10101010", of length 30, or "<strong><span style="color: red">0</span></strong>10<strong><span style="color: green">0</span></strong>101111101110", of length 16, which is the minimal sequence for this image.
 
-"10" indicates that the current region contains only black pixels;
+For a positive integer $N$, define $D_N$ as the $2^N×2^N$ image with the following coloring scheme:
 
-"11" indicates that the current region contains only white pixels.Consider the following 4×4 image (colored marks denote places where a split can occur):
+- the pixel with coordinates $x = 0$, $y = 0$ corresponds to the bottom left pixel,
+- if ${(x - 2^{N - 1})}^2 + {(y - 2^{N - 1})}^2 ≤ 2^{2N - 2}$ then the pixel is black,
+- otherwise the pixel is white.
 
-This image can be described by several sequences, for example : "001010101001011111011010101010", of length 30, or "0100101111101110", of length 16, which is the minimal sequence for this image.
-
-For a positive integer N, define DN as the 2N×2N image with the following coloring scheme: the pixel with coordinates x = 0, y = 0 corresponds to the bottom left pixel, if (x - 2N-1)2 + (y - 2N-1)2 ≤ 22N-2 then the pixel is black, otherwise the pixel is white.What is the length of the minimal sequence describing D24 ?
+What is the length of the minimal sequence describing $D_{24}$?
 
 # --hints--
 
-`euler287()` should return 313135496.
+`quadtreeEncoding()` should return `313135496`.
 
 ```js
-assert.strictEqual(euler287(), 313135496);
+assert.strictEqual(quadtreeEncoding(), 313135496);
 ```
 
 # --seed--
@@ -39,12 +44,12 @@ assert.strictEqual(euler287(), 313135496);
 ## --seed-contents--
 
 ```js
-function euler287() {
+function quadtreeEncoding() {
 
   return true;
 }
 
-euler287();
+quadtreeEncoding();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md
index 28a2e301ceb..cd92a15cd8c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md
@@ -1,31 +1,32 @@
 ---
 id: 5900f48d1000cf542c50ff9f
 title: 'Problem 288: An enormous factorial'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301939
 dashedName: problem-288-an-enormous-factorial
 ---
 
 # --description--
 
-For any prime p the number N(p,q) is defined by
+For any prime $p$ the number $N(p,q)$ is defined by $N(p,q) = \sum_{n=0}^q T_n \times p^n$ with $T_n$ generated by the following random number generator:
 
-N(p,q) = ∑n=0 to q Tn\*pn with Tn generated by the following random number generator:
+$$\begin{align}   & S_0 = 290797 \\\\
+  & S_{n + 1} = {S_n}^2\bmod 50\\,515\\,093 \\\\ & T_n = S_n\bmod p \end{align}$$
 
-S0 = 290797 Sn+1 = Sn2 mod 50515093 Tn = Sn mod p
+Let $Nfac(p,q)$ be the factorial of $N(p,q)$.
 
-Let Nfac(p,q) be the factorial of N(p,q). Let NF(p,q) be the number of factors p in Nfac(p,q).
+Let $NF(p,q)$ be the number of factors $p$ in $Nfac(p,q)$.
 
-You are given that NF(3,10000) mod 320=624955285.
+You are given that $NF(3,10000) \bmod 3^{20} = 624\\,955\\,285$.
 
-Find NF(61,107) mod 6110
+Find $NF(61,{10}^7)\bmod {61}^{10}$.
 
 # --hints--
 
-`euler288()` should return 605857431263982000.
+`enormousFactorial()` should return `605857431263982000`.
 
 ```js
-assert.strictEqual(euler288(), 605857431263982000);
+assert.strictEqual(enormousFactorial(), 605857431263982000);
 ```
 
 # --seed--
@@ -33,12 +34,12 @@ assert.strictEqual(euler288(), 605857431263982000);
 ## --seed-contents--
 
 ```js
-function euler288() {
+function enormousFactorial() {
 
   return true;
 }
 
-euler288();
+enormousFactorial();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md
index fcac68664d9..e491cab3612 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f48d1000cf542c50ffa0
 title: 'Problem 289: Eulerian Cycles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301940
 dashedName: problem-289-eulerian-cycles
 ---
 
 # --description--
 
-Let C(x,y) be a circle passing through the points (x, y), (x, y+1), (x+1, y) and (x+1, y+1).
+Let $C(x,y)$ be a circle passing through the points ($x$, $y$), ($x$, $y + 1$), ($x + 1$, $y$) and ($x + 1$, $y + 1$).
 
-For positive integers m and n, let E(m,n) be a configuration which consists of the m·n circles: { C(x,y): 0 ≤ x &lt; m, 0 ≤ y &lt; n, x and y are integers }
+For positive integers $m$ and $n$, let $E(m,n)$ be a configuration which consists of the $m·n$ circles: { $C(x,y)$: $0 ≤ x &lt; m$, $0 ≤ y &lt; n$, $x$ and $y$ are integers }
 
-An Eulerian cycle on E(m,n) is a closed path that passes through each arc exactly once. Many such paths are possible on E(m,n), but we are only interested in those which are not self-crossing: A non-crossing path just touches itself at lattice points, but it never crosses itself.
+An Eulerian cycle on $E(m,n)$ is a closed path that passes through each arc exactly once. Many such paths are possible on $E(m,n)$, but we are only interested in those which are not self-crossing: A non-crossing path just touches itself at lattice points, but it never crosses itself.
 
-The image below shows E(3,3) and an example of an Eulerian non-crossing path.
+The image below shows $E(3,3)$ and an example of an Eulerian non-crossing path.
 
-Let L(m,n) be the number of Eulerian non-crossing paths on E(m,n). For example, L(1,2) = 2, L(2,2) = 37 and L(3,3) = 104290.
+<img class="img-responsive center-block" alt="Eulerian cycle E(3, 3) and Eulerian non-crossing path" src="https://cdn.freecodecamp.org/curriculum/project-euler/eulerian-cycles.gif" style="background-color: white; padding: 10px;" />
 
-Find L(6,10) mod 1010.
+Let $L(m,n)$ be the number of Eulerian non-crossing paths on $E(m,n)$. For example, $L(1,2) = 2$, $L(2,2) = 37$ and $L(3,3) = 104290$.
+
+Find $L(6,10)\bmod {10}^{10}$.
 
 # --hints--
 
-`euler289()` should return 6567944538.
+`eulerianCycles()` should return `6567944538`.
 
 ```js
-assert.strictEqual(euler289(), 6567944538);
+assert.strictEqual(eulerianCycles(), 6567944538);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler289(), 6567944538);
 ## --seed-contents--
 
 ```js
-function euler289() {
+function eulerianCycles() {
 
   return true;
 }
 
-euler289();
+eulerianCycles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
index 28c05dfc85d..4b8f00162ee 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f3891000cf542c50fe9c
 title: 'Problem 29: Distinct powers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301941
 dashedName: problem-29-distinct-powers
 ---
 
 # --description--
 
-Consider all integer combinations of ab for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
+Consider all integer combinations of $a^b$ for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
 
 <div style='padding-left: 4em;'>
   2<sup>2</sup>=4, 2<sup>3</sup>=8, 2<sup>4</sup>=16, 2<sup>5</sup>=32 <br>
@@ -23,7 +23,7 @@ If they are then placed in numerical order, with any repeats removed, we get the
   4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
 </div>
 
-How many distinct terms are in the sequence generated by `ab` for 2 ≤ `a` ≤ `n` and 2 ≤ `b` ≤ `n`?
+How many distinct terms are in the sequence generated by $a^b$ for 2 ≤ `a` ≤ `n` and 2 ≤ `b` ≤ `n`?
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-290-digital-signature.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-290-digital-signature.md
index e46dfedd830..a6b3636eefd 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-290-digital-signature.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-290-digital-signature.md
@@ -1,21 +1,21 @@
 ---
 id: 5900f48f1000cf542c50ffa1
 title: 'Problem 290: Digital Signature'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301942
 dashedName: problem-290-digital-signature
 ---
 
 # --description--
 
-How many integers 0 ≤ n &lt; 1018 have the property that the sum of the digits of n equals the sum of digits of 137n?
+How many integers $0 ≤ n &lt; {10}^{18}$ have the property that the sum of the digits of $n$ equals the sum of digits of $137n$?
 
 # --hints--
 
-`euler290()` should return 20444710234716470.
+`digitalSignature()` should return `20444710234716470`.
 
 ```js
-assert.strictEqual(euler290(), 20444710234716470);
+assert.strictEqual(digitalSignature(), 20444710234716470);
 ```
 
 # --seed--
@@ -23,12 +23,12 @@ assert.strictEqual(euler290(), 20444710234716470);
 ## --seed-contents--
 
 ```js
-function euler290() {
+function digitalSignature() {
 
   return true;
 }
 
-euler290();
+digitalSignature();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.md
index 0c7d704d9f4..bb33727271a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.md
@@ -1,23 +1,23 @@
 ---
 id: 5900f48f1000cf542c50ffa2
 title: 'Problem 291: Panaitopol Primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301943
 dashedName: problem-291-panaitopol-primes
 ---
 
 # --description--
 
-A prime number p is called a Panaitopol prime if for some positive integersx and y.
+A prime number $p$ is called a Panaitopol prime if $p = \frac{x^4 - y^4}{x^3 + y^3}$ for some positive integers $x$ and $y$.
 
-Find how many Panaitopol primes are less than 5×1015.
+Find how many Panaitopol primes are less than $5 × {10}^{15}$.
 
 # --hints--
 
-`euler291()` should return 4037526.
+`panaitopolPrimes()` should return `4037526`.
 
 ```js
-assert.strictEqual(euler291(), 4037526);
+assert.strictEqual(panaitopolPrimes(), 4037526);
 ```
 
 # --seed--
@@ -25,12 +25,12 @@ assert.strictEqual(euler291(), 4037526);
 ## --seed-contents--
 
 ```js
-function euler291() {
+function panaitopolPrimes() {
 
   return true;
 }
 
-euler291();
+panaitopolPrimes();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.md
index 446e8755315..8e0dd899454 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.md
@@ -1,31 +1,34 @@
 ---
 id: 5900f4911000cf542c50ffa3
 title: 'Problem 292: Pythagorean Polygons'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301944
 dashedName: problem-292-pythagorean-polygons
 ---
 
 # --description--
 
-We shall define a pythagorean polygon to be a convex polygon with the following properties:there are at least three vertices,
+We shall define a pythagorean polygon to be a convex polygon with the following properties:
 
-no three vertices are aligned,
+- there are at least three vertices,
+- no three vertices are aligned,
+- each vertex has integer coordinates,
+- each edge has integer length.
 
-each vertex has integer coordinates,
-
-each edge has integer length.For a given integer n, define P(n) as the number of distinct pythagorean polygons for which the perimeter is ≤ n.
+For a given integer $n$, define $P(n)$ as the number of distinct pythagorean polygons for which the perimeter is $≤ n$.
 
 Pythagorean polygons should be considered distinct as long as none is a translation of another.
 
-You are given that P(4) = 1, P(30) = 3655 and P(60) = 891045. Find P(120).
+You are given that $P(4) = 1$, $P(30) = 3655$ and $P(60) = 891045$.
+
+Find $P(120)$.
 
 # --hints--
 
-`euler292()` should return 3600060866.
+`pythagoreanPolygons()` should return `3600060866`.
 
 ```js
-assert.strictEqual(euler292(), 3600060866);
+assert.strictEqual(pythagoreanPolygons(), 3600060866);
 ```
 
 # --seed--
@@ -33,12 +36,12 @@ assert.strictEqual(euler292(), 3600060866);
 ## --seed-contents--
 
 ```js
-function euler292() {
+function pythagoreanPolygons() {
 
   return true;
 }
 
-euler292();
+pythagoreanPolygons();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.md
index 18307e7b042..0c8076828de 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f4931000cf542c50ffa4
 title: 'Problem 293: Pseudo-Fortunate Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301945
 dashedName: problem-293-pseudo-fortunate-numbers
 ---
 
 # --description--
 
-An even positive integer N will be called admissible, if it is a power of 2 or its distinct prime factors are consecutive primes.
+An even positive integer $N$ will be called admissible, if it is a power of 2 or its distinct prime factors are consecutive primes.
 
-The first twelve admissible numbers are 2,4,6,8,12,16,18,24,30,32,36,48.
+The first twelve admissible numbers are 2, 4, 6, 8, 12, 16, 18, 24, 30, 32, 36, 48.
 
-If N is admissible, the smallest integer M > 1 such that N+M is prime, will be called the pseudo-Fortunate number for N.
+If $N$ is admissible, the smallest integer $M > 1$ such that $N + M$ is prime, will be called the pseudo-Fortunate number for $N$.
 
-For example, N=630 is admissible since it is even and its distinct prime factors are the consecutive primes 2,3,5 and 7. The next prime number after 631 is 641; hence, the pseudo-Fortunate number for 630 is M=11. It can also be seen that the pseudo-Fortunate number for 16 is 3.
+For example, $N = 630$ is admissible since it is even and its distinct prime factors are the consecutive primes 2, 3, 5 and 7. The next prime number after 631 is 641; hence, the pseudo-Fortunate number for 630 is $M = 11$. It can also be seen that the pseudo-Fortunate number for 16 is 3.
 
-Find the sum of all distinct pseudo-Fortunate numbers for admissible numbers N less than 109.
+Find the sum of all distinct pseudo-Fortunate numbers for admissible numbers $N$ less than ${10}^9$.
 
 # --hints--
 
-`euler293()` should return 2209.
+`pseudoFortunateNumbers()` should return `2209`.
 
 ```js
-assert.strictEqual(euler293(), 2209);
+assert.strictEqual(pseudoFortunateNumbers(), 2209);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler293(), 2209);
 ## --seed-contents--
 
 ```js
-function euler293() {
+function pseudoFortunateNumbers() {
 
   return true;
 }
 
-euler293();
+pseudoFortunateNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.md
index b7bc62a5f13..b32ebc882de 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.md
@@ -1,29 +1,30 @@
 ---
 id: 5900f4931000cf542c50ffa5
 title: 'Problem 294: Sum of digits - experience #23'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301946
 dashedName: problem-294-sum-of-digits---experience-23
 ---
 
 # --description--
 
-For a positive integer k, define d(k) as the sum of the digits of k in its usual decimal representation.
+For a positive integer $k$, define $d(k)$ as the sum of the digits of $k$ in its usual decimal representation. Thus $d(42) = 4 + 2 = 6$.
 
-Thus d(42) = 4+2 = 6.
+For a positive integer $n$, define $S(n)$ as the number of positive integers $k &lt; {10}^n$ with the following properties:
 
-For a positive integer n, define S(n) as the number of positive integers k &lt; 10n with the following properties : k is divisible by 23 and d(k) = 23.
+- $k$ is divisible by 23 and,
+- $d(k) = 23$.
 
-You are given that S(9) = 263626 and S(42) = 6377168878570056.
+You are given that $S(9) = 263\\,626$ and $S(42) = 6\\,377\\,168\\,878\\,570\\,056$.
 
-Find S(1112) and give your answer mod 109.
+Find $S({11}^{12})$ and give your answer $\bmod {10}^9$.
 
 # --hints--
 
-`euler294()` should return 789184709.
+`experience23()` should return `789184709`.
 
 ```js
-assert.strictEqual(euler294(), 789184709);
+assert.strictEqual(experience23(), 789184709);
 ```
 
 # --seed--
@@ -31,12 +32,12 @@ assert.strictEqual(euler294(), 789184709);
 ## --seed-contents--
 
 ```js
-function euler294() {
+function experience23() {
 
   return true;
 }
 
-euler294();
+experience23();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md
index 70d1de6d608..9354ea7c840 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4931000cf542c50ffa6
 title: 'Problem 295: Lenticular holes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301947
 dashedName: problem-295-lenticular-holes
 ---
@@ -10,30 +10,33 @@ dashedName: problem-295-lenticular-holes
 
 We call the convex area enclosed by two circles a lenticular hole if:
 
-The centres of both circles are on lattice points.
+- The centres of both circles are on lattice points.
+- The two circles intersect at two distinct lattice points.
+- The interior of the convex area enclosed by both circles does not contain any lattice points.
 
-The two circles intersect at two distinct lattice points.
+Consider the circles:
 
-The interior of the convex area enclosed by both circles does not contain any lattice points.
+$$\begin{align}   & C_0: x^2 + y^2 = 25 \\\\
+  & C_1: {(x + 4)}^2 + {(y - 4)}^2 = 1 \\\\ & C_2: {(x - 12)}^2 + {(y - 4)}^2 = 65 \end{align}$$
 
-Consider the circles: C0: x2+y2=25 C1: (x+4)2+(y-4)2=1 C2: (x-12)2+(y-4)2=65
+The circles $C_0$, $C_1$ and $C_2$ are drawn in the picture below.
 
-The circles C0, C1 and C2 are drawn in the picture below.
+<img class="img-responsive center-block" alt="C_0, C_1 and C_2 circles" src="https://cdn.freecodecamp.org/curriculum/project-euler/lenticular-holes.gif" style="background-color: white; padding: 10px;" />
 
-C0 and C1 form a lenticular hole, as well as C0 and C2.
+$C_0$ and $C_1$ form a lenticular hole, as well as $C_0$ and $C_2$.
 
-We call an ordered pair of positive real numbers (r1, r2) a lenticular pair if there exist two circles with radii r1 and r2 that form a lenticular hole. We can verify that (1, 5) and (5, √65) are the lenticular pairs of the example above.
+We call an ordered pair of positive real numbers ($r_1$, $r_2$) a lenticular pair if there exist two circles with radii $r_1$ and $r_2$ that form a lenticular hole. We can verify that ($1$, $5$) and ($5$, $\sqrt{65}$) are the lenticular pairs of the example above.
 
-Let L(N) be the number of distinct lenticular pairs (r1, r2) for which 0 &lt; r1 ≤ r2 ≤ N. We can verify that L(10) = 30 and L(100) = 3442.
+Let $L(N)$ be the number of distinct lenticular pairs ($r_1$, $r_2$) for which $0 &lt; r_1 ≤ r_2 ≤ N$. We can verify that $L(10) = 30$ and $L(100) = 3442$.
 
-Find L(100 000).
+Find $L(100\\,000)$.
 
 # --hints--
 
-`euler295()` should return 4884650818.
+`lenticularHoles()` should return `4884650818`.
 
 ```js
-assert.strictEqual(euler295(), 4884650818);
+assert.strictEqual(lenticularHoles(), 4884650818);
 ```
 
 # --seed--
@@ -41,12 +44,12 @@ assert.strictEqual(euler295(), 4884650818);
 ## --seed-contents--
 
 ```js
-function euler295() {
+function lenticularHoles() {
 
   return true;
 }
 
-euler295();
+lenticularHoles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md
index 0d269dca3cc..660d66eabb4 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md
@@ -1,25 +1,27 @@
 ---
 id: 5900f4941000cf542c50ffa7
 title: 'Problem 296: Angular Bisector and Tangent'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301948
 dashedName: problem-296-angular-bisector-and-tangent
 ---
 
 # --description--
 
-Given is an integer sided triangle ABC with BC ≤ AC ≤ AB.k is the angular bisector of angle ACB.m is the tangent at C to the circumscribed circle of ABC.n is a line parallel to m through B.
+Given is an integer sided triangle $ABC$ with $BC ≤ AC ≤ AB$. $k$ is the angular bisector of angle $ACB$. $m$ is the tangent at $C$ to the circumscribed circle of $ABC$. $n$ is a line parallel to $m$ through $B$.
 
-The intersection of n and k is called E.
+The intersection of $n$ and $k$ is called $E$.
 
-How many triangles ABC with a perimeter not exceeding 100 000 exist such that BE has integral length?
+<img class="img-responsive center-block" alt="triangle ABC, with k - the angular bisector of angle ACB, m - tangent at point C, n - line parallel to m through B, and point E - intersection of k and n" src="https://cdn.freecodecamp.org/curriculum/project-euler/angular-bisector-and-tangent.gif" style="background-color: white; padding: 10px;" />
+
+How many triangles $ABC$ with a perimeter not exceeding $100\\,000$ exist such that $BE$ has integral length?
 
 # --hints--
 
-`euler296()` should return 1137208419.
+`angularBisectorAndTangent()` should return `1137208419`.
 
 ```js
-assert.strictEqual(euler296(), 1137208419);
+assert.strictEqual(angularBisectorAndTangent(), 1137208419);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler296(), 1137208419);
 ## --seed-contents--
 
 ```js
-function euler296() {
+function angularBisectorAndTangent() {
 
   return true;
 }
 
-euler296();
+angularBisectorAndTangent();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.md
index 55d96b520c6..55f3adbfd1c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4951000cf542c50ffa8
 title: 'Problem 297: Zeckendorf Representation'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301949
 dashedName: problem-297-zeckendorf-representation
 ---
@@ -12,18 +12,24 @@ Each new term in the Fibonacci sequence is generated by adding the previous two
 
 Starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89.
 
-Every positive integer can be uniquely written as a sum of nonconsecutive terms of the Fibonacci sequence. For example, 100 = 3 + 8 + 89. Such a sum is called the Zeckendorf representation of the number.
+Every positive integer can be uniquely written as a sum of nonconsecutive terms of the Fibonacci sequence. For example, 100 = 3 + 8 + 89.
 
-For any integer n>0, let z(n) be the number of terms in the Zeckendorf representation of n. Thus, z(5) = 1, z(14) = 2, z(100) = 3 etc. Also, for 0&lt;n&lt;106, ∑ z(n) = 7894453.
+Such a sum is called the Zeckendorf representation of the number.
 
-Find ∑ z(n) for 0&lt;n&lt;1017.
+For any integer $n>0$, let $z(n)$ be the number of terms in the Zeckendorf representation of $n$.
+
+Thus, $z(5) = 1$, $z(14) = 2$, $z(100) = 3$ etc.
+
+Also, for $0 &lt; n &lt; {10}^6$, $\sum z(n) = 7\\,894\\,453$.
+
+Find $\sum z(n)$ for $0 &lt; n &lt; {10}^{17}$.
 
 # --hints--
 
-`euler297()` should return 2252639041804718000.
+`zeckendorfRepresentation()` should return `2252639041804718000`.
 
 ```js
-assert.strictEqual(euler297(), 2252639041804718000);
+assert.strictEqual(zeckendorfRepresentation(), 2252639041804718000);
 ```
 
 # --seed--
@@ -31,12 +37,12 @@ assert.strictEqual(euler297(), 2252639041804718000);
 ## --seed-contents--
 
 ```js
-function euler297() {
+function zeckendorfRepresentation() {
 
   return true;
 }
 
-euler297();
+zeckendorfRepresentation();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md
index a9c0c8ad7e0..da401b24b95 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4971000cf542c50ffa9
 title: 'Problem 298: Selective Amnesia'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301950
 dashedName: problem-298-selective-amnesia
 ---
@@ -12,16 +12,29 @@ Larry and Robin play a memory game involving of a sequence of random numbers bet
 
 Both players start with empty memories. Both players always add new missed numbers to their memory but use a different strategy in deciding which number to remove: Larry's strategy is to remove the number that hasn't been called in the longest time. Robin's strategy is to remove the number that's been in the memory the longest time.
 
-Example game:Turn Callednumber Larry'smemory Larry'sscore Robin'smemory Robin'sscore 1 1 1 0 1 0 2 2 1,2 0 1,2 0 3 4 1,2,4 0 1,2,4 0 4 6 1,2,4,6 0 1,2,4,6 0 5 1 1,2,4,6 1 1,2,4,6 1 6 8 1,2,4,6,8 1 1,2,4,6,8 1 7 10 1,4,6,8,10 1 2,4,6,8,10 1 8 2 1,2,6,8,10 1 2,4,6,8,10 2 9 4 1,2,4,8,10 1 2,4,6,8,10 3 10 1 1,2,4,8,10 2 1,4,6,8,10 3
+Example game:
 
-Denoting Larry's score by L and Robin's score by R, what is the expected value of |L-R| after 50 turns? Give your answer rounded to eight decimal places using the format x.xxxxxxxx .
+| Turn | Called number | Larry's memory | Larry's score | Robin's memory | Robin's score |
+| ---- | ------------- | --------------:| ------------- | -------------- | ------------- |
+| 1    | 1             |              1 | 0             | 1              | 0             |
+| 2    | 2             |            1,2 | 0             | 1,2            | 0             |
+| 3    | 4             |          1,2,4 | 0             | 1,2,4          | 0             |
+| 4    | 6             |        1,2,4,6 | 0             | 1,2,4,6        | 0             |
+| 5    | 1             |        1,2,4,6 | 1             | 1,2,4,6        | 1             |
+| 6    | 8             |      1,2,4,6,8 | 1             | 1,2,4,6,8      | 1             |
+| 7    | 10            |     1,4,6,8,10 | 1             | 2,4,6,8,10     | 1             |
+| 8    | 2             |     1,2,6,8,10 | 1             | 2,4,6,8,10     | 2             |
+| 9    | 4             |     1,2,4,8,10 | 1             | 2,4,6,8,10     | 3             |
+| 10   | 1             |     1,2,4,8,10 | 2             | 1,4,6,8,10     | 3             |
+
+Denoting Larry's score by $L$ and Robin's score by $R$, what is the expected value of $|L - R|$ after 50 turns? Give your answer rounded to eight decimal places using the format x.xxxxxxxx .
 
 # --hints--
 
-`euler298()` should return 1.76882294.
+`selectiveAmnesia()` should return `1.76882294`.
 
 ```js
-assert.strictEqual(euler298(), 1.76882294);
+assert.strictEqual(selectiveAmnesia(), 1.76882294);
 ```
 
 # --seed--
@@ -29,12 +42,12 @@ assert.strictEqual(euler298(), 1.76882294);
 ## --seed-contents--
 
 ```js
-function euler298() {
+function selectiveAmnesia() {
 
   return true;
 }
 
-euler298();
+selectiveAmnesia();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md
index 586b5890681..5bd781949f5 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md
@@ -1,33 +1,39 @@
 ---
 id: 5900f4971000cf542c50ffaa
 title: 'Problem 299: Three similar triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301951
 dashedName: problem-299-three-similar-triangles
 ---
 
 # --description--
 
-Four points with integer coordinates are selected:A(a, 0), B(b, 0), C(0, c) and D(0, d),
+Four points with integer coordinates are selected:
 
-with 0 &lt; a &lt; b and 0 &lt; c &lt; d.
+$A(a, 0)$, $B(b, 0)$, $C(0, c)$ and $D(0, d)$, with $0 &lt; a &lt; b$ and $0 &lt; c &lt; d$.
 
-Point P, also with integer coordinates, is chosen on the line AC so that the three triangles ABP, CDP and BDP are all similar.
+Point $P$, also with integer coordinates, is chosen on the line $AC$ so that the three triangles $ABP$, $CDP$ and $BDP$ are all similar.
 
-It is easy to prove that the three triangles can be similar, only if a=c.
+<img class="img-responsive center-block" alt="points A, B, C, D and P creating three triangles: ABP, CDP, and BDP" src="https://cdn.freecodecamp.org/curriculum/project-euler/three-similar-triangles.gif" style="background-color: white; padding: 10px;" />
 
-So, given that a=c, we are looking for triplets (a,b,d) such that at least one point P (with integer coordinates) exists on AC, making the three triangles ABP, CDP and BDP all similar.
+It is easy to prove that the three triangles can be similar, only if $a = c$.
 
-For example, if (a,b,d)=(2,3,4), it can be easily verified that point P(1,1) satisfies the above condition. Note that the triplets (2,3,4) and (2,4,3) are considered as distinct, although point P(1,1) is common for both.
+So, given that $a = c$, we are looking for triplets ($a$, $b$, $d$) such that at least one point $P$ (with integer coordinates) exists on $AC$, making the three triangles $ABP$, $CDP$ and $BDP$ all similar.
 
-If b+d &lt; 100, there are 92 distinct triplets (a,b,d) such that point P exists. If b+d &lt; 100 000, there are 320471 distinct triplets (a,b,d) such that point P exists. If b+d &lt; 100 000 000, how many distinct triplets (a,b,d) are there such that point P exists?
+For example, if $(a, b, d) = (2, 3, 4)$, it can be easily verified that point $P(1, 1)$ satisfies the above condition. Note that the triplets (2,3,4) and (2,4,3) are considered as distinct, although point $P(1, 1)$ is common for both.
+
+If $b + d &lt; 100$, there are 92 distinct triplets ($a$, $b$, $d$) such that point $P$ exists.
+
+If $b + d &lt; 100\\,000$, there are 320471 distinct triplets ($a$, $b$, $d$) such that point $P$ exists.
+
+If $b + d &lt; 100\\,000\\,000$, how many distinct triplets ($a$, $b$, $d$) are there such that point $P$ exists?
 
 # --hints--
 
-`euler299()` should return 549936643.
+`threeSimilarTriangles()` should return `549936643`.
 
 ```js
-assert.strictEqual(euler299(), 549936643);
+assert.strictEqual(threeSimilarTriangles(), 549936643);
 ```
 
 # --seed--
@@ -35,12 +41,12 @@ assert.strictEqual(euler299(), 549936643);
 ## --seed-contents--
 
 ```js
-function euler299() {
+function threeSimilarTriangles() {
 
   return true;
 }
 
-euler299();
+threeSimilarTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-30-digit-n-powers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-30-digit-n-powers.md
index 1eb7fd409bb..1e7472bce84 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-30-digit-n-powers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-30-digit-n-powers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f38a1000cf542c50fe9d
 title: 'Problem 30: Digit n powers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301953
 dashedName: problem-30-digit-n-powers
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-300-protein-folding.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-300-protein-folding.md
index 52c5f272c6f..d5f2020b784 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-300-protein-folding.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-300-protein-folding.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f49a1000cf542c50ffac
 title: 'Problem 300: Protein folding'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301954
 dashedName: problem-300-protein-folding
 ---
@@ -10,24 +10,30 @@ dashedName: problem-300-protein-folding
 
 In a very simplified form, we can consider proteins as strings consisting of hydrophobic (H) and polar (P) elements, e.g. HHPPHHHPHHPH.
 
-For this problem, the orientation of a protein is important; e.g. HPP is considered distinct from PPH. Thus, there are 2n distinct proteins consisting of n elements.
+For this problem, the orientation of a protein is important; e.g. HPP is considered distinct from PPH. Thus, there are $2^n$ distinct proteins consisting of $n$ elements.
 
-When one encounters these strings in nature, they are always folded in such a way that the number of H-H contact points is as large as possible, since this is energetically advantageous. As a result, the H-elements tend to accumulate in the inner part, with the P-elements on the outside. Natural proteins are folded in three dimensions of course, but we will only consider protein folding in two dimensions.
+When one encounters these strings in nature, they are always folded in such a way that the number of H-H contact points is as large as possible, since this is energetically advantageous.
+
+As a result, the H-elements tend to accumulate in the inner part, with the P-elements on the outside.
+
+Natural proteins are folded in three dimensions of course, but we will only consider protein folding in <u>two dimensions</u>.
 
 The figure below shows two possible ways that our example protein could be folded (H-H contact points are shown with red dots).
 
+<img class="img-responsive center-block" alt="two possible ways to fold example protein" src="https://cdn.freecodecamp.org/curriculum/project-euler/protein-folding.gif" style="background-color: white; padding: 10px;" />
+
 The folding on the left has only six H-H contact points, thus it would never occur naturally. On the other hand, the folding on the right has nine H-H contact points, which is optimal for this string.
 
-Assuming that H and P elements are equally likely to occur in any position along the string, the average number of H-H contact points in an optimal folding of a random protein string of length 8 turns out to be 850 / 28=3.3203125.
+Assuming that H and P elements are equally likely to occur in any position along the string, the average number of H-H contact points in an optimal folding of a random protein string of length 8 turns out to be $\frac{850}{2^8} = 3.3203125$.
 
 What is the average number of H-H contact points in an optimal folding of a random protein string of length 15? Give your answer using as many decimal places as necessary for an exact result.
 
 # --hints--
 
-`euler300()` should return 8.0540771484375.
+`proteinFolding()` should return `8.0540771484375`.
 
 ```js
-assert.strictEqual(euler300(), 8.0540771484375);
+assert.strictEqual(proteinFolding(), 8.0540771484375);
 ```
 
 # --seed--
@@ -35,12 +41,12 @@ assert.strictEqual(euler300(), 8.0540771484375);
 ## --seed-contents--
 
 ```js
-function euler300() {
+function proteinFolding() {
 
   return true;
 }
 
-euler300();
+proteinFolding();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-301-nim.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-301-nim.md
index 8197d8abf58..b66b1b9ae06 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-301-nim.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-301-nim.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4991000cf542c50ffab
 title: 'Problem 301: Nim'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301955
 dashedName: problem-301-nim
 ---
@@ -12,25 +12,30 @@ Nim is a game played with heaps of stones, where two players take it in turn to
 
 We'll consider the three-heap normal-play version of Nim, which works as follows:
 
--   At the start of the game there are three heaps of stones.
--   On his turn the player removes any positive number of stones from any single heap.
--   The first player unable to move (because no stones remain) loses.
+- At the start of the game there are three heaps of stones.
+- On his turn the player removes any positive number of stones from any single heap.
+- The first player unable to move (because no stones remain) loses.
 
-If (n1,n2,n3) indicates a Nim position consisting of heaps of size n1, n2 and n3 then there is a simple function X(n1,n2,n3) — that you may look up or attempt to deduce for yourself — that returns: zero if, with perfect strategy, the player about to move will eventually lose; or non-zero if, with perfect strategy, the player about to move will eventually win. For example X(1,2,3) = 0 because, no matter what the current player does, his opponent can respond with a move that leaves two heaps of equal size, at which point every move by the current player can be mirrored by his opponent until no stones remain; so the current player loses. To illustrate:
+If ($n_1$, $n_2$, $n_3$) indicates a Nim position consisting of heaps of size $n_1$, $n_2$ and $n_3$ then there is a simple function $X(n_1,n_2,n_3)$ — that you may look up or attempt to deduce for yourself — that returns:
 
--   current player moves to (1,2,1)
--   opponent moves to (1,0,1)
--   current player moves to (0,0,1)
--   opponent moves to (0,0,0), and so wins.
+- zero if, with perfect strategy, the player about to move will eventually lose; or
+- non-zero if, with perfect strategy, the player about to move will eventually win.
 
-For how many positive integers n ≤ 230 does X(n,2n,3n) = 0 ?
+For example $X(1, 2, 3) = 0$ because, no matter what the current player does, his opponent can respond with a move that leaves two heaps of equal size, at which point every move by the current player can be mirrored by his opponent until no stones remain; so the current player loses. To illustrate:
+
+- current player moves to (1,2,1)
+- opponent moves to (1,0,1)
+- current player moves to (0,0,1)
+- opponent moves to (0,0,0), and so wins.
+
+For how many positive integers $n ≤ 2^{30}$ does $X(n, 2n, 3n) = 0$?
 
 # --hints--
 
-`euler301()` should return 2178309.
+`nim()` should return `2178309`.
 
 ```js
-assert.strictEqual(euler301(), 2178309);
+assert.strictEqual(nim(), 2178309);
 ```
 
 # --seed--
@@ -38,12 +43,12 @@ assert.strictEqual(euler301(), 2178309);
 ## --seed-contents--
 
 ```js
-function euler301() {
+function nim() {
 
   return true;
 }
 
-euler301();
+nim();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.md
index 78c112d626a..4c5301c49bf 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.md
@@ -1,33 +1,33 @@
 ---
 id: 5900f49b1000cf542c50ffad
 title: 'Problem 302: Strong Achilles Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301956
 dashedName: problem-302-strong-achilles-numbers
 ---
 
 # --description--
 
-A positive integer n is powerful if p2 is a divisor of n for every prime factor p in n.
+A positive integer $n$ is powerful if $p^2$ is a divisor of $n$ for every prime factor $p$ in $n$.
 
-A positive integer n is a perfect power if n can be expressed as a power of another positive integer.
+A positive integer $n$ is a perfect power if $n$ can be expressed as a power of another positive integer.
 
-A positive integer n is an Achilles number if n is powerful but not a perfect power. For example, 864 and 1800 are Achilles numbers: 864 = 25·33 and 1800 = 23·32·52.
+A positive integer $n$ is an Achilles number if $n$ is powerful but not a perfect power. For example, 864 and 1800 are Achilles numbers: $864 = 2^5 \times 3^3$ and $1800 = 2^3 \times 3^2 \times 5^2$.
 
-We shall call a positive integer S a Strong Achilles number if both S and φ(S) are Achilles numbers.1 For example, 864 is a Strong Achilles number: φ(864) = 288 = 25·32. However, 1800 isn't a Strong Achilles number because: φ(1800) = 480 = 25·31·51.
+We shall call a positive integer $S$ a Strong Achilles number if both $S$ and $φ(S)$ are Achilles numbers. $φ$ denotes Euler's totient function.
 
-There are 7 Strong Achilles numbers below 104 and 656 below 108.
+For example, 864 is a Strong Achilles number: $φ(864) = 288 = 2^5 \times 3^2$. However, 1800 isn't a Strong Achilles number because: $φ(1800) = 480 = 2^5 \times 3^1 \times 5^1$.
 
-How many Strong Achilles numbers are there below 1018?
+There are 7 Strong Achilles numbers below ${10}^4$ and 656 below ${10}^8$.
 
-1 φ denotes Euler's totient function.
+How many Strong Achilles numbers are there below ${10}^{18}$?
 
 # --hints--
 
-`euler302()` should return 1170060.
+`strongAchillesNumbers()` should return `1170060`.
 
 ```js
-assert.strictEqual(euler302(), 1170060);
+assert.strictEqual(strongAchillesNumbers(), 1170060);
 ```
 
 # --seed--
@@ -35,12 +35,12 @@ assert.strictEqual(euler302(), 1170060);
 ## --seed-contents--
 
 ```js
-function euler302() {
+function strongAchillesNumbers() {
 
   return true;
 }
 
-euler302();
+strongAchillesNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.md
index 1f9b36fad0d..108d8bd39fc 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f49b1000cf542c50ffae
 title: 'Problem 303: Multiples with small digits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301957
 dashedName: problem-303-multiples-with-small-digits
 ---
 
 # --description--
 
-For a positive integer n, define f(n) as the least positive multiple of n that, written in base 10, uses only digits ≤ 2.
+For a positive integer $n$, define $f(n)$ as the least positive multiple of $n$ that, written in base 10, uses only digits $≤ 2$.
 
-Thus f(2)=2, f(3)=12, f(7)=21, f(42)=210, f(89)=1121222.
+Thus $f(2) = 2$, $f(3) = 12$, $f(7) = 21$, $f(42) = 210$, $f(89) = 1\\,121\\,222$.
 
-Also, .
+Also, $\displaystyle\sum_{n = 1}^{100} \frac{f(n)}{n} = 11\\,363\\,107$.
 
-Find .
+Find $\displaystyle\sum_{n = 1}^{10\\,000} \frac{f(n)}{n}$.
 
 # --hints--
 
-`euler303()` should return 1111981904675169.
+`multiplesWithSmallDigits()` should return `1111981904675169`.
 
 ```js
-assert.strictEqual(euler303(), 1111981904675169);
+assert.strictEqual(multiplesWithSmallDigits(), 1111981904675169);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler303(), 1111981904675169);
 ## --seed-contents--
 
 ```js
-function euler303() {
+function multiplesWithSmallDigits() {
 
   return true;
 }
 
-euler303();
+multiplesWithSmallDigits();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-304-primonacci.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-304-primonacci.md
index aab56db5538..a4939940a8f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-304-primonacci.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-304-primonacci.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f49d1000cf542c50ffaf
 title: 'Problem 304: Primonacci'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301958
 dashedName: problem-304-primonacci
 ---
 
 # --description--
 
-For any positive integer n the function next_prime(n) returns the smallest prime p such that p>n.
+For any positive integer $n$ the function $\text{next_prime}(n)$ returns the smallest prime $p$ such that $p > n$.
 
-The sequence a(n) is defined by: a(1)=next_prime(1014) and a(n)=next_prime(a(n-1)) for n>1.
+The sequence $a(n)$ is defined by: $a(1) = \text{next_prime}({10}^{14})$ and $a(n) = \text{next_prime}(a(n - 1))$ for $n > 1$.
 
-The fibonacci sequence f(n) is defined by: f(0)=0, f(1)=1 and f(n)=f(n-1)+f(n-2) for n>1.
+The fibonacci sequence $f(n)$ is defined by: $f(0) = 0$, $f(1) = 1$ and $f(n) = f(n - 1) + f(n - 2)$ for $n > 1$.
 
-The sequence b(n) is defined as f(a(n)).
+The sequence $b(n)$ is defined as $f(a(n))$.
 
-Find ∑b(n) for 1≤n≤100 000. Give your answer mod 1234567891011.
+Find $\sum b(n)$ for $1≤n≤100\\,000$. Give your answer $\bmod 1\\,234\\,567\\,891\\,011$.
 
 # --hints--
 
-`euler304()` should return 283988410192.
+`primonacci()` should return `283988410192`.
 
 ```js
-assert.strictEqual(euler304(), 283988410192);
+assert.strictEqual(primonacci(), 283988410192);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler304(), 283988410192);
 ## --seed-contents--
 
 ```js
-function euler304() {
+function primonacci() {
 
   return true;
 }
 
-euler304();
+primonacci();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-305-reflexive-position.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-305-reflexive-position.md
index c42f1440383..566e7b7b76c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-305-reflexive-position.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-305-reflexive-position.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f49d1000cf542c50ffb0
 title: 'Problem 305: Reflexive Position'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301959
 dashedName: problem-305-reflexive-position
 ---
 
 # --description--
 
-Let's call S the (infinite) string that is made by concatenating the consecutive positive integers (starting from 1) written down in base 10.
+Let's call $S$ the (infinite) string that is made by concatenating the consecutive positive integers (starting from 1) written down in base 10.
 
-Thus, S = 1234567891011121314151617181920212223242...
+Thus, $S = 1234567891011121314151617181920212223242\ldots$
 
-It's easy to see that any number will show up an infinite number of times in S.
+It's easy to see that any number will show up an infinite number of times in $S$.
 
-Let's call f(n) the starting position of the nth occurrence of n in S. For example, f(1)=1, f(5)=81, f(12)=271 and f(7780)=111111365.
+Let's call $f(n)$ the starting position of the $n^{\text{th}}$ occurrence of $n$ in $S$. For example, $f(1) = 1$, $f(5) = 81$, $f(12) = 271$ and $f(7780) = 111\\,111\\,365$.
 
-Find ∑f(3k) for 1≤k≤13.
+Find $\sum f(3^k) for 1 ≤ k ≤ 13$.
 
 # --hints--
 
-`euler305()` should return 18174995535140.
+`reflexivePosition()` should return `18174995535140`.
 
 ```js
-assert.strictEqual(euler305(), 18174995535140);
+assert.strictEqual(reflexivePosition(), 18174995535140);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler305(), 18174995535140);
 ## --seed-contents--
 
 ```js
-function euler305() {
+function reflexivePosition() {
 
   return true;
 }
 
-euler305();
+reflexivePosition();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md
index d750803f3b2..3dd4604bc13 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f49f1000cf542c50ffb1
 title: 'Problem 306: Paper-strip Game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301960
 dashedName: problem-306-paper-strip-game
 ---
@@ -10,20 +10,28 @@ dashedName: problem-306-paper-strip-game
 
 The following game is a classic example of Combinatorial Game Theory:
 
-Two players start with a strip of n white squares and they take alternate turns. On each turn, a player picks two contiguous white squares and paints them black. The first player who cannot make a move loses.
+Two players start with a strip of $n$ white squares and they take alternate turns. On each turn, a player picks two contiguous white squares and paints them black. The first player who cannot make a move loses.
 
-If n = 1, there are no valid moves, so the first player loses automatically. If n = 2, there is only one valid move, after which the second player loses. If n = 3, there are two valid moves, but both leave a situation where the second player loses. If n = 4, there are three valid moves for the first player; she can win the game by painting the two middle squares. If n = 5, there are four valid moves for the first player (shown below in red); but no matter what she does, the second player (blue) wins.
+- $n = 1$: No valid moves, so the first player loses automatically.
+- $n = 2$: Only one valid move, after which the second player loses.
+- $n = 3$: Two valid moves, but both leave a situation where the second player loses.
+- $n = 4$: There are three valid moves for the first player; who is able to win the game by painting the two middle squares.
+- $n = 5$: Four valid moves for the first player (shown below in red); but no matter what the player does, the second player (blue) wins.
 
-So, for 1 ≤ n ≤ 5, there are 3 values of n for which the first player can force a win. Similarly, for 1 ≤ n ≤ 50, there are 40 values of n for which the first player can force a win.
+<img class="img-responsive center-block" alt="valid starting moves for strip with 5 squares" src="https://cdn.freecodecamp.org/curriculum/project-euler/paper-strip-game.gif" style="background-color: white; padding: 10px;" />
 
-For 1 ≤ n ≤ 1 000 000, how many values of n are there for which the first player can force a win?
+So, for $1 ≤ n ≤ 5$, there are 3 values of $n$ for which the first player can force a win.
+
+Similarly, for $1 ≤ n ≤ 50$, there are 40 values of $n$ for which the first player can force a win.
+
+For $1 ≤ n ≤ 1\\,000\\,000$, how many values of $n$ are there for which the first player can force a win?
 
 # --hints--
 
-`euler306()` should return 852938.
+`paperStripGame()` should return `852938`.
 
 ```js
-assert.strictEqual(euler306(), 852938);
+assert.strictEqual(paperStripGame(), 852938);
 ```
 
 # --seed--
@@ -31,12 +39,12 @@ assert.strictEqual(euler306(), 852938);
 ## --seed-contents--
 
 ```js
-function euler306() {
+function paperStripGame() {
 
   return true;
 }
 
-euler306();
+paperStripGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-307-chip-defects.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-307-chip-defects.md
index eac5e7e113d..f9236b3bf23 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-307-chip-defects.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-307-chip-defects.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4a01000cf542c50ffb2
-title: 'Problem 307: Chip Defects'
-challengeType: 5
+title: 'Problema 307: Defectos De Chip'
+challengeType: 1
 forumTopicId: 301961
 dashedName: problem-307-chip-defects
 ---
 
 # --description--
 
-k defects are randomly distributed amongst n integrated-circuit chips produced by a factory (any number of defects may be found on a chip and each defect is independent of the other defects).
+$k$ defects are randomly distributed amongst $n$ integrated-circuit chips produced by a factory (any number of defects may be found on a chip and each defect is independent of the other defects).
 
-Let p(k,n) represent the probability that there is a chip with at least 3 defects. For instance p(3,7) ≈ 0.0204081633.
+Let $p(k,n)$ represent the probability that there is a chip with at least 3 defects. For instance $p(3,7) ≈ 0.0204081633$.
 
-Find p(20 000, 1 000 000) and give your answer rounded to 10 decimal places in the form 0.abcdefghij
+Find $p(20\\,000, 1\\,000\\,000)$ and give your answer rounded to 10 decimal places in the form 0.abcdefghij
 
 # --hints--
 
-`euler307()` should return 0.7311720251.
+`chipDefects()` should return `0.7311720251`.
 
 ```js
-assert.strictEqual(euler307(), 0.7311720251);
+assert.strictEqual(chipDefects(), 0.7311720251);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler307(), 0.7311720251);
 ## --seed-contents--
 
 ```js
-function euler307() {
+function chipDefects() {
 
   return true;
 }
 
-euler307();
+chipDefects();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.md
index a0cfc2d8a96..22f3cabc900 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4a11000cf542c50ffb3
 title: 'Problem 308: An amazing Prime-generating Automaton'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301962
 dashedName: problem-308-an-amazing-prime-generating-automaton
 ---
@@ -12,18 +12,26 @@ A program written in the programming language Fractran consists of a list of fra
 
 The internal state of the Fractran Virtual Machine is a positive integer, which is initially set to a seed value. Each iteration of a Fractran program multiplies the state integer by the first fraction in the list which will leave it an integer.
 
-For example, one of the Fractran programs that John Horton Conway wrote for prime-generation consists of the following 14 fractions:1791 , 7885 , 1951 , 2338 , 2933 , 7729 , 9523 , 7719 , 117 , 1113 , 1311 , 152 , 17 , 551 . Starting with the seed integer 2, successive iterations of the program produce the sequence: 15, 825, 725, 1925, 2275, 425, ..., 68, 4, 30, ..., 136, 8, 60, ..., 544, 32, 240, ...
+For example, one of the Fractran programs that John Horton Conway wrote for prime-generation consists of the following 14 fractions:
 
-The powers of 2 that appear in this sequence are 22, 23, 25, ... It can be shown that all the powers of 2 in this sequence have prime exponents and that all the primes appear as exponents of powers of 2, in proper order!
+$$\frac{17}{91}, \frac{78}{85}, \frac{19}{51}, \frac{23}{38}, \frac{29}{33}, \frac{77}{29}, \frac{95}{23}, \frac{77}{19}, \frac{1}{17}, \frac{11}{13}, \frac{13}{11}, \frac{15}{2}, \frac{1}{7}, \frac{55}{1}$$
 
-If someone uses the above Fractran program to solve Project Euler Problem 7 (find the 10001st prime), how many iterations would be needed until the program produces 210001st prime ?
+Starting with the seed integer 2, successive iterations of the program produce the sequence:
+
+$$15, 825, 725, 1925, 2275, 425, \ldots, 68, \mathbf{4}, 30, \ldots, 136, \mathbf{8}, 60, \ldots, 544, \mathbf{32}, 240, \ldots$$
+
+The powers of 2 that appear in this sequence are $2^2, 2^3, 2^5, \ldots$.
+
+It can be shown that all the powers of 2 in this sequence have prime exponents and that all the primes appear as exponents of powers of 2, in proper order!
+
+If someone uses the above Fractran program to solve Project Euler Problem 7 (find the ${10001}^{\text{st}}$ prime), how many iterations would be needed until the program produces $2^{10001^{\text{st}}\text{ prime}}$?
 
 # --hints--
 
-`euler308()` should return 1539669807660924.
+`primeGeneratingAutomation()` should return `1539669807660924`.
 
 ```js
-assert.strictEqual(euler308(), 1539669807660924);
+assert.strictEqual(primeGeneratingAutomation(), 1539669807660924);
 ```
 
 # --seed--
@@ -31,12 +39,12 @@ assert.strictEqual(euler308(), 1539669807660924);
 ## --seed-contents--
 
 ```js
-function euler308() {
+function primeGeneratingAutomation() {
 
   return true;
 }
 
-euler308();
+primeGeneratingAutomation();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md
index 03d5603c1f9..721b756f533 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f4a11000cf542c50ffb4
 title: 'Problem 309: Integer Ladders'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301963
 dashedName: problem-309-integer-ladders
 ---
 
 # --description--
 
-In the classic "Crossing Ladders" problem, we are given the lengths x and y of two ladders resting on the opposite walls of a narrow, level street. We are also given the height h above the street where the two ladders cross and we are asked to find the width of the street (w).
+In the classic "Crossing Ladders" problem, we are given the lengths $x$ and $y$ of two ladders resting on the opposite walls of a narrow, level street. We are also given the height $h$ above the street where the two ladders cross and we are asked to find the width of the street ($w$).
 
-Here, we are only concerned with instances where all four variables are positive integers. For example, if x = 70, y = 119 and h = 30, we can calculate that w = 56.
+<img class="img-responsive center-block" alt="ladders x and y, crossing at the height h, and resting on opposite walls of the street of width w" src="https://cdn.freecodecamp.org/curriculum/project-euler/integer-ladders.gif" style="background-color: white; padding: 10px;" />
 
-In fact, for integer values x, y, h and 0 &lt; x &lt; y &lt; 200, there are only five triplets (x,y,h) producing integer solutions for w: (70, 119, 30), (74, 182, 21), (87, 105, 35), (100, 116, 35) and (119, 175, 40).
+Here, we are only concerned with instances where all four variables are positive integers. For example, if $x = 70$, $y = 119$ and $h = 30$, we can calculate that $w = 56$.
 
-For integer values x, y, h and 0 &lt; x &lt; y &lt; 1 000 000, how many triplets (x,y,h) produce integer solutions for w?
+In fact, for integer values $x$, $y$, $h$ and $0 &lt; x &lt; y &lt; 200$, there are only five triplets ($x$, $y$, $h$) producing integer solutions for $w$: (70, 119, 30), (74, 182, 21), (87, 105, 35), (100, 116, 35) and (119, 175, 40).
+
+For integer values $x$, $y$, $h$ and $0 &lt; x &lt; y &lt; 1\\,000\\,000$, how many triplets ($x$, $y$, $h$) produce integer solutions for $w$?
 
 # --hints--
 
-`euler309()` should return 210139.
+`integerLadders()` should return `210139`.
 
 ```js
-assert.strictEqual(euler309(), 210139);
+assert.strictEqual(integerLadders(), 210139);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler309(), 210139);
 ## --seed-contents--
 
 ```js
-function euler309() {
+function integerLadders() {
 
   return true;
 }
 
-euler309();
+integerLadders();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-31-coin-sums.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-31-coin-sums.md
index 0826a685f4c..ae4372cd69f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-31-coin-sums.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-31-coin-sums.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f38b1000cf542c50fe9e
 title: 'Problem 31: Coin sums'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301965
 dashedName: problem-31-coin-sums
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-310-nim-square.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-310-nim-square.md
index c93f2fd5315..4eacb352843 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-310-nim-square.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-310-nim-square.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4a21000cf542c50ffb5
 title: 'Problem 310: Nim Square'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301966
 dashedName: problem-310-nim-square
 ---
@@ -12,18 +12,18 @@ Alice and Bob play the game Nim Square.
 
 Nim Square is just like ordinary three-heap normal play Nim, but the players may only remove a square number of stones from a heap.
 
-The number of stones in the three heaps is represented by the ordered triple (a,b,c).
+The number of stones in the three heaps is represented by the ordered triple ($a$, $b$, $c$).
 
-If 0≤a≤b≤c≤29 then the number of losing positions for the next player is 1160.
+If $0 ≤ a ≤ b ≤ c ≤ 29$ then the number of losing positions for the next player is 1160.
 
-Find the number of losing positions for the next player if 0≤a≤b≤c≤100 000.
+Find the number of losing positions for the next player if $0 ≤ a ≤ b ≤ c ≤ 100\\,000$.
 
 # --hints--
 
-`euler310()` should return 2586528661783.
+`nimSquare()` should return `2586528661783`.
 
 ```js
-assert.strictEqual(euler310(), 2586528661783);
+assert.strictEqual(nimSquare(), 2586528661783);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler310(), 2586528661783);
 ## --seed-contents--
 
 ```js
-function euler310() {
+function nimSquare() {
 
   return true;
 }
 
-euler310();
+nimSquare();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md
index b5aee9d2b54..97736d98034 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f4a31000cf542c50ffb6
 title: 'Problem 311: Biclinic Integral Quadrilaterals'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301967
 dashedName: problem-311-biclinic-integral-quadrilaterals
 ---
 
 # --description--
 
-ABCD is a convex, integer sided quadrilateral with 1 ≤ AB &lt; BC &lt; CD &lt; AD.
+$ABCD$ is a convex, integer sided quadrilateral with $1 ≤ AB &lt; BC &lt; CD &lt; AD$.
 
-BD has integer length. O is the midpoint of BD. AO has integer length.
+$BD$ has integer length. $O$ is the midpoint of $BD$. $AO$ has integer length.
 
-We'll call ABCD a biclinic integral quadrilateral if AO = CO ≤ BO = DO.
+We'll call $ABCD$ a biclinic integral quadrilateral if $AO = CO ≤ BO = DO$.
 
-For example, the following quadrilateral is a biclinic integral quadrilateral: AB = 19, BC = 29, CD = 37, AD = 43, BD = 48 and AO = CO = 23.
+For example, the following quadrilateral is a biclinic integral quadrilateral: $AB = 19$, $BC = 29$, $CD = 37$, $AD = 43$, $BD = 48$ and $AO = CO = 23$.
 
-Let B(N) be the number of distinct biclinic integral quadrilaterals ABCD that satisfy AB2+BC2+CD2+AD2 ≤ N. We can verify that B(10 000) = 49 and B(1 000 000) = 38239.
+<img class="img-responsive center-block" alt="quadrilateral ABCD, with point O, an midpoint of BD" src="https://cdn.freecodecamp.org/curriculum/project-euler/biclinic-integral-quadrilaterals.gif" style="background-color: white; padding: 10px;" />
 
-Find B(10 000 000 000).
+Let $B(N)$ be the number of distinct biclinic integral quadrilaterals $ABCD$ that satisfy ${AB}^2 + {BC}^2 + {CD}^2 + {AD}^2 ≤ N$. We can verify that $B(10\\,000) = 49$ and $B(1\\,000\\,000) = 38239$.
+
+Find $B(10\\,000\\,000\\,000)$.
 
 # --hints--
 
-`euler311()` should return 2466018557.
+`biclinicIntegralQuadrilaterals()` should return `2466018557`.
 
 ```js
-assert.strictEqual(euler311(), 2466018557);
+assert.strictEqual(biclinicIntegralQuadrilaterals(), 2466018557);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler311(), 2466018557);
 ## --seed-contents--
 
 ```js
-function euler311() {
+function biclinicIntegralQuadrilaterals() {
 
   return true;
 }
 
-euler311();
+biclinicIntegralQuadrilaterals();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md
index b9083a73f0b..122f28f97dc 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md
@@ -1,29 +1,36 @@
 ---
 id: 5900f4a51000cf542c50ffb7
 title: 'Problem 312: Cyclic paths on Sierpiński graphs'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301968
 dashedName: problem-312-cyclic-paths-on-sierpiski-graphs
 ---
 
 # --description--
 
-\- A Sierpiński graph of order-1 (S1) is an equilateral triangle.
+- A Sierpiński graph of order-1 ($S_1$) is an equilateral triangle.
+- $S_{n + 1}$ is obtained from $S_n$ by positioning three copies of $S_n$ so that every pair of copies has one common corner.
 
-\- Sn+1 is obtained from Sn by positioning three copies of Sn so that every pair of copies has one common corner.
+<img class="img-responsive center-block" alt="Sierpinski graphs of order-1 to order-5" src="https://cdn.freecodecamp.org/curriculum/project-euler/cyclic-paths-on-sierpinski-graphs-1.gif" style="background-color: white; padding: 10px;" />
 
-Let C(n) be the number of cycles that pass exactly once through all the vertices of Sn. For example, C(3) = 8 because eight such cycles can be drawn on S3, as shown below:
+Let $C(n)$ be the number of cycles that pass exactly once through all the vertices of $S_n$. For example, $C(3) = 8$ because eight such cycles can be drawn on $S_3$, as shown below:
 
-It can also be verified that : C(1) = C(2) = 1 C(5) = 71328803586048 C(10 000) mod 108 = 37652224 C(10 000) mod 138 = 617720485
+<img class="img-responsive center-block" alt="eight cycles that pass exactly once through all vertices of S_3" src="https://cdn.freecodecamp.org/curriculum/project-euler/cyclic-paths-on-sierpinski-graphs-2.gif" style="background-color: white; padding: 10px;" />
 
-Find C(C(C(10 000))) mod 138.
+It can also be verified that:
+
+$$\begin{align}   & C(1) = C(2) = 1 \\\\
+  & C(5) = 71\\,328\\,803\\,586\\,048 \\\\   & C(10 000)\bmod {10}^8 = 37\\,652\\,224 \\\\
+  & C(10 000)\bmod {13}^8 = 617\\,720\\,485 \\\\ \end{align}$$
+
+Find $C(C(C(10\\,000)))\bmod {13}^8$.
 
 # --hints--
 
-`euler312()` should return 324681947.
+`pathsOnSierpinskiGraphs()` should return `324681947`.
 
 ```js
-assert.strictEqual(euler312(), 324681947);
+assert.strictEqual(pathsOnSierpinskiGraphs(), 324681947);
 ```
 
 # --seed--
@@ -31,12 +38,12 @@ assert.strictEqual(euler312(), 324681947);
 ## --seed-contents--
 
 ```js
-function euler312() {
+function pathsOnSierpinskiGraphs() {
 
   return true;
 }
 
-euler312();
+pathsOnSierpinskiGraphs();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-313-sliding-game.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-313-sliding-game.md
index dd6ec7cfb3a..8f5726b71f4 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-313-sliding-game.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-313-sliding-game.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4a61000cf542c50ffb8
 title: 'Problem 313: Sliding game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301969
 dashedName: problem-313-sliding-game
 ---
@@ -10,18 +10,22 @@ dashedName: problem-313-sliding-game
 
 In a sliding game a counter may slide horizontally or vertically into an empty space. The objective of the game is to move the red counter from the top left corner of a grid to the bottom right corner; the space always starts in the bottom right corner. For example, the following sequence of pictures show how the game can be completed in five moves on a 2 by 2 grid.
 
-Let S(m,n) represent the minimum number of moves to complete the game on an m by n grid. For example, it can be verified that S(5,4) = 25.
+<img class="img-responsive center-block" alt="completing game in five moves on grid 2x2" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliding-game-1.gif" style="background-color: white; padding: 10px;" />
 
-There are exactly 5482 grids for which S(m,n) = p2, where p &lt; 100 is prime.
+Let $S(m, n)$ represent the minimum number of moves to complete the game on an $m$ by $n$ grid. For example, it can be verified that $S(5, 4) = 25$.
 
-How many grids does S(m,n) = p2, where p &lt; 106 is prime?
+<img class="img-responsive center-block" alt="initial grid state and final grid state for game on grid 5x4" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliding-game-2.gif" style="background-color: white; padding: 10px;" />
+
+There are exactly 5482 grids for which $S(m, n) = p^2$, where $p &lt; 100$ is prime.
+
+How many grids does $S(m, n) = p^2$, where $p &lt; {10}^6$ is prime?
 
 # --hints--
 
-`euler313()` should return 2057774861813004.
+`slidingGame()` should return `2057774861813004`.
 
 ```js
-assert.strictEqual(euler313(), 2057774861813004);
+assert.strictEqual(slidingGame(), 2057774861813004);
 ```
 
 # --seed--
@@ -29,12 +33,12 @@ assert.strictEqual(euler313(), 2057774861813004);
 ## --seed-contents--
 
 ```js
-function euler313() {
+function slidingGame() {
 
   return true;
 }
 
-euler313();
+slidingGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md
index 78cd0f1cf65..0bb0e4f9ab9 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4a71000cf542c50ffb9
 title: 'Problem 314: The Mouse on the Moon'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301970
 dashedName: problem-314-the-mouse-on-the-moon
 ---
@@ -10,20 +10,24 @@ dashedName: problem-314-the-mouse-on-the-moon
 
 The moon has been opened up, and land can be obtained for free, but there is a catch. You have to build a wall around the land that you stake out, and building a wall on the moon is expensive. Every country has been allotted a 500 m by 500 m square area, but they will possess only that area which they wall in. 251001 posts have been placed in a rectangular grid with 1 meter spacing. The wall must be a closed series of straight lines, each line running from post to post.
 
-The bigger countries of course have built a 2000 m wall enclosing the entire 250 000 m2 area. The Duchy of Grand Fenwick, has a tighter budget, and has asked you (their Royal Programmer) to compute what shape would get best maximum enclosed-area/wall-length ratio.
+The bigger countries of course have built a 2000 m wall enclosing the entire 250 000 $\text{m}^2$ area. The Duchy of Grand Fenwick, has a tighter budget, and has asked you (their Royal Programmer) to compute what shape would get best maximum $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio.
 
-You have done some preliminary calculations on a sheet of paper. For a 2000 meter wall enclosing the 250 000 m2 area the enclosed-area/wall-length ratio is 125. Although not allowed , but to get an idea if this is anything better: if you place a circle inside the square area touching the four sides the area will be equal to π*2502 m2 and the perimeter will be π*500 m, so the enclosed-area/wall-length ratio will also be 125.
+You have done some preliminary calculations on a sheet of paper. For a 2000 meter wall enclosing the 250 000 $\text{m}^2$ area the $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio is 125.
 
-However, if you cut off from the square four triangles with sides 75 m, 75 m and 75√2 m the total area becomes 238750 m2 and the perimeter becomes 1400+300√2 m. So this gives an enclosed-area/wall-length ratio of 130.87, which is significantly better.
+Although not allowed, but to get an idea if this is anything better: if you place a circle inside the square area touching the four sides the area will be equal to $π \times {250}^2 \text{m}^2$ and the perimeter will be $π \times 500 \text{m}$, so the $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio will also be 125.
 
-Find the maximum enclosed-area/wall-length ratio. Give your answer rounded to 8 places behind the decimal point in the form abc.defghijk.
+However, if you cut off from the square four triangles with sides 75 m, 75 m and $75\sqrt{2}$ m the total area becomes 238750 $\text{m}^2$ and the perimeter becomes $1400 + 300\sqrt{2}$ m. So this gives an $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio of 130.87, which is significantly better.
+
+<img class="img-responsive center-block" alt="picture showing difference in encosed-area between circle and square with cut off four triangles" src="https://cdn.freecodecamp.org/curriculum/project-euler/the-mouse-on-the-moon.gif" style="background-color: white; padding: 10px;" />
+
+Find the maximum $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio. Give your answer rounded to 8 places behind the decimal point in the form abc.defghijk.
 
 # --hints--
 
-`euler314()` should return 132.52756426.
+`theMouseOnTheMoon()` should return `132.52756426`.
 
 ```js
-assert.strictEqual(euler314(), 132.52756426);
+assert.strictEqual(theMouseOnTheMoon(), 132.52756426);
 ```
 
 # --seed--
@@ -31,12 +35,12 @@ assert.strictEqual(euler314(), 132.52756426);
 ## --seed-contents--
 
 ```js
-function euler314() {
+function theMouseOnTheMoon() {
 
   return true;
 }
 
-euler314();
+theMouseOnTheMoon();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md
index 38a2a69cca1..59389d4a7ff 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md
@@ -1,41 +1,55 @@
 ---
 id: 5900f4a71000cf542c50ffba
 title: 'Problem 315: Digital root clocks'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301971
 dashedName: problem-315-digital-root-clocks
 ---
 
 # --description--
 
+<img class="img-responsive center-block" alt="animation of Sam's and Max's clocks calculating digital roots starting from 137" src="https://cdn.freecodecamp.org/curriculum/project-euler/digital-root-clocks.gif" style="background-color: white; padding: 10px;" />
+
 Sam and Max are asked to transform two digital clocks into two "digital root" clocks.
 
 A digital root clock is a digital clock that calculates digital roots step by step.
 
-When a clock is fed a number, it will show it and then it will start the calculation, showing all the intermediate values until it gets to the result. For example, if the clock is fed the number 137, it will show: "137" → "11" → "2" and then it will go black, waiting for the next number.
+When a clock is fed a number, it will show it and then it will start the calculation, showing all the intermediate values until it gets to the result. For example, if the clock is fed the number 137, it will show: `137` → `11` → `2` and then it will go black, waiting for the next number.
 
-Every digital number consists of some light segments: three horizontal (top, middle, bottom) and four vertical (top-left, top-right, bottom-left, bottom-right). Number "1" is made of vertical top-right and bottom-right, number "4" is made by middle horizontal and vertical top-left, top-right and bottom-right. Number "8" lights them all.
+Every digital number consists of some light segments: three horizontal (top, middle, bottom) and four vertical (top-left, top-right, bottom-left, bottom-right). Number `1` is made of vertical top-right and bottom-right, number `4` is made by middle horizontal and vertical top-left, top-right and bottom-right. Number `8` lights them all.
 
-The clocks consume energy only when segments are turned on/off. To turn on a "2" will cost 5 transitions, while a "7" will cost only 4 transitions.
+The clocks consume energy only when segments are turned on/off. To turn on a `2` will cost 5 transitions, while a `7` will cost only 4 transitions.
 
 Sam and Max built two different clocks.
 
-Sam's clock is fed e.g. number 137: the clock shows "137", then the panel is turned off, then the next number ("11") is turned on, then the panel is turned off again and finally the last number ("2") is turned on and, after some time, off. For the example, with number 137, Sam's clock requires:"137" : (2 + 5 + 4) × 2 = 22 transitions ("137" on/off). "11" : (2 + 2) × 2 = 8 transitions ("11" on/off). "2" : (5) × 2 = 10 transitions ("2" on/off).
+Sam's clock is fed e.g. number 137: the clock shows `137`, then the panel is turned off, then the next number (`11`) is turned on, then the panel is turned off again and finally the last number (`2`) is turned on and, after some time, off.
+
+For the example, with number 137, Sam's clock requires:
+
+- `137`: $(2 + 5 + 4) × 2 = 22$ transitions (`137` on/off).
+- `11`: $(2 + 2) × 2 = 8$ transitions (`11` on/off).
+- `2`: $(5) × 2 = 10$ transitions (`2` on/off).
 
 For a grand total of 40 transitions.
 
-Max's clock works differently. Instead of turning off the whole panel, it is smart enough to turn off only those segments that won't be needed for the next number. For number 137, Max's clock requires:"137" : 2 + 5 + 4 = 11 transitions ("137" on) 7 transitions (to turn off the segments that are not needed for number "11"). "11" : 0 transitions (number "11" is already turned on correctly) 3 transitions (to turn off the first "1" and the bottom part of the second "1"; the top part is common with number "2"). "2" : 4 transitions (to turn on the remaining segments in order to get a "2") 5 transitions (to turn off number "2").
+Max's clock works differently. Instead of turning off the whole panel, it is smart enough to turn off only those segments that won't be needed for the next number.
+
+For number 137, Max's clock requires:
+
+- `137` : $2 + 5 + 4 = 11$ transitions (`137` on), $7$ transitions (to turn off the segments that are not needed for number `11`).
+- `11` : $0$ transitions (number `11` is already turned on correctly), $3$ transitions (to turn off the first `1` and the bottom part of the second `1`; the top part is common with number `2`).
+- `2` : $4$ transitions (to turn on the remaining segments in order to get a `2`), $5$ transitions (to turn off number `2`).
 
 For a grand total of 30 transitions.
 
-Of course, Max's clock consumes less power than Sam's one. The two clocks are fed all the prime numbers between A = 107 and B = 2×107. Find the difference between the total number of transitions needed by Sam's clock and that needed by Max's one.
+Of course, Max's clock consumes less power than Sam's one. The two clocks are fed all the prime numbers between $A = {10}^7$ and $B = 2 × {10}^7$. Find the difference between the total number of transitions needed by Sam's clock and that needed by Max's one.
 
 # --hints--
 
-`euler315()` should return 13625242.
+`digitalRootClocks()` should return `13625242`.
 
 ```js
-assert.strictEqual(euler315(), 13625242);
+assert.strictEqual(digitalRootClocks(), 13625242);
 ```
 
 # --seed--
@@ -43,12 +57,12 @@ assert.strictEqual(euler315(), 13625242);
 ## --seed-contents--
 
 ```js
-function euler315() {
+function digitalRootClocks() {
 
   return true;
 }
 
-euler315();
+digitalRootClocks();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.md
index 4a2821b24e7..991df99ffa1 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.md
@@ -1,33 +1,41 @@
 ---
 id: 5900f4a81000cf542c50ffbb
 title: 'Problem 316: Numbers in decimal expansions'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301972
 dashedName: problem-316-numbers-in-decimal-expansions
 ---
 
 # --description--
 
-Let p = p1 p2 p3 ... be an infinite sequence of random digits, selected from {0,1,2,3,4,5,6,7,8,9} with equal probability.
+Let $p = p_1 p_2 p_3 \ldots$ be an infinite sequence of random digits, selected from {0,1,2,3,4,5,6,7,8,9} with equal probability.
 
-It can be seen that p corresponds to the real number 0.p1 p2 p3 ....
+It can be seen that $p$ corresponds to the real number $0.p_1 p_2 p_3 \ldots$.
 
-It can also be seen that choosing a random real number from the interval \[0,1) is equivalent to choosing an infinite sequence of random digits selected from {0,1,2,3,4,5,6,7,8,9} with equal probability.
+It can also be seen that choosing a random real number from the interval [0,1) is equivalent to choosing an infinite sequence of random digits selected from {0,1,2,3,4,5,6,7,8,9} with equal probability.
 
-For any positive integer n with d decimal digits, let k be the smallest index such that pk, pk+1, ...pk+d-1 are the decimal digits of n, in the same order. Also, let g(n) be the expected value of k; it can be proven that g(n) is always finite and, interestingly, always an integer number.
+For any positive integer $n$ with $d$ decimal digits, let $k$ be the smallest index such that $p_k, p_{k + 1}, \ldots p_{k + d - 1}$ are the decimal digits of $n$, in the same order.
 
-For example, if n = 535, then for p = 31415926535897...., we get k = 9 for p = 355287143650049560000490848764084685354..., we get k = 36 etc and we find that g(535) = 1008.
+Also, let $g(n)$ be the expected value of $k$; it can be proven that $g(n)$ is always finite and, interestingly, always an integer number.
 
-Given that , find
+For example, if $n = 535$, then
 
-Note: represents the floor function.
+for $p = 31415926\mathbf{535}897\ldots$, we get $k = 9$
+
+for $p = 35528714365004956000049084876408468\mathbf{535}4\ldots$, we get $k = 36$
+
+etc and we find that $g(535) = 1008$.
+
+Given that $\displaystyle\sum_{n = 2}^{999} g\left(\left\lfloor\frac{{10}^6}{n}\right\rfloor\right) = 27280188$, find $\displaystyle\sum_{n = 2}^{999\\,999} g\left(\left\lfloor\frac{{10}^{16}}{n}\right\rfloor\right)$.
+
+**Note:** $\lfloor x\rfloor$ represents the floor function.
 
 # --hints--
 
-`euler316()` should return 542934735751917760.
+`numbersInDecimalExpansion()` should return `542934735751917760`.
 
 ```js
-assert.strictEqual(euler316(), 542934735751917760);
+assert.strictEqual(numbersInDecimalExpansion(), 542934735751917760);
 ```
 
 # --seed--
@@ -35,12 +43,12 @@ assert.strictEqual(euler316(), 542934735751917760);
 ## --seed-contents--
 
 ```js
-function euler316() {
+function numbersInDecimalExpansion() {
 
   return true;
 }
 
-euler316();
+numbersInDecimalExpansion();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-317-firecracker.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-317-firecracker.md
index bb528a225aa..f9715cfd8df 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-317-firecracker.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-317-firecracker.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4aa1000cf542c50ffbc
 title: 'Problem 317: Firecracker'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301973
 dashedName: problem-317-firecracker
 ---
 
 # --description--
 
-A firecracker explodes at a height of 100 m above level ground. It breaks into a large number of very small fragments, which move in every direction; all of them have the same initial velocity of 20 m/s.
+A firecracker explodes at a height of 100 m above level ground. It breaks into a large number of very small fragments, which move in every direction; all of them have the same initial velocity of 20 $\frac{\text{m}}{\text{s}}$.
 
-We assume that the fragments move without air resistance, in a uniform gravitational field with g=9.81 m/s2.
+We assume that the fragments move without air resistance, in a uniform gravitational field with $g=9.81 \frac{\text{m}}{\text{s}^2}$.
 
-Find the volume (in m3) of the region through which the fragments move before reaching the ground. Give your answer rounded to four decimal places.
+Find the volume (in $\text{m}^3$) of the region through which the fragments move before reaching the ground. Give your answer rounded to four decimal places.
 
 # --hints--
 
-`euler317()` should return 1856532.8455.
+`firecracker()` should return `1856532.8455`.
 
 ```js
-assert.strictEqual(euler317(), 1856532.8455);
+assert.strictEqual(firecracker(), 1856532.8455);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler317(), 1856532.8455);
 ## --seed-contents--
 
 ```js
-function euler317() {
+function firecracker() {
 
   return true;
 }
 
-euler317();
+firecracker();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-318-2011-nines.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-318-2011-nines.md
index 1e8e9b8821e..f4b4f8315b5 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-318-2011-nines.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-318-2011-nines.md
@@ -1,51 +1,39 @@
 ---
 id: 5900f4ab1000cf542c50ffbd
 title: 'Problem 318: 2011 nines'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301974
 dashedName: problem-318-2011-nines
 ---
 
 # --description--
 
-Consider the real number √2+√3.
+Consider the real number $\sqrt{2} + \sqrt{3}$.
 
-When we calculate the even powers of √2+√3
+When we calculate the even powers of $\sqrt{2} + \sqrt{3}$ we get:
 
-we get:
+$$\begin{align}   & {(\sqrt{2} + \sqrt{3})}^2 = 9.898979485566356\ldots \\\\
+  & {(\sqrt{2} + \sqrt{3})}^4 = 97.98979485566356\ldots \\\\   & {(\sqrt{2} + \sqrt{3})}^6 = 969.998969071069263\ldots \\\\
+  & {(\sqrt{2} + \sqrt{3})}^8 = 9601.99989585502907\ldots \\\\   & {(\sqrt{2} + \sqrt{3})}^{10} = 95049.999989479221\ldots \\\\
+  & {(\sqrt{2} + \sqrt{3})}^{12} = 940897.9999989371855\ldots \\\\   & {(\sqrt{2} + \sqrt{3})}^{14} = 9313929.99999989263\ldots \\\\
+  & {(\sqrt{2} + \sqrt{3})}^{16} = 92198401.99999998915\ldots \\\\ \end{align}$$
 
-(√2+√3)2 = 9.898979485566356...
+It looks like that the number of consecutive nines at the beginning of the fractional part of these powers is non-decreasing. In fact it can be proven that the fractional part of ${(\sqrt{2} + \sqrt{3})}^{2n}$ approaches 1 for large $n$.
 
-(√2+√3)4 = 97.98979485566356...
+Consider all real numbers of the form $\sqrt{p} + \sqrt{q}$ with $p$ and $q$ positive integers and $p &lt; q$, such that the fractional part of ${(\sqrt{p} + \sqrt{q})}^{2n}$ approaches 1 for large $n$.
 
-(√2+√3)6 = 969.998969071069263...
+Let $C(p,q,n)$ be the number of consecutive nines at the beginning of the fractional part of ${(\sqrt{p} + \sqrt{q})}^{2n}$.
 
-(√2+√3)8 = 9601.99989585502907...
+Let $N(p,q)$ be the minimal value of $n$ such that $C(p,q,n) ≥ 2011$.
 
-(√2+√3)10 = 95049.999989479221...
-
-(√2+√3)12 = 940897.9999989371855...
-
-(√2+√3)14 = 9313929.99999989263...
-
-(√2+√3)16 = 92198401.99999998915...
-
-It looks like that the number of consecutive nines at the beginning of the fractional part of these powers is non-decreasing. In fact it can be proven that the fractional part of (√2+√3)2n approaches 1 for large n.
-
-Consider all real numbers of the form √p+√q with p and q positive integers and p&lt;q, such that the fractional part of (√p+√q)2n approaches 1 for large n.
-
-Let C(p,q,n) be the number of consecutive nines at the beginning of the fractional part of (√p+√q)2n.
-
-Let N(p,q) be the minimal value of n such that C(p,q,n) ≥ 2011.
-
-Find ∑N(p,q) for p+q ≤ 2011.
+Find $\sum N(p,q)$ for $p + q ≤ 2011$.
 
 # --hints--
 
-`euler318()` should return 709313889.
+`twoThousandElevenNines()` should return `709313889`.
 
 ```js
-assert.strictEqual(euler318(), 709313889);
+assert.strictEqual(twoThousandElevenNines(), 709313889);
 ```
 
 # --seed--
@@ -53,12 +41,12 @@ assert.strictEqual(euler318(), 709313889);
 ## --seed-contents--
 
 ```js
-function euler318() {
+function twoThousandElevenNines() {
 
   return true;
 }
 
-euler318();
+twoThousandElevenNines();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-319-bounded-sequences.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-319-bounded-sequences.md
index 687eeb26cd2..36341fac54b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-319-bounded-sequences.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-319-bounded-sequences.md
@@ -1,33 +1,31 @@
 ---
 id: 5900f4ab1000cf542c50ffbe
 title: 'Problem 319: Bounded Sequences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301975
 dashedName: problem-319-bounded-sequences
 ---
 
 # --description--
 
-Let x1, x2,..., xn be a sequence of length n such that:
+Let $x_1, x_2, \ldots, x_n$ be a sequence of length $n$ such that:
 
-x1 = 2
-
-for all 1 &lt; i ≤ n : xi-1 &lt; xi
-
-for all i and j with 1 ≤ i, j ≤ n : (xi) j &lt; (xj + 1)i
+- $x_1 = 2$
+- for all $1 &lt; i ≤ n : x_{i - 1} &lt; x_i$
+- for all $i$ and $j$ with $1 ≤ i, j ≤ n : {(x_i)}^j &lt; {(x_j + 1)}^i$
 
 There are only five such sequences of length 2, namely: {2,4}, {2,5}, {2,6}, {2,7} and {2,8}. There are 293 such sequences of length 5; three examples are given below: {2,5,11,25,55}, {2,6,14,36,88}, {2,8,22,64,181}.
 
-Let t(n) denote the number of such sequences of length n. You are given that t(10) = 86195 and t(20) = 5227991891.
+Let $t(n)$ denote the number of such sequences of length $n$. You are given that $t(10) = 86195$ and $t(20) = 5227991891$.
 
-Find t(1010) and give your answer modulo 109.
+Find $t({10}^{10})$ and give your answer modulo $10^9$.
 
 # --hints--
 
-`euler319()` should return 268457129.
+`boundedSequences()` should return `268457129`.
 
 ```js
-assert.strictEqual(euler319(), 268457129);
+assert.strictEqual(boundedSequences(), 268457129);
 ```
 
 # --seed--
@@ -35,12 +33,12 @@ assert.strictEqual(euler319(), 268457129);
 ## --seed-contents--
 
 ```js
-function euler319() {
+function boundedSequences() {
 
   return true;
 }
 
-euler319();
+boundedSequences();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-32-pandigital-products.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-32-pandigital-products.md
index fe1724d44f7..5fe7d0495c5 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-32-pandigital-products.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-32-pandigital-products.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f38c1000cf542c50fe9f
 title: 'Problem 32: Pandigital products'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301976
 dashedName: problem-32-pandigital-products
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.md
index 5171172f984..b0f0cc5c6ae 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4ae1000cf542c50ffbf
 title: 'Problem 320: Factorials divisible by a huge integer'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301977
 dashedName: problem-320-factorials-divisible-by-a-huge-integer
 ---
 
 # --description--
 
-Let N(i) be the smallest integer n such that n! is divisible by (i!)1234567890
+Let $N(i)$ be the smallest integer $n$ such that $n!$ is divisible by $(i!)^{1234567890}$
 
-Let S(u)=∑N(i) for 10 ≤ i ≤ u.
+Let $S(u) = \sum N(i)$ for $10 ≤ i ≤ u$.
 
-S(1000)=614538266565663.
+$S(1000)=614\\,538\\,266\\,565\\,663$.
 
-Find S(1 000 000) mod 1018.
+Find $S(1\\,000\\,000)\bmod {10}^{18}$.
 
 # --hints--
 
-`euler320()` should return 278157919195482660.
+`divisibleByHugeInteger()` should return `278157919195482660`.
 
 ```js
-assert.strictEqual(euler320(), 278157919195482660);
+assert.strictEqual(divisibleByHugeInteger(), 278157919195482660);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler320(), 278157919195482660);
 ## --seed-contents--
 
 ```js
-function euler320() {
+function divisibleByHugeInteger() {
 
   return true;
 }
 
-euler320();
+divisibleByHugeInteger();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md
index 34e52a4dea9..177610fd3c7 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md
@@ -1,29 +1,35 @@
 ---
 id: 5900f4ae1000cf542c50ffc0
 title: 'Problem 321: Swapping Counters'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301978
 dashedName: problem-321-swapping-counters
 ---
 
 # --description--
 
-A horizontal row comprising of 2n + 1 squares has n red counters placed at one end and n blue counters at the other end, being separated by a single empty square in the centre. For example, when n = 3.
+A horizontal row comprising of $2n + 1$ squares has $n$ red counters placed at one end and $n$ blue counters at the other end, being separated by a single empty square in the center. For example, when $n = 3$.
+
+<img class="img-responsive center-block" alt="three squares with red and blue counters placed on opposite ends of the row, separated by one empty square" src="https://cdn.freecodecamp.org/curriculum/project-euler/swapping-counters-1.gif" style="background-color: white; padding: 10px;" />
 
 A counter can move from one square to the next (slide) or can jump over another counter (hop) as long as the square next to that counter is unoccupied.
 
-Let M(n) represent the minimum number of moves/actions to completely reverse the positions of the coloured counters; that is, move all the red counters to the right and all the blue counters to the left. It can be verified M(3) = 15, which also happens to be a triangle number.
+<img class="img-responsive center-block" alt="allowed moves of the counter" src="https://cdn.freecodecamp.org/curriculum/project-euler/swapping-counters-2.gif" style="background-color: white; padding: 10px;" />
 
-If we create a sequence based on the values of n for which M(n) is a triangle number then the first five terms would be: 1, 3, 10, 22, and 63, and their sum would be 99.
+Let $M(n)$ represent the minimum number of moves/actions to completely reverse the positions of the colored counters; that is, move all the red counters to the right and all the blue counters to the left.
+
+It can be verified $M(3) = 15$, which also happens to be a triangle number.
+
+If we create a sequence based on the values of n for which $M(n)$ is a triangle number then the first five terms would be: 1, 3, 10, 22, and 63, and their sum would be 99.
 
 Find the sum of the first forty terms of this sequence.
 
 # --hints--
 
-`euler321()` should return 2470433131948040.
+`swappingCounters()` should return `2470433131948040`.
 
 ```js
-assert.strictEqual(euler321(), 2470433131948040);
+assert.strictEqual(swappingCounters(), 2470433131948040);
 ```
 
 # --seed--
@@ -31,12 +37,12 @@ assert.strictEqual(euler321(), 2470433131948040);
 ## --seed-contents--
 
 ```js
-function euler321() {
+function swappingCounters() {
 
   return true;
 }
 
-euler321();
+swappingCounters();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.md
index 241c3a74f07..2c1725a5c4b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4af1000cf542c50ffc1
 title: 'Problem 322: Binomial coefficients divisible by 10'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301979
 dashedName: problem-322-binomial-coefficients-divisible-by-10
 ---
 
 # --description--
 
-Let T(m, n) be the number of the binomial coefficients iCn that are divisible by 10 for n ≤ i &lt; m(i, m and n are positive integers).
+Let $T(m, n)$ be the number of the binomial coefficients ${}^iC_n$ that are divisible by 10 for $n ≤ i &lt; m$ ($i$, $m$ and $n$ are positive integers).
 
-You are given that T(109, 107-10) = 989697000.
+You are given that $T({10}^9, {10}^7 - 10) = 989\\,697\\,000$.
 
-Find T(1018, 1012-10).
+Find $T({10}^{18}, {10}^{12} - 10)$.
 
 # --hints--
 
-`euler322()` should return 999998760323314000.
+`binomialCoefficientsDivisibleBy10()` should return `999998760323314000`.
 
 ```js
-assert.strictEqual(euler322(), 999998760323314000);
+assert.strictEqual(binomialCoefficientsDivisibleBy10(), 999998760323314000);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler322(), 999998760323314000);
 ## --seed-contents--
 
 ```js
-function euler322() {
+function binomialCoefficientsDivisibleBy10() {
 
   return true;
 }
 
-euler322();
+binomialCoefficientsDivisibleBy10();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
index b3367595620..7cd5acf36cc 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
@@ -1,31 +1,30 @@
 ---
 id: 5900f4b01000cf542c50ffc2
 title: 'Problem 323: Bitwise-OR operations on random integers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301980
 dashedName: problem-323-bitwise-or-operations-on-random-integers
 ---
 
 # --description--
 
-Let y0, y1, y2,... be a sequence of random unsigned 32 bit integers
+Let $y_0, y_1, y_2, \ldots$ be a sequence of random unsigned 32 bit integers (i.e. $0 ≤ y_i &lt; 2^{32}$, every value equally likely).
 
-(i.e. 0 ≤ yi &lt; 232, every value equally likely).
+For the sequence $x_i$ the following recursion is given:
 
-For the sequence xi the following recursion is given:x0 = 0 and
+- $x_0 = 0$ and
+- $x_i = x_{i - 1} \mathbf{|} y_{i - 1}$, for $i > 0$. ($\mathbf{|}$ is the bitwise-OR operator)
 
-xi = xi-1| yi-1, for i > 0. ( | is the bitwise-OR operator)
+It can be seen that eventually there will be an index $N$ such that $x_i = 2^{32} - 1$ (a bit-pattern of all ones) for all $i ≥ N$.
 
-It can be seen that eventually there will be an index N such that xi = 232 -1 (a bit-pattern of all ones) for all i ≥ N.
-
-Find the expected value of N. Give your answer rounded to 10 digits after the decimal point.
+Find the expected value of $N$. Give your answer rounded to 10 digits after the decimal point.
 
 # --hints--
 
-`euler323()` should return 6.3551758451.
+`bitwiseOrOnRandomIntegers()` should return `6.3551758451`.
 
 ```js
-assert.strictEqual(euler323(), 6.3551758451);
+assert.strictEqual(bitwiseOrOnRandomIntegers(), 6.3551758451);
 ```
 
 # --seed--
@@ -33,12 +32,12 @@ assert.strictEqual(euler323(), 6.3551758451);
 ## --seed-contents--
 
 ```js
-function euler323() {
+function bitwiseOrOnRandomIntegers() {
 
   return true;
 }
 
-euler323();
+bitwiseOrOnRandomIntegers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md
index 66ce4914777..e79296a5f0f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md
@@ -1,25 +1,29 @@
 ---
 id: 5900f4b11000cf542c50ffc3
 title: 'Problem 324: Building a tower'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301981
 dashedName: problem-324-building-a-tower
 ---
 
 # --description--
 
-Let f(n) represent the number of ways one can fill a 3×3×n tower with blocks of 2×1×1. You're allowed to rotate the blocks in any way you like; however, rotations, reflections etc of the tower itself are counted as distinct.
+Let $f(n)$ represent the number of ways one can fill a $3×3×n$ tower with blocks of $2×1×1$. You're allowed to rotate the blocks in any way you like; however, rotations, reflections etc of the tower itself are counted as distinct.
 
-For example (with q = 100000007) :f(2) = 229,f(4) = 117805,f(10) mod q = 96149360,f(103) mod q = 24806056,f(106) mod q = 30808124.
+For example (with $q = 100\\,000\\,007$):
 
-Find f(1010000) mod 100000007.
+$$\begin{align}   & f(2) = 229, \\\\
+  & f(4) = 117\\,805, \\\\   & f(10)\bmod q = 96\\,149\\,360, \\\\
+  & f({10}^3)\bmod q = 24\\,806\\,056, \\\\ & f({10}^6)\bmod q = 30\\,808\\,124. \end{align}$$
+
+Find $f({10}^{10000})\bmod 100\\,000\\,007$.
 
 # --hints--
 
-`euler324()` should return 96972774.
+`buildingTower()` should return `96972774`.
 
 ```js
-assert.strictEqual(euler324(), 96972774);
+assert.strictEqual(buildingTower(), 96972774);
 ```
 
 # --seed--
@@ -27,12 +31,12 @@ assert.strictEqual(euler324(), 96972774);
 ## --seed-contents--
 
 ```js
-function euler324() {
+function buildingTower() {
 
   return true;
 }
 
-euler324();
+buildingTower();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-325-stone-game-ii.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-325-stone-game-ii.md
index 6d0389b9fac..b1392c1e246 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-325-stone-game-ii.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-325-stone-game-ii.md
@@ -1,16 +1,16 @@
 ---
 id: 5900f4b11000cf542c50ffc4
 title: 'Problem 325: Stone Game II'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301982
 dashedName: problem-325-stone-game-ii
 ---
 
 # --description--
 
-A game is played with two piles of stones and two players. At her turn, a player removes a number of stones from the larger pile. The number of stones she removes must be a positive multiple of the number of stones in the smaller pile.
+A game is played with two piles of stones and two players. On each player's turn, the player may remove a number of stones from the larger pile. The number of stones removes must be a positive multiple of the number of stones in the smaller pile.
 
-E.g., let the ordered pair(6,14) describe a configuration with 6 stones in the smaller pile and 14 stones in the larger pile, then the first player can remove 6 or 12 stones from the larger pile.
+E.g., let the ordered pair (6,14) describe a configuration with 6 stones in the smaller pile and 14 stones in the larger pile, then the first player can remove 6 or 12 stones from the larger pile.
 
 The player taking all the stones from a pile wins the game.
 
@@ -18,16 +18,16 @@ A winning configuration is one where the first player can force a win. For examp
 
 A losing configuration is one where the second player can force a win, no matter what the first player does. For example, (2,3) and (3,4) are losing configurations: any legal move leaves a winning configuration for the second player.
 
-Define S(N) as the sum of (xi+yi) for all losing configurations (xi,yi), 0 &lt; xi &lt; yi ≤ N. We can verify that S(10) = 211 and S(104) = 230312207313.
+Define $S(N)$ as the sum of ($x_i + y_i$) for all losing configurations ($x_i$, $y_i$), $0 &lt; x_i &lt; y_i ≤ N$. We can verify that $S(10) = 211$ and $S({10}^4) = 230\\,312\\,207\\,313$.
 
-Find S(1016) mod 710.
+Find $S({10}^{16})\bmod 7^{10}$.
 
 # --hints--
 
-`euler325()` should return 54672965.
+`stoneGameTwo()` should return `54672965`.
 
 ```js
-assert.strictEqual(euler325(), 54672965);
+assert.strictEqual(stoneGameTwo(), 54672965);
 ```
 
 # --seed--
@@ -35,12 +35,12 @@ assert.strictEqual(euler325(), 54672965);
 ## --seed-contents--
 
 ```js
-function euler325() {
+function stoneGameTwo() {
 
   return true;
 }
 
-euler325();
+stoneGameTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md
index 1e6b648d9a0..e43a4a9f23c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f4b21000cf542c50ffc5
 title: 'Problem 326: Modulo Summations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301983
 dashedName: problem-326-modulo-summations
 ---
 
 # --description--
 
-Let an be a sequence recursively defined by: .
+Let $a_n$ be a sequence recursively defined by: $a_1 = 1$, $\displaystyle a_n = \left(\sum_{k = 1}^{n - 1} k \times a_k\right)\bmod n$.
 
-So the first 10 elements of an are: 1,1,0,3,0,3,5,4,1,9.
+So the first 10 elements of $a_n$ are: 1, 1, 0, 3, 0, 3, 5, 4, 1, 9.
 
-Let f(N,M) represent the number of pairs (p,q) such that:
+Let $f(N, M)$ represent the number of pairs $(p, q)$ such that:
 
-It can be seen that f(10,10)=4 with the pairs (3,3), (5,5), (7,9) and (9,10).
+$$ 1 \le p \le q \le N \\; \text{and} \\; \left(\sum_{i = p}^q a_i\right)\bmod M = 0$$
 
-You are also given that f(104,103)=97158.
+It can be seen that $f(10, 10) = 4$ with the pairs (3,3), (5,5), (7,9) and (9,10).
 
-Find f(1012,106).
+You are also given that $f({10}^4, {10}^3) = 97\\,158$.
+
+Find $f({10}^{12}, {10}^6)$.
 
 # --hints--
 
-`euler326()` should return 1966666166408794400.
+`moduloSummations()` should return `1966666166408794400`.
 
 ```js
-assert.strictEqual(euler326(), 1966666166408794400);
+assert.strictEqual(moduloSummations(), 1966666166408794400);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler326(), 1966666166408794400);
 ## --seed-contents--
 
 ```js
-function euler326() {
+function moduloSummations() {
 
   return true;
 }
 
-euler326();
+moduloSummations();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md
index 354596b1d74..d324e96908a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4b31000cf542c50ffc6
 title: 'Problem 327: Rooms of Doom'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301984
 dashedName: problem-327-rooms-of-doom
 ---
@@ -10,7 +10,9 @@ dashedName: problem-327-rooms-of-doom
 
 A series of three rooms are connected to each other by automatic doors.
 
-Each door is operated by a security card. Once you enter a room the door automatically closes and that security card cannot be used again. A machine at the start will dispense an unlimited number of cards, but each room (including the starting room) contains scanners and if they detect that you are holding more than three security cards or if they detect an unattended security card on the floor, then all the doors will become permanently locked. However, each room contains a box where you may safely store any number of security cards for use at a later stage.
+<img class="img-responsive center-block" alt="series of three rooms, connected to each other by automatic doors" src="https://cdn.freecodecamp.org/curriculum/project-euler/rooms-of-doom.gif" style="background-color: white; padding: 10px;" />
+
+Each door is operated by a security card. Once you enter a room, the door automatically closes, and that security card cannot be used again. A machine will dispense an unlimited number of cards at the start, but each room (including the starting room) contains scanners. If they detect that you are holding more than three security cards or if they detect an unattended security card on the floor, then all the doors will become permanently locked. However, each room contains a box where you may safely store any number of security cards for use at a later stage.
 
 If you simply tried to travel through the rooms one at a time then as you entered room 3 you would have used all three cards and would be trapped in that room forever!
 
@@ -18,20 +20,26 @@ However, if you make use of the storage boxes, then escape is possible. For exam
 
 It is possible to travel through six rooms using a total of 123 security cards while carrying a maximum of 3 cards.
 
-Let C be the maximum number of cards which can be carried at any time. Let R be the number of rooms to travel through. Let M(C,R) be the minimum number of cards required from the dispensing machine to travel through R rooms carrying up to a maximum of C cards at any time.
+Let $C$ be the maximum number of cards which can be carried at any time.
 
-For example, M(3,6)=123 and M(4,6)=23.And, ΣM(C,6)=146 for 3 ≤ C ≤ 4.
+Let $R$ be the number of rooms to travel through.
 
-You are given that ΣM(C,10)=10382 for 3 ≤ C ≤ 10.
+Let $M(C, R)$ be the minimum number of cards required from the dispensing machine to travel through $R$ rooms carrying up to a maximum of $C$ cards at any time.
 
-Find ΣM(C,30) for 3 ≤ C ≤ 40.
+For example, $M(3, 6) = 123$ and $M(4, 6) = 23$.
+
+And, $\sum M(C, 6) = 146$ for $3 ≤ C ≤ 4$.
+
+You are given that $\sum M(C, 10) = 10382$ for $3 ≤ C ≤ 10$.
+
+Find $\sum M(C, 30)$ for $3 ≤ C ≤ 40$.
 
 # --hints--
 
-`euler327()` should return 34315549139516.
+`roomsOfDoom()` should return `34315549139516`.
 
 ```js
-assert.strictEqual(euler327(), 34315549139516);
+assert.strictEqual(roomsOfDoom(), 34315549139516);
 ```
 
 # --seed--
@@ -39,12 +47,12 @@ assert.strictEqual(euler327(), 34315549139516);
 ## --seed-contents--
 
 ```js
-function euler327() {
+function roomsOfDoom() {
 
   return true;
 }
 
-euler327();
+roomsOfDoom();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-328-lowest-cost-search.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-328-lowest-cost-search.md
index 4a00f455cc1..3d3d44147e3 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-328-lowest-cost-search.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-328-lowest-cost-search.md
@@ -1,39 +1,39 @@
 ---
 id: 5900f4b41000cf542c50ffc7
 title: 'Problem 328: Lowest-cost Search'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301985
 dashedName: problem-328-lowest-cost-search
 ---
 
 # --description--
 
-We are trying to find a hidden number selected from the set of integers {1, 2, ..., n} by asking questions.
+We are trying to find a hidden number selected from the set of integers {1, 2, ..., $n$} by asking questions. Each number (question) we ask, has a <u>cost equal to the number asked</u> and we get one of three possible answers:
 
-Each number (question) we ask, has a cost equal to the number asked and we get one of three possible answers: "Your guess is lower than the hidden number", or
+- "Your guess is lower than the hidden number", or
+- "Yes, that's it!", or
+- "Your guess is higher than the hidden number".
 
-"Yes, that's it!", or
+Given the value of $n$, an optimal strategy minimizes the total cost (i.e. the sum of all the questions asked) <u>for the worst possible case</u>. E.g.
 
-"Your guess is higher than the hidden number".
+If $n = 3$, the best we can do is obviously to ask the number "<strong>2</strong>". The answer will immediately lead us to find the hidden number (at a total cost = 2).
 
-Given the value of n, an optimal strategy minimizes the total cost (i.e. the sum of all the questions asked) for the worst possible case. E.g.
+If $n = 8$, we might decide to use a "binary search" type of strategy: Our first question would be "<strong>4</strong>" and if the hidden number is higher than 4 we will need one or two additional questions. Let our second question be "<strong>6</strong>". If the hidden number is still higher than 6, we will need a third question in order to discriminate between 7 and 8. Thus, our third question will be "<strong>7</strong>" and the total cost for this worst-case scenario will be $4 + 6 + 7 = \mathbf{\color{red}{17}}$.
 
-If n=3, the best we can do is obviously to ask the number "2". The answer will immediately lead us to find the hidden number (at a total cost = 2).
+We can improve considerably the worst-case cost for $n = 8$, by asking "<strong>5</strong>" as our first question. If we are told that the hidden number is higher than 5, our second question will be "<strong>7</strong>", then we'll know for certain what the hidden number is (for a total cost of $5 + 7 = \mathbf{\color{blue}{12}}$). If we are told that the hidden number is lower than 5, our second question will be "<strong>3</strong>" and if the hidden number is lower than 3 our third question will be "<strong>1</strong>", giving a total cost of $5 + 3 + 1 = \mathbf{\color{blue}{9}}$. Since $\mathbf{\color{blue}{12 > 9}}$, the worst-case cost for this strategy is <strong><span style="color: red;">12</span></strong>. That's better than what we achieved previously with the "binary search" strategy; it is also better than or equal to any other strategy. So, in fact, we have just described an optimal strategy for $n = 8$.
 
-If n=8, we might decide to use a "binary search" type of strategy: Our first question would be "4" and if the hidden number is higher than 4 we will need one or two additional questions. Let our second question be "6". If the hidden number is still higher than 6, we will need a third question in order to discriminate between 7 and 8. Thus, our third question will be "7" and the total cost for this worst-case scenario will be 4+6+7=17.
+Let $C(n)$ be the worst-case cost achieved by an optimal strategy for $n$, as described above. Thus $C(1) = 0$, $C(2) = 1$, $C(3) = 2$ and $C(8) = 12$.
 
-We can improve considerably the worst-case cost for n=8, by asking "5" as our first question. If we are told that the hidden number is higher than 5, our second question will be "7", then we'll know for certain what the hidden number is (for a total cost of 5+7=12). If we are told that the hidden number is lower than 5, our second question will be "3" and if the hidden number is lower than 3 our third question will be "1", giving a total cost of 5+3+1=9. Since 12>9, the worst-case cost for this strategy is 12. That's better than what we achieved previously with the "binary search" strategy; it is also better than or equal to any other strategy. So, in fact, we have just described an optimal strategy for n=8.
+Similarly, $C(100) = 400$ and $\displaystyle\sum_{n = 1}^{100} C(n) = 17575$.
 
-Let C(n) be the worst-case cost achieved by an optimal strategy for n, as described above. Thus C(1) = 0, C(2) = 1, C(3) = 2 and C(8) = 12. Similarly, C(100) = 400 and C(n) = 17575.
-
-Find C(n).
+Find $\displaystyle\sum_{n = 1}^{200\\,000} C(n)$.
 
 # --hints--
 
-`euler328()` should return 260511850222.
+`lowestCostSearch()` should return `260511850222`.
 
 ```js
-assert.strictEqual(euler328(), 260511850222);
+assert.strictEqual(lowestCostSearch(), 260511850222);
 ```
 
 # --seed--
@@ -41,12 +41,12 @@ assert.strictEqual(euler328(), 260511850222);
 ## --seed-contents--
 
 ```js
-function euler328() {
+function lowestCostSearch() {
 
   return true;
 }
 
-euler328();
+lowestCostSearch();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-329-prime-frog.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-329-prime-frog.md
index 6b1e185daf9..e14df07e58a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-329-prime-frog.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-329-prime-frog.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4b51000cf542c50ffc8
 title: 'Problem 329: Prime Frog'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301986
 dashedName: problem-329-prime-frog
 ---
@@ -12,20 +12,26 @@ Susan has a prime frog.
 
 Her frog is jumping around over 500 squares numbered 1 to 500.
 
-He can only jump one square to the left or to the right, with equal probability, and he cannot jump outside the range \[1;500].(if it lands at either end, it automatically jumps to the only available square on the next move.)
+He can only jump one square to the left or to the right, with equal probability, and he cannot jump outside the range [1;500]. (if it lands at either end, it automatically jumps to the only available square on the next move.)
 
-When he is on a square with a prime number on it, he croaks 'P' (PRIME) with probability 2/3 or 'N' (NOT PRIME) with probability 1/3 just before jumping to the next square. When he is on a square with a number on it that is not a prime he croaks 'P' with probability 1/3 or 'N' with probability 2/3 just before jumping to the next square.
+When he is on a square with a prime number on it, he croaks 'P' (PRIME) with probability $\frac{2}{3}$ or 'N' (NOT PRIME) with probability $\frac{1}{3}$ just before jumping to the next square. When he is on a square with a number on it that is not a prime he croaks 'P' with probability $\frac{1}{3}$ or 'N' with probability $\frac{2}{3}$ just before jumping to the next square.
 
 Given that the frog's starting position is random with the same probability for every square, and given that she listens to his first 15 croaks, what is the probability that she hears the sequence PPPPNNPPPNPPNPN?
 
-Give your answer as a fraction p/q in reduced form.
+Give your answer as a string as a fraction `p/q` in reduced form.
 
 # --hints--
 
-`euler329()` should return 199740353 / 29386561536000.
+`primeFrog()` should return a string.
 
 ```js
-assert.strictEqual(euler329(), 199740353 / 29386561536000);
+assert(typeof primeFrog() === 'string');
+```
+
+`primeFrog()` should return the string `199740353/29386561536000`.
+
+```js
+assert.strictEqual(primeFrog(), '199740353/29386561536000');
 ```
 
 # --seed--
@@ -33,12 +39,12 @@ assert.strictEqual(euler329(), 199740353 / 29386561536000);
 ## --seed-contents--
 
 ```js
-function euler329() {
+function primeFrog() {
 
   return true;
 }
 
-euler329();
+primeFrog();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.md
index ec7756e9451..5419f2f8270 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f38d1000cf542c50fea0
 title: 'Problem 33: Digit cancelling fractions'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301987
 dashedName: problem-33-digit-cancelling-fractions
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-330-eulers-number.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-330-eulers-number.md
index c8a3feab396..c58768e00f8 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-330-eulers-number.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-330-eulers-number.md
@@ -1,37 +1,37 @@
 ---
 id: 5900f4b71000cf542c50ffc9
 title: 'Problem 330: Euler''s Number'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301988
 dashedName: problem-330-eulers-number
 ---
 
 # --description--
 
-An infinite sequence of real numbers a(n) is defined for all integers n as follows:
+An infinite sequence of real numbers $a(n)$ is defined for all integers $n$ as follows:
 
-<!-- TODO Use MathJax and re-write from projecteuler.net -->
+$$ a(n) = \begin{cases} 1                                                       & n < 0 \\\\
+\displaystyle \sum_{i = 1}^{\infty} \frac{a(n - 1)}{i!} & n \ge 0 \end{cases} $$
 
-For example,a(0) = 11! + 12! + 13! + ... = e − 1 a(1) = e − 11! + 12! + 13! + ... = 2e − 3 a(2) = 2e − 31! + e − 12! + 13! + ... = 72 e − 6
+Por ejemplo,
 
-with e = 2.7182818... being Euler's constant.
+$$\begin{align}   & a(0) = \frac{1}{1!} + \frac{1}{2!} + \frac{1}{3!} + \ldots = e − 1 \\\\
+  & a(1) = \frac{e − 1}{1!} + \frac{1}{2!} + \frac{1}{3!} + \ldots = 2e − 3 \\\\ & a(2) = \frac{2e − 3}{1!} + \frac{e − 1}{2!} + \frac{1}{3!} + \ldots = \frac{7}{2} e − 6 \end{align}$$
 
-It can be shown that a(n) is of the form
+with $e = 2.7182818\ldots$ being Euler's constant.
 
-A(n) e + B(n)n! for integers A(n) and B(n).
+It can be shown that $a(n)$ is of the form $\displaystyle\frac{A(n)e + B(n)}{n!}$ for integers $A(n)$ and $B(n)$.
 
-For example a(10) =
+For example $\displaystyle a(10) = \frac{328161643e − 652694486}{10!}$.
 
-328161643 e − 65269448610!.
-
-Find A(109) + B(109) and give your answer mod 77 777 777.
+Find $A({10}^9)$ + $B({10}^9)$ and give your answer $\bmod 77\\,777\\,777$.
 
 # --hints--
 
-`euler330()` should return 15955822.
+`eulersNumber()` should return `15955822`.
 
 ```js
-assert.strictEqual(euler330(), 15955822);
+assert.strictEqual(eulersNumber(), 15955822);
 ```
 
 # --seed--
@@ -39,12 +39,12 @@ assert.strictEqual(euler330(), 15955822);
 ## --seed-contents--
 
 ```js
-function euler330() {
+function eulersNumber() {
 
   return true;
 }
 
-euler330();
+eulersNumber();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-331-cross-flips.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-331-cross-flips.md
index 4d3d330a744..84e5ffbdd51 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-331-cross-flips.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-331-cross-flips.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4b71000cf542c50ffca
 title: 'Problem 331: Cross flips'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301989
 dashedName: problem-331-cross-flips
 ---
@@ -10,24 +10,26 @@ dashedName: problem-331-cross-flips
 
 N×N disks are placed on a square game board. Each disk has a black side and white side.
 
-At each turn, you may choose a disk and flip all the disks in the same row and the same column as this disk: thus 2×N-1 disks are flipped. The game ends when all disks show their white side. The following example shows a game on a 5×5 board.
+At each turn, you may choose a disk and flip all the disks in the same row and the same column as this disk: thus $2 × N - 1$ disks are flipped. The game ends when all disks show their white side. The following example shows a game on a 5×5 board.
+
+<img class="img-responsive center-block" alt="animation showing game on 5x5 board" src="https://cdn.freecodecamp.org/curriculum/project-euler/cross-flips.gif" style="background-color: white; padding: 10px;" />
 
 It can be proven that 3 is the minimal number of turns to finish this game.
 
-The bottom left disk on the N×N board has coordinates (0,0); the bottom right disk has coordinates (N-1,0) and the top left disk has coordinates (0,N-1).
+The bottom left disk on the $N×N$ board has coordinates (0, 0); the bottom right disk has coordinates ($N - 1$,$0$) and the top left disk has coordinates ($0$,$N - 1$).
 
-Let CN be the following configuration of a board with N×N disks: A disk at (x,y) satisfying , shows its black side; otherwise, it shows its white side. C5 is shown above.
+Let $C_N$ be the following configuration of a board with $N × N$ disks: A disk at ($x$, $y$) satisfying $N - 1 \le \sqrt{x^2 + y^2} \lt N$, shows its black side; otherwise, it shows its white side. $C_5$ is shown above.
 
-Let T(N) be the minimal number of turns to finish a game starting from configuration CN or 0 if configuration CN is unsolvable. We have shown that T(5)=3. You are also given that T(10)=29 and T(1 000)=395253.
+Let $T(N)$ be the minimal number of turns to finish a game starting from configuration $C_N$ or 0 if configuration $C_N$ is unsolvable. We have shown that $T(5) = 3$. You are also given that $T(10) = 29$ and $T(1\\,000) = 395\\,253$.
 
-Find .
+Find $\displaystyle \sum_{i = 3}^{31} T(2^i - i)$.
 
 # --hints--
 
-`euler331()` should return 467178235146843500.
+`crossFlips()` should return `467178235146843500`.
 
 ```js
-assert.strictEqual(euler331(), 467178235146843500);
+assert.strictEqual(crossFlips(), 467178235146843500);
 ```
 
 # --seed--
@@ -35,12 +37,12 @@ assert.strictEqual(euler331(), 467178235146843500);
 ## --seed-contents--
 
 ```js
-function euler331() {
+function crossFlips() {
 
   return true;
 }
 
-euler331();
+crossFlips();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md
index ea3a4d0c431..54fe2d09a50 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4b91000cf542c50ffcb
 title: 'Problem 332: Spherical triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301990
 dashedName: problem-332-spherical-triangles
 ---
@@ -10,18 +10,26 @@ dashedName: problem-332-spherical-triangles
 
 A spherical triangle is a figure formed on the surface of a sphere by three great circular arcs intersecting pairwise in three vertices.
 
-Let C(r) be the sphere with the centre (0,0,0) and radius r. Let Z(r) be the set of points on the surface of C(r) with integer coordinates. Let T(r) be the set of spherical triangles with vertices in Z(r). Degenerate spherical triangles, formed by three points on the same great arc, are not included in T(r). Let A(r) be the area of the smallest spherical triangle in T(r).
+<img class="img-responsive center-block" alt="spherical triangle formed on the surface of a sphere" src="https://cdn.freecodecamp.org/curriculum/project-euler/spherical-triangles.jpg" style="background-color: white; padding: 10px;" />
 
-For example A(14) is 3.294040 rounded to six decimal places.
+Let $C(r)$ be the sphere with the centre (0,0,0) and radius $r$.
 
-Find A(r). Give your answer rounded to six decimal places.
+Let $Z(r)$ be the set of points on the surface of $C(r)$ with integer coordinates.
+
+Let $T(r)$ be the set of spherical triangles with vertices in $Z(r)$. Degenerate spherical triangles, formed by three points on the same great arc, are <u>not</u> included in $T(r)$.
+
+Let $A(r)$ be the area of the smallest spherical triangle in $T(r)$.
+
+For example $A(14)$ is 3.294040 rounded to six decimal places.
+
+Find $\displaystyle \sum_{r = 1}^{50} A(r)$. Give your answer rounded to six decimal places.
 
 # --hints--
 
-`euler332()` should return 2717.751525.
+`sphericalTriangles()` should return `2717.751525`.
 
 ```js
-assert.strictEqual(euler332(), 2717.751525);
+assert.strictEqual(sphericalTriangles(), 2717.751525);
 ```
 
 # --seed--
@@ -29,12 +37,12 @@ assert.strictEqual(euler332(), 2717.751525);
 ## --seed-contents--
 
 ```js
-function euler332() {
+function sphericalTriangles() {
 
   return true;
 }
 
-euler332();
+sphericalTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-333-special-partitions.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-333-special-partitions.md
index 5af490eb7ea..27cad095741 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-333-special-partitions.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-333-special-partitions.md
@@ -1,33 +1,36 @@
 ---
 id: 5900f4b91000cf542c50ffcc
 title: 'Problem 333: Special partitions'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301991
 dashedName: problem-333-special-partitions
 ---
 
 # --description--
 
-All positive integers can be partitioned in such a way that each and every term of the partition can be expressed as 2ix3j, where i,j ≥ 0.
+All positive integers can be partitioned in such a way that each and every term of the partition can be expressed as $2^i \times 3^j$, where $i, j ≥ 0$.
 
-Let's consider only those such partitions where none of the terms can divide any of the other terms. For example, the partition of 17 = 2 + 6 + 9 = (21x30 + 21x31 + 20x32) would not be valid since 2 can divide 6. Neither would the partition 17 = 16 + 1 = (24x30 + 20x30) since 1 can divide 16. The only valid partition of 17 would be 8 + 9 = (23x30 + 20x32).
+Let's consider only those such partitions where none of the terms can divide any of the other terms. For example, the partition of $17 = 2 + 6 + 9 = (2^1 \times 3^0 + 2^1 \times 3^1 + 2^0 \times 3^2)$ would not be valid since 2 can divide 6. Neither would the partition $17 = 16 + 1 = (2^4 \times 3^0 + 2^0 \times 3^0)$ since 1 can divide 16. The only valid partition of 17 would be $8 + 9 = (2^3 \times 3^0 + 2^0 \times 3^2)$.
 
-Many integers have more than one valid partition, the first being 11 having the following two partitions. 11 = 2 + 9 = (21x30 + 20x32) 11 = 8 + 3 = (23x30 + 20x31)
+Many integers have more than one valid partition, the first being 11 having the following two partitions.
 
-Let's define P(n) as the number of valid partitions of n. For example, P(11) = 2.
+$$\begin{align}   & 11 = 2 + 9 = (2^1 \times 3^0 + 2^0 \times 3^2) \\\\
+  & 11 = 8 + 3 = (2^3 \times 3^0 + 2^0 \times 3^1) \end{align}$$
 
-Let's consider only the prime integers q which would have a single valid partition such as P(17).
+Let's define $P(n)$ as the number of valid partitions of $n$. For example, $P(11) = 2$.
 
-The sum of the primes q &lt;100 such that P(q)=1 equals 233.
+Let's consider only the prime integers $q$ which would have a single valid partition such as $P(17)$.
 
-Find the sum of the primes q &lt;1000000 such that P(q)=1.
+The sum of the primes $q &lt;100$ such that $P(q) = 1$ equals 233.
+
+Find the sum of the primes $q &lt; 1\\,000\\,000$ such that $P(q) = 1$.
 
 # --hints--
 
-`euler333()` should return 3053105.
+`specialPartitions()` should return `3053105`.
 
 ```js
-assert.strictEqual(euler333(), 3053105);
+assert.strictEqual(specialPartitions(), 3053105);
 ```
 
 # --seed--
@@ -35,12 +38,12 @@ assert.strictEqual(euler333(), 3053105);
 ## --seed-contents--
 
 ```js
-function euler333() {
+function specialPartitions() {
 
   return true;
 }
 
-euler333();
+specialPartitions();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md
index fe354cec8a1..d8be81c5efa 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4ba1000cf542c50ffcd
 title: 'Problem 334: Spilling the beans'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301992
 dashedName: problem-334-spilling-the-beans
 ---
@@ -12,20 +12,25 @@ In Plato's heaven, there exist an infinite number of bowls in a straight line. E
 
 For example, consider two adjacent bowls containing 2 and 3 beans respectively, all other bowls being empty. The following eight moves will finish the game:
 
-<!-- TODO Use MathJax and re-write from projecteuler.net -->
+<img class="img-responsive center-block" alt="animation of game when two adjacent bowls contains 2 and 3 beans respectivelly" src="https://cdn.freecodecamp.org/curriculum/project-euler/spilling-the-beans.gif" style="background-color: white; padding: 10px;" />
 
-You are given the following sequences: t0 = 123456. ti = ti-12, if ti-1 is even ti-12 926252, if ti-1 is odd where ⌊x⌋ is the floor function and is the bitwise XOR operator. bi = ( ti mod 211) + 1.
+You are given the following sequences:
 
-The first two terms of the last sequence are b1 = 289 and b2 = 145. If we start with b1 and b2 beans in two adjacent bowls, 3419100 moves would be required to finish the game.
+$$\begin{align}   & t_0 = 123456, \\\\
+  & t_i = \begin{cases}          \frac{t_{i - 1}}{2},               & \text{if $t_{i - 1}$ is even} \\\\
+         \left\lfloor\frac{t_{i - 1}}{2}\right\rfloor \oplus 926252, & \text{if $t_{i - 1}$ is odd}          \end{cases} \\\\
+         & \qquad \text{where $⌊x⌋$ is the floor function and $\oplus$ is the bitwise XOR operator.} \\\\ & b_i = (t_i\bmod 2^{11}) + 1. \end{align}$$
 
-Consider now 1500 adjacent bowls containing b1, b2,..., b1500 beans respectively, all other bowls being empty. Find how many moves it takes before the game ends.
+The first two terms of the last sequence are $b_1 = 289$ and $b_2 = 145$. If we start with $b_1$ and $b_2$ beans in two adjacent bowls, 3419100 moves would be required to finish the game.
+
+Consider now 1500 adjacent bowls containing $b_1, b_2, \ldots, b_{1500}$ beans respectively, all other bowls being empty. Find how many moves it takes before the game ends.
 
 # --hints--
 
-`euler334()` should return 150320021261690850.
+`spillingTheBeans()` should return `150320021261690850`.
 
 ```js
-assert.strictEqual(euler334(), 150320021261690850);
+assert.strictEqual(spillingTheBeans(), 150320021261690850);
 ```
 
 # --seed--
@@ -33,12 +38,12 @@ assert.strictEqual(euler334(), 150320021261690850);
 ## --seed-contents--
 
 ```js
-function euler334() {
+function spillingTheBeans() {
 
   return true;
 }
 
-euler334();
+spillingTheBeans();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md
index 0605e0d053f..c1b35177c9b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4bd1000cf542c50ffce
 title: 'Problem 335: Gathering the beans'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301993
 dashedName: problem-335-gathering-the-beans
 ---
@@ -10,18 +10,20 @@ dashedName: problem-335-gathering-the-beans
 
 Whenever Peter feels bored, he places some bowls, containing one bean each, in a circle. After this, he takes all the beans out of a certain bowl and drops them one by one in the bowls going clockwise. He repeats this, starting from the bowl he dropped the last bean in, until the initial situation appears again. For example with 5 bowls he acts as follows:
 
+<img class="img-responsive center-block" alt="animation of moving beans in 5 bowls" src="https://cdn.freecodecamp.org/curriculum/project-euler/gathering-the-beans.gif" style="background-color: white; padding: 10px;" />
+
 So with 5 bowls it takes Peter 15 moves to return to the initial situation.
 
-Let M(x) represent the number of moves required to return to the initial situation, starting with x bowls. Thus, M(5) = 15. It can also be verified that M(100) = 10920.
+Let $M(x)$ represent the number of moves required to return to the initial situation, starting with $x$ bowls. Thus, $M(5) = 15$. It can also be verified that $M(100) = 10920$.
 
-Find M(2k+1). Give your answer modulo 79.
+Find $\displaystyle\sum_{k = 0}^{{10}^{18}} M(2^k + 1)$. Give your answer modulo $7^9$.
 
 # --hints--
 
-`euler335()` should return 5032316.
+`gatheringTheBeans()` should return `5032316`.
 
 ```js
-assert.strictEqual(euler335(), 5032316);
+assert.strictEqual(gatheringTheBeans(), 5032316);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler335(), 5032316);
 ## --seed-contents--
 
 ```js
-function euler335() {
+function gatheringTheBeans() {
 
   return true;
 }
 
-euler335();
+gatheringTheBeans();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md
index 3dbf18111c6..c5df56c3d7b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md
@@ -1,33 +1,41 @@
 ---
 id: 5900f4bd1000cf542c50ffcf
 title: 'Problem 336: Maximix Arrangements'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301994
 dashedName: problem-336-maximix-arrangements
 ---
 
 # --description--
 
-A train is used to transport four carriages in the order: ABCD. However, sometimes when the train arrives to collect the carriages they are not in the correct order.
+A train is used to transport four carriages in the order: $ABCD$. However, sometimes when the train arrives to collect the carriages they are not in the correct order.
 
-To rearrange the carriages they are all shunted on to a large rotating turntable. After the carriages are uncoupled at a specific point the train moves off the turntable pulling the carriages still attached with it. The remaining carriages are rotated 180 degrees. All of the carriages are then rejoined and this process is repeated as often as necessary in order to obtain the least number of uses of the turntable.
+To rearrange the carriages, they are all shunted onto a large rotating turntable. After the carriages are uncoupled at a specific point, the train moves off the turntable pulling the carriages still attached with it. The remaining carriages are rotated 180°. All of the carriages are then rejoined and this process is repeated as often as necessary in order to obtain the least number of uses of the turntable.
 
-Some arrangements, such as ADCB, can be solved easily: the carriages are separated between A and D, and after DCB are rotated the correct order has been achieved.
+Some arrangements, such as $ADCB$, can be solved easily: the carriages are separated between $A$ and $D$, and after $DCB$ are rotated the correct order has been achieved.
 
-However, Simple Simon, the train driver, is not known for his efficiency, so he always solves the problem by initially getting carriage A in the correct place, then carriage B, and so on.
+However, Simple Simon, the train driver, is not known for his efficiency, so he always solves the problem by initially getting carriage $A$ in the correct place, then carriage $B$, and so on.
 
-Using four carriages, the worst possible arrangements for Simon, which we shall call maximix arrangements, are DACB and DBAC; each requiring him five rotations (although, using the most efficient approach, they could be solved using just three rotations). The process he uses for DACB is shown below.
+Using four carriages, the worst possible arrangements for Simon, which we shall call maximix arrangements, are $DACB$ and $DBAC$; each requiring him five rotations (although, using the most efficient approach, they could be solved using just three rotations). The process he uses for $DACB$ is shown below.
 
-It can be verified that there are 24 maximix arrangements for six carriages, of which the tenth lexicographic maximix arrangement is DFAECB.
+<img class="img-responsive center-block" alt="five rotations for maximix arrangement DACB" src="https://cdn.freecodecamp.org/curriculum/project-euler/maximix-arrangements.gif" style="background-color: white; padding: 10px;" />
 
-Find the 2011th lexicographic maximix arrangement for eleven carriages.
+It can be verified that there are 24 maximix arrangements for six carriages, of which the tenth lexicographic maximix arrangement is $DFAECB$.
+
+Find the ${2011}^{\text{th}}$ lexicographic maximix arrangement for eleven carriages.
 
 # --hints--
 
-`euler336()` should return CAGBIHEFJDK.
+`maximixArrangements()` should return a string.
 
 ```js
-assert.strictEqual(euler336(), CAGBIHEFJDK);
+assert(typeof maximixArrangements() === 'string');
+```
+
+`maximixArrangements()` should return the string `CAGBIHEFJDK`.
+
+```js
+assert.strictEqual(maximixArrangements(), 'CAGBIHEFJDK');
 ```
 
 # --seed--
@@ -35,12 +43,12 @@ assert.strictEqual(euler336(), CAGBIHEFJDK);
 ## --seed-contents--
 
 ```js
-function euler336() {
+function maximixArrangements() {
 
   return true;
 }
 
-euler336();
+maximixArrangements();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.md
index 677c918f053..ed090ed3f86 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.md
@@ -1,35 +1,35 @@
 ---
 id: 5900f4be1000cf542c50ffd0
 title: 'Problem 337: Totient Stairstep Sequences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301995
 dashedName: problem-337-totient-stairstep-sequences
 ---
 
 # --description--
 
-Let {a1, a2,..., an} be an integer sequence of length n such that:
+Let $\\{a_1, a_2, \ldots, a_n\\}$ be an integer sequence of length $n$ such that:
 
-a1 = 6
+- $a_1 = 6$
+- for all $1 ≤ i &lt; n$ : $φ(a_i) &lt; φ(a_{i + 1}) &lt; a_i &lt; a_{i + 1}$
 
-for all 1 ≤ i &lt; n : φ(ai) &lt; φ(ai+1) &lt; ai &lt; ai+11
+$φ$ denotes Euler's totient function.
 
-Let S(N) be the number of such sequences with an ≤ N.
+Let $S(N)$ be the number of such sequences with $a_n ≤ N$.
 
-For example, S(10) = 4: {6}, {6, 8}, {6, 8, 9} and {6, 10}.
+For example, $S(10) = 4$: {6}, {6, 8}, {6, 8, 9} and {6, 10}.
 
-We can verify that S(100) = 482073668 and S(10 000) mod 108 = 73808307.
+We can verify that $S(100) = 482\\,073\\,668$ and $S(10\\,000)\bmod {10}^8 = 73\\,808\\,307$.
 
-Find S(20 000 000) mod 108.
+Find $S(20\\,000\\,000)\bmod {10}^8$.
 
-1 φ denotes Euler's totient function.
 
 # --hints--
 
-`euler337()` should return 85068035.
+`totientStairstepSequences()` should return `85068035`.
 
 ```js
-assert.strictEqual(euler337(), 85068035);
+assert.strictEqual(totientStairstepSequences(), 85068035);
 ```
 
 # --seed--
@@ -37,12 +37,12 @@ assert.strictEqual(euler337(), 85068035);
 ## --seed-contents--
 
 ```js
-function euler337() {
+function totientStairstepSequences() {
 
   return true;
 }
 
-euler337();
+totientStairstepSequences();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md
index 514dc560b01..9a2143b65fd 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md
@@ -1,33 +1,35 @@
 ---
 id: 5900f4be1000cf542c50ffd1
 title: 'Problem 338: Cutting Rectangular Grid Paper'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301996
 dashedName: problem-338-cutting-rectangular-grid-paper
 ---
 
 # --description--
 
-A rectangular sheet of grid paper with integer dimensions w × h is given. Its grid spacing is 1.
+A rectangular sheet of grid paper with integer dimensions $w$ × $h$ is given. Its grid spacing is 1.
 
 When we cut the sheet along the grid lines into two pieces and rearrange those pieces without overlap, we can make new rectangles with different dimensions.
 
-For example, from a sheet with dimensions 9 × 4 , we can make rectangles with dimensions 18 × 2, 12 × 3 and 6 × 6 by cutting and rearranging as below:
+For example, from a sheet with dimensions 9 × 4, we can make rectangles with dimensions 18 × 2, 12 × 3 and 6 × 6 by cutting and rearranging as below:
 
-Similarly, from a sheet with dimensions 9 × 8 , we can make rectangles with dimensions 18 × 4 and 12 × 6 .
+<img class="img-responsive center-block" alt="sheet with 9 x 4 dimensions cut in three different ways to make rectangles with 18 x 2, 12 x 3 and 6 x 6 dimensions" src="https://cdn.freecodecamp.org/curriculum/project-euler/cutting-rectangular-grid-paper.gif" style="background-color: white; padding: 10px;" />
 
-For a pair w and h, let F(w,h) be the number of distinct rectangles that can be made from a sheet with dimensions w × h . For example, F(2,1) = 0, F(2,2) = 1, F(9,4) = 3 and F(9,8) = 2. Note that rectangles congruent to the initial one are not counted in F(w,h). Note also that rectangles with dimensions w × h and dimensions h × w are not considered distinct.
+Similarly, from a sheet with dimensions 9 × 8, we can make rectangles with dimensions 18 × 4 and 12 × 6.
 
-For an integer N, let G(N) be the sum of F(w,h) for all pairs w and h which satisfy 0 &lt; h ≤ w ≤ N. We can verify that G(10) = 55, G(103) = 971745 and G(105) = 9992617687.
+For a pair $w$ and $h$, let $F(w, h)$ be the number of distinct rectangles that can be made from a sheet with dimensions $w$ × $h$. For example, $F(2, 1) = 0$, $F(2, 2) = 1$, $F(9, 4) = 3$ and $F(9, 8) = 2$. Note that rectangles congruent to the initial one are not counted in $F(w, h)$. Note also that rectangles with dimensions $w$ × $h$ and dimensions $h$ × $w$ are not considered distinct.
 
-Find G(1012). Give your answer modulo 108.
+For an integer $N$, let $G(N)$ be the sum of $F(w, h)$ for all pairs $w$ and $h$ which satisfy $0 &lt; h ≤ w ≤ N$. We can verify that $G(10) = 55$, $G({10}^3) = 971\\,745$ and $G({10}^5) = 9\\,992\\,617\\,687$.
+
+Find $G({10}^{12})$. Give your answer modulo ${10}^8$.
 
 # --hints--
 
-`euler338()` should return 15614292.
+`cuttingRectangularGridPaper()` should return `15614292`.
 
 ```js
-assert.strictEqual(euler338(), 15614292);
+assert.strictEqual(cuttingRectangularGridPaper(), 15614292);
 ```
 
 # --seed--
@@ -35,12 +37,12 @@ assert.strictEqual(euler338(), 15614292);
 ## --seed-contents--
 
 ```js
-function euler338() {
+function cuttingRectangularGridPaper() {
 
   return true;
 }
 
-euler338();
+cuttingRectangularGridPaper();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.md
index 6844c7e65c9..7c1934c581b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.md
@@ -1,25 +1,27 @@
 ---
 id: 5900f4c01000cf542c50ffd2
 title: 'Problem 339: Peredur fab Efrawg'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301997
 dashedName: problem-339-peredur-fab-efrawg
 ---
 
 # --description--
 
-"And he came towards a valley, through which ran a river; and the borders of the valley were wooded, and on each side of the river were level meadows. And on one side of the river he saw a flock of white sheep, and on the other a flock of black sheep. And whenever one of the white sheep bleated, one of the black sheep would cross over and become white; and when one of the black sheep bleated, one of the white sheep would cross over and become black."en.wikisource.org
+"And he came towards a valley, through which ran a river; and the borders of the valley were wooded, and on each side of the river were level meadows. And on one side of the river he saw a flock of white sheep, and on the other a flock of black sheep. And whenever one of the white sheep bleated, one of the black sheep would cross over and become white; and when one of the black sheep bleated, one of the white sheep would cross over and become black." - Peredur the Son of Evrawc
 
-Initially each flock consists of n sheep. Each sheep (regardless of colour) is equally likely to be the next sheep to bleat. After a sheep has bleated and a sheep from the other flock has crossed over, Peredur may remove a number of white sheep in order to maximize the expected final number of black sheep. Let E(n) be the expected final number of black sheep if Peredur uses an optimal strategy.
+Initially, each flock consists of $n$ sheep. Each sheep (regardless of color) is equally likely to be the next sheep to bleat. After a sheep has bleated and a sheep from the other flock has crossed over, Peredur may remove a number of white sheep in order to maximize the expected final number of black sheep. Let $E(n)$ be the expected final number of black sheep if Peredur uses an optimal strategy.
 
-You are given that E(5) = 6.871346 rounded to 6 places behind the decimal point. Find E(10 000) and give your answer rounded to 6 places behind the decimal point.
+You are given that $E(5) = 6.871346$ rounded to 6 places behind the decimal point.
+
+Find $E(10\\,000)$ and give your answer rounded to 6 places behind the decimal point.
 
 # --hints--
 
-`euler339()` should return 19823.542204.
+`peredurFabEfrawg()` should return `19823.542204`.
 
 ```js
-assert.strictEqual(euler339(), 19823.542204);
+assert.strictEqual(peredurFabEfrawg(), 19823.542204);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler339(), 19823.542204);
 ## --seed-contents--
 
 ```js
-function euler339() {
+function peredurFabEfrawg() {
 
   return true;
 }
 
-euler339();
+peredurFabEfrawg();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md
index 080d068344e..784361d04c3 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f38e1000cf542c50fea1
-title: 'Problem 34: Digit factorials'
-challengeType: 5
+title: 'Probelma 34: Números factoriales'
+challengeType: 1
 forumTopicId: 301998
 dashedName: problem-34-digit-factorials
 ---
@@ -10,19 +10,19 @@ dashedName: problem-34-digit-factorials
 
 145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.
 
-Find the numbers and the sum of the numbers which are equal to the sum of the factorial of their digits.
+Encuentra los números y la suma de los números que son iguales a la suma factorial de sus dígitos.
 
 **Note:** as 1! = 1 and 2! = 2 are not sums they are not included.
 
 # --hints--
 
-`digitFactorial()` should return an object.
+`digitFactorial()` debería devolver un objeto.
 
 ```js
 assert.typeOf(digitFactorial(), 'object');
 ```
 
-`digitFactorial()` should return { sum: 40730, numbers: [145, 40585] }.
+`digitFactorial()` debería devolver { suma: 40730, números: [145, 40585] }.
 
 ```js
 assert.deepEqual(digitFactorial(), { sum: 40730, numbers: [145, 40585] });
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-340-crazy-function.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-340-crazy-function.md
index 86b29f061e2..72da02c1095 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-340-crazy-function.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-340-crazy-function.md
@@ -1,31 +1,30 @@
 ---
 id: 5900f4c21000cf542c50ffd4
 title: 'Problem 340: Crazy Function'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301999
 dashedName: problem-340-crazy-function
 ---
 
 # --description--
 
-For fixed integers a, b, c, define the crazy function F(n) as follows:
+For fixed integers $a$, $b$, $c$, define the crazy function $F(n)$ as follows:
 
-F(n) = n - c for all n > b
+$$\begin{align}   & F(n) = n - c \\;\text{ for all } n > b \\\\
+  & F(n) = F(a + F(a + F(a + F(a + n)))) \\;\text{ for all } n ≤ b. \end{align}$$
 
-F(n) = F(a + F(a + F(a + F(a + n)))) for all n ≤ b.
+Also, define $S(a, b, c) = \displaystyle\sum_{n = 0}^b F(n)$.
 
-Also, define S(a, b, c) = .
+For example, if $a = 50$, $b = 2000$ and $c = 40$, then $F(0) = 3240$ and $F(2000) = 2040$. Also, $S(50, 2000, 40) = 5\\,204\\,240$.
 
-For example, if a = 50, b = 2000 and c = 40, then F(0) = 3240 and F(2000) = 2040. Also, S(50, 2000, 40) = 5204240.
-
-Find the last 9 digits of S(217, 721, 127).
+Find the last 9 digits of $S({21}^7, 7^{21}, {12}^7)$.
 
 # --hints--
 
-`euler340()` should return 291504964.
+`crazyFunction()` should return `291504964`.
 
 ```js
-assert.strictEqual(euler340(), 291504964);
+assert.strictEqual(crazyFunction(), 291504964);
 ```
 
 # --seed--
@@ -33,12 +32,12 @@ assert.strictEqual(euler340(), 291504964);
 ## --seed-contents--
 
 ```js
-function euler340() {
+function crazyFunction() {
 
   return true;
 }
 
-euler340();
+crazyFunction();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md
index 740ef0d7518..f3ebbd9cdd0 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md
@@ -1,27 +1,30 @@
 ---
 id: 5900f4c11000cf542c50ffd3
 title: 'Problem 341: Golomb''s self-describing sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302000
 dashedName: problem-341-golombs-self-describing-sequence
 ---
 
 # --description--
 
-The Golomb's self-describing sequence {G(n)} is the only nondecreasing sequence of natural numbers such that n appears exactly G(n) times in the sequence. The values of G(n) for the first few n are
+The Golomb's self-describing sequence ($G(n)$) is the only nondecreasing sequence of natural numbers such that $n$ appears exactly $G(n)$ times in the sequence. The values of $G(n)$ for the first few $n$ are
 
-n123456789101112131415…G(n)122334445556666…
+$$\begin{array}{c}   n    & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 & 11 & 12 & 13 & 14 & 15 & \ldots \\\\
+  G(n) & 1 & 2 & 2 & 3 & 3 & 4 & 4 & 4 & 5 & 5  &  5 &  6 &  6 &  6 &  6 & \ldots \end{array}$$
 
-You are given that G(103) = 86, G(106) = 6137. You are also given that ΣG(n3) = 153506976 for 1 ≤ n &lt; 103.
+You are given that $G({10}^3) = 86$, $G({10}^6) = 6137$.
 
-Find ΣG(n3) for 1 ≤ n &lt; 106.
+You are also given that $\sum G(n^3) = 153\\,506\\,976$ for $1 ≤ n &lt; {10}^3$.
+
+Find $\sum G(n^3)$ for $1 ≤ n &lt; {10}^6$.
 
 # --hints--
 
-`euler341()` should return 56098610614277016.
+`golombsSequence()` should return `56098610614277016`.
 
 ```js
-assert.strictEqual(euler341(), 56098610614277016);
+assert.strictEqual(golombsSequence(), 56098610614277016);
 ```
 
 # --seed--
@@ -29,12 +32,12 @@ assert.strictEqual(euler341(), 56098610614277016);
 ## --seed-contents--
 
 ```js
-function euler341() {
+function golombsSequence() {
 
   return true;
 }
 
-euler341();
+golombsSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.md
index 2253ce390fb..85990bc5b54 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4c31000cf542c50ffd5
 title: 'Problem 342: The totient of a square is a cube'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302001
 dashedName: problem-342-the-totient-of-a-square-is-a-cube
 ---
@@ -10,20 +10,19 @@ dashedName: problem-342-the-totient-of-a-square-is-a-cube
 
 Consider the number 50.
 
-502 = 2500 = 22 × 54, so φ(2500) = 2 × 4 × 53 = 8 × 53 = 23 × 53. 1
+${50}^2 = 2500 = 2^2 × 5^4$, so $φ(2500) = 2 × 4 × 5^3 = 8 × 5^3 = 2^3 × 5^3$. $φ$ denotes Euler's totient function.
 
-So 2500 is a square and φ(2500) is a cube.
+So 2500 is a square and $φ(2500)$ is a cube.
 
-Find the sum of all numbers n, 1 &lt; n &lt; 1010 such that φ(n2) is a cube.
+Find the sum of all numbers $n$, $1 &lt; n &lt; {10}^{10}$ such that $φ(n^2)$ is a cube.
 
-1 φ denotes Euler's totient function.
 
 # --hints--
 
-`euler342()` should return 5943040885644.
+`totientOfSquare()` should return `5943040885644`.
 
 ```js
-assert.strictEqual(euler342(), 5943040885644);
+assert.strictEqual(totientOfSquare(), 5943040885644);
 ```
 
 # --seed--
@@ -31,12 +30,12 @@ assert.strictEqual(euler342(), 5943040885644);
 ## --seed-contents--
 
 ```js
-function euler342() {
+function totientOfSquare() {
 
   return true;
 }
 
-euler342();
+totientOfSquare();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-343-fractional-sequences.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-343-fractional-sequences.md
index 3102009e8c0..f284af9e94b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-343-fractional-sequences.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-343-fractional-sequences.md
@@ -1,39 +1,38 @@
 ---
 id: 5900f4c41000cf542c50ffd6
 title: 'Problem 343: Fractional Sequences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302002
 dashedName: problem-343-fractional-sequences
 ---
 
 # --description--
 
-For any positive integer k, a finite sequence ai of fractions xi/yi is defined by:
+For any positive integer $k$, a finite sequence $a_i$ of fractions $\frac{x_i}{y_i}$ is defined by:
 
-a1 = 1/k and
+- $a_1 = \displaystyle\frac{1}{k}$ and
+- $a_i = \displaystyle\frac{(x_{i - 1} + 1)}{(y_{i - 1} - 1)}$ reduced to lowest terms for $i > 1$.
 
-ai = (xi-1+1)/(yi-1-1) reduced to lowest terms for i>1.
+When $a_i$ reaches some integer $n$, the sequence stops. (That is, when $y_i = 1$.)
 
-When ai reaches some integer n, the sequence stops. (That is, when yi=1.)
+Define $f(k) = n$.
 
-Define f(k) = n.
+For example, for $k = 20$:
 
-For example, for k = 20:
+$$\frac{1}{20} → \frac{2}{19} → \frac{3}{18} = \frac{1}{6} → \frac{2}{5} → \frac{3}{4} → \frac{4}{3} → \frac{5}{2} → \frac{6}{1} = 6$$
 
-1/20 → 2/19 → 3/18 = 1/6 → 2/5 → 3/4 → 4/3 → 5/2 → 6/1 = 6
+So $f(20) = 6$.
 
-So f(20) = 6.
+Also $f(1) = 1$, $f(2) = 2$, $f(3) = 1$ and $\sum f(k^3) = 118\\,937$ for $1 ≤ k ≤ 100$.
 
-Also f(1) = 1, f(2) = 2, f(3) = 1 and Σf(k3) = 118937 for 1 ≤ k ≤ 100.
-
-Find Σf(k3) for 1 ≤ k ≤ 2×106.
+Find $\sum f(k^3)$ for $1 ≤ k ≤ 2 × {10}^6$.
 
 # --hints--
 
-`euler343()` should return 269533451410884200.
+`fractionalSequences()` should return `269533451410884200`.
 
 ```js
-assert.strictEqual(euler343(), 269533451410884200);
+assert.strictEqual(fractionalSequences(), 269533451410884200);
 ```
 
 # --seed--
@@ -41,12 +40,12 @@ assert.strictEqual(euler343(), 269533451410884200);
 ## --seed-contents--
 
 ```js
-function euler343() {
+function fractionalSequences() {
 
   return true;
 }
 
-euler343();
+fractionalSequences();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
index f4fb768b65b..0f9fcc5f2e6 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4c51000cf542c50ffd7
 title: 'Problem 344: Silver dollar game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302003
 dashedName: problem-344-silver-dollar-game
 ---
@@ -18,20 +18,22 @@ Alternatively, the player can choose to make the special move of pocketing the l
 
 The winner is the player who pockets the silver dollar.
 
+<img class="img-responsive center-block" alt="silver dollar game" src="https://cdn.freecodecamp.org/curriculum/project-euler/silver-dollar-game.gif" style="background-color: white; padding: 10px;" />
+
 A winning configuration is an arrangement of coins on the strip where the first player can force a win no matter what the second player does.
 
-Let W(n,c) be the number of winning configurations for a strip of n squares, c worthless coins and one silver dollar.
+Let $W(n, c)$ be the number of winning configurations for a strip of $n$ squares, $c$ worthless coins and one silver dollar.
 
-You are given that W(10,2) = 324 and W(100,10) = 1514704946113500.
+You are given that $W(10, 2) = 324$ and $W(100, 10) = 1\\,514\\,704\\,946\\,113\\,500$.
 
-Find W(1 000 000, 100) modulo the semiprime 1000 036 000 099 (= 1 000 003 · 1 000 033).
+Find $W(1\\,000\\,000, 100)$ modulo the semiprime $1000\\,036\\,000\\,099 (= 1\\,000\\,003 \times 1\\,000\\,033)$.
 
 # --hints--
 
-`euler344()` should return 65579304332.
+`silverDollarGame()` should return `65579304332`.
 
 ```js
-assert.strictEqual(euler344(), 65579304332);
+assert.strictEqual(silverDollarGame(), 65579304332);
 ```
 
 # --seed--
@@ -39,12 +41,12 @@ assert.strictEqual(euler344(), 65579304332);
 ## --seed-contents--
 
 ```js
-function euler344() {
+function silverDollarGame() {
 
   return true;
 }
 
-euler344();
+silverDollarGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md
index 9cb8157d07c..19aa26fd74f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md
@@ -1,27 +1,38 @@
 ---
 id: 5900f4c81000cf542c50ffda
 title: 'Problem 345: Matrix Sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302004
 dashedName: problem-345-matrix-sum
 ---
 
 # --description--
 
-We define the Matrix Sum of a matrix as the maximum sum of matrix elements with each element being the only one in his row and column. For example, the Matrix Sum of the matrix below equals 3315 ( = 863 + 383 + 343 + 959 + 767):
+We define the Matrix Sum of a matrix as the maximum sum of matrix elements with each element being the only one in his row and column.
 
-7 53 183 439 863 497 383 563 79 973 287 63 343 169 583 627 343 773 959 943767 473 103 699 303
+For example, the Matrix Sum of the matrix below equals $3315 ( = 863 + 383 + 343 + 959 + 767)$:
+
+$$\begin{array}{rrrrr}     7                &  53                & 183                & 439                & \color{lime}{863} \\\\
+  497                & \color{lime}{383} & 563                &  79                & 973 \\\\   287                &  63                & \color{lime}{343} & 169                & 583 \\\\
+  627                & 343                & 773                & \color{lime}{959} & 943 \\\\ \color{lime}{767} & 473                & 103                & 699                & 303 \end{array}$$
 
 Find the Matrix Sum of:
 
-7 53 183 439 863 497 383 563 79 973 287 63 343 169 583 627 343 773 959 943 767 473 103 699 303 957 703 583 639 913 447 283 463 29 23 487 463 993 119 883 327 493 423 159 743 217 623 3 399 853 407 103 983 89 463 290 516 212 462 350 960 376 682 962 300 780 486 502 912 800 250 346 172 812 350 870 456 192 162 593 473 915 45 989 873 823 965 425 329 803 973 965 905 919 133 673 665 235 509 613 673 815 165 992 326 322 148 972 962 286 255 941 541 265 323 925 281 601 95 973 445 721 11 525 473 65 511 164 138 672 18 428 154 448 848 414 456 310 312 798 104 566 520 302 248 694 976 430 392 198 184 829 373 181 631 101 969 613 840 740 778 458 284 760 390 821 461 843 513 17 901 711 993 293 157 274 94 192 156 574 34 124 4 878 450 476 712 914 838 669 875 299 823 329 699 815 559 813 459 522 788 168 586 966 232 308 833 251 631 107 813 883 451 509 615 77 281 613 459 205 380 274 302 35 805
+$$\\begin{array}{r}     7 &  53 & 183 & 439 & 863 & 497 & 383 & 563 &  79 & 973 & 287 &  63 & 343 & 169 & 583 \\\\
+  627 & 343 & 773 & 959 & 943 & 767 & 473 & 103 & 699 & 303 & 957 & 703 & 583 & 639 & 913 \\\\   447 & 283 & 463 &  29 &  23 & 487 & 463 & 993 & 119 & 883 & 327 & 493 & 423 & 159 & 743 \\\\
+  217 & 623 &   3 & 399 & 853 & 407 & 103 & 983 &  89 & 463 & 290 & 516 & 212 & 462 & 350 \\\\   960 & 376 & 682 & 962 & 300 & 780 & 486 & 502 & 912 & 800 & 250 & 346 & 172 & 812 & 350 \\\\
+  870 & 456 & 192 & 162 & 593 & 473 & 915 &  45 & 989 & 873 & 823 & 965 & 425 & 329 & 803 \\\\   973 & 965 & 905 & 919 & 133 & 673 & 665 & 235 & 509 & 613 & 673 & 815 & 165 & 992 & 326 \\\\
+  322 & 148 & 972 & 962 & 286 & 255 & 941 & 541 & 265 & 323 & 925 & 281 & 601 &  95 & 973 \\\\   445 & 721 &  11 & 525 & 473 &  65 & 511 & 164 & 138 & 672 &  18 & 428 & 154 & 448 & 848 \\\\
+  414 & 456 & 310 & 312 & 798 & 104 & 566 & 520 & 302 & 248 & 694 & 976 & 430 & 392 & 198 \\\\   184 & 829 & 373 & 181 & 631 & 101 & 969 & 613 & 840 & 740 & 778 & 458 & 284 & 760 & 390 \\\\
+  821 & 461 & 843 & 513 &  17 & 901 & 711 & 993 & 293 & 157 & 274 &  94 & 192 & 156 & 574 \\\\    34 & 124 &   4 & 878 & 450 & 476 & 712 & 914 & 838 & 669 & 875 & 299 & 823 & 329 & 699 \\\\
+  815 & 559 & 813 & 459 & 522 & 788 & 168 & 586 & 966 & 232 & 308 & 833 & 251 & 631 & 107 \\\\ 813 & 883 & 451 & 509 & 615 &  77 & 281 & 613 & 459 & 205 & 380 & 274 & 302 &  35 & 805 \end{array}$$
 
 # --hints--
 
-`euler345()` should return 13938.
+`matrixSum()` should return `13938`.
 
 ```js
-assert.strictEqual(euler345(), 13938);
+assert.strictEqual(matrixSum(), 13938);
 ```
 
 # --seed--
@@ -29,12 +40,12 @@ assert.strictEqual(euler345(), 13938);
 ## --seed-contents--
 
 ```js
-function euler345() {
+function matrixSum() {
 
   return true;
 }
 
-euler345();
+matrixSum();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md
index 49a1f6b2c25..98b7cc48b2f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4c71000cf542c50ffd8
 title: 'Problem 346: Strong Repunits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302005
 dashedName: problem-346-strong-repunits
 ---
 
 # --description--
 
-The number 7 is special, because 7 is 111 written in base 2, and 11 written in base 6 (i.e. 710 = 116 = 1112). In other words, 7 is a repunit in at least two bases b > 1.
+The number 7 is special, because 7 is 111 written in base 2, and 11 written in base 6 (i.e. $7_{10} = {11}_6 = {111}_2$). In other words, 7 is a repunit in at least two bases $b > 1$.
 
-We shall call a positive integer with this property a strong repunit. It can be verified that there are 8 strong repunits below 50: {1,7,13,15,21,31,40,43}. Furthermore, the sum of all strong repunits below 1000 equals 15864.
+We shall call a positive integer with this property a strong repunit. It can be verified that there are 8 strong repunits below 50: {1, 7, 13, 15, 21, 31, 40, 43}. Furthermore, the sum of all strong repunits below 1000 equals 15864.
 
-Find the sum of all strong repunits below 1012.
+Find the sum of all strong repunits below ${10}^{12}$.
 
 # --hints--
 
-`euler346()` should return 336108797689259260.
+`strongRepunits()` should return `336108797689259260`.
 
 ```js
-assert.strictEqual(euler346(), 336108797689259260);
+assert.strictEqual(strongRepunits(), 336108797689259260);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler346(), 336108797689259260);
 ## --seed-contents--
 
 ```js
-function euler346() {
+function strongRepunits() {
 
   return true;
 }
 
-euler346();
+strongRepunits();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.md
index 70845508fa3..3d4b3cb9fc2 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.md
@@ -1,31 +1,31 @@
 ---
 id: 5900f4c81000cf542c50ffd9
 title: 'Problem 347: Largest integer divisible by two primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302006
 dashedName: problem-347-largest-integer-divisible-by-two-primes
 ---
 
 # --description--
 
-The largest integer ≤ 100 that is only divisible by both the primes 2 and 3 is 96, as 96=32\*3=25\*3.
+The largest integer $≤ 100$ that is only divisible by both the primes 2 and 3 is 96, as $96 = 32 \times 3 = 2^5 \times 3$.
 
-For two distinct primes p and q let M(p,q,N) be the largest positive integer ≤N only divisible
+For two distinct primes $p$ and $q$ let $M(p, q, N)$ be the largest positive integer $≤ N$ only divisible by both $p$ and $q$ and $M(p, q, N)=0$ if such a positive integer does not exist.
 
-by both p and q and M(p,q,N)=0 if such a positive integer does not exist.
+E.g. $M(2, 3, 100) = 96$.
 
-E.g. M(2,3,100)=96. M(3,5,100)=75 and not 90 because 90 is divisible by 2 ,3 and 5. Also M(2,73,100)=0 because there does not exist a positive integer ≤ 100 that is divisible by both 2 and 73.
+$M(3, 5, 100) = 75$ and not 90 because 90 is divisible by 2, 3 and 5. Also $M(2, 73, 100) = 0$ because there does not exist a positive integer $≤ 100$ that is divisible by both 2 and 73.
 
-Let S(N) be the sum of all distinct M(p,q,N). S(100)=2262.
+Let $S(N)$ be the sum of all distinct $M(p, q, N)$. $S(100)=2262$.
 
-Find S(10 000 000).
+Encuentra $S(10\\,000\\,000)$.
 
 # --hints--
 
-`euler347()` should return 11109800204052.
+`integerDivisibleByTwoPrimes()` should return `11109800204052`.
 
 ```js
-assert.strictEqual(euler347(), 11109800204052);
+assert.strictEqual(integerDivisibleByTwoPrimes(), 11109800204052);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler347(), 11109800204052);
 ## --seed-contents--
 
 ```js
-function euler347() {
+function integerDivisibleByTwoPrimes() {
 
   return true;
 }
 
-euler347();
+integerDivisibleByTwoPrimes();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md
index 2fe6e2bc137..8e69b16ca7a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4c81000cf542c50ffdb
 title: 'Problem 348: Sum of a square and a cube'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302007
 dashedName: problem-348-sum-of-a-square-and-a-cube
 ---
@@ -10,16 +10,22 @@ dashedName: problem-348-sum-of-a-square-and-a-cube
 
 Many numbers can be expressed as the sum of a square and a cube. Some of them in more than one way.
 
-Consider the palindromic numbers that can be expressed as the sum of a square and a cube, both greater than 1, in exactly 4 different ways. For example, 5229225 is a palindromic number and it can be expressed in exactly 4 different ways: 22852 + 203 22232 + 663 18102 + 1253 11972 + 1563
+Consider the palindromic numbers that can be expressed as the sum of a square and a cube, both greater than 1, in exactly 4 different ways.
+
+For example, 5229225 is a palindromic number and it can be expressed in exactly 4 different ways:
+
+$$\begin{align}   & {2285}^2 + {20}^3 \\\\
+  & {2223}^2 + {66}^3 \\\\   & {1810}^2 + {125}^3 \\\\
+  & {1197}^2 + {156}^3 \end{align}$$
 
 Find the sum of the five smallest such palindromic numbers.
 
 # --hints--
 
-`euler348()` should return 1004195061.
+`sumOfSquareAndCube()` should return `1004195061`.
 
 ```js
-assert.strictEqual(euler348(), 1004195061);
+assert.strictEqual(sumOfSquareAndCube(), 1004195061);
 ```
 
 # --seed--
@@ -27,12 +33,12 @@ assert.strictEqual(euler348(), 1004195061);
 ## --seed-contents--
 
 ```js
-function euler348() {
+function sumOfSquareAndCube() {
 
   return true;
 }
 
-euler348();
+sumOfSquareAndCube();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-349-langtons-ant.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-349-langtons-ant.md
index 239ba5a6a18..71fe17860a2 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-349-langtons-ant.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-349-langtons-ant.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4ca1000cf542c50ffdc
 title: 'Problem 349: Langton''s ant'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302008
 dashedName: problem-349-langtons-ant
 ---
@@ -12,18 +12,17 @@ An ant moves on a regular grid of squares that are coloured either black or whit
 
 The ant is always oriented in one of the cardinal directions (left, right, up or down) and moves from square to adjacent square according to the following rules:
 
-\- if it is on a black square, it flips the color of the square to white, rotates 90 degrees counterclockwise and moves forward one square.
+- if it is on a black square, it flips the color of the square to white, rotates 90° counterclockwise and moves forward one square.
+- if it is on a white square, it flips the color of the square to black, rotates 90° clockwise and moves forward one square.
 
-\- if it is on a white square, it flips the color of the square to black, rotates 90 degrees clockwise and moves forward one square.
-
-Starting with a grid that is entirely white, how many squares are black after 10<sup>18</sup> moves of the ant?
+Starting with a grid that is entirely white, how many squares are black after ${10}^{18}$ moves of the ant?
 
 # --hints--
 
-`euler349()` should return 115384615384614940.
+`langtonsAnt()` should return `115384615384614940`.
 
 ```js
-assert.strictEqual(euler349(), 115384615384614940);
+assert.strictEqual(langtonsAnt(), 115384615384614940);
 ```
 
 # --seed--
@@ -31,12 +30,12 @@ assert.strictEqual(euler349(), 115384615384614940);
 ## --seed-contents--
 
 ```js
-function euler349() {
+function langtonsAnt() {
 
   return true;
 }
 
-euler349();
+langtonsAnt();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-35-circular-primes.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-35-circular-primes.md
index d3d74989d65..aaae9562bb0 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-35-circular-primes.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-35-circular-primes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f38f1000cf542c50fea2
 title: 'Problem 35: Circular primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302009
 dashedName: problem-35-circular-primes
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md
index ebc52998b58..aae8f4a107b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f4cb1000cf542c50ffdd
 title: 'Problem 350: Constraining the least greatest and the greatest least'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302010
 dashedName: problem-350-constraining-the-least-greatest-and-the-greatest-least
 ---
 
 # --description--
 
-A list of size n is a sequence of n natural numbers. Examples are (2,4,6), (2,6,4), (10,6,15,6), and (11).
+A list of size $n$ is a sequence of $n$ natural numbers. Examples are (2, 4, 6), (2, 6, 4), (10, 6, 15, 6), and (11).
 
-The greatest common divisor, or gcd, of a list is the largest natural number that divides all entries of the list. Examples: gcd(2,6,4) = 2, gcd(10,6,15,6) = 1 and gcd(11) = 11.
+The greatest common divisor, or $gcd$, of a list is the largest natural number that divides all entries of the list. Examples: $gcd(2, 6, 4) = 2$, $gcd(10, 6, 15, 6) = 1$ and $gcd(11) = 11$.
 
-The least common multiple, or lcm, of a list is the smallest natural number divisible by each entry of the list. Examples: lcm(2,6,4) = 12, lcm(10,6,15,6) = 30 and lcm(11) = 11.
+The least common multiple, or $lcm$, of a list is the smallest natural number divisible by each entry of the list. Examples: $lcm(2, 6, 4) = 12$, $lcm(10, 6, 15, 6) = 30$ and $lcm(11) = 11$.
 
-Let f(G, L, N) be the number of lists of size N with gcd ≥ G and lcm ≤ L. For example:
+Let $f(G, L, N)$ be the number of lists of size $N$ with $gcd ≥ G$ and $lcm ≤ L$. Por ejemplo:
 
-f(10, 100, 1) = 91. f(10, 100, 2) = 327. f(10, 100, 3) = 1135. f(10, 100, 1000) mod 1014 = 3286053.
+$$\begin{align}   & f(10, 100, 1) = 91 \\\\
+  & f(10, 100, 2) = 327 \\\\   & f(10, 100, 3) = 1135 \\\\
+  & f(10, 100, 1000)\bmod {101}^4 = 3\\,286\\,053 \end{align}$$
 
-Find f(106, 1012, 1018) mod 1014.
+Find $f({10}^6, {10}^{12}, {10}^{18})\bmod {101}^4$.
 
 # --hints--
 
-`euler350()` should return 84664213.
+`leastGreatestAndGreatestLeast()` should return `84664213`.
 
 ```js
-assert.strictEqual(euler350(), 84664213);
+assert.strictEqual(leastGreatestAndGreatestLeast(), 84664213);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler350(), 84664213);
 ## --seed-contents--
 
 ```js
-function euler350() {
+function leastGreatestAndGreatestLeast() {
 
   return true;
 }
 
-euler350();
+leastGreatestAndGreatestLeast();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md
index 33f0089171f..4a0915472d2 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md
@@ -1,29 +1,31 @@
 ---
 id: 5900f4cb1000cf542c50ffde
 title: 'Problem 351: Hexagonal orchards'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302011
 dashedName: problem-351-hexagonal-orchards
 ---
 
 # --description--
 
-A hexagonal orchard of order n is a triangular lattice made up of points within a regular hexagon with side n. The following is an example of a hexagonal orchard of order 5:
+A hexagonal orchard of order $n$ is a triangular lattice made up of points within a regular hexagon with side $n$. The following is an example of a hexagonal orchard of order 5:
+
+<img class="img-responsive center-block" alt="hexagonal orchard of order 5, with highlighted in green points, which are hidden from the center by a point closer to it" src="https://cdn.freecodecamp.org/curriculum/project-euler/hexagonal-orchards.png" style="background-color: white; padding: 10px;" />
 
 Highlighted in green are the points which are hidden from the center by a point closer to it. It can be seen that for a hexagonal orchard of order 5, 30 points are hidden from the center.
 
-Let H(n) be the number of points hidden from the center in a hexagonal orchard of order n.
+Let $H(n)$ be the number of points hidden from the center in a hexagonal orchard of order $n$.
 
-H(5) = 30. H(10) = 138. H(1 000) = 1177848.
+$H(5) = 30$. $H(10) = 138$. $H(1\\,000)$ = $1\\,177\\,848$.
 
-Find H(100 000 000).
+Encuentra $H(100\\,000\\,000)$.
 
 # --hints--
 
-`euler351()` should return 11762187201804552.
+`hexagonalOrchards()` should return `11762187201804552`.
 
 ```js
-assert.strictEqual(euler351(), 11762187201804552);
+assert.strictEqual(hexagonalOrchards(), 11762187201804552);
 ```
 
 # --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler351(), 11762187201804552);
 ## --seed-contents--
 
 ```js
-function euler351() {
+function hexagonalOrchards() {
 
   return true;
 }
 
-euler351();
+hexagonalOrchards();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-352-blood-tests.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-352-blood-tests.md
index 76af2f075c8..09a94b72f67 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-352-blood-tests.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-352-blood-tests.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4cd1000cf542c50ffdf
 title: 'Problem 352: Blood tests'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302012
 dashedName: problem-352-blood-tests
 ---
@@ -12,28 +12,42 @@ Each one of the 25 sheep in a flock must be tested for a rare virus, known to af
 
 An accurate and extremely sensitive PCR test exists for blood samples, producing a clear positive / negative result, but it is very time-consuming and expensive.
 
-Because of the high cost, the vet-in-charge suggests that instead of performing 25 separate tests, the following procedure can be used instead: The sheep are split into 5 groups of 5 sheep in each group. For each group, the 5 samples are mixed together and a single test is performed. Then, If the result is negative, all the sheep in that group are deemed to be virus-free. If the result is positive, 5 additional tests will be performed (a separate test for each animal) to determine the affected individual(s).
+Because of the high cost, the vet-in-charge suggests that instead of performing 25 separate tests, the following procedure can be used instead:
 
-Since the probability of infection for any specific animal is only 0.02, the first test (on the pooled samples) for each group will be: Negative (and no more tests needed) with probability 0.985 = 0.9039207968. Positive (5 additional tests needed) with probability 1 - 0.9039207968 = 0.0960792032.
+The sheep are split into 5 groups of 5 sheep in each group. For each group, the 5 samples are mixed together and a single test is performed. Luego,
 
-Thus, the expected number of tests for each group is 1 + 0.0960792032 × 5 = 1.480396016. Consequently, all 5 groups can be screened using an average of only 1.480396016 × 5 = 7.40198008 tests, which represents a huge saving of more than 70% !
+- If the result is negative, all the sheep in that group are deemed to be virus-free.
+- If the result is positive, 5 additional tests will be performed (a separate test for each animal) to determine the affected individual(s).
 
-Although the scheme we have just described seems to be very efficient, it can still be improved considerably (always assuming that the test is sufficiently sensitive and that there are no adverse effects caused by mixing different samples). E.g.: We may start by running a test on a mixture of all the 25 samples. It can be verified that in about 60.35% of the cases this test will be negative, thus no more tests will be needed. Further testing will only be required for the remaining 39.65% of the cases. If we know that at least one animal in a group of 5 is infected and the first 4 individual tests come out negative, there is no need to run a test on the fifth animal (we know that it must be infected). We can try a different number of groups / different number of animals in each group, adjusting those numbers at each level so that the total expected number of tests will be minimised.
+Since the probability of infection for any specific animal is only 0.02, the first test (on the pooled samples) for each group will be:
+
+- Negative (and no more tests needed) with probability ${0.98}^5 = 0.9039207968$.
+- Positive (5 additional tests needed) with probability $1 - 0.9039207968 = 0.0960792032$.
+
+Thus, the expected number of tests for each group is $1 + 0.0960792032 × 5 = 1.480396016$.
+
+Consequently, all 5 groups can be screened using an average of only $1.480396016 × 5 = \mathbf{7.40198008}$ tests, which represents a huge saving of more than 70%!
+
+Although the scheme we have just described seems to be very efficient, it can still be improved considerably (always assuming that the test is sufficiently sensitive and no adverse effects are caused by mixing different samples). E.g.:
+
+- We may start by running a test on a mixture of all the 25 samples. It can be verified that in about 60.35% of the cases this test will be negative, thus no more tests will be needed. Further testing will only be required for the remaining 39.65% of the cases.
+- If we know that at least one animal in a group of 5 is infected and the first 4 individual tests come out negative, there is no need to run a test on the fifth animal (we know that it must be infected).
+- We can try a different number of groups / different number of animals in each group, adjusting those numbers at each level so that the total expected number of tests will be minimised.
 
 To simplify the very wide range of possibilities, there is one restriction we place when devising the most cost-efficient testing scheme: whenever we start with a mixed sample, all the sheep contributing to that sample must be fully screened (i.e. a verdict of infected / virus-free must be reached for all of them) before we start examining any other animals.
 
-For the current example, it turns out that the most cost-efficient testing scheme (we'll call it the optimal strategy) requires an average of just 4.155452 tests!
+For the current example, it turns out that the most cost-efficient testing scheme (we'll call it the optimal strategy) requires an average of just <strong>4.155452</strong> tests!
 
-Using the optimal strategy, let T(s,p) represent the average number of tests needed to screen a flock of s sheep for a virus having probability p to be present in any individual. Thus, rounded to six decimal places, T(25, 0.02) = 4.155452 and T(25, 0.10) = 12.702124.
+Using the optimal strategy, let $T(s, p)$ represent the average number of tests needed to screen a flock of $s$ sheep for a virus having probability $p$ to be present in any individual. Thus, rounded to six decimal places, $T(25, 0.02) = 4.155452$ and $T(25, 0.10) = 12.702124$.
 
-Find ΣT(10000, p) for p=0.01, 0.02, 0.03, ... 0.50. Give your answer rounded to six decimal places.
+Find $\sum T(10\\,000, p)$ for $p = 0.01, 0.02, 0.03, \ldots 0.50$. Give your answer rounded to six decimal places.
 
 # --hints--
 
-`euler352()` should return 378563.260589.
+`bloodTests()` should return `378563.260589`.
 
 ```js
-assert.strictEqual(euler352(), 378563.260589);
+assert.strictEqual(bloodTests(), 378563.260589);
 ```
 
 # --seed--
@@ -41,12 +55,12 @@ assert.strictEqual(euler352(), 378563.260589);
 ## --seed-contents--
 
 ```js
-function euler352() {
+function bloodTests() {
 
   return true;
 }
 
-euler352();
+bloodTests();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-353-risky-moon.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-353-risky-moon.md
index 74faf24c26f..83cb0d40c9e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-353-risky-moon.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-353-risky-moon.md
@@ -1,35 +1,37 @@
 ---
 id: 5900f4cd1000cf542c50ffe0
 title: 'Problem 353: Risky moon'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302013
 dashedName: problem-353-risky-moon
 ---
 
 # --description--
 
-A moon could be described by the sphere C(r) with centre (0,0,0) and radius r.
+A moon could be described by the sphere $C(r)$ with centre (0, 0, 0) and radius $r$.
 
-There are stations on the moon at the points on the surface of C(r) with integer coordinates. The station at (0,0,r) is called North Pole station, the station at (0,0,-r) is called South Pole station.
+There are stations on the moon at the points on the surface of $C(r)$ with integer coordinates. The station at (0, 0, $r$) is called North Pole station, the station at (0, 0, $-r$) is called South Pole station.
 
-All stations are connected with each other via the shortest road on the great arc through the stations. A journey between two stations is risky. If d is the length of the road between two stations, (d/(π r))2 is a measure for the risk of the journey (let us call it the risk of the road). If the journey includes more than two stations, the risk of the journey is the sum of risks of the used roads.
+All stations are connected with each other via the shortest road on the great arc through the stations. A journey between two stations is risky. If $d$ is the length of the road between two stations, $\{\left(\frac{d}{πr}\right)}^2$ is a measure for the risk of the journey (let us call it the risk of the road). If the journey includes more than two stations, the risk of the journey is the sum of risks of the used roads.
 
-A direct journey from the North Pole station to the South Pole station has the length πr and risk 1. The journey from the North Pole station to the South Pole station via (0,r,0) has the same length, but a smaller risk: (½πr/(πr))2+(½πr/(πr))2=0.5.
+A direct journey from the North Pole station to the South Pole station has the length $πr$ and risk 1. The journey from the North Pole station to the South Pole station via (0, $r$, 0) has the same length, but a smaller risk:
 
-The minimal risk of a journey from the North Pole station to the South Pole station on C(r) is M(r).
+$${\left(\frac{\frac{1}{2}πr}{πr}\right)}^2+{\left(\frac{\frac{1}{2}πr}{πr}\right)}^2 = 0.5$$
 
-You are given that M(7)=0.1784943998 rounded to 10 digits behind the decimal point.
+The minimal risk of a journey from the North Pole station to the South Pole station on $C(r)$ is $M(r)$.
 
-Find ∑M(2n-1) for 1≤n≤15.
+You are given that $M(7) = 0.178\\,494\\,399\\,8$ rounded to 10 digits behind the decimal point.
+
+Find $\displaystyle\sum_{n = 1}^{15} M(2^n - 1)$.
 
 Give your answer rounded to 10 digits behind the decimal point in the form a.bcdefghijk.
 
 # --hints--
 
-`euler353()` should return 1.2759860331.
+`riskyMoon()` should return `1.2759860331`.
 
 ```js
-assert.strictEqual(euler353(), 1.2759860331);
+assert.strictEqual(riskyMoon(), 1.2759860331);
 ```
 
 # --seed--
@@ -37,12 +39,12 @@ assert.strictEqual(euler353(), 1.2759860331);
 ## --seed-contents--
 
 ```js
-function euler353() {
+function riskyMoon() {
 
   return true;
 }
 
-euler353();
+riskyMoon();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md
index 346a1af4515..f7d023146ca 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4cf1000cf542c50ffe1
 title: 'Problem 354: Distances in a bee''s honeycomb'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302014
 dashedName: problem-354-distances-in-a-bees-honeycomb
 ---
@@ -10,16 +10,20 @@ dashedName: problem-354-distances-in-a-bees-honeycomb
 
 Consider a honey bee's honeycomb where each cell is a perfect regular hexagon with side length 1.
 
-One particular cell is occupied by the queen bee. For a positive real number L, let B(L) count the cells with distance L from the queen bee cell (all distances are measured from centre to centre); you may assume that the honeycomb is large enough to accommodate for any distance we wish to consider. For example, B(√3) = 6, B(√21) = 12 and B(111 111 111) = 54.
+<img class="img-responsive center-block" alt="honeycomb with hexagon sides of length 1" src="https://cdn.freecodecamp.org/curriculum/project-euler/distances-in-a-bees-honeycomb.png" style="background-color: white; padding: 10px;" />
 
-Find the number of L ≤ 5·1011 such that B(L) = 450.
+One particular cell is occupied by the queen bee. For a positive real number $L$, let $B(L)$ count the cells with distance $L$ from the queen bee cell (all distances are measured from centre to centre); you may assume that the honeycomb is large enough to accommodate for any distance we wish to consider.
+
+For example, $B(\sqrt{3}) = 6$, $B(\sqrt{21}) = 12$ and $B(111\\,111\\,111) = 54$.
+
+Find the number of $L ≤ 5 \times {10}^{11}$ such that $B(L) = 450$.
 
 # --hints--
 
-`euler354()` should return 58065134.
+`distancesInHoneycomb()` should return `58065134`.
 
 ```js
-assert.strictEqual(euler354(), 58065134);
+assert.strictEqual(distancesInHoneycomb(), 58065134);
 ```
 
 # --seed--
@@ -27,12 +31,12 @@ assert.strictEqual(euler354(), 58065134);
 ## --seed-contents--
 
 ```js
-function euler354() {
+function distancesInHoneycomb() {
 
   return true;
 }
 
-euler354();
+distancesInHoneycomb();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.md
index a166a1057ac..a7e2179ec87 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4d01000cf542c50ffe2
 title: 'Problem 355: Maximal coprime subset'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302015
 dashedName: problem-355-maximal-coprime-subset
 ---
 
 # --description--
 
-Define Co(n) to be the maximal possible sum of a set of mutually co-prime elements from {1, 2, ..., n}. For example Co(10) is 30 and hits that maximum on the subset {1, 5, 7, 8, 9}.
+Define $Co(n)$ to be the maximal possible sum of a set of mutually co-prime elements from $\\{1, 2, \ldots, n\\}$. For example $Co(10)$ is 30 and hits that maximum on the subset $\\{1, 5, 7, 8, 9\\}$.
 
-You are given that Co(30) = 193 and Co(100) = 1356.
+You are given that $Co(30) = 193$ and $Co(100) = 1356$.
 
-Find Co(200000).
+Find $Co(200\\,000)$.
 
 # --hints--
 
-`euler355()` should return 1726545007.
+`maximalCoprimeSubset()` should return `1726545007`.
 
 ```js
-assert.strictEqual(euler355(), 1726545007);
+assert.strictEqual(maximalCoprimeSubset(), 1726545007);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler355(), 1726545007);
 ## --seed-contents--
 
 ```js
-function euler355() {
+function maximalCoprimeSubset() {
 
   return true;
 }
 
-euler355();
+maximalCoprimeSubset();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
index 9027dcecf96..ec4939b68f1 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4d01000cf542c50ffe3
 title: 'Problem 356: Largest roots of cubic polynomials'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302016
 dashedName: problem-356-largest-roots-of-cubic-polynomials
 ---
 
 # --description--
 
-Let an be the largest real root of a polynomial g(x) = x3 - 2n·x2 + n.
+Let $a_n$ be the largest real root of a polynomial $g(x) = x^3 - 2^n \times x^2 + n$.
 
-For example, a2 = 3.86619826...
+For example, $a_2 = 3.86619826\ldots$
 
-Find the last eight digits of.
+Find the last eight digits of $\displaystyle\sum_{i = 1}^{30} \lfloor {a_i}^{987654321}\rfloor$.
 
-Note: represents the floor function.
+**Note:** $\lfloor a\rfloor$ represents the floor function.
 
 # --hints--
 
-`euler356()` should return 28010159.
+`rootsOfCubicPolynomials()` should return `28010159`.
 
 ```js
-assert.strictEqual(euler356(), 28010159);
+assert.strictEqual(rootsOfCubicPolynomials(), 28010159);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler356(), 28010159);
 ## --seed-contents--
 
 ```js
-function euler356() {
+function rootsOfCubicPolynomials() {
 
   return true;
 }
 
-euler356();
+rootsOfCubicPolynomials();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-357-prime-generating-integers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-357-prime-generating-integers.md
index 1bb3f094a21..003fc35bdd6 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-357-prime-generating-integers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-357-prime-generating-integers.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4d11000cf542c50ffe4
 title: 'Problem 357: Prime generating integers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302017
 dashedName: problem-357-prime-generating-integers
 ---
 
 # --description--
 
-Consider the divisors of 30: 1,2,3,5,6,10,15,30.
+Consider the divisors of 30: 1, 2, 3, 5, 6, 10, 15, 30.
 
-It can be seen that for every divisor d of 30, d+30/d is prime.
+It can be seen that for every divisor $d$ of 30, $d + \frac{30}{d}$ is prime.
 
-Find the sum of all positive integers n not exceeding 100 000 000such that for every divisor d of n, d+n/d is prime.
+Find the sum of all positive integers $n$ not exceeding $100\\,000\\,000$ such that for every divisor $d$ of $n$, $d + \frac{n}{d}$ is prime.
 
 # --hints--
 
-`euler357()` should return 1739023853137.
+`primeGeneratingIntegers()` should return `1739023853137`.
 
 ```js
-assert.strictEqual(euler357(), 1739023853137);
+assert.strictEqual(primeGeneratingIntegers(), 1739023853137);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler357(), 1739023853137);
 ## --seed-contents--
 
 ```js
-function euler357() {
+function primeGeneratingIntegers() {
 
   return true;
 }
 
-euler357();
+primeGeneratingIntegers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md
index fb08a667a8b..9a7f94d3bff 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md
@@ -1,31 +1,40 @@
 ---
 id: 5900f4d21000cf542c50ffe5
 title: 'Problem 358: Cyclic numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302018
 dashedName: problem-358-cyclic-numbers
 ---
 
 # --description--
 
-A cyclic number with n digits has a very interesting property:
+A cyclic number with $n$ digits has a very interesting property:
 
-When it is multiplied by 1, 2, 3, 4, ... n, all the products have exactly the same digits, in the same order, but rotated in a circular fashion!
+When it is multiplied by 1, 2, 3, 4, ... $n$, all the products have exactly the same digits, in the same order, but rotated in a circular fashion!
 
-The smallest cyclic number is the 6-digit number 142857 : 142857 × 1 = 142857 142857 × 2 = 285714 142857 × 3 = 428571 142857 × 4 = 571428 142857 × 5 = 714285 142857 × 6 = 857142
+The smallest cyclic number is the 6-digit number 142857:
 
-The next cyclic number is 0588235294117647 with 16 digits : 0588235294117647 × 1 = 0588235294117647 0588235294117647 × 2 = 1176470588235294 0588235294117647 × 3 = 1764705882352941 ... 0588235294117647 × 16 = 9411764705882352
+$$\begin{align}   & 142857 × 1 = 142857 \\\\
+  & 142857 × 2 = 285714 \\\\   & 142857 × 3 = 428571 \\\\
+  & 142857 × 4 = 571428 \\\\   & 142857 × 5 = 714285 \\\\
+  & 142857 × 6 = 857142 \end{align}$$
+
+The next cyclic number is 0588235294117647 with 16 digits:
+
+$$\begin{align}   & 0588235294117647 × 1 = 0588235294117647 \\\\
+  & 0588235294117647 × 2 = 1176470588235294 \\\\   & 0588235294117647 × 3 = 1764705882352941 \\\\
+  & \ldots \\\\ & 0588235294117647 × 16 = 9411764705882352 \end{align}$$
 
 Note that for cyclic numbers, leading zeros are important.
 
-There is only one cyclic number for which, the eleven leftmost digits are 00000000137 and the five rightmost digits are 56789 (i.e., it has the form 00000000137...56789 with an unknown number of digits in the middle). Find the sum of all its digits.
+There is only one cyclic number for which, the eleven leftmost digits are 00000000137 and the five rightmost digits are 56789 (i.e., it has the form $00000000137\ldots56789$ with an unknown number of digits in the middle). Find the sum of all its digits.
 
 # --hints--
 
-`euler358()` should return 3284144505.
+`cyclicNumbers()` should return `3284144505`.
 
 ```js
-assert.strictEqual(euler358(), 3284144505);
+assert.strictEqual(cyclicNumbers(), 3284144505);
 ```
 
 # --seed--
@@ -33,12 +42,12 @@ assert.strictEqual(euler358(), 3284144505);
 ## --seed-contents--
 
 ```js
-function euler358() {
+function cyclicNumbers() {
 
   return true;
 }
 
-euler358();
+cyclicNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md
index 971ae0f4012..0cfd6a75f09 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4d31000cf542c50ffe6
 title: 'Problem 359: Hilbert''s New Hotel'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302019
 dashedName: problem-359-hilberts-new-hotel
 ---
@@ -10,22 +10,36 @@ dashedName: problem-359-hilberts-new-hotel
 
 An infinite number of people (numbered 1, 2, 3, etc.) are lined up to get a room at Hilbert's newest infinite hotel. The hotel contains an infinite number of floors (numbered 1, 2, 3, etc.), and each floor contains an infinite number of rooms (numbered 1, 2, 3, etc.).
 
-Initially the hotel is empty. Hilbert declares a rule on how the nth person is assigned a room: person n gets the first vacant room in the lowest numbered floor satisfying either of the following: the floor is empty the floor is not empty, and if the latest person taking a room in that floor is person m, then m + n is a perfect square
+Initially the hotel is empty. Hilbert declares a rule on how the $n^{\text{th}}$ person is assigned a room: person $n$ gets the first vacant room in the lowest numbered floor satisfying either of the following:
 
-Person 1 gets room 1 in floor 1 since floor 1 is empty. Person 2 does not get room 2 in floor 1 since 1 + 2 = 3 is not a perfect square. Person 2 instead gets room 1 in floor 2 since floor 2 is empty. Person 3 gets room 2 in floor 1 since 1 + 3 = 4 is a perfect square.
+- the floor is empty
+- the floor is not empty, and if the latest person taking a room in that floor is person $m$, then $m + n$ is a perfect square
+
+Person 1 gets room 1 in floor 1 since floor 1 is empty.
+
+Person 2 does not get room 2 in floor 1 since 1 + 2 = 3 is not a perfect square.
+
+Person 2 instead gets room 1 in floor 2 since floor 2 is empty.
+
+Person 3 gets room 2 in floor 1 since 1 + 3 = 4 is a perfect square.
 
 Eventually, every person in the line gets a room in the hotel.
 
-Define P(f, r) to be n if person n occupies room r in floor f, and 0 if no person occupies the room. Here are a few examples: P(1, 1) = 1 P(1, 2) = 3 P(2, 1) = 2 P(10, 20) = 440 P(25, 75) = 4863 P(99, 100) = 19454
+Define $P(f, r)$ to be $n$ if person $n$ occupies room $r$ in floor $f$, and 0 if no person occupies the room. Here are a few examples:
 
-Find the sum of all P(f, r) for all positive f and r such that f × r = 71328803586048 and give the last 8 digits as your answer.
+$$\begin{align}   & P(1, 1) = 1 \\\\
+  & P(1, 2) = 3 \\\\   & P(2, 1) = 2 \\\\
+  & P(10, 20) = 440 \\\\   & P(25, 75) = 4863 \\\\
+  & P(99, 100) = 19454 \end{align}$$
+
+Find the sum of all $P(f, r)$ for all positive $f$ and $r$ such that $f × r = 71\\,328\\,803\\,586\\,048$ and give the last 8 digits as your answer.
 
 # --hints--
 
-`euler359()` should return 40632119.
+`hilbertsNewHotel()` should return `40632119`.
 
 ```js
-assert.strictEqual(euler359(), 40632119);
+assert.strictEqual(hilbertsNewHotel(), 40632119);
 ```
 
 # --seed--
@@ -33,12 +47,12 @@ assert.strictEqual(euler359(), 40632119);
 ## --seed-contents--
 
 ```js
-function euler359() {
+function hilbertsNewHotel() {
 
   return true;
 }
 
-euler359();
+hilbertsNewHotel();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-36-double-base-palindromes.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-36-double-base-palindromes.md
index 359211b5301..9793d760c20 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-36-double-base-palindromes.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-36-double-base-palindromes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3901000cf542c50fea3
 title: 'Problem 36: Double-base palindromes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302020
 dashedName: problem-36-double-base-palindromes
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-360-scary-sphere.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-360-scary-sphere.md
index f028a5d58be..932a0a9dc4e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-360-scary-sphere.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-360-scary-sphere.md
@@ -1,27 +1,31 @@
 ---
 id: 5900f4d41000cf542c50ffe7
 title: 'Problem 360: Scary Sphere'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302021
 dashedName: problem-360-scary-sphere
 ---
 
 # --description--
 
-Given two points (x1,y1,z1) and (x2,y2,z2) in three dimensional space, the Manhattan distance between those points is defined as |x1-x2|+|y1-y2|+|z1-z2|.
+Given two points ($x_1$, $y_1$, $z_1$) and ($x_2$, $y_2$, $z_2$) in three dimensional space, the Manhattan distance between those points is defined as $|x_1 - x_2| + |y_1 - y_2| + |z_1 - z_2|$.
 
-Let C(r) be a sphere with radius r and center in the origin O(0,0,0). Let I(r) be the set of all points with integer coordinates on the surface of C(r). Let S(r) be the sum of the Manhattan distances of all elements of I(r) to the origin O.
+Let $C(r)$ be a sphere with radius $r$ and center in the origin $O(0, 0, 0)$.
 
-E.g. S(45)=34518.
+Let $I(r)$ be the set of all points with integer coordinates on the surface of $C(r)$.
 
-Find S(1010).
+Let $S(r)$ be the sum of the Manhattan distances of all elements of $I(r)$ to the origin $O$.
+
+E.g. $S(45)=34518$.
+
+Find $S({10}^{10})$.
 
 # --hints--
 
-`euler360()` should return 878825614395267100.
+`scarySphere()` should return `878825614395267100`.
 
 ```js
-assert.strictEqual(euler360(), 878825614395267100);
+assert.strictEqual(scarySphere(), 878825614395267100);
 ```
 
 # --seed--
@@ -29,12 +33,12 @@ assert.strictEqual(euler360(), 878825614395267100);
 ## --seed-contents--
 
 ```js
-function euler360() {
+function scarySphere() {
 
   return true;
 }
 
-euler360();
+scarySphere();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md
index bc131597891..efae1fb220c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md
@@ -1,37 +1,38 @@
 ---
 id: 5900f4d51000cf542c50ffe8
 title: 'Problem 361: Subsequence of Thue-Morse sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302022
 dashedName: problem-361-subsequence-of-thue-morse-sequence
 ---
 
 # --description--
 
-The Thue-Morse sequence {Tn} is a binary sequence satisfying:
+The Thue-Morse sequence $\\{T_n\\}$ is a binary sequence satisfying:
 
-T0 = 0
+- $T_0 = 0$
+- $T_{2n} = T_n$
+- $T_{2n + 1} = 1 - T_n$
 
-T2n = Tn
+The first several terms of $\\{T_n\\}$ are given as follows: $01101001\color{red}{10010}1101001011001101001\ldots$.
 
-T2n+1 = 1 - Tn
+We define $\\{A_n\\}$ as the sorted sequence of integers such that the binary expression of each element appears as a subsequence in $\\{T_n\\}$. For example, the decimal number 18 is expressed as 10010 in binary. 10010 appears in $\\{T_n\\}$ ($T_8$ to $T_{12}$), so 18 is an element of $\\{A_n\\}$. The decimal number 14 is expressed as 1110 in binary. 1110 never appears in $\\{T_n\\}$, so 14 is not an element of $\\{A_n\\}$.
 
-The first several terms of {Tn} are given as follows: 01101001100101101001011001101001....
+The first several terms of $A_n$ are given as follows:
 
-We define {An} as the sorted sequence of integers such that the binary expression of each element appears as a subsequence in {Tn}. For example, the decimal number 18 is expressed as 10010 in binary. 10010 appears in {Tn} (T8 to T12), so 18 is an element of {An}. The decimal number 14 is expressed as 1110 in binary. 1110 never appears in {Tn}, so 14 is not an element of {An}.
+$$\begin{array}{cr}   n   & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 &  8 &  9 & 10 & 11 & 12 & \ldots \\\\
+  A_n & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 9 & 10 & 11 & 12 & 13 & 18 & \ldots \end{array}$$
 
-The first several terms of An are given as follows: n0123456789101112…An012345691011121318…
+We can also verify that $A_{100} = 3251$ and $A_{1000} = 80\\,852\\,364\\,498$.
 
-We can also verify that A100 = 3251 and A1000 = 80852364498.
-
-Find the last 9 digits of .
+Find the last 9 digits of $\displaystyle\sum_{k = 1}^{18} A_{{10}^k}$.
 
 # --hints--
 
-`euler361()` should return 178476944.
+`subsequenceOfThueMorseSequence()` should return `178476944`.
 
 ```js
-assert.strictEqual(euler361(), 178476944);
+assert.strictEqual(subsequenceOfThueMorseSequence(), 178476944);
 ```
 
 # --seed--
@@ -39,12 +40,12 @@ assert.strictEqual(euler361(), 178476944);
 ## --seed-contents--
 
 ```js
-function euler361() {
+function subsequenceOfThueMorseSequence() {
 
   return true;
 }
 
-euler361();
+subsequenceOfThueMorseSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-362-squarefree-factors.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-362-squarefree-factors.md
index 4d6bc3f4a97..19f6b0f9cdc 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-362-squarefree-factors.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-362-squarefree-factors.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4d61000cf542c50ffe9
 title: 'Problem 362: Squarefree factors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302023
 dashedName: problem-362-squarefree-factors
 ---
@@ -12,24 +12,24 @@ Consider the number 54.
 
 54 can be factored in 7 distinct ways into one or more factors larger than 1:
 
-54, 2×27, 3×18, 6×9, 3×3×6, 2×3×9 and 2×3×3×3.
+$$54, 2 × 27, 3 × 18, 6 × 9, 3 × 3 × 6, 2 × 3 × 9 \text{ and } 2 × 3 × 3 × 3$$
 
-If we require that the factors are all squarefree only two ways remain: 3×3×6 and 2×3×3×3.
+If we require that the factors are all squarefree only two ways remain: $3 × 3 × 6$ and $2 × 3 × 3 × 3$.
 
-Let's call Fsf(n) the number of ways n can be factored into one or more squarefree factors larger than 1, so Fsf(54)=2.
+Let's call $Fsf(n)$ the number of ways $n$ can be factored into one or more squarefree factors larger than 1, so $Fsf(54) = 2$.
 
-Let S(n) be ∑Fsf(k) for k=2 to n.
+Let $S(n)$ be $\sum Fsf(k)$ for $k = 2$ to $n$.
 
-S(100)=193.
+$S(100) = 193$.
 
-Find S(10 000 000 000).
+Find $S(10\\,000\\,000\\,000)$.
 
 # --hints--
 
-`euler362()` should return 457895958010.
+`squarefreeFactors()` should return `457895958010`.
 
 ```js
-assert.strictEqual(euler362(), 457895958010);
+assert.strictEqual(squarefreeFactors(), 457895958010);
 ```
 
 # --seed--
@@ -37,12 +37,12 @@ assert.strictEqual(euler362(), 457895958010);
 ## --seed-contents--
 
 ```js
-function euler362() {
+function squarefreeFactors() {
 
   return true;
 }
 
-euler362();
+squarefreeFactors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md
index 2fde41d1eb0..df13df6a0c5 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md
@@ -1,31 +1,39 @@
 ---
 id: 5900f4d91000cf542c50ffeb
 title: 'Problem 363: Bézier Curves'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302024
 dashedName: problem-363-bzier-curves
 ---
 
 # --description--
 
-A cubic Bézier curve is defined by four points: P0, P1, P2 and P3.
+A cubic Bézier curve is defined by four points: $P_0$, $P_1$, $P_2$ and $P_3$.
 
-The curve is constructed as follows: On the segments P0P1, P1P2 and P2P3 the points Q0,Q1 and Q2 are drawn such that P0Q0 / P0P1 = P1Q1 / P1P2 = P2Q2 / P2P3 = t (t in \[0,1]). On the segments Q0Q1 and Q1Q2 the points R0 and R1 are drawn such that Q0R0 / Q0Q1 = Q1R1 / Q1Q2 = t for the same value of t. On the segment R0R1 the point B is drawn such that R0B / R0R1 = t for the same value of t. The Bézier curve defined by the points P0, P1, P2, P3 is the locus of B as Q0 takes all possible positions on the segment P0P1. (Please note that for all points the value of t is the same.)
+The curve is constructed as follows:
 
-At this (external) web address you will find an applet that allows you to drag the points P0, P1, P2 and P3 to see what the Bézier curve (green curve) defined by those points looks like. You can also drag the point Q0 along the segment P0P1.
+<img class="img-responsive center-block" alt="construction of Bézier curve" src="https://cdn.freecodecamp.org/curriculum/project-euler/bzier-curves.png" style="background-color: white; padding: 10px;" />
 
-From the construction it is clear that the Bézier curve will be tangent to the segments P0P1 in P0 and P2P3 in P3.
+On the segments $P_0P_1$, $P_1P_2$ and $P_2P_3$ the points $Q_0$,$Q_1$ and $Q_2$ are drawn such that $\frac{P_0Q_0}{P_0P_1} = \frac{P_1Q_1}{P_1P_2} = \frac{P_2Q_2}{P_2P_3} = t$, with $t$ in [0,1].
 
-A cubic Bézier curve with P0=(1,0), P1=(1,v), P2=(v,1) and P3=(0,1) is used to approximate a quarter circle. The value v > 0 is chosen such that the area enclosed by the lines OP0, OP3 and the curve is equal to π/4 (the area of the quarter circle).
+On the segments $Q_0Q_1$ and $Q_1Q_2$ the points $R_0$ and $R_1$ are drawn such that $\frac{Q_0R_0}{Q_0Q_1} = \frac{Q_1R_1}{Q_1Q_2} = t$ for the same value of $t$.
 
-By how many percent does the length of the curve differ from the length of the quarter circle? That is, if L is the length of the curve, calculate 100 × L − π/2π/2Give your answer rounded to 10 digits behind the decimal point.
+On the segment $R_0R_1$ the point $B$ is drawn such that $\frac{R_0B}{R_0R_1} = t$ for the same value of $t$.
+
+The Bézier curve defined by the points $P_0$, $P_1$, $P_2$, $P_3$ is the locus of $B$ as $Q_0$ takes all possible positions on the segment $P_0P_1$. (Please note that for all points the value of $t$ is the same.)
+
+From the construction it is clear that the Bézier curve will be tangent to the segments $P_0P_1$ in $P_0$ and $P_2P_3$ in $P_3$.
+
+A cubic Bézier curve with $P_0 = (1, 0)$, $P_1 = (1, v)$, $P_2 = (v, 1)$ and $P_3 = (0, 1)$ is used to approximate a quarter circle. The value $v > 0$ is chosen such that the area enclosed by the lines $OP_0$, $OP_3$ and the curve is equal to $\frac{π}{4}$ (the area of the quarter circle).
+
+By how many percent does the length of the curve differ from the length of the quarter circle? That is, if $L$ is the length of the curve, calculate $100 × \displaystyle\frac{L − \frac{π}{2}}{\frac{π}{2}}$. Give your answer rounded to 10 digits behind the decimal point.
 
 # --hints--
 
-`euler363()` should return 0.0000372091.
+`bezierCurves()` should return `0.0000372091`.
 
 ```js
-assert.strictEqual(euler363(), 0.0000372091);
+assert.strictEqual(bezierCurves(), 0.0000372091);
 ```
 
 # --seed--
@@ -33,12 +41,12 @@ assert.strictEqual(euler363(), 0.0000372091);
 ## --seed-contents--
 
 ```js
-function euler363() {
+function bezierCurves() {
 
   return true;
 }
 
-euler363();
+bezierCurves();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md
index 84637798b87..83f8f7ec5d4 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f4d91000cf542c50ffea
 title: 'Problem 364: Comfortable distance'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302025
 dashedName: problem-364-comfortable-distance
 ---
 
 # --description--
 
-There are N seats in a row. N people come after each other to fill the seats according to the following rules:
+There are $N$ seats in a row. $N$ people come after each other to fill the seats according to the following rules:
 
-If there is any seat whose adjacent seat(s) are not occupied take such a seat.
+1. If there is any seat whose adjacent seat(s) are not occupied take such a seat.
+2. If there is no such seat and there is any seat for which only one adjacent seat is occupied take such a seat.
+3. Otherwise take one of the remaining available seats.
 
-If there is no such seat and there is any seat for which only one adjacent seat is occupied take such a seat.
+Let $T(N)$ be the number of possibilities that $N$ seats are occupied by $N$ people with the given rules. The following figure shows $T(4) = 8$.
 
-Otherwise take one of the remaining available seats.
+<img class="img-responsive center-block" alt="eight ways for N seats to be occupied by N people" src="https://cdn.freecodecamp.org/curriculum/project-euler/comfortable-distance.gif" style="background-color: white; padding: 10px;" />
 
-Let T(N) be the number of possibilities that N seats are occupied by N people with the given rules. The following figure shows T(4)=8.
+We can verify that $T(10) = 61\\,632$ and $T(1\\,000)\bmod 100\\,000\\,007 = 47\\,255\\,094$.
 
-We can verify that T(10) = 61632 and T(1 000) mod 100 000 007 = 47255094. Find T(1 000 000) mod 100 000 007.
+Find $T(1\\,000\\,000)\bmod 100\\,000\\,007$.
 
 # --hints--
 
-`euler364()` should return 44855254.
+`comfortableDistance()` should return `44855254`.
 
 ```js
-assert.strictEqual(euler364(), 44855254);
+assert.strictEqual(comfortableDistance(), 44855254);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler364(), 44855254);
 ## --seed-contents--
 
 ```js
-function euler364() {
+function comfortableDistance() {
 
   return true;
 }
 
-euler364();
+comfortableDistance();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.md
index 1647ff46ea4..46dc7abf5d6 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4da1000cf542c50ffec
 title: 'Problem 365: A huge binomial coefficient'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302026
 dashedName: problem-365-a-huge-binomial-coefficient
 ---
 
 # --description--
 
-The binomial coefficient C(1018,109) is a number with more than 9 billion (9×109) digits.
+The binomial coefficient $\displaystyle\binom{{10}^{18}}{{10}^9}$ is a number with more than 9 billion ($9 × {10}^9$) digits.
 
-Let M(n,k,m) denote the binomial coefficient C(n,k) modulo m.
+Let $M(n, k, m)$ denote the binomial coefficient $\displaystyle\binom{n}{k}$ modulo $m$.
 
-Calculate ∑M(1018,109,p*q*r) for 1000&lt;p&lt;q&lt;r&lt;5000 and p,q,r prime.
+Calculate $\sum M({10}^{18}, {10}^9, p \times q \times r)$ for $1000 &lt; p &lt; q &lt; r &lt; 5000$ and $p$, $q$, $r$ prime.
 
 # --hints--
 
-`euler365()` should return 162619462356610300.
+`hugeBinomialCoefficient()` should return `162619462356610300`.
 
 ```js
-assert.strictEqual(euler365(), 162619462356610300);
+assert.strictEqual(hugeBinomialCoefficient(), 162619462356610300);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler365(), 162619462356610300);
 ## --seed-contents--
 
 ```js
-function euler365() {
+function hugeBinomialCoefficient() {
 
   return true;
 }
 
-euler365();
+hugeBinomialCoefficient();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-366-stone-game-iii.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-366-stone-game-iii.md
index b7f832ebf4b..e4c51cb8c50 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-366-stone-game-iii.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-366-stone-game-iii.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4da1000cf542c50ffed
 title: 'Problem 366: Stone Game III'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302027
 dashedName: problem-366-stone-game-iii
 ---
@@ -10,7 +10,7 @@ dashedName: problem-366-stone-game-iii
 
 Two players, Anton and Bernhard, are playing the following game.
 
-There is one pile of n stones.
+There is one pile of $n$ stones.
 
 The first player may remove any positive number of stones, but not the whole pile.
 
@@ -18,20 +18,34 @@ Thereafter, each player may remove at most twice the number of stones his oppone
 
 The player who removes the last stone wins.
 
-E.g. n=5 If the first player takes anything more than one stone the next player will be able to take all remaining stones. If the first player takes one stone, leaving four, his opponent will take also one stone, leaving three stones. The first player cannot take all three because he may take at most 2x1=2 stones. So let's say he takes also one stone, leaving 2. The second player can take the two remaining stones and wins. So 5 is a losing position for the first player. For some winning positions there is more than one possible move for the first player. E.g. when n=17 the first player can remove one or four stones.
+E.g. $n = 5$
 
-Let M(n) be the maximum number of stones the first player can take from a winning position at his first turn and M(n)=0 for any other position.
+If the first player takes anything more than one stone the next player will be able to take all remaining stones.
 
-∑M(n) for n≤100 is 728.
+If the first player takes one stone, leaving four, his opponent will take also one stone, leaving three stones.
 
-Find ∑M(n) for n≤1018. Give your answer modulo 108.
+The first player cannot take all three because he may take at most $2 \times 1 = 2$ stones. So let's say he also takes one stone, leaving 2.
+
+The second player can take the two remaining stones and wins.
+
+So 5 is a losing position for the first player.
+
+For some winning positions there is more than one possible move for the first player.
+
+E.g. when $n = 17$ the first player can remove one or four stones.
+
+Let $M(n)$ be the maximum number of stones the first player can take from a winning position at his first turn and $M(n) = 0$ for any other position.
+
+$\sum M(n)$ for $n ≤ 100$ is 728.
+
+Find $\sum M(n)$ for $n ≤ {10}^{18}$. Give your answer modulo ${10}^8$.
 
 # --hints--
 
-`euler366()` should return 88351299.
+`stoneGameThree()` should return `88351299`.
 
 ```js
-assert.strictEqual(euler366(), 88351299);
+assert.strictEqual(stoneGameThree(), 88351299);
 ```
 
 # --seed--
@@ -39,12 +53,12 @@ assert.strictEqual(euler366(), 88351299);
 ## --seed-contents--
 
 ```js
-function euler366() {
+function stoneGameThree() {
 
   return true;
 }
 
-euler366();
+stoneGameThree();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-367-bozo-sort.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-367-bozo-sort.md
index 979702592a9..01a24b3c665 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-367-bozo-sort.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-367-bozo-sort.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4db1000cf542c50ffee
 title: 'Problem 367: Bozo sort'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302028
 dashedName: problem-367-bozo-sort
 ---
@@ -10,18 +10,30 @@ dashedName: problem-367-bozo-sort
 
 Bozo sort, not to be confused with the slightly less efficient bogo sort, consists out of checking if the input sequence is sorted and if not swapping randomly two elements. This is repeated until eventually the sequence is sorted.
 
-If we consider all permutations of the first 4 natural numbers as input the expectation value of the number of swaps, averaged over all 4! input sequences is 24.75. The already sorted sequence takes 0 steps.
+If we consider all permutations of the first 4 natural numbers as input the expectation value of the number of swaps, averaged over all $4!$ input sequences is $24.75$.
 
-In this problem we consider the following variant on bozo sort. If the sequence is not in order we pick three elements at random and shuffle these three elements randomly. All 3!=6 permutations of those three elements are equally likely. The already sorted sequence will take 0 steps. If we consider all permutations of the first 4 natural numbers as input the expectation value of the number of shuffles, averaged over all 4! input sequences is 27.5. Consider as input sequences the permutations of the first 11 natural numbers. Averaged over all 11! input sequences, what is the expected number of shuffles this sorting algorithm will perform?
+The already sorted sequence takes 0 steps.
 
-Give your answer rounded to the nearest integer.
+In this problem we consider the following variant on bozo sort.
+
+If the sequence is not in order we pick three elements at random and shuffle these three elements randomly.
+
+All $3! = 6$ permutations of those three elements are equally likely.
+
+The already sorted sequence will take 0 steps.
+
+If we consider all permutations of the first 4 natural numbers as input the expectation value of the number of shuffles, averaged over all $4!$ input sequences is $27.5$.
+
+Consider as input sequences the permutations of the first 11 natural numbers.
+
+Averaged over all $11!$ input sequences, what is the expected number of shuffles this sorting algorithm will perform? Give your answer rounded to the nearest integer.
 
 # --hints--
 
-`euler367()` should return 48271207.
+`bozoSort()` should return `48271207`.
 
 ```js
-assert.strictEqual(euler367(), 48271207);
+assert.strictEqual(bozoSort(), 48271207);
 ```
 
 # --seed--
@@ -29,12 +41,12 @@ assert.strictEqual(euler367(), 48271207);
 ## --seed-contents--
 
 ```js
-function euler367() {
+function bozoSort() {
 
   return true;
 }
 
-euler367();
+bozoSort();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.md
index dc9cf2f919b..afc2e6dc9b8 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.md
@@ -1,18 +1,23 @@
 ---
 id: 5900f4dd1000cf542c50ffef
 title: 'Problem 368: A Kempner-like series'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302029
 dashedName: problem-368-a-kempner-like-series
 ---
 
 # --description--
 
-The harmonic series $1 + \\dfrac{1}{2} + \\dfrac{1}{3} + \\dfrac{1}{4} + ...$ is well known to be divergent.
+The harmonic series $1 + \dfrac{1}{2} + \dfrac{1}{3} + \dfrac{1}{4} + \ldots$ is well known to be divergent.
 
 If we however omit from this series every term where the denominator has a 9 in it, the series remarkably enough converges to approximately 22.9206766193. This modified harmonic series is called the Kempner series.
 
-Let us now consider another modified harmonic series by omitting from the harmonic series every term where the denominator has 3 or more equal consecutive digits. One can verify that out of the first 1200 terms of the harmonic series, only 20 terms will be omitted. These 20 omitted terms are: $$\\dfrac{1}{111}, \\dfrac{1}{222}, \\dfrac{1}{333}, \\dfrac{1}{444}, \\dfrac{1}{555}, \\dfrac{1}{666}, \\dfrac{1}{777}, \\dfrac{1}{888}, \\dfrac{1}{999}, \\dfrac{1}{1000}, \\dfrac{1}{1110}, \\\\ \\dfrac{1}{1111}, \\dfrac{1}{1112}, \\dfrac{1}{1113}, \\dfrac{1}{1114}, \\dfrac{1}{1115}, \\dfrac{1}{1116}, \\dfrac{1}{1117}, \\dfrac{1}{1118}, \\dfrac{1}{1119}$$
+Let us now consider another modified harmonic series by omitting from the harmonic series every term where the denominator has 3 or more equal consecutive digits. One can verify that out of the first 1200 terms of the harmonic series, only 20 terms will be omitted.
+
+These 20 omitted terms are:
+
+$$\dfrac{1}{111}, \dfrac{1}{222}, \dfrac{1}{333}, \dfrac{1}{444}, \dfrac{1}{555}, \dfrac{1}{666}, \dfrac{1}{777}, \dfrac{1}{888}, \dfrac{1}{999}, \dfrac{1}{1000}, \dfrac{1}{1110}, \\\\
+\dfrac{1}{1111}, \dfrac{1}{1112}, \dfrac{1}{1113}, \dfrac{1}{1114}, \dfrac{1}{1115}, \dfrac{1}{1116}, \dfrac{1}{1117}, \dfrac{1}{1118}, \dfrac{1}{1119}$$
 
 This series converges as well.
 
@@ -20,10 +25,10 @@ Find the value the series converges to. Give your answer rounded to 10 digits be
 
 # --hints--
 
-`euler368()` should return 253.6135092068.
+`kempnerLikeSeries()` should return `253.6135092068`.
 
 ```js
-assert.strictEqual(euler368(), 253.6135092068);
+assert.strictEqual(kempnerLikeSeries(), 253.6135092068);
 ```
 
 # --seed--
@@ -31,12 +36,12 @@ assert.strictEqual(euler368(), 253.6135092068);
 ## --seed-contents--
 
 ```js
-function euler368() {
+function kempnerLikeSeries() {
 
   return true;
 }
 
-euler368();
+kempnerLikeSeries();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-369-badugi.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-369-badugi.md
index abdcb4c8102..b297bf965da 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-369-badugi.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-369-badugi.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4de1000cf542c50fff0
 title: 'Problem 369: Badugi'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302030
 dashedName: problem-369-badugi
 ---
@@ -10,16 +10,16 @@ dashedName: problem-369-badugi
 
 In a standard 52 card deck of playing cards, a set of 4 cards is a Badugi if it contains 4 cards with no pairs and no two cards of the same suit.
 
-Let f(n) be the number of ways to choose n cards with a 4 card subset that is a Badugi. For example, there are 2598960 ways to choose five cards from a standard 52 card deck, of which 514800 contain a 4 card subset that is a Badugi, so f(5) = 514800.
+Let $f(n)$ be the number of ways to choose $n$ cards with a 4 card subset that is a Badugi. For example, there are $2\\,598\\,960$ ways to choose five cards from a standard 52 card deck, of which $514\\,800$ contain a 4 card subset that is a Badugi, so $f(5) = 514800$.
 
-Find ∑f(n) for 4 ≤ n ≤ 13.
+Find $\sum f(n)$ for $4 ≤ n ≤ 13$.
 
 # --hints--
 
-`euler369()` should return 862400558448.
+`badugi()` should return `862400558448`.
 
 ```js
-assert.strictEqual(euler369(), 862400558448);
+assert.strictEqual(badugi(), 862400558448);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler369(), 862400558448);
 ## --seed-contents--
 
 ```js
-function euler369() {
+function badugi() {
 
   return true;
 }
 
-euler369();
+badugi();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-37-truncatable-primes.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-37-truncatable-primes.md
index 7cac6e4ddb3..5d4c80d5252 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-37-truncatable-primes.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-37-truncatable-primes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3911000cf542c50fea4
 title: 'Problem 37: Truncatable primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302031
 dashedName: problem-37-truncatable-primes
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-370-geometric-triangles.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-370-geometric-triangles.md
index 469f9151e03..dd37d167a05 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-370-geometric-triangles.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-370-geometric-triangles.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4de1000cf542c50fff1
 title: 'Problem 370: Geometric triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302032
 dashedName: problem-370-geometric-triangles
 ---
 
 # --description--
 
-Let us define a geometric triangle as an integer sided triangle with sides a ≤ b ≤ c so that its sides form a geometric progression, i.e. b2 = a · c .
+Let us define a geometric triangle as an integer sided triangle with sides $a ≤ b ≤ c$ so that its sides form a geometric progression, i.e. $b^2 = a \times c$.
 
-An example of such a geometric triangle is the triangle with sides a = 144, b = 156 and c = 169.
+An example of such a geometric triangle is the triangle with sides $a = 144$, $b = 156$ and $c = 169$.
 
-There are 861805 geometric triangles with perimeter ≤ 106 .
+There are $861\\,805$ geometric triangles with $\text{perimeter} ≤ {10}^6$.
 
-How many geometric triangles exist with perimeter ≤ 2.5·1013 ?
+How many geometric triangles exist with $\text{perimeter} ≤ 2.5 \times {10}^{13}$?
 
 # --hints--
 
-`euler370()` should return 41791929448408.
+`geometricTriangles()` should return `41791929448408`.
 
 ```js
-assert.strictEqual(euler370(), 41791929448408);
+assert.strictEqual(geometricTriangles(), 41791929448408);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler370(), 41791929448408);
 ## --seed-contents--
 
 ```js
-function euler370() {
+function geometricTriangles() {
 
   return true;
 }
 
-euler370();
+geometricTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-371-licence-plates.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-371-licence-plates.md
index 005b5aaf078..dee9928047e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-371-licence-plates.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-371-licence-plates.md
@@ -1,31 +1,31 @@
 ---
 id: 5900f4e01000cf542c50fff2
 title: 'Problem 371: Licence plates'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302033
 dashedName: problem-371-licence-plates
 ---
 
 # --description--
 
-Oregon licence plates consist of three letters followed by a three digit number (each digit can be from \[0..9]).
+Oregon licence plates consist of three letters followed by a three digit number (each digit can be from [0...9]).
 
 While driving to work Seth plays the following game:
 
 Whenever the numbers of two licence plates seen on his trip add to 1000 that's a win.
 
-E.g. MIC-012 and HAN-988 is a win and RYU-500 and SET-500 too. (as long as he sees them in the same trip).
+E.g. `MIC-012` and `HAN-988` is a win and `RYU-500` and `SET-500` too (as long as he sees them in the same trip).
 
 Find the expected number of plates he needs to see for a win. Give your answer rounded to 8 decimal places behind the decimal point.
 
-Note: We assume that each licence plate seen is equally likely to have any three digit number on it.
+**Note:** We assume that each licence plate seen is equally likely to have any three digit number on it.
 
 # --hints--
 
-`euler371()` should return 40.66368097.
+`licensePlates()` should return `40.66368097`.
 
 ```js
-assert.strictEqual(euler371(), 40.66368097);
+assert.strictEqual(licensePlates(), 40.66368097);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler371(), 40.66368097);
 ## --seed-contents--
 
 ```js
-function euler371() {
+function licensePlates() {
 
   return true;
 }
 
-euler371();
+licensePlates();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-372-pencils-of-rays.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-372-pencils-of-rays.md
index 1a04cacb71a..9a8e0ff315d 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-372-pencils-of-rays.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-372-pencils-of-rays.md
@@ -1,23 +1,27 @@
 ---
 id: 5900f4e11000cf542c50fff3
 title: 'Problem 372: Pencils of rays'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302034
 dashedName: problem-372-pencils-of-rays
 ---
 
 # --description--
 
-Let R(M, N) be the number of lattice points (x, y) which satisfy M
+Let $R(M, N)$ be the number of lattice points ($x$, $y$) which satisfy $M \lt x \le N$, $M \lt y \le N$ and $\left\lfloor\frac{y^2}{x^2}\right\rfloor$ is odd.
 
-Note: represents the floor function.
+We can verify that $R(0, 100) = 3\\,019$ and $R(100, 10\\,000) = 29\\,750\\,422$.
+
+Find $R(2 \times {10}^6, {10}^9)$.
+
+**Note:** $\lfloor x\rfloor$ represents the floor function.
 
 # --hints--
 
-`euler372()` should return 301450082318807040.
+`pencilsOfRays()` should return `301450082318807040`.
 
 ```js
-assert.strictEqual(euler372(), 301450082318807040);
+assert.strictEqual(pencilsOfRays(), 301450082318807040);
 ```
 
 # --seed--
@@ -25,12 +29,12 @@ assert.strictEqual(euler372(), 301450082318807040);
 ## --seed-contents--
 
 ```js
-function euler372() {
+function pencilsOfRays() {
 
   return true;
 }
 
-euler372();
+pencilsOfRays();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-373-circumscribed-circles.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-373-circumscribed-circles.md
index 534c32ea251..dbe4e1d47e4 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-373-circumscribed-circles.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-373-circumscribed-circles.md
@@ -1,29 +1,27 @@
 ---
 id: 5900f4e11000cf542c50fff4
 title: 'Problem 373: Circumscribed Circles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302035
 dashedName: problem-373-circumscribed-circles
 ---
 
 # --description--
 
-Every triangle has a circumscribed circle that goes through the three vertices.
+Every triangle has a circumscribed circle that goes through the three vertices. Consider all integer sided triangles for which the radius of the circumscribed circle is integral as well.
 
-Consider all integer sided triangles for which the radius of the circumscribed circle is integral as well.
+Let $S(n)$ be the sum of the radii of the circumscribed circles of all such triangles for which the radius does not exceed $n$.
 
-Let S(n) be the sum of the radii of the circumscribed circles of all such triangles for which the radius does not exceed n.
+$S(100) = 4\\,950$ and $S(1\\,200) = 1\\,653\\,605$.
 
-S(100)=4950 and S(1200)=1653605.
-
-Find S(107).
+Find $S({10}^7)$.
 
 # --hints--
 
-`euler373()` should return 727227472448913.
+`circumscribedCircles()` should return `727227472448913`.
 
 ```js
-assert.strictEqual(euler373(), 727227472448913);
+assert.strictEqual(circumscribedCircles(), 727227472448913);
 ```
 
 # --seed--
@@ -31,12 +29,12 @@ assert.strictEqual(euler373(), 727227472448913);
 ## --seed-contents--
 
 ```js
-function euler373() {
+function circumscribedCircles() {
 
   return true;
 }
 
-euler373();
+circumscribedCircles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.md
index 10fe6218919..e2578270e64 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.md
@@ -1,35 +1,37 @@
 ---
 id: 5900f4e51000cf542c50fff6
 title: 'Problem 374: Maximum Integer Partition Product'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302036
 dashedName: problem-374-maximum-integer-partition-product
 ---
 
 # --description--
 
-An integer partition of a number n is a way of writing n as a sum of positive integers.
+An integer partition of a number $n$ is a way of writing $n$ as a sum of positive integers.
 
-Partitions that differ only in the order of their summands are considered the same. A partition of n into distinct parts is a partition of n in which every part occurs at most once.
+Partitions that differ only in the order of their summands are considered the same. A partition of $n$ into distinct parts is a partition of $n$ in which every part occurs at most once.
 
-The partitions of 5 into distinct parts are: 5, 4+1 and 3+2.
+The partitions of 5 into distinct parts are:
 
-Let f(n) be the maximum product of the parts of any such partition of n into distinct parts and let m(n) be the number of elements of any such partition of n with that product.
+5, 4 + 1 and 3 + 2.
 
-So f(5)=6 and m(5)=2.
+Let $f(n)$ be the maximum product of the parts of any such partition of $n$ into distinct parts and let $m(n)$ be the number of elements of any such partition of $n$ with that product.
 
-For n=10 the partition with the largest product is 10=2+3+5, which gives f(10)=30 and m(10)=3. And their product, f(10)·m(10) = 30·3 = 90
+So $f(5) = 6$ and $m(5) = 2$.
 
-It can be verified that ∑f(n)·m(n) for 1 ≤ n ≤ 100 = 1683550844462.
+For $n = 10$ the partition with the largest product is $10 = 2 + 3 + 5$, which gives $f(10) = 30$ and $m(10) = 3$. And their product, $f(10) \times m(10) = 30 \times 3 = 90$
 
-Find ∑f(n)·m(n) for 1 ≤ n ≤ 1014. Give your answer modulo 982451653, the 50 millionth prime.
+It can be verified that $\sum f(n) \times m(n)$ for $1 ≤ n ≤ 100 = 1\\,683\\,550\\,844\\,462$.
+
+Find $\sum f(n) \times m(n)$ for $1 ≤ n ≤ {10}^{14}$. Give your answer modulo $982\\,451\\,653$, the 50 millionth prime.
 
 # --hints--
 
-`euler374()` should return 334420941.
+`maximumIntegerPartitionProduct()` should return `334420941`.
 
 ```js
-assert.strictEqual(euler374(), 334420941);
+assert.strictEqual(maximumIntegerPartitionProduct(), 334420941);
 ```
 
 # --seed--
@@ -37,12 +39,12 @@ assert.strictEqual(euler374(), 334420941);
 ## --seed-contents--
 
 ```js
-function euler374() {
+function maximumIntegerPartitionProduct() {
 
   return true;
 }
 
-euler374();
+maximumIntegerPartitionProduct();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md
index 684613a2357..082d94ef69c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md
@@ -1,37 +1,30 @@
 ---
 id: 5900f4e41000cf542c50fff5
 title: 'Problem 375: Minimum of subsequences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302037
 dashedName: problem-375-minimum-of-subsequences
 ---
 
 # --description--
 
-Let Sn be an integer sequence produced with the following pseudo-random number generator:
+Let $S_n$ be an integer sequence produced with the following pseudo-random number generator:
 
-S0
+$$\begin{align}         S_0 & = 290\\,797 \\\\
+  S_{n + 1} & = {S_n}^2\bmod 50\\,515\\,093 \end{align}$$
 
-=
+Let $A(i, j)$ be the minimum of the numbers $S_i, S_{i + 1}, \ldots, S_j$ for $i ≤ j$. Let $M(N) = \sum A(i, j)$ for $1 ≤ i ≤ j ≤ N$.
 
-290797
+We can verify that $M(10) = 432\\,256\\,955$ and $M(10\\,000) = 3\\,264\\,567\\,774\\,119$.
 
-Sn+1
-
-=
-
-Sn2 mod 50515093
-
-Let A(i, j) be the minimum of the numbers Si, Si+1, ... , Sj for i ≤ j. Let M(N) = ΣA(i, j) for 1 ≤ i ≤ j ≤ N. We can verify that M(10) = 432256955 and M(10 000) = 3264567774119.
-
-Find M(2 000 000 000).
+Find $M(2\\,000\\,000\\,000)$.
 
 # --hints--
 
-`euler375()` should return 7435327983715286000.
+`minimumOfSubsequences()` should return `7435327983715286000`.
 
 ```js
-assert.strictEqual(euler375(), 7435327983715286000);
+assert.strictEqual(minimumOfSubsequences(), 7435327983715286000);
 ```
 
 # --seed--
@@ -39,12 +32,12 @@ assert.strictEqual(euler375(), 7435327983715286000);
 ## --seed-contents--
 
 ```js
-function euler375() {
+function minimumOfSubsequences() {
 
   return true;
 }
 
-euler375();
+minimumOfSubsequences();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.md
index 660508c2348..73d4e803a8c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f4e51000cf542c50fff8
 title: 'Problem 377: Sum of digits, experience 13'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302039
 dashedName: problem-377-sum-of-digits-experience-13
 ---
 
 # --description--
 
-There are 16 positive integers that do not have a zero in their digits and that have a digital sum equal to 5, namely:
+Hay 16 números enteros positivos que no tienen cero en sus digitos y la suma de sus digitos es igual a 5, a saber:
 
-5, 14, 23, 32, 41, 113, 122, 131, 212, 221, 311, 1112, 1121, 1211, 2111 and 11111.
+5, 14, 23, 32, 41, 113, 122, 131, 212, 221, 311, 1112, 1121, 1211, 2111 y 11111.
 
-Their sum is 17891.
+La suma de ellos es 17891.
 
-Let f(n) be the sum of all positive integers that do not have a zero in their digits and have a digital sum equal to n.
+Que $f(n)$ sea la suma de todos los numeros enteros positivos que no tengan numero cero en sus digitos y que la suma de ellos sea igual a $n$.
 
-Find $\\displaystyle \\sum\_{i=1}^{17} f(13^i)$. Give the last 9 digits as your answer.
+Encuentra $\displaystyle\sum_{i=1}^{17} f(13^i)$. Proporcione los ultimos nueve digitos en su respuesta.
 
 # --hints--
 
-`euler377()` should return 732385277.
+`experience13()` debe retornar `732385277`.
 
 ```js
-assert.strictEqual(euler377(), 732385277);
+assert.strictEqual(experience13(), 732385277);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler377(), 732385277);
 ## --seed-contents--
 
 ```js
-function euler377() {
+function experience13() {
 
   return true;
 }
 
-euler377();
+experience13();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-378-triangle-triples.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-378-triangle-triples.md
index 22589747fe8..f5fbd4dcfc5 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-378-triangle-triples.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-378-triangle-triples.md
@@ -1,31 +1,27 @@
 ---
 id: 5900f4e61000cf542c50fff9
-title: 'Problem 378: Triangle Triples'
-challengeType: 5
+title: 'Problema 378: Triángulos Triples'
+challengeType: 1
 forumTopicId: 302040
 dashedName: problem-378-triangle-triples
 ---
 
 # --description--
 
-Let T(n) be the nth triangle number, so T(n) =
+Que $T(n)$ sea el $n^{\text{th}}$ número del triangulo, asi que: $T(n) = \frac{n(n + 1)}{2}$.
 
-n (n+1)2
+Let $dT(n)$ be the number of divisors of $T(n)$. E.g.: $T(7) = 28$ and $dT(7) = 6$.
 
-.
+Que $Tr(n)$ sea un numero de triples ($i$, $j$, $k$) como de se siguiente manera $1 ≤ i &lt; j &lt; k ≤ n$ and $dT(i) > dT(j) > dT(k)$. $Tr(20) = 14$, $Tr(100) = 5\\,772$ and $Tr(1000) = 11\\,174\\,776$.
 
-Let dT(n) be the number of divisors of T(n). E.g.: T(7) = 28 and dT(7) = 6.
-
-Let Tr(n) be the number of triples (i, j, k) such that 1 ≤ i &lt; j &lt; k ≤ n and dT(i) > dT(j) > dT(k). Tr(20) = 14, Tr(100) = 5772 and Tr(1000) = 11174776.
-
-Find Tr(60 000 000). Give the last 18 digits of your answer.
+Encuentra $Tr(60\\,000\\,000)$. Proporcione los ultimos 18 digitos como respuesta.
 
 # --hints--
 
-`euler378()` should return 147534623725724700.
+`triangleTriples()` debe retornar `147534623725724700`.
 
 ```js
-assert.strictEqual(euler378(), 147534623725724700);
+assert.strictEqual(triangleTriples(), 147534623725724700);
 ```
 
 # --seed--
@@ -33,12 +29,12 @@ assert.strictEqual(euler378(), 147534623725724700);
 ## --seed-contents--
 
 ```js
-function euler378() {
+function triangleTriples() {
 
   return true;
 }
 
-euler378();
+triangleTriples();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.md
index 3933d82ea2c..0f2fb896572 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4e81000cf542c50fffa
 title: 'Problem 379: Least common multiple count'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302041
 dashedName: problem-379-least-common-multiple-count
 ---
 
 # --description--
 
-Let f(n) be the number of couples (x,y) with x and y positive integers, x ≤ y and the least common multiple of x and y equal to n.
+Let $f(n)$ be the number of couples ($x$, $y$) with $x$ and $y$ positive integers, $x ≤ y$ and the least common multiple of $x$ and $y$ equal to $n$.
 
-Let g be the summatory function of f, i.e.: g(n) = ∑ f(i) for 1 ≤ i ≤ n.
+Let $g$ be the summatory function of $f$, i.e.: $g(n) = \sum f(i)$ for $1 ≤ i ≤ n$.
 
-You are given that g(106) = 37429395.
+You are given that $g({10}^6) = 37\\,429\\,395$.
 
-Find g(1012).
+Find $g({10}^{12})$.
 
 # --hints--
 
-`euler379()` should return 132314136838185.
+`leastCommonMultipleCount()` should return `132314136838185`.
 
 ```js
-assert.strictEqual(euler379(), 132314136838185);
+assert.strictEqual(leastCommonMultipleCount(), 132314136838185);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler379(), 132314136838185);
 ## --seed-contents--
 
 ```js
-function euler379() {
+function leastCommonMultipleCount() {
 
   return true;
 }
 
-euler379();
+leastCommonMultipleCount();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md
index 1c3f0c56c60..a1190e84f39 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3931000cf542c50fea5
 title: 'Problem 38: Pandigital multiples'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302042
 dashedName: problem-38-pandigital-multiples
 ---
@@ -10,7 +10,9 @@ dashedName: problem-38-pandigital-multiples
 
 Take the number 192 and multiply it by each of 1, 2, and 3:
 
-$$\begin{align} 192 × 1 = 192\\\\ 192 × 2 = 384\\\\ 192 × 3 = 576\\\\ \end{align}$$
+$$\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).
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md
index 8596f52fa78..15ae5170a74 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md
@@ -1,27 +1,37 @@
 ---
 id: 5900f4e81000cf542c50fffb
 title: 'Problem 380: Amazing Mazes!'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302044
 dashedName: problem-380-amazing-mazes
 ---
 
 # --description--
 
-An m×n maze is an m×n rectangular grid with walls placed between grid cells such that there is exactly one path from the top-left square to any other square. The following are examples of a 9×12 maze and a 15×20 maze:
+An $m×n$ maze is an $m×n$ rectangular grid with walls placed between grid cells such that there is exactly one path from the top-left square to any other square. The following are examples of a 9×12 maze and a 15×20 maze:
 
-Let C(m,n) be the number of distinct m×n mazes. Mazes which can be formed by rotation and reflection from another maze are considered distinct.
+<img class="img-responsive center-block" alt="9x12 maze and 15x20 maze" src="https://cdn.freecodecamp.org/curriculum/project-euler/amazing-mazes.gif" style="background-color: white; padding: 10px;" />
 
-It can be verified that C(1,1) = 1, C(2,2) = 4, C(3,4) = 2415, and C(9,12) = 2.5720e46 (in scientific notation rounded to 5 significant digits). Find C(100,500) and write your answer in scientific notation rounded to 5 significant digits.
+Let $C(m, n)$ be the number of distinct $m×n$ mazes. Mazes which can be formed by rotation and reflection from another maze are considered distinct.
 
-When giving your answer, use a lowercase e to separate mantissa and exponent. E.g. if the answer is 1234567891011 then the answer format would be 1.2346e12.
+It can be verified that $C(1, 1) = 1$, $C(2, 2) = 4$, $C(3, 4) = 2415$, and $C(9, 12) = 2.5720\mathrm{e}\\,46$ (in scientific notation rounded to 5 significant digits).
+
+Find $C(100, 500)$ and write your answer as a string in scientific notation rounded to 5 significant digits.
+
+When giving your answer, use a lowercase e to separate mantissa and exponent. E.g. if the answer is 1234567891011 then the answer format would be the string `1.2346e12`.
 
 # --hints--
 
-`euler380()` should return Infinity.
+`amazingMazes()` should return a string.
 
 ```js
-assert.strictEqual(euler380(), Infinity);
+assert(typeof amazingMazes() === 'string');
+```
+
+`amazingMazes()` should return the string `6.3202e25093`.
+
+```js
+assert.strictEqual(amazingMazes(), '6.3202e25093');
 ```
 
 # --seed--
@@ -29,12 +39,12 @@ assert.strictEqual(euler380(), Infinity);
 ## --seed-contents--
 
 ```js
-function euler380() {
+function amazingMazes() {
 
   return true;
 }
 
-euler380();
+amazingMazes();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-381-prime-k-factorial.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-381-prime-k-factorial.md
index f64768a5c7a..21d1936ca57 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-381-prime-k-factorial.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-381-prime-k-factorial.md
@@ -1,27 +1,31 @@
 ---
 id: 5900f4ea1000cf542c50fffc
 title: 'Problem 381: (prime-k) factorial'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302045
 dashedName: problem-381-prime-k-factorial
 ---
 
 # --description--
 
-For a prime p let S(p) = (∑(p-k)!) mod(p) for 1 ≤ k ≤ 5.
+For a prime $p$ let $S(p) = (\sum (p - k)!)\bmod (p)$ for $1 ≤ k ≤ 5$.
 
-For example, if p=7, (7-1)! + (7-2)! + (7-3)! + (7-4)! + (7-5)! = 6! + 5! + 4! + 3! + 2! = 720+120+24+6+2 = 872. As 872 mod(7) = 4, S(7) = 4.
+For example, if $p = 7$,
 
-It can be verified that ∑S(p) = 480 for 5 ≤ p &lt; 100.
+$$(7 - 1)! + (7 - 2)! + (7 - 3)! + (7 - 4)! + (7 - 5)! = 6! + 5! + 4! + 3! + 2! = 720 + 120 + 24 + 6 + 2 = 872$$
 
-Find ∑S(p) for 5 ≤ p &lt; 108.
+As $872\bmod (7) = 4$, $S(7) = 4$.
+
+It can be verified that $\sum S(p) = 480$ for $5 ≤ p &lt; 100$.
+
+Find $\sum S(p)$ for $5 ≤ p &lt; {10}^8$.
 
 # --hints--
 
-`euler381()` should return 139602943319822.
+`primeKFactorial()` should return `139602943319822`.
 
 ```js
-assert.strictEqual(euler381(), 139602943319822);
+assert.strictEqual(primeKFactorial(), 139602943319822);
 ```
 
 # --seed--
@@ -29,12 +33,12 @@ assert.strictEqual(euler381(), 139602943319822);
 ## --seed-contents--
 
 ```js
-function euler381() {
+function primeKFactorial() {
 
   return true;
 }
 
-euler381();
+primeKFactorial();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-382-generating-polygons.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-382-generating-polygons.md
index ae95128f6bb..0dc1c50d9f6 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-382-generating-polygons.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-382-generating-polygons.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4eb1000cf542c50fffd
 title: 'Problem 382: Generating polygons'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302046
 dashedName: problem-382-generating-polygons
 ---
@@ -10,22 +10,39 @@ dashedName: problem-382-generating-polygons
 
 A polygon is a flat shape consisting of straight line segments that are joined to form a closed chain or circuit. A polygon consists of at least three sides and does not self-intersect.
 
-A set S of positive numbers is said to generate a polygon P if: no two sides of P are the same length, the length of every side of P is in S, and S contains no other value.
+A set $S$ of positive numbers is said to generate a polygon $P$ if:
 
-For example: The set {3, 4, 5} generates a polygon with sides 3, 4, and 5 (a triangle). The set {6, 9, 11, 24} generates a polygon with sides 6, 9, 11, and 24 (a quadrilateral). The sets {1, 2, 3} and {2, 3, 4, 9} do not generate any polygon at all.
+- no two sides of $P$ are the same length,
+- the length of every side of $P$ is in $S$, and
+- $S$ contains no other value.
 
-Consider the sequence s, defined as follows:s1 = 1, s2 = 2, s3 = 3 sn = sn-1 + sn-3 for n > 3.
+Por ejemplo:
 
-Let Un be the set {s1, s2, ..., sn}. For example, U10 = {1, 2, 3, 4, 6, 9, 13, 19, 28, 41}. Let f(n) be the number of subsets of Un which generate at least one polygon. For example, f(5) = 7, f(10) = 501 and f(25) = 18635853.
+The set {3, 4, 5} generates a polygon with sides 3, 4, and 5 (a triangle).
 
-Find the last 9 digits of f(1018).
+The set {6, 9, 11, 24} generates a polygon with sides 6, 9, 11, and 24 (a quadrilateral).
+
+The sets {1, 2, 3} and {2, 3, 4, 9} do not generate any polygon at all.
+
+Consider the sequence $s$, defined as follows:
+
+- $s_1 = 1$, $s_2 = 2$, $s_3 = 3$
+- $s_n = s_{n - 1} + s_{n - 3}$ for $n > 3$.
+
+Let $U_n$ be the set $\\{s_1, s_2, \ldots, s_n\\}$. For example, $U_{10} = \\{1, 2, 3, 4, 6, 9, 13, 19, 28, 41\\}$.
+
+Let $f(n)$ be the number of subsets of $U_n$ which generate at least one polygon.
+
+For example, $f(5) = 7$, $f(10) = 501$ and $f(25) = 18\\,635\\,853$.
+
+Find the last 9 digits of $f({10}^{18})$.
 
 # --hints--
 
-`euler382()` should return 697003956.
+`generatingPolygons()` should return `697003956`.
 
 ```js
-assert.strictEqual(euler382(), 697003956);
+assert.strictEqual(generatingPolygons(), 697003956);
 ```
 
 # --seed--
@@ -33,12 +50,12 @@ assert.strictEqual(euler382(), 697003956);
 ## --seed-contents--
 
 ```js
-function euler382() {
+function generatingPolygons() {
 
   return true;
 }
 
-euler382();
+generatingPolygons();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.md
index f199cb4f946..4a851985199 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f4ed1000cf542c50ffff
 title: 'Problem 383: Divisibility comparison between factorials'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302047
 dashedName: problem-383-divisibility-comparison-between-factorials
 ---
 
 # --description--
 
-Let f5(n) be the largest integer x for which 5x divides n.
+Let $f_5(n)$ be the largest integer $x$ for which $5^x$ divides $n$.
 
-For example, f5(625000) = 7.
+For example, $f_5(625\\,000) = 7$.
 
-Let T5(n) be the number of integers i which satisfy f5((2·i-1)!) &lt; 2·f5(i!) and 1 ≤ i ≤ n. It can be verified that T5(103) = 68 and T5(109) = 2408210.
+Let $T_5(n)$ be the number of integers $i$ which satisfy $f_5((2 \times i - 1)!) &lt; 2 \times f_5(i!)$ and $1 ≤ i ≤ n$.
 
-Find T5(1018).
+It can be verified that $T_5({10}^3) = 68$ and $T_5({10}^9) = 2\\,408\\,210$.
+
+Find $T_5({10}^{18})$.
 
 # --hints--
 
-`euler383()` should return 22173624649806.
+`factorialDivisibilityComparison()` should return `22173624649806`.
 
 ```js
-assert.strictEqual(euler383(), 22173624649806);
+assert.strictEqual(factorialDivisibilityComparison(), 22173624649806);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler383(), 22173624649806);
 ## --seed-contents--
 
 ```js
-function euler383() {
+function factorialDivisibilityComparison() {
 
   return true;
 }
 
-euler383();
+factorialDivisibilityComparison();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md
index c57f0ee2f96..9f11652c82f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md
@@ -1,37 +1,48 @@
 ---
 id: 5900f4ed1000cf542c50fffe
 title: 'Problem 384: Rudin-Shapiro sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302048
 dashedName: problem-384-rudin-shapiro-sequence
 ---
 
 # --description--
 
-Define the sequence a(n) as the number of adjacent pairs of ones in the binary expansion of n (possibly overlapping).
+Define the sequence $a(n)$ as the number of adjacent pairs of ones in the binary expansion of $n$ (possibly overlapping).
 
-E.g.: a(5) = a(1012) = 0, a(6) = a(1102) = 1, a(7) = a(1112) = 2
+E.g.: $a(5) = a({101}_2) = 0$, $a(6) = a({110}_2) = 1$, $a(7) = a({111}_2) = 2$
 
-Define the sequence b(n) = (-1)a(n). This sequence is called the Rudin-Shapiro sequence. Also consider the summatory sequence of b(n): .
+Define the sequence $b(n) = {(-1)}^{a(n)}$. This sequence is called the Rudin-Shapiro sequence.
 
-The first couple of values of these sequences are: n 0 1 2 3 4 5 6 7 a(n) 0 0 0 1 0 0 1 2 b(n) 1 1 1 -1 1 1 -1 1 s(n) 1 2 3 2 3 4 3 4
+Also consider the summatory sequence of $b(n)$: $s(n) = \displaystyle\sum_{i = 0}^{n} b(i)$.
 
-The sequence s(n) has the remarkable property that all elements are positive and every positive integer k occurs exactly k times.
+The first couple of values of these sequences are:
 
-Define g(t,c), with 1 ≤ c ≤ t, as the index in s(n) for which t occurs for the c'th time in s(n). E.g.: g(3,3) = 6, g(4,2) = 7 and g(54321,12345) = 1220847710.
+$$\begin{array}{lr}   n    & 0 & 1 & 2 &  3 & 4 & 5 &  6 & 7 \\\\
+  a(n) & 0 & 0 & 0 &  1 & 0 & 0 &  1 & 2 \\\\   b(n) & 1 & 1 & 1 & -1 & 1 & 1 & -1 & 1 \\\\
+  s(n) & 1 & 2 & 3 &  2 & 3 & 4 &  3 & 4 \end{array}$$
 
-Let F(n) be the fibonacci sequence defined by: F(0)=F(1)=1 and F(n)=F(n-1)+F(n-2) for n>1.
+The sequence $s(n)$ has the remarkable property that all elements are positive and every positive integer $k$ occurs exactly $k$ times.
 
-Define GF(t)=g(F(t),F(t-1)).
+Define $g(t, c)$, with $1 ≤ c ≤ t$, as the index in $s(n)$ for which $t$ occurs for the $c$'th time in $s(n)$.
 
-Find ΣGF(t) for 2≤t≤45.
+E.g.: $g(3, 3) = 6$, $g(4, 2) = 7$ and $g(54321, 12345) = 1\\,220\\,847\\,710$.
+
+Let $F(n)$ be the fibonacci sequence defined by:
+
+$$\begin{align}   & F(0) = F(1) = 1 \text{ and} \\\\
+  & F(n) = F(n - 1) + F(n - 2) \text{ for } n > 1. \end{align}$$
+
+Define $GF(t) = g(F(t), F(t - 1))$.
+
+Find $\sum GF(t)$ for$ 2 ≤ t ≤ 45$.
 
 # --hints--
 
-`euler384()` should return 3354706415856333000.
+`rudinShapiroSequence()` should return `3354706415856333000`.
 
 ```js
-assert.strictEqual(euler384(), 3354706415856333000);
+assert.strictEqual(rudinShapiroSequence(), 3354706415856333000);
 ```
 
 # --seed--
@@ -39,12 +50,12 @@ assert.strictEqual(euler384(), 3354706415856333000);
 ## --seed-contents--
 
 ```js
-function euler384() {
+function rudinShapiroSequence() {
 
   return true;
 }
 
-euler384();
+rudinShapiroSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md
index 3cb1e307632..96df0312f03 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md
@@ -1,36 +1,38 @@
 ---
 id: 5900f4ee1000cf542c510000
 title: 'Problem 385: Ellipses inside triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302049
 dashedName: problem-385-ellipses-inside-triangles
 ---
 
 # --description--
 
-For any triangle T in the plane, it can be shown that there is a unique ellipse with largest area that is completely inside T.
+For any triangle $T$ in the plane, it can be shown that there is a unique ellipse with largest area that is completely inside $T$.
 
-For a given n, consider triangles T such that:
+<img class="img-responsive center-block" alt="ellipse completely insisde of triangle" src="https://cdn.freecodecamp.org/curriculum/project-euler/ellipses-inside-triangles.png" style="background-color: white; padding: 10px;" />
 
--   the vertices of T have integer coordinates with absolute value ≤ n, and
--   the foci1 of the largest-area ellipse inside T are (√13,0) and (-√13,0).
+For a given $n$, consider triangles $T$ such that:
 
-Let A(n) be the sum of the areas of all such triangles.
+-   the vertices of $T$ have integer coordinates with absolute value $≤ n$, and
+-   the foci<sup>1</sup> of the largest-area ellipse inside $T$ are $(\sqrt{13}, 0)$ and $(-\sqrt{13}, 0)$.
 
-For example, if n = 8, there are two such triangles. Their vertices are (-4,-3),(-4,3),(8,0) and (4,3),(4,-3),(-8,0), and the area of each triangle is 36. Thus A(8) = 36 + 36 = 72.
+Let $A(n)$ be the sum of the areas of all such triangles.
 
-It can be verified that A(10) = 252, A(100) = 34632 and A(1000) = 3529008.
+For example, if $n = 8$, there are two such triangles. Their vertices are (-4,-3), (-4,3), (8,0) and (4,3), (4,-3), (-8,0), and the area of each triangle is 36. Thus $A(8) = 36 + 36 = 72$.
 
-Find A(1 000 000 000).
+It can be verified that $A(10) = 252$, $A(100) = 34\\,632$ and $A(1000) = 3\\,529\\,008$.
 
-1The foci (plural of focus) of an ellipse are two points A and B such that for every point P on the boundary of the ellipse, AP + PB is constant.
+Find $A(1\\,000\\,000\\,000)$.
+
+<sup>1</sup>The foci (plural of focus) of an ellipse are two points $A$ and $B$ such that for every point $P$ on the boundary of the ellipse, $AP + PB$ is constant.
 
 # --hints--
 
-`euler385()` should return 3776957309612154000.
+`ellipsesInsideTriangles()` should return `3776957309612154000`.
 
 ```js
-assert.strictEqual(euler385(), 3776957309612154000);
+assert.strictEqual(ellipsesInsideTriangles(), 3776957309612154000);
 ```
 
 # --seed--
@@ -38,12 +40,12 @@ assert.strictEqual(euler385(), 3776957309612154000);
 ## --seed-contents--
 
 ```js
-function euler385() {
+function ellipsesInsideTriangles() {
 
   return true;
 }
 
-euler385();
+ellipsesInsideTriangles();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.md
index 36a6ce965c8..de0614e4651 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.md
@@ -1,29 +1,33 @@
 ---
 id: 5900f4ef1000cf542c510001
 title: 'Problem 386: Maximum length of an antichain'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302050
 dashedName: problem-386-maximum-length-of-an-antichain
 ---
 
 # --description--
 
-Let n be an integer and S(n) be the set of factors of n.
+Let $n$ be an integer and $S(n)$ be the set of factors of $n$.
 
-A subset A of S(n) is called an antichain of S(n) if A contains only one element or if none of the elements of A divides any of the other elements of A.
+A subset $A$ of $S(n)$ is called an antichain of $S(n)$ if $A$ contains only one element or if none of the elements of $A$ divides any of the other elements of $A$.
 
-For example: S(30) = {1, 2, 3, 5, 6, 10, 15, 30} {2, 5, 6} is not an antichain of S(30). {2, 3, 5} is an antichain of S(30).
+For example: $S(30) = \\{1, 2, 3, 5, 6, 10, 15, 30\\}$
 
-Let N(n) be the maximum length of an antichain of S(n).
+$\\{2, 5, 6\\}$ is not an antichain of $S(30)$.
 
-Find ΣN(n) for 1 ≤ n ≤ 108
+$\\{2, 3, 5\\}$ is an antichain of $S(30)$.
+
+Let $N(n)$ be the maximum length of an antichain of $S(n)$.
+
+Find $\sum N(n)$ for $1 ≤ n ≤ {10}^8$
 
 # --hints--
 
-`euler386()` should return 528755790.
+`maximumLengthOfAntichain()` should return `528755790`.
 
 ```js
-assert.strictEqual(euler386(), 528755790);
+assert.strictEqual(maximumLengthOfAntichain(), 528755790);
 ```
 
 # --seed--
@@ -31,12 +35,12 @@ assert.strictEqual(euler386(), 528755790);
 ## --seed-contents--
 
 ```js
-function euler386() {
+function maximumLengthOfAntichain() {
 
   return true;
 }
 
-euler386();
+maximumLengthOfAntichain();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md
index aa3caddfe3e..2b2ccbbaa0e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4f11000cf542c510003
 title: 'Problem 387: Harshad Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302051
 dashedName: problem-387-harshad-numbers
 ---
@@ -18,20 +18,24 @@ When we truncate the last digit from 20, we get 2, which is also a Harshad numbe
 
 Let's call a Harshad number that, while recursively truncating the last digit, always results in a Harshad number a right truncatable Harshad number.
 
-Also: 201/3=67 which is prime. Let's call a Harshad number that, when divided by the sum of its digits, results in a prime a strong Harshad number.
+Also:
+
+$\frac{201}{3} = 67$ which is prime.
+
+Let's call a Harshad number that, when divided by the sum of its digits, results in a prime a strong Harshad number.
 
 Now take the number 2011 which is prime. When we truncate the last digit from it we get 201, a strong Harshad number that is also right truncatable. Let's call such primes strong, right truncatable Harshad primes.
 
 You are given that the sum of the strong, right truncatable Harshad primes less than 10000 is 90619.
 
-Find the sum of the strong, right truncatable Harshad primes less than 1014.
+Find the sum of the strong, right truncatable Harshad primes less than ${10}^{14}$.
 
 # --hints--
 
-`euler387()` should return 696067597313468.
+`harshadNumbers()` should return `696067597313468`.
 
 ```js
-assert.strictEqual(euler387(), 696067597313468);
+assert.strictEqual(harshadNumbers(), 696067597313468);
 ```
 
 # --seed--
@@ -39,12 +43,12 @@ assert.strictEqual(euler387(), 696067597313468);
 ## --seed-contents--
 
 ```js
-function euler387() {
+function harshadNumbers() {
 
   return true;
 }
 
-euler387();
+harshadNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md
index ba13e9be3cd..4ff7f140070 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f4f11000cf542c510002
 title: 'Problem 388: Distinct Lines'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302052
 dashedName: problem-388-distinct-lines
 ---
 
 # --description--
 
-Consider all lattice points (a,b,c) with 0 ≤ a,b,c ≤ N.
+Consider all lattice points ($a$, $b$, $c$) with $0 ≤ a, b, c ≤ N$.
 
-From the origin O(0,0,0) all lines are drawn to the other lattice points. Let D(N) be the number of distinct such lines.
+From the origin $O(0, 0, 0)$ all lines are drawn to the other lattice points. Let $D(N)$ be the number of distinct such lines.
 
-You are given that D(1 000 000) = 831909254469114121.
+You are given that $D(1\\,000\\,000) = 831\\,909\\,254\\,469\\,114\\,121$.
 
-Find D(1010). Give as your answer the first nine digits followed by the last nine digits.
+Find $D({10}^{10})$. Give as your answer the first nine digits followed by the last nine digits.
 
 # --hints--
 
-`euler388()` should return 831907372805130000.
+`distinctLines()` should return `831907372805130000`.
 
 ```js
-assert.strictEqual(euler388(), 831907372805130000);
+assert.strictEqual(distinctLines(), 831907372805130000);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler388(), 831907372805130000);
 ## --seed-contents--
 
 ```js
-function euler388() {
+function distinctLines() {
 
   return true;
 }
 
-euler388();
+distinctLines();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-389-platonic-dice.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-389-platonic-dice.md
index 0fb6bb2688e..081791ffe3b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-389-platonic-dice.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-389-platonic-dice.md
@@ -1,23 +1,31 @@
 ---
 id: 5900f4f21000cf542c510004
 title: 'Problem 389: Platonic Dice'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302053
 dashedName: problem-389-platonic-dice
 ---
 
 # --description--
 
-An unbiased single 4-sided die is thrown and its value, T, is noted.T unbiased 6-sided dice are thrown and their scores are added together. The sum, C, is noted.C unbiased 8-sided dice are thrown and their scores are added together. The sum, O, is noted.O unbiased 12-sided dice are thrown and their scores are added together. The sum, D, is noted.D unbiased 20-sided dice are thrown and their scores are added together. The sum, I, is noted.
+An unbiased single 4-sided die is thrown and its value, $T$, is noted.
 
-Find the variance of I, and give your answer rounded to 4 decimal places.
+$T$ unbiased 6-sided dice are thrown and their scores are added together. The sum, $C$, is noted.
+
+$C$ unbiased 8-sided dice are thrown and their scores are added together. The sum, $O$, is noted.
+
+$O$ unbiased 12-sided dice are thrown and their scores are added together. The sum, $D$, is noted.
+
+$D$ unbiased 20-sided dice are thrown and their scores are added together. The sum, $I$, is noted.
+
+Find the variance of $I$, and give your answer rounded to 4 decimal places.
 
 # --hints--
 
-`euler389()` should return 2406376.3623.
+`platonicDice()` should return `2406376.3623`.
 
 ```js
-assert.strictEqual(euler389(), 2406376.3623);
+assert.strictEqual(platonicDice(), 2406376.3623);
 ```
 
 # --seed--
@@ -25,12 +33,12 @@ assert.strictEqual(euler389(), 2406376.3623);
 ## --seed-contents--
 
 ```js
-function euler389() {
+function platonicDice() {
 
   return true;
 }
 
-euler389();
+platonicDice();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-39-integer-right-triangles.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-39-integer-right-triangles.md
index d19bb816b7f..f1957262624 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-39-integer-right-triangles.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-39-integer-right-triangles.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3931000cf542c50fea6
 title: 'Problem 39: Integer right triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302054
 dashedName: problem-39-integer-right-triangles
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.md
index e582b23f2d7..fa9e6f08884 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.md
@@ -1,31 +1,29 @@
 ---
 id: 5900f4f21000cf542c510005
 title: 'Problem 390: Triangles with non rational sides and integral area'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302055
 dashedName: problem-390-triangles-with-non-rational-sides-and-integral-area
 ---
 
 # --description--
 
-Consider the triangle with sides √5, √65 and √68.
+Consider the triangle with sides $\sqrt{5}$, $\sqrt{65}$ and $\sqrt{68}$. It can be shown that this triangle has area 9.
 
-It can be shown that this triangle has area 9.
+$S(n)$ is the sum of the areas of all triangles with sides $\sqrt{1 + b^2}$, $\sqrt{1 + c^2}$ and $\sqrt{b^2 + c^2}$ (for positive integers $b$ and $c$) that have an integral area not exceeding $n$.
 
-S(n) is the sum of the areas of all triangles with sides √(1+b2), √(1+c2) and √(b2+c2) (for positive integers b and c ) that have an integral area not exceeding n.
+The example triangle has $b = 2$ and $c = 8$.
 
-The example triangle has b=2 and c=8.
+$S({10}^6) = 18\\,018\\,206$.
 
-S(106)=18018206.
-
-Find S(1010).
+Find $S({10}^{10})$.
 
 # --hints--
 
-`euler390()` should return 2919133642971.
+`nonRationalSidesAndIntegralArea()` should return `2919133642971`.
 
 ```js
-assert.strictEqual(euler390(), 2919133642971);
+assert.strictEqual(nonRationalSidesAndIntegralArea(), 2919133642971);
 ```
 
 # --seed--
@@ -33,12 +31,12 @@ assert.strictEqual(euler390(), 2919133642971);
 ## --seed-contents--
 
 ```js
-function euler390() {
+function nonRationalSidesAndIntegralArea() {
 
   return true;
 }
 
-euler390();
+nonRationalSidesAndIntegralArea();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-391-hopping-game.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-391-hopping-game.md
index 4eda36c0a45..e94e14e527b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-391-hopping-game.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-391-hopping-game.md
@@ -1,35 +1,42 @@
 ---
 id: 5900f4f31000cf542c510006
 title: 'Problem 391: Hopping Game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302056
 dashedName: problem-391-hopping-game
 ---
 
 # --description--
 
-Let sk be the number of 1’s when writing the numbers from 0 to k in binary.
+Let $s_k$ be the number of 1’s when writing the numbers from 0 to $k$ in binary.
 
-For example, writing 0 to 5 in binary, we have 0, 1, 10, 11, 100, 101. There are seven 1’s, so s5 = 7.
+For example, writing 0 to 5 in binary, we have 0, 1, 10, 11, 100, 101. There are seven 1’s, so $s_5 = 7$.
 
-The sequence S = {sk : k ≥ 0} starts {0, 1, 2, 4, 5, 7, 9, 12, ...}.
+The sequence $S = \\{s_k : k ≥ 0\\}$ starts $\\{0, 1, 2, 4, 5, 7, 9, 12, \ldots\\}$.
 
-A game is played by two players. Before the game starts, a number n is chosen. A counter c starts at 0. At each turn, the player chooses a number from 1 to n (inclusive) and increases c by that number. The resulting value of c must be a member of S. If there are no more valid moves, the player loses.
+A game is played by two players. Before the game starts, a number $n$ is chosen. A counter $c$ starts at 0. At each turn, the player chooses a number from 1 to $n$ (inclusive) and increases $c$ by that number. The resulting value of $c$ must be a member of $S$. If there are no more valid moves, the player loses.
 
-For example: Let n = 5. c starts at 0. Player 1 chooses 4, so c becomes 0 + 4 = 4. Player 2 chooses 5, so c becomes 4 + 5 = 9. Player 1 chooses 3, so c becomes 9 + 3 = 12. etc. Note that c must always belong to S, and each player can increase c by at most n.
+For example, with $n = 5$ and starting with $c = 0$:
 
-Let M(n) be the highest number the first player can choose at her first turn to force a win, and M(n) = 0 if there is no such move. For example, M(2) = 2, M(7) = 1 and M(20) = 4.
+- Player 1 chooses 4, so $c$ becomes $0 + 4 = 4$.
+- Player 2 chooses 5, so $c$ becomes $4 + 5 = 9$.
+- Player 1 chooses 3, so $c$ becomes $9 + 3 = 12$.
+- etc.
 
-Given Σ(M(n))3 = 8150 for 1 ≤ n ≤ 20.
+Note that $c$ must always belong to $S$, and each player can increase $c$ by at most $n$.
 
-Find Σ(M(n))3 for 1 ≤ n ≤ 1000.
+Let $M(n)$ be the highest number the first player can choose at her first turn to force a win, and $M(n) = 0$ if there is no such move. For example, $M(2) = 2$, $M(7) = 1$ and $M(20) = 4$.
+
+It can be verified $\sum M{(n)}^3 = 8150$ for $1 ≤ n ≤ 20$.
+
+Find $\sum M{(n)}^3$ for $1 ≤ n ≤ 1000$.
 
 # --hints--
 
-`euler391()` should return 61029882288.
+`hoppingGame()` should return `61029882288`.
 
 ```js
-assert.strictEqual(euler391(), 61029882288);
+assert.strictEqual(hoppingGame(), 61029882288);
 ```
 
 # --seed--
@@ -37,12 +44,12 @@ assert.strictEqual(euler391(), 61029882288);
 ## --seed-contents--
 
 ```js
-function euler391() {
+function hoppingGame() {
 
   return true;
 }
 
-euler391();
+hoppingGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md
index cd4d53f17da..7e40a574c29 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4f41000cf542c510007
 title: 'Problem 392: Enmeshed unit circle'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302057
 dashedName: problem-392-enmeshed-unit-circle
 ---
@@ -12,20 +12,30 @@ A rectilinear grid is an orthogonal grid where the spacing between the gridlines
 
 An example of such grid is logarithmic graph paper.
 
-Consider rectilinear grids in the Cartesian coordinate system with the following properties:The gridlines are parallel to the axes of the Cartesian coordinate system.There are N+2 vertical and N+2 horizontal gridlines. Hence there are (N+1) x (N+1) rectangular cells.The equations of the two outer vertical gridlines are x = -1 and x = 1.The equations of the two outer horizontal gridlines are y = -1 and y = 1.The grid cells are colored red if they overlap with the unit circle, black otherwise.For this problem we would like you to find the positions of the remaining N inner horizontal and N inner vertical gridlines so that the area occupied by the red cells is minimized.
+Consider rectilinear grids in the Cartesian coordinate system with the following properties:
 
-E.g. here is a picture of the solution for N = 10:
+- The gridlines are parallel to the axes of the Cartesian coordinate system.
+- There are $N + 2$ vertical and $N + 2$ horizontal gridlines. Hence there are $(N + 1) \times (N + 1)$ rectangular cells.
+- The equations of the two outer vertical gridlines are $x = -1$ and $x = 1$.
+- The equations of the two outer horizontal gridlines are $y = -1$ and $y = 1$.
+- The grid cells are colored red if they overlap with the unit circle, black otherwise.
 
-The area occupied by the red cells for N = 10 rounded to 10 digits behind the decimal point is 3.3469640797.
+For this problem we would like you to find the positions of the remaining $N$ inner horizontal and $N$ inner vertical gridlines so that the area occupied by the red cells is minimized.
 
-Find the positions for N = 400. Give as your answer the area occupied by the red cells rounded to 10 digits behind the decimal point.
+E.g. here is a picture of the solution for $N = 10$:
+
+<img class="img-responsive center-block" alt="solution for N = 10" src="https://cdn.freecodecamp.org/curriculum/project-euler/enmeshed-unit-circle.png" style="background-color: white; padding: 10px;" />
+
+The area occupied by the red cells for $N = 10$ rounded to 10 digits behind the decimal point is 3.3469640797.
+
+Find the positions for $N = 400$. Give as your answer the area occupied by the red cells rounded to 10 digits behind the decimal point.
 
 # --hints--
 
-`euler392()` should return 3.1486734435.
+`enmeshedUnitCircle()` should return `3.1486734435`.
 
 ```js
-assert.strictEqual(euler392(), 3.1486734435);
+assert.strictEqual(enmeshedUnitCircle(), 3.1486734435);
 ```
 
 # --seed--
@@ -33,12 +43,12 @@ assert.strictEqual(euler392(), 3.1486734435);
 ## --seed-contents--
 
 ```js
-function euler392() {
+function enmeshedUnitCircle() {
 
   return true;
 }
 
-euler392();
+enmeshedUnitCircle();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md
index 21f98ec10cc..28a0b4d745c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f4f61000cf542c510008
 title: 'Problem 393: Migrating ants'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302058
 dashedName: problem-393-migrating-ants
 ---
 
 # --description--
 
-An n×n grid of squares contains n2 ants, one ant per square.
+An $n × n$ grid of squares contains $n^2$ ants, one ant per square.
 
 All ants decide to move simultaneously to an adjacent square (usually 4 possibilities, except for ants on the edge of the grid or at the corners).
 
-We define f(n) to be the number of ways this can happen without any ants ending on the same square and without any two ants crossing the same edge between two squares.
+We define $f(n)$ to be the number of ways this can happen without any ants ending on the same square and without any two ants crossing the same edge between two squares.
 
-You are given that f(4) = 88. Find f(10).
+You are given that $f(4) = 88$.
+
+Find $f(10)$.
 
 # --hints--
 
-`euler393()` should return 112398351350823100.
+`migratingAnts()` should return `112398351350823100`.
 
 ```js
-assert.strictEqual(euler393(), 112398351350823100);
+assert.strictEqual(migratingAnts(), 112398351350823100);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler393(), 112398351350823100);
 ## --seed-contents--
 
 ```js
-function euler393() {
+function migratingAnts() {
 
   return true;
 }
 
-euler393();
+migratingAnts();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-394-eating-pie.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-394-eating-pie.md
index 26c7bce3a95..a6b40bf39bc 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-394-eating-pie.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-394-eating-pie.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4f71000cf542c510009
 title: 'Problem 394: Eating pie'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302059
 dashedName: problem-394-eating-pie
 ---
@@ -12,24 +12,25 @@ Jeff eats a pie in an unusual way.
 
 The pie is circular. He starts with slicing an initial cut in the pie along a radius.
 
-While there is at least a given fraction F of pie left, he performs the following procedure:
+While there is at least a given fraction $F$ of pie left, he performs the following procedure:
 
-\- He makes two slices from the pie centre to any point of what is remaining of the pie border, any point on the remaining pie border equally likely. This will divide the remaining pie into three pieces.
+- He makes two slices from the pie centre to any point of what is remaining of the pie border, any point on the remaining pie border equally likely. This will divide the remaining pie into three pieces.
+- Going counterclockwise from the initial cut, he takes the first two pie pieces and eats them.
 
-\- Going counterclockwise from the initial cut, he takes the first two pie pieces and eats them.
+When less than a fraction $F$ of pie remains, he does not repeat this procedure. Instead, he eats all of the remaining pie.
 
-When less than a fraction F of pie remains, he does not repeat this procedure. Instead, he eats all of the remaining pie.
+<img class="img-responsive center-block" alt="animation of pie slicing procedure" src="https://cdn.freecodecamp.org/curriculum/project-euler/eating-pie.gif" style="background-color: white; padding: 10px;" />
 
-For x ≥ 1, let E(x) be the expected number of times Jeff repeats the procedure above with F = 1/x. It can be verified that E(1) = 1, E(2) ≈ 1.2676536759, and E(7.5) ≈ 2.1215732071.
+For $x ≥ 1$, let $E(x)$ be the expected number of times Jeff repeats the procedure above with $F = \frac{1}{x}$. It can be verified that $E(1) = 1$, $E(2) ≈ 1.2676536759$, and $E(7.5) ≈ 2.1215732071$.
 
-Find E(40) rounded to 10 decimal places behind the decimal point.
+Find $E(40)$ rounded to 10 decimal places behind the decimal point.
 
 # --hints--
 
-`euler394()` should return 3.2370342194.
+`eatingPie()` should return `3.2370342194`.
 
 ```js
-assert.strictEqual(euler394(), 3.2370342194);
+assert.strictEqual(eatingPie(), 3.2370342194);
 ```
 
 # --seed--
@@ -37,12 +38,12 @@ assert.strictEqual(euler394(), 3.2370342194);
 ## --seed-contents--
 
 ```js
-function euler394() {
+function eatingPie() {
 
   return true;
 }
 
-euler394();
+eatingPie();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md
index 80903ac0ef5..cff705c06fb 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4f71000cf542c51000a
 title: 'Problem 395: Pythagorean tree'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302060
 dashedName: problem-395-pythagorean-tree
 ---
@@ -10,20 +10,26 @@ dashedName: problem-395-pythagorean-tree
 
 The Pythagorean tree is a fractal generated by the following procedure:
 
-Start with a unit square. Then, calling one of the sides its base (in the animation, the bottom side is the base): Attach a right triangle to the side opposite the base, with the hypotenuse coinciding with that side and with the sides in a 3-4-5 ratio. Note that the smaller side of the triangle must be on the 'right' side with respect to the base (see animation). Attach a square to each leg of the right triangle, with one of its sides coinciding with that leg. Repeat this procedure for both squares, considering as their bases the sides touching the triangle.
+Start with a unit square. Then, calling one of the sides its base (in the animation, the bottom side is the base):
+
+1. Attach a right triangle to the side opposite the base, with the hypotenuse coinciding with that side and with the sides in a 3-4-5 ratio. Note that the smaller side of the triangle must be on the 'right' side with respect to the base (see animation).
+2. Attach a square to each leg of the right triangle, with one of its sides coinciding with that leg.
+3. Repeat this procedure for both squares, considering as their bases the sides touching the triangle.
 
 The resulting figure, after an infinite number of iterations, is the Pythagorean tree.
 
+<img class="img-responsive center-block" alt="animation showing 8 iterations of the procedure" src="https://cdn.freecodecamp.org/curriculum/project-euler/pythagorean-tree.gif" style="background-color: white; padding: 10px;" />
+
 It can be shown that there exists at least one rectangle, whose sides are parallel to the largest square of the Pythagorean tree, which encloses the Pythagorean tree completely.
 
 Find the smallest area possible for such a bounding rectangle, and give your answer rounded to 10 decimal places.
 
 # --hints--
 
-`euler395()` should return 28.2453753155.
+`pythagoreanTree()` should return `28.2453753155`.
 
 ```js
-assert.strictEqual(euler395(), 28.2453753155);
+assert.strictEqual(pythagoreanTree(), 28.2453753155);
 ```
 
 # --seed--
@@ -31,12 +37,12 @@ assert.strictEqual(euler395(), 28.2453753155);
 ## --seed-contents--
 
 ```js
-function euler395() {
+function pythagoreanTree() {
 
   return true;
 }
 
-euler395();
+pythagoreanTree();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.md
index bb98b389ba5..33d738c128b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.md
@@ -1,37 +1,45 @@
 ---
 id: 5900f4f81000cf542c51000b
 title: 'Problem 396: Weak Goodstein sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302061
 dashedName: problem-396-weak-goodstein-sequence
 ---
 
 # --description--
 
-For any positive integer n, the nth weak Goodstein sequence {g1, g2, g3, ...} is defined as:
+For any positive integer $n$, the $n$th weak Goodstein sequence $\\{g1, g2, g3, \ldots\\}$ is defined as:
 
-g1 = n
+- $g_1 = n$
+- for $k > 1$, $g_k$ is obtained by writing $g_{k - 1}$ in base $k$, interpreting it as a base $k + 1$ number, and subtracting 1.
 
-for k > 1, gk is obtained by writing gk-1 in base k, interpreting it as a base k + 1 number, and subtracting 1.
+The sequence terminates when $g_k$ becomes 0.
 
-The sequence terminates when gk becomes 0.
+For example, the $6$th weak Goodstein sequence is $\\{6, 11, 17, 25, \ldots\\}$:
 
-For example, the 6th weak Goodstein sequence is {6, 11, 17, 25, ...}: g1 = 6. g2 = 11 since 6 = 1102, 1103 = 12, and 12 - 1 = 11. g3 = 17 since 11 = 1023, 1024 = 18, and 18 - 1 = 17. g4 = 25 since 17 = 1014, 1015 = 26, and 26 - 1 = 25.
+- $g_1 = 6$.
+- $g_2 = 11$ since $6 = 110_2$, $110_3 = 12$, and $12 - 1 = 11$.
+- $g_3 = 17$ since $11 = 102_3$, $102_4 = 18$, and $18 - 1 = 17$.
+- $g_4 = 25$ since $17 = 101_4$, $101_5 = 26$, and $26 - 1 = 25$.
 
 and so on.
 
 It can be shown that every weak Goodstein sequence terminates.
 
-Let G(n) be the number of nonzero elements in the nth weak Goodstein sequence. It can be verified that G(2) = 3, G(4) = 21 and G(6) = 381. It can also be verified that ΣG(n) = 2517 for 1 ≤ n &lt; 8.
+Let $G(n)$ be the number of nonzero elements in the $n$th weak Goodstein sequence.
 
-Find the last 9 digits of ΣG(n) for 1 ≤ n &lt; 16.
+It can be verified that $G(2) = 3$, $G(4) = 21$ and $G(6) = 381$.
+
+It can also be verified that $\sum G(n) = 2517$ for $1 ≤ n &lt; 8$.
+
+Find the last 9 digits of $\sum G(n)$ for $1 ≤ n &lt; 16$.
 
 # --hints--
 
-`euler396()` should return 173214653.
+`weakGoodsteinSequence()` should return `173214653`.
 
 ```js
-assert.strictEqual(euler396(), 173214653);
+assert.strictEqual(weakGoodsteinSequence(), 173214653);
 ```
 
 # --seed--
@@ -39,12 +47,12 @@ assert.strictEqual(euler396(), 173214653);
 ## --seed-contents--
 
 ```js
-function euler396() {
+function weakGoodsteinSequence() {
 
   return true;
 }
 
-euler396();
+weakGoodsteinSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.md
index d8d95c2dd3a..2d9fc181db3 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.md
@@ -1,25 +1,27 @@
 ---
 id: 5900f4f91000cf542c51000c
 title: 'Problem 397: Triangle on parabola'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302062
 dashedName: problem-397-triangle-on-parabola
 ---
 
 # --description--
 
-On the parabola y = x2/k, three points A(a, a2/k), B(b, b2/k) and C(c, c2/k) are chosen.
+On the parabola $y = \frac{x^2}{k}$, three points $A(a, \frac{a^2}{k})$, $B(b, \frac{b^2}{k})$ and $C(c, \frac{c^2}{k})$ are chosen.
 
-Let F(K, X) be the number of the integer quadruplets (k, a, b, c) such that at least one angle of the triangle ABC is 45-degree, with 1 ≤ k ≤ K and -X ≤ a &lt; b &lt; c ≤ X.
+Let $F(K, X)$ be the number of the integer quadruplets $(k, a, b, c)$ such that at least one angle of the triangle $ABC$ is 45°, with $1 ≤ k ≤ K$ and $-X ≤ a &lt; b &lt; c ≤ X$.
 
-For example, F(1, 10) = 41 and F(10, 100) = 12492. Find F(106, 109).
+For example, $F(1, 10) = 41$ and $F(10, 100) = 12\\,492$.
+
+Find $F({10}^6, {10}^9)$.
 
 # --hints--
 
-`euler397()` should return 141630459461893730.
+`triangleOnParabola()` should return `141630459461893730`.
 
 ```js
-assert.strictEqual(euler397(), 141630459461893730);
+assert.strictEqual(triangleOnParabola(), 141630459461893730);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler397(), 141630459461893730);
 ## --seed-contents--
 
 ```js
-function euler397() {
+function triangleOnParabola() {
 
   return true;
 }
 
-euler397();
+triangleOnParabola();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-398-cutting-rope.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-398-cutting-rope.md
index 4b145fdfbc2..ade33707928 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-398-cutting-rope.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-398-cutting-rope.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f4fa1000cf542c51000d
 title: 'Problem 398: Cutting rope'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302063
 dashedName: problem-398-cutting-rope
 ---
 
 # --description--
 
-Inside a rope of length n, n-1 points are placed with distance 1 from each other and from the endpoints. Among these points, we choose m-1 points at random and cut the rope at these points to create m segments.
+Inside a rope of length $n$, $n - 1$ points are placed with distance 1 from each other and from the endpoints. Among these points, we choose $m - 1$ points at random and cut the rope at these points to create $m$ segments.
 
-Let E(n, m) be the expected length of the second-shortest segment. For example, E(3, 2) = 2 and E(8, 3) = 16/7. Note that if multiple segments have the same shortest length the length of the second-shortest segment is defined as the same as the shortest length.
+Let $E(n, m)$ be the expected length of the second-shortest segment. For example, $E(3, 2) = 2$ and $E(8, 3) = \frac{16}{7}$. Note that if multiple segments have the same shortest length the length of the second-shortest segment is defined as the same as the shortest length.
 
-Find E(107, 100). Give your answer rounded to 5 decimal places behind the decimal point.
+Find $E({10}^7, 100)$. Give your answer rounded to 5 decimal places behind the decimal point.
 
 # --hints--
 
-`euler398()` should return 2010.59096.
+`cuttingRope()` should return `2010.59096`.
 
 ```js
-assert.strictEqual(euler398(), 2010.59096);
+assert.strictEqual(cuttingRope(), 2010.59096);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler398(), 2010.59096);
 ## --seed-contents--
 
 ```js
-function euler398() {
+function cuttingRope() {
 
   return true;
 }
 
-euler398();
+cuttingRope();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.md
index b61d13a3365..37a34ad1549 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4fc1000cf542c51000e
 title: 'Problem 399: Squarefree Fibonacci Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302064
 dashedName: problem-399-squarefree-fibonacci-numbers
 ---
@@ -10,28 +10,34 @@ dashedName: problem-399-squarefree-fibonacci-numbers
 
 The first 15 fibonacci numbers are:
 
-1,1,2,3,5,8,13,21,34,55,89,144,233,377,610.
+$$1,1,2,3,5,8,13,21,34,55,89,144,233,377,610.$$
 
 It can be seen that 8 and 144 are not squarefree: 8 is divisible by 4 and 144 is divisible by 4 and by 9.
 
 So the first 13 squarefree fibonacci numbers are:
 
-1,1,2,3,5,13,21,34,55,89,233,377 and 610.
+$$1,1,2,3,5,13,21,34,55,89,233,377 \text{ and } 610.$$
 
-The 200th squarefree fibonacci number is: 971183874599339129547649988289594072811608739584170445. The last sixteen digits of this number are: 1608739584170445 and in scientific notation this number can be written as 9.7e53.
+The $200$th squarefree fibonacci number is: 971183874599339129547649988289594072811608739584170445. The last sixteen digits of this number are: 1608739584170445 and in scientific notation this number can be written as `9.7e53`.
 
-Find the 100 000 000th squarefree fibonacci number. Give as your answer its last sixteen digits followed by a comma followed by the number in scientific notation (rounded to one digit after the decimal point). For the 200th squarefree number the answer would have been: 1608739584170445,9.7e53
+Find the $100\\,000\\,000$th squarefree fibonacci number. Give as your answer as a string with its last sixteen digits followed by a comma followed by the number in scientific notation (rounded to one digit after the decimal point). For the $200$th squarefree number the answer would have been: `1608739584170445,9.7e53`
 
-Note: For this problem, assume that for every prime p, the first fibonacci number divisible by p is not divisible by p2 (this is part of Wall's conjecture). This has been verified for primes ≤ 3·1015, but has not been proven in general.
+**Note:** For this problem, assume that for every prime $p$, the first fibonacci number divisible by $p$ is not divisible by $p^2$ (this is part of Wall's conjecture). This has been verified for primes $≤ 3 \times {10}^{15}$, but has not been proven in general.
 
-If it happens that the conjecture is false, then the accepted answer to this problem isn't guaranteed to be the 100 000 000th squarefree fibonacci number, rather it represents only a lower bound for that number.
+If it happens that the conjecture is false, then the accepted answer to this problem isn't guaranteed to be the $100\\,000\\,000$th squarefree fibonacci number, rather it represents only a lower bound for that number.
 
 # --hints--
 
-`euler399()` should return 1508395636674243, 6.5e27330467.
+`squarefreeFibonacciNumbers()` should return a string.
 
 ```js
-assert.strictEqual(euler399(), 1508395636674243, 6.5e27330467);
+assert(typeof squarefreeFibonacciNumbers() === 'string');
+```
+
+`squarefreeFibonacciNumbers()` should return the string `1508395636674243,6.5e27330467`.
+
+```js
+assert.strictEqual(squarefreeFibonacciNumbers(), '1508395636674243,6.5e27330467');
 ```
 
 # --seed--
@@ -39,12 +45,12 @@ assert.strictEqual(euler399(), 1508395636674243, 6.5e27330467);
 ## --seed-contents--
 
 ```js
-function euler399() {
+function squarefreeFibonacciNumbers() {
 
   return true;
 }
 
-euler399();
+squarefreeFibonacciNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-40-champernownes-constant.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-40-champernownes-constant.md
index f7f6c8f51fb..c4386bd2d91 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-40-champernownes-constant.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-40-champernownes-constant.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3941000cf542c50fea7
 title: 'Problem 40: Champernowne''s constant'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302066
 dashedName: problem-40-champernownes-constant
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md
index 07e767a5ba6..f9ec337c1a9 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md
@@ -1,35 +1,37 @@
 ---
 id: 5900f4fe1000cf542c510010
 title: 'Problem 400: Fibonacci tree game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302067
 dashedName: problem-400-fibonacci-tree-game
 ---
 
 # --description--
 
-A Fibonacci tree is a binary tree recursively defined as:T(0) is the empty tree.
+A Fibonacci tree is a binary tree recursively defined as:
 
-T(1) is the binary tree with only one node.
-
-T(k) consists of a root node that has T(k-1) and T(k-2) as children.
+- $T(0)$ is the empty tree.
+- $T(1)$ is the binary tree with only one node.
+- $T(k)$ consists of a root node that has $T(k - 1)$ and $T(k - 2)$ as children.
 
 On such a tree two players play a take-away game. On each turn a player selects a node and removes that node along with the subtree rooted at that node. The player who is forced to take the root node of the entire tree loses.
 
-Here are the winning moves of the first player on the first turn for T(k) from k=1 to k=6.
+Here are the winning moves of the first player on the first turn for $T(k)$ from $k = 1$ to $k = 6$.
 
-Let f(k) be the number of winning moves of the first player (i.e. the moves for which the second player has no winning strategy) on the first turn of the game when this game is played on T(k).
+<img class="img-responsive center-block" alt="winning moves of first player, on the first turn for k = 1 to k = 6" src="https://cdn.freecodecamp.org/curriculum/project-euler/fibonacci-tree-game.png" style="background-color: white; padding: 10px;" />
 
-For example, f(5) = 1 and f(10) = 17.
+Let $f(k)$ be the number of winning moves of the first player (i.e. the moves for which the second player has no winning strategy) on the first turn of the game when this game is played on $T(k)$.
 
-Find f(10000). Give the last 18 digits of your answer.
+For example, $f(5) = 1$ and $f(10) = 17$.
+
+Encuentra $f(10000)$. Give the last 18 digits of your answer.
 
 # --hints--
 
-`euler400()` should return 438505383468410600.
+`fibonacciTreeGame()` should return `438505383468410600`.
 
 ```js
-assert.strictEqual(euler400(), 438505383468410600);
+assert.strictEqual(fibonacciTreeGame(), 438505383468410600);
 ```
 
 # --seed--
@@ -37,12 +39,12 @@ assert.strictEqual(euler400(), 438505383468410600);
 ## --seed-contents--
 
 ```js
-function euler400() {
+function fibonacciTreeGame() {
 
   return true;
 }
 
-euler400();
+fibonacciTreeGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.md
index d1c5ca48cc8..eb0c0459100 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f4fd1000cf542c51000f
 title: 'Problem 401: Sum of squares of divisors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302069
 dashedName: problem-401-sum-of-squares-of-divisors
 ---
 
 # --description--
 
-The divisors of 6 are 1,2,3 and 6.
+The divisors of 6 are 1, 2, 3 and 6.
 
-The sum of the squares of these numbers is 1+4+9+36=50.
+The sum of the squares of these numbers is $1 + 4 + 9 + 36 = 50$.
 
-Let sigma2(n) represent the sum of the squares of the divisors of n. Thus sigma2(6)=50.
+Let $\sigma_2(n)$ represent the sum of the squares of the divisors of $n$. Thus $\sigma_2(6) = 50$.
 
-Let SIGMA2 represent the summatory function of sigma2, that is SIGMA2(n)=∑sigma2(i) for i=1 to n. The first 6 values of SIGMA2 are: 1,6,16,37,63 and 113.
+Let $\Sigma_2$ represent the summatory function of $\sigma_2$, that is $\Sigma_2(n) = \sum \sigma_2(i)$ for $i=1$ to $n$. The first 6 values of $\Sigma_2$ are: 1, 6, 16, 37, 63 and 113.
 
-Find SIGMA2(1015) modulo 109.
+Find $\Sigma_2({10}^{15})$ modulo ${10}^9$.
 
 # --hints--
 
-`euler401()` should return 281632621.
+`sumOfSquaresDivisors()` should return `281632621`.
 
 ```js
-assert.strictEqual(euler401(), 281632621);
+assert.strictEqual(sumOfSquaresDivisors(), 281632621);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler401(), 281632621);
 ## --seed-contents--
 
 ```js
-function euler401() {
+function sumOfSquaresDivisors() {
 
   return true;
 }
 
-euler401();
+sumOfSquaresDivisors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.md
index b4c4a63fe8d..cdda26ea631 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.md
@@ -1,31 +1,34 @@
 ---
 id: 5900f4ff1000cf542c510011
 title: 'Problem 402: Integer-valued polynomials'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302070
 dashedName: problem-402-integer-valued-polynomials
 ---
 
 # --description--
 
-It can be shown that the polynomial n4 + 4n3 + 2n2 + 5n is a multiple of 6 for every integer n. It can also be shown that 6 is the largest integer satisfying this property.
+It can be shown that the polynomial $n^4 + 4n^3 + 2n^2 + 5n$ is a multiple of 6 for every integer $n$. It can also be shown that 6 is the largest integer satisfying this property.
 
-Define M(a, b, c) as the maximum m such that n4 + an3 + bn2 + cn is a multiple of m for all integers n. For example, M(4, 2, 5) = 6.
+Define $M(a, b, c)$ as the maximum $m$ such that $n^4 + an^3 + bn^2 + cn$ is a multiple of $m$ for all integers $n$. For example, $M(4, 2, 5) = 6$.
 
-Also, define S(N) as the sum of M(a, b, c) for all 0 &lt; a, b, c ≤ N.
+Also, define $S(N)$ as the sum of $M(a, b, c)$ for all $0 &lt; a, b, c ≤ N$.
 
-We can verify that S(10) = 1972 and S(10000) = 2024258331114.
+We can verify that $S(10) = 1\\,972$ and $S(10\\,000) = 2\\,024\\,258\\,331\\,114$.
 
-Let Fk be the Fibonacci sequence: F0 = 0, F1 = 1 and Fk = Fk-1 + Fk-2 for k ≥ 2.
+Let $F_k$ be the Fibonacci sequence:
 
-Find the last 9 digits of Σ S(Fk) for 2 ≤ k ≤ 1234567890123.
+- $F_0 = 0$, $F_1 = 1$ and
+- $F_k = F_{k - 1} + F_{k - 2}$ for $k ≥ 2$.
+
+Find the last 9 digits of $\sum S(F_k)$ for $2 ≤ k ≤ 1\\,234\\,567\\,890\\,123$.
 
 # --hints--
 
-`euler402()` should return 356019862.
+`integerValuedPolynomials()` should return `356019862`.
 
 ```js
-assert.strictEqual(euler402(), 356019862);
+assert.strictEqual(integerValuedPolynomials(), 356019862);
 ```
 
 # --seed--
@@ -33,12 +36,12 @@ assert.strictEqual(euler402(), 356019862);
 ## --seed-contents--
 
 ```js
-function euler402() {
+function integerValuedPolynomials() {
 
   return true;
 }
 
-euler402();
+integerValuedPolynomials();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.md
index d854a56f4ac..e3f8bfaae35 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f5001000cf542c510013
 title: 'Problem 403: Lattice points enclosed by parabola and line'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302071
 dashedName: problem-403-lattice-points-enclosed-by-parabola-and-line
 ---
 
 # --description--
 
-For integers a and b, we define D(a, b) as the domain enclosed by the parabola y = x2 and the line y = a·x + b:D(a, b) = { (x, y) | x2 ≤ y ≤ a·x + b }.
+For integers $a$ and $b$, we define $D(a, b)$ as the domain enclosed by the parabola $y = x^2$ and the line $y = ax + b: D(a, b) = \\{ (x, y) | x^2 ≤ y ≤ ax + b \\}$.
 
-L(a, b) is defined as the number of lattice points contained in D(a, b). For example, L(1, 2) = 8 and L(2, -1) = 1.
+$L(a, b)$ is defined as the number of lattice points contained in $D(a, b)$. For example, $L(1, 2) = 8$ and $L(2, -1) = 1$.
 
-We also define S(N) as the sum of L(a, b) for all the pairs (a, b) such that the area of D(a, b) is a rational number and |a|,|b| ≤ N. We can verify that S(5) = 344 and S(100) = 26709528.
+We also define $S(N)$ as the sum of $L(a, b)$ for all the pairs ($a$, $b$) such that the area of $D(a, b)$ is a rational number and $|a|,|b| ≤ N$.
 
-Find S(1012). Give your answer mod 108.
+We can verify that $S(5) = 344$ and $S(100) = 26\\,709\\,528$.
+
+Find $S({10}^{12})$. Give your answer $\bmod {10}^8$.
 
 # --hints--
 
-`euler403()` should return 18224771.
+`latticePoints()` should return `18224771`.
 
 ```js
-assert.strictEqual(euler403(), 18224771);
+assert.strictEqual(latticePoints(), 18224771);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler403(), 18224771);
 ## --seed-contents--
 
 ```js
-function euler403() {
+function latticePoints() {
 
   return true;
 }
 
-euler403();
+latticePoints();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md
index 6b7341cea49..92690bd7a6d 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md
@@ -1,29 +1,37 @@
 ---
 id: 5900f5001000cf542c510012
 title: 'Problem 404: Crisscross Ellipses'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302072
 dashedName: problem-404-crisscross-ellipses
 ---
 
 # --description--
 
-Ea is an ellipse with an equation of the form x2 + 4y2 = 4a2.
+$E_a$ is an ellipse with an equation of the form $x^2 + 4y^2 = 4a^2$.
 
-Ea' is the rotated image of Ea by θ degrees counterclockwise around the origin O(0, 0) for 0° &lt; θ &lt; 90°.
+$E_a'$ is the rotated image of $E_a$ by $θ$ degrees counterclockwise around the origin $O(0, 0)$ for $0° &lt; θ &lt; 90°$.
 
-b is the distance to the origin of the two intersection points closest to the origin and c is the distance of the two other intersection points. We call an ordered triplet (a, b, c) a canonical ellipsoidal triplet if a, b and c are positive integers. For example, (209, 247, 286) is a canonical ellipsoidal triplet.
+<img class="img-responsive center-block" alt="ellipse E_a and ellipse rotated by θ degrees E_a'" src="https://cdn.freecodecamp.org/curriculum/project-euler/crisscross-ellipses.gif" style="background-color: white; padding: 10px;" />
 
-Let C(N) be the number of distinct canonical ellipsoidal triplets (a, b, c) for a ≤ N. It can be verified that C(103) = 7, C(104) = 106 and C(106) = 11845.
+$b$ is the distance to the origin of the two intersection points closest to the origin and $c$ is the distance of the two other intersection points.
 
-Find C(1017).
+We call an ordered triplet ($a$, $b$, $c$) a canonical ellipsoidal triplet if $a$, $b$ and $c$ are positive integers.
+
+For example, (209, 247, 286) is a canonical ellipsoidal triplet.
+
+Let $C(N)$ be the number of distinct canonical ellipsoidal triplets ($a$, $b$, $c$) for $a ≤ N$.
+
+It can be verified that $C({10}^3) = 7$, $C({10}^4) = 106$ and $C({10}^6) = 11\\,845$.
+
+Find $C({10}^{17})$.
 
 # --hints--
 
-`euler404()` should return 1199215615081353.
+`crisscrossEllipses()` should return `1199215615081353`.
 
 ```js
-assert.strictEqual(euler404(), 1199215615081353);
+assert.strictEqual(crisscrossEllipses(), 1199215615081353);
 ```
 
 # --seed--
@@ -31,12 +39,12 @@ assert.strictEqual(euler404(), 1199215615081353);
 ## --seed-contents--
 
 ```js
-function euler404() {
+function crisscrossEllipses() {
 
   return true;
 }
 
-euler404();
+crisscrossEllipses();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md
index 87f1f0c28f1..43ceb097a66 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5021000cf542c510014
 title: 'Problem 405: A rectangular tiling'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302073
 dashedName: problem-405-a-rectangular-tiling
 ---
@@ -10,22 +10,26 @@ dashedName: problem-405-a-rectangular-tiling
 
 We wish to tile a rectangle whose length is twice its width.
 
-Let T(0) be the tiling consisting of a single rectangle.
+Let $T(0)$ be the tiling consisting of a single rectangle.
 
-For n > 0, let T(n) be obtained from T(n-1) by replacing all tiles in the following manner:
+For $n > 0$, let $T(n)$ be obtained from $T( n- 1)$ by replacing all tiles in the following manner:
 
-The following animation demonstrates the tilings T(n) for n from 0 to 5:
+<img class="img-responsive center-block" alt="obtaining T(n) from T(n - 1)" src="https://cdn.freecodecamp.org/curriculum/project-euler/a-rectangular-tiling-1.png" style="background-color: white; padding: 10px;" />
 
-Let f(n) be the number of points where four tiles meet in T(n). For example, f(1) = 0, f(4) = 82 and f(109) mod 177 = 126897180.
+The following animation demonstrates the tilings $T(n)$ for $n$ from 0 to 5:
 
-Find f(10k) for k = 1018, give your answer modulo 177.
+<img class="img-responsive center-block" alt="animation with tilings T(n) for n from 0 to 5" src="https://cdn.freecodecamp.org/curriculum/project-euler/a-rectangular-tiling-2.gif" style="background-color: white; padding: 10px;" />
+
+Let $f(n)$ be the number of points where four tiles meet in $T(n)$. For example, $f(1) = 0$, $f(4) = 82$ and $f({10}^9)\bmod {17}^7 = 126\\,897\\,180$.
+
+Find $f({10}^k)$ for $k = {10}^{18}$, give your answer modulo ${17}^7$.
 
 # --hints--
 
-`euler405()` should return 237696125.
+`rectangularTiling()` should return `237696125`.
 
 ```js
-assert.strictEqual(euler405(), 237696125);
+assert.strictEqual(rectangularTiling(), 237696125);
 ```
 
 # --seed--
@@ -33,12 +37,12 @@ assert.strictEqual(euler405(), 237696125);
 ## --seed-contents--
 
 ```js
-function euler405() {
+function rectangularTiling() {
 
   return true;
 }
 
-euler405();
+rectangularTiling();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-406-guessing-game.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-406-guessing-game.md
index fd6535eb66d..6907ad6dae2 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-406-guessing-game.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-406-guessing-game.md
@@ -1,39 +1,51 @@
 ---
 id: 5900f5021000cf542c510015
 title: 'Problem 406: Guessing Game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302074
 dashedName: problem-406-guessing-game
 ---
 
 # --description--
 
-We are trying to find a hidden number selected from the set of integers {1, 2, ..., n} by asking questions.
+We are trying to find a hidden number selected from the set of integers {1, 2, ..., $n$} by asking questions. Each number (question) we ask, we get one of three possible answers:
 
-Each number (question) we ask, we get one of three possible answers: "Your guess is lower than the hidden number" (and you incur a cost of a), or
+- "Your guess is lower than the hidden number" (and you incur a cost of a), or
+- "Your guess is higher than the hidden number" (and you incur a cost of b), or
+- "Yes, that's it!" (and the game ends).
 
-"Your guess is higher than the hidden number" (and you incur a cost of b), or
+Given the value of $n$, $a$, and $b$, an optimal strategy minimizes the total cost <u>for the worst possible case</u>.
 
-"Yes, that's it!" (and the game ends).
+For example, if $n = 5$, $a = 2$, and $b = 3$, then we may begin by asking "<strong>2</strong>" as our first question.
 
-Given the value of n, a, and b, an optimal strategy minimizes the total cost for the worst possible case.
+If we are told that 2 is higher than the hidden number (for a cost of $b = 3$), then we are sure that "<strong>1</strong>" is the hidden number (for a total cost of <strong><span style="color: blue;">3</span></strong>).
 
-For example, if n = 5, a = 2, and b = 3, then we may begin by asking "2" as our first question.
+If we are told that 2 is lower than the hidden number (for a cost of $a = 2$), then our next question will be "<strong>4</strong>".
 
-If we are told that 2 is higher than the hidden number (for a cost of b=3), then we are sure that "1" is the hidden number (for a total cost of 3). If we are told that 2 is lower than the hidden number (for a cost of a=2), then our next question will be "4". If we are told that 4 is higher than the hidden number (for a cost of b=3), then we are sure that "3" is the hidden number (for a total cost of 2+3=5). If we are told that 4 is lower than the hidden number (for a cost of a=2), then we are sure that "5" is the hidden number (for a total cost of 2+2=4). Thus, the worst-case cost achieved by this strategy is 5. It can also be shown that this is the lowest worst-case cost that can be achieved. So, in fact, we have just described an optimal strategy for the given values of n, a, and b.
+If we are told that 4 is higher than the hidden number (for a cost of $b = 3$), then we are sure that "<strong>3</strong>" is the hidden number (for a total cost of $2 + 3 = \color{blue}{\mathbf{5}}$).
 
-Let C(n, a, b) be the worst-case cost achieved by an optimal strategy for the given values of n, a, and b.
+If we are told that 4 is lower than the hidden number (for a cost of $a = 2$), then we are sure that "<strong>5</strong>" is the hidden number (for a total cost of $2 + 2 = \color{blue}{\mathbf{4}}$).
 
-Here are a few examples: C(5, 2, 3) = 5 C(500, √2, √3) = 13.22073197... C(20000, 5, 7) = 82 C(2000000, √5, √7) = 49.63755955...
+Thus, the worst-case cost achieved by this strategy is <strong><span style="color: red">5</span></strong>. It can also be shown that this is the lowest worst-case cost that can be achieved. So, in fact, we have just described an optimal strategy for the given values of $n$, $a$, and $b$.
 
-Let Fk be the Fibonacci numbers: Fk = Fk-1 + Fk-2 with base cases F1 = F2 = 1.Find ∑1≤k≤30 C(1012, √k, √Fk), and give your answer rounded to 8 decimal places behind the decimal point.
+Let $C(n, a, b)$ be the worst-case cost achieved by an optimal strategy for the given values of $n$, $a$, and $b$.
+
+Here are a few examples:
+
+$$\begin{align}   & C(5, 2, 3) = 5 \\\\
+  & C(500, \sqrt{2}, \sqrt{3}) = 13.220\\,731\\,97\ldots \\\\   & C(20\\,000, 5, 7) = 82 \\\\
+  & C(2\\,000\\,000, √5, √7) = 49.637\\,559\\,55\ldots \\\\ \end{align}$$
+
+Let $F_k$ be the Fibonacci numbers: $F_k = F_{k - 1} + F_{k - 2}$ with base cases $F_1 = F_2 = 1$.
+
+Find $\displaystyle\sum_{k = 1}^{30} C({10}^{12}, \sqrt{k}, \sqrt{F_k})$, and give your answer rounded to 8 decimal places behind the decimal point.
 
 # --hints--
 
-`euler406()` should return 36813.12757207.
+`guessingGame()` should return `36813.12757207`.
 
 ```js
-assert.strictEqual(euler406(), 36813.12757207);
+assert.strictEqual(guessingGame(), 36813.12757207);
 ```
 
 # --seed--
@@ -41,12 +53,12 @@ assert.strictEqual(euler406(), 36813.12757207);
 ## --seed-contents--
 
 ```js
-function euler406() {
+function guessingGame() {
 
   return true;
 }
 
-euler406();
+guessingGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-407-idempotents.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-407-idempotents.md
index eb473f7ba0b..f676b0c5b6e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-407-idempotents.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-407-idempotents.md
@@ -1,25 +1,27 @@
 ---
 id: 5900f5041000cf542c510016
 title: 'Problem 407: Idempotents'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302075
 dashedName: problem-407-idempotents
 ---
 
 # --description--
 
-If we calculate a2 mod 6 for 0 ≤ a ≤ 5 we get: 0,1,4,3,4,1.
+If we calculate $a^2\bmod 6$ for $0 ≤ a ≤ 5$ we get: 0, 1, 4, 3, 4, 1.
 
-The largest value of a such that a2 ≡ a mod 6 is 4. Let's call M(n) the largest value of a &lt; n such that a2 ≡ a (mod n). So M(6) = 4.
+The largest value of a such that $a^2 ≡ a\bmod 6$ is $4$.
 
-Find ∑M(n) for 1 ≤ n ≤ 107.
+Let's call $M(n)$ the largest value of $a &lt; n$ such that $a^2 ≡ a (\text{mod } n)$. So $M(6) = 4$.
+
+Find $\sum M(n)$ for $1 ≤ n ≤ {10}^7$.
 
 # --hints--
 
-`euler407()` should return 39782849136421.
+`idempotents()` should return `39782849136421`.
 
 ```js
-assert.strictEqual(euler407(), 39782849136421);
+assert.strictEqual(idempotents(), 39782849136421);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler407(), 39782849136421);
 ## --seed-contents--
 
 ```js
-function euler407() {
+function idempotents() {
 
   return true;
 }
 
-euler407();
+idempotents();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.md
index 0c3decbbe7c..260a1917a56 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f5091000cf542c51001b
 title: 'Problem 408: Admissible paths through a grid'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302076
 dashedName: problem-408-admissible-paths-through-a-grid
 ---
 
 # --description--
 
-Let's call a lattice point (x, y) inadmissible if x, y and x + y are all positive perfect squares.
+Let's call a lattice point ($x$, $y$) inadmissible if $x$, $y$ and $x + y$ are all positive perfect squares.
 
 For example, (9, 16) is inadmissible, while (0, 4), (3, 1) and (9, 4) are not.
 
-Consider a path from point (x1, y1) to point (x2, y2) using only unit steps north or east. Let's call such a path admissible if none of its intermediate points are inadmissible.
+Consider a path from point ($x_1$, $y_1$) to point ($x_2$, $y_2$) using only unit steps north or east. Let's call such a path admissible if none of its intermediate points are inadmissible.
 
-Let P(n) be the number of admissible paths from (0, 0) to (n, n). It can be verified that P(5) = 252, P(16) = 596994440 and P(1000) mod 1 000 000 007 = 341920854.
+Let $P(n)$ be the number of admissible paths from (0, 0) to ($n$, $n$). It can be verified that $P(5) = 252$, $P(16) = 596\\,994\\,440$ and $P(1\\,000)\bmod 1\\,000\\,000\\,007 = 341\\,920\\,854$.
 
-Find P(10 000 000) mod 1 000 000 007.
+Find $P(10\\,000\\,000)\bmod 1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler408()` should return 299742733.
+`admissiblePaths()` should return `299742733`.
 
 ```js
-assert.strictEqual(euler408(), 299742733);
+assert.strictEqual(admissiblePaths(), 299742733);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler408(), 299742733);
 ## --seed-contents--
 
 ```js
-function euler408() {
+function admissiblePaths() {
 
   return true;
 }
 
-euler408();
+admissiblePaths();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-409-nim-extreme.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-409-nim-extreme.md
index d6dbeffce98..735a1c77781 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-409-nim-extreme.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-409-nim-extreme.md
@@ -1,31 +1,31 @@
 ---
 id: 5900f5061000cf542c510017
 title: 'Problem 409: Nim Extreme'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302077
 dashedName: problem-409-nim-extreme
 ---
 
 # --description--
 
-Let n be a positive integer. Consider nim positions where:There are n non-empty piles.
+Let $n$ be a positive integer. Consider nim positions where:
 
-Each pile has size less than 2n.
+- There are $n$ non-empty piles.
+- Each pile has size less than $2^n$.
+- No two piles have the same size.
 
-No two piles have the same size.
+Let $W(n)$ be the number of winning nim positions satisfying the above conditions (a position is winning if the first player has a winning strategy).
 
-Let W(n) be the number of winning nim positions satisfying the above
+For example, $W(1) = 1$, $W(2) = 6$, $W(3) = 168$, $W(5) = 19\\,764\\,360$ and $W(100)\bmod 1\\,000\\,000\\,007 = 384\\,777\\,056$.
 
-conditions (a position is winning if the first player has a winning strategy). For example, W(1) = 1, W(2) = 6, W(3) = 168, W(5) = 19764360 and W(100) mod 1 000 000 007 = 384777056.
-
-Find W(10 000 000) mod 1 000 000 007.
+Find $W(10\\,000\\,000)\bmod 1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler409()` should return 253223948.
+`nimExtreme()` should return `253223948`.
 
 ```js
-assert.strictEqual(euler409(), 253223948);
+assert.strictEqual(nimExtreme(), 253223948);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler409(), 253223948);
 ## --seed-contents--
 
 ```js
-function euler409() {
+function nimExtreme() {
 
   return true;
 }
 
-euler409();
+nimExtreme();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-41-pandigital-prime.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-41-pandigital-prime.md
index 41465478fc3..a774fa31167 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-41-pandigital-prime.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-41-pandigital-prime.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3951000cf542c50fea8
 title: 'Problem 41: Pandigital prime'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302078
 dashedName: problem-41-pandigital-prime
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.md
index cd55b71cbc0..fd9d28a1bab 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f5071000cf542c510018
 title: 'Problem 410: Circle and tangent line'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302079
 dashedName: problem-410-circle-and-tangent-line
 ---
 
 # --description--
 
-Let C be the circle with radius r, x2 + y2 = r2. We choose two points P(a, b) and Q(-a, c) so that the line passing through P and Q is tangent to C.
+Let $C$ be the circle with radius $r$, $x^2 + y^2 = r^2$. We choose two points $P(a, b)$ and $Q(-a, c)$ so that the line passing through $P$ and $Q$ is tangent to $C$.
 
-For example, the quadruplet (r, a, b, c) = (2, 6, 2, -7) satisfies this property.
+For example, the quadruplet $(r, a, b, c) = (2, 6, 2, -7)$ satisfies this property.
 
-Let F(R, X) be the number of the integer quadruplets (r, a, b, c) with this property, and with 0 &lt; r ≤ R and 0 &lt; a ≤ X.
+Let $F(R, X)$ be the number of the integer quadruplets $(r, a, b, c)$ with this property, and with $0 &lt; r ≤ R$ and $0 &lt; a ≤ X$.
 
-We can verify that F(1, 5) = 10, F(2, 10) = 52 and F(10, 100) = 3384. Find F(108, 109) + F(109, 108).
+We can verify that $F(1, 5) = 10$, $F(2, 10) = 52$ and $F(10, 100) = 3384$.
+
+Find $F({10}^8, {10}^9) + F({10}^9, {10}^8)$.
 
 # --hints--
 
-`euler410()` should return 799999783589946600.
+`circleAndTangentLine()` should return `799999783589946600`.
 
 ```js
-assert.strictEqual(euler410(), 799999783589946600);
+assert.strictEqual(circleAndTangentLine(), 799999783589946600);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler410(), 799999783589946600);
 ## --seed-contents--
 
 ```js
-function euler410() {
+function circleAndTangentLine() {
 
   return true;
 }
 
-euler410();
+circleAndTangentLine();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md
index db9dd2cb866..09ace26cdea 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md
@@ -1,29 +1,33 @@
 ---
 id: 5900f5081000cf542c510019
 title: 'Problem 411: Uphill paths'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302080
 dashedName: problem-411-uphill-paths
 ---
 
 # --description--
 
-Let n be a positive integer. Suppose there are stations at the coordinates (x, y) = (2i mod n, 3i mod n) for 0 ≤ i ≤ 2n. We will consider stations with the same coordinates as the same station.
+Let $n$ be a positive integer. Suppose there are stations at the coordinates $(x, y) = (2^i\bmod n, 3^i\bmod n)$ for $0 ≤ i ≤ 2n$. We will consider stations with the same coordinates as the same station.
 
-We wish to form a path from (0, 0) to (n, n) such that the x and y coordinates never decrease. Let S(n) be the maximum number of stations such a path can pass through.
+We wish to form a path from (0, 0) to ($n$, $n$) such that the $x$ and $y$ coordinates never decrease.
 
-For example, if n = 22, there are 11 distinct stations, and a valid path can pass through at most 5 stations. Therefore, S(22) = 5. The case is illustrated below, with an example of an optimal path:
+Let $S(n)$ be the maximum number of stations such a path can pass through.
 
-It can also be verified that S(123) = 14 and S(10000) = 48.
+For example, if $n = 22$, there are 11 distinct stations, and a valid path can pass through at most 5 stations. Therefore, $S(22) = 5$. The case is illustrated below, with an example of an optimal path:
 
-Find ∑ S(k5) for 1 ≤ k ≤ 30.
+<img class="img-responsive center-block" alt="valid path passing through 5 stations, for n = 22, with 11 distinct stations" src="https://cdn.freecodecamp.org/curriculum/project-euler/uphill-paths.png" style="background-color: white; padding: 10px;" />
+
+It can also be verified that $S(123) = 14$ and $S(10\\,000) = 48$.
+
+Find $\sum S(k^5)$ for $1 ≤ k ≤ 30$.
 
 # --hints--
 
-`euler411()` should return 9936352.
+`uphillPaths()` should return `9936352`.
 
 ```js
-assert.strictEqual(euler411(), 9936352);
+assert.strictEqual(uphillPaths(), 9936352);
 ```
 
 # --seed--
@@ -31,12 +35,12 @@ assert.strictEqual(euler411(), 9936352);
 ## --seed-contents--
 
 ```js
-function euler411() {
+function uphillPaths() {
 
   return true;
 }
 
-euler411();
+uphillPaths();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md
index f0dfab1bf60..ac00f985c10 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md
@@ -1,31 +1,35 @@
 ---
 id: 5900f5081000cf542c51001a
 title: 'Problem 412: Gnomon numbering'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302081
 dashedName: problem-412-gnomon-numbering
 ---
 
 # --description--
 
-For integers m, n (0 ≤ n &lt; m), let L(m, n) be an m×m grid with the top-right n×n grid removed.
+For integers $m$, $n$ ($0 ≤ n &lt; m$), let $L(m, n)$ be an $m×m$ grid with the top-right $n×n$ grid removed.
 
-For example, L(5, 3) looks like this:
+For example, $L(5, 3)$ looks like this:
 
-We want to number each cell of L(m, n) with consecutive integers 1, 2, 3, ... such that the number in every cell is smaller than the number below it and to the left of it.
+<img class="img-responsive center-block" alt="5x5 grid, with removed 3x3 grid from the top-right" src="https://cdn.freecodecamp.org/curriculum/project-euler/gnomon-numbering-1.png" style="background-color: white; padding: 10px;" />
 
-For example, here are two valid numberings of L(5, 3):
+We want to number each cell of $L(m, n)$ with consecutive integers 1, 2, 3, ... such that the number in every cell is smaller than the number below it and to the left of it.
 
-Let LC(m, n) be the number of valid numberings of L(m, n). It can be verified that LC(3, 0) = 42, LC(5, 3) = 250250, LC(6, 3) = 406029023400 and LC(10, 5) mod 76543217 = 61251715.
+For example, here are two valid numberings of $L(5, 3)$:
 
-Find LC(10000, 5000) mod 76543217.
+<img class="img-responsive center-block" alt="two valid numberings of L(5, 3)" src="https://cdn.freecodecamp.org/curriculum/project-euler/gnomon-numbering-2.png" style="background-color: white; padding: 10px;" />
+
+Let $LC(m, n)$ be the number of valid numberings of $L(m, n)$. It can be verified that $LC(3, 0) = 42$, $LC(5, 3) = 250\\,250$, $LC(6, 3) = 406\\,029\\,023\\,400$ and $LC(10, 5)\bmod 76\\,543\\,217 = 61\\,251\\,715$.
+
+Find $LC(10\\,000, 5\\,000)\bmod 76\\,543\\,217$.
 
 # --hints--
 
-`euler412()` should return 38788800.
+`gnomonNumbering()` should return `38788800`.
 
 ```js
-assert.strictEqual(euler412(), 38788800);
+assert.strictEqual(gnomonNumbering(), 38788800);
 ```
 
 # --seed--
@@ -33,12 +37,12 @@ assert.strictEqual(euler412(), 38788800);
 ## --seed-contents--
 
 ```js
-function euler412() {
+function gnomonNumbering() {
 
   return true;
 }
 
-euler412();
+gnomonNumbering();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-413-one-child-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-413-one-child-numbers.md
index a3a7ac23c57..0a50da9e14d 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-413-one-child-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-413-one-child-numbers.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f50a1000cf542c51001c
 title: 'Problem 413: One-child Numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302082
 dashedName: problem-413-one-child-numbers
 ---
 
 # --description--
 
-We say that a d-digit positive number (no leading zeros) is a one-child number if exactly one of its sub-strings is divisible by d.
+We say that a $d$-digit positive number (no leading zeros) is a one-child number if exactly one of its sub-strings is divisible by $d$.
 
-For example, 5671 is a 4-digit one-child number. Among all its sub-strings 5, 6, 7, 1, 56, 67, 71, 567, 671 and 5671, only 56 is divisible by 4. Similarly, 104 is a 3-digit one-child number because only 0 is divisible by 3. 1132451 is a 7-digit one-child number because only 245 is divisible by 7.
+For example, 5671 is a 4-digit one-child number. Among all its sub-strings 5, 6, 7, 1, 56, 67, 71, 567, 671 and 5671, only 56 is divisible by 4.
 
-Let F(N) be the number of the one-child numbers less than N. We can verify that F(10) = 9, F(103) = 389 and F(107) = 277674.
+Similarly, 104 is a 3-digit one-child number because only 0 is divisible by 3. 1132451 is a 7-digit one-child number because only 245 is divisible by 7.
 
-Find F(1019).
+Let $F(N)$ be the number of the one-child numbers less than $N$. We can verify that $F(10) = 9$, $F({10}^3) = 389$ and $F({10}^7) = 277\\,674$.
+
+Find $F({10}^{19})$.
 
 # --hints--
 
-`euler413()` should return 3079418648040719.
+`oneChildNumbers()` should return `3079418648040719`.
 
 ```js
-assert.strictEqual(euler413(), 3079418648040719);
+assert.strictEqual(oneChildNumbers(), 3079418648040719);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler413(), 3079418648040719);
 ## --seed-contents--
 
 ```js
-function euler413() {
+function oneChildNumbers() {
 
   return true;
 }
 
-euler413();
+oneChildNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
index 9cf45b79ab3..e50ab2c9a7e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f50b1000cf542c51001d
 title: 'Problem 414: Kaprekar constant'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302083
 dashedName: problem-414-kaprekar-constant
 ---
 
 # --description--
 
-6174 is a remarkable number; if we sort its digits in increasing order and subtract that number from the number you get when you sort the digits in decreasing order, we get 7641-1467=6174.
+6174 is a remarkable number; if we sort its digits in increasing order and subtract that number from the number you get when you sort the digits in decreasing order, we get $7641 - 1467 = 6174$.
 
 Even more remarkable is that if we start from any 4 digit number and repeat this process of sorting and subtracting, we'll eventually end up with 6174 or immediately with 0 if all digits are equal.
 
@@ -16,28 +16,32 @@ This also works with numbers that have less than 4 digits if we pad the number w
 
 E.g. let's start with the number 0837:
 
-8730-0378=8352
-
-8532-2358=6174
+$$\begin{align}   & 8730 - 0378 = 8352 \\\\
+  & 8532 - 2358 = 6174 \end{align}$$
 
 6174 is called the Kaprekar constant. The process of sorting and subtracting and repeating this until either 0 or the Kaprekar constant is reached is called the Kaprekar routine.
 
-We can consider the Kaprekar routine for other bases and number of digits. Unfortunately, it is not guaranteed a Kaprekar constant exists in all cases; either the routine can end up in a cycle for some input numbers or the constant the routine arrives at can be different for different input numbers. However, it can be shown that for 5 digits and a base b = 6t+3≠9, a Kaprekar constant exists. E.g. base 15: (10,4,14,9,5)15 base 21: (14,6,20,13,7)21
+We can consider the Kaprekar routine for other bases and number of digits. Unfortunately, it is not guaranteed a Kaprekar constant exists in all cases; either the routine can end up in a cycle for some input numbers or the constant the routine arrives at can be different for different input numbers. However, it can be shown that for 5 digits and a base $b = 6t + 3 ≠ 9$, a Kaprekar constant exists.
 
-Define Cb to be the Kaprekar constant in base b for 5 digits. Define the function sb(i) to be 0 if i = Cb or if i written in base b consists of 5 identical digits the number of iterations it takes the Kaprekar routine in base b to arrive at Cb, otherwise
+E.g. base 15: ${(10, 4, 14, 9, 5)}\_{15}$ base 21: $(14, 6, 20, 13, 7)\_{21}$
 
-Note that we can define sb(i) for all integers i &lt; b5. If i written in base b takes less than 5 digits, the number is padded with leading zero digits until we have 5 digits before applying the Kaprekar routine.
+Define $C_b$ to be the Kaprekar constant in base $b$ for 5 digits. Define the function $sb(i)$ to be:
 
-Define S(b) as the sum of sb(i) for 0 &lt; i &lt; b5. E.g. S(15) = 5274369 S(111) = 400668930299
+- 0 if $i = C_b$ or if $i$ written in base $b$ consists of 5 identical digits
+- the number of iterations it takes the Kaprekar routine in base $b$ to arrive at $C_b$, otherwise
 
-Find the sum of S(6k+3) for 2 ≤ k ≤ 300. Give the last 18 digits as your answer.
+Note that we can define $sb(i)$ for all integers $i &lt; b^5$. If $i$ written in base $b$ takes less than 5 digits, the number is padded with leading zero digits until we have 5 digits before applying the Kaprekar routine.
+
+Define $S(b)$ as the sum of $sb(i)$ for $0 &lt; i &lt; b^5$. E.g. $S(15) = 5\\,274\\,369$ $S(111) = 400\\,668\\,930\\,299$
+
+Find the sum of $S(6k + 3)$ for $2 ≤ k ≤ 300$. Give the last 18 digits as your answer.
 
 # --hints--
 
-`euler414()` should return 552506775824935500.
+`kaprekarConstant()` should return `552506775824935500`.
 
 ```js
-assert.strictEqual(euler414(), 552506775824935500);
+assert.strictEqual(kaprekarConstant(), 552506775824935500);
 ```
 
 # --seed--
@@ -45,12 +49,12 @@ assert.strictEqual(euler414(), 552506775824935500);
 ## --seed-contents--
 
 ```js
-function euler414() {
+function kaprekarConstant() {
 
   return true;
 }
 
-euler414();
+kaprekarConstant();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-416-a-frogs-trip.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-416-a-frogs-trip.md
index 96e9fe1bb0f..048adb254cd 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-416-a-frogs-trip.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-416-a-frogs-trip.md
@@ -1,25 +1,27 @@
 ---
 id: 5900f50e1000cf542c510020
 title: 'Problem 416: A frog''s trip'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302085
 dashedName: problem-416-a-frogs-trip
 ---
 
 # --description--
 
-A row of n squares contains a frog in the leftmost square. By successive jumps the frog goes to the rightmost square and then back to the leftmost square. On the outward trip he jumps one, two or three squares to the right, and on the homeward trip he jumps to the left in a similar manner. He cannot jump outside the squares. He repeats the round-trip travel m times.
+A row of $n$ squares contains a frog in the leftmost square. By successive jumps the frog goes to the rightmost square and then back to the leftmost square. On the outward trip he jumps one, two or three squares to the right, and on the homeward trip he jumps to the left in a similar manner. He cannot jump outside the squares. He repeats the round-trip travel $m$ times.
 
-Let F(m, n) be the number of the ways the frog can travel so that at most one square remains unvisited. For example, F(1, 3) = 4, F(1, 4) = 15, F(1, 5) = 46, F(2, 3) = 16 and F(2, 100) mod 109 = 429619151.
+Let $F(m, n)$ be the number of the ways the frog can travel so that at most one square remains unvisited.
 
-Find the last 9 digits of F(10, 1012).
+For example, $F(1, 3) = 4$, $F(1, 4) = 15$, $F(1, 5) = 46$, $F(2, 3) = 16$ and $F(2, 100)\bmod {10}^9 = 429\\,619\\,151$.
+
+Find the last 9 digits of $F(10, {10}^{12})$.
 
 # --hints--
 
-`euler416()` should return 898082747.
+`frogsTrip()` should return `898082747`.
 
 ```js
-assert.strictEqual(euler416(), 898082747);
+assert.strictEqual(frogsTrip(), 898082747);
 ```
 
 # --seed--
@@ -27,12 +29,12 @@ assert.strictEqual(euler416(), 898082747);
 ## --seed-contents--
 
 ```js
-function euler416() {
+function frogsTrip() {
 
   return true;
 }
 
-euler416();
+frogsTrip();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md
index e73dd646e83..aa0880c13f4 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f50d1000cf542c51001f
 title: 'Problem 417: Reciprocal cycles II'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302086
 dashedName: problem-417-reciprocal-cycles-ii
 ---
@@ -10,22 +10,27 @@ dashedName: problem-417-reciprocal-cycles-ii
 
 A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:
 
-1/2= 0.5 1/3= 0.(3) 1/4= 0.25 1/5= 0.2 1/6= 0.1(6) 1/7= 0.(142857) 1/8= 0.125 1/9= 0.(1) 1/10= 0.1
+$$\begin{align}   & \frac{1}{2}  = 0.5 \\\\
+  & \frac{1}{3}  = 0.(3) \\\\   & \frac{1}{4}  = 0.25 \\\\
+  & \frac{1}{5}  = 0.2 \\\\   & \frac{1}{6}  = 0.1(6) \\\\
+  & \frac{1}{7}  = 0.(142857) \\\\   & \frac{1}{8}  = 0.125 \\\\
+  & \frac{1}{9}  = 0.(1) \\\\   & \frac{1}{10} = 0.1 \\\\
+\end{align}$$
 
-Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that 1/7 has a 6-digit recurring cycle.
+Where $0.1(6)$ means $0.166666\ldots$, and has a 1-digit recurring cycle. It can be seen that $\frac{1}{7}$ has a 6-digit recurring cycle.
 
 Unit fractions whose denominator has no other prime factors than 2 and/or 5 are not considered to have a recurring cycle. We define the length of the recurring cycle of those unit fractions as 0.
 
-Let L(n) denote the length of the recurring cycle of 1/n. You are given that ∑L(n) for 3 ≤ n ≤ 1 000 000 equals 55535191115.
+Let $L(n)$ denote the length of the recurring cycle of $\frac{1}{n}$. You are given that $\sum L(n)$ for $3 ≤ n ≤ 1\\,000\\,000$ equals $55\\,535\\,191\\,115$.
 
-Find ∑L(n) for 3 ≤ n ≤ 100 000 000
+Find $\sum L(n)$ for $3 ≤ n ≤ 100\\,000\\,000$.
 
 # --hints--
 
-`euler417()` should return 446572970925740.
+`reciprocalCyclesTwo()` should return `446572970925740`.
 
 ```js
-assert.strictEqual(euler417(), 446572970925740);
+assert.strictEqual(reciprocalCyclesTwo(), 446572970925740);
 ```
 
 # --seed--
@@ -33,12 +38,12 @@ assert.strictEqual(euler417(), 446572970925740);
 ## --seed-contents--
 
 ```js
-function euler417() {
+function reciprocalCyclesTwo() {
 
   return true;
 }
 
-euler417();
+reciprocalCyclesTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-418-factorisation-triples.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-418-factorisation-triples.md
index ac11b1083f2..0c376474a32 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-418-factorisation-triples.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-418-factorisation-triples.md
@@ -1,29 +1,30 @@
 ---
 id: 5900f50f1000cf542c510021
 title: 'Problem 418: Factorisation triples'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302087
 dashedName: problem-418-factorisation-triples
 ---
 
 # --description--
 
-Let n be a positive integer. An integer triple (a, b, c) is called a factorisation triple of n if: 1 ≤ a ≤ b ≤ c
+Let $n$ be a positive integer. An integer triple ($a$, $b$, $c$) is called a factorisation triple of $n$ if:
 
-a·b·c = n.
+- $1 ≤ a ≤ b ≤ c$
+- $a \times b \times c = n$.
 
-Define f(n) to be a + b + c for the factorisation triple (a, b, c) of n which minimises c / a. One can show that this triple is unique.
+Define $f(n)$ to be $a + b + c$ for the factorisation triple ($a$, $b$, $c$) of $n$ which minimises $\frac{c}{a}$. One can show that this triple is unique.
 
-For example, f(165) = 19, f(100100) = 142 and f(20!) = 4034872.
+For example, $f(165) = 19$, $f(100\\,100) = 142$ and $f(20!) = 4\\,034\\,872$.
 
-Find f(43!).
+Find $f(43!)$.
 
 # --hints--
 
-`euler418()` should return 1177163565297340400.
+`factorisationTriples()` should return `1177163565297340400`.
 
 ```js
-assert.strictEqual(euler418(), 1177163565297340400);
+assert.strictEqual(factorisationTriples(), 1177163565297340400);
 ```
 
 # --seed--
@@ -31,12 +32,12 @@ assert.strictEqual(euler418(), 1177163565297340400);
 ## --seed-contents--
 
 ```js
-function euler418() {
+function factorisationTriples() {
 
   return true;
 }
 
-euler418();
+factorisationTriples();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.md
index 2d9f3650907..4143ab36ccb 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5101000cf542c510022
 title: 'Problem 419: Look and say sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302088
 dashedName: problem-419-look-and-say-sequence
 ---
@@ -14,28 +14,35 @@ The sequence starts with 1 and all other members are obtained by describing the
 
 It helps to do this out loud:
 
-1 is 'one one' → 11
+1 is 'one one' $→ 11$
 
-11 is 'two ones' → 21
+11 is 'two ones' $→ 21$
 
-21 is 'one two and one one' → 1211
+21 is 'one two and one one' $→ 1211$
 
-1211 is 'one one, one two and two ones' → 111221
+1211 is 'one one, one two and two ones' $→ 111221$
 
-111221 is 'three ones, two twos and one one' → 312211
+111221 is 'three ones, two twos and one one' $→ 312211$
 
 ...
 
-Define A(n), B(n) and C(n) as the number of ones, twos and threes in the n'th element of the sequence respectively. One can verify that A(40) = 31254, B(40) = 20259 and C(40) = 11625.
+Define $A(n)$, $B(n)$ and $C(n)$ as the number of ones, twos and threes in the $n$'th element of the sequence respectively. One can verify that $A(40) = 31\\,254$, $B(40) = 20\\,259$ and $C(40) = 11\\,625$.
 
-Find A(n), B(n) and C(n) for n = 1012. Give your answer modulo 230 and separate your values for A, B and C by a comma. E.g. for n = 40 the answer would be 31254,20259,11625
+Find $A(n)$, $B(n)$ and $C(n)$ for $n = {10}^{12}$. Give your answer modulo $2^{30}$ as a string and separate your values for $A$, $B$ and $C$ by a comma. E.g. for $n = 40$ the answer would be `31254,20259,11625`.
 
 # --hints--
 
-`euler419()` should return 998567458, 1046245404, 43363922.
+`lookAndSaySequence()` should return a string.
 
 ```js
-assert.strictEqual(euler419(), 998567458, 1046245404, 43363922);
+assert(typeof lookAndSaySequence() === 'string');
+```
+
+
+`lookAndSaySequence()` should return the string `998567458,1046245404,43363922`.
+
+```js
+assert.strictEqual(lookAndSaySequence(), '998567458,1046245404,43363922');
 ```
 
 # --seed--
@@ -43,12 +50,12 @@ assert.strictEqual(euler419(), 998567458, 1046245404, 43363922);
 ## --seed-contents--
 
 ```js
-function euler419() {
+function lookAndSaySequence() {
 
   return true;
 }
 
-euler419();
+lookAndSaySequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.md
index bc3de086231..abda6f2d137 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3961000cf542c50fea9
 title: 'Problem 42: Coded triangle numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302089
 dashedName: problem-42-coded-triangle-numbers
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md
index e65a335aada..f9b50f98977 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5111000cf542c510023
 title: 'Problem 420: 2x2 positive integer matrix'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302090
 dashedName: problem-420-2x2-positive-integer-matrix
 ---
@@ -10,18 +10,29 @@ dashedName: problem-420-2x2-positive-integer-matrix
 
 A positive integer matrix is a matrix whose elements are all positive integers.
 
-Some positive integer matrices can be expressed as a square of a positive integer matrix in two different ways. Here is an example:
+Some positive integer matrices can be expressed as a square of a positive integer matrix in two different ways. Aquí hay un ejemplo:
 
-We define F(N) as the number of the 2x2 positive integer matrices which have a trace less than N and which can be expressed as a square of a positive integer matrix in two different ways. We can verify that F(50) = 7 and F(1000) = 1019.
+$$\begin{pmatrix}   40 & 12 \\\\
+  48 & 40 \end{pmatrix} =
+{\begin{pmatrix}
+  2 & 3 \\\\
+ 12 & 2 \end{pmatrix}}^2 =
+{\begin{pmatrix}
+  6 & 1 \\\\
+  4 & 6 \end{pmatrix}}^2$$
 
-Find F(107).
+We define $F(N)$ as the number of the 2x2 positive integer matrices which have a trace less than N and which can be expressed as a square of a positive integer matrix in two different ways.
+
+We can verify that $F(50) = 7$ and $F(1000) = 1019$.
+
+Find $F({10}^7)$.
 
 # --hints--
 
-`euler420()` should return 145159332.
+`positiveIntegerMatrix()` should return `145159332`.
 
 ```js
-assert.strictEqual(euler420(), 145159332);
+assert.strictEqual(positiveIntegerMatrix(), 145159332);
 ```
 
 # --seed--
@@ -29,12 +40,12 @@ assert.strictEqual(euler420(), 145159332);
 ## --seed-contents--
 
 ```js
-function euler420() {
+function positiveIntegerMatrix() {
 
   return true;
 }
 
-euler420();
+positiveIntegerMatrix();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md
index 61e0b86a92d..f94cb95bc48 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md
@@ -1,27 +1,33 @@
 ---
 id: 5900f5131000cf542c510024
-title: 'Problem 421: Prime factors of n15+1'
-challengeType: 5
+title: 'Problem 421: Prime factors of n^15+1'
+challengeType: 1
 forumTopicId: 302091
 dashedName: problem-421-prime-factors-of-n151
 ---
 
 # --description--
 
-Numbers of the form n15+1 are composite for every integer n > 1.
+Numbers of the form $n^{15} + 1$ are composite for every integer $n > 1$.
 
-For positive integers n and m let s(n,m) be defined as the sum of the distinct prime factors of n15+1 not exceeding m.
+For positive integers $n$ and $m$ let $s(n, m)$ be defined as the sum of the distinct prime factors of $n^{15} + 1$ not exceeding $m$.
 
-E.g. 215+1 = 3×3×11×331. So s(2,10) = 3 and s(2,1000) = 3+11+331 = 345.
+E.g. $2^{15} + 1 = 3 × 3 × 11 × 331$.
 
-Also 1015+1 = 7×11×13×211×241×2161×9091. So s(10,100) = 31 and s(10,1000) = 483. Find ∑ s(n,108) for 1 ≤ n ≤ 1011.
+So $s(2, 10) = 3$ and $s(2, 1000) = 3 + 11 + 331 = 345$.
+
+Also ${10}^{15} + 1 = 7 × 11 × 13 × 211 × 241 × 2161 × 9091$.
+
+So $s(10, 100) = 31$ and $s(10, 1000) = 483$.
+
+Find $\sum s(n, {10}^8)$ for $1 ≤ n ≤ {10}^{11}$.
 
 # --hints--
 
-`euler421()` should return 2304215802083466200.
+`primeFactorsOfN15Plus1()` should return `2304215802083466200`.
 
 ```js
-assert.strictEqual(euler421(), 2304215802083466200);
+assert.strictEqual(primeFactorsOfN15Plus1(), 2304215802083466200);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler421(), 2304215802083466200);
 ## --seed-contents--
 
 ```js
-function euler421() {
+function primeFactorsOfN15Plus1() {
 
   return true;
 }
 
-euler421();
+primeFactorsOfN15Plus1();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md
index cf7455ac9d6..7ea875b71ab 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md
@@ -1,29 +1,37 @@
 ---
 id: 5900f5131000cf542c510025
 title: 'Problem 422: Sequence of points on a hyperbola'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302092
 dashedName: problem-422-sequence-of-points-on-a-hyperbola
 ---
 
 # --description--
 
-Let H be the hyperbola defined by the equation 12x2 + 7xy - 12y2 = 625.
+Let $H$ be the hyperbola defined by the equation $12x^2 + 7xy - 12y^2 = 625$.
 
-Next, define X as the point (7, 1). It can be seen that X is in H.
+Next, define $X$ as the point (7, 1). It can be seen that $X$ is in $H$.
 
-Now we define a sequence of points in H, {Pi : i ≥ 1}, as: P1 = (13, 61/4). P2 = (-43/6, -4). For i > 2, Pi is the unique point in H that is different from Pi-1 and such that line PiPi-1 is parallel to line Pi-2X. It can be shown that Pi is well-defined, and that its coordinates are always rational. You are given that P3 = (-19/2, -229/24), P4 = (1267/144, -37/12) and P7 = (17194218091/143327232, 274748766781/1719926784).
+Now we define a sequence of points in $H, \\{P_i : i ≥ 1\\}$, as:
 
-Find Pn for n = 1114 in the following format:If Pn = (a/b, c/d) where the fractions are in lowest terms and the denominators are positive, then the answer is (a + b + c + d) mod 1 000 000 007.
+- $P_1 = (13, \frac{61}{4})$.
+- $P_2 = (\frac{-43}{6}, -4)$.
+- For $i > 2$, $P_i$ is the unique point in $H$ that is different from $P_{i - 1}$ and such that line $P_iP_{i - 1}$ is parallel to line $P_{i - 2}X$. It can be shown that $P_i$ is well-defined, and that its coordinates are always rational.
 
-For n = 7, the answer would have been: 806236837.
+<img class="img-responsive center-block" alt="animation showing defining points P_1 to P_6" src="https://cdn.freecodecamp.org/curriculum/project-euler/sequence-of-points-on-a-hyperbola.gif" style="background-color: white; padding: 10px;" />
+
+You are given that $P_3 = (\frac{-19}{2}, \frac{-229}{24})$, $P_4 = (\frac{1267}{144}, \frac{-37}{12})$ and $P_7 = (\frac{17\\,194\\,218\\,091}{143\\,327\\,232}, \frac{274\\,748\\,766\\,781}{1\\,719\\,926\\,784})$.
+
+Find $P_n$ for $n = {11}^{14}$ in the following format: If $P_n = (\frac{a}{b}, \frac{c}{d})$ where the fractions are in lowest terms and the denominators are positive, then the answer is $(a + b + c + d)\bmod 1\\,000\\,000\\,007$.
+
+For $n = 7$, the answer would have been: $806\\,236\\,837$.
 
 # --hints--
 
-`euler422()` should return 92060460.
+`sequenceOfPointsOnHyperbola()` should return `92060460`.
 
 ```js
-assert.strictEqual(euler422(), 92060460);
+assert.strictEqual(sequenceOfPointsOnHyperbola(), 92060460);
 ```
 
 # --seed--
@@ -31,12 +39,12 @@ assert.strictEqual(euler422(), 92060460);
 ## --seed-contents--
 
 ```js
-function euler422() {
+function sequenceOfPointsOnHyperbola() {
 
   return true;
 }
 
-euler422();
+sequenceOfPointsOnHyperbola();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md
index a19a5ce19d3..9969311f0de 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md
@@ -1,33 +1,42 @@
 ---
 id: 5900f5141000cf542c510027
 title: 'Problem 423: Consecutive die throws'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302093
 dashedName: problem-423-consecutive-die-throws
 ---
 
 # --description--
 
-Let n be a positive integer.
+Let $n$ be a positive integer.
 
-A 6-sided die is thrown n times. Let c be the number of pairs of consecutive throws that give the same value.
+A 6-sided die is thrown $n$ times. Let $c$ be the number of pairs of consecutive throws that give the same value.
 
-For example, if n = 7 and the values of the die throws are (1,1,5,6,6,6,3), then the following pairs of consecutive throws give the same value: (1,1,5,6,6,6,3) (1,1,5,6,6,6,3) (1,1,5,6,6,6,3) Therefore, c = 3 for (1,1,5,6,6,6,3).
+For example, if $n = 7$ and the values of the die throws are (1, 1, 5, 6, 6, 6, 3), then the following pairs of consecutive throws give the same value:
 
-Define C(n) as the number of outcomes of throwing a 6-sided die n times such that c does not exceed π(n).1 For example, C(3) = 216, C(4) = 1290, C(11) = 361912500 and C(24) = 4727547363281250000.
+$$\begin{align}   & (\underline{1}, \underline{1}, 5, 6, 6, 6, 3) \\\\
+  & (1, 1, 5, \underline{6}, \underline{6}, 6, 3) \\\\ & (1, 1, 5, 6, \underline{6}, \underline{6}, 3) \end{align}$$
 
-Define S(L) as ∑ C(n) for 1 ≤ n ≤ L. For example, S(50) mod 1 000 000 007 = 832833871.
+Therefore, $c = 3$ for (1, 1, 5, 6, 6, 6, 3).
 
-Find S(50 000 000) mod 1 000 000 007.
+Define $C(n)$ as the number of outcomes of throwing a 6-sided die $n$ times such that $c$ does not exceed $π(n)$.<sup>1</sup>
 
-1 π denotes the prime-counting function, i.e. π(n) is the number of primes ≤ n.
+For example, $C(3) = 216$, $C(4) = 1290$, $C(11) = 361\\,912\\,500$ and $C(24) = 4\\,727\\,547\\,363\\,281\\,250\\,000$.
+
+Define $S(L)$ as $\sum C(n)$ for $1 ≤ n ≤ L$.
+
+For example, $S(50)\bmod 1\\,000\\,000\\,007 = 832\\,833\\,871$.
+
+Find $S(50\\,000\\,000)\bmod 1\\,000\\,000\\,007$.
+
+<sup>1</sup> $π$ denotes the prime-counting function, i.e. $π(n)$ is the number of primes $≤ n$.
 
 # --hints--
 
-`euler423()` should return 653972374.
+`consecutiveDieThrows()` should return `653972374`.
 
 ```js
-assert.strictEqual(euler423(), 653972374);
+assert.strictEqual(consecutiveDieThrows(), 653972374);
 ```
 
 # --seed--
@@ -35,12 +44,12 @@ assert.strictEqual(euler423(), 653972374);
 ## --seed-contents--
 
 ```js
-function euler423() {
+function consecutiveDieThrows() {
 
   return true;
 }
 
-euler423();
+consecutiveDieThrows();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-424-kakuro.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-424-kakuro.md
index 827b969ce69..90b1b38773f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-424-kakuro.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-424-kakuro.md
@@ -1,50 +1,73 @@
 ---
 id: 5900f5141000cf542c510026
 title: 'Problem 424: Kakuro'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302094
 dashedName: problem-424-kakuro
 ---
 
 # --description--
 
+<img class="img-responsive center-block" alt="kakuro example" src="https://cdn.freecodecamp.org/curriculum/project-euler/kakuro.gif" style="background-color: white; padding: 10px;" />
+
 The above is an example of a cryptic kakuro (also known as cross sums, or even sums cross) puzzle, with its final solution on the right. (The common rules of kakuro puzzles can be found easily on numerous internet sites. Other related information can also be currently found at krazydad.com whose author has provided the puzzle data for this challenge.)
 
-The downloadable text file (kakuro200.txt) contains the description of 200 such puzzles, a mix of 5x5 and 6x6 types. The first puzzle in the file is the above example which is coded as follows:
+The `testPuzzles` array contains the description of 200 such puzzles, a mix of 5x5 and 6x6 types. The first puzzle in the file is the above example which is coded as string as follows:
 
-6,X,X,(vCC),(vI),X,X,X,(hH),B,O,(vCA),(vJE),X,(hFE,vD),O,O,O,O,(hA),O,I,(hJC,vB),O,O,(hJC),H,O,O,O,X,X,X,(hJE),O,O,X
+`6,X,X,(vCC),(vI),X,X,X,(hH),B,O,(vCA),(vJE),X,(hFE,vD),O,O,O,O,(hA),O,I,(hJC,vB),O,O,(hJC),H,O,O,O,X,X,X,(hJE),O,O,X`
 
 The first character is a numerical digit indicating the size of the information grid. It would be either a 6 (for a 5x5 kakuro puzzle) or a 7 (for a 6x6 puzzle) followed by a comma (,). The extra top line and left column are needed to insert information.
 
-The content of each cell is then described and followed by a comma, going left to right and starting with the top line. X = Gray cell, not required to be filled by a digit. O (upper case letter)= White empty cell to be filled by a digit. A = Or any one of the upper case letters from A to J to be replaced by its equivalent digit in the solved puzzle. ( ) = Location of the encrypted sums. Horizontal sums are preceded by a lower case "h" and vertical sums are preceded by a lower case "v". Those are followed by one or two upper case letters depending if the sum is a single digit or double digit one. For double digit sums, the first letter would be for the "tens" and the second one for the "units". When the cell must contain information for both a horizontal and a vertical sum, the first one is always for the horizontal sum and the two are separated by a comma within the same set of brackets, ex.: (hFE,vD). Each set of brackets is also immediately followed by a comma.
+The content of each cell is then described and followed by a comma, going left to right and starting with the top line.
+
+`X` = Gray cell, not required to be filled by a digit.
+
+`O` (upper case letter)= White empty cell to be filled by a digit.
+
+`A` = Or any one of the upper case letters from A to J to be replaced by its equivalent digit in the solved puzzle.
+
+`( )` = Location of the encrypted sums. Horizontal sums are preceded by a lower case "h" and vertical sums are preceded by a lower case "v". Those are followed by one or two upper case letters depending if the sum is a single digit or double digit one. For double digit sums, the first letter would be for the "tens" and the second one for the "units". When the cell must contain information for both a horizontal and a vertical sum, the first one is always for the horizontal sum and the two are separated by a comma within the same set of brackets, ex.: (hFE,vD). Each set of brackets is also immediately followed by a comma.
 
 The description of the last cell is followed by a Carriage Return/Line Feed (CRLF) instead of a comma.
 
 The required answer to each puzzle is based on the value of each letter necessary to arrive at the solution and according to the alphabetical order. As indicated under the example puzzle, its answer would be 8426039571. At least 9 out of the 10 encrypting letters are always part of the problem description. When only 9 are given, the missing one must be assigned the remaining digit.
 
-You are given that the sum of the answers for the first 10 puzzles in the file is 64414157580.
+You are given that the sum of the answers for the first 10 puzzles in `testPuzzles` is 64414157580.
 
-Find the sum of the answers for the 200 puzzles.
+Find the sum of the answers for `puzzles` array.
 
 # --hints--
 
-`euler424()` should return 1059760019628.
+`kakuro(testPuzzles)` should return `1059760019628`.
 
 ```js
-assert.strictEqual(euler424(), 1059760019628);
+assert.strictEqual(kakuro(_testPuzzles), 1059760019628);
 ```
 
 # --seed--
 
+
+## --after-user-code--
+
+```js
+const _testPuzzles = [
+  '6,X,X,(vCC),(vI),X,X,X,(hH),B,O,(vCA),(vJE),X,(hFE,vD),O,O,O,O,(hA),O,I,(hJC,vB),O,O,(hJC),H,O,O,O,X,X,X,(hJE),O,O,X','7,X,X,X,X,(vJJ),(vCD),X,X,X,X,(hCG),O,O,(vCE),X,X,X,(hCI,vJB),C,O,O,X,(vB),(hJF,vJF),O,F,O,O,(hJA),F,G,O,O,X,X,(hCA),O,A,O,X,X,X,X,(hCF),O,O,X,X,X','7,X,X,X,(vE),(vCB),X,X,X,X,(hJ),O,O,(vCA),X,X,(vCH),(hCG,vCJ),O,O,O,(vJ),(hCE),O,O,O,(hJ,vGG),O,O,(hD),I,O,(hCD,vCB),H,O,O,X,(hCE),O,O,E,X,X,X,X,(hCE),O,O,X,X','6,X,X,X,(vEA),(vJF),X,X,X,(hI),O,O,(vJA),X,(vA),(hEI,vEB),O,O,O,(hIG),C,O,J,O,D,(hJD),O,O,O,X,X,X,(hJD),O,O,X,X','7,X,(vH),(vG),X,X,(vI),(vDH),(hG),B,O,(vDI),(hDB,vDE),O,O,(hBC),I,O,F,O,O,J,X,X,(hG),O,O,X,X,X,(vDG),(hH,vDD),O,O,(vDJ),(vC),(hBI),O,O,O,O,O,O,(hDJ),O,O,X,(hA),O,O','6,X,(vID),(vIJ),X,X,X,(hH),F,I,(vF),(vIA),X,(hIA),G,B,O,C,X,X,(hID),O,O,O,(vIF),X,(hIA),E,O,I,O,X,X,X,(hII),O,G','6,X,X,(vAF),(vAI),X,X,X,(hJ,vAC),O,B,(vGJ),X,(hGH),J,O,O,O,(vAF),(hAG),O,O,(hH,vF),A,D,X,(hGF),O,E,O,O,X,X,(hD),O,O,X','7,X,X,X,X,(vCE),(vGB),X,X,(vJG),(vCI),(hCD,vCJ),O,O,X,(hCI),O,O,O,O,B,(vJB),(hCF),O,O,O,(hCA,vH),O,O,(hCJ),O,O,(hJB,vCJ),O,O,O,X,(hJD),O,O,O,O,O,X,(hF),I,O,X,X,X','7,X,(vBB),(vBD),X,X,X,X,(hBB),C,E,(vEE),(vEC),X,X,(hBC),O,O,O,O,X,X,X,(hEF),H,O,A,(vJ),X,X,X,(hBD),O,O,O,(vI),X,X,(hBE),F,O,O,O,X,X,X,X,(hG),O,O','7,X,X,(vGG),(vGD),X,(vI),(vGI),X,(hGB),O,O,(hGH,vIC),O,O,X,(hGA),O,O,O,J,O,X,X,(hGI),O,O,X,X,X,(vGD),(hE,vE),O,O,(vGF),X,(hIH),O,O,O,O,O,X,(hE),A,O,(hGF),O,O,X','6,X,(vIJ),(vIE),X,X,X,(hF),O,C,(vIA),X,X,(hCA),O,O,D,(vIH),X,X,(hIB),E,O,O,(vF),X,X,(hD),O,A,O,X,X,X,(hID),O,G','6,X,(vAD),(vGI),(vI),X,X,(hB),O,O,O,(vAF),X,(hGC),O,O,O,O,(vGA),(hGE),O,O,(hJ,vB),O,O,X,(hGD),D,O,E,O,X,X,(hAI),O,C,O','6,X,X,X,(vAB),(vFA),X,X,X,(hHI),O,O,(vHJ),X,(vA),(hFJ,vHE),I,D,O,(hFH),O,O,O,O,O,(hHJ),O,O,O,X,X,X,(hC),O,J,X,X','7,X,X,X,(vJ),(vEF),X,X,X,X,(hI,vGD),C,E,(vEF),(vA),X,(hEH),O,O,O,O,O,X,(hH,vJ),O,O,(hJ,vEJ),O,O,(hD),O,A,(hEF,vEB),O,O,X,(hCC),O,O,A,O,O,X,X,X,(hH),O,O,X,X','7,X,X,X,(vAG),(vAJ),(vFH),X,X,X,(hFD),O,O,O,X,X,(vH),(hAJ,vAB),O,O,O,(vB),(hAH),O,H,O,(hC,vAI),O,O,(hE),O,O,(hAI,vAE),O,O,O,X,(hJ),O,O,O,X,X,X,(hFG),E,O,O,X,X','7,X,(vAI),(vHB),X,X,(vJE),(vAA),(hD),O,O,X,(hG),O,O,(hAJ),O,O,(vE),(hAA,vAI),O,O,X,(hHF),O,O,O,O,X,X,(hJF,vAE),O,O,O,J,(vH),(hAI),D,O,X,(hB),O,O,(hAG),O,O,X,(hAA),O,O','7,X,X,(vHJ),(vC),(vAF),X,X,X,(hHF),O,O,O,(vHI),(vHD),X,(hHB,vAB),O,O,O,O,E,(hAI),O,O,X,(hAB),O,O,(hD),O,O,(vAB),(hAI,vE),J,O,(hHH),O,O,O,B,O,X,X,X,(hG),O,A,O,X','6,X,X,(vDF),(vHE),X,X,X,(hHJ,vE),C,O,X,X,(hHI),O,O,O,(vDF),(vHH),(hFA),A,O,B,O,O,X,X,(hE),O,I,O,X,X,(hHH),O,O,X','6,X,(vA),(vA),X,X,X,(hE),O,O,(vCJ),X,X,(hG),O,O,O,(vHI),X,X,(hHC),O,O,H,(vB),X,X,(hCE),O,O,D,X,X,X,(hE),O,O','6,X,X,X,X,(vEH),(vEC),X,X,X,(hEB,vEJ),O,O,X,X,(hEC,vEF),O,O,B,X,(hDD,vEI),O,B,C,X,(hB),O,D,A,X,X,(hEC),O,O,X,X,X','6,X,X,X,X,(vIF),(vH),X,X,X,(hIJ,vGJ),B,I,X,X,(hIB,vIC),O,O,G,X,(hIA,vC),O,O,O,X,(hE),O,O,O,X,X,(hIA),E,O,X,X,X','7,X,(vC),(vFB),X,X,X,X,(hFH),O,O,(vFA),(vFJ),(vC),X,(hFJ),O,O,O,O,O,X,X,X,(hA,vJ),O,O,O,X,X,(hG),D,O,O,(vC),(vFC),X,(hBH),A,O,O,O,E,X,X,X,X,(hFH),O,I','6,X,X,(vFD),(vC),X,X,X,(hDH),E,F,(vDG),(vDD),X,(hDF,vDI),O,O,A,O,(hDG),O,O,(hDG,vDG),O,O,(hDJ),O,D,J,O,X,X,X,(hJ),E,O,X','6,X,X,X,(vE),(vGH),(vIC),X,X,(hD,vIG),O,O,A,X,(hIF,vJ),O,J,E,O,(hJ),O,D,(hGG,vGH),O,O,(hGG),O,O,O,O,X,(hIC),O,O,O,X,X','7,X,X,X,X,(vAG),(vJA),(vH),X,X,X,(hAJ,vDJ),O,O,O,X,X,(hJF),O,O,O,O,X,X,(hG),D,O,X,X,X,(vJH),(hJE,vJD),C,I,X,X,(hAE),B,O,O,O,X,X,(hAJ),O,O,E,X,X,X','7,X,X,X,X,(vGG),(vIA),(vGF),X,X,X,(hGF),O,O,D,X,X,X,(hGJ,vIB),O,O,O,X,X,(hGH,vGD),O,O,O,X,X,(hII,vC),O,J,O,X,X,(hIH),J,O,O,X,X,X,(hGE),O,I,O,X,X,X','6,X,X,(vFA),(vEC),X,X,X,(hI,vFI),F,O,X,X,(hDE),O,O,O,(vFF),(vFF),(hDI),G,J,O,F,O,X,X,(hFJ),O,D,O,X,X,(hFH),J,A,X','7,X,X,X,X,X,(vID),(vBB),X,X,X,X,(hBC),O,I,X,X,(vIH),(vBH),(hBF,vF),O,O,X,(hIE,vD),O,O,I,O,O,(hAG),O,O,O,O,F,X,(hA),O,O,X,X,X,X,(hD),O,O,X,X,X,X','7,X,(vCD),(vCC),X,X,X,X,(hE),B,C,(vCE),X,X,X,(hCD),O,O,O,(vE),(vCG),X,X,(hCH),O,O,O,O,X,X,(hFC),B,J,G,O,(vCC),X,X,X,(hCI),O,O,O,X,X,X,X,(hG),O,O','7,X,X,X,(vID),(vD),(vFB),X,X,X,(hIB,vID),O,O,O,X,X,(hJE,vIA),J,C,O,D,(vF),(hIB),O,O,X,(hIG),O,O,(hIJ),O,O,(vD),(hA,vID),O,O,X,(hJF),O,O,O,O,X,X,(hIE),O,O,O,X,X','7,X,X,(vAC),(vAH),X,X,X,X,(hD),O,O,(vAD),X,X,X,(hCH,vAD),O,O,O,(vAA),(vF),(hAC),O,H,(hAB,vAJ),O,O,A,(hAE),O,O,O,(hD,vAD),O,O,X,X,(hAC),O,O,O,X,X,X,X,(hG),O,O,X','6,X,X,(vBB),(vBE),X,X,X,(hBH),O,I,(vBG),(vBB),X,(hHE,vBD),H,D,O,O,(hBA),C,O,(hA,vG),O,O,(hBF),I,O,O,O,X,X,X,(hG),O,O,X','6,X,X,(vEC),(vD),X,X,X,(hD,vH),O,O,(vIB),X,(hIA),O,O,O,O,(vE),(hII),O,F,(hII,vIG),O,O,X,(hIH),O,O,O,O,X,X,(hIA),O,D,X','6,X,X,X,X,(vEH),(vEG),X,X,X,(hEB,vEF),O,O,X,X,(hAC,vG),O,B,O,X,(hEE,vEC),O,D,O,X,(hEE),O,O,O,X,X,(hEJ),D,O,X,X,X','6,X,(vD),(vB),X,X,X,(hA),O,O,(vE),X,X,(hE),A,O,O,(vCJ),X,X,(hCH),O,A,O,(vCI),X,X,(hB),O,D,O,X,X,X,(hCB),G,O','7,X,X,X,X,(vHJ),(vIF),(vIB),X,X,X,(hIH,vJI),O,O,J,X,X,(hIA),O,O,O,F,X,X,(hIG),O,C,X,X,X,(vD),(hA,vIB),O,J,X,X,(hHB),O,O,O,O,X,X,(hHB),O,O,O,X,X,X','7,X,X,X,(vBJ),(vIB),X,X,X,(vIF),(hBB,vBB),O,O,(vBA),X,(hIC),O,O,O,O,O,(vBA),(hBD),O,O,(hC,vC),O,O,O,(hBJ),E,O,O,(hBC,vBI),G,H,X,(hBA),O,O,O,O,O,X,X,(hBF),O,O,X,X','7,X,(vHI),(vHE),X,X,X,X,(hA),O,O,X,X,X,X,(hHG),O,O,(vHH),(vHE),(vIJ),X,(hHA),O,O,O,O,O,(vHI),X,(hID),H,O,O,B,I,X,X,X,X,(hHB),F,O,X,X,X,X,(hHE),O,H','6,X,X,(vAJ),(vAJ),X,X,X,(hAF,vAA),G,A,X,X,(hDA),O,O,O,(vDE),(vAH),(hAJ),O,O,O,O,I,X,X,(hAG),D,C,O,X,X,(hAI),O,O,X','6,X,X,X,X,(vDH),(vDA),X,X,X,(hG,vDG),O,E,X,X,(hBJ,vBC),O,O,O,X,(hBI,vE),O,E,O,X,(hE),O,O,O,X,X,(hDH),O,E,X,X,X','6,X,X,X,X,(vHJ),(vHH),X,X,X,(hHE,vCC),O,O,X,X,(hF,vG),A,O,O,X,(hHC,vHJ),O,B,O,X,(hHH),O,O,O,X,X,(hHI),O,O,X,X,X','7,X,(vJ),(vDG),X,X,(vDF),(vEF),(hC),E,B,X,(hEA),O,O,(hEE),C,O,(vH),(hED,vEF),A,O,X,(hEC),O,O,O,O,X,X,(hDD,vEF),O,O,O,O,(vEA),(hEJ),O,F,X,(hJ),O,O,(hEF),O,O,X,(hEF),O,O','7,X,X,X,(vCC),(vD),X,X,X,(vJE),(hI,vCH),O,O,(vBF),X,(hCC),O,O,O,O,A,(vJB),(hCB),G,O,O,(hJA,vJF),O,O,(hJA),O,O,(hG,vH),O,O,O,X,(hCE),O,O,O,O,O,X,X,(hH),O,O,X,X','7,X,X,(vEI),(vEB),(vG),X,X,X,(hEF),E,O,O,(vHE),X,X,(hEF,vH),O,O,O,O,(vEI),(hH),O,O,X,(hEH),O,B,(hG),O,O,(vG),(hEI,vED),O,O,X,(hAG),C,O,O,O,X,X,X,(hEE),O,O,O,X','6,X,X,X,X,(vJE),(vF),X,X,X,(hI,vJJ),O,O,X,X,(hEC,vJJ),H,O,O,X,(hF,vJB),O,O,O,X,(hJI),A,C,E,X,X,(hJD),O,J,X,X,X','6,X,X,X,(vH),(vAE),X,X,X,(hCB,vCJ),O,O,(vCB),X,(hCA,vD),O,O,O,O,(hD),C,O,(hCC,vJ),O,O,(hAB),A,O,F,O,X,X,(hB),G,O,X,X','6,X,X,(vEC),(vEG),X,X,X,(hEF),O,O,(vFC),(vEI),X,(hHJ,vJ),E,O,O,A,(hJ),O,O,(hEA,vEA),O,O,(hHH),O,O,O,B,X,X,X,(hEF),O,O,X','7,X,(vEI),(vEC),X,X,X,X,(hH),O,O,X,X,X,X,(hED),O,O,(vEB),(vEG),(vGB),X,(hEJ),O,O,O,O,O,(vD),X,(hIA),O,O,O,O,C,X,X,X,X,(hA),O,I,X,X,X,X,(hEB),A,O','7,X,X,X,(vF),(vG),(vIB),X,X,(vG),(hBA,vIH),J,I,D,X,(hBG),O,O,O,O,O,(vBG),(hA),O,O,X,(hE),O,O,(hBB),O,C,(vA),(hBI,vBE),O,O,X,(hBA),O,O,O,O,O,X,(hBF),O,O,O,X,X','7,X,X,(vEF),(vDI),X,X,X,X,(hDG),O,O,(vDA),X,X,X,(hEA,vG),O,O,O,(vEJ),(vJ),(hF),O,G,(hDH,vDI),O,O,F,(hED),O,O,O,(hDD,vB),O,O,X,X,(hDB),O,O,A,X,X,X,X,(hH),O,O,X','7,X,X,X,X,(vJH),(vD),(vAJ),X,X,X,(hAC,vDH),O,O,O,X,X,(hAA),O,O,O,O,X,X,(hC),F,O,X,X,X,(vC),(hAJ,vAA),I,H,X,X,(hJA),O,D,O,G,X,X,(hJB),O,C,O,X,X,X','6,X,X,X,(vDC),(vG),X,X,X,(hA),O,O,(vCH),X,(vCI),(hCB,vB),O,O,O,(hDF),O,H,O,O,O,(hH),O,O,O,X,X,X,(hH),J,O,X,X','6,X,X,(vCG),(vGA),X,X,X,(hE),O,O,(vGG),(vGB),X,(hCI,vF),O,O,O,I,(hGI),O,O,(hI,vD),O,A,(hGH),O,B,O,O,X,X,X,(hA),O,O,X','6,X,X,X,(vJ),(vHF),X,X,(vF),(hHG,vHD),O,A,X,(hHI),A,O,O,O,(vHE),(hB),G,O,(hD,vHE),O,F,X,(hGJ),O,O,O,O,X,(hHD),O,O,X,X','6,X,X,X,X,(vBD),(vD),X,X,X,(hD,vBB),O,O,X,X,(hI,vHD),O,O,O,X,(hHD,vBE),O,O,A,X,(hHF),C,O,G,X,X,(hBI),O,O,X,X,X','7,X,(vJ),(vFB),(vDB),X,X,X,(hFC),O,O,O,(vFE),X,X,(hFB),O,O,O,O,X,X,X,X,(hG),I,O,X,X,X,X,(hA),O,O,(vFG),(vE),X,X,(hDD),O,O,O,A,X,X,X,(hFD),D,E,J','6,X,X,X,(vAD),(vAH),X,X,(vB),(hF,vEB),O,O,X,(hED),O,O,O,O,(vD),(hD),O,O,(hJ,vI),O,O,X,(hEH),O,A,O,C,X,(hB),G,O,X,X','6,X,X,X,X,(vFG),(vFB),X,X,X,(hFD,vB),O,O,X,X,(hFG,vFG),O,O,O,X,(hI,vH),O,O,C,X,(hGA),E,H,O,X,X,(hD),O,G,X,X,X','7,X,X,X,(vBH),(vBB),X,X,X,X,(hBJ,vBJ),I,O,(vHE),(vI),X,(hBF,vBA),O,O,O,O,O,(hBE),O,D,X,(hA),O,O,(hBC),O,O,(vA),(hBB,vBH),O,O,(hDA),B,H,O,O,O,X,X,X,(hI),O,O,X,X','7,X,X,X,(vEC),(vD),X,X,X,(vJ),(hEB,vEJ),O,O,X,X,(hFC),O,O,O,F,(vEG),X,(hG),O,O,(hH,vFI),O,E,(vEH),X,(hEB),A,O,(hED,vJ),O,O,X,X,(hFI),O,O,O,O,X,X,(hED),O,O,X,X','6,X,(vGH),(vGG),X,X,X,(hGE),O,O,(vFI),(vGJ),X,(hGF),O,O,D,O,X,X,(hGB),O,C,O,(vGG),X,(hFG),O,O,O,O,X,X,X,(hE),O,I','7,X,X,X,(vF),(vGI),X,X,X,(vJ),(hB,vGA),H,G,X,X,(hHF),O,O,O,A,(vHH),X,(hB),O,O,(hGB,vGA),C,O,(vC),X,(hGC),O,O,(hGI,vGF),O,O,X,X,(hHB),O,E,O,O,X,X,(hA),O,O,X,X','7,X,X,X,X,X,(vED),(vIG),X,X,X,X,(hEC),O,O,X,X,(vAC),(vA),(hH,vEG),O,O,X,(hAE,vB),O,O,H,O,O,(hIJ),O,O,O,B,O,X,(hEC),O,O,X,X,X,X,(hEI),O,O,X,X,X,X','7,X,X,(vAI),(vAA),X,X,X,X,(hAD,vAG),O,O,(vAE),X,X,(hAH),O,O,O,O,(vBH),(vD),(hG),O,O,(hI,vE),O,O,O,(hAI),O,O,O,(hG,vAC),D,F,X,X,(hAH),O,O,O,O,X,X,X,(hAJ),O,O,X','7,X,X,(vGD),(vFB),(vJ),X,X,X,(hGD),O,O,O,(vFA),(vGG),X,(hFA),O,O,O,O,O,X,(hGE,vGF),O,O,(hH,vFB),O,O,(hH),O,G,(hGC,vD),O,G,X,(hEB),O,O,O,O,O,X,X,X,(hGC),O,A,O,X','6,X,X,(vAD),(vEE),X,X,X,(hEC),G,O,(vAJ),(vH),X,(hEC,vEG),O,A,O,O,(hEG),F,O,(hEG,vEG),O,O,(hAB),O,E,F,A,X,X,X,(hEG),O,O,X','6,X,X,X,X,(vIB),(vJ),X,X,X,(hB,vIJ),O,O,X,X,(hE,vIF),O,O,C,X,(hFC,vIF),O,A,O,X,(hG),O,O,H,X,X,(hIJ),O,O,X,X,X','6,X,X,X,(vIB),(vEB),X,X,X,(hD,vAE),O,O,(vE),X,(hIJ,vE),O,O,O,O,(hII),O,O,(hJ,vC),H,O,(hAE),O,O,G,J,X,X,(hC),O,O,X,X','6,X,X,(vFF),(vB),X,X,X,(hC,vI),O,J,(vJE),X,(hJJ),O,O,I,G,(vA),(hJJ),O,O,(hJD,vJE),O,O,X,(hJB),O,O,F,O,X,X,(hJH),C,J,X','7,X,X,X,(vEI),(vJI),X,X,X,X,(hJA),O,O,(vJE),(vJJ),X,X,(hJI,vJB),O,E,O,D,X,(hJI,vC),O,H,(hJB,vJE),O,O,(hB),O,O,(hF,vD),O,O,X,(hJB),O,O,O,O,X,X,X,X,(hJE),O,O,X,X','7,X,(vJB),(vFD),X,X,(vFE),(vH),(hJF),O,O,X,(hH),O,O,(hJC),O,O,(vH),(hJF,vJF),O,O,X,(hJI),H,O,O,O,X,X,(hFJ,vJJ),J,O,O,O,(vJA),(hA),G,O,X,(hJF),O,C,(hJC),O,O,X,(hD),O,O','7,X,(vI),(vDH),X,X,X,X,(hB),O,I,X,X,X,X,(hC),O,O,(vA),(vI),(vDJ),X,(hDH),O,B,O,O,O,(vDH),X,(hGG),O,O,O,J,O,X,X,X,X,(hHH),B,O,X,X,X,X,(hHE),O,O','6,X,X,(vDI),(vE),X,X,X,(hA,vDA),E,O,(vHI),X,(hHI),F,A,O,O,(vDF),(hDD),O,O,(hDJ,vDJ),O,O,X,(hDG),O,O,H,O,X,X,(hB),O,D,X','6,X,(vJ),(vDH),X,X,X,(hDA),G,O,(vDA),(vDB),X,(hDB),O,O,I,F,X,X,(hG),O,F,O,(vDI),X,(hED),G,O,O,F,X,X,X,(hDE),O,H','6,X,X,(vCJ),(vD),X,X,X,(hG),O,O,(vAD),(vAE),X,(hCC,vI),O,O,A,O,(hJ),O,F,(hAD,vAD),I,H,(hCD),O,O,O,F,X,X,X,(hAJ),O,G,X','7,X,X,X,X,(vEF),(vEC),(vF),X,X,X,(hED,vEB),O,O,O,X,X,(hEB),O,O,O,O,X,X,(hC),O,D,X,X,X,(vI),(hB,vEE),O,O,X,X,(hEB),E,H,D,O,X,X,(hHJ),O,G,O,X,X,X','7,X,X,X,X,(vJF),(vIC),X,X,X,(vIA),(hD,vJE),O,O,X,X,(hIJ,vD),J,O,O,D,(vG),(hJC),I,O,O,(hJA,vC),O,O,(hJF),J,C,(hJF,vJE),O,O,O,X,(hIB),O,O,O,O,X,X,(hJF),O,O,X,X,X','6,X,(vH),(vJE),X,X,X,(hC),J,O,(vJJ),(vJC),X,(hJJ),A,I,O,H,X,X,(hD),O,O,A,(vC),X,(hAI),F,B,O,O,X,X,X,(hC),J,O','7,X,(vA),(vEE),X,X,(vD),(vF),(hEC),O,O,(vIH),(hI,vEB),O,O,(hBD),O,O,O,O,F,O,X,X,(hA),O,O,X,X,X,(vJ),(hEJ,vEG),F,O,(vA),(vG),(hBG),O,O,O,O,O,O,(hEH),O,O,X,(hG),O,O','6,X,X,X,(vFG),(vFC),X,X,(vE),(hFE,vFF),A,O,X,(hBF),O,O,O,O,(vH),(hE),O,O,(hD,vFF),I,O,X,(hFF),O,O,E,D,X,(hFI),O,O,X,X','6,X,X,(vHA),(vFH),X,X,X,(hFF),O,O,(vFH),(vE),X,(hDI,vFG),O,O,O,O,(hFG),B,O,(hC,vFB),O,O,(hDC),O,G,O,F,X,X,X,(hFF),O,O,X','7,X,X,(vBE),(vBB),(vA),X,X,X,(hH),O,O,O,(vBA),(vH),X,(hGI,vBB),O,J,O,O,O,(hBG),O,O,X,(hI),O,O,(hC),O,O,(vBG),(hE,vBD),H,C,(hBI),O,O,O,O,O,X,X,X,(hGG),O,O,O,X','7,X,X,X,X,X,(vHC),(vF),X,X,X,X,(hF,vC),O,E,X,X,(vEJ),(hEF,vEG),F,O,H,X,(hHD),C,O,O,O,X,X,(hHC,vI),A,O,O,O,X,(hJ),D,O,O,X,X,X,(hF),O,O,X,X,X,X','6,X,X,(vH),(vDC),X,X,X,(hCI,vCD),O,O,X,X,(hH),O,O,O,(vCA),(vCB),(hCJ),O,I,O,D,E,X,X,(hDI),E,H,O,X,X,(hG),O,O,X','7,X,X,X,X,(vJ),(vHE),X,X,X,X,(hHA,vHF),O,B,(vHE),X,X,(hEC,vHG),O,O,O,O,X,(hHE,vHG),O,O,(hA,vHB),O,O,(hJ),O,O,(hHE,vJ),O,O,X,(hED),O,J,O,O,X,X,X,(hB),O,O,X,X,X','6,X,X,(vJG),(vA),X,X,X,(hI),B,O,(vJC),(vJH),X,(hJH,vJC),O,E,O,O,(hB),O,O,(hJJ,vF),O,O,(hCE),O,O,D,I,X,X,X,(hB),O,H,X','6,X,X,X,X,(vDG),(vHH),X,X,(vDH),(hJ,vHB),O,O,X,(hJF),O,O,O,O,X,(hHF,vE),O,O,O,X,(hDJ),H,O,O,I,X,(hHC),G,O,X,X,X','7,X,(vAI),(vHC),X,X,X,X,(hD),O,G,X,X,(vHI),(vG),(hAJ),O,O,(vB),(hH,vAH),O,O,X,(hHF,vH),O,O,F,O,O,(hCA),O,O,O,O,O,(vF),(hH),O,O,X,(hG),O,O,X,X,X,X,(hAH),O,O','7,X,X,X,X,(vFG),(vFI),X,X,X,X,(hFI,vFB),O,O,(vFJ),X,(vFA),(hFG,vGA),O,B,O,O,(hIB),O,O,O,(hH,vJ),O,O,(hJ),O,O,(hFD,vD),O,C,O,(hII),O,O,O,O,X,X,X,(hE),O,O,X,X,X','7,X,X,X,(vI),(vEG),(vFD),X,X,(vED),(hA,vEB),O,O,O,X,(hJC),O,O,A,O,O,X,(hEG),O,O,(hEG,vEC),O,O,(vB),X,(hH),O,O,(hJ,vEB),O,O,X,(hEI),O,O,O,O,J,X,(hFF),O,H,O,X,X','6,X,X,(vEI),(vEB),X,X,X,(hEC,vB),O,O,(vEB),X,(hHC),J,O,O,F,(vEC),(hH),O,O,(hB,vEC),O,O,X,(hEH),O,O,O,O,X,X,(hEA),D,O,X','6,X,X,(vAF),(vBF),X,X,X,(hBI),O,G,(vAD),(vBD),X,(hBI,vF),O,J,O,E,(hBB),A,G,(hBI,vBI),O,H,(hAJ),B,O,O,O,X,X,X,(hBA),O,O,X','6,X,(vCB),(vJ),X,X,X,(hCE),A,O,(vCI),X,X,(hCG),D,O,O,(vCC),X,X,(hCA),O,O,O,(vB),X,X,(hB),O,E,G,X,X,X,(hG),O,H','7,X,X,X,X,X,(vFI),(vHG),X,X,X,X,(hHJ,vHH),O,O,X,X,(vHC),(hHD,vHG),O,O,O,X,(hHH),O,O,O,O,X,X,(hFE,vHC),O,O,O,D,X,(hHE),H,O,O,X,X,X,(hHE),I,A,X,X,X,X','7,X,X,(vFA),(vC),X,X,X,X,(hE),O,B,(vAC),(vGJ),X,X,(hFF,vG),O,O,O,O,(vAI),(hAA),O,D,(hAB,vAC),O,O,O,(hAH),O,O,O,(hAB,vAB),O,O,X,(hFJ),O,O,O,O,X,X,X,X,(hAH),O,J,X','7,X,X,X,(vIF),(vIB),X,X,X,X,(hID),O,O,(vC),X,X,(vIF),(hIH,vEE),O,O,O,(vII),(hEB),O,O,O,(hIB,vIF),D,J,(hIF),O,O,(hII,vIE),O,O,O,X,(hJ),O,G,O,X,X,X,X,(hIF),O,O,X,X','7,X,(vDJ),(vDB),X,X,X,X,(hDJ),O,O,(vDF),(vCE),(vI),X,(hCH),O,O,O,O,O,X,X,X,(hDC,vDB),O,A,G,X,X,(hFE),O,O,O,(vDJ),(vI),X,(hCF),O,O,O,O,O,X,X,X,X,(hDE),O,O','6,X,X,(vCI),(vJ),X,X,X,(hA),O,E,(vEG),(vCC),X,(hEG,vCF),O,O,D,O,(hJ),C,G,(hB,vCC),C,O,(hED),O,O,A,O,X,X,X,(hCD),O,O,X','6,X,X,X,(vG),(vFE),X,X,X,(hG,vBC),O,O,(vBC),X,(hFJ,vC),O,E,O,I,(hG),O,O,(hBF,vBC),O,O,(hEJ),O,O,O,O,X,X,(hBA),D,O,X,X','6,X,X,(vAJ),(vE),X,X,X,(hFH,vH),O,O,(vFA),X,(hFH),O,O,O,O,(vFI),(hI),O,C,(hFI,vFD),O,O,X,(hAC),O,O,I,G,X,X,(hC),O,O,X','6,X,X,X,(vE),(vCJ),X,X,(vFF),(hA,vHJ),C,O,X,(hFC),O,O,O,F,(vD),(hFI),O,O,(hFE,vFJ),O,O,X,(hFG),O,O,O,O,X,(hFD),O,O,X,X','7,X,X,X,(vBJ),(vBI),X,X,X,X,(hA),O,O,(vCH),(vBJ),X,(vCJ),(hCB,vG),H,O,I,B,(hBA),O,O,O,(hBE,vG),O,O,(hBB),F,O,(hBE,vBI),O,O,O,(hBI),O,O,O,O,X,X,X,X,(hBC),O,O,X,X','6,X,X,(vCJ),(vD),X,X,X,(hH),O,O,(vBD),(vJ),X,(hCI,vCH),O,J,F,O,(hCG),O,E,(hA,vCD),O,F,(hBF),O,O,O,O,X,X,X,(hCG),O,O,X','6,X,X,X,X,(vJB),(vG),X,X,X,(hA,vH),I,O,X,X,(hCD,vCG),O,O,B,X,(hCF,vCD),O,O,O,X,(hJD),O,H,O,X,X,(hB),O,O,X,X,X','7,X,(vI),(vEH),X,X,(vCC),(vF),(hG),O,O,X,(hH),O,C,(hJ),O,O,(vAD),(hAG,vG),O,O,X,(hEI),F,O,O,O,X,X,(hAD,vAB),O,O,I,O,(vI),(hG),O,O,X,(hC),O,O,(hAJ),O,O,X,(hAA),O,O','7,X,X,X,X,X,(vEC),(vEA),X,X,X,X,(hB),O,O,X,X,(vDF),(vEH),(hEC,vH),H,O,X,(hEA,vI),O,B,E,O,O,(hDB),E,J,O,D,O,X,(hEH),O,A,X,X,X,X,(hI),O,O,X,X,X,X','6,X,X,X,(vBC),(vBC),X,X,X,(hBJ,vEC),H,O,(vBB),X,(hBE,vA),D,J,O,O,(hC),O,O,(hBE,vBG),O,O,(hEG),H,O,B,O,X,X,(hBI),O,O,X,X','7,X,(vE),(vCF),X,X,X,X,(hJ),O,O,(vFB),X,X,X,(hCJ),O,O,A,(vFE),(vCA),X,X,(hIH),O,O,O,O,X,X,(hFF),O,O,O,B,(vFA),X,X,X,(hCI),O,O,O,X,X,X,X,(hFG),O,O','7,X,X,X,X,(vBH),(vH),X,X,X,X,(hI),O,O,(vE),X,X,X,(hJG,vBF),O,O,O,X,(vH),(hBA,vJE),O,O,O,O,(hDG),O,O,O,O,X,X,(hBG),O,F,O,X,X,X,X,(hA),J,O,X,X,X','7,X,X,X,X,X,(vIC),(vA),X,X,X,(vII),(hG,vIH),F,I,X,X,(hIG),O,O,O,D,X,X,(hC,vC),O,O,J,X,X,(hIF,vE),O,G,A,X,X,(hIH),O,O,O,O,X,X,(hJ),F,D,X,X,X,X','7,X,X,X,(vH),(vCJ),X,X,X,(vCG),(hCB,vEG),O,O,X,X,(hEF),O,I,O,O,(vCI),X,(hCD),O,J,(hCB,vCJ),E,O,(vCC),X,(hCE),O,O,(hCI,vH),O,O,X,X,(hEB),O,O,O,O,X,X,(hD),O,O,X,X','6,X,(vGA),(vBE),X,X,X,(hGC),H,O,(vGF),X,X,(hGG),O,O,O,(vGD),X,X,(hBG),O,J,O,(vGD),X,X,(hGD),O,O,E,X,X,X,(hGH),O,O','6,X,X,(vEE),(vEJ),X,X,X,(hI,vEF),O,O,(vEH),X,(hEA),O,O,O,E,(vB),(hEE),O,O,(hB,vB),O,O,X,(hEG),A,O,I,O,X,X,(hA),D,B,X','6,X,(vJ),(vHA),X,X,X,(hHH),D,O,(vHG),X,X,(hI),O,O,F,(vDG),X,X,(hDJ),O,O,O,(vHF),X,X,(hHF),O,O,E,X,X,X,(hHE),B,O','6,X,X,X,X,(vFI),(vE),X,X,X,(hH,vA),J,I,X,X,(hGF,vD),O,O,F,X,(hGF,vC),O,O,A,X,(hD),O,O,O,X,X,(hD),O,O,X,X,X','7,X,X,(vHG),(vE),X,X,X,X,(hGD),O,O,(vGA),(vHC),(vAJ),X,(hGD,vAC),O,O,O,O,O,(hGC),O,O,(hAA,vGC),O,O,O,(hAC),O,O,F,(hGD,vD),O,O,(hHB),O,O,O,O,O,X,X,X,X,(hI),O,D,X','7,X,X,(vBG),(vBJ),X,(vBD),(vE),X,(hC),O,O,(hBB,vAG),O,C,X,(hBE),O,O,O,O,D,X,(hBG),O,O,O,(vBE),X,X,(vE),(hBI,vJ),O,O,O,X,(hCG),F,G,O,O,O,X,(hC),O,O,(hBJ),O,O,X','7,X,X,X,X,X,(vEA),(vJJ),X,X,(vED),(vJI),(hF),O,O,X,(hB),O,O,(hJH,vB),O,O,X,(hED),O,B,O,O,X,X,(hJI,vJI),O,O,C,O,X,(hJH),O,O,(hJJ),O,O,X,(hF),J,E,X,X,X,X','6,X,(vF),(vED),X,X,X,(hEI),O,O,(vEA),X,X,(hEJ),O,O,J,(vB),X,X,(hB),O,O,O,(vG),X,X,(hJ),B,O,C,X,X,X,(hF),O,E','6,X,X,X,X,(vCH),(vCD),X,X,X,(hG,vCH),O,O,X,X,(hCH,vCI),O,O,O,X,(hFA,vCE),O,O,J,X,(hFF),O,O,O,X,X,(hI),F,C,X,X,X','6,X,X,(vCH),(vA),X,X,X,(hE,vE),D,O,(vAG),(vHC),(hHB),O,O,C,O,I,(hHA),O,O,(hE,vJ),O,O,(hCH),A,O,O,O,O,X,X,(hHD),O,O,X','7,X,(vF),(vDG),(vGD),X,X,X,(hA),O,D,O,(vI),(vGE),X,(hDG),O,C,O,O,O,X,(hGC),H,O,(hH,vA),O,O,(vGF),X,(hH),O,O,(hGB,vGD),O,O,X,(hDH),O,D,O,O,O,X,X,X,(hA),O,O,G','7,X,X,X,X,(vIG),(vIG),X,X,X,X,(hCJ),O,O,(vCE),X,X,X,(hIE,vEA),O,O,O,X,(vJ),(hEA,vIE),O,O,O,O,(hCH),O,F,O,O,X,X,(hCH),I,B,O,X,X,X,X,(hCH),O,O,X,X,X','7,X,X,X,X,(vJ),(vDB),X,X,X,X,(hDG,vH),O,O,X,X,(vB),(hJ,vEB),E,O,O,(vG),(hDJ),O,F,D,(hI,vDC),O,O,(hA),O,O,(hJ,vA),O,O,I,X,(hDA),O,O,O,X,X,X,(hDH),O,O,X,X,X','6,X,X,X,(vEE),(vJA),(vEI),X,X,(hD,vEE),O,F,O,X,(hED,vEC),O,O,O,O,(hJ),O,O,(hEH,vEI),O,O,(hIB),O,O,O,O,X,(hII),O,O,O,X,X','6,X,(vE),(vGH),X,X,X,(hC),O,J,(vFJ),X,X,(hGH),O,O,O,(vJ),X,X,(hFA),B,O,I,(vFF),X,X,(hFG),O,O,O,X,X,X,(hB),F,G','6,X,X,(vIF),(vIJ),X,X,X,(hD,vIC),O,O,X,X,(hIB),O,O,O,(vIG),(vA),(hBF),O,O,F,I,O,X,X,(hE),D,O,F,X,X,(hIF),O,C,X','7,X,(vCD),(vB),X,X,X,X,(hII),O,D,(vA),X,X,X,(hIJ),O,O,O,(vII),X,X,(hID),O,O,O,O,(vIJ),(vCJ),X,X,(hCA),H,O,F,O,X,X,X,(hA),O,O,G,X,X,X,X,(hII),J,O','7,X,(vC),(vFF),X,X,(vHF),(vD),(hFD),O,O,(vHG),(hA,vFJ),O,O,(hHF),O,O,O,O,O,O,X,X,(hFG,vFH),O,O,O,X,X,(hFB,vI),O,O,O,(vFB),(vB),(hIG),O,O,O,O,D,J,(hG),O,I,X,(hFE),O,O','7,X,(vHJ),(vDE),X,X,(vDI),(vHH),(hHG),O,J,(vHJ),(hJ),O,O,(hHE),O,O,O,(hHJ,vB),O,O,X,(hHH),O,O,O,O,X,X,(hDJ,vHA),D,O,E,O,(vF),(hHJ),O,O,(hA),O,O,E,(hHA),O,O,X,(hI),O,O','7,X,(vEH),(vFA),X,X,X,X,(hEB),O,O,(vFA),X,X,X,(hFD),O,O,O,(vEE),(vID),X,X,(hFB),O,O,O,O,X,X,(hFJ),O,O,O,O,(vEE),X,X,X,(hJ),O,B,O,X,X,X,X,(hEH),C,O','6,X,(vJ),(vE),X,X,X,(hA),B,C,(vCJ),X,X,(hCG),O,O,O,(vCD),X,X,(hHF),O,O,O,(vJ),X,X,(hE),O,O,H,X,X,X,(hCE),O,O','6,X,(vGC),(vGH),X,X,X,(hGG),O,O,(vGB),X,X,(hGI),E,O,I,(vGG),X,X,(hIJ),O,C,O,(vA),X,X,(hD),G,O,O,X,X,X,(hD),O,O','6,X,X,X,X,(vIG),(vII),X,X,X,(hE,vIA),I,G,X,X,(hGJ,vGF),O,C,O,X,(hIE,vII),D,O,O,X,(hGJ),O,B,O,X,X,(hA),O,J,X,X,X','6,X,X,X,X,(vIA),(vE),X,X,(vJB),(hB,vII),I,J,X,(hIF),O,O,O,H,X,(hIB,vG),D,J,O,X,(hJG),C,O,O,F,X,(hB),O,O,X,X,X','7,X,X,X,(vDB),(vGG),X,X,X,X,(hGH),O,O,(vGA),(vGA),X,X,(hGF,vGA),O,O,O,O,X,(hGA,vGE),B,O,(hGD,vI),O,O,(hJ),O,I,(hGE,vGG),O,O,X,(hDA),O,D,O,O,X,X,X,X,(hF),O,O,X,X','6,X,X,X,(vFB),(vI),X,X,X,(hGF),O,O,(vGA),X,(vH),(hGA,vFD),O,O,O,(hFF),O,A,O,O,C,(hGG),O,J,O,X,X,X,(hGH),O,D,X,X','6,X,X,(vGA),(vA),X,X,X,(hB,vGE),O,O,(vHJ),X,(hBD),O,O,O,O,(vGH),(hGC),O,O,(hGJ,vGE),O,O,X,(hGG),O,F,O,O,X,X,(hGC),O,O,X','7,X,X,(vCE),(vG),(vI),X,X,X,(hEE),A,O,E,(vCD),(vCH),X,(hEG,vCD),O,O,O,O,O,(hA),G,C,X,(hEH),O,O,(hEE),O,O,(vI),(hA,vD),O,O,(hCF),O,O,O,O,O,X,X,X,(hED),O,O,B,X','7,X,(vG),(vDC),X,(vBA),(vDG),X,(hJ),O,G,(hDA,vBA),O,O,X,(hBC),O,O,G,O,O,X,X,(hDH),O,O,O,(vG),X,X,X,(hG,vDI),O,O,O,(vJ),X,(hBB),E,O,O,O,O,X,(hH),O,J,(hB),O,O','6,X,X,X,(vJG),(vCG),X,X,(vJG),(hJB,vJH),O,O,X,(hJH),I,B,O,O,(vD),(hJB),O,O,(hA,vJG),O,O,X,(hJB),O,B,O,O,X,(hF),I,C,X,X','7,X,(vA),(vE),X,X,(vD),(vB),(hF),O,O,(vJJ),(hI,vGD),O,O,(hGD),O,O,O,O,I,O,X,X,(hJI),O,O,X,X,X,(vJE),(hA,vF),I,O,(vD),(vJJ),(hGA),O,O,O,J,O,O,(hH),O,O,X,(hI),O,O','7,X,X,(vEH),(vEF),X,X,X,X,(hEI,vIH),O,O,(vEI),X,X,(hEI),O,O,O,O,(vIE),(vEJ),(hD),O,O,(hEH,vH),O,O,O,(hEC),O,O,O,(hD,vC),H,G,X,X,(hIA),O,O,O,O,X,X,X,(hD),E,O,X','7,X,X,X,X,X,(vEA),(vCJ),X,X,X,X,(hCD,vCC),O,O,X,X,(vCI),(hCJ,vEH),O,O,O,X,(hDH),O,J,B,O,X,X,(hCH,vD),O,O,O,O,X,(hCJ),O,O,O,X,X,X,(hJ),O,G,X,X,X,X','7,X,(vB),(vFF),X,(vEI),(vFE),X,(hH),O,O,(hFC,vIB),G,O,X,(hFC),O,O,O,O,O,X,X,X,(hFH),O,D,X,X,X,X,(hFF,vFG),O,O,(vFE),(vFH),X,(hEE),O,O,J,O,O,X,(hFG),O,O,(hFG),O,O','6,X,(vHE),(vII),X,X,X,(hHB),O,O,(vHF),(vHJ),X,(hHD),B,O,O,O,X,X,(hG),H,O,O,(vHE),X,(hCA),O,O,E,B,X,X,X,(hHB),O,G','6,X,(vH),(vAF),X,X,X,(hAC),O,O,(vAD),X,X,(hDI),J,O,O,(vAH),X,X,(hAC),O,O,O,(vAI),X,X,(hH),O,O,B,X,X,X,(hAH),O,E','6,X,(vC),(vHA),X,X,X,(hC),O,J,(vHA),X,X,(hF),J,O,O,(vHC),X,X,(hI),O,J,O,(vF),X,X,(hEJ),O,O,B,X,X,X,(hG),O,O','6,X,X,X,(vFJ),(vJC),X,X,(vFF),(hFF,vJE),O,O,X,(hFH),O,F,O,O,(vD),(hFI),O,C,(hE,vH),D,O,X,(hJC),O,O,O,A,X,(hFG),O,J,X,X','7,X,X,X,X,X,(vDE),(vBB),X,(vC),(vDF),X,(hBF),O,O,(hH),O,O,(vE),(hH,vBI),B,O,(hDF),O,O,O,O,D,(vE),X,(hDI,vBE),O,O,C,O,B,(hBF),O,A,X,(hG),E,D,(hG),O,O,X,X,X,X','7,X,(vJ),(vFH),X,X,X,X,(hHH),F,A,X,X,(vGE),(vA),(hI),O,O,(vC),(hF,vD),O,O,X,(hHC,vF),H,O,O,O,O,(hGJ),O,O,O,O,O,(vE),(hE),O,O,X,(hHI),O,O,X,X,X,X,(hA),O,O','7,X,X,(vCD),(vCB),(vF),X,X,X,(hCA,vCJ),O,O,O,(vFH),X,(hCD),O,O,O,O,O,(vCB),(hH),O,O,X,(hI),O,O,(hCE),O,B,(vCE),(hCH,vCI),O,G,X,(hFA),O,G,O,O,O,X,X,(hBC),H,O,O,X','6,X,X,X,X,(vHD),(vHH),X,X,X,(hA,vHH),H,I,X,X,(hHJ,vIG),O,C,O,X,(hHC,vE),O,O,O,X,(hIG),J,O,O,X,X,(hHF),O,O,X,X,X','6,X,X,(vFD),(vJB),X,X,X,(hH,vH),O,O,(vJD),X,(hFH),O,O,O,O,(vJI),(hJD),O,O,(hJD,vG),J,E,X,(hJD),O,O,O,O,X,X,(hB),A,O,X','6,X,X,X,(vC),(vDC),X,X,(vF),(hHB,vDI),O,O,(vDJ),(hDG),O,O,E,O,O,(hHA),O,O,(hHD,vG),O,O,(hEJ),O,O,F,O,O,X,(hJ),O,O,X,X','7,X,X,X,X,X,(vEJ),(vG),X,X,X,X,(hD,vI),C,O,X,X,(vEG),(hFE,vFE),O,O,O,X,(hFD),O,O,O,O,X,X,(hEC,vFI),O,O,O,O,X,(hEC),B,O,H,X,X,X,(hJ),O,O,X,X,X,X','7,X,(vI),(vAC),X,X,(vAI),(vCG),(hB),O,I,X,(hCB,vCD),O,O,(hH),A,D,(hCD,vAF),O,O,O,X,(hAC),O,O,O,O,X,X,(hCF,vCC),O,O,O,O,(vB),(hCB),O,O,O,(hCF),O,O,(hCB),O,J,X,(hB),O,O','6,X,X,X,(vJB),(vIG),X,X,(vA),(hJI,vJC),O,F,X,(hJB),O,O,O,O,(vJE),(hJD),B,O,(hJB,vD),O,H,X,(hJG),O,I,O,O,X,(hA),O,E,X,X','7,X,X,X,X,(vCD),(vCC),(vB),X,X,X,(hCC,vEC),O,I,O,X,X,(hCH),C,O,O,O,X,X,(hCA),F,O,X,X,X,(vA),(hCH,vCE),O,E,X,X,(hGA),C,O,O,O,X,X,(hCE),O,O,O,X,X,X','6,X,X,X,X,(vJI),(vA),X,X,(vJH),(hJE,vJI),O,G,X,(hJE),F,O,O,D,X,(hC,vB),O,E,O,X,(hJH),O,O,O,O,X,(hJD),O,E,X,X,X','6,X,X,X,X,(vAJ),(vAJ),X,X,X,(hAF,vGB),O,O,X,X,(hAE,vD),O,O,O,X,(hAJ,vF),O,J,O,X,(hAF),O,O,H,X,X,(hB),O,I,X,X,X','7,X,X,X,X,(vH),(vIE),X,X,X,X,(hA,vA),O,O,X,X,(vID),(hF,vCH),O,O,A,(vIE),(hIH),O,O,O,(hIA,vIH),O,O,(hIE),O,O,(hIG,vIA),B,O,O,X,(hIF),O,G,A,X,X,X,(hIE),O,D,X,X,X','7,X,(vEF),(vB),(vFC),X,X,X,(hH),O,O,O,(vEA),X,X,(hED),C,O,O,O,X,X,X,X,(hEG),O,F,X,X,X,X,(hEI),O,O,(vEH),(vI),X,X,(hFH),O,O,O,O,X,X,X,(hEE),O,I,O','6,X,(vHI),(vDG),X,X,X,(hHE),J,O,(vDG),X,X,(hHC),H,O,O,(vHA),X,X,(hDH),F,O,G,(vHE),X,X,(hHC),O,O,O,X,X,X,(hHE),O,O','6,X,X,(vAD),(vAE),X,X,X,(hAA),O,O,(vAD),(vAA),X,(hAI,vI),O,F,D,J,(hC),A,O,(hB,vJ),A,E,(hAB),O,I,C,J,X,X,X,(hI),O,H,X','6,X,X,(vDA),(vE),X,X,X,(hJ,vDE),O,F,(vGG),X,(hDJ),O,O,O,O,(vC),(hDD),O,O,(hJ,vI),O,O,X,(hGG),O,D,O,O,X,X,(hDA),G,B,X','7,X,X,(vJD),(vG),(vI),X,X,X,(hG),O,O,H,(vEB),(vEF),X,(hEB),O,O,B,O,J,X,(hEJ,vA),O,H,(hEE,vEA),O,O,(hA),O,O,(hEJ,vG),O,O,X,(hJF),O,O,O,O,O,X,X,X,(hG),F,O,O,X','6,X,X,X,X,(vEJ),(vG),X,X,X,(hDE,vF),O,O,X,X,(hDJ,vF),O,O,O,X,(hA,vDA),O,O,O,X,(hDI),B,O,O,X,X,(hDE),C,O,X,X,X','6,X,X,(vAC),(vD),X,X,X,(hD,vEI),O,O,(vBC),X,(hBA),O,O,O,O,(vH),(hEF),O,O,(hEI,vF),O,O,X,(hEF),O,O,A,O,X,X,(hEE),G,D,X','6,X,X,(vGB),(vD),X,X,X,(hGG),A,C,(vGJ),(vC),X,(hGG,vGC),O,O,O,J,(hGH),O,O,(hE,vI),G,H,(hHF),O,H,O,O,X,X,X,(hE),O,O,X','6,X,X,(vIJ),(vCD),X,X,X,(hCD),O,O,(vCI),(vCG),X,(hIH,vCC),G,O,O,O,(hCE),O,I,(hCH,vCD),G,O,(hIC),B,D,O,O,X,X,X,(hA),O,O,X','7,X,(vII),(vDH),(vID),X,X,X,(hIG),O,O,O,X,X,X,(hDA),O,C,J,(vII),X,X,X,(hID),F,O,O,(vDH),X,X,X,(hID),O,O,O,(vID),X,X,X,(hIE),A,O,O,X,X,X,(hDD),O,O,O','7,X,(vEB),(vF),X,X,X,X,(hED),O,O,(vAJ),(vED),(vD),X,(hIB),O,O,O,G,O,X,X,X,(hF,vA),O,O,O,X,X,(hED),O,O,F,(vA),(vEB),X,(hIE),O,H,O,O,O,X,X,X,X,(hEE),O,O','7,X,X,X,X,(vCA),(vCE),(vB),X,X,X,(hF),O,O,O,X,X,X,(hJG,vCD),I,O,O,X,X,(hF,vB),O,O,O,X,X,(hJI,vCI),O,F,O,X,X,(hD),O,O,O,X,X,X,(hCI),O,O,O,X,X,X','6,X,(vJI),(vI),X,X,X,(hH),O,O,(vD),X,X,(hJA),F,O,O,(vJH),X,X,(hJI),C,G,O,(vJJ),X,X,(hD),O,O,O,X,X,X,(hJE),O,O','6,X,X,X,(vDC),(vAE),X,X,X,(hI),O,B,(vI),X,(vC),(hJ,vDE),O,O,O,(hAF),A,D,O,O,O,(hI),O,O,G,X,X,X,(hDA),H,O,X,X','7,X,X,X,(vFD),(vAF),X,X,X,(vFD),(hFE,vFA),B,O,X,X,(hHI),O,O,O,O,(vFF),X,(hFI),O,O,(hC,vG),O,H,(vFA),X,(hE),O,O,(hFB,vC),O,O,X,X,(hFJ),O,G,O,O,X,X,(hH),O,O,X,X','7,X,X,X,X,(vD),(vHD),X,X,X,(vDH),(hA,vJJ),O,O,(vE),X,(hHB,vJH),O,O,O,E,J,(hJE),H,O,O,(hD,vF),O,O,(hJG),E,O,(hJE,vJG),C,O,O,(hHH),J,O,O,O,O,X,X,(hJJ),O,O,X,X,X','7,X,X,X,X,(vBA),(vEB),X,X,X,(vBG),(hC,vBB),O,O,X,X,(hBD,vBA),O,O,O,O,(vBJ),(hBC),O,O,O,(hBG,vBD),A,O,(hBB),O,O,(hEE,vBF),O,O,D,X,(hBJ),O,O,O,I,X,X,(hBD),O,O,X,X,X','7,X,X,X,X,X,(vDG),(vC),X,(vB),(vFH),X,(hC),E,O,(hA),O,O,(vDD),(hH,vDB),O,O,(hDA),C,O,O,O,O,(vE),X,(hFH,vDE),O,O,H,O,F,(hDH),O,O,X,(hDI),O,O,(hJ),O,O,X,X,X,X','6,X,(vB),(vE),X,X,X,(hA),D,O,(vA),X,X,(hH),O,C,O,(vIG),X,X,(hDI),O,O,O,(vDF),X,X,(hIF),O,O,O,X,X,X,(hH),O,O','7,X,(vHF),(vC),X,X,(vC),(vHF),(hC),O,O,(vBC),(hA,vBF),O,O,(hBE),O,O,O,O,O,O,X,X,(hHD),A,O,X,X,X,(vD),(hJ,vHA),O,O,(vHI),(vC),(hCH),J,O,O,O,O,B,(hHH),O,O,X,(hE),O,O','6,X,X,X,(vJ),(vDA),X,X,(vFD),(hB,vFE),O,O,(vDA),(hDJ),O,O,O,O,O,(hDE),O,O,(hDA,vC),O,H,(hBA),O,I,O,G,O,X,(hJ),E,O,X,X','6,X,(vGA),(vA),X,X,X,(hGE),O,O,(vGD),X,X,(hGA),O,G,A,(vED),X,X,(hGE),O,O,O,(vGD),X,X,(hEB),C,H,F,X,X,X,(hGE),A,I','6,X,(vIC),(vFD),X,X,X,(hIG),O,C,(vIB),X,X,(hFJ),O,O,O,(vII),X,X,(hIE),O,O,F,(vIA),X,X,(hIJ),F,I,O,X,X,X,(hIC),O,O','6,X,X,X,(vJG),(vHH),X,X,X,(hHA),O,O,(vHD),X,(vE),(hJF,vHJ),O,O,O,(hHB),F,O,D,O,O,(hE),O,J,O,X,X,X,(hHE),I,O,X,X','7,X,X,X,(vGG),(vI),(vEC),X,X,(vBH),(hJ,vBI),O,O,O,X,(hBJ),O,O,O,O,O,(vJ),(hGJ),O,O,X,(hA),O,O,(hGC),O,O,(vC),(hGB,vGJ),O,O,X,(hBF),O,O,O,O,B,X,(hBH),O,O,O,X,X','7,X,X,X,X,X,(vD),(vHB),X,X,(vG),(vFC),(hHA,vAI),O,O,X,(hAB),O,O,O,O,O,X,(hAD),O,O,O,(vHB),X,X,(vF),(hAF,vHI),O,O,O,X,(hAB),O,O,O,O,O,X,(hB),O,E,X,X,X,X','6,X,(vBC),(vDF),X,X,X,(hBE),O,O,(vDB),X,X,(hDG),O,J,O,(vC),X,X,(hBI),O,O,O,(vBB),X,X,(hBA),O,O,D,X,X,X,(hBG),F,O','6,X,X,X,(vH),(vDC),(vGA),X,X,(hA,vIE),O,O,O,X,(hIG,vGG),O,O,O,O,(hF),O,O,(hGF,vJ),J,O,(hGA),O,O,O,O,X,(hIE),O,O,O,X,X','6,X,(vHC),(vHJ),X,X,X,(hHC),A,B,(vA),X,X,(hHI),O,O,O,(vHA),X,X,(hD),F,O,O,(vB),X,X,(hII),G,O,O,X,X,X,(hB),O,O','7,X,(vH),(vJA),X,X,(vIE),(vJI),(hJC),O,O,(vDG),(hJE,vIG),O,O,(hDD),I,O,O,O,O,O,X,X,(hII,vIG),O,O,O,X,X,(hIE,vJA),O,O,O,(vB),(vJI),(hDG),C,O,O,O,O,O,(hJF),O,O,X,(hH),O,O','7,X,(vHH),(vBE),X,X,X,X,(hE),B,O,X,(vHF),(vBJ),X,(hHI),C,O,(hJ,vHI),O,O,X,X,(hBC),D,O,O,O,X,X,(hHH),O,O,D,O,(vHF),X,(hHD),F,O,(hHD),G,O,X,X,X,X,(hHE),O,O','7,X,X,X,X,X,(vIF),(vI),X,X,X,X,(hB,vGF),O,O,X,X,(vEG),(hGG,vB),O,O,O,X,(hGJ),O,O,O,H,X,X,(hGA,vA),O,O,O,O,X,(hGC),I,H,O,X,X,X,(hH),G,J,X,X,X,X','7,X,X,X,X,X,(vJF),(vJF),X,X,X,X,(hJD),A,O,X,X,(vBG),(vJB),(hI,vI),O,O,X,(hBD,vJF),F,O,O,E,O,(hIB),O,O,O,O,C,X,(hJG),O,B,X,X,X,X,(hI),O,J,X,X,X,X','6,X,X,(vEI),(vC),X,X,X,(hH,vGG),O,O,(vGD),X,(hBJ),O,O,O,O,(vD),(hGI),O,O,(hD,vD),E,G,X,(hBG),O,O,A,O,X,X,(hJ),O,O,X','7,X,X,X,X,(vFI),(vJF),X,X,X,X,(hJH),O,O,(vJC),X,X,X,(hEE,vEC),O,O,O,X,(vJE),(hED,vEF),O,O,O,G,(hJB),O,O,O,O,X,X,(hEH),O,O,G,X,X,X,X,(hJG),O,O,X,X,X','7,X,X,X,(vJ),(vEI),X,X,X,X,(hJ,vEC),O,A,(vBD),X,X,(hHC,vEA),O,O,O,I,(vF),(hEE),O,O,(hEE,vHD),B,J,O,(hHE),O,O,O,(hG,vED),O,O,X,(hHD),O,O,O,O,X,X,X,(hEA),O,O,X,X','7,X,X,X,X,X,(vFH),(vED),X,X,X,X,(hEC,vEA),O,O,X,X,(vED),(hFI,vEH),O,O,O,X,(hEE),O,O,A,D,X,X,(hFB,vJ),O,O,O,J,X,(hFI),O,O,O,X,X,X,(hI),O,A,X,X,X,X','6,X,(vB),(vHI),X,X,X,(hHH),O,O,(vHJ),(vGA),X,(hHH),O,O,O,I,X,X,(hGE),O,A,O,(vHE),X,(hHJ),H,B,F,D,X,X,X,(hHJ),O,C'
+]
+```
+
 ## --seed-contents--
 
 ```js
-function euler424() {
+function kakuro(puzzles) {
 
   return true;
 }
 
-euler424();
+const testPuzzles = [
+  '6,X,X,(vCC),(vI),X,X,X,(hH),B,O,(vCA),(vJE),X,(hFE,vD),O,O,O,O,(hA),O,I,(hJC,vB),O,O,(hJC),H,O,O,O,X,X,X,(hJE),O,O,X','7,X,X,X,X,(vJJ),(vCD),X,X,X,X,(hCG),O,O,(vCE),X,X,X,(hCI,vJB),C,O,O,X,(vB),(hJF,vJF),O,F,O,O,(hJA),F,G,O,O,X,X,(hCA),O,A,O,X,X,X,X,(hCF),O,O,X,X,X','7,X,X,X,(vE),(vCB),X,X,X,X,(hJ),O,O,(vCA),X,X,(vCH),(hCG,vCJ),O,O,O,(vJ),(hCE),O,O,O,(hJ,vGG),O,O,(hD),I,O,(hCD,vCB),H,O,O,X,(hCE),O,O,E,X,X,X,X,(hCE),O,O,X,X','6,X,X,X,(vEA),(vJF),X,X,X,(hI),O,O,(vJA),X,(vA),(hEI,vEB),O,O,O,(hIG),C,O,J,O,D,(hJD),O,O,O,X,X,X,(hJD),O,O,X,X','7,X,(vH),(vG),X,X,(vI),(vDH),(hG),B,O,(vDI),(hDB,vDE),O,O,(hBC),I,O,F,O,O,J,X,X,(hG),O,O,X,X,X,(vDG),(hH,vDD),O,O,(vDJ),(vC),(hBI),O,O,O,O,O,O,(hDJ),O,O,X,(hA),O,O','6,X,(vID),(vIJ),X,X,X,(hH),F,I,(vF),(vIA),X,(hIA),G,B,O,C,X,X,(hID),O,O,O,(vIF),X,(hIA),E,O,I,O,X,X,X,(hII),O,G','6,X,X,(vAF),(vAI),X,X,X,(hJ,vAC),O,B,(vGJ),X,(hGH),J,O,O,O,(vAF),(hAG),O,O,(hH,vF),A,D,X,(hGF),O,E,O,O,X,X,(hD),O,O,X','7,X,X,X,X,(vCE),(vGB),X,X,(vJG),(vCI),(hCD,vCJ),O,O,X,(hCI),O,O,O,O,B,(vJB),(hCF),O,O,O,(hCA,vH),O,O,(hCJ),O,O,(hJB,vCJ),O,O,O,X,(hJD),O,O,O,O,O,X,(hF),I,O,X,X,X','7,X,(vBB),(vBD),X,X,X,X,(hBB),C,E,(vEE),(vEC),X,X,(hBC),O,O,O,O,X,X,X,(hEF),H,O,A,(vJ),X,X,X,(hBD),O,O,O,(vI),X,X,(hBE),F,O,O,O,X,X,X,X,(hG),O,O','7,X,X,(vGG),(vGD),X,(vI),(vGI),X,(hGB),O,O,(hGH,vIC),O,O,X,(hGA),O,O,O,J,O,X,X,(hGI),O,O,X,X,X,(vGD),(hE,vE),O,O,(vGF),X,(hIH),O,O,O,O,O,X,(hE),A,O,(hGF),O,O,X','6,X,(vIJ),(vIE),X,X,X,(hF),O,C,(vIA),X,X,(hCA),O,O,D,(vIH),X,X,(hIB),E,O,O,(vF),X,X,(hD),O,A,O,X,X,X,(hID),O,G','6,X,(vAD),(vGI),(vI),X,X,(hB),O,O,O,(vAF),X,(hGC),O,O,O,O,(vGA),(hGE),O,O,(hJ,vB),O,O,X,(hGD),D,O,E,O,X,X,(hAI),O,C,O','6,X,X,X,(vAB),(vFA),X,X,X,(hHI),O,O,(vHJ),X,(vA),(hFJ,vHE),I,D,O,(hFH),O,O,O,O,O,(hHJ),O,O,O,X,X,X,(hC),O,J,X,X','7,X,X,X,(vJ),(vEF),X,X,X,X,(hI,vGD),C,E,(vEF),(vA),X,(hEH),O,O,O,O,O,X,(hH,vJ),O,O,(hJ,vEJ),O,O,(hD),O,A,(hEF,vEB),O,O,X,(hCC),O,O,A,O,O,X,X,X,(hH),O,O,X,X','7,X,X,X,(vAG),(vAJ),(vFH),X,X,X,(hFD),O,O,O,X,X,(vH),(hAJ,vAB),O,O,O,(vB),(hAH),O,H,O,(hC,vAI),O,O,(hE),O,O,(hAI,vAE),O,O,O,X,(hJ),O,O,O,X,X,X,(hFG),E,O,O,X,X','7,X,(vAI),(vHB),X,X,(vJE),(vAA),(hD),O,O,X,(hG),O,O,(hAJ),O,O,(vE),(hAA,vAI),O,O,X,(hHF),O,O,O,O,X,X,(hJF,vAE),O,O,O,J,(vH),(hAI),D,O,X,(hB),O,O,(hAG),O,O,X,(hAA),O,O','7,X,X,(vHJ),(vC),(vAF),X,X,X,(hHF),O,O,O,(vHI),(vHD),X,(hHB,vAB),O,O,O,O,E,(hAI),O,O,X,(hAB),O,O,(hD),O,O,(vAB),(hAI,vE),J,O,(hHH),O,O,O,B,O,X,X,X,(hG),O,A,O,X','6,X,X,(vDF),(vHE),X,X,X,(hHJ,vE),C,O,X,X,(hHI),O,O,O,(vDF),(vHH),(hFA),A,O,B,O,O,X,X,(hE),O,I,O,X,X,(hHH),O,O,X','6,X,(vA),(vA),X,X,X,(hE),O,O,(vCJ),X,X,(hG),O,O,O,(vHI),X,X,(hHC),O,O,H,(vB),X,X,(hCE),O,O,D,X,X,X,(hE),O,O','6,X,X,X,X,(vEH),(vEC),X,X,X,(hEB,vEJ),O,O,X,X,(hEC,vEF),O,O,B,X,(hDD,vEI),O,B,C,X,(hB),O,D,A,X,X,(hEC),O,O,X,X,X','6,X,X,X,X,(vIF),(vH),X,X,X,(hIJ,vGJ),B,I,X,X,(hIB,vIC),O,O,G,X,(hIA,vC),O,O,O,X,(hE),O,O,O,X,X,(hIA),E,O,X,X,X','7,X,(vC),(vFB),X,X,X,X,(hFH),O,O,(vFA),(vFJ),(vC),X,(hFJ),O,O,O,O,O,X,X,X,(hA,vJ),O,O,O,X,X,(hG),D,O,O,(vC),(vFC),X,(hBH),A,O,O,O,E,X,X,X,X,(hFH),O,I','6,X,X,(vFD),(vC),X,X,X,(hDH),E,F,(vDG),(vDD),X,(hDF,vDI),O,O,A,O,(hDG),O,O,(hDG,vDG),O,O,(hDJ),O,D,J,O,X,X,X,(hJ),E,O,X','6,X,X,X,(vE),(vGH),(vIC),X,X,(hD,vIG),O,O,A,X,(hIF,vJ),O,J,E,O,(hJ),O,D,(hGG,vGH),O,O,(hGG),O,O,O,O,X,(hIC),O,O,O,X,X','7,X,X,X,X,(vAG),(vJA),(vH),X,X,X,(hAJ,vDJ),O,O,O,X,X,(hJF),O,O,O,O,X,X,(hG),D,O,X,X,X,(vJH),(hJE,vJD),C,I,X,X,(hAE),B,O,O,O,X,X,(hAJ),O,O,E,X,X,X','7,X,X,X,X,(vGG),(vIA),(vGF),X,X,X,(hGF),O,O,D,X,X,X,(hGJ,vIB),O,O,O,X,X,(hGH,vGD),O,O,O,X,X,(hII,vC),O,J,O,X,X,(hIH),J,O,O,X,X,X,(hGE),O,I,O,X,X,X','6,X,X,(vFA),(vEC),X,X,X,(hI,vFI),F,O,X,X,(hDE),O,O,O,(vFF),(vFF),(hDI),G,J,O,F,O,X,X,(hFJ),O,D,O,X,X,(hFH),J,A,X','7,X,X,X,X,X,(vID),(vBB),X,X,X,X,(hBC),O,I,X,X,(vIH),(vBH),(hBF,vF),O,O,X,(hIE,vD),O,O,I,O,O,(hAG),O,O,O,O,F,X,(hA),O,O,X,X,X,X,(hD),O,O,X,X,X,X','7,X,(vCD),(vCC),X,X,X,X,(hE),B,C,(vCE),X,X,X,(hCD),O,O,O,(vE),(vCG),X,X,(hCH),O,O,O,O,X,X,(hFC),B,J,G,O,(vCC),X,X,X,(hCI),O,O,O,X,X,X,X,(hG),O,O','7,X,X,X,(vID),(vD),(vFB),X,X,X,(hIB,vID),O,O,O,X,X,(hJE,vIA),J,C,O,D,(vF),(hIB),O,O,X,(hIG),O,O,(hIJ),O,O,(vD),(hA,vID),O,O,X,(hJF),O,O,O,O,X,X,(hIE),O,O,O,X,X','7,X,X,(vAC),(vAH),X,X,X,X,(hD),O,O,(vAD),X,X,X,(hCH,vAD),O,O,O,(vAA),(vF),(hAC),O,H,(hAB,vAJ),O,O,A,(hAE),O,O,O,(hD,vAD),O,O,X,X,(hAC),O,O,O,X,X,X,X,(hG),O,O,X','6,X,X,(vBB),(vBE),X,X,X,(hBH),O,I,(vBG),(vBB),X,(hHE,vBD),H,D,O,O,(hBA),C,O,(hA,vG),O,O,(hBF),I,O,O,O,X,X,X,(hG),O,O,X','6,X,X,(vEC),(vD),X,X,X,(hD,vH),O,O,(vIB),X,(hIA),O,O,O,O,(vE),(hII),O,F,(hII,vIG),O,O,X,(hIH),O,O,O,O,X,X,(hIA),O,D,X','6,X,X,X,X,(vEH),(vEG),X,X,X,(hEB,vEF),O,O,X,X,(hAC,vG),O,B,O,X,(hEE,vEC),O,D,O,X,(hEE),O,O,O,X,X,(hEJ),D,O,X,X,X','6,X,(vD),(vB),X,X,X,(hA),O,O,(vE),X,X,(hE),A,O,O,(vCJ),X,X,(hCH),O,A,O,(vCI),X,X,(hB),O,D,O,X,X,X,(hCB),G,O','7,X,X,X,X,(vHJ),(vIF),(vIB),X,X,X,(hIH,vJI),O,O,J,X,X,(hIA),O,O,O,F,X,X,(hIG),O,C,X,X,X,(vD),(hA,vIB),O,J,X,X,(hHB),O,O,O,O,X,X,(hHB),O,O,O,X,X,X','7,X,X,X,(vBJ),(vIB),X,X,X,(vIF),(hBB,vBB),O,O,(vBA),X,(hIC),O,O,O,O,O,(vBA),(hBD),O,O,(hC,vC),O,O,O,(hBJ),E,O,O,(hBC,vBI),G,H,X,(hBA),O,O,O,O,O,X,X,(hBF),O,O,X,X','7,X,(vHI),(vHE),X,X,X,X,(hA),O,O,X,X,X,X,(hHG),O,O,(vHH),(vHE),(vIJ),X,(hHA),O,O,O,O,O,(vHI),X,(hID),H,O,O,B,I,X,X,X,X,(hHB),F,O,X,X,X,X,(hHE),O,H','6,X,X,(vAJ),(vAJ),X,X,X,(hAF,vAA),G,A,X,X,(hDA),O,O,O,(vDE),(vAH),(hAJ),O,O,O,O,I,X,X,(hAG),D,C,O,X,X,(hAI),O,O,X','6,X,X,X,X,(vDH),(vDA),X,X,X,(hG,vDG),O,E,X,X,(hBJ,vBC),O,O,O,X,(hBI,vE),O,E,O,X,(hE),O,O,O,X,X,(hDH),O,E,X,X,X','6,X,X,X,X,(vHJ),(vHH),X,X,X,(hHE,vCC),O,O,X,X,(hF,vG),A,O,O,X,(hHC,vHJ),O,B,O,X,(hHH),O,O,O,X,X,(hHI),O,O,X,X,X','7,X,(vJ),(vDG),X,X,(vDF),(vEF),(hC),E,B,X,(hEA),O,O,(hEE),C,O,(vH),(hED,vEF),A,O,X,(hEC),O,O,O,O,X,X,(hDD,vEF),O,O,O,O,(vEA),(hEJ),O,F,X,(hJ),O,O,(hEF),O,O,X,(hEF),O,O','7,X,X,X,(vCC),(vD),X,X,X,(vJE),(hI,vCH),O,O,(vBF),X,(hCC),O,O,O,O,A,(vJB),(hCB),G,O,O,(hJA,vJF),O,O,(hJA),O,O,(hG,vH),O,O,O,X,(hCE),O,O,O,O,O,X,X,(hH),O,O,X,X','7,X,X,(vEI),(vEB),(vG),X,X,X,(hEF),E,O,O,(vHE),X,X,(hEF,vH),O,O,O,O,(vEI),(hH),O,O,X,(hEH),O,B,(hG),O,O,(vG),(hEI,vED),O,O,X,(hAG),C,O,O,O,X,X,X,(hEE),O,O,O,X','6,X,X,X,X,(vJE),(vF),X,X,X,(hI,vJJ),O,O,X,X,(hEC,vJJ),H,O,O,X,(hF,vJB),O,O,O,X,(hJI),A,C,E,X,X,(hJD),O,J,X,X,X','6,X,X,X,(vH),(vAE),X,X,X,(hCB,vCJ),O,O,(vCB),X,(hCA,vD),O,O,O,O,(hD),C,O,(hCC,vJ),O,O,(hAB),A,O,F,O,X,X,(hB),G,O,X,X','6,X,X,(vEC),(vEG),X,X,X,(hEF),O,O,(vFC),(vEI),X,(hHJ,vJ),E,O,O,A,(hJ),O,O,(hEA,vEA),O,O,(hHH),O,O,O,B,X,X,X,(hEF),O,O,X','7,X,(vEI),(vEC),X,X,X,X,(hH),O,O,X,X,X,X,(hED),O,O,(vEB),(vEG),(vGB),X,(hEJ),O,O,O,O,O,(vD),X,(hIA),O,O,O,O,C,X,X,X,X,(hA),O,I,X,X,X,X,(hEB),A,O','7,X,X,X,(vF),(vG),(vIB),X,X,(vG),(hBA,vIH),J,I,D,X,(hBG),O,O,O,O,O,(vBG),(hA),O,O,X,(hE),O,O,(hBB),O,C,(vA),(hBI,vBE),O,O,X,(hBA),O,O,O,O,O,X,(hBF),O,O,O,X,X','7,X,X,(vEF),(vDI),X,X,X,X,(hDG),O,O,(vDA),X,X,X,(hEA,vG),O,O,O,(vEJ),(vJ),(hF),O,G,(hDH,vDI),O,O,F,(hED),O,O,O,(hDD,vB),O,O,X,X,(hDB),O,O,A,X,X,X,X,(hH),O,O,X','7,X,X,X,X,(vJH),(vD),(vAJ),X,X,X,(hAC,vDH),O,O,O,X,X,(hAA),O,O,O,O,X,X,(hC),F,O,X,X,X,(vC),(hAJ,vAA),I,H,X,X,(hJA),O,D,O,G,X,X,(hJB),O,C,O,X,X,X','6,X,X,X,(vDC),(vG),X,X,X,(hA),O,O,(vCH),X,(vCI),(hCB,vB),O,O,O,(hDF),O,H,O,O,O,(hH),O,O,O,X,X,X,(hH),J,O,X,X','6,X,X,(vCG),(vGA),X,X,X,(hE),O,O,(vGG),(vGB),X,(hCI,vF),O,O,O,I,(hGI),O,O,(hI,vD),O,A,(hGH),O,B,O,O,X,X,X,(hA),O,O,X','6,X,X,X,(vJ),(vHF),X,X,(vF),(hHG,vHD),O,A,X,(hHI),A,O,O,O,(vHE),(hB),G,O,(hD,vHE),O,F,X,(hGJ),O,O,O,O,X,(hHD),O,O,X,X','6,X,X,X,X,(vBD),(vD),X,X,X,(hD,vBB),O,O,X,X,(hI,vHD),O,O,O,X,(hHD,vBE),O,O,A,X,(hHF),C,O,G,X,X,(hBI),O,O,X,X,X','7,X,(vJ),(vFB),(vDB),X,X,X,(hFC),O,O,O,(vFE),X,X,(hFB),O,O,O,O,X,X,X,X,(hG),I,O,X,X,X,X,(hA),O,O,(vFG),(vE),X,X,(hDD),O,O,O,A,X,X,X,(hFD),D,E,J','6,X,X,X,(vAD),(vAH),X,X,(vB),(hF,vEB),O,O,X,(hED),O,O,O,O,(vD),(hD),O,O,(hJ,vI),O,O,X,(hEH),O,A,O,C,X,(hB),G,O,X,X','6,X,X,X,X,(vFG),(vFB),X,X,X,(hFD,vB),O,O,X,X,(hFG,vFG),O,O,O,X,(hI,vH),O,O,C,X,(hGA),E,H,O,X,X,(hD),O,G,X,X,X','7,X,X,X,(vBH),(vBB),X,X,X,X,(hBJ,vBJ),I,O,(vHE),(vI),X,(hBF,vBA),O,O,O,O,O,(hBE),O,D,X,(hA),O,O,(hBC),O,O,(vA),(hBB,vBH),O,O,(hDA),B,H,O,O,O,X,X,X,(hI),O,O,X,X','7,X,X,X,(vEC),(vD),X,X,X,(vJ),(hEB,vEJ),O,O,X,X,(hFC),O,O,O,F,(vEG),X,(hG),O,O,(hH,vFI),O,E,(vEH),X,(hEB),A,O,(hED,vJ),O,O,X,X,(hFI),O,O,O,O,X,X,(hED),O,O,X,X','6,X,(vGH),(vGG),X,X,X,(hGE),O,O,(vFI),(vGJ),X,(hGF),O,O,D,O,X,X,(hGB),O,C,O,(vGG),X,(hFG),O,O,O,O,X,X,X,(hE),O,I','7,X,X,X,(vF),(vGI),X,X,X,(vJ),(hB,vGA),H,G,X,X,(hHF),O,O,O,A,(vHH),X,(hB),O,O,(hGB,vGA),C,O,(vC),X,(hGC),O,O,(hGI,vGF),O,O,X,X,(hHB),O,E,O,O,X,X,(hA),O,O,X,X','7,X,X,X,X,X,(vED),(vIG),X,X,X,X,(hEC),O,O,X,X,(vAC),(vA),(hH,vEG),O,O,X,(hAE,vB),O,O,H,O,O,(hIJ),O,O,O,B,O,X,(hEC),O,O,X,X,X,X,(hEI),O,O,X,X,X,X','7,X,X,(vAI),(vAA),X,X,X,X,(hAD,vAG),O,O,(vAE),X,X,(hAH),O,O,O,O,(vBH),(vD),(hG),O,O,(hI,vE),O,O,O,(hAI),O,O,O,(hG,vAC),D,F,X,X,(hAH),O,O,O,O,X,X,X,(hAJ),O,O,X','7,X,X,(vGD),(vFB),(vJ),X,X,X,(hGD),O,O,O,(vFA),(vGG),X,(hFA),O,O,O,O,O,X,(hGE,vGF),O,O,(hH,vFB),O,O,(hH),O,G,(hGC,vD),O,G,X,(hEB),O,O,O,O,O,X,X,X,(hGC),O,A,O,X','6,X,X,(vAD),(vEE),X,X,X,(hEC),G,O,(vAJ),(vH),X,(hEC,vEG),O,A,O,O,(hEG),F,O,(hEG,vEG),O,O,(hAB),O,E,F,A,X,X,X,(hEG),O,O,X','6,X,X,X,X,(vIB),(vJ),X,X,X,(hB,vIJ),O,O,X,X,(hE,vIF),O,O,C,X,(hFC,vIF),O,A,O,X,(hG),O,O,H,X,X,(hIJ),O,O,X,X,X','6,X,X,X,(vIB),(vEB),X,X,X,(hD,vAE),O,O,(vE),X,(hIJ,vE),O,O,O,O,(hII),O,O,(hJ,vC),H,O,(hAE),O,O,G,J,X,X,(hC),O,O,X,X','6,X,X,(vFF),(vB),X,X,X,(hC,vI),O,J,(vJE),X,(hJJ),O,O,I,G,(vA),(hJJ),O,O,(hJD,vJE),O,O,X,(hJB),O,O,F,O,X,X,(hJH),C,J,X','7,X,X,X,(vEI),(vJI),X,X,X,X,(hJA),O,O,(vJE),(vJJ),X,X,(hJI,vJB),O,E,O,D,X,(hJI,vC),O,H,(hJB,vJE),O,O,(hB),O,O,(hF,vD),O,O,X,(hJB),O,O,O,O,X,X,X,X,(hJE),O,O,X,X','7,X,(vJB),(vFD),X,X,(vFE),(vH),(hJF),O,O,X,(hH),O,O,(hJC),O,O,(vH),(hJF,vJF),O,O,X,(hJI),H,O,O,O,X,X,(hFJ,vJJ),J,O,O,O,(vJA),(hA),G,O,X,(hJF),O,C,(hJC),O,O,X,(hD),O,O','7,X,(vI),(vDH),X,X,X,X,(hB),O,I,X,X,X,X,(hC),O,O,(vA),(vI),(vDJ),X,(hDH),O,B,O,O,O,(vDH),X,(hGG),O,O,O,J,O,X,X,X,X,(hHH),B,O,X,X,X,X,(hHE),O,O','6,X,X,(vDI),(vE),X,X,X,(hA,vDA),E,O,(vHI),X,(hHI),F,A,O,O,(vDF),(hDD),O,O,(hDJ,vDJ),O,O,X,(hDG),O,O,H,O,X,X,(hB),O,D,X','6,X,(vJ),(vDH),X,X,X,(hDA),G,O,(vDA),(vDB),X,(hDB),O,O,I,F,X,X,(hG),O,F,O,(vDI),X,(hED),G,O,O,F,X,X,X,(hDE),O,H','6,X,X,(vCJ),(vD),X,X,X,(hG),O,O,(vAD),(vAE),X,(hCC,vI),O,O,A,O,(hJ),O,F,(hAD,vAD),I,H,(hCD),O,O,O,F,X,X,X,(hAJ),O,G,X','7,X,X,X,X,(vEF),(vEC),(vF),X,X,X,(hED,vEB),O,O,O,X,X,(hEB),O,O,O,O,X,X,(hC),O,D,X,X,X,(vI),(hB,vEE),O,O,X,X,(hEB),E,H,D,O,X,X,(hHJ),O,G,O,X,X,X','7,X,X,X,X,(vJF),(vIC),X,X,X,(vIA),(hD,vJE),O,O,X,X,(hIJ,vD),J,O,O,D,(vG),(hJC),I,O,O,(hJA,vC),O,O,(hJF),J,C,(hJF,vJE),O,O,O,X,(hIB),O,O,O,O,X,X,(hJF),O,O,X,X,X','6,X,(vH),(vJE),X,X,X,(hC),J,O,(vJJ),(vJC),X,(hJJ),A,I,O,H,X,X,(hD),O,O,A,(vC),X,(hAI),F,B,O,O,X,X,X,(hC),J,O','7,X,(vA),(vEE),X,X,(vD),(vF),(hEC),O,O,(vIH),(hI,vEB),O,O,(hBD),O,O,O,O,F,O,X,X,(hA),O,O,X,X,X,(vJ),(hEJ,vEG),F,O,(vA),(vG),(hBG),O,O,O,O,O,O,(hEH),O,O,X,(hG),O,O','6,X,X,X,(vFG),(vFC),X,X,(vE),(hFE,vFF),A,O,X,(hBF),O,O,O,O,(vH),(hE),O,O,(hD,vFF),I,O,X,(hFF),O,O,E,D,X,(hFI),O,O,X,X','6,X,X,(vHA),(vFH),X,X,X,(hFF),O,O,(vFH),(vE),X,(hDI,vFG),O,O,O,O,(hFG),B,O,(hC,vFB),O,O,(hDC),O,G,O,F,X,X,X,(hFF),O,O,X','7,X,X,(vBE),(vBB),(vA),X,X,X,(hH),O,O,O,(vBA),(vH),X,(hGI,vBB),O,J,O,O,O,(hBG),O,O,X,(hI),O,O,(hC),O,O,(vBG),(hE,vBD),H,C,(hBI),O,O,O,O,O,X,X,X,(hGG),O,O,O,X','7,X,X,X,X,X,(vHC),(vF),X,X,X,X,(hF,vC),O,E,X,X,(vEJ),(hEF,vEG),F,O,H,X,(hHD),C,O,O,O,X,X,(hHC,vI),A,O,O,O,X,(hJ),D,O,O,X,X,X,(hF),O,O,X,X,X,X','6,X,X,(vH),(vDC),X,X,X,(hCI,vCD),O,O,X,X,(hH),O,O,O,(vCA),(vCB),(hCJ),O,I,O,D,E,X,X,(hDI),E,H,O,X,X,(hG),O,O,X','7,X,X,X,X,(vJ),(vHE),X,X,X,X,(hHA,vHF),O,B,(vHE),X,X,(hEC,vHG),O,O,O,O,X,(hHE,vHG),O,O,(hA,vHB),O,O,(hJ),O,O,(hHE,vJ),O,O,X,(hED),O,J,O,O,X,X,X,(hB),O,O,X,X,X','6,X,X,(vJG),(vA),X,X,X,(hI),B,O,(vJC),(vJH),X,(hJH,vJC),O,E,O,O,(hB),O,O,(hJJ,vF),O,O,(hCE),O,O,D,I,X,X,X,(hB),O,H,X','6,X,X,X,X,(vDG),(vHH),X,X,(vDH),(hJ,vHB),O,O,X,(hJF),O,O,O,O,X,(hHF,vE),O,O,O,X,(hDJ),H,O,O,I,X,(hHC),G,O,X,X,X','7,X,(vAI),(vHC),X,X,X,X,(hD),O,G,X,X,(vHI),(vG),(hAJ),O,O,(vB),(hH,vAH),O,O,X,(hHF,vH),O,O,F,O,O,(hCA),O,O,O,O,O,(vF),(hH),O,O,X,(hG),O,O,X,X,X,X,(hAH),O,O','7,X,X,X,X,(vFG),(vFI),X,X,X,X,(hFI,vFB),O,O,(vFJ),X,(vFA),(hFG,vGA),O,B,O,O,(hIB),O,O,O,(hH,vJ),O,O,(hJ),O,O,(hFD,vD),O,C,O,(hII),O,O,O,O,X,X,X,(hE),O,O,X,X,X','7,X,X,X,(vI),(vEG),(vFD),X,X,(vED),(hA,vEB),O,O,O,X,(hJC),O,O,A,O,O,X,(hEG),O,O,(hEG,vEC),O,O,(vB),X,(hH),O,O,(hJ,vEB),O,O,X,(hEI),O,O,O,O,J,X,(hFF),O,H,O,X,X','6,X,X,(vEI),(vEB),X,X,X,(hEC,vB),O,O,(vEB),X,(hHC),J,O,O,F,(vEC),(hH),O,O,(hB,vEC),O,O,X,(hEH),O,O,O,O,X,X,(hEA),D,O,X','6,X,X,(vAF),(vBF),X,X,X,(hBI),O,G,(vAD),(vBD),X,(hBI,vF),O,J,O,E,(hBB),A,G,(hBI,vBI),O,H,(hAJ),B,O,O,O,X,X,X,(hBA),O,O,X','6,X,(vCB),(vJ),X,X,X,(hCE),A,O,(vCI),X,X,(hCG),D,O,O,(vCC),X,X,(hCA),O,O,O,(vB),X,X,(hB),O,E,G,X,X,X,(hG),O,H','7,X,X,X,X,X,(vFI),(vHG),X,X,X,X,(hHJ,vHH),O,O,X,X,(vHC),(hHD,vHG),O,O,O,X,(hHH),O,O,O,O,X,X,(hFE,vHC),O,O,O,D,X,(hHE),H,O,O,X,X,X,(hHE),I,A,X,X,X,X','7,X,X,(vFA),(vC),X,X,X,X,(hE),O,B,(vAC),(vGJ),X,X,(hFF,vG),O,O,O,O,(vAI),(hAA),O,D,(hAB,vAC),O,O,O,(hAH),O,O,O,(hAB,vAB),O,O,X,(hFJ),O,O,O,O,X,X,X,X,(hAH),O,J,X','7,X,X,X,(vIF),(vIB),X,X,X,X,(hID),O,O,(vC),X,X,(vIF),(hIH,vEE),O,O,O,(vII),(hEB),O,O,O,(hIB,vIF),D,J,(hIF),O,O,(hII,vIE),O,O,O,X,(hJ),O,G,O,X,X,X,X,(hIF),O,O,X,X','7,X,(vDJ),(vDB),X,X,X,X,(hDJ),O,O,(vDF),(vCE),(vI),X,(hCH),O,O,O,O,O,X,X,X,(hDC,vDB),O,A,G,X,X,(hFE),O,O,O,(vDJ),(vI),X,(hCF),O,O,O,O,O,X,X,X,X,(hDE),O,O','6,X,X,(vCI),(vJ),X,X,X,(hA),O,E,(vEG),(vCC),X,(hEG,vCF),O,O,D,O,(hJ),C,G,(hB,vCC),C,O,(hED),O,O,A,O,X,X,X,(hCD),O,O,X','6,X,X,X,(vG),(vFE),X,X,X,(hG,vBC),O,O,(vBC),X,(hFJ,vC),O,E,O,I,(hG),O,O,(hBF,vBC),O,O,(hEJ),O,O,O,O,X,X,(hBA),D,O,X,X','6,X,X,(vAJ),(vE),X,X,X,(hFH,vH),O,O,(vFA),X,(hFH),O,O,O,O,(vFI),(hI),O,C,(hFI,vFD),O,O,X,(hAC),O,O,I,G,X,X,(hC),O,O,X','6,X,X,X,(vE),(vCJ),X,X,(vFF),(hA,vHJ),C,O,X,(hFC),O,O,O,F,(vD),(hFI),O,O,(hFE,vFJ),O,O,X,(hFG),O,O,O,O,X,(hFD),O,O,X,X','7,X,X,X,(vBJ),(vBI),X,X,X,X,(hA),O,O,(vCH),(vBJ),X,(vCJ),(hCB,vG),H,O,I,B,(hBA),O,O,O,(hBE,vG),O,O,(hBB),F,O,(hBE,vBI),O,O,O,(hBI),O,O,O,O,X,X,X,X,(hBC),O,O,X,X','6,X,X,(vCJ),(vD),X,X,X,(hH),O,O,(vBD),(vJ),X,(hCI,vCH),O,J,F,O,(hCG),O,E,(hA,vCD),O,F,(hBF),O,O,O,O,X,X,X,(hCG),O,O,X','6,X,X,X,X,(vJB),(vG),X,X,X,(hA,vH),I,O,X,X,(hCD,vCG),O,O,B,X,(hCF,vCD),O,O,O,X,(hJD),O,H,O,X,X,(hB),O,O,X,X,X','7,X,(vI),(vEH),X,X,(vCC),(vF),(hG),O,O,X,(hH),O,C,(hJ),O,O,(vAD),(hAG,vG),O,O,X,(hEI),F,O,O,O,X,X,(hAD,vAB),O,O,I,O,(vI),(hG),O,O,X,(hC),O,O,(hAJ),O,O,X,(hAA),O,O','7,X,X,X,X,X,(vEC),(vEA),X,X,X,X,(hB),O,O,X,X,(vDF),(vEH),(hEC,vH),H,O,X,(hEA,vI),O,B,E,O,O,(hDB),E,J,O,D,O,X,(hEH),O,A,X,X,X,X,(hI),O,O,X,X,X,X','6,X,X,X,(vBC),(vBC),X,X,X,(hBJ,vEC),H,O,(vBB),X,(hBE,vA),D,J,O,O,(hC),O,O,(hBE,vBG),O,O,(hEG),H,O,B,O,X,X,(hBI),O,O,X,X','7,X,(vE),(vCF),X,X,X,X,(hJ),O,O,(vFB),X,X,X,(hCJ),O,O,A,(vFE),(vCA),X,X,(hIH),O,O,O,O,X,X,(hFF),O,O,O,B,(vFA),X,X,X,(hCI),O,O,O,X,X,X,X,(hFG),O,O','7,X,X,X,X,(vBH),(vH),X,X,X,X,(hI),O,O,(vE),X,X,X,(hJG,vBF),O,O,O,X,(vH),(hBA,vJE),O,O,O,O,(hDG),O,O,O,O,X,X,(hBG),O,F,O,X,X,X,X,(hA),J,O,X,X,X','7,X,X,X,X,X,(vIC),(vA),X,X,X,(vII),(hG,vIH),F,I,X,X,(hIG),O,O,O,D,X,X,(hC,vC),O,O,J,X,X,(hIF,vE),O,G,A,X,X,(hIH),O,O,O,O,X,X,(hJ),F,D,X,X,X,X','7,X,X,X,(vH),(vCJ),X,X,X,(vCG),(hCB,vEG),O,O,X,X,(hEF),O,I,O,O,(vCI),X,(hCD),O,J,(hCB,vCJ),E,O,(vCC),X,(hCE),O,O,(hCI,vH),O,O,X,X,(hEB),O,O,O,O,X,X,(hD),O,O,X,X','6,X,(vGA),(vBE),X,X,X,(hGC),H,O,(vGF),X,X,(hGG),O,O,O,(vGD),X,X,(hBG),O,J,O,(vGD),X,X,(hGD),O,O,E,X,X,X,(hGH),O,O','6,X,X,(vEE),(vEJ),X,X,X,(hI,vEF),O,O,(vEH),X,(hEA),O,O,O,E,(vB),(hEE),O,O,(hB,vB),O,O,X,(hEG),A,O,I,O,X,X,(hA),D,B,X','6,X,(vJ),(vHA),X,X,X,(hHH),D,O,(vHG),X,X,(hI),O,O,F,(vDG),X,X,(hDJ),O,O,O,(vHF),X,X,(hHF),O,O,E,X,X,X,(hHE),B,O','6,X,X,X,X,(vFI),(vE),X,X,X,(hH,vA),J,I,X,X,(hGF,vD),O,O,F,X,(hGF,vC),O,O,A,X,(hD),O,O,O,X,X,(hD),O,O,X,X,X','7,X,X,(vHG),(vE),X,X,X,X,(hGD),O,O,(vGA),(vHC),(vAJ),X,(hGD,vAC),O,O,O,O,O,(hGC),O,O,(hAA,vGC),O,O,O,(hAC),O,O,F,(hGD,vD),O,O,(hHB),O,O,O,O,O,X,X,X,X,(hI),O,D,X','7,X,X,(vBG),(vBJ),X,(vBD),(vE),X,(hC),O,O,(hBB,vAG),O,C,X,(hBE),O,O,O,O,D,X,(hBG),O,O,O,(vBE),X,X,(vE),(hBI,vJ),O,O,O,X,(hCG),F,G,O,O,O,X,(hC),O,O,(hBJ),O,O,X','7,X,X,X,X,X,(vEA),(vJJ),X,X,(vED),(vJI),(hF),O,O,X,(hB),O,O,(hJH,vB),O,O,X,(hED),O,B,O,O,X,X,(hJI,vJI),O,O,C,O,X,(hJH),O,O,(hJJ),O,O,X,(hF),J,E,X,X,X,X','6,X,(vF),(vED),X,X,X,(hEI),O,O,(vEA),X,X,(hEJ),O,O,J,(vB),X,X,(hB),O,O,O,(vG),X,X,(hJ),B,O,C,X,X,X,(hF),O,E','6,X,X,X,X,(vCH),(vCD),X,X,X,(hG,vCH),O,O,X,X,(hCH,vCI),O,O,O,X,(hFA,vCE),O,O,J,X,(hFF),O,O,O,X,X,(hI),F,C,X,X,X','6,X,X,(vCH),(vA),X,X,X,(hE,vE),D,O,(vAG),(vHC),(hHB),O,O,C,O,I,(hHA),O,O,(hE,vJ),O,O,(hCH),A,O,O,O,O,X,X,(hHD),O,O,X','7,X,(vF),(vDG),(vGD),X,X,X,(hA),O,D,O,(vI),(vGE),X,(hDG),O,C,O,O,O,X,(hGC),H,O,(hH,vA),O,O,(vGF),X,(hH),O,O,(hGB,vGD),O,O,X,(hDH),O,D,O,O,O,X,X,X,(hA),O,O,G','7,X,X,X,X,(vIG),(vIG),X,X,X,X,(hCJ),O,O,(vCE),X,X,X,(hIE,vEA),O,O,O,X,(vJ),(hEA,vIE),O,O,O,O,(hCH),O,F,O,O,X,X,(hCH),I,B,O,X,X,X,X,(hCH),O,O,X,X,X','7,X,X,X,X,(vJ),(vDB),X,X,X,X,(hDG,vH),O,O,X,X,(vB),(hJ,vEB),E,O,O,(vG),(hDJ),O,F,D,(hI,vDC),O,O,(hA),O,O,(hJ,vA),O,O,I,X,(hDA),O,O,O,X,X,X,(hDH),O,O,X,X,X','6,X,X,X,(vEE),(vJA),(vEI),X,X,(hD,vEE),O,F,O,X,(hED,vEC),O,O,O,O,(hJ),O,O,(hEH,vEI),O,O,(hIB),O,O,O,O,X,(hII),O,O,O,X,X','6,X,(vE),(vGH),X,X,X,(hC),O,J,(vFJ),X,X,(hGH),O,O,O,(vJ),X,X,(hFA),B,O,I,(vFF),X,X,(hFG),O,O,O,X,X,X,(hB),F,G','6,X,X,(vIF),(vIJ),X,X,X,(hD,vIC),O,O,X,X,(hIB),O,O,O,(vIG),(vA),(hBF),O,O,F,I,O,X,X,(hE),D,O,F,X,X,(hIF),O,C,X','7,X,(vCD),(vB),X,X,X,X,(hII),O,D,(vA),X,X,X,(hIJ),O,O,O,(vII),X,X,(hID),O,O,O,O,(vIJ),(vCJ),X,X,(hCA),H,O,F,O,X,X,X,(hA),O,O,G,X,X,X,X,(hII),J,O','7,X,(vC),(vFF),X,X,(vHF),(vD),(hFD),O,O,(vHG),(hA,vFJ),O,O,(hHF),O,O,O,O,O,O,X,X,(hFG,vFH),O,O,O,X,X,(hFB,vI),O,O,O,(vFB),(vB),(hIG),O,O,O,O,D,J,(hG),O,I,X,(hFE),O,O','7,X,(vHJ),(vDE),X,X,(vDI),(vHH),(hHG),O,J,(vHJ),(hJ),O,O,(hHE),O,O,O,(hHJ,vB),O,O,X,(hHH),O,O,O,O,X,X,(hDJ,vHA),D,O,E,O,(vF),(hHJ),O,O,(hA),O,O,E,(hHA),O,O,X,(hI),O,O','7,X,(vEH),(vFA),X,X,X,X,(hEB),O,O,(vFA),X,X,X,(hFD),O,O,O,(vEE),(vID),X,X,(hFB),O,O,O,O,X,X,(hFJ),O,O,O,O,(vEE),X,X,X,(hJ),O,B,O,X,X,X,X,(hEH),C,O','6,X,(vJ),(vE),X,X,X,(hA),B,C,(vCJ),X,X,(hCG),O,O,O,(vCD),X,X,(hHF),O,O,O,(vJ),X,X,(hE),O,O,H,X,X,X,(hCE),O,O','6,X,(vGC),(vGH),X,X,X,(hGG),O,O,(vGB),X,X,(hGI),E,O,I,(vGG),X,X,(hIJ),O,C,O,(vA),X,X,(hD),G,O,O,X,X,X,(hD),O,O','6,X,X,X,X,(vIG),(vII),X,X,X,(hE,vIA),I,G,X,X,(hGJ,vGF),O,C,O,X,(hIE,vII),D,O,O,X,(hGJ),O,B,O,X,X,(hA),O,J,X,X,X','6,X,X,X,X,(vIA),(vE),X,X,(vJB),(hB,vII),I,J,X,(hIF),O,O,O,H,X,(hIB,vG),D,J,O,X,(hJG),C,O,O,F,X,(hB),O,O,X,X,X','7,X,X,X,(vDB),(vGG),X,X,X,X,(hGH),O,O,(vGA),(vGA),X,X,(hGF,vGA),O,O,O,O,X,(hGA,vGE),B,O,(hGD,vI),O,O,(hJ),O,I,(hGE,vGG),O,O,X,(hDA),O,D,O,O,X,X,X,X,(hF),O,O,X,X','6,X,X,X,(vFB),(vI),X,X,X,(hGF),O,O,(vGA),X,(vH),(hGA,vFD),O,O,O,(hFF),O,A,O,O,C,(hGG),O,J,O,X,X,X,(hGH),O,D,X,X','6,X,X,(vGA),(vA),X,X,X,(hB,vGE),O,O,(vHJ),X,(hBD),O,O,O,O,(vGH),(hGC),O,O,(hGJ,vGE),O,O,X,(hGG),O,F,O,O,X,X,(hGC),O,O,X','7,X,X,(vCE),(vG),(vI),X,X,X,(hEE),A,O,E,(vCD),(vCH),X,(hEG,vCD),O,O,O,O,O,(hA),G,C,X,(hEH),O,O,(hEE),O,O,(vI),(hA,vD),O,O,(hCF),O,O,O,O,O,X,X,X,(hED),O,O,B,X','7,X,(vG),(vDC),X,(vBA),(vDG),X,(hJ),O,G,(hDA,vBA),O,O,X,(hBC),O,O,G,O,O,X,X,(hDH),O,O,O,(vG),X,X,X,(hG,vDI),O,O,O,(vJ),X,(hBB),E,O,O,O,O,X,(hH),O,J,(hB),O,O','6,X,X,X,(vJG),(vCG),X,X,(vJG),(hJB,vJH),O,O,X,(hJH),I,B,O,O,(vD),(hJB),O,O,(hA,vJG),O,O,X,(hJB),O,B,O,O,X,(hF),I,C,X,X','7,X,(vA),(vE),X,X,(vD),(vB),(hF),O,O,(vJJ),(hI,vGD),O,O,(hGD),O,O,O,O,I,O,X,X,(hJI),O,O,X,X,X,(vJE),(hA,vF),I,O,(vD),(vJJ),(hGA),O,O,O,J,O,O,(hH),O,O,X,(hI),O,O','7,X,X,(vEH),(vEF),X,X,X,X,(hEI,vIH),O,O,(vEI),X,X,(hEI),O,O,O,O,(vIE),(vEJ),(hD),O,O,(hEH,vH),O,O,O,(hEC),O,O,O,(hD,vC),H,G,X,X,(hIA),O,O,O,O,X,X,X,(hD),E,O,X','7,X,X,X,X,X,(vEA),(vCJ),X,X,X,X,(hCD,vCC),O,O,X,X,(vCI),(hCJ,vEH),O,O,O,X,(hDH),O,J,B,O,X,X,(hCH,vD),O,O,O,O,X,(hCJ),O,O,O,X,X,X,(hJ),O,G,X,X,X,X','7,X,(vB),(vFF),X,(vEI),(vFE),X,(hH),O,O,(hFC,vIB),G,O,X,(hFC),O,O,O,O,O,X,X,X,(hFH),O,D,X,X,X,X,(hFF,vFG),O,O,(vFE),(vFH),X,(hEE),O,O,J,O,O,X,(hFG),O,O,(hFG),O,O','6,X,(vHE),(vII),X,X,X,(hHB),O,O,(vHF),(vHJ),X,(hHD),B,O,O,O,X,X,(hG),H,O,O,(vHE),X,(hCA),O,O,E,B,X,X,X,(hHB),O,G','6,X,(vH),(vAF),X,X,X,(hAC),O,O,(vAD),X,X,(hDI),J,O,O,(vAH),X,X,(hAC),O,O,O,(vAI),X,X,(hH),O,O,B,X,X,X,(hAH),O,E','6,X,(vC),(vHA),X,X,X,(hC),O,J,(vHA),X,X,(hF),J,O,O,(vHC),X,X,(hI),O,J,O,(vF),X,X,(hEJ),O,O,B,X,X,X,(hG),O,O','6,X,X,X,(vFJ),(vJC),X,X,(vFF),(hFF,vJE),O,O,X,(hFH),O,F,O,O,(vD),(hFI),O,C,(hE,vH),D,O,X,(hJC),O,O,O,A,X,(hFG),O,J,X,X','7,X,X,X,X,X,(vDE),(vBB),X,(vC),(vDF),X,(hBF),O,O,(hH),O,O,(vE),(hH,vBI),B,O,(hDF),O,O,O,O,D,(vE),X,(hDI,vBE),O,O,C,O,B,(hBF),O,A,X,(hG),E,D,(hG),O,O,X,X,X,X','7,X,(vJ),(vFH),X,X,X,X,(hHH),F,A,X,X,(vGE),(vA),(hI),O,O,(vC),(hF,vD),O,O,X,(hHC,vF),H,O,O,O,O,(hGJ),O,O,O,O,O,(vE),(hE),O,O,X,(hHI),O,O,X,X,X,X,(hA),O,O','7,X,X,(vCD),(vCB),(vF),X,X,X,(hCA,vCJ),O,O,O,(vFH),X,(hCD),O,O,O,O,O,(vCB),(hH),O,O,X,(hI),O,O,(hCE),O,B,(vCE),(hCH,vCI),O,G,X,(hFA),O,G,O,O,O,X,X,(hBC),H,O,O,X','6,X,X,X,X,(vHD),(vHH),X,X,X,(hA,vHH),H,I,X,X,(hHJ,vIG),O,C,O,X,(hHC,vE),O,O,O,X,(hIG),J,O,O,X,X,(hHF),O,O,X,X,X','6,X,X,(vFD),(vJB),X,X,X,(hH,vH),O,O,(vJD),X,(hFH),O,O,O,O,(vJI),(hJD),O,O,(hJD,vG),J,E,X,(hJD),O,O,O,O,X,X,(hB),A,O,X','6,X,X,X,(vC),(vDC),X,X,(vF),(hHB,vDI),O,O,(vDJ),(hDG),O,O,E,O,O,(hHA),O,O,(hHD,vG),O,O,(hEJ),O,O,F,O,O,X,(hJ),O,O,X,X','7,X,X,X,X,X,(vEJ),(vG),X,X,X,X,(hD,vI),C,O,X,X,(vEG),(hFE,vFE),O,O,O,X,(hFD),O,O,O,O,X,X,(hEC,vFI),O,O,O,O,X,(hEC),B,O,H,X,X,X,(hJ),O,O,X,X,X,X','7,X,(vI),(vAC),X,X,(vAI),(vCG),(hB),O,I,X,(hCB,vCD),O,O,(hH),A,D,(hCD,vAF),O,O,O,X,(hAC),O,O,O,O,X,X,(hCF,vCC),O,O,O,O,(vB),(hCB),O,O,O,(hCF),O,O,(hCB),O,J,X,(hB),O,O','6,X,X,X,(vJB),(vIG),X,X,(vA),(hJI,vJC),O,F,X,(hJB),O,O,O,O,(vJE),(hJD),B,O,(hJB,vD),O,H,X,(hJG),O,I,O,O,X,(hA),O,E,X,X','7,X,X,X,X,(vCD),(vCC),(vB),X,X,X,(hCC,vEC),O,I,O,X,X,(hCH),C,O,O,O,X,X,(hCA),F,O,X,X,X,(vA),(hCH,vCE),O,E,X,X,(hGA),C,O,O,O,X,X,(hCE),O,O,O,X,X,X','6,X,X,X,X,(vJI),(vA),X,X,(vJH),(hJE,vJI),O,G,X,(hJE),F,O,O,D,X,(hC,vB),O,E,O,X,(hJH),O,O,O,O,X,(hJD),O,E,X,X,X','6,X,X,X,X,(vAJ),(vAJ),X,X,X,(hAF,vGB),O,O,X,X,(hAE,vD),O,O,O,X,(hAJ,vF),O,J,O,X,(hAF),O,O,H,X,X,(hB),O,I,X,X,X','7,X,X,X,X,(vH),(vIE),X,X,X,X,(hA,vA),O,O,X,X,(vID),(hF,vCH),O,O,A,(vIE),(hIH),O,O,O,(hIA,vIH),O,O,(hIE),O,O,(hIG,vIA),B,O,O,X,(hIF),O,G,A,X,X,X,(hIE),O,D,X,X,X','7,X,(vEF),(vB),(vFC),X,X,X,(hH),O,O,O,(vEA),X,X,(hED),C,O,O,O,X,X,X,X,(hEG),O,F,X,X,X,X,(hEI),O,O,(vEH),(vI),X,X,(hFH),O,O,O,O,X,X,X,(hEE),O,I,O','6,X,(vHI),(vDG),X,X,X,(hHE),J,O,(vDG),X,X,(hHC),H,O,O,(vHA),X,X,(hDH),F,O,G,(vHE),X,X,(hHC),O,O,O,X,X,X,(hHE),O,O','6,X,X,(vAD),(vAE),X,X,X,(hAA),O,O,(vAD),(vAA),X,(hAI,vI),O,F,D,J,(hC),A,O,(hB,vJ),A,E,(hAB),O,I,C,J,X,X,X,(hI),O,H,X','6,X,X,(vDA),(vE),X,X,X,(hJ,vDE),O,F,(vGG),X,(hDJ),O,O,O,O,(vC),(hDD),O,O,(hJ,vI),O,O,X,(hGG),O,D,O,O,X,X,(hDA),G,B,X','7,X,X,(vJD),(vG),(vI),X,X,X,(hG),O,O,H,(vEB),(vEF),X,(hEB),O,O,B,O,J,X,(hEJ,vA),O,H,(hEE,vEA),O,O,(hA),O,O,(hEJ,vG),O,O,X,(hJF),O,O,O,O,O,X,X,X,(hG),F,O,O,X','6,X,X,X,X,(vEJ),(vG),X,X,X,(hDE,vF),O,O,X,X,(hDJ,vF),O,O,O,X,(hA,vDA),O,O,O,X,(hDI),B,O,O,X,X,(hDE),C,O,X,X,X','6,X,X,(vAC),(vD),X,X,X,(hD,vEI),O,O,(vBC),X,(hBA),O,O,O,O,(vH),(hEF),O,O,(hEI,vF),O,O,X,(hEF),O,O,A,O,X,X,(hEE),G,D,X','6,X,X,(vGB),(vD),X,X,X,(hGG),A,C,(vGJ),(vC),X,(hGG,vGC),O,O,O,J,(hGH),O,O,(hE,vI),G,H,(hHF),O,H,O,O,X,X,X,(hE),O,O,X','6,X,X,(vIJ),(vCD),X,X,X,(hCD),O,O,(vCI),(vCG),X,(hIH,vCC),G,O,O,O,(hCE),O,I,(hCH,vCD),G,O,(hIC),B,D,O,O,X,X,X,(hA),O,O,X','7,X,(vII),(vDH),(vID),X,X,X,(hIG),O,O,O,X,X,X,(hDA),O,C,J,(vII),X,X,X,(hID),F,O,O,(vDH),X,X,X,(hID),O,O,O,(vID),X,X,X,(hIE),A,O,O,X,X,X,(hDD),O,O,O','7,X,(vEB),(vF),X,X,X,X,(hED),O,O,(vAJ),(vED),(vD),X,(hIB),O,O,O,G,O,X,X,X,(hF,vA),O,O,O,X,X,(hED),O,O,F,(vA),(vEB),X,(hIE),O,H,O,O,O,X,X,X,X,(hEE),O,O','7,X,X,X,X,(vCA),(vCE),(vB),X,X,X,(hF),O,O,O,X,X,X,(hJG,vCD),I,O,O,X,X,(hF,vB),O,O,O,X,X,(hJI,vCI),O,F,O,X,X,(hD),O,O,O,X,X,X,(hCI),O,O,O,X,X,X','6,X,(vJI),(vI),X,X,X,(hH),O,O,(vD),X,X,(hJA),F,O,O,(vJH),X,X,(hJI),C,G,O,(vJJ),X,X,(hD),O,O,O,X,X,X,(hJE),O,O','6,X,X,X,(vDC),(vAE),X,X,X,(hI),O,B,(vI),X,(vC),(hJ,vDE),O,O,O,(hAF),A,D,O,O,O,(hI),O,O,G,X,X,X,(hDA),H,O,X,X','7,X,X,X,(vFD),(vAF),X,X,X,(vFD),(hFE,vFA),B,O,X,X,(hHI),O,O,O,O,(vFF),X,(hFI),O,O,(hC,vG),O,H,(vFA),X,(hE),O,O,(hFB,vC),O,O,X,X,(hFJ),O,G,O,O,X,X,(hH),O,O,X,X','7,X,X,X,X,(vD),(vHD),X,X,X,(vDH),(hA,vJJ),O,O,(vE),X,(hHB,vJH),O,O,O,E,J,(hJE),H,O,O,(hD,vF),O,O,(hJG),E,O,(hJE,vJG),C,O,O,(hHH),J,O,O,O,O,X,X,(hJJ),O,O,X,X,X','7,X,X,X,X,(vBA),(vEB),X,X,X,(vBG),(hC,vBB),O,O,X,X,(hBD,vBA),O,O,O,O,(vBJ),(hBC),O,O,O,(hBG,vBD),A,O,(hBB),O,O,(hEE,vBF),O,O,D,X,(hBJ),O,O,O,I,X,X,(hBD),O,O,X,X,X','7,X,X,X,X,X,(vDG),(vC),X,(vB),(vFH),X,(hC),E,O,(hA),O,O,(vDD),(hH,vDB),O,O,(hDA),C,O,O,O,O,(vE),X,(hFH,vDE),O,O,H,O,F,(hDH),O,O,X,(hDI),O,O,(hJ),O,O,X,X,X,X','6,X,(vB),(vE),X,X,X,(hA),D,O,(vA),X,X,(hH),O,C,O,(vIG),X,X,(hDI),O,O,O,(vDF),X,X,(hIF),O,O,O,X,X,X,(hH),O,O','7,X,(vHF),(vC),X,X,(vC),(vHF),(hC),O,O,(vBC),(hA,vBF),O,O,(hBE),O,O,O,O,O,O,X,X,(hHD),A,O,X,X,X,(vD),(hJ,vHA),O,O,(vHI),(vC),(hCH),J,O,O,O,O,B,(hHH),O,O,X,(hE),O,O','6,X,X,X,(vJ),(vDA),X,X,(vFD),(hB,vFE),O,O,(vDA),(hDJ),O,O,O,O,O,(hDE),O,O,(hDA,vC),O,H,(hBA),O,I,O,G,O,X,(hJ),E,O,X,X','6,X,(vGA),(vA),X,X,X,(hGE),O,O,(vGD),X,X,(hGA),O,G,A,(vED),X,X,(hGE),O,O,O,(vGD),X,X,(hEB),C,H,F,X,X,X,(hGE),A,I','6,X,(vIC),(vFD),X,X,X,(hIG),O,C,(vIB),X,X,(hFJ),O,O,O,(vII),X,X,(hIE),O,O,F,(vIA),X,X,(hIJ),F,I,O,X,X,X,(hIC),O,O','6,X,X,X,(vJG),(vHH),X,X,X,(hHA),O,O,(vHD),X,(vE),(hJF,vHJ),O,O,O,(hHB),F,O,D,O,O,(hE),O,J,O,X,X,X,(hHE),I,O,X,X','7,X,X,X,(vGG),(vI),(vEC),X,X,(vBH),(hJ,vBI),O,O,O,X,(hBJ),O,O,O,O,O,(vJ),(hGJ),O,O,X,(hA),O,O,(hGC),O,O,(vC),(hGB,vGJ),O,O,X,(hBF),O,O,O,O,B,X,(hBH),O,O,O,X,X','7,X,X,X,X,X,(vD),(vHB),X,X,(vG),(vFC),(hHA,vAI),O,O,X,(hAB),O,O,O,O,O,X,(hAD),O,O,O,(vHB),X,X,(vF),(hAF,vHI),O,O,O,X,(hAB),O,O,O,O,O,X,(hB),O,E,X,X,X,X','6,X,(vBC),(vDF),X,X,X,(hBE),O,O,(vDB),X,X,(hDG),O,J,O,(vC),X,X,(hBI),O,O,O,(vBB),X,X,(hBA),O,O,D,X,X,X,(hBG),F,O','6,X,X,X,(vH),(vDC),(vGA),X,X,(hA,vIE),O,O,O,X,(hIG,vGG),O,O,O,O,(hF),O,O,(hGF,vJ),J,O,(hGA),O,O,O,O,X,(hIE),O,O,O,X,X','6,X,(vHC),(vHJ),X,X,X,(hHC),A,B,(vA),X,X,(hHI),O,O,O,(vHA),X,X,(hD),F,O,O,(vB),X,X,(hII),G,O,O,X,X,X,(hB),O,O','7,X,(vH),(vJA),X,X,(vIE),(vJI),(hJC),O,O,(vDG),(hJE,vIG),O,O,(hDD),I,O,O,O,O,O,X,X,(hII,vIG),O,O,O,X,X,(hIE,vJA),O,O,O,(vB),(vJI),(hDG),C,O,O,O,O,O,(hJF),O,O,X,(hH),O,O','7,X,(vHH),(vBE),X,X,X,X,(hE),B,O,X,(vHF),(vBJ),X,(hHI),C,O,(hJ,vHI),O,O,X,X,(hBC),D,O,O,O,X,X,(hHH),O,O,D,O,(vHF),X,(hHD),F,O,(hHD),G,O,X,X,X,X,(hHE),O,O','7,X,X,X,X,X,(vIF),(vI),X,X,X,X,(hB,vGF),O,O,X,X,(vEG),(hGG,vB),O,O,O,X,(hGJ),O,O,O,H,X,X,(hGA,vA),O,O,O,O,X,(hGC),I,H,O,X,X,X,(hH),G,J,X,X,X,X','7,X,X,X,X,X,(vJF),(vJF),X,X,X,X,(hJD),A,O,X,X,(vBG),(vJB),(hI,vI),O,O,X,(hBD,vJF),F,O,O,E,O,(hIB),O,O,O,O,C,X,(hJG),O,B,X,X,X,X,(hI),O,J,X,X,X,X','6,X,X,(vEI),(vC),X,X,X,(hH,vGG),O,O,(vGD),X,(hBJ),O,O,O,O,(vD),(hGI),O,O,(hD,vD),E,G,X,(hBG),O,O,A,O,X,X,(hJ),O,O,X','7,X,X,X,X,(vFI),(vJF),X,X,X,X,(hJH),O,O,(vJC),X,X,X,(hEE,vEC),O,O,O,X,(vJE),(hED,vEF),O,O,O,G,(hJB),O,O,O,O,X,X,(hEH),O,O,G,X,X,X,X,(hJG),O,O,X,X,X','7,X,X,X,(vJ),(vEI),X,X,X,X,(hJ,vEC),O,A,(vBD),X,X,(hHC,vEA),O,O,O,I,(vF),(hEE),O,O,(hEE,vHD),B,J,O,(hHE),O,O,O,(hG,vED),O,O,X,(hHD),O,O,O,O,X,X,X,(hEA),O,O,X,X','7,X,X,X,X,X,(vFH),(vED),X,X,X,X,(hEC,vEA),O,O,X,X,(vED),(hFI,vEH),O,O,O,X,(hEE),O,O,A,D,X,X,(hFB,vJ),O,O,O,J,X,(hFI),O,O,O,X,X,X,(hI),O,A,X,X,X,X','6,X,(vB),(vHI),X,X,X,(hHH),O,O,(vHJ),(vGA),X,(hHH),O,O,O,I,X,X,(hGE),O,A,O,(vHE),X,(hHJ),H,B,F,D,X,X,X,(hHJ),O,C'
+]
+
+kakuro(testPuzzles);
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-425-prime-connection.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-425-prime-connection.md
index d46740b0d58..dfba791e407 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-425-prime-connection.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-425-prime-connection.md
@@ -1,33 +1,36 @@
 ---
 id: 5900f5151000cf542c510028
 title: 'Problem 425: Prime connection'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302095
 dashedName: problem-425-prime-connection
 ---
 
 # --description--
 
-Two positive numbers A and B are said to be connected (denoted by "A ↔ B") if one of these conditions holds:
+Two positive numbers $A$ and $B$ are said to be connected (denoted by "$A ↔ B$") if one of these conditions holds:
 
-(1) A and B have the same length and differ in exactly one digit; for example, 123 ↔ 173.
+1. $A$ and $B$ have the same length and differ in exactly one digit; for example, $123 ↔ 173$.
+2. Adding one digit to the left of $A$ (or $B$) makes $B$ (or $A$); for example, $23 ↔ 223$ and $123 ↔ 23$.
 
-(2) Adding one digit to the left of A (or B) makes B (or A); for example, 23 ↔ 223 and 123 ↔ 23.
+We call a prime $P$ a 2's relative if there exists a chain of connected primes between 2 and $P$ and no prime in the chain exceeds $P$.
 
-We call a prime P a 2's relative if there exists a chain of connected primes between 2 and P and no prime in the chain exceeds P.
+For example, 127 is a 2's relative. One of the possible chains is shown below:
 
-For example, 127 is a 2's relative. One of the possible chains is shown below: 2 ↔ 3 ↔ 13 ↔ 113 ↔ 103 ↔ 107 ↔ 127 However, 11 and 103 are not 2's relatives.
+$$2 ↔ 3 ↔ 13 ↔ 113 ↔ 103 ↔ 107 ↔ 127$$
 
-Let F(N) be the sum of the primes ≤ N which are not 2's relatives. We can verify that F(103) = 431 and F(104) = 78728.
+However, 11 and 103 are not 2's relatives.
 
-Find F(107).
+Let $F(N)$ be the sum of the primes $≤ N$ which are not 2's relatives. We can verify that $F({10}^3) = 431$ and $F({10}^4) = 78\\,728$.
+
+Find $F({10}^7)$.
 
 # --hints--
 
-`euler425()` should return 46479497324.
+`primeConnection()` should return `46479497324`.
 
 ```js
-assert.strictEqual(euler425(), 46479497324);
+assert.strictEqual(primeConnection(), 46479497324);
 ```
 
 # --seed--
@@ -35,12 +38,12 @@ assert.strictEqual(euler425(), 46479497324);
 ## --seed-contents--
 
 ```js
-function euler425() {
+function primeConnection() {
 
   return true;
 }
 
-euler425();
+primeConnection();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md
index 5e2c48c34e0..89314f8aa76 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5171000cf542c510029
 title: 'Problem 426: Box-ball system'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302096
 dashedName: problem-426-box-ball-system
 ---
@@ -14,20 +14,31 @@ A turn consists of moving each ball exactly once according to the following rule
 
 After one turn the sequence (2, 2, 2, 1, 2) becomes (2, 2, 1, 2, 3) as can be seen below; note that we begin the new sequence starting at the first occupied box.
 
+<img class="img-responsive center-block" alt="animation showing one complete turn from (2, 2, 2, 1, 2) to (2, 2, 1, 2, 3)" src="https://cdn.freecodecamp.org/curriculum/project-euler/box-ball-system-1.gif" style="background-color: white; padding: 10px;" />
+
 A system like this is called a Box-Ball System or BBS for short.
 
-It can be shown that after a sufficient number of turns, the system evolves to a state where the consecutive numbers of occupied boxes is invariant. In the example below, the consecutive numbers of occupied boxes evolves to \[1, 2, 3]; we shall call this the final state.
+It can be shown that after a sufficient number of turns, the system evolves to a state where the consecutive numbers of occupied boxes is invariant. In the example below, the consecutive numbers of occupied boxes evolves to [1, 2, 3]; we shall call this the final state.
 
-We define the sequence {ti}:s0 = 290797 sk+1 = sk2 mod 50515093 tk = (sk mod 64) + 1
+<img class="img-responsive center-block" alt="four turns from occupied boxes [2, 2, 2] to final state [1, 2, 3]" src="https://cdn.freecodecamp.org/curriculum/project-euler/box-ball-system-2.gif" style="background-color: white; padding: 10px;" />
 
-Starting from the initial configuration (t0, t1, …, t10), the final state becomes \[1, 3, 10, 24, 51, 75]. Starting from the initial configuration (t0, t1, …, t10 000 000), find the final state. Give as your answer the sum of the squares of the elements of the final state. For example, if the final state is \[1, 2, 3] then 14 ( = 12 + 22 + 32) is your answer.
+We define the sequence $\\{t_i\\}$:
+
+$$\begin{align}   & s_0 = 290\\,797 \\\\
+  & s_{k + 1} = {s_k}^2\bmod 50\\,515\\,093 \\\\ & t_k = (s_k\bmod 64) + 1 \end{align}$$
+
+Starting from the initial configuration $(t_0, t_1, \ldots, t_{10})$, the final state becomes [1, 3, 10, 24, 51, 75].
+
+Starting from the initial configuration $(t_0, t_1, \ldots, t_{10\\,000\\,000})$, find the final state.
+
+Give as your answer the sum of the squares of the elements of the final state. For example, if the final state is [1, 2, 3] then $14 (= 1^2 + 2^2 + 3^2)$ is your answer.
 
 # --hints--
 
-`euler426()` should return 31591886008.
+`boxBallSystem()` should return `31591886008`.
 
 ```js
-assert.strictEqual(euler426(), 31591886008);
+assert.strictEqual(boxBallSystem(), 31591886008);
 ```
 
 # --seed--
@@ -35,12 +46,12 @@ assert.strictEqual(euler426(), 31591886008);
 ## --seed-contents--
 
 ```js
-function euler426() {
+function boxBallSystem() {
 
   return true;
 }
 
-euler426();
+boxBallSystem();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-427-n-sequences.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-427-n-sequences.md
index 8f399eeaf0a..3f244f7937c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-427-n-sequences.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-427-n-sequences.md
@@ -1,31 +1,31 @@
 ---
 id: 5900f5181000cf542c51002a
 title: 'Problem 427: n-sequences'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302097
 dashedName: problem-427-n-sequences
 ---
 
 # --description--
 
-A sequence of integers S = {si} is called an n-sequence if it has n elements and each element si satisfies 1 ≤ si ≤ n. Thus there are nn distinct n-sequences in total.
+A sequence of integers $S = \\{s_i\\}$ is called an $n$-sequence if it has $n$ elements and each element $s_i$ satisfies $1 ≤ s_i ≤ n$. Thus there are $n^n$ distinct $n$-sequences in total.
 
-For example, the sequence S = {1, 5, 5, 10, 7, 7, 7, 2, 3, 7} is a 10-sequence.
+For example, the sequence $S = \\{1, 5, 5, 10, 7, 7, 7, 2, 3, 7\\}$ is a 10-sequence.
 
-For any sequence S, let L(S) be the length of the longest contiguous subsequence of S with the same value. For example, for the given sequence S above, L(S) = 3, because of the three consecutive 7's.
+For any sequence $S$, let $L(S)$ be the length of the longest contiguous subsequence of $S$ with the same value. For example, for the given sequence $S$ above, $L(S) = 3$, because of the three consecutive 7's.
 
-Let f(n) = ∑ L(S) for all n-sequences S.
+Let $f(n) = \sum L(S)$ for all $n$-sequences $S$.
 
-For example, f(3) = 45, f(7) = 1403689 and f(11) = 481496895121.
+For example, $f(3) = 45$, $f(7) = 1\\,403\\,689$ and $f(11) = 481\\,496\\,895\\,121$.
 
-Find f(7 500 000) mod 1 000 000 009.
+Find $f(7\\,500\\,000)\bmod 1\\,000\\,000\\,009$.
 
 # --hints--
 
-`euler427()` should return 97138867.
+`nSequences()` should return `97138867`.
 
 ```js
-assert.strictEqual(euler427(), 97138867);
+assert.strictEqual(nSequences(), 97138867);
 ```
 
 # --seed--
@@ -33,12 +33,12 @@ assert.strictEqual(euler427(), 97138867);
 ## --seed-contents--
 
 ```js
-function euler427() {
+function nSequences() {
 
   return true;
 }
 
-euler427();
+nSequences();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md
index 5919151606c..bf6e6bdaa12 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md
@@ -1,34 +1,39 @@
 ---
 id: 5900f5191000cf542c51002b
 title: 'Problem 428: Necklace of Circles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302098
 dashedName: problem-428-necklace-of-circles
 ---
 
 # --description--
 
-Let `a`, `b` and `c` be positive numbers.
+Let $a$, $b$ and $c$ be positive numbers.
 
-Let W, X, Y, Z be four collinear points where |WX| = `a`, |XY| = `b`, |YZ| = `c` and |WZ| = `a` + `b` + `c`.
+Let $W$, $X$, $Y$, $Z$ be four collinear points where $|WX| = a$, $|XY| = b$, $|YZ| = c$ and $|WZ| = a + b + c$.
 
-Let C<sub>in</sub> be the circle having the diameter XY.
+Let $C_{\text{in}}$ be the circle having the diameter $XY$.
 
-Let C<sub>out</sub> be the circle having the diameter WZ.
+Let $C_{\text{out}}$ be the circle having the diameter $WZ$.
 
-The triplet (`a`, `b`, `c`) is called a *necklace triplet* if you can place `k` ≥ 3 distinct circles C<sub>1</sub>, C<sub>2</sub>, ..., C<sub><var>k</var></sub> such that:
+The triplet ($a$, $b$, $c$) is called a *necklace triplet* if you can place $k ≥ 3$ distinct circles $C_1, C_2, \ldots, C_k$ such that:
+
+- $C_i$ has no common interior points with any $C_j$ for $1 ≤ i$, $j ≤ k$ and $i ≠ j$,
+- $C_i$ is tangent to both $C_{\text{in}}$ and $C_{\text{out}}$ for $1 ≤ i ≤ k$,
+- $C_i$ is tangent to $C_{i + 1}$ for $1 ≤ i &lt; k$, and
+- $C_k$ is tangent to $C_1$.
 
-<ul><li>C<sub><var>i</var></sub> has no common interior points with any C<sub><var>j</var></sub> for 1 ≤ <var>i</var>, <var>j</var> ≤ <var>k</var> and <var>i</var> ≠ <var>j</var>,</li><li>C<sub><var>i</var></sub> is tangent to both C<sub>in</sub> and C<sub>out</sub> for 1 ≤ <var>i</var> ≤ <var>k</var>,</li><li>C<sub><var>i</var></sub> is tangent to C<sub><var>i</var>+1</sub> for 1 ≤ <var>i</var> &lt; <var>k</var>, and</li><li>C<sub><var>k</var></sub> is tangent to C<sub>1</sub>.</li></ul>
 For example, (5, 5, 5) and (4, 3, 21) are necklace triplets, while it can be shown that (2, 2, 5) is not.
-<img src="https://projecteuler.net/project/images/p428_necklace.png" alt="a visual representation of a necklace triplet" />
 
-Let T(`n`) be the number of necklace triplets (`a`, `b`, `c`) such that `a`, `b` and `c` are positive integers, and `b` ≤ `n`. For example, T(1) = 9, T(20) = 732 and T(3000) = 438106.
+<img class="img-responsive center-block" alt="a visual representation of a necklace triplet" src="https://cdn.freecodecamp.org/curriculum/project-euler/necklace-of-circles.png" style="background-color: white; padding: 10px;" />
 
-Find T(1 000 000 000).
+Let $T(n)$ be the number of necklace triplets $(a, b, c)$ such that $a$, $b$ and $c$ are positive integers, and $b ≤ n$. For example, $T(1) = 9$, $T(20) = 732$ and $T(3\\,000) = 438\\,106$.
+
+Find $T(1\\,000\\,000\\,000)$.
 
 # --hints--
 
-`necklace(1000000000)` should return 747215561862.
+`necklace(1000000000)` should return `747215561862`.
 
 ```js
 assert.strictEqual(necklace(1000000000), 747215561862);
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md
index 8b9c108829c..928c602299f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f5191000cf542c51002c
 title: 'Problem 429: Sum of squares of unitary divisors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302099
 dashedName: problem-429-sum-of-squares-of-unitary-divisors
 ---
 
 # --description--
 
-A unitary divisor d of a number n is a divisor of n that has the property gcd(d, n/d) = 1.
+A unitary divisor $d$ of a number $n$ is a divisor of $n$ that has the property $gcd(d, \frac{n}{d}) = 1$.
 
-The unitary divisors of 4! = 24 are 1, 3, 8 and 24.
+The unitary divisors of $4! = 24$ are 1, 3, 8 and 24.
 
-The sum of their squares is 12 + 32 + 82 + 242 = 650.
+The sum of their squares is $12 + 32 + 82 + 242 = 650$.
 
-Let S(n) represent the sum of the squares of the unitary divisors of n. Thus S(4!)=650.
+Let $S(n)$ represent the sum of the squares of the unitary divisors of $n$. Thus $S(4!) = 650$.
 
-Find S(100 000 000!) modulo 1 000 000 009.
+Find $S(100\\,000\\,000!)$ modulo $1\\,000\\,000\\,009$.
 
 # --hints--
 
-`euler429()` should return 98792821.
+`sumSquaresOfUnitaryDivisors()` should return `98792821`.
 
 ```js
-assert.strictEqual(euler429(), 98792821);
+assert.strictEqual(sumSquaresOfUnitaryDivisors(), 98792821);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler429(), 98792821);
 ## --seed-contents--
 
 ```js
-function euler429() {
+function sumSquaresOfUnitaryDivisors() {
 
   return true;
 }
 
-euler429();
+sumSquaresOfUnitaryDivisors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.md
index 7c3a5a83420..53ae7b50350 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3971000cf542c50feaa
 title: 'Problem 43: Sub-string divisibility'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302100
 dashedName: problem-43-sub-string-divisibility
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-430-range-flips.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-430-range-flips.md
index ba66983c7b3..d8838dbe162 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-430-range-flips.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-430-range-flips.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f51a1000cf542c51002d
 title: 'Problem 430: Range flips'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302101
 dashedName: problem-430-range-flips
 ---
 
 # --description--
 
-N disks are placed in a row, indexed 1 to N from left to right.
+$N$ disks are placed in a row, indexed 1 to $N$ from left to right.
 
 Each disk has a black side and white side. Initially all disks show their white side.
 
-At each turn, two, not necessarily distinct, integers A and B between 1 and N (inclusive) are chosen uniformly at random. All disks with an index from A to B (inclusive) are flipped.
+At each turn, two, not necessarily distinct, integers $A$ and $B$ between 1 and $N$ (inclusive) are chosen uniformly at random. All disks with an index from $A$ to $B$ (inclusive) are flipped.
 
-The following example shows the case N = 8. At the first turn A = 5 and B = 2, and at the second turn A = 4 and B = 6.
+The following example shows the case $N = 8$. At the first turn $A = 5$ and $B = 2$, and at the second turn $A = 4$ and $B = 6$.
 
-Let E(N, M) be the expected number of disks that show their white side after M turns. We can verify that E(3, 1) = 10/9, E(3, 2) = 5/3, E(10, 4) ≈ 5.157 and E(100, 10) ≈ 51.893.
+<img class="img-responsive center-block" alt="example for N = 8, with first turn A = 5 and B = 2, and second turn A = 4 and B = 6" src="https://cdn.freecodecamp.org/curriculum/project-euler/range-flips.gif" style="background-color: white; padding: 10px;" />
 
-Find E(1010, 4000). Give your answer rounded to 2 decimal places behind the decimal point.
+Let $E(N, M)$ be the expected number of disks that show their white side after $M$ turns. We can verify that $E(3, 1) = \frac{10}{9}$, $E(3, 2) = \frac{5}{3}$, $E(10, 4) ≈ 5.157$ and $E(100, 10) ≈ 51.893$.
+
+Find $E({10}^{10}, 4000)$. Give your answer rounded to 2 decimal places behind the decimal point.
 
 # --hints--
 
-`euler430()` should return 5000624921.38.
+`rangeFlips()` should return `5000624921.38`.
 
 ```js
-assert.strictEqual(euler430(), 5000624921.38);
+assert.strictEqual(rangeFlips(), 5000624921.38);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler430(), 5000624921.38);
 ## --seed-contents--
 
 ```js
-function euler430() {
+function rangeFlips() {
 
   return true;
 }
 
-euler430();
+rangeFlips();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md
index 51a104b47a0..4199819468b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f51b1000cf542c51002e
 title: 'Problem 431: Square Space Silo'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302102
 dashedName: problem-431-square-space-silo
 ---
@@ -10,20 +10,22 @@ dashedName: problem-431-square-space-silo
 
 Fred the farmer arranges to have a new storage silo installed on his farm and having an obsession for all things square he is absolutely devastated when he discovers that it is circular. Quentin, the representative from the company that installed the silo, explains that they only manufacture cylindrical silos, but he points out that it is resting on a square base. Fred is not amused and insists that it is removed from his property.
 
-Quick thinking Quentin explains that when granular materials are delivered from above a conical slope is formed and the natural angle made with the horizontal is called the angle of repose. For example if the angle of repose, $\\alpha = 30$ degrees, and grain is delivered at the centre of the silo then a perfect cone will form towards the top of the cylinder. In the case of this silo, which has a diameter of 6m, the amount of space wasted would be approximately 32.648388556 m3. However, if grain is delivered at a point on the top which has a horizontal distance of $x$ metres from the centre then a cone with a strangely curved and sloping base is formed. He shows Fred a picture.
+Quick thinking Quentin explains that when granular materials are delivered from above a conical slope is formed and the natural angle made with the horizontal is called the angle of repose. For example if the angle of repose, $\alpha = 30°$, and grain is delivered at the centre of the silo then a perfect cone will form towards the top of the cylinder. In the case of this silo, which has a diameter of 6m, the amount of space wasted would be approximately 32.648388556 m<sup>3</sup>. However, if grain is delivered at a point on the top which has a horizontal distance of $x$ metres from the centre then a cone with a strangely curved and sloping base is formed. He shows Fred a picture.
 
-We shall let the amount of space wasted in cubic metres be given by $V(x)$. If $x = 1.114785284$, which happens to have three squared decimal places, then the amount of space wasted, $V(1.114785284) \\approx 36$. Given the range of possible solutions to this problem there is exactly one other option: $V(2.511167869) \\approx 49$. It would be like knowing that the square is king of the silo, sitting in splendid glory on top of your grain.
+<img class="img-responsive center-block" alt="image presenting forming of the perfect cone towards the top of the cylinder" src="https://cdn.freecodecamp.org/curriculum/project-euler/square-space-silo.png" style="background-color: white; padding: 10px;" />
 
-Fred's eyes light up with delight at this elegant resolution, but on closer inspection of Quentin's drawings and calculations his happiness turns to despondency once more. Fred points out to Quentin that it's the radius of the silo that is 6 metres, not the diameter, and the angle of repose for his grain is 40 degrees. However, if Quentin can find a set of solutions for this particular silo then he will be more than happy to keep it.
+We shall let the amount of space wasted in cubic metres be given by $V(x)$. If $x = 1.114\\,785\\,284$, which happens to have three squared decimal places, then the amount of space wasted, $V(1.114\\,785\\,284) \approx 36$. Given the range of possible solutions to this problem there is exactly one other option: $V(2.511\\,167\\,869) \approx 49$. It would be like knowing that the square is king of the silo, sitting in splendid glory on top of your grain.
 
-If Quick thinking Quentin is to satisfy frustratingly fussy Fred the farmer's appetite for all things square then determine the values of $x$ for all possible square space wastage options and calculate $\\sum x$ correct to 9 decimal places.
+Fred's eyes light up with delight at this elegant resolution, but on closer inspection of Quentin's drawings and calculations his happiness turns to despondency once more. Fred points out to Quentin that it's the radius of the silo that is 6 metres, not the diameter, and the angle of repose for his grain is 40­°. However, if Quentin can find a set of solutions for this particular silo then he will be more than happy to keep it.
+
+If Quick thinking Quentin is to satisfy frustratingly fussy Fred the farmer's appetite for all things square then determine the values of $x$ for all possible square space wastage options and calculate $\sum x$ correct to 9 decimal places.
 
 # --hints--
 
-`euler431()` should return 23.386029052.
+`squareSpaceSilo()` should return `23.386029052`.
 
 ```js
-assert.strictEqual(euler431(), 23.386029052);
+assert.strictEqual(squareSpaceSilo(), 23.386029052);
 ```
 
 # --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler431(), 23.386029052);
 ## --seed-contents--
 
 ```js
-function euler431() {
+function squareSpaceSilo() {
 
   return true;
 }
 
-euler431();
+squareSpaceSilo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-432-totient-sum.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-432-totient-sum.md
index 4f0f5928ef5..2a3f5b744d9 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-432-totient-sum.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-432-totient-sum.md
@@ -1,25 +1,25 @@
 ---
 id: 5900f51e1000cf542c510030
 title: 'Problem 432: Totient sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302103
 dashedName: problem-432-totient-sum
 ---
 
 # --description--
 
-Let S(n,m) = ∑φ(n × i) for 1 ≤ i ≤ m. (φ is Euler's totient function)
+Let $S(n, m) = \sum φ(n × i)$ for $1 ≤ i ≤ m$. ($φ$ is Euler's totient function)
 
-You are given that S(510510,106 )= 45480596821125120.
+You are given that $S(510\\,510, {10}^6) = 45\\,480\\,596\\,821\\,125\\,120$.
 
-Find S(510510,1011). Give the last 9 digits of your answer.
+Find $S(510\\,510, {10}^{11})$. Give the last 9 digits of your answer.
 
 # --hints--
 
-`euler432()` should return 754862080.
+`totientSum()` should return `754862080`.
 
 ```js
-assert.strictEqual(euler432(), 754862080);
+assert.strictEqual(totientSum(), 754862080);
 ```
 
 # --seed--
@@ -27,12 +27,12 @@ assert.strictEqual(euler432(), 754862080);
 ## --seed-contents--
 
 ```js
-function euler432() {
+function totientSum() {
 
   return true;
 }
 
-euler432();
+totientSum();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md
index 48a01b7a3ba..a570e51bccb 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f51f1000cf542c510031
 title: 'Problem 434: Rigid graphs'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302105
 dashedName: problem-434-rigid-graphs
 ---
@@ -18,18 +18,32 @@ A rigid graph is an embedding of a graph which is not flexible.
 
 Informally, a graph is rigid if by replacing the vertices with fully rotating hinges and the edges with rods that are unbending and inelastic, no parts of the graph can be moved independently from the rest of the graph.
 
-The grid graphs embedded in the Euclidean plane are not rigid, as the following animation demonstrates: However, one can make them rigid by adding diagonal edges to the cells. For example, for the 2x3 grid graph, there are 19 ways to make the graph rigid: Note that for the purposes of this problem, we do not consider changing the orientation of a diagonal edge or adding both diagonal edges to a cell as a different way of making a grid graph rigid.
+The grid graphs embedded in the Euclidean plane are not rigid, as the following animation demonstrates:
 
-Let R(m,n) be the number of ways to make the m × n grid graph rigid. E.g. R(2,3) = 19 and R(5,5) = 23679901
+<img class="img-responsive center-block" alt="animation showing grid graphs are not rigid in Euclidean plane" src="https://cdn.freecodecamp.org/curriculum/project-euler/rigid-graphs-1.gif" style="background-color: white; padding: 10px;" />
 
-Define S(N) as ∑R(i,j) for 1 ≤ i, j ≤ N. E.g. S(5) = 25021721. Find S(100), give your answer modulo 1000000033
+However, one can make them rigid by adding diagonal edges to the cells. For example, for the 2x3 grid graph, there are 19 ways to make the graph rigid:
+
+<img class="img-responsive center-block" alt="19 ways to make 2x3 grid graph rigid" src="https://cdn.freecodecamp.org/curriculum/project-euler/rigid-graphs-2.png" style="background-color: white; padding: 10px;" />
+
+Note that for the purposes of this problem, we do not consider changing the orientation of a diagonal edge or adding both diagonal edges to a cell as a different way of making a grid graph rigid.
+
+Let $R(m, n)$ be the number of ways to make the $m × n$ grid graph rigid.
+
+E.g. $R(2, 3) = 19$ and $R(5, 5) = 23\\,679\\,901$.
+
+Define $S(N)$ as $\sum R(i, j)$ for $1 ≤ i$, $j ≤ N$.
+
+E.g. $S(5) = 25\\,021\\,721$.
+
+Find $S(100)$, give your answer modulo $1\\,000\\,000\\,033$.
 
 # --hints--
 
-`euler434()` should return 863253606.
+`rigidGraphs()` should return `863253606`.
 
 ```js
-assert.strictEqual(euler434(), 863253606);
+assert.strictEqual(rigidGraphs(), 863253606);
 ```
 
 # --seed--
@@ -37,12 +51,12 @@ assert.strictEqual(euler434(), 863253606);
 ## --seed-contents--
 
 ```js
-function euler434() {
+function rigidGraphs() {
 
   return true;
 }
 
-euler434();
+rigidGraphs();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.md
index ee078a73824..9df767adcee 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f5201000cf542c510032
 title: 'Problem 435: Polynomials of Fibonacci numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302106
 dashedName: problem-435-polynomials-of-fibonacci-numbers
 ---
 
 # --description--
 
-The Fibonacci numbers {fn, n ≥ 0} are defined recursively as fn = fn-1 + fn-2 with base cases f0 = 0 and f1 = 1.
+The Fibonacci numbers $\\{f_n, n ≥ 0\\}$ are defined recursively as $f_n = f_{n - 1} + f_{n - 2}$ with base cases $f_0 = 0$ and $f_1 = 1$.
 
-Define the polynomials {Fn, n ≥ 0} as Fn(x) = ∑fixi for 0 ≤ i ≤ n.
+Define the polynomials $\\{F_n, n ≥ 0\\}$ as $F_n(x) = \displaystyle\sum_{i = 0}^n f_ix^i$.
 
-For example, F7(x) = x + x2 + 2x3 + 3x4 + 5x5 + 8x6 + 13x7, and F7(11) = 268357683.
+For example, $F_7(x) = x + x^2 + 2x^3 + 3x^4 + 5x^5 + 8x^6 + 13x^7$, and $F_7(11) = 268\\,357\\,683$.
 
-Let n = 1015. Find the sum \[∑0≤x≤100 Fn(x)] mod 1307674368000 (= 15!).
+Let $n = {10}^{15}$. Find the sum $\displaystyle\sum_{x = 0}^{100} F_n(x)$ and give your answer modulo $1\\,307\\,674\\,368\\,000 \\, (= 15!)$.
 
 # --hints--
 
-`euler435()` should return 252541322550.
+`polynomialsOfFibonacciNumbers()` should return `252541322550`.
 
 ```js
-assert.strictEqual(euler435(), 252541322550);
+assert.strictEqual(polynomialsOfFibonacciNumbers(), 252541322550);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler435(), 252541322550);
 ## --seed-contents--
 
 ```js
-function euler435() {
+function polynomialsOfFibonacciNumbers() {
 
   return true;
 }
 
-euler435();
+polynomialsOfFibonacciNumbers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-436-unfair-wager.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-436-unfair-wager.md
index 43b111b868f..444c6f95d1b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-436-unfair-wager.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-436-unfair-wager.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5221000cf542c510033
 title: 'Problem 436: Unfair wager'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302107
 dashedName: problem-436-unfair-wager
 ---
@@ -14,24 +14,26 @@ She suggests they play a game of chance to determine who will wash the dishes.
 
 For this game, they shall use a generator of independent random numbers uniformly distributed between 0 and 1.
 
-The game starts with S = 0.
+The game starts with $S = 0$.
 
-The first player, Louise, adds to S different random numbers from the generator until S > 1 and records her last random number 'x'.
+The first player, Louise, adds to $S$ different random numbers from the generator until $S > 1$ and records her last random number '$x$'.
 
-The second player, Julie, continues adding to S different random numbers from the generator until S > 2 and records her last random number 'y'.
+The second player, Julie, continues adding to $S$ different random numbers from the generator until $S > 2$ and records her last random number '$y$'.
 
-The player with the highest number wins and the loser washes the dishes, i.e. if y > x the second player wins.
+The player with the highest number wins and the loser washes the dishes, i.e. if $y > x$ the second player wins.
 
-For example, if the first player draws 0.62 and 0.44, the first player turn ends since 0.62+0.44 > 1 and x = 0.44. If the second players draws 0.1, 0.27 and 0.91, the second player turn ends since 0.62+0.44+0.1+0.27+0.91 > 2 and y = 0.91. Since y > x, the second player wins.
+For example, if the first player draws 0.62 and 0.44, the first player turn ends since $0.62 + 0.44 > 1$ and $x = 0.44$. If the second players draws 0.1, 0.27 and 0.91, the second player turn ends since $0.62 + 0.44 + 0.1 + 0.27 + 0.91 > 2$ and $y = 0.91$. Since $y > x$, the second player wins.
 
-Louise thinks about it for a second, and objects: "That's not fair". What is the probability that the second player wins? Give your answer rounded to 10 places behind the decimal point in the form 0.abcdefghij
+Louise thinks about it for a second, and objects: "That's not fair".
+
+What is the probability that the second player wins? Give your answer rounded to 10 places behind the decimal point in the form 0.abcdefghij
 
 # --hints--
 
-`euler436()` should return 0.5276662759.
+`unfairWager()` should return `0.5276662759`.
 
 ```js
-assert.strictEqual(euler436(), 0.5276662759);
+assert.strictEqual(unfairWager(), 0.5276662759);
 ```
 
 # --seed--
@@ -39,12 +41,12 @@ assert.strictEqual(euler436(), 0.5276662759);
 ## --seed-contents--
 
 ```js
-function euler436() {
+function unfairWager() {
 
   return true;
 }
 
-euler436();
+unfairWager();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md
index 0072d0f9a9b..47f1606285d 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f5241000cf542c510036
 title: 'Problem 437: Fibonacci primitive roots'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302108
 dashedName: problem-437-fibonacci-primitive-roots
 ---
 
 # --description--
 
-When we calculate 8n modulo 11 for n=0 to 9 we get: 1, 8, 9, 6, 4, 10, 3, 2, 5, 7.
+When we calculate $8^n$ modulo 11 for $n = 0$ to 9 we get: 1, 8, 9, 6, 4, 10, 3, 2, 5, 7.
 
 As we see all possible values from 1 to 10 occur. So 8 is a primitive root of 11.
 
@@ -16,32 +16,24 @@ But there is more:
 
 If we take a closer look we see:
 
-1+8=9
+$$\begin{align}   & 1 + 8 = 9 \\\\
+  & 8 + 9 = 17 ≡ 6\bmod 11 \\\\   & 9 + 6 = 15 ≡ 4\bmod 11 \\\\
+  & 6 + 4 = 10 \\\\   & 4 + 10 = 14 ≡ 3\bmod 11 \\\\
+  & 10 + 3 = 13 ≡ 2\bmod 11 \\\\   & 3 + 2 = 5 \\\\
+  & 2 + 5 = 7 \\\\ & 5 + 7 = 12 ≡ 1\bmod 11. \end{align}$$
 
-8+9=17≡6 mod 11
+So the powers of 8 mod 11 are cyclic with period 10, and $8^n + 8^{n + 1} ≡ 8^{n + 2} (\text{mod } 11)$. 8 is called a Fibonacci primitive root of 11.
 
-9+6=15≡4 mod 11
+Not every prime has a Fibonacci primitive root. There are 323 primes less than 10000 with one or more Fibonacci primitive roots and the sum of these primes is 1480491.
 
-6+4=10
-
-4+10=14≡3 mod 11
-
-10+3=13≡2 mod 11
-
-3+2=5
-
-2+5=7
-
-5+7=12≡1 mod 11.
-
-So the powers of 8 mod 11 are cyclic with period 10, and 8n + 8n+1 ≡ 8n+2 (mod 11). 8 is called a Fibonacci primitive root of 11. Not every prime has a Fibonacci primitive root. There are 323 primes less than 10000 with one or more Fibonacci primitive roots and the sum of these primes is 1480491. Find the sum of the primes less than 100,000,000 with at least one Fibonacci primitive root.
+Find the sum of the primes less than $100\\,000\\,000$ with at least one Fibonacci primitive root.
 
 # --hints--
 
-`euler437()` should return 74204709657207.
+`fibonacciPrimitiveRoots()` should return `74204709657207`.
 
 ```js
-assert.strictEqual(euler437(), 74204709657207);
+assert.strictEqual(fibonacciPrimitiveRoots(), 74204709657207);
 ```
 
 # --seed--
@@ -49,12 +41,12 @@ assert.strictEqual(euler437(), 74204709657207);
 ## --seed-contents--
 
 ```js
-function euler437() {
+function fibonacciPrimitiveRoots() {
 
   return true;
 }
 
-euler437();
+fibonacciPrimitiveRoots();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md
index 112326a2fa3..05c8bd7d4a5 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md
@@ -1,27 +1,34 @@
 ---
 id: 5900f5231000cf542c510034
 title: 'Problem 438: Integer part of polynomial equation''s solutions'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302109
 dashedName: problem-438-integer-part-of-polynomial-equations-solutions
 ---
 
 # --description--
 
-For an n-tuple of integers t = (a1, ..., an), let (x1, ..., xn) be the solutions of the polynomial equation xn + a1xn-1 + a2xn-2 + ... + an-1x + an = 0.
+For an $n$-tuple of integers $t = (a_1, \ldots, a_n)$, let $(x_1, \ldots, x_n)$ be the solutions of the polynomial equation $x^n + a_1x^{n - 1} + a_2x^{n - 2} + \ldots + a_{n - 1}x + a_n = 0$.
 
-Consider the following two conditions: x1, ..., xn are all real. If x1, ..., xn are sorted, ⌊xi⌋ = i for 1 ≤ i ≤ n. (⌊·⌋: floor function.)
+Consider the following two conditions:
 
-In the case of n = 4, there are 12 n-tuples of integers which satisfy both conditions. We define S(t) as the sum of the absolute values of the integers in t. For n = 4 we can verify that ∑S(t) = 2087 for all n-tuples t which satisfy both conditions.
+- $x_1, \ldots, x_n$ are all real.
+- If $x_1, ..., x_n$ are sorted, $⌊x_i⌋ = i$ for $1 ≤ i ≤ n$. ($⌊·⌋:$ floor function.)
 
-Find ∑S(t) for n = 7.
+In the case of $n = 4$, there are 12 $n$-tuples of integers which satisfy both conditions.
+
+We define $S(t)$ as the sum of the absolute values of the integers in $t$.
+
+For $n = 4$ we can verify that $\sum S(t) = 2087$ for all $n$-tuples $t$ which satisfy both conditions.
+
+Find $\sum S(t)$ for $n = 7$.
 
 # --hints--
 
-`euler438()` should return 2046409616809.
+`polynomialIntegerPart()` should return `2046409616809`.
 
 ```js
-assert.strictEqual(euler438(), 2046409616809);
+assert.strictEqual(polynomialIntegerPart(), 2046409616809);
 ```
 
 # --seed--
@@ -29,12 +36,12 @@ assert.strictEqual(euler438(), 2046409616809);
 ## --seed-contents--
 
 ```js
-function euler438() {
+function polynomialIntegerPart() {
 
   return true;
 }
 
-euler438();
+polynomialIntegerPart();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.md
index 4fb1871a853..bb5669ed088 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f5231000cf542c510035
 title: 'Problem 439: Sum of sum of divisors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302110
 dashedName: problem-439-sum-of-sum-of-divisors
 ---
 
 # --description--
 
-Let d(k) be the sum of all divisors of k.
+Let $d(k)$ be the sum of all divisors of $k$.
 
-We define the function S(N) = ∑1≤i≤N ∑1≤j≤Nd(i·j).
+We define the function $S(N) = \sum_{i = 1}^N \sum_{j = 1}^N d(i \times j)$.
 
-For example, S(3) = d(1) + d(2) + d(3) + d(2) + d(4) + d(6) + d(3) + d(6) + d(9) = 59.
+For example, $S(3) = d(1) + d(2) + d(3) + d(2) + d(4) + d(6) + d(3) + d(6) + d(9) = 59$.
 
-You are given that S(103) = 563576517282 and S(105) mod 109 = 215766508. Find S(1011) mod 109.
+You are given that $S({10}^3) = 563\\,576\\,517\\,282$ and $S({10}^5)\bmod {10}^9 = 215\\,766\\,508$.
+
+Find $S({10}^{11})\bmod {10}^9$.
 
 # --hints--
 
-`euler439()` should return 968697378.
+`sumOfSumOfDivisors()` should return `968697378`.
 
 ```js
-assert.strictEqual(euler439(), 968697378);
+assert.strictEqual(sumOfSumOfDivisors(), 968697378);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler439(), 968697378);
 ## --seed-contents--
 
 ```js
-function euler439() {
+function sumOfSumOfDivisors() {
 
   return true;
 }
 
-euler439();
+sumOfSumOfDivisors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-44-pentagon-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-44-pentagon-numbers.md
index 3b89176ca1a..44905c1be79 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-44-pentagon-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-44-pentagon-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3981000cf542c50feab
 title: 'Problem 44: Pentagon numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302111
 dashedName: problem-44-pentagon-numbers
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md
index a68f99a00ad..6e018b213fb 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md
@@ -1,31 +1,40 @@
 ---
 id: 5900f5241000cf542c510037
 title: 'Problem 440: GCD and Tiling'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302112
 dashedName: problem-440-gcd-and-tiling
 ---
 
 # --description--
 
-We want to tile a board of length n and height 1 completely, with either 1 × 2 blocks or 1 × 1 blocks with a single decimal digit on top:
+We want to tile a board of length $n$ and height 1 completely, with either 1 × 2 blocks or 1 × 1 blocks with a single decimal digit on top:
 
-For example, here are some of the ways to tile a board of length n = 8:
+<img class="img-responsive center-block" alt="ten blocks 1x1 with single decimal digit on top, and 1x2 block" src="https://cdn.freecodecamp.org/curriculum/project-euler/gcd-and-tiling-1.png" style="background-color: white; padding: 10px;" />
 
-Let T(n) be the number of ways to tile a board of length n as described above.
+For example, here are some of the ways to tile a board of length $n = 8$:
 
-For example, T(1) = 10 and T(2) = 101.
+<img class="img-responsive center-block" alt="examples of ways to tile a board of length n = 8" src="https://cdn.freecodecamp.org/curriculum/project-euler/gcd-and-tiling-2.png" style="background-color: white; padding: 10px;" />
 
-Let S(L) be the triple sum ∑a,b,c gcd(T(ca), T(cb)) for 1 ≤ a, b, c ≤ L. For example: S(2) = 10444 S(3) = 1292115238446807016106539989 S(4) mod 987 898 789 = 670616280.
+Let $T(n)$ be the number of ways to tile a board of length $n$ as described above.
 
-Find S(2000) mod 987 898 789.
+For example, $T(1) = 10$ and $T(2) = 101$.
+
+Let $S(L)$ be the triple sum $\sum_{a, b, c} gcd(T(c^a), T(c^b))$ for $1 ≤ a, b, c ≤ L$.
+
+Por ejemplo:
+
+$$\begin{align}   & S(2) = 10\\,444 \\\\
+  & S(3) = 1\\,292\\,115\\,238\\,446\\,807\\,016\\,106\\,539\\,989 \\\\ & S(4)\bmod 987\\,898\\,789 = 670\\,616\\,280. \end{align}$$
+
+Find $S(2000)\bmod 987\\,898\\,789$.
 
 # --hints--
 
-`euler440()` should return 970746056.
+`gcdAndTiling()` should return `970746056`.
 
 ```js
-assert.strictEqual(euler440(), 970746056);
+assert.strictEqual(gcdAndTiling(), 970746056);
 ```
 
 # --seed--
@@ -33,12 +42,12 @@ assert.strictEqual(euler440(), 970746056);
 ## --seed-contents--
 
 ```js
-function euler440() {
+function gcdAndTiling() {
 
   return true;
 }
 
-euler440();
+gcdAndTiling();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.md
index 6cc5fd7e2eb..9c310a1f18d 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.md
@@ -1,27 +1,31 @@
 ---
 id: 5900f5261000cf542c510038
 title: 'Problem 441: The inverse summation of coprime couples'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302113
 dashedName: problem-441-the-inverse-summation-of-coprime-couples
 ---
 
 # --description--
 
-For an integer M, we define R(M) as the sum of 1/(p·q) for all the integer pairs p and q which satisfy all of these conditions:
+For an integer $M$, we define $R(M)$ as the sum of $\frac{1}{p·q}$ for all the integer pairs $p$ and $q$ which satisfy all of these conditions:
 
-1 ≤ p &lt; q ≤ M p + q ≥ M p and q are coprime.
+- $1 ≤ p &lt; q ≤ M$
+- $p + q ≥ M$
+- $p$ and $q$ are coprime.
 
-We also define S(N) as the sum of R(i) for 2 ≤ i ≤ N. We can verify that S(2) = R(2) = 1/2, S(10) ≈ 6.9147 and S(100) ≈ 58.2962.
+We also define $S(N)$ as the sum of $R(i)$ for $2 ≤ i ≤ N$.
 
-Find S(107). Give your answer rounded to four decimal places.
+We can verify that $S(2) = R(2) = \frac{1}{2}$, $S(10) ≈ 6.9147$ and $S(100) ≈ 58.2962$.
+
+Find $S({10}^7)$. Give your answer rounded to four decimal places.
 
 # --hints--
 
-`euler441()` should return 5000088.8395.
+`inverseSummationCoprimeCouples()` should return `5000088.8395`.
 
 ```js
-assert.strictEqual(euler441(), 5000088.8395);
+assert.strictEqual(inverseSummationCoprimeCouples(), 5000088.8395);
 ```
 
 # --seed--
@@ -29,12 +33,12 @@ assert.strictEqual(euler441(), 5000088.8395);
 ## --seed-contents--
 
 ```js
-function euler441() {
+function inverseSummationCoprimeCouples() {
 
   return true;
 }
 
-euler441();
+inverseSummationCoprimeCouples();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-442-eleven-free-integers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-442-eleven-free-integers.md
index e5b1e35319a..9e2e8d90986 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-442-eleven-free-integers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-442-eleven-free-integers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5271000cf542c510039
 title: 'Problem 442: Eleven-free integers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302114
 dashedName: problem-442-eleven-free-integers
 ---
@@ -12,16 +12,16 @@ An integer is called eleven-free if its decimal expansion does not contain any s
 
 For example, 2404 and 13431 are eleven-free, while 911 and 4121331 are not.
 
-Let E(n) be the nth positive eleven-free integer. For example, E(3) = 3, E(200) = 213 and E(500 000) = 531563.
+Let $E(n)$ be the $n$th positive eleven-free integer. For example, $E(3) = 3$, $E(200) = 213$ and $E(500\\,000) = 531\\,563$.
 
-Find E(1018).
+Find $E({10}^{18})$.
 
 # --hints--
 
-`euler442()` should return 1295552661530920200.
+`elevenFreeIntegers()` should return `1295552661530920200`.
 
 ```js
-assert.strictEqual(euler442(), 1295552661530920200);
+assert.strictEqual(elevenFreeIntegers(), 1295552661530920200);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler442(), 1295552661530920200);
 ## --seed-contents--
 
 ```js
-function euler442() {
+function elevenFreeIntegers() {
 
   return true;
 }
 
-euler442();
+elevenFreeIntegers();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md
index 9afda46059a..17fc8db1cb5 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md
@@ -1,31 +1,33 @@
 ---
 id: 5900f5271000cf542c51003a
 title: 'Problem 443: GCD sequence'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302115
 dashedName: problem-443-gcd-sequence
 ---
 
 # --description--
 
-Let g(n) be a sequence defined as follows: g(4) = 13, g(n) = g(n-1) + gcd(n, g(n-1)) for n > 4.
+Let $g(n)$ be a sequence defined as follows:
+
+$$\begin{align}   & g(4) = 13, \\\\
+  & g(n) = g(n-1) + gcd(n, g(n - 1)) \text{ for } n > 4. \end{align}$$
 
 The first few values are:
 
-n 4567891011121314151617181920... g(n) 1314161718272829303132333451545560...
+$$\begin{array}{l}   n    & 4  & 5  & 6  & 7  & 8  & 9  & 10 & 11 & 12 & 13 & 14 & 15 & 16 & 17 & 18 & 19 & 20 & \ldots \\\\
+  g(n) & 13 & 14 & 16 & 17 & 18 & 27 & 28 & 29 & 30 & 31 & 32 & 33 & 34 & 51 & 54 & 55 & 60 & \ldots \end{array}$$
 
-<!-- TODO Use MathJax -->
+You are given that $g(1\\,000) = 2\\,524$ and $g(1\\,000\\,000) = 2\\,624\\,152$.
 
-You are given that g(1 000) = 2524 and g(1 000 000) = 2624152.
-
-Find g(1015).
+Find $g({10}^{15})$.
 
 # --hints--
 
-`euler443()` should return 2744233049300770.
+`gcdSequence()` should return `2744233049300770`.
 
 ```js
-assert.strictEqual(euler443(), 2744233049300770);
+assert.strictEqual(gcdSequence(), 2744233049300770);
 ```
 
 # --seed--
@@ -33,12 +35,12 @@ assert.strictEqual(euler443(), 2744233049300770);
 ## --seed-contents--
 
 ```js
-function euler443() {
+function gcdSequence() {
 
   return true;
 }
 
-euler443();
+gcdSequence();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.md
index 04d71de4854..9e52d4e52b4 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f52a1000cf542c51003b
 title: 'Problem 444: The Roundtable Lottery'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302116
 dashedName: problem-444-the-roundtable-lottery
 ---
 
 # --description--
 
-A group of p people decide to sit down at a round table and play a lottery-ticket trading game. Each person starts off with a randomly-assigned, unscratched lottery ticket. Each ticket, when scratched, reveals a whole-pound prize ranging anywhere from £1 to £p, with no two tickets alike. The goal of the game is for each person to maximize his ticket winnings upon leaving the game.
+A group of $p$ people decide to sit down at a round table and play a lottery-ticket trading game. Each person starts off with a randomly-assigned, unscratched lottery ticket. Each ticket, when scratched, reveals a whole-pound prize ranging anywhere from £1 to £$p$, with no two tickets alike. The goal of the game is for each person to maximize his ticket winnings upon leaving the game.
 
 An arbitrary person is chosen to be the first player. Going around the table, each player has only one of two options:
 
@@ -19,18 +19,26 @@ The game ends once all tickets have been scratched. All players still remaining
 
 Assume that each player uses the optimal strategy for maximizing the expected value of his ticket winnings.
 
-Let E(p) represent the expected number of players left at the table when the game ends in a game consisting of p players (e.g. E(111) = 5.2912 when rounded to 5 significant digits).
+Let $E(p)$ represent the expected number of players left at the table when the game ends in a game consisting of $p$ players (e.g. $E(111) = 5.2912$ when rounded to 5 significant digits).
 
-Let S1(N) = E(p) Let Sk(N) = Sk-1(p) for k > 1
+Let $S_1(N) = \displaystyle\sum_{p = 1}^N E(p)$.
 
-Find S20(1014) and write the answer in scientific notation rounded to 10 significant digits. Use a lowercase e to separate mantissa and exponent (e.g. S3(100) = 5.983679014e5).
+Let $S_k(N) = \displaystyle\sum_{p = 1}^N S_{k - 1}(p)$ for $k > 1$.
+
+Find $S_{20}({10}^{14})$ and write the answer as a string in scientific notation rounded to 10 significant digits. Use a lowercase `e` to separate mantissa and exponent. For example, the answer for $S_3(100)$ would be `5.983679014e5`.
 
 # --hints--
 
-`euler444()` should return 1.200856722e+263.
+`roundtableLottery()` should return a string.
 
 ```js
-assert.strictEqual(euler444(), 1.200856722e263);
+assert(typeof roundtableLottery() === 'string');
+```
+
+`roundtableLottery()` should return the string `1.200856722e263`.
+
+```js
+assert.strictEqual(roundtableLottery(), '1.200856722e263');
 ```
 
 # --seed--
@@ -38,12 +46,12 @@ assert.strictEqual(euler444(), 1.200856722e263);
 ## --seed-contents--
 
 ```js
-function euler444() {
+function roundtableLottery() {
 
   return true;
 }
 
-euler444();
+roundtableLottery();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-445-retractions-a.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-445-retractions-a.md
index 39c80f706d7..841d3796c7d 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-445-retractions-a.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-445-retractions-a.md
@@ -1,27 +1,33 @@
 ---
 id: 5900f52a1000cf542c51003c
 title: 'Problem 445: Retractions A'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302117
 dashedName: problem-445-retractions-a
 ---
 
 # --description--
 
-For every integer n>1, the family of functions fn,a,b is defined
+For every integer $n > 1$, the family of functions $f_{n, a, b}$ is defined by:
 
-by fn,a,b(x)≡ax+b mod n for a,b,x integer and 0
+$f_{n, a, b}(x) ≡ ax + b\bmod n$ for $a, b, x$ integer and $0 \lt a \lt n$, $0 \le b \lt n$, $0 \le x \lt n$.
 
-You are given that ∑ R(c) for c=C(100 000,k), and 1 ≤ k ≤99 999 ≡628701600 (mod 1 000 000 007). (C(n,k) is the binomial coefficient).
+We will call $f_{n, a, b}$ a retraction if $f_{n, a, b}(f_{n, a, b}(x)) \equiv f_{n, a, b}(x)\bmod n$ for every $0 \le x \lt n$.
 
-Find ∑ R(c) for c=C(10 000 000,k), and 1 ≤k≤ 9 999 999. Give your answer modulo 1 000 000 007.
+Let $R(n)$ be the number of retractions for $n$.
+
+You are given that
+
+$$\sum_{k = 1}^{99\\,999} R(\displaystyle\binom{100\\,000}{k}) \equiv 628\\,701\\,600\bmod 1\\,000\\,000\\,007$$
+
+Find $$\sum_{k = 1}^{9\\,999\\,999} R(\displaystyle\binom{10\\,000\\,000}{k})$$ Give your answer modulo $1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler445()` should return 659104042.
+`retractionsA()` should return `659104042`.
 
 ```js
-assert.strictEqual(euler445(), 659104042);
+assert.strictEqual(retractionsA(), 659104042);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler445(), 659104042);
 ## --seed-contents--
 
 ```js
-function euler445() {
+function retractionsA() {
 
   return true;
 }
 
-euler445();
+retractionsA();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-446-retractions-b.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-446-retractions-b.md
index a46677999e8..f1919d426f5 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-446-retractions-b.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-446-retractions-b.md
@@ -1,27 +1,33 @@
 ---
 id: 5900f52c1000cf542c51003d
 title: 'Problem 446: Retractions B'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302118
 dashedName: problem-446-retractions-b
 ---
 
 # --description--
 
-For every integer n>1, the family of functions fn,a,b is defined
+For every integer $n > 1$, the family of functions $f_{n, a, b}$ is defined by:
 
-by fn,a,b(x)≡ax+b mod n for a,b,x integer and 0
+$f_{n, a, b}(x) ≡ ax + b\bmod n$ for $a, b, x$ integer and $0 \lt a \lt n$, $0 \le b \lt n$, $0 \le x \lt n$.
 
-F(N)=∑R(n4+4) for 1≤n≤N. F(1024)=77532377300600.
+We will call $f_{n, a, b}$ a retraction if $f_{n, a, b}(f_{n, a, b}(x)) \equiv f_{n, a, b}(x)\bmod n$ for every $0 \le x \lt n$.
 
-Find F(107) (mod 1 000 000 007)
+Let $R(n)$ be the number of retractions for $n$.
+
+$F(N) = \displaystyle\sum_{n = 1}^N R(n^4 + 4)$.
+
+$F(1024) = 77\\,532\\,377\\,300\\,600$.
+
+Find $F({10}^7)$. Give your answer modulo $1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler446()` should return 907803852.
+`retractionsB()` should return `907803852`.
 
 ```js
-assert.strictEqual(euler446(), 907803852);
+assert.strictEqual(retractionsB(), 907803852);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler446(), 907803852);
 ## --seed-contents--
 
 ```js
-function euler446() {
+function retractionsB() {
 
   return true;
 }
 
-euler446();
+retractionsB();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-447-retractions-c.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-447-retractions-c.md
index c8cb09065ca..882f61f24d0 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-447-retractions-c.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-447-retractions-c.md
@@ -1,27 +1,33 @@
 ---
 id: 5900f52c1000cf542c51003e
 title: 'Problem 447: Retractions C'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302119
 dashedName: problem-447-retractions-c
 ---
 
 # --description--
 
-For every integer n>1, the family of functions fn,a,b is defined
+For every integer $n > 1$, the family of functions $f_{n, a, b}$ is defined by:
 
-by fn,a,b(x)≡ax+b mod n for a,b,x integer and 0
+$f_{n, a, b}(x) ≡ ax + b\bmod n$ for $a, b, x$ integer and $0 \lt a \lt n$, $0 \le b \lt n$, $0 \le x \lt n$.
 
-F(N)=∑R(n) for 2≤n≤N. F(107)≡638042271 (mod 1 000 000 007).
+We will call $f_{n, a, b}$ a retraction if $f_{n, a, b}(f_{n, a, b}(x)) \equiv f_{n, a, b}(x)\bmod n$ for every $0 \le x \lt n$.
 
-Find F(1014) (mod 1 000 000 007).
+Let $R(n)$ be the number of retractions for $n$.
+
+$F(N) = \displaystyle\sum_{n = 2}^N R(n)$.
+
+$F({10}^7) ≡ 638\\,042\\,271\bmod 1\\,000\\,000\\,007$.
+
+Find $F({10}^{14})$. Give your answer modulo $1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler447()` should return 530553372.
+`retractionsC()` should return `530553372`.
 
 ```js
-assert.strictEqual(euler447(), 530553372);
+assert.strictEqual(retractionsC(), 530553372);
 ```
 
 # --seed--
@@ -29,12 +35,12 @@ assert.strictEqual(euler447(), 530553372);
 ## --seed-contents--
 
 ```js
-function euler447() {
+function retractionsC() {
 
   return true;
 }
 
-euler447();
+retractionsC();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.md
index 6bf716c1d34..26643961a3e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.md
@@ -1,29 +1,31 @@
 ---
 id: 5900f52c1000cf542c51003f
 title: 'Problem 448: Average least common multiple'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302120
 dashedName: problem-448-average-least-common-multiple
 ---
 
 # --description--
 
-The function lcm(a,b) denotes the least common multiple of a and b.
+The function $lcm(a, b)$ denotes the least common multiple of $a$ and $b$.
 
-Let A(n) be the average of the values of lcm(n,i) for 1≤i≤n.
+Let $A(n)$ be the average of the values of $lcm(n, i)$ for $1 ≤ i ≤ n$.
 
-E.g: A(2)=(2+2)/2=2 and A(10)=(10+10+30+20+10+30+70+40+90+10)/10=32.
+E.g: $A(2) = \frac{2 + 2}{2} = 2$ and $A(10) = \frac{10 + 10 + 30 + 20 + 10 + 30 + 70 + 40 + 90 + 10}{10} = 32$.
 
-Let S(n)=∑A(k) for 1≤k≤n. S(100)=122726.
+Let $S(n) = \sum A(k)$ for $1 ≤ k ≤ n$.
 
-Find S(99999999019) mod 999999017.
+$S(100) = 122\\,726$.
+
+Find $S(99\\,999\\,999\\,019)\bmod 999\\,999\\,017$.
 
 # --hints--
 
-`euler448()` should return 106467648.
+`averageLCM()` should return `106467648`.
 
 ```js
-assert.strictEqual(euler448(), 106467648);
+assert.strictEqual(averageLCM(), 106467648);
 ```
 
 # --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler448(), 106467648);
 ## --seed-contents--
 
 ```js
-function euler448() {
+function averageLCM() {
 
   return true;
 }
 
-euler448();
+averageLCM();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.md
index 18c19230958..f312fd4ab49 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.md
@@ -1,31 +1,29 @@
 ---
 id: 5900f52d1000cf542c510040
 title: 'Problem 449: Chocolate covered candy'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302121
 dashedName: problem-449-chocolate-covered-candy
 ---
 
 # --description--
 
-Phil the confectioner is making a new batch of chocolate covered candy. Each candy centre is shaped like an ellipsoid of revolution defined by the equation: b2x2 + b2y2 + a2z2 = a2b2.
+Phil the confectioner is making a new batch of chocolate covered candy. Each candy centre is shaped like an ellipsoid of revolution defined by the equation: $b^2x^2 + b^2y^2 + a^2z^2 = a^2b^2$.
 
-Phil wants to know how much chocolate is needed to cover one candy centre with a uniform coat of chocolate one millimeter thick. If a=1 mm and b=1 mm, the amount of chocolate required is
+Phil wants to know how much chocolate is needed to cover one candy centre with a uniform coat of chocolate one millimeter thick.
 
-283 π mm3
+If $a = 1$ mm and $b = 1$ mm, the amount of chocolate required is $\frac{28}{3} \pi$ mm<sup>3</sup>
 
-<!-- TODO Use MathJax -->
+If $a = 2$ mm and $b = 1$ mm, the amount of chocolate required is approximately 60.35475635 mm<sup>3</sup>.
 
-If a=2 mm and b=1 mm, the amount of chocolate required is approximately 60.35475635 mm3.
-
-Find the amount of chocolate in mm3 required if a=3 mm and b=1 mm. Give your answer as the number rounded to 8 decimal places behind the decimal point.
+Find the amount of chocolate in mm<sup>3</sup> required if $a = 3$ mm and $b = 1$ mm. Give your answer as the number rounded to 8 decimal places behind the decimal point.
 
 # --hints--
 
-`euler449()` should return 103.37870096.
+`chocolateCoveredCandy()` should return `103.37870096`.
 
 ```js
-assert.strictEqual(euler449(), 103.37870096);
+assert.strictEqual(chocolateCoveredCandy(), 103.37870096);
 ```
 
 # --seed--
@@ -33,12 +31,12 @@ assert.strictEqual(euler449(), 103.37870096);
 ## --seed-contents--
 
 ```js
-function euler449() {
+function chocolateCoveredCandy() {
 
   return true;
 }
 
-euler449();
+chocolateCoveredCandy();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.md
index 5c3b224b4a1..e80bcc8dd50 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3991000cf542c50feac
 title: 'Problem 45: Triangular, pentagonal, and hexagonal'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302122
 dashedName: problem-45-triangular-pentagonal-and-hexagonal
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
index 17cf3af082d..9bfd7f5d15a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f52e1000cf542c510041
 title: 'Problem 450: Hypocycloid and Lattice points'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302123
 dashedName: problem-450-hypocycloid-and-lattice-points
 ---
@@ -10,34 +10,37 @@ dashedName: problem-450-hypocycloid-and-lattice-points
 
 A hypocycloid is the curve drawn by a point on a small circle rolling inside a larger circle. The parametric equations of a hypocycloid centered at the origin, and starting at the right most point is given by:
 
-$x(t) = (R - r) \\cos(t) + r \\cos(\\frac {R - r} r t)$
+$$x(t) = (R - r) \cos(t) + r \cos(\frac{R - r}{r}t)$$
 
-$y(t) = (R - r) \\sin(t) - r \\sin(\\frac {R - r} r t)$
+$$y(t) = (R - r) \sin(t) - r \sin(\frac{R - r}{r} t)$$
 
-Where R is the radius of the large circle and r the radius of the small circle.
+Where $R$ is the radius of the large circle and $r$ the radius of the small circle.
 
-Let $C(R, r)$ be the set of distinct points with integer coordinates on the hypocycloid with radius R and r and for which there is a corresponding value of t such that $\\sin(t)$ and $\\cos(t)$ are rational numbers.
+Let $C(R, r)$ be the set of distinct points with integer coordinates on the hypocycloid with radius $R$ and $r$ and for which there is a corresponding value of $t$ such that $\sin(t)$ and $\cos(t)$ are rational numbers.
 
-Let $S(R, r) = \\sum\_{(x,y) \\in C(R, r)} |x| + |y|$ be the sum of the absolute values of the x and y coordinates of the points in $C(R, r)$.
+Let $S(R, r) = \sum\_{(x,y) \in C(R, r)} |x| + |y|$ be the sum of the absolute values of the $x$ and $y$ coordinates of the points in $C(R, r)$.
 
-Let $T(N) = \\sum*{R = 3}^N \\sum*{r=1}^{\\lfloor \\frac {R - 1} 2 \\rfloor} S(R, r)$ be the sum of $S(R, r)$ for R and r positive integers, $R\\leq N$ and $2r &lt; R$.
+Let $T(N) = \sum_{R = 3}^N \sum_{r=1}^{\left\lfloor \frac{R - 1}{2} \right\rfloor} S(R, r)$ be the sum of $S(R, r)$ for $R$ and $r$ positive integers, $R\leq N$ and $2r &lt; R$.
 
-You are given:C(3, 1) = {(3, 0), (-1, 2), (-1,0), (-1,-2)} C(2500, 1000) = {(2500, 0), (772, 2376), (772, -2376), (516, 1792), (516, -1792), (500, 0), (68, 504), (68, -504),(-1356, 1088), (-1356, -1088), (-1500, 1000), (-1500, -1000)}
+You are given:
 
-Note: (-625, 0) is not an element of C(2500, 1000) because $\\sin(t)$ is not a rational number for the corresponding values of t.
+$$\begin{align}   C(3, 1) = & \\{(3, 0), (-1, 2), (-1,0), (-1,-2)\\} \\\\
+  C(2500, 1000) = & \\{(2500, 0), (772, 2376), (772, -2376), (516, 1792), (516, -1792), (500, 0), (68, 504), \\\\ &(68, -504),(-1356, 1088), (-1356, -1088), (-1500, 1000), (-1500, -1000)\\} \end{align}$$
 
-S(3, 1) = (|3| + |0|) + (|-1| + |2|) + (|-1| + |0|) + (|-1| + |-2|) = 10
+**Note:** (-625, 0) is not an element of $C(2500, 1000)$ because $\sin(t)$ is not a rational number for the corresponding values of $t$.
 
-T(3) = 10; T(10) = 524 ;T(100) = 580442; T(103) = 583108600.
+$S(3, 1) = (|3| + |0|) + (|-1| + |2|) + (|-1| + |0|) + (|-1| + |-2|) = 10$
 
-Find T(106).
+$T(3) = 10$; $T(10) = 524$; $T(100) = 580\\,442$; $T({10}^3) = 583\\,108\\,600$.
+
+Find $T({10}^6)$.
 
 # --hints--
 
-`euler450()` should return 583333163984220900.
+`hypocycloidAndLatticePoints()` should return `583333163984220900`.
 
 ```js
-assert.strictEqual(euler450(), 583333163984220900);
+assert.strictEqual(hypocycloidAndLatticePoints(), 583333163984220900);
 ```
 
 # --seed--
@@ -45,12 +48,12 @@ assert.strictEqual(euler450(), 583333163984220900);
 ## --seed-contents--
 
 ```js
-function euler450() {
+function hypocycloidAndLatticePoints() {
 
   return true;
 }
 
-euler450();
+hypocycloidAndLatticePoints();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md
index 1b12ec1c227..39ebff17846 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5311000cf542c510042
 title: 'Problem 451: Modular inverses'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302124
 dashedName: problem-451-modular-inverses
 ---
@@ -12,32 +12,27 @@ Consider the number 15.
 
 There are eight positive numbers less than 15 which are coprime to 15: 1, 2, 4, 7, 8, 11, 13, 14.
 
-The modular inverses of these numbers modulo 15 are: 1, 8, 4, 13, 2, 11, 7, 14
+The modular inverses of these numbers modulo 15 are: 1, 8, 4, 13, 2, 11, 7, 14 because
 
-because
+$$\begin{align}   & 1  \times 1\bmod 15 = 1 \\\\
+  & 2  \times 8  = 16\bmod 15 = 1 \\\\   & 4  \times 4  = 16\bmod 15 = 1 \\\\
+  & 7  \times 13 = 91\bmod 15 = 1 \\\\   & 11 \times 11 = 121\bmod 15 = 1 \\\\
+  & 14 \times 14 = 196\bmod 15 = 1 \end{align}$$
 
-1\*1 mod 15=1
+Let $I(n)$ be the largest positive number $m$ smaller than $n - 1$ such that the modular inverse of $m$ modulo $n$ equals $m$ itself.
 
-2\*8=16 mod 15=1
+So $I(15) = 11$.
 
-4\*4=16 mod 15=1
+Also $I(100) = 51$ and $I(7) = 1$.
 
-7\*13=91 mod 15=1
-
-11\*11=121 mod 15=1
-
-14\*14=196 mod 15=1
-
-Let I(n) be the largest positive number m smaller than n-1 such that the modular inverse of m modulo n equals m itself. So I(15)=11. Also I(100)=51 and I(7)=1.
-
-Find ∑I(n) for 3≤n≤2·107
+Find $\sum I(n)$ for $3 ≤ n ≤ 2 \times {10}^7$
 
 # --hints--
 
-`euler451()` should return 153651073760956.
+`modularInverses()` should return `153651073760956`.
 
 ```js
-assert.strictEqual(euler451(), 153651073760956);
+assert.strictEqual(modularInverses(), 153651073760956);
 ```
 
 # --seed--
@@ -45,12 +40,12 @@ assert.strictEqual(euler451(), 153651073760956);
 ## --seed-contents--
 
 ```js
-function euler451() {
+function modularInverses() {
 
   return true;
 }
 
-euler451();
+modularInverses();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-452-long-products.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-452-long-products.md
index b52ca22d506..abb043bcebe 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-452-long-products.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-452-long-products.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f5311000cf542c510043
 title: 'Problem 452: Long Products'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302125
 dashedName: problem-452-long-products
 ---
 
 # --description--
 
-Define F(m,n) as the number of n-tuples of positive integers for which the product of the elements doesn't exceed m.
+Define $F(m, n)$ as the number of $n$-tuples of positive integers for which the product of the elements doesn't exceed $m$.
 
-F(10, 10) = 571.
+$F(10, 10) = 571$.
 
-F(106, 106) mod 1 234 567 891 = 252903833.
+$F({10}^6, {10}^6)\bmod 1\\,234\\,567\\,891 = 252\\,903\\,833$.
 
-Find F(109, 109) mod 1 234 567 891.
+Find $F({10}^9, {10}^9)\bmod 1\\,234\\,567\\,891$.
 
 # --hints--
 
-`euler452()` should return 345558983.
+`longProducts()` should return `345558983`.
 
 ```js
-assert.strictEqual(euler452(), 345558983);
+assert.strictEqual(longProducts(), 345558983);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler452(), 345558983);
 ## --seed-contents--
 
 ```js
-function euler452() {
+function longProducts() {
 
   return true;
 }
 
-euler452();
+longProducts();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md
index 69b668a626e..f809ebc60a5 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5311000cf542c510044
 title: 'Problem 453: Lattice Quadrilaterals'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302126
 dashedName: problem-453-lattice-quadrilaterals
 ---
@@ -10,20 +10,22 @@ dashedName: problem-453-lattice-quadrilaterals
 
 A simple quadrilateral is a polygon that has four distinct vertices, has no straight angles and does not self-intersect.
 
-Let Q(m, n) be the number of simple quadrilaterals whose vertices are lattice points with coordinates (x,y) satisfying 0 ≤ x ≤ m and 0 ≤ y ≤ n.
+Let $Q(m, n)$ be the number of simple quadrilaterals whose vertices are lattice points with coordinates ($x$, $y$) satisfying $0 ≤ x ≤ m$ and $0 ≤ y ≤ n$.
 
-For example, Q(2, 2) = 94 as can be seen below:
+For example, $Q(2, 2) = 94$ as can be seen below:
 
-It can also be verified that Q(3, 7) = 39590, Q(12, 3) = 309000 and Q(123, 45) = 70542215894646.
+<img class="img-responsive center-block" alt="94 quadrilaterals whose vertices are lattice points with coordinates (x, y) satiffying 0 &le; x &le; m and 0 &le; y &le; n" src="https://cdn.freecodecamp.org/curriculum/project-euler/lattice-quadrilaterals.png" style="background-color: white; padding: 10px;" />
 
-Find Q(12345, 6789) mod 135707531.
+It can also be verified that $Q(3, 7) = 39\\,590$, $Q(12, 3) = 309\\,000$ and $Q(123, 45) = 70\\,542\\,215\\,894\\,646$.
+
+Find $Q(12\\,345, 6\\,789)\bmod 135\\,707\\,531$.
 
 # --hints--
 
-`euler453()` should return 104354107.
+`latticeQuadrilaterals()` should return `104354107`.
 
 ```js
-assert.strictEqual(euler453(), 104354107);
+assert.strictEqual(latticeQuadrilaterals(), 104354107);
 ```
 
 # --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler453(), 104354107);
 ## --seed-contents--
 
 ```js
-function euler453() {
+function latticeQuadrilaterals() {
 
   return true;
 }
 
-euler453();
+latticeQuadrilaterals();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.md
index 414cfab965d..b2fca3b4a6b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.md
@@ -1,27 +1,29 @@
 ---
 id: 5900f5331000cf542c510045
 title: 'Problem 454: Diophantine reciprocals III'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302127
 dashedName: problem-454-diophantine-reciprocals-iii
 ---
 
 # --description--
 
-In the following equation x, y, and n are positive integers. 1/x + 1/y= 1/n
+In the following equation $x$, $y$, and $n$ are positive integers.
 
-<!-- TODO Use MathJax -->
+$$\frac{1}{x} + \frac{1}{y} = \frac{1}{n}$$
 
-For a limit L we define F(L) as the number of solutions which satisfy x &lt; y ≤ L.
+For a limit $L$ we define $F(L)$ as the number of solutions which satisfy $x &lt; y ≤ L$.
 
-We can verify that F(15) = 4 and F(1000) = 1069. Find F(1012).
+We can verify that $F(15) = 4$ and $F(1000) = 1069$.
+
+Find $F({10}^{12})$.
 
 # --hints--
 
-`euler454()` should return 5435004633092.
+`diophantineReciprocalsThree()` should return `5435004633092`.
 
 ```js
-assert.strictEqual(euler454(), 5435004633092);
+assert.strictEqual(diophantineReciprocalsThree(), 5435004633092);
 ```
 
 # --seed--
@@ -29,12 +31,12 @@ assert.strictEqual(euler454(), 5435004633092);
 ## --seed-contents--
 
 ```js
-function euler454() {
+function diophantineReciprocalsThree() {
 
   return true;
 }
 
-euler454();
+diophantineReciprocalsThree();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md
index 71202a5f3f2..5a1fc804bb8 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md
@@ -1,25 +1,29 @@
 ---
 id: 5900f5331000cf542c510046
 title: 'Problem 455: Powers With Trailing Digits'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302129
 dashedName: problem-455-powers-with-trailing-digits
 ---
 
 # --description--
 
-Let f(n) be the largest positive integer x less than 109 such that the last 9 digits of nx form the number x (including leading zeros), or zero if no such integer exists.
+Let $f(n)$ be the largest positive integer $x$ less than ${10}^9$ such that the last 9 digits of $n^x$ form the number $x$ (including leading zeros), or zero if no such integer exists.
 
-For example:
+Por ejemplo:
 
-f(4) = 411728896 (4411728896 = ...490411728896) f(10) = 0 f(157) = 743757 (157743757 = ...567000743757) Σf(n), 2 ≤ n ≤ 103 = 442530011399 Find Σf(n), 2 ≤ n ≤ 106.
+$$\begin{align}   & f(4) = 411\\,728\\,896 (4^{411\\,728\\,896} = ...490\underline{411728896}) \\\\
+  & f(10) = 0 \\\\   & f(157) = 743\\,757 (157^{743\\,757} = ...567\underline{000743757}) \\\\
+  & Σf(n), 2 ≤ n ≤ 103 = 442\\,530\\,011\\,399 \end{align}$$
+
+Find $\sum f(n)$, $2 ≤ n ≤ {10}^6$.
 
 # --hints--
 
-`euler455()` should return 450186511399999.
+`powersWithTrailingDigits()` should return `450186511399999`.
 
 ```js
-assert.strictEqual(euler455(), 450186511399999);
+assert.strictEqual(powersWithTrailingDigits(), 450186511399999);
 ```
 
 # --seed--
@@ -27,12 +31,12 @@ assert.strictEqual(euler455(), 450186511399999);
 ## --seed-contents--
 
 ```js
-function euler455() {
+function powersWithTrailingDigits() {
 
   return true;
 }
 
-euler455();
+powersWithTrailingDigits();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-459-flipping-game.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-459-flipping-game.md
index 72134eec524..13473d922bf 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-459-flipping-game.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-459-flipping-game.md
@@ -1,35 +1,45 @@
 ---
 id: 5900f5371000cf542c51004a
 title: 'Problem 459: Flipping game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302133
 dashedName: problem-459-flipping-game
 ---
 
 # --description--
 
-The flipping game is a two player game played on a N by N square board.
+The flipping game is a two player game played on a $N$ by $N$ square board.
 
 Each square contains a disk with one side white and one side black.
 
 The game starts with all disks showing their white side.
 
-A turn consists of flipping all disks in a rectangle with the following properties: the upper right corner of the rectangle contains a white disk the rectangle width is a perfect square (1, 4, 9, 16, ...) the rectangle height is a triangular number (1, 3, 6, 10, ...)
+A turn consists of flipping all disks in a rectangle with the following properties:
+
+- the upper right corner of the rectangle contains a white disk
+- the rectangle width is a perfect square (1, 4, 9, 16, ...)
+- the rectangle height is a triangular number (1, 3, 6, 10, ...)
+
+<img class="img-responsive center-block" alt="flipping all disks in a 4x3 rectangle on a 5x5 board" src="https://cdn.freecodecamp.org/curriculum/project-euler/flipping-game-1.png" style="background-color: white; padding: 10px;" />
 
 Players alternate turns. A player wins by turning the grid all black.
 
-Let W(N) be the number of winning moves for the first player on a N by N board with all disks white, assuming perfect play. W(1) = 1, W(2) = 0, W(5) = 8 and W(102) = 31395.
+Let $W(N)$ be the number of winning moves for the first player on a $N$ by $N$ board with all disks white, assuming perfect play.
 
-For N=5, the first player's eight winning first moves are:
+$W(1) = 1$, $W(2) = 0$, $W(5) = 8$ and $W({10}^2) = 31\\,395$.
 
-Find W(106).
+For $N = 5$, the first player's eight winning first moves are:
+
+<img class="img-responsive center-block" alt="eight winning first moves for N = 5" src="https://cdn.freecodecamp.org/curriculum/project-euler/flipping-game-2.png" style="background-color: white; padding: 10px;" />
+
+Find $W({10}^6)$.
 
 # --hints--
 
-`euler459()` should return 3996390106631.
+`flippingGame()` should return `3996390106631`.
 
 ```js
-assert.strictEqual(euler459(), 3996390106631);
+assert.strictEqual(flippingGame(), 3996390106631);
 ```
 
 # --seed--
@@ -37,12 +47,12 @@ assert.strictEqual(euler459(), 3996390106631);
 ## --seed-contents--
 
 ```js
-function euler459() {
+function flippingGame() {
 
   return true;
 }
 
-euler459();
+flippingGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md
index 9cd82e5bdf2..1bcc859d05e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f39a1000cf542c50fead
 title: 'Problem 46: Goldbach''s other conjecture'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302134
 dashedName: problem-46-goldbachs-other-conjecture
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md
index 467a9693c3a..2bb68f203f4 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md
@@ -1,31 +1,40 @@
 ---
 id: 5900f5381000cf542c51004b
 title: 'Problem 460: An ant on the move'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302135
 dashedName: problem-460-an-ant-on-the-move
 ---
 
 # --description--
 
-On the Euclidean plane, an ant travels from point A(0, 1) to point B(d, 1) for an integer d.
+On the Euclidean plane, an ant travels from point $A(0, 1)$ to point $B(d, 1)$ for an integer $d$.
 
-In each step, the ant at point (x0, y0) chooses one of the lattice points (x1, y1) which satisfy x1 ≥ 0 and y1 ≥ 1 and goes straight to (x1, y1) at a constant velocity v. The value of v depends on y0 and y1 as follows: If y0 = y1, the value of v equals y0. If y0 ≠ y1, the value of v equals (y1 - y0) / (ln(y1) - ln(y0)).
+In each step, the ant at point ($x_0$, $y_0$) chooses one of the lattice points ($x_1$, $y_1$) which satisfy $x_1 ≥ 0$ and $y_1 ≥ 1$ and goes straight to ($x_1$, $y_1$) at a constant velocity $v$. The value of $v$ depends on $y_0$ and $y_1$ as follows:
 
-The left image is one of the possible paths for d = 4. First the ant goes from A(0, 1) to P1(1, 3) at velocity (3 - 1) / (ln(3) - ln(1)) ≈ 1.8205. Then the required time is sqrt(5) / 1.8205 ≈ 1.2283. From P1(1, 3) to P2(3, 3) the ant travels at velocity 3 so the required time is 2 / 3 ≈ 0.6667. From P2(3, 3) to B(4, 1) the ant travels at velocity (1 - 3) / (ln(1) - ln(3)) ≈ 1.8205 so the required time is sqrt(5) / 1.8205 ≈ 1.2283. Thus the total required time is 1.2283 + 0.6667 + 1.2283 = 3.1233.
+- If $y_0 = y_1$, the value of $v$ equals $y_0$.
+- If $y_0 ≠ y_1$, the value of $v$ equals $\frac{y_1 - y_0}{\ln y_1 - \ln y_0}$.
 
-The right image is another path. The total required time is calculated as 0.98026 + 1 + 0.98026 = 2.96052. It can be shown that this is the quickest path for d = 4.
+The left image is one of the possible paths for $d = 4$. First the ant goes from $A(0, 1)$ to $P_1(1, 3)$ at velocity $\frac{3 - 1}{\ln 3 - \ln 1} ≈ 1.8205$. Then the required time is $\frac{\sqrt{5}}{1.820} ≈ 1.2283$.
 
-Let F(d) be the total required time if the ant chooses the quickest path. For example, F(4) ≈ 2.960516287. We can verify that F(10) ≈ 4.668187834 and F(100) ≈ 9.217221972.
+From $P_1(1, 3)$ to $P_2(3, 3)$ the ant travels at velocity 3 so the required time is $\frac{2}{3} ≈ 0.6667$. From $P_2(3, 3)$ to $B(4, 1)$ the ant travels at velocity $\frac{1 - 3}{\ln 1 - \ln 3} ≈ 1.8205$ so the required time is $\frac{\sqrt{5}}{1.8205} ≈ 1.2283$.
 
-Find F(10000). Give your answer rounded to nine decimal places.
+Thus the total required time is $1.2283 + 0.6667 + 1.2283 = 3.1233$.
+
+The right image is another path. The total required time is calculated as $0.98026 + 1 + 0.98026 = 2.96052$. It can be shown that this is the quickest path for $d = 4$.
+
+<img class="img-responsive center-block" alt="two possible paths for d = 4" src="https://cdn.freecodecamp.org/curriculum/project-euler/an-ant-on-the-move.jpg" style="background-color: white; padding: 10px;" />
+
+Let $F(d)$ be the total required time if the ant chooses the quickest path. For example, $F(4) ≈ 2.960\\,516\\,287$. We can verify that $F(10) ≈ 4.668\\,187\\,834$ and $F(100) ≈ 9.217\\,221\\,972$.
+
+Find $F(10\\,000)$. Give your answer rounded to nine decimal places.
 
 # --hints--
 
-`euler460()` should return 18.420738199.
+`antOnTheMove()` should return `18.420738199`.
 
 ```js
-assert.strictEqual(euler460(), 18.420738199);
+assert.strictEqual(antOnTheMove(), 18.420738199);
 ```
 
 # --seed--
@@ -33,12 +42,12 @@ assert.strictEqual(euler460(), 18.420738199);
 ## --seed-contents--
 
 ```js
-function euler460() {
+function antOnTheMove() {
 
   return true;
 }
 
-euler460();
+antOnTheMove();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md
index 014935108f6..a8e3607195e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f53c1000cf542c51004e
 title: 'Problem 463: A weird recurrence relation'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302138
 dashedName: problem-463-a-weird-recurrence-relation
 ---
@@ -10,24 +10,22 @@ dashedName: problem-463-a-weird-recurrence-relation
 
 The function $f$ is defined for all positive integers as follows:
 
-$f(1)=1$
+$$\begin{align}   & f(1) = 1 \\\\
+  & f(3) = 3 \\\\   & f(2n) = f(n) \\\\
+  & f(4n + 1) = 2f(2n + 1) - f(n) \\\\ & f(4n + 3) = 3f(2n + 1) - 2f(n) \end{align}$$
 
-$f(3)=3$
+The function $S(n)$ is defined as $\sum_{i=1}^{n} f(i)$.
 
-$f(2n)=f(n)$
+$S(8) = 22$ and $S(100) = 3604$.
 
-$f(4n + 1)=2f(2n + 1) - f(n)$
-
-$f(4n + 3)=3f(2n + 1) - 2f(n)$
-
-The function $S(n)$ is defined as $\\sum\_{i=1}^{n}f(i)$. $S(8)=22$ and $S(100)=3604$. Find $S(3^{37})$. Give the last 9 digits of your answer.
+Find $S(3^{37})$. Give the last 9 digits of your answer.
 
 # --hints--
 
-`euler463()` should return 808981553.
+`weirdRecurrenceRelation()` should return `808981553`.
 
 ```js
-assert.strictEqual(euler463(), 808981553);
+assert.strictEqual(weirdRecurrenceRelation(), 808981553);
 ```
 
 # --seed--
@@ -35,12 +33,12 @@ assert.strictEqual(euler463(), 808981553);
 ## --seed-contents--
 
 ```js
-function euler463() {
+function weirdRecurrenceRelation() {
 
   return true;
 }
 
-euler463();
+weirdRecurrenceRelation();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.md
index 5b209dd1d75..1de3f98912a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.md
@@ -1,33 +1,40 @@
 ---
 id: 5900f53d1000cf542c51004f
 title: 'Problem 464: Möbius function and intervals'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302139
 dashedName: problem-464-mbius-function-and-intervals
 ---
 
 # --description--
 
-The Möbius function, denoted μ(n), is defined as:
+The Möbius function, denoted $μ(n)$, is defined as:
 
-μ(n) = (-1)ω(n) if n is squarefree (where ω(n) is the number of distinct prime factors of n)
+- $μ(n) = (-1)^{ω(n)}$ if $n$ is squarefree (where $ω(n)$ is the number of distinct prime factors of $n$)
+- $μ(n) = 0$ if $n$ is not squarefree.
 
-μ(n) = 0 if n is not squarefree.
+Let $P(a, b)$ be the number of integers $n$ in the interval $[a, b]$ such that $μ(n) = 1$.
 
-Let P(a,b) be the number of integers n in the interval \[a,b] such that μ(n) = 1. Let N(a,b) be the number of integers n in the interval \[a,b] such that μ(n) = -1. For example, P(2,10) = 2 and N(2,10) = 4.
+Let $N(a, b)$ be the number of integers $n$ in the interval $[a, b]$ such that $μ(n) = -1$.
 
-Let C(n) be the number of integer pairs (a,b) such that: 1 ≤ a ≤ b ≤ n, 99·N(a,b) ≤ 100·P(a,b), and 99·P(a,b) ≤ 100·N(a,b).
+For example, $P(2, 10) = 2$ and $N(2, 10) = 4$.
 
-For example, C(10) = 13, C(500) = 16676 and C(10 000) = 20155319.
+Let $C(n)$ be the number of integer pairs $(a, b)$ such that:
 
-Find C(20 000 000).
+- $1 ≤ a ≤ b ≤ n$,
+- $99 \times N(a, b) ≤ 100 \times P(a, b)$, and
+- $99 \times P(a, b) ≤ 100 \times N(a, b)$.
+
+For example, $C(10) = 13$, $C(500) = 16\\,676$ and $C(10\\,000) = 20\\,155\\,319$.
+
+Encuentra $C(20\\,000\\,000)$.
 
 # --hints--
 
-`euler464()` should return 198775297232878.
+`mobiusFunctionAndIntervals()` should return `198775297232878`.
 
 ```js
-assert.strictEqual(euler464(), 198775297232878);
+assert.strictEqual(mobiusFunctionAndIntervals(), 198775297232878);
 ```
 
 # --seed--
@@ -35,12 +42,12 @@ assert.strictEqual(euler464(), 198775297232878);
 ## --seed-contents--
 
 ```js
-function euler464() {
+function mobiusFunctionAndIntervals() {
 
   return true;
 }
 
-euler464();
+mobiusFunctionAndIntervals();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md
index 2baaf0d7751..57ad5b291d6 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f53d1000cf542c510050
 title: 'Problem 465: Polar polygons'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302140
 dashedName: problem-465-polar-polygons
 ---
@@ -14,22 +14,24 @@ For this problem, a polygon can have collinear consecutive vertices. However, a
 
 For example, only the first of the following is a polar polygon (the kernels of the second, third, and fourth do not strictly contain the origin, and the fifth does not have a kernel at all):
 
+<img class="img-responsive center-block" alt="five example polygons" src="https://cdn.freecodecamp.org/curriculum/project-euler/polar-polygons.png" style="background-color: white; padding: 10px;" />
+
 Notice that the first polygon has three consecutive collinear vertices.
 
-Let P(n) be the number of polar polygons such that the vertices (x, y) have integer coordinates whose absolute values are not greater than n.
+Let $P(n)$ be the number of polar polygons such that the vertices $(x, y)$ have integer coordinates whose absolute values are not greater than $n$.
 
-Note that polygons should be counted as different if they have different set of edges, even if they enclose the same area. For example, the polygon with vertices \[(0,0),(0,3),(1,1),(3,0)] is distinct from the polygon with vertices \[(0,0),(0,3),(1,1),(3,0),(1,0)].
+Note that polygons should be counted as different if they have different set of edges, even if they enclose the same area. For example, the polygon with vertices [(0,0), (0,3), (1,1), (3,0)] is distinct from the polygon with vertices [(0,0), (0,3), (1,1), (3,0), (1,0)].
 
-For example, P(1) = 131, P(2) = 1648531, P(3) = 1099461296175 and P(343) mod 1 000 000 007 = 937293740.
+For example, $P(1) = 131$, $P(2) = 1\\,648\\,531$, $P(3) = 1\\,099\\,461\\,296\\,175$ and $P(343)\bmod 1\\,000\\,000\\,007 = 937\\,293\\,740$.
 
-Find P(713) mod 1 000 000 007.
+Find $P(7^{13})\bmod 1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler465()` should return 585965659.
+`polarPolygons()` should return `585965659`.
 
 ```js
-assert.strictEqual(euler465(), 585965659);
+assert.strictEqual(polarPolygons(), 585965659);
 ```
 
 # --seed--
@@ -37,12 +39,12 @@ assert.strictEqual(euler465(), 585965659);
 ## --seed-contents--
 
 ```js
-function euler465() {
+function polarPolygons() {
 
   return true;
 }
 
-euler465();
+polarPolygons();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md
index 3050ea410b1..cfefe6e7b9f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md
@@ -1,31 +1,37 @@
 ---
 id: 5900f53e1000cf542c510051
 title: 'Problem 466: Distinct terms in a multiplication table'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302141
 dashedName: problem-466-distinct-terms-in-a-multiplication-table
 ---
 
 # --description--
 
-Let P(m,n) be the number of distinct terms in an m×n multiplication table.
+Let $P(m,n)$ be the number of distinct terms in an $m×n$ multiplication table.
 
 For example, a 3×4 multiplication table looks like this:
 
-× 12341 12342 24683 36912
+$$\begin{array}{c}   ×          & \mathbf{1} & \mathbf{2} & \mathbf{3} & \mathbf{4}  \\\\
+  \mathbf{1} & 1          & 2          & 3          & 4  \\\\   \mathbf{2} & 2          & 4          & 6          & 8  \\\\
+  \mathbf{3} & 3          & 6          & 9          & 12 \end{array}$$
 
-There are 8 distinct terms {1,2,3,4,6,8,9,12}, therefore P(3,4) = 8.
+There are 8 distinct terms {1, 2, 3, 4, 6, 8, 9, 12}, therefore $P(3, 4) = 8$.
 
-You are given that: P(64,64) = 1263, P(12,345) = 1998, and P(32,1015) = 13826382602124302.
+You are given that:
 
-Find P(64,1016).
+$$\begin{align}   & P(64, 64) = 1\\,263, \\\\
+  & P(12, 345) = 1\\,998, \text{ and} \\\\   & P(32, {10}^{15}) = 13\\,826\\,382\\,602\\,124\\,302. \\\\
+\end{align}$$
+
+Find $P(64, {10}^{16})$.
 
 # --hints--
 
-`euler466()` should return 258381958195474750.
+`multiplicationTable()` should return `258381958195474750`.
 
 ```js
-assert.strictEqual(euler466(), 258381958195474750);
+assert.strictEqual(multiplicationTable(), 258381958195474750);
 ```
 
 # --seed--
@@ -33,12 +39,12 @@ assert.strictEqual(euler466(), 258381958195474750);
 ## --seed-contents--
 
 ```js
-function euler466() {
+function multiplicationTable() {
 
   return true;
 }
 
-euler466();
+multiplicationTable();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-467-superinteger.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-467-superinteger.md
index 8cfd9dc16ab..9b0caad1704 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-467-superinteger.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-467-superinteger.md
@@ -1,33 +1,42 @@
 ---
 id: 5900f5411000cf542c510052
 title: 'Problem 467: Superinteger'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302142
 dashedName: problem-467-superinteger
 ---
 
 # --description--
 
-An integer s is called a superinteger of another integer n if the digits of n form a subsequence of the digits of s.
+An integer $s$ is called a superinteger of another integer $n$ if the digits of $n$ form a subsequence of the digits of $s$.
 
 For example, 2718281828 is a superinteger of 18828, while 314159 is not a superinteger of 151.
 
-Let p(n) be the nth prime number, and let c(n) be the nth composite number. For example, p(1) = 2, p(10) = 29, c(1) = 4 and c(10) = 18. {p(i) : i ≥ 1} = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, ...} {c(i) : i ≥ 1} = {4, 6, 8, 9, 10, 12, 14, 15, 16, 18, ...}
+Let $p(n)$ be the $n$th prime number, and let $c(n)$ be the $n$th composite number. For example, $p(1) = 2$, $p(10) = 29$, $c(1) = 4$ and $c(10) = 18$.
 
-Let PD the sequence of the digital roots of {p(i)} (CD is defined similarly for {c(i)}): PD = {2, 3, 5, 7, 2, 4, 8, 1, 5, 2, ...} CD = {4, 6, 8, 9, 1, 3, 5, 6, 7, 9, ...}
+$$\begin{align}   & \\{p(i) : i ≥ 1\\} = \\{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, \ldots \\} \\\\
+  & \\{c(i) : i ≥ 1\\} = \\{4, 6, 8, 9, 10, 12, 14, 15, 16, 18, \ldots \\} \end{align}$$
 
-Let Pn be the integer formed by concatenating the first n elements of PD (Cn is defined similarly for CD). P10 = 2357248152 C10 = 4689135679
+Let $P^D$ the sequence of the digital roots of $\\{p(i)\\}$ ($C^D$ is defined similarly for $\\{c(i)\\}$):
 
-Let f(n) be the smallest positive integer that is a common superinteger of Pn and Cn. For example, f(10) = 2357246891352679, and f(100) mod 1 000 000 007 = 771661825.
+$$\begin{align}   & P^D = \\{2, 3, 5, 7, 2, 4, 8, 1, 5, 2, \ldots \\} \\\\
+  & C^D = \\{4, 6, 8, 9, 1, 3, 5, 6, 7, 9, \ldots \\} \end{align}$$
 
-Find f(10 000) mod 1 000 000 007.
+Let $P_n$ be the integer formed by concatenating the first $n$ elements of $P^D$ ($C_n$ is defined similarly for $C^D$).
+
+$$\begin{align}   & P_{10} = 2\\,357\\,248\\,152 \\\\
+  & C_{10} = 4\\,689\\,135\\,679 \end{align}$$
+
+Let $f(n)$ be the smallest positive integer that is a common superinteger of $P_n$ and $C_n$. For example, $f(10) = 2\\,357\\,246\\,891\\,352\\,679$, and $f(100)\bmod 1\\,000\\,000\\,007 = 771\\,661\\,825$.
+
+Find $f(10\\,000)\bmod 1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler467()` should return 775181359.
+`superinteger()` should return `775181359`.
 
 ```js
-assert.strictEqual(euler467(), 775181359);
+assert.strictEqual(superinteger(), 775181359);
 ```
 
 # --seed--
@@ -35,12 +44,12 @@ assert.strictEqual(euler467(), 775181359);
 ## --seed-contents--
 
 ```js
-function euler467() {
+function superinteger() {
 
   return true;
 }
 
-euler467();
+superinteger();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md
index 239d2cf56d4..4aad4d7c111 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md
@@ -1,27 +1,37 @@
 ---
 id: 5900f5411000cf542c510054
 title: 'Problem 468: Smooth divisors of binomial coefficients'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302143
 dashedName: problem-468-smooth-divisors-of-binomial-coefficients
 ---
 
 # --description--
 
-An integer is called B-smooth if none of its prime factors is greater than B.
+An integer is called B-smooth if none of its prime factors is greater than $B$.
 
-Let SB(n) be the largest B-smooth divisor of n. Examples: S1(10) = 1 S4(2100) = 12 S17(2496144) = 5712
+Let $SB(n)$ be the largest B-smooth divisor of $n$.
 
-Define F(n) = ∑1≤B≤n ∑0≤r≤n SB(C(n,r)). Here, C(n,r) denotes the binomial coefficient. Examples: F(11) = 3132 F(1 111) mod 1 000 000 993 = 706036312 F(111 111) mod 1 000 000 993 = 22156169
+Ejemplos:
 
-Find F(11 111 111) mod 1 000 000 993.
+$$\begin{align}   & S_1(10) = 1 \\\\
+  & S_4(2\\,100) = 12 \\\\ & S_{17}(2\\,496\\,144) = 5\\,712 \end{align}$$
+
+Define $F(n) = \displaystyle\sum_{B = 1}^n \sum_{r = 0}^n S_B(\displaystyle\binom{n}{r})$. Here, $\displaystyle\binom{n}{r}$ denotes the binomial coefficient.
+
+Ejemplos:
+
+$$\begin{align}   & F(11) = 3132 \\\\
+  & F(1\\,111)\bmod 1\\,000\\,000\\,993 = 706\\,036\\,312 \\\\ & F(111\\,111)\bmod 1\\,000\\,000\\,993 = 22\\,156\\,169 \end{align}$$
+
+Find $F(11\\,111\\,111)\bmod 1\\,000\\,000\\,993$.
 
 # --hints--
 
-`euler468()` should return 852950321.
+`smoothDivisorsOfBinomialCoefficients()` should return `852950321`.
 
 ```js
-assert.strictEqual(euler468(), 852950321);
+assert.strictEqual(smoothDivisorsOfBinomialCoefficients(), 852950321);
 ```
 
 # --seed--
@@ -29,12 +39,12 @@ assert.strictEqual(euler468(), 852950321);
 ## --seed-contents--
 
 ```js
-function euler468() {
+function smoothDivisorsOfBinomialCoefficients() {
 
   return true;
 }
 
-euler468();
+smoothDivisorsOfBinomialCoefficients();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-469-empty-chairs.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-469-empty-chairs.md
index 4e8be025a2f..3dce49fdd9a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-469-empty-chairs.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-469-empty-chairs.md
@@ -1,29 +1,31 @@
 ---
 id: 5900f5411000cf542c510053
 title: 'Problem 469: Empty chairs'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302144
 dashedName: problem-469-empty-chairs
 ---
 
 # --description--
 
-In a room N chairs are placed around a round table.
+In a room $N$ chairs are placed around a round table.
 
 Knights enter the room one by one and choose at random an available empty chair.
 
 To have enough elbow room the knights always leave at least one empty chair between each other.
 
-When there aren't any suitable chairs left, the fraction C of empty chairs is determined. We also define E(N) as the expected value of C. We can verify that E(4) = 1/2 and E(6) = 5/9.
+When there aren't any suitable chairs left, the fraction $C$ of empty chairs is determined. We also define $E(N)$ as the expected value of $C$.
 
-Find E(1018). Give your answer rounded to fourteen decimal places in the form 0.abcdefghijklmn.
+We can verify that $E(4) = \frac{1}{2}$ and $E(6) = \frac{5}{9}$.
+
+Find $E({10}^{18})$. Give your answer rounded to fourteen decimal places in the form 0.abcdefghijklmn.
 
 # --hints--
 
-`euler469()` should return 0.56766764161831.
+`emptyChairs()` should return `0.56766764161831`.
 
 ```js
-assert.strictEqual(euler469(), 0.56766764161831);
+assert.strictEqual(emptyChairs(), 0.56766764161831);
 ```
 
 # --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler469(), 0.56766764161831);
 ## --seed-contents--
 
 ```js
-function euler469() {
+function emptyChairs() {
 
   return true;
 }
 
-euler469();
+emptyChairs();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md
index 998b035f79d..978b7affd9b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f39c1000cf542c50feae
 title: 'Problem 47: Distinct primes factors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302145
 dashedName: problem-47-distinct-primes-factors
 ---
@@ -67,47 +67,25 @@ distinctPrimeFactors(4, 4);
 # --solutions--
 
 ```js
+// Initalize factor count with seive
+const NUMFACTORS = Array(135000).fill(0);
+(function initFactors(num) {
+  for (let i = 2; i < num; i++)
+    if (NUMFACTORS[i] === 0)
+      for (let j = i; j < num; j += i)
+        NUMFACTORS[j]++;
+})(135000);
+
 function distinctPrimeFactors(targetNumPrimes, targetConsecutive) {
-  function numberOfPrimeFactors(n) {
-    let factors = 0;
-
-    //  Considering 2 as a special case
-    let firstFactor = true;
-    while (n % 2 == 0) {
-      n = n / 2;
-      if (firstFactor) {
-        factors++;
-        firstFactor = false;
-      }
-    }
-    // Adding other factors
-    for (let i = 3; i < Math.sqrt(n); i += 2) {
-      firstFactor = true;
-      while (n % i == 0) {
-        n = n / i;
-        if (firstFactor) {
-          factors++;
-          firstFactor = false;
-        }
-      }
-    }
-
-    if (n > 1) { factors++; }
-
-    return factors;
+  let numConsecutive = 0;
+  let currNumber = 10;
+  while (numConsecutive < targetConsecutive) {
+    if (NUMFACTORS[currNumber] === targetNumPrimes)
+      numConsecutive++;
+    else
+      numConsecutive = 0;
+    currNumber++;
   }
-
-  let number = 0;
-  let consecutive = 0;
-
-  while (consecutive < targetConsecutive) {
-    number++;
-    if (numberOfPrimeFactors(number) >= targetNumPrimes) {
-      consecutive++;
-    } else {
-      consecutive = 0;
-    }
-  }
-  return number - targetConsecutive + 1;
+  return currNumber - targetConsecutive;
 }
 ```
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-470-super-ramvok.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-470-super-ramvok.md
index 10ee6d95d8b..7d0f1aad0ee 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-470-super-ramvok.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-470-super-ramvok.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5431000cf542c510055
 title: 'Problem 470: Super Ramvok'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302146
 dashedName: problem-470-super-ramvok
 ---
@@ -10,24 +10,24 @@ dashedName: problem-470-super-ramvok
 
 Consider a single game of Ramvok:
 
-Let t represent the maximum number of turns the game lasts. If t = 0, then the game ends immediately. Otherwise, on each turn i, the player rolls a die. After rolling, if i &lt; t the player can either stop the game and receive a prize equal to the value of the current roll, or discard the roll and try again next turn. If i = t, then the roll cannot be discarded and the prize must be accepted. Before the game begins, t is chosen by the player, who must then pay an up-front cost ct for some constant c. For c = 0, t can be chosen to be infinite (with an up-front cost of 0). Let R(d, c) be the expected profit (i.e. net gain) that the player receives from a single game of optimally-played Ramvok, given a fair d-sided die and cost constant c. For example, R(4, 0.2) = 2.65. Assume that the player has sufficient funds for paying any/all up-front costs.
+Let $t$ represent the maximum number of turns the game lasts. If $t = 0$, then the game ends immediately. Otherwise, on each turn $i$, the player rolls a die. After rolling, if $i &lt; t$ the player can either stop the game and receive a prize equal to the value of the current roll, or discard the roll and try again next turn. If $i = t$, then the roll cannot be discarded and the prize must be accepted. Before the game begins, $t$ is chosen by the player, who must then pay an up-front cost $ct$ for some constant $c$. For $c = 0$, $t$ can be chosen to be infinite (with an up-front cost of 0). Let $R(d, c)$ be the expected profit (i.e. net gain) that the player receives from a single game of optimally-played Ramvok, given a fair $d$-sided die and cost constant $c$. For example, $R(4, 0.2) = 2.65$. Assume that the player has sufficient funds for paying any/all up-front costs.
 
 Now consider a game of Super Ramvok:
 
 In Super Ramvok, the game of Ramvok is played repeatedly, but with a slight modification. After each game, the die is altered. The alteration process is as follows: The die is rolled once, and if the resulting face has its pips visible, then that face is altered to be blank instead. If the face is already blank, then it is changed back to its original value. After the alteration is made, another game of Ramvok can begin (and during such a game, at each turn, the die is rolled until a face with a value on it appears). The player knows which faces are blank and which are not at all times. The game of Super Ramvok ends once all faces of the die are blank.
 
-Let S(d, c) be the expected profit that the player receives from an optimally-played game of Super Ramvok, given a fair d-sided die to start (with all sides visible), and cost constant c. For example, S(6, 1) = 208.3.
+Let $S(d, c)$ be the expected profit that the player receives from an optimally-played game of Super Ramvok, given a fair $d$-sided die to start (with all sides visible), and cost constant $c$. For example, $S(6, 1) = 208.3$.
 
-Let F(n) = ∑4≤d≤n ∑0≤c≤n S(d, c).
+Let $F(n) = \sum_{4 ≤ d ≤ n} \sum_{0 ≤ c ≤ n} S(d, c)$.
 
-Calculate F(20), rounded to the nearest integer.
+Calculate $F(20)$, rounded to the nearest integer.
 
 # --hints--
 
-`euler470()` should return 147668794.
+`superRamvok()` should return `147668794`.
 
 ```js
-assert.strictEqual(euler470(), 147668794);
+assert.strictEqual(superRamvok(), 147668794);
 ```
 
 # --seed--
@@ -35,12 +35,12 @@ assert.strictEqual(euler470(), 147668794);
 ## --seed-contents--
 
 ```js
-function euler470() {
+function superRamvok() {
 
   return true;
 }
 
-euler470();
+superRamvok();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md
index 95385ddec9c..87fba0ff50a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md
@@ -1,27 +1,43 @@
 ---
 id: 5900f5431000cf542c510056
 title: 'Problem 471: Triangle inscribed in ellipse'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302148
 dashedName: problem-471-triangle-inscribed-in-ellipse
 ---
 
 # --description--
 
-The triangle ΔABC is inscribed in an ellipse with equation $\\frac {x^2} {a^2} + \\frac {y^2} {b^2} = 1$, 0 &lt; 2b &lt; a, a and b integers.
+The triangle $ΔABC$ is inscribed in an ellipse with equation $\frac{x^2}{a^2} + \frac{y^2}{b^2} = 1$, $0 &lt; 2b &lt; a$, $a$ and $b$ integers.
 
-Let r(a,b) be the radius of the incircle of ΔABC when the incircle has center (2b, 0) and A has coordinates $\\left( \\frac a 2, \\frac {\\sqrt 3} 2 b\\right)$.
+Let $r(a, b)$ be the radius of the incircle of $ΔABC$ when the incircle has center $(2b, 0)$ and $A$ has coordinates $\left(\frac{a}{2}, \frac{\sqrt{3}}{2}b\right)$.
 
-For example, r(3,1) = ½, r(6,2) = 1, r(12,3) = 2.
+For example, $r(3, 1) = \frac{1}{2}, r(6, 2) = 1, r(12, 3) = 2$.
 
-Let $G(n) = \\sum*{a=3}^n \\sum*{b=1}^{\\lfloor \\frac {a - 1} 2 \\rfloor} r(a, b)$ You are given G(10) = 20.59722222, G(100) = 19223.60980 (rounded to 10 significant digits). Find G(1011). Give your answer in scientific notation rounded to 10 significant digits. Use a lowercase e to separate mantissa and exponent. For G(10) the answer would have been 2.059722222e1.
+<img class="img-responsive center-block" alt="triangle ΔABC inscribed in an ellipse, radius of the incircle of ΔABC r(6, 2) = 1" src="https://cdn.freecodecamp.org/curriculum/project-euler/triangle-inscribed-in-ellipse-1.png" style="background-color: white; padding: 10px;" />
+
+<img class="img-responsive center-block" alt="triangle ΔABC inscribed in an ellipse, radius of the incircle of ΔABC r(12, 3) = 2" src="https://cdn.freecodecamp.org/curriculum/project-euler/triangle-inscribed-in-ellipse-2.png" style="background-color: white; padding: 10px;" />
+
+Let $G(n) = \sum_{a = 3}^n \sum_{b = 1}^{\left\lfloor\frac{a - 1}{2} \right\rfloor} r(a, b)$
+
+You are given $G(10) = 20.59722222$, $G(100) = 19223.60980$ (rounded to 10 significant digits).
+
+Find $G({10}^{11})$. Give your answer as a string in scientific notation rounded to 10 significant digits. Use a lowercase `e` to separate mantissa and exponent.
+
+For $G(10)$ the answer would have been `2.059722222e1`
 
 # --hints--
 
-`euler471()` should return 1.895093981e+31.
+`triangleInscribedInEllipse()` should return a string.
 
 ```js
-assert.strictEqual(euler471(), 1.895093981e31);
+assert(typeof triangleInscribedInEllipse() === 'string');
+```
+
+`triangleInscribedInEllipse()` should return the string `1.895093981e31`.
+
+```js
+assert.strictEqual(triangleInscribedInEllipse(), '1.895093981e31');
 ```
 
 # --seed--
@@ -29,12 +45,12 @@ assert.strictEqual(euler471(), 1.895093981e31);
 ## --seed-contents--
 
 ```js
-function euler471() {
+function triangleInscribedInEllipse() {
 
   return true;
 }
 
-euler471();
+triangleInscribedInEllipse();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md
index f4e90155496..25c9c601cf6 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md
@@ -1,39 +1,39 @@
 ---
 id: 5900f5451000cf542c510057
 title: 'Problem 472: Comfortable Distance II'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302149
 dashedName: problem-472-comfortable-distance-ii
 ---
 
 # --description--
 
-There are N seats in a row. N people come one after another to fill the seats according to the following rules:
+There are $N$ seats in a row. $N$ people come one after another to fill the seats according to the following rules:
 
-No person sits beside another.
+1. No person sits beside another.
+1. The first person chooses any seat.
+1. Each subsequent person chooses the seat furthest from anyone else already seated, as long as it does not violate rule 1. If there is more than one choice satisfying this condition, then the person chooses the leftmost choice.
 
-The first person chooses any seat.
+Note that due to rule 1, some seats will surely be left unoccupied, and the maximum number of people that can be seated is less than $N$ (for $N > 1$).
 
-Each subsequent person chooses the seat furthest from anyone else already seated, as long as it does not violate rule 1. If there is more than one choice satisfying this condition, then the person chooses the leftmost choice.
+Here are the possible seating arrangements for $N = 15$:
 
-Note that due to rule 1, some seats will surely be left unoccupied, and the maximum number of people that can be seated is less than N (for N > 1).
-
-Here are the possible seating arrangements for N = 15:
+<img class="img-responsive center-block" alt="seating arrangements for N = 15" src="https://cdn.freecodecamp.org/curriculum/project-euler/comfortable-distance-ii.png" style="background-color: white; padding: 10px;" />
 
 We see that if the first person chooses correctly, the 15 seats can seat up to 7 people. We can also see that the first person has 9 choices to maximize the number of people that may be seated.
 
-Let f(N) be the number of choices the first person has to maximize the number of occupants for N seats in a row. Thus, f(1) = 1, f(15) = 9, f(20) = 6, and f(500) = 16.
+Let $f(N)$ be the number of choices the first person has to maximize the number of occupants for $N$ seats in a row. Thus, $f(1) = 1$, $f(15) = 9$, $f(20) = 6$, and $f(500) = 16$.
 
-Also, ∑f(N) = 83 for 1 ≤ N ≤ 20 and ∑f(N) = 13343 for 1 ≤ N ≤ 500.
+Also, $\sum f(N) = 83$ for $1 ≤ N ≤ 20$ and $\sum f(N) = 13\\,343$ for $1 ≤ N ≤ 500$.
 
-Find ∑f(N) for 1 ≤ N ≤ 1012. Give the last 8 digits of your answer.
+Find $\sum f(N)$ for $1 ≤ N ≤ {10}^{12}$. Give the last 8 digits of your answer.
 
 # --hints--
 
-`euler472()` should return 73811586.
+`comfortableDistanceTwo()` should return `73811586`.
 
 ```js
-assert.strictEqual(euler472(), 73811586);
+assert.strictEqual(comfortableDistanceTwo(), 73811586);
 ```
 
 # --seed--
@@ -41,12 +41,12 @@ assert.strictEqual(euler472(), 73811586);
 ## --seed-contents--
 
 ```js
-function euler472() {
+function comfortableDistanceTwo() {
 
   return true;
 }
 
-euler472();
+comfortableDistanceTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md
index 505c8a757ba..97a545fed4c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md
@@ -1,16 +1,16 @@
 ---
 id: 5900f5461000cf542c510058
 title: 'Problem 473: Phigital number base'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302150
 dashedName: problem-473-phigital-number-base
 ---
 
 # --description--
 
-Let $\\varphi$ be the golden ratio: $\\varphi=\\frac{1+\\sqrt{5}}{2}.$
+Let $\varphi$ be the golden ratio: $\varphi = \frac{1+\sqrt{5}}{2}.$
 
-Remarkably it is possible to write every positive integer as a sum of powers of $\\varphi$ even if we require that every power of $\\varphi$ is used at most once in this sum.
+Remarkably it is possible to write every positive integer as a sum of powers of $\varphi$ even if we require that every power of $\varphi$ is used at most once in this sum.
 
 Even then this representation is not unique.
 
@@ -18,9 +18,11 @@ We can make it unique by requiring that no powers with consecutive exponents are
 
 E.g:
 
-$2=\\varphi+\\varphi^{-2}$ and $3=\\varphi^{2}+\\varphi^{-2}$
+$2 = \varphi + \varphi^{-2}$ and $3 = \varphi^{2} + \varphi^{-2}$
 
-To represent this sum of powers of $\\varphi$ we use a string of 0's and 1's with a point to indicate where the negative exponents start. We call this the representation in the phigital numberbase. So $1=1*{\\varphi}$, $2=10.01*{\\varphi}$, $3=100.01*{\\varphi}$ and $14=100100.001001*{\\varphi}$. The strings representing 1, 2 and 14 in the phigital number base are palindromic, while the string representing 3 is not. (the phigital point is not the middle character).
+To represent this sum of powers of $\varphi$ we use a string of 0's and 1's with a point to indicate where the negative exponents start. We call this the representation in the phigital numberbase.
+
+So $1 = 1_{\varphi}$, $2 = 10.01_{\varphi}$, $3 = 100.01_{\varphi}$ and $14 = 100100.001001_{\varphi}$. The strings representing 1, 2 and 14 in the phigital number base are palindromic, while the string representing 3 is not (the phigital point is not the middle character).
 
 The sum of the positive integers not exceeding 1000 whose phigital representation is palindromic is 4345.
 
@@ -28,10 +30,10 @@ Find the sum of the positive integers not exceeding $10^{10}$ whose phigital rep
 
 # --hints--
 
-`euler473()` should return 35856681704365.
+`phigitalNumberBase()` should return `35856681704365`.
 
 ```js
-assert.strictEqual(euler473(), 35856681704365);
+assert.strictEqual(phigitalNumberBase(), 35856681704365);
 ```
 
 # --seed--
@@ -39,12 +41,12 @@ assert.strictEqual(euler473(), 35856681704365);
 ## --seed-contents--
 
 ```js
-function euler473() {
+function phigitalNumberBase() {
 
   return true;
 }
 
-euler473();
+phigitalNumberBase();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.md
index 5c77726bd25..e63a971d336 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f5471000cf542c510059
 title: 'Problem 474: Last digits of divisors'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302151
 dashedName: problem-474-last-digits-of-divisors
 ---
 
 # --description--
 
-For a positive integer n and digits d, we define F(n, d) as the number of the divisors of n whose last digits equal d.
+For a positive integer $n$ and digits $d$, we define $F(n, d)$ as the number of the divisors of $n$ whose last digits equal $d$.
 
-For example, F(84, 4) = 3. Among the divisors of 84 (1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84), three of them (4, 14, 84) have the last digit 4.
+For example, $F(84, 4) = 3$. Among the divisors of 84 (1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84), three of them (4, 14, 84) have the last digit 4.
 
-We can also verify that F(12!, 12) = 11 and F(50!, 123) = 17888.
+We can also verify that $F(12!, 12) = 11$ and $F(50!, 123) = 17\\,888$.
 
-Find F(106!, 65432) modulo (1016 + 61).
+Find $F({10}^6!, 65\\,432) \text{ modulo } ({10}^{16} + 61)$.
 
 # --hints--
 
-`euler474()` should return 9690646731515010.
+`lastDigitsOfDivisors()` should return `9690646731515010`.
 
 ```js
-assert.strictEqual(euler474(), 9690646731515010);
+assert.strictEqual(lastDigitsOfDivisors(), 9690646731515010);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler474(), 9690646731515010);
 ## --seed-contents--
 
 ```js
-function euler474() {
+function lastDigitsOfDivisors() {
 
   return true;
 }
 
-euler474();
+lastDigitsOfDivisors();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-475-music-festival.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-475-music-festival.md
index dd8cf3538b7..9f019e969d0 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-475-music-festival.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-475-music-festival.md
@@ -1,29 +1,31 @@
 ---
 id: 5900f5481000cf542c51005a
 title: 'Problem 475: Music festival'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302152
 dashedName: problem-475-music-festival
 ---
 
 # --description--
 
-12n musicians participate at a music festival. On the first day, they form 3n quartets and practice all day.
+$12n$ musicians participate at a music festival. On the first day, they form $3n$ quartets and practice all day.
 
 It is a disaster. At the end of the day, all musicians decide they will never again agree to play with any member of their quartet.
 
-On the second day, they form 4n trios, each musician avoiding his previous quartet partners.
+On the second day, they form $4n$ trios, each musician avoiding his previous quartet partners.
 
-Let f(12n) be the number of ways to organize the trios amongst the 12n musicians. You are given f(12) = 576 and f(24) mod 1 000 000 007 = 509089824.
+Let $f(12n)$ be the number of ways to organize the trios amongst the $12n$ musicians.
 
-Find f(600) mod 1 000 000 007.
+You are given $f(12) = 576$ and $f(24)\bmod 1\\,000\\,000\\,007 = 509\\,089\\,824$.
+
+Find $f(600)\bmod 1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler475()` should return 75780067.
+`musicFestival()` should return `75780067`.
 
 ```js
-assert.strictEqual(euler475(), 75780067);
+assert.strictEqual(musicFestival(), 75780067);
 ```
 
 # --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler475(), 75780067);
 ## --seed-contents--
 
 ```js
-function euler475() {
+function musicFestival() {
 
   return true;
 }
 
-euler475();
+musicFestival();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-476-circle-packing-ii.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-476-circle-packing-ii.md
index a5a8bf868b0..c6f88e38013 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-476-circle-packing-ii.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-476-circle-packing-ii.md
@@ -1,27 +1,27 @@
 ---
 id: 5900f5481000cf542c51005b
 title: 'Problem 476: Circle Packing II'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302153
 dashedName: problem-476-circle-packing-ii
 ---
 
 # --description--
 
-Let R(a, b, c) be the maximum area covered by three non-overlapping circles inside a triangle with edge lengths a, b and c.
+Let $R(a, b, c)$ be the maximum area covered by three non-overlapping circles inside a triangle with edge lengths $a$, $b$ and $c$.
 
-Let S(n) be the average value of R(a, b, c) over all integer triplets (a, b, c) such that 1 ≤ a ≤ b ≤ c &lt; a + b ≤ n
+Let $S(n)$ be the average value of $R(a, b, c)$ over all integer triplets $(a, b, c)$ such that $1 ≤ a ≤ b ≤ c &lt; a + b ≤ n$.
 
-You are given S(2) = R(1, 1, 1) ≈ 0.31998, S(5) ≈ 1.25899.
+You are given $S(2) = R(1, 1, 1) ≈ 0.31998$, $S(5) ≈ 1.25899$.
 
-Find S(1803) rounded to 5 decimal places behind the decimal point.
+Find $S(1803)$ rounded to 5 decimal places behind the decimal point.
 
 # --hints--
 
-`euler476()` should return 110242.87794.
+`circlePackingTwo()` should return `110242.87794`.
 
 ```js
-assert.strictEqual(euler476(), 110242.87794);
+assert.strictEqual(circlePackingTwo(), 110242.87794);
 ```
 
 # --seed--
@@ -29,12 +29,12 @@ assert.strictEqual(euler476(), 110242.87794);
 ## --seed-contents--
 
 ```js
-function euler476() {
+function circlePackingTwo() {
 
   return true;
 }
 
-euler476();
+circlePackingTwo();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-477-number-sequence-game.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-477-number-sequence-game.md
index f4c95faba72..18bcc8e538b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-477-number-sequence-game.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-477-number-sequence-game.md
@@ -1,49 +1,45 @@
 ---
 id: 5900f54a1000cf542c51005c
 title: 'Problem 477: Number Sequence Game'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302154
 dashedName: problem-477-number-sequence-game
 ---
 
 # --description--
 
-The number sequence game starts with a sequence S of N numbers written on a line.
+The number sequence game starts with a sequence $S$ of $N$ numbers written on a line.
 
 Two players alternate turns. At his turn, a player must select and remove either the first or the last number remaining in the sequence.
 
 The player score is the sum of all the numbers he has taken. Each player attempts to maximize his own sum.
 
-If N = 4 and S = {1, 2, 10, 3}, then each player maximizes his score as follows:
+If $N = 4$ and $S = \\{1, 2, 10, 3\\}$, then each player maximizes his score as follows:
 
-Player 1: removes the first number (1)
+- Player 1: removes the first number (1)
+- Player 2: removes the last number from the remaining sequence (3)
+- Player 1: removes the last number from the remaining sequence (10)
+- Player 2: removes the remaining number (2)
 
-Player 2: removes the last number from the remaining sequence (3)
+Player 1 score is $1 + 10 = 11$.
 
-Player 1: removes the last number from the remaining sequence (10)
+Let $F(N)$ be the score of player 1 if both players follow the optimal strategy for the sequence $S = \\{s_1, s_2, \ldots, s_N\\}$ defined as:
 
-Player 2: removes the remaining number (2)
+- $s_1 = 0$
+- $s_{i + 1} = ({s_i}^2 + 45)$ modulo $1\\,000\\,000\\,007$
 
-Player 1 score is 1 + 10 = 11.
+The sequence begins with $S = \\{0, 45, 2\\,070, 4\\,284\\,945, 753\\,524\\,550, 478\\,107\\,844, 894\\,218\\,625, \ldots\\}$.
 
-Let F(N) be the score of player 1 if both players follow the optimal strategy for the sequence S = {s1, s2, ..., sN} defined as:
+You are given $F(2) = 45$, $F(4) = 4\\,284\\,990$, $F(100) = 26\\,365\\,463\\,243$, $F(104) = 2\\,495\\,838\\,522\\,951$.
 
-s1 = 0
-
-si+1 = (si2 + 45) modulo 1 000 000 007
-
-The sequence begins with S = {0, 45, 2070, 4284945, 753524550, 478107844, 894218625, ...}.
-
-You are given F(2) = 45, F(4) = 4284990, F(100) = 26365463243, F(104) = 2495838522951.
-
-Find F(108).
+Find $F({10}^8)$.
 
 # --hints--
 
-`euler477()` should return 25044905874565164.
+`numberSequenceGame()` should return `25044905874565164`.
 
 ```js
-assert.strictEqual(euler477(), 25044905874565164);
+assert.strictEqual(numberSequenceGame(), 25044905874565164);
 ```
 
 # --seed--
@@ -51,12 +47,12 @@ assert.strictEqual(euler477(), 25044905874565164);
 ## --seed-contents--
 
 ```js
-function euler477() {
+function numberSequenceGame() {
 
   return true;
 }
 
-euler477();
+numberSequenceGame();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-478-mixtures.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-478-mixtures.md
index 37e7681ecff..d2f0dbd2054 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-478-mixtures.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-478-mixtures.md
@@ -1,33 +1,39 @@
 ---
 id: 5900f54c1000cf542c51005e
 title: 'Problem 478: Mixtures'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302155
 dashedName: problem-478-mixtures
 ---
 
 # --description--
 
-Let us consider mixtures of three substances: A, B and C. A mixture can be described by a ratio of the amounts of A, B, and C in it, i.e., (a : b : c). For example, a mixture described by the ratio (2 : 3 : 5) contains 20% A, 30% B and 50% C.
+Let us consider mixtures of three substances: $A$, $B$ and $C$. A mixture can be described by a ratio of the amounts of $A$, $B$, and $C$ in it, i.e., $(a : b : c)$. For example, a mixture described by the ratio (2 : 3 : 5) contains 20% $A$, 30% $B$ and 50% $C$.
 
 For the purposes of this problem, we cannot separate the individual components from a mixture. However, we can combine different amounts of different mixtures to form mixtures with new ratios.
 
-For example, say we have three mixtures with ratios (3 : 0 : 2), (3 : 6 : 11) and (3 : 3 : 4). By mixing 10 units of the first, 20 units of the second and 30 units of the third, we get a new mixture with ratio (6 : 5 : 9), since: (10·3/5 + 20·3/20 + 30·3/10 : 10·0/5 + 20·6/20 + 30·3/10 : 10·2/5 + 20·11/20 + 30·4/10) = (18 : 15 : 27) = (6 : 5 : 9)
+For example, say we have three mixtures with ratios (3 : 0 : 2), (3 : 6 : 11) and (3 : 3 : 4). By mixing 10 units of the first, 20 units of the second and 30 units of the third, we get a new mixture with ratio (6 : 5 : 9), since: ($10 \times \frac{3}{5} + 20 \times \frac{3}{20} + 30 \times \frac{3}{10}$ : $10 \times \frac{0}{5} + 20 \times \frac{6}{20} + 30 \times \frac{3}{10}$ : $10 \times \frac{2}{5} + 20 \times \frac{11}{20} + 30 \times \frac{4}{10}$) = (18 : 15 : 27) = (6 : 5 : 9)
 
-However, with the same three mixtures, it is impossible to form the ratio (3 : 2 : 1), since the amount of B is always less than the amount of C.
+However, with the same three mixtures, it is impossible to form the ratio (3 : 2 : 1), since the amount of $B$ is always less than the amount of $C$.
 
-Let n be a positive integer. Suppose that for every triple of integers (a, b, c) with 0 ≤ a, b, c ≤ n and gcd(a, b, c) = 1, we have a mixture with ratio (a : b : c). Let M(n) be the set of all such mixtures.
+Let $n$ be a positive integer. Suppose that for every triple of integers $(a, b, c)$ with $0 ≤ a, b, c ≤ n$ and $gcd(a, b, c) = 1$, we have a mixture with ratio $(a : b : c)$. Let $M(n)$ be the set of all such mixtures.
 
-For example, M(2) contains the 19 mixtures with the following ratios: {(0 : 0 : 1), (0 : 1 : 0), (0 : 1 : 1), (0 : 1 : 2), (0 : 2 : 1), (1 : 0 : 0), (1 : 0 : 1), (1 : 0 : 2), (1 : 1 : 0), (1 : 1 : 1), (1 : 1 : 2), (1 : 2 : 0), (1 : 2 : 1), (1 : 2 : 2), (2 : 0 : 1), (2 : 1 : 0), (2 : 1 : 1), (2 : 1 : 2), (2 : 2 : 1)}.
+For example, $M(2)$ contains the 19 mixtures with the following ratios:
 
-Let E(n) be the number of subsets of M(n) which can produce the mixture with ratio (1 : 1 : 1), i.e., the mixture with equal parts A, B and C. We can verify that E(1) = 103, E(2) = 520447, E(10) mod 118 = 82608406 and E(500) mod 118 = 13801403. Find E(10 000 000) mod 118.
+{(0 : 0 : 1), (0 : 1 : 0), (0 : 1 : 1), (0 : 1 : 2), (0 : 2 : 1), (1 : 0 : 0), (1 : 0 : 1), (1 : 0 : 2), (1 : 1 : 0), (1 : 1 : 1), (1 : 1 : 2), (1 : 2 : 0), (1 : 2 : 1), (1 : 2 : 2), (2 : 0 : 1), (2 : 1 : 0), (2 : 1 : 1), (2 : 1 : 2), (2 : 2 : 1)}.
+
+Let $E(n)$ be the number of subsets of $M(n)$ which can produce the mixture with ratio (1 : 1 : 1), i.e., the mixture with equal parts $A$, $B$ and $C$.
+
+We can verify that $E(1) = 103$, $E(2) = 520\\,447$, $E(10)\bmod {11}^8 = 82\\,608\\,406$ and $E(500)\bmod {11}^8 = 13\\,801\\,403$.
+
+Find $E(10\\,000\\,000)\bmod {11}^8$.
 
 # --hints--
 
-`euler478()` should return 59510340.
+`mixtures()` should return `59510340`.
 
 ```js
-assert.strictEqual(euler478(), 59510340);
+assert.strictEqual(mixtures(), 59510340);
 ```
 
 # --seed--
@@ -35,12 +41,12 @@ assert.strictEqual(euler478(), 59510340);
 ## --seed-contents--
 
 ```js
-function euler478() {
+function mixtures() {
 
   return true;
 }
 
-euler478();
+mixtures();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.md
index 202e7e04be7..b905a648468 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.md
@@ -1,29 +1,29 @@
 ---
 id: 5900f54b1000cf542c51005d
 title: 'Problem 479: Roots on the Rise'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302156
 dashedName: problem-479-roots-on-the-rise
 ---
 
 # --description--
 
-Let ak, bk, and ck represent the three solutions (real or complex numbers) to the expression 1/x = (k/x)2(k+x2) - kx.
+Let $a_k$, $b_k$, and $c_k$ represent the three solutions (real or complex numbers) to the expression $\frac{1}{x} = {\left(\frac{k}{x} \right)}^2 (k + x^2) - kx$.
 
-For instance, for k = 5, we see that {a5, b5, c5} is approximately {5.727244, -0.363622+2.057397i, -0.363622-2.057397i}.
+For instance, for $k = 5$, we see that $\\{a_5, b_5, c_5\\}$ is approximately $\\{5.727244, -0.363622 + 2.057397i, -0.363622 - 2.057397i\\}$.
 
-Let S(n) = Σ (ak+bk)p(bk+ck)p(ck+ak)p for all integers p, k such that 1 ≤ p, k ≤ n.
+Let $S(n) = \displaystyle\sum_{p = 1}^n \sum_{k = 1}^n {(a_k + b_k)}^p {(b_k + c_k)}^p {(c_k + a_k)}^p$ for all integers $p$, $k$ such that $1 ≤ p, k ≤ n$.
 
-Interestingly, S(n) is always an integer. For example, S(4) = 51160.
+Interestingly, $S(n)$ is always an integer. For example, $S(4) = 51\\,160$.
 
-Find S(106) modulo 1 000 000 007.
+Find $S({10}^6) \text{ modulo } 1\\,000\\,000\\,007$.
 
 # --hints--
 
-`euler479()` should return 191541795.
+`rootsOnTheRise()` should return `191541795`.
 
 ```js
-assert.strictEqual(euler479(), 191541795);
+assert.strictEqual(rootsOnTheRise(), 191541795);
 ```
 
 # --seed--
@@ -31,12 +31,12 @@ assert.strictEqual(euler479(), 191541795);
 ## --seed-contents--
 
 ```js
-function euler479() {
+function rootsOnTheRise() {
 
   return true;
 }
 
-euler479();
+rootsOnTheRise();
 ```
 
 # --solutions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-48-self-powers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-48-self-powers.md
index 58e654f8938..d429c978791 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-48-self-powers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-48-self-powers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f39c1000cf542c50feaf
 title: 'Problem 48: Self powers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302157
 dashedName: problem-48-self-powers
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-480-the-last-question.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-480-the-last-question.md
index 9e2ac8d96d8..e77c5f685d2 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-480-the-last-question.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-480-the-last-question.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f54c1000cf542c51005f
 title: 'Problem 480: The Last Question'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302158
 dashedName: problem-480-the-last-question
 ---
@@ -10,88 +10,56 @@ dashedName: problem-480-the-last-question
 
 Consider all the words which can be formed by selecting letters, in any order, from the phrase:
 
-thereisasyetinsufficientdataforameaningfulanswer
+$$\mathbf{\text{thereisasyetinsufficientdataforameaningfulanswer}}$$
 
 Suppose those with 15 letters or less are listed in alphabetical order and numbered sequentially starting at 1.
 
 The list would include:
 
-1 : a
+$$\begin{align}   & 1: \text{a} \\\\
+  & 2: \text{aa} \\\\   & 3: \text{aaa} \\\\
+  & 4: \text{aaaa} \\\\   & 5: \text{aaaaa} \\\\
+  & 6: \text{aaaaaa} \\\\   & 7: \text{aaaaaac} \\\\
+  & 8: \text{aaaaaacd} \\\\   & 9: \text{aaaaaacde} \\\\
+  & 10: \text{aaaaaacdee} \\\\   & 11: \text{aaaaaacdeee} \\\\
+  & 12: \text{aaaaaacdeeee} \\\\   & 13: \text{aaaaaacdeeeee} \\\\
+  & 14: \text{aaaaaacdeeeeee} \\\\   & 15: \text{aaaaaacdeeeeeef} \\\\
+  & 16: \text{aaaaaacdeeeeeeg} \\\\   & 17: \text{aaaaaacdeeeeeeh} \\\\
+  & \ldots \\\\   & 28: \text{aaaaaacdeeeeeey} \\\\
+  & 29: \text{aaaaaacdeeeeef} \\\\   & 30: \text{aaaaaacdeeeeefe} \\\\
+  & \ldots \\\\   & 115246685191495242: \text{euleoywuttttsss} \\\\
+  & 115246685191495243: \text{euler} \\\\   & 115246685191495244: \text{eulera} \\\\
+  & ... \\\\   & 525069350231428029: \text{ywuuttttssssrrr} \\\\
+\end{align}$$
 
-2 : aa
+Define $P(w)$ as the position of the word $w$.
 
-3 : aaa
+Define $W(p)$ as the word in position $p$.
 
-4 : aaaa
+We can see that $P(w)$ and $W(p)$ are inverses: $P(W(p)) = p$ and $W(P(w)) = w$.
 
-5 : aaaaa
+Ejemplos:
 
-6 : aaaaaa
+$$\begin{align}   & W(10) = \text{ aaaaaacdee} \\\\
+  & P(\text{aaaaaacdee}) = 10 \\\\   & W(115246685191495243) = \text{ euler} \\\\
+  & P(\text{euler}) = 115246685191495243 \\\\ \end{align}$$
 
-7 : aaaaaac
-
-8 : aaaaaacd
-
-9 : aaaaaacde
-
-10 : aaaaaacdee
-
-11 : aaaaaacdeee
-
-12 : aaaaaacdeeee
-
-13 : aaaaaacdeeeee
-
-14 : aaaaaacdeeeeee
-
-15 : aaaaaacdeeeeeef
-
-16 : aaaaaacdeeeeeeg
-
-17 : aaaaaacdeeeeeeh
-
-...
-
-28 : aaaaaacdeeeeeey
-
-29 : aaaaaacdeeeeef
-
-30 : aaaaaacdeeeeefe
-
-...
-
-115246685191495242: euleoywuttttsss
-
-115246685191495243: euler
-
-115246685191495244: eulera
-
-...
-
-525069350231428029: ywuuttttssssrrrDefine P(w) as the position of the word w.
-
-Define W(p) as the word in position p.
-
-We can see that P(w) and W(p) are inverses: P(W(p)) = p and W(P(w)) = w.
-
-Examples:
-
-W(10) = aaaaaacdee
-
-P(aaaaaacdee) = 10
-
-W(115246685191495243) = euler
-
-P(euler) = 115246685191495243Find W(P(legionary) + P(calorimeters) - P(annihilate) + P(orchestrated) - P(fluttering)).
+Find $$W(P(\text{legionary}) + P(\text{calorimeters}) - P(\text{annihilate}) + P(\text{orchestrated}) - P(\text{fluttering})).$$
 
 Give your answer using lowercase characters (no punctuation or space).
 
 # --hints--
 
-`euler480()` should return turnthestarson.
+`euler480()` should return a string.
 
 ```js
-assert.strictEqual(euler480(), turnthestarson);
+assert(typeof euler480() === 'string');
+```
+
+`euler480()` should return the string `turnthestarson`.
+
+```js
+assert.strictEqual(euler480(), 'turnthestarson');
 ```
 
 # --seed--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-49-prime-permutations.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-49-prime-permutations.md
index 0dc7ae0ddcf..3c0c1d3d362 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-49-prime-permutations.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-49-prime-permutations.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f39d1000cf542c50feb0
 title: 'Problem 49: Prime permutations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302159
 dashedName: problem-49-prime-permutations
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.md
index 92924bf85e1..861a3e99a8e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f39e1000cf542c50feb1
 title: 'Problem 50: Consecutive prime sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302161
 dashedName: problem-50-consecutive-prime-sum
 ---
@@ -54,42 +54,70 @@ consecutivePrimeSum(1000000);
 # --solutions--
 
 ```js
-function consecutivePrimeSum(limit) {
-  function isPrime(num) {
-    if (num < 2) {
-      return false;
-    } else if (num === 2) {
-      return true;
-    }
-    const sqrtOfNum = Math.floor(num ** 0.5);
-    for (let i = 2; i <= sqrtOfNum + 1; i++) {
-      if (num % i === 0) {
-        return false;
-      }
+// Initalize prime number list with sieve
+const NUM_PRIMES = 1000000;
+const PRIMES = [2];
+const PRIME_SIEVE = Array(Math.floor((NUM_PRIMES-1)/2)).fill(true);
+(function initPrimes(num) {
+  const upper = Math.floor((num - 1) / 2);
+  const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+  for (let i = 0; i <= sqrtUpper; i++) {
+    if (PRIME_SIEVE[i]) {
+      // Mark value in PRIMES array
+      const prime = 2 * i + 3;
+      PRIMES.push(prime);
+      // Mark all multiples of this number as false (not prime)
+      const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+      for (let j = primeSqaredIndex; j < upper; j += prime)
+        PRIME_SIEVE[j] = false;
     }
+  }
+  for (let i = sqrtUpper + 1; i < upper; i++) {
+    if (PRIME_SIEVE[i])
+      PRIMES.push(2 * i + 3);
+  }
+})(NUM_PRIMES);
+
+function isPrime(num) {
+  if (num === 2)
     return true;
-  }
-  function getPrimes(limit) {
-    const primes = [];
-    for (let i = 0; i <= limit; i++) {
-      if (isPrime(i)) primes.push(i);
-    }
-    return primes;
-  }
+  else if (num % 2 === 0)
+    return false
+  else
+    return PRIME_SIEVE[(num - 3) / 2];
+}
 
-  const primes = getPrimes(limit);
-  let primeSum = [...primes];
-  primeSum.reduce((acc, n, i) => {
-    primeSum[i] += acc;
-    return acc += n;
-  }, 0);
+function consecutivePrimeSum(limit) {
+  // Initalize for longest sum < 100
+  let bestPrime = 41;
+  let bestI = 0;
+  let bestJ = 5;
 
-  for (let j = primeSum.length - 1; j >= 0; j--) {
-    for (let i = 0; i < j; i++) {
-      const sum = primeSum[j] - primeSum[i];
-      if (sum > limit) break;
-      if (isPrime(sum) && primes.indexOf(sum) > -1) return sum;
+  // Find longest sum < limit
+  let sumOfCurrRange = 41;
+  let i = 0, j = 5;
+  // -- Loop while current some starting at i is < limit
+  while (sumOfCurrRange < limit) {
+    let currSum = sumOfCurrRange;
+    // -- Loop while pushing j towards end of PRIMES list
+    //      keeping sum under limit
+    while (currSum < limit) {
+      if (isPrime(currSum)) {
+        bestPrime = sumOfCurrRange = currSum;
+        bestI = i;
+        bestJ = j;
+      }
+      // -- Increment inner loop
+      j++;
+      currSum += PRIMES[j];
     }
+    // -- Increment outer loop
+    i++;
+    j = i + (bestJ - bestI);
+    sumOfCurrRange -= PRIMES[i - 1];
+    sumOfCurrRange += PRIMES[j];
   }
+  // Return
+  return bestPrime;
 }
 ```
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.md
index d890d42133e..26aed0ce89a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f39f1000cf542c50feb2
 title: 'Problem 51: Prime digit replacements'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302162
 dashedName: problem-51-prime-digit-replacements
 ---
@@ -56,68 +56,71 @@ primeDigitReplacements(6);
 # --solutions--
 
 ```js
+const NUM_PRIMES = 1000000;
+const PRIME_SEIVE = Array(Math.floor((NUM_PRIMES-1)/2)).fill(true);
+(function initPrimes(num) {
+  const upper = Math.floor((num - 1) / 2);
+  const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+  for (let i = 0; i <= sqrtUpper; i++) {
+    if (PRIME_SEIVE[i]) {
+      // Mark value in PRIMES array
+      const prime = 2 * i + 3;
+      // Mark all multiples of this number as false (not prime)
+      const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+      for (let j = primeSqaredIndex; j < upper; j += prime) {
+        PRIME_SEIVE[j] = false;
+      }
+    }
+  }
+})(NUM_PRIMES);
+
+function isPrime(num) {
+  if (num === 2) return true;
+  else if (num % 2 === 0) return false
+  else return PRIME_SEIVE[(num - 3) / 2];
+}
+
 function primeDigitReplacements(n) {
-  function isNFamily(number, primesMap, n) {
+  function isNFamily(number, n) {
     const prime = number.toString();
     const lastDigit = prime[prime.length - 1];
+    return doesReplacingMakeFamily(prime, '0', n) ||
+      doesReplacingMakeFamily(prime, '2', n) ||
+      (lastDigit !== '1' && doesReplacingMakeFamily(prime, '1', n));
+  }
+
+  function doesReplacingMakeFamily(prime, digitToReplace, family) {
+    let miss = 0;
+    const base = parseInt(
+      prime
+        .split('')
+        .map(digit => digit == digitToReplace ? '0' : digit)
+        .join('')
+    );
+    const replacements = parseInt(
+      prime
+        .split('')
+        .map(digit => digit === digitToReplace ? '1' : '0')
+        .join('')
+    );
+    const start = prime[0] === digitToReplace ? 1 : 0;
+    for (let i = start; i < 10; i++) {
+      const nextNumber = base + i * replacements;
+      if (!isPartOfFamily(nextNumber, prime)) miss++;
+      if (10 - start - miss < family) break;
+    }
+    return 10 - start - miss === family;
+  }
+
+  function isPartOfFamily(number, prime) {
     return (
-      doesReplacingMakeFamily(prime, '0', primesMap, n) ||
-      (lastDigit !== '1' &&
-        doesReplacingMakeFamily(prime, '1', primesMap, n)) ||
-      doesReplacingMakeFamily(prime, '2', primesMap, n)
+      isPrime(number) && number.toString().length === prime.length
     );
   }
 
-  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;
-      }
+  for (let number = 1; number < 125000; number++) {
+    if (isPrime(number) && isNFamily(number, n)) {
+      return number;
     }
   }
   return -1;
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-52-permuted-multiples.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-52-permuted-multiples.md
index d5431d8135b..7a3886a6e27 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-52-permuted-multiples.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-52-permuted-multiples.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a01000cf542c50feb3
 title: 'Problem 52: Permuted multiples'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302163
 dashedName: problem-52-permuted-multiples
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-53-combinatoric-selections.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-53-combinatoric-selections.md
index dbd39ef9755..8d96ff14392 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-53-combinatoric-selections.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-53-combinatoric-selections.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a11000cf542c50feb4
 title: 'Problem 53: Combinatoric selections'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302164
 dashedName: problem-53-combinatoric-selections
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-54-poker-hands.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-54-poker-hands.md
index fd260cddf92..b08e9a13bda 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-54-poker-hands.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-54-poker-hands.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a21000cf542c50feb5
 title: 'Problem 54: Poker hands'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302165
 dashedName: problem-54-poker-hands
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-55-lychrel-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-55-lychrel-numbers.md
index 8b074ba2594..72c53d7890a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-55-lychrel-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-55-lychrel-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a31000cf542c50feb6
 title: 'Problem 55: Lychrel numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302166
 dashedName: problem-55-lychrel-numbers
 ---
@@ -10,7 +10,7 @@ dashedName: problem-55-lychrel-numbers
 
 If we take 47, reverse and add, 47 + 74 = 121, which is palindromic.
 
-Not all numbers produce palindromes so quickly. For example,
+Not all numbers produce palindromes so quickly. Por ejemplo,
 
 <div style="margin-left: 4em;">
   349 + 943 = 1292,<br>
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.md
index 407314741ab..e445973f332 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a41000cf542c50feb7
 title: 'Problem 56: Powerful digit sum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302167
 dashedName: problem-56-powerful-digit-sum
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-57-square-root-convergents.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-57-square-root-convergents.md
index 17103bc6fe5..034974d882c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-57-square-root-convergents.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-57-square-root-convergents.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a51000cf542c50feb8
 title: 'Problem 57: Square root convergents'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302168
 dashedName: problem-57-square-root-convergents
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-58-spiral-primes.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-58-spiral-primes.md
index 29a3012e447..70b80ebf2a1 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-58-spiral-primes.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-58-spiral-primes.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a61000cf542c50feb9
 title: 'Problem 58: Spiral primes'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302169
 dashedName: problem-58-spiral-primes
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-59-xor-decryption.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-59-xor-decryption.md
index 683db15249a..0784e292908 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-59-xor-decryption.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-59-xor-decryption.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a81000cf542c50feba
 title: 'Problem 59: XOR decryption'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302170
 dashedName: problem-59-xor-decryption
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-60-prime-pair-sets.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-60-prime-pair-sets.md
index 5acc6c21769..dc4a88c2cfb 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-60-prime-pair-sets.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-60-prime-pair-sets.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a81000cf542c50febb
 title: 'Problem 60: Prime pair sets'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302172
 dashedName: problem-60-prime-pair-sets
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md
index 8989f4171cf..99fee7255e8 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3a91000cf542c50febc
 title: 'Problem 61: Cyclical figurate numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302173
 dashedName: problem-61-cyclical-figurate-numbers
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md
index 82294e0708a..a89d136f83c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3aa1000cf542c50febd
 title: 'Problem 62: Cubic permutations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302174
 dashedName: problem-62-cubic-permutations
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md
index 02c96036851..2c8b0bb8cd6 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ab1000cf542c50febe
 title: 'Problem 63: Powerful digit counts'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302175
 dashedName: problem-63-powerful-digit-counts
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md
index 6cc017e1fb4..a6acdfc610e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ac1000cf542c50febf
 title: 'Problem 64: Odd period square roots'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302176
 dashedName: problem-64-odd-period-square-roots
 ---
@@ -12,7 +12,7 @@ All square roots are periodic when written as continued fractions and can be wri
 
 $\\displaystyle \\quad \\quad \\sqrt{N}=a_0+\\frac 1 {a_1+\\frac 1 {a_2+ \\frac 1 {a3+ \\dots}}}$
 
-For example, let us consider $\\sqrt{23}:$:
+For example, let us consider $\\sqrt{23}$:
 
 $\\quad \\quad \\sqrt{23}=4+\\sqrt{23}-4=4+\\frac 1 {\\frac 1 {\\sqrt{23}-4}}=4+\\frac 1 {1+\\frac{\\sqrt{23}-3}7}$
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-65-convergents-of-e.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-65-convergents-of-e.md
index 7a1383a7f0c..9aa62302442 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-65-convergents-of-e.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-65-convergents-of-e.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ad1000cf542c50fec0
 title: 'Problem 65: Convergents of e'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302177
 dashedName: problem-65-convergents-of-e
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-66-diophantine-equation.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-66-diophantine-equation.md
index 0eab98070b1..9e01ce1b0c5 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-66-diophantine-equation.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-66-diophantine-equation.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ae1000cf542c50fec1
 title: 'Problem 66: Diophantine equation'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302178
 dashedName: problem-66-diophantine-equation
 ---
@@ -40,25 +40,25 @@ assert(typeof diophantineEquation(7) === 'number');
 
 `diophantineEquation(7)` should return `5`.
 
-```
+```js
 assert.strictEqual(diophantineEquation(7), 5);
 ```
 
 `diophantineEquation(100)` should return `61`.
 
-```
+```js
 assert.strictEqual(diophantineEquation(100), 61);
 ```
 
 `diophantineEquation(409)` should return `409`.
 
-```
+```js
 assert.strictEqual(diophantineEquation(409), 409);
 ```
 
 `diophantineEquation(500)` should return `421`.
 
-```
+```js
 assert.strictEqual(diophantineEquation(500), 421);
 ```
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.md
index 9e1e818c9ce..c3aa2fb6e3b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b01000cf542c50fec2
 title: 'Problem 67: Maximum path sum II'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302179
 dashedName: problem-67-maximum-path-sum-ii
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md
index 1ae580513f2..7be38bfabe1 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b01000cf542c50fec3
 title: 'Problem 68: Magic 5-gon ring'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302180
 dashedName: problem-68-magic-5-gon-ring
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-69-totient-maximum.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-69-totient-maximum.md
index 2e538e324dc..e57b133fbe7 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-69-totient-maximum.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-69-totient-maximum.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b11000cf542c50fec4
 title: 'Problem 69: Totient maximum'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302181
 dashedName: problem-69-totient-maximum
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-70-totient-permutation.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-70-totient-permutation.md
index 09c3e106281..1328f1ca1e7 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-70-totient-permutation.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-70-totient-permutation.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b21000cf542c50fec5
 title: 'Problem 70: Totient permutation'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302183
 dashedName: problem-70-totient-permutation
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-71-ordered-fractions.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-71-ordered-fractions.md
index 55a2e9b72f6..267a17669b0 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-71-ordered-fractions.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-71-ordered-fractions.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b31000cf542c50fec6
 title: 'Problem 71: Ordered fractions'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302184
 dashedName: problem-71-ordered-fractions
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-72-counting-fractions.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-72-counting-fractions.md
index 3929bde7af7..dab392ae0ae 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-72-counting-fractions.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-72-counting-fractions.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b41000cf542c50fec7
 title: 'Problem 72: Counting fractions'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302185
 dashedName: problem-72-counting-fractions
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.md
index 10c1ae6ea87..b53ef258385 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b61000cf542c50fec8
 title: 'Problem 73: Counting fractions in a range'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302186
 dashedName: problem-73-counting-fractions-in-a-range
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md
index eb9a6e9d13f..db8e80a8d90 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b61000cf542c50fec9
 title: 'Problem 74: Digit factorial chains'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302187
 dashedName: problem-74-digit-factorial-chains
 ---
@@ -14,15 +14,19 @@ $$1! + 4! + 5! = 1 + 24 + 120 = 145$$
 
 Perhaps less well known is 169, in that it produces the longest chain of numbers that link back to 169; it turns out that there are only three such loops that exist:
 
-$$\begin{align} &169 → 363601 → 1454 → 169\\\\ &871 → 45361 → 871\\\\ &872 → 45362 → 872\\\\ \end{align}$$
+$$\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,
+It is not difficult to prove that EVERY starting number will eventually get stuck in a loop. Por ejemplo,
 
-$$\begin{align} &69 → 363600 → 1454 → 169 → 363601\\ (→ 1454)\\\\ &78 → 45360 → 871 → 45361\\ (→ 871)\\\\ &540 → 145\\ (→ 145)\\\\ \end{align}$$
+$$\begin{align} &69 → 363600 → 1454 → 169 → 363601\\ (→ 1454)\\\\
+&78 → 45360 → 871 → 45361\\ (→ 871)\\\\ &540 → 145\\ (→ 145)\\\\
+\end{align}$$
 
 Starting with 69 produces a chain of five non-repeating terms, but the longest non-repeating chain with a starting number below one million is sixty terms.
 
-How many chains, with a starting number below `n`, contain exactly sixty non-repeating terms?
+¿Cuántas cadenas, con un número inicial debajo de `n`, contienen exactamente sesenta términos que no se repiten?
 
 # --hints--
 
@@ -32,25 +36,25 @@ How many chains, with a starting number below `n`, contain exactly sixty non-rep
 assert(typeof digitFactorialChains(2000) === 'number');
 ```
 
-`digitFactorialChains(2000)` should return `6`.
+`digitFactorialChains(2000)` debería devolver `6`.
 
 ```js
 assert.strictEqual(digitFactorialChains(2000), 6);
 ```
 
-`digitFactorialChains(100000)` should return `42`.
+`digitFactorialChains(100000)` debería devolver `42`.
 
 ```js
 assert.strictEqual(digitFactorialChains(100000), 42);
 ```
 
-`digitFactorialChains(500000)` should return `282`.
+`digitFactorialChains(500000)` debería devolver `282`.
 
 ```js
 assert.strictEqual(digitFactorialChains(500000), 282);
 ```
 
-`digitFactorialChains(1000000)` should return `402`.
+`digitFactorialChains(1000000)` debería devolver `402`.
 
 ```js
 assert.strictEqual(digitFactorialChains(1000000), 402);
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.md
index a20c0a95eac..40ab4fb3e00 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b71000cf542c50feca
 title: 'Problem 75: Singular integer right triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302188
 dashedName: problem-75-singular-integer-right-triangles
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-76-counting-summations.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-76-counting-summations.md
index bbc9618245c..04a358b584d 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-76-counting-summations.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-76-counting-summations.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b81000cf542c50fecb
 title: 'Problem 76: Counting summations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302189
 dashedName: problem-76-counting-summations
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-77-prime-summations.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-77-prime-summations.md
index bd26cc3c699..a5639dc73a4 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-77-prime-summations.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-77-prime-summations.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3b91000cf542c50fecc
 title: 'Problem 77: Prime summations'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302190
 dashedName: problem-77-prime-summations
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md
index 61f145116f3..65d3ebad7e4 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ba1000cf542c50fecd
 title: 'Problem 78: Coin partitions'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302191
 dashedName: problem-78-coin-partitions
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-79-passcode-derivation.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-79-passcode-derivation.md
index e9858fa5399..a17babe3520 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-79-passcode-derivation.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-79-passcode-derivation.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3bb1000cf542c50fece
 title: 'Problem 79: Passcode derivation'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302192
 dashedName: problem-79-passcode-derivation
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.md
index a5523347055..34d7dd6eea4 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3bc1000cf542c50fecf
 title: 'Problem 80: Square root digital expansion'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302194
 dashedName: problem-80-square-root-digital-expansion
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md
index 542d6ce39af..20333f26494 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3bd1000cf542c50fed0
-title: 'Problem 81: Path sum: two ways'
-challengeType: 5
+title: 'Problema 81: Suma de la ruta: dos maneras'
+challengeType: 1
 forumTopicId: 302195
 dashedName: problem-81-path-sum-two-ways
 ---
@@ -10,7 +10,9 @@ dashedName: problem-81-path-sum-two-ways
 
 In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by **only moving to the right and down**, is indicated in bold red and is equal to `2427`.
 
-  $$\begin{pmatrix} \color{red}{131} & 673 & 234 & 103 & 18\\\\ \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\\\ 630 & 803 & \color{red}{746} & \color{red}{422} & 111\\\\ 537 & 699 & 497 & \color{red}{121} & 956\\\\ 805 & 732 & 524 & \color{red}{37} & \color{red}{331} \end{pmatrix}$$
+  $$\begin{pmatrix}   \color{red}{131} & 673 & 234 & 103 & 18\\\\
+  \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\\\   630 & 803 & \color{red}{746} & \color{red}{422} & 111\\\\
+  537 & 699 & 497 & \color{red}{121} & 956\\\\ 805 & 732 & 524 & \color{red}{37} & \color{red}{331} \end{pmatrix}$$
 
 Find the minimal path sum from the top left to the bottom right by only moving right and down in `matrix`, a 2D array representing a matrix. The maximum matrix size used in the tests will be 80 by 80.
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md
index ec68b544e25..0895540d468 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3be1000cf542c50fed1
 title: 'Problem 82: Path sum: three ways'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302196
 dashedName: problem-82-path-sum-three-ways
 ---
@@ -12,7 +12,9 @@ dashedName: problem-82-path-sum-three-ways
 
 The minimal path sum in the 5 by 5 matrix below, by starting in any cell in the left column and finishing in any cell in the right column, and only moving up, down, and right, is indicated in red and bold; the sum is equal to `994`.
 
-  $$\begin{pmatrix} 131 & 673 & \color{red}{234} & \color{red}{103} & \color{red}{18}\\\\ \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\\\ 630 & 803 & 746 & 422 & 111\\\\ 537 & 699 & 497 & 121 & 956\\\\ 805 & 732 & 524 & 37 & 331 \end{pmatrix}$$
+  $$\begin{pmatrix}   131 & 673 & \color{red}{234} & \color{red}{103} & \color{red}{18}\\\\
+  \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\\\   630 & 803 & 746 & 422 & 111\\\\
+  537 & 699 & 497 & 121 & 956\\\\ 805 & 732 & 524 & 37 & 331 \end{pmatrix}$$
 
 Find the minimal path sum from the left column to the right column in `matrix`, a 2D array representing a matrix. The maximum matrix size used in tests will be 80 by 80.
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md
index ce957c019f4..8d3b60e0c0b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3bf1000cf542c50fed2
 title: 'Problem 83: Path sum: four ways'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302197
 dashedName: problem-83-path-sum-four-ways
 ---
@@ -12,7 +12,9 @@ dashedName: problem-83-path-sum-four-ways
 
 In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by moving left, right, up, and down, is indicated in bold red and is equal to `2297`.
 
-  $$\begin{pmatrix} \color{red}{131} & 673 & \color{red}{234} & \color{red}{103} & \color{red}{18}\\\\ \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & \color{red}{150}\\\\ 630 & 803 & 746 & \color{red}{422} & \color{red}{111}\\\\ 537 & 699 & 497 & \color{red}{121} & 956\\\\ 805 & 732 & 524 & \color{red}{37} & \color{red}{331} \end{pmatrix}$$
+  $$\begin{pmatrix}   \color{red}{131} & 673 & \color{red}{234} & \color{red}{103} & \color{red}{18}\\\\
+  \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & \color{red}{150}\\\\   630 & 803 & 746 & \color{red}{422} & \color{red}{111}\\\\
+  537 & 699 & 497 & \color{red}{121} & 956\\\\ 805 & 732 & 524 & \color{red}{37} & \color{red}{331} \end{pmatrix}$$
 
 Find the minimal path sum from the top left to the bottom right by moving left, right, up, and down in `matrix`, a 2D array representing a matrix. The maximum matrix size used in tests will be 80 by 80.
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-84-monopoly-odds.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-84-monopoly-odds.md
index 6870d2e4207..92c630f9429 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-84-monopoly-odds.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-84-monopoly-odds.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c11000cf542c50fed3
 title: 'Problem 84: Monopoly odds'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302198
 dashedName: problem-84-monopoly-odds
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md
index c6d4c9c2c6b..eafbccb8aee 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c11000cf542c50fed4
 title: 'Problem 85: Counting rectangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302199
 dashedName: problem-85-counting-rectangles
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md
index bcd935b24d4..39a860bd794 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c31000cf542c50fed5
 title: 'Problem 86: Cuboid route'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302200
 dashedName: problem-86-cuboid-route
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.md
index 57da5afe793..a6c51eff68d 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c51000cf542c50fed8
 title: 'Problem 87: Prime power triples'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302201
 dashedName: problem-87-prime-power-triples
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-88-product-sum-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-88-product-sum-numbers.md
index 3134d9cacf3..46779896396 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-88-product-sum-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-88-product-sum-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c51000cf542c50fed6
 title: 'Problem 88: Product-sum numbers'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302203
 dashedName: problem-88-product-sum-numbers
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-89-roman-numerals.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-89-roman-numerals.md
index 3c0e7ac2aa5..52c03847a6b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-89-roman-numerals.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-89-roman-numerals.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c51000cf542c50fed7
 title: 'Problem 89: Roman numerals'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302204
 dashedName: problem-89-roman-numerals
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md
index ef2182b215d..3e1206b4c4f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c61000cf542c50fed9
 title: 'Problem 90: Cube digit pairs'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302207
 dashedName: problem-90-cube-digit-pairs
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md
index b920e69678d..7874cbab3fc 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c71000cf542c50feda
 title: 'Problem 91: Right triangles with integer coordinates'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302208
 dashedName: problem-91-right-triangles-with-integer-coordinates
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-92-square-digit-chains.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-92-square-digit-chains.md
index 5f62bd9da75..a542c60a1d6 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-92-square-digit-chains.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-92-square-digit-chains.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3c81000cf542c50fedb
 title: 'Problem 92: Square digit chains'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302209
 dashedName: problem-92-square-digit-chains
 ---
@@ -10,9 +10,10 @@ dashedName: problem-92-square-digit-chains
 
 A number chain is created by continuously adding the square of the digits in a number to form a new number until it has been seen before.
 
-For example,
+Por ejemplo,
 
-$$\begin{align} & 44 → 32 → 13 → 10 → \boldsymbol{1} → \boldsymbol{1}\\\\ & 85 → \boldsymbol{89} → 145 → 42 → 20 → 4 → 16 → 37 → 58 → \boldsymbol{89}\\\\ \end{align}$$
+$$\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.
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.md
index 81b5dce63a3..95e805fd393 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ca1000cf542c50fedc
-title: 'Problem 93: Arithmetic expressions'
-challengeType: 5
+title: 'Problema N° 93: Expresiones aritméticas'
+challengeType: 1
 forumTopicId: 302210
 dashedName: problem-93-arithmetic-expressions
 ---
@@ -10,7 +10,7 @@ dashedName: problem-93-arithmetic-expressions
 
 By using each of the digits from the set, {1, 2, 3, 4}, exactly once, and making use of the four arithmetic operations (+, −, \*, /) and brackets/parentheses, it is possible to form different positive integer targets.
 
-For example,
+Por ejemplo,
 
 <div style='margin-left: 4em;'>
   8 = (4 * (1 + 3)) / 2<br>
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.md
index ef0c095e035..4b3ab85e079 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ca1000cf542c50fedd
 title: 'Problem 94: Almost equilateral triangles'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302211
 dashedName: problem-94-almost-equilateral-triangles
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-95-amicable-chains.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-95-amicable-chains.md
index 19d2301062a..fe2d422a206 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-95-amicable-chains.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-95-amicable-chains.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3cc1000cf542c50fede
 title: 'Problem 95: Amicable chains'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302212
 dashedName: problem-95-amicable-chains
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.md
index 15dafc79a9f..cabdb3486c9 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ce1000cf542c50fee0
 title: 'Problem 97: Large non-Mersenne prime'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302214
 dashedName: problem-97-large-non-mersenne-prime
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-98-anagramic-squares.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-98-anagramic-squares.md
index e63309053f3..f54ab71dd62 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-98-anagramic-squares.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-98-anagramic-squares.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3cf1000cf542c50fee1
 title: 'Problem 98: Anagramic squares'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302215
 dashedName: problem-98-anagramic-squares
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-99-largest-exponential.md b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-99-largest-exponential.md
index 07d9a48f01d..af44a7d0bd7 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-99-largest-exponential.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/project-euler/problem-99-largest-exponential.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d01000cf542c50fee2
 title: 'Problem 99: Largest exponential'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302216
 dashedName: problem-99-largest-exponential
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/24-game.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/24-game.md
index 7bf28fe4df4..ac16df78509 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/24-game.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/24-game.md
@@ -1,14 +1,14 @@
 ---
 id: 5951e88f64ebf159166a1176
 title: 24 game
-challengeType: 5
+challengeType: 1
 forumTopicId: 302218
 dashedName: 24-game
 ---
 
 # --description--
 
-The [24 Game](https://en.wikipedia.org/wiki/24_Game) tests a person's mental arithmetic.
+The 24 Game tests a person's mental arithmetic.
 
 The aim of the game is to arrange four numbers in a way that when evaluated, the result is 24
 
@@ -39,28 +39,28 @@ Implement a function that takes a string of four digits as its argument, with ea
 assert(typeof solve24 === 'function');
 ```
 
-`solve24("4878")` should return `(7-8/8)*4` or `4*(7-8/8)`
+`solve24("4878")` should return `(7-8/8)*4`, `4*(7-8/8)`, or a similar valid string
 
 ```js
-assert(include(answers[0], removeParentheses(solve24(testCases[0]))));
+assert(isValidSolution_(solve24(testCases_[0])));
 ```
 
-`solve24("1234")` should return any arrangement of `1*2*3*4`
+`solve24("1234")` should return `1*2*3*4` or a similar valid string
 
 ```js
-assert(include(answers[1], removeParentheses(solve24(testCases[1]))));
+assert(isValidSolution_(solve24(testCases_[1])));
 ```
 
-`solve24("6789")` should return `(6*8)/(9-7)` or `(8*6)/(9-7)`
+`solve24("6789")` should return `(6*8)/(9-7)`, `(8*6)/(9-7)`, or a similar valid string
 
 ```js
-assert(include(answers[2], removeParentheses(solve24(testCases[2]))));
+assert(isValidSolution_(solve24(testCases_[2])));
 ```
 
-`solve24("1127")` should return a permutation of `(1+7)*(1+2)`
+`solve24("1127")` should return `(1+7)*(1+2)` or a similar valid string
 
 ```js
-assert(include(answers[3], removeParentheses(solve24(testCases[3]))));
+assert(isValidSolution_(solve24(testCases_[3])));
 ```
 
 # --seed--
@@ -68,56 +68,101 @@ assert(include(answers[3], removeParentheses(solve24(testCases[3]))));
 ## --after-user-code--
 
 ```js
-const testCases = [
+const testCases_ = [
   '4878',
   '1234',
   '6789',
   '1127'
 ];
 
-const answers = [
-  ['(7-8/8)*4', '4*(7-8/8)', '(4-8+7)*8', '(4+7-8)*8', '(7+4-8)*8', '(7-8+4)*8', '8*(4-8+7)', '8*(4+7-8)', '8*(7+4-8)', '8*(7-8+4)'],
-  ['1*2*3*4', '1*2*4*3', '1*3*2*4', '1*3*4*2', '1*4*2*3', '1*4*3*2', '2*1*3*4', '2*1*4*3', '2*3*1*4', '2*3*4*1', '2*4*3*1', '2*4*1*3', '3*1*2*4', '3*1*4*2', '3*2*1*4', '3*2*4*1', '3*4*1*2', '3*4*2*1', '4*1*2*3', '4*1*3*2', '4*2*1*3', '4*2*3*1', '4*3*1*2', '4*3*2*1', '(1+2+3)*4', '(1+3+2)*4', '(2+1+3)*4', '(2+3+1)*4', '(3+1+2)*4', '(3+2+1)*4', '4*(1+2+3)', '4*(2+1+3)', '4*(2+3+1)', '4*(3+1+2)', '4*(3+2+1)'],
-  ['(6*8)/(9-7)', '(8*6)/(9-7)', '6*8/(9-7)', '8*6/(9-7)'],
-  ['(1+7)*(2+1)', '(1+7)*(1+2)', '(1+2)*(1+7)', '(1+2)*(7+1)', '(2+1)*(1+7)', '(7+1)*(2+1)']
-];
-
-function include(ansArr, res) {
-  const index = ansArr.indexOf(res);
-  return index >= 0;
+const OPERATORS_ = {
+  "+": (a, b) => a + b,
+  "-": (a, b) => a - b,
+  "*": (a, b) => a * b,
+  "/": (a, b) => a / b,
 }
 
-//The main method for detecting single parentheses
-function removeParentheses(ans) {
-  for (let i = 0; i < ans.length; i++) {
-    if (!isNaN(ans[i])) {
-      ans = removeParenthesesHelper(ans, i);
+const PRECIDENCE_ = {
+  "+": 1,
+  "-": 1,
+  "*": 2,
+  "/": 2,
+}
+
+function evaluate_(expression) {
+  expression = expression.replace('/\s+/g', '');
+  const stack = [];
+  let postfix = "";
+
+  // Convert from infix to postfix
+  let head = 0;
+  while (head < expression.length) {
+    let c = expression[head];
+    switch (c) {
+      case "(":
+        stack.push(c);
+        break;
+      case ")":
+        let last = stack.pop();
+        while (last !== "(") {
+          postfix += last;
+          last = stack.pop();
+        }
+        break;
+      case "+":
+      case "-":
+      case "*":
+      case "/":
+        while (stack.length &&
+               PRECIDENCE_[c] <= PRECIDENCE_[stack[stack.length-1]]) {
+          postfix += stack.pop();
+        }
+        stack.push(c);
+        break;
+      case "0":
+      case "1":
+      case "2":
+      case "3":
+      case "4":
+      case "5":
+      case "6":
+      case "7":
+      case "8":
+      case "9":
+        postfix += c;
+        break;
+      default:
+        return false;
+    }
+    head++;
+  }
+
+  // Clear out stack
+  while (stack.length) {
+    postfix += stack.pop();
+  }
+
+  // Evaluate postfix
+  for (let c of postfix) {
+    switch (c) {
+      case "+":
+      case "-":
+      case "*":
+      case "/":
+        const b = +stack.pop();
+        const a = +stack.pop();
+        stack.push(OPERATORS_[c](a, b));
+        break;
+      default:
+        stack.push(c);
     }
   }
-  return ans;
+  return stack.pop();
 }
 
-//Helper to remove left and right parantheses
-function removeParenthesesHelper(ans, i) {
-  while (i > 0 && i < ans.length - 1) {
-    if (ans[i - 1] === '(' && ans[i + 1] === ')') {
-      //Paranthesis detected. Remove them.
-      ans = replaceChar(ans, '', i - 1);
-      ans = replaceChar(ans, '', i);
-      i--;
-    } else {
-      return ans;
-    }
-  }
-  return ans;
-}
-
-//Replace a character at a given index for the provided character
-function replaceChar(origString, replaceChar, index) {
-  let firstPart = origString.substr(0, index);
-  let lastPart = origString.substr(index + 1);
-  let newString = firstPart + replaceChar + lastPart;
-  return newString;
+// Check solution validity
+function isValidSolution_(userSolution) {
+  return evaluate_(userSolution) === 24;
 }
 ```
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md
index 125236ca75f..f857c18e239 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md
@@ -1,14 +1,14 @@
 ---
 id: 5949b579404977fbaefcd736
 title: 9 billion names of God the integer
-challengeType: 5
+challengeType: 1
 forumTopicId: 302219
 dashedName: 9-billion-names-of-god-the-integer
 ---
 
 # --description--
 
-This task is a variation of the [short story by Arthur C. Clarke](https://en.wikipedia.org/wiki/The Nine Billion Names of God#Plot_summary "wp: The Nine Billion Names of God#Plot_summary").
+This task is a variation of the short story by Arthur C. Clarke.
 
 (Solvers should be aware of the consequences of completing this task.)
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/accumulator-factory.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/accumulator-factory.md
index fd90df9f347..e3ee77daf90 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/accumulator-factory.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/accumulator-factory.md
@@ -1,14 +1,14 @@
 ---
 id: 594810f028c0303b75339ace
 title: Accumulator factory
-challengeType: 5
+challengeType: 1
 forumTopicId: 302222
 dashedName: accumulator-factory
 ---
 
 # --description--
 
-A problem posed by [Paul Graham](https://en.wikipedia.org/wiki/Paul_Graham_(programmer)) is that of creating a function that takes a single (numeric) argument and which returns another function that is an accumulator. The returned accumulator function in turn also takes a single numeric argument, and returns the sum of all the numeric values passed in so far to that accumulator (including the initial value passed when the accumulator was created).
+A problem posed by Paul Graham is that of creating a function that takes a single (numeric) argument and which returns another function that is an accumulator. The returned accumulator function in turn also takes a single numeric argument, and returns the sum of all the numeric values passed in so far to that accumulator (including the initial value passed when the accumulator was created).
 
 # --instructions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/ackermann-function.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/ackermann-function.md
index f80262dc40d..f6443aee8c4 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/ackermann-function.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/ackermann-function.md
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339acf
 title: Ackermann function
-challengeType: 5
+challengeType: 1
 forumTopicId: 302223
 dashedName: ackermann-function
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/align-columns.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/align-columns.md
index 2b58a1e1d86..85a1d0265f1 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/align-columns.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/align-columns.md
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339ad0
 title: Align columns
-challengeType: 5
+challengeType: 1
 forumTopicId: 302224
 dashedName: align-columns
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/amicable-pairs.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/amicable-pairs.md
index 207ab439f3f..9b582130a18 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/amicable-pairs.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/amicable-pairs.md
@@ -1,24 +1,26 @@
 ---
 id: 5949b579404977fbaefcd737
 title: Amicable pairs
-challengeType: 5
+challengeType: 1
 forumTopicId: 302225
 dashedName: amicable-pairs
 ---
 
 # --description--
 
-Two integers $N$ and $M$ are said to be [amicable pairs](https://en.wikipedia.org/wiki/Amicable numbers "wp: Amicable numbers") if $N \\neq M$ and the sum of the [proper divisors](https://rosettacode.org/wiki/Proper divisors "Proper divisors") of $N$ ($\\mathrm{sum}(\\mathrm{propDivs}(N))$) $= M$ as well as $\\mathrm{sum}(\\mathrm{propDivs}(M)) = N$.
+Two integers $N$ and $M$ are said to be amicable pairs if $N \\neq M$ and the sum of the proper divisors of $N$ ($\\mathrm{sum}(\\mathrm{propDivs}(N))$) $= M$ as well as $\\mathrm{sum}(\\mathrm{propDivs}(M)) = N$.
 
-**Example:**
+**Por ejemplo:**
 
 **1184** and **1210** are an amicable pair, with proper divisors:
 
 <ul>
-  <li>1, 2, 4, 8, 16, 32, 37, 74, 148, 296, 592  and</li>
-  <li>1, 2, 5, 10, 11, 22, 55, 110, 121, 242, 605   respectively.</li>
+  <li>1, 2, 4, 8, 16, 32, 37, 74, 148, 296, 592 and</li>
+  <li>1, 2, 5, 10, 11, 22, 55, 110, 121, 242, 605 respectively.</li>
 </ul>
 
+The sum of the divisors for the first value, **1184**, is **1210** and the sum of the divisors for the second value, **1210**, is **1184**.
+
 # --instructions--
 
 Calculate and show here the Amicable pairs below 20,000 (there are eight).
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/averages-mode.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/averages-mode.md
index 166050bd516..d65362b8929 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/averages-mode.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/averages-mode.md
@@ -1,14 +1,14 @@
 ---
 id: 594d8d0ab97724821379b1e6
 title: Averages/Mode
-challengeType: 5
+challengeType: 1
 forumTopicId: 302226
 dashedName: averagesmode
 ---
 
 # --description--
 
-Write a program to find the [mode](https://en.wikipedia.org/wiki/Mode (statistics) "wp: Mode (statistics)") value of a collection.
+Write a function `mode` to find the value that appears most in an array.
 
 The case where the collection is empty may be ignored. Care must be taken to handle the case where the mode is non-unique.
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md
index 45425141e3b..772c6fb9da1 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md
@@ -1,14 +1,14 @@
 ---
 id: 594d966a1467eb84194f0086
 title: Averages/Pythagorean means
-challengeType: 5
+challengeType: 1
 forumTopicId: 302227
 dashedName: averagespythagorean-means
 ---
 
 # --description--
 
-Compute all three of the [Pythagorean means](https://en.wikipedia.org/wiki/Pythagorean means "wp: Pythagorean means") of the set of integers $1$ through $10$ (inclusive).
+Compute all three of the <a href="https://en.wikipedia.org/wiki/Pythagorean_means" target="_blank" rel="noopener noreferrer nofollow">Pythagorean means</a> of the set of integers $1$ through $10$ (inclusive).
 
 Show that $A(x_1,\\ldots,x_n) \\geq G(x_1,\\ldots,x_n) \\geq H(x_1,\\ldots,x_n)$ for this set of positive integers.
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md
index d7bb3ef969c..f4dbbcbcca7 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md
@@ -1,18 +1,16 @@
 ---
 id: 594da033de4190850b893874
 title: Averages/Root mean square
-challengeType: 5
+challengeType: 1
 forumTopicId: 302228
 dashedName: averagesroot-mean-square
 ---
 
 # --description--
 
-Compute the [Root mean square](https://en.wikipedia.org/wiki/Root mean square "wp: Root mean square") of the numbers 1 through 10 inclusive.
+Compute the Root Mean Square (RMS) of the numbers 1 through 10 inclusive.
 
-The *root mean square* is also known by its initials RMS (or rms), and as the **quadratic mean**.
-
-The RMS is calculated as the mean of the squares of the numbers, square-rooted:
+The <abbr title="Root mean square">RMS</abbr> is calculated by taking the square root of the mean of the squares of the numbers, given by the equation:
 
 $$x\_{\\mathrm{rms}} = \\sqrt {{{x_1}^2 + {x_2}^2 + \\cdots + {x_n}^2} \\over n}. $$
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/babbage-problem.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/babbage-problem.md
index 27054cccc54..aa9d6f54100 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/babbage-problem.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/babbage-problem.md
@@ -1,14 +1,14 @@
 ---
 id: 594db4d0dedb4c06a2a4cefd
 title: Babbage problem
-challengeType: 5
+challengeType: 1
 forumTopicId: 302229
 dashedName: babbage-problem
 ---
 
 # --description--
 
-[Charles Babbage](https://en.wikipedia.org/wiki/Charles_Babbage "wp: Charles_Babbage"), looking ahead to the sorts of problems his Analytical Engine would be able to solve, gave this example:
+Charles Babbage, looking ahead to the sorts of problems his Analytical Engine would be able to solve, gave this example:
 
 <blockquote>
   What is the smallest positive integer whose square ends in the digits 269,696?
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/balanced-brackets.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/balanced-brackets.md
index 5045fbd2cad..d56013eea8f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/balanced-brackets.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/balanced-brackets.md
@@ -1,7 +1,7 @@
 ---
 id: 594dc6c729e5700999302b45
 title: Balanced brackets
-challengeType: 5
+challengeType: 1
 forumTopicId: 302230
 dashedName: balanced-brackets
 ---
@@ -10,15 +10,15 @@ dashedName: balanced-brackets
 
 Determine whether a generated string of brackets is balanced; that is, whether it consists entirely of pairs of opening/closing brackets (in that order), none of which mis-nest.
 
-**Examples:**
-| Input                     | Output |
-| ------------------------- | ------ |
-| <code>\[]</code> | true   |
-| <code>]\[</code> | false  |
-| <code>[][]</code> | true   |
-| <code>]\[]</code> | false  |
-| <code>\[]]\[\[]</code> | false  |
-| <code>\[\[\[\[]]]]</code> | true   |
+**Ejemplos:**
+| Input                     | Resultado |
+| ------------------------- | --------- |
+| <code>\[]</code> | true      |
+| <code>]\[</code> | false     |
+| <code>[][]</code> | true      |
+| <code>]\[]</code> | false     |
+| <code>\[]]\[\[]</code> | false     |
+| <code>\[\[\[\[]]]]</code> | true      |
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md
index bbd910fb6c5..2254ea4c44a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md
@@ -1,7 +1,7 @@
 ---
 id: 5951815dd895584b06884620
 title: Circles of given radius through two points
-challengeType: 5
+challengeType: 1
 forumTopicId: 302231
 dashedName: circles-of-given-radius-through-two-points
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/closest-pair-problem.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/closest-pair-problem.md
index 9221d424b31..06259fbc6a1 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/closest-pair-problem.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/closest-pair-problem.md
@@ -1,7 +1,7 @@
 ---
 id: 5951a53863c8a34f02bf1bdc
 title: Closest-pair problem
-challengeType: 5
+challengeType: 1
 forumTopicId: 302232
 dashedName: closest-pair-problem
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/combinations.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/combinations.md
index 27e9a3fa6d4..04a9f0fb01d 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/combinations.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/combinations.md
@@ -1,7 +1,7 @@
 ---
 id: 5958469238c0d8d2632f46db
 title: Combinations
-challengeType: 5
+challengeType: 1
 forumTopicId: 302233
 dashedName: combinations
 ---
@@ -10,7 +10,7 @@ dashedName: combinations
 
 Given non-negative integers `m` and `n`, generate all size `m` combinations of the integers from `0` (zero) to `n-1` in sorted order (each combination is sorted and the entire table is sorted).
 
-**Example:**
+**Por ejemplo:**
 
 `3` comb `5` is:
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/comma-quibbling.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/comma-quibbling.md
index 6223a523cee..28053f80b67 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/comma-quibbling.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/comma-quibbling.md
@@ -1,14 +1,14 @@
 ---
 id: 596e414344c3b2872167f0fe
 title: Comma quibbling
-challengeType: 5
+challengeType: 1
 forumTopicId: 302234
 dashedName: comma-quibbling
 ---
 
 # --description--
 
-Comma quibbling is a task originally set by Eric Lippert in his [blog](https://blogs.msdn.com/b/ericlippert/archive/2009/04/15/comma-quibbling.aspx).
+<a href="https://rosettacode.org/wiki/Comma_quibbling" target="_blank" rel="noopener noreferrer nofollow">Comma quibbling</a> is a task originally set by Eric Lippert in his blog.
 
 # --instructions--
 
@@ -52,19 +52,19 @@ assert(typeof quibble(['ABC']) === 'string');
 assert.equal(quibble(testCases[0]), results[0]);
 ```
 
-`quibble(["ABC"])` should return "{ABC}".
+`quibble(["ABC"])` should return `"{ABC}"`.
 
 ```js
 assert.equal(quibble(testCases[1]), results[1]);
 ```
 
-`quibble(["ABC", "DEF"])` should return "{ABC and DEF}".
+`quibble(["ABC", "DEF"])` should return `"{ABC and DEF}"`.
 
 ```js
 assert.equal(quibble(testCases[2]), results[2]);
 ```
 
-`quibble(["ABC", "DEF", "G", "H"])` should return "{ABC,DEF,G and H}".
+`quibble(["ABC", "DEF", "G", "H"])` should return `"{ABC, DEF, G and H}"`.
 
 ```js
 assert.equal(quibble(testCases[3]), results[3]);
@@ -76,7 +76,7 @@ assert.equal(quibble(testCases[3]), results[3]);
 
 ```js
 const testCases = [[], ["ABC"], ["ABC", "DEF"], ["ABC", "DEF", "G", "H"]];
-const results = ["{}", "{ABC}", "{ABC and DEF}", "{ABC,DEF,G and H}"];
+const results = ["{}", "{ABC}", "{ABC and DEF}", "{ABC, DEF, G and H}"];
 ```
 
 ## --seed-contents--
@@ -93,7 +93,7 @@ function quibble(words) {
 ```js
 function quibble(words) {
   return "{" +
-    words.slice(0, words.length - 1).join(",") +
+    words.slice(0, words.length - 1).join(", ") +
    (words.length > 1 ? " and " : "") +
    (words[words.length - 1] || '') +
   "}";
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
index 313cda7dcc3..df465f24694 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
@@ -1,14 +1,20 @@
 ---
 id: 596e457071c35c882915b3e4
 title: Compare a list of strings
-challengeType: 5
+challengeType: 1
 forumTopicId: 302235
 dashedName: compare-a-list-of-strings
 ---
 
 # --description--
 
-Given a [list](https://en.wikipedia.org/wiki/List_(abstract_data_type) "wp: List\_(abstract_data_type)") of arbitrarily many strings, implement a function for each of the following conditions:
+A list is a ordered set of values that may contain duplicates. Here is an example:
+
+```js
+const list = [['AA',  'BB', 'CC'], ['AA', 'ACB', 'AA'], [], ['AA']];
+```
+
+Given a list of arbitrarily many strings, implement a function for each of the following conditions:
 
 <ul>
   <li>test if they are all lexically equal</li>
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md
index e050e0d7d2a..683a565c301 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md
@@ -1,7 +1,7 @@
 ---
 id: 596fd036dc1ab896c5db98b1
 title: Convert seconds to compound duration
-challengeType: 5
+challengeType: 1
 forumTopicId: 302236
 dashedName: convert-seconds-to-compound-duration
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/count-occurrences-of-a-substring.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/count-occurrences-of-a-substring.md
index 50d6c16f8dd..c3274154b40 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/count-occurrences-of-a-substring.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/count-occurrences-of-a-substring.md
@@ -1,7 +1,7 @@
 ---
 id: 596fda99c69f779975a1b67d
 title: Count occurrences of a substring
-challengeType: 5
+challengeType: 1
 forumTopicId: 302237
 dashedName: count-occurrences-of-a-substring
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/count-the-coins.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/count-the-coins.md
index 3e6bd14d1d6..3e75b21eac4 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/count-the-coins.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/count-the-coins.md
@@ -1,14 +1,14 @@
 ---
 id: 59713bd26bdeb8a594fb9413
 title: Count the coins
-challengeType: 5
+challengeType: 1
 forumTopicId: 302238
 dashedName: count-the-coins
 ---
 
 # --description--
 
-There are four types of common coins in [US](https://en.wikipedia.org/wiki/United_States) currency:
+There are four types of common coins in US currency:
 
 <ul>
   <li>quarters (25 cents)</li>
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/cramers-rule.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/cramers-rule.md
index 7580e28c50e..2d612f0a7f2 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/cramers-rule.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/cramers-rule.md
@@ -1,16 +1,20 @@
 ---
 id: 59713da0a428c1a62d7db430
 title: Cramer's rule
-challengeType: 5
+challengeType: 1
 forumTopicId: 302239
 dashedName: cramers-rule
 ---
 
 # --description--
 
-In [linear algebra](https://en.wikipedia.org/wiki/linear algebra "wp: linear algebra"), [Cramer's rule](https://en.wikipedia.org/wiki/Cramer's rule "wp: Cramer's rule") is an explicit formula for the solution of a [system of linear equations](https://en.wikipedia.org/wiki/system of linear equations "wp: system of linear equations") with as many equations as unknowns, valid whenever the system has a unique solution. It expresses the solution in terms of the determinants of the (square) coefficient matrix and of matrices obtained from it by replacing one column by the vector of right hand sides of the equations.
+<a href="https://rosettacode.org/wiki/Cramer%27s_rule" target="_blank" rel="noopener noreferrer nofollow">Cramer's rule</a> is a formula for solving a system of linear equations by using the determinants of matrices formed from subsets of the coefficients and right hand side values.
 
-Given
+The determinant of a matrix with 2 rows and two columns is given by:
+
+$\begin{aligned}|A|={\begin{vmatrix}a&b\\\c&d\end{vmatrix}}=ad-bc.\end{aligned}$
+
+Given a system of linear equations:
 
 $\\left\\{\\begin{matrix}a_1x + b_1y + c_1z&= {\\color{red}d_1}\\\\a_2x + b_2y + c_2z&= {\\color{red}d_2}\\\\a_3x + b_3y + c_3z&= {\\color{red}d_3}\\end{matrix}\\right.$
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/cusip.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/cusip.md
index 0daefa32937..b74ce598f4a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/cusip.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/cusip.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7e05
 title: CUSIP
-challengeType: 5
+challengeType: 1
 forumTopicId: 302241
 dashedName: cusip
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/cut-a-rectangle.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/cut-a-rectangle.md
index 74e9412a08a..446e3fddf1f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/cut-a-rectangle.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/cut-a-rectangle.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7e06
 title: Cut a rectangle
-challengeType: 5
+challengeType: 1
 forumTopicId: 302242
 dashedName: cut-a-rectangle
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/date-format.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/date-format.md
index 7db6dbebb18..1d5f06010c2 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/date-format.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/date-format.md
@@ -1,7 +1,7 @@
 ---
 id: 59669d08d75b60482359409f
 title: Date format
-challengeType: 5
+challengeType: 1
 forumTopicId: 302243
 dashedName: date-format
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/date-manipulation.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/date-manipulation.md
index 3412cd12fda..8c9e853bb80 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/date-manipulation.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/date-manipulation.md
@@ -1,7 +1,7 @@
 ---
 id: 5966c21cf732a95f1b67dd28
 title: Date manipulation
-challengeType: 5
+challengeType: 1
 forumTopicId: 302244
 dashedName: date-manipulation
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/day-of-the-week.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/day-of-the-week.md
index 0260694251c..e41d1e48dae 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/day-of-the-week.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/day-of-the-week.md
@@ -1,7 +1,7 @@
 ---
 id: 5966f99c45e8976909a85575
 title: Day of the week
-challengeType: 5
+challengeType: 1
 forumTopicId: 302245
 dashedName: day-of-the-week
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md
index f9989155956..83aaa94d7f3 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md
@@ -1,18 +1,18 @@
 ---
 id: 59694356a6e7011f7f1c5f4e
 title: Deal cards for FreeCell
-challengeType: 5
+challengeType: 1
 forumTopicId: 302246
 dashedName: deal-cards-for-freecell
 ---
 
 # --description--
 
-*FreeCell* is the solitaire card game that Paul Alfille introduced to the PLATO system in 1978. Jim Horne, at Microsoft, changed the name to FreeCell and reimplemented the game for [DOS](https://rosettacode.org/wiki/DOS "DOS"), then [Windows](https://rosettacode.org/wiki/Windows "Windows"). This version introduced 32000 numbered deals.
+*FreeCell* is the solitaire card game that Paul Alfille introduced to the PLATO system in 1978. Jim Horne, at Microsoft, changed the name to FreeCell and reimplemented the game for DOS, then Windows. This version introduced 32000 numbered deals.
 
 As the game became popular, Jim Horne disclosed the algorithm, and other implementations of FreeCell began to reproduce the Microsoft deals. These deals are numbered from 1 to 32000. Newer versions from Microsoft have 1 million deals, numbered from 1 to 1000000; some implementations allow numbers outside that range.
 
-The algorithm uses this [linear congruential generator](https://rosettacode.org/wiki/linear congruential generator "linear congruential generator") from Microsoft C:
+The algorithm uses this linear congruential generator from Microsoft C:
 
 <ul>
   <li>$state_{n + 1} \equiv 214013 \times state_n + 2531011 \pmod{2^{31}}$</li>
@@ -20,11 +20,11 @@ The algorithm uses this [linear congruential generator](https://rosettacode.org/
   <li>$rand_n$ is in range 0 to 32767.</li>
 </ul>
 
-The algorithm follows:
+A continuación el algoritmo:
 
 <ol>
   <li>Seed the RNG with the number of the deal.
-  </li><li>Create an <a href='https://rosettacode.org/wiki/array' title='array' target='_blank'>array</a> of 52 cards: Ace of Clubs, Ace of Diamonds, Ace of Hearts, Ace of Spades, 2 of Clubs, 2 of Diamonds, and so on through the ranks: Ace, 2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King. The array indexes are 0 to 51, with Ace of Clubs at 0, and King of Spades at 51.</li>
+  </li><li>Create an array of 52 cards: Ace of Clubs, Ace of Diamonds, Ace of Hearts, Ace of Spades, 2 of Clubs, 2 of Diamonds, and so on through the ranks: Ace, 2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King. The array indexes are 0 to 51, with Ace of Clubs at 0, and King of Spades at 51.</li>
   <li>Until the array is empty:</li>
   <li>Choose a random card at index ≡ next random number (mod array length).</li>
     <ul>
@@ -35,7 +35,7 @@ The algorithm follows:
   <li>Deal all 52 cards, face up, across 8 columns. The first 8 cards go in 8 columns, the next 8 cards go on the first 8 cards, and so on.</li>
 </ol>
 
-**Example:**
+**Por ejemplo:**
 
 **Order to deal cards**
 
@@ -61,7 +61,7 @@ The algorithm follows:
 ]
 ```
 
-**Game #617**
+**Juego nº 617**
 
 ```js
 [
@@ -79,8 +79,6 @@ The algorithm follows:
 
 Write a function to take a deal number and deal cards in the same order as this algorithm. The function must return a two dimensional array representing the FreeCell board.
 
-Deals can also be checked against [FreeCell solutions to 1000000 games](https://freecellgamesolutions.com/). (Summon a video solution, and it displays the initial deal.)
-
 # --hints--
 
 `dealFreeCell` should be a function.
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/deepcopy.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/deepcopy.md
index 24b950d8d55..dc7666cee51 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/deepcopy.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/deepcopy.md
@@ -1,7 +1,7 @@
 ---
 id: 596a8888ab7c01048de257d5
 title: Deepcopy
-challengeType: 5
+challengeType: 1
 forumTopicId: 302247
 dashedName: deepcopy
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/define-a-primitive-data-type.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/define-a-primitive-data-type.md
index 2bc3f2dd1b7..e7909424694 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/define-a-primitive-data-type.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/define-a-primitive-data-type.md
@@ -1,7 +1,7 @@
 ---
 id: 597089c87eec450c68aa1643
 title: Define a primitive data type
-challengeType: 5
+challengeType: 1
 forumTopicId: 302248
 dashedName: define-a-primitive-data-type
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/department-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/department-numbers.md
index 0eba1bec54a..1117963ac08 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/department-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/department-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 59f40b17e79dbf1ab720ed7a
 title: Department Numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 302249
 dashedName: department-numbers
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/discordian-date.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/discordian-date.md
index 811a3b867ec..bff43ccc37e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/discordian-date.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/discordian-date.md
@@ -1,14 +1,31 @@
 ---
 id: 59f4eafba0343628bb682785
 title: Discordian date
-challengeType: 5
+challengeType: 1
 forumTopicId: 302250
 dashedName: discordian-date
 ---
 
 # --description--
+The Gregorian calendar is a solar calendar with 12 months of 28-31 days each. A week consists of seven days, and there are 52 weeks and 1 day per year. The year consists of 365 days with a leap day added to February every leap year. A leap year occurs every four years, except for the first three centurial years of every 400 years.
 
-Convert a given date from the [Gregorian calendar](https://en.wikipedia.org/wiki/Gregorian calendar "wp: Gregorian calendar") to the [Discordian calendar](https://en.wikipedia.org/wiki/Discordian calendar "wp: Discordian calendar").
+The <a href="http://www.rosettacode.org/wiki/Discordian_date" target="_blank" rel="noopener noreferrer nofollow">Discordian calendar</a> is aligned with the Gregorian calendar, and begins on January 1. The week consists of five days, and there are 73 weeks per year. The year also consists of 365 days, with an extra day inserted between Chaos 59 and Chaos 60 every leap year.
+
+The months, weekdays, Apostle events, and Holidays in the Discordian calendar are given by:
+
+Seasons: `'Chaos', 'Discord', 'Confusion', 'Bureaucracy', 'The Aftermath'`.
+
+Weekdays: `'Sweetmorn', 'Boomtime', 'Pungenday', 'Prickle-Prickle', 'Setting Orange'`.
+
+Apostle: `'Mungday', 'Mojoday', 'Syaday', 'Zaraday', 'Maladay'`.
+
+Holidays: `'Chaoflux', 'Discoflux', 'Confuflux', 'Bureflux', 'Afflux'`.
+
+# --instructions--
+
+Convert a given date from the Gregorian calendar to the Discordian calendar.
+
+Note that the day Chaos 1, 3188 YOLD in the Discordian calendar is the day January 1, 2022 in the Gregorian calendar.
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/dot-product.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/dot-product.md
index c1c61d1b124..0e0fb5c838a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/dot-product.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/dot-product.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7e1e
 title: Dot product
-challengeType: 5
+challengeType: 1
 forumTopicId: 302251
 dashedName: dot-product
 ---
 
 # --description--
 
-Create a function, to compute the **[dot product](https://en.wikipedia.org/wiki/Dot product)**, also known as the **scalar product** of two vectors.
+Create a function, to compute the **dot product**, also known as the **scalar product** of two vectors.
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/element-wise-operations.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/element-wise-operations.md
index 52a15c8d11d..8f4b6d005a7 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/element-wise-operations.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/element-wise-operations.md
@@ -1,7 +1,7 @@
 ---
 id: 599c333915e0ea32d04d4bec
 title: Element-wise operations
-challengeType: 5
+challengeType: 1
 forumTopicId: 302252
 dashedName: element-wise-operations
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/emirp-primes.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/emirp-primes.md
index 564476da7a7..97240396a41 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/emirp-primes.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/emirp-primes.md
@@ -1,7 +1,7 @@
 ---
 id: 599d0ba974141b0f508b37d5
 title: Emirp primes
-challengeType: 5
+challengeType: 1
 forumTopicId: 302253
 dashedName: emirp-primes
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/entropy.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/entropy.md
index 75d61ccc5d9..672471fa8d3 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/entropy.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/entropy.md
@@ -1,60 +1,60 @@
 ---
 id: 599d15309e88c813a40baf58
 title: Entropy
-challengeType: 5
+challengeType: 1
 forumTopicId: 302254
 dashedName: entropy
 ---
 
 # --description--
 
-Calculate the Shannon entropy H of a given input string.
+Calcula la Shannon entropy H de la entrada de una string dada.
 
-Given the discreet random variable $X$ that is a string of $N$ "symbols" (total characters) consisting of $n$ different characters (n=2 for binary), the Shannon entropy of X in bits/symbol is:
+Dada la variable aleatoria discreta $X$ que es un string de $N$ "símbolos" (caracteres totales) constando de $n$ caracteres diferentes (n=2 para binario), la Shannon entropy de X en bits/symbol es:
 
 $H_2(X) = -\\sum\_{i=1}^n \\frac{count_i}{N} \\log_2 \\left(\\frac{count_i}{N}\\right)$
 
-where $count_i$ is the count of character $n_i$.
+donde $count_i$ es el conteo de caracteres $n_i$.
 
 # --hints--
 
-`entropy` should be a function.
+`entropy` debiera ser una función.
 
 ```js
 assert(typeof entropy === 'function');
 ```
 
-`entropy("0")` should return `0`
+`entropy("0")` debería regresar `0`
 
 ```js
 assert.equal(entropy('0'), 0);
 ```
 
-`entropy("01")` should return `1`
+`entropy("01")` debería regresar `1`
 
 ```js
 assert.equal(entropy('01'), 1);
 ```
 
-`entropy("0123")` should return `2`
+`entropy("0123")` debería regresar `2`
 
 ```js
 assert.equal(entropy('0123'), 2);
 ```
 
-`entropy("01234567")` should return `3`
+`entropy("01234567")` debería regresar `3`
 
 ```js
 assert.equal(entropy('01234567'), 3);
 ```
 
-`entropy("0123456789abcdef")` should return `4`
+`entropy("0123456789abcdef")` debería regresar `4`
 
 ```js
 assert.equal(entropy('0123456789abcdef'), 4);
 ```
 
-`entropy("1223334444")` should return `1.8464393446710154`
+`entropy("1223334444")` debería regresar `1.8464393446710154`
 
 ```js
 assert.equal(entropy('1223334444'), 1.8464393446710154);
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/equilibrium-index.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/equilibrium-index.md
index a7a33f9d37a..2076d7d75b0 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/equilibrium-index.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/equilibrium-index.md
@@ -1,7 +1,7 @@
 ---
 id: 5987fd532b954e0f21b5d3f6
 title: Equilibrium index
-challengeType: 5
+challengeType: 1
 forumTopicId: 302255
 dashedName: equilibrium-index
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/ethiopian-multiplication.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/ethiopian-multiplication.md
index a6d1c4cb349..a46d599aa1b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/ethiopian-multiplication.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/ethiopian-multiplication.md
@@ -1,7 +1,7 @@
 ---
 id: 599d1566a02b571412643b84
 title: Ethiopian multiplication
-challengeType: 5
+challengeType: 1
 forumTopicId: 302257
 dashedName: ethiopian-multiplication
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/euler-method.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/euler-method.md
index 4a17c09a25d..1b9823df6c2 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/euler-method.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/euler-method.md
@@ -1,14 +1,14 @@
 ---
 id: 59880443fb36441083c6c20e
 title: Euler method
-challengeType: 5
+challengeType: 1
 forumTopicId: 302258
 dashedName: euler-method
 ---
 
 # --description--
 
-Euler's method numerically approximates solutions of first-order ordinary differential equations (ODEs) with a given initial value. It is an explicit method for solving initial value problems (IVPs), as described in [the wikipedia page](https://en.wikipedia.org/wiki/Euler method "wp: Euler method").
+Euler's method numerically approximates solutions of first-order ordinary differential equations (ODEs) with a given initial value. It is an explicit method for solving initial value problems (IVPs), as described in <a href="https://www.freecodecamp.org/news/eulers-method-explained-with-examples/" title="Euler's Method Explained with Examples" target="_blank" rel="noopener noreferrer nofollow">this article</a>.
 
 The ODE has to be provided in the following form:
 
@@ -56,7 +56,7 @@ Newton's cooling law describes how an object of initial temperature $T(t_0) = T_
   <li><big>$\frac{dT(t)}{dt} = -k \, \Delta T$</big></li>
 </ul>
 
-or
+o
 
 <ul style='list-style: none;'>
   <li><big>$\frac{dT(t)}{dt} = -k \, (T(t) - T_R)$</big></li>
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/evaluate-binomial-coefficients.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/evaluate-binomial-coefficients.md
index 5b48751996c..30eeec21ba6 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/evaluate-binomial-coefficients.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/evaluate-binomial-coefficients.md
@@ -1,7 +1,7 @@
 ---
 id: 598de241872ef8353c58a7a2
 title: Evaluate binomial coefficients
-challengeType: 5
+challengeType: 1
 forumTopicId: 302259
 dashedName: evaluate-binomial-coefficients
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md
index cdc024dab4e..a3b6ac3e5ca 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md
@@ -1,183 +1,115 @@
 ---
 id: 59e09e6d412c5939baa02d16
-title: Execute a Markov algorithm
-challengeType: 5
+title: Ejecuta un algoritmo de Markov
+challengeType: 1
 forumTopicId: 302260
 dashedName: execute-a-markov-algorithm
 ---
 
 # --description--
 
-Create an interpreter for a [Markov Algorithm](https://en.wikipedia.org/wiki/Markov algorithm "wp: Markov algorithm").
+Los conceptos de Markov son utilizados en máquinas de aprendizaje, porque es una simple aproximación en la manipulación de datos. Con un número fijo de `rules` puedes manipular `data` dados para crear una deseada `output`.
 
-Rules have the syntax:
+Hemos añadido en segundo plano:
 
-<pre>[ruleset] ::= (([comment] | [rule]) [newline]+)*
-[comment] ::= # {[any character]}
-[rule] ::= [pattern] [whitespace] -> [whitespace] [.] [replacement]
-[whitespace] ::= ([tab] | [space]) [[whitespace]]
-</pre>
+Las `rules` en forma de arreglo anidado y los `data` también en forma de arregloY los `outputs` deseadas.
 
-There is one rule per line.
+Las `rules`:
 
-If there is a `.` (period) present before the \[replacement], then this is a terminating rule in which case the interpreter must halt execution.
+```js
+let rules=[
+[
+"A -> apple","B -> bag","S -> shop","T -> the",
+"the shop -> my brother","a never used -> .terminating rule"
+],
 
-A ruleset consists of a sequence of rules, with optional comments.
+[
+ "A -> apple","B -> bag","S -> .shop","T -> the",
+ "the shop -> my brother","a never used -> .terminating rule"
+],
 
-Rulesets
+[
+ "A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag",
+ "->.* -> money","W -> WW","S -> .shop","T -> the",
+ "the shop -> my brother","a never used -> .terminating rule"
+],
 
-Use the following tests on entries:
+[
+ "_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX",
+ "X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y",
+ "1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "
+],
 
-**Ruleset 1:**
+[
+"A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11",
+"B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"
+]
 
-<pre># This rules file is extracted from Wikipedia:
-# <code>http://en.wikipedia.org/wiki/Markov_Algorithm</code>
-A -> apple
-B -> bag
-S -> shop
-T -> the
-the shop -> my brother
-a never used -> .terminating rule
-</pre>
+];
+```
 
-Sample text of `I bought a B of As from T S.` should generate the output `I bought a bag of apples from my brother.`
+Los `data`:
 
-**Ruleset 2:**
+```js
+let data=[
+        "I bought a B of As from T S.",
+        "I bought a B of As from T S.",
+        "I bought a B of As W my Bgage from T S.",
+        "_1111*11111_",
+        "000000A000000"
+        ];
+```
 
-A test of the terminating rule
+Las `outputs`:
 
-<pre># Slightly modified from the rules on Wikipedia
-A -> apple
-B -> bag
-S -> .shop
-T -> the
-the shop -> my brother
-a never used -> .terminating rule
-</pre>
+```js
+let outputs=[
+    "I bought a bag of apples from my brother.",
+    "I bought a bag of apples from T shop.",
+    "I bought a bag of apples with my money from T shop.",
+    "11111111111111111111",
+    "00011H1111000"
+    ]
+```
 
-Sample text of `I bought a B of As from T S.` should generate `I bought a bag of apples from T shop.`
-
-**Ruleset 3:**
-
-This tests for correct substitution order and may trap simple regexp based replacement routines if special regexp characters are not escaped.
-
-<pre># BNF Syntax testing rules
-A -> apple
-WWWW -> with
-Bgage -> ->.*
-B -> bag
-->.* -> money
-W -> WW
-S -> .shop
-T -> the
-the shop -> my brother
-a never used -> .terminating rule
-</pre>
-
-Sample text of `I bought a B of As W my Bgage from T S.` should generate `I bought a bag of apples with my money from T shop.`
-
-**Ruleset 4:**
-
-This tests for correct order of scanning of rules, and may trap replacement routines that scan in the wrong order. It implements a general unary multiplication engine. (Note that the input expression must be placed within underscores in this implementation.)
-
-<pre>### Unary Multiplication Engine, for testing Markov Algorithm implementations
-### By Donal Fellows.
-# Unary addition engine
-_+1 -> _1+
-1+1 -> 11+
-# Pass for converting from the splitting of multiplication into ordinary
-# addition
-1! -> !1
-,! -> !+
-_! -> _
-# Unary multiplication by duplicating left side, right side times
-1*1 -> x,@y
-1x -> xX
-X, -> 1,1
-X1 -> 1X
-_x -> _X
-,x -> ,X
-y1 -> 1y
-y_ -> _
-# Next phase of applying
-1@1 -> x,@y
-1@_ -> @_
-,@_ -> !_
-++ -> +
-# Termination cleanup for addition
-_1 -> 1
-1+_ -> 1
-_+_ ->
-</pre>
-
-Sample text of `_1111*11111_` should generate the output `11111111111111111111`
-
-**Ruleset 5:**
-
-A simple [Turing machine](http://en.wikipedia.org/wiki/Turing_machine "link: http&#x3A;//en.wikipedia.org/wiki/Turing_machine"), implementing a three-state [busy beaver](http://en.wikipedia.org/wiki/Busy_beaver "link: http&#x3A;//en.wikipedia.org/wiki/Busy_beaver").
-
-The tape consists of `0`s and `1`s, the states are `A`, `B`, `C` and `H` (for `H`alt), and the head position is indicated by writing the state letter before the character where the head is. All parts of the initial tape the machine operates on have to be given in the input.
-
-Besides demonstrating that the Markov algorithm is Turing-complete, it also made me catch a bug in the C++ implementation which wasn't caught by the first four rulesets.
-
-<pre># Turing machine: three-state busy beaver
-#
-# state A, symbol 0 => write 1, move right, new state B
-A0 -> 1B
-# state A, symbol 1 => write 1, move left, new state C
-0A1 -> C01
-1A1 -> C11
-# state B, symbol 0 => write 1, move left, new state A
-0B0 -> A01
-1B0 -> A11
-# state B, symbol 1 => write 1, move right, new state B
-B1 -> 1B
-# state C, symbol 0 => write 1, move left, new state B
-0C0 -> B01
-1C0 -> B11
-# state C, symbol 1 => write 1, move left, halt
-0C1 -> H01
-1C1 -> H11
-</pre>
-
-This ruleset should turn `000000A000000` into `00011H1111000`
+Usando el algoritmo de Markov, cambia los `data` a los `outputs` deseados, usando las `rules` proporcionadas.
 
 # --hints--
 
-`markov` should be a function.
+`markov` debe ser una función.
 
 ```js
 assert(typeof markov === 'function');
 ```
 
-`markov(["A -> apple","B -> bag","S -> shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` should return "I bought a bag of apples from my brother.".
+`markov(["A -> apple","B -> bag","S -> shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` debe devolver el "string" `I bought a bag of apples from my brother.`, que traducido sería "Yo compre una bolsa de manzanas a mi hermano".
 
 ```js
-assert.deepEqual(markov(rules[0], tests[0]), outputs[0]);
+assert.deepEqual(markov(rules[0], datas[0]), outputs[0]);
 ```
 
-`markov(["A -> apple","B -> bag","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` should return "I bought a bag of apples from T shop.".
+`markov(["A -> apple","B -> bag","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` debe devolver el string `I bought a bag of apples from T shop.`. que traducido sería "Compré una bolsa de manzanas de la tienda T".
 
 ```js
-assert.deepEqual(markov(rules[1], tests[1]), outputs[1]);
+assert.deepEqual(markov(rules[1], datas[1]), outputs[1]);
 ```
 
-`markov(["A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag","->.* -> money","W -> WW","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As W my Bgage from T S.")` should return "I bought a bag of apples with my money from T shop.".
+`markov(["A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag","->.* -> money","W -> WW","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As W my Bgage from T S.")` debería devolver el string `I bought a bag of apples with my money from T shop.`, que traducido sería "Yo compre una bolsa de manzanas con mi dinero de la tienda T".
 
 ```js
-assert.deepEqual(markov(rules[2], tests[2]), outputs[2]);
+assert.deepEqual(markov(rules[2], datas[2]), outputs[2]);
 ```
 
-`markov(["_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX","X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y","1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "],"_1111*11111_")` should return "11111111111111111111".
+`markov(["_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX","X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y","1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "],"_1111*11111_")` should return the string `11111111111111111111`.
 
 ```js
-assert.deepEqual(markov(rules[3], tests[3]), outputs[3]);
+assert.deepEqual(markov(rules[3], datas[3]), outputs[3]);
 ```
 
-`markov(["A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11","B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"],"")` should return "00011H1111000".
+`markov(["A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11","B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"],"")` should return the string `00011H1111000`.
 
 ```js
-assert.deepEqual(markov(rules[4], tests[4]), outputs[4]);
+assert.deepEqual(markov(rules[4], datas[4]), outputs[4]);
 ```
 
 # --seed--
@@ -191,7 +123,7 @@ let rules=[["A -> apple","B -> bag","S -> shop","T -> the","the shop -> my broth
             ["A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag","->.* -> money","W -> WW","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],
             ["_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX","X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y","1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "],
             ["A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11","B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"]];
-let tests=["I bought a B of As from T S.",
+let datas=["I bought a B of As from T S.",
             "I bought a B of As from T S.",
             "I bought a B of As W my Bgage from T S.",
             "_1111*11111_",
@@ -208,7 +140,7 @@ let outputs=["I bought a bag of apples from my brother.",
 ## --seed-contents--
 
 ```js
-function markov(rules,test) {
+function markov(rules,data) {
 
 }
 ```
@@ -216,9 +148,9 @@ function markov(rules,test) {
 # --solutions--
 
 ```js
-function markov(rules,test) {
+function markov(rules,data) {
     let pattern = new RegExp("^([^#]*?)\\s+->\\s+(\\.?)(.*)");
-    let origTest = test;
+    let origData = data;
 
     let captures = [];
 
@@ -229,18 +161,18 @@ function markov(rules,test) {
         captures.push(m);
     });
 
-    test = origTest;
-    let copy = test;
+    data = origData;
+    let copy = data;
     for (let j = 0; j < captures.length; j++) {
         let c = captures[j];
-        test = test.replace(c[0], c[2]);
+        data = data.replace(c[0], c[2]);
         if (c[1]==".")
             break;
-        if (test!=copy) {
+        if (data!=copy) {
             j = -1;
-            copy = test;
+            copy = data;
         }
     }
-    return test;
+    return data;
 }
 ```
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/execute-brain.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/execute-brain.md
index 7504589e582..4a9c7e648c3 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/execute-brain.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/execute-brain.md
@@ -1,7 +1,7 @@
 ---
 id: 59e0a8df964e4540d5abe599
 title: Execute Brain****
-challengeType: 5
+challengeType: 1
 forumTopicId: 302261
 dashedName: execute-brain
 ---
@@ -10,21 +10,21 @@ dashedName: execute-brain
 
 Write a function to implement a Brain\*\*\*\* interpreter. The function will take a string as a parameter and should return a string as the output. More details are given below:
 
-RCBF is a set of [Brainf\*\*\*](https://rosettacode.org/wiki/Brainf*** "Brainf\*\*\*") compilers and interpreters written for Rosetta Code in a variety of languages.
+RCBF is a set of <a href="https://rosettacode.org/wiki/Brainf***" target="_blank" rel="noopener noreferrer nofollow">Brainf\*\*\*</a> compilers and interpreters written for Rosetta Code in a variety of languages.
 
 Below are links to each of the versions of RCBF.
 
 An implementation need only properly implement the following instructions:
 
-| Command                   | Description                                                                                |
-| ------------------------- | ------------------------------------------------------------------------------------------ |
-| <code>></code> | Move the pointer to the right                                                              |
-| <code>&lt;</code> | Move the pointer to the left                                                               |
-| <code>+</code> | Increment the memory cell under the pointer                                                |
-| <code>-</code> | Decrement the memory cell under the pointer                                                |
-| <code>.</code> | Output the character signified by the cell at the pointer                                  |
-| <code>,</code> | Input a character and store it in the cell at the pointer                                  |
-| <code>\[</code> | Jump past the matching <code>]</code> if the cell under the pointer is 0          |
+| Command                   | Descripción                                                                                 |
+| ------------------------- | ------------------------------------------------------------------------------------------- |
+| <code>></code> | Move the pointer to the right                                                               |
+| <code>&lt;</code> | Move the pointer to the left                                                                |
+| <code>+</code> | Increment the memory cell under the pointer                                                 |
+| <code>-</code> | Decrement the memory cell under the pointer                                                 |
+| <code>.</code> | Output the character signified by the cell at the pointer                                   |
+| <code>,</code> | Input a character and store it in the cell at the pointer                                   |
+| <code>\[</code> | Jump past the matching <code>]</code> if the cell under the pointer is 0           |
 | <code>]</code> | Jump back to the matching <code>\[</code> if the cell under the pointer is nonzero |
 
 Any cell size is allowed, EOF (*E*nd-*O*-*F*ile) support is optional, as is whether you have bounded or unbounded memory.
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/extensible-prime-generator.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/extensible-prime-generator.md
index 620da453ffe..d1f52b54af1 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/extensible-prime-generator.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/extensible-prime-generator.md
@@ -1,7 +1,7 @@
 ---
 id: 598ee8b91b410510ae82efef
 title: Extensible prime generator
-challengeType: 5
+challengeType: 1
 forumTopicId: 302262
 dashedName: extensible-prime-generator
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/factorial.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/factorial.md
index f58bdffe25e..0ea0ad71a47 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/factorial.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/factorial.md
@@ -1,7 +1,7 @@
 ---
 id: 597b2b2a2702b44414742771
 title: Factorial
-challengeType: 5
+challengeType: 1
 forumTopicId: 302263
 dashedName: factorial
 ---
@@ -15,7 +15,7 @@ Factorial of a number is given by:
 <pre><big>n! = n * (n-1) * (n-2) * ..... * 1</big>
 </pre>
 
-For example:
+Por ejemplo:
 
 <ul>
   <li><code>3! = 3 * 2 * 1 = 6</code></li>
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
index 0e5a414555c..23502e37435 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
@@ -1,7 +1,7 @@
 ---
 id: 598eea87e5cf4b116c3ff81a
 title: Factors of a Mersenne number
-challengeType: 5
+challengeType: 1
 forumTopicId: 302264
 dashedName: factors-of-a-mersenne-number
 ---
@@ -12,7 +12,7 @@ A Mersenne number is a number in the form of <code>2<sup>P</sup>-1</code>.
 
 If `P` is prime, the Mersenne number may be a Mersenne prime. (If `P` is not prime, the Mersenne number is also not prime.)
 
-In the search for Mersenne prime numbers it is advantageous to eliminate exponents by finding a small factor before starting a, potentially lengthy, [Lucas-Lehmer test](https://rosettacode.org/wiki/Lucas-Lehmer test "Lucas-Lehmer test").
+In the search for Mersenne prime numbers it is advantageous to eliminate exponents by finding a small factor before starting a, potentially lengthy, <a href="https://rosettacode.org/wiki/Lucas-Lehmer test" target="_blank" rel="noopener noreferrer nofollow">Lucas-Lehmer test</a>.
 
 There are very efficient algorithms for determining if a number divides <code>2<sup>P</sup>-1</code> (or equivalently, if <code>2<sup>P</sup> mod (the number) = 1</code>).
 
@@ -48,7 +48,7 @@ Further properties of Mersenne numbers allow us to refine the process even more.
 
 Any factor `q` of <code>2<sup>P</sup>-1</code> must be of the form `2kP+1`, `k` being a positive integer or zero. Furthermore, `q` must be `1` or `7 mod 8`.
 
-Finally any potential factor `q` must be [prime](https://rosettacode.org/wiki/Primality by Trial Division "Primality by Trial Division").
+Finally any potential factor `q` must be <a href="https://rosettacode.org/wiki/Primality_by_trial_division" target="_blank" rel="noopener noreferrer nofollow">prime</a>.
 
 As in other trial division algorithms, the algorithm stops when `2kP+1 > sqrt(N)`.These primarily tests only work on Mersenne numbers where `P` is prime. For example, <code>M<sub>4</sub>=15</code> yields no factors using these techniques, but factors into 3 and 5, neither of which fit `2kP+1`.
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/factors-of-an-integer.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/factors-of-an-integer.md
index 31d9b722b7f..8de06b3c4f0 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/factors-of-an-integer.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/factors-of-an-integer.md
@@ -1,7 +1,7 @@
 ---
 id: 597f1e7fbc206f0e9ba95dc4
 title: Factors of an integer
-challengeType: 5
+challengeType: 1
 forumTopicId: 302265
 dashedName: factors-of-an-integer
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/farey-sequence.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/farey-sequence.md
index 59b4edc9a54..f549221deb3 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/farey-sequence.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/farey-sequence.md
@@ -1,14 +1,14 @@
 ---
 id: 59c3ec9f15068017c96eb8a3
 title: Farey sequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 302266
 dashedName: farey-sequence
 ---
 
 # --description--
 
-The [Farey sequence](https://en.wikipedia.org/wiki/Farey sequence "wp: Farey sequence") <code>F<sub>n</sub></code> of order `n` is the sequence of completely reduced fractions between `0` and `1` which, when in lowest terms, have denominators less than or equal to `n`, arranged in order of increasing size.
+The Farey sequence <code>F<sub>n</sub></code> of order `n` is the sequence of completely reduced fractions between `0` and `1` which, when in lowest terms, have denominators less than or equal to `n`, arranged in order of increasing size.
 
 The *Farey sequence* is sometimes incorrectly called a *Farey series*.
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md
index 456b87de792..540c7372b1e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md
@@ -1,14 +1,14 @@
 ---
 id: 598eef80ba501f1268170e1e
 title: Fibonacci n-step number sequences
-challengeType: 5
+challengeType: 1
 forumTopicId: 302267
 dashedName: fibonacci-n-step-number-sequences
 ---
 
 # --description--
 
-These number series are an expansion of the ordinary [Fibonacci sequence](https://rosettacode.org/wiki/Fibonacci sequence "Fibonacci sequence") where:
+These number series are an expansion of the ordinary Fibonacci sequence where:
 
 <ol>
   <li>For $n = 2$ we have the Fibonacci sequence; with initial values $[1, 1]$ and $F_k^2 = F_{k-1}^2 + F_{k-2}^2$</li>
@@ -17,7 +17,7 @@ These number series are an expansion of the ordinary [Fibonacci sequence](https:
   <li>For general $n>2$ we have the Fibonacci $n$-step sequence - $F_k^n$; with initial values of the first $n$ values of the $(n-1)$'th Fibonacci $n$-step sequence $F_k^{n-1}$; and $k$'th value of this $n$'th sequence being $F_k^n = \sum_{i=1}^{(n)} {F_{k-i}^{(n)}}$</li>
 </ol>
 
-For small values of $n$, [Greek numeric prefixes](https://en.wikipedia.org/wiki/Number prefix#Greek_series "wp: Number prefix#Greek_series") are sometimes used to individually name each series.
+For small values of $n$, Greek numeric prefixes are sometimes used to individually name each series.
 
 Fibonacci $n$-step sequences:
 
@@ -33,7 +33,7 @@ Fibonacci $n$-step sequences:
 | 9   | nonanacci   | 1 1 2 4 8 16 32 64 128 256 511 1021 2040 4076 8144 ... |
 | 10  | decanacci   | 1 1 2 4 8 16 32 64 128 256 512 1023 2045 4088 8172 ... |
 
-Allied sequences can be generated where the initial values are changed: The [Lucas series](https://en.wikipedia.org/wiki/Lucas number "wp: Lucas number") sums the two preceding values like the fibonacci series for $n=2$ but uses $\[2, 1]$ as its initial values.
+Allied sequences can be generated where the initial values are changed: The Lucas series sums the two preceding values like the fibonacci series for $n=2$ but uses $\[2, 1]$ as its initial values.
 
 # --instructions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/fibonacci-word.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/fibonacci-word.md
index 708f743add3..268e3720862 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/fibonacci-word.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/fibonacci-word.md
@@ -1,14 +1,14 @@
 ---
 id: 5992e222d397f00d21122931
-title: Fibonacci word
-challengeType: 5
+title: Palabra fibonacci
+challengeType: 1
 forumTopicId: 302269
 dashedName: fibonacci-word
 ---
 
 # --description--
 
-The Fibonacci Word may be created in a manner analogous to the Fibonacci Sequence [as described here](https://hal.archives-ouvertes.fr/docs/00/36/79/72/PDF/The_Fibonacci_word_fractal.pdf):
+The Fibonacci Word Sequence may be created in a manner analogous to the Fibonacci Sequence, but it focuses on iterating concatenation.
 
 <pre>Define  F_Word<sub>1</sub>  as  <strong>1</strong>
 Define  F_Word<sub>2</sub>  as  <strong>0</strong>
@@ -16,9 +16,11 @@ Form   F_Word<sub>3</sub>  as  F_Word<sub>2</sub>   concatenated with  F_Word<su
 Form   F_Word<sub>n</sub>  as  F_Word<sub>n-1</sub>  concatenated with  F_word<sub>n-2</sub>
 </pre>
 
+Entropy calculation is required in this challenge, <a href="https://www.freecodecamp.org/learn/coding-interview-prep/rosetta-code/entropy" target="_blank" rel="noopener noreferrer nofollow">as shown in this Rosetta Code challenge</a>
+
 # --instructions--
 
-Write a function to return the Fibonacci Words up to `n`. `n` will be provided as a parameter to the function. The function should return an array of objects. The objects should be of the form: `{ N: 1, Length: 1, Entropy: 0, Word: '1' }`.
+Write a function to return the first `n` Fibonacci Words. The number of `n` is provided as a parameter to the function. The function should return an array of objects. The objects should be of the form: `{ N: 1, Length: 1, Entropy: 0, Word: '1' }`. `Entropy` is computed for the string `Word` and rounded to 8 decimal digits of accuracy. Note that the indices of this sequence start at `1`.
 
 # --hints--
 
@@ -34,10 +36,16 @@ assert(typeof fibWord === 'function');
 assert(Array.isArray(fibWord(5)));
 ```
 
-`fibWord(5)` should return `[{ N:1, Length:1, Entropy:0, Word:"1" },{ N:2, Length:1, Entropy:0, Word:"0" },{ N:3, Length:2, Entropy:1, Word:"01" },{ N:4, Length:3, Entropy:0.9182958340544896, Word:"010" },{ N:5, Length:5, Entropy:0.9709505944546688, Word:"01001" }]`.
+`fibWord(5)` should return `[{ N:1, Length:1, Entropy:0, Word:"1" },{ N:2, Length:1, Entropy:0, Word:"0" },{ N:3, Length:2, Entropy:1, Word:"01" },{ N:4, Length:3, Entropy:0.91829583, Word:"010" },{ N:5, Length:5, Entropy:0.97095059, Word:"01001" }]`.
 
 ```js
-assert.deepEqual(fibWord(5), ans);
+assert.deepEqual(fibWord(5), words5);
+```
+
+`fibWord(7)` should return `[{ N:1, Length:1, Entropy:0, Word:"1" },{ N:2, Length:1, Entropy:0, Word:"0" },{ N:3, Length:2, Entropy:1, Word:"01" },{ N:4, Length:3, Entropy:0.91829583, Word:"010" },{ N:5, Length:5, Entropy:0.97095059, Word:"01001" }, { N:6, Length:8, Entropy:0.954434, Word:'01001010' }, { N:7, Length:13, Entropy:0.9612366, Word:'0100101001001' }]`.
+
+```js
+assert.deepEqual(fibWord(7), words7);
 ```
 
 # --seed--
@@ -45,15 +53,23 @@ assert.deepEqual(fibWord(5), ans);
 ## --after-user-code--
 
 ```js
-let ans=[ { N: 1, Length: 1, Entropy: 0, Word: '1' },
-
+const words5 = [
+  { N: 1, Length: 1, Entropy: 0, Word: '1' },
   { N: 2, Length: 1, Entropy: 0, Word: '0' },
-
   { N: 3, Length: 2, Entropy: 1, Word: '01' },
+  { N: 4, Length: 3, Entropy: 0.91829583, Word: '010' },
+  { N: 5, Length: 5, Entropy: 0.97095059, Word: '01001' }
+];
 
-  { N: 4, Length: 3, Entropy: 0.9182958340544896, Word: '010' },
-
-  { N: 5, Length: 5, Entropy: 0.9709505944546688, Word: '01001' }];
+const words7 = [
+  { N: 1, Length: 1, Entropy: 0, Word: '1' },
+  { N: 2, Length: 1, Entropy: 0, Word: '0' },
+  { N: 3, Length: 2, Entropy: 1, Word: '01' },
+  { N: 4, Length: 3, Entropy: 0.91829583, Word: '010' },
+  { N: 5, Length: 5, Entropy: 0.97095059, Word: '01001' },
+  { N: 6, Length: 8, Entropy: 0.954434, Word: '01001010' },
+  { N: 7, Length: 13, Entropy: 0.9612366, Word: '0100101001001' }
+];
 ```
 
 ## --seed-contents--
@@ -67,55 +83,33 @@ function fibWord(n) {
 # --solutions--
 
 ```js
+// Round to digits
+function roundFloat(num, digits) {
+  return Math.round(num * 10.0**digits) / (10.0**digits);
+}
+
+// Entropy calculation for string with only 0 and 1
+function entropy(word) {
+  function digitEntropy(count) {
+    return count < 1 ? 0
+      : - count / word.length * Math.log2(count / word.length);
+  }
+  const numZeros = word.split('').filter(e => e === '0').length;
+  const numOnes  = word.length - numZeros;
+  return roundFloat(digitEntropy(numZeros) + digitEntropy(numOnes), 8);
+}
+
+// Compute array of Fibonacci words
 function fibWord(n) {
-    function entropy(s) {
-         //create an object containing each individual char
-      //and the amount of iterations per char
-        function prob(s) {
-            var h = Object.create(null);
-            s.split('').forEach(function(c) {
-               h[c] && h[c]++ || (h[c] = 1);
-            });
-            return h;
-        }
-
-        s = s.toString(); //just in case
-        var e = 0, l = s.length, h = prob(s);
-
-        for (var i in h ) {
-            var p = h[i]/l;
-            e -= p * Math.log(p) / Math.log(2);
-        }
-        return e;
-    }
-    var wOne = "1", wTwo = "0", wNth = [wOne, wTwo], w = "", o = [];
-
-    for (var i = 0; i < n; i++) {
-        if (i === 0 || i === 1) {
-            w = wNth[i];
-        } else {
-            w = wNth[i - 1] + wNth[i - 2];
-            wNth.push(w);
-        }
-        var l = w.length;
-        var e = entropy(w);
-
-        if (l <= 21) {
-            o.push({
-                N: i + 1,
-                Length: l,
-                Entropy: e,
-                Word: w
-            });
-        } else {
-            o.push({
-                N: i + 1,
-                Length: l,
-                Entropy: e,
-                Word: "..."
-            });
-        }
-    }
-  return o;
+  return [...Array(n).keys()]
+    .reduce((words, i) => {
+      const word = i === 0 ? "1"
+                 : i === 1 ? "0"
+                 : words[i - 1].Word + words[i - 2].Word;
+      words.push(
+        { N: i + 1, Length: word.length, Entropy: entropy(word), Word: word }
+      );
+      return words;
+    }, []);
 }
 ```
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/fizzbuzz.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/fizzbuzz.md
index 9839933b099..426bc4b9130 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/fizzbuzz.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/fizzbuzz.md
@@ -1,58 +1,58 @@
 ---
 id: 5e9ddb06ec35240f39657419
 title: FizzBuzz
-challengeType: 5
+challengeType: 1
 forumTopicId: 385370
 dashedName: fizzbuzz
 ---
 
 # --description--
 
-Write a program that generates an array of integers from 1 to 100 (inclusive). But:
+Write a program that generates an array of integers from 1 to 100 (inclusive). Pero:
 
 <ul>
-    <li>for multiples of 3, add <code>"Fizz"</code> to the array instead of the number</li>
-    <li>for multiples of 5, add <code>"Buzz"</code> to the array instead of the number</li>
-    <li>for multiples of 3 and 5, add <code>"FizzBuzz"</code> to the array instead of the number</li>
+    <li>para múltiplos de 3, suma<code>"Fizz"</code> a la matriz en lugar del número</li>
+    <li>para múltiplos de 5, suma<code>"Buzz"</code> a la matriz en lugar del número</li>
+    <li>para múltiplos de 3 y 5, suma<code>"FizzBuzz"</code> a la matriz en lugar del número</li>
 </ul>
 
 # --instructions--
 
-Your program should return an array containing the results based on the rules above.
+Su programa debe devolver una matriz que contenga los resultados según las reglas anteriores.
 
 # --hints--
 
-`fizzBuzz` should be a function.
+`fizzBuzz` debe ser una función.
 
 ```js
 assert(typeof fizzBuzz == 'function');
 ```
 
-`fizzBuzz()` should return an Array.
+`fizzBuzz()` debe devolver una matriz.
 
 ```js
 assert(Array.isArray(fizzBuzz()) == true);
 ```
 
-Numbers divisible by only 3 should return `"Fizz"`.
+Los números divisibles por solo 3 deberían regresar`"Fizz"`.
 
 ```js
 assert.equal(fizzBuzz()[2], 'Fizz');
 ```
 
-Numbers divisible by only 5 should return `"Buzz"`.
+Los números divisibles por solo 5 deberían regresar `"Buzz"`.
 
 ```js
 assert.equal(fizzBuzz()[99], 'Buzz');
 ```
 
-Numbers divisible by both 3 and 5 should return `"FizzBuzz"`.
+Los números divisibles por 3 y 5 deberían regresar `"FizzBuzz"`.
 
 ```js
 assert.equal(fizzBuzz()[89], 'FizzBuzz');
 ```
 
-Numbers not divisible by either 3 or 5 should return the number itself.
+Los números que no son divisibles por 3 o 5 deben devolver el número en sí.
 
 ```js
 assert.equal(fizzBuzz()[12], 13);
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/fractran.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/fractran.md
index 0bcda09bdec..4e3daccf125 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/fractran.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/fractran.md
@@ -1,14 +1,14 @@
 ---
 id: 5a7dad05be01840e1778a0d1
 title: Fractran
-challengeType: 5
+challengeType: 1
 forumTopicId: 302270
 dashedName: fractran
 ---
 
 # --description--
 
-[FRACTRAN](https://en.wikipedia.org/wiki/FRACTRAN "wp: FRACTRAN") is a Turing-complete esoteric programming language invented by the mathematician [John Horton Conway](https://en.wikipedia.org/wiki/John Horton Conway "wp: John Horton Conway").
+FRACTRAN is a Turing-complete esoteric programming language invented by the mathematician John Horton Conway.
 
 A FRACTRAN program is an ordered list of positive fractions $P = (f_1, f_2, \\ldots, f_m)$, together with an initial positive integer input $n$.
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/gamma-function.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/gamma-function.md
index f105a0a1bd5..91b6b01786a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/gamma-function.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/gamma-function.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7e76
 title: Gamma function
-challengeType: 5
+challengeType: 1
 forumTopicId: 302271
 dashedName: gamma-function
 ---
 
 # --description--
 
-Implement one algorithm (or more) to compute the [Gamma](https://en.wikipedia.org/wiki/Gamma function) ($\\Gamma$) function (in the real field only).
+Implement one algorithm (or more) to compute the Gamma function (in the real field only).
 
 The Gamma function can be defined as:
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/gaussian-elimination.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/gaussian-elimination.md
index 2e5adf4bd9e..53b7860f1fc 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/gaussian-elimination.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/gaussian-elimination.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7e77
 title: Gaussian elimination
-challengeType: 5
+challengeType: 1
 forumTopicId: 302272
 dashedName: gaussian-elimination
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md
index 4af8e94f0e3..168406d9457 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7e78
 title: General FizzBuzz
-challengeType: 5
+challengeType: 1
 forumTopicId: 302273
 dashedName: general-fizzbuzz
 ---
 
 # --description--
 
-Write a generalized version of [FizzBuzz](https://rosettacode.org/wiki/FizzBuzz) that works for any list of factors, along with their words.
+Write a generalized version of <a href="https://rosettacode.org/wiki/FizzBuzz" target="_blank" rel="noopener noreferrer nofollow">FizzBuzz</a> that works for any list of factors, along with their words.
 
 This is basically a "fizzbuzz" implementation where the rules of the game are supplied to the user. Create a function to implement this. The function should take two parameters.
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.md
index 5f643c3a38b..eb31c80170b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7e7a
 title: Generate lower case ASCII alphabet
-challengeType: 5
+challengeType: 1
 forumTopicId: 302274
 dashedName: generate-lower-case-ascii-alphabet
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/generator-exponential.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/generator-exponential.md
index f888e8dff04..6b15a7ca62e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/generator-exponential.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/generator-exponential.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7e7b
 title: Generator/Exponential
-challengeType: 5
+challengeType: 1
 forumTopicId: 302275
 dashedName: generatorexponential
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/gray-code.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/gray-code.md
index f46350f0be6..ded11f5cac0 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/gray-code.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/gray-code.md
@@ -1,18 +1,18 @@
 ---
 id: 5a23c84252665b21eecc7e80
 title: Gray code
-challengeType: 5
+challengeType: 1
 forumTopicId: 302276
 dashedName: gray-code
 ---
 
 # --description--
 
-[Gray code](https://en.wikipedia.org/wiki/Gray code) is a form of binary encoding where transitions between consecutive numbers differ by only one bit.
+Gray code is a form of binary encoding where transitions between consecutive numbers differ by only one bit.
 
 This is a useful encoding for reducing hardware data hazards with values that change rapidly and/or connect to slower hardware as inputs.
 
-It is also useful for generating inputs for [Karnaugh maps](https://en.wikipedia.org/wiki/Karnaugh map) in order from left to right or top to bottom.
+It is also useful for generating inputs for Karnaugh maps in order from left to right or top to bottom.
 
 # --instructions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md
index 60b96750188..8e960936bb6 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7e82
 title: Greatest common divisor
-challengeType: 5
+challengeType: 1
 forumTopicId: 302277
 dashedName: greatest-common-divisor
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.md
index 4a90c111fe2..6b8eebaf0e8 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7e84
 title: Greatest subsequential sum
-challengeType: 5
+challengeType: 1
 forumTopicId: 302278
 dashedName: greatest-subsequential-sum
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/hailstone-sequence.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/hailstone-sequence.md
index 37768d8cd36..639f52b4998 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/hailstone-sequence.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/hailstone-sequence.md
@@ -1,7 +1,7 @@
 ---
 id: 595608ff8bcd7a50bd490181
 title: Hailstone sequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 302279
 dashedName: hailstone-sequence
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/happy-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/happy-numbers.md
index 6cb33dbcaf6..43ab0ef8989 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/happy-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/happy-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 594810f028c0303b75339ad1
 title: Happy numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 302280
 dashedName: happy-numbers
 ---
 
 # --description--
 
-A [happy number](https://en.wikipedia.org/wiki/Happy_number) is defined by the following process:
+A happy number is defined by the following process:
 
 Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals `1` (where it will stay), or it loops endlessly in a cycle which does not include `1`. Those numbers for which this process ends in `1` are happy numbers, while those that do not end in `1` are unhappy numbers.
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.md
index 400e9513344..ff626d6671d 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.md
@@ -1,7 +1,7 @@
 ---
 id: 595668ca4cfe1af2fb9818d4
 title: Harshad or Niven series
-challengeType: 5
+challengeType: 1
 forumTopicId: 302281
 dashedName: harshad-or-niven-series
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
index d5a9a396bb9..75facd682ab 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
@@ -1,20 +1,24 @@
 ---
 id: 595671d4d2cdc305f0d5b36f
 title: Hash from two arrays
-challengeType: 5
+challengeType: 1
 forumTopicId: 302283
 dashedName: hash-from-two-arrays
 ---
 
 # --description--
 
-Using two Arrays of equal length, create a Hash object where the elements from one array (the keys) are linked to the elements of the other (the values).
+Given two arrays, create a hash object where the elements from one array (the keys) are linked to the elements of the other (the values).
 
-**Related task:**
+Example:
 
-<ul>
-  <li><a href='https://rosettacode.org/wiki/Associative arrays/Creation' title='Associative arrays/Creation' target='_blank'>Associative arrays/Creation</a></li>
-</ul>
+```js
+const firstArr = [1, 2, 3];
+const secondArr = ["a", "b", "c"];
+const hashObj = arrToObj(firstArr, secondArr);
+```
+
+The hash object created from the arrays above will be `{1: "a", 2: "b", 3: "c"}`.
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/hash-join.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/hash-join.md
index 7dc6b729cb6..f2f40f8caa9 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/hash-join.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/hash-join.md
@@ -1,19 +1,19 @@
 ---
 id: 5956795bc9e2c415eb244de1
 title: Hash join
-challengeType: 5
+challengeType: 1
 forumTopicId: 302284
 dashedName: hash-join
 ---
 
 # --description--
 
-An [inner join](https://en.wikipedia.org/wiki/Join_(SQL)#Inner_join "wp: Join\_(SQL)#Inner_join") is an operation that combines two data tables into one table, based on matching column values. The simplest way of implementing this operation is the [nested loop join](https://en.wikipedia.org/wiki/Nested loop join "wp: Nested loop join") algorithm, but a more scalable alternative is the [hash join](https://en.wikipedia.org/wiki/hash join "wp: hash join") algorithm.
+An inner join is an operation that combines two data tables into one table, based on matching column values. The simplest way of implementing this operation is the nested loop join algorithm, but a more scalable alternative is the hash join algorithm.
 
 The "hash join" algorithm consists of two steps:
 
 <ol>
-  <li><strong>Hash phase:</strong> Create a <a href='https://en.wikipedia.org/wiki/Multimap' title='wp: Multimap' target='_blank'>multimap</a> from one of the two tables, mapping from each join column value to all the rows that contain it.</li>
+  <li><strong>Hash phase:</strong> Create a multimap from one of the two tables, mapping from each join column value to all the rows that contain it.</li>
   <ul>
     <li>The multimap must support hash-based lookup which scales better than a simple linear search, because that's the whole point of this algorithm.</li>
     <li>Ideally we should create the multimap for the smaller table, thus minimizing its creation time and memory size.</li>
@@ -53,7 +53,7 @@ Implement the "hash join" algorithm as a function and demonstrate that it passes
             <table>
               <tr>
                 <th style="padding: 4px; margin: 5px;">Age</th>
-                <th style="padding: 4px; margin: 5px;">Name</th>
+                <th style="padding: 4px; margin: 5px;">Nombre</th>
               </tr>
               <tr>
                 <td style="padding: 4px; margin: 5px;">27</td>
@@ -127,7 +127,7 @@ Implement the "hash join" algorithm as a function and demonstrate that it passes
   </tr>
 </table>
 
-**Output**
+**Resultado**
 
 | A_age | A_name | B_character | B_nemesis |
 | ----- | ------ | ----------- | --------- |
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/heronian-triangles.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/heronian-triangles.md
index 2162dc57eb4..35c83855e3c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/heronian-triangles.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/heronian-triangles.md
@@ -1,14 +1,14 @@
 ---
 id: 595b98f8b5a2245e243aa831
 title: Heronian triangles
-challengeType: 5
+challengeType: 1
 forumTopicId: 302285
 dashedName: heronian-triangles
 ---
 
 # --description--
 
-[Hero's formula](https://en.wikipedia.org/wiki/Heron's formula "wp: Heron's formula") for the area of a triangle given the length of its three sides `a`, `b`, and `c` is given by:
+Hero's formula for the area of a triangle given the length of its three sides `a`, `b`, and `c` is given by:
 
 $A = \\sqrt{s(s-a)(s-b)(s-c)},$
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
index 1b5b864eda0..e05d87270f2 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
@@ -1,43 +1,35 @@
 ---
 id: 59622f89e4e137560018a40e
 title: Hofstadter Figure-Figure sequences
-challengeType: 5
+challengeType: 1
 forumTopicId: 302286
 dashedName: hofstadter-figure-figure-sequences
 ---
 
 # --description--
 
-These two sequences of positive integers are defined as:
+The Hofstadter Figure-Figure sequences $R_n$ and $S_n$ are given by
 
-$R(1)=1\\ ;\\ S(1)=2 \\\\R(n)=R(n-1)+S(n-1), \\quad n>1.$
+$R_1 = 1\\ ;\\ S_1 = 2 \\\\R_n = R_{n-1} + S_{n-1}, \\quad n>1.$
 
-The sequence $S(n)$ is further defined as the sequence of positive integers not present in $R(n)$.
-
-Sequence $R$ starts:
+Specifically, the sequence $R_n$ contains the values
 
 <pre>1, 3, 7, 12, 18, ...</pre>
 
-Sequence $S$ starts:
+and the sequence $S_n$ contains the values
 
 <pre>2, 4, 5, 6, 8, ...</pre>
 
+The sequence $R_n$ is defined by the recurrence relation $R_n = R_{n-1} + S_{n-1}$, while $S_n$ is defined as sequence of positive integers that are not included in the sequence $R_n$.
+
 # --instructions--
 
-Create two functions named `ffr` and `ffs` that when given `n` return `R(n)` or `S(n)` respectively. (Note that R(1) = 1 and S(1) = 2 to avoid off-by-one errors).
+Create two functions named `ffr` and `ffs` that return `R(n)` or `S(n)`, respectively, for any index `n`. Note that the Hofstadter Figure-Figure sequences are 1-indexed, with $R_1 = 1$ and $S_1 = 2$.
 
 No maximum value for `n` should be assumed.
 
-**References**
+**References**<p>Rosetta: <a href='https://rosettacode.org/wiki/Hofstadter_Figure-Figure_sequences' target='_blank'>Hofstadter Figure-Figure sequences</a></p>.
 
-<ul>
-  <li>
-    Sloane's <a href='https://oeis.org/A005228' target='_blank'>A005228</a> and <a href='https://oeis.org/A030124' target='_blank'>A030124</a>.
-  </li>
-  <li>
-    Wikipedia: <a href='https://en.wikipedia.org/wiki/Hofstadter_sequence#Hofstadter_Figure-Figure_sequences' title='wp: Hofstadter_sequence#Hofstadter_Figure-Figure_sequences' target='_blank'>Hofstadter Figure-Figure sequences</a>.
-  </li>
-</ul>
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
index c8ab7d438ce..27c1bdb4dba 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
@@ -1,18 +1,18 @@
 ---
 id: 59637c4d89f6786115efd814
 title: Hofstadter Q sequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 302287
 dashedName: hofstadter-q-sequence
 ---
 
 # --description--
 
-The [Hofstadter Q sequence](https://en.wikipedia.org/wiki/Hofstadter_sequence#Hofstadter_Q_sequence "wp: Hofstadter_sequence#Hofstadter_Q_sequence") is defined as:
+The Hofstadter Q sequence is defined as:
 
 $Q(1)=Q(2)=1, \\\\ Q(n)=Q\\big(n-Q(n-1)\\big)+Q\\big(n-Q(n-2)), \\quad n>2.$
 
-It is defined like the [Fibonacci sequence](https://rosettacode.org/wiki/Fibonacci sequence "Fibonacci sequence"), but whereas the next term in the Fibonacci sequence is the sum of the previous two terms, in the Q sequence the previous two terms tell you how far to go back in the Q sequence to find the two numbers to sum to make the next term of the sequence.
+It is defined like the Fibonacci sequence, but whereas the next term in the Fibonacci sequence is the sum of the previous two terms, in the Q sequence the previous two terms tell you how far to go back in the Q sequence to find the two numbers to sum to make the next term of the sequence.
 
 # --instructions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/iban.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/iban.md
index 666c50a6be8..dde7926e041 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/iban.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/iban.md
@@ -1,19 +1,19 @@
 ---
 id: 5a23c84252665b21eecc7eaf
 title: IBAN
-challengeType: 5
+challengeType: 1
 forumTopicId: 302289
 dashedName: iban
 ---
 
 # --description--
 
-The [International Bank Account Number (IBAN)](https://en.wikipedia.org/wiki/International_Bank_Account_Number) is an internationally agreed means of identifying bank accounts across national borders with a reduced risk of propagating [transcription errors](https://en.wikipedia.org/wiki/Transcription_error).
+The International Bank Account Number (IBAN) is an internationally agreed means of identifying bank accounts across national borders with a reduced risk of propagating transcription errors.
 
-The IBAN consists of up to 34 alphanumeric characters:
+The <abbr title="International Bank Account Number">IBAN</abbr> consists of up to 34 alphanumeric characters:
 
 <ul>
-  <li>first the two-letter ISO 3166-1 alpha-2 country code</li>
+  <li>first the two-letter <abbr title="International Organization for Standardization">ISO</abbr> 3166-1 alpha-2 country code</li>
   <li>then two check digits, and</li>
   <li>finally a country-specific Basic Bank Account Number (BBAN).</li>
 </ul>
@@ -95,10 +95,10 @@ function isValid(iban) {
     iban = __helpers.removeWhiteSpace(iban)
     if (!iban.match(/^[\dA-Z]+$/)) return false
     var len = iban.length
-    if (len != ibanLen[iban.substr(0,2)]) return false
-    iban = iban.substr(4) + iban.substr(0,4)
+    if (len != ibanLen[iban.substring(0,2)]) return false
+    iban = iban.substring(4) + iban.substring(0,4)
     for (var s='', i=0; i<len; i+=1) s+=parseInt(iban.charAt(i),36)
-    for (var m=s.substr(0,15)%97, s=s.substr(15); s; s=s.substr(13)) m=(m+s.substr(0,13))%97
+    for (var m=s.substring(0,15)%97, s=s.substring(15); s; s=s.substring(13)) m=(m+s.substring(0,13))%97
     return m == 1
 }
 ```
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/identity-matrix.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/identity-matrix.md
index a8465da648c..dba37b7cafa 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/identity-matrix.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/identity-matrix.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7eb1
 title: Identity matrix
-challengeType: 5
+challengeType: 1
 forumTopicId: 302290
 dashedName: identity-matrix
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/iterated-digits-squaring.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/iterated-digits-squaring.md
index bbed591151a..c64fdc125d7 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/iterated-digits-squaring.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/iterated-digits-squaring.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ec1
 title: Iterated digits squaring
-challengeType: 5
+challengeType: 1
 forumTopicId: 302291
 dashedName: iterated-digits-squaring
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/jaro-distance.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/jaro-distance.md
index d348acaee73..00f480f8b6c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/jaro-distance.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/jaro-distance.md
@@ -1,48 +1,48 @@
 ---
 id: 5a23c84252665b21eecc7ec2
-title: Jaro distance
-challengeType: 5
+title: Distancia Jaro
+challengeType: 1
 forumTopicId: 302292
 dashedName: jaro-distance
 ---
 
 # --description--
 
-The Jaro distance is a measure of similarity between two strings. The higher the Jaro distance for two strings is, the more similar the strings are. The score is normalized such that `0` equates to no similarity and `1` is an exact match.
+La distancia de Jaro es una medida de similitud entre dos cadenas. Cuanto más alta sea la distancia de Jaro para dos cuerdas, más similares son las cadenas. La puntuación está normalizada de tal manera que `0` no equivale a ninguna similitud y `1` es una coincidencia exacta.
 
-**Definition**
+**Definición**
 
-The Jaro distance \\( d_j \\) of two given strings \\(s_1\\) and \\(s_2\\) is
+La distancia de Jaro \\( d_j \\) de dos cadenas \\(s_1\\) y \\(s_2\\) es
 
 \\begin{align}d_j = \\begin{cases}0& & \\text{if }m=0 \\\\\\\\{\\frac {1}{3}}\\left({\\frac {m}{|s\_{1}|}}+{\\frac {m}{|s\_{2}|}}+{\\frac {m-t}{m}}\\right)& & \\text{otherwise}\\end{cases}\\end{align}
 
-Where:
+Donde:
 
 <ul>
-  <li>\(m\) is the number of <i>matching characters</i>;</li>
-  <li> \(t\) is half the number of <i>transpositions</i>.</li>
+  <li>\(m\) es el número de <i>caracteres coincidentes</i>;</li>
+  <li> \(t\) es la mitad del número de <i>transposiciones</i>.</li>
 </ul>
 
-Two characters from \\(s_1\\) and \\(s_2\\) respectively, are considered *matching* only if they are the same and not farther than \\(\\left\\lfloor\\frac{\\max(|s_1|,|s_2|)}{2}\\right\\rfloor-1\\).
+Dos caracteres de \\(s_1\\) y \\(s_2\\) respectivamente, se consideran *que coinciden* solo si son los mismos y no más lejos que \\(\\left\\lfloor\\frac{\\max(|s_1|, s_2|)}{2}\\right\\rfloor-1\\).
 
-Each character of \\(s_1\\) is compared with all its matching characters in \\(s_2\\) . The number of matching (but different sequence order) characters divided by 2 defines the number of *transpositions*.
+Cada carácter de \\(s_1\\) se compara con todos sus caracteres coincidentes en \\(s_2\\) . El número de caracteres coincidentes (pero diferentes órdenes de secuencia) divididos por 2 define el número de *transposiciones*.
 
-**Example**
+**Por ejemplo**
 
-Given the strings \\(s_1\\) *DWAYNE* and \\(s_2\\) *DUANE* we find:
+Dadas las cadenas \\(s_1\\) *DWAYNE* y \\(s_2\\) *DUANE* que encontramos:
 
 <ul>
-  <li>\(m = 4\)</li>
-  <li>\(|s_1| = 6\)</li>
-  <li>\(|s_2| = 5\)</li>
+  <li>\\(m = 4\\)</li>
+  <li>\\(|s_1| = 6\\)</li>
+  <li>\\(|s_2| = 5\\)</li>
   <li>\(t = 0\)</li>
 </ul>
 
-We find a Jaro score of: \\(d_j = \\frac{1}{3}\\left(\\frac{4}{6} + \\frac{4}{5} + \\frac{4-0}{4}\\right) = 0.822\\).
+Encontramos una puntuación de Jaro de: \\(d_j = \\frac{1}{3}\\left(\\frac{4}{6} + \\frac{4}{5} + \\frac{4-0}{4}\\right) = 0. 822\\).
 
 # --instructions--
 
-Write a function a that takes two strings as parameters and returns the associated Jaro distance.
+Escriba una función que tome dos cadenas como parámetros y devuelva la distancia Jaro asociada.
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/jortsort.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/jortsort.md
index 0f121b99ee4..1bb9d70e909 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/jortsort.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/jortsort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7ec4
 title: JortSort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302293
 dashedName: jortsort
 ---
 
 # --description--
 
-jortSort is a sorting toolset that makes the user do the work and guarantees efficiency because you don't have to sort ever again. It was originally presented by Jenn "Moneydollars" Schiffer at the prestigious [JSConf](https://www.youtube.com/watch?v=pj4U_W0OFoE).
+jortSort is a sorting toolset that makes the user do the work and guarantees efficiency because you don't have to sort ever again. It was originally presented by Jenn "Moneydollars" Schiffer at the prestigious JSConf2014.
 
 jortSort should be a function that takes a single array of comparable objects as its argument. It then sorts the array in ascending order and compares the sorted array to the originally provided array. If the arrays match (i.e. the original array was already sorted), the function returns true. If the arrays do not match (i.e. the original array was not sorted), the function returns false.
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/josephus-problem.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/josephus-problem.md
index 6e8314e204c..d7e28e5e0c4 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/josephus-problem.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/josephus-problem.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7ec5
 title: Josephus problem
-challengeType: 5
+challengeType: 1
 forumTopicId: 302294
 dashedName: josephus-problem
 ---
 
 # --description--
 
-[Josephus problem](https://en.wikipedia.org/wiki/Josephus problem) is a math puzzle with a grim description: $n$ prisoners are standing on a circle, sequentially numbered from $0$ to $n-1$.
+Josephus problem is a math puzzle with a grim description: $n$ prisoners are standing on a circle, sequentially numbered from $0$ to $n-1$.
 
 An executioner walks along the circle, starting from prisoner $0$, removing every $k$-th prisoner and killing him.
 
@@ -26,7 +26,7 @@ Which number was he?
 
 # --instructions--
 
-Write a function that takes the initial number of prisoners and 'k' as parameter and returns the number of the prisoner that survives.
+Write a function that takes the initial number of prisoners and `k` as parameters and returns the number of the prisoner that survives.
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/k-d-tree.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/k-d-tree.md
index 5cb0e1f78fc..9f038dd908d 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/k-d-tree.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/k-d-tree.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ecb
 title: K-d tree
-challengeType: 5
+challengeType: 1
 forumTopicId: 302295
 dashedName: k-d-tree
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md
index 7b2530f4c62..ffef92f7819 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md
@@ -1,27 +1,27 @@
 ---
 id: 5a23c84252665b21eecc7eca
 title: Kaprekar numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 302296
 dashedName: kaprekar-numbers
 ---
 
 # --description--
 
-A positive integer is a [Kaprekar number](https://en.wikipedia.org/wiki/Kaprekar number) if:
+A positive integer is a Kaprekar number if:
 
 <ul>
   <li>It is 1, or,</li>
   <li>The decimal representation of its square may be split once into two parts consisting of positive integers which sum to the original number. </li>
 </ul>
 
-Note that a split resulting in a part consisting purely of 0s is not valid, as 0 is not considered positive.Example
+Note that a split resulting in a part consisting purely of 0s is not valid, as 0 is not considered positive.
 
-Kaprekar numbers:
+Example Kaprekar numbers:
 
 <ul>
   <li><code>2223</code> is a Kaprekar number, as <code>2223 * 2223 = 4941729</code>, <code>4941729</code> may be split to <code>494</code> and <code>1729</code>, and <code>494 + 1729 = 2223</code></li>
-  <li>The series of Kaprekar numbers is known as <a href='https://oeis.org/A006886' target='_blank'>A006886</a>, and begins as <code>1, 9, 45, 55, ...</code></li>
+  <li>The series of Kaprekar numbers is known as A006886, and begins as <code>1, 9, 45, 55, ...</code></li>
 </ul>
 
 # --instructions--
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/knapsack-problem-0-1.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/knapsack-problem-0-1.md
index 4112f63fb20..ab84dea2631 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/knapsack-problem-0-1.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/knapsack-problem-0-1.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ed1
 title: Knapsack problem/0-1
-challengeType: 5
+challengeType: 1
 forumTopicId: 323649
 dashedName: knapsack-problem0-1
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/knapsack-problem-bounded.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/knapsack-problem-bounded.md
index dfcde45510a..2af68ccd123 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/knapsack-problem-bounded.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/knapsack-problem-bounded.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ed2
 title: Knapsack problem/Bounded
-challengeType: 5
+challengeType: 1
 forumTopicId: 323652
 dashedName: knapsack-problembounded
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/knapsack-problem-continuous.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/knapsack-problem-continuous.md
index c106a4a7438..cb6879ac2d9 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/knapsack-problem-continuous.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/knapsack-problem-continuous.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ed3
 title: Knapsack problem/Continuous
-challengeType: 5
+challengeType: 1
 forumTopicId: 323654
 dashedName: knapsack-problemcontinuous
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/knapsack-problem-unbounded.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/knapsack-problem-unbounded.md
index 74e1ad8916a..62bb6116126 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/knapsack-problem-unbounded.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/knapsack-problem-unbounded.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ed4
 title: Knapsack problem/Unbounded
-challengeType: 5
+challengeType: 1
 forumTopicId: 323655
 dashedName: knapsack-problemunbounded
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/knights-tour.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/knights-tour.md
index c7a4b0693de..154df0c3ee4 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/knights-tour.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/knights-tour.md
@@ -1,18 +1,18 @@
 ---
 id: 5a23c84252665b21eecc7ed5
 title: Knight's tour
-challengeType: 5
+challengeType: 1
 forumTopicId: 302297
 dashedName: knights-tour
 ---
 
 # --description--
 
-[Knight's Tour](https://en.wikipedia.org/wiki/Knight%27s_tour) Problem: You have an empty `w` \* `h` chessboard, but for a single knight on some square. The knight must perform a sequence of legal moves that result in the knight visiting every square on the chessboard exactly once. Note that it is *not* a requirement that the tour be "closed"; that is, the knight need not end within a single move of its start position.
+Knight's Tour Problem: You have an empty `width` \* `height` chessboard, but for a single knight on some square. The knight must perform a sequence of legal moves that result in the knight visiting every square on the chessboard exactly once. Note that it is *not* a requirement that the tour be "closed"; that is, the knight need not end within a single move of its start position.
 
 # --instructions--
 
-Write a function that takes `w` and `h` as parameters and returns the number of initial positions from where it is possible to achieve the task stated above.
+Write a function that takes `width` and `height` as parameters and returns the number of initial positions from where it is possible to achieve the task stated above.
 
 # --hints--
 
@@ -63,7 +63,7 @@ assert.equal(knightTour(8, 6), 48);
 ## --seed-contents--
 
 ```js
-function knightTour(w, h) {
+function knightTour(width, height) {
 
 }
 ```
@@ -71,7 +71,7 @@ function knightTour(w, h) {
 # --solutions--
 
 ```js
-function knightTour(w, h) {
+function knightTour(width, height) {
   function createBoards(rows, columns) {
     const board = [];
     const visited = [];
@@ -210,11 +210,11 @@ function knightTour(w, h) {
     [1, -2]
   ];
 
-  const [baseBoard, baseVisited] = createBoards(h, w);
+  const [baseBoard, baseVisited] = createBoards(height, width);
   fillAllowedMovesCounts(baseBoard);
   let solvedCount = 0;
-  for (let row = 0; row < h; row++) {
-    for (let column = 0; column < w; column++) {
+  for (let row = 0; row < height; row++) {
+    for (let column = 0; column < width; column++) {
       if (solveStart(baseBoard, baseVisited, row, column)) {
         solvedCount++;
       }
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/largest-int-from-concatenated-ints.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/largest-int-from-concatenated-ints.md
index f8938faa66f..91f5ba030ba 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/largest-int-from-concatenated-ints.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/largest-int-from-concatenated-ints.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7edb
 title: Largest int from concatenated ints
-challengeType: 5
+challengeType: 1
 forumTopicId: 302298
 dashedName: largest-int-from-concatenated-ints
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/last-friday-of-each-month.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/last-friday-of-each-month.md
index e8a6170f549..7ebd6a1b71a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/last-friday-of-each-month.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/last-friday-of-each-month.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7edc
 title: Last Friday of each month
-challengeType: 5
+challengeType: 1
 forumTopicId: 302299
 dashedName: last-friday-of-each-month
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/last-letter-first-letter.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/last-letter-first-letter.md
index a20f5b4df35..f6bb3eafe56 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/last-letter-first-letter.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/last-letter-first-letter.md
@@ -1,7 +1,7 @@
 ---
 id: 5e4ce2b6ac708cc68c1df25e
 title: Last letter-first letter
-challengeType: 5
+challengeType: 1
 forumTopicId: 385256
 dashedName: last-letter-first-letter
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/leap-year.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/leap-year.md
index cf41748dba4..ae2f6773c80 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/leap-year.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/leap-year.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ede
 title: Leap year
-challengeType: 5
+challengeType: 1
 forumTopicId: 302300
 dashedName: leap-year
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/least-common-multiple.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/least-common-multiple.md
index aa27446cbe9..d84da1b8b61 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/least-common-multiple.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/least-common-multiple.md
@@ -1,14 +1,16 @@
 ---
 id: 5a23c84252665b21eecc7edf
 title: Least common multiple
-challengeType: 5
+challengeType: 1
 forumTopicId: 302301
 dashedName: least-common-multiple
 ---
 
 # --description--
 
-The least common multiple of 12 and 18 is 36, because 12 is a factor (12 × 3 = 36), and 18 is a factor (18 × 2 = 36), and there is no positive integer less than 36 that has both factors. As a special case, if either *m* or *n* is zero, then the least common multiple is zero. One way to calculate the least common multiple is to iterate all the multiples of *m*, until you find one that is also a multiple of *n*. If you already have *gcd* for [greatest common divisor](https://rosettacode.org/wiki/greatest common divisor), then this formula calculates *lcm*. ( \\operatorname{lcm}(m, n) = \\frac{|m \\times n|}{\\operatorname{gcd}(m, n)} )
+The least common multiple of 12 and 18 is 36, because 12 is a factor (12 × 3 = 36), and 18 is a factor (18 × 2 = 36), and there is no positive integer less than 36 that has both factors. As a special case, if either $m$ or $n$ is zero, then the least common multiple is zero. One way to calculate the least common multiple is to iterate all the multiples of $m$, until you find one that is also a multiple of $n$. If you already have $gcd$ for <a href="https://rosettacode.org/wiki/Greatest_common_divisor" target="_blank" rel="noopener noreferrer nofollow">greatest common divisor</a>, then this formula calculates $lcm$.
+
+$$ \\operatorname{lcm}(m, n) = \\frac{|m \\times n|}{\\operatorname{gcd}(m, n)} $$
 
 # --instructions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/left-factorials.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/left-factorials.md
index 36c2761d93e..6f589d1f1e1 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/left-factorials.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/left-factorials.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ee0
 title: Left factorials
-challengeType: 5
+challengeType: 1
 forumTopicId: 302302
 dashedName: left-factorials
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/letter-frequency.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/letter-frequency.md
index d7c0a30349b..1efeade3f64 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/letter-frequency.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/letter-frequency.md
@@ -1,7 +1,7 @@
 ---
 id: 5e4ce2bbac708cc68c1df25f
 title: Letter frequency
-challengeType: 5
+challengeType: 1
 forumTopicId: 385263
 dashedName: letter-frequency
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/levenshtein-distance.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/levenshtein-distance.md
index 2737ad5436a..d38c45de8b8 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/levenshtein-distance.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/levenshtein-distance.md
@@ -1,16 +1,16 @@
 ---
 id: 5e4ce2eaac708cc68c1df260
 title: Levenshtein distance
-challengeType: 5
+challengeType: 1
 forumTopicId: 385264
 dashedName: levenshtein-distance
 ---
 
 # --description--
 
-In information theory and computer science, the **Levenshtein distance** is a [metric](https://en.wikipedia.org/wiki/string metric) for measuring the amount of difference between two sequences (i.e. an [edit distance](https://en.wikipedia.org/wiki/edit distance)). The Levenshtein distance between two strings is defined as the minimum number of edits needed to transform one string into the other, with the allowable edit operations being insertion, deletion, or substitution of a single character.
+In information theory and computer science, the **Levenshtein distance** is a metric for measuring the amount of difference between two sequences (i.e. an edit distance). The Levenshtein distance between two strings is defined as the minimum number of edits needed to transform one string into the other, with the allowable edit operations being insertion, deletion, or substitution of a single character.
 
-Example:
+Ejemplo:
 
 The Levenshtein distance between "**kitten**" and "**sitting**" is 3, since the following three edits change one into the other, and there isn't a way to do it with fewer than three edits:
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
index 0448399ccbe..9b7ff866168 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
@@ -1,14 +1,14 @@
 ---
 id: 5e4ce2f5ac708cc68c1df261
 title: Linear congruential generator
-challengeType: 5
+challengeType: 1
 forumTopicId: 385266
 dashedName: linear-congruential-generator
 ---
 
 # --description--
 
-The [linear congruential generator](https://en.wikipedia.org/wiki/linear congruential generator) is a very simple example of a [random number generator](http://rosettacode.org/wiki/random number generator). All linear congruential generators use this formula:
+A linear congruential generator (LCG) is an <em>algorithm</em> that yields a sequence of pseudo-randomized numbers calculated with a discontinuous piecewise linear equation. All linear congruential generators use this formula:
 
 $$r_{n + 1} = (a \times r_n + c) \bmod m$$
 
@@ -22,7 +22,7 @@ Where:
 
 If one chooses the values of $a$, $c$ and $m$ with care, then the generator produces a uniform distribution of integers from $0$ to $m - 1$.
 
-LCG numbers have poor quality. $r_n$ and $r\_{n + 1}$ are not independent, as true random numbers would be. Anyone who knows $r_n$ can predict $r\_{n + 1}$, therefore LCG is not cryptographically secure. The LCG is still good enough for simple tasks like [Miller-Rabin primality test](http://rosettacode.org/wiki/Miller-Rabin primality test), or [FreeCell deals](http://rosettacode.org/wiki/deal cards for FreeCell). Among the benefits of the LCG, one can easily reproduce a sequence of numbers, from the same $r_0$. One can also reproduce such sequence with a different programming language, because the formula is so simple.
+<abbr title="linear congruential generator">LCG</abbr> numbers have poor quality. $r_n$ and $r\_{n + 1}$ are not independent, as true random numbers would be. Anyone who knows $r_n$ can predict $r\_{n + 1}$, therefore <abbr title="linear congruential generator">LCG</abbr> is not cryptographically secure. The <abbr title="linear congruential generator">LCG</abbr> is still good enough for simple tasks like Miller-Rabin primality test, or FreeCell deals. Among the benefits of the <abbr title="linear congruential generator">LCG</abbr>, one can easily reproduce a sequence of numbers, from the same $r_0$. One can also reproduce such sequence with a different programming language, because the formula is so simple.
 
 # --instructions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/long-multiplication.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/long-multiplication.md
index fb4e2456cf3..174bde82794 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/long-multiplication.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/long-multiplication.md
@@ -1,14 +1,14 @@
 ---
 id: 5e4ce2a1ac708cc68c1df25d
 title: Long multiplication
-challengeType: 5
+challengeType: 1
 forumTopicId: 385269
 dashedName: long-multiplication
 ---
 
 # --description--
 
-Explicitly implement [long multiplication](https://en.wikipedia.org/wiki/long multiplication).
+Explicitly implement long multiplication.
 
 This is one possible approach to arbitrary-precision integer algebra.
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
index b027a10f5ea..5b4f0d4c1d3 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
@@ -1,29 +1,23 @@
 ---
 id: 5e6dd1278e6ca105cde40ea9
 title: Longest common subsequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 385271
 dashedName: longest-common-subsequence
 ---
 
 # --description--
 
-The **longest common subsequence** (or [**LCS**](http://en.wikipedia.org/wiki/Longest_common_subsequence_problem)) of groups A and B is the longest group of elements from A and B that are common between the two groups and in the same order in each group. For example, the sequences "1234" and "1224533324" have an LCS of "1234":
+The **longest common subsequence** (or **LCS**) of groups A and B is the longest group of elements from A and B that are common between the two groups and in the same order in each group. For example, the sequences `1234` and `1224533324` have an LCS of `1234`:<u>1234</u>
+<u>12</u>245<u>3</u>332<u>4</u>
 
-***1234***
+For a string example, consider the sequences `thisisatest` and `testing123testing`. An LCS would be `tsitest`:
+<u>t</u>hi<u>si</u>sa<u>test</u>
 
-***12***245***3***332***4***
-
-For a string example, consider the sequences "thisisatest" and "testing123testing". An LCS would be "tsitest":
-
-***t***hi***si***sa***test***
-
-***t***e***s***t***i***ng123***test***ing.
+<u>t</u>e<u>s</u>t<u>i</u>ng123<u>test</u>ing.
 
 Your code only needs to deal with strings.
 
-For more information on this problem please see [Wikipedia](https://en.wikipedia.org/wiki/Longest_common_subsequence_problem).
-
 # --instructions--
 
 Write a case-sensitive function that returns the LCS of two strings. You don't need to show multiple LCS's.
@@ -86,8 +80,8 @@ function lcs(a, b) {
 
 ```js
 function lcs(a, b) {
-  var aSub = a.substr(0, a.length - 1);
-  var bSub = b.substr(0, b.length - 1);
+  var aSub = a.substring(0, a.length - 1);
+  var bSub = b.substring(0, b.length - 1);
 
   if (a.length === 0 || b.length === 0) {
     return '';
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md
index 0ba5661f6c8..0cd96a6d6cc 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md
@@ -1,7 +1,7 @@
 ---
 id: 5e6dd139859c290b6ab80292
 title: Longest increasing subsequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 385272
 dashedName: longest-increasing-subsequence
 ---
@@ -12,14 +12,14 @@ The longest increasing subsequence problem is to find a subsequence of a given s
 
 For the following array:
 
-$\\{3, 10, 2, 1, 20\\}$
+```js
+const array = [3, 10, 2, 1, 20];
+```
 
 Longest increasing sequence is:
 
 $\\{3, 10, 20\\}$
 
-For more information on this problem please see [Wikipedia](https://en.wikipedia.org/wiki/Longest increasing subsequence).
-
 # --instructions--
 
 Write a function that takes an array of numbers as a parameter and returns the longest increasing subsequence.
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/longest-string-challenge.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/longest-string-challenge.md
index 06a0c9d5503..f4bedb96bcc 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/longest-string-challenge.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/longest-string-challenge.md
@@ -1,7 +1,7 @@
 ---
 id: 5e6dd14192286d95fc43046e
 title: Longest string challenge
-challengeType: 5
+challengeType: 1
 forumTopicId: 385275
 dashedName: longest-string-challenge
 ---
@@ -28,7 +28,7 @@ assert(typeof longestString == 'function');
 assert(Array.isArray(longestString(['a', 'bb', 'ccc', 'ee', 'f', 'ggg'])));
 ```
 
-`longestString(["a", "bb", "ccc", "ee", "f", "ggg"])` should return `["ccc", "ggg"]'`.
+`longestString(["a", "bb", "ccc", "ee", "f", "ggg"])` should return `["ccc", "ggg"]`.
 
 ```js
 assert.deepEqual(longestString(['a', 'bb', 'ccc', 'ee', 'f', 'ggg']), [
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md
index ed09269a091..464d824a0c9 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md
@@ -1,14 +1,14 @@
 ---
 id: 5e6dd14797f5ce267c2f19d0
 title: Look-and-say sequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 385277
 dashedName: look-and-say-sequence
 ---
 
 # --description--
 
-The [Look and say sequence](https://en.wikipedia.org/wiki/Look and say sequence) is a recursively defined sequence of numbers.
+The Look and say sequence is a recursively defined sequence of numbers.
 
 Sequence Definition
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/loop-over-multiple-arrays-simultaneously.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/loop-over-multiple-arrays-simultaneously.md
index e8924ccd287..d0bd62b8726 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/loop-over-multiple-arrays-simultaneously.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/loop-over-multiple-arrays-simultaneously.md
@@ -1,7 +1,7 @@
 ---
 id: 5e6dd15004c88cf00d2a78b3
 title: Loop over multiple arrays simultaneously
-challengeType: 5
+challengeType: 1
 forumTopicId: 385279
 dashedName: loop-over-multiple-arrays-simultaneously
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/lu-decomposition.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/lu-decomposition.md
index 1b2442f3056..441680f24fb 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/lu-decomposition.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/lu-decomposition.md
@@ -1,20 +1,20 @@
 ---
 id: 5e6decd8ec8d7db960950d1c
 title: LU decomposition
-challengeType: 5
+challengeType: 1
 forumTopicId: 385280
 dashedName: lu-decomposition
 ---
 
 # --description--
 
-Every square matrix $A$ can be decomposed into a product of a lower triangular matrix $L$ and a upper triangular matrix $U$, as described in [LU decomposition](https://en.wikipedia.org/wiki/LU decomposition).
+Every square matrix $A$ can be decomposed into a product of a lower triangular matrix $L$ and a upper triangular matrix $U$. This is known as the LU decomposition.
 
 $A = LU$
 
 It is a modified form of Gaussian elimination.
 
-While the [Cholesky decomposition](http://rosettacode.org/wiki/Cholesky decomposition) only works for symmetric, positive definite matrices, the more general LU decomposition works for any square matrix.
+While the Cholesky decomposition only works for symmetric, positive definite matrices, the more general LU decomposition works for any square matrix.
 
 There are several algorithms for calculating $L$ and $U$.
 
@@ -70,7 +70,7 @@ The solution to this problem is *pivoting* $A$, which means rearranging the rows
 
 $PA \\Rightarrow A'$
 
-Example:
+Ejemplo:
 
 \\begin{align} \\begin{pmatrix} 0 & 1 \\\\ 1 & 0 \\end{pmatrix} \\begin{pmatrix} 1 & 4 \\\\ 2 & 3 \\end{pmatrix} \\Rightarrow \\begin{pmatrix} 2 & 3 \\\\ 1 & 4 \\end{pmatrix} \\end{align}
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/lucas-lehmer-test.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/lucas-lehmer-test.md
index 83d3d2bbfaf..e909f6b3f6a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/lucas-lehmer-test.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/lucas-lehmer-test.md
@@ -1,7 +1,7 @@
 ---
 id: 5e6dee7749a0b85a3f1fc7d5
 title: Lucas-Lehmer test
-challengeType: 5
+challengeType: 1
 forumTopicId: 385281
 dashedName: lucas-lehmer-test
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/ludic-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/ludic-numbers.md
index 0e7be774f58..1311dbd718a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/ludic-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/ludic-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 5ea281203167d2b0bdefca00
 title: Ludic numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 385282
 dashedName: ludic-numbers
 ---
 
 # --description--
 
-[Ludic numbers](https://oeis.org/wiki/Ludic_numbers) are related to prime numbers as they are generated by a sieve quite like the [Sieve of Eratosthenes](https://rosettacode.org/wiki/Sieve_of_Eratosthenes) is used to generate prime numbers.
+Ludic numbers are related to prime numbers as they are generated by a sieve quite like the Sieve of Eratosthenes is used to generate prime numbers.
 
 The first ludic number is 1.
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md
index 4fcc90502ab..596dfd62879 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 5ea28156e79528a9ab248f27
 title: Luhn test of credit card numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 385284
 dashedName: luhn-test-of-credit-card-numbers
 ---
 
 # --description--
 
-The [Luhn test](https://en.wikipedia.org/wiki/Luhn algorithm) is used by some credit card companies to distinguish valid credit card numbers from what could be a random selection of digits.
+The Luhn test is used by some credit card companies to distinguish valid credit card numbers from what could be a random selection of digits.
 
 Those companies using credit card numbers that can be validated by the Luhn test have numbers that pass the following test:
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/lychrel-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/lychrel-numbers.md
index 5ffc202ebd9..be2d4482f9f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/lychrel-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/lychrel-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5ea2815a8640bcc6cb7dab3c
 title: Lychrel numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 385287
 dashedName: lychrel-numbers
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/lzw-compression.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/lzw-compression.md
index ccde98aa946..e4aa0f6e571 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/lzw-compression.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/lzw-compression.md
@@ -1,7 +1,7 @@
 ---
 id: 5ea2815e364d9a2222ea55f8
 title: LZW compression
-challengeType: 5
+challengeType: 1
 forumTopicId: 385288
 dashedName: lzw-compression
 ---
@@ -10,8 +10,6 @@ dashedName: lzw-compression
 
 The Lempel-Ziv-Welch (LZW) algorithm provides loss-less data compression.
 
-You can read a complete description of it in the [Wikipedia article](https://en.wikipedia.org/wiki/Lempel-Ziv-Welch) on the subject.
-
 # --instructions--
 
 Write a function that takes two parameters. The first parameter is a boolean where `true` indicates compress and `false` indicates decompress. The second parameter is either a string or an array to be processed. If it is a string to be compressed, return an array of numbers. If it's an array of numbers to be decompressed, return a string.
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/s-expressions.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/s-expressions.md
index 19304897ae8..df583d4cb2a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/s-expressions.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/s-expressions.md
@@ -1,14 +1,14 @@
 ---
 id: 59667989bf71cf555dd5d2ff
 title: S-Expressions
-challengeType: 5
+challengeType: 1
 forumTopicId: 302303
 dashedName: s-expressions
 ---
 
 # --description--
 
-[S-Expressions](https://en.wikipedia.org/wiki/S-Expression "wp: S-Expression") are one convenient way to parse and store data.
+<a href="https://rosettacode.org/wiki/S-expressions" target="_blank" rel="noopener noreferrer nofollow">S-Expressions</a> are one convenient way to parse and store data.
 
 # --instructions--
 
@@ -32,7 +32,7 @@ The reader should be able to read the following input
 (data (!@# (4.5) "(more" "data)")))
 </pre>
 
-and turn it into a native data structure. (See the [Pike](https://rosettacode.org/wiki/S-Expressions#Pike "\#Pike"), [Python](https://rosettacode.org/wiki/S-Expressions#Python "\#Python") and [Ruby](https://rosettacode.org/wiki/S-Expressions#Ruby "\#Ruby") implementations for examples of native data structures.)
+and turn it into a native data structure.
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
index ec8a0c6e2db..8117215835e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
@@ -1,23 +1,24 @@
 ---
 id: 59da22823d04c95919d46269
 title: 'Sailors, coconuts and a monkey problem'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302304
 dashedName: sailors-coconuts-and-a-monkey-problem
 ---
 
 # --description--
 
-Five sailors are shipwrecked on an island and collect a large pile of coconuts during the day. That night the first sailor wakes up and decides to take his first share early so tries to divide the pile of coconuts equally into five piles but finds that there is one coconut left over, so he tosses it to a monkey and then hides "his" one of the five equally sized piles of coconuts and pushes the other four piles together to form a single visible pile of coconuts again and goes to bed. To cut a long story short, each of the sailors in turn gets up once during the night and performs the same actions of dividing the coconut pile into five, finding that one coconut is left over and giving that single remainder coconut to the monkey. In the morning (after the surreptitious and separate action of each of the five sailors during the night), the remaining coconuts are divided into five equal piles for each of the sailors, whereupon it is found that the pile of coconuts divides equally amongst the sailors with no remainder. (Nothing for the monkey in the morning.)
+Five sailors are shipwrecked on an island and collect a large pile of coconuts during the day.
+
+That night the first sailor wakes up and decides to take his first share early so tries to divide the pile of coconuts equally into five piles but finds that there is one coconut left over, so he tosses it to a monkey and then hides "his" one of the five equally sized piles of coconuts and pushes the other four piles together to form a single visible pile of coconuts again and goes to bed.
+
+To cut a long story short, each of the sailors in turn gets up once during the night and performs the same actions of dividing the coconut pile into five, finding that one coconut is left over and giving that single remainder coconut to the monkey, then push the other four piles together to form a single pile.
+
+In the morning (after the surreptitious and separate action of each of the five sailors during the night), the remaining coconuts are divided into five equal piles for each of the sailors, whereupon it is found that the pile of coconuts divides equally amongst the sailors with no remainder. (Nothing for the monkey in the morning.)
 
 # --instructions--
 
-Create a function that returns the minimum possible size of the initial pile of coconuts collected during the day for `N` sailors. **Note:** Of course the tale is told in a world where the collection of any amount of coconuts in a day and multiple divisions of the pile, etc. can occur in time fitting the story line, so as not to affect the mathematics. **C.f:**
-
-<ul>
-  <li><a href="https://www.youtube.com/watch?v=U9qU20VmvaU" target="_blank"> Monkeys and Coconuts - Numberphile</a> (Video) Analytical solution.</li>
-  <li><a href="https://oeis.org/A002021" target="_blank">A002021 Pile of coconuts problem</a> The On-Line Encyclopedia of Integer Sequences. (Although some of its references may use the alternate form of the tale).</li>
-</ul>
+Create a function that returns the minimum possible size of the initial pile of coconuts collected during the day for `N` sailors. **Note:** Of course the tale is told in a world where the collection of any number of coconuts in a day and multiple divisions of the pile, etc. can occur in time fitting the story line, so as not to affect mathematics.
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/search-a-list-of-records.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/search-a-list-of-records.md
index f4fa1a4452e..439ece2740e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/search-a-list-of-records.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/search-a-list-of-records.md
@@ -1,7 +1,7 @@
 ---
 id: 5eb3e497b8d6d7f63c5517ea
 title: Search a list of records
-challengeType: 5
+challengeType: 1
 forumTopicId: 385315
 dashedName: search-a-list-of-records
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sedols.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sedols.md
index 9d5ce33e9d3..9ace124614e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sedols.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sedols.md
@@ -1,14 +1,16 @@
 ---
 id: 59d9c6bc214c613ba73ff012
 title: SEDOLs
-challengeType: 5
+challengeType: 1
 forumTopicId: 302305
 dashedName: sedols
 ---
 
 # --description--
 
-For each number list of 6-digit [SEDOL](https://en.wikipedia.org/wiki/SEDOL "wp: SEDOL")s, calculate and append the checksum digit. That is, given the input string on the left, your function should return the corresponding string on the right:
+<abbr title="Stock Exchange Daily Official List">SEDOL</abbr> is a list of securities identification numbers issued by the London Stock Exchange.
+
+For each number list of 6-digit <abbr title="Stock Exchange Daily Official List">SEDOL</abbr>s, calculate and append the checksum digit. That is, given the input string on the left, your function should return the corresponding string on the right:
 
 <pre>
 710889 => 7108899
@@ -64,8 +66,9 @@ assert(sedol('228276') === '2282765');
 
 ```js
 function sedol(input) {
+  const checkSum = 0
 
-  return true;
+  return checkSum;
 }
 ```
 
@@ -90,7 +93,7 @@ function sedolCheckDigit(char6) {
   for (let i = 0; i < char6.length; i++) {
     sum += weight[i] * parseInt(char6.charAt(i), 36);
   }
-  const check = (10 - (sum % 10)) % 10;
-  return check.toString();
+  const checkSum = (10 - (sum % 10)) % 10;
+  return checkSum.toString();
 }
 ```
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/self-describing-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
index df2a88508fb..dc5318141ce 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 5eaf48389ee512d4d103684b
 title: Self Describing Numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 385289
 dashedName: self-describing-numbers
 ---
 
 # --description--
 
-There are several so-called "self describing" or ["self-descriptive"](https://en.wikipedia.org/wiki/Self-descriptive_number) integers.
+There are several so-called "self-describing" or "self-descriptive" integers.
 
 An integer is said to be "self-describing" if it has the property that, when digit positions are labeled 0 to N-1, the digit in each position is equal to the number of times that digit appears in the number.
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/self-referential-sequence.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/self-referential-sequence.md
index 11beda8ba0b..086840b687f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/self-referential-sequence.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/self-referential-sequence.md
@@ -1,14 +1,14 @@
 ---
 id: 5eb3e4a21f462f409d656c73
 title: Self-referential sequence
-challengeType: 5
+challengeType: 1
 forumTopicId: 385317
 dashedName: self-referential-sequence
 ---
 
 # --description--
 
-There are several ways to generate a self-referential sequence. One very common one (the [Look-and-say sequence](https://rosettacode.org/wiki/Look-and-say sequence)) is to start with a positive integer, then generate the next term by concatenating enumerated groups of adjacent alike digits:
+There are several ways to generate a self-referential sequence. One very common one (the <a href="https://rosettacode.org/wiki/Look-and-say_sequence" target="_blank" rel="noopener noreferrer nofollow">Look-and-say sequence</a>) is to start with a positive integer, then generate the next term by concatenating enumerated groups of adjacent alike digits:
 
 <pre>0, 10, 1110, 3110, 132110, 1113122110, 311311222110 ...</pre>
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/semiprime.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/semiprime.md
index 961f13632fd..590e77332ef 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/semiprime.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/semiprime.md
@@ -1,14 +1,14 @@
 ---
 id: 5eb3e4aa847216613aa81983
 title: Semiprime
-challengeType: 5
+challengeType: 1
 forumTopicId: 385318
 dashedName: semiprime
 ---
 
 # --description--
 
-Semiprime numbers are natural numbers that are products of exactly two (possibly equal) [prime numbers](https://rosettacode.org/wiki/prime_number).
+Semiprime numbers are natural numbers that are products of exactly two (possibly equal) <a href="https://rosettacode.org/wiki/prime_number" target="_blank" rel="noopener noreferrer nofollow">prime numbers</a>.
 
 <pre>1679  =  23 x 73</pre>
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/set-of-real-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/set-of-real-numbers.md
index 7633b59b8a4..addfc4c751b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/set-of-real-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/set-of-real-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5eb3e4b20aa93c437f9e9717
 title: Set of real numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 385322
 dashedName: set-of-real-numbers
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sha-1.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sha-1.md
index dfdbce67dc1..3ac65ad9604 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sha-1.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sha-1.md
@@ -1,7 +1,7 @@
 ---
 id: 5eb3e4b5f629b9a07429a5d2
 title: SHA-1
-challengeType: 5
+challengeType: 1
 forumTopicId: 385326
 dashedName: sha-1
 ---
@@ -16,7 +16,7 @@ BitTorrent uses SHA-1 to verify downloads.
 
 Git and Mercurial use SHA-1 digests to identify commits.
 
-A US government standard, [FIPS 180-1](https://rosettacode.org/wiki/SHA-1/FIPS-180-1), defines SHA-1.
+A US government standard, <a href="https://rosettacode.org/wiki/SHA-1/FIPS-180-1" target="_blank" rel="noopener noreferrer nofollow">FIPS 180-1</a>, defines SHA-1.
 
 # --instructions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sha-256.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sha-256.md
index 9ce0ca4260d..183173a97d2 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sha-256.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sha-256.md
@@ -1,7 +1,7 @@
 ---
 id: 5eb3e4c3a894c333d2811a3f
 title: SHA-256
-challengeType: 5
+challengeType: 1
 forumTopicId: 385328
 dashedName: sha-256
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sort-an-array-of-composite-structures.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sort-an-array-of-composite-structures.md
index e2a4065371e..124644791f7 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sort-an-array-of-composite-structures.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sort-an-array-of-composite-structures.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc7ffe
 title: Sort an array of composite structures
-challengeType: 5
+challengeType: 1
 forumTopicId: 302306
 dashedName: sort-an-array-of-composite-structures
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md
index b6647f28247..8f1ef877e53 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8000
 title: Sort disjoint sublist
-challengeType: 5
+challengeType: 1
 forumTopicId: 302307
 dashedName: sort-disjoint-sublist
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sort-stability.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sort-stability.md
index 3f57407b6af..0820e0c2d77 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sort-stability.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sort-stability.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8014
 title: Sort stability
-challengeType: 5
+challengeType: 1
 forumTopicId: 302308
 dashedName: sort-stability
 ---
 
 # --description--
 
-When sorting records in a table by a particular column or field, a [stable sort](https://en.wikipedia.org/wiki/Stable_sort#Stability) will always retain the relative order of records that have the same key.
+When sorting records in a table by a particular column or field, a <a href="https://www.freecodecamp.org/news/stability-in-sorting-algorithms-a-treatment-of-equality-fa3140a5a539/" target="_blank" rel="noopener noreferrer nofollow">stable sort</a> will always retain the relative order of records that have the same key.
 
 For example, in this table of countries and cities, a stable sort on the **second** column, the cities, would keep the US Birmingham above the UK Birmingham. (Although an unstable sort *might*, in this case, place the US Birmingham above the UK Birmingham, a stable sort routine would *guarantee* it).
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sort-using-a-custom-comparator.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sort-using-a-custom-comparator.md
index e7e7919d0be..175dd475233 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sort-using-a-custom-comparator.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sort-using-a-custom-comparator.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8016
 title: Sort using a custom comparator
-challengeType: 5
+challengeType: 1
 forumTopicId: 302309
 dashedName: sort-using-a-custom-comparator
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md
index 02b836f4de3..0225d98889f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md
@@ -1,54 +1,54 @@
 ---
 id: 5a23c84252665b21eecc8001
-title: Sorting algorithms/Bead sort
-challengeType: 5
+title: Algoritmos de ordenamiento/Bead sort
+challengeType: 1
 forumTopicId: 302310
 dashedName: sorting-algorithmsbead-sort
 ---
 
 # --description--
 
-Sort an array of positive integers using the [Bead Sort Algorithm](https://en.wikipedia.org/wiki/Bead_sort).
+A *bead sort* starts by creating a matrix of zeroes whose length is equal to the value of the largest element in the input array. The matrix is transformed by adding one to all elements between the zeroth index and the index indicated by the current element. This process is repeated, until you have filled the matrix.
 
-A *bead sort* is also known as a *gravity sort*.
+Iterating over the matrix, summing the number of elements greater than zero, then decreasing the value of each element by one yields the sorted array.
 
-The algorithm has O(S), where S is the sum of the integers in the input set: Each bead is moved individually.
+**Note:** Each element in the input array is unique.
 
-This is the case when bead sort is implemented without a mechanism to assist in finding empty spaces below the beads, such as in software implementations.
+Sort an array of positive integers using the Bead Sort Algorithm.
 
 # --hints--
 
-`beadSort` should be a function.
+`beadSort` debe ser una función.
 
 ```js
 assert(typeof beadSort == 'function');
 ```
 
-`beadSort([25, 32, 12, 7, 20])` should return an array.
+`beadSort([25, 32, 12, 7, 20])` debe devolver un 'array'.
 
 ```js
 assert(Array.isArray(beadSort([25, 32, 12, 7, 20])));
 ```
 
-`beadSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
+`beadSort([25, 32, 12, 7, 20])` debe devolver `[7, 12, 20, 25, 32]`.
 
 ```js
 assert.deepEqual(beadSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
 ```
 
-`beadSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
+`beadSort([38, 45, 35, 8, 13])` debe devolver `[8, 13, 35, 38, 45]`.
 
 ```js
 assert.deepEqual(beadSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
 ```
 
-`beadSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
+`beadSort([43, 36, 20, 34, 24])` debe devolver `[20, 24, 34, 36, 43]`.
 
 ```js
 assert.deepEqual(beadSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
 ```
 
-`beadSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
+`beadSort([12, 33, 26, 18, 1, 16, 38])` debe devolver `[1, 12, 16, 18, 26, 33, 38]`.
 
 ```js
 assert.deepEqual(beadSort([12, 33, 26, 18, 1, 16, 38]), [
@@ -62,7 +62,7 @@ assert.deepEqual(beadSort([12, 33, 26, 18, 1, 16, 38]), [
 ]);
 ```
 
-`beadSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
+`beadSort([3, 39, 48, 16, 1, 4, 29])` debe devolver `[1, 3, 4, 16, 29, 39, 48]`.
 
 ```js
 assert.deepEqual(beadSort([3, 39, 48, 16, 1, 4, 29]), [
@@ -90,31 +90,31 @@ function beadSort(arr) {
 
 ```js
 function beadSort(arr) {
-  var max = 0;
-  for (var i = 0; i < arr.length; i++) if (arr[i] > max) max = arr[i];
-  var grid = new Array(arr.length);
-  for (var i = 0; i < grid.length; i++) {
+  let max = 0;
+  for (let i = 0; i < arr.length; i++) if (arr[i] > max) max = arr[i];
+  const grid = new Array(arr.length);
+  for (let i = 0; i < grid.length; i++) {
     grid[i] = new Array(max);
   }
-  var levelcount = new Array(max);
+  const levelcount = new Array(max);
   levelcount.fill(0);
-  for (var i = 0; i < max; i++) {
+  for (let i = 0; i < max; i++) {
     levelcount[i] = 0;
-    for (var j = 0; j < arr.length; j++) grid[j][i] = '_';
+    for (let j = 0; j < arr.length; j++) grid[j][i] = '_';
   }
-  for (var i = 0; i < arr.length; i++) {
-    var num = arr[i];
-    for (var j = 0; num > 0; j++) {
+  for (let i = 0; i < arr.length; i++) {
+    let num = arr[i];
+    for (let j = 0; num > 0; j++) {
       grid[levelcount[j]++][j] = '*';
       num--;
     }
   }
-  var sorted = new Array(arr.length);
+  const sorted = new Array(arr.length);
   sorted.fill(0);
-  for (var i = 0; i < arr.length; i++) {
-    var putt = 0;
+  for (let i = 0; i < arr.length; i++) {
+    let putt = 0;
     for (
-      var j = 0;
+      let j = 0;
       j < max &&
       (function(c) {
         return c.charCodeAt == null ? c : c.charCodeAt(0);
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md
index 2a7b74b5e3a..efc32e9e5a3 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8002
 title: Sorting algorithms/Bogosort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302311
 dashedName: sorting-algorithmsbogosort
 ---
 
 # --description--
 
-[Bogosort](https://en.wikipedia.org/wiki/Bogosort) a list of numbers.
+Bogosort a list of numbers.
 
 Bogosort simply shuffles a collection randomly until it is sorted.
 
@@ -18,7 +18,7 @@ Its average run-time is O(n!) because the chance that any given shuffle of a set
 
 Its best case is O(n) since a single pass through the elements may suffice to order them.
 
-Pseudocode:
+Pseudocódigo:
 
 <pre><b>while not</b> InOrder(list) <b>do</b>
   Shuffle(list)
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
index f4c1b63f681..9f8a3bcb821 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
@@ -1,36 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8004
 title: Sorting algorithms/Cocktail sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302312
 dashedName: sorting-algorithmscocktail-sort
 ---
 
 # --description--
 
-The cocktail shaker sort is an improvement on the [Bubble Sort](https://rosettacode.org/wiki/Bubble Sort). The improvement is basically that values "bubble" both directions through the array, because on each iteration the cocktail shaker sort bubble sorts once forwards and once backwards. Pseudocode for the algorithm (from [wikipedia](https://en.wikipedia.org/wiki/Cocktail sort)):
-
-<pre><b>function</b> <i>cocktailSort</i>( A : list of sortable items )
-  <b>do</b>
-    swapped := false
-    <b>for each</b> i <b>in</b> 0 <b>to</b> length( A ) - 2 <b>do</b>
-      <b>if</b> A[ i ] > A[ i+1 ] <b>then</b> <i>// test whether the two</i>
-                                <i>// elements are in the wrong</i>
-                                <i>// order</i>
-        swap( A[ i ], A[ i+1 ] ) <i>// let the two elements</i>
-                                 <i>// change places</i>
-        swapped := true;
-    <b>if</b> swapped = false <b>then</b>
-      <i>// we can exit the outer loop here if no swaps occurred.</i>
-      <b>break do-while loop</b>;
-    swapped := false
-    <b>for each</b> i <b>in</b> length( A ) - 2 <b>down to</b> 0 <b>do</b>
-      <b>if</b> A[ i ] > A[ i+1 ] <b>then</b>
-        swap( A[ i ], A[ i+1 ] )
-        swapped := true;
-  <b>while</b> swapped; <i>// if no elements have been swapped,</i>
-                <i>// then the list is sorted</i>
-</pre>
+The <a href="https://rosettacode.org/wiki/Sorting_algorithms/Cocktail_sort" target="_blank" rel="noopener noreferrer nofollow">cocktail sort</a> is an improvement on the Bubble Sort. Given an array of numbers, the cocktail sort will traverse the array from start to finish, moving the largest number to the end. Then, it will traverse the array backwards and move the smallest number to the start. It repeats these two passes, moving the next largest/smallest number to its correct position in the array until it is sorted.
 
 # --instructions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
index 472ce20af5a..5f19360a31f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8005
 title: Sorting algorithms/Comb sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302313
 dashedName: sorting-algorithmscomb-sort
 ---
@@ -10,20 +10,14 @@ dashedName: sorting-algorithmscomb-sort
 
 Implement a *comb sort*.
 
-The **Comb Sort** is a variant of the [Bubble Sort](https://rosettacode.org/wiki/Bubble Sort).
+The **Comb Sort** is a variant of the Bubble Sort.
 
-Like the [Shell sort](https://rosettacode.org/wiki/Shell sort), the Comb Sort increases the gap used in comparisons and exchanges.
+Like the Shell sort, the Comb Sort increases the gap used in comparisons and exchanges.
 
 Dividing the gap by $(1-e^{-\\varphi})^{-1} \\approx 1.247330950103979$ works best, but 1.3 may be more practical.
 
 Some implementations use the insertion sort once the gap is less than a certain amount.
 
-**Also see**
-
-<ul>
-  <li>the Wikipedia article: <a href='https://en.wikipedia.org/wiki/Comb sort' target='_blank'>Comb sort</a>.</li>
-</ul>
-
 Variants:
 
 <ul>
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
index e3162404d9b..c0315d5275f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8007
 title: Sorting algorithms/Gnome sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302314
 dashedName: sorting-algorithmsgnome-sort
 ---
 
 # --description--
 
-Gnome sort is a sorting algorithm which is similar to [Insertion sort](https://rosettacode.org/wiki/Insertion sort), except that moving an element to its proper place is accomplished by a series of swaps, as in [Bubble Sort](https://rosettacode.org/wiki/Bubble Sort).
+Gnome sort is a sorting algorithm which is similar to <a href="https://rosettacode.org/wiki/Insertion_sort" target="_blank" rel="noopener noreferrer nofollow">Insertion sort</a>, except that moving an element to its proper place is accomplished by a series of swaps, as in <a href="https://rosettacode.org/wiki/Bubble" target="_blank" rel="noopener noreferrer nofollow">Bubble Sort</a>.
 
 The pseudocode for the algorithm is:
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md
index f107df7b79a..f93ad1aac07 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc800b
 title: Sorting algorithms/Pancake sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302315
 dashedName: sorting-algorithmspancake-sort
 ---
 
 # --description--
 
-Write a function to sort an array of integers (of any convenient size) into ascending order using [Pancake sorting](https://en.wikipedia.org/wiki/Pancake sorting). The function should return the sorted array.
+Write a function to sort an array of integers (of any convenient size) into ascending order using Pancake sorting. The function should return the sorted array.
 
 In short, instead of individual elements being sorted, the only operation allowed is to "flip" one end of the list, like so:
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-permutation-sort.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-permutation-sort.md
index d5fc1e3b083..4c7d36fb5a4 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-permutation-sort.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-permutation-sort.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc800c
 title: Sorting algorithms/Permutation sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302316
 dashedName: sorting-algorithmspermutation-sort
 ---
@@ -10,7 +10,7 @@ dashedName: sorting-algorithmspermutation-sort
 
 Write a function to implement a permutation sort, which proceeds by generating the possible permutations of the input array until discovering the sorted one. The function should return the sorted array.
 
-Pseudocode:
+Pseudocódigo:
 
 <pre><b>while not</b> InOrder(list) <b>do</b>
   nextPermutation(list)
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md
index 09403447320..53f76a0a3a2 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8010
 title: Sorting algorithms/Shell sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302317
 dashedName: sorting-algorithmsshell-sort
 ---
 
 # --description--
 
-Write a function to sort an array of elements using the [Shell sort](https://en.wikipedia.org/wiki/Shell sort) algorithm, a diminishing increment sort. The function should return the sorted array.
+Write a function to sort an array of elements using the Shell sort algorithm, a diminishing increment sort. The function should return the sorted array.
 
 The Shell sort (also known as Shellsort or Shell's method) is named after its inventor, Donald Shell, who published the algorithm in 1959.
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md
index ec108886c1f..23819a80eb9 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8012
 title: Sorting algorithms/Stooge sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302318
 dashedName: sorting-algorithmsstooge-sort
 ---
 
 # --description--
 
-Write a function to perform [Stooge Sort](https://en.wikipedia.org/wiki/Stooge sort) on an array of integers. The function should return a sorted array.
+Write a function to perform Stooge Sort on an array of integers. The function should return a sorted array.
 
 The Stooge Sort algorithm is as follows:
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
index d8408782db5..af66009395b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
@@ -1,16 +1,28 @@
 ---
 id: 5a23c84252665b21eecc8013
 title: Sorting algorithms/Strand sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302319
 dashedName: sorting-algorithmsstrand-sort
 ---
 
 # --description--
 
-Write a function to sort an array using the [Strand sort](https://en.wikipedia.org/wiki/Strand sort). The function should return the sorted array.
+The **Strand sort** creates sorted subsets that are merged to create the final result.
+
+Consider an `unsortedArray = [3, 1, 4, 2]`. Pick the first item `3` and copy it into a separate array. Search for any bigger item following this item. When you find the a larger item, in this case `4`, copy it to the separate array, `[3, 4]`, and compare the following items to this new value, `4`.
+
+After you have reached the end of the array, remove the items you copied, `[3, 4]`, and start again with the first item remaining in the `unsortedArray`, in this case `1`.
+
+Following this process results in two sorted arrays, `[3, 4]` and `[1, 2]`. Merge these two arrays to create the `strandSortedArray`.
+
+```js
+const unsortedArray = [3, 1, 4, 2];
+const strandsortedArray = [1, 2, 3, 4];
+```
+
+Write a function to sort an array using the **Strand sort**. The function should return the sorted array.
 
-This is a way of sorting numbers by extracting shorter sequences of already sorted numbers from an unsorted list.
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/soundex.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/soundex.md
index b7574b38375..b51c5bc6b71 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/soundex.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/soundex.md
@@ -1,14 +1,24 @@
 ---
 id: 5a23c84252665b21eecc8017
 title: Soundex
-challengeType: 5
+challengeType: 1
 forumTopicId: 302320
 dashedName: soundex
 ---
 
 # --description--
 
-Soundex is an algorithm for creating indices for words based on their pronunciation. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling (from [the WP article](https://en.wikipedia.org/wiki/soundex)). There is a major issue in many of the implementations concerning the separation of two consonants that have the same soundex code! According to the [official Rules](https://www.archives.gov/research/census/soundex.html). So check for instance if **Ashcraft** is coded to **A-261**.
+**Soundex Algorithm** deals with the *intentions* of the words. It creates a representation for similar sounding words.
+
+It is used for searching <em>names</em> and <em>addresses</em>. This means that the person who filled in the <em>name</em>, can focus on how it sounds instead of correcting the spelling of <em>names</em>.
+
+For example:
+
+If you are hearing the name `Quenci` for the first time, and misspelled it, you will get **Soundex** code `Q520`.
+
+When you spell the name `Quincy` correctly next time, you will still get the same code `Q520`, which means you can link multiple name pronunciations into the same <em>person</em> without the need for adding every spelling.
+
+Here is the rules: 
 
 <ul>
   <li>If a vowel (A, E, I, O, U) separates two consonants that have the same soundex code, the consonant to the right of the vowel is coded. Tymczak is coded as T-522 (T, 5 for the M, 2 for the C, Z ignored (see "Side-by-Side" rule above), 2 for the K). Since the vowel "A" separates the Z and K, the K is coded.</li>
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/spiral-matrix.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/spiral-matrix.md
index 14da95f5a2f..fbdd024181b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/spiral-matrix.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/spiral-matrix.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc801c
 title: Spiral matrix
-challengeType: 5
+challengeType: 1
 forumTopicId: 302321
 dashedName: spiral-matrix
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/split-a-character-string-based-on-change-of-character.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/split-a-character-string-based-on-change-of-character.md
index 4bb28fba9a6..5a7cd85889d 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/split-a-character-string-based-on-change-of-character.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/split-a-character-string-based-on-change-of-character.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc801d
 title: Split a character string based on change of character
-challengeType: 5
+challengeType: 1
 forumTopicId: 302322
 dashedName: split-a-character-string-based-on-change-of-character
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/state-name-puzzle.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/state-name-puzzle.md
index d22ef19220a..841319d1bda 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/state-name-puzzle.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/state-name-puzzle.md
@@ -1,18 +1,21 @@
 ---
 id: 5a23c84252665b21eecc8024
 title: State name puzzle
-challengeType: 5
+challengeType: 1
 forumTopicId: 302323
 dashedName: state-name-puzzle
 ---
 
 # --description--
 
-This task is inspired by Mark Nelson's DDJ Column "Wordplay" and one of the weekly puzzle challenges from Will Shortz on NPR Weekend Edition [\[1\]](https://www.npr.org/templates/story/story.php?storyId=9264290) and originally attributed to David Edelheit. The challenge was to take the names of two U.S. States, mix them all together, then rearrange the letters to form the names of two *different* U.S. States (so that all four state names differ from one another). What states are these? The problem was reissued on [the Unicon Discussion Web](https://tapestry.tucson.az.us/twiki/bin/view/Main/StateNamesPuzzle) which includes several solutions with analysis. Several techniques may be helpful and you may wish to refer to [Gödel numbering](https://en.wikipedia.org/wiki/Goedel_numbering), [equivalence relations](https://en.wikipedia.org/wiki/Equivalence_relation), and [equivalence classes](https://en.wikipedia.org/wiki/Equivalence_classes). The basic merits of these were discussed in the Unicon Discussion Web. A second challenge in the form of a set of fictitious new states was also presented.
+**State name** is a <em>word puzzle</em> in which you take the letters from two U.S. state names and rearrange them to form the names of two different U.S. states.
+
 
 # --instructions--
 
-Write a function to solve the challenge for the given array of names of states. The function should return an array. Each element should be an object in this form: `{"from":[],"to":[]}`. The "from" array should contain the original names and the "to" array should contain the resultant names.
+Write a function to solve the challenge for a given array of actual U.S. state names, and for fictional state names.
+
+The function should return an array. Each element should be an object in this form: `{"from":[],"to":[]}`. The `"from"` array should contain the original names and the `"to"` array should contain the resultant names.
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md
index e89ca872e69..6181ad81245 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md
@@ -1,14 +1,20 @@
 ---
 id: 5a23c84252665b21eecc8029
 title: Straddling checkerboard
-challengeType: 5
+challengeType: 1
 forumTopicId: 302325
 dashedName: straddling-checkerboard
 ---
 
 # --description--
 
-Implement functions to encrypt and decrypt a message using the [straddling checkerboard](https://en.wikipedia.org/wiki/Straddling_checkerboard) method. The functions will take a string and an array as parameters. The array has 3 strings representing the 3 rows of the checkerboard. The output will be a series of decimal digits. Numbers should be encrypted by inserting the escape character before each digit, then including the digit unencrypted. This should be reversed for decryption.
+Implement functions to encrypt and decrypt a message using the **straddling checkerboard** method.
+
+Each function will take two arguments, a `message` string and an `alphabet` array. The `alphabet` array will contain 3 strings representing the 3 rows of the straddling checkerboard.
+
+The output of the `straddle()` function should be a series of decimal digits. Numbers should be encrypted by inserting the escape character before each digit, then including the digit <em>unencrypted</em>.
+
+This should be reversed for decryption with the `unstraddle()` function.
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/strip-control-codes-and-extended-characters-from-a-string.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/strip-control-codes-and-extended-characters-from-a-string.md
index 317f9dd7b7e..5207f260b42 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/strip-control-codes-and-extended-characters-from-a-string.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/strip-control-codes-and-extended-characters-from-a-string.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8036
 title: Strip control codes and extended characters from a string
-challengeType: 5
+challengeType: 1
 forumTopicId: 302327
 dashedName: strip-control-codes-and-extended-characters-from-a-string
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/subleq.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/subleq.md
index d302bb9f993..1dc7987cf77 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/subleq.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/subleq.md
@@ -1,37 +1,29 @@
 ---
 id: 5a23c84252665b21eecc8038
 title: Subleq
-challengeType: 5
+challengeType: 1
 forumTopicId: 302328
 dashedName: subleq
 ---
 
 # --description--
 
-[Subleq](https://rosettacode.org/wiki/eso:Subleq) is an example of a [One-Instruction Set Computer (OISC)](https://en.wikipedia.org/wiki/One_instruction_set_computer).
+Subleq is an example of a One-Instruction Set Computer (OISC).
 
-It is named after its only instruction, which is **SU**btract and **B**ranch if **L**ess than or **EQ**ual
-
-to zero.
+It is named after its only instruction, which is **SU**btract and **B**ranch if **L**ess than or **EQ**ual to zero.
 
 Your task is to create an interpreter which emulates such a machine.
 
-The machine's memory consists of an array of signed integers. Any reasonable word size is fine, but the memory must be
-
-able to hold negative as well as positive numbers.
+The machine's memory consists of an array of signed integers. Any reasonable word size is fine, but the memory must be able to hold negative as well as positive numbers.
 
 Execution begins with the instruction pointer aimed at the first word, which is address 0. It proceeds as follows:
 
 <ol>
   <li>Let A, B, and C be the value stored in the three consecutive words in memory starting at the instruction pointer.</li>
   <li>Advance the instruction pointer 3 words to point at the address after the one containing C.</li>
-  <li>If A is -1, then a character is read from standard input and its code point stored in the address given by B. C
-    is unused.</li>
-  <li>If B is -1, then the number contained in the address given by A is interpreted as a code point and the
-    corresponding character output. C is again unused.</li>
-  <li>Otherwise, both A and B are treated as the addresses of memory locations. The number contained in the address
-    given by A is subtracted from the number at the address given by B (and the result stored back in address B). If
-    the result is zero or negative, the value C becomes the new instruction pointer.</li>
+  <li>If A is -1, then a character is read from standard input and its code point stored in the address given by B. C is unused.</li>
+  <li>If B is -1, then the number contained in the address given by A is interpreted as a code point and the corresponding character output. C is again unused.</li>
+  <li>Otherwise, both A and B are treated as the addresses of memory locations. The number contained in the address given by A is subtracted from the number at the address given by B (and the result stored back in address B). If the result is zero or negative, the value C becomes the new instruction pointer.</li>
   <li>If the instruction pointer becomes negative, execution halts.</li>
 </ol>
 
@@ -39,15 +31,7 @@ Other negative addresses besides -1 may be treated as equivalent to -1, or gener
 
 Your solution should accept a program to execute on the machine, separately from the input fed to the program itself.
 
-This program should be in raw subleq "machine code" - whitespace-separated decimal numbers, with no symbolic names or
-
-other assembly-level extensions, to be loaded into memory starting at address 0. Show the output of your solution when
-
-fed this "Hello, world!" program. (Note that the example assumes ASCII or a superset of it, such as any of the Latin-N
-
-character sets or Unicode. You may translate it into another character set if your implementation is on a
-
-non-ASCiI-compatible environment.)
+This program should be in raw subleq "machine code" - whitespace-separated decimal numbers, with no symbolic names or other assembly-level extensions, to be loaded into memory starting at address 0. Show the output of your solution when fed this "Hello, world!" program. (Note that the example assumes ASCII or a superset of it, such as any of the Latin-N character sets or Unicode. You may translate it into another character set if your implementation is on a non-ASCiI-compatible environment.)
 
 <pre>15 17 -1 17 -1 -1 16 1 -1 16 3 -1 15 15 0 0 -1 72 101 108 108 111 44 32 119 111 114 108 100 33 10 0</pre>
 
@@ -66,9 +50,7 @@ message: "Hello, world!\n\0"
 
 # --instructions--
 
-Write a function that takes an array of integers as a parameter. This represents the memory elements. The function
-
-should interpret the sequence and return the output string. For this task, assume that there is no standard input.
+Write a function that takes an array of integers as a parameter. This represents the memory elements. The function should interpret the sequence and return the output string. For this task, assume that there is no standard input.
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sudoku.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sudoku.md
index e0f6864a89e..01bdc0854df 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sudoku.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sudoku.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc803c
 title: Sudoku
-challengeType: 5
+challengeType: 1
 forumTopicId: 302329
 dashedName: sudoku
 ---
 
 # --description--
 
-Write a function to solve a partially filled-in normal 9x9 [Sudoku](https://en.wikipedia.org/wiki/Sudoku) grid and return the result. The blank fields are represented by `-1`. [Algorithmics of Sudoku](https://en.wikipedia.org/wiki/Algorithmics_of_sudoku) may help implement this.
+Write a function to solve a partially filled-in normal 9x9 Sudoku grid and return the result. The blank fields are represented by `-1`.
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sum-digits-of-an-integer.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sum-digits-of-an-integer.md
index d13a1bdb030..077d606d4c7 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sum-digits-of-an-integer.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sum-digits-of-an-integer.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc803f
 title: Sum digits of an integer
-challengeType: 5
+challengeType: 1
 forumTopicId: 302331
 dashedName: sum-digits-of-an-integer
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sum-multiples-of-3-and-5.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sum-multiples-of-3-and-5.md
index f92d5b9d218..d5f7e93da8f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sum-multiples-of-3-and-5.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sum-multiples-of-3-and-5.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8040
 title: Sum multiples of 3 and 5
-challengeType: 5
+challengeType: 1
 forumTopicId: 302332
 dashedName: sum-multiples-of-3-and-5
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sum-of-a-series.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sum-of-a-series.md
index 6ffa6d152f7..7d649eee959 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sum-of-a-series.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sum-of-a-series.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8041
 title: Sum of a series
-challengeType: 5
+challengeType: 1
 forumTopicId: 302333
 dashedName: sum-of-a-series
 ---
 
 # --description--
 
-Compute the **n**<sup>th</sup> term of a [series](https://en.wikipedia.org/wiki/Series (mathematics)), i.e. the sum of the **n** first terms of the corresponding [sequence](https://en.wikipedia.org/wiki/sequence). Informally this value, or its limit when **n** tends to infinity, is also called the *sum of the series*, thus the title of this task. For this task, use: $S_n = \displaystyle\sum_{k=1}^n \frac{1}{k^2}$.
+Compute the **n**<sup>th</sup> term of a <em>series</em>, i.e. the sum of the **n** first terms of the corresponding <em>sequence</em>. 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/espanol/10-coding-interview-prep/rosetta-code/sum-of-squares.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sum-of-squares.md
index d211cbc1657..ee55a5bfea5 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sum-of-squares.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sum-of-squares.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8042
 title: Sum of squares
-challengeType: 5
+challengeType: 1
 forumTopicId: 302334
 dashedName: sum-of-squares
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sum-to-100.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sum-to-100.md
index f30b422ba87..629e4ab96ff 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sum-to-100.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sum-to-100.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8043
 title: Sum to 100
-challengeType: 5
+challengeType: 1
 forumTopicId: 302335
 dashedName: sum-to-100
 ---
@@ -12,7 +12,7 @@ Find solutions to the *sum to one hundred* puzzle.
 
 Add (insert) the mathematical operators **+** or **─** (plus or minus) before any of the digits in the decimal numeric string **123456789** such that the resulting mathematical expression adds up to a particular sum (in this iconic case, **100**).
 
-Example:
+Ejemplo:
 
 <pre><b>123 + 4 - 5 + 67 - 89   =   100</b></pre>
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
index 50fe64ed639..50ad887d282 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8045
 title: Sutherland-Hodgman polygon clipping
-challengeType: 5
+challengeType: 1
 forumTopicId: 302336
 dashedName: sutherland-hodgman-polygon-clipping
 ---
 
 # --description--
 
-The [Sutherland-Hodgman clipping algorithm](https://en.wikipedia.org/wiki/Sutherland-Hodgman clipping algorithm) finds the polygon that is the intersection between an arbitrary polygon (the "subject polygon") and a convex polygon (the "clip polygon"). It is used in computer graphics (especially 2D graphics) to reduce the complexity of a scene being displayed by eliminating parts of a polygon that do not need to be displayed. Take the closed polygon defined by the points:
+The Sutherland-Hodgman clipping algorithm finds the polygon that is the intersection between an arbitrary polygon (the "subject polygon") and a convex polygon (the "clip polygon"). It is used in computer graphics (especially 2D graphics) to reduce the complexity of a scene being displayed by eliminating parts of a polygon that do not need to be displayed. Take the closed polygon defined by the points:
 
 <pre>[(50, 150), (200, 50), (350, 150), (350, 300), (250, 300), (200, 250), (150, 350), (100, 250), (100, 200)]</pre>
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/symmetric-difference.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/symmetric-difference.md
index 7009bce4617..bf8d98a2c7f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/symmetric-difference.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/symmetric-difference.md
@@ -1,14 +1,18 @@
 ---
 id: 5a23c84252665b21eecc8046
 title: Symmetric difference
-challengeType: 5
+challengeType: 1
 forumTopicId: 16086
 dashedName: symmetric-difference
 ---
 
 # --description--
 
-Given two [set](https://rosettacode.org/wiki/set)s *A* and *B*, compute $(A \\setminus B) \\cup (B \\setminus A).$ That is, enumerate the items that are in *A* or *B* but not both. This set is called the [symmetric difference](https://en.wikipedia.org/wiki/Symmetric difference) of *A* and *B*. In other words: $(A \\cup B) \\setminus (A \\cap B)$ (the set of items that are in at least one of *A* or *B* minus the set of items that are in both *A* and *B*).
+Given two sets *A* and *B*, compute $(A \\setminus B) \\cup (B \\setminus A).$ That is, enumerate the items that are in *A* or *B* but not both. This set is called the symmetric difference of *A* and *B*. In other words: $(A \\cup B) \\setminus (A \\cap B)$ (the set of items that are in at least one of *A* or *B* minus the set of items that are in both *A* and *B*).
+
+Example:
+
+For sets `A = [1, 2, 3]`, and `B = [1, 3, 4]`, the symmetric difference of *A* and *B* is `[2, 4]`.
 
 # --instructions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/taxicab-numbers.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/taxicab-numbers.md
index 895b46ef050..e968d091577 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/taxicab-numbers.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/taxicab-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 594ecc0d9a8cf816e3340187
 title: Taxicab numbers
-challengeType: 5
+challengeType: 1
 forumTopicId: 302337
 dashedName: taxicab-numbers
 ---
 
 # --description--
 
-A [taxicab number](https://en.wikipedia.org/wiki/Hardy–Ramanujan number "wp: Hardy–Ramanujan number") (the definition that is being used here) is a positive integer that can be expressed as the sum of two positive cubes in more than one way.
+A taxicab number (the definition that is being used here) is a positive integer that can be expressed as the sum of two positive cubes in more than one way.
 
 The first taxicab number is `1729`, which is:
 
@@ -29,13 +29,6 @@ Taxicab numbers are also known as:
 
 Write a function that returns the lowest `n` taxicab numbers. For each of the taxicab numbers, show the number as well as its constituent cubes.
 
-**See also:**
-
-<ul>
-  <li><a href='https://oeis.org/A001235' target='_blank'>A001235 taxicab numbers</a> on The On-Line Encyclopedia of Integer Sequences.</li>
-  <li><a href='https://en.wikipedia.org/wiki/Taxicab_number' target='_blank'>taxicab number</a> on Wikipedia.</li>
-</ul>
-
 # --hints--
 
 `taxicabNumbers` should be a function.
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/tokenize-a-string-with-escaping.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/tokenize-a-string-with-escaping.md
index 24a65a163e8..a95d3927542 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/tokenize-a-string-with-escaping.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/tokenize-a-string-with-escaping.md
@@ -1,7 +1,7 @@
 ---
 id: 594faaab4e2a8626833e9c3d
 title: Tokenize a string with escaping
-challengeType: 5
+challengeType: 1
 forumTopicId: 302338
 dashedName: tokenize-a-string-with-escaping
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/top-rank-per-group.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/top-rank-per-group.md
index 56cd2843797..b32c3f2a2a6 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/top-rank-per-group.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/top-rank-per-group.md
@@ -1,7 +1,7 @@
 ---
 id: 595011cba5a81735713873bd
 title: Top rank per group
-challengeType: 5
+challengeType: 1
 forumTopicId: 302339
 dashedName: top-rank-per-group
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/topological-sort.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/topological-sort.md
index f57d218e66c..66b5b893a4f 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/topological-sort.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/topological-sort.md
@@ -1,7 +1,7 @@
 ---
 id: 594fa2746886f41f7d8bf225
 title: Topological sort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302340
 dashedName: topological-sort
 ---
@@ -43,7 +43,7 @@ The compiling of a library in the VHDL language has the constraint that a librar
 
 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:
+Por ejemplo:
 
 ```js
 const libsSimple =
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
index 4de9c851ba4..77f660a8123 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
@@ -1,20 +1,20 @@
 ---
 id: 5951ed8945deab770972ae56
-title: Towers of Hanoi
-challengeType: 5
+title: Torres de Hanoi
+challengeType: 1
 forumTopicId: 302341
 dashedName: towers-of-hanoi
 ---
 
 # --description--
 
-Solve the [Towers of Hanoi](https://en.wikipedia.org/wiki/Towers_of_Hanoi "wp: Towers_of_Hanoi") problem.
+Solve the Towers of Hanoi problem. The number of objects will be given as the first parameter, followed by the strings used to identify each stack of objects. Create a nested array containing the list of moves, `["source", "destination"]`.
 
-Your solution should accept the number of discs as the first parameters, and three string used to identify each of the three stacks of discs, for example `towerOfHanoi(4, 'A', 'B', 'C')`. The function should return an array of arrays containing the list of moves, source -> destination.
+For example, the parameters `(4, 'A', 'B', 'C')`, will result in nested array of moves `[['A', 'C'], ['B', 'A']]`, indicating that the 1st move was to move an object from stack `A` to `C` and the 2nd move was to move an object from stack `B` to `A`.
 
-For example, the array `[['A', 'C'], ['B', 'A']]` indicates that the 1st move was to move a disc from stack A to C, and the 2nd move was to move a disc from stack B to A.
+# --instructions--
 
-<p></p>
+Write a function that returns the moves to stack the objects in a nested array.
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/word-frequency.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/word-frequency.md
index 70d2d054dca..0529087cb97 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/word-frequency.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/word-frequency.md
@@ -1,75 +1,75 @@
 ---
 id: 5e94a54cc7b022105bf0fd2c
-title: Word frequency
-challengeType: 5
+title: Frecuencia de palabras
+challengeType: 1
 forumTopicId: 393913
 dashedName: word-frequency
 ---
 
 # --description--
 
-Given a text string and an integer n, return the n most common words in the file (and the number of their occurrences) in decreasing frequency.
+Dada una cadena de texto y un número entero n, devuelve las n palabras más comunes en el archivo (y el número de sus ocurrencias) en una frecuencia decreciente.
 
 # --instructions--
 
-Write a function to count the occurrences of each word and return the n most commons words along with the number of their occurences in decreasing frequency.
+Write a function to count the occurrences of each word and return the n most commons words along with the number of their occurrences in decreasing frequency.
 
-The function should return a 2D array with each of the elements in the following form: `[word, freq]`. `word` should be the lowercase version of the word and `freq` the number denoting the count.
+La función debe devolver un arreglo 2D con cada uno de los elementos de la siguiente forma: `[word, freq]`. `word` debe ser la versión en minúscula de la palabra y `freq` el número que indica el conteo.
 
-The function should return an empty array, if no string is provided.
+La función debe devolver un arreglo vacío, si no se proporciona ninguna cadena.
 
-The function should be case insensitive, for example, the strings "Hello" and "hello" should be treated the same.
+La función debe ser insensible a mayúsculas, por ejemplo, las cadenas "Hola" y "hola" deben ser tratadas de la misma manera.
 
-You can treat words that have special characters such as underscores, dashes, apostrophes, commas, etc., as distinct words.
+Puede tratar palabras que tienen caracteres especiales como guiones bajos, guiones, apóstrofes, comas, etc., como palabras distintas.
 
-For example, given the string "Hello hello goodbye", your function should return `[['hello', 2], ['goodbye', 1]]`.
+Por ejemplo, dada la cadena "Hello hello goodbye", tu función debe devolver `[['hello', 2], ['goodbye', 1]]`.
 
 # --hints--
 
-`wordFrequency` should be a function.
+`wordFrequency` debe ser una función.
 
 ```js
 assert(typeof wordFrequency == 'function');
 ```
 
-`wordFrequency` should return an array.
+`wordFrequency` debe devolver un arreglo.
 
 ```js
 assert(Array.isArray(wordFrequency('test')));
 ```
 
-`wordFrequency("Hello hello world", 2)` should return `[['hello', 2], ['world', 1]]`
+`wordFrequency("Hello hello world", 2)` debe retornar `[['hello', 2], ['world', 1]]`
 
 ```js
 assert.deepEqual(wordFrequency(example_1, 2), example_1_solution);
 ```
 
-`wordFrequency("The quick brown fox jumped over the lazy dog", 1)` should return `[['the', 2]]`
+`wordFrequency("The quick brown fox jumped over the lazy dog", 1)` debe retornar `[['the', 2]]`
 
 ```js
 assert.deepEqual(wordFrequency(example_2, 1), example_2_solution);
 ```
 
-`wordFrequency("Opensource opensource open-source open source", 1)` should return `[['opensource', 2]]`
+`wordFrequency("Opensource opensource open-source open source", 1)` debería devolver `[['opensource', 2]]`
 
 ```js
 assert.deepEqual(wordFrequency(example_3, 1), example_3_solution);
 ```
 
-`wordFrequency("Apple App apply aPP aPPlE", 3)` should return `[['app', 2], ['apple', 2], ['apply', 1]]` or `[['apple', 2], ['app', 2], ['apply', 1]]`
+`wordFrequency("Apple App apply aPP aPPlE", 3)` deberá devolver `[['app', 2], ['apple', 2], ['apply', 1]]` o `[['apple', 2], ['app', 2], ['apply', 1]]`
 
 ```js
 const arr = JSON.stringify(wordFrequency(example_4, 3));
 assert(arr === example_4_solution_a || arr === example_4_solution_b);
 ```
 
-`wordFrequency("c d a d c a b d d c", 4)` should return `[['d', 4], ['c', 3], ['a', 2], ['b', 1]]`
+`wordFrequency("c d a d c a b d d c", 4)` deberá retornar `[['d', 4], ['c', 3], ['a', 2], ['b', 1]]`
 
 ```js
 assert.deepEqual(wordFrequency(example_5, 4), example_5_solution);
 ```
 
-`wordFrequency("", 5)` should return `[]`
+`wordFrequency("", 5)` deberá retornar `[]`
 
 ```js
 assert.deepEqual(wordFrequency(example_6, 5), example_6_solution);
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/word-wrap.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/word-wrap.md
index 344be87802e..5ea8d8161da 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/word-wrap.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/word-wrap.md
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339ad4
 title: Word wrap
-challengeType: 5
+challengeType: 1
 forumTopicId: 302344
 dashedName: word-wrap
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/y-combinator.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/y-combinator.md
index f76ab91e3c8..0c867176bc4 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/y-combinator.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/y-combinator.md
@@ -1,22 +1,20 @@
 ---
 id: 594810f028c0303b75339ad5
 title: Y combinator
-challengeType: 5
+challengeType: 1
 forumTopicId: 302345
 dashedName: y-combinator
 ---
 
 # --description--
 
-In strict [functional programming](https://en.wikipedia.org/wiki/Functional programming "wp: functional programming") and the [lambda calculus](https://en.wikipedia.org/wiki/lambda calculus "wp: lambda calculus"), functions (lambda expressions) don't have state and are only allowed to refer to arguments of enclosing functions. This rules out the usual definition of a recursive function wherein a function is associated with the state of a variable and this variable's state is used in the body of the function. The [Y combinator](https://mvanier.livejournal.com/2897.html) is itself a stateless function that, when applied to another stateless function, returns a recursive version of the function. The Y combinator is the simplest of the class of such functions, called [fixed-point combinators](https://en.wikipedia.org/wiki/Fixed-point combinator "wp: fixed-point combinator").
+In strict <a href="https://www.freecodecamp.org/news/the-principles-of-functional-programming/" target="_blank" rel="noopener noreferrer nofollow">functional programming</a> and the lambda calculus, functions (lambda expressions) don't have state and are only allowed to refer to arguments of enclosing functions. This rules out the usual definition of a recursive function wherein a function is associated with the state of a variable and this variable's state is used in the body of the function.
+
+The Y combinator is itself a stateless function that, when applied to another stateless function, returns a recursive version of the function. The Y combinator is the simplest of the class of such functions, called fixed-point combinators.
 
 # --instructions--
 
-Define the stateless Y combinator function and use it to compute [factorial](https://en.wikipedia.org/wiki/Factorial "wp: factorial"). The `factorial(N)` function is already given to you. **See also:**
-
-<ul>
-  <li><a href="https://vimeo.com/45140590" target="_blank">Jim Weirich: Adventures in Functional Programming</a>.</li>
-</ul>
+Define the stateless Y combinator function and use it to compute the factorials. The `factorial(N)` function is already given to you.
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/zeckendorf-number-representation.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/zeckendorf-number-representation.md
index 7794021986e..27ab1af3d3c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/zeckendorf-number-representation.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/zeckendorf-number-representation.md
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339ad6
 title: Zeckendorf number representation
-challengeType: 5
+challengeType: 1
 forumTopicId: 302346
 dashedName: zeckendorf-number-representation
 ---
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
index d3970f2f72c..f337118801c 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
@@ -1,7 +1,7 @@
 ---
 id: 594810f028c0303b75339ad7
 title: Zhang-Suen thinning algorithm
-challengeType: 5
+challengeType: 1
 forumTopicId: 302347
 dashedName: zhang-suen-thinning-algorithm
 ---
@@ -51,7 +51,7 @@ Obviously the boundary pixels of the image cannot have the full eight neighbours
 - 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:**
+**Paso 1:**
 
 All pixels are tested and pixels satisfying all the following conditions (simultaneously) are just noted at this stage.
 
@@ -63,7 +63,7 @@ All pixels are tested and pixels satisfying all the following conditions (simult
 
 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:**
+**Paso 2:**
 
 All pixels are again tested and pixels satisfying all the following conditions are just noted at this stage.
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md
index 4f5277c28ad..70799a19f1d 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md
@@ -1,14 +1,14 @@
 ---
 id: 594810f028c0303b75339ad8
 title: Zig-zag matrix
-challengeType: 5
+challengeType: 1
 forumTopicId: 302348
 dashedName: zig-zag-matrix
 ---
 
 # --description--
 
-A 'zig-zag' array is a square arrangement of the first $N^2$ integers, where the numbers increase sequentially as you zig-zag along the array's [anti-diagonals](https://en.wiktionary.org/wiki/antidiagonal).
+A 'zig-zag' array is a square arrangement of the first $N^2$ integers, where the numbers increase sequentially as you zig-zag along the array's anti-diagonals.
 
 For example, for the input `5`, the following result should be produced:
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
index 35f9887785d..7c44114d20e 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
@@ -1,6 +1,6 @@
 ---
 id: bd7156d8c242eddfaeb5bd13
-title: Build a freeCodeCamp Forum Homepage
+title: Construye una página principal del foro freeCodeCamp
 challengeType: 3
 forumTopicId: 302349
 dashedName: build-a-freecodecamp-forum-homepage
@@ -8,21 +8,21 @@ dashedName: build-a-freecodecamp-forum-homepage
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/JqdoMV>.
+**Objective:** Build an app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/JqdoMV>.
 
-Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+Fulfill the below user stories and get all of the tests to pass. Utilice las librerías o APIs que necesites. Dale tu estilo personal.
 
-**User Story:** I can see a list of the most recent posts on the freeCodeCamp forum.
+**Historia de usuario:** Puedo ver una lista de las publicaciones más recientes en el foro de freeCodeCamp.
 
-**User Story:** For each topic, I can see the title and a list of links to users who have recently posted in it.
+**Historia de usuario:** Para cada tema, puedo ver el título y una lista de enlaces a los usuarios que han publicado recientemente en él.
 
-**User Story:** I can see the number of replies and views that each topic has had, and a timestamp of when the topic was last active.
+**Historia del usuario:** Puedo ver el número de respuestas y vistas que cada tema ha tenido, y una marca de tiempo de cuando el tema estaba activo por última vez.
 
-**Hint:** To get the 30 most recent forum posts: <https://forum-proxy.freecodecamp.rocks/latest>.
+**Pista:** Para obtener las 30 publicaciones más recientes del foro: <https://forum-proxy.freecodecamp.rocks/latest>.
 
-When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+Cuando hayas terminado, incluye un enlace a tu proyecto en CodePen y haz clic en el botón "He completado este desafío".
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
index 330d9075ee4..fe743b57120 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
@@ -8,11 +8,11 @@ dashedName: build-a-light-bright-app
 
 # --description--
 
-**Objetivo:** Construye una aplicación en [CodePen.io](https://codepen.io) que funcionalmente sea similar a esta: <https://codepen.io/freeCodeCamp/full/eyLYXE>.
+**Objective:** Build an app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/eyLYXE>.
 
 **Regla #1:** No mires el código del proyecto de ejemplo. Encuentra tu propia solución.
 
-**Regla #2:** Completa las siguientes [historias de usuario](https://es.wikipedia.org/wiki/Historias_de_usuario) y consigue que todas las pruebas sean aprobadas. Utilice las librerías o APIs que necesites. Dale tu propio estilo personal.
+**Rule #2:** Fulfill the below user stories and get all of the tests to pass. Utilice las librerías o APIs que necesites. Dale tu propio estilo personal.
 
 **Historia del usuario:** Puedo hacer clic o arrastrar el cursor del ratón para colorear los círculos.
 
@@ -28,7 +28,7 @@ dashedName: build-a-light-bright-app
 
 Cuando hayas terminado, incluye un enlace a tu proyecto en CodePen y haz clic en el botón "He completado este desafío".
 
-Puedes obtener comentarios sobre tu proyecto compartiéndolo en el [foro de freeCodeCamp](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
index 5d39e057a64..33aec49963a 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
@@ -1,6 +1,6 @@
 ---
 id: bd7158d8c443eddfaeb5bdff
-title: Build a Nightlife Coordination App
+title: Construir una Aplicación de Coordinación de vida nocturna
 challengeType: 4
 forumTopicId: 302351
 dashedName: build-a-nightlife-coordination-app
@@ -8,11 +8,11 @@ dashedName: build-a-nightlife-coordination-app
 
 # --description--
 
-Build a full stack JavaScript app that is functionally similar to this: <https://yoyo44.herokuapp.com/>. Use a site builder of your choice to complete the project.
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://yoyo44.herokuapp.com/" target="_blank" rel="noopener noreferrer nofollow">https://yoyo44.herokuapp.com/</a>. Utiliza un constructor de sitios de tu elección para completar el proyecto.
 
-Here are the specific user stories you should implement for this project:
+A continuación se encuentran las historias de usuario específicas que debes implementar para este proyecto:
 
-**User Story:** As an unauthenticated user, you can view all bars in my area.
+**Historia de usuario:** Como usuario no autenticado, puedes ver todas las barras en mi área.
 
 **User Story:** As an authenticated user, you can add myself to a bar to indicate you am going there tonight.
 
@@ -20,9 +20,9 @@ Here are the specific user stories you should implement for this project:
 
 **User Story:** As an unauthenticated user, when you login you should not have to search again.
 
-**Hint:** Try using the [Yelp API](https://www.yelp.com/developers/documentation/v3) to find venues in the cities your users search for. If you use Yelp's API, be sure to mention so in your app.
+**Hint:** Try using the Yelp API to find venues in the cities your users search for. If you use Yelp's API, be sure to mention so in your app.
 
-When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+Cuando hayas terminado, asegúrate que un demo funcional de tu proyecto esté alojado en algún sitio público. Luego, envía la URL en el campo `Solution Link`. Opcionalmente, también envía un enlace al código fuente de tu proyecto en el campo `GitHub Link`.
 
 # --solutions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
index bd190875b3b..7d556217848 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
@@ -1,6 +1,6 @@
 ---
 id: bd7158d8c443eddfaeb5bdee
-title: Build a Pinterest Clone
+title: Crea un clon de Pinterest
 challengeType: 4
 forumTopicId: 302352
 dashedName: build-a-pinterest-clone
@@ -8,9 +8,9 @@ dashedName: build-a-pinterest-clone
 
 # --description--
 
-**Objective:** Build a [Replit](https://replit.com/) app that is functionally similar to this: <https://build-a-pinterest-clone.freecodecamp.rocks/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://build-a-pinterest-clone.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://build-a-pinterest-clone.freecodecamp.rocks/</a>.
 
-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.
+Fulfill the below user stories and get all of the tests to pass. Utiliza las librerías o APIs que necesites. Dale su propio estilo personal.
 
 **User Story:** As an unauthenticated user, I can login with GitHub.
 
@@ -24,11 +24,11 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 **User Story:** As an authenticated user, if I upload an image that is broken, it will be replaced by a placeholder image. (can use jQuery broken image detection)
 
-**Hint:** [Masonry.js](https://masonry.desandro.com/) is a library that allows for Pinterest-style image grids.
+**Hint:** Masonry.js is a library that allows for Pinterest-style image grids.
 
 Once you've finished implementing these user stories, enter the URL to your live app and, optionally, your GitHub repository. Then click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-pong-game.md b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
index cfa0cc598b6..d48df3b5966 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
@@ -8,11 +8,11 @@ dashedName: build-a-pong-game
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/satyamdev/full/pdMmBp>.
+**Objective:** Build an app that is functionally similar to this: <https://codepen.io/satyamdev/full/pdMmBp>.
 
-**Rule #1:** Don't look at the example project's code. Figure it out for yourself.
+**Regla #1:** No mires el código de ejemplo del proyecto. Encuentra tu propia solución.
 
-**Rule #2:** Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+**Rule #2:** Fulfill the below user stories and get all of the tests to pass. Utiliza cualquier librería o API que necesites. Dale tu propio estilo personal.
 
 **User Story:** I can control a paddle.
 
@@ -22,9 +22,9 @@ dashedName: build-a-pong-game
 
 **User Story:** The game keeps track of the player and computer's score.
 
-When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+Cuando hayas terminado, incluye un enlace a tu proyecto en CodePen y haz clic en el botón "He completado este desafío".
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
index 7817e26951d..01ef915ca06 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
@@ -1,6 +1,6 @@
 ---
 id: bd7155d8c242eddfaeb5bd13
-title: Build a Recipe Box
+title: Crea una caja de recetas
 challengeType: 3
 forumTopicId: 302354
 dashedName: build-a-recipe-box
@@ -8,9 +8,9 @@ dashedName: build-a-recipe-box
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/dNVazZ/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/dNVazZ/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/dNVazZ/</a>.
 
-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.
+Fulfill the below user stories and get all of the tests to pass. Utiliza cualquier librería o API que necesites. Dale tu propio estilo personal.
 
 **User Story:** I can create recipes that have names and ingredients.
 
@@ -26,9 +26,9 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 **Hint:** You should prefix your local storage keys on CodePen, i.e. `_username_recipes`
 
-When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+Cuando hayas terminado, incluye un enlace a tu proyecto en CodePen y haz clic en el botón "He completado este desafío".
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
index de57859782b..a6ef34eee02 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
@@ -1,6 +1,6 @@
 ---
 id: bd7153d8c242eddfaeb5bd13
-title: Build a Roguelike Dungeon Crawler Game
+title: Construye un juego de exploración de mazmorras Roguelike
 challengeType: 3
 forumTopicId: 302355
 dashedName: build-a-roguelike-dungeon-crawler-game
@@ -8,9 +8,9 @@ dashedName: build-a-roguelike-dungeon-crawler-game
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/apLXEJ/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/apLXEJ/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/apLXEJ/</a>.
 
-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.
+Fulfill the below user stories and get all of the tests to pass. Utiliza cualquier librería o API que necesites. Dale tu propio estilo personal.
 
 **User Story:** I have health, a level, and a weapon. I can pick up a better weapon. I can pick up health items.
 
@@ -30,9 +30,9 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 **User Story:** The game should be challenging, but theoretically winnable.
 
-When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+Cuando hayas terminado, incluye un enlace a tu proyecto en CodePen y haz clic en el botón "He completado este desafío".
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-simon-game.md b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
index 5bc458abb1d..8a0101f3c35 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
@@ -1,6 +1,6 @@
 ---
 id: bd7158d8c442eddfaeb5bd1c
-title: Build a Simon Game
+title: Crea un juego de Simon dice
 challengeType: 3
 forumTopicId: 302357
 dashedName: build-a-simon-game
@@ -8,9 +8,9 @@ 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/freeCodeCamp/full/obYBjE).
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/obYBjE" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/obYBjE</a>.
 
-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.
+Fulfill the below user stories and get all of the tests to pass. Utiliza las librerías o APIs que necesites. Dale tu propio estilo personal.
 
 **User Story:** I am presented with a random series of button presses.
 
@@ -30,9 +30,9 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 **Hint:** Here are mp3s you can use for each button: `https://s3.amazonaws.com/freecodecamp/simonSound1.mp3`, `https://s3.amazonaws.com/freecodecamp/simonSound2.mp3`, `https://s3.amazonaws.com/freecodecamp/simonSound3.mp3`, `https://s3.amazonaws.com/freecodecamp/simonSound4.mp3`.
 
-When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+Cuando hayas terminado, incluye un enlace a tu proyecto en CodePen y haz clic en el botón "He completado este desafío".
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
index bf79eae711d..558828d939b 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
@@ -1,6 +1,6 @@
 ---
 id: bd7158d8c442eedfaeb5bd1c
-title: Build a Tic Tac Toe Game
+title: Crea el juego Tres en Raya
 challengeType: 3
 forumTopicId: 302358
 dashedName: build-a-tic-tac-toe-game
@@ -8,9 +8,9 @@ dashedName: build-a-tic-tac-toe-game
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/KzXQgy/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/KzXQgy/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/KzXQgy/</a>.
 
-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.
+Fulfill the below user stories and get all of the tests to pass. Utiliza las librerías o APIs que necesites. Dale su propio estilo personal.
 
 **User Story:** I can play a game of Tic Tac Toe with the computer.
 
@@ -18,9 +18,9 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 **User Story:** I can choose whether I want to play as X or O.
 
-When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+Cuando hayas terminado, incluye un enlace a tu proyecto en CodePen y haz clic en el botón "He completado este desafío".
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-voting-app.md b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-voting-app.md
index 3e6e257ce88..b80746bd3b1 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-voting-app.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-voting-app.md
@@ -1,6 +1,6 @@
 ---
 id: bd7158d8c443eddfaeb5bdef
-title: Build a Voting App
+title: Crea una Aplicación de Sufragio
 challengeType: 4
 forumTopicId: 302359
 dashedName: build-a-voting-app
@@ -8,9 +8,9 @@ dashedName: build-a-voting-app
 
 # --description--
 
-Build a full stack JavaScript app that is functionally similar to this: <https://voting-app.freecodecamp.rocks/>. Use a site builder of your choice to complete the project.
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://voting-app.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://voting-app.freecodecamp.rocks/</a>. Utiliza un constructor de sitios de tu elección para completar el proyecto.
 
-Here are the specific user stories you should implement for this project:
+Estas son las historias de usuario específicas que debes implementar para este proyecto:
 
 **User Story:** As an authenticated user, you can keep my polls and come back later to access them.
 
@@ -28,7 +28,7 @@ Here are the specific user stories you should implement for this project:
 
 **User Story:** As an authenticated user, if you don't like the options on a poll, you can create a new option.
 
-When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+Cuando hayas terminado, asegúrate de que un demo funcional de tu proyecto esté alojado en algún lugar público. Luego, envía la URL en el campo `Solution Link`. Opcionalmente, también envía un enlace al código fuente de tu proyecto en el campo `GitHub Link`.
 
 # --solutions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
index d4cf3b350f7..e9f09c0d1c7 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
@@ -1,6 +1,6 @@
 ---
 id: bd7158d8c442eddfaeb5bd19
-title: Build a Wikipedia Viewer
+title: Crea un Visor de Wikipedia
 challengeType: 3
 forumTopicId: 302360
 dashedName: build-a-wikipedia-viewer
@@ -8,23 +8,21 @@ dashedName: build-a-wikipedia-viewer
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/wGqEga/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/wGqEga/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/wGqEga/</a>.
 
-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.
+The MediaWiki software powers Wikipedia, and it helps you collect and organize knowledge and make it available to people.
+
+Using the MediaWiki API, replicate the search function and random article function, similar to the example app above. You can use Wikipedia as your data source.
+
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I can search Wikipedia entries in a search box and see the resulting Wikipedia entries.
 
 **User Story:** I can click a button to see a random Wikipedia entry.
 
-Hint #1: Here's a URL you can use to get a random Wikipedia article: `https://en.wikipedia.org/wiki/Special:Random`.
-
-Hint #2: Here's an entry on using Wikipedia's API: `https://www.mediawiki.org/wiki/API:Main_page`.
-
-Hint #3: Use this [link](https://en.wikipedia.org/wiki/Special:ApiSandbox#action=query&titles=Main%20Page&prop=revisions&rvprop=content&format=jsonfm) to experiment with Wikipedia's API.
-
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md
index a17732de47f..0d6ff4f90e0 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md
@@ -8,9 +8,9 @@ dashedName: build-an-image-search-abstraction-layer
 
 # --description--
 
-Build a full stack JavaScript app that allows you to search for images like this: <https://image-search-abstraction-layer.freecodecamp.rocks/query/lolcats%20funny?page=10> and browse recent search queries like this: <https://image-search-abstraction-layer.freecodecamp.rocks/recent/>. Use a site builder of your choice to complete the project.
+Build a full stack JavaScript app that allows you to search for images like this: <a href="https://image-search-abstraction-layer.freecodecamp.rocks/query/lolcats%20funny?page=10" target="_blank" rel="noopener noreferrer nofollow">https://image-search-abstraction-layer.freecodecamp.rocks/query/lolcats%20funny?page=10</a> and browse recent search queries like this: <a href="https://image-search-abstraction-layer.freecodecamp.rocks/recent/" target="_blank" rel="noopener noreferrer nofollow">https://image-search-abstraction-layer.freecodecamp.rocks/recent/</a>. Utiliza un constructor de sitios de tu elección para completar el proyecto.
 
-Here are the specific user stories you should implement for this project:
+Estas son las historias de usuario específicas que debes implementar para este proyecto:
 
 **User Story:** You can get the image URLs, description and page URLs for a set of images relating to a given search string.
 
@@ -18,7 +18,7 @@ Here are the specific user stories you should implement for this project:
 
 **User Story:** You can get a list of the most recently submitted search strings.
 
-When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+Cuando hayas terminado, asegúrate de que un demo funcional de tu proyecto esté alojado en algún lugar público. Luego, envía la URL en el campo `Solution Link`. Opcionalmente, también envía un enlace al código fuente de tu proyecto en el campo `GitHub Link`.
 
 # --solutions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
index 498b2a027a2..429ecd3e174 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
@@ -1,6 +1,6 @@
 ---
 id: bd7154d8c242eddfaeb5bd13
-title: Build the Game of Life
+title: Construye el Juego de la Vida
 challengeType: 3
 forumTopicId: 302362
 dashedName: build-the-game-of-life
@@ -8,9 +8,20 @@ dashedName: build-the-game-of-life
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/BpwMZv/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/BpwMZv/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/BpwMZv/</a>.
 
-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.
+The Game of Life is a cellular automaton devised by the British mathematician John Horton Conway. It is a <em>zero-player game</em>, meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and observing how it evolves.
+
+The universe of the Game of Life is an infinite, two-dimensional orthogonal grid of square cells, each of which is in one of two possible states, populated and unpopulated. Every cell interacts with its eight neighbours, which are the cells that are horizontally, vertically, or diagonally adjacent.
+
+At each step in time, the following transitions occur:
+
+- Any live cell with fewer than two live neighbours dies, as if by underpopulation.
+- Any live cell with two or three live neighbours lives on to the next generation.
+- Any live cell with more than three live neighbours dies, as if by overpopulation.
+- Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.
+
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** When I first arrive at the game, it will randomly generate a board and start playing.
 
@@ -24,13 +35,9 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 **User Story:** Each time the board changes, I can see how many generations have gone by.
 
-**Hint:** Here's an explanation of Conway's Game of Life from John Conway himself: <https://www.youtube.com/watch?v=E8kUJL04ELA>
+When you are finished, include a link to your project and click the "I've completed this challenge" button.
 
-**Hint:** Here's an overview of Conway's Game of Life with rules for your reference: [https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life](https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life)
-
-When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
-
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md
index fbae3e461ad..0371192a2fc 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md
@@ -1,6 +1,6 @@
 ---
 id: bd7158d8c443eddfaeb5bd0e
-title: Chart the Stock Market
+title: Traza el mercado de valores
 challengeType: 4
 forumTopicId: 302363
 dashedName: chart-the-stock-market
@@ -8,9 +8,9 @@ dashedName: chart-the-stock-market
 
 # --description--
 
-Build a full stack JavaScript app that is functionally similar to this: <https://chart-the-stock-market.freecodecamp.rocks/>. Use a site builder of your choice to complete the project.
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://chart-the-stock-market.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://chart-the-stock-market.freecodecamp.rocks/</a>. Utiliza un constructor de sitios de tu elección para completar el proyecto.
 
-Here are the specific user stories you should implement for this project:
+Estas son las historias de usuario específicas que debes implementar para este proyecto:
 
 **User Story:** You can view a graph displaying the recent trend lines for each added stock.
 
@@ -20,7 +20,7 @@ Here are the specific user stories you should implement for this project:
 
 **User Story:** You can see changes in real-time when any other user adds or removes a stock. For this you will need to use Web Sockets.
 
-When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+Cuando hayas terminado, asegúrate de que un demo funcional de tu proyecto esté alojado en algún lugar público. Luego, envía la URL en el campo `Solution Link`. Opcionalmente, también envía un enlace al código fuente de tu proyecto en el campo `GitHub Link`.
 
 # --solutions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
index 5a5420d7713..37ac0c15721 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
@@ -1,6 +1,6 @@
 ---
 id: bd7158d8c443eddfaeb5bd0f
-title: Manage a Book Trading Club
+title: Administrar un club de comercio de libros
 challengeType: 4
 forumTopicId: 302364
 dashedName: manage-a-book-trading-club
@@ -8,9 +8,9 @@ dashedName: manage-a-book-trading-club
 
 # --description--
 
-**Objective:** Build a [Replit](https://replit.com/) app that is functionally similar to this: <https://manage-a-book-trading-club.freecodecamp.rocks/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://manage-a-book-trading-club.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://manage-a-book-trading-club.freecodecamp.rocks/</a>.
 
-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.
+Fulfill the below user stories and get all of the tests to pass. Utiliza las librerías o APIs que necesites. Dale su propio estilo personal.
 
 **User Story:** I can view all books posted by every user.
 
@@ -22,7 +22,7 @@ Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use
 
 Once you've finished implementing these user stories, enter the URL to your live app and, optionally, your GitHub repository. Then click the "I've completed this challenge" button.
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
index aa1dcc3a84a..346102efebe 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
@@ -1,6 +1,6 @@
 ---
 id: bd7108d8c242eddfaeb5bd13
-title: Map Data Across the Globe
+title: Mapa de Datos sobre el mundo
 challengeType: 3
 forumTopicId: 302365
 dashedName: map-data-across-the-globe
@@ -8,9 +8,9 @@ dashedName: map-data-across-the-globe
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/mVEJag>.
+**Objective:** Build an app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/mVEJag>.
 
-Fulfill the following [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+Fulfill the below user stories and get all of the tests to pass. Utiliza las librerías o APIs que necesites. Dale su propio estilo personal.
 
 **User Story:** I can see where all Meteorites landed on a world map.
 
@@ -20,9 +20,9 @@ Fulfill the following [user stories](https://en.wikipedia.org/wiki/User_story).
 
 **Hint:** Here's a dataset you can use to build this: <https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/meteorite-strike-data.json>
 
-When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+Cuando hayas terminado, incluye un enlace a tu proyecto en CodePen y haz clic en el botón "He completado este desafío".
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
index 9e83b937f40..4cc51c2bff4 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
@@ -1,6 +1,6 @@
 ---
 id: bd7198d8c242eddfaeb5bd13
-title: Show National Contiguity with a Force Directed Graph
+title: Muestra la contigüidad nacional con un gráfico dirigido por fuerza
 challengeType: 3
 forumTopicId: 302367
 dashedName: show-national-contiguity-with-a-force-directed-graph
@@ -8,9 +8,9 @@ dashedName: show-national-contiguity-with-a-force-directed-graph
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/xVopBo>.
+**Objective:** Build an app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/XWEONRz>.
 
-Fulfill the following [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+Fulfill the below user stories and get all of the tests to pass. Utiliza las librerías o APIs que necesites. Dale su propio estilo personal.
 
 **User Story:** I can see a Force-directed Graph that shows which countries share borders.
 
@@ -20,9 +20,9 @@ Fulfill the following [user stories](https://en.wikipedia.org/wiki/User_story).
 
 **Hint:** You can create a spritesheet of national flags at <https://www.flag-sprites.com>.
 
-When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+Cuando hayas terminado, incluye un enlace a tu proyecto en CodePen y haz clic en el botón "He completado este desafío".
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/show-the-local-weather.md b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
index 9d470d6b1cf..d6ba5e1c067 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
@@ -1,6 +1,6 @@
 ---
 id: bd7158d8c442eddfaeb5bd10
-title: Show the Local Weather
+title: Muestra el clima local
 challengeType: 3
 forumTopicId: 302368
 dashedName: show-the-local-weather
@@ -8,11 +8,11 @@ dashedName: show-the-local-weather
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/bELRjV>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/bELRjV" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/bELRjV</a>.
 
-**Rule #1:** Don't look at the example project's code. Figure it out for yourself.
+**Regla #1:** No mires el código del proyecto de ejemplo. Encuentra tu propia solución.
 
-**Rule #2:** Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+**Rule #2:** Fulfill the below user stories and get all of the tests to pass. Utilice las librerías o APIs que necesites. Dale tu propio estilo personal.
 
 **User Story:** I can see the weather in my current location.
 
@@ -20,11 +20,11 @@ dashedName: show-the-local-weather
 
 **User Story:** I can push a button to toggle between Fahrenheit and Celsius.
 
-**Note:** Many internet browsers now require an HTTP Secure (`https://`) connection to obtain a user's locale via HTML5 Geolocation. For this reason, we recommend using HTML5 Geolocation to get user location and then use the freeCodeCamp Weather API <https://weather-proxy.freecodecamp.rocks/> which uses an HTTP Secure connection for the weather. Also, be sure to connect to [CodePen.io](https://codepen.io) via `https://`.
+**Note:** Many internet browsers now require an HTTP Secure (`https://`) connection to obtain a user's locale via HTML5 Geolocation. For this reason, we recommend using HTML5 Geolocation to get user location and then use the freeCodeCamp Weather API <a href="https://weather-proxy.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://weather-proxy.freecodecamp.rocks/</a> which uses an HTTP Secure connection for the weather. Also, be sure to connect to <a href="https://codepen.io" target="_blank" rel="noopener noreferrer nofollow">CodePen.io</a> via `https://`.
 
-When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+Cuando hayas terminado, incluye un enlace a tu proyecto en CodePen y haz clic en el botón "He completado este desafío".
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
index 55d17b1745f..f32ec9909aa 100644
--- a/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
+++ b/curriculum/challenges/espanol/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
@@ -1,6 +1,6 @@
 ---
 id: bd7158d8c442eddfaeb5bd1f
-title: Use the Twitch JSON API
+title: Utiliza la API JSON de Twitch
 challengeType: 3
 forumTopicId: 19541
 dashedName: use-the-twitch-json-api
@@ -8,25 +8,25 @@ dashedName: use-the-twitch-json-api
 
 # --description--
 
-**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/Myvqmo/>.
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/Myvqmo/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/Myvqmo/</a>.
 
-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.
+The Twitch API is a RESTful API that lets developers build creative integrations for the broader Twitch community.
+
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
 **User Story:** I can see whether freeCodeCamp is currently streaming on Twitch.tv.
 
 **User Story:** I can click the status output and be sent directly to the freeCodeCamp's Twitch.tv channel.
 
-**User Story:** if a Twitch user is currently streaming, I can see additional details about what they are streaming.
-
-**Hint:** The relevant documentation about Twitch.tv's JSON API is here: <https://dev.twitch.tv/docs/api/reference/#get-streams>.
+**User Story:** If a Twitch user is currently streaming, I can see additional details about what they are streaming.
 
 **Hint:** Here's an array of the Twitch.tv usernames of people who regularly stream: `["ESL_SC2", "OgamingSC2", "cretetion", "freecodecamp", "storbeck", "habathcx", "RobotCaleb", "noobs2ninjas"]`
 
-**UPDATE:** Due to a change in conditions on API usage, Twitch.tv requires an API key, but we've built a workaround. Use <https://twitch-proxy.freecodecamp.rocks/> instead of Twitch's API base URL (i.e. `https://api.twitch.tv/helix` ) and you'll still be able to get account information, without needing to sign up for an API key.
+**UPDATE:** Due to a change in conditions on API usage, Twitch.tv requires an API key, but we've built a workaround. Use <a href="https://twitch-proxy.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://twitch-proxy.freecodecamp.rocks/</a> instead of Twitch's API base URL and you'll still be able to get account information, without needing to sign up for an API key.
 
-When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+Cuando hayas terminado, incluye un enlace a tu proyecto en CodePen y haz clic en el botón "He completado este desafío".
 
-You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md b/curriculum/challenges/espanol/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md
index 56b993d65c9..3fff908f909 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md
@@ -1,6 +1,6 @@
 ---
 id: 5e46f8edac417301a38fb930
-title: Linear Regression Health Costs Calculator
+title: Calculadora de costos de salud por regresión lineal
 challengeType: 10
 forumTopicId: 462379
 dashedName: linear-regression-health-costs-calculator
@@ -8,16 +8,30 @@ 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).
+You will be <a href="https://colab.research.google.com/github/freeCodeCamp/boilerplate-linear-regression-health-costs-calculator/blob/master/fcc_predict_health_costs_with_regression.ipynb" target="_blank" rel="noopener noreferrer nofollow">working on this project with Google Colaboratory</a>.
 
 After going to that link, create a copy of the notebook either in your own account or locally. Once you complete the project and it passes the test (included at that link), submit your project link below. If you are submitting a Google Colaboratory link, make sure to turn on link sharing for "anyone with the link."
 
 We are still developing the interactive instructional content for the machine learning curriculum. For now, you can go through the video challenges in this certification. You may also have to seek out additional learning resources, similar to what you would do when working on a real-world project.
 
+# --instructions--
+
+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.
+
+The first two cells of this notebook import libraries and the data.
+
+Make sure to convert categorical data to numbers. Use 80% of the data as the `train_dataset` and 20% of the data as the `test_dataset`.
+
+`pop` off the "expenses" column from these datasets to create new datasets called `train_labels` and `test_labels`. Use these labels when training your model.
+
+Create a model and train it with the `train_dataset`. Run the final cell in this notebook to check your model. The final cell will use the unseen `test_dataset` to check how well the model generalizes.
+
+To pass the challenge, `model.evaluate` must return a Mean Absolute Error of under 3500. This means it predicts health care costs correctly within $3500.
+
+The final cell will also predict expenses using the `test_dataset` and graph the results.
+
 # --hints--
 
 It should pass all Python tests.
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md b/curriculum/challenges/espanol/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md
index c5919ba4708..563739df5f6 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md
@@ -1,6 +1,6 @@
 ---
 id: 5e46f8edac417301a38fb931
-title: Neural Network SMS Text Classifier
+title: Clasificador de textos SMS basado en redes neuronales
 challengeType: 10
 forumTopicId: 462380
 dashedName: neural-network-sms-text-classifier
@@ -8,14 +8,22 @@ dashedName: neural-network-sms-text-classifier
 
 # --description--
 
-In this challenge, you need to create a machine learning model that will classify SMS messages as either "ham" or "spam". A "ham" message is a normal message sent by a friend. A "spam" message is an advertisement or a message sent by a company.
-
-You can access [the full project instructions and starter code on Google Colaboratory](https://colab.research.google.com/github/freeCodeCamp/boilerplate-neural-network-sms-text-classifier/blob/master/fcc_sms_text_classification.ipynb).
+You will be <a href="https://colab.research.google.com/github/freeCodeCamp/boilerplate-neural-network-sms-text-classifier/blob/master/fcc_sms_text_classification.ipynb" target="_blank" rel="noopener noreferrer nofollow">working on this project with Google Colaboratory</a>.
 
 After going to that link, create a copy of the notebook either in your own account or locally. Once you complete the project and it passes the test (included at that link), submit your project link below. If you are submitting a Google Colaboratory link, make sure to turn on link sharing for "anyone with the link."
 
 We are still developing the interactive instructional content for the machine learning curriculum. For now, you can go through the video challenges in this certification. You may also have to seek out additional learning resources, similar to what you would do when working on a real-world project.
 
+# --instructions--
+
+In this challenge, you need to create a machine learning model that will classify SMS messages as either "ham" or "spam". A "ham" message is a normal message sent by a friend. A "spam" message is an advertisement or a message sent by a company.
+
+You should create a function called `predict_message` that takes a message string as an argument and returns a list. The first element in the list should be a number between zero and one that indicates the likeliness of "ham" (0) or "spam" (1). The second element in the list should be the word "ham" or "spam", depending on which is most likely.
+
+For this challenge, you will use the <a href="http://www.dt.fee.unicamp.br/~tiago/smsspamcollection/" target="_blank" rel="noopener noreferrer nofollow">SMS Spam Collection</a> dataset. The dataset has already been grouped into train data and test data.
+
+The first two cells import the libraries and data. The final cell tests your model and function. Add your code in between these cells.
+
 # --hints--
 
 It should pass all Python tests.
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md b/curriculum/challenges/espanol/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
index d2d0410e52f..e449debf742 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
@@ -1,6 +1,6 @@
 ---
 id: 5e46f8d6ac417301a38fb92d
-title: Rock Paper Scissors
+title: Piedra, papel y tijeras
 challengeType: 10
 forumTopicId: 462376
 dashedName: rock-paper-scissors
@@ -10,12 +10,52 @@ dashedName: rock-paper-scissors
 
 For this challenge, you will create a program to play Rock, Paper, Scissors. A program that picks at random will usually win 50% of the time. To pass this challenge your program must play matches against four different bots, winning at least 60% of the games in each match.
 
-You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-rock-paper-scissors).
-
-After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-rock-paper-scissors" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 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.
 
+# --instructions--
+
+In the file `RPS.py` you are provided with a function called `player`. The function takes an argument that is a string describing the last move of the opponent ("R", "P", or "S"). The function should return a string representing the next move for it to play ("R", "P", or "S").
+
+A player function will receive an empty string as an argument for the first game in a match since there is no previous play.
+
+The file `RPS.py` shows an example function that you will need to update. The example function is defined with two arguments (`player(prev_play, opponent_history = [])`). The function is never called with a second argument so that one is completely optional. The reason why the example function contains a second argument (`opponent_history = []`) is because that is the only way to save state between consecutive calls of the `player` function. You only need the `opponent_history` argument if you want to keep track of the opponent_history.
+
+*Hint: To defeat all four opponents, your program may need to have multiple strategies that change depending on the plays of the opponent.*
+
+## Development
+
+Do not modify `RPS_game.py`. Write all your code in `RPS.py`. For development, you can use `main.py` to test your code.
+
+`main.py` imports the game function and bots from `RPS_game.py`.
+
+To test your code, play a game with the `play` function. The `play` function takes four arguments:
+
+- two players to play against each other (the players are actually functions)
+- the number of games to play in the match
+- an optional argument to see a log of each game. Set it to `True` to see these messages.
+
+```py
+play(player1, player2, num_games[, verbose])
+```
+
+For example, here is how you would call the function if you want `player` and `quincy` to play 1000 games against each other and you want to see the results of each game:
+
+```py
+play(player, quincy, 1000, verbose=True)
+```
+
+Click the "run" button and `main.py` will run.
+
+## Testing
+
+The unit tests for this project are in `test_module.py`. We imported the tests from `test_module.py` to `main.py` for your convenience. If you uncomment the last line in `main.py`, the tests will run automatically whenever you hit the "run" button.
+
+## Submitting
+
+Copy your project's URL and submit it below.
+
 # --hints--
 
 It should pass all Python tests.
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-the-convolutional-layer.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-the-convolutional-layer.md
index 87c0b9ef9be..5d2e48e7dc2 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-the-convolutional-layer.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-the-convolutional-layer.md
@@ -1,8 +1,12 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d97
-title: 'Convolutional Neural Networks: The Convolutional Layer'
+title: 'Redes neuronales convolucionales: La capa convolucional'
 challengeType: 11
 videoId: LrdmcQpTyLw
+bilibiliIds:
+  aid: 805608595
+  bvid: BV1Q34y1S7nr
+  cid: 409131585
 dashedName: convolutional-neural-networks-the-convolutional-layer
 ---
 
@@ -10,7 +14,7 @@ dashedName: convolutional-neural-networks-the-convolutional-layer
 
 ## --text--
 
-What are the three main properties of each convolutional layer?
+¿Cuáles son las tres propiedades principales de cada capa convolucional?
 
 ## --answers--
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-building-the-model.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-building-the-model.md
index 4b792df4cd1..90a27f4eff1 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-building-the-model.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-building-the-model.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72d8e
 title: 'Core Learning Algorithms: Building the Model'
 challengeType: 11
 videoId: 5wHw8BTd2ZQ
+bilibiliIds:
+  aid: 763068584
+  bvid: BV1s64y1a7WR
+  cid: 409128675
 dashedName: core-learning-algorithms-building-the-model
 ---
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-classification.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-classification.md
index 245cf7febe3..7c488892534 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-classification.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-classification.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72d8d
 title: 'Core Learning Algorithms: Classification'
 challengeType: 11
 videoId: qFF7ZQNvK9E
+bilibiliIds:
+  aid: 505531167
+  bvid: BV1Vg411c7av
+  cid: 409128427
 dashedName: core-learning-algorithms-classification
 ---
 
@@ -22,7 +26,7 @@ Predicting a numeric value or forecast based on independent and dependent variab
 
 ---
 
-None of the above.
+Ninguno de las anteriores.
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-clustering.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-clustering.md
index 0f8065dedcf..cd43897d3d5 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-clustering.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-clustering.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72d8f
 title: 'Core Learning Algorithms: Clustering'
 challengeType: 11
 videoId: 8sqIaHc9Cz4
+bilibiliIds:
+  aid: 720567137
+  bvid: BV1BQ4y1r7UY
+  cid: 409129005
 dashedName: core-learning-algorithms-clustering
 ---
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-hidden-markov-models.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-hidden-markov-models.md
index b829085f33a..2adf4b70551 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-hidden-markov-models.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-hidden-markov-models.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72d90
 title: 'Core Learning Algorithms: Hidden Markov Models'
 challengeType: 11
 videoId: IZg24y4wEPY
+bilibiliIds:
+  aid: 633081400
+  bvid: BV1tb4y1y72V
+  cid: 409129376
 dashedName: core-learning-algorithms-hidden-markov-models
 ---
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-the-training-process.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-the-training-process.md
index 29ca4b48963..db4efa79cac 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-the-training-process.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-the-training-process.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72d8c
 title: 'Core Learning Algorithms: The Training Process'
 challengeType: 11
 videoId: _cEwvqVoBhI
+bilibiliIds:
+  aid: 335593652
+  bvid: BV12R4y1H7Fi
+  cid: 409128047
 dashedName: core-learning-algorithms-the-training-process
 ---
 
@@ -18,7 +22,7 @@ The number of times the model will see the same data.
 
 ---
 
-A type of graph.
+Un tipo de gráfico.
 
 ---
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-training-and-testing-data.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-training-and-testing-data.md
index d31d7425eb7..bc70767fc9b 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-training-and-testing-data.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-training-and-testing-data.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72d8b
 title: 'Core Learning Algorithms: Training and Testing Data'
 challengeType: 11
 videoId: wz9J1slsi7I
+bilibiliIds:
+  aid: 335509743
+  bvid: BV1rA411F7bG
+  cid: 409127635
 dashedName: core-learning-algorithms-training-and-testing-data
 ---
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-using-probabilities-to-make-predictions.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-using-probabilities-to-make-predictions.md
index 2f77b3c6ea2..76665a453ef 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-using-probabilities-to-make-predictions.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-using-probabilities-to-make-predictions.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72d91
 title: 'Core Learning Algorithms: Using Probabilities to make Predictions'
 challengeType: 11
 videoId: fYAYvLUawnc
+bilibiliIds:
+  aid: 763245369
+  bvid: BV1B64y187gE
+  cid: 414731624
 dashedName: core-learning-algorithms-using-probabilities-to-make-predictions
 ---
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-working-with-data.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-working-with-data.md
index bd2c0c44f11..c69adea9f8f 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-working-with-data.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms-working-with-data.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72d8a
 title: 'Core Learning Algorithms: Working with Data'
 challengeType: 11
 videoId: u85IOSsJsPI
+bilibiliIds:
+  aid: 675550447
+  bvid: BV1RU4y1w7up
+  cid: 409127383
 dashedName: core-learning-algorithms-working-with-data
 ---
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms.md
index 470a5db663b..a07661ed57b 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/core-learning-algorithms.md
@@ -1,8 +1,12 @@
 ---
 id: 5e8f2f13c4cdbe86b5c72d89
-title: Core Learning Algorithms
+title: Algoritmos básicos de aprendizaje
 challengeType: 11
 videoId: u5lZURgcWnU
+bilibiliIds:
+  aid: 763034025
+  bvid: BV1A64y1a7g4
+  cid: 409127051
 dashedName: core-learning-algorithms
 ---
 
@@ -10,25 +14,25 @@ dashedName: core-learning-algorithms
 
 ## --text--
 
-Which type of analysis would be best suited for the following problem?:
+¿Qué tipo de análisis sería el más adecuado para el siguiente problema?:
 
-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.
+Tu tienes el promedio de temperatura en el mes de marzo por los ultimos 100 años. Usando estos datos, usted busca predecir la temperatura promedio en el mes de marzo dentro de 5 años.
 
 ## --answers--
 
-Multiple regression
+Regresion Multiple
 
 ---
 
-Correlation
+Correlacion
 
 ---
 
-Decision tree
+Arbol de desicion
 
 ---
 
-Linear regression
+Regresion lineal
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/introduction-machine-learning-fundamentals.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/introduction-machine-learning-fundamentals.md
index 185278bb1e7..61248b976a3 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/introduction-machine-learning-fundamentals.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/introduction-machine-learning-fundamentals.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72d87
 title: 'Introduction: Machine Learning Fundamentals'
 challengeType: 11
 videoId: KwL1qTR5MT8
+bilibiliIds:
+  aid: 293071716
+  bvid: BV1Yf4y1n7R2
+  cid: 409125921
 dashedName: introduction-machine-learning-fundamentals
 ---
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/introduction-to-tensorflow.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/introduction-to-tensorflow.md
index cefca2bfe26..b5fd7cb1237 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/introduction-to-tensorflow.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/introduction-to-tensorflow.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72d88
 title: Introduction to TensorFlow
 challengeType: 11
 videoId: r9hRyGGjOgQ
+bilibiliIds:
+  aid: 675554869
+  bvid: BV1dU4y1w7vw
+  cid: 409126541
 dashedName: introduction-to-tensorflow
 ---
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-building-the-model.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-building-the-model.md
index 7b7546ba33f..e89886a9a1c 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-building-the-model.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-building-the-model.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72da1
 title: 'Natural Language Processing With RNNs: Building the Model'
 challengeType: 11
 videoId: 32WBFS7lfsw
+bilibiliIds:
+  aid: 848015573
+  bvid: BV1YL4y1a7WS
+  cid: 409138016
 dashedName: natural-language-processing-with-rnns-building-the-model
 ---
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-create-a-play-generator.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-create-a-play-generator.md
index f3a22f813d7..ea3420cce7a 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-create-a-play-generator.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-create-a-play-generator.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72da0
 title: 'Natural Language Processing With RNNs: Create a Play Generator'
 challengeType: 11
 videoId: j5xsxjq_Xk8
+bilibiliIds:
+  aid: 720525759
+  bvid: BV1xQ4y1r7tw
+  cid: 409137674
 dashedName: natural-language-processing-with-rnns-create-a-play-generator
 ---
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-making-predictions.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-making-predictions.md
index 29dbc05f8d2..d377f321946 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-making-predictions.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-making-predictions.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72d9f
 title: 'Natural Language Processing With RNNs: Making Predictions'
 challengeType: 11
 videoId: WO1hINnBj20
+bilibiliIds:
+  aid: 848023400
+  bvid: BV1WL4y1a75i
+  cid: 409136303
 dashedName: natural-language-processing-with-rnns-making-predictions
 ---
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-part-2.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-part-2.md
index c572d154e16..e8324cf56e4 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-part-2.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-part-2.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72d9c
 title: 'Natural Language Processing With RNNs: Part 2'
 challengeType: 11
 videoId: mUU9YXOFbZg
+bilibiliIds:
+  aid: 975558435
+  bvid: BV1L44y1b7Lp
+  cid: 409135242
 dashedName: natural-language-processing-with-rnns-part-2
 ---
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-recurring-neural-networks.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-recurring-neural-networks.md
index e3d8d7e2638..64e8ec9e96b 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-recurring-neural-networks.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-recurring-neural-networks.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72d9d
 title: 'Natural Language Processing With RNNs: Recurring Neural Networks'
 challengeType: 11
 videoId: bX5681NPOcA
+bilibiliIds:
+  aid: 335605808
+  bvid: BV1SR4y1H7ri
+  cid: 409135641
 dashedName: natural-language-processing-with-rnns-recurring-neural-networks
 ---
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-training-the-model.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-training-the-model.md
index 2ae0cab5b74..a2d0858bab7 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-training-the-model.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-training-the-model.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72da2
 title: 'Natural Language Processing With RNNs: Training the Model'
 challengeType: 11
 videoId: hEUiK7j9UI8
+bilibiliIds:
+  aid: 250542136
+  bvid: BV19v411w7Fi
+  cid: 409138327
 dashedName: natural-language-processing-with-rnns-training-the-model
 ---
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns.md
index f4bde454837..00041af268d 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72d9b
 title: Natural Language Processing With RNNs
 challengeType: 11
 videoId: ZyCaF5S-lKg
+bilibiliIds:
+  aid: 548105306
+  bvid: BV1nq4y1K7VU
+  cid: 409134745
 dashedName: natural-language-processing-with-rnns
 ---
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md
index 635e29a35db..92b267520c6 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72d93
 title: 'Neural Networks: Activation Functions'
 challengeType: 11
 videoId: S45tqW6BqRs
+bilibiliIds:
+  aid: 675610466
+  bvid: BV1wU4y1A7TJ
+  cid: 409130203
 dashedName: neural-networks-activation-functions
 ---
 
@@ -10,7 +14,7 @@ dashedName: neural-networks-activation-functions
 
 ## --text--
 
-Which activation function switches values between -1 and 1?
+Which activation function squishes values between -1 and 1?
 
 ## --answers--
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/neural-networks-creating-a-model.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/neural-networks-creating-a-model.md
index 05b3df57e0a..fa08700d19d 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/neural-networks-creating-a-model.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/neural-networks-creating-a-model.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72d95
 title: 'Neural Networks: Creating a Model'
 challengeType: 11
 videoId: K8bz1bmOCTw
+bilibiliIds:
+  aid: 848109040
+  bvid: BV1EL4y1878f
+  cid: 409130886
 dashedName: neural-networks-creating-a-model
 ---
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/neural-networks-optimizers.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/neural-networks-optimizers.md
index 216b851ab51..c5da846ac08 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/neural-networks-optimizers.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/neural-networks-optimizers.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72d94
 title: 'Neural Networks: Optimizers'
 challengeType: 11
 videoId: hdOtRPQe1o4
+bilibiliIds:
+  aid: 763064173
+  bvid: BV1364y1a7eM
+  cid: 409130557
 dashedName: neural-networks-optimizers
 ---
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/neural-networks-with-tensorflow.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/neural-networks-with-tensorflow.md
index d9d07b00fcc..44684db292b 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/neural-networks-with-tensorflow.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/neural-networks-with-tensorflow.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72d92
 title: Neural Networks with TensorFlow
 challengeType: 11
 videoId: uisdfrNrZW4
+bilibiliIds:
+  aid: 378031840
+  bvid: BV1Qf4y1c7Dc
+  cid: 409129888
 dashedName: neural-networks-with-tensorflow
 ---
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-example.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-example.md
index 1b9f6923a90..b1bbe37b30d 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-example.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-example.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72da5
 title: 'Reinforcement Learning With Q-Learning: Example'
 challengeType: 11
 videoId: RBBSNta234s
+bilibiliIds:
+  aid: 848073871
+  bvid: BV1uL4y187Eq
+  cid: 409139471
 dashedName: reinforcement-learning-with-q-learning-example
 ---
 
diff --git a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-part-2.md b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-part-2.md
index 089f1440386..5aa787be324 100644
--- a/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-part-2.md
+++ b/curriculum/challenges/espanol/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-part-2.md
@@ -3,6 +3,10 @@ id: 5e8f2f13c4cdbe86b5c72da4
 title: 'Reinforcement Learning With Q-Learning: Part 2'
 challengeType: 11
 videoId: DX7hJuaUZ7o
+bilibiliIds:
+  aid: 420570359
+  bvid: BV1G341127zr
+  cid: 409139190
 dashedName: reinforcement-learning-with-q-learning-part-2
 ---
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md b/curriculum/challenges/espanol/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md
index 51501673bd9..4779cf28cd2 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md
@@ -91,7 +91,7 @@ const el = document.getElementById('name')
 assert(!!el && el.required)
 ```
 
-Tu `#name` debe ser un descendiente de `#survey-form`.
+Tu `#name` debe ser descendiente de `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #name')
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
index 346d633abca..83487678082 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
@@ -9,7 +9,7 @@ dashedName: step-56
 
 Para alinear las cajas `input` entre sí, establece la propiedad `display` a `inline-block` para todos los elementos `input` y `label` dentro de los elementos `.info`.
 
-Además, alinee el texto a la derecha.
+Alinea también el texto del elemento `label` a la derecha.
 
 # --hints--
 
@@ -28,22 +28,14 @@ const display = gs('.info > label, .info > input') ?? gs('.info label, .info inp
 assert.equal(display, 'inline-block');
 ```
 
-Debes dar a los elementos `input` y `label` un `text-align` de `right`.
+Debes darle el valor `right` a la propiedad `text-align` del elemento `label`.
 
 ```js
 const gs = (s) => new __helpers.CSSHelp(document).getStyle(s)?.textAlign;
-const textAlign = gs('.info > label, .info > input') ?? gs('.info label, .info input') ?? gs('.info > input, .info > label') ?? gs('.info input, .info label');
+const textAlign = gs('.info > label') ?? gs('.info label');
 assert.equal(textAlign, 'right');
 ```
 
-Debes establecer la propiedad `text-align: right` antes de la regla `.info input`.
-
-```js
-const gs = (s) => new __helpers.CSSHelp(document).getStyleRule(s);
-assert(gs('.info input').isDeclaredAfter('.info label, .info input') || gs('.info input').isDeclaredAfter('.info > label, .info > input') || gs('.info input').isDeclaredAfter('.info > input, .info > label') || gs('.info input').isDeclaredAfter('.info input, .info label'));
-
-```
-
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
index ac7f4cd2afc..6f0b4683bc8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
@@ -286,7 +286,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -297,6 +296,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 --fcc-editable-region--
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
index d52e0bf150e..0419ffed4ac 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
@@ -272,7 +272,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -283,6 +282,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
index 0a699f8028c..ce39c90e9b8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
@@ -262,7 +262,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -273,6 +272,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
index 238e73f6af8..9a30843c305 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
@@ -260,7 +260,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -271,6 +270,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
index ad4bbabc3de..9bfce0907f4 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
@@ -300,7 +300,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -311,6 +310,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
index cb09226636b..7057b611f5b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
@@ -266,7 +266,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -277,6 +276,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
index 26fbc20b8e5..962a99e84de 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
@@ -280,7 +280,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -291,6 +290,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
index e031a08a753..11423cf912d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
@@ -278,7 +278,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -289,6 +288,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
index aa899106c2f..7ef9ee2f42d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
@@ -260,7 +260,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -271,6 +270,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
index dc5c0ee6e31..b838906a2d6 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
@@ -278,7 +278,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -289,6 +288,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
index d48ccc793df..e86afb51d56 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
@@ -280,7 +280,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -291,6 +290,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
@@ -603,12 +603,12 @@ input {
 .info label,
 .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .info input {
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
index 0874534f73d..e73a17f9906 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
@@ -7,38 +7,33 @@ dashedName: step-5
 
 # --description--
 
-El nombre de la cafetería es `CAMPER CAFE`. Añade un elemento `h1` dentro tu elemento `body`. Dale el nombre de la cafetería en mayúsculas para hacer que resalte.
+Es hora de darle contenido al menú. Añade un elemento `main` dentro del elemento `body` existente. Contendrá información sobre los precios de los cafés y postres ofrecidos en la cafetería.
 
 # --hints--
 
-Debes tener una etiqueta `<h1>` de apertura.
+Tu código debe tener una etiqueta de apertura `<main>`.
 
 ```js
-assert(code.match(/<h1>/i));
+assert(code.match(/<main>/i));
 ```
 
-Debes tener una etiqueta `</h1>` de cierre.
+Tu código debe tener una etiqueta de cierre `</main>`.
 
 ```js
-assert(code.match(/<\/h1>/i));
+assert(code.match(/<\/main>/i));
 ```
 
-No debes modificar el elemento `body` existente.
+No debes cambiar el elemento `body`. Asegúrate de que no has borrado accidentalmente la etiqueta de cierre.
 
 ```js
 assert($('body').length === 1);
 ```
 
-Tu elemento `h1` debe estar anidado dentro del elemento `body`.
+La etiqueta `main` debe estar dentro de la etiqueta `body`.
 
 ```js
-assert($('h1')[0].parentElement.tagName === "BODY");
-```
-
-Tu elemento `h1` debe tener el texto `CAMPER CAFE`.
-
-```js
-assert(code.match(/<h1>CAMPER CAFE<\/h1>/));
+const main = document.querySelector('main');
+assert(main.parentElement.tagName === 'BODY');
 ```
 
 # --seed--
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
index 0941dfc4276..eaf65ffad99 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
@@ -7,38 +7,38 @@ dashedName: step-6
 
 # --description--
 
-Para que los visitantes sepan que la cafetería fue fundada en el 2020, añade un elemento `p` debajo del elemento `h1` con el texto `Est. 2020`.
+El nombre de la cafetería es `CAMPER CAFE`. Añade un elemento `h1` dentro del elemento `main`. Su contenido será el nombre de la cafetería, con todas las letras mayúsculas para que destaque.
 
 # --hints--
 
-Debes tener una etiqueta `<p>` de apertura.
+Debes tener una etiqueta de apertura `<h1>`.
 
 ```js
-assert(code.match(/<p>/i));
+assert(code.match(/<h1>/i));
 ```
 
-Debes tener una etiqueta `</p>` de cierre.
+Debes tener una etiqueta de cierre `</h1>`.
 
 ```js
-assert(code.match(/<\/p>/i));
+assert(code.match(/<\/h1>/i));
 ```
 
-No debes modificar el elemento `h1` existente. Asegúrese de que no eliminaste tu etiqueta de cierre.
+No debes cambiar el elemento `main` existente.
 
 ```js
-assert($('h1').length === 1);
+assert($('main').length === 1);
 ```
 
-Tu elemento `p` debe estar debajo del elemento `h1`.
+Tu elemento `h1` debe estar anidado en tu elemento `main`.
 
 ```js
-assert($('p')[0].previousElementSibling.tagName === 'H1');
+assert($('h1')[0].parentElement.tagName === "MAIN");
 ```
 
-Tu elemento `p` debe tener el texto `Est. 2020`.
+Tu elemento `h1` debe tener el texto `CAMPER CAFE`.
 
 ```js
-assert(document.querySelector("p").innerText === "Est. 2020");
+assert(code.match(/<h1>CAMPER CAFE<\/h1>/));
 ```
 
 # --seed--
@@ -54,7 +54,8 @@ assert(document.querySelector("p").innerText === "Est. 2020");
   </head>
   <body>
 --fcc-editable-region--
-    <h1>CAMPER CAFE</h1>
+    <main>
+    </main>
 --fcc-editable-region--
   </body>
 </html>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
index 65815622261..7ceb0d88f93 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
@@ -7,34 +7,38 @@ dashedName: step-7
 
 # --description--
 
-Ya que el elemento `p` añadido en el paso anterior, provee información extra sobre la cafetería, anida el elemento `h1` y el elemento `p` dentro de un elemento `header`.
+Para que los clientes sepan que la cafetería se fundó en 2020, añade un elemento `p` debajo del elemento `h1` con el texto `Est. 2020`.
 
 # --hints--
 
-Debes tener una etiqueta `<header>` de apertura.
+Debes tener una etiqueta de apertura `<p>`.
 
 ```js
-assert(code.match(/<header>/i));
+assert(code.match(/<p>/i));
 ```
 
-Debes tener una etiqueta `</header>` de cierre.
+Debes tener una etiqueta de cierre `</p>`.
 
 ```js
-assert(code.match(/<\/header>/i));
+assert(code.match(/<\/p>/i));
 ```
 
-Tu elemento `h1` debe estar anidado dentro del elemento `header`.
+No debes cambiar el elemento `h1` existente. Asegúrate de que no borras la etiqueta de cierre.
 
 ```js
-const header = document.querySelectorAll('header')[0];
-assert(header.children[0].tagName === 'H1');
+assert($('h1').length === 1);
 ```
 
-Tu elemento `p` debe estar anidado dentro del elemento `header`.
+Tu elemento `p` debe estar debajo del elemento `h1`.
 
 ```js
-const header = document.querySelectorAll('header')[0];
-assert(header.children[1].tagName === "P");
+assert($('p')[0].previousElementSibling.tagName === 'H1');
+```
+
+Tu elemento `p` debe terner el texto `Est. 2020`.
+
+```js
+assert(document.querySelector("p").innerText === "Est. 2020");
 ```
 
 # --seed--
@@ -49,10 +53,11 @@ assert(header.children[1].tagName === "P");
     <title>Cafe Menu</title>
   </head>
   <body>
+    <main>
 --fcc-editable-region--
-    <h1>CAMPER CAFE</h1>
-    <p>Est. 2020</p>
+      <h1>CAMPER CAFE</h1>
 --fcc-editable-region--
+    </main>
   </body>
 </html>
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md
index a39ef2e5585..644dfff1a00 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344f9c805cd193c33d829c
-title: Paso 12
+title: Paso 11
 challengeType: 0
-dashedName: step-12
+dashedName: step-11
 ---
 
 # --description--
@@ -56,11 +56,9 @@ assert(h1TextAlign === 'center');
 --fcc-editable-region--
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md
index 0e575b95232..3c71dc935e0 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fad8bf01691e71a30eb
-title: Paso 11
+title: Paso 10
 challengeType: 0
-dashedName: step-11
+dashedName: step-10
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(code.match(/<head\s*>[\w\W\s]*<style\s*>[\w\W\s]*<\/style\s*>[\w\W\s]*<\/
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md
index 8877540f986..a68d70c7650 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fbc22624a2976425065
-title: Paso 10
+title: Paso 9
 challengeType: 0
-dashedName: step-10
+dashedName: step-9
 ---
 
 # --description--
@@ -55,11 +55,9 @@ assert(h2.innerText === 'Coffee');
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
 --fcc-editable-region--
       <section>
       </section>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
index 38dee0448db..c2cf5a70d80 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fc1520b6719f2e35605
-title: Paso 9
+title: Paso 8
 challengeType: 0
-dashedName: step-9
+dashedName: step-8
 ---
 
 # --description--
@@ -32,8 +32,9 @@ assert($('main').length === 1);
 Tu elemento `section` debe estar anidado dentro de tu elemento `main`.
 
 ```js
-const main = document.querySelectorAll('main')?.[0];
-assert(main.children[0].tagName === 'SECTION');
+const main = document.querySelector('main');
+const section = document.querySelector('section');
+assert(section.parentElement === main);
 ```
 
 # --seed--
@@ -48,12 +49,10 @@ assert(main.children[0].tagName === 'SECTION');
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
-      <h1>CAMPER CAFE</h1>
-      <p>Est. 2020</p>
-    </header>
 --fcc-editable-region--
     <main>
+      <h1>CAMPER CAFE</h1>
+      <p>Est. 2020</p>
     </main>
 --fcc-editable-region--
   </body>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md
index 35cb66951c3..9df5cb541b7 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477ae34c1239cafe128be
-title: Paso 14
+title: Step 13
 challengeType: 0
-dashedName: step-14
+dashedName: step-13
 ---
 
 # --description--
@@ -58,11 +58,9 @@ assert(selectors.length === 1);
 --fcc-editable-region--
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md
index e1de33b5132..43d6dff68ef 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477ae8466a9a3d2cc953c
-title: Paso 16
+title: Step 15
 challengeType: 0
-dashedName: step-16
+dashedName: step-15
 ---
 
 # --description--
@@ -46,11 +46,9 @@ No debes tener ningún selector CSS en tu archivo HTML.
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md
index 3c8b796fdcd..51535674b1f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md
@@ -1,13 +1,13 @@
 ---
 id: 5f3477ae9675db8bb7655b30
-title: Paso 13
+title: Paso 12
 challengeType: 0
-dashedName: step-13
+dashedName: step-12
 ---
 
 # --description--
 
-En el paso anterior, utilizaste un <dfn>selector de tipo</dfn> para darle estilo al elemento `h1`. Ahora centra los elementos `h2` y `p` añadiendo un selector de tipo para cada elemento.
+En el paso anterior, utilizaste un <dfn>selector de tipo</dfn> para darle estilo al elemento `h1`. Centra los elementos `h2` y `p` añadiendo un nuevo selector de tipo para cada uno en el elemento `style` existente.
 
 # --hints--
 
@@ -18,35 +18,42 @@ const hasH1 = new __helpers.CSSHelp(document).getStyle('h1');
 assert(hasH1);
 ```
 
-Debes agregar un nuevo selector `h2`.
+No debes añadir una nueva etiqueta `style`. Añade las nuevas reglas CSS a la etiqueta `style` existente.
+
+```js
+const hasManyStyleTags = document.querySelectorAll('style').length > 1;
+assert(!hasManyStyleTags);
+```
+
+Debes añadir un nuevo selector `h2`.
 
 ```js
 const hasH2 = new __helpers.CSSHelp(document).getStyle('h2');
 assert(hasH2);
 ```
 
-Debes agregar un nuevo selector `p`.
+Debes añadir un nuevo selector `p`.
 
 ```js
 const hasP = new __helpers.CSSHelp(document).getStyle('p');
 assert(hasP);
 ```
 
-Tu elemento `h1` debe tener una propiedad, `text-align` el valor `center`.
+Tu elemento `h1` debe tener una propiedad `text-align` establecida a `center`.
 
 ```js
 const h1TextAlign = new __helpers.CSSHelp(document).getStyle('h1')?.getPropertyValue('text-align');
 assert(h1TextAlign === 'center');
 ```
 
-Tu elemento `h2` deben una propiedad `text-align` con el valor `center`.
+Tu elemento `h2` debe tener una propiedad `text-align` establecida a `center`.
 
 ```js
 const h2TextAlign = new __helpers.CSSHelp(document).getStyle('h2')?.getPropertyValue('text-align');
 assert(h2TextAlign === 'center');
 ```
 
-Tu elemento `p` debe tener una propiedad `text-align` con el valor `center`.
+Tu elemento `p` debe tener una propiedad `text-align` establecida a `center`.
 
 ```js
 const pTextAlign = new __helpers.CSSHelp(document).getStyle('p')?.getPropertyValue('text-align');
@@ -72,11 +79,9 @@ assert(pTextAlign === 'center');
 --fcc-editable-region--
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
index d8ae8b51bd0..0f67f7ff0b8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477aefa51bfc29327200b
-title: Paso 15
+title: Step 14
 challengeType: 0
-dashedName: step-15
+dashedName: step-14
 ---
 
 # --description--
@@ -54,11 +54,9 @@ Tu código no debe contener las etiquetas `<style>`.
     </style>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md
index 76536a769ce..ff91143d058 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477cb2e27333b1ab2b955
-title: Paso 17
+title: Step 16
 challengeType: 0
-dashedName: step-17
+dashedName: step-16
 ---
 
 # --description--
@@ -68,11 +68,9 @@ assert(link.dataset.href == 'styles.css')
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md
index 57189fd687c..18c0f324677 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477cb303c5cb61b43aa9b
-title: Paso 19
+title: Step 18
 challengeType: 0
-dashedName: step-19
+dashedName: step-18
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert(bodyBackground === 'brown');
     <link href="styles.css" rel="stylesheet"/>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md
index 549c4e930bd..9f57f7c041b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477cbcb6ba47918c1da92
-title: Paso 18
+title: Step 17
 challengeType: 0
-dashedName: step-18
+dashedName: step-17
 ---
 
 # --description--
@@ -52,11 +52,9 @@ assert(meta[0].outerHTML.match(/content=('|")width=device-width, initial-scale=1
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md
index 7870161253e..e89f9cfcfe9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md
@@ -1,8 +1,8 @@
 ---
 id: 5f34a1fd611d003edeafd681
-title: Paso 20
+title: Step 19
 challengeType: 0
-dashedName: step-20
+dashedName: step-19
 ---
 
 # --description--
@@ -39,11 +39,9 @@ assert(bodyBackground === 'burlywood');
     <link href="styles.css" rel="stylesheet"/>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
index f7743662947..ba2df70be86 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed60785e1f3e9850b6e
-title: Paso 25
+title: Step 24
 challengeType: 0
-dashedName: step-25
+dashedName: step-24
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(!hasWidth);
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
index dd157ec575f..94257a7eea8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
@@ -1,9 +1,9 @@
 ---
 id: 5f356ed60a5decd94ab66986
-title: Paso 23
+title: Paso 22
 challengeType: 0
 removeComments: false
-dashedName: step-23
+dashedName: step-22
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(bodyCSS === "rgba(0, 0, 0, 0)")
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
index 1a0f4599a65..a22ba1eacaf 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed6199b0cdef1d2be8f
-title: Paso 27
+title: Step 26
 challengeType: 0
-dashedName: step-27
+dashedName: step-26
 ---
 
 # --description--
@@ -48,11 +48,9 @@ assert(!hasDiv);
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
index 73fe86d3985..70d7a7a3952 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed63c7807a4f1e6d054
-title: Paso 22
+title: Paso 21
 challengeType: 0
-dashedName: step-22
+dashedName: step-21
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(divWidth === '300px');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
index ff3d6277e51..7e2587380e5 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed63e0fa262326eef05
-title: Paso 24
+title: Step 23
 challengeType: 0
-dashedName: step-24
+dashedName: step-23
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(divBackground === 'burlywood');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
index fa0e1129ce6..e104d59bdbb 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed656a336993abd9f7c
-title: Paso 26
+title: Step 25
 challengeType: 0
-dashedName: step-26
+dashedName: step-25
 ---
 
 # --description--
@@ -49,11 +49,9 @@ assert(divMarginLeft === 'auto');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
index 3a0a57829d2..0067ad173de 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed69db0a491745e2bb6
-title: Paso 28
+title: Step 27
 challengeType: 0
-dashedName: step-28
+dashedName: step-27
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert($('div').attr('class').includes('menu'));
 --fcc-editable-region--
     <div>
 --fcc-editable-region--
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
index 92ec125bf89..ac07a0dd5ce 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed6cf6eab5f15f5cfe6
-title: Paso 21
+title: Paso 20
 challengeType: 0
-dashedName: step-21
+dashedName: step-20
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(div.parentElement.tagName === 'BODY');
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md
index dabed358e01..79289dc4a2c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md
@@ -1,8 +1,8 @@
 ---
 id: 5f35e5c4321f818cdc4bed30
-title: Paso 30
+title: Step 29
 challengeType: 0
-dashedName: step-30
+dashedName: step-29
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(article.previousElementSibling.tagName === 'H2');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
 --fcc-editable-region--
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md
index 6a8b0bc053c..10ac6f1d1da 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f35e5c44359872a137bd98f
-title: Paso 29
+title: Step 28
 challengeType: 0
-dashedName: step-29
+dashedName: step-28
 ---
 
 # --description--
@@ -55,11 +55,9 @@ assert(bodyBackground === `url("https://cdn.freecodecamp.org/curriculum/css-cafe
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
index 08ab5b8d8fc..5774206bdcb 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d0fc037f7311b4ac8
-title: Paso 39
+title: Paso 38
 challengeType: 0
-dashedName: step-39
+dashedName: step-38
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(priceWidth === '50%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
index 1db3a03bcae..021fa679657 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d28d7ad0de6470505
-title: Paso 33
+title: Paso 32
 challengeType: 0
-dashedName: step-33
+dashedName: step-32
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert($('.flavor')[0].innerText.match(/French Vanilla/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
index 712a0633479..791d7af2760 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d5414453fc2d7b480
-title: Paso 32
+title: Paso 31
 challengeType: 0
-dashedName: step-32
+dashedName: step-31
 ---
 
 # --description--
@@ -90,11 +90,9 @@ assert(children[1].innerText.match(/4\.50/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
 --fcc-editable-region--
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
index 1567372af94..521dffa58ea 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866daec9a49519871816
-title: Paso 31
+title: Paso 30
 challengeType: 0
-dashedName: step-31
+dashedName: step-30
 ---
 
 # --description--
@@ -52,11 +52,9 @@ assert(secondP.innerText.match(/3\.00/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
 --fcc-editable-region--
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
index 93d37ef02d3..f7f003ec467 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866dbf362f99b9a0c6d0
-title: Paso 38
+title: Paso 37
 challengeType: 0
-dashedName: step-38
+dashedName: step-37
 ---
 
 # --description--
@@ -53,11 +53,9 @@ assert(itemPDisplay === 'inline-block');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md
index bf241c96401..ffc75bee7e7 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866dd0d0275f01d4d847
-title: Paso 40
+title: Paso 39
 challengeType: 0
-dashedName: step-40
+dashedName: step-39
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(priceWidth === '49%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md
index 6332771065c..25db7bc253b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866de7a5b784048f94b1
-title: Paso 37
+title: Paso 36
 challengeType: 0
-dashedName: step-37
+dashedName: step-36
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert($('article')[0].className === 'item');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
 --fcc-editable-region--
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md
index 79e1b552d82..31fbea04575 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade94c6576e7f7b7953f
-title: Paso 42
+title: Paso 41
 challengeType: 0
-dashedName: step-42
+dashedName: step-41
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(priceWidth === '50%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md
index c2005a7d2c7..22d0687cd38 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade9993019e26313fa8e
-title: Paso 43
+title: Paso 42
 challengeType: 0
-dashedName: step-43
+dashedName: step-42
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(articles[4] === items[4]);
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md
index 76eb20848f5..537cb22effa 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade99dda4e6071a85dfd
-title: Paso 47
+title: Paso 46
 challengeType: 0
-dashedName: step-47
+dashedName: step-46
 ---
 
 # --description--
@@ -50,11 +50,9 @@ assert($('main').children('section').length === 2);
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
 --fcc-editable-region--
         <section>
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md
index f6e2092ba8c..7a3d091368d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade9fa77275d9f4efe62
-title: Paso 41
+title: Paso 40
 challengeType: 0
-dashedName: step-41
+dashedName: step-40
 ---
 
 # --description--
@@ -34,11 +34,9 @@ assert(code.match(/Vanilla<\/p><p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md
index 01520a84f64..6aa6cd51227 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md
@@ -1,15 +1,15 @@
 ---
 id: 5f3ef6e01f288a026d709587
-title: Paso 67
+title: Paso 66
 challengeType: 0
-dashedName: step-67
+dashedName: step-66
 ---
 
 # --description--
 
 Puedes usar un elemento `hr` para mostrar una línea divisora entre secciones con diferente contenido.
 
-Primero, añade un elemento `hr` entre el primer elemento `header` y el elemento `main`. Ten en cuenta que los elementos `hr` son de auto-cierre.
+Primero, añade un elemento `hr` entre el elemento `p` con clase `established` y el primer elemento `section`. Ten en cuenta que los elementos `hr` son de auto-cierre.
 
 # --hints--
 
@@ -20,10 +20,10 @@ assert(code.match(/<hr\s?\/?>/i));
 assert(!code.match(/<\/hr>/i));
 ```
 
-No debes modificar el elemento `header` existente.
+No debes cambiar el elemento `p` con clase `established` existente.
 
 ```js
-assert($('header').length === 1);
+assert($('p.established').length === 1);
 ```
 
 No debes modificar el elemento `main` existente.
@@ -32,11 +32,11 @@ No debes modificar el elemento `main` existente.
 assert($('main').length === 1);
 ```
 
-Tu elemento `hr` debe estar entre tu elemento `header` y tu elemento `main`.
+El elemento `hr` debe estar entre el elemento `p` y el elemento `section`.
 
 ```js
-assert($('hr')[0].previousElementSibling.tagName === 'HEADER');
-assert($('hr')[0].nextElementSibling.tagName === 'MAIN');
+assert($('hr')[0].previousElementSibling.tagName === 'P');
+assert($('hr')[0].nextElementSibling.tagName === 'SECTION');
 ```
 
 # --seed--
@@ -55,11 +55,9 @@ assert($('hr')[0].nextElementSibling.tagName === 'MAIN');
   <body>
     <div class="menu">
 --fcc-editable-region--
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
index d59b3181313..dd1a397f60a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e03d719d5ac4738993
-title: Paso 57
+title: Paso 56
 challengeType: 0
-dashedName: step-57
+dashedName: step-56
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(menuMaxWidth === '500px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
index ca0e1cd73ed..cef5cec631e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e04559b939080db057
-title: Paso 56
+title: Step 55
 challengeType: 0
-dashedName: step-56
+dashedName: step-55
 ---
 
 # --description--
@@ -64,11 +64,9 @@ assert(menuPadding === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
index 8a38be345eb..0506e8f921e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e050279c7a4a7101d3
-title: Paso 55
+title: Step 54
 challengeType: 0
-dashedName: step-55
+dashedName: step-54
 ---
 
 # --description--
@@ -63,11 +63,9 @@ assert(menuPaddingBottom === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
index e4f78d46d3f..202231a7bac 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e05473f91f948724ab
-title: Paso 58
+title: Step 57
 challengeType: 0
-dashedName: step-58
+dashedName: step-57
 ---
 
 # --description--
@@ -41,11 +41,9 @@ assert(bodyFontFamily === 'sans-serif');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
index fb81bf29d5f..f13ba2f6b12 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e056bdde6ae6892ba2
-title: Paso 59
+title: Step 58
 challengeType: 0
-dashedName: step-59
+dashedName: step-58
 ---
 
 # --description--
@@ -54,11 +54,9 @@ assert($('h2').css('font-family').match(/impact/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
index 1f156726f7c..43ff5e23735 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e06d34faac0447fc44
-title: Paso 61
+title: Paso 60
 challengeType: 0
-dashedName: step-61
+dashedName: step-60
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(establishedFontStyle === 'italic');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md
index c3de3e3870f..a61c2db9f94 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e07276f782bb46b93d
-title: Paso 64
+title: Step 63
 challengeType: 0
-dashedName: step-64
+dashedName: step-63
 ---
 
 # --description--
@@ -51,12 +51,10 @@ assert(footer.previousElementSibling.tagName === 'MAIN');
   </head>
   <body>
     <div class="menu">
-      <header>
-        <h1>CAMPER CAFE</h1>
-        <p class="established">Est. 2020</p>
-      </header>
 --fcc-editable-region--
       <main>
+        <h1>CAMPER CAFE</h1>
+        <p class="established">Est. 2020</p>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
index 7c86a906db2..99ca7339049 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0819d4f23ca7285e6
-title: Paso 49
+title: Step 48
 challengeType: 0
-dashedName: step-49
+dashedName: step-48
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('section')[1].children[1].className === 'item');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
index dcbe8ab376c..a9669786f6f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e087d56ed3ffdc36be
-title: Paso 62
+title: Step 61
 challengeType: 0
-dashedName: step-62
+dashedName: step-61
 ---
 
 # --description--
@@ -45,13 +45,11 @@ assert($('.established').css('font-style') === 'italic');
   </head>
   <body>
     <div class="menu">
+      <main>
 --fcc-editable-region--
-      <header>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
 --fcc-editable-region--
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
index bb21a9517cf..254763ddd49 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0a81099d9a697b550
-title: Paso 65
+title: Paso 64
 challengeType: 0
-dashedName: step-65
+dashedName: step-64
 ---
 
 # --description--
@@ -58,11 +58,9 @@ assert(document.querySelector("footer > p > a")?.href === "https://www.freecodec
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md
index d44c1f6b00b..539583da9b7 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0b431cc215bb16f55
-title: Paso 66
+title: Paso 65
 challengeType: 0
-dashedName: step-66
+dashedName: step-65
 ---
 
 # --description--
@@ -38,11 +38,9 @@ assert($('footer').children('p').last().text().match(/123 Free Code Camp Drive/i
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md
index e51fdca288e..878167a6936 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0e0c3feaebcf647ad
-title: Paso 48
+title: Paso 47
 challengeType: 0
-dashedName: step-48
+dashedName: step-47
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('h2')[1].innerText.match(/Desserts/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md
index 980125d1913..06c0faa0698 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0e9629bad967cd71e
-title: Paso 60
+title: Paso 59
 challengeType: 0
-dashedName: step-60
+dashedName: step-59
 ---
 
 # --description--
@@ -35,11 +35,9 @@ assert(fontFamily === 'Impact, serif');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md
index cb574d6c1c7..608ad4b11c7 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0eaa7da26e3d34d78
-title: Paso 54
+title: Paso 53
 challengeType: 0
-dashedName: step-54
+dashedName: step-53
 ---
 
 # --description--
@@ -56,11 +56,9 @@ assert(menuPaddingRight === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md
index 74c2cde1a99..46ad35cbc76 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0f8c230bdd2349716
-title: Paso 63
+title: Paso 62
 challengeType: 0
-dashedName: step-63
+dashedName: step-62
 ---
 
 # --description--
@@ -56,11 +56,9 @@ assert(h2FontSize === '30px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
index 92253624ce3..53e2d4d1ed7 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3f26fa39591db45e5cd7a0
-title: Paso 68
+title: Step 67
 challengeType: 0
-dashedName: step-68
+dashedName: step-67
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(hrHeight === '3px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md
index d124b32bd9a..05e3ba3b9f9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459225127805351a6ad057
-title: Paso 69
+title: Paso 68
 challengeType: 0
-dashedName: step-69
+dashedName: step-68
 ---
 
 # --description--
@@ -39,12 +39,10 @@ assert(hrBackgroundColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
index b8a2eb5ec20..99eeda623d9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459a7ceb8b5c446656d88b
-title: Paso 70
+title: Step 69
 challengeType: 0
-dashedName: step-70
+dashedName: step-69
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(hrBorderColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
index ae935feb360..1953ed3f4fd 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459cf202c2a3472fae6a9f
-title: Paso 71
+title: Step 70
 challengeType: 0
-dashedName: step-71
+dashedName: step-70
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(hrHeight === '2px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
index 7e80263e9ba..9ab96e62f9f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459fd48bdc98491ca6d1a3
-title: Paso 72
+title: Step 71
 challengeType: 0
-dashedName: step-72
+dashedName: step-71
 ---
 
 # --description--
@@ -39,13 +39,11 @@ assert($('hr')[1].nextElementSibling.tagName === 'FOOTER');
   </head>
   <body>
     <div class="menu">
-      <header>
-        <h1>CAMPER CAFE</h1>
-        <p class="established">Est. 2020</p>
-      </header>
-      <hr>
 --fcc-editable-region--
       <main>
+        <h1>CAMPER CAFE</h1>
+        <p class="established">Est. 2020</p>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md
index d9256622f8b..a63dd641492 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a05977e2fa49d9119437
-title: Paso 73
+title: Step 72
 challengeType: 0
-dashedName: step-73
+dashedName: step-72
 ---
 
 # --description--
@@ -39,12 +39,10 @@ assert(bodyPadding === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md
index c99a60a4786..92c3b55589e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a276c093334f0f6e9df4
-title: Paso 74
+title: Step 73
 challengeType: 0
-dashedName: step-74
+dashedName: step-73
 ---
 
 # --description--
@@ -63,12 +63,10 @@ assert(itemPMarginBottom === '5px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md
index ae70a96a475..fb5b804850a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a5a7c49a8251f0bdb527
-title: Paso 75
+title: Step 74
 challengeType: 0
-dashedName: step-75
+dashedName: step-74
 ---
 
 # --description--
@@ -47,12 +47,10 @@ assert(itemPFontSize === '18px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md
index d1df56cec68..d7555b649da 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a66d4a2b0453301e5a26
-title: Paso 79
+title: Step 78
 challengeType: 0
-dashedName: step-79
+dashedName: step-78
 ---
 
 # --description--
@@ -54,12 +54,10 @@ assert(footerFontSize === '14px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md
index 5bdb945799c..d2417d46cf6 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b0731d39e15d54df4dfc
-title: Paso 80
+title: Step 79
 challengeType: 0
-dashedName: step-80
+dashedName: step-79
 ---
 
 # --description--
@@ -48,12 +48,10 @@ assert(aColor === 'black');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md
index a83b582059d..e0b30a2b35d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b25e7ec2405f166b9de1
-title: Paso 81
+title: Step 80
 challengeType: 0
-dashedName: step-81
+dashedName: step-80
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(aVisitedColor === 'grey' || aVisitedColor === 'gray');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md
index a5a9f5fa61e..7158a4b7bed 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b3c93c027860d9298dbd
-title: Paso 82
+title: Step 81
 challengeType: 0
-dashedName: step-82
+dashedName: step-81
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(aHoverColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md
index 99a17ac8dac..7ba899fe3b9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b45d099f3e621fbbb256
-title: Paso 83
+title: Step 82
 challengeType: 0
-dashedName: step-83
+dashedName: step-82
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(aActiveColor === 'white');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md
index 45dc8d4cf1d..d979aeee283 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b4c81cea7763550e40df
-title: Paso 84
+title: Step 83
 challengeType: 0
-dashedName: step-84
+dashedName: step-83
 ---
 
 # --description--
@@ -40,12 +40,10 @@ assert(aActiveColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md
index 162a7c40fcd..77a1e942e5e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b715301bbf667badc04a
-title: Paso 85
+title: Step 84
 challengeType: 0
-dashedName: step-85
+dashedName: step-84
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(h1MarginTop === '0px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md
index 8da2cc69df3..e002385711a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e270702a8456a664f0df
-title: Paso 86
+title: Step 85
 challengeType: 0
-dashedName: step-86
+dashedName: step-85
 ---
 
 # --description--
@@ -40,12 +40,10 @@ assert(h1MarginBottom === '15px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md
index e4a4164423c..028d0adab74 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e36e745ead58487aabf2
-title: Paso 87
+title: Step 86
 challengeType: 0
-dashedName: step-87
+dashedName: step-86
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(addressMarginBottom === '5px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md
index 5ddc622e9c9..386e946d3d2 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e7a4750dd05b5a673920
-title: Paso 88
+title: Step 87
 challengeType: 0
-dashedName: step-88
+dashedName: step-87
 ---
 
 # --description--
@@ -44,12 +44,10 @@ assert($('.address')[0].innerText.match(/123 Free Code Camp Drive/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md
index 508c877047c..ad85b668c81 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e8284aae155c83015dee
-title: Paso 89
+title: Step 88
 challengeType: 0
-dashedName: step-89
+dashedName: step-88
 ---
 
 # --description--
@@ -46,12 +46,10 @@ assert($('img').attr('alt').match(/coffee icon/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
 --fcc-editable-region--
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md
index 15e2059deb7..8d88555121d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46ede1ff8fec5ba656b44c
-title: Paso 78
+title: Step 77
 challengeType: 0
-dashedName: step-78
+dashedName: step-77
 ---
 
 # --description--
@@ -32,12 +32,10 @@ assert(code.match(/\/\*\s*FOOTER\s*\*\//i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md
index c4c68eb9037..97c17a0c50b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46fc57528aa1c4b5ea7c2e
-title: Paso 76
+title: Step 75
 challengeType: 0
-dashedName: step-76
+dashedName: step-75
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(bottomLineMargin === '25px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md
index 81440d0c2b4..e08b561ca42 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md
@@ -1,8 +1,8 @@
 ---
 id: 5f4701b942c824109626c3d8
-title: Paso 77
+title: Step 76
 challengeType: 0
-dashedName: step-77
+dashedName: step-76
 ---
 
 # --description--
@@ -38,12 +38,10 @@ assert($('hr')[1].className === 'bottom-line');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
index 70cd019d5cc..f0accf13eb1 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
@@ -1,8 +1,8 @@
 ---
 id: 5f475bb508746c16c9431d42
-title: Paso 90
+title: Step 89
 challengeType: 0
-dashedName: step-90
+dashedName: step-89
 ---
 
 # --description--
@@ -72,12 +72,10 @@ assert(imgMarginRight === 'auto');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
index 761d7b4c9d2..7adc36b65df 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f475e1c7f71a61d913836c6
-title: Paso 91
+title: Step 90
 challengeType: 0
-dashedName: step-91
+dashedName: step-90
 ---
 
 # --description--
@@ -44,12 +44,10 @@ assert($('img').last().attr('alt').match(/pie icon/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md
index 2fa32f10bd5..db9a28aea43 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f47633757ae3469f2d33d2e
-title: Paso 46
+title: Step 45
 challengeType: 0
-dashedName: step-46
+dashedName: step-45
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(priceWidth === '25%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md
index f4789eb0716..7fa1b0b94da 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f47fe7e31980053a8d4403b
-title: Paso 92
+title: Step 91
 challengeType: 0
-dashedName: step-92
+dashedName: step-91
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(imgMarginTop === '-25px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
@@ -209,12 +207,10 @@ a:active {
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
index 14859abcd69..b234cfccaa5 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
@@ -1,8 +1,8 @@
 ---
 id: 5f716ad029ee4053c7027a7a
-title: Paso 50
+title: Step 49
 challengeType: 0
-dashedName: step-50
+dashedName: step-49
 ---
 
 # --description--
@@ -50,11 +50,9 @@ assert($('article').last().children('p')[1].innerText.match(/1\.50/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
index 1dde3dc54a2..9cf9f34de6f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
@@ -1,8 +1,8 @@
 ---
 id: 5f716bee5838c354c728a7c5
-title: Paso 53
+title: Step 52
 challengeType: 0
-dashedName: step-53
+dashedName: step-52
 ---
 
 # --description--
@@ -84,11 +84,9 @@ assert(!code.match(/<\/p>\s+<p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md
index 7e5814b6bdb..9fddc2216f8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7691dafd882520797cd2f0
-title: Paso 44
+title: Step 43
 challengeType: 0
-dashedName: step-44
+dashedName: step-43
 ---
 
 # --description--
@@ -32,11 +32,9 @@ assert(!code.match(/<\/p>\s+<p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md
index 7d5bb02ef0a..c156b6c2824 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7692f7c5b3ce22a57788b6
-title: Paso 45
+title: Step 44
 challengeType: 0
-dashedName: step-45
+dashedName: step-44
 ---
 
 # --description--
@@ -62,11 +62,9 @@ assert(p[10] === price[4]);
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md
index 186677bcfbf..dfaf9904947 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f769541be494f25449b292f
-title: Paso 34
+title: Step 33
 challengeType: 0
-dashedName: step-34
+dashedName: step-33
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(flavorTextAlign === 'left');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md
index 14000adb90d..948eaa8b56d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md
@@ -1,8 +1,8 @@
 ---
 id: 5f76967fad478126d6552b0d
-title: Paso 35
+title: Step 34
 challengeType: 0
-dashedName: step-35
+dashedName: step-34
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('.price')[0].innerText.match(/3\.00/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md
index c3099796f76..9edb9a5a6bb 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md
@@ -1,8 +1,8 @@
 ---
 id: 5f769702e6e33127d14aa120
-title: Paso 36
+title: Step 35
 challengeType: 0
-dashedName: step-36
+dashedName: step-35
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('.price').css('text-align') === 'right');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md
index 91bab8f340c..722d2de41c7 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7b87422a560036fd03ccff
-title: Paso 51
+title: Step 50
 challengeType: 0
-dashedName: step-51
+dashedName: step-50
 ---
 
 # --description--
@@ -50,11 +50,9 @@ assert(!code.match(/<\/p>\s+<p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
index bf9ca77c4c9..563999fa4cf 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7b88d37b1f98386f04edc0
-title: Paso 52
+title: Step 51
 challengeType: 0
-dashedName: step-52
+dashedName: step-51
 ---
 
 # --description--
@@ -35,11 +35,9 @@ assert(selector)
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md
index a082d2724ed..db578b40d54 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md
@@ -7,9 +7,7 @@ dashedName: step-5
 
 # --description--
 
-Finalmente, utiliza una etiqueta `viewport` `<meta>` para asegurarse de que tu página se vea igual en cualquier dispositivo.
-
-Anida un elemento `meta` de autocierre dentro del elemento `head`. Dale un atributo `name` con el valor `viewport` y un atributo `content` con el valor `width=device-width, initial-scale=1.0`.
+Añade otro elemento autoclausurado `meta` dentro de `head`. Establece el atributo `name` a `viewport` y el atributo `content` a `width=device-width, initial-scale=1.0` de modo que la página se vea igual en cualquier dispositivo.
 
 # --hints--
 
@@ -20,17 +18,18 @@ const meta = document.querySelectorAll('meta');
 assert(meta?.length === 2);
 ```
 
-Tu nuevo elemento `meta` deben ser un elemento de autocierre.
+El nuevo elemento `meta` debe ser un elemento autoclausurado.
 
 ```js
 assert(code.match(/<\/meta>/i) === null);
 ```
 
-Tu nuevo elemento `meta` debe tener un atributo `name` con el valor`viewport` y un atributo `content` con el valor `width=device-width, initial-scale=1.0`.
+El nuevo elemento `meta` debe tener un atributo `name` establecido a `viewport`, y un atributo `content` establecido a `width=device-width, initial-scale=1.0`.
 
 ```js
 const meta = [...document.querySelectorAll('meta')];
-const target = meta?.find(m => m?.getAttribute('name') === 'viewport' && m?.getAttribute('content') === 'width=device-width, initial-scale=1.0');
+const reValidContent = /^\s*width\s*=\s*device-width\s*,\s*initial-scale\s*=\s*1(?:\.0)?\s*$/;
+const target = meta?.find(m => m?.getAttribute('name') === 'viewport' && reValidContent.test(m?.getAttribute('content')));
 assert.exists(target);
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/617b9ad735109e217284e095.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/617b9ad735109e217284e095.md
index 2b476a4af8d..f215a4ef268 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/617b9ad735109e217284e095.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/617b9ad735109e217284e095.md
@@ -1,19 +1,19 @@
 ---
 id: 617b9ad735109e217284e095
-title: Step 27
+title: Paso 27
 challengeType: 0
 dashedName: step-27
 ---
 
 # --description--
 
-Now that you have the primary RGB colors, it's time to combine them.
+Ahora que ya tienes los colores RGB primarios, es hora de combinarlos.
 
-For the `rgb` function in the `.container` rule, set the red, green, and blue values to the max of `255`.
+Para la función `rgb` en la regla `.container`, establece los valores de rojo, verde y azul al máximo valor de `255`.
 
 # --hints--
 
-Your `.container` CSS rule should have a `background-color` property set to `rgb(255, 255, 255)`.
+Tu regla CSS `.container` debería tener un propiedad `background-color` establecida a `rgb(255, 255, 255)`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.container')?.backgroundColor === 'rgb(255, 255, 255)');
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/617bd6ec666b1da2587e4e37.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/617bd6ec666b1da2587e4e37.md
index 95d16b98cd2..a102d7d9aa3 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/617bd6ec666b1da2587e4e37.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/617bd6ec666b1da2587e4e37.md
@@ -1,35 +1,35 @@
 ---
 id: 617bd6ec666b1da2587e4e37
-title: Step 34
+title: Paso 34
 challengeType: 0
 dashedName: step-34
 ---
 
 # --description--
 
-There are three more tertiary colors: chartreuse green (green + yellow), azure (blue + cyan), and rose (red + magenta).
+Existen tres colores terciarios más: verde chartreuse (verde + amarillo), azur (azul + cyan), y rosa (rojo + magenta).
 
-To create chartreuse green, update the `rgb` function in the `.one` rule so that red is at `127`, and set green to the max value.
+Para crear verde chartreuse, actualiza la función `rgb` de la clase `.one` de manera tal que el rojo esté en `127` y el verde en su maximo valor.
 
-For azure, update the `rgb` function in the `.two` rule so that green is at `127` and blue is at the max value.
+Para el azur, actualiza la función `rgb` de la clase `.two` de manera tal que el verde esté en `127` y el azul en su valor máximo.
 
-And for rose, which is sometimes called bright pink, update the `rgb` function in the `.three` rule so that blue is at `127` and red is at the max value.
+Finalmente, para el rosa, que a veces es llamado rosa brillante, actualiza la función `rgb` de la clase `.three` para que el azul esté en `127` y el rojo es su valor máximo.
 
 # --hints--
 
-Your `.one` CSS rule should have a `background-color` property set to `rgb(127, 255, 0)`.
+Tu regla CSS `.one` debe contener una propiedad `background-color` establecida a `rgb(127, 255, 0)`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.one')?.backgroundColor === 'rgb(127, 255, 0)');
 ```
 
-Your `.two` CSS rule should have a `background-color` property set to `rgb(0, 127, 255)`.
+Tu regla CSS `.two` debe contener una propiedad `background-color` establecida a `rgb(0, 127, 255)`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.two')?.backgroundColor === 'rgb(0, 127, 255)');
 ```
 
-Your `.three` CSS rule should have a `background-color` property set to `rgb(255, 0, 127)`.
+Tu regla CSS `.three` debe contener una propiedad `background-color` establecida a `rgb(255, 0, 127)`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.three')?.backgroundColor === 'rgb(255, 0, 127)');
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a00ed1ca871a2b3aca0cb.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a00ed1ca871a2b3aca0cb.md
index 50b87f01e2e..458c804f4f1 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a00ed1ca871a2b3aca0cb.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a00ed1ca871a2b3aca0cb.md
@@ -1,31 +1,31 @@
 ---
 id: 618a00ed1ca871a2b3aca0cb
-title: Step 35
+title: Paso 35
 challengeType: 0
 dashedName: step-35
 ---
 
 # --description--
 
-Now that you've gone through all the primary, secondary, and tertiary colors on a color wheel, it'll be easier to understand other color theory concepts and how they impact design.
+Una vez estudiados los colores primarios, secundarios y terciarios sobre un círculo cromático, será más sencillo comprender otros conceptos de teoría del color y qué impacto pueden tener en el diseño.
 
-First, in the rules `.one`, `.two`, and `.three`, adjust the values in the `rgb` function so that the `background-color` of each element is set to pure black. Remember that the `rgb` function uses the additive color model, where colors start as black and change as the values of red, green, and blue increase.
+Primero, en las reglas `.one`, `.two`, y `.three`, ajusta los valores de la función `rgb` de manera que la propiedad `background-color` de cada elemento se establezca en negro puro. Recuérdese que la función `rgb` utiliza el modelo aditivo, en el que los colores comienzan como negro y cambian a medida que los valores de rojo, verde y azul aumentan.
 
 # --hints--
 
-Your `.one` CSS rule should have a `background-color` property set to `rgb(0, 0, 0)`.
+Tu regla CSS `.one` debe tener una propiedad `background-color` establecida a `rgb(0, 0, 0)`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.one')?.backgroundColor === 'rgb(0, 0, 0)');
 ```
 
-Your `.two` CSS rule should have a `background-color` property set to `rgb(0, 0, 0)`.
+Tu regla CSS `.two` debe tener una propiedad `background-color` establecida a `rgb(0, 0, 0)`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.two')?.backgroundColor === 'rgb(0, 0, 0)');
 ```
 
-Your `.three` CSS rule should have a `background-color` property set to `rgb(0, 0, 0)`.
+Tu regla CSS `.three` debe tener una propiedad `background-color` establecida a `rgb(0, 0, 0)`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.three')?.backgroundColor === 'rgb(0, 0, 0)');
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a0927005553b74bfa05ae.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a0927005553b74bfa05ae.md
index e38d91fc55c..52e5a44062b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a0927005553b74bfa05ae.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a0927005553b74bfa05ae.md
@@ -1,27 +1,27 @@
 ---
 id: 618a0927005553b74bfa05ae
-title: Step 36
+title: Paso 36
 challengeType: 0
 dashedName: step-36
 ---
 
 # --description--
 
-A color wheel is a circle where similar colors, or <dfn>hues</dfn>, are near each other, and different ones are further apart. For example, pure red is between the hues rose and orange.
+Una rueda de color es un círculo donde colores similares, o <dfn>hues</dfn>, están cerca unos de otros, y los diferentes están más separados. Por ejemplo, el rojo puro está entre los tonos rosa y naranja.
 
-Two colors that are opposite from each other on the color wheel are called <dfn>complementary colors</dfn>. If two complementary colors are combined, they produce gray. But when they are placed side-by-side, these colors produce strong visual contrast and appear brighter.
+Dos colores opuestos entre sí en la rueda de color se llaman <dfn>complementary colors</dfn>. Si se combinan dos colores complementarios, producen gris. Pero cuando se colocan lado a lado, estos colores producen un fuerte contraste visual y parecen más brillantes.
 
-In the `rgb` function for the `.one` CSS rule, set the red value to the max of `255` to produce pure red. In the `rgb` function for `.two` CSS rule, set the values for green and blue to the max of `255` to produce cyan.
+En la función `rgb` para la `.one` regla CSS, establezca el valor rojo al máximo de `255` para producir rojo puro. En la función `rgb` para el `.two` regla CSS, establezca para verde y azul el máximo de `255` para producir cian.
 
 # --hints--
 
-Your `.one` CSS rule should have a `background-color` property set to `rgb(255, 0, 0)`.
+La regla CSS `.one` debe tener la propiedad `background-color` establecida a `rgb(255, 0, 0)`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.one')?.backgroundColor === 'rgb(255, 0, 0)');
 ```
 
-Your `.two` CSS rule should have a `background-color` property set to `rgb(0, 255, 255)`.
+Tu regla CSS `.two` debe contener una propiedad `background-color` establecida en `rgb(0, 255, 255)`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.two')?.backgroundColor === 'rgb(0, 255, 255)');
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a0b2befb143baefab632b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a0b2befb143baefab632b.md
index e8cf1a587a9..fcb40f4167a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a0b2befb143baefab632b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a0b2befb143baefab632b.md
@@ -1,27 +1,27 @@
 ---
 id: 618a0b2befb143baefab632b
-title: Step 37
+title: Paso 37
 challengeType: 0
 dashedName: step-37
 ---
 
 # --description--
 
-Notice that the red and cyan colors are very bright right next to each other. This contrast can be distracting if it's overused on a website, and can make text hard to read if it's placed on a complementary-colored background.
+Obsérvese que los colores rojo y cian son muy brillantes uno al lado del otro. Si se hace un uso abusivo de este contraste, puede acabar distrayendo la atención, y además puede hacer un texto difícil de leer si está sobre un fondo con un color complementario.
 
-It's better practice to choose one color as the dominant color, and use its complementary color as an accent to bring attention to certain content on the page.
+Es mejor práctica elegir un color como dominante, y usar su complementario como énfasis para dirigir la atención sobre cierto contenido de la página.
 
-First, in the `h1` rule, use the `rgb` function to set its background color to cyan.
+Primero, en la regla `h1`, usa la función `rgb` para establecer el color de fondo a cian.
 
 # --hints--
 
-You should not remove or modify the `text-align` property or its value.
+No debes eliminar o modificar la propiedad `text-align` o su valor.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('h1')?.textAlign === 'center');
 ```
 
-Your `h1` CSS rule should have a `background-color` property set to `rgb(0, 255, 255)`.
+Tu regla CSS `h1` debe tener una propiedad `background-color` establecida a `rgb(0, 255, 255)`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('h1')?.backgroundColor === 'rgb(0, 255, 255)');
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a1275e873dcc803c2d1aa.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a1275e873dcc803c2d1aa.md
index bb456dfbecb..25cba54fd1b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a1275e873dcc803c2d1aa.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a1275e873dcc803c2d1aa.md
@@ -1,23 +1,23 @@
 ---
 id: 618a1275e873dcc803c2d1aa
-title: Step 38
+title: Paso 38
 challengeType: 0
 dashedName: step-38
 ---
 
 # --description--
 
-Next, in the `.one` rule, use the `rgb` function to set the `background-color` to black. And in the `.two` rule, use the `rgb` function to set the `background-color` to red.
+Después, en la regla `.one`, usa la función `rgb` para establecer `background-color` a negro. Del mismo modo, establece `background-color` a rojo en la regla `.two`.
 
 # --hints--
 
-Your `.one` CSS rule should have a `background-color` property set to `rgb(0, 0, 0)`.
+La regla CSS `.one` debe tener la propiedad `background-color` establecida a `rgb(0, 0, 0)`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.one')?.backgroundColor === 'rgb(0, 0, 0)');
 ```
 
-Your `.two` CSS rule should have a `background-color` property set to `rgb(255, 0, 0)`.
+La regla CSS `.two` debe tener la propiedad `background-color` establecida a `rgb(255, 0, 0)`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.two')?.backgroundColor === 'rgb(255, 0, 0)');
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a132676346ac9f7fd59dd.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a132676346ac9f7fd59dd.md
index a48b1d2e04c..80e76505f60 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a132676346ac9f7fd59dd.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a132676346ac9f7fd59dd.md
@@ -1,21 +1,21 @@
 ---
 id: 618a132676346ac9f7fd59dd
-title: Step 39
+title: Paso 39
 challengeType: 0
 dashedName: step-39
 ---
 
 # --description--
 
-Notice how your eyes are naturally drawn to the red color in the center? When designing a site, you can use this effect to draw attention to important headings, buttons, or links.
+¿Notas cómo tus ojos se sienten naturalmente atraídos por el color rojo en el centro? Cuando diseñas un sitio, puedes usar este efecto para dirigir la atención sobre titulares importantes, botones o enlaces.
 
-There are several other important color combinations outside of complementary colors, but you'll learn those a bit later.
+Aparte de los colores complementarios, hay otras combinaciones de colores importantes, aunque las veremos un poco más tarde.
 
-For now, use the `rgb` function in the `.two` rule to set the `background-color` to black.
+Por ahora, usa la función `rgb` en la regla `.two` para establecer `background-color` a negro.
 
 # --hints--
 
-Your `.two` CSS rule should have a `background-color` property set to `rgb(0, 0, 0)`.
+La regla CSS `.two` debe tener la propiedad `background-color` establecida a `rgb(0, 0, 0)`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.two')?.backgroundColor === 'rgb(0, 0, 0)');
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a16873520a8d088ffdf44.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a16873520a8d088ffdf44.md
index 098865513fe..352bbf8aff5 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a16873520a8d088ffdf44.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a16873520a8d088ffdf44.md
@@ -1,17 +1,17 @@
 ---
 id: 618a16873520a8d088ffdf44
-title: Step 40
+title: Paso 40
 challengeType: 0
 dashedName: step-40
 ---
 
 # --description--
 
-And in the `h1` rule, remove the `background-color` property and value to go back to the default white color.
+Y en la regla `h1`, elimina la propiedad `background-color` y su valor para volver al color blanco por defecto.
 
 # --hints--
 
-Your `h1` CSS rule should not have a `background-color` property or value.
+La regla CSS `h1` no debe tener la propiedad `background-color` ni su valor.
 
 ```js
 const backgroundColorInstances = code.match(/background-color:.*;/gi);
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a16d21bd3dad1bb3aa8ef.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a16d21bd3dad1bb3aa8ef.md
index 7dcc15837a7..3006d399402 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a16d21bd3dad1bb3aa8ef.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/618a16d21bd3dad1bb3aa8ef.md
@@ -1,26 +1,26 @@
 ---
 id: 618a16d21bd3dad1bb3aa8ef
-title: Step 41
+title: Paso 41
 challengeType: 0
 dashedName: step-41
 ---
 
 # --description--
 
-Now it's time to add other details to the markers, starting with the first one.
+Ahora es el momento de añadir otros detalles a los marcadores, vamos con el primero.
 
-In the first marker `div` element, change the class `one` to `red`.
+En el elemento `div` del primer marcador, cambia la clase `one` a `red`.
 
 # --hints--
 
-Your first marker `div` should not have the class `one`.
+El `div` correspondiente al primer marcador no debe pertenecer a la clase `one`.
 
 ```js
 const containerFirstChild = [...document.querySelector('.container')?.children][0];
 assert(!containerFirstChild?.classList?.contains('one'));
 ```
 
-Your first marker `div` should have the classes `marker` and `red`.
+El `div` correspondiente al primer marcador debe pertenecer a las clases `marker` y `red`.
 
 ```js
 const containerFirstChild = [...document.querySelector('.container')?.children][0];
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b72a0db211f1c29afb906.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b72a0db211f1c29afb906.md
index 52d7b6aa55f..3c4d712b804 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b72a0db211f1c29afb906.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b72a0db211f1c29afb906.md
@@ -1,29 +1,29 @@
 ---
 id: 619b72a0db211f1c29afb906
-title: Step 42
+title: Paso 42
 challengeType: 0
 dashedName: step-42
 ---
 
 # --description--
 
-Update the `.one` class selector to target the new `red` class.
+Actualiza el selector de clase `.one` para que apunte a la clase `red`.
 
 # --hints--
 
-Your code should no longer have a `.one` class selector.
+Tu código no debe tener el selector de clase `.one`.
 
 ```js
 assert(!new __helpers.CSSHelp(document).getStyle('.one'));
 ```
 
-You should use a class selector to target the class `red`.
+Debes usar un selector de clase para seleccionar la clase `red`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.red'));
 ```
 
-Your `.red` CSS rule should have a `background-color` property set to `rgb(0, 0, 0)`.
+La regla CSS `.red` debe tener la propiedad `background-color` establecida a `rgb(0, 0, 0)`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.red')?.backgroundColor === 'rgb(0, 0, 0)');
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b7424f43ec9215e538afe.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b7424f43ec9215e538afe.md
index 3dd82766480..8a1b190e15e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b7424f43ec9215e538afe.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b7424f43ec9215e538afe.md
@@ -1,38 +1,38 @@
 ---
 id: 619b7424f43ec9215e538afe
-title: Step 44
+title: Paso 44
 challengeType: 0
 dashedName: step-44
 ---
 
 # --description--
 
-Next, change the class `two` to `green` in the second marker `div`, and the class `three` to `blue` in the third marker `div`.
+Ahora cambia la clase `two` a `green` en el `div` del segundo marcador, y la clase `three` a `blue` en el `div` del tercer marcador.
 
 # --hints--
 
-Your second marker `div` should not have the class `two`.
+El `div` del segundo marcador no debe tener la clase `two`.
 
 ```js
 const containerSecondChild = [...document.querySelector('.container')?.children][1];
 assert(!containerSecondChild?.classList?.contains('two'));
 ```
 
-Your second marker `div` should have the classes `marker` and `green`.
+El `div` del segundo marcador debe tener las clases `marker` y `green`.
 
 ```js
 const containerSecondChild = [...document.querySelector('.container')?.children][1];
 assert(containerSecondChild?.classList?.contains('marker') && containerSecondChild?.classList?.contains('green'));
 ```
 
-Your third marker `div` should not have the class `three`.
+El `div` del tercer marcador no debe tener la clase `three`.
 
 ```js
 const containerThirdChild = [...document.querySelector('.container')?.children][2];
 assert(!containerThirdChild?.classList?.contains('three'));
 ```
 
-Your third marker `div` should have the classes `marker` and `blue`.
+El `div` del tercer marcador debe tener las clases `marker` y `blue`.
 
 ```js
 const containerThirdChild = [...document.querySelector('.container')?.children][2];
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b74fa777a2b2473c94f82.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b74fa777a2b2473c94f82.md
index 425b40bca54..3554f39626d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b74fa777a2b2473c94f82.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b74fa777a2b2473c94f82.md
@@ -1,47 +1,47 @@
 ---
 id: 619b74fa777a2b2473c94f82
-title: Step 45
+title: Paso 45
 challengeType: 0
 dashedName: step-45
 ---
 
 # --description--
 
-Update the CSS class selector `.two` so it targets the new `green` class. And update the `.three` selector so it targets the new `blue` class.
+Actualiza el selector de clase CSS `.two` de manera que apunte a la nueva clase `green`. De igual manera actualiza el selector `.three` para que apunte a la nueva clase `blue`.
 
 # --hints--
 
-Your code should no longer have a `.two` class selector.
+Tu código no debe tener el selector de clase `.two`.
 
 ```js
 assert(!new __helpers.CSSHelp(document).getStyle('.two'));
 ```
 
-You should use a class selector to target the class `green`.
+Debes usar un selector de clase para seleccionar la clase `green`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.green'));
 ```
 
-Your `.green` CSS rule should have a `background-color` property set to `rgb(0, 0, 0)`.
+Tu regla CSS `.green` debe tener la propiedad `background-color` establecida a `rgb(0, 0, 0)`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.green')?.backgroundColor === 'rgb(0, 0, 0)');
 ```
 
-Your code should no longer have a `.three` class selector.
+Tu código no debe tener el selector de clase `.three`.
 
 ```js
 assert(!new __helpers.CSSHelp(document).getStyle('.three'));
 ```
 
-You should use a class selector to target the class `blue`.
+Debes usar un selector de clase para seleccionar la clase `blue`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.blue'));
 ```
 
-Your `.blue` CSS rule should have a `background-color` property set to `rgb(0, 0, 0)`.
+Tu regla CSS `.blue` debe tener la propiedad `background-color` establecida a `rgb(0, 0, 0)`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.blue')?.backgroundColor === 'rgb(0, 0, 0)');
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b761916dac02643940022.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b761916dac02643940022.md
index 9e49bcf6171..915b266e2cc 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b761916dac02643940022.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b761916dac02643940022.md
@@ -1,21 +1,21 @@
 ---
 id: 619b761916dac02643940022
-title: Step 46
+title: Paso 46
 challengeType: 0
 dashedName: step-46
 ---
 
 # --description--
 
-A very common way to apply color to an element with CSS is with <dfn>hexadecimal</dfn> or hex values. While hex values sound complicated, they're really just another form of RGB values.
+Es práctica muy común aplicar color a un elemento CSS con valores <dfn>hexadecimales</dfn> (hex). Puede sonar complicado, pero no es más que otra forma de expresar colores RGB.
 
-Hex color values start with a `#` character and take six characters from 0-9 and A-F. The first pair of characters represent red, the second pair represent green, and the third pair represent blue. For example, `#4B5320`.
+Los valores hexadecimales empiezan con el carácter `#`, siguiendo seis caracteres entre 0-9 y A-F. El primer par de caracteres representa el rojo, el segundo el verde y el tercero el azul. Pr ejemplo, `#4B5320`.
 
-In the `.green` CSS rule, set the `background-color` property to a hex color code with the values `00` for red, `FF` for green, and `00` blue.
+En la regla CSS `.green`, establece la propiedad `background-color` con el color hexadecimal de valores `00` para el rojo, `FF` para el verde, y `00` para el azul.
 
 # --hints--
 
-Your `.green` CSS rule should have a `background-color` property set to `#00FF00`.
+Tu regla CSS `.green` debe tener la propiedad `background-color` establecidad a `#00FF00`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.green')?.backgroundColor === 'rgb(0, 255, 0)');
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b7c3c83de403126b69c1e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b7c3c83de403126b69c1e.md
index 4763fcdaf88..d09466a6ede 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b7c3c83de403126b69c1e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b7c3c83de403126b69c1e.md
@@ -1,25 +1,25 @@
 ---
 id: 619b7c3c83de403126b69c1e
-title: Step 47
+title: Paso 47
 challengeType: 0
 dashedName: step-47
 ---
 
 # --description--
 
-You may already be familiar with decimal, or base 10 values, which go from 0 - 9. Hexadecimal, or base 16 values, go from 0 - 9, then A - F:
+Seguramente estés familiarizado con valores en base 10, o decimales, los cuales van de 0 a 9. Hexadecimales, o valores en base 16, van de 0 a 9 y a continuación de A a F:
 
 ```js
 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F
 ```
 
-With hex colors, `00` is 0% of that color, and `FF` is 100%. So `#00FF00` translates to 0% red, 100% green, and 0% blue, and is the same as `rgb(0, 255, 0)`.
+Para los colores en hexadecimal, `00` es 0% de ese color, y `FF` es 100%. De tal manera que `#00FF00` se traduce en 0% rojo, 100% verde y 0% azul, siendo equivalente a `rgb(0, 255, 0)`.
 
-Lower the intensity of green by setting green value of the hex color to `7F`.
+Disminuye la intensidad del verde estableciendo el valor verde del color hexadecimal a `7F`.
 
 # --hints--
 
-Your `.green` CSS rule should have a `background-color` property set to `#007F00`.
+La regla CSS `.green` debe tener la propiedad `background-color` establecida a `#007F00`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.green')?.backgroundColor === 'rgb(0, 127, 0)');
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b7fd56aa2253778bcf5f7.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b7fd56aa2253778bcf5f7.md
index 2bfa6b0ff03..f5873d81011 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b7fd56aa2253778bcf5f7.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b7fd56aa2253778bcf5f7.md
@@ -1,27 +1,27 @@
 ---
 id: 619b7fd56aa2253778bcf5f7
-title: Step 48
+title: Paso 48
 challengeType: 0
 dashedName: step-48
 ---
 
 # --description--
 
-The <dfn>HSL</dfn> color model, or hue, saturation, and lightness, is another way to represent colors.
+Otra forma de representar colores es el modelo <dfn>HSL</dfn>, siglas de hue, saturation y lightness (matiz, saturación y luminosidad).
 
-The CSS `hsl` function accepts 3 values: a number from 0 to 360 for hue, a percentage from 0 to 100 for saturation, and a percentage from 0 to 100 for lightness.
+La función de CSS `hsl` acepta tres valores: un número entre 0 y 360 para el matiz (hue), un porcentaje para la saturación (saturation), y otro porcentaje para la luminosidad (lightness).
 
-If you imagine a color wheel, the hue red is at 0 degrees, green is at 120 degrees, and blue is at 240 degrees.
+Sobre un círculo cromático, el matiz (hue) rojo está en 0 grados, el verde en 120 y el azul en 240.
 
-Saturation is the intensity of a color from 0%, or gray, to 100% for pure color.
+La saturación (saturation) es la intensidad de un color desde 0%, o gris, hasta 100% para el color puro.
 
-Lightness is how bright a color appears, from 0%, or complete black, to 100%, complete white, with 50% being neutral.
+La luminosidad (lightness) es lo brillante que parece un color, desde 0% o completamente negro, hasta 100%, completamente blanco, siendo neutro el 50%.
 
-In the `.blue` CSS rule, use the `hsl` function to change the `background-color` property to pure blue. Set the hue to `240`, the saturation to `100%`, and the lightness to `50%`.
+En la regla CSS `.blue`, utiliza la función `hsl` para cambiar la propiedad `background-color` a azul puro. Establece el tono a `240`, la saturación a `100%` y la luminosidad a `50%`.
 
 # --hints--
 
-Your `.blue` CSS rule should have a `background-color` property set to `hsl(240, 100%, 50%)`.
+La regla CSS `.blue` debe tener la propiedad `background-color` establecida a `hsl(240, 100%, 50%)`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.blue')?.backgroundColor === 'rgb(0, 0, 255)');
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a489b8579e87364b2d2cdb.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a489b8579e87364b2d2cdb.md
index 9c38a228176..a9fd59822e4 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a489b8579e87364b2d2cdb.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a489b8579e87364b2d2cdb.md
@@ -1,23 +1,23 @@
 ---
 id: 61a489b8579e87364b2d2cdb
-title: Step 49
+title: Paso 49
 challengeType: 0
 dashedName: step-49
 ---
 
 # --description--
 
-You've learned a few ways to set flat colors in CSS, but you can also use a color transition, or <dfn>gradient</dfn>, on an element.
+Hemos visto unas cuantas maneras de establecer colores planos en CSS, pero también se pueden aplicar transiciones de color, o <dfn>gradientes</dfn>, sobre un elemento.
 
-A gradient is when one color transitions into another. The CSS `linear-gradient` function lets you control the direction of the transition along a line, and which colors are used.
+Se llama gradiente, o degradado, a la transición progresiva de un color a otro. La función CSS `linear-gradient` permite controlar la dirección de la transición a lo largo de una línea, y qué colores participan en el degradado.
 
-One thing to remember is that the `linear-gradient` function actually creates an `image` element, and is usually paired with the `background` property which can accept an image as a value.
+Una cosa a tener en cuenta es que la función `linear-gradient` lo que en realidad crea es un elemento `image`, y se asocia normalmente con la propiedad `background`, la cual puede aceptar una imagen como valor.
 
-In the `.red` CSS rule, change the `background-color` property to `background`.
+En la regla CSS `.red`, sustituye la propiedad `background-color` por `background`.
 
 # --hints--
 
-Your `.red` CSS rule should have a `background` property with the value `rgb(255, 0, 0)`.
+La regla CSS `.red` debe tener la propiedad `background` con el valor `rgb(255, 0, 0)`.
 
 ```js
 assert.match(__helpers.removeWhiteSpace(code), /\.red\{.*?background:rgb\(255,0,0\)/);
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a493ead935c148d2b76312.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a493ead935c148d2b76312.md
index 11fab401a2a..77587eabf3c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a493ead935c148d2b76312.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a493ead935c148d2b76312.md
@@ -1,13 +1,13 @@
 ---
 id: 61a493ead935c148d2b76312
-title: Step 50
+title: Paso 50
 challengeType: 0
 dashedName: step-50
 ---
 
 # --description--
 
-The `linear-gradient` function is very flexible -- here is the basic syntax you'll use in this tutorial:
+La función `linear-gradient` es muy flexible -- aquí hay una sintaxis básica que usaras en este tutorial:
 
 ```css
 linear-gradient(gradientDirection, color1, color2, ...);
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a498399534644f59cff05e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a498399534644f59cff05e.md
index 58182d2fc51..a3b1aa2d0fd 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a498399534644f59cff05e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a498399534644f59cff05e.md
@@ -1,19 +1,19 @@
 ---
 id: 61a498399534644f59cff05e
-title: Step 53
+title: Paso 53
 challengeType: 0
 dashedName: step-53
 ---
 
 # --description--
 
-As you can see, the `linear-gradient` function produced a smooth red-green gradient. While the `linear-gradient` function needs a minimum of two color arguments to work, it can accept many color arguments.
+Como puedes ver, la función `linear-gradient` produce un suave gradiente de rojo a verde. La función `linear-gradient` necesita un mínimo de dos colores como argumentos, pero puede aceptar bastantes más.
 
-Use the `rgb` function to add pure blue as the third color argument to the `linear-gradient` function.
+Usa la función `rgb` para añdir azul puro como tercer argumento de color a la función `linear-gradient`.
 
 # --hints--
 
-Your `.red` CSS rule should have a `background` property set to `linear-gradient(90deg, rgb(255, 0, 0), rgb(0, 255, 0), rgb(0, 0, 255))`.
+La regla CSS `.red` debe tener la propiedad `background` establecida a `linear-gradient(90deg, rgb(255, 0, 0), rgb(0, 255, 0), rgb(0, 0, 255))`.
 
 ```js
 assert.include(['linear-gradient(90deg,rgb(255,0,0),rgb(0,255,0),rgb(0,0,255))', 'rgba(0,0,0,0)linear-gradient(90deg,rgb(255,0,0),rgb(0,255,0),rgb(0,0,255))repeatscroll0%0%'], new __helpers.CSSHelp(document).getStyle('.red')?.getPropVal('background', true));
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a49d15bdbb5e57cc6fd280.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a49d15bdbb5e57cc6fd280.md
index 45ff19cb687..6a82d100a71 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a49d15bdbb5e57cc6fd280.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a49d15bdbb5e57cc6fd280.md
@@ -1,6 +1,6 @@
 ---
 id: 61a49d15bdbb5e57cc6fd280
-title: Step 54
+title: Paso 54
 challengeType: 0
 dashedName: step-54
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4a53c4459446dc134a1c6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4a53c4459446dc134a1c6.md
index 581cf6cabad..57d274e6a53 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4a53c4459446dc134a1c6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4a53c4459446dc134a1c6.md
@@ -1,19 +1,19 @@
 ---
 id: 61a4a53c4459446dc134a1c6
-title: Step 55
+title: Paso 55
 challengeType: 0
 dashedName: step-55
 ---
 
 # --description--
 
-Now that you know the basics of how the `linear-gradient` function and color-stops work, you can use them to make the markers look more realistic.
+Ahora que conoces los fundamentos de la función `linear-gradient` y de las paradas de color, vamos a hacer que nuestros marcadores parezcan más realistas.
 
-In the `linear-gradient` function, set `gradientDirection` to `180deg`.
+En la función `linear-gradient`, establece `gradientDirection` a `180deg`.
 
 # --hints--
 
-Your `.red` CSS rule should have a `background` property set to `linear-gradient(180deg, rgb(255, 0, 0) 75%, rgb(0, 255, 0), rgb(0, 0, 255))`.
+Tu regla CSS `.red` debe tener la propiedad `background` establecida a `linear-gradient(180deg, rgb(255, 0, 0) 75%, rgb(0, 255, 0), rgb(0, 0, 255))`.
 
 ```js
 assert.include(['linear-gradient(rgb(255,0,0)75%,rgb(0,255,0),rgb(0,0,255))', 'rgba(0,0,0,0)linear-gradient(rgb(255,0,0)75%,rgb(0,255,0),rgb(0,0,255))repeatscroll0%0%'], new __helpers.CSSHelp(document).getStyle('.red')?.getPropVal('background', true));
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4a6e908bc34725b4c25ac.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4a6e908bc34725b4c25ac.md
index 1827f04e183..9c9ef1e534d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4a6e908bc34725b4c25ac.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4a6e908bc34725b4c25ac.md
@@ -1,17 +1,17 @@
 ---
 id: 61a4a6e908bc34725b4c25ac
-title: Step 56
+title: Paso 56
 challengeType: 0
 dashedName: step-56
 ---
 
 # --description--
 
-Next, set the color-stop for red to `0%`, the color-stop for green to `50%`, and the color-stop for blue to `100%`.
+Ahora, establece la parada del color rojo en `0%`, la del verde en `50%` y la del azul en `100%`.
 
 # --hints--
 
-Your `.red` CSS rule should have a `background` property set to `linear-gradient(180deg, rgb(255, 0, 0) 0%, rgb(0, 255, 0) 50%, rgb(0, 0, 255) 100%)`.
+Tu regla CSS `.red` debe tener la propiedad `background` establecida a `linear-gradient(180deg, rgb(255, 0, 0) 0%, rgb(0, 255, 0) 50%, rgb(0, 0, 255) 100%)`.
 
 ```js
 assert.include(['linear-gradient(rgb(255,0,0)0%,rgb(0,255,0)50%,rgb(0,0,255)100%)', 'rgba(0,0,0,0)linear-gradient(rgb(255,0,0)0%,rgb(0,255,0)50%,rgb(0,0,255)100%)repeatscroll0%0%'], new __helpers.CSSHelp(document).getStyle('.red')?.getPropVal('background', true));
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4a7877da33a73a1c1723e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4a7877da33a73a1c1723e.md
index 6ee6ce62d75..e47b8571843 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4a7877da33a73a1c1723e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4a7877da33a73a1c1723e.md
@@ -1,19 +1,19 @@
 ---
 id: 61a4a7877da33a73a1c1723e
-title: Step 57
+title: Paso 57
 challengeType: 0
 dashedName: step-57
 ---
 
 # --description--
 
-Now that the color-stops are set, you'll apply different shades of red to each color argument in the `linear-gradient` function. The shades on the top and bottom edges of the marker will be darker, while the one in the middle will be lighter, as if there's a light above it.
+Una vez establecidas las paradas de color, vamos a aplicar diferentes tonos de rojo a los argumentos de color de la función `linear-gradient`. El tono en los límites superior e inferior del marcador será más oscuro y en el centro más claro, como si estuviera iluminado perpendicularmente.
 
-For the first color argument, which is currently pure red, update the `rgb` function so the value for red is `122`, the value for green is `74`, and the value for blue is `14`.
+Para el primer argumento de color, que actualmente es rojo puro, actualiza la función `rgb` de manera que el valor del rojo sea `122`, el del verde `74` y el del azul `14`.
 
 # --hints--
 
-Your `.red` CSS rule should have a `background` property set to `linear-gradient(180deg, rgb(122, 74, 14) 0%, rgb(0, 255, 0) 50%, rgb(0, 0, 255) 100%)`.
+Tu regla CSS `.red` debe tener la propiedad `background` establecida a `linear-gradient(180deg, rgb(122, 74, 14) 0%, rgb(0, 255, 0) 50%, rgb(0, 0, 255) 100%)`.
 
 ```js
 assert.include(['linear-gradient(rgb(122,74,14)0%,rgb(0,255,0)50%,rgb(0,0,255)100%)', 'rgba(0,0,0,0)linear-gradient(rgb(122,74,14)0%,rgb(0,255,0)50%,rgb(0,0,255)100%)repeatscroll0%0%'], new __helpers.CSSHelp(document).getStyle('.red')?.getPropVal('background', true));
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4ac092eb21e7dbfe61c33.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4ac092eb21e7dbfe61c33.md
index 97b5ca11806..80c7e4bbae9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4ac092eb21e7dbfe61c33.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4ac092eb21e7dbfe61c33.md
@@ -1,19 +1,19 @@
 ---
 id: 61a4ac092eb21e7dbfe61c33
-title: Step 58
+title: Paso 58
 challengeType: 0
 dashedName: step-58
 ---
 
 # --description--
 
-Now modify the second color argument in the `linear-gradient` function, which is currently pure green.
+Ahora modifica el segundo argumento de color de la función `linear-gradient`, establecido actualmente como verde puro.
 
-Update the `rgb` function so the value for red is `245`, the value of green is `62`, and the value of blue is `113`.
+Actualiza la función `rgb` de manera que el valor del rojo sea `245`, el del verde `62` y el del azul `113`.
 
 # --hints--
 
-Your `.red` CSS rule should have a `background` property set to `linear-gradient(180deg, rgb(122, 74, 14) 0%, rgb(245, 62, 113) 50%, rgb(0, 0, 255) 100%)`.
+Tu regla CSS `.red` debe tener la propiedad `background` establecida a `linear-gradient(180deg, rgb(122, 74, 14) 0%, rgb(245, 62, 113) 50%, rgb(0, 0, 255) 100%)`.
 
 ```js
 assert.include(['linear-gradient(rgb(122,74,14)0%,rgb(245,62,113)50%,rgb(0,0,255)100%)', 'rgba(0,0,0,0)linear-gradient(rgb(122,74,14)0%,rgb(245,62,113)50%,rgb(0,0,255)100%)repeatscroll0%0%'], new __helpers.CSSHelp(document).getStyle('.red')?.getPropVal('background', true));
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4acbb5587197f68544d00.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4acbb5587197f68544d00.md
index 07a9a5fe232..d6f03a0f680 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4acbb5587197f68544d00.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4acbb5587197f68544d00.md
@@ -1,19 +1,19 @@
 ---
 id: 61a4acbb5587197f68544d00
-title: Step 59
+title: Paso 59
 challengeType: 0
 dashedName: step-59
 ---
 
 # --description--
 
-Finally, modify the third color argument in the `linear-gradient` function, which is currently pure blue.
+Por último, modifica el tercer argumento de color de la función `linear-gradient`, que ahora está como azul puro.
 
-Update the `rgb` function so the value for red is `162`, the value of green is `27`, and the value of blue is `27`.
+Actualiza la función `rgb` de forma que el valor del rojo sea `162`, el del verde `27` y el del azul `27`.
 
 # --hints--
 
-Your `.red` CSS rule should have a `background` property set to `linear-gradient(180deg, rgb(122, 74, 14) 0%, rgb(245, 62, 113) 50%, rgb(162, 27, 27) 100%)`.
+Tu regla CSS `.red` debe tener la propiedad `background` establecida como `linear-gradient(180deg, rgb(122, 74, 14) 0%, rgb(245, 62, 113) 50%, rgb(162, 27, 27) 100%)`.
 
 ```js
 assert.include(['linear-gradient(rgb(122,74,14)0%,rgb(245,62,113)50%,rgb(162,27,27)100%)', 'rgba(0,0,0,0)linear-gradient(rgb(122,74,14)0%,rgb(245,62,113)50%,rgb(162,27,27)100%)repeatscroll0%0%'], new __helpers.CSSHelp(document).getStyle('.red')?.getPropVal('background', true));
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4ada3aabeec822b2975d9.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4ada3aabeec822b2975d9.md
index b47093c3cc9..cdf3b2edcc8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4ada3aabeec822b2975d9.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4ada3aabeec822b2975d9.md
@@ -1,19 +1,19 @@
 ---
 id: 61a4ada3aabeec822b2975d9
-title: Step 60
+title: Paso 60
 challengeType: 0
 dashedName: step-60
 ---
 
 # --description--
 
-The red marker is looking much more realistic. Now you'll do the same for the green marker, using a combination of the `linear-gradient` function and hex colors.
+Ahora el marcador rojo se ve mucho más realista. Haz lo mismo para el marcador verde, combinando la función `linear-gradient` y colores en hexadecimal.
 
-In the `.green` CSS rule, change the `background-color` property to `background`.
+En la regla CSS `.green`, cambia la propiedad `background-color` por `background`.
 
 # --hints--
 
-Your `.green` CSS rule should have a `background` property with the value `#007F00`.
+Tu regla CSS `.green` debe tener la propiedad `background` con el valor `#007F00`.
 
 ```js
 assert.match(__helpers.removeWhiteSpace(code), /\.green\{.*?background:#007F00/);
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4ae5f29eb5584187201c3.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4ae5f29eb5584187201c3.md
index 64460fa49cf..50c422e0a77 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4ae5f29eb5584187201c3.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4ae5f29eb5584187201c3.md
@@ -1,19 +1,19 @@
 ---
 id: 61a4ae5f29eb5584187201c3
-title: Step 61
+title: Paso 61
 challengeType: 0
 dashedName: step-61
 ---
 
 # --description--
 
-For this marker, you'll use hex color codes for your gradient.
+Para el gradiente de este marcador, utilizaremos colores en hexadecimal.
 
-Use the `linear-gradient` function and set `gradientDirection` to `180deg`. And for the first color argument, use a hex color code with the values `55` for red, `68` for green, and `0D` for blue.
+En la función `linear-gradient` establece `gradientDirection` a `180deg`. Y para el primer argumento de color, usa el formato hexadecimal con los valores `55` para el rojo, `68` para el verde, y `0D` para el azul.
 
 # --hints--
 
-Your `.green` CSS rule should have a `background` property with the value `linear-gradient(180deg, #55680D)`.
+Tu regla CSS `.green` debe tener la propiedad `background` con el valor `linear-gradient(180deg, #55680D)`.
 
 ```js
 assert.match(__helpers.removeWhiteSpace(code), /\.green\{.*?background:linear-gradient\(180deg,#55680D\)/i);
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5be9833e7dc178de2af10.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5be9833e7dc178de2af10.md
index 6a5b0ec85b5..4f71bd0e669 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5be9833e7dc178de2af10.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5be9833e7dc178de2af10.md
@@ -1,19 +1,19 @@
 ---
 id: 61a5be9833e7dc178de2af10
-title: Step 63
+title: Paso 63
 challengeType: 0
 dashedName: step-63
 ---
 
 # --description--
 
-That's looking better, but the bottom edge of the green marker needs to be darker to add a little more dimension.
+Esto va mejorando, pero hay que oscurecer el borde inferior del marcador verde para darle un poco más de volumen.
 
-In the same `linear-gradient` function, add a hex color code with the values `11` for red, `6C` for green, and `31` for blue as the third color argument.
+En la función `linear-gradient` añade, como el tercer argumento de color, un código de color hexadecimal con los valores `11` para el rojo, `6C` para el verde y `31` para el azul.
 
 # --hints--
 
-Your `.green` CSS rule should have a `background` property set to `linear-gradient(180deg, #55680D, #71F53E, #116C31)`.
+La regla CSS `.green` debe tener la propiedad `background` establecida a `linear-gradient(180deg, #55680D, #71F53E, #116C31)`.
 
 ```js
 assert.include(['linear-gradient(rgb(85,104,13),rgb(113,245,62),rgb(17,108,49))', 'rgba(0,0,0,0)linear-gradient(rgb(85,104,13),rgb(113,245,62),rgb(17,108,49))repeatscroll0%0%'], new __helpers.CSSHelp(document).getStyle('.green')?.getPropVal('background', true));
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5bfe091060f1d6a629dd0.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5bfe091060f1d6a629dd0.md
index 8fb1fa454fa..f31d6f17240 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5bfe091060f1d6a629dd0.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5bfe091060f1d6a629dd0.md
@@ -1,6 +1,6 @@
 ---
 id: 61a5bfe091060f1d6a629dd0
-title: Step 64
+title: Paso 64
 challengeType: 0
 dashedName: step-64
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5c906ab73313316e342f0.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5c906ab73313316e342f0.md
index fd4c58c74d3..016d3664fa0 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5c906ab73313316e342f0.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5c906ab73313316e342f0.md
@@ -1,31 +1,31 @@
 ---
 id: 61a5c906ab73313316e342f0
-title: Step 65
+title: Paso 65
 challengeType: 0
 dashedName: step-65
 ---
 
 # --description--
 
-If no `gradientDirection` argument is provided to the `linear-gradient` function, it arranges colors from top to bottom, or along a 180 degree line, by default.
+Si en la función `linear-gradient` no se especifica el argumento `gradientDirection`, por defecto será de 180 grados, disponiendo los colores de arriba a abajo.
 
-Clean up your code a little more by removing the `gradientDirection` argument from both `linear-gradient` functions.
+Limpia un poco más el código eliminando el argumento `gradientDirection` de ambas funciones `linear-gradient`.
 
 # --hints--
 
-You should remove the `gradientDirection` arguments from the `linear-gradient` functions in your `.red` and `.green` CSS rules.
+Debes eliminar los argumentos `gradientDirection` de las funciones `linear-gradient` en las reglas CSS `.red` y `.green`.
 
 ```js
 assert(!code.match(/linear-gradient\s*\(\s*180deg/gi));
 ```
 
-Your `.red` CSS rule should have a `background` property set to `linear-gradient(rgb(122, 74, 14), rgb(245, 62, 113), rgb(162, 27, 27))`.
+La regla CSS `.red` debe tener la propiedad `background` establecida a `linear-gradient(rgb(122, 74, 14), rgb(245, 62, 113), rgb(162, 27, 27))`.
 
 ```js
 assert.include(['linear-gradient(rgb(122,74,14),rgb(245,62,113),rgb(162,27,27))', 'rgba(0,0,0,0)linear-gradient(rgb(122,74,14),rgb(245,62,113),rgb(162,27,27))repeatscroll0%0%'], new __helpers.CSSHelp(document).getStyle('.red')?.getPropVal('background', true));
 ```
 
-Your `.green` CSS rule should have a `background` property set to `linear-gradient(#55680D, #71F53E, #116C31)`.
+La regla CSS `.green` debe tener la propiedad `background` establecida a `linear-gradient(#55680D, #71F53E, #116C31)`.
 
 ```js
 assert.include(['linear-gradient(rgb(85,104,13),rgb(113,245,62),rgb(17,108,49))', 'rgba(0,0,0,0)linear-gradient(rgb(85,104,13),rgb(113,245,62),rgb(17,108,49))repeatscroll0%0%'], new __helpers.CSSHelp(document).getStyle('.green')?.getPropVal('background', true));
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5ca57f50ded36d33eef96.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5ca57f50ded36d33eef96.md
index 66bf66e3953..901a61dcece 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5ca57f50ded36d33eef96.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5ca57f50ded36d33eef96.md
@@ -1,19 +1,19 @@
 ---
 id: 61a5ca57f50ded36d33eef96
-title: Step 66
+title: Paso 66
 challengeType: 0
 dashedName: step-66
 ---
 
 # --description--
 
-Now you'll apply a gradient to the blue marker, this time using the `hsl` function as color arguments.
+Apliquemos un gradiente al marcador azul, esta vez utilizando la función `hsl` en los argumentos de color.
 
-In the `.blue` CSS rule, change the `background-color` property to `background`.
+En la regla CSS `.blue`, sustituye la propiedad `background-color` por `background`.
 
 # --hints--
 
-Your `.blue` CSS rule should have a `background` property with the value `hsl(240, 100%, 50%)`.
+La regla CSS `.blue` debe tener la propiedad `background` con el valor `hsl(240, 100%, 50%)`.
 
 ```js
 assert.match(__helpers.removeWhiteSpace(code), /\.blue\{.*?background:hsl\(240,100%,50%\)/);
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5d594b887335228ee6533.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5d594b887335228ee6533.md
index e042a3e9157..45e33e16e02 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5d594b887335228ee6533.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5d594b887335228ee6533.md
@@ -1,6 +1,6 @@
 ---
 id: 61a5d594b887335228ee6533
-title: Step 67
+title: Paso 67
 challengeType: 0
 dashedName: step-67
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5d6701ee08953ca375243.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5d6701ee08953ca375243.md
index e54181b512b..789093ffc37 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5d6701ee08953ca375243.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5d6701ee08953ca375243.md
@@ -1,6 +1,6 @@
 ---
 id: 61a5d6701ee08953ca375243
-title: Step 68
+title: Paso 68
 challengeType: 0
 dashedName: step-68
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5d79c858bef560e26c685.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5d79c858bef560e26c685.md
index ed015ce3a31..27d43b29388 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5d79c858bef560e26c685.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5d79c858bef560e26c685.md
@@ -1,6 +1,6 @@
 ---
 id: 61a5d79c858bef560e26c685
-title: Step 69
+title: Paso 69
 challengeType: 0
 dashedName: step-69
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5d7ef1cfcf45764df07a2.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5d7ef1cfcf45764df07a2.md
index 468ff526265..129176595cb 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5d7ef1cfcf45764df07a2.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a5d7ef1cfcf45764df07a2.md
@@ -1,6 +1,6 @@
 ---
 id: 61a5d7ef1cfcf45764df07a2
-title: Step 70
+title: Paso 70
 challengeType: 0
 dashedName: step-70
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61adc60b69cd4b87739d2174.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61adc60b69cd4b87739d2174.md
index 785fe4028ed..378f4ffed9f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61adc60b69cd4b87739d2174.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61adc60b69cd4b87739d2174.md
@@ -1,29 +1,29 @@
 ---
 id: 61adc60b69cd4b87739d2174
-title: Step 71
+title: Paso 71
 challengeType: 0
 dashedName: step-71
 ---
 
 # --description--
 
-Create a new CSS rule that targets the class `sleeve`. Set the `width` property to `110px`, and the `height` property to `25px`.
+Crea una nueva regla CSS que tenga como objetivo la clase `sleeve`. Establece la propiedad `width` a `110px`, y la propiedad `height` a `25px`.
 
 # --hints--
 
-You should use a class selector to target class `sleeve`.
+Debes usar un selector de clase para seleccionar la clase `sleeve`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.sleeve'));
 ```
 
-Your `.sleeve` CSS rule should have a `width` property set to `110px`.
+La regla CSS `.sleeve` debe tener la propiedad `width` establecida a `110px`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.sleeve')?.width === '110px');
 ```
 
-Your `.sleeve` CSS rule should have a `height` property set to `25px`.
+La regla CSS `.sleeve` debe tener la propiedad `height` establecida a `25px`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.sleeve')?.height === '25px');
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61adc91467b5d59328b9f781.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61adc91467b5d59328b9f781.md
index 8240849364e..2a5fd755ec9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61adc91467b5d59328b9f781.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61adc91467b5d59328b9f781.md
@@ -1,6 +1,6 @@
 ---
 id: 61adc91467b5d59328b9f781
-title: Step 79
+title: Paso 79
 challengeType: 0
 dashedName: step-79
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61add79e739a5faee9d96080.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61add79e739a5faee9d96080.md
index 4497f5b12a5..c58a6fb382e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61add79e739a5faee9d96080.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61add79e739a5faee9d96080.md
@@ -1,6 +1,6 @@
 ---
 id: 61add79e739a5faee9d96080
-title: Step 80
+title: Paso 80
 challengeType: 0
 dashedName: step-80
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61add929e41980b1edbdba7e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61add929e41980b1edbdba7e.md
index 4228e9d56d3..721eb5ddbf8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61add929e41980b1edbdba7e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61add929e41980b1edbdba7e.md
@@ -1,6 +1,6 @@
 ---
 id: 61add929e41980b1edbdba7e
-title: Step 81
+title: Paso 81
 challengeType: 0
 dashedName: step-81
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61addaf7e83988b59a7d18ff.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61addaf7e83988b59a7d18ff.md
index 68da86499e6..75a3efa5ca8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61addaf7e83988b59a7d18ff.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61addaf7e83988b59a7d18ff.md
@@ -1,6 +1,6 @@
 ---
 id: 61addaf7e83988b59a7d18ff
-title: Step 82
+title: Paso 82
 challengeType: 0
 dashedName: step-82
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61ade49b2dad60c076cbd32d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61ade49b2dad60c076cbd32d.md
index 1bb9b99acd1..e40822081ea 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61ade49b2dad60c076cbd32d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61ade49b2dad60c076cbd32d.md
@@ -1,6 +1,6 @@
 ---
 id: 61ade49b2dad60c076cbd32d
-title: Step 83
+title: Paso 83
 challengeType: 0
 dashedName: step-83
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b092eb9e7fc020b43b1bb2.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b092eb9e7fc020b43b1bb2.md
index abe6ce28aac..2bba51f4dc7 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b092eb9e7fc020b43b1bb2.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b092eb9e7fc020b43b1bb2.md
@@ -1,6 +1,6 @@
 ---
 id: 61b092eb9e7fc020b43b1bb2
-title: Step 72
+title: Paso 72
 challengeType: 0
 dashedName: step-72
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b093179e7fc020b43b1bb3.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b093179e7fc020b43b1bb3.md
index d8d0fba99d4..b13190e064e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b093179e7fc020b43b1bb3.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b093179e7fc020b43b1bb3.md
@@ -1,6 +1,6 @@
 ---
 id: 61b093179e7fc020b43b1bb3
-title: Step 73
+title: Paso 73
 challengeType: 0
 dashedName: step-73
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b093219e7fc020b43b1bb4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b093219e7fc020b43b1bb4.md
index dd190a3b423..53fea4b36c8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b093219e7fc020b43b1bb4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b093219e7fc020b43b1bb4.md
@@ -1,6 +1,6 @@
 ---
 id: 61b093219e7fc020b43b1bb4
-title: Step 74
+title: Paso 74
 challengeType: 0
 dashedName: step-74
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b093329e7fc020b43b1bb5.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b093329e7fc020b43b1bb5.md
index 165de21342f..2ca5ea90049 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b093329e7fc020b43b1bb5.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b093329e7fc020b43b1bb5.md
@@ -1,6 +1,6 @@
 ---
 id: 61b093329e7fc020b43b1bb5
-title: Step 75
+title: Paso 75
 challengeType: 0
 dashedName: step-75
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b093429e7fc020b43b1bb6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b093429e7fc020b43b1bb6.md
index b60979b8676..fb4197fcfe9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b093429e7fc020b43b1bb6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b093429e7fc020b43b1bb6.md
@@ -1,6 +1,6 @@
 ---
 id: 61b093429e7fc020b43b1bb6
-title: Step 76
+title: Paso 76
 challengeType: 0
 dashedName: step-76
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0934c9e7fc020b43b1bb7.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0934c9e7fc020b43b1bb7.md
index 4791648d18e..b3b0510c7c5 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0934c9e7fc020b43b1bb7.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0934c9e7fc020b43b1bb7.md
@@ -1,6 +1,6 @@
 ---
 id: 61b0934c9e7fc020b43b1bb7
-title: Step 77
+title: Paso 77
 challengeType: 0
 dashedName: step-77
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0936d9e7fc020b43b1bb8.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0936d9e7fc020b43b1bb8.md
index ac1b7377b3f..def4ed490c9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0936d9e7fc020b43b1bb8.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0936d9e7fc020b43b1bb8.md
@@ -1,13 +1,13 @@
 ---
 id: 61b0936d9e7fc020b43b1bb8
-title: Step 78
+title: Paso 78
 challengeType: 0
 dashedName: step-78
 ---
 
 # --description--
 
-It looks like your sleeve disappeared, but don't worry -- it's still there. What happened is that your new cap `div` is taking up the entire width of the marker, and is pushing the sleeve down to the next line.
+It looks like your sleeve disappeared, but don't worry -- it's still there. Lo que ha ocurrido es que tu nuevo `div` de tapa está ocupando todo el ancho del marcador, y está empujando el mango hacia la siguiente línea.
 
 This is because the default `display` property for `div` elements is `block`. So when two `block` elements are next to each other, they stack like actual blocks. For example, your marker elements are all stacked on top of each other.
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b095989e7fc020b43b1bb9.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b095989e7fc020b43b1bb9.md
index 5fd0daa51b9..71bbbf3ed1c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b095989e7fc020b43b1bb9.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b095989e7fc020b43b1bb9.md
@@ -1,6 +1,6 @@
 ---
 id: 61b095989e7fc020b43b1bb9
-title: Step 51
+title: Paso 51
 challengeType: 0
 dashedName: step-51
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b095a79e7fc020b43b1bba.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b095a79e7fc020b43b1bba.md
index 48a75db6e2c..41d5c5b21a7 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b095a79e7fc020b43b1bba.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b095a79e7fc020b43b1bba.md
@@ -1,6 +1,6 @@
 ---
 id: 61b095a79e7fc020b43b1bba
-title: Step 52
+title: Paso 52
 challengeType: 0
 dashedName: step-52
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b095c79e7fc020b43b1bbb.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b095c79e7fc020b43b1bbb.md
index f12ed48d45e..87dc9f5d626 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b095c79e7fc020b43b1bbb.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b095c79e7fc020b43b1bbb.md
@@ -1,6 +1,6 @@
 ---
 id: 61b095c79e7fc020b43b1bbb
-title: Step 62
+title: Paso 62
 challengeType: 0
 dashedName: step-62
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b09f739aa6572d2064f9b8.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b09f739aa6572d2064f9b8.md
index c3168768e80..f27f14b93db 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b09f739aa6572d2064f9b8.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b09f739aa6572d2064f9b8.md
@@ -1,6 +1,6 @@
 ---
 id: 61b09f739aa6572d2064f9b8
-title: Step 84
+title: Paso 84
 challengeType: 0
 dashedName: step-84
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0a1b2af494934b7ec1a72.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0a1b2af494934b7ec1a72.md
index b87a6ef2fcf..abf3360c9b6 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0a1b2af494934b7ec1a72.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0a1b2af494934b7ec1a72.md
@@ -1,6 +1,6 @@
 ---
 id: 61b0a1b2af494934b7ec1a72
-title: Step 85
+title: Paso 85
 challengeType: 0
 dashedName: step-85
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0a44a6b865738ba49b9fb.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0a44a6b865738ba49b9fb.md
index b7062baf610..4c95bc53918 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0a44a6b865738ba49b9fb.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0a44a6b865738ba49b9fb.md
@@ -1,6 +1,6 @@
 ---
 id: 61b0a44a6b865738ba49b9fb
-title: Step 86
+title: Paso 86
 challengeType: 0
 dashedName: step-86
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b306305810f1c9040ce5a2.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b306305810f1c9040ce5a2.md
index 63e7f372ae1..ad9c70673c4 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b306305810f1c9040ce5a2.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b306305810f1c9040ce5a2.md
@@ -1,6 +1,6 @@
 ---
 id: 61b306305810f1c9040ce5a2
-title: Step 87
+title: Paso 87
 challengeType: 0
 dashedName: step-87
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b30995968123ceb6b76167.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b30995968123ceb6b76167.md
index 3ec43b720fa..b7887c08987 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b30995968123ceb6b76167.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b30995968123ceb6b76167.md
@@ -1,6 +1,6 @@
 ---
 id: 61b30995968123ceb6b76167
-title: Step 88
+title: Paso 88
 challengeType: 0
 dashedName: step-88
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b30a286c228bd0c493c09a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b30a286c228bd0c493c09a.md
index 9b91e0184d5..62630a0dcaa 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b30a286c228bd0c493c09a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b30a286c228bd0c493c09a.md
@@ -1,6 +1,6 @@
 ---
 id: 61b30a286c228bd0c493c09a
-title: Step 89
+title: Paso 89
 challengeType: 0
 dashedName: step-89
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b31287fb580ae75a486047.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b31287fb580ae75a486047.md
index b87a5548dcd..0cb41d5f56c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b31287fb580ae75a486047.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b31287fb580ae75a486047.md
@@ -1,6 +1,6 @@
 ---
 id: 61b31287fb580ae75a486047
-title: Step 90
+title: Paso 90
 challengeType: 0
 dashedName: step-90
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b315e76a63b3ecbbb11b75.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b315e76a63b3ecbbb11b75.md
index da0027fff13..8aa2a76317a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b315e76a63b3ecbbb11b75.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b315e76a63b3ecbbb11b75.md
@@ -1,6 +1,6 @@
 ---
 id: 61b315e76a63b3ecbbb11b75
-title: Step 91
+title: Paso 91
 challengeType: 0
 dashedName: step-91
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b3183655ec10efd8c0bb07.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b3183655ec10efd8c0bb07.md
index 1cc0c1b3591..09aec1a5b60 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b3183655ec10efd8c0bb07.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b3183655ec10efd8c0bb07.md
@@ -1,6 +1,6 @@
 ---
 id: 61b3183655ec10efd8c0bb07
-title: Step 92
+title: Paso 92
 challengeType: 0
 dashedName: step-92
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b31a451057fff645ec09be.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b31a451057fff645ec09be.md
index 8750e8fc2ed..e1a51d298be 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b31a451057fff645ec09be.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b31a451057fff645ec09be.md
@@ -1,6 +1,6 @@
 ---
 id: 61b31a451057fff645ec09be
-title: Step 93
+title: Paso 93
 challengeType: 0
 dashedName: step-93
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b31cd7b0c76bfc076b4719.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b31cd7b0c76bfc076b4719.md
index 8a9dc372ba6..593517f95e3 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b31cd7b0c76bfc076b4719.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b31cd7b0c76bfc076b4719.md
@@ -1,6 +1,6 @@
 ---
 id: 61b31cd7b0c76bfc076b4719
-title: Step 94
+title: Paso 94
 challengeType: 0
 dashedName: step-94
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3952facd25a83fe8083.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3952facd25a83fe8083.md
index 5a5859145df..aada9fe73f8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3952facd25a83fe8083.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3952facd25a83fe8083.md
@@ -7,7 +7,7 @@ dashedName: step-20
 
 # --description--
 
-El pseudo-elemento `::after` crea un elemento que es el último hijo del elemento seleccionado. Podemos utilizarlo para añadir un elemento vacío después de la última imagen. Si le damos el mismo `width` que las imágenes, empujará la última imagen a la izquierda cuando la galería esté en un diseño de dos columnas. Ahora mismo está en el centro porque hemos puesto `justify-content: center` en el contenedor flex.
+El pseudo-elemento `::after` crea un elemento que es el último hijo del elemento seleccionado. Puedes hacer uso de él para añadir un elemento vacío a continuación de la ultima imagen. Si en su propiedad `width` se le asigna el mismo valor que tiene en las imágenes, empujará la última imagen hacia la izquierda cuando la galería tenga un diseño de dos columnas. En este momento, está en el centro porque se ha establecido `justify-content: center` en el contenedor flex.
 
 Ejemplo:
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61437d575fb98f57fa8f7f36.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61437d575fb98f57fa8f7f36.md
index 2d083077ee1..90b27d8c8eb 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61437d575fb98f57fa8f7f36.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61437d575fb98f57fa8f7f36.md
@@ -1,6 +1,6 @@
 ---
 id: 61437d575fb98f57fa8f7f36
-title: Step 1
+title: Paso 1
 challengeType: 0
 dashedName: step-1
 ---
@@ -19,7 +19,7 @@ Your code should contain the `DOCTYPE` reference.
 assert(code.match(/<!DOCTYPE/gi));
 ```
 
-You should include a space after the `DOCTYPE` reference.
+Debes incluir un espacio despues de la referencia `DOCTYPE`.
 
 ```js
 assert(code.match(/<!DOCTYPE\s+/gi));
@@ -112,7 +112,7 @@ const target = meta?.find(m => m?.getAttribute('name') === 'viewport' && m?.getA
 assert.exists(target);
 ```
 
-The other `meta` element should have the `charset` attribute set to `UTF-8`.
+El otro elemento `meta` debe tener el atributo `charset` establecido en `UTF-8`.
 
 ```js
 const meta = [...document.querySelectorAll('meta')];
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614385513d91ae5c251c2052.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614385513d91ae5c251c2052.md
index 7f6d7239c43..84356f82fb1 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614385513d91ae5c251c2052.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614385513d91ae5c251c2052.md
@@ -1,6 +1,6 @@
 ---
 id: 614385513d91ae5c251c2052
-title: Step 2
+title: Paso 2
 challengeType: 0
 dashedName: step-2
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143862a5e54455d262c212e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143862a5e54455d262c212e.md
index e911ec286f1..e94c2df0afd 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143862a5e54455d262c212e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143862a5e54455d262c212e.md
@@ -1,6 +1,6 @@
 ---
 id: 6143862a5e54455d262c212e
-title: Step 3
+title: Paso 3
 challengeType: 0
 dashedName: step-3
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143869bb45bd85e3b1926aa.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143869bb45bd85e3b1926aa.md
index dc28dc079b9..f7b923ea1d9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143869bb45bd85e3b1926aa.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143869bb45bd85e3b1926aa.md
@@ -1,6 +1,6 @@
 ---
 id: 6143869bb45bd85e3b1926aa
-title: Step 4
+title: Paso 4
 challengeType: 0
 dashedName: step-4
 ---
@@ -11,25 +11,25 @@ Within your `.heading` element, create a `header` element with the `class` set t
 
 In that element, create an `img` element with the `src` set to `https://cdn.freecodecamp.org/platform/universal/fcc_meta_1920X1080-indigo.png`, the `alt` set to `freecodecamp logo`, and the `class` set to `hero-img`.
 
-The `loading` attribute on an `img` element can be set to `lazy` to tell the browser not to fetch the image resource until it is needed (as in, when the user scrolls the image into view). As an additional benefit, lazy loaded elements will not load until the non-lazy elements are loaded - this means users with slow internet connections can view the content of your page without having to wait for the images to load.
+El atributo `loading` de un elemento `img` puede establecerse como `lazy` para indicar al navegador que no recupere el recurso de la imagen hasta que sea necesario (por ejemplo, cuando el usuario se desplace para ver la imagen). Como beneficio adicional, los elementos de carga lenta no se cargarán hasta que los elementos no lentos se carguen - esto significa que los usuarios con conexiones de Internet lentas pueden ver el contenido de su página sin tener que esperar a que las imágenes se carguen.
 
 Give your new `img` element a `loading` attribute set to `lazy`.
 
 # --hints--
 
-You should create a `header` element.
+Debes crear un elemento `header`.
 
 ```js
 assert.exists(document.querySelector('header'));
 ```
 
-Your `header` element should be within your `.heading` element.
+Tu elemento `header` debe estar dentro de tu elemento `.heading`.
 
 ```js
 assert(document.querySelector('header')?.parentElement?.className === 'heading');
 ```
 
-Your `header` element should have the `class` set to `hero`.
+Tu elemento `header` debe tener la `class` establecida en `hero`.
 
 ```js
 assert(document.querySelector('header')?.className === 'hero');
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614387cbefeeba5f3654a291.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614387cbefeeba5f3654a291.md
index 535295bcae3..f691ea07fb0 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614387cbefeeba5f3654a291.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614387cbefeeba5f3654a291.md
@@ -1,6 +1,6 @@
 ---
 id: 614387cbefeeba5f3654a291
-title: Step 7
+title: Paso 7
 challengeType: 0
 dashedName: step-7
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614389f601bb4f611db98563.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614389f601bb4f611db98563.md
index 44fe6eb8cb4..d33969a2bb9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614389f601bb4f611db98563.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614389f601bb4f611db98563.md
@@ -1,6 +1,6 @@
 ---
 id: 614389f601bb4f611db98563
-title: Step 9
+title: Paso 9
 challengeType: 0
 dashedName: step-9
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61438b5b66d76a6264430f2a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61438b5b66d76a6264430f2a.md
index d2757106fda..92ab23a8fa4 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61438b5b66d76a6264430f2a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61438b5b66d76a6264430f2a.md
@@ -1,6 +1,6 @@
 ---
 id: 61438b5b66d76a6264430f2a
-title: Step 10
+title: Paso 10
 challengeType: 0
 dashedName: step-10
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61438ec09438696391076d6a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61438ec09438696391076d6a.md
index 9fec7159374..b3ec80181b7 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61438ec09438696391076d6a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61438ec09438696391076d6a.md
@@ -1,6 +1,6 @@
 ---
 id: 61438ec09438696391076d6a
-title: Step 11
+title: Paso 11
 challengeType: 0
 dashedName: step-11
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dc084fa5f659cf75d7c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dc084fa5f659cf75d7c.md
index 4f19487816b..42c86f3e923 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dc084fa5f659cf75d7c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dc084fa5f659cf75d7c.md
@@ -1,6 +1,6 @@
 ---
 id: 61439dc084fa5f659cf75d7c
-title: Step 12
+title: Paso 12
 challengeType: 0
 dashedName: step-12
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dfc811e12666b04be6f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dfc811e12666b04be6f.md
index f4ee0bb5ab3..606ca864a1e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dfc811e12666b04be6f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dfc811e12666b04be6f.md
@@ -1,6 +1,6 @@
 ---
 id: 61439dfc811e12666b04be6f
-title: Step 13
+title: Paso 13
 challengeType: 0
 dashedName: step-13
 ---
@@ -100,7 +100,7 @@ assert(document.querySelectorAll('.text p')?.[2]?.innerText === "It wasn't as dr
           After years - years - of pondering these two problems and how to solve them, I slipped, hit my head on the sink, and when I came to I had a revelation! A vision! A picture in my head! A picture of this! This is what makes time travel possible: the flux capacitor!
         </p>
 --fcc-editable-region--
-        
+
 --fcc-editable-region--
       </section>
     </main>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439e33e4fb7967609e0c83.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439e33e4fb7967609e0c83.md
index 7f654bcc95c..308137ff184 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439e33e4fb7967609e0c83.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439e33e4fb7967609e0c83.md
@@ -1,6 +1,6 @@
 ---
 id: 61439e33e4fb7967609e0c83
-title: Step 14
+title: Paso 14
 challengeType: 0
 dashedName: step-14
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a1a228f7d068ab16a130.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a1a228f7d068ab16a130.md
index db32dfa57dc..d91397a4e0a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a1a228f7d068ab16a130.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a1a228f7d068ab16a130.md
@@ -1,6 +1,6 @@
 ---
 id: 6143a1a228f7d068ab16a130
-title: Step 15
+title: Paso 15
 challengeType: 0
 dashedName: step-15
 ---
@@ -117,7 +117,7 @@ assert(document.querySelectorAll('.text p')?.[4]?.innerText === 'No more walls o
           <hr />
         </blockquote>
 --fcc-editable-region--
-        
+
 --fcc-editable-region--
       </section>
     </main>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a73279ce6369de4b9bcc.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a73279ce6369de4b9bcc.md
index 7500f1b4667..664a6fbf372 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a73279ce6369de4b9bcc.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a73279ce6369de4b9bcc.md
@@ -1,6 +1,6 @@
 ---
 id: 6143a73279ce6369de4b9bcc
-title: Step 16
+title: Paso 16
 challengeType: 0
 dashedName: step-16
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a778bffc206ac6b1dbe3.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a778bffc206ac6b1dbe3.md
index 250303e45c1..543453a77e1 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a778bffc206ac6b1dbe3.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a778bffc206ac6b1dbe3.md
@@ -1,6 +1,6 @@
 ---
 id: 6143a778bffc206ac6b1dbe3
-title: Step 17
+title: Paso 17
 challengeType: 0
 dashedName: step-17
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a83fcc32c26bcfae3efa.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a83fcc32c26bcfae3efa.md
index b1af2f717d8..c7e573ce4a6 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a83fcc32c26bcfae3efa.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a83fcc32c26bcfae3efa.md
@@ -1,6 +1,6 @@
 ---
 id: 6143a83fcc32c26bcfae3efa
-title: Step 18
+title: Paso 18
 challengeType: 0
 dashedName: step-18
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b97c06c3306d23d5da47.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b97c06c3306d23d5da47.md
index f8148bc77f8..da73a26949a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b97c06c3306d23d5da47.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b97c06c3306d23d5da47.md
@@ -1,6 +1,6 @@
 ---
 id: 6143b97c06c3306d23d5da47
-title: Step 19
+title: Paso 19
 challengeType: 0
 dashedName: step-19
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b9e1f5035c6e5f2a8231.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b9e1f5035c6e5f2a8231.md
index b6b2d1bd906..54f629eabae 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b9e1f5035c6e5f2a8231.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b9e1f5035c6e5f2a8231.md
@@ -1,6 +1,6 @@
 ---
 id: 6143b9e1f5035c6e5f2a8231
-title: Step 20
+title: Paso 20
 challengeType: 0
 dashedName: step-20
 ---
@@ -212,7 +212,7 @@ assert(h4s?.every(h4 => h4?.classList?.contains('list-subtitle')));
           <h3 class="list-title">A Brief History</h3>
           <p>Of the Curriculum</p>
           <ul class="lists">
-          
+
           </ul>
         </article>
 --fcc-editable-region--
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143bb50e8e48c6f5ef9d8d5.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143bb50e8e48c6f5ef9d8d5.md
index 06fb3da6c3c..1d4bbf2869d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143bb50e8e48c6f5ef9d8d5.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143bb50e8e48c6f5ef9d8d5.md
@@ -1,6 +1,6 @@
 ---
 id: 6143bb50e8e48c6f5ef9d8d5
-title: Step 21
+title: Paso 21
 challengeType: 0
 dashedName: step-21
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143c2a363865c715f1a3f72.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143c2a363865c715f1a3f72.md
index 2a6bd8dc4cb..e115d09066c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143c2a363865c715f1a3f72.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143c2a363865c715f1a3f72.md
@@ -1,6 +1,6 @@
 ---
 id: 6143c2a363865c715f1a3f72
-title: Step 22
+title: Paso 22
 challengeType: 0
 dashedName: step-22
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143cd08fe927072ca3a371d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143cd08fe927072ca3a371d.md
index 66fe0f88a1d..6510a851204 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143cd08fe927072ca3a371d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143cd08fe927072ca3a371d.md
@@ -1,6 +1,6 @@
 ---
 id: 6143cd08fe927072ca3a371d
-title: Step 23
+title: Paso 23
 challengeType: 0
 dashedName: step-23
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143cdf48b634a747de42104.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143cdf48b634a747de42104.md
index e68a89181f4..da6ab95e441 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143cdf48b634a747de42104.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143cdf48b634a747de42104.md
@@ -1,6 +1,6 @@
 ---
 id: 6143cdf48b634a747de42104
-title: Step 24
+title: Paso 24
 challengeType: 0
 dashedName: step-24
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143d003ad9e9d76766293ec.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143d003ad9e9d76766293ec.md
index 4014ac8d11d..a217f12328a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143d003ad9e9d76766293ec.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143d003ad9e9d76766293ec.md
@@ -1,6 +1,6 @@
 ---
 id: 6143d003ad9e9d76766293ec
-title: Step 25
+title: Paso 25
 challengeType: 0
 dashedName: step-25
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143d2842b497779bad947de.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143d2842b497779bad947de.md
index 813ab28b826..6e359da3d12 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143d2842b497779bad947de.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143d2842b497779bad947de.md
@@ -1,6 +1,6 @@
 ---
 id: 6143d2842b497779bad947de
-title: Step 26
+title: Paso 26
 challengeType: 0
 dashedName: step-26
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144d66a5358db0c80628757.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144d66a5358db0c80628757.md
index 4a5916f083b..4c7ef92b729 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144d66a5358db0c80628757.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144d66a5358db0c80628757.md
@@ -1,6 +1,6 @@
 ---
 id: 6144d66a5358db0c80628757
-title: Step 27
+title: Paso 27
 challengeType: 0
 dashedName: step-27
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144d7dbdd3e580da730ff45.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144d7dbdd3e580da730ff45.md
index 7ff9082f0e8..6c016025556 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144d7dbdd3e580da730ff45.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144d7dbdd3e580da730ff45.md
@@ -1,6 +1,6 @@
 ---
 id: 6144d7dbdd3e580da730ff45
-title: Step 28
+title: Paso 28
 challengeType: 0
 dashedName: step-28
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144de308591ec10e27d5383.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144de308591ec10e27d5383.md
index 8a5a35a79d4..2c760541d01 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144de308591ec10e27d5383.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144de308591ec10e27d5383.md
@@ -1,6 +1,6 @@
 ---
 id: 6144de308591ec10e27d5383
-title: Step 29
+title: Paso 29
 challengeType: 0
 dashedName: step-29
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144e1ba93e435127a7f516d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144e1ba93e435127a7f516d.md
index b88b5b2c249..675815db972 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144e1ba93e435127a7f516d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144e1ba93e435127a7f516d.md
@@ -1,6 +1,6 @@
 ---
 id: 6144e1ba93e435127a7f516d
-title: Step 30
+title: Paso 30
 challengeType: 0
 dashedName: step-30
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144ee46a9d6e614c598cc05.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144ee46a9d6e614c598cc05.md
index cefa6e21aad..cadc63b729f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144ee46a9d6e614c598cc05.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144ee46a9d6e614c598cc05.md
@@ -1,6 +1,6 @@
 ---
 id: 6144ee46a9d6e614c598cc05
-title: Step 31
+title: Paso 31
 challengeType: 0
 dashedName: step-31
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144ee790af79815ad15a832.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144ee790af79815ad15a832.md
index defe5fc1693..66d6a04ada1 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144ee790af79815ad15a832.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144ee790af79815ad15a832.md
@@ -1,6 +1,6 @@
 ---
 id: 6144ee790af79815ad15a832
-title: Step 32
+title: Paso 32
 challengeType: 0
 dashedName: step-32
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f1410990ea17187a722b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f1410990ea17187a722b.md
index fc25931639b..89f6c23733e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f1410990ea17187a722b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f1410990ea17187a722b.md
@@ -1,13 +1,13 @@
 ---
 id: 6144f1410990ea17187a722b
-title: Step 33
+title: Paso 33
 challengeType: 0
 dashedName: step-33
 ---
 
 # --description--
 
-Now you can style the layout of your grid. CSS Grid is similar to Flexbox in that it has a special property for both the parent and child elements. 
+Now you can style the layout of your grid. CSS Grid is similar to Flexbox in that it has a special property for both the parent and child elements.
 
 In this case, your parent element is the `main` element. Set the content to have a three-column layout by adding a `grid-template-columns` property with a value of `1fr 94rem 1fr`. This will create three columns where the middle column is `94rem` wide, and the first and last columns are both 1 fraction of the remaining space in the grid container.
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f3818bfbc51844152e36.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f3818bfbc51844152e36.md
index 3f24bba4d26..14fb42e88b0 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f3818bfbc51844152e36.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f3818bfbc51844152e36.md
@@ -1,6 +1,6 @@
 ---
 id: 6144f3818bfbc51844152e36
-title: Step 34
+title: Paso 34
 challengeType: 0
 dashedName: step-34
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f42204c8c8195f1f3345.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f42204c8c8195f1f3345.md
index 15528e7d5d9..dad3f998e71 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f42204c8c8195f1f3345.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f42204c8c8195f1f3345.md
@@ -1,6 +1,6 @@
 ---
 id: 6144f42204c8c8195f1f3345
-title: Step 35
+title: Paso 35
 challengeType: 0
 dashedName: step-35
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f47b7c631e1a6f304dd5.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f47b7c631e1a6f304dd5.md
index 0d3c9702bfe..81105a97130 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f47b7c631e1a6f304dd5.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f47b7c631e1a6f304dd5.md
@@ -1,6 +1,6 @@
 ---
 id: 6144f47b7c631e1a6f304dd5
-title: Step 36
+title: Paso 36
 challengeType: 0
 dashedName: step-36
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b07081759c2c691166a9.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b07081759c2c691166a9.md
index 2d133371f79..bcfb43b634a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b07081759c2c691166a9.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b07081759c2c691166a9.md
@@ -1,6 +1,6 @@
 ---
 id: 6148b07081759c2c691166a9
-title: Step 37
+title: Paso 37
 challengeType: 0
 dashedName: step-37
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b0d764e4192e5712ed92.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b0d764e4192e5712ed92.md
index 12fc38f790e..3909b29e81b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b0d764e4192e5712ed92.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b0d764e4192e5712ed92.md
@@ -1,6 +1,6 @@
 ---
 id: 6148b0d764e4192e5712ed92
-title: Step 38
+title: Paso 38
 challengeType: 0
 dashedName: step-38
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b185ef37522f688316b0.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b185ef37522f688316b0.md
index e68572fccf6..0e20d62e5d8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b185ef37522f688316b0.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b185ef37522f688316b0.md
@@ -1,6 +1,6 @@
 ---
 id: 6148b185ef37522f688316b0
-title: Step 39
+title: Paso 39
 challengeType: 0
 dashedName: step-39
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b30464daf630848c21d4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b30464daf630848c21d4.md
index 71ae54a2abe..aaecf57fb78 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b30464daf630848c21d4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b30464daf630848c21d4.md
@@ -1,6 +1,6 @@
 ---
 id: 6148b30464daf630848c21d4
-title: Step 40
+title: Paso 40
 challengeType: 0
 dashedName: step-40
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b4b150434734143db6f2.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b4b150434734143db6f2.md
index cb2bf5e6088..b5929acd683 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b4b150434734143db6f2.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b4b150434734143db6f2.md
@@ -1,6 +1,6 @@
 ---
 id: 6148b4b150434734143db6f2
-title: Step 41
+title: Paso 41
 challengeType: 0
 dashedName: step-41
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b5623efa8f369f2c3643.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b5623efa8f369f2c3643.md
index 50bcd857e95..65938f25269 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b5623efa8f369f2c3643.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b5623efa8f369f2c3643.md
@@ -1,6 +1,6 @@
 ---
 id: 6148b5623efa8f369f2c3643
-title: Step 42
+title: Paso 42
 challengeType: 0
 dashedName: step-42
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b59ef318e03875f35c4a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b59ef318e03875f35c4a.md
index 4e02bcea6b6..6174383cf0e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b59ef318e03875f35c4a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b59ef318e03875f35c4a.md
@@ -1,6 +1,6 @@
 ---
 id: 6148b59ef318e03875f35c4a
-title: Step 44
+title: Paso 44
 challengeType: 0
 dashedName: step-44
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bd62bbb8c83a5f1fc1b3.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bd62bbb8c83a5f1fc1b3.md
index 79cfd07a73b..af4c052dd8b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bd62bbb8c83a5f1fc1b3.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bd62bbb8c83a5f1fc1b3.md
@@ -1,6 +1,6 @@
 ---
 id: 6148bd62bbb8c83a5f1fc1b3
-title: Step 45
+title: Paso 45
 challengeType: 0
 dashedName: step-45
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148be3d605d6b3ca9425d11.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148be3d605d6b3ca9425d11.md
index 988ec7d9b4d..168bdb2b5e2 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148be3d605d6b3ca9425d11.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148be3d605d6b3ca9425d11.md
@@ -1,6 +1,6 @@
 ---
 id: 6148be3d605d6b3ca9425d11
-title: Step 46
+title: Paso 46
 challengeType: 0
 dashedName: step-46
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148be82ca63c63daa8cca49.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148be82ca63c63daa8cca49.md
index 900768bc017..51bbd7d04fc 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148be82ca63c63daa8cca49.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148be82ca63c63daa8cca49.md
@@ -1,6 +1,6 @@
 ---
 id: 6148be82ca63c63daa8cca49
-title: Step 47
+title: Paso 47
 challengeType: 0
 dashedName: step-47
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bf49fcc7913f05dbf9b7.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bf49fcc7913f05dbf9b7.md
index 86afef0ad3a..f8c76f0cc18 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bf49fcc7913f05dbf9b7.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bf49fcc7913f05dbf9b7.md
@@ -1,6 +1,6 @@
 ---
 id: 6148bf49fcc7913f05dbf9b7
-title: Step 48
+title: Paso 48
 challengeType: 0
 dashedName: step-48
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bfc43df3bc40fe0e6405.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bfc43df3bc40fe0e6405.md
index 35fc54744f8..65ea26802b1 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bfc43df3bc40fe0e6405.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bfc43df3bc40fe0e6405.md
@@ -1,6 +1,6 @@
 ---
 id: 6148bfc43df3bc40fe0e6405
-title: Step 49
+title: Paso 49
 challengeType: 0
 dashedName: step-49
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c004ffc8434252940dc3.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c004ffc8434252940dc3.md
index aa09f1df174..1994e5152b8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c004ffc8434252940dc3.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c004ffc8434252940dc3.md
@@ -1,6 +1,6 @@
 ---
 id: 6148c004ffc8434252940dc3
-title: Step 50
+title: Paso 50
 challengeType: 0
 dashedName: step-50
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c224ecb157439bc5247c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c224ecb157439bc5247c.md
index 8a679a698b4..6dbd6b29ecc 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c224ecb157439bc5247c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c224ecb157439bc5247c.md
@@ -1,6 +1,6 @@
 ---
 id: 6148c224ecb157439bc5247c
-title: Step 51
+title: Paso 51
 challengeType: 0
 dashedName: step-51
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c434bd731d45617a76c6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c434bd731d45617a76c6.md
index 65148730985..21c5a2e520c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c434bd731d45617a76c6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c434bd731d45617a76c6.md
@@ -1,6 +1,6 @@
 ---
 id: 6148c434bd731d45617a76c6
-title: Step 52
+title: Paso 52
 challengeType: 0
 dashedName: step-52
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c5036ddad94692a66230.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c5036ddad94692a66230.md
index 3f62a3cdb38..336b2649623 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c5036ddad94692a66230.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c5036ddad94692a66230.md
@@ -1,6 +1,6 @@
 ---
 id: 6148c5036ddad94692a66230
-title: Step 53
+title: Paso 53
 challengeType: 0
 dashedName: step-53
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c58bace368497fb11bcf.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c58bace368497fb11bcf.md
index fb1d86107ae..c2c305d1f49 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c58bace368497fb11bcf.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c58bace368497fb11bcf.md
@@ -1,6 +1,6 @@
 ---
 id: 6148c58bace368497fb11bcf
-title: Step 54
+title: Paso 54
 challengeType: 0
 dashedName: step-54
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c6aa9981d74af202125e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c6aa9981d74af202125e.md
index 187216737dc..7715e6b4443 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c6aa9981d74af202125e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c6aa9981d74af202125e.md
@@ -1,6 +1,6 @@
 ---
 id: 6148c6aa9981d74af202125e
-title: Step 55
+title: Paso 55
 challengeType: 0
 dashedName: step-55
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c721e74ecd4c619ae51c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c721e74ecd4c619ae51c.md
index 6e5b23b6f5a..53ea6c06204 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c721e74ecd4c619ae51c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c721e74ecd4c619ae51c.md
@@ -1,6 +1,6 @@
 ---
 id: 6148c721e74ecd4c619ae51c
-title: Step 56
+title: Paso 56
 challengeType: 0
 dashedName: step-56
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148ceaf5d897d4d8b3554b3.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148ceaf5d897d4d8b3554b3.md
index 69b4158009f..602651c34b0 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148ceaf5d897d4d8b3554b3.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148ceaf5d897d4d8b3554b3.md
@@ -1,6 +1,6 @@
 ---
 id: 6148ceaf5d897d4d8b3554b3
-title: Step 57
+title: Paso 57
 challengeType: 0
 dashedName: step-57
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148cf094b3f2b4e8a032c63.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148cf094b3f2b4e8a032c63.md
index 43e50830b1d..8ebd7299a6e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148cf094b3f2b4e8a032c63.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148cf094b3f2b4e8a032c63.md
@@ -1,6 +1,6 @@
 ---
 id: 6148cf094b3f2b4e8a032c63
-title: Step 58
+title: Paso 58
 challengeType: 0
 dashedName: step-58
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d0b863d10d50544ace0e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d0b863d10d50544ace0e.md
index 06f0be77acf..74f2ab0c22b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d0b863d10d50544ace0e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d0b863d10d50544ace0e.md
@@ -1,6 +1,6 @@
 ---
 id: 6148d0b863d10d50544ace0e
-title: Step 59
+title: Paso 59
 challengeType: 0
 dashedName: step-59
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d1bdf39c5b5186f5974b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d1bdf39c5b5186f5974b.md
index dcbfd1394f6..92bc585fad4 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d1bdf39c5b5186f5974b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d1bdf39c5b5186f5974b.md
@@ -1,6 +1,6 @@
 ---
 id: 6148d1bdf39c5b5186f5974b
-title: Step 60
+title: Paso 60
 challengeType: 0
 dashedName: step-60
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d1f9eb63c252e1f8acc4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d1f9eb63c252e1f8acc4.md
index 8b519c2d9ef..c736814f95d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d1f9eb63c252e1f8acc4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d1f9eb63c252e1f8acc4.md
@@ -1,6 +1,6 @@
 ---
 id: 6148d1f9eb63c252e1f8acc4
-title: Step 61
+title: Paso 61
 challengeType: 0
 dashedName: step-61
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d2444d01ab541e64a1e4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d2444d01ab541e64a1e4.md
index d9b089bb510..09ff6c09ff9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d2444d01ab541e64a1e4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d2444d01ab541e64a1e4.md
@@ -1,6 +1,6 @@
 ---
 id: 6148d2444d01ab541e64a1e4
-title: Step 62
+title: Paso 62
 challengeType: 0
 dashedName: step-62
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d33e31fccf558696c745.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d33e31fccf558696c745.md
index f9fc3477ffe..274bba08a34 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d33e31fccf558696c745.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d33e31fccf558696c745.md
@@ -1,6 +1,6 @@
 ---
 id: 6148d33e31fccf558696c745
-title: Step 63
+title: Paso 63
 challengeType: 0
 dashedName: step-63
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d3fff5186b57123d97e2.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d3fff5186b57123d97e2.md
index 0710da4427f..98393daa557 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d3fff5186b57123d97e2.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d3fff5186b57123d97e2.md
@@ -1,6 +1,6 @@
 ---
 id: 6148d3fff5186b57123d97e2
-title: Step 64
+title: Paso 64
 challengeType: 0
 dashedName: step-64
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d4d57b965358c9fa38bf.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d4d57b965358c9fa38bf.md
index 16e04f302e7..ff2b83502a9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d4d57b965358c9fa38bf.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d4d57b965358c9fa38bf.md
@@ -1,6 +1,6 @@
 ---
 id: 6148d4d57b965358c9fa38bf
-title: Step 65
+title: Paso 65
 challengeType: 0
 dashedName: step-65
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d7720f0db36775db868a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d7720f0db36775db868a.md
index 98d7784f11d..b2b08f1bf5c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d7720f0db36775db868a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d7720f0db36775db868a.md
@@ -1,6 +1,6 @@
 ---
 id: 6148d7720f0db36775db868a
-title: Step 66
+title: Paso 66
 challengeType: 0
 dashedName: step-66
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d94fdf6a5d6899f8ff15.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d94fdf6a5d6899f8ff15.md
index 2e1b2b5c3d0..0858fb1260b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d94fdf6a5d6899f8ff15.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d94fdf6a5d6899f8ff15.md
@@ -1,6 +1,6 @@
 ---
 id: 6148d94fdf6a5d6899f8ff15
-title: Step 67
+title: Paso 67
 challengeType: 0
 dashedName: step-67
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d9825b50a3698aeee644.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d9825b50a3698aeee644.md
index f0e4249bfbe..9b8cb868a0b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d9825b50a3698aeee644.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d9825b50a3698aeee644.md
@@ -1,6 +1,6 @@
 ---
 id: 6148d9825b50a3698aeee644
-title: Step 68
+title: Paso 68
 challengeType: 0
 dashedName: step-68
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e162e255676ae0da6a76.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e162e255676ae0da6a76.md
index 49a92044791..b87f79b362e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e162e255676ae0da6a76.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e162e255676ae0da6a76.md
@@ -1,6 +1,6 @@
 ---
 id: 6148e162e255676ae0da6a76
-title: Step 69
+title: Paso 69
 challengeType: 0
 dashedName: step-69
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e19c3e26436be0155690.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e19c3e26436be0155690.md
index 859891139d8..9f7a067ceaa 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e19c3e26436be0155690.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e19c3e26436be0155690.md
@@ -1,6 +1,6 @@
 ---
 id: 6148e19c3e26436be0155690
-title: Step 70
+title: Paso 70
 challengeType: 0
 dashedName: step-70
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e246146b646cf4255f0c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e246146b646cf4255f0c.md
index e3a186c9466..c8fe3bbad82 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e246146b646cf4255f0c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e246146b646cf4255f0c.md
@@ -1,6 +1,6 @@
 ---
 id: 6148e246146b646cf4255f0c
-title: Step 71
+title: Paso 71
 challengeType: 0
 dashedName: step-71
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e2dcdd60306dd77d41cc.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e2dcdd60306dd77d41cc.md
index 63c0aeb4931..d9979a0fa6e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e2dcdd60306dd77d41cc.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e2dcdd60306dd77d41cc.md
@@ -1,6 +1,6 @@
 ---
 id: 6148e2dcdd60306dd77d41cc
-title: Step 72
+title: Paso 72
 challengeType: 0
 dashedName: step-72
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e4d6861a486f60681f36.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e4d6861a486f60681f36.md
index 36e0d2208a1..2806c1cf54e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e4d6861a486f60681f36.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e4d6861a486f60681f36.md
@@ -1,6 +1,6 @@
 ---
 id: 6148e4d6861a486f60681f36
-title: Step 73
+title: Paso 73
 challengeType: 0
 dashedName: step-73
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e5a204d99e70343a63e4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e5a204d99e70343a63e4.md
index b9448b07782..1a8969e3af3 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e5a204d99e70343a63e4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e5a204d99e70343a63e4.md
@@ -1,6 +1,6 @@
 ---
 id: 6148e5a204d99e70343a63e4
-title: Step 74
+title: Paso 74
 challengeType: 0
 dashedName: step-74
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e62a6f768f71c4f04828.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e62a6f768f71c4f04828.md
index 80824ba7b96..3c5131d1041 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e62a6f768f71c4f04828.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e62a6f768f71c4f04828.md
@@ -1,6 +1,6 @@
 ---
 id: 6148e62a6f768f71c4f04828
-title: Step 75
+title: Paso 75
 challengeType: 0
 dashedName: step-75
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e789329dc9736ce59b85.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e789329dc9736ce59b85.md
index 9d5bdb5f947..006899aeffb 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e789329dc9736ce59b85.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e789329dc9736ce59b85.md
@@ -1,6 +1,6 @@
 ---
 id: 6148e789329dc9736ce59b85
-title: Step 76
+title: Paso 76
 challengeType: 0
 dashedName: step-76
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f34ebedc2274bceeb99c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f34ebedc2274bceeb99c.md
index 89008705e4a..56295908289 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f34ebedc2274bceeb99c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f34ebedc2274bceeb99c.md
@@ -1,6 +1,6 @@
 ---
 id: 6148f34ebedc2274bceeb99c
-title: Step 77
+title: Paso 77
 challengeType: 0
 dashedName: step-77
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f600cde42b7670c2611f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f600cde42b7670c2611f.md
index bd1c8ce483c..7327d4b96d6 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f600cde42b7670c2611f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f600cde42b7670c2611f.md
@@ -1,6 +1,6 @@
 ---
 id: 6148f600cde42b7670c2611f
-title: Step 78
+title: Paso 78
 challengeType: 0
 dashedName: step-78
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f693e0728f77c87f3020.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f693e0728f77c87f3020.md
index 056b0601cdf..de3c1946b75 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f693e0728f77c87f3020.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f693e0728f77c87f3020.md
@@ -1,6 +1,6 @@
 ---
 id: 6148f693e0728f77c87f3020
-title: Step 79
+title: Paso 79
 challengeType: 0
 dashedName: step-79
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f6f7d8914c78e93136ca.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f6f7d8914c78e93136ca.md
index bf702462281..8acea1076cc 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f6f7d8914c78e93136ca.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f6f7d8914c78e93136ca.md
@@ -1,6 +1,6 @@
 ---
 id: 6148f6f7d8914c78e93136ca
-title: Step 80
+title: Paso 80
 challengeType: 0
 dashedName: step-80
 ---
@@ -383,14 +383,14 @@ hr {
   .hero-title {
     font-size: 6rem;
   }
-  
+
   .hero-subtitle,
   .author,
   .quote,
   .list-title {
     font-size: 1.8rem;
   }
-  
+
   .social-icons {
     font-size: 2rem;
   }
@@ -755,14 +755,14 @@ hr {
   .hero-title {
     font-size: 6rem;
   }
-  
+
   .hero-subtitle,
   .author,
   .quote,
   .list-title {
     font-size: 1.8rem;
   }
-  
+
   .social-icons {
     font-size: 2rem;
   }
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614e0e503b110f76d3ac2ff6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614e0e503b110f76d3ac2ff6.md
index 9ab32041475..5bf18489ed3 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614e0e503b110f76d3ac2ff6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614e0e503b110f76d3ac2ff6.md
@@ -1,6 +1,6 @@
 ---
 id: 614e0e503b110f76d3ac2ff6
-title: Step 43
+title: Paso 43
 challengeType: 0
 dashedName: step-43
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614e0e588f0e8a772a8a81a6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614e0e588f0e8a772a8a81a6.md
index f9fd23824b8..64f270c49fb 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614e0e588f0e8a772a8a81a6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614e0e588f0e8a772a8a81a6.md
@@ -1,6 +1,6 @@
 ---
 id: 614e0e588f0e8a772a8a81a6
-title: Step 6
+title: Paso 6
 challengeType: 0
 dashedName: step-6
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6165d3b702a5d92ad970b30c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6165d3b702a5d92ad970b30c.md
index 8b701b945d0..1c03932407b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6165d3b702a5d92ad970b30c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6165d3b702a5d92ad970b30c.md
@@ -1,6 +1,6 @@
 ---
 id: 6165d3b702a5d92ad970b30c
-title: Step 5
+title: Paso 5
 challengeType: 0
 dashedName: step-5
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6169cd8a558aa8434e0ad7f6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6169cd8a558aa8434e0ad7f6.md
index 4b061e350ff..09462a84f12 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6169cd8a558aa8434e0ad7f6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6169cd8a558aa8434e0ad7f6.md
@@ -1,6 +1,6 @@
 ---
 id: 6169cd8a558aa8434e0ad7f6
-title: Step 8
+title: Paso 8
 challengeType: 0
 dashedName: step-8
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619665c9abd72906f3ad30f9.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619665c9abd72906f3ad30f9.md
index 4dca0168a6a..afa1dca6850 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619665c9abd72906f3ad30f9.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619665c9abd72906f3ad30f9.md
@@ -1,13 +1,13 @@
 ---
 id: 619665c9abd72906f3ad30f9
-title: Step 1
+title: Paso 1
 challengeType: 0
 dashedName: step-1
 ---
 
 # --description--
 
-You will be building a happy Flappy Penguin, and further exploring CSS transforms and animations in the process.
+Estarás construyendo un feliz pingüino Flappy y explorando aún más las transformaciones y animaciones CSS en el proceso.
 
 Begin with your basic HTML boilerplate. Include the `DOCTYPE` declaration, `html` element with a language set to English, the appropriate `meta` tags, a `head`, `body`, and `title` element. Also, link your stylesheet to the page.
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61967e74a8e3690ab6292daa.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61967e74a8e3690ab6292daa.md
index 9812e1b4bdd..8595958663d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61967e74a8e3690ab6292daa.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61967e74a8e3690ab6292daa.md
@@ -1,6 +1,6 @@
 ---
 id: 61967e74a8e3690ab6292daa
-title: Step 2
+title: Paso 2
 challengeType: 0
 dashedName: step-2
 ---
@@ -36,7 +36,7 @@ assert.include(['linear-gradient(45deg,rgb(118,201,255),rgb(247,255,222))', 'rgb
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968df2acd5550bf1616c34.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968df2acd5550bf1616c34.md
index e401d42eef2..a90cc75dff9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968df2acd5550bf1616c34.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968df2acd5550bf1616c34.md
@@ -1,6 +1,6 @@
 ---
 id: 61968df2acd5550bf1616c34
-title: Step 3
+title: Paso 3
 challengeType: 0
 dashedName: step-3
 ---
@@ -30,7 +30,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.padding, '0px');
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
@@ -47,7 +47,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.padding, '0px');
 --fcc-editable-region--
 body {
   background: linear-gradient(45deg, rgb(118, 201, 255), rgb(247, 255, 222));
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968e9243a4090cc805531c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968e9243a4090cc805531c.md
index 2c1d8594d5d..ba1ce29c77c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968e9243a4090cc805531c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968e9243a4090cc805531c.md
@@ -1,6 +1,6 @@
 ---
 id: 61968e9243a4090cc805531c
-title: Step 5
+title: Paso 5
 challengeType: 0
 dashedName: step-5
 ---
@@ -24,7 +24,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.overflow, 'clip')
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968f8877c6720d6d61aaf5.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968f8877c6720d6d61aaf5.md
index 051f3411d1b..60ef02f1a2a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968f8877c6720d6d61aaf5.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968f8877c6720d6d61aaf5.md
@@ -1,6 +1,6 @@
 ---
 id: 61968f8877c6720d6d61aaf5
-title: Step 6
+title: Paso 6
 challengeType: 0
 dashedName: step-6
 ---
@@ -36,7 +36,7 @@ assert.exists(document.querySelector('body > div.ground'));
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619691693bc14b0e528f5a20.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619691693bc14b0e528f5a20.md
index e5896cabe05..e9cb4766d67 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619691693bc14b0e528f5a20.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619691693bc14b0e528f5a20.md
@@ -1,6 +1,6 @@
 ---
 id: 619691693bc14b0e528f5a20
-title: Step 7
+title: Paso 7
 challengeType: 0
 dashedName: step-7
 ---
@@ -36,7 +36,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.ground')?.height, '400px
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196928658b6010f28c39484.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196928658b6010f28c39484.md
index 05b5c3fd7e1..d22de74cbdd 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196928658b6010f28c39484.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196928658b6010f28c39484.md
@@ -1,6 +1,6 @@
 ---
 id: 6196928658b6010f28c39484
-title: Step 8
+title: Paso 8
 challengeType: 0
 dashedName: step-8
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619692ff79f5770fc6d8c0b4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619692ff79f5770fc6d8c0b4.md
index 672d4bd665b..3a90555145a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619692ff79f5770fc6d8c0b4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619692ff79f5770fc6d8c0b4.md
@@ -1,6 +1,6 @@
 ---
 id: 619692ff79f5770fc6d8c0b4
-title: Step 10
+title: Paso 10
 challengeType: 0
 dashedName: step-10
 ---
@@ -36,7 +36,7 @@ assert.strictEqual(document.querySelector('.ground')?.previousElementSibling, do
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196990f966e8f10a40094f6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196990f966e8f10a40094f6.md
index 8fd7eb06e2f..02b7197b7bc 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196990f966e8f10a40094f6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196990f966e8f10a40094f6.md
@@ -1,6 +1,6 @@
 ---
 id: 6196990f966e8f10a40094f6
-title: Step 11
+title: Paso 11
 challengeType: 0
 dashedName: step-11
 ---
@@ -36,7 +36,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.penguin')?.height, '300p
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619699c10a0f6e11591d73c4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619699c10a0f6e11591d73c4.md
index 81ba962fab2..c262123e71d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619699c10a0f6e11591d73c4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619699c10a0f6e11591d73c4.md
@@ -1,6 +1,6 @@
 ---
 id: 619699c10a0f6e11591d73c4
-title: Step 12
+title: Paso 12
 challengeType: 0
 dashedName: step-12
 ---
@@ -31,7 +31,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.penguin')?.marginTop, '7
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969aa6acef5b12200f672e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969aa6acef5b12200f672e.md
index 49499e43bbc..326829c25a7 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969aa6acef5b12200f672e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969aa6acef5b12200f672e.md
@@ -1,6 +1,6 @@
 ---
 id: 61969aa6acef5b12200f672e
-title: Step 13
+title: Paso 13
 challengeType: 0
 dashedName: step-13
 ---
@@ -38,7 +38,7 @@ assert.strictEqual(document.querySelector('.penguin')?.previousElementSibling, d
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969c487ced6f12db8fef94.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969c487ced6f12db8fef94.md
index d1dedc2cc7b..d6ee6c31fd0 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969c487ced6f12db8fef94.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969c487ced6f12db8fef94.md
@@ -1,6 +1,6 @@
 ---
 id: 61969c487ced6f12db8fef94
-title: Step 14
+title: Paso 14
 challengeType: 0
 dashedName: step-14
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969d66cfcdba137d021558.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969d66cfcdba137d021558.md
index 0ec1d402f55..505f1c0e55c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969d66cfcdba137d021558.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969d66cfcdba137d021558.md
@@ -1,6 +1,6 @@
 ---
 id: 61969d66cfcdba137d021558
-title: Step 15
+title: Paso 15
 challengeType: 0
 dashedName: step-15
 ---
@@ -24,7 +24,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.left-mountain')?.positio
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969e7451455614217e901b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969e7451455614217e901b.md
index 87fa0124137..a74913c549a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969e7451455614217e901b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969e7451455614217e901b.md
@@ -1,6 +1,6 @@
 ---
 id: 61969e7451455614217e901b
-title: Step 16
+title: Paso 16
 challengeType: 0
 dashedName: step-16
 ---
@@ -38,7 +38,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.left-mountain')?.getProp
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196adc17f77a714d51485f2.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196adc17f77a714d51485f2.md
index 95ffdc3f9af..248e2751fdb 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196adc17f77a714d51485f2.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196adc17f77a714d51485f2.md
@@ -1,6 +1,6 @@
 ---
 id: 6196adc17f77a714d51485f2
-title: Step 17
+title: Paso 17
 challengeType: 0
 dashedName: step-17
 ---
@@ -36,7 +36,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.ground')?.zIndex, '3');
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196aead7ac7bf1584b17a7f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196aead7ac7bf1584b17a7f.md
index 8a12e627d5c..1bec58e6178 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196aead7ac7bf1584b17a7f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196aead7ac7bf1584b17a7f.md
@@ -1,6 +1,6 @@
 ---
 id: 6196aead7ac7bf1584b17a7f
-title: Step 18
+title: Paso 18
 challengeType: 0
 dashedName: step-18
 ---
@@ -30,7 +30,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.ground')?.marginTop, '-5
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
@@ -80,7 +80,7 @@ body {
   background: linear-gradient(90deg, rgb(88, 175, 236), rgb(182, 255, 255));
   z-index: 3;
   position: absolute;
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196ce0415498d2463989e84.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196ce0415498d2463989e84.md
index 432db5ff592..742a77c40b4 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196ce0415498d2463989e84.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196ce0415498d2463989e84.md
@@ -1,6 +1,6 @@
 ---
 id: 6196ce0415498d2463989e84
-title: Step 19
+title: Paso 19
 challengeType: 0
 dashedName: step-19
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196cee94c6da1253809dff9.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196cee94c6da1253809dff9.md
index 44902852d0e..ebe941a2ad9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196cee94c6da1253809dff9.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196cee94c6da1253809dff9.md
@@ -1,6 +1,6 @@
 ---
 id: 6196cee94c6da1253809dff9
-title: Step 20
+title: Paso 20
 challengeType: 0
 dashedName: step-20
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d00a5d7292262bc02f4c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d00a5d7292262bc02f4c.md
index 7bda36be539..b0b8d1809b5 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d00a5d7292262bc02f4c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d00a5d7292262bc02f4c.md
@@ -1,6 +1,6 @@
 ---
 id: 6196d00a5d7292262bc02f4c
-title: Step 21
+title: Paso 21
 challengeType: 0
 dashedName: step-21
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d0cda039d026f7f78d1e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d0cda039d026f7f78d1e.md
index 4d1e271a017..b9519673aab 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d0cda039d026f7f78d1e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d0cda039d026f7f78d1e.md
@@ -1,6 +1,6 @@
 ---
 id: 6196d0cda039d026f7f78d1e
-title: Step 22
+title: Paso 22
 challengeType: 0
 dashedName: step-22
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d1ac33c68d27dcda5796.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d1ac33c68d27dcda5796.md
index 09794d340aa..94203b71349 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d1ac33c68d27dcda5796.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d1ac33c68d27dcda5796.md
@@ -1,6 +1,6 @@
 ---
 id: 6196d1ac33c68d27dcda5796
-title: Step 23
+title: Paso 23
 challengeType: 0
 dashedName: step-23
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d213d99f16287bff22ae.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d213d99f16287bff22ae.md
index 1189f3ef131..0fb2652bcd1 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d213d99f16287bff22ae.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d213d99f16287bff22ae.md
@@ -1,6 +1,6 @@
 ---
 id: 6196d213d99f16287bff22ae
-title: Step 24
+title: Paso 24
 challengeType: 0
 dashedName: step-24
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d2c0f22ca0293107c048.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d2c0f22ca0293107c048.md
index eb97f4d10b0..1815cc5522b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d2c0f22ca0293107c048.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d2c0f22ca0293107c048.md
@@ -1,6 +1,6 @@
 ---
 id: 6196d2c0f22ca0293107c048
-title: Step 25
+title: Paso 25
 challengeType: 0
 dashedName: step-25
 ---
@@ -91,7 +91,7 @@ body {
 }
 
 --fcc-editable-region--
-    
+
 --fcc-editable-region--
 
 .penguin {
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d32d1340d829f0f6f57d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d32d1340d829f0f6f57d.md
index 0c0d1ca0306..ad84d275c83 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d32d1340d829f0f6f57d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d32d1340d829f0f6f57d.md
@@ -1,6 +1,6 @@
 ---
 id: 6196d32d1340d829f0f6f57d
-title: Step 26
+title: Paso 26
 challengeType: 0
 dashedName: step-26
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d41d40bf9b2aaea5d520.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d41d40bf9b2aaea5d520.md
index 60778c2811c..f0789a6873a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d41d40bf9b2aaea5d520.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d41d40bf9b2aaea5d520.md
@@ -1,6 +1,6 @@
 ---
 id: 6196d41d40bf9b2aaea5d520
-title: Step 27
+title: Paso 27
 challengeType: 0
 dashedName: step-27
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197cff995d03905b0cca8ad.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197cff995d03905b0cca8ad.md
index ea00c654008..c7bd03d2f70 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197cff995d03905b0cca8ad.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197cff995d03905b0cca8ad.md
@@ -1,6 +1,6 @@
 ---
 id: 6197cff995d03905b0cca8ad
-title: Step 28
+title: Paso 28
 challengeType: 0
 dashedName: step-28
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197f40a16afea068c7e60c8.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197f40a16afea068c7e60c8.md
index a40396e2525..7cdad83af9e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197f40a16afea068c7e60c8.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197f40a16afea068c7e60c8.md
@@ -1,6 +1,6 @@
 ---
 id: 6197f40a16afea068c7e60c8
-title: Step 29
+title: Paso 29
 challengeType: 0
 dashedName: step-29
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197f667297bb30a552ce017.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197f667297bb30a552ce017.md
index 1bf1ae8a6f0..9500a462578 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197f667297bb30a552ce017.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197f667297bb30a552ce017.md
@@ -1,6 +1,6 @@
 ---
 id: 6197f667297bb30a552ce017
-title: Step 9
+title: Paso 9
 challengeType: 0
 dashedName: step-9
 ---
@@ -30,7 +30,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.ground')?.position, 'abs
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993b72e874e709b8dfd666.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993b72e874e709b8dfd666.md
index de3c23b739e..0a385bb34ff 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993b72e874e709b8dfd666.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993b72e874e709b8dfd666.md
@@ -1,6 +1,6 @@
 ---
 id: 61993b72e874e709b8dfd666
-title: Step 30
+title: Paso 30
 challengeType: 0
 dashedName: step-30
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993cf26a8e0f0a553db223.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993cf26a8e0f0a553db223.md
index 0e09016059a..ecbc01c82db 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993cf26a8e0f0a553db223.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993cf26a8e0f0a553db223.md
@@ -1,6 +1,6 @@
 ---
 id: 61993cf26a8e0f0a553db223
-title: Step 31
+title: Paso 31
 challengeType: 0
 dashedName: step-31
 ---
@@ -107,7 +107,7 @@ body {
     gray,
     rgb(239, 240, 228)
   );
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993dbb35adf30b10d49e38.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993dbb35adf30b10d49e38.md
index 3bdf0c05374..96a7a7ceb2b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993dbb35adf30b10d49e38.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993dbb35adf30b10d49e38.md
@@ -1,6 +1,6 @@
 ---
 id: 61993dbb35adf30b10d49e38
-title: Step 32
+title: Paso 32
 challengeType: 0
 dashedName: step-32
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993e9adc9e9a0bb4d28fff.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993e9adc9e9a0bb4d28fff.md
index ace7e6a521f..ea171a1091d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993e9adc9e9a0bb4d28fff.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993e9adc9e9a0bb4d28fff.md
@@ -1,6 +1,6 @@
 ---
 id: 61993e9adc9e9a0bb4d28fff
-title: Step 33
+title: Paso 33
 challengeType: 0
 dashedName: step-33
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199409834ccaf0d10736596.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199409834ccaf0d10736596.md
index 8c2d7f69749..e56d79c53f0 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199409834ccaf0d10736596.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199409834ccaf0d10736596.md
@@ -1,6 +1,6 @@
 ---
 id: 6199409834ccaf0d10736596
-title: Step 34
+title: Paso 34
 challengeType: 0
 dashedName: step-34
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199429802b7c10dc79ff871.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199429802b7c10dc79ff871.md
index 033f57b0fac..73f0ca51f84 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199429802b7c10dc79ff871.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199429802b7c10dc79ff871.md
@@ -1,6 +1,6 @@
 ---
 id: 6199429802b7c10dc79ff871
-title: Step 35
+title: Paso 35
 challengeType: 0
 dashedName: step-35
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619943285a41720e6370d985.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619943285a41720e6370d985.md
index 2885245f1e4..674c78299e6 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619943285a41720e6370d985.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619943285a41720e6370d985.md
@@ -1,6 +1,6 @@
 ---
 id: 619943285a41720e6370d985
-title: Step 36
+title: Paso 36
 challengeType: 0
 dashedName: step-36
 ---
@@ -141,7 +141,7 @@ body {
     white 67%
   );
   border-radius: 80% 80% 100% 100%;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619943876b706d0f35c01dbc.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619943876b706d0f35c01dbc.md
index cc70348de32..2a5fffb11da 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619943876b706d0f35c01dbc.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619943876b706d0f35c01dbc.md
@@ -1,6 +1,6 @@
 ---
 id: 619943876b706d0f35c01dbc
-title: Step 37
+title: Paso 37
 challengeType: 0
 dashedName: step-37
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199442866286d0ff421a4fc.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199442866286d0ff421a4fc.md
index 393425cd50b..28781803ca7 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199442866286d0ff421a4fc.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199442866286d0ff421a4fc.md
@@ -1,6 +1,6 @@
 ---
 id: 6199442866286d0ff421a4fc
-title: Step 38
+title: Paso 38
 challengeType: 0
 dashedName: step-38
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be73b3c806006ccc00bb0.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be73b3c806006ccc00bb0.md
index ecd856e1572..06ef45484b8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be73b3c806006ccc00bb0.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be73b3c806006ccc00bb0.md
@@ -1,6 +1,6 @@
 ---
 id: 619be73b3c806006ccc00bb0
-title: Step 40
+title: Paso 40
 challengeType: 0
 dashedName: step-40
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be7af7b0bf60770f5d2a4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be7af7b0bf60770f5d2a4.md
index 31c1bab65a3..1139c8bf55a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be7af7b0bf60770f5d2a4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be7af7b0bf60770f5d2a4.md
@@ -1,6 +1,6 @@
 ---
 id: 619be7af7b0bf60770f5d2a4
-title: Step 41
+title: Paso 41
 challengeType: 0
 dashedName: step-41
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be80062551a080e32c821.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be80062551a080e32c821.md
index 018ff948bf5..33d9566451c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be80062551a080e32c821.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be80062551a080e32c821.md
@@ -1,6 +1,6 @@
 ---
 id: 619be80062551a080e32c821
-title: Step 42
+title: Paso 42
 challengeType: 0
 dashedName: step-42
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be8ce4ea49008c5bfbc30.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be8ce4ea49008c5bfbc30.md
index 3f2e93ba9b4..8c531a7c57d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be8ce4ea49008c5bfbc30.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be8ce4ea49008c5bfbc30.md
@@ -1,6 +1,6 @@
 ---
 id: 619be8ce4ea49008c5bfbc30
-title: Step 43
+title: Paso 43
 challengeType: 0
 dashedName: step-43
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be946958c6009844f1dee.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be946958c6009844f1dee.md
index 3650ed68e42..0919a025ad8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be946958c6009844f1dee.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be946958c6009844f1dee.md
@@ -1,6 +1,6 @@
 ---
 id: 619be946958c6009844f1dee
-title: Step 44
+title: Paso 44
 challengeType: 0
 dashedName: step-44
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619c155df0063a0a3fec0e32.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619c155df0063a0a3fec0e32.md
index 88156f2b9dc..bee0d901ba5 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619c155df0063a0a3fec0e32.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619c155df0063a0a3fec0e32.md
@@ -1,6 +1,6 @@
 ---
 id: 619c155df0063a0a3fec0e32
-title: Step 45
+title: Paso 45
 challengeType: 0
 dashedName: step-45
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619c16debd0c270b01c5ce38.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619c16debd0c270b01c5ce38.md
index 52882871a63..aff485cb0c6 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619c16debd0c270b01c5ce38.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619c16debd0c270b01c5ce38.md
@@ -1,6 +1,6 @@
 ---
 id: 619c16debd0c270b01c5ce38
-title: Step 46
+title: Paso 46
 challengeType: 0
 dashedName: step-46
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619cfdf2e63ddf05feab86ad.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619cfdf2e63ddf05feab86ad.md
index 2059f320cda..3364da02267 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619cfdf2e63ddf05feab86ad.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619cfdf2e63ddf05feab86ad.md
@@ -1,6 +1,6 @@
 ---
 id: 619cfdf2e63ddf05feab86ad
-title: Step 47
+title: Paso 47
 challengeType: 0
 dashedName: step-47
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d019488f98c06acbbb71a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d019488f98c06acbbb71a.md
index a19064b3067..fe7cbf1bc15 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d019488f98c06acbbb71a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d019488f98c06acbbb71a.md
@@ -1,6 +1,6 @@
 ---
 id: 619d019488f98c06acbbb71a
-title: Step 48
+title: Paso 48
 challengeType: 0
 dashedName: step-48
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d022dc8400c0763829a17.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d022dc8400c0763829a17.md
index 5a68b9e88d3..0df89cc266b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d022dc8400c0763829a17.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d022dc8400c0763829a17.md
@@ -1,6 +1,6 @@
 ---
 id: 619d022dc8400c0763829a17
-title: Step 49
+title: Paso 49
 challengeType: 0
 dashedName: step-49
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d02c7bc95bf0827a5d296.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d02c7bc95bf0827a5d296.md
index db36b467cd4..0b61d89b1fe 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d02c7bc95bf0827a5d296.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d02c7bc95bf0827a5d296.md
@@ -1,6 +1,6 @@
 ---
 id: 619d02c7bc95bf0827a5d296
-title: Step 50
+title: Paso 50
 challengeType: 0
 dashedName: step-50
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d033915012509031f309a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d033915012509031f309a.md
index dd8bb15bbee..d4f374e1115 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d033915012509031f309a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d033915012509031f309a.md
@@ -1,6 +1,6 @@
 ---
 id: 619d033915012509031f309a
-title: Step 51
+title: Paso 51
 challengeType: 0
 dashedName: step-51
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d03dadadb6509a16f4f5f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d03dadadb6509a16f4f5f.md
index f375026932a..87a628e907b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d03dadadb6509a16f4f5f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d03dadadb6509a16f4f5f.md
@@ -1,6 +1,6 @@
 ---
 id: 619d03dadadb6509a16f4f5f
-title: Step 52
+title: Paso 52
 challengeType: 0
 dashedName: step-52
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0503e03a790a4179d463.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0503e03a790a4179d463.md
index 538ae5b900d..e1a89f70f9d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0503e03a790a4179d463.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0503e03a790a4179d463.md
@@ -1,6 +1,6 @@
 ---
 id: 619d0503e03a790a4179d463
-title: Step 53
+title: Paso 53
 challengeType: 0
 dashedName: step-53
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d05c54dabca0b10058235.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d05c54dabca0b10058235.md
index f24504c7d5d..21b8d395e8f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d05c54dabca0b10058235.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d05c54dabca0b10058235.md
@@ -1,6 +1,6 @@
 ---
 id: 619d05c54dabca0b10058235
-title: Step 54
+title: Paso 54
 challengeType: 0
 dashedName: step-54
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0882f54bf40bdc4671ed.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0882f54bf40bdc4671ed.md
index 6e3269089e5..c02940f2cd5 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0882f54bf40bdc4671ed.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0882f54bf40bdc4671ed.md
@@ -1,6 +1,6 @@
 ---
 id: 619d0882f54bf40bdc4671ed
-title: Step 55
+title: Paso 55
 challengeType: 0
 dashedName: step-55
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d090cd8d6db0c93dc5087.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d090cd8d6db0c93dc5087.md
index 9c78f74e37e..1bf4bfdcae7 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d090cd8d6db0c93dc5087.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d090cd8d6db0c93dc5087.md
@@ -1,6 +1,6 @@
 ---
 id: 619d090cd8d6db0c93dc5087
-title: Step 56
+title: Paso 56
 challengeType: 0
 dashedName: step-56
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0b51ca42ed0d74582186.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0b51ca42ed0d74582186.md
index 9a34e11ba50..ae991538c5f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0b51ca42ed0d74582186.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0b51ca42ed0d74582186.md
@@ -1,6 +1,6 @@
 ---
 id: 619d0b51ca42ed0d74582186
-title: Step 57
+title: Paso 57
 challengeType: 0
 dashedName: step-57
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0bc9cb05360e1bf549c3.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0bc9cb05360e1bf549c3.md
index 6f72a364916..c42fcb0b861 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0bc9cb05360e1bf549c3.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0bc9cb05360e1bf549c3.md
@@ -1,6 +1,6 @@
 ---
 id: 619d0bc9cb05360e1bf549c3
-title: Step 58
+title: Paso 58
 challengeType: 0
 dashedName: step-58
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0c1594c38c0ebae75878.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0c1594c38c0ebae75878.md
index 00fce3bac39..03dd98e38fa 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0c1594c38c0ebae75878.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0c1594c38c0ebae75878.md
@@ -1,6 +1,6 @@
 ---
 id: 619d0c1594c38c0ebae75878
-title: Step 59
+title: Paso 59
 challengeType: 0
 dashedName: step-59
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0d18ca99870f884a7bff.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0d18ca99870f884a7bff.md
index c4246b6bc5a..f5670325aa5 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0d18ca99870f884a7bff.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0d18ca99870f884a7bff.md
@@ -1,6 +1,6 @@
 ---
 id: 619d0d18ca99870f884a7bff
-title: Step 60
+title: Paso 60
 challengeType: 0
 dashedName: step-60
 ---
@@ -63,7 +63,7 @@ assert.exists(document.querySelector('.eye.right > div.eye-lid'));
 
         </div>
         <div class="eye right">
-          
+
         </div>
       </div>
 --fcc-editable-region--
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0daf214542102739b0da.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0daf214542102739b0da.md
index 98f0c969be6..0c994913db6 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0daf214542102739b0da.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0daf214542102739b0da.md
@@ -1,6 +1,6 @@
 ---
 id: 619d0daf214542102739b0da
-title: Step 61
+title: Paso 61
 challengeType: 0
 dashedName: step-61
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0e56f9ca9710fcb974e3.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0e56f9ca9710fcb974e3.md
index 55a4986c3f4..7b449d475dd 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0e56f9ca9710fcb974e3.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0e56f9ca9710fcb974e3.md
@@ -1,6 +1,6 @@
 ---
 id: 619d0e56f9ca9710fcb974e3
-title: Step 62
+title: Paso 62
 challengeType: 0
 dashedName: step-62
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0eec0ac40611b41e2ccc.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0eec0ac40611b41e2ccc.md
index ab18d6b7b27..9bf963fbfd6 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0eec0ac40611b41e2ccc.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0eec0ac40611b41e2ccc.md
@@ -1,6 +1,6 @@
 ---
 id: 619d0eec0ac40611b41e2ccc
-title: Step 63
+title: Paso 63
 challengeType: 0
 dashedName: step-63
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0fc9825c271253df28d4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0fc9825c271253df28d4.md
index e20794d7cc2..17a31281cf8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0fc9825c271253df28d4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0fc9825c271253df28d4.md
@@ -1,6 +1,6 @@
 ---
 id: 619d0fc9825c271253df28d4
-title: Step 64
+title: Paso 64
 challengeType: 0
 dashedName: step-64
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d102d786c3d13124c37c6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d102d786c3d13124c37c6.md
index fceedab5837..330a5086227 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d102d786c3d13124c37c6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d102d786c3d13124c37c6.md
@@ -1,6 +1,6 @@
 ---
 id: 619d102d786c3d13124c37c6
-title: Step 65
+title: Paso 65
 challengeType: 0
 dashedName: step-65
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d107edf7ddf13cc77106a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d107edf7ddf13cc77106a.md
index 3f87fe671ab..462ae1620b3 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d107edf7ddf13cc77106a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d107edf7ddf13cc77106a.md
@@ -1,6 +1,6 @@
 ---
 id: 619d107edf7ddf13cc77106a
-title: Step 66
+title: Paso 66
 challengeType: 0
 dashedName: step-66
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d10cc98145f14820399c5.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d10cc98145f14820399c5.md
index 1d3c79dd123..daed6a61d9d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d10cc98145f14820399c5.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d10cc98145f14820399c5.md
@@ -1,6 +1,6 @@
 ---
 id: 619d10cc98145f14820399c5
-title: Step 67
+title: Paso 67
 challengeType: 0
 dashedName: step-67
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d115e2adcd71538e82ebb.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d115e2adcd71538e82ebb.md
index f17baca2873..19feb4b89e4 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d115e2adcd71538e82ebb.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d115e2adcd71538e82ebb.md
@@ -1,6 +1,6 @@
 ---
 id: 619d115e2adcd71538e82ebb
-title: Step 68
+title: Paso 68
 challengeType: 0
 dashedName: step-68
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d11e6d5ef9515d2a16033.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d11e6d5ef9515d2a16033.md
index 2ad23a1eb32..8596b355f38 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d11e6d5ef9515d2a16033.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d11e6d5ef9515d2a16033.md
@@ -1,6 +1,6 @@
 ---
 id: 619d11e6d5ef9515d2a16033
-title: Step 69
+title: Paso 69
 challengeType: 0
 dashedName: step-69
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d129a417d0716a94de913.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d129a417d0716a94de913.md
index ebcf7969f95..0ff873c4345 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d129a417d0716a94de913.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d129a417d0716a94de913.md
@@ -1,6 +1,6 @@
 ---
 id: 619d129a417d0716a94de913
-title: Step 70
+title: Paso 70
 challengeType: 0
 dashedName: step-70
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1340361095175f4b5115.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1340361095175f4b5115.md
index 2cce37d722e..74aab1e8213 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1340361095175f4b5115.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1340361095175f4b5115.md
@@ -1,6 +1,6 @@
 ---
 id: 619d1340361095175f4b5115
-title: Step 71
+title: Paso 71
 challengeType: 0
 dashedName: step-71
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d15797b580c1828b05426.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d15797b580c1828b05426.md
index 604b770fabd..56c38819667 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d15797b580c1828b05426.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d15797b580c1828b05426.md
@@ -1,6 +1,6 @@
 ---
 id: 619d15797b580c1828b05426
-title: Step 72
+title: Paso 72
 challengeType: 0
 dashedName: step-72
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d15d955d9d418c4487bbc.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d15d955d9d418c4487bbc.md
index 2ba7d8fed23..984b543fe95 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d15d955d9d418c4487bbc.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d15d955d9d418c4487bbc.md
@@ -1,6 +1,6 @@
 ---
 id: 619d15d955d9d418c4487bbc
-title: Step 73
+title: Paso 73
 challengeType: 0
 dashedName: step-73
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1629a8adc61960ca8b40.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1629a8adc61960ca8b40.md
index e5c9b1d8122..63214ccdc9a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1629a8adc61960ca8b40.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1629a8adc61960ca8b40.md
@@ -1,6 +1,6 @@
 ---
 id: 619d1629a8adc61960ca8b40
-title: Step 74
+title: Paso 74
 challengeType: 0
 dashedName: step-74
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1c5fc9f8941a400955da.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1c5fc9f8941a400955da.md
index d9113a4e226..6ce13dde1d3 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1c5fc9f8941a400955da.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1c5fc9f8941a400955da.md
@@ -1,6 +1,6 @@
 ---
 id: 619d1c5fc9f8941a400955da
-title: Step 75
+title: Paso 75
 challengeType: 0
 dashedName: step-75
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1dab9ff3421ae1976991.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1dab9ff3421ae1976991.md
index 3aca16ece5a..7c5f34cc587 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1dab9ff3421ae1976991.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1dab9ff3421ae1976991.md
@@ -1,6 +1,6 @@
 ---
 id: 619d1dab9ff3421ae1976991
-title: Step 76
+title: Paso 76
 challengeType: 0
 dashedName: step-76
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1deb8b04811b8839ffe4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1deb8b04811b8839ffe4.md
index fedfdba5a3e..4de5772e647 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1deb8b04811b8839ffe4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1deb8b04811b8839ffe4.md
@@ -1,6 +1,6 @@
 ---
 id: 619d1deb8b04811b8839ffe4
-title: Step 77
+title: Paso 77
 challengeType: 0
 dashedName: step-77
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1e7a8e81a61c5a819dc4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1e7a8e81a61c5a819dc4.md
index 845290eeb7a..398fbdd4c9e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1e7a8e81a61c5a819dc4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1e7a8e81a61c5a819dc4.md
@@ -1,6 +1,6 @@
 ---
 id: 619d1e7a8e81a61c5a819dc4
-title: Step 78
+title: Paso 78
 challengeType: 0
 dashedName: step-78
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1ed33c9a071cf657a0d6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1ed33c9a071cf657a0d6.md
index adfd82c7324..03bd0b27a8e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1ed33c9a071cf657a0d6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1ed33c9a071cf657a0d6.md
@@ -1,6 +1,6 @@
 ---
 id: 619d1ed33c9a071cf657a0d6
-title: Step 79
+title: Paso 79
 challengeType: 0
 dashedName: step-79
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1fb5d244c31db8a7fdb7.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1fb5d244c31db8a7fdb7.md
index dcaecb2f7e9..65ec92a4888 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1fb5d244c31db8a7fdb7.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1fb5d244c31db8a7fdb7.md
@@ -1,6 +1,6 @@
 ---
 id: 619d1fb5d244c31db8a7fdb7
-title: Step 80
+title: Paso 80
 challengeType: 0
 dashedName: step-80
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d204bd73ae51e743b8e94.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d204bd73ae51e743b8e94.md
index 12dfd6b819c..d630e4cb587 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d204bd73ae51e743b8e94.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d204bd73ae51e743b8e94.md
@@ -1,6 +1,6 @@
 ---
 id: 619d204bd73ae51e743b8e94
-title: Step 81
+title: Paso 81
 challengeType: 0
 dashedName: step-81
 ---
@@ -273,7 +273,7 @@ body {
   width:  15%;
   height: 30%;
   background-color: orange;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d20b12996101f430920fb.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d20b12996101f430920fb.md
index e17e69cbf1e..44d9469c8ad 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d20b12996101f430920fb.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d20b12996101f430920fb.md
@@ -1,6 +1,6 @@
 ---
 id: 619d20b12996101f430920fb
-title: Step 82
+title: Paso 82
 challengeType: 0
 dashedName: step-82
 ---
@@ -90,7 +90,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.foot')?.getPropVal('back
 --fcc-editable-region--
 :root {
   --penguin-face: white;
-  
+
 }
 
 body {
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d21fe6a3f9b2016be9d9d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d21fe6a3f9b2016be9d9d.md
index f8aacfd20a4..6ade62a3b57 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d21fe6a3f9b2016be9d9d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d21fe6a3f9b2016be9d9d.md
@@ -1,6 +1,6 @@
 ---
 id: 619d21fe6a3f9b2016be9d9d
-title: Step 83
+title: Paso 83
 challengeType: 0
 dashedName: step-83
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d229b0e542520cd91c685.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d229b0e542520cd91c685.md
index 57cd259e1ed..caee8a2c53a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d229b0e542520cd91c685.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d229b0e542520cd91c685.md
@@ -1,6 +1,6 @@
 ---
 id: 619d229b0e542520cd91c685
-title: Step 84
+title: Paso 84
 challengeType: 0
 dashedName: step-84
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d23089e787e216a7043d6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d23089e787e216a7043d6.md
index eafce1fd17a..5b869554c64 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d23089e787e216a7043d6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d23089e787e216a7043d6.md
@@ -1,6 +1,6 @@
 ---
 id: 619d23089e787e216a7043d6
-title: Step 85
+title: Paso 85
 challengeType: 0
 dashedName: step-85
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d237a107c10221ed743fa.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d237a107c10221ed743fa.md
index f00af96ee32..de4e2b2dcc7 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d237a107c10221ed743fa.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d237a107c10221ed743fa.md
@@ -1,6 +1,6 @@
 ---
 id: 619d237a107c10221ed743fa
-title: Step 86
+title: Paso 86
 challengeType: 0
 dashedName: step-86
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d26b12e651022d80cd017.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d26b12e651022d80cd017.md
index 35a067ba4d4..2ab035bd715 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d26b12e651022d80cd017.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d26b12e651022d80cd017.md
@@ -1,6 +1,6 @@
 ---
 id: 619d26b12e651022d80cd017
-title: Step 87
+title: Paso 87
 challengeType: 0
 dashedName: step-87
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2712853306238f41828e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2712853306238f41828e.md
index 6acbf4fb438..2d56b21e292 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2712853306238f41828e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2712853306238f41828e.md
@@ -1,6 +1,6 @@
 ---
 id: 619d2712853306238f41828e
-title: Step 88
+title: Paso 88
 challengeType: 0
 dashedName: step-88
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2b7a84e78b246f2d17a2.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2b7a84e78b246f2d17a2.md
index 195767a154e..f11881d394c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2b7a84e78b246f2d17a2.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2b7a84e78b246f2d17a2.md
@@ -1,6 +1,6 @@
 ---
 id: 619d2b7a84e78b246f2d17a2
-title: Step 89
+title: Paso 89
 challengeType: 0
 dashedName: step-89
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2bd9c1d43c2526e96f1f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2bd9c1d43c2526e96f1f.md
index 0c173bdabbc..e47db8988b4 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2bd9c1d43c2526e96f1f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2bd9c1d43c2526e96f1f.md
@@ -1,6 +1,6 @@
 ---
 id: 619d2bd9c1d43c2526e96f1f
-title: Step 90
+title: Paso 90
 challengeType: 0
 dashedName: step-90
 ---
@@ -286,7 +286,7 @@ body {
 .arm.left {
   top: 35%;
   left: 5%;
-  
+
 }
 
 .arm.right {
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2d4e80400325ff89664a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2d4e80400325ff89664a.md
index a8312184351..be58aea7e98 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2d4e80400325ff89664a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2d4e80400325ff89664a.md
@@ -1,6 +1,6 @@
 ---
 id: 619d2d4e80400325ff89664a
-title: Step 91
+title: Paso 91
 challengeType: 0
 dashedName: step-91
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2ebc81ba81271460850d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2ebc81ba81271460850d.md
index a505cbe7fad..928f9cf41fc 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2ebc81ba81271460850d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2ebc81ba81271460850d.md
@@ -1,6 +1,6 @@
 ---
 id: 619d2ebc81ba81271460850d
-title: Step 92
+title: Paso 92
 challengeType: 0
 dashedName: step-92
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2f0e9440bc27caee1cec.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2f0e9440bc27caee1cec.md
index cb7d052a130..49cc8cde60a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2f0e9440bc27caee1cec.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2f0e9440bc27caee1cec.md
@@ -1,6 +1,6 @@
 ---
 id: 619d2f0e9440bc27caee1cec
-title: Step 93
+title: Paso 93
 challengeType: 0
 dashedName: step-93
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2fd3ff4f772882e3d998.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2fd3ff4f772882e3d998.md
index f2a41bcf9f1..111442bdce2 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2fd3ff4f772882e3d998.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2fd3ff4f772882e3d998.md
@@ -1,6 +1,6 @@
 ---
 id: 619d2fd3ff4f772882e3d998
-title: Step 94
+title: Paso 94
 challengeType: 0
 dashedName: step-94
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d30350883802921bfcccc.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d30350883802921bfcccc.md
index 26646923045..d759df2e3d2 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d30350883802921bfcccc.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d30350883802921bfcccc.md
@@ -1,6 +1,6 @@
 ---
 id: 619d30350883802921bfcccc
-title: Step 95
+title: Paso 95
 challengeType: 0
 dashedName: step-95
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md
index 196d8ca49de..13c373113b9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md
@@ -1,6 +1,6 @@
 ---
 id: 619d324f5915c929f36ae91d
-title: Step 96
+title: Paso 96
 challengeType: 0
 dashedName: step-96
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d32c7fa21f32aaa91d499.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d32c7fa21f32aaa91d499.md
index 882b72e8de8..307bcf67d10 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d32c7fa21f32aaa91d499.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d32c7fa21f32aaa91d499.md
@@ -1,6 +1,6 @@
 ---
 id: 619d32c7fa21f32aaa91d499
-title: Step 97
+title: Paso 97
 challengeType: 0
 dashedName: step-97
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d333b738e3c2b5d58b095.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d333b738e3c2b5d58b095.md
index 73a2ed37e49..d0eb05e8e68 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d333b738e3c2b5d58b095.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d333b738e3c2b5d58b095.md
@@ -1,6 +1,6 @@
 ---
 id: 619d333b738e3c2b5d58b095
-title: Step 98
+title: Paso 98
 challengeType: 0
 dashedName: step-98
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d337765b9f02c10e93722.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d337765b9f02c10e93722.md
index a23611954b9..3804393ac6a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d337765b9f02c10e93722.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d337765b9f02c10e93722.md
@@ -1,6 +1,6 @@
 ---
 id: 619d337765b9f02c10e93722
-title: Step 99
+title: Paso 99
 challengeType: 0
 dashedName: step-99
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d33c51140292cc5a21742.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d33c51140292cc5a21742.md
index 1e1d1b853b1..8dd417dcb92 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d33c51140292cc5a21742.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d33c51140292cc5a21742.md
@@ -1,6 +1,6 @@
 ---
 id: 619d33c51140292cc5a21742
-title: Step 100
+title: Paso 100
 challengeType: 0
 dashedName: step-100
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3482f505452d861d0f62.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3482f505452d861d0f62.md
index 81d54d1bee5..3de8325c355 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3482f505452d861d0f62.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3482f505452d861d0f62.md
@@ -1,6 +1,6 @@
 ---
 id: 619d3482f505452d861d0f62
-title: Step 101
+title: Paso 101
 challengeType: 0
 dashedName: step-101
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3561a951bf2e41a24f10.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3561a951bf2e41a24f10.md
index 723220f0d88..4a01fe92f6b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3561a951bf2e41a24f10.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3561a951bf2e41a24f10.md
@@ -1,6 +1,6 @@
 ---
 id: 619d3561a951bf2e41a24f10
-title: Step 102
+title: Paso 102
 challengeType: 0
 dashedName: step-102
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d36103839c82efa95dd34.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d36103839c82efa95dd34.md
index d5401ee81ec..f907072860b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d36103839c82efa95dd34.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d36103839c82efa95dd34.md
@@ -1,6 +1,6 @@
 ---
 id: 619d36103839c82efa95dd34
-title: Step 103
+title: Paso 103
 challengeType: 0
 dashedName: step-103
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3711d04d623000013e9e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3711d04d623000013e9e.md
index 3c3dc0c6bf0..fdfb9956c37 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3711d04d623000013e9e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3711d04d623000013e9e.md
@@ -1,6 +1,6 @@
 ---
 id: 619d3711d04d623000013e9e
-title: Step 104
+title: Paso 104
 challengeType: 0
 dashedName: step-104
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61a8fe15a6a31306e60d1e89.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61a8fe15a6a31306e60d1e89.md
index 7d4ef4402ba..8c56940cf57 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61a8fe15a6a31306e60d1e89.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61a8fe15a6a31306e60d1e89.md
@@ -1,6 +1,6 @@
 ---
 id: 61a8fe15a6a31306e60d1e89
-title: Step 4
+title: Paso 4
 challengeType: 0
 dashedName: step-4
 ---
@@ -30,7 +30,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.height, '100vh');
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98cd.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98cd.md
index a3ee85de432..4e491b32435 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98cd.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98cd.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98cd
-title: Step 5
+title: Paso 5
 challengeType: 0
 dashedName: step-5
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ce.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ce.md
index b86013bb54c..f87b0df9e26 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ce.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ce.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98ce
-title: Step 6
+title: Paso 6
 challengeType: 0
 dashedName: step-6
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98cf.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98cf.md
index 45b83843303..7be8156ef7c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98cf.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98cf.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98cf
-title: Step 7
+title: Paso 7
 challengeType: 0
 dashedName: step-7
 ---
@@ -64,6 +64,6 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.overflow, 'hidden
 
 
 --fcc-editable-region--
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d0.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d0.md
index bf59b99385e..7a6742d172e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d0.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d0.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98d0
-title: Step 8
+title: Paso 8
 challengeType: 0
 dashedName: step-8
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d1.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d1.md
index 9e589da64da..97d07613dbf 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d1.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d1.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98d1
-title: Step 9
+title: Paso 9
 challengeType: 0
 dashedName: step-9
 ---
@@ -63,6 +63,6 @@ body {
 
 
 --fcc-editable-region--
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d2.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d2.md
index 39aae73d0cc..cdabeac1f27 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d2.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d2.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98d2
-title: Step 10
+title: Paso 10
 challengeType: 0
 dashedName: step-10
 ---
@@ -78,6 +78,6 @@ body {
   width: 100%;
   height: 100%;
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d3.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d3.md
index bf5c4b30f1f..e5059c1b24f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d3.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d3.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98d3
-title: Step 11
+title: Paso 11
 challengeType: 0
 dashedName: step-11
 ---
@@ -100,6 +100,6 @@ body {
   width: 10%;
   height: 70%;
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d4.md
index fcf15ddd14f..767d0b82819 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d4.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98d4
-title: Step 12
+title: Paso 12
 challengeType: 0
 dashedName: step-12
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d5.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d5.md
index c97b6c1c185..a4ed32cbdaa 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d5.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d5.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98d5
-title: Step 13
+title: Paso 13
 challengeType: 0
 dashedName: step-13
 ---
@@ -107,6 +107,6 @@ body {
   width: 100%;
   height: 70%;
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d6.md
index 666ecaffb1d..a4bdde5e327 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d6.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98d6
-title: Step 14
+title: Paso 14
 challengeType: 0
 dashedName: step-14
 ---
@@ -99,5 +99,5 @@ body {
   width: 100%;
   height: 70%;
 }
-    
+
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d7.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d7.md
index b993c80f852..d3257185fb0 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d7.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d7.md
@@ -1,13 +1,13 @@
 ---
 id: 5d822fd413a79914d39e98d7
-title: Step 15
+title: Paso 15
 challengeType: 0
 dashedName: step-15
 ---
 
 # --description--
 
-To use a variable, put the variable name in parentheses with `var` in front of them like this: `var(--variable-name)`. Whatever value you gave the variable will be applied to whatever property you use it on. 
+To use a variable, put the variable name in parentheses with `var` in front of them like this: `var(--variable-name)`. Whatever value you gave the variable will be applied to whatever property you use it on.
 
 Add the variable `--building-color1` you created in the previous step as the value of the `background-color` property of the `.bb1a` class.
 
@@ -96,5 +96,5 @@ body {
   width: 100%;
   height: 70%;
 }
-    
+
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d8.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d8.md
index ac248954dae..0f3d1776de1 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d8.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d8.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98d8
-title: Step 16
+title: Paso 16
 challengeType: 0
 dashedName: step-16
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d9.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d9.md
index aa956d7889c..9b8dce4d849 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d9.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d9.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98d9
-title: Step 17
+title: Paso 17
 challengeType: 0
 dashedName: step-17
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98da.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98da.md
index 2bdce33b6e4..b446efa4bda 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98da.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98da.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98da
-title: Step 18
+title: Paso 18
 challengeType: 0
 dashedName: step-18
 ---
@@ -128,6 +128,6 @@ body {
   height: 70%;
   background-color: var(--building-color1);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98db.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98db.md
index 242d5d9098d..d4c00b5a44f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98db.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98db.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98db
-title: Step 19
+title: Paso 19
 challengeType: 0
 dashedName: step-19
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98dc.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98dc.md
index 77305c578ea..850cc8f9c30 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98dc.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98dc.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98dc
-title: Step 20
+title: Paso 20
 challengeType: 0
 dashedName: step-20
 ---
@@ -122,6 +122,6 @@ body {
   width: 11%;
   height: 58%;
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98dd.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98dd.md
index ffbc76b0b1c..3cbb65cf4bc 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98dd.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98dd.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98dd
-title: Step 21
+title: Paso 21
 challengeType: 0
 dashedName: step-21
 ---
@@ -137,6 +137,6 @@ body {
   width: 11%;
   height: 58%;
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98de.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98de.md
index 63a0d7177a1..737ee4206b4 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98de.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98de.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98de
-title: Step 22
+title: Paso 22
 challengeType: 0
 dashedName: step-22
 ---
@@ -136,5 +136,5 @@ body {
   width: 11%;
   height: 58%;
 }
-    
+
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98df.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98df.md
index 18991ab296c..384eb7845f1 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98df.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98df.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98df
-title: Step 23
+title: Paso 23
 challengeType: 0
 dashedName: step-23
 ---
@@ -120,5 +120,5 @@ body {
   width: 11%;
   height: 58%;
 }
-    
+
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e0.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e0.md
index 8eacd57f64d..bbf033b03d3 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e0.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e0.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98e0
-title: Step 24
+title: Paso 24
 challengeType: 0
 dashedName: step-24
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e1.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e1.md
index 1ffeb2c17bb..164dc0fce26 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e1.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e1.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98e1
-title: Step 25
+title: Paso 25
 challengeType: 0
 dashedName: step-25
 ---
@@ -150,6 +150,6 @@ body {
   width: 11%;
   height: 58%;
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e2.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e2.md
index f8a42aa5898..4d505c042ad 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e2.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e2.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98e2
-title: Step 26
+title: Paso 26
 challengeType: 0
 dashedName: step-26
 ---
@@ -131,5 +131,5 @@ body {
   width: 11%;
   height: 58%;
 }
-    
+
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e3.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e3.md
index 4c1a12a629e..81a1fd1fc5e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e3.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e3.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98e3
-title: Step 27
+title: Paso 27
 challengeType: 0
 dashedName: step-27
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e4.md
index 2950703ad30..00bdb00400a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e4.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98e4
-title: Step 28
+title: Paso 28
 challengeType: 0
 dashedName: step-28
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e5.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e5.md
index e19eefd591d..29d7a0974c6 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e5.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e5.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98e5
-title: Step 29
+title: Paso 29
 challengeType: 0
 dashedName: step-29
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e6.md
index d434e2aeb01..d155315d3bc 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e6.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98e6
-title: Step 30
+title: Paso 30
 challengeType: 0
 dashedName: step-30
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e7.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e7.md
index d0b1000a10b..75d052a544a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e7.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e7.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98e7
-title: Step 31
+title: Paso 31
 challengeType: 0
 dashedName: step-31
 ---
@@ -248,6 +248,6 @@ body {
 --fcc-editable-region--
 
 --fcc-editable-region--
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e8.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e8.md
index 3714432e6f6..717094c31a0 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e8.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e8.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98e8
-title: Step 32
+title: Paso 32
 challengeType: 0
 dashedName: step-32
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e9.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e9.md
index 19c5650bdf4..b2d961c67ca 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e9.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e9.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98e9
-title: Step 33
+title: Paso 33
 challengeType: 0
 dashedName: step-33
 ---
@@ -218,6 +218,6 @@ body {
   width: 9%;
   height: 38%;
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ea.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ea.md
index a7ba8c36511..c8cda8eaeeb 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ea.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ea.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98ea
-title: Step 34
+title: Paso 34
 challengeType: 0
 dashedName: step-34
 ---
@@ -176,6 +176,6 @@ body {
   width: 9%;
   height: 38%;
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98eb.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98eb.md
index 8d06cc61809..b275fd78972 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98eb.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98eb.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98eb
-title: Step 35
+title: Paso 35
 challengeType: 0
 dashedName: step-35
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ec.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ec.md
index 8143d18ec3c..e121b42b390 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ec.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ec.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98ec
-title: Step 36
+title: Paso 36
 challengeType: 0
 dashedName: step-36
 ---
@@ -198,6 +198,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ed.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ed.md
index 68bb2249960..f5fc62788f1 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ed.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ed.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98ed
-title: Step 37
+title: Paso 37
 challengeType: 0
 dashedName: step-37
 ---
@@ -197,6 +197,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ee.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ee.md
index bd0e16a4841..20ec58d9b49 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ee.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ee.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98ee
-title: Step 38
+title: Paso 38
 challengeType: 0
 dashedName: step-38
 ---
@@ -191,6 +191,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ef.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ef.md
index 0512796cfb2..8a24409f4d2 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ef.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ef.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98ef
-title: Step 39
+title: Paso 39
 challengeType: 0
 dashedName: step-39
 ---
@@ -192,6 +192,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f0.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f0.md
index e07315019ab..b1dd0b5d994 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f0.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f0.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98f0
-title: Step 40
+title: Paso 40
 challengeType: 0
 dashedName: step-40
 ---
@@ -213,6 +213,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f1.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f1.md
index e658de33d12..50e48620bbb 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f1.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f1.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98f1
-title: Step 41
+title: Paso 41
 challengeType: 0
 dashedName: step-41
 ---
@@ -218,6 +218,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f2.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f2.md
index 5f21d781a13..870e2db1cec 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f2.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f2.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98f2
-title: Step 42
+title: Paso 42
 challengeType: 0
 dashedName: step-42
 ---
@@ -232,6 +232,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f3.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f3.md
index 5b832df0f87..314894765e2 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f3.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f3.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98f3
-title: Step 43
+title: Paso 43
 challengeType: 0
 dashedName: step-43
 ---
@@ -217,6 +217,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f4.md
index 6059b2d60a3..18525551e28 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f4.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98f4
-title: Step 44
+title: Paso 44
 challengeType: 0
 dashedName: step-44
 ---
@@ -222,6 +222,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f5.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f5.md
index 6e64130d7cb..b521ff2529a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f5.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f5.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98f5
-title: Step 45
+title: Paso 45
 challengeType: 0
 dashedName: step-45
 ---
@@ -193,6 +193,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f6.md
index ac074fd614c..b9086841e6b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f6.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98f6
-title: Step 46
+title: Paso 46
 challengeType: 0
 dashedName: step-46
 ---
@@ -202,6 +202,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f7.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f7.md
index 9e7d9a17d54..137c45cfc45 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f7.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f7.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98f7
-title: Step 47
+title: Paso 47
 challengeType: 0
 dashedName: step-47
 ---
@@ -198,6 +198,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f8.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f8.md
index 606401d03e2..03da0179b64 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f8.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f8.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98f8
-title: Step 48
+title: Paso 48
 challengeType: 0
 dashedName: step-48
 ---
@@ -205,6 +205,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f9.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f9.md
index 82bda67e3e4..733801dd31c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f9.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f9.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98f9
-title: Step 49
+title: Paso 49
 challengeType: 0
 dashedName: step-49
 ---
@@ -202,6 +202,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fa.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fa.md
index ab1fca84681..f37f95b5cdc 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fa.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fa.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98fa
-title: Step 50
+title: Paso 50
 challengeType: 0
 dashedName: step-50
 ---
@@ -206,6 +206,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fb.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fb.md
index 89c7828a13d..24512b6c26c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fb.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fb.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98fb
-title: Step 51
+title: Paso 51
 challengeType: 0
 dashedName: step-51
 ---
@@ -146,11 +146,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -213,7 +213,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -235,6 +235,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fc.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fc.md
index e61306e210a..bb2d46ba059 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fc.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fc.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98fc
-title: Step 52
+title: Paso 52
 challengeType: 0
 dashedName: step-52
 ---
@@ -111,11 +111,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -184,7 +184,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -206,6 +206,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fd.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fd.md
index 5f5aeb1a36c..44ca773aa95 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fd.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fd.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98fd
-title: Step 53
+title: Paso 53
 challengeType: 0
 dashedName: step-53
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fe.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fe.md
index fa43165a670..36d8b355a51 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fe.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fe.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98fe
-title: Step 54
+title: Paso 54
 challengeType: 0
 dashedName: step-54
 ---
@@ -159,11 +159,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -233,7 +233,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -255,6 +255,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ff.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ff.md
index c7755836830..bf58568bb90 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ff.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ff.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98ff
-title: Step 55
+title: Paso 55
 challengeType: 0
 dashedName: step-55
 ---
@@ -129,11 +129,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -211,7 +211,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -233,6 +233,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9900.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9900.md
index f110fe4f8be..cb323c1ad4f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9900.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9900.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9900
-title: Step 56
+title: Paso 56
 challengeType: 0
 dashedName: step-56
 ---
@@ -117,11 +117,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -197,7 +197,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -219,6 +219,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9901.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9901.md
index 93559351e86..297c0f68827 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9901.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9901.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9901
-title: Step 57
+title: Paso 57
 challengeType: 0
 dashedName: step-57
 ---
@@ -117,11 +117,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -197,7 +197,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -219,6 +219,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9902.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9902.md
index 01485d6fc62..c946f416e13 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9902.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9902.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9902
-title: Step 58
+title: Paso 58
 challengeType: 0
 dashedName: step-58
 ---
@@ -123,11 +123,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -201,7 +201,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -223,5 +223,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9903.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9903.md
index a84664027d0..63e83c6fbb8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9903.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9903.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9903
-title: Step 59
+title: Paso 59
 challengeType: 0
 dashedName: step-59
 ---
@@ -118,11 +118,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -196,7 +196,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -218,6 +218,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9904.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9904.md
index 826e82e8004..5a6ad6d642d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9904.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9904.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9904
-title: Step 60
+title: Paso 60
 challengeType: 0
 dashedName: step-60
 ---
@@ -140,11 +140,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -218,7 +218,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -240,6 +240,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9905.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9905.md
index be8f279c220..99e7a97b756 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9905.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9905.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9905
-title: Step 61
+title: Paso 61
 challengeType: 0
 dashedName: step-61
 ---
@@ -112,11 +112,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -196,7 +196,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -218,6 +218,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9906.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9906.md
index 28fd7889ce6..44e3351d879 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9906.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9906.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9906
-title: Step 62
+title: Paso 62
 challengeType: 0
 dashedName: step-62
 ---
@@ -139,11 +139,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -222,7 +222,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -244,6 +244,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9907.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9907.md
index b97da80b656..2dbc0d0404c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9907.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9907.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9907
-title: Step 63
+title: Paso 63
 challengeType: 0
 dashedName: step-63
 ---
@@ -146,11 +146,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -231,7 +231,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -253,6 +253,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9908.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9908.md
index 74f1fa92aaa..c031b6e0163 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9908.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9908.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9908
-title: Step 64
+title: Paso 64
 challengeType: 0
 dashedName: step-64
 ---
@@ -134,11 +134,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -208,7 +208,7 @@ body {
   width: 80%;
   height: 5%;
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -232,7 +232,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -254,5 +254,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9909.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9909.md
index c1f05cb180c..4cf01daa0fb 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9909.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9909.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9909
-title: Step 65
+title: Paso 65
 challengeType: 0
 dashedName: step-65
 ---
@@ -118,11 +118,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -193,7 +193,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -218,7 +218,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -240,6 +240,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990a.md
index 91c5eaceb1f..c7c9206208e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990a.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e990a
-title: Step 66
+title: Paso 66
 challengeType: 0
 dashedName: step-66
 ---
@@ -150,11 +150,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -225,7 +225,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -250,7 +250,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -272,6 +272,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990b.md
index 6c551ec4605..e7c97d165ea 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990b.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e990b
-title: Step 67
+title: Paso 67
 challengeType: 0
 dashedName: step-67
 ---
@@ -127,11 +127,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -202,7 +202,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -227,7 +227,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -249,6 +249,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990c.md
index 207b0898467..3ebe1b8d1a7 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990c.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e990c
-title: Step 68
+title: Paso 68
 challengeType: 0
 dashedName: step-68
 ---
@@ -126,11 +126,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -201,7 +201,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -226,7 +226,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -248,6 +248,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990d.md
index c792b7c315e..8abab436c1c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990d.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e990d
-title: Step 69
+title: Paso 69
 challengeType: 0
 dashedName: step-69
 ---
@@ -128,11 +128,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -203,7 +203,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -228,7 +228,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -250,6 +250,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990e.md
index 03e6774811d..cc9ac6869c6 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990e.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e990e
-title: Step 70
+title: Paso 70
 challengeType: 0
 dashedName: step-70
 ---
@@ -137,11 +137,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -212,7 +212,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -239,7 +239,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -261,5 +261,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990f.md
index b0e6c9ac647..92680958f34 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990f.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e990f
-title: Step 71
+title: Paso 71
 challengeType: 0
 dashedName: step-71
 ---
@@ -153,11 +153,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -228,7 +228,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -259,7 +259,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -281,6 +281,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9910.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9910.md
index 5e0b774f8ab..d95913e77e0 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9910.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9910.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9910
-title: Step 72
+title: Paso 72
 challengeType: 0
 dashedName: step-72
 ---
@@ -133,11 +133,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -208,7 +208,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -239,7 +239,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -261,6 +261,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9911.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9911.md
index 2331da101b7..bfdb567fdaa 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9911.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9911.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9911
-title: Step 73
+title: Paso 73
 challengeType: 0
 dashedName: step-73
 ---
@@ -158,11 +158,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -233,7 +233,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -264,7 +264,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -286,6 +286,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9912.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9912.md
index 05d085a1be7..26596f311a4 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9912.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9912.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9912
-title: Step 74
+title: Paso 74
 challengeType: 0
 dashedName: step-74
 ---
@@ -153,11 +153,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -228,7 +228,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -261,7 +261,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -283,5 +283,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9913.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9913.md
index d451d028ebe..112ed8e7e8b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9913.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9913.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9913
-title: Step 75
+title: Paso 75
 challengeType: 0
 dashedName: step-75
 ---
@@ -137,11 +137,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -212,7 +212,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -236,7 +236,7 @@ body {
   width: 60%;
   height: 10%;
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -253,7 +253,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -275,6 +275,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9914.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9914.md
index 5cb763bcec7..0022948d44b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9914.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9914.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9914
-title: Step 76
+title: Paso 76
 challengeType: 0
 dashedName: step-76
 ---
@@ -141,11 +141,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -216,7 +216,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -258,7 +258,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -280,5 +280,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9915.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9915.md
index e476f5d90bc..918d8e4ec34 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9915.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9915.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9915
-title: Step 106
+title: Paso 106
 challengeType: 0
 dashedName: step-106
 ---
@@ -161,11 +161,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -236,7 +236,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -266,7 +266,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -313,13 +313,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -386,6 +386,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9916.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9916.md
index 8685190853e..0f33c0e5bb6 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9916.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9916.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9916
-title: Step 77
+title: Paso 77
 challengeType: 0
 dashedName: step-77
 ---
@@ -155,11 +155,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -230,7 +230,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -271,7 +271,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -293,5 +293,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9917.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9917.md
index 226aa2791df..deeb7700b5f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9917.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9917.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9917
-title: Step 78
+title: Paso 78
 challengeType: 0
 dashedName: step-78
 ---
@@ -158,11 +158,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -233,7 +233,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -281,7 +281,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -303,5 +303,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9918.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9918.md
index 891c49a2e13..d4ee2889b29 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9918.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9918.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9918
-title: Step 79
+title: Paso 79
 challengeType: 0
 dashedName: step-79
 ---
@@ -141,11 +141,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -216,7 +216,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -242,7 +242,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -272,7 +272,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -294,5 +294,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9919.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9919.md
index 70f365e2891..b1b76c420e5 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9919.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9919.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9919
-title: Step 80
+title: Paso 80
 challengeType: 0
 dashedName: step-80
 ---
@@ -141,11 +141,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -216,7 +216,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -244,7 +244,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -274,7 +274,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -296,6 +296,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991a.md
index 99f5abea099..0a1896ec35a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991a.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e991a
-title: Step 81
+title: Paso 81
 challengeType: 0
 dashedName: step-81
 ---
@@ -150,11 +150,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -225,7 +225,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -255,7 +255,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -285,7 +285,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -307,6 +307,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991b.md
index f1cc76cabd4..ee9e88e0698 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991b.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e991b
-title: Step 82
+title: Paso 82
 challengeType: 0
 dashedName: step-82
 ---
@@ -150,11 +150,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -225,7 +225,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -255,7 +255,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -287,7 +287,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -309,6 +309,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991c.md
index e047f9f3021..0c91031ac2f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991c.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e991c
-title: Step 83
+title: Paso 83
 challengeType: 0
 dashedName: step-83
 ---
@@ -146,11 +146,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -221,7 +221,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -251,7 +251,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -290,7 +290,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -312,6 +312,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991d.md
index 75eac697004..249f296803b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991d.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e991d
-title: Step 84
+title: Paso 84
 challengeType: 0
 dashedName: step-84
 ---
@@ -144,11 +144,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -219,7 +219,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -249,7 +249,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -288,7 +288,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -310,6 +310,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991e.md
index 68bea5beb87..c8a282f31d2 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991e.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e991e
-title: Step 85
+title: Paso 85
 challengeType: 0
 dashedName: step-85
 ---
@@ -154,11 +154,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -229,7 +229,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -259,7 +259,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -300,7 +300,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -322,5 +322,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991f.md
index e4198afe229..8c119f12912 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991f.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e991f
-title: Step 86
+title: Paso 86
 challengeType: 0
 dashedName: step-86
 ---
@@ -148,11 +148,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -223,7 +223,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -253,7 +253,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -298,7 +298,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -320,5 +320,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9920.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9920.md
index 3ccdb0dbcc5..e6fb6f5a978 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9920.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9920.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9920
-title: Step 87
+title: Paso 87
 challengeType: 0
 dashedName: step-87
 ---
@@ -154,11 +154,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -229,7 +229,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -259,7 +259,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -304,7 +304,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -326,5 +326,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9921.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9921.md
index 3cff4a2acda..a72095c54d7 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9921.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9921.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9921
-title: Step 88
+title: Paso 88
 challengeType: 0
 dashedName: step-88
 ---
@@ -168,11 +168,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -243,7 +243,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -273,7 +273,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -321,7 +321,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -343,6 +343,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9922.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9922.md
index 0fa90cef88b..638168518dd 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9922.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9922.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9922
-title: Step 89
+title: Paso 89
 challengeType: 0
 dashedName: step-89
 ---
@@ -165,11 +165,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -240,7 +240,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -270,7 +270,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -342,6 +342,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9923.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9923.md
index c6942ea1b38..b543305e01e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9923.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9923.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9923
-title: Step 90
+title: Paso 90
 challengeType: 0
 dashedName: step-90
 ---
@@ -159,11 +159,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -234,7 +234,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -264,7 +264,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -317,7 +317,7 @@ body {
   width: 80%;
   height: 15%;
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -344,5 +344,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9924.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9924.md
index a7f0e2cb952..a8ef0438e21 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9924.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9924.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9924
-title: Step 91
+title: Paso 91
 challengeType: 0
 dashedName: step-91
 ---
@@ -149,11 +149,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -224,7 +224,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -254,7 +254,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -301,13 +301,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -335,6 +335,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9925.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9925.md
index 19ff10935fc..63a8632ce7c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9925.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9925.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9925
-title: Step 92
+title: Paso 92
 challengeType: 0
 dashedName: step-92
 ---
@@ -155,11 +155,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -230,7 +230,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -260,7 +260,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -307,13 +307,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -341,6 +341,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9926.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9926.md
index 7c0132cbbd5..9204121b7cf 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9926.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9926.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9926
-title: Step 93
+title: Paso 93
 challengeType: 0
 dashedName: step-93
 ---
@@ -163,11 +163,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -238,7 +238,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -268,7 +268,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -315,13 +315,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -351,5 +351,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9927.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9927.md
index ed213fde285..9725ca304ea 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9927.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9927.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9927
-title: Step 94
+title: Paso 94
 challengeType: 0
 dashedName: step-94
 ---
@@ -153,11 +153,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -228,7 +228,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -258,7 +258,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -305,13 +305,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -345,6 +345,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9928.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9928.md
index 456c70cfb9f..9106cce9d83 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9928.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9928.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9928
-title: Step 95
+title: Paso 95
 challengeType: 0
 dashedName: step-95
 ---
@@ -152,11 +152,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -227,7 +227,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -257,7 +257,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -304,13 +304,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -344,6 +344,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9929.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9929.md
index ad6a18db3d8..0d1eb0866b0 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9929.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9929.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9929
-title: Step 96
+title: Paso 96
 challengeType: 0
 dashedName: step-96
 ---
@@ -165,11 +165,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -240,7 +240,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -270,7 +270,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -317,13 +317,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -357,6 +357,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992a.md
index 7c1fd3dfc0a..af4320c4aa6 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992a.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e992a
-title: Step 97
+title: Paso 97
 challengeType: 0
 dashedName: step-97
 ---
@@ -160,11 +160,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -235,7 +235,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -265,7 +265,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -312,13 +312,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -354,6 +354,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992b.md
index 6ec1e954b18..899d0e18c23 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992b.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e992b
-title: Step 98
+title: Paso 98
 challengeType: 0
 dashedName: step-98
 ---
@@ -160,11 +160,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -235,7 +235,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -265,7 +265,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -312,13 +312,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -357,5 +357,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992c.md
index 1548769e3c8..51067f306dc 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992c.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e992c
-title: Step 99
+title: Paso 99
 challengeType: 0
 dashedName: step-99
 ---
@@ -162,11 +162,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -237,7 +237,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -267,7 +267,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -314,13 +314,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -359,6 +359,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992d.md
index 6ddb73f13b4..3cf46cc93f1 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992d.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e992d
-title: Step 100
+title: Paso 100
 challengeType: 0
 dashedName: step-100
 ---
@@ -173,11 +173,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -248,7 +248,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -278,7 +278,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -325,13 +325,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -372,6 +372,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992e.md
index 3fd53b9a1ec..2af9db5f384 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992e.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e992e
-title: Step 101
+title: Paso 101
 challengeType: 0
 dashedName: step-101
 ---
@@ -167,11 +167,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -242,7 +242,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -272,7 +272,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -319,13 +319,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -370,5 +370,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992f.md
index d3624b3cfda..0ac895852e9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992f.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e992f
-title: Step 102
+title: Paso 102
 challengeType: 0
 dashedName: step-102
 ---
@@ -167,11 +167,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -242,7 +242,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -272,7 +272,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -319,13 +319,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -372,6 +372,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9930.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9930.md
index 997ee5ecec0..53fc8e53991 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9930.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9930.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9930
-title: Step 103
+title: Paso 103
 challengeType: 0
 dashedName: step-103
 ---
@@ -167,11 +167,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -242,7 +242,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -272,7 +272,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -319,13 +319,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -376,6 +376,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9931.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9931.md
index 742b4250c6c..7caa052e9bf 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9931.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9931.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9931
-title: Step 109
+title: Paso 109
 challengeType: 0
 dashedName: step-109
 ---
@@ -161,11 +161,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9932.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9932.md
index 80bdfe3d777..fa631b8aebc 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9932.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9932.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9932
-title: Step 104
+title: Paso 104
 challengeType: 0
 dashedName: step-104
 ---
@@ -179,11 +179,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -254,7 +254,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -284,7 +284,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -331,13 +331,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -391,6 +391,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9933.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9933.md
index f3731819799..8a4d1de6abf 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9933.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9933.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9933
-title: Step 105
+title: Paso 105
 challengeType: 0
 dashedName: step-105
 ---
@@ -179,11 +179,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -254,7 +254,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -284,7 +284,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -331,13 +331,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -397,6 +397,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9934.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9934.md
index 3f172a0388a..1ce9a7edf5b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9934.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9934.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9934
-title: Step 107
+title: Paso 107
 challengeType: 0
 dashedName: step-107
 ---
@@ -179,11 +179,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -254,7 +254,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -284,7 +284,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -331,13 +331,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9935.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9935.md
index ef5b15a88a7..6cf439e7252 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9935.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9935.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9935
-title: Step 108
+title: Paso 108
 challengeType: 0
 dashedName: step-108
 ---
@@ -173,11 +173,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -248,7 +248,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -278,7 +278,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -325,13 +325,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9936.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9936.md
index 9d8a3c2d880..28d42e7e714 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9936.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9936.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9936
-title: Step 110
+title: Paso 110
 challengeType: 0
 dashedName: step-110
 ---
@@ -161,11 +161,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -236,7 +236,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -266,7 +266,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -313,13 +313,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -397,6 +397,6 @@ body {
       var(--window-color3) 30%
     );
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9937.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9937.md
index 0c9bd249eb4..d831b785913 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9937.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9937.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9937
-title: Step 111
+title: Paso 111
 challengeType: 0
 dashedName: step-111
 ---
@@ -162,11 +162,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -237,7 +237,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -267,7 +267,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -314,13 +314,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -398,6 +398,6 @@ body {
       var(--window-color3) 30%
     );
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9938.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9938.md
index 0c60ad6415d..cad20e2b3f3 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9938.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9938.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9938
-title: Step 112
+title: Paso 112
 challengeType: 0
 dashedName: step-112
 ---
@@ -180,11 +180,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -255,7 +255,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -285,7 +285,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -332,13 +332,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -416,6 +416,6 @@ body {
       var(--window-color3) 30%
     );
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9939.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9939.md
index cb07a8fde0b..6e87f918ebe 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9939.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9939.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9939
-title: Step 113
+title: Paso 113
 challengeType: 0
 dashedName: step-113
 ---
@@ -169,11 +169,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -244,7 +244,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -274,7 +274,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -321,13 +321,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -405,6 +405,6 @@ body {
       var(--window-color3) 30%
     );
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993a.md
index 12d39cb4c09..abbe219de48 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993a.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e993a
-title: Step 114
+title: Paso 114
 challengeType: 0
 dashedName: step-114
 ---
@@ -178,11 +178,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -253,7 +253,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -283,7 +283,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -330,13 +330,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993b.md
index f43412ed800..f8d6b1d6131 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993b.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e993b
-title: Step 115
+title: Paso 115
 challengeType: 0
 dashedName: step-115
 ---
@@ -178,11 +178,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -253,7 +253,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -283,7 +283,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -330,13 +330,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -416,7 +416,7 @@ body {
 }
 --fcc-editable-region--
 @media (max-width: 1000px) {
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993c.md
index 6d77b62b471..627f133a134 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993c.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e993c
-title: Step 116
+title: Paso 116
 challengeType: 0
 dashedName: step-116
 ---
@@ -432,6 +432,6 @@ var(--window-color3) 30%
   }
 --fcc-editable-region--
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993d.md
index 1a90ae8e5b9..ec7873fbdcb 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993d.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e993d
-title: Step 117
+title: Paso 117
 challengeType: 0
 dashedName: step-117
 ---
@@ -194,11 +194,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -269,7 +269,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -299,7 +299,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -346,13 +346,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -445,6 +445,6 @@ body {
       );
   }
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993e.md
index 592c85e070d..5c7ce18da09 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993e.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e993e
-title: Step 118
+title: Paso 118
 challengeType: 0
 dashedName: step-118
 ---
@@ -190,11 +190,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -265,7 +265,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -295,7 +295,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -342,13 +342,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -446,7 +446,7 @@ body {
       );
   }
 }
-    
+
 ```
 
 # --solutions--
@@ -600,11 +600,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -675,7 +675,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -705,7 +705,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -752,13 +752,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md
index c002fb67c0d..a17f2eded4a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md
@@ -9,7 +9,7 @@ dashedName: step-5
 
 HTML5 tiene diferentes elementos que ayudan a diferenciar diferentes tipos de contenido. Estos elementos hacen tu código HTML más fácil de leer y ayudan con el Posicionamiento en buscadores (Search Engine Optimization - SEO) y accesibilidad.
 
-Identifica la sección principal de esta página añadiendo la etiqueta de apertura `<main>` después del elemento `h1` y una etiqueta de cierre `</main>` después del elemento `p`.
+Identifica la sección principal (main) de esta página añadiendo la etiqueta de apertura `<main>` antes del elemento `h1`, y la de clausura `</main>` después del elemento `p`.
 
 # --hints--
 
@@ -25,20 +25,20 @@ Tu elemento `main` debe tener una etiqueta de cierre. Las etiquetas de cierre ti
 assert(code.match(/<\/main\>/));
 ```
 
-La etiqueta de apertura del elemento `main` debe estar debajo del elemento `h1`. Los tienes en el orden incorrecto.
+La etiqueta de apertura del elemento `main` debe estar por debajo del elemento `body`. Los tienes en el orden incorrecto.
 
 ```js
 const main = document.querySelector('main');
-assert.equal(main?.previousElementSibling?.tagName, "H1");
+assert.equal(main?.previousElementSibling, null);
 ```
 
-La etiqueta de apertura del elemento `main` debe estar encima del elemento `h2`. Los tienes en el orden incorrecto.
+La etiqueta de apertura del elemento `main` debe estar por encima del elemento `h1`. Los tienes en el orden incorrecto.
 
 ```js
-const collection = [...document.querySelectorAll('main,h2')].map(
+const collection = [...document.querySelectorAll('main,h1')].map(
   (node) => node.nodeName
 );
-assert(collection.indexOf('MAIN') < collection.indexOf('H2'));
+assert(collection.indexOf('MAIN') < collection.indexOf('H1'));
 ```
 
 La etiqueta de cierre del elemento `main` debe estar debajo del elemento `p`. Los tienes en el orden incorrecto.
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md
index f7cd1986c55..9611288c9a7 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md
@@ -7,9 +7,9 @@ dashedName: step-6
 
 # --description--
 
-En el paso anterior, pusiste los elementos `h2`, comentario y `p` dentro del elemento `main`. Esto se llama *anidamiento*. Los elementos anidados deben colocarse dos espacios más a la derecha del elemento en el que están anidados. Este espacio se llama sangría (indentación en programación) y se utiliza para facilitar la lectura de HTML.
+En el paso anterior, has colocado los elementos `h1`, `h2`, comentario y `p` dentro del elemento `main`. Esto se llama *anidamiento*. Los elementos anidados deben colocarse dos espacios más a la derecha del elemento en el que están anidados. Este espacio se llama sangría (indentación en programación) y se utiliza para facilitar la lectura de HTML.
 
-El elemento `h2` y el comentario tienen una indentación de dos espacios más que el elemento `main` en el siguiente código. Utiliza la barra espaciadora de tu teclado para añadir dos espacios más delante del elemento `p` para que también tenga la sangría adecuada.
+En el código que sigue, los elementos `h1`, `h2` y el comentario tienen dos espacios más de indentación que el elemento `main`. Utiliza la barra espaciadora de tu teclado para añadir dos espacios más delante del elemento `p` para que también tenga la sangría adecuada.
 
 # --hints--
 
@@ -34,7 +34,7 @@ assert(
 No debes cambiar la sangría de la línea con tu elemento `h2`. Tu etiqueta de apertura debe comenzar a 6 espacios del inicio de la línea. Puedes reiniciar el paso para restaurar la sangría original.
 
 ```js
-assert(code.toLowerCase().match(/<main\>\s*\n\s{6}<h2>/));
+assert(code.toLowerCase().match(/<\/h1\>\s*\n\s{6}<h2>/));
 ```
 
 Tu código debe tener un comentario. Eliminaste el comentario de uno de los pasos anteriores.
@@ -89,9 +89,9 @@ assert(code.toLowerCase().match(/-->\s*\n\s{6}<p>/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
---fcc-editable-region--
+    --fcc-editable-region--
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
     <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md
index a24b20b79d0..4f55d52acc1 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md
@@ -47,8 +47,8 @@ assert(collection.indexOf('P') < collection.indexOf('IMG'));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md
index b7304f12caf..6b249e5a835 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md
@@ -46,8 +46,8 @@ assert(!/\<img\s+src\s*=\s*https:\/\/cdn\.freecodecamp\.org\/curriculum\/cat-pho
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md
index 63112c82ef2..33976bd5578 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md
@@ -44,8 +44,8 @@ assert(altText.match(/A cute orange cat lying on its back\.?$/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md
index e749963bc64..d85834450a2 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md
@@ -64,8 +64,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md
index ed8a4ca4b4f..353f35ee65e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md
@@ -41,8 +41,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md
index e999491b6e4..f89210d61bf 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md
@@ -9,7 +9,7 @@ dashedName: step-12
 
 En el paso anterior has convertido las palabras `link to cat pictures` en un enlace colocándolas entre la apertura y el cierre de la etiqueta (`a`). Puedes hacer lo mismo con las palabras dentro de un elemento, como un elemento de `p`.
 
-En el texto de tu elemento `p`, convierte las palabras `cat photos` en un enlace a `https://freecatphotoapp.com` colocando estas palabras dentro de etiquetas de abertura y cierre (`a`).
+En el texto del elemento `p`, convierte las palabras `cat photos` en un enlace a `https://freecatphotoapp.com` añadiendo etiquetas anchor (`a`) de apertura y cierre alrededor de dichas palabras.
 
 
 # --hints--
@@ -55,8 +55,8 @@ assert(pText.match(/click here to view more cat photos\.?$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md
index ff3a1b9fc37..44651f31ea0 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md
@@ -40,8 +40,8 @@ assert(document.querySelector('a').getAttribute('target') === '_blank');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md
index 0b65671ebfd..e1d566cad10 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md
@@ -73,8 +73,8 @@ assert(document.querySelector('img').parentNode.nodeName === 'A');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md
index b6cd5f5cbd7..97c663ec59f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md
index 5198df38b65..d1c727332d3 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md
@@ -64,8 +64,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md
index fbd9d21bf5b..d6f96de78d9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md
@@ -37,10 +37,10 @@ assert(secondSectionLastElemNode.nodeName === 'UL');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
-      <h2>Cat Photos</h2>
+        <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
         <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
         <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
index 434b269299b..059d78aa06a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md
index 6b8011b0487..d4d3680fa1f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md
@@ -68,8 +68,8 @@ assert(!/\<img\s+.+\s+src\s*=\s*https:\/\/cdn\.freecodecamp\.org\/curriculum\/ca
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md
index 221c466da66..31e16fdc04b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md
@@ -48,11 +48,11 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
-      <h2>Cat Photos</h2>
-      <!-- TODO: Add link to cat photos -->
+        <h2>Cat Photos</h2>
+        <!-- TODO: Add link to cat photos -->
         <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
         <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
       </section>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md
index 044bece50b0..2304ef1f722 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md
@@ -69,8 +69,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md
index 06278bbfb58..68a559e1fa8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md
@@ -55,8 +55,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md
index e1625d4d31c..647f9965183 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md
@@ -51,8 +51,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
index 5c763359922..235dcbe28cf 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
@@ -62,8 +62,8 @@ assert.deepStrictEqual(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md
index d458651fb43..906e2359b38 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md
@@ -36,8 +36,8 @@ assert($('main > section')[1].lastElementChild.nodeName === 'FIGURE');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md
index 984ee1c9c4b..bf543511769 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
index d95e8beb519..f90fa76e39f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
@@ -63,8 +63,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md
index ab455c18825..6723c479eca 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md
@@ -45,8 +45,8 @@ assert($('form')[0].innerHTML.trim().length === 0);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md
index d79f0bc2c42..9b42e99d782 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md
@@ -71,8 +71,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md
index 0234eccbc42..2f0e3d7ab93 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md
@@ -64,8 +64,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md
index c17e82ea0df..9c65379194a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md
@@ -58,8 +58,8 @@ assert(!/\<\s*input\s+placeholder\s*=\s*cat\s+photo\s+url/i.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md
index 9bb42074ac6..053707a9f58 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md
@@ -47,8 +47,8 @@ assert(collection.indexOf('INPUT') < collection.indexOf('BUTTON'));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md
index f77fefcf5fd..232d9d84729 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md
@@ -45,8 +45,8 @@ assert($('input')[0].getAttribute('required') === '');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
index 081ce7cc50b..43bcf1156de 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
@@ -90,8 +90,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
index 710cf422510..5584d68ebab 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md
index 32eb463f2aa..2ea9c8100dc 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md
@@ -57,8 +57,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md
index e12634e976b..ca535dbc1af 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md
@@ -47,8 +47,8 @@ assert($('input')[0].id.match(/^indoor$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md
index d7dd84bd572..bff1d1e1a4e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md
@@ -53,8 +53,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
index fb4fc0cb4de..7153f535590 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
@@ -75,8 +75,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md
index f1c757c9ab8..66df21e5981 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md
@@ -66,8 +66,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md
index 49e43a91b9e..89c59c40532 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md
@@ -59,8 +59,8 @@ assert(!$('input[type="checkbox"]')[2].hasAttribute('checked'));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md
index 33339361b58..a2375c12066 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md
@@ -44,8 +44,8 @@ assert(document.querySelector('main').nextElementSibling.nodeName === 'FOOTER');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md
index dc12aeb7385..a6afd464941 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md
@@ -44,8 +44,8 @@ assert(extraSpacesRemoved.match(/No Copyright - freeCodeCamp\.org$/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md
index a97b447e2a8..9089aa8212c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md
@@ -55,8 +55,8 @@ assert(pText.match(/^no copyright - freecodecamp.org$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md
index 594bb9a1e83..f35ae570e14 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md
@@ -46,8 +46,8 @@ assert(noSpaces.match(/\<\/head\>\<body\>/));
 <html>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
index 6c053959df5..a51f253df6e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
@@ -51,8 +51,8 @@ assert(document.title && document.title.toLowerCase() === 'catphotoapp');
   </head>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
index f0a25062581..3351151a1ec 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
@@ -44,8 +44,8 @@ assert(code.match(/<html\s+lang\s*=\s*('|")en\1\s*>/gi));
     <title>CatPhotoApp</title>
   </head>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md
index e4b6be0fb8f..3caaadd0a4d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md
@@ -38,8 +38,8 @@ assert(noSpaces.match(/^\<\!DOCTYPEhtml\>\<html/));
   </head>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md
index 222e690fb20..844747ef47f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md
@@ -61,8 +61,8 @@ assert(!/\<img\s+.+\s+src\s*=\s*https:\/\/cdn\.freecodecamp\.org\/curriculum\/ca
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md
index acbb4c4ff02..08877410e7b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md
@@ -60,8 +60,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md
index 65e0cc0a2f7..3e267885929 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md
@@ -84,8 +84,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md
index 626f1e01a0a..18e3dee2e69 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md
@@ -58,8 +58,8 @@ assert(!/\<input\s+type\s*=\s*text/.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md
index 1f4d357ad40..a737cf9f132 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md
@@ -54,8 +54,8 @@ assert(!/\<\s*button\s+type\s*=\s*submit/i.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
index 2e7fec41173..50d4c87fcdd 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
@@ -19,10 +19,10 @@ Asegúrate de que el checkbox aún está presente.
 assert($('input[type="checkbox"]')[0]);
 ```
 
-Tu checkbox, aún debe tener un atributo `id` con el valor `loving`. Talvez eliminaste el atributo o cambiaste su valor.
+Tu checkbox, aún debe tener un atributo `id` con el valor `loving`.  Se esperaba `--fcc-expected--`, pero se encontró `--fcc-actual--`.
 
 ```js
-assert($('input[type="checkbox"]')[0].id === 'loving');
+assert.equal($('input[type="checkbox"]')[0].id, 'loving');
 ```
 
 El texto `Loving` ya no debe estar inmediatamente a la derecha de tu checkbox. Debe estar anidado dentro de un elemento `label`. Asegúrate de que hay un espacio entre los dos elementos.
@@ -59,11 +59,11 @@ const labelElem = $('input[type="checkbox"]')[0].nextElementSibling;
 assert(labelElem.hasAttribute('for'));
 ```
 
-El nuevo elemento `label` debe tener un atributo `for` con el valor `loving`. Probablemente no has añadido el valor o tienes un error tipográfico. Recuerda que los valores de los atributos deben estar entre comillas.
+El nuevo elemento `label` debe tener un atributo `for` con el valor `loving`.  Se esperaba `--fcc-expected--`, pero se encontró `--fcc-actual--`.
 
 ```js
 const labelElem = $('input[type="checkbox"]')[0].nextElementSibling;
-assert(labelElem.getAttribute('for').match(/^loving$/));
+assert.equal(labelElem.getAttribute('for'), 'loving');
 ```
 
 El texto `Loving` debe estar anidado dentro del nuevo elemento `label`. Probablemente no has añadido el texto o tienes un error tipográfico.
@@ -80,8 +80,8 @@ assert(labelElem.textContent.replace(/\s/g, '').match(/Loving/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md
index 0a2e99bc359..81f4badd3fd 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md
@@ -42,8 +42,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md
index 89fd8e2c231..4504786f9dc 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md
@@ -30,8 +30,8 @@ assert($('input[type="checkbox"]')[0].id.match(/^loving$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md
index b7fd379df4c..6041ee83ace 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md
@@ -67,8 +67,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
index 1e80d354cf6..fc6e2a4a465 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
@@ -88,8 +88,8 @@ assert(code.match(/<\/label>\s*<label\s*>\s*<input [^>]+>\s*Outdoor/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md
index 57a24422e6b..9ff0b26cf7a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md
@@ -9,7 +9,7 @@ dashedName: step-16
 
 Antes de añadir nuevo contenido, deberías utilizar un elemento `section`, para separar el contenido de cat photos, del contenido que añadiremos después.
 
-Toma todos los elementos actualmente ubicados dentro del elemento `main` y anidarlos dentro de un elemento `section`.
+Anida en un elemento `section` los elementos `h2`, el comentario, `p`, y anchor (`a`).
 
 # --hints--
 
@@ -35,10 +35,18 @@ Los elementos `h2`, comentario, `p` y anchor (`a`) deben estar entre las etiquet
 
 ```js
 const childrenOfSection = [...document.querySelector('section').childNodes];
-const foundElems = childrenOfSection.filter((child) => {
+const foundElements = childrenOfSection.filter((child) => {
   return ['H2', 'A', 'P'].includes(child.nodeName);
 });
-assert(foundElems.length === 3);
+assert(foundElements.length === 3);
+```
+
+El elemento `h1` no debe estar anidado en el elemento `section`.
+
+```js
+const childrenOfSection = [...document.querySelector('section').childNodes];
+const includesH1 = childrenOfSection.some((child) => child.nodeName === 'H1');
+assert.isFalse(includesH1);
 ```
 
 # --seed--
@@ -48,9 +56,9 @@ assert(foundElems.length === 3);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
---fcc-editable-region--
+    --fcc-editable-region--
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md
index 7ba818f51da..2b37c740611 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md
@@ -64,8 +64,8 @@ assert(foundElems.length === 2);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
 --fcc-editable-region--
       <section>
         <h2>Cat Photos</h2>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md
index 18deffa31e6..5c192c7dee4 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md
@@ -58,37 +58,37 @@ assert($('main > section')[2].children.length === 0);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
-      <h2>Cat Photos</h2>
-      <!-- TODO: Add link to cat photos -->
-      <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
-      <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
+        <h2>Cat Photos</h2>
+        <!-- TODO: Add link to cat photos -->
+        <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
+        <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
       </section>
 --fcc-editable-region--
       <section>
-      <h2>Cat Lists</h2>
-      <h3>Things cats love:</h3>
-      <ul>
-        <li>cat nip</li>
-        <li>laser pointers</li>
-        <li>lasagna</li>
-      </ul>
-      <figure>
-        <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/lasagna.jpg" alt="A slice of lasagna on a plate.">
-        <figcaption>Cats <em>love</em> lasagna.</figcaption>  
-      </figure>
-      <h3>Top 3 things cats hate:</h3>
-      <ol>
-        <li>flea treatment</li>
-        <li>thunder</li>
-        <li>other cats</li>
-      </ol>
-      <figure>
-        <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/cats.jpg" alt="Five cats looking around a field.">
-        <figcaption>Cats <strong>hate</strong> other cats.</figcaption>  
-      </figure>
+        <h2>Cat Lists</h2>
+        <h3>Things cats love:</h3>
+        <ul>
+          <li>cat nip</li>
+          <li>laser pointers</li>
+          <li>lasagna</li>
+        </ul>
+        <figure>
+          <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/lasagna.jpg" alt="A slice of lasagna on a plate.">
+          <figcaption>Cats <em>love</em> lasagna.</figcaption>  
+        </figure>
+        <h3>Top 3 things cats hate:</h3>
+        <ol>
+          <li>flea treatment</li>
+          <li>thunder</li>
+          <li>other cats</li>
+        </ol>
+        <figure>
+          <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/cats.jpg" alt="Five cats looking around a field.">
+          <figcaption>Cats <strong>hate</strong> other cats.</figcaption>  
+        </figure>
       </section>
 --fcc-editable-region--
     </main>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md
index a9d970992eb..25a70e63a6b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md
@@ -54,8 +54,8 @@ assert(extraSpacesRemoved.match(/Is your cat an indoor or outdoor cat\??$/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md
index 5608fe63327..1c3abba8efc 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md
@@ -76,8 +76,8 @@ assert(fieldsetChildren[0].length > fieldsetChildren[1].length);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md
index dd73d23ac29..25d3fa8d7d2 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md
@@ -60,8 +60,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md
index a1aa6a0f186..e970bfb71fd 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md
@@ -60,8 +60,8 @@ assert(outdoorRadioButton.getAttribute('value').match(/^outdoor$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md
index bd58d4f32fa..4f9eb2cbc9c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md
@@ -48,8 +48,8 @@ assert(energeticCheckbox.getAttribute('value').match(/^energetic$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md
index e6cf7ceae50..10cf027bdb2 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md
@@ -37,8 +37,8 @@ assert.equal(document.querySelector('head > meta')?.getAttribute('charset')?.toL
   </head>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
@@ -106,8 +106,8 @@ assert.equal(document.querySelector('head > meta')?.getAttribute('charset')?.toL
     <title>CatPhotoApp</title>
   </head>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md
index 15ff1971cbb..49e3b3ec9ed 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md
@@ -69,8 +69,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md
index 3ce40cc27a9..4ce2cdc4912 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md
@@ -57,8 +57,8 @@ assert(!/\<\s*input\s+.*\s*=\s*catphotourl/.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md
index 133fae37cc5..f189522eeb5 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md
@@ -6,24 +6,25 @@ dashedName: step-8
 ---
 
 # --description--
+La unidad `vh` significa viewport height (altura del viewport), y es relativa al 1% de la altura (`height`) del viewport.
 
-Para cambiar la apariencia del proyecto, agreguemos algo de CSS. Empieza dando al `body` un `width` de `100%`, y un `height` de `100vh`.
+Es hora de engalanar el proyecto con un poco de CSS. Comienza estableciendo para `body` la propiedad `width` a `100%`, y la propiedad `height` a `100vh`.
 
 # --hints--
 
-Debes usar el selector del elemento `body`.
+Debes usar el selector para el elemento `body`.
 
 ```js
 assert.exists(new __helpers.CSSHelp(document).getStyle('body'));
 ```
 
-Debes dar al `body` un `width` de `100%`.
+Debes establecer a `100%` la propiedad `width` del elemento `body`.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.width, '100%');
 ```
 
-Debes dar al `body` un `height` de `100vh`.
+Debes establecer a `100vh` la propiedad `height` del elemento `body`.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.height, '100vh');
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md
index 1e26febd4ad..fd717cf369e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md
@@ -6,8 +6,9 @@ dashedName: step-15
 ---
 
 # --description--
+La unidad `rem` significa root (raíz) `em`, y es relativa al tamaño de fuente del elemento `html`.
 
-Como los elementos `label` están en línea por defecto, todos ellos se muestran juntos en la misma línea, haciendo difícil leer su texto. Para que aparezcan en líneas separadas, agrega `display: block` al elemento `label`, y agrega un `margin` de `0.5rem 0`, para separarlos entre sí.
+Como los elementos `label` por defecto son inline, se muestran todos juntos en la misma línea, haciendo difícil su lectura. Para mostrarlos en diferentes líneas, añade `display: block` al elemento `label`, y dale a la propiedad `margin` un valor de `0.5rem 0`, para darles un poco de separación.
 
 # --hints--
 
@@ -17,13 +18,13 @@ Debes usar el selector `label`.
 assert.exists(new __helpers.CSSHelp(document).getStyle('label'));
 ```
 
-Debes agregar una propiedad `display` con el valor `block`.
+Debes añadir la propiedad `display` con el valor `block`.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('label')?.display, 'block');
 ```
 
-Debes agregar una propiedad `margin` con el valor `0.5rem 0`.
+Debes añadir la propiedad `margin` con el valor `0.5rem 0`.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('label')?.margin, '0.5rem 0px');
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51578.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51578.md
index b97c418ae43..33bb830941b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51578.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51578.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51578
-title: Step 1
+title: Paso 1
 challengeType: 0
 dashedName: step-1
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51579.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51579.md
index f242bb58261..d846f16bbae 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51579.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51579.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51579
-title: Step 2
+title: Paso 2
 challengeType: 0
 dashedName: step-2
 ---
@@ -56,7 +56,7 @@ assert(document.querySelector('title')?.innerText === 'Picasso Painting');
   <body>
   </body>
 </html>
-```  
+```
 
 ```css
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157a.md
index 49fb512d9eb..5dcdaadfb3c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157a.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5157a
-title: Step 4
+title: Paso 4
 challengeType: 0
 dashedName: step-4
 ---
@@ -25,8 +25,7 @@ Your `link` element should have a `rel` of `stylesheet`.
 assert(document.querySelectorAll('link')?.[1]?.getAttribute('rel') === 'stylesheet');
 ```
 
-Your `link` element should have an `href` of 
-`https://use.fontawesome.com/releases/v5.8.2/css/all.css`.
+Your `link` element should have an `href` of `https://use.fontawesome.com/releases/v5.8.2/css/all.css`.
 
 ```js
 assert(document.querySelectorAll('link')?.[1]?.getAttribute('href') === 'https://use.fontawesome.com/releases/v5.8.2/css/all.css')
@@ -50,7 +49,7 @@ assert(document.querySelectorAll('link')?.[1]?.getAttribute('href') === 'https:/
   <body>
   </body>
 </html>
-```  
+```
 
 ```css
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157b.md
index fb72bf110b0..80072fd18bc 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157b.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5157b
-title: Step 5
+title: Paso 5
 challengeType: 0
 dashedName: step-5
 ---
@@ -39,7 +39,7 @@ assert(new __helpers.CSSHelp(document).getStyle('body')?.backgroundColor === 'rg
   <body>
   </body>
 </html>
-```  
+```
 
 ```css
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157c.md
index 46bc4eac429..98106180215 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157c.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5157c
-title: Step 6
+title: Paso 6
 challengeType: 0
 dashedName: step-6
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157d.md
index bef108c50ee..ffc60b8df36 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157d.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5157d
-title: Step 7
+title: Paso 7
 challengeType: 0
 dashedName: step-7
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157e.md
index 9902742c288..4e002d82697 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157e.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5157e
-title: Step 8
+title: Paso 8
 challengeType: 0
 dashedName: step-8
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157f.md
index e556983f277..bba4caeeaff 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157f.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5157f
-title: Step 9
+title: Paso 9
 challengeType: 0
 dashedName: step-9
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51580.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51580.md
index fc2f26bd044..0bcc3071f59 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51580.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51580.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51580
-title: Step 10
+title: Paso 10
 challengeType: 0
 dashedName: step-10
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51581.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51581.md
index e3c0a6d7133..f74dfc4ab65 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51581.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51581.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51581
-title: Step 11
+title: Paso 11
 challengeType: 0
 dashedName: step-11
 ---
@@ -45,7 +45,7 @@ assert(document.querySelectorAll('div')?.[1]?.classList?.contains('characters'))
   <body>
     <div id="back-wall"></div>
     --fcc-editable-region--
-      
+
     --fcc-editable-region--
   </body>
 </html>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51582.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51582.md
index cecb3afcc3f..4127bc66901 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51582.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51582.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51582
-title: Step 12
+title: Paso 12
 challengeType: 0
 dashedName: step-12
 ---
@@ -46,7 +46,7 @@ assert(document.querySelector('.characters div')?.getAttribute('id') === 'offwhi
     <div id="back-wall"></div>
     <div class="characters">
       --fcc-editable-region--
-      
+
       --fcc-editable-region--
     </div>
   </body>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51583.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51583.md
index 26e10dbd954..35fb47853b8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51583.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51583.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51583
-title: Step 13
+title: Paso 13
 challengeType: 0
 dashedName: step-13
 ---
@@ -59,7 +59,7 @@ assert(document.querySelectorAll('#offwhite-character div')[3]?.getAttribute('id
     <div class="characters">
       <div id="offwhite-character">
         --fcc-editable-region--
-        
+
         --fcc-editable-region--
       </div>
     </div>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51584.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51584.md
index 30d7ae1f208..2c1f2d1722f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51584.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51584.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51584
-title: Step 14
+title: Paso 14
 challengeType: 0
 dashedName: step-14
 ---
@@ -51,7 +51,7 @@ assert(document.querySelectorAll('#black-mask div')[1]?.classList.contains('righ
         <div id="white-hat"></div>
         <div id="black-mask">
           --fcc-editable-region--
-          
+
           --fcc-editable-region--
         </div>
         <div id="gray-instrument"></div>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51585.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51585.md
index fe7c93d2a82..3c9bebf13f5 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51585.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51585.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51585
-title: Step 15
+title: Paso 15
 challengeType: 0
 dashedName: step-15
 ---
@@ -47,7 +47,7 @@ assert(document.querySelectorAll('#gray-instrument .black-dot').length === 5);
         </div>
         <div id="gray-instrument">
           --fcc-editable-region--
-          
+
           --fcc-editable-region--
         </div>
         <div id="tan-table"></div>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51586.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51586.md
index d5e2a92f017..daf6ec1f91a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51586.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51586.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51586
-title: Step 16
+title: Paso 16
 challengeType: 0
 dashedName: step-16
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51587.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51587.md
index a2f719e29e7..1c9d8f0424b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51587.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51587.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51587
-title: Step 17
+title: Paso 17
 challengeType: 0
 dashedName: step-17
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51588.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51588.md
index 92841c58470..feef4b85dee 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51588.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51588.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51588
-title: Step 18
+title: Paso 18
 challengeType: 0
 dashedName: step-18
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51589.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51589.md
index 5e6f8e7092c..5e420abc771 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51589.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51589.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51589
-title: Step 19
+title: Paso 19
 challengeType: 0
 dashedName: step-19
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158a.md
index eed022dadee..615da9d001f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158a.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5158a
-title: Step 20
+title: Paso 20
 challengeType: 0
 dashedName: step-20
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158b.md
index 21f9a6572a9..6362b0ae1f2 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158b.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5158b
-title: Step 21
+title: Paso 21
 challengeType: 0
 dashedName: step-21
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158c.md
index 2707ab677ae..f6176fb77f6 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158c.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5158c
-title: Step 22
+title: Paso 22
 challengeType: 0
 dashedName: step-22
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158d.md
index 8c2d427cdb6..3d17df2710f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158d.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5158d
-title: Step 23
+title: Paso 23
 challengeType: 0
 dashedName: step-23
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158e.md
index 918cfcee918..d1715c32a1f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158e.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5158e
-title: Step 24
+title: Paso 24
 challengeType: 0
 dashedName: step-24
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158f.md
index a472aa3b907..7d2ac9f309a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158f.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5158f
-title: Step 25
+title: Paso 25
 challengeType: 0
 dashedName: step-25
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51590.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51590.md
index 7348596a0ac..352fe50adc9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51590.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51590.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51590
-title: Step 26
+title: Paso 26
 challengeType: 0
 dashedName: step-26
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51591.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51591.md
index b94df3eb3fd..2cbcd6eaef8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51591.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51591.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51591
-title: Step 27
+title: Paso 27
 challengeType: 0
 dashedName: step-27
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51592.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51592.md
index 445f4954806..35cab334832 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51592.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51592.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51592
-title: Step 28
+title: Paso 28
 challengeType: 0
 dashedName: step-28
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51593.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51593.md
index 5da3409e73c..6825822a360 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51593.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51593.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51593
-title: Step 29
+title: Paso 29
 challengeType: 0
 dashedName: step-29
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51594.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51594.md
index 06e43acd7fc..c24fad1a5e4 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51594.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51594.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51594
-title: Step 30
+title: Paso 30
 challengeType: 0
 dashedName: step-30
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51595.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51595.md
index 7b766aa3f42..95e57cdb78e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51595.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51595.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51595
-title: Step 31
+title: Paso 31
 challengeType: 0
 dashedName: step-31
 ---
@@ -142,5 +142,5 @@ body {
   --fcc-editable-region--
 
   --fcc-editable-region--
-  
+
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51596.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51596.md
index f529c198260..67b999e776b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51596.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51596.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51596
-title: Step 32
+title: Paso 32
 challengeType: 0
 dashedName: step-32
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51597.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51597.md
index 4452135e0e8..621b5bdb154 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51597.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51597.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51597
-title: Step 33
+title: Paso 33
 challengeType: 0
 dashedName: step-33
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51598.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51598.md
index cc6008020de..407565e0ba5 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51598.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51598.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51598
-title: Step 34
+title: Paso 34
 challengeType: 0
 dashedName: step-34
 ---
@@ -55,7 +55,7 @@ assert(document.querySelectorAll('.characters > div')?.[1]?.getAttribute('id') =
         <div id="tan-table"></div>
       </div>
       --fcc-editable-region--
-      
+
       --fcc-editable-region--
     </div>
   </body>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51599.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51599.md
index 64752da89e2..69df0367408 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51599.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51599.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51599
-title: Step 35
+title: Paso 35
 challengeType: 0
 dashedName: step-35
 ---
@@ -68,7 +68,7 @@ assert(document.querySelectorAll('#black-character > div')?.[2]?.getAttribute('i
       </div>
       <div id="black-character">
         --fcc-editable-region--
-        
+
         --fcc-editable-region--
       </div>
     </div>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159a.md
index 80566becc9f..dfa3203e9d0 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159a.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5159a
-title: Step 36
+title: Paso 36
 challengeType: 0
 dashedName: step-36
 ---
@@ -68,7 +68,7 @@ assert(second?.classList?.contains('right'));
         <div id="black-hat"></div>
         <div id="gray-mask">
           --fcc-editable-region--
-          
+
           --fcc-editable-region--
         </div>
         <div id="white-paper"></div>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159b.md
index c76ae468664..3be067c80ff 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159b.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5159b
-title: Step 37
+title: Paso 37
 challengeType: 0
 dashedName: step-37
 ---
@@ -72,7 +72,7 @@ for (const icon of icons) {
         </div>
         <div id="white-paper">
           --fcc-editable-region--
-          
+
           --fcc-editable-region--
         </div>
       </div>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159c.md
index 1d94dce8114..677ed8cef4d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159c.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5159c
-title: Step 38
+title: Paso 38
 challengeType: 0
 dashedName: step-38
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159d.md
index 99fa42a9986..68921227eaf 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159d.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5159d
-title: Step 39
+title: Paso 39
 challengeType: 0
 dashedName: step-39
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159e.md
index fe0562636cd..6ea66aa5432 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159e.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5159e
-title: Step 40
+title: Paso 40
 challengeType: 0
 dashedName: step-40
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159f.md
index baae6b354f5..b523398ec28 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159f.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5159f
-title: Step 42
+title: Paso 42
 challengeType: 0
 dashedName: step-42
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a1.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a1.md
index b9b8ef0ae6c..57d3a2b9413 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a1.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a1.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515a1
-title: Step 44
+title: Paso 44
 challengeType: 0
 dashedName: step-44
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a2.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a2.md
index a026481fefc..2fd26e79a9e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a2.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a2.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515a2
-title: Step 45
+title: Paso 45
 challengeType: 0
 dashedName: step-45
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a3.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a3.md
index 7080b496309..0ac3cf2da88 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a3.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a3.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515a3
-title: Step 46
+title: Paso 46
 challengeType: 0
 dashedName: step-46
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a4.md
index 8acdfc0867b..0571cb2c697 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a4.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515a4
-title: Step 47
+title: Paso 47
 challengeType: 0
 dashedName: step-47
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a5.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a5.md
index cd79b72769c..647f18c92a1 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a5.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a5.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515a5
-title: Step 48
+title: Paso 48
 challengeType: 0
 dashedName: step-48
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a6.md
index b925595716c..12a6721ef8d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a6.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515a6
-title: Step 49
+title: Paso 49
 challengeType: 0
 dashedName: step-49
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a7.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a7.md
index 9de059269f0..11fcb48f720 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a7.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a7.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515a7
-title: Step 50
+title: Paso 50
 challengeType: 0
 dashedName: step-50
 ---
@@ -82,7 +82,7 @@ assert(document.querySelectorAll('.characters > div')?.[3]?.getAttribute('id') =
         </div>
       </div>
       --fcc-editable-region--
-      
+
       --fcc-editable-region--
     </div>
   </body>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a8.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a8.md
index 82c4e8d7f2a..53b7c0f4571 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a8.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a8.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515a8
-title: Step 51
+title: Paso 51
 challengeType: 0
 dashedName: step-51
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a9.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a9.md
index 2628b7339b3..9d029074b99 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a9.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a9.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515a9
-title: Step 52
+title: Paso 52
 challengeType: 0
 dashedName: step-52
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515aa.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515aa.md
index ea6dc4a08b8..1ba71f1d7bb 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515aa.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515aa.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515aa
-title: Step 53
+title: Paso 53
 challengeType: 0
 dashedName: step-53
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ab.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ab.md
index 35843a734ef..02bc1286c44 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ab.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ab.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515ab
-title: Step 54
+title: Paso 54
 challengeType: 0
 dashedName: step-54
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ac.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ac.md
index 2ead91a28fe..acb98c7cd9b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ac.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ac.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515ac
-title: Step 55
+title: Paso 55
 challengeType: 0
 dashedName: step-55
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ad.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ad.md
index ac80b322cde..9be0cf03d78 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ad.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ad.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515ad
-title: Step 56
+title: Paso 56
 challengeType: 0
 dashedName: step-56
 ---
@@ -70,7 +70,7 @@ assert(document.querySelectorAll('.characters > div')?.[4]?.getAttribute('id') =
       <div class="blue" id="blue-left"></div>
       <div class="blue" id="blue-right"></div>
       --fcc-editable-region--
-      
+
       --fcc-editable-region--
     </div>
   </body>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ae.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ae.md
index bfd1d018cca..9d9d9b3baef 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ae.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ae.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515ae
-title: Step 57
+title: Paso 57
 challengeType: 0
 dashedName: step-57
 ---
@@ -89,7 +89,7 @@ assert(document.querySelectorAll('#orange-character > div')?.[3]?.getAttribute('
       <div class="blue" id="blue-right"></div>
       <div id="orange-character">
         --fcc-editable-region--
-        
+
         --fcc-editable-region--
       </div>
     </div>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515af.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515af.md
index 48c6238c1c2..aa2796d64ac 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515af.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515af.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515af
-title: Step 58
+title: Paso 58
 challengeType: 0
 dashedName: step-58
 ---
@@ -81,7 +81,7 @@ assert(document.querySelectorAll('#eyes-div > div')?.[1]?.classList?.contains('r
         <div id="black-round-hat"></div>
         <div id="eyes-div">
           --fcc-editable-region--
-          
+
           --fcc-editable-region--
         </div>
         <div id="triangles"></div>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b0.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b0.md
index 366d18b2481..6a3e6d8dbea 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b0.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b0.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515b0
-title: Step 59
+title: Paso 59
 challengeType: 0
 dashedName: step-59
 ---
@@ -80,7 +80,7 @@ for (const div of divDivDiv) {
         </div>
         <div id="triangles">
           --fcc-editable-region--
-          
+
           --fcc-editable-region--
         </div>
         <div id="guitar"></div>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b1.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b1.md
index 38130fa44a2..2b59be2bb44 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b1.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b1.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515b1
-title: Step 60
+title: Paso 60
 challengeType: 0
 dashedName: step-60
 ---
@@ -141,7 +141,7 @@ assert.notExists(document.querySelector('#guitar > #guitar-neck.guitar'));
         </div>
         <div id="guitar">
           --fcc-editable-region--
-          
+
           --fcc-editable-region--
         </div>
       </div>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b2.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b2.md
index 38be428b773..9213076cbd0 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b2.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b2.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515b2
-title: Step 61
+title: Paso 61
 challengeType: 0
 dashedName: step-61
 ---
@@ -119,10 +119,10 @@ assert(document.querySelector('#guitar-right > i')?.classList?.contains('fa-bars
         <div id="guitar">
           --fcc-editable-region--
           <div class="guitar" id="guitar-left">
-          
+
           </div>
           <div class="guitar" id="guitar-right">
-          
+
           </div>
           --fcc-editable-region--
           <div id="guitar-neck"></div>
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b3.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b3.md
index 0b3025790e8..2f4a16bd242 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b3.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b3.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515b3
-title: Step 62
+title: Paso 62
 challengeType: 0
 dashedName: step-62
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b4.md
index 754861f47d0..c922bab2021 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b4.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515b4
-title: Step 63
+title: Paso 63
 challengeType: 0
 dashedName: step-63
 ---
@@ -279,7 +279,7 @@ body {
   height: 550px;
   background-color: rgb(240, 78, 42);
   --fcc-editable-region--
-  
+
   --fcc-editable-region--
 }
 ```
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b5.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b5.md
index d76fca6b4c8..960a5e74f49 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b5.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b5.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515b5
-title: Step 64
+title: Paso 64
 challengeType: 0
 dashedName: step-64
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b6.md
index d8e580eebc1..d5d633345eb 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b6.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515b6
-title: Step 65
+title: Paso 65
 challengeType: 0
 dashedName: step-65
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b7.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b7.md
index 5f43f757585..8fab99d5b96 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b7.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b7.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515b7
-title: Step 66
+title: Paso 66
 challengeType: 0
 dashedName: step-66
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b8.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b8.md
index 630dfa5633b..99e8a3a8b94 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b8.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b8.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515b8
-title: Step 67
+title: Paso 67
 challengeType: 0
 dashedName: step-67
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b9.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b9.md
index 20de7ca5e51..8049cee6312 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b9.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b9.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515b9
-title: Step 68
+title: Paso 68
 challengeType: 0
 dashedName: step-68
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ba.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ba.md
index 02bc007d6c9..8517b44f406 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ba.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ba.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515ba
-title: Step 69
+title: Paso 69
 challengeType: 0
 dashedName: step-69
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bc.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bc.md
index c9d3d036cd7..c1eba2655cd 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bc.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bc.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515bc
-title: Step 70
+title: Paso 70
 challengeType: 0
 dashedName: step-70
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bd.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bd.md
index 15522104562..d81f8c288ec 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bd.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bd.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515bd
-title: Step 79
+title: Paso 79
 challengeType: 0
 dashedName: step-79
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515be.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515be.md
index 96cea01cca3..31505cedd71 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515be.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515be.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515be
-title: Step 80
+title: Paso 80
 challengeType: 0
 dashedName: step-80
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bf.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bf.md
index 92fde860227..d85a5dd0213 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bf.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bf.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515bf
-title: Step 81
+title: Paso 81
 challengeType: 0
 dashedName: step-81
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c0.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c0.md
index 61d8eb4eb0d..d72f1c4ac64 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c0.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c0.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515c0
-title: Step 82
+title: Paso 82
 challengeType: 0
 dashedName: step-82
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c1.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c1.md
index 9aeb95ac779..43f2045f236 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c1.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c1.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515c1
-title: Step 83
+title: Paso 83
 challengeType: 0
 dashedName: step-83
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c2.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c2.md
index 6839773d378..ce0042a5fa0 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c2.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c2.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515c2
-title: Step 84
+title: Paso 84
 challengeType: 0
 dashedName: step-84
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c3.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c3.md
index 315b4c5409f..299a47f53fc 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c3.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c3.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515c3
-title: Step 85
+title: Paso 85
 challengeType: 0
 dashedName: step-85
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c4.md
index 78eed6b9887..432d7b4f4a1 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c4.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515c4
-title: Step 86
+title: Paso 86
 challengeType: 0
 dashedName: step-86
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c5.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c5.md
index ece6f1c39be..7e27dc1f8ba 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c5.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c5.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515c5
-title: Step 87
+title: Paso 87
 challengeType: 0
 dashedName: step-87
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c6.md
index 58e504b96e2..eb749bb1d7f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c6.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515c6
-title: Step 88
+title: Paso 88
 challengeType: 0
 dashedName: step-88
 ---
@@ -11,25 +11,25 @@ For the `class` with value `left`, create the selector and set the `position` to
 
 # --hints--
 
-You should create a new `.left` selector.
+Debes crear un nuevo selector `.left`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.left'));
 ```
 
-Your `.left` selector should have a `position` property set to `absolute`.
+Tu selector `.left` debe tener una propiedad `position` con el valor `absolute`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.left')?.position === 'absolute');
 ```
 
-Your `.left` selector should have a `top` property set to `15px`.
+Tu selector `.left` debe tener una propiedad `top` con el valor `15px`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.left')?.top === '15px');
 ```
 
-Your `.left` selector should have a `left` property set to `30px`.
+Tu selector `.left` debe tener una propiedad `left` con el valor `30px`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('.left')?.left === '30px');
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c7.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c7.md
index a554e05e588..2b29903442c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c7.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c7.md
@@ -1,13 +1,13 @@
 ---
 id: 60b69a66b6ddb80858c515c7
-title: Step 89
+title: Paso 89
 challengeType: 0
 dashedName: step-89
 ---
 
 # --description--
 
-One last step. The FontAwesome icons are a little too small. Target all of them with a `class` selector for `fas`, and set the `font-size` to `30px`.
+Un último paso. The FontAwesome icons are a little too small. Target all of them with a `class` selector for `fas`, and set the `font-size` to `30px`.
 
 With that, your Picasso painting is complete!
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b80da8676fb3227967a731.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b80da8676fb3227967a731.md
index d7bffee9186..053ec906153 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b80da8676fb3227967a731.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b80da8676fb3227967a731.md
@@ -1,6 +1,6 @@
 ---
 id: 60b80da8676fb3227967a731
-title: Step 3
+title: Paso 3
 challengeType: 0
 dashedName: step-3
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba890832b4940f24d1936b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba890832b4940f24d1936b.md
index bb1fc951b69..5eb7ef532d7 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba890832b4940f24d1936b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba890832b4940f24d1936b.md
@@ -1,6 +1,6 @@
 ---
 id: 60ba890832b4940f24d1936b
-title: Step 75
+title: Paso 75
 challengeType: 0
 dashedName: step-75
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba89123a445e0f5c9e4022.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba89123a445e0f5c9e4022.md
index e649ce5154c..bbab615d16c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba89123a445e0f5c9e4022.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba89123a445e0f5c9e4022.md
@@ -1,6 +1,6 @@
 ---
 id: 60ba89123a445e0f5c9e4022
-title: Step 74
+title: Paso 74
 challengeType: 0
 dashedName: step-74
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba8913f1704c0f7a8906b8.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba8913f1704c0f7a8906b8.md
index 4351170e03d..0ff5cadce5c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba8913f1704c0f7a8906b8.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba8913f1704c0f7a8906b8.md
@@ -1,6 +1,6 @@
 ---
 id: 60ba8913f1704c0f7a8906b8
-title: Step 73
+title: Paso 73
 challengeType: 0
 dashedName: step-73
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba89146b25080f99ab54ad.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba89146b25080f99ab54ad.md
index ac4d90d5a9a..d2b32c0ff2e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba89146b25080f99ab54ad.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba89146b25080f99ab54ad.md
@@ -1,6 +1,6 @@
 ---
 id: 60ba89146b25080f99ab54ad
-title: Step 72
+title: Paso 72
 challengeType: 0
 dashedName: step-72
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba8914bab51f0fb8228e9c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba8914bab51f0fb8228e9c.md
index 24839e38369..38a2fe10010 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba8914bab51f0fb8228e9c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba8914bab51f0fb8228e9c.md
@@ -1,6 +1,6 @@
 ---
 id: 60ba8914bab51f0fb8228e9c
-title: Step 71
+title: Paso 71
 challengeType: 0
 dashedName: step-71
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba929345ab0714a3743655.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba929345ab0714a3743655.md
index a14fdbe188a..9cb193d55c6 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba929345ab0714a3743655.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba929345ab0714a3743655.md
@@ -1,6 +1,6 @@
 ---
 id: 60ba929345ab0714a3743655
-title: Step 76
+title: Paso 76
 challengeType: 0
 dashedName: step-76
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba9296d4d6b414c1b10995.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba9296d4d6b414c1b10995.md
index a7e3a17efde..7784fcb4312 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba9296d4d6b414c1b10995.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba9296d4d6b414c1b10995.md
@@ -1,6 +1,6 @@
 ---
 id: 60ba9296d4d6b414c1b10995
-title: Step 77
+title: Paso 77
 challengeType: 0
 dashedName: step-77
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba92987c1e4914dfa7a0b9.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba92987c1e4914dfa7a0b9.md
index b7aca7ee5db..67b35741c50 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba92987c1e4914dfa7a0b9.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba92987c1e4914dfa7a0b9.md
@@ -1,6 +1,6 @@
 ---
 id: 60ba92987c1e4914dfa7a0b9
-title: Step 78
+title: Paso 78
 challengeType: 0
 dashedName: step-78
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60bad32219ebcb4a8810ac6a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60bad32219ebcb4a8810ac6a.md
index 87b39919189..b63367869e6 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60bad32219ebcb4a8810ac6a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60bad32219ebcb4a8810ac6a.md
@@ -1,6 +1,6 @@
 ---
 id: 60bad32219ebcb4a8810ac6a
-title: Step 41
+title: Paso 41
 challengeType: 0
 dashedName: step-41
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612ec19d5268da7074941f84.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612ec19d5268da7074941f84.md
index 8c2374e0a55..df62398a7d7 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612ec19d5268da7074941f84.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612ec19d5268da7074941f84.md
@@ -1,15 +1,15 @@
 ---
 id: 612ec19d5268da7074941f84
-title: Step 32
+title: Paso 32
 challengeType: 0
 dashedName: step-32
 ---
 
 # --description--
 
-Logical operators can be used to construct more complex media queries. The `and` logical operator is used to query two media conditions.
+Es posible aumentar la complejidad de las media queries usando operadores lógicos. El operador lógico `and` es utilizado para combinar en una sola consulta dos características de medios.
 
-For example, a media query that targets a display width between 500px and 1000px would be:
+Por ejemplo, una media query cuyo objetivo es una anchura de pantalla entre 500px y 1000px podría ser:
 
 ```css
 @media (min-width: 500px) and (max-width: 1000px){
@@ -17,17 +17,17 @@ For example, a media query that targets a display width between 500px and 1000px
 }
 ```
 
-Add another `@media` rule to apply if the browser window is wider than `769px` but smaller than `1199px`.
+Añade otra regla `@media` que se aplique si la pantalla del navegador tiene una anchura mayor que `769px` pero menor que `1199px`.
 
 # --hints--
 
-You should add a new `@media` query.
+Debes añadir una nueva `@media` query.
 
 ```js
 assert(new __helpers.CSSHelp(document).getCSSRules('media')?.length === 2);
 ```
 
-Your `@media` query should have a `min-width` of `769px` and a `max-width` of `1199px`.
+Tu `@media` query debe tener una `min-width` de `769px` y una `max-width` de `1199px`.
 
 ```js
 const mediaText = new __helpers.CSSHelp(document).getCSSRules('media')[1]?.media?.mediaText;
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996b.md
index f6733afed95..3473cd5eb83 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996b.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad6996b
-title: Step 2
+title: Paso 2
 challengeType: 0
 dashedName: step-2
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996c.md
index 45b81206b35..2e9eea116d6 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996c.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad6996c
-title: Step 3
+title: Paso 3
 challengeType: 0
 dashedName: step-3
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996d.md
index 765122fc40d..6398e4ac705 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996d.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad6996d
-title: Step 4
+title: Paso 4
 challengeType: 0
 dashedName: step-4
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996e.md
index df9f52fe8a4..c6d63c6f728 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996e.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad6996e
-title: Step 5
+title: Paso 5
 challengeType: 0
 dashedName: step-5
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996f.md
index d5c739abeac..56562c05521 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996f.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad6996f
-title: Step 6
+title: Paso 6
 challengeType: 0
 dashedName: step-6
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69970.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69970.md
index 2dbdf0b6403..4821e51b4bd 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69970.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69970.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69970
-title: Step 7
+title: Paso 7
 challengeType: 0
 dashedName: step-7
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69971.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69971.md
index 5692e34e757..2ff673f44a7 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69971.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69971.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69971
-title: Step 8
+title: Paso 8
 challengeType: 0
 dashedName: step-8
 ---
@@ -9,9 +9,7 @@ dashedName: step-8
 
 Time for CSS.
 
-Even though your `<div>` has no text, it's still treated as a box with content.
-Write a CSS rule that uses the `.canvas` class selector and set its `width` to 500 pixels.
-Here's a CSS rule that sets the width of the class `card` to 300 pixels:
+Even though your `<div>` has no text, it's still treated as a box with content. Write a CSS rule that uses the `.canvas` class selector and set its `width` to 500 pixels. Here's a CSS rule that sets the width of the class `card` to 300 pixels:
 
 ```css
 .card {
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69972.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69972.md
index 65f77ecc018..bb00380e96f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69972.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69972.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69972
-title: Step 9
+title: Paso 9
 challengeType: 0
 dashedName: step-9
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69973.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69973.md
index 6e38ea0aace..a0a1c4e871c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69973.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69973.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69973
-title: Step 10
+title: Paso 10
 challengeType: 0
 dashedName: step-10
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69974.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69974.md
index 2af09ce1ff8..9d83af2ccce 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69974.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69974.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69974
-title: Step 11
+title: Paso 11
 challengeType: 0
 dashedName: step-11
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69975.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69975.md
index 351e6bf526e..f988633ad35 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69975.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69975.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69975
-title: Step 12
+title: Paso 12
 challengeType: 0
 dashedName: step-12
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69976.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69976.md
index a66a09fe26b..cada315d622 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69976.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69976.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69976
-title: Step 13
+title: Paso 13
 challengeType: 0
 dashedName: step-13
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69977.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69977.md
index fffa032b224..dfbf0ed80d5 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69977.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69977.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69977
-title: Step 14
+title: Paso 14
 challengeType: 0
 dashedName: step-14
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69978.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69978.md
index 34a33d9846d..91dce442545 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69978.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69978.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69978
-title: Step 15
+title: Paso 15
 challengeType: 0
 dashedName: step-15
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69979.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69979.md
index 74560ee0541..ac8e242962b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69979.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69979.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69979
-title: Step 16
+title: Paso 16
 challengeType: 0
 dashedName: step-16
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997a.md
index 6490cbccbe0..446551b848c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997a.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad6997a
-title: Step 17
+title: Paso 17
 challengeType: 0
 dashedName: step-17
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997b.md
index 4478884a82d..a66e124fe6f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997b.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad6997b
-title: Step 18
+title: Paso 18
 challengeType: 0
 dashedName: step-18
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997c.md
index bd9e89c942f..c0a9fd1eff6 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997c.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad6997c
-title: Step 19
+title: Paso 19
 challengeType: 0
 dashedName: step-19
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997d.md
index 11b91323bec..b4a83be16da 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997d.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad6997d
-title: Step 20
+title: Paso 20
 challengeType: 0
 dashedName: step-20
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997e.md
index 902607455a2..1f8b6fc0783 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997e.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad6997e
-title: Step 21
+title: Paso 21
 challengeType: 0
 dashedName: step-21
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997f.md
index 05297dd3a73..9f4bfaae89b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997f.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad6997f
-title: Step 22
+title: Paso 22
 challengeType: 0
 dashedName: step-22
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69980.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69980.md
index 94455c3665d..59881b438c3 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69980.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69980.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69980
-title: Step 23
+title: Paso 23
 challengeType: 0
 dashedName: step-23
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69981.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69981.md
index da0bd2e49db..c1db512e4ed 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69981.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69981.md
@@ -1,17 +1,17 @@
 ---
 id: 60a3e3396c7b40068ad69981
-title: Step 24
+title: Paso 24
 challengeType: 0
 dashedName: step-24
 ---
 
 # --description--
 
-Create a new CSS rule using the `.two` selector and set its `width` to 475 pixels.
+Crea una nueva regla CSS usando el selector `.two` y establece su `width` a 475 píxeles.
 
 # --hints--
 
-You should have a `.two` selector.
+Debes tener un selector `.two`.
 
 ```js
 const hasTwo = new __helpers.CSSHelp(document).getStyle('.two');
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69982.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69982.md
index 6a7eb6c6d08..86288cbc56c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69982.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69982.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69982
-title: Step 25
+title: Paso 25
 challengeType: 0
 dashedName: step-25
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69983.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69983.md
index 19608f2692a..ad05afb5fa8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69983.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69983.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69983
-title: Step 26
+title: Paso 26
 challengeType: 0
 dashedName: step-26
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69984.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69984.md
index 2def25b262f..76da04df8ca 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69984.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69984.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69984
-title: Step 27
+title: Paso 27
 challengeType: 0
 dashedName: step-27
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69986.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69986.md
index 5994749bd4f..3dd47766dfa 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69986.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69986.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69986
-title: Step 28
+title: Paso 28
 challengeType: 0
 dashedName: step-28
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69987.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69987.md
index 1376ec85ccf..64f439e6218 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69987.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69987.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69987
-title: Step 29
+title: Paso 29
 challengeType: 0
 dashedName: step-29
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69988.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69988.md
index c1a860a8182..9205e213fbe 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69988.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69988.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69988
-title: Step 30
+title: Paso 30
 challengeType: 0
 dashedName: step-30
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69989.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69989.md
index b5a40dfd37c..320cb29a702 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69989.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69989.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69989
-title: Step 31
+title: Paso 31
 challengeType: 0
 dashedName: step-31
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998a.md
index 3ed4e87a89a..d3380c3452d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998a.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad6998a
-title: Step 32
+title: Paso 32
 challengeType: 0
 dashedName: step-32
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998b.md
index e16dc6aa513..2490bfe0f9a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998b.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad6998b
-title: Step 33
+title: Paso 33
 challengeType: 0
 dashedName: step-33
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998c.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998c.md
index fac990dcb91..c5d3d55b4d8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998c.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998c.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad6998c
-title: Step 34
+title: Paso 34
 challengeType: 0
 dashedName: step-34
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998d.md
index 6ac741a3989..42116a7becd 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998d.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad6998d
-title: Step 35
+title: Paso 35
 challengeType: 0
 dashedName: step-35
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998e.md
index 504855f1620..eb2e5fcacad 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998e.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad6998e
-title: Step 36
+title: Paso 36
 challengeType: 0
 dashedName: step-36
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998f.md
index 251253face2..27f0818270d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998f.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad6998f
-title: Step 37
+title: Paso 37
 challengeType: 0
 dashedName: step-37
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69990.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69990.md
index 8ecac547a24..18d3b3c8068 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69990.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69990.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69990
-title: Step 38
+title: Paso 38
 challengeType: 0
 dashedName: step-38
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69991.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69991.md
index a0e9e6ae11b..d9bffb865fd 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69991.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69991.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69991
-title: Step 39
+title: Paso 39
 challengeType: 0
 dashedName: step-39
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69992.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69992.md
index f26f0c94b90..115c85a038b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69992.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69992.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69992
-title: Step 40
+title: Paso 40
 challengeType: 0
 dashedName: step-40
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69993.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69993.md
index e3effb601d3..c517f6a6706 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69993.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69993.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69993
-title: Step 41
+title: Paso 41
 challengeType: 0
 dashedName: step-41
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69994.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69994.md
index 6656f427a1b..892e50c6cb6 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69994.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69994.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69994
-title: Step 42
+title: Paso 42
 challengeType: 0
 dashedName: step-42
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69995.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69995.md
index 14e9bd84d52..686f3b2fe12 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69995.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69995.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69995
-title: Step 43
+title: Paso 43
 challengeType: 0
 dashedName: step-43
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69996.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69996.md
index ed50b6b0893..9c18e8f2b6a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69996.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69996.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69996
-title: Step 44
+title: Paso 44
 challengeType: 0
 dashedName: step-44
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69997.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69997.md
index 9bce8c93963..41487d7fdb8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69997.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69997.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69997
-title: Step 45
+title: Paso 45
 challengeType: 0
 dashedName: step-45
 ---
@@ -9,7 +9,7 @@ dashedName: step-45
 
 Rotate `.three` counter clockwise by 0.2 degrees.
 
-With this final step, your Rothko painting is now complete.
+Con este paso final, tu pintura de Rothko ha sido completada.
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f2abbe7d18d49a1e0e1c8.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f2abbe7d18d49a1e0e1c8.md
index 4526afe38b1..9fca1833551 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f2abbe7d18d49a1e0e1c8.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f2abbe7d18d49a1e0e1c8.md
@@ -1,6 +1,6 @@
 ---
 id: 615f2abbe7d18d49a1e0e1c8
-title: Step 1
+title: Paso 1
 challengeType: 0
 dashedName: step-1
 ---
@@ -13,19 +13,19 @@ Create an `h1` element within your `body` element and give it the text `Nutritio
 
 # --hints--
 
-You should add a new `h1` element.
+Deberías añadir un nuevo elemento `h1`.
 
 ```js
 assert.exists(document.querySelector('h1'));
 ```
 
-Your `h1` element should be within your `body` element.
+Tu elemento `h1` debe estar dentro de tu elemento `body`.
 
 ```js
 assert(document.querySelector('h1')?.parentElement?.localName === 'body');
 ```
 
-Your `h1` element should have the text `Nutrition Facts`.
+Tu elemento `h1` debe tener el texto `Nutrition Facts`.
 
 ```js
 assert(document.querySelector('h1')?.innerText === 'Nutrition Facts');
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f2d4150fe0d4cbd0f2628.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f2d4150fe0d4cbd0f2628.md
index 11b8188cc98..d99e7b9b3bb 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f2d4150fe0d4cbd0f2628.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f2d4150fe0d4cbd0f2628.md
@@ -1,6 +1,6 @@
 ---
 id: 615f2d4150fe0d4cbd0f2628
-title: Step 2
+title: Paso 2
 challengeType: 0
 dashedName: step-2
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f34948891834dd77655a6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f34948891834dd77655a6.md
index 94213e09246..b3680dc9a58 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f34948891834dd77655a6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f34948891834dd77655a6.md
@@ -1,6 +1,6 @@
 ---
 id: 615f34948891834dd77655a6
-title: Step 3
+title: Paso 3
 challengeType: 0
 dashedName: step-3
 ---
@@ -50,7 +50,7 @@ assert(document.querySelectorAll('p')?.[1]?.innerText === 'Serving size 2/3 cup
   <body>
     <h1>Nutrition Facts</h1>
     <p>8 servings per container</p>
-    
+
   </body>
 </html>
 --fcc-editable-region--
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f34ecc1091b4fd5a8a484.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f34ecc1091b4fd5a8a484.md
index 76f425c598b..e8d518d9b1b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f34ecc1091b4fd5a8a484.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f34ecc1091b4fd5a8a484.md
@@ -1,6 +1,6 @@
 ---
 id: 615f34ecc1091b4fd5a8a484
-title: Step 4
+title: Paso 4
 challengeType: 0
 dashedName: step-4
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f357957e370510f21ea16.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f357957e370510f21ea16.md
index ad1b189bed0..17e2d995ad3 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f357957e370510f21ea16.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f357957e370510f21ea16.md
@@ -1,6 +1,6 @@
 ---
 id: 615f357957e370510f21ea16
-title: Step 5
+title: Paso 5
 challengeType: 0
 dashedName: step-5
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f378014c2da526a109c81.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f378014c2da526a109c81.md
index 52a336e0522..637896d51ef 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f378014c2da526a109c81.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f378014c2da526a109c81.md
@@ -1,6 +1,6 @@
 ---
 id: 615f378014c2da526a109c81
-title: Step 6
+title: Paso 6
 challengeType: 0
 dashedName: step-6
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f38279e5c3d53692ea441.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f38279e5c3d53692ea441.md
index 96e33cc1a34..b6d54f7a301 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f38279e5c3d53692ea441.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f38279e5c3d53692ea441.md
@@ -1,6 +1,6 @@
 ---
 id: 615f38279e5c3d53692ea441
-title: Step 7
+title: Paso 7
 challengeType: 0
 dashedName: step-7
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f38cabc64e3556f98cc1a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f38cabc64e3556f98cc1a.md
index 13f5f2593b8..b3dfb3714af 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f38cabc64e3556f98cc1a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f38cabc64e3556f98cc1a.md
@@ -1,6 +1,6 @@
 ---
 id: 615f38cabc64e3556f98cc1a
-title: Step 8
+title: Paso 8
 challengeType: 0
 dashedName: step-8
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3949f58e12577dcefb00.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3949f58e12577dcefb00.md
index 9f08de011e6..29097583345 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3949f58e12577dcefb00.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3949f58e12577dcefb00.md
@@ -1,6 +1,6 @@
 ---
 id: 615f3949f58e12577dcefb00
-title: Step 9
+title: Paso 9
 challengeType: 0
 dashedName: step-9
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f39d7da41b15851fa3fb9.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f39d7da41b15851fa3fb9.md
index f273bf9a263..b94f68df7bd 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f39d7da41b15851fa3fb9.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f39d7da41b15851fa3fb9.md
@@ -1,6 +1,6 @@
 ---
 id: 615f39d7da41b15851fa3fb9
-title: Step 10
+title: Paso 10
 challengeType: 0
 dashedName: step-10
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3b091162165948e1cb33.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3b091162165948e1cb33.md
index 63304b702e4..c2715028b0d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3b091162165948e1cb33.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3b091162165948e1cb33.md
@@ -1,6 +1,6 @@
 ---
 id: 615f3b091162165948e1cb33
-title: Step 11
+title: Paso 11
 challengeType: 0
 dashedName: step-11
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3cafd794015aa9547a6d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3cafd794015aa9547a6d.md
index cb116abcc95..709c1d052c2 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3cafd794015aa9547a6d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3cafd794015aa9547a6d.md
@@ -1,6 +1,6 @@
 ---
 id: 615f3cafd794015aa9547a6d
-title: Step 12
+title: Paso 12
 challengeType: 0
 dashedName: step-12
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3d9e59db4b5b8e960762.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3d9e59db4b5b8e960762.md
index 43f69ec85a5..b127effd477 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3d9e59db4b5b8e960762.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3d9e59db4b5b8e960762.md
@@ -1,6 +1,6 @@
 ---
 id: 615f3d9e59db4b5b8e960762
-title: Step 13
+title: Paso 13
 challengeType: 0
 dashedName: step-13
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3e1b7233ee5c7595771f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3e1b7233ee5c7595771f.md
index a0c09b066dc..e12c553f231 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3e1b7233ee5c7595771f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3e1b7233ee5c7595771f.md
@@ -1,6 +1,6 @@
 ---
 id: 615f3e1b7233ee5c7595771f
-title: Step 14
+title: Paso 14
 challengeType: 0
 dashedName: step-14
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3ed16592445e57941aec.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3ed16592445e57941aec.md
index 56ea0615281..5b271b8c604 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3ed16592445e57941aec.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3ed16592445e57941aec.md
@@ -1,6 +1,6 @@
 ---
 id: 615f3ed16592445e57941aec
-title: Step 16
+title: Paso 16
 challengeType: 0
 dashedName: step-16
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f405b89a7ec5f8e2d11f4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f405b89a7ec5f8e2d11f4.md
index 84de4ac6133..ce552603949 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f405b89a7ec5f8e2d11f4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f405b89a7ec5f8e2d11f4.md
@@ -1,6 +1,6 @@
 ---
 id: 615f405b89a7ec5f8e2d11f4
-title: Step 17
+title: Paso 17
 challengeType: 0
 dashedName: step-17
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f40b01f680e608d360ed4.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f40b01f680e608d360ed4.md
index 79da01c2a7f..9503ebe0579 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f40b01f680e608d360ed4.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f40b01f680e608d360ed4.md
@@ -1,6 +1,6 @@
 ---
 id: 615f40b01f680e608d360ed4
-title: Step 18
+title: Paso 18
 challengeType: 0
 dashedName: step-18
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4172e9eec061d6456221.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4172e9eec061d6456221.md
index 9fea5c17ce0..262ef857379 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4172e9eec061d6456221.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4172e9eec061d6456221.md
@@ -1,6 +1,6 @@
 ---
 id: 615f4172e9eec061d6456221
-title: Step 19
+title: Paso 19
 challengeType: 0
 dashedName: step-19
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f41c979787462e76dab90.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f41c979787462e76dab90.md
index 56e13a5ed71..853313bdd25 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f41c979787462e76dab90.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f41c979787462e76dab90.md
@@ -1,6 +1,6 @@
 ---
 id: 615f41c979787462e76dab90
-title: Step 20
+title: Paso 20
 challengeType: 0
 dashedName: step-20
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f423cf65d5864132a0956.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f423cf65d5864132a0956.md
index de2bc32eb1e..8feede39ced 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f423cf65d5864132a0956.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f423cf65d5864132a0956.md
@@ -1,6 +1,6 @@
 ---
 id: 615f423cf65d5864132a0956
-title: Step 21
+title: Paso 21
 challengeType: 0
 dashedName: step-21
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f42a021625f656101ef93.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f42a021625f656101ef93.md
index 11cdbeaca13..395f1cb6a7e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f42a021625f656101ef93.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f42a021625f656101ef93.md
@@ -1,6 +1,6 @@
 ---
 id: 615f42a021625f656101ef93
-title: Step 22
+title: Paso 22
 challengeType: 0
 dashedName: step-22
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4bfb9de4a16703b56eb6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4bfb9de4a16703b56eb6.md
index a827ed632ca..cb0fd94d539 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4bfb9de4a16703b56eb6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4bfb9de4a16703b56eb6.md
@@ -1,6 +1,6 @@
 ---
 id: 615f4bfb9de4a16703b56eb6
-title: Step 23
+title: Paso 23
 challengeType: 0
 dashedName: step-23
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4ce9d877b668417c0c42.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4ce9d877b668417c0c42.md
index c613e7f30f1..bcab2fffd8d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4ce9d877b668417c0c42.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4ce9d877b668417c0c42.md
@@ -1,6 +1,6 @@
 ---
 id: 615f4ce9d877b668417c0c42
-title: Step 24
+title: Paso 24
 challengeType: 0
 dashedName: step-24
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4dde9d72e3694cb9ee3b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4dde9d72e3694cb9ee3b.md
index d7c0c3f1f41..873ba35d407 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4dde9d72e3694cb9ee3b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4dde9d72e3694cb9ee3b.md
@@ -1,6 +1,6 @@
 ---
 id: 615f4dde9d72e3694cb9ee3b
-title: Step 25
+title: Paso 25
 challengeType: 0
 dashedName: step-25
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4ec58334106a4170c2a8.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4ec58334106a4170c2a8.md
index 2fd85ad3563..4e294f3b0f8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4ec58334106a4170c2a8.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4ec58334106a4170c2a8.md
@@ -1,6 +1,6 @@
 ---
 id: 615f4ec58334106a4170c2a8
-title: Step 26
+title: Paso 26
 challengeType: 0
 dashedName: step-26
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4f9e4a40566b776a8f38.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4f9e4a40566b776a8f38.md
index 5b5d116e022..41b3424d46d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4f9e4a40566b776a8f38.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f4f9e4a40566b776a8f38.md
@@ -1,6 +1,6 @@
 ---
 id: 615f4f9e4a40566b776a8f38
-title: Step 27
+title: Paso 27
 challengeType: 0
 dashedName: step-27
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f50473cc0196c6dd3892a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f50473cc0196c6dd3892a.md
index 156382a73d0..fb5e84a05d9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f50473cc0196c6dd3892a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f50473cc0196c6dd3892a.md
@@ -1,6 +1,6 @@
 ---
 id: 615f50473cc0196c6dd3892a
-title: Step 28
+title: Paso 28
 challengeType: 0
 dashedName: step-28
 ---
@@ -9,7 +9,7 @@ dashedName: step-28
 
 You may notice there is still a small border at the bottom of your `.lg` element. To reset this, give your `.lg, .md` selector a `border` property set to `0`.
 
-Note: the `md`(medium) class will be utilized in step 37 for the thinner bars of the nutrition label. 
+Note: the `md`(medium) class will be utilized in step 37 for the thinner bars of the nutrition label.
 
 # --hints--
 
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f51257a8a516d80b6c743.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f51257a8a516d80b6c743.md
index cc1b6599b46..8a8fa5c3f2d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f51257a8a516d80b6c743.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f51257a8a516d80b6c743.md
@@ -1,6 +1,6 @@
 ---
 id: 615f51257a8a516d80b6c743
-title: Step 29
+title: Paso 29
 challengeType: 0
 dashedName: step-29
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f51e4e5b24a6e80eccce1.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f51e4e5b24a6e80eccce1.md
index b84b3468ee9..7fb1397dc25 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f51e4e5b24a6e80eccce1.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f51e4e5b24a6e80eccce1.md
@@ -1,6 +1,6 @@
 ---
 id: 615f51e4e5b24a6e80eccce1
-title: Step 30
+title: Paso 30
 challengeType: 0
 dashedName: step-30
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f522dea4f776f64dc3e91.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f522dea4f776f64dc3e91.md
index e1e10c1c30f..ebd02dfec3f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f522dea4f776f64dc3e91.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f522dea4f776f64dc3e91.md
@@ -1,6 +1,6 @@
 ---
 id: 615f522dea4f776f64dc3e91
-title: Step 31
+title: Paso 31
 challengeType: 0
 dashedName: step-31
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f5486b8fd4b71633f69b0.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f5486b8fd4b71633f69b0.md
index 17a0c4e20f7..b28eac4b1dc 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f5486b8fd4b71633f69b0.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f5486b8fd4b71633f69b0.md
@@ -1,6 +1,6 @@
 ---
 id: 615f5486b8fd4b71633f69b0
-title: Step 32
+title: Paso 32
 challengeType: 0
 dashedName: step-32
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f575b50b91e72af079480.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f575b50b91e72af079480.md
index d4458ee3f7e..f05b8a5b0d7 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f575b50b91e72af079480.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f575b50b91e72af079480.md
@@ -1,6 +1,6 @@
 ---
 id: 615f575b50b91e72af079480
-title: Step 33
+title: Paso 33
 challengeType: 0
 dashedName: step-33
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f5af373a68e744a3c5a76.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f5af373a68e744a3c5a76.md
index f53ef470cf7..0336fd2aa2b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f5af373a68e744a3c5a76.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f5af373a68e744a3c5a76.md
@@ -1,6 +1,6 @@
 ---
 id: 615f5af373a68e744a3c5a76
-title: Step 34
+title: Paso 34
 challengeType: 0
 dashedName: step-34
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f5c1cb7575c7551ed8a40.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f5c1cb7575c7551ed8a40.md
index cfd6cc33c9e..b81092ec55b 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f5c1cb7575c7551ed8a40.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f5c1cb7575c7551ed8a40.md
@@ -1,6 +1,6 @@
 ---
 id: 615f5c1cb7575c7551ed8a40
-title: Step 35
+title: Paso 35
 challengeType: 0
 dashedName: step-35
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f5fd85d0062761f288364.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f5fd85d0062761f288364.md
index 9d68b8354d1..8a320eccc54 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f5fd85d0062761f288364.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f5fd85d0062761f288364.md
@@ -1,6 +1,6 @@
 ---
 id: 615f5fd85d0062761f288364
-title: Step 36
+title: Paso 36
 challengeType: 0
 dashedName: step-36
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f61338c8ca176d6445574.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f61338c8ca176d6445574.md
index b9b50a67f0b..e82a5b539e9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f61338c8ca176d6445574.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f61338c8ca176d6445574.md
@@ -1,6 +1,6 @@
 ---
 id: 615f61338c8ca176d6445574
-title: Step 37
+title: Paso 37
 challengeType: 0
 dashedName: step-37
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f666ac5edea782feb7e75.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f666ac5edea782feb7e75.md
index 235c6490c3a..d7fc70d097c 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f666ac5edea782feb7e75.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f666ac5edea782feb7e75.md
@@ -1,6 +1,6 @@
 ---
 id: 615f666ac5edea782feb7e75
-title: Step 38
+title: Paso 38
 challengeType: 0
 dashedName: step-38
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f671b6d1919792745aa5d.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f671b6d1919792745aa5d.md
index 62fb6ca61de..be44918bee8 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f671b6d1919792745aa5d.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f671b6d1919792745aa5d.md
@@ -1,6 +1,6 @@
 ---
 id: 615f671b6d1919792745aa5d
-title: Step 39
+title: Paso 39
 challengeType: 0
 dashedName: step-39
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f6823d0815b7a991f2a75.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f6823d0815b7a991f2a75.md
index 80707dcd715..8eafbd85211 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f6823d0815b7a991f2a75.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f6823d0815b7a991f2a75.md
@@ -1,6 +1,6 @@
 ---
 id: 615f6823d0815b7a991f2a75
-title: Step 40
+title: Paso 40
 challengeType: 0
 dashedName: step-40
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f6a7d4ba8037bc086c2c7.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f6a7d4ba8037bc086c2c7.md
index 655b881bfe7..d04ab725fb9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f6a7d4ba8037bc086c2c7.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f6a7d4ba8037bc086c2c7.md
@@ -1,6 +1,6 @@
 ---
 id: 615f6a7d4ba8037bc086c2c7
-title: Step 41
+title: Paso 41
 challengeType: 0
 dashedName: step-41
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f6b2d164f81809efd9bdc.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f6b2d164f81809efd9bdc.md
index 7cb965c2767..a2ec8312ffd 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f6b2d164f81809efd9bdc.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f6b2d164f81809efd9bdc.md
@@ -1,6 +1,6 @@
 ---
 id: 615f6b2d164f81809efd9bdc
-title: Step 42
+title: Paso 42
 challengeType: 0
 dashedName: step-42
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f6cc778f7698258467596.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f6cc778f7698258467596.md
index 054289a7759..27215727b89 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f6cc778f7698258467596.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f6cc778f7698258467596.md
@@ -1,6 +1,6 @@
 ---
 id: 615f6cc778f7698258467596
-title: Step 43
+title: Paso 43
 challengeType: 0
 dashedName: step-43
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f6fddaac1e083502d3e6a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f6fddaac1e083502d3e6a.md
index 569f99e7715..59171a36ea5 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f6fddaac1e083502d3e6a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f6fddaac1e083502d3e6a.md
@@ -1,6 +1,6 @@
 ---
 id: 615f6fddaac1e083502d3e6a
-title: Step 44
+title: Paso 44
 challengeType: 0
 dashedName: step-44
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f70077a4ff98424236c1e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f70077a4ff98424236c1e.md
index 592f9c3bd85..3b5a2d63c6f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f70077a4ff98424236c1e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f70077a4ff98424236c1e.md
@@ -1,6 +1,6 @@
 ---
 id: 615f70077a4ff98424236c1e
-title: Step 45
+title: Paso 45
 challengeType: 0
 dashedName: step-45
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f72a872354a850d4f533e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f72a872354a850d4f533e.md
index 1f363003d93..f3810976d06 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f72a872354a850d4f533e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f72a872354a850d4f533e.md
@@ -1,6 +1,6 @@
 ---
 id: 615f72a872354a850d4f533e
-title: Step 46
+title: Paso 46
 challengeType: 0
 dashedName: step-46
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f74a71f1e498619e38ee8.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f74a71f1e498619e38ee8.md
index 8adb2317608..d275a78a8ad 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f74a71f1e498619e38ee8.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f74a71f1e498619e38ee8.md
@@ -1,6 +1,6 @@
 ---
 id: 615f74a71f1e498619e38ee8
-title: Step 47
+title: Paso 47
 challengeType: 0
 dashedName: step-47
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7ad94380408d971d14f6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7ad94380408d971d14f6.md
index 008b34a3751..bcd82a50545 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7ad94380408d971d14f6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7ad94380408d971d14f6.md
@@ -1,13 +1,13 @@
 ---
 id: 615f7ad94380408d971d14f6
-title: Step 48
+title: Paso 48
 challengeType: 0
 dashedName: step-48
 ---
 
 # --description--
 
-The `:not` pseudo-selector can be used to select all elements that do not match the given CSS rule. 
+The `:not` pseudo-selector can be used to select all elements that do not match the given CSS rule.
 
 ```css
 div:not(#example) {
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7bc680f7168ea01ebf99.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7bc680f7168ea01ebf99.md
index 048f474b01d..65b30424ad3 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7bc680f7168ea01ebf99.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7bc680f7168ea01ebf99.md
@@ -1,6 +1,6 @@
 ---
 id: 615f7bc680f7168ea01ebf99
-title: Step 49
+title: Paso 49
 challengeType: 0
 dashedName: step-49
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7c71eab8218f846e4503.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7c71eab8218f846e4503.md
index c1b73b41197..d4b8f438538 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7c71eab8218f846e4503.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7c71eab8218f846e4503.md
@@ -1,6 +1,6 @@
 ---
 id: 615f7c71eab8218f846e4503
-title: Step 50
+title: Paso 50
 challengeType: 0
 dashedName: step-50
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7d489a581590d1350288.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7d489a581590d1350288.md
index 8540c74155e..b749ec9018a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7d489a581590d1350288.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7d489a581590d1350288.md
@@ -1,6 +1,6 @@
 ---
 id: 615f7d489a581590d1350288
-title: Step 51
+title: Paso 51
 challengeType: 0
 dashedName: step-51
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7de4487b64919bb4aa5e.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7de4487b64919bb4aa5e.md
index 405e0647f87..f3a7e548f88 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7de4487b64919bb4aa5e.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7de4487b64919bb4aa5e.md
@@ -1,6 +1,6 @@
 ---
 id: 615f7de4487b64919bb4aa5e
-title: Step 52
+title: Paso 52
 challengeType: 0
 dashedName: step-52
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7e7281626a92bbd62da8.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7e7281626a92bbd62da8.md
index 432939d693b..89ed082412d 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7e7281626a92bbd62da8.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7e7281626a92bbd62da8.md
@@ -1,6 +1,6 @@
 ---
 id: 615f7e7281626a92bbd62da8
-title: Step 53
+title: Paso 53
 challengeType: 0
 dashedName: step-53
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7ecb09de9a938ef94756.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7ecb09de9a938ef94756.md
index 815359307b7..21596a1f418 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7ecb09de9a938ef94756.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7ecb09de9a938ef94756.md
@@ -1,6 +1,6 @@
 ---
 id: 615f7ecb09de9a938ef94756
-title: Step 54
+title: Paso 54
 challengeType: 0
 dashedName: step-54
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7fa959ab75948f96a0d6.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7fa959ab75948f96a0d6.md
index e4b6b8e2f57..3adbb61bd7f 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7fa959ab75948f96a0d6.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7fa959ab75948f96a0d6.md
@@ -1,6 +1,6 @@
 ---
 id: 615f7fa959ab75948f96a0d6
-title: Step 55
+title: Paso 55
 challengeType: 0
 dashedName: step-55
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f808d85793195b0f53be9.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f808d85793195b0f53be9.md
index 1bcd018908d..a4a290bc04e 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f808d85793195b0f53be9.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f808d85793195b0f53be9.md
@@ -1,6 +1,6 @@
 ---
 id: 615f808d85793195b0f53be9
-title: Step 56
+title: Paso 56
 challengeType: 0
 dashedName: step-56
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f829d07b18f96f6f6684b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f829d07b18f96f6f6684b.md
index 4b68bdd6b66..e8337a082fc 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f829d07b18f96f6f6684b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f829d07b18f96f6f6684b.md
@@ -1,6 +1,6 @@
 ---
 id: 615f829d07b18f96f6f6684b
-title: Step 57
+title: Paso 57
 challengeType: 0
 dashedName: step-57
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f83ef928ec9982b785b6a.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f83ef928ec9982b785b6a.md
index f120cb64b2f..dc3f50df9b1 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f83ef928ec9982b785b6a.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f83ef928ec9982b785b6a.md
@@ -1,6 +1,6 @@
 ---
 id: 615f83ef928ec9982b785b6a
-title: Step 58
+title: Paso 58
 challengeType: 0
 dashedName: step-58
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f84f246e8ba98e3cd97be.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f84f246e8ba98e3cd97be.md
index 64d06a660a5..00b9082c8b9 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f84f246e8ba98e3cd97be.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f84f246e8ba98e3cd97be.md
@@ -1,6 +1,6 @@
 ---
 id: 615f84f246e8ba98e3cd97be
-title: Step 59
+title: Paso 59
 challengeType: 0
 dashedName: step-59
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f887466db4ba14b5342cc.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f887466db4ba14b5342cc.md
index cd8f2458700..77f35cb1f21 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f887466db4ba14b5342cc.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f887466db4ba14b5342cc.md
@@ -1,6 +1,6 @@
 ---
 id: 615f887466db4ba14b5342cc
-title: Step 60
+title: Paso 60
 challengeType: 0
 dashedName: step-60
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f89e055040ba294719d2f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f89e055040ba294719d2f.md
index a2328b173c3..733aef66863 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f89e055040ba294719d2f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f89e055040ba294719d2f.md
@@ -1,6 +1,6 @@
 ---
 id: 615f89e055040ba294719d2f
-title: Step 61
+title: Paso 61
 challengeType: 0
 dashedName: step-61
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f8bfe0f30a1a3c340356b.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f8bfe0f30a1a3c340356b.md
index 82801b25679..e08015618a1 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f8bfe0f30a1a3c340356b.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f8bfe0f30a1a3c340356b.md
@@ -1,6 +1,6 @@
 ---
 id: 615f8bfe0f30a1a3c340356b
-title: Step 62
+title: Paso 62
 challengeType: 0
 dashedName: step-62
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f8f1223601fa546e93f31.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f8f1223601fa546e93f31.md
index d9873550e4d..ba71aa7776a 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f8f1223601fa546e93f31.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f8f1223601fa546e93f31.md
@@ -1,6 +1,6 @@
 ---
 id: 615f8f1223601fa546e93f31
-title: Step 63
+title: Paso 63
 challengeType: 0
 dashedName: step-63
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f905fbd1017a65ca224eb.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f905fbd1017a65ca224eb.md
index 540ab15d1a3..533b0b9a307 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f905fbd1017a65ca224eb.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f905fbd1017a65ca224eb.md
@@ -1,6 +1,6 @@
 ---
 id: 615f905fbd1017a65ca224eb
-title: Step 64
+title: Paso 64
 challengeType: 0
 dashedName: step-64
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f94786869e1a7fec54375.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f94786869e1a7fec54375.md
index 7f44865429f..824d92e9837 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f94786869e1a7fec54375.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f94786869e1a7fec54375.md
@@ -1,6 +1,6 @@
 ---
 id: 615f94786869e1a7fec54375
-title: Step 65
+title: Paso 65
 challengeType: 0
 dashedName: step-65
 ---
diff --git a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f951dff9317a900ef683f.md b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f951dff9317a900ef683f.md
index cecb81aeeb4..f40bdeb7b93 100644
--- a/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f951dff9317a900ef683f.md
+++ b/curriculum/challenges/espanol/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f951dff9317a900ef683f.md
@@ -1,6 +1,6 @@
 ---
 id: 615f951dff9317a900ef683f
-title: Step 66
+title: Paso 66
 challengeType: 0
 dashedName: step-66
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a115879a6d51422652cbfc.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a115879a6d51422652cbfc.md
index 02a51b6a178..3e888b1ba1c 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a115879a6d51422652cbfc.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a115879a6d51422652cbfc.md
@@ -1,6 +1,6 @@
 ---
 id: 62a115879a6d51422652cbfc
-title: Step 2
+title: Paso 2
 challengeType: 0
 dashedName: step-2
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a1166ed9a56d439c0770e7.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a1166ed9a56d439c0770e7.md
index 32588eccbae..263535b5f73 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a1166ed9a56d439c0770e7.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a1166ed9a56d439c0770e7.md
@@ -1,6 +1,6 @@
 ---
 id: 62a1166ed9a56d439c0770e7
-title: Step 3
+title: Paso 3
 challengeType: 0
 dashedName: step-3
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23c1d505bfa13747c8a9b.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23c1d505bfa13747c8a9b.md
index 5c62cdc804a..b82db76b060 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23c1d505bfa13747c8a9b.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23c1d505bfa13747c8a9b.md
@@ -1,6 +1,6 @@
 ---
 id: 62a23c1d505bfa13747c8a9b
-title: Step 4
+title: Paso 4
 challengeType: 0
 dashedName: step-4
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23cb9bc467a147516b500.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23cb9bc467a147516b500.md
index 5a36b14c83c..c978cebdadc 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23cb9bc467a147516b500.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23cb9bc467a147516b500.md
@@ -1,6 +1,6 @@
 ---
 id: 62a23cb9bc467a147516b500
-title: Step 5
+title: Paso 5
 challengeType: 0
 dashedName: step-5
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23d1c5f1c93161f3582ae.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23d1c5f1c93161f3582ae.md
index d5d8c611c5c..f0e131b20bf 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23d1c5f1c93161f3582ae.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23d1c5f1c93161f3582ae.md
@@ -1,13 +1,13 @@
 ---
 id: 62a23d1c5f1c93161f3582ae
-title: Step 6
+title: Paso 6
 challengeType: 0
 dashedName: step-6
 ---
 
 # --description--
 
-Similar to your `#stats` element, your `#monsterStats` element needs two `span` elements. Give them the class `stat` and give the first element the text `Monster Name: ` and the second the text `Health: `. After the text in each, add a `strong` element with an empty nested `span` element.
+Similar to your `#stats` element, your `#monsterStats` element needs two `span` elements. Give them the class `stat` and give the first element the text `Monster Name:` and the second the text `Health:`. After the text in each, add a `strong` element with an empty nested `span` element.
 
 # --hints--
 
@@ -26,14 +26,14 @@ assert.equal(spans[0].className, 'stat');
 assert.equal(spans[1].className, 'stat');
 ```
 
-Your first `span` element should have the text `Monster Name: `. Make sure the spacing is correct.
+Your first `span` element should have the text `Monster Name:`. Make sure the spacing is correct.
 
 ```js
 const spans = document.querySelectorAll(`#monsterStats > span`);
 assert.equal(spans[0].innerText, 'Monster Name: ');
 ```
 
-Your second `span` element should have the text `Health: `. Make sure the spacing is correct.
+Your second `span` element should have the text `Health:`. Make sure the spacing is correct.
 
 ```js
 const spans = document.querySelectorAll(`#monsterStats > span`);
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a2401b9842721796b72850.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a2401b9842721796b72850.md
index 2ffdc00b64b..989a5c34487 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a2401b9842721796b72850.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a2401b9842721796b72850.md
@@ -1,6 +1,6 @@
 ---
 id: 62a2401b9842721796b72850
-title: Step 7
+title: Paso 7
 challengeType: 0
 dashedName: step-7
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a24068d60b671847d1d4e2.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a24068d60b671847d1d4e2.md
index 4a5a57ad8cf..96cc1b8729f 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a24068d60b671847d1d4e2.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a24068d60b671847d1d4e2.md
@@ -1,6 +1,6 @@
 ---
 id: 62a24068d60b671847d1d4e2
-title: Step 8
+title: Paso 8
 challengeType: 0
 dashedName: step-8
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a2409897ec621942234cf6.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a2409897ec621942234cf6.md
index d59d46387be..cd8f6e504d2 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a2409897ec621942234cf6.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a2409897ec621942234cf6.md
@@ -1,6 +1,6 @@
 ---
 id: 62a2409897ec621942234cf6
-title: Step 9
+title: Paso 9
 challengeType: 0
 dashedName: step-9
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a240c67f3dbb1a1e6d95ee.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a240c67f3dbb1a1e6d95ee.md
index 2a21ac2c341..f7e7b7e12cd 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a240c67f3dbb1a1e6d95ee.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a240c67f3dbb1a1e6d95ee.md
@@ -1,6 +1,6 @@
 ---
 id: 62a240c67f3dbb1a1e6d95ee
-title: Step 10
+title: Paso 10
 challengeType: 0
 dashedName: step-10
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a24128d5e8af1b47ad1aab.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a24128d5e8af1b47ad1aab.md
index a0a17c0808d..b036a118e33 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a24128d5e8af1b47ad1aab.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a24128d5e8af1b47ad1aab.md
@@ -1,6 +1,6 @@
 ---
 id: 62a24128d5e8af1b47ad1aab
-title: Step 11
+title: Paso 11
 challengeType: 0
 dashedName: step-11
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a24190868ca51c0b6e83c7.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a24190868ca51c0b6e83c7.md
index deec272509f..ef2d52c310a 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a24190868ca51c0b6e83c7.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a24190868ca51c0b6e83c7.md
@@ -1,6 +1,6 @@
 ---
 id: 62a24190868ca51c0b6e83c7
-title: Step 13
+title: Paso 13
 challengeType: 0
 dashedName: step-13
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a241df03c1f61ce936f5d9.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a241df03c1f61ce936f5d9.md
index 7527ce74825..3a000bbebcd 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a241df03c1f61ce936f5d9.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a241df03c1f61ce936f5d9.md
@@ -1,6 +1,6 @@
 ---
 id: 62a241df03c1f61ce936f5d9
-title: Step 14
+title: Paso 14
 challengeType: 0
 dashedName: step-14
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a2509ba163e020bb9d84ea.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a2509ba163e020bb9d84ea.md
index c65bb85e38f..f099c2bd61a 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a2509ba163e020bb9d84ea.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a2509ba163e020bb9d84ea.md
@@ -1,6 +1,6 @@
 ---
 id: 62a2509ba163e020bb9d84ea
-title: Step 15
+title: Paso 15
 challengeType: 0
 dashedName: step-15
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a255dae245b52317da824a.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a255dae245b52317da824a.md
index 2515e3330ca..f2cd2d18978 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a255dae245b52317da824a.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a255dae245b52317da824a.md
@@ -1,6 +1,6 @@
 ---
 id: 62a255dae245b52317da824a
-title: Step 16
+title: Paso 16
 challengeType: 0
 dashedName: step-16
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a257659d0d1e2456f24ba2.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a257659d0d1e2456f24ba2.md
index 12d385f3107..4edd826674f 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a257659d0d1e2456f24ba2.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a257659d0d1e2456f24ba2.md
@@ -1,6 +1,6 @@
 ---
 id: 62a257659d0d1e2456f24ba2
-title: Step 17
+title: Paso 17
 challengeType: 0
 dashedName: step-17
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a39f5a5790eb27c1e5d4bf.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a39f5a5790eb27c1e5d4bf.md
index af7153531cf..bcec29456d3 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a39f5a5790eb27c1e5d4bf.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a39f5a5790eb27c1e5d4bf.md
@@ -1,6 +1,6 @@
 ---
 id: 62a39f5a5790eb27c1e5d4bf
-title: Step 18
+title: Paso 18
 challengeType: 0
 dashedName: step-18
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3a0a3c0a4b32915d26a6e.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3a0a3c0a4b32915d26a6e.md
index b40d5f4cc30..166522bcf36 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3a0a3c0a4b32915d26a6e.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3a0a3c0a4b32915d26a6e.md
@@ -1,6 +1,6 @@
 ---
 id: 62a3a0a3c0a4b32915d26a6e
-title: Step 19
+title: Paso 19
 challengeType: 0
 dashedName: step-19
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3a488b24fb32b91155d56.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3a488b24fb32b91155d56.md
index 7fb32406762..a2521227c7a 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3a488b24fb32b91155d56.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3a488b24fb32b91155d56.md
@@ -1,6 +1,6 @@
 ---
 id: 62a3a488b24fb32b91155d56
-title: Step 20
+title: Paso 20
 challengeType: 0
 dashedName: step-20
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3a75d8466a12e009eff76.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3a75d8466a12e009eff76.md
index 278aa0789fc..da83a5e1cf1 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3a75d8466a12e009eff76.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3a75d8466a12e009eff76.md
@@ -1,6 +1,6 @@
 ---
 id: 62a3a75d8466a12e009eff76
-title: Step 21
+title: Paso 21
 challengeType: 0
 dashedName: step-21
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3a7e4f1060e2fc5ffb34b.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3a7e4f1060e2fc5ffb34b.md
index 606fdeb799a..f746a1df976 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3a7e4f1060e2fc5ffb34b.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3a7e4f1060e2fc5ffb34b.md
@@ -1,6 +1,6 @@
 ---
 id: 62a3a7e4f1060e2fc5ffb34b
-title: Step 22
+title: Paso 22
 challengeType: 0
 dashedName: step-22
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b365f1cdeb33efc2502e.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b365f1cdeb33efc2502e.md
index 63ecefac153..24d438eb594 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b365f1cdeb33efc2502e.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b365f1cdeb33efc2502e.md
@@ -1,6 +1,6 @@
 ---
 id: 62a3b365f1cdeb33efc2502e
-title: Step 23
+title: Paso 23
 challengeType: 0
 dashedName: step-23
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b3eab50e193608c19fc6.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b3eab50e193608c19fc6.md
index f4a27916dea..cd4e9caaa8f 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b3eab50e193608c19fc6.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b3eab50e193608c19fc6.md
@@ -1,6 +1,6 @@
 ---
 id: 62a3b3eab50e193608c19fc6
-title: Step 24
+title: Paso 24
 challengeType: 0
 dashedName: step-24
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b41c9494f937560640ab.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b41c9494f937560640ab.md
index c679c2cb1fe..ea0230c9b4f 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b41c9494f937560640ab.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b41c9494f937560640ab.md
@@ -1,6 +1,6 @@
 ---
 id: 62a3b41c9494f937560640ab
-title: Step 25
+title: Paso 25
 challengeType: 0
 dashedName: step-25
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b49686792938718b90d3.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b49686792938718b90d3.md
index 878b7879e25..e49c4877a68 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b49686792938718b90d3.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b49686792938718b90d3.md
@@ -1,6 +1,6 @@
 ---
 id: 62a3b49686792938718b90d3
-title: Step 26
+title: Paso 26
 challengeType: 0
 dashedName: step-26
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b506dbaead396f58a701.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b506dbaead396f58a701.md
index bb8a09862a3..7696eabe70f 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b506dbaead396f58a701.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b506dbaead396f58a701.md
@@ -1,6 +1,6 @@
 ---
 id: 62a3b506dbaead396f58a701
-title: Step 27
+title: Paso 27
 challengeType: 0
 dashedName: step-27
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b5843544ce3a77459c27.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b5843544ce3a77459c27.md
index f7a00ecb775..9c3d761752f 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b5843544ce3a77459c27.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b5843544ce3a77459c27.md
@@ -1,6 +1,6 @@
 ---
 id: 62a3b5843544ce3a77459c27
-title: Step 28
+title: Paso 28
 challengeType: 0
 dashedName: step-28
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b79d520a7f3d0e25afd6.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b79d520a7f3d0e25afd6.md
index af9e9e6bf70..d993a79eafc 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b79d520a7f3d0e25afd6.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b79d520a7f3d0e25afd6.md
@@ -1,6 +1,6 @@
 ---
 id: 62a3b79d520a7f3d0e25afd6
-title: Step 29
+title: Paso 29
 challengeType: 0
 dashedName: step-29
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3bb9aeefe4b3fc43c6d7b.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3bb9aeefe4b3fc43c6d7b.md
index 0e0eaee9ae7..0af0c7f699a 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3bb9aeefe4b3fc43c6d7b.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3bb9aeefe4b3fc43c6d7b.md
@@ -1,6 +1,6 @@
 ---
 id: 62a3bb9aeefe4b3fc43c6d7b
-title: Step 31
+title: Paso 31
 challengeType: 0
 dashedName: step-31
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3bec30ea7f941412512dc.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3bec30ea7f941412512dc.md
index 065f7587076..9e9d6ef480d 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3bec30ea7f941412512dc.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3bec30ea7f941412512dc.md
@@ -1,6 +1,6 @@
 ---
 id: 62a3bec30ea7f941412512dc
-title: Step 33
+title: Paso 33
 challengeType: 0
 dashedName: step-33
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c0ab883fd9435cd5c518.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c0ab883fd9435cd5c518.md
index ed392fd2cc4..b06a435f1c4 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c0ab883fd9435cd5c518.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c0ab883fd9435cd5c518.md
@@ -1,6 +1,6 @@
 ---
 id: 62a3c0ab883fd9435cd5c518
-title: Step 35
+title: Paso 35
 challengeType: 0
 dashedName: step-35
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c2fccf186146b59c6e96.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c2fccf186146b59c6e96.md
index 0f2fe813e63..fbb9b38f386 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c2fccf186146b59c6e96.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c2fccf186146b59c6e96.md
@@ -1,6 +1,6 @@
 ---
 id: 62a3c2fccf186146b59c6e96
-title: Step 36
+title: Paso 36
 challengeType: 0
 dashedName: step-36
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c4a0e52767482c5202d4.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c4a0e52767482c5202d4.md
index 73d0dc234d9..a78a9895891 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c4a0e52767482c5202d4.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c4a0e52767482c5202d4.md
@@ -1,6 +1,6 @@
 ---
 id: 62a3c4a0e52767482c5202d4
-title: Step 37
+title: Paso 37
 challengeType: 0
 dashedName: step-37
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c668afc43b4a134cca81.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c668afc43b4a134cca81.md
index 38a51618160..d97f8d88ecf 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c668afc43b4a134cca81.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c668afc43b4a134cca81.md
@@ -1,6 +1,6 @@
 ---
 id: 62a3c668afc43b4a134cca81
-title: Step 38
+title: Paso 38
 challengeType: 0
 dashedName: step-38
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c8bf3980c14c438d2aed.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c8bf3980c14c438d2aed.md
index 7bec654ec15..29c48fafd6b 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c8bf3980c14c438d2aed.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c8bf3980c14c438d2aed.md
@@ -1,6 +1,6 @@
 ---
 id: 62a3c8bf3980c14c438d2aed
-title: Step 39
+title: Paso 39
 challengeType: 0
 dashedName: step-39
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c91a2bab1b4d6fabb726.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c91a2bab1b4d6fabb726.md
index a911182a57c..543cac49345 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c91a2bab1b4d6fabb726.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c91a2bab1b4d6fabb726.md
@@ -1,6 +1,6 @@
 ---
 id: 62a3c91a2bab1b4d6fabb726
-title: Step 40
+title: Paso 40
 challengeType: 0
 dashedName: step-40
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cdb11478a34ff4a6470d.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cdb11478a34ff4a6470d.md
index c14f5a7d858..d23c44e2791 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cdb11478a34ff4a6470d.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cdb11478a34ff4a6470d.md
@@ -1,6 +1,6 @@
 ---
 id: 62a3cdb11478a34ff4a6470d
-title: Step 41
+title: Paso 41
 challengeType: 0
 dashedName: step-41
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md
index 490ea3e8e2f..0c0e417e724 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md
@@ -1,6 +1,6 @@
 ---
 id: 62a3cfc8328d3351b95d4f61
-title: Step 42
+title: Paso 42
 challengeType: 0
 dashedName: step-42
 ---
@@ -14,7 +14,7 @@ const info = document.querySelector("#info");
 info.innerText = "Hello World";
 ```
 
-This code would change the element assigned to the `div` variable to have the text `Hello World`. 
+This code would change the element assigned to the `div` variable to have the text `Hello World`.
 
 When a player clicks your `Go to store` button, you want to change the buttons and text. Remove the code inside the `goStore` function and add a line that updates the text of `button1` to say `Buy 10 health (10 gold)`.
 
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7beb1ad61211ac153707f.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7beb1ad61211ac153707f.md
index 8d5c8d1245f..83a4fba2884 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7beb1ad61211ac153707f.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7beb1ad61211ac153707f.md
@@ -1,6 +1,6 @@
 ---
 id: 62a7beb1ad61211ac153707f
-title: Step 43
+title: Paso 43
 challengeType: 0
 dashedName: step-43
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bf06d2ad9d1c5024e833.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bf06d2ad9d1c5024e833.md
index 981e39344f7..03e13d0ee6e 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bf06d2ad9d1c5024e833.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bf06d2ad9d1c5024e833.md
@@ -1,6 +1,6 @@
 ---
 id: 62a7bf06d2ad9d1c5024e833
-title: Step 44
+title: Paso 44
 challengeType: 0
 dashedName: step-44
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bfabe119461eb13ccbd6.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bfabe119461eb13ccbd6.md
index eed48a208c4..28d47f0d28f 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bfabe119461eb13ccbd6.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bfabe119461eb13ccbd6.md
@@ -1,6 +1,6 @@
 ---
 id: 62a7bfabe119461eb13ccbd6
-title: Step 45
+title: Paso 45
 challengeType: 0
 dashedName: step-45
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bfd9179b7f1f6a15fb1e.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bfd9179b7f1f6a15fb1e.md
index ae7d6df92f7..fe4fed94244 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bfd9179b7f1f6a15fb1e.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bfd9179b7f1f6a15fb1e.md
@@ -1,6 +1,6 @@
 ---
 id: 62a7bfd9179b7f1f6a15fb1e
-title: Step 46
+title: Paso 46
 challengeType: 0
 dashedName: step-46
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7c011eef9fb2084b966db.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7c011eef9fb2084b966db.md
index b985f7eded3..4af1302366d 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7c011eef9fb2084b966db.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7c011eef9fb2084b966db.md
@@ -1,6 +1,6 @@
 ---
 id: 62a7c011eef9fb2084b966db
-title: Step 47
+title: Paso 47
 challengeType: 0
 dashedName: step-47
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7c071219da921758a35bb.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7c071219da921758a35bb.md
index 20ac473611a..f97262c28f1 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7c071219da921758a35bb.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7c071219da921758a35bb.md
@@ -1,6 +1,6 @@
 ---
 id: 62a7c071219da921758a35bb
-title: Step 48
+title: Paso 48
 challengeType: 0
 dashedName: step-48
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7c23e6b511f22ed71197a.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7c23e6b511f22ed71197a.md
index 6b26d69619b..cd41c327bd3 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7c23e6b511f22ed71197a.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7c23e6b511f22ed71197a.md
@@ -1,6 +1,6 @@
 ---
 id: 62a7c23e6b511f22ed71197a
-title: Step 49
+title: Paso 49
 challengeType: 0
 dashedName: step-49
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7cc99577fbf25ee7a7d76.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7cc99577fbf25ee7a7d76.md
index 82ae722f3d8..d8495ae3506 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7cc99577fbf25ee7a7d76.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7cc99577fbf25ee7a7d76.md
@@ -1,6 +1,6 @@
 ---
 id: 62a7cc99577fbf25ee7a7d76
-title: Step 50
+title: Paso 50
 challengeType: 0
 dashedName: step-50
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8a929e4260d08093756d2.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8a929e4260d08093756d2.md
index a36f9b9f86e..57cf8a7beb8 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8a929e4260d08093756d2.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8a929e4260d08093756d2.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8a929e4260d08093756d2
-title: Step 51
+title: Paso 51
 challengeType: 0
 dashedName: step-51
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8a9d876b2580943ba9351.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8a9d876b2580943ba9351.md
index 4f9143c205b..5a722389349 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8a9d876b2580943ba9351.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8a9d876b2580943ba9351.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8a9d876b2580943ba9351
-title: Step 52
+title: Paso 52
 challengeType: 0
 dashedName: step-52
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md
index d5c3664e5ed..d157b66143b 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8aa98a8289d0a698eee1d
-title: Step 53
+title: Paso 53
 challengeType: 0
 dashedName: step-53
 ---
@@ -135,7 +135,7 @@ const monsterHealthText =document.querySelector("#monsterHealth");
 --fcc-editable-region--
 const locations = [
     {
-        
+
     }
 ];
 --fcc-editable-region--
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ab0e27cbaf0b54ba8a42.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ab0e27cbaf0b54ba8a42.md
index 45578691077..dad056bd02a 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ab0e27cbaf0b54ba8a42.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ab0e27cbaf0b54ba8a42.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8ab0e27cbaf0b54ba8a42
-title: Step 54
+title: Paso 54
 challengeType: 0
 dashedName: step-54
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ac194679e60cb561b0a8.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ac194679e60cb561b0a8.md
index 5a1412cf312..04c9f7c5ae5 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ac194679e60cb561b0a8.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ac194679e60cb561b0a8.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8ac194679e60cb561b0a8
-title: Step 55
+title: Paso 55
 challengeType: 0
 dashedName: step-55
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ad8e01d7cb0deae5ec66.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ad8e01d7cb0deae5ec66.md
index 1229366bb3a..fb81405063d 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ad8e01d7cb0deae5ec66.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ad8e01d7cb0deae5ec66.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8ad8e01d7cb0deae5ec66
-title: Step 56
+title: Paso 56
 challengeType: 0
 dashedName: step-56
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ade9b2f5b30ef0b606c2.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ade9b2f5b30ef0b606c2.md
index 7ac20d72a3e..9822cb9eae3 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ade9b2f5b30ef0b606c2.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ade9b2f5b30ef0b606c2.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8ade9b2f5b30ef0b606c2
-title: Step 57
+title: Paso 57
 challengeType: 0
 dashedName: step-57
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ae85fcaedc0fddc7ca4f.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ae85fcaedc0fddc7ca4f.md
index 79d6d140e1e..2c3478d9e0d 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ae85fcaedc0fddc7ca4f.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ae85fcaedc0fddc7ca4f.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8ae85fcaedc0fddc7ca4f
-title: Step 58
+title: Paso 58
 challengeType: 0
 dashedName: step-58
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b0b5053f16111b0b6b5f.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b0b5053f16111b0b6b5f.md
index c60cf5907da..13ec3548717 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b0b5053f16111b0b6b5f.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b0b5053f16111b0b6b5f.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8b0b5053f16111b0b6b5f
-title: Step 59
+title: Paso 59
 challengeType: 0
 dashedName: step-59
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b1762b7775124622e1a3.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b1762b7775124622e1a3.md
index 450bc66c133..aa50ec8046a 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b1762b7775124622e1a3.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b1762b7775124622e1a3.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8b1762b7775124622e1a3
-title: Step 60
+title: Paso 60
 challengeType: 0
 dashedName: step-60
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b3cc436db8139cc5fc09.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b3cc436db8139cc5fc09.md
index 4d5aa1df9b9..a742fc5f86a 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b3cc436db8139cc5fc09.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b3cc436db8139cc5fc09.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8b3cc436db8139cc5fc09
-title: Step 61
+title: Paso 61
 challengeType: 0
 dashedName: step-61
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b6536156c51500739b41.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b6536156c51500739b41.md
index a8bef26a706..4f3e46c6b3d 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b6536156c51500739b41.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b6536156c51500739b41.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8b6536156c51500739b41
-title: Step 62
+title: Paso 62
 challengeType: 0
 dashedName: step-62
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b711ab7a12161c7d9b67.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b711ab7a12161c7d9b67.md
index 8a6a5c5c67a..45ae30589c5 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b711ab7a12161c7d9b67.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b711ab7a12161c7d9b67.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8b711ab7a12161c7d9b67
-title: Step 63
+title: Paso 63
 challengeType: 0
 dashedName: step-63
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b9770050d217d2247801.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b9770050d217d2247801.md
index ab4856b1c26..08df4d51e5d 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b9770050d217d2247801.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b9770050d217d2247801.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8b9770050d217d2247801
-title: Step 64
+title: Paso 64
 challengeType: 0
 dashedName: step-64
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c0c8313e891a15ec23e7.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c0c8313e891a15ec23e7.md
index 458368c6e11..a5997a9e3b0 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c0c8313e891a15ec23e7.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c0c8313e891a15ec23e7.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c0c8313e891a15ec23e7
-title: Step 65
+title: Paso 65
 challengeType: 0
 dashedName: step-65
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c1154d3ae11aee80353f.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c1154d3ae11aee80353f.md
index 4731c369e1e..2e5a880ea28 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c1154d3ae11aee80353f.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c1154d3ae11aee80353f.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c1154d3ae11aee80353f
-title: Step 66
+title: Paso 66
 challengeType: 0
 dashedName: step-66
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c151b23bf21bc7c4fcba.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c151b23bf21bc7c4fcba.md
index ca8a532ec15..005b861e498 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c151b23bf21bc7c4fcba.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c151b23bf21bc7c4fcba.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c151b23bf21bc7c4fcba
-title: Step 67
+title: Paso 67
 challengeType: 0
 dashedName: step-67
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c173949f851c83c64756.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c173949f851c83c64756.md
index 422ff092c3e..e13175922ed 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c173949f851c83c64756.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c173949f851c83c64756.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c173949f851c83c64756
-title: Step 68
+title: Paso 68
 challengeType: 0
 dashedName: step-68
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c242b25a531f2909e5bc.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c242b25a531f2909e5bc.md
index d7800eb4dce..051971469cb 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c242b25a531f2909e5bc.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c242b25a531f2909e5bc.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c242b25a531f2909e5bc
-title: Step 69
+title: Paso 69
 challengeType: 0
 dashedName: step-69
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c2bbbd8aa82052f47c53.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c2bbbd8aa82052f47c53.md
index d96b10aaff6..2dcf1fa16a2 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c2bbbd8aa82052f47c53.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c2bbbd8aa82052f47c53.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c2bbbd8aa82052f47c53
-title: Step 70
+title: Paso 70
 challengeType: 0
 dashedName: step-70
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c31ec0ec78216a1c36a0.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c31ec0ec78216a1c36a0.md
index 1d663fa1670..af54c9bb18f 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c31ec0ec78216a1c36a0.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c31ec0ec78216a1c36a0.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c31ec0ec78216a1c36a0
-title: Step 71
+title: Paso 71
 challengeType: 0
 dashedName: step-71
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c370ad8c68227137e0bc.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c370ad8c68227137e0bc.md
index 4d33b655a6b..318d5ce2756 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c370ad8c68227137e0bc.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c370ad8c68227137e0bc.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c370ad8c68227137e0bc
-title: Step 72
+title: Paso 72
 challengeType: 0
 dashedName: step-72
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c3ebc6c35e23785e1a19.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c3ebc6c35e23785e1a19.md
index df1d38ffce5..7fefc014c00 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c3ebc6c35e23785e1a19.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c3ebc6c35e23785e1a19.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c3ebc6c35e23785e1a19
-title: Step 73
+title: Paso 73
 challengeType: 0
 dashedName: step-73
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c41ecaf1bd24536129b8.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c41ecaf1bd24536129b8.md
index a5bb57d211c..8bf88ae2160 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c41ecaf1bd24536129b8.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c41ecaf1bd24536129b8.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c41ecaf1bd24536129b8
-title: Step 74
+title: Paso 74
 challengeType: 0
 dashedName: step-74
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c465fa7b0c252f4a8f0c.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c465fa7b0c252f4a8f0c.md
index 70e928a9bd6..859a4f6662d 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c465fa7b0c252f4a8f0c.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c465fa7b0c252f4a8f0c.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c465fa7b0c252f4a8f0c
-title: Step 75
+title: Paso 75
 challengeType: 0
 dashedName: step-75
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c4db0710f3260f867a92.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c4db0710f3260f867a92.md
index 89161b6c20f..3613b5ad25d 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c4db0710f3260f867a92.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c4db0710f3260f867a92.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c4db0710f3260f867a92
-title: Step 76
+title: Paso 76
 challengeType: 0
 dashedName: step-76
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c56247609626fa4a8d6e.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c56247609626fa4a8d6e.md
index e68eacaf744..5d8f765c364 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c56247609626fa4a8d6e.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c56247609626fa4a8d6e.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c56247609626fa4a8d6e
-title: Step 77
+title: Paso 77
 challengeType: 0
 dashedName: step-77
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c5db7888af27af23f0dd.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c5db7888af27af23f0dd.md
index d29d4fa92c7..810553911f1 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c5db7888af27af23f0dd.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c5db7888af27af23f0dd.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c5db7888af27af23f0dd
-title: Step 78
+title: Paso 78
 challengeType: 0
 dashedName: step-78
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c65b75664c28a8e59c16.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c65b75664c28a8e59c16.md
index 3ef17db2434..5cea398e0c9 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c65b75664c28a8e59c16.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c65b75664c28a8e59c16.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c65b75664c28a8e59c16
-title: Step 79
+title: Paso 79
 challengeType: 0
 dashedName: step-79
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c6815f5f1a29735efe1b.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c6815f5f1a29735efe1b.md
index 90b8c75c72f..fc0cfd2dad1 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c6815f5f1a29735efe1b.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c6815f5f1a29735efe1b.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c6815f5f1a29735efe1b
-title: Step 80
+title: Paso 80
 challengeType: 0
 dashedName: step-80
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7322e42962ad53ad204.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7322e42962ad53ad204.md
index bed05c8d88b..64483513c0d 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7322e42962ad53ad204.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7322e42962ad53ad204.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c7322e42962ad53ad204
-title: Step 81
+title: Paso 81
 challengeType: 0
 dashedName: step-81
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7a59e72c02bb1c717d2.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7a59e72c02bb1c717d2.md
index 422e0ad66b5..147aa323b3f 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7a59e72c02bb1c717d2.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7a59e72c02bb1c717d2.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c7a59e72c02bb1c717d2
-title: Step 82
+title: Paso 82
 challengeType: 0
 dashedName: step-82
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c89e4272512d44fc1c66.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c89e4272512d44fc1c66.md
index cded49b4395..791e3ed9537 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c89e4272512d44fc1c66.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c89e4272512d44fc1c66.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c89e4272512d44fc1c66
-title: Step 83
+title: Paso 83
 challengeType: 0
 dashedName: step-83
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c8cee8e5cf2e001789b4.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c8cee8e5cf2e001789b4.md
index 7f2575cbb11..0054637ae09 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c8cee8e5cf2e001789b4.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c8cee8e5cf2e001789b4.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c8cee8e5cf2e001789b4
-title: Step 84
+title: Paso 84
 challengeType: 0
 dashedName: step-84
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ca22d29fe62f3952bdf5.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ca22d29fe62f3952bdf5.md
index dbd8006158d..64cdee68c92 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ca22d29fe62f3952bdf5.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ca22d29fe62f3952bdf5.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8ca22d29fe62f3952bdf5
-title: Step 85
+title: Paso 85
 challengeType: 0
 dashedName: step-85
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cb19bd7f8a304e5427a1.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cb19bd7f8a304e5427a1.md
index 29c3d761fb0..a9d7eefef3a 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cb19bd7f8a304e5427a1.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cb19bd7f8a304e5427a1.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8cb19bd7f8a304e5427a1
-title: Step 86
+title: Paso 86
 challengeType: 0
 dashedName: step-86
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
index d91e6245ebe..dc13d9720a6 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8cbd1e3595431d5a2b3f1
-title: Step 87
+title: Paso 87
 challengeType: 0
 dashedName: step-87
 ---
@@ -206,7 +206,7 @@ function buyWeapon() {
     gold -= 30;
     currentWeapon++;
     goldText.innerText = gold;
-    
+
     text.innerText = "You now have a new weapon.";
   }
 }
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cce1b0c32c33017cf2e9.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cce1b0c32c33017cf2e9.md
index 165962a1920..dbc08604418 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cce1b0c32c33017cf2e9.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cce1b0c32c33017cf2e9.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8cce1b0c32c33017cf2e9
-title: Step 88
+title: Paso 88
 challengeType: 0
 dashedName: step-88
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce1dfc990134162b3bd9.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce1dfc990134162b3bd9.md
index 7165051ad52..43e064e3bcf 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce1dfc990134162b3bd9.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce1dfc990134162b3bd9.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8ce1dfc990134162b3bd9
-title: Step 89
+title: Paso 89
 challengeType: 0
 dashedName: step-89
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
index 4b1f8fb6cb6..71eb45ee9e4 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
@@ -1,13 +1,13 @@
 ---
 id: 62a8ce73d0dce43468f6689c
-title: Step 90
+title: Paso 90
 challengeType: 0
 dashedName: step-90
 ---
 
 # --description--
 
-You can insert variables into a string with the <dfn>concatenation operator</dfn> `+`. Update the `You now have a new weapon.` string to say `You now have a ` and the name of the new weapon. Remember to end the sentence with a period.
+You can insert variables into a string with the <dfn>concatenation operator</dfn> `+`. Update the `You now have a new weapon.` string to say `You now have a` and the name of the new weapon. Remember to end the sentence with a period.
 
 Here is an example that creates the string `Hello, our name is freeCodeCamp.`:
 
@@ -18,7 +18,7 @@ const ourStr = "Hello, our name is " + ourName + ".";
 
 # --hints--
 
-You should update the `text.innerText` assignment to start with the string `You now have a `.
+You should update the `text.innerText` assignment to start with the string `You now have a`.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*=\s*('|")You now have a \1/);
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
index 748ab4d2f08..bf00e2b54ed 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8cf22272d6d35af80d4ac
-title: Step 91
+title: Paso 91
 challengeType: 0
 dashedName: step-91
 ---
@@ -214,7 +214,7 @@ function buyWeapon() {
     goldText.innerText = gold;
     let newWeapon = weapons[currentWeapon].name;
     text.innerText = "You now have a " + newWeapon + ".";
-    
+
   }
 }
 --fcc-editable-region--
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
index b7219fb9be1..8ce709b41c4 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
@@ -1,13 +1,13 @@
 ---
 id: 62a8d0337d7c67377a4a76c6
-title: Step 92
+title: Paso 92
 challengeType: 0
 dashedName: step-92
 ---
 
 # --description--
 
-Up until now, any time `text.innerText` was updated the old text was erased. This time, use the `+=` operator to add text to the end of `text.innerText`. Add the string ` In your inventory you have: ` - include the spaces at the beginning and the end.
+Up until now, any time `text.innerText` was updated the old text was erased. This time, use the `+=` operator to add text to the end of `text.innerText`. Add the string `In your inventory you have:` - include the spaces at the beginning and the end.
 
 # --hints--
 
@@ -24,7 +24,7 @@ You should use the `+=` operator to add to `text.innerText`.
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*/)
 ```
 
-You should add the string ` In your inventory you have: ` to the end of `text.innerText`. Mind the spaces!
+You should add the string `In your inventory you have:` to the end of `text.innerText`. Mind the spaces!
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*('|")\sIn your inventory you have:\s\1/)
@@ -203,7 +203,7 @@ function buyWeapon() {
     let newWeapon = weapons[currentWeapon].name;
     text.innerText = "You now have a " + newWeapon + ".";
     inventory.push(newWeapon);
-    
+
   }
 }
 --fcc-editable-region--
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
index 098be4a56e6..18357af80dd 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d08668fa8b38732486e9
-title: Step 93
+title: Paso 93
 challengeType: 0
 dashedName: step-93
 ---
@@ -11,7 +11,7 @@ At the end of the second `text.innerText` string you just added, use the concate
 
 # --hints--
 
-You should not change the ` In your inventory you have: ` string.
+You should not change the `In your inventory you have:` string.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*('|")\sIn your inventory you have:\s\1/)
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0c4f12c2239b6618582.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0c4f12c2239b6618582.md
index 3ebebb1edd6..325bef9036f 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0c4f12c2239b6618582.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0c4f12c2239b6618582.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d0c4f12c2239b6618582
-title: Step 94
+title: Paso 94
 challengeType: 0
 dashedName: step-94
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0fdf2dad83a92883a80.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0fdf2dad83a92883a80.md
index 1c2b1476e8f..113489ed320 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0fdf2dad83a92883a80.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0fdf2dad83a92883a80.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d0fdf2dad83a92883a80
-title: Step 95
+title: Paso 95
 challengeType: 0
 dashedName: step-95
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d143f2a58e3b6d6e9c33.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d143f2a58e3b6d6e9c33.md
index a705f22a61f..eec8cbf8c1a 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d143f2a58e3b6d6e9c33.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d143f2a58e3b6d6e9c33.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d143f2a58e3b6d6e9c33
-title: Step 96
+title: Paso 96
 challengeType: 0
 dashedName: step-96
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d1c72e8bb13c2074d93c.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d1c72e8bb13c2074d93c.md
index 4db3e483fce..666c4bcbd5e 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d1c72e8bb13c2074d93c.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d1c72e8bb13c2074d93c.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d1c72e8bb13c2074d93c
-title: Step 97
+title: Paso 97
 challengeType: 0
 dashedName: step-97
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2146a3e853d0a6e28ca.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2146a3e853d0a6e28ca.md
index 2061307615c..df4b2ab1dc7 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2146a3e853d0a6e28ca.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2146a3e853d0a6e28ca.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d2146a3e853d0a6e28ca
-title: Step 98
+title: Paso 98
 challengeType: 0
 dashedName: step-98
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d24c97461b3ddb9397c8.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d24c97461b3ddb9397c8.md
index cd0c1476164..30a4c2bc4e5 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d24c97461b3ddb9397c8.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d24c97461b3ddb9397c8.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d24c97461b3ddb9397c8
-title: Step 99
+title: Paso 99
 challengeType: 0
 dashedName: step-99
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2e2a073be3edb46116f.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2e2a073be3edb46116f.md
index a5e28c829e7..92675bb6ae9 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2e2a073be3edb46116f.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2e2a073be3edb46116f.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d2e2a073be3edb46116f
-title: Step 100
+title: Paso 100
 challengeType: 0
 dashedName: step-100
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d31ebbc10e3fe1b28e03.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d31ebbc10e3fe1b28e03.md
index 77100cf5462..d8e99d93493 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d31ebbc10e3fe1b28e03.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d31ebbc10e3fe1b28e03.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d31ebbc10e3fe1b28e03
-title: Step 101
+title: Paso 101
 challengeType: 0
 dashedName: step-101
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d35660db4040ba292193.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d35660db4040ba292193.md
index dbbf432519d..f18bf4e334f 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d35660db4040ba292193.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d35660db4040ba292193.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d35660db4040ba292193
-title: Step 102
+title: Paso 102
 challengeType: 0
 dashedName: step-102
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d382cd075f4169223e14.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d382cd075f4169223e14.md
index 8f3764e0ef9..073ee69a184 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d382cd075f4169223e14.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d382cd075f4169223e14.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d382cd075f4169223e14
-title: Step 103
+title: Paso 103
 challengeType: 0
 dashedName: step-103
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d539dc11cb42b5dd7ec8.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d539dc11cb42b5dd7ec8.md
index 1fb5303efc5..95ac3dfa6d5 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d539dc11cb42b5dd7ec8.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d539dc11cb42b5dd7ec8.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d539dc11cb42b5dd7ec8
-title: Step 104
+title: Paso 104
 challengeType: 0
 dashedName: step-104
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
index 03e5cceea99..90a9ce71d67 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
@@ -1,13 +1,13 @@
 ---
 id: 62a8d61ddfe35744369365b7
-title: Step 105
+title: Paso 105
 challengeType: 0
 dashedName: step-105
 ---
 
 # --description--
 
-After your `currentWeapon`, use the concatenation operator to set `text.innerText` to the string `You sold a `, then `currentWeapon`, then the string `.`.
+After your `currentWeapon`, use the concatenation operator to set `text.innerText` to the string `You sold a`, then `currentWeapon`, then the string `.`.
 
 # --hints--
 
@@ -17,13 +17,13 @@ You should use the assignment operator with `text.innerText`.
 assert.match(sellWeapon.toString(), /text\.innerText\s*=/);
 ```
 
-You should add `You sold a ` to `text.innerText`. Spacing is important.
+You should add `You sold a` to `text.innerText`. Spacing is important.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*=\s*('|")You sold a \1/);
 ```
 
-You should add the value of `currentWeapon` to the `You sold a ` string. Use the concatenation operator to do this on the same line.
+You should add the value of `currentWeapon` to the `You sold a` string. Use the concatenation operator to do this on the same line.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*=\s*('|")You sold a\s\1\s*\+\s*\_currentWeapon/);
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
index bc8435faa22..25284dcf883 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
@@ -1,13 +1,13 @@
 ---
 id: 62a8d6c7001ebc45350e3d16
-title: Step 106
+title: Paso 106
 challengeType: 0
 dashedName: step-106
 ---
 
 # --description--
 
-Now use the `+=` operator to add the string ` In your inventory you have: ` and the contents of `inventory` to the `text.innerText`. Make sure to include the space at the beginning and end of the ` In your inventory you have: ` string.
+Now use the `+=` operator to add the string `In your inventory you have:` and the contents of `inventory` to the `text.innerText`. Make sure to include the space at the beginning and end of the `In your inventory you have:` string.
 
 # --hints--
 
@@ -25,7 +25,7 @@ const matches = sellWeapon.toString().match(/text\.innerText\s*\+=/g);
 assert.equal(matches.length, 1);
 ```
 
-You should add the string ` In your inventory you have: ` to the second `text.innerText` line. Spacing matters.
+You should add the string `In your inventory you have:` to the second `text.innerText` line. Spacing matters.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*\+=\s*('|") In your inventory you have: \1/);
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d7b8ab568b4649998954.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d7b8ab568b4649998954.md
index 3e59ee00a2d..801edc3f4ad 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d7b8ab568b4649998954.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d7b8ab568b4649998954.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d7b8ab568b4649998954
-title: Step 107
+title: Paso 107
 challengeType: 0
 dashedName: step-107
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d81f539f004776dd9b1e.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d81f539f004776dd9b1e.md
index f47ecd3e581..c102c26ef27 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d81f539f004776dd9b1e.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d81f539f004776dd9b1e.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d81f539f004776dd9b1e
-title: Step 108
+title: Paso 108
 challengeType: 0
 dashedName: step-108
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd468debb449b4454086.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd468debb449b4454086.md
index 4167fc0a12b..78710980c20 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd468debb449b4454086.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd468debb449b4454086.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8dd468debb449b4454086
-title: Step 109
+title: Paso 109
 challengeType: 0
 dashedName: step-109
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd9cdb16324b04cfd958.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd9cdb16324b04cfd958.md
index b960134fac7..bffb5859e0a 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd9cdb16324b04cfd958.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd9cdb16324b04cfd958.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8dd9cdb16324b04cfd958
-title: Step 110
+title: Paso 110
 challengeType: 0
 dashedName: step-110
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dfcf7fb1044d2f478fd1.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dfcf7fb1044d2f478fd1.md
index aa331ca8991..d60e971a0f1 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dfcf7fb1044d2f478fd1.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dfcf7fb1044d2f478fd1.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8dfcf7fb1044d2f478fd1
-title: Step 111
+title: Paso 111
 challengeType: 0
 dashedName: step-111
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e0d1d0110b4ec421489f.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e0d1d0110b4ec421489f.md
index 5eccfafdc9b..28e646e59fc 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e0d1d0110b4ec421489f.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e0d1d0110b4ec421489f.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8e0d1d0110b4ec421489f
-title: Step 112
+title: Paso 112
 challengeType: 0
 dashedName: step-112
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e142f7f0bd4fed898de3.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e142f7f0bd4fed898de3.md
index 70d0725b1d9..ae87b623f30 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e142f7f0bd4fed898de3.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e142f7f0bd4fed898de3.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8e142f7f0bd4fed898de3
-title: Step 113
+title: Paso 113
 challengeType: 0
 dashedName: step-113
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e1dc897df55108bcb5e8.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e1dc897df55108bcb5e8.md
index d87c8179a6e..f0a9441f6c3 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e1dc897df55108bcb5e8.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e1dc897df55108bcb5e8.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8e1dc897df55108bcb5e8
-title: Step 114
+title: Paso 114
 challengeType: 0
 dashedName: step-114
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e21398ad61520edb724f.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e21398ad61520edb724f.md
index ec221bb2490..6a2e74897bf 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e21398ad61520edb724f.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e21398ad61520edb724f.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8e21398ad61520edb724f
-title: Step 115
+title: Paso 115
 challengeType: 0
 dashedName: step-115
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e24c673b075317cc0b09.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e24c673b075317cc0b09.md
index 64379cb2b5d..548a21b9d85 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e24c673b075317cc0b09.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e24c673b075317cc0b09.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8e24c673b075317cc0b09
-title: Step 116
+title: Paso 116
 challengeType: 0
 dashedName: step-116
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e271f8e3d1541f9624ad.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e271f8e3d1541f9624ad.md
index 0ccd9de7c1a..1744c15379f 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e271f8e3d1541f9624ad.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e271f8e3d1541f9624ad.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8e271f8e3d1541f9624ad
-title: Step 117
+title: Paso 117
 challengeType: 0
 dashedName: step-117
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
index 229ca08f2a2..48b5b65d2f8 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8e35675c18c56354c08cf
-title: Step 118
+title: Paso 118
 challengeType: 0
 dashedName: step-118
 ---
@@ -17,19 +17,19 @@ You should use dot notation to access the `innerText` property of `text`.
 assert.match(attack.toString(), /text\.innerText/);
 ```
 
-You should assign the string `The ` to `innerText` property of `text`.
+You should assign the string `The` to `innerText` property of `text`.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1/);
 ```
 
-You should use the concatenation operator to add the value of `monsters[fighting].name` to the `The ` string.
+You should use the concatenation operator to add the value of `monsters[fighting].name` to the `The` string.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1\s*\+\s*monsters\[fighting\]\.name/);
 ```
 
-You should use the concatenation operator to add the string ` attacks.` to the `monsters[fighting].name` string.
+You should use the concatenation operator to add the string `attacks.` to the `monsters[fighting].name` string.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1\s*\+\s*monsters\[fighting\]\.name\s*\+\s*('|") attacks\.\2/);
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
index 6566de3802a..90ceff32fb8 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
@@ -1,13 +1,13 @@
 ---
 id: 62a8e41e2f190c58404dd46e
-title: Step 119
+title: Paso 119
 challengeType: 0
 dashedName: step-119
 ---
 
 # --description--
 
-On a new line, add the string ` You attack it with your [weapon].` to the `text` value, replacing `[weapon]` with the player's current weapon.
+On a new line, add the string `You attack it with your [weapon].` to the `text` value, replacing `[weapon]` with the player's current weapon.
 
 # --hints--
 
@@ -24,7 +24,7 @@ You should use compound assignment with `text.innerText`.
 assert.match(attack.toString(), /text\.innerText\s*\+=/);
 ```
 
-You should add the string ` You attack it with your ` to the `text.innerText` value. Remember that spacing matters.
+You should add the string `You attack it with your` to the `text.innerText` value. Remember that spacing matters.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|") You attack it with your \1/);
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e45cc600c3591cee671a.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e45cc600c3591cee671a.md
index 7ebd6d5383a..d730556ac09 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e45cc600c3591cee671a.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e45cc600c3591cee671a.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8e45cc600c3591cee671a
-title: Step 120
+title: Paso 120
 challengeType: 0
 dashedName: step-120
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e49f4df7af5ae2d7a616.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e49f4df7af5ae2d7a616.md
index 687f2f04e57..19d39b53126 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e49f4df7af5ae2d7a616.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e49f4df7af5ae2d7a616.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8e49f4df7af5ae2d7a616
-title: Step 121
+title: Paso 121
 challengeType: 0
 dashedName: step-121
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e4dc6a60f85bf256a0cb.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e4dc6a60f85bf256a0cb.md
index fe85bcd7f75..2c6381c1d20 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e4dc6a60f85bf256a0cb.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e4dc6a60f85bf256a0cb.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8e4dc6a60f85bf256a0cb
-title: Step 122
+title: Paso 122
 challengeType: 0
 dashedName: step-122
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
index a2c6fde768a..3959608d12c 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8ed36d7a7915dfa444ba2
-title: Step 123
+title: Paso 123
 challengeType: 0
 dashedName: step-123
 ---
@@ -279,7 +279,7 @@ function attack() {
   text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
   health -= monsters[fighting].level;
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
index acf1efd38b0..f9f06125186 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8edd05e27cc668051686f
-title: Step 124
+title: Paso 124
 challengeType: 0
 dashedName: step-124
 ---
@@ -275,7 +275,7 @@ function attack() {
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
   healthText.innerText = health;
   monsterHealthText.innerText = monsterHealth;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee154c8946678775c4a4.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee154c8946678775c4a4.md
index ac058ac03bc..c37f73941de 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee154c8946678775c4a4.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee154c8946678775c4a4.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8ee154c8946678775c4a4
-title: Step 125
+title: Paso 125
 challengeType: 0
 dashedName: step-125
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee71f018e968a056d369.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee71f018e968a056d369.md
index 94244500db9..17ae7752558 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee71f018e968a056d369.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee71f018e968a056d369.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8ee71f018e968a056d369
-title: Step 126
+title: Paso 126
 challengeType: 0
 dashedName: step-126
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
index 3524f53b4a3..2546756cf4a 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8eec45f77bc69e8775294
-title: Step 127
+title: Paso 127
 challengeType: 0
 dashedName: step-127
 ---
@@ -11,7 +11,7 @@ Inside the `dodge` function, set `text.innerText` equal to the string `You dodge
 
 # --hints--
 
-You should assign the string `You dodge the attack from the ` to the `text.innerText` property. Remember that spacing matters.
+You should assign the string `You dodge the attack from the` to the `text.innerText` property. Remember that spacing matters.
 
 ```js
 assert.match(dodge.toString(), /text\.innerText\s*=\s*('|")You dodge the attack from the \1/);
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eefe2e68b66ac563816b.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eefe2e68b66ac563816b.md
index f67c008aa05..bc67b1f0e7e 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eefe2e68b66ac563816b.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eefe2e68b66ac563816b.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8eefe2e68b66ac563816b
-title: Step 128
+title: Paso 128
 challengeType: 0
 dashedName: step-128
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef6a52292f6bdca4f6f8.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef6a52292f6bdca4f6f8.md
index 678fd1314fc..98b40678b75 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef6a52292f6bdca4f6f8.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef6a52292f6bdca4f6f8.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8ef6a52292f6bdca4f6f8
-title: Step 129
+title: Paso 129
 challengeType: 0
 dashedName: step-129
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
index cb9eadcb3ec..0c9ac098d6b 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8ef8f0c76a46cd221a68c
-title: Step 130
+title: Paso 130
 challengeType: 0
 dashedName: step-130
 ---
@@ -283,7 +283,7 @@ function dodge() {
 function defeatMonster() {
   gold += Math.floor(monsters[fighting].level * 6.7);
   xp += monsters[fighting].level;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
index ca92f837431..cf8f4c51054 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8efb0e3ce826db8daf80f
-title: Step 131
+title: Paso 131
 challengeType: 0
 dashedName: step-131
 ---
@@ -285,7 +285,7 @@ function defeatMonster() {
   xp += monsters[fighting].level;
   goldText.innerText = gold;
   xpText.innerText = xp;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
index dd0068655fd..fadc29919ed 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8eff21c0b0f6ebe5b8e38
-title: Step 132
+title: Paso 132
 challengeType: 0
 dashedName: step-132
 ---
@@ -10,7 +10,7 @@ dashedName: step-132
 Your `locations` array doesn't have a fifth element, so `locations[4]` doesn't work. Add a new object at the end of the `locations` array, following the same structure as the other objects. Set `name` to `kill monster`, set `button text` to an array with three `Go to town square` strings, set `button functions` to an array with three `goTown` variables, and set `text` to `The monster screams Arg! as it dies. You gain experience points and find gold.`.
 
 # --hints--
- 
+
 Your `locations` array should have five values.
 
 ```js
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f06fb318666fef69f91e.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f06fb318666fef69f91e.md
index ad30c67858d..81cb5c22032 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f06fb318666fef69f91e.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f06fb318666fef69f91e.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8f06fb318666fef69f91e
-title: Step 133
+title: Paso 133
 challengeType: 0
 dashedName: step-133
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f14fe6d1fc72454648c7.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f14fe6d1fc72454648c7.md
index ee850581fa7..1974c7ba3c7 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f14fe6d1fc72454648c7.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f14fe6d1fc72454648c7.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8f14fe6d1fc72454648c7
-title: Step 134
+title: Paso 134
 challengeType: 0
 dashedName: step-134
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f1d5f5ddbf74c07f733b.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f1d5f5ddbf74c07f733b.md
index de99851e153..049d3fa41bb 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f1d5f5ddbf74c07f733b.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f1d5f5ddbf74c07f733b.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8f1d5f5ddbf74c07f733b
-title: Step 135
+title: Paso 135
 challengeType: 0
 dashedName: step-135
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f20463b324759953edad.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f20463b324759953edad.md
index 097ae332be3..d56ea3894d2 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f20463b324759953edad.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f20463b324759953edad.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8f20463b324759953edad
-title: Step 136
+title: Paso 136
 challengeType: 0
 dashedName: step-136
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f256b813a476cae51f49.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f256b813a476cae51f49.md
index 84ad6a8fbc2..abfeb73bb7d 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f256b813a476cae51f49.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f256b813a476cae51f49.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8f256b813a476cae51f49
-title: Step 138
+title: Paso 138
 challengeType: 0
 dashedName: step-138
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f2bc37675e77d5835235.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f2bc37675e77d5835235.md
index cd564871491..47ab742b944 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f2bc37675e77d5835235.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f2bc37675e77d5835235.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8f2bc37675e77d5835235
-title: Step 139
+title: Paso 139
 challengeType: 0
 dashedName: step-139
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f35bde1750791f58773f.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f35bde1750791f58773f.md
index 6cf34e927c5..8ba13092d65 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f35bde1750791f58773f.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f35bde1750791f58773f.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8f35bde1750791f58773f
-title: Step 140
+title: Paso 140
 challengeType: 0
 dashedName: step-140
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a94114ce0b8918b487390f.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a94114ce0b8918b487390f.md
index 8522ebd7445..e60e4fef57f 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a94114ce0b8918b487390f.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a94114ce0b8918b487390f.md
@@ -1,6 +1,6 @@
 ---
 id: 62a94114ce0b8918b487390f
-title: Step 141
+title: Paso 141
 challengeType: 0
 dashedName: step-141
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1cea594f152ba626b872.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1cea594f152ba626b872.md
index d38e7a2c1e2..0274d95335d 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1cea594f152ba626b872.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1cea594f152ba626b872.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa1cea594f152ba626b872
-title: Step 142
+title: Paso 142
 challengeType: 0
 dashedName: step-142
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d6736ba262cfa74344b.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d6736ba262cfa74344b.md
index 1dd06a164f4..0f687b76870 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d6736ba262cfa74344b.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d6736ba262cfa74344b.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa1d6736ba262cfa74344b
-title: Step 143
+title: Paso 143
 challengeType: 0
 dashedName: step-143
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d9f535e102e4663e7a6.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d9f535e102e4663e7a6.md
index 62f2bd62862..c331e428f2f 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d9f535e102e4663e7a6.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d9f535e102e4663e7a6.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa1d9f535e102e4663e7a6
-title: Step 144
+title: Paso 144
 challengeType: 0
 dashedName: step-144
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e3c7c3d552fb04f0f18.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e3c7c3d552fb04f0f18.md
index 0e1f69267c5..9cc6bf35528 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e3c7c3d552fb04f0f18.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e3c7c3d552fb04f0f18.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa1e3c7c3d552fb04f0f18
-title: Step 145
+title: Paso 145
 challengeType: 0
 dashedName: step-145
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e8ccd579330e097ce44.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e8ccd579330e097ce44.md
index bcc2b14ee5a..64a557a0dbd 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e8ccd579330e097ce44.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e8ccd579330e097ce44.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa1e8ccd579330e097ce44
-title: Step 146
+title: Paso 146
 challengeType: 0
 dashedName: step-146
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1eec891ed731db227a36.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1eec891ed731db227a36.md
index 725aa7e720a..f9a3910c700 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1eec891ed731db227a36.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1eec891ed731db227a36.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa1eec891ed731db227a36
-title: Step 147
+title: Paso 147
 challengeType: 0
 dashedName: step-147
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1fed3d4e873366ff3131.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1fed3d4e873366ff3131.md
index 97ce39a4821..fa5b4f00c4a 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1fed3d4e873366ff3131.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1fed3d4e873366ff3131.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa1fed3d4e873366ff3131
-title: Step 148
+title: Paso 148
 challengeType: 0
 dashedName: step-148
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
index 3e9df421573..c9da7128bb5 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa204c1e1d33348ff09944
-title: Step 149
+title: Paso 149
 challengeType: 0
 dashedName: step-149
 ---
@@ -280,7 +280,7 @@ function attack() {
   text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
   health -= getMonsterAttackValue(monsters[fighting].level);
   if (isMonsterHit()) {
-    
+
   }
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
   healthText.innerText = health;
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
index 88836e37794..88b945fc706 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
@@ -1,13 +1,13 @@
 ---
 id: 62aa20e9cf1be9358f5aceae
-title: Step 150
+title: Paso 150
 challengeType: 0
 dashedName: step-150
 ---
 
 # --description--
 
-Add an `else` statement to your `if` statement. In the `else` statement, use the `+=` operator to add the text ` You miss.` to the end of `text.innerText`.
+Add an `else` statement to your `if` statement. In the `else` statement, use the `+=` operator to add the text `You miss.` to the end of `text.innerText`.
 
 # --hints--
 
@@ -17,7 +17,7 @@ You should add an `else` block after your `if (isMonsterHit())` block.
 assert.match(attack.toString(), /if\s*\(isMonsterHit\(\)\s*\)\s*\{\s*monsterHealth\s*-=\s*weapons\[currentWeapon\]\.power\s*\+\s*Math\.floor\(Math\.random\(\)\s*\*\s*xp\)\s*\+\s*1;\s*\}\s*else/)
 ```
 
-You should add the text ` You miss.` to the end of `text.innerText`. Remember to use compound assignment.
+You should add the text `You miss.` to the end of `text.innerText`. Remember to use compound assignment.
 
 ```js
 assert.match(attack.toString(), /if\s*\(isMonsterHit\(\)\s*\)\s*\{\s*monsterHealth\s*-=\s*weapons\[currentWeapon\]\.power\s*\+\s*Math\.floor\(Math\.random\(\)\s*\*\s*xp\)\s*\+\s*1;\s*\}\s*else\s*\{\s*text\.innerText\s*\+=\s*('|")\sYou miss\.\1/)
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2136fc49b836dfedb959.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2136fc49b836dfedb959.md
index 7a5d427b22f..d054328419a 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2136fc49b836dfedb959.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2136fc49b836dfedb959.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa2136fc49b836dfedb959
-title: Step 151
+title: Paso 151
 challengeType: 0
 dashedName: step-151
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa21971e3b743844849985.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa21971e3b743844849985.md
index 2db80762083..4dbe69b2b20 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa21971e3b743844849985.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa21971e3b743844849985.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa21971e3b743844849985
-title: Step 152
+title: Paso 152
 challengeType: 0
 dashedName: step-152
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa21ea8d9d9f396b95dd87.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa21ea8d9d9f396b95dd87.md
index 34820846dd6..7f5da8264d1 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa21ea8d9d9f396b95dd87.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa21ea8d9d9f396b95dd87.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa21ea8d9d9f396b95dd87
-title: Step 153
+title: Paso 153
 challengeType: 0
 dashedName: step-153
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
index 4210b69f7a8..b898bc888f5 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
@@ -1,13 +1,13 @@
 ---
 id: 62aa226207f33d3ad4c6f546
-title: Step 154
+title: Paso 154
 challengeType: 0
 dashedName: step-154
 ---
 
 # --description--
 
-Use the `+=` operator to add ` Your [weapon] breaks.` to the end of `text.innerText`, replacing `weapon` with the last item in the `inventory` array. You can get this last item by using `inventory.pop()`, which will remove the last item in the array AND return it so it appears in your string.
+Use the `+=` operator to add `Your [weapon] breaks.` to the end of `text.innerText`, replacing `weapon` with the last item in the `inventory` array. You can get this last item by using `inventory.pop()`, which will remove the last item in the array AND return it so it appears in your string.
 
 # --hints--
 
@@ -30,14 +30,14 @@ You should add the string " Your " to `text.innerText`. Remember that spacing ma
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1/);
 ```
 
-You should add the return value of `inventory.pop()` to the ` Your ` string.
+You should add the return value of `inventory.pop()` to the `Your` string.
 
 ```js
 console.log(attack.toString());
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1\s*\+\s*inventory\.pop\(\)/);
 ```
 
-You should add ` breaks.` to the ` "Your " + inventory.pop()` string.
+You should add `breaks.` to the `"Your " + inventory.pop()` string.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1\s*\+\s*inventory\.pop\(\)\s*\+\s*('|")\sbreaks\.\2/);
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa22aba186563bcbf2c395.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa22aba186563bcbf2c395.md
index 44980b592f0..84c67070f9c 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa22aba186563bcbf2c395.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa22aba186563bcbf2c395.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa22aba186563bcbf2c395
-title: Step 155
+title: Paso 155
 challengeType: 0
 dashedName: step-155
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa234322d4ad3e8bce42cc.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa234322d4ad3e8bce42cc.md
index 65fc9cd5576..4c8122ff0c4 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa234322d4ad3e8bce42cc.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa234322d4ad3e8bce42cc.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa234322d4ad3e8bce42cc
-title: Step 156
+title: Paso 156
 challengeType: 0
 dashedName: step-156
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2469c77b363fdb4f0e06.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2469c77b363fdb4f0e06.md
index 10cb8603022..c21c71dbdc8 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2469c77b363fdb4f0e06.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2469c77b363fdb4f0e06.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa2469c77b363fdb4f0e06
-title: Step 157
+title: Paso 157
 challengeType: 0
 dashedName: step-157
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa252c3b1073415ba2b898.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa252c3b1073415ba2b898.md
index a502101c334..581b43c2e8b 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa252c3b1073415ba2b898.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa252c3b1073415ba2b898.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa252c3b1073415ba2b898
-title: Step 158
+title: Paso 158
 challengeType: 0
 dashedName: step-158
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa258da314ef42ba0a1858.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa258da314ef42ba0a1858.md
index 5f657de3877..28b2ce5e546 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa258da314ef42ba0a1858.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa258da314ef42ba0a1858.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa258da314ef42ba0a1858
-title: Step 159
+title: Paso 159
 challengeType: 0
 dashedName: step-159
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa25fcb5837d43b4d9873d.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa25fcb5837d43b4d9873d.md
index 01f3692b24e..35ba1a27aee 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa25fcb5837d43b4d9873d.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa25fcb5837d43b4d9873d.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa25fcb5837d43b4d9873d
-title: Step 160
+title: Paso 160
 challengeType: 0
 dashedName: step-160
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2626c3c10244b94c787b.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2626c3c10244b94c787b.md
index c335f2d7bc9..6c91e47a3b4 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2626c3c10244b94c787b.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2626c3c10244b94c787b.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa2626c3c10244b94c787b
-title: Step 161
+title: Paso 161
 challengeType: 0
 dashedName: step-161
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
index b043a04a1a5..2f909e28235 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa264d23cdaa45a20efada
-title: Step 162
+title: Paso 162
 challengeType: 0
 dashedName: step-162
 ---
@@ -375,7 +375,7 @@ function pickEight() {
 --fcc-editable-region--
 function pick(guess) {
   let numbers = [];
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa26cca3cd3d46c431e73b.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa26cca3cd3d46c431e73b.md
index beace6c6228..87f4ec4a5b1 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa26cca3cd3d46c431e73b.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa26cca3cd3d46c431e73b.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa26cca3cd3d46c431e73b
-title: Step 163
+title: Paso 163
 challengeType: 0
 dashedName: step-163
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
index ac85513b88f..4ccf115ec08 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa27227399d647e1c37a3c
-title: Step 164
+title: Paso 164
 challengeType: 0
 dashedName: step-164
 ---
@@ -11,13 +11,13 @@ After the `while` loop, set `text.innerText` to equal `You picked [guess]. Here
 
 # --hints--
 
-You should set `text.innerText` to the string `You picked `. Remember that spacing matters.
+You should set `text.innerText` to the string `You picked`. Remember that spacing matters.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1/);
 ```
 
-You should use the concatenation operator to add the value of the `guess` parameter to your `You picked ` string.
+You should use the concatenation operator to add the value of the `guess` parameter to your `You picked` string.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1\s*\+\s*guess/);
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
index 3b20e162326..2f36cfcbdcb 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa27560def7048d7b4a095
-title: Step 165
+title: Paso 165
 challengeType: 0
 dashedName: step-165
 ---
@@ -11,7 +11,7 @@ Before the final quote in that string you added, insert the new line escape char
 
 # --hints--
 
-You should add the new line escape character `\n` to your `. Here are the random numbers: ` string.
+You should add the new line escape character `\n` to your `. Here are the random numbers:` string.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1\s*\+\s*guess\s*\+\s*('|")\.\sHere are the random numbers:\\n\2/);
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
index 180270940d6..20c1ceaa229 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
@@ -1,13 +1,13 @@
 ---
 id: 62aa27c40ca6f04ab8be5fac
-title: Step 166
+title: Paso 166
 challengeType: 0
 dashedName: step-166
 ---
 
 # --description--
 
-A `for` loop runs for a specific number of times. We will break down how a `for` loop runs in the next several steps. For now, copy this loop below and paste it at the end of your `pick` function.
+A `for` loop runs for a specific number of times. Desglosaremos cómo se ejecuta un bucle `for` en los siguientes pasos. For now, copy this loop below and paste it at the end of your `pick` function.
 
 ```js
 for (let x = 1; x < 5; x++) {
@@ -369,7 +369,7 @@ function pick(guess) {
     numbers.push(Math.floor(Math.random() * 11));
   }
   text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28032d863d4bd8058799.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28032d863d4bd8058799.md
index 4b4af2f8669..2c13940db1d 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28032d863d4bd8058799.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28032d863d4bd8058799.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa28032d863d4bd8058799
-title: Step 167
+title: Paso 167
 challengeType: 0
 dashedName: step-167
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa287434dc284cea01157c.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa287434dc284cea01157c.md
index 7067e31d3f3..b7a9f9ea424 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa287434dc284cea01157c.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa287434dc284cea01157c.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa287434dc284cea01157c
-title: Step 168
+title: Paso 168
 challengeType: 0
 dashedName: step-168
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28bbd6323e4dfb3ac43e.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28bbd6323e4dfb3ac43e.md
index 72bbc1f15f8..cd8c4f62e94 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28bbd6323e4dfb3ac43e.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28bbd6323e4dfb3ac43e.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa28bbd6323e4dfb3ac43e
-title: Step 169
+title: Paso 169
 challengeType: 0
 dashedName: step-169
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28fb651bf14efa2dbb16.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28fb651bf14efa2dbb16.md
index 94da3ef415e..13b5a15dc07 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28fb651bf14efa2dbb16.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28fb651bf14efa2dbb16.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa28fb651bf14efa2dbb16
-title: Step 170
+title: Paso 170
 challengeType: 0
 dashedName: step-170
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2943669c9d5026af6985.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2943669c9d5026af6985.md
index b1540f1ac41..839812e370c 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2943669c9d5026af6985.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2943669c9d5026af6985.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa2943669c9d5026af6985
-title: Step 171
+title: Paso 171
 challengeType: 0
 dashedName: step-171
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2999ec27ec516655eba6.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2999ec27ec516655eba6.md
index aa044de71f3..df4f572ee5f 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2999ec27ec516655eba6.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2999ec27ec516655eba6.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa2999ec27ec516655eba6
-title: Step 172
+title: Paso 172
 challengeType: 0
 dashedName: step-172
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa29d8f8f88152c91350ca.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa29d8f8f88152c91350ca.md
index 13ed8152080..e520850ffbb 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa29d8f8f88152c91350ca.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa29d8f8f88152c91350ca.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa29d8f8f88152c91350ca
-title: Step 173
+title: Paso 173
 challengeType: 0
 dashedName: step-173
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2aec2f09d454253aad6c.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2aec2f09d454253aad6c.md
index 5f48991b690..c6991626e59 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2aec2f09d454253aad6c.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2aec2f09d454253aad6c.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa2aec2f09d454253aad6c
-title: Step 174
+title: Paso 174
 challengeType: 0
 dashedName: step-174
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2ba9cd881355a6f0a5a8.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2ba9cd881355a6f0a5a8.md
index f9bcbbb6387..1e38e1261f8 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2ba9cd881355a6f0a5a8.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2ba9cd881355a6f0a5a8.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa2ba9cd881355a6f0a5a8
-title: Step 175
+title: Paso 175
 challengeType: 0
 dashedName: step-175
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62b46e3a8d4be31be5af793d.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62b46e3a8d4be31be5af793d.md
index d98f9e81298..4324f8f9c3b 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62b46e3a8d4be31be5af793d.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62b46e3a8d4be31be5af793d.md
@@ -1,6 +1,6 @@
 ---
 id: 62b46e3a8d4be31be5af793d
-title: Step 30
+title: Paso 30
 challengeType: 0
 dashedName: step-30
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62ba17beef16c563069a65d8.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62ba17beef16c563069a65d8.md
index e5d8098b79a..53d52d47fdf 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62ba17beef16c563069a65d8.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62ba17beef16c563069a65d8.md
@@ -1,6 +1,6 @@
 ---
 id: 62ba17beef16c563069a65d8
-title: Step 137
+title: Paso 137
 challengeType: 0
 dashedName: step-137
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc1ee0c5a89717d4785729.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc1ee0c5a89717d4785729.md
index 50b06ed7911..ae724a7f000 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc1ee0c5a89717d4785729.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc1ee0c5a89717d4785729.md
@@ -1,6 +1,6 @@
 ---
 id: 62fc1ee0c5a89717d4785729
-title: Step 12
+title: Paso 12
 challengeType: 0
 dashedName: step-12
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc20387ef88d1d1998aac5.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc20387ef88d1d1998aac5.md
index 1b122cb50c8..c6d2d856198 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc20387ef88d1d1998aac5.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc20387ef88d1d1998aac5.md
@@ -1,6 +1,6 @@
 ---
 id: 62fc20387ef88d1d1998aac5
-title: Step 32
+title: Paso 32
 challengeType: 0
 dashedName: step-32
 ---
diff --git a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc211760bfc220f4734800.md b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc211760bfc220f4734800.md
index 5dd815b61c0..b578d67a19e 100644
--- a/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc211760bfc220f4734800.md
+++ b/curriculum/challenges/espanol/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc211760bfc220f4734800.md
@@ -1,6 +1,6 @@
 ---
 id: 62fc211760bfc220f4734800
-title: Step 34
+title: Paso 34
 challengeType: 0
 dashedName: step-34
 ---
diff --git a/curriculum/challenges/german/01-responsive-web-design/responsive-web-design-projects/build-a-survey-form.md b/curriculum/challenges/german/01-responsive-web-design/responsive-web-design-projects/build-a-survey-form.md
index 5fcdb8f5f1b..91f30b8c833 100644
--- a/curriculum/challenges/german/01-responsive-web-design/responsive-web-design-projects/build-a-survey-form.md
+++ b/curriculum/challenges/german/01-responsive-web-design/responsive-web-design-projects/build-a-survey-form.md
@@ -119,7 +119,7 @@ const el = document.getElementById('email')
 assert(!!el && el.required)
 ```
 
-Deine `#email` sollte ein Nachfahre von `#survey-form` sein
+Deine `#email` sollte ein Nachfolger von `#survey-form` sein
 
 ```js
 const el = document.querySelector('#survey-form #email')
diff --git a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md
index 8b38f9146b7..b835b391490 100644
--- a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md
+++ b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md
@@ -8,7 +8,7 @@ dashedName: falsy-bouncer
 
 # --description--
 
-Entferne alle fehlerhaften Werte aus einem Array.
+Entferne alle fehlerhaften Werte aus einem Array. Gibt ein neues Array zurück; verändere nicht das ursprüngliche Array.
 
 Folgendes sind fehlerhafte Werte in JavaScript: `false`, `null`, `0`, `""`, `undefined`, und `NaN`.
 
@@ -40,6 +40,14 @@ assert.deepEqual(bouncer([false, null, 0, NaN, undefined, '']), []);
 assert.deepEqual(bouncer([null, NaN, 1, 2, undefined]), [1, 2]);
 ```
 
+`arr` sollte nicht verändert werden.
+
+```js
+const arr = ['a', false, 0, 'Naomi'];
+bouncer(arr);
+assert.deepEqual(arr, ['a', false, 0, 'Naomi'])
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
index 30acc6e11f5..6478cac69c6 100644
--- a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
+++ b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
@@ -37,12 +37,6 @@ assert(code.match(/quotient/g).length === 1);
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function(y){return 'quotient = '+y;})(quotient);
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
index cf39e6baa62..a5e8c394b0d 100644
--- a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
+++ b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
@@ -11,12 +11,12 @@ dashedName: escape-sequences-in-strings
 
 Anführungszeichen sind nicht die einzigen Zeichen, die innerhalb eines Strings <dfn>ausgelassen</dfn> werden können. Es gibt zwei Gründe für die Verwendung von Escape-Zeichen:
 
-1.  Um dir die Möglichkeit zu geben, Zeichen zu verwenden, die du sonst nicht eingeben könntest, wie zum Beispiel einen Wagenrücklauf (carriage return).
+1.  To allow you to use characters you may not otherwise be able to type out, such as a newline.
 2.  Damit kannst du mehrere Anführungszeichen in einem String darstellen, ohne dass JavaScript fehlinterpretiert, was du meinst.
 
 Das haben wir in der letzten Herausforderung gelernt.
 
-<table class='table table-striped'><thead><tr><th>Code</th><th>Ausgabe</th></tr></thead><tbody><tr><td><code>\'</code></td><td>einzelnes Anführungszeichen</td></tr><tr><td><code>\"</code></td><td>doppeltes Anführungszeichen</td></tr><tr><td><code>\\</code></td><td>Backslash</td></tr><tr><td><code>\n</code></td><td>Zeilenumbruch</td></tr><tr><td><code>\r</code></td><td>Wagenrücklauf (Carriage Return)</td></tr><tr><td><code>\t</code></td><td>Tabulator</td></tr><tr><td><code>\b</code></td><td>Backspace</td></tr><tr><td><code>\f</code></td><td>Seitenvorschub (Formfeed)</td></tr></tbody></table>
+<table class='table table-striped'><thead><tr><th>Code</th><th>Ausgabe</th></tr></thead><tbody><tr><td><code>\'</code></td><td>einzelnes Anführungszeichen</td></tr><tr><td><code>\"</code></td><td>doppeltes Anführungszeichen</td></tr><tr><td><code>\\</code></td><td>Backslash</td></tr><tr><td><code>\n</code></td><td>Zeilenumbruch</td></tr><tr><td><code>\t</code></td><td>tab</td></tr><tr><td><code>\r</code></td><td>carriage return</td></tr><tr><td><code>\b</code></td><td>Backspace</td></tr><tr><td><code>\f</code></td><td>Seitenvorschub (Formfeed)</td></tr></tbody></table>
 
 *Bitte beachte, dass das Backslash selbst mit einem Escape-Zeichen versehen werden muss, um als Backslash angezeigt zu werden.*
 
@@ -78,14 +78,6 @@ assert(myStr === 'FirstLine\n\t\\SecondLine\nThirdLine');
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function(){
-if (myStr !== undefined){
-console.log('myStr:\n' + myStr);}})();
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
index 3bc69df39a9..5d67748eded 100644
--- a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
+++ b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
@@ -31,12 +31,6 @@ assert(/var\s+a\s*=\s*9(\s*;?\s*)$/.test(code));
 
 # --seed--
 
-## --after-user-code--
-
-```js
-if(typeof a !== 'undefined') {(function(a){return "a = " + a;})(a);} else { (function() {return 'a is undefined';})(); }
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/practice-comparing-different-values.md b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/practice-comparing-different-values.md
index 534a8f4367e..5ad763acfe9 100644
--- a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/practice-comparing-different-values.md
+++ b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/practice-comparing-different-values.md
@@ -15,7 +15,7 @@ Wenn die zu vergleichenden Werte nicht vom gleichen Typ sind, führt der Gleichh
 
 **Beispiele**
 
-`3 == '3'` gibt `true` zurück, weil JavaScript eine Typkonvertierung von String zu Zahl durchführt. `3 === '3'` gibt false zurück, weil die Typen unterschiedlich sind und die Typkonvertierung nicht durchgeführt wird.
+`3 == '3'` gibt `true` zurück, weil JavaScript eine Typkonvertierung von String zu Zahl durchführt. `3 === '3'` returns `false` because the types are different and type conversion is not performed.
 
 **Hinweis:** In JavaScript kannst du den Typ einer Variablen oder eines Wertes mit dem `typeof`-Operator bestimmen, und zwar wie folgt:
 
diff --git a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
index 8c70eecf637..80c5587e912 100644
--- a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
+++ b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
@@ -62,12 +62,6 @@ assert(code.match(/"/g).length === 4 && code.match(/'/g).length === 2);
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function() { return "myStr = " + myStr; })();
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
index 8611a3ee1f1..ec071b2e566 100644
--- a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
+++ b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
@@ -98,7 +98,7 @@ function nextInLine(arr, item) {
 }
 
 // Setup
-const testArr = [1, 2, 3, 4, 5];
+let testArr = [1, 2, 3, 4, 5];
 
 // Display code
 console.log("Before: " + JSON.stringify(testArr));
@@ -109,7 +109,7 @@ console.log("After: " + JSON.stringify(testArr));
 # --solutions--
 
 ```js
-const testArr = [1, 2, 3, 4, 5];
+let testArr = [1, 2, 3, 4, 5];
 
 function nextInLine(arr, item) {
     arr.push(item);
diff --git a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/understand-string-immutability.md b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/understand-string-immutability.md
index 3381075c6df..935ceeadbcf 100644
--- a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/understand-string-immutability.md
+++ b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/understand-string-immutability.md
@@ -11,14 +11,14 @@ dashedName: understand-string-immutability
 
 In JavaScript sind `String`-Werte <dfn>unveränderlich</dfn>, d.h. sie können nach ihrer Erstellung nicht mehr verändert werden.
 
-Zum Beispiel folgender Code:
+For example, the following code will produce an error because the letter `B` in the string `Bob` cannot be changed to the letter `J`:
 
 ```js
 let myStr = "Bob";
 myStr[0] = "J";
 ```
 
-kann den Wert von `myStr` nicht in `Job` ändern, da der Inhalt von `myStr` nicht verändert werden kann. Beachte, dass dies *nicht* bedeutet, dass `myStr` nicht geändert werden kann, sondern nur, dass die einzelnen Zeichen eines <dfn>String-Literal</dfn> nicht geändert werden können. Die einzige Möglichkeit, `myStr` zu ändern, wäre, ihr einen neuen String zuzuweisen, etwa so:
+Note that this does *not* mean that `myStr` could not be re-assigned. The only way to change `myStr` would be to assign it with a new value, like this:
 
 ```js
 let myStr = "Bob";
diff --git a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
index b7ff7187917..1a406c2a319 100644
--- a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
+++ b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
@@ -71,6 +71,13 @@ assert(
 );
 ```
 
+Global variables should not be used to cache the array.
+
+```js
+countdown(1)
+assert.deepStrictEqual(countdown(5), [5, 4, 3, 2, 1]);
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
index 07966ec6618..d240bcb7b02 100644
--- a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
+++ b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
@@ -56,6 +56,13 @@ assert.deepStrictEqual(rangeOfNumbers(6, 9), [6, 7, 8, 9]);
 assert.deepStrictEqual(rangeOfNumbers(4, 4), [4]);
 ```
 
+Global variables should not be used to cache the array.
+
+```js
+rangeOfNumbers(1, 3)
+assert.deepStrictEqual(rangeOfNumbers(6, 9), [6, 7, 8, 9]);
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/es6/mutate-an-array-declared-with-const.md b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/es6/mutate-an-array-declared-with-const.md
index 2b1307c23ec..74d56889a24 100644
--- a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/es6/mutate-an-array-declared-with-const.md
+++ b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/es6/mutate-an-array-declared-with-const.md
@@ -23,7 +23,7 @@ s[2] = 45;
 console.log(s);
 ```
 
-`s = [1, 2, 3]` wird zu einem Fehler führen. Die `console.log` wird den Wert `[5, 6, 45]` anzeigen.
+`s = [1, 2, 3]` wird zu einem Fehler führen. After commenting out that line, the `console.log` will display the value `[5, 6, 45]`.
 
 Wie du siehst, kannst du das Objekt `[5, 6, 7]` selbst verändern und die Variable `s` wird immer noch auf das veränderte Array `[5, 6, 45]` zeigen. Wie alle Arrays sind die Arrayelemente in `s` veränderbar, aber weil `const` verwendet wurde, kannst du den Variablennamen `s` nicht verwenden, um mit dem Zuweisungsoperator auf ein anderes Array zu zeigen.
 
diff --git a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
index 0856331c12b..f5efcb7d098 100644
--- a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
+++ b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
@@ -12,24 +12,35 @@ ES6 bietet eine neue Syntax zum Erstellen von Objekten, die das Schlüsselwort <
 
 Es ist zu beachten, dass die Syntax `class` nur eine Syntax ist und keine vollwertige klassenbasierte Implementierung eines objektorientierten Paradigmas, anders als in Sprachen wie Java, Python, Ruby usw.
 
-In ES5 definieren wir normalerweise eine Funktion `constructor` und verwenden das Schlüsselwort `new`, um ein Objekt zu instanziieren.
-
-```js
-var SpaceShuttle = function(targetPlanet){
-  this.targetPlanet = targetPlanet;
-}
-var zeus = new SpaceShuttle('Jupiter');
-```
-
-Die Syntax `class` ersetzt einfach die Erstellung der Funktion `constructor`:
+In ES5, an object can be created by defining a `constructor` function and using the `new` keyword to instantiate the object.
+
+In ES6, a `class` declaration has a `constructor` method that is invoked with the `new` keyword. If the `constructor` method is not explicitly defined, then it is implicitly defined with no arguments.
 
 ```js
+// Explicit constructor
 class SpaceShuttle {
   constructor(targetPlanet) {
     this.targetPlanet = targetPlanet;
   }
+  takeOff() {
+    console.log("To " + this.targetPlanet + "!");
+  }
 }
+
+// Implicit constructor 
+class Rocket {
+  launch() {
+    console.log("To the moon!");
+  }
+}
+
 const zeus = new SpaceShuttle('Jupiter');
+// prints To Jupiter! in console
+zeus.takeOff();
+
+const atlas = new Rocket();
+// prints To the moon! in console
+atlas.launch();
 ```
 
 Es ist zu beachten, dass das Schlüsselwort `class` eine neue Funktion deklariert, zu der ein Konstruktor hinzugefügt wird. Dieser Konstruktor wird aufgerufen, wenn `new` aufgerufen wird, um ein neues Objekt zu erstellen.
diff --git a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
index a2f3e30f0e3..8ec25e60a55 100644
--- a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
+++ b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
@@ -53,7 +53,8 @@ assert(
 `bicycle.setGear(48)` sollte den Wert von `gear` auf 48 ändern.
 
 ```js
-assert(new bicycle.setGear(48).gear === 48);
+bicycle.setGear(48);
+assert(bicycle.gear === 48);
 ```
 
 # --seed--
diff --git a/curriculum/challenges/german/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/german/02-javascript-algorithms-and-data-structures/functional-programming/add-elements-to-the-end-of-an-array-using-concat-instead-of-push.md
index 3dc0be78952..5fa480cd0df 100644
--- a/curriculum/challenges/german/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/german/02-javascript-algorithms-and-data-structures/functional-programming/add-elements-to-the-end-of-an-array-using-concat-instead-of-push.md
@@ -10,20 +10,20 @@ dashedName: add-elements-to-the-end-of-an-array-using-concat-instead-of-push
 
 Bei funktionalem Programmieren geht es um das Erstellen und Benutzen von nicht mutierenden Funktionen.
 
-In der letzten Aufgabe wurde die `concat`-Methode vorgestellt, mit der man Arrays miteinander kombinieren kann, ohne die ursprünglichen Arrays zu verändern. Vergleiche die `concat`- mit der `push`-Methode. `push` fügt ein Element am Ende desselben Arrays hinzu, für das es aufgerufen wird, was das Array verändert. Hier ist ein Beispiel:
+The last challenge introduced the `concat` method as a way to merge arrays into a new array without mutating the original arrays. Vergleiche die `concat`- mit der `push`-Methode. `push` adds items to the end of the same array it is called on, which mutates that array. Hier ist ein Beispiel:
 
 ```js
 const arr = [1, 2, 3];
-arr.push([4, 5, 6]);
+arr.push(4, 5, 6);
 ```
 
-`arr` hätte nun den modifizierten Wert `[1, 2, 3, [4, 5, 6]]`, was nicht dem praktischen Programmierweg entspricht.
+`arr` would have a modified value of `[1, 2, 3, 4, 5, 6]`, which is not the functional programming way.
 
-`concat` bietet eine Möglichkeit, neue Elemente an das Ende eines Arrays anzuhängen, ohne dass es zu veränderlichen Auswirkungen kommt.
+`concat` offers a way to merge new items to the end of an array without any mutating side effects.
 
 # --instructions--
 
-Ändere die `nonMutatingPush`-Funktion so, dass sie `concat` anstelle von `push` verwendet, um `newItem` dem Ende von `original` hinzuzufügen. Die Funktion sollte ein Array zurückgeben.
+Change the `nonMutatingPush` function so it uses `concat` to merge `newItem` to the end of `original` without mutating `original` or `newItem` arrays. Die Funktion sollte ein Array zurückgeben.
 
 # --hints--
 
diff --git a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/functional-programming/understand-functional-programming-terminology.md b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/functional-programming/understand-functional-programming-terminology.md
index cb114d470e1..2c70adaa116 100644
--- a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/functional-programming/understand-functional-programming-terminology.md
+++ b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/functional-programming/understand-functional-programming-terminology.md
@@ -18,7 +18,7 @@ Aber zuerst wollen wir ein paar funktionale Begriffe klären:
 
 Funktionen, die einer Variablen zugewiesen, an eine andere Funktion übergeben oder von einer anderen Funktion zurückgegeben werden können, werden <dfn>Funktionen erster Klasse</dfn> genannt. Alle Funktionen in JavaScript sind Funktionen erster Klasse.
 
-Die Funktionen, die eine Funktion als Argument nehmen oder eine Funktion als Rückgabewert zurückgeben, werden <dfn>Funktionen höherer Ordnung</dfn> genannt.
+The functions that take a function as an argument, or return a function as a return value, are called <dfn>higher order</dfn> functions.
 
 Wenn Funktionen an eine andere Funktion übergeben oder von einer anderen Funktion zurückgegeben werden, dann können die übergebenen oder zurückgegebenen Funktionen als <dfn>Lambda</dfn> bezeichnet werden.
 
diff --git a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
index 08f139258e0..a701b8f6882 100644
--- a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
+++ b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
@@ -137,14 +137,6 @@ assert.strictEqual(
 
 # --seed--
 
-## --after-user-code--
-
-```js
-if(bob){
-  bob = new Person("Bob Ross");
-}
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
index 0340dea00fe..1f9945eb6ca 100644
--- a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
+++ b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
@@ -42,6 +42,13 @@ Deine Lösung sollte nicht `Array.prototype.flat()` oder `Array.prototype.flatMa
 assert(!code.match(/\.\s*flat\s*\(/) && !code.match(/\.\s*flatMap\s*\(/));
 ```
 
+Global variables should not be used.
+
+```js
+steamrollArray([1, {}, [3, [[4]]]])
+assert.deepEqual(steamrollArray([1, {}, [3, [[4]]]]), [1, {}, 3, 4])
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
index 798a4587fd4..55f9a6c7327 100644
--- a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
+++ b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
@@ -47,28 +47,48 @@ sumPrimes(10);
 # --solutions--
 
 ```js
-function eratosthenesArray(n) {
-    var primes = [];
-    if (n > 2) {
-        var half = n>>1;
-        var sieve = Array(half);
-        for (var i = 1, limit = Math.sqrt(n)>>1; i <= limit; i++) {
-            if (!sieve[i]) {
-                for (var step = 2*i+1, j = (step*step)>>1; j < half; j+=step) {
-                    sieve[j] = true;
-                }
-            }
-        }
-        primes.push(2);
-        for (var p = 1; p < half; p++) {
-            if (!sieve[p]) primes.push(2*p+1);
+class PrimeSeive {
+  constructor(num) {
+    const seive = Array(Math.floor((num - 1) / 2)).fill(true);
+    const upper = Math.floor((num - 1) / 2);
+    const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+
+    for (let i = 0; i <= sqrtUpper; i++) {
+      if (seive[i]) {
+        // Mark value in seive array
+        const prime = 2 * i + 3;
+        // Mark all multiples of this number as false (not prime)
+        const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+        for (let j = primeSqaredIndex; j < upper; j += prime) {
+          seive[j] = false;
         }
+      }
     }
-    return primes;
-}
+
+    this._seive = seive;
+  }
+
+  isPrime(num) {
+    return num === 2
+      ? true
+      : num % 2 === 0
+        ? false
+        : this.isOddPrime(num);
+  }
+
+  isOddPrime(num) {
+    return this._seive[(num - 3) / 2];
+  }
+};
 
 function sumPrimes(num) {
-  return eratosthenesArray(num+1).reduce(function(a,b) {return a+b;}, 0);
+  const primeSeive = new PrimeSeive(num);
+
+  let sum = 2;
+  for (let i = 3; i <= num; i += 2) {
+    if (primeSeive.isOddPrime(i)) sum += i;
+  }
+  return sum;
 }
 
 sumPrimes(10);
diff --git a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
index ec3968b0b27..b66dd5dea32 100644
--- a/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
+++ b/curriculum/challenges/german/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
@@ -79,23 +79,55 @@ assert(beagle.constructor === Dog);
 `beagle.eat()` sollte den String `nom nom nom` in der Konsole ausgeben.
 
 ```js
-console.log = function (msg) {
-  throw msg;
-};
-assert.throws(() => beagle.eat(), 'nom nom nom');
+capture();
+beagle.eat();
+uncapture();
+assert(logOutput == 'nom nom nom');
 ```
 
 `beagle.bark()` sollte den String `Woof!` in der Konsole ausgeben.
 
 ```js
-console.log = function (msg) {
-  throw msg;
-};
-assert.throws(() => beagle.bark(), 'Woof!');
+capture();
+beagle.bark();
+uncapture();
+assert(logOutput == 'Woof!');
 ```
 
 # --seed--
 
+## --before-user-code--
+
+```js
+var logOutput = "";
+var originalConsole = console
+function capture() {
+    var nativeLog = console.log;
+    console.log = function (message) {
+        logOutput = message;
+        if(nativeLog.apply) {
+          nativeLog.apply(originalConsole, arguments);
+        } else {
+          var nativeMsg = Array.prototype.slice.apply(arguments).join(' ');
+          nativeLog(nativeMsg);
+        }
+    };
+}
+
+function uncapture() {
+  console.log = originalConsole.log;
+}
+
+capture();
+```
+
+## --after-user-code--
+
+```js
+uncapture();
+(function() { return logOutput || "console.log never called"; })();
+```
+
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/german/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md b/curriculum/challenges/german/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
index 77fd324ad6d..8509bcba3b2 100644
--- a/curriculum/challenges/german/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
+++ b/curriculum/challenges/german/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
@@ -8,7 +8,7 @@ dashedName: build-a-25--5-clock
 
 # --description--
 
-**Aufgabe:** Erstelle eine Anwendung, die eine ähnliche Funktionalität wie <a href="https://codepen.io/freeCodeCamp/full/XpKrrW" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/XpKrrW</a> aufweist.
+**Objective:** Build an app that is functionally similar to this: <a href="https://25--5-clock.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://25--5-clock.freecodecamp.rocks</a>.
 
 Erfülle die folgenden User Stories und bestehe alle Tests. Verwende Bibliotheken und APIs deiner Wahl. Gib dem Ganzen deinen persönlichen Stil.
 
diff --git a/curriculum/challenges/german/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md b/curriculum/challenges/german/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
index 2d4a50f53ee..ed2c2fc285e 100644
--- a/curriculum/challenges/german/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
+++ b/curriculum/challenges/german/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
@@ -8,7 +8,7 @@ dashedName: build-a-drum-machine
 
 # --description--
 
-**Aufgabe:** Erstelle eine Anwendung, die eine ähnliche Funktionalität wie <a href="https://codepen.io/freeCodeCamp/full/MJyNMd" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/MJyNMd</a> aufweist.
+**Objective:** Build an app that is functionally similar to this: <a href="https://drum-machine.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://drum-machine.freecodecamp.rocks/</a>.
 
 Erfülle die folgenden User Stories und bestehe alle Tests. Verwende Bibliotheken und APIs deiner Wahl. Gib dem Ganzen deinen persönlichen Stil.
 
@@ -28,9 +28,21 @@ Du kannst eine beliebige Mischung aus HTML, JavaScript, CSS, Bootstrap, SASS, Re
 
 **User Story #7:** Wenn ein `.drum-pad` ausgelöst wird, wird ein String, der den zugehörigen Audioclip beschreibt, als innerer Text des `#display`-Elements angezeigt (jede Zeichenfolge muss eindeutig sein).
 
-Du kannst dein Projekt erstellen, indem du diese CodePen-Vorlage <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel="noopener noreferrer nofollow"></a> verwendest und auf `Save` klickst, um deinen eigenen Pen zu erstellen. Oder du kannst diesen CDN-Link verwenden, um die Tests in jeder beliebigen Umgebung auszuführen: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+Here are some audio samples you can use for your drum machine:
 
-Sobald du fertig bist, übermittle die URL zu deinem Arbeitsprojekt, wenn alle Tests bestanden sind.
+- [Heater 1](https://s3.amazonaws.com/freecodecamp/drums/Heater-1.mp3)
+- [Heater 2](https://s3.amazonaws.com/freecodecamp/drums/Heater-2.mp3)
+- [Heater 3](https://s3.amazonaws.com/freecodecamp/drums/Heater-3.mp3)
+- [Heater 4](https://s3.amazonaws.com/freecodecamp/drums/Heater-4_1.mp3)
+- [Clap](https://s3.amazonaws.com/freecodecamp/drums/Heater-6.mp3)
+- [Offene Hi-Hat](https://s3.amazonaws.com/freecodecamp/drums/Dsc_Oh.mp3)
+- [Kick-n'-Hat](https://s3.amazonaws.com/freecodecamp/drums/Kick_n_Hat.mp3)
+- [Kick](https://s3.amazonaws.com/freecodecamp/drums/RP4_KICK_1.mp3)
+- [Geschlossene Hi-Hat](https://s3.amazonaws.com/freecodecamp/drums/Cev_H2.mp3)
+
+You can build your project by <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel="noopener noreferrer nofollow">using this CodePen template</a> and clicking `Save` to create your own pen. Or you can use this CDN link to run the tests in any environment you like: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+
+Once you're done, submit the URL to your working project with all its tests passing.
 
 # --solutions--
 
diff --git a/curriculum/challenges/german/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md b/curriculum/challenges/german/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
index 27ee60981e5..c9b56797963 100644
--- a/curriculum/challenges/german/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
+++ b/curriculum/challenges/german/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
@@ -8,7 +8,7 @@ dashedName: build-a-javascript-calculator
 
 # --description--
 
-**Aufgabe:** Erstelle eine Anwendung, die eine ähnliche Funktionalität wie <a href="https://codepen.io/freeCodeCamp/full/wgGVVX" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/wgGVVX</a> aufweist.
+**Objective:** Build an app that is functionally similar to this: <a href="https://javascript-calculator.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://javascript-calculator.freecodecamp.rocks/</a>.
 
 Erfülle die folgenden User Stories und bestehe alle Tests. Verwende Bibliotheken und APIs deiner Wahl. Gib dem Ganzen deinen persönlichen Stil.
 
diff --git a/curriculum/challenges/german/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md b/curriculum/challenges/german/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
index 214b5dcf184..4614272e5d5 100644
--- a/curriculum/challenges/german/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
+++ b/curriculum/challenges/german/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
@@ -8,7 +8,7 @@ dashedName: build-a-markdown-previewer
 
 # --description--
 
-**Aufgabe:** Erstelle eine Anwendung, die eine ähnliche Funktionalität wie <a href="https://codepen.io/freeCodeCamp/full/GrZVVO" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/GrZVVO</a> aufweist.
+**Objective:** Build an app that is functionally similar to this: <a href="https://markdown-previewer.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://markdown-previewer.freecodecamp.rocks/</a>.
 
 Erfülle die folgenden User Stories und bestehe alle Tests. Verwende Bibliotheken und APIs deiner Wahl. Gib dem Ganzen deinen persönlichen Stil.
 
diff --git a/curriculum/challenges/german/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md b/curriculum/challenges/german/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
index 27b8b0ff2da..bf7d35b0a32 100644
--- a/curriculum/challenges/german/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
+++ b/curriculum/challenges/german/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
@@ -8,7 +8,7 @@ dashedName: build-a-random-quote-machine
 
 # --description--
 
-**Aufgabe:** Erstelle eine Anwendung, die eine ähnliche Funktionalität wie <a href="https://codepen.io/freeCodeCamp/full/qRZeGZ" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/qRZeGZ</a> aufweist.
+**Objective:** Build an app that is functionally similar to this: <a href="https://random-quote-machine.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://random-quote-machine.freecodecamp.rocks/</a>.
 
 Erfülle die folgenden User Stories und bestehe alle Tests. Verwende Bibliotheken und APIs deiner Wahl. Gib dem Ganzen deinen persönlichen Stil.
 
diff --git a/curriculum/challenges/german/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md b/curriculum/challenges/german/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
index 3886341a7f0..43c95fd5e31 100644
--- a/curriculum/challenges/german/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
+++ b/curriculum/challenges/german/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
@@ -8,7 +8,7 @@ dashedName: visualize-data-with-a-bar-chart
 
 # --description--
 
-**Aufgabe:** Erstelle eine Anwendung, die eine ähnliche Funktionalität wie <a href="https://codepen.io/freeCodeCamp/full/GrZVaM" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/GrZVaM</a> aufweist.
+**Objective:** Build an app that is functionally similar to this: <a href="https://bar-chart.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://bar-chart.freecodecamp.rocks</a>.
 
 Erfülle die folgenden User Stories und bestehe alle Tests. Verwende Bibliotheken und APIs deiner Wahl. Gib dem Ganzen deinen persönlichen Stil.
 
diff --git a/curriculum/challenges/german/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md b/curriculum/challenges/german/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
index f3f17e0f486..85183e77f8f 100644
--- a/curriculum/challenges/german/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
+++ b/curriculum/challenges/german/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
@@ -8,7 +8,7 @@ dashedName: visualize-data-with-a-choropleth-map
 
 # --description--
 
-**Aufgabe:** Erstelle eine Anwendung, die eine ähnliche Funktionalität wie <a href="https://codepen.io/freeCodeCamp/full/EZKqza" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/EZKqza</a> aufweist.
+**Objective:** Build an app that is functionally similar to this: <a href="https://choropleth-map.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://choropleth-map.freecodecamp.rocks</a>.
 
 Erfülle die folgenden User Stories und bestehe alle Tests. Verwende Bibliotheken und APIs deiner Wahl. Gib dem Ganzen deinen persönlichen Stil.
 
diff --git a/curriculum/challenges/german/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md b/curriculum/challenges/german/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
index fe0cea2a04a..98ff88f1079 100644
--- a/curriculum/challenges/german/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
+++ b/curriculum/challenges/german/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
@@ -8,7 +8,7 @@ dashedName: visualize-data-with-a-heat-map
 
 # --description--
 
-**Aufgabe:** Erstelle eine Anwendung, die eine ähnliche Funktionalität wie <a href="https://codepen.io/freeCodeCamp/full/JEXgeY" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/JEXgeY</a> aufweist.
+**Objective:** Build an app that is functionally similar to this: <a href="https://heat-map.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://heat-map.freecodecamp.rocks</a>.
 
 Erfülle die folgenden User Stories und bestehe alle Tests. Verwende Bibliotheken und APIs deiner Wahl. Gib dem Ganzen deinen persönlichen Stil.
 
diff --git a/curriculum/challenges/german/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md b/curriculum/challenges/german/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
index 6c73c98ede8..148fcc4252d 100644
--- a/curriculum/challenges/german/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
+++ b/curriculum/challenges/german/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
@@ -8,7 +8,7 @@ dashedName: visualize-data-with-a-scatterplot-graph
 
 # --description--
 
-**Aufgabe:** Erstelle eine Anwendung, die eine ähnliche Funktionalität wie <a href="https://codepen.io/freeCodeCamp/full/bgpXyK" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/bgpXyK</a> aufweist.
+**Objective:** Build an app that is functionally similar to this: <a href="https://scatterplot-graph.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://scatterplot-graph.freecodecamp.rocks</a>.
 
 Erfülle die folgenden User Stories und bestehe alle Tests. Verwende Bibliotheken und APIs deiner Wahl. Gib dem Ganzen deinen persönlichen Stil.
 
diff --git a/curriculum/challenges/german/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md b/curriculum/challenges/german/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
index f45f5189d27..886a34b1eac 100644
--- a/curriculum/challenges/german/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
+++ b/curriculum/challenges/german/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
@@ -8,7 +8,7 @@ dashedName: visualize-data-with-a-treemap-diagram
 
 # --description--
 
-**Aufgabe:** Erstelle eine Anwendung, die eine ähnliche Funktionalität wie <a href="https://codepen.io/freeCodeCamp/full/KaNGNR" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/KaNGNR</a> aufweist.
+**Objective:** Build an app that is functionally similar to this: <a href="https://treemap-diagram.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://treemap-diagram.freecodecamp.rocks</a>.
 
 Erfülle die folgenden User Stories und bestehe alle Tests. Verwende Bibliotheken und APIs deiner Wahl. Gib dem Ganzen deinen persönlichen Stil.
 
diff --git a/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/add-document-elements-with-d3.md b/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/add-document-elements-with-d3.md
index ea44782e9cd..c45d4660568 100644
--- a/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/add-document-elements-with-d3.md
+++ b/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/add-document-elements-with-d3.md
@@ -10,7 +10,7 @@ dashedName: add-document-elements-with-d3
 
 D3 has several methods that let you add and change elements in your document.
 
-The `select()` method selects one element from the document. It takes an argument for the name of the element you want and returns an HTML node for the first element in the document that matches the name. Here's an example:
+The `select()` method selects one element from the document. Sie nimmt ein Argument für den Namen des gewünschten Elements entgegen und gibt einen HTML-Knoten für das erste Element im Dokument zurück, das dem Namen entspricht. Hier ist ein Beispiel:
 
 ```js
 const anchor = d3.select("a");
@@ -20,11 +20,11 @@ The above example finds the first anchor tag on the page and saves an HTML node
 
 Two other useful methods are `append()` and `text()`.
 
-The `append()` method takes an argument for the element you want to add to the document. It appends an HTML node to a selected item, and returns a handle to that node.
+The `append()` method takes an argument for the element you want to add to the document. Es hängt einen HTML-Knoten an ein ausgewähltes Element an und gibt ein Handle an diesen Knoten zurück.
 
 The `text()` method either sets the text of the selected node, or gets the current text. To set the value, you pass a string as an argument inside the parentheses of the method.
 
-Here's an example that selects an unordered list, appends a list item, and adds text:
+Hier ist ein Beispiel, das eine ungeordnete Liste auswählt, ein Listenelement anhängt und Text hinzufügt:
 
 ```js
 d3.select("ul")
diff --git a/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/add-labels-to-scatter-plot-circles.md b/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/add-labels-to-scatter-plot-circles.md
index 0ad9ff3fbac..f07ac9c6cf1 100644
--- a/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/add-labels-to-scatter-plot-circles.md
+++ b/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/add-labels-to-scatter-plot-circles.md
@@ -12,15 +12,15 @@ You can add text to create labels for the points in a scatter plot.
 
 The goal is to display the comma-separated values for the first (`x`) and second (`y`) fields of each item in `dataset`.
 
-The `text` nodes need `x` and `y` attributes to position it on the SVG canvas. In this challenge, the `y` value (which determines height) can use the same value that the `circle` uses for its `cy` attribute. The `x` value can be slightly larger than the `cx` value of the `circle`, so the label is visible. This will push the label to the right of the plotted point.
+Die `text`-Knoten benötigen die Attribute `x` und `y`, um sie auf dem SVG-Canvas zu positionieren. In dieser Aufgabe kann der `y`-Wert (der die Höhe bestimmt) denselben Wert verwenden, den der `circle`-Wert für sein `cy`-Attribut verwendet. The `x` value can be slightly larger than the `cx` value of the `circle`, so the label is visible. This will push the label to the right of the plotted point.
 
 # --instructions--
 
-Label each point on the scatter plot using the `text` elements. The text of the label should be the two values separated by a comma and a space. For example, the label for the first point is `34, 78`. Set the `x` attribute so it's `5` units more than the value you used for the `cx` attribute on the `circle`. Set the `y` attribute the same way that's used for the `cy` value on the `circle`.
+Beschrifte jeden Punkt im Streudiagramm mithilfe der `text`-Elemente. The text of the label should be the two values separated by a comma and a space. For example, the label for the first point is `34, 78`. Set the `x` attribute so it's `5` units more than the value you used for the `cx` attribute on the `circle`. Set the `y` attribute the same way that's used for the `cy` value on the `circle`.
 
 # --hints--
 
-Your code should have 10 `text` elements.
+Dein Code sollte 10 `text`-Elemente enthalten.
 
 ```js
 assert($('text').length == 10);
@@ -218,7 +218,7 @@ assert(
        .attr("x", (d) => d[0] + 5)
        .attr("y", (d) => h - d[1])
        .text((d) => (d[0] + ", " + d[1]))
-       
+
   </script>
 </body>
 ```
diff --git a/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/change-styles-based-on-data.md b/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/change-styles-based-on-data.md
index 1ed6ae7d5e2..768a697920c 100644
--- a/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/change-styles-based-on-data.md
+++ b/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/change-styles-based-on-data.md
@@ -1,6 +1,6 @@
 ---
 id: 587d7fa7367417b2b2512bc7
-title: Change Styles Based on Data
+title: Stiländerung basierend auf Daten
 challengeType: 6
 forumTopicId: 301479
 dashedName: change-styles-based-on-data
@@ -8,7 +8,7 @@ dashedName: change-styles-based-on-data
 
 # --description--
 
-D3 is about visualization and presentation of data. It's likely you'll want to change the styling of elements based on the data. You can use a callback function in the `style()` method to change the styling for different elements.
+Bei D3 geht es um die Visualisierung und Darstellung von Daten. Es ist wahrscheinlich, dass du das Format der Elemente auf der Grundlage der Daten ändern wirst. You can use a callback function in the `style()` method to change the styling for different elements.
 
 For example, you may want to color a data point blue if it has a value less than 20, and red otherwise. You can use a callback function in the `style()` method and include the conditional logic. The callback function uses the `d` parameter to represent the data point:
 
diff --git a/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/create-a-linear-scale-with-d3.md b/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/create-a-linear-scale-with-d3.md
index d118740df6c..cb4940e037c 100644
--- a/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/create-a-linear-scale-with-d3.md
+++ b/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/create-a-linear-scale-with-d3.md
@@ -1,6 +1,6 @@
 ---
 id: 587d7fab367417b2b2512bda
-title: Create a Linear Scale with D3
+title: Erstelle eine lineare Skala mit D3
 challengeType: 6
 forumTopicId: 301483
 dashedName: create-a-linear-scale-with-d3
@@ -8,11 +8,11 @@ dashedName: create-a-linear-scale-with-d3
 
 # --description--
 
-The bar and scatter plot charts both plotted data directly onto the SVG canvas. However, if the height of a bar or one of the data points were larger than the SVG height or width values, it would go outside the SVG area.
+Bei den Balken- und Punktediagrammen werden die Daten direkt im SVG-Canvas dargestellt. Wäre jedoch die Höhe eines Balkens oder eines Datenpunkts größer als die SVG-Höhen- oder Breitenwerte, würde er außerhalb des SVG-Bereichs liegen.
 
-In D3, there are scales to help plot data. `scales` are functions that tell the program how to map a set of raw data points onto the pixels of the SVG canvas.
+In D3 gibt es Skalen, die bei der Darstellung von Daten helfen. `scales` are functions that tell the program how to map a set of raw data points onto the pixels of the SVG canvas.
 
-For example, say you have a 100x500-sized SVG canvas and you want to plot Gross Domestic Product (GDP) for a number of countries. The set of numbers would be in the billion or trillion-dollar range. You provide D3 a type of scale to tell it how to place the large GDP values into that 100x500-sized area.
+For example, say you have a 100x500-sized SVG canvas and you want to plot Gross Domestic Product (GDP) for a number of countries. Die Zahlen wären im Milliarden- oder Billionen-Dollar-Bereich. You provide D3 a type of scale to tell it how to place the large GDP values into that 100x500-sized area.
 
 It's unlikely you would plot raw data as-is. Before plotting it, you set the scale for your entire data set, so that the `x` and `y` values fit your canvas width and height.
 
diff --git a/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/create-a-scatterplot-with-svg-circles.md b/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/create-a-scatterplot-with-svg-circles.md
index 5f4bd1e056f..f0a019d4f33 100644
--- a/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/create-a-scatterplot-with-svg-circles.md
+++ b/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/create-a-scatterplot-with-svg-circles.md
@@ -1,6 +1,6 @@
 ---
 id: 587d7fab367417b2b2512bd7
-title: Create a Scatterplot with SVG Circles
+title: Erstelle ein Streudiagramm mit SVG-Kreisen
 challengeType: 6
 forumTopicId: 301484
 dashedName: create-a-scatterplot-with-svg-circles
@@ -8,19 +8,19 @@ dashedName: create-a-scatterplot-with-svg-circles
 
 # --description--
 
-A scatter plot is another type of visualization. It usually uses circles to map data points, which have two values each. These values tie to the `x` and `y` axes, and are used to position the circle in the visualization.
+Ein Streudiagramm ist eine andere Art der Visualisierung. Es verwendet in der Regel Kreise, um Datenpunkte zuzuordnen, die jeweils zwei Werte haben. Diese Werte sind an die Achsen `x` und `y` gebunden und werden verwendet, um den Kreis in der Visualisierung zu positionieren.
 
-SVG has a `circle` tag to create the circle shape. It works a lot like the `rect` elements you used for the bar chart.
+SVG hat ein `circle`-Tag um die Kreisform zu erstellen. Es funktioniert sehr ähnlich wie die `rect`-Elemente, die du für das Balkendiagramm verwendet hast.
 
 # --instructions--
 
 Use the `data()`, `enter()`, and `append()` methods to bind `dataset` to new `circle` elements that are appended to the SVG canvas.
 
-**Note:** The circles won't be visible because we haven't set their attributes yet. We'll do that in the next challenge.
+**Hinweis:** Die Kreise werden nicht sichtbar sein, weil wir ihre Attribute noch nicht gesetzt haben. Wir werden das bei der nächsten Aufgabe machen.
 
 # --hints--
 
-Your code should have 10 `circle` elements.
+Dein Code sollte 10 `circle`-Elemente enthalten.
 
 ```js
 assert($('circle').length == 10);
diff --git a/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/display-shapes-with-svg.md b/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/display-shapes-with-svg.md
index 71a39ddaf10..350590161f9 100644
--- a/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/display-shapes-with-svg.md
+++ b/curriculum/challenges/german/04-data-visualization/data-visualization-with-d3/display-shapes-with-svg.md
@@ -10,13 +10,13 @@ dashedName: display-shapes-with-svg
 
 The last challenge created an `svg` element with a given width and height, which was visible because it had a `background-color` applied to it in the `style` tag. The code made space for the given width and height.
 
-The next step is to create a shape to put in the `svg` area. There are a number of supported shapes in SVG, such as rectangles and circles. They are used to display data. For example, a rectangle (`<rect>`) SVG shape could create a bar in a bar chart.
+The next step is to create a shape to put in the `svg` area. Es gibt eine Reihe von unterstützten Formen in SVG, wie Rechtecke und Kreise. Sie werden verwendet, um Daten anzuzeigen. Zum Beispiel könnte ein Rechteck in (`<rect>`) SVG-Form einen Balken in einem Balkendiagramm erstellen.
 
-When you place a shape into the `svg` area, you can specify where it goes with `x` and `y` coordinates. The origin point of (0, 0) is in the upper-left corner. Positive values for `x` push the shape to the right, and positive values for `y` push the shape down from the origin point.
+Wenn du eine Form in den `svg`-Bereich einfügst, kannst du mit `x` und `y` Koordinaten spezifizieren, wo es platziert werden soll. Der Ursprung von (0, 0) befindet sich in der oberen linken Ecke. Positive values for `x` push the shape to the right, and positive values for `y` push the shape down from the origin point.
 
 To place a shape in the middle of the 500 (width) x 100 (height) `svg` from last challenge, the `x` coordinate would be 250 and the `y` coordinate would be 50.
 
-An SVG `rect` has four attributes. There are the `x` and `y` coordinates for where it is placed in the `svg` area. It also has a `height` and `width` to specify the size.
+An SVG `rect` has four attributes. There are the `x` and `y` coordinates for where it is placed in the `svg` area. Es hat auch eine `height` und `width`, um die Größe spezifizieren.
 
 # --instructions--
 
@@ -24,7 +24,7 @@ Add a `rect` shape to the `svg` using `append()`, and give it a `width` attribut
 
 # --hints--
 
-Your document should have 1 `rect` element.
+Dein Dokument sollte 1 `rect`-Element beinhalten.
 
 ```js
 assert($('rect').length == 1);
diff --git a/curriculum/challenges/german/04-data-visualization/json-apis-and-ajax/get-geolocation-data-to-find-a-users-gps-coordinates.md b/curriculum/challenges/german/04-data-visualization/json-apis-and-ajax/get-geolocation-data-to-find-a-users-gps-coordinates.md
index 1ab902a88f5..acd3c526b5b 100644
--- a/curriculum/challenges/german/04-data-visualization/json-apis-and-ajax/get-geolocation-data-to-find-a-users-gps-coordinates.md
+++ b/curriculum/challenges/german/04-data-visualization/json-apis-and-ajax/get-geolocation-data-to-find-a-users-gps-coordinates.md
@@ -26,11 +26,11 @@ if (navigator.geolocation){
 }
 ```
 
-Er prüft zunächst, ob das Objekt `navigator.geolocation` existiert. Wenn dies der Fall ist, wird die Methode `getCurrentPosition` für dieses Objekt aufgerufen, die eine asynchrone Anfrage nach der Position des Nutzers startet. Wenn die Anfrage erfolgreich ist, wird die Callback-Funktion in der Methode ausgeführt. Diese Funktion greift auf die Werte für Breiten- und Längengrad des `position`-Objekts mithilfe von Punktnotation zu und aktualisiert die HTML.
+Er prüft zunächst, ob das Objekt `navigator.geolocation` existiert. Wenn dies der Fall ist, wird die Methode `getCurrentPosition` für dieses Objekt aufgerufen, die eine asynchrone Anfrage nach der Position des Nutzers startet. Wenn die Anfrage erfolgreich ist, wird die Callback-Funktion in der Methode ausgeführt. This function accesses the `position` object's values for latitude and longitude using dot notation and updates the HTML.
 
 # --instructions--
 
-Füge den Beispielcode innerhalb des `script`-Tags ein, um den aktuellen Standort des Nutzers abzurufen und in die HTML einzufügen.
+Add the example code inside the `script` tags to check a user's current location and insert it into the HTML.
 
 # --hints--
 
diff --git a/curriculum/challenges/german/05-back-end-development-and-apis/back-end-development-and-apis-projects/exercise-tracker.md b/curriculum/challenges/german/05-back-end-development-and-apis/back-end-development-and-apis-projects/exercise-tracker.md
index c2c66766408..77047c25076 100644
--- a/curriculum/challenges/german/05-back-end-development-and-apis/back-end-development-and-apis-projects/exercise-tracker.md
+++ b/curriculum/challenges/german/05-back-end-development-and-apis/back-end-development-and-apis-projects/exercise-tracker.md
@@ -1,6 +1,6 @@
 ---
 id: 5a8b073d06fa14fcfde687aa
-title: Exercise Tracker
+title: Übungs-Tracker
 challengeType: 4
 forumTopicId: 301505
 dashedName: exercise-tracker
@@ -8,19 +8,19 @@ dashedName: exercise-tracker
 
 # --description--
 
-Build a full stack JavaScript app that is functionally similar to this: <a href="https://exercise-tracker.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://exercise-tracker.freecodecamp.rocks</a>. Working on this project will involve you writing your code using one of the following methods:
+Erstelle eine vollständige JavaScript-Anwendung, die eine ähnliche Funktionalität wie <a href="https://exercise-tracker.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://exercise-tracker.freecodecamp.rocks</a> aufweist. Bei der Arbeit an diesem Projekt musst du deinen Code mit einer der folgenden Methoden schreiben:
 
--   Clone <a href="https://github.com/freeCodeCamp/boilerplate-project-exercisetracker/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete your project locally.
--   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-exercisetracker" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> 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.
+-   Klone <a href="https://github.com/freeCodeCamp/boilerplate-project-exercisetracker/" target="_blank" rel="noopener noreferrer nofollow">dieses GitHub Repo</a> und schließe dein Projekt lokal ab.
+-   Benutze <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-exercisetracker" target="_blank" rel="noopener noreferrer nofollow">unser Replit Starter Projekt</a>, um dein Projekt fertigzustellen.
+-   Verwende einen Site-Builder deiner Wahl, um das Projekt fertigzustellen. Achte darauf, alle Dateien aus unserem GitHub Repo zu integrieren.
 
-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.
+Wenn du fertig bist, stelle sicher, dass dein Projekt öffentlich zugänglich gehostet ist. Gib dann die URL in das `Solution Link`-Feld ein. Füge optional einen Link zum Quellcode deines Projekts in das `GitHub Link`-Feld ein.
 
 # --instructions--
 
-Your responses should have the following structures.
+Deine Antworten sollten folgende Struktur haben.
 
-Exercise:
+Übung:
 
 ```js
 {
@@ -32,7 +32,7 @@ Exercise:
 }
 ```
 
-User:
+Nutzer:
 
 ```js
 {
@@ -60,7 +60,7 @@ Log:
 
 # --hints--
 
-You should provide your own project, not the example URL.
+Du solltest dein eigenes Projekt bereitstellen, nicht die Beispiel-URL.
 
 ```js
 (getUserInput) => {
@@ -71,7 +71,7 @@ You should provide your own project, not the example URL.
 };
 ```
 
-You can `POST` to `/api/users` with form data `username` to create a new user.
+Du kannst einen `POST` an `/api/users` mit Formulardaten senden, `username` um einen neuen Benutzer zu erstellen.
 
 ```js
 async (getUserInput) => {
@@ -108,7 +108,7 @@ async (getUserInput) => {
 };
 ```
 
-You can make a `GET` request to `/api/users` to get a list of all users.
+Du kannst eine `GET` Anfrage an `/api/users` stellen, um eine Liste aller Benutzer zu erhalten.
 
 ```js
 async(getUserInput) => {
@@ -121,7 +121,7 @@ async(getUserInput) => {
 };
 ```
 
-The `GET` request to `/api/users` returns an array.
+Die `GET` Anfrage an `/api/users` übermittelt ein Array.
 
 ```js
 async(getUserInput) => {
@@ -136,7 +136,7 @@ async(getUserInput) => {
 };
 ```
 
-Each element in the array returned from `GET /api/users` is an object literal containing a user's `username` and `_id`.
+Jedes Element in dem Array, das von `GET /api/users` zurückgegeben wurde, ist ein Objektliteral, das den `username` und die `_id` des Nutzers enthält.
 
 ```js
 async(getUserInput) => {
@@ -156,7 +156,7 @@ async(getUserInput) => {
 };
 ```
 
-You can `POST` to `/api/users/:_id/exercises` with form data `description`, `duration`, and optionally `date`. If no date is supplied, the current date will be used. 
+`POST`-Anfragen an `/api/users/:_id/exercises` können die Formulardaten `description`, `duration` und optional auch `date` enthalten. Wird kein Datum angegeben, wird das aktuelle Datum verwendet.
 
 ```js
 async (getUserInput) => {
@@ -190,7 +190,7 @@ async (getUserInput) => {
 };
 ```
 
-The response returned from `POST /api/users/:_id/exercises` will be the user object with the exercise fields added.
+Die von `POST /api/users/:_id/exercises` zurückgegebene Antwort besteht aus dem Nutzerobjekt mit Übungsfeldern.
 
 ```js
 async (getUserInput) => {
@@ -229,7 +229,7 @@ async (getUserInput) => {
 };
 ```
 
-You can make a `GET` request to `/api/users/:_id/logs` to retrieve a full exercise log of any user.
+Du kannst eine `GET`-Anfrage an `/api/users/:_id/logs` übermitteln, um ein vollständiges Übungsprotokoll eines beliebigen Nutzers abzurufen.
 
 ```js
 async (getUserInput) => {
@@ -494,7 +494,7 @@ async(getUserInput) => {
 };
 ```
 
-The `date` property of any object in the `log` array that is returned from `GET /api/users/:_id/logs` should be a string. Use the `dateString` format of the `Date` API.
+The `date` property of any object in the `log` array that is returned from `GET /api/users/:_id/logs` should be a string. Verwende das Format `dateString` der `Date`-API.
 
 ```js
 async(getUserInput) => {
@@ -541,7 +541,7 @@ async(getUserInput) => {
 };
 ```
 
-You can add `from`, `to` and `limit` parameters to a `GET /api/users/:_id/logs` request to retrieve part of the log of any user. `from` and `to` are dates in `yyyy-mm-dd` format. `limit` is an integer of how many logs to send back.
+Du kannst die Parameter `from`, `to` und `limit` einer `GET /api/users/:_id/logs`-Anfrage übergeben, um Protokollteile eines beliebigen Benutzers abzurufen. `from` und `to` sind Daten im Format `yyyy-mm-dd`. `limit` ist ein Integer, der angibt, wie viele Protokolle zurückgegeben werden sollen.
 
 ```js
 async (getUserInput) => {
diff --git a/curriculum/challenges/german/05-back-end-development-and-apis/back-end-development-and-apis-projects/request-header-parser-microservice.md b/curriculum/challenges/german/05-back-end-development-and-apis/back-end-development-and-apis-projects/request-header-parser-microservice.md
index 08d8e684c37..19c62a3640d 100644
--- a/curriculum/challenges/german/05-back-end-development-and-apis/back-end-development-and-apis-projects/request-header-parser-microservice.md
+++ b/curriculum/challenges/german/05-back-end-development-and-apis/back-end-development-and-apis-projects/request-header-parser-microservice.md
@@ -8,13 +8,13 @@ dashedName: request-header-parser-microservice
 
 # --description--
 
-Build a full stack JavaScript app that is functionally similar to this: <a href="https://request-header-parser-microservice.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://request-header-parser-microservice.freecodecamp.rocks/</a>. Working on this project will involve you writing your code using one of the following methods:
+Erstelle eine vollständige JavaScript-Anwendung, die eine ähnliche Funktionalität wie <a href="https://request-header-parser-microservice.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://request-header-parser-microservice.freecodecamp.rocks/</a> aufweist. Working on this project will involve you writing your code using one of the following methods:
 
--   Clone <a href="https://github.com/freeCodeCamp/boilerplate-project-headerparser/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete your project locally.
--   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-headerparser" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
+-   Klone <a href="https://github.com/freeCodeCamp/boilerplate-project-headerparser/" target="_blank" rel="noopener noreferrer nofollow">dieses GitHub Repo</a> und schließe dein Projekt lokal ab.
+-   Benutze <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-headerparser" target="_blank" rel="noopener noreferrer nofollow">unser Replit-Starterprojekt</a>, um dein Projekt fertigzustellen.
 -   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
 
-When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+Wenn du fertig bist, stelle sicher, dass dein Projekt öffentlich zugänglich gehostet ist. Gib dann die URL in das `Solution Link`-Feld ein. Füge optional einen Link zum Quellcode deines Projekts in das `GitHub Link`-Feld ein.
 
 # --hints--
 
diff --git a/curriculum/challenges/german/05-back-end-development-and-apis/back-end-development-and-apis-projects/timestamp-microservice.md b/curriculum/challenges/german/05-back-end-development-and-apis/back-end-development-and-apis-projects/timestamp-microservice.md
index aa421f78ebd..1334b9eced1 100644
--- a/curriculum/challenges/german/05-back-end-development-and-apis/back-end-development-and-apis-projects/timestamp-microservice.md
+++ b/curriculum/challenges/german/05-back-end-development-and-apis/back-end-development-and-apis-projects/timestamp-microservice.md
@@ -8,15 +8,15 @@ dashedName: timestamp-microservice
 
 # --description--
 
-Build a full stack JavaScript app that is functionally similar to this: <a href="https://timestamp-microservice.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://timestamp-microservice.freecodecamp.rocks</a>. Working on this project will involve you writing your code using one of the following methods:
+Erstelle eine vollständige JavaScript-Anwendung, die eine ähnliche Funktionalität wie <a href="https://timestamp-microservice.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://timestamp-microservice.freecodecamp.rocks</a> aufweist. Working on this project will involve you writing your code using one of the following methods:
 
--   Clone <a href="https://github.com/freeCodeCamp/boilerplate-project-timestamp/"  target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete your project locally.
--   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-timestamp"  target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
+-   Klone <a href="https://github.com/freeCodeCamp/boilerplate-project-timestamp/"  target="_blank" rel="noopener noreferrer nofollow">dieses GitHub-Repo</a> und schließe dein Projekt lokal ab.
+-   Benutze <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-timestamp"  target="_blank" rel="noopener noreferrer nofollow">unser Replit-Starter-Projekt</a>, um dein Projekt fertigzustellen.
 -   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
 
-When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+Wenn du fertig bist, stelle sicher, dass dein Projekt öffentlich zugänglich gehostet ist. Gib dann die URL in das `Solution Link`-Feld ein. Füge optional einen Link zum Quellcode deines Projekts in das `GitHub Link`-Feld ein.
 
-**Note:** Time zones conversion is not a purpose of this project, so assume all sent valid dates will be parsed with `new Date()` as GMT dates. 
+**Note:** Time zones conversion is not a purpose of this project, so assume all sent valid dates will be parsed with `new Date()` as GMT dates.
 
 # --hints--
 
diff --git a/curriculum/challenges/german/05-back-end-development-and-apis/back-end-development-and-apis-projects/url-shortener-microservice.md b/curriculum/challenges/german/05-back-end-development-and-apis/back-end-development-and-apis-projects/url-shortener-microservice.md
index 64eb51f8e6f..7d18a1f5b3f 100644
--- a/curriculum/challenges/german/05-back-end-development-and-apis/back-end-development-and-apis-projects/url-shortener-microservice.md
+++ b/curriculum/challenges/german/05-back-end-development-and-apis/back-end-development-and-apis-projects/url-shortener-microservice.md
@@ -14,7 +14,7 @@ Build a full stack JavaScript app that is functionally similar to this: <a href=
 -   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-urlshortener" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 -   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
 
-When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+Wenn du fertig bist, stelle sicher, dass dein Projekt öffentlich zugänglich gehostet ist. Then submit the URL to it in the `Solution Link` field. Füge optional einen Link zum Quellcode deines Projekts in das `GitHub Link`-Feld ein.
 
 # --instructions--
 
diff --git a/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/chain-middleware-to-create-a-time-server.md b/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/chain-middleware-to-create-a-time-server.md
index 9d9fa53b85d..7cf9f8043f0 100644
--- a/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/chain-middleware-to-create-a-time-server.md
+++ b/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/chain-middleware-to-create-a-time-server.md
@@ -8,9 +8,9 @@ dashedName: chain-middleware-to-create-a-time-server
 
 # --description--
 
-Middleware can be mounted at a specific route using `app.METHOD(path, middlewareFunction)`. Middleware can also be chained within a route definition.
+Middleware kann mit `app.METHOD(path, middlewareFunction)` an einer bestimmten Route angehängt werden. Middleware kann auch innerhalb einer Routen-Definition verkettet werden.
 
-Look at the following example:
+Sieh dir das folgende Beispiel an:
 
 ```js
 app.get('/user', function(req, res, next) {
@@ -21,13 +21,13 @@ app.get('/user', function(req, res, next) {
 });
 ```
 
-This approach is useful to split the server operations into smaller units. That leads to a better app structure, and the possibility to reuse code in different places. This approach can also be used to perform some validation on the data. At each point of the middleware stack you can block the execution of the current chain and pass control to functions specifically designed to handle errors. Or you can pass control to the next matching route, to handle special cases. We will see how in the advanced Express section.
+Dieser Ansatz ist nützlich, um den Serverbetrieb in kleinere Einheiten aufzuteilen. Das führt zu einer besseren App-Struktur und der Möglichkeit, Code an verschiedenen Stellen wiederzuverwenden. Dieser Ansatz kann auch zur Validierung der Daten verwendet werden. An jedem Punkt des Middleware-Stacks kannst du die Ausführung der aktuellen Kette blockieren und die Kontrolle an Funktionen übergeben, die speziell für die Fehlerbehandlung entwickelt wurden. Oder du kannst die Kontrolle an die nächste passende Route weitergeben, um besondere Fälle zu bearbeiten. We will see how in the advanced Express section.
 
 # --instructions--
 
-In the route `app.get('/now', ...)` chain a middleware function and the final handler. In the middleware function you should add the current time to the request object in the `req.time` key. You can use `new Date().toString()`. In the handler, respond with a JSON object, taking the structure `{time: req.time}`.
+Verkette in der Route `app.get('/now', ...)` eine Middleware-Funktion und den finalen Handler. In der Middleware-Funktion solltest du dem Request-Objekt im Schlüssel `req.time` die aktuelle Zeit hinzufügen. Du kannst `new Date().toString()` verwenden. Antworte im Handler mit einem JSON-Objekt, das die Struktur `{time: req.time}` hat.
 
-**Note:** The test will not pass if you don’t chain the middleware. If you mount the function somewhere else, the test will fail, even if the output result is correct.
+**Hinweis:** Der Test wird nicht bestanden, wenn du die Middleware nicht verkettest. Wenn du die Funktion an einer anderen Stelle einhängst, schlägt der Test fehl, auch wenn das Ausgabeergebnis korrekt ist.
 
 # --hints--
 
@@ -49,7 +49,7 @@ The /now endpoint should have mounted middleware
   );
 ```
 
-The `/now` endpoint should return the current time.
+Der `/now`-Endpunkt sollte die aktuelle Zeit zurückgeben.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/get-route-parameter-input-from-the-client.md b/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/get-route-parameter-input-from-the-client.md
index b0055f569ea..ce1f862f180 100644
--- a/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/get-route-parameter-input-from-the-client.md
+++ b/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/get-route-parameter-input-from-the-client.md
@@ -8,17 +8,17 @@ dashedName: get-route-parameter-input-from-the-client
 
 # --description--
 
-When building an API, we have to allow users to communicate to us what they want to get from our service. For example, if the client is requesting information about a user stored in the database, they need a way to let us know which user they're interested in. One possible way to achieve this result is by using route parameters. Route parameters are named segments of the URL, delimited by slashes (/). Each segment captures the value of the part of the URL which matches its position. The captured values can be found in the `req.params` object.
+Beim Aufbau einer API müssen wir den Nutzern die Möglichkeit geben, uns mitzuteilen, was sie von unserem Dienst erwarten. Wenn der Kunde beispielsweise Informationen über einen in der Datenbank gespeicherten Nutzer anfordert, muss er uns mitteilen, an welchem Nutzer er interessiert ist. Eine Möglichkeit, dieses Ergebnis zu erreichen, ist die Verwendung von Routenparametern. Routenparameter sind benannte Segmente der URL, die durch Schrägstriche (/) getrennt sind. Jedes Segment erfasst den Wert des Teils der URL, der seiner Position entspricht. Die erfassten Werte sind im Objekt `req.params` zu finden.
 
 <blockquote>route_path: '/user/:userId/book/:bookId'<br>actual_request_URL: '/user/546/book/6754' <br>req.params: {userId: '546', bookId: '6754'}</blockquote>
 
 # --instructions--
 
-Build an echo server, mounted at the route `GET /:word/echo`. Respond with a JSON object, taking the structure `{echo: word}`. You can find the word to be repeated at `req.params.word`. You can test your route from your browser's address bar, visiting some matching routes, e.g. `your-app-rootpath/freecodecamp/echo`.
+Erstelle einen Echo-Server, der über die Route `GET /:word/echo` eingebunden wird. Antworte mit einem JSON-Objekt, das die Struktur `{echo: word}` hat. Das zu wiederholende Wort findest du unter `req.params.word`. Du kannst deine Route in der Adressleiste deines Browsers testen, indem du einige passende Routen besuchst, z.B. `your-app-rootpath/freecodecamp/echo`.
 
 # --hints--
 
-Test 1 : Your echo server should repeat words correctly
+Test 1: Dein Echo-Server sollte Wörter korrekt wiederholen
 
 ```js
 (getUserInput) =>
@@ -36,7 +36,7 @@ Test 1 : Your echo server should repeat words correctly
   );
 ```
 
-Test 2 : Your echo server should repeat words correctly
+Test 2: Dein Echo-Server sollte Wörter korrekt wiederholen
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/implement-a-root-level-request-logger-middleware.md b/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/implement-a-root-level-request-logger-middleware.md
index 2a2faa35c39..5abc2bfbf42 100644
--- a/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/implement-a-root-level-request-logger-middleware.md
+++ b/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/implement-a-root-level-request-logger-middleware.md
@@ -8,9 +8,9 @@ dashedName: implement-a-root-level-request-logger-middleware
 
 # --description--
 
-Earlier, you were introduced to the `express.static()` middleware function. Now it’s time to see what middleware is, in more detail. Middleware functions are functions that take 3 arguments: the request object, the response object, and the next function in the application’s request-response cycle. These functions execute some code that can have side effects on the app, and usually add information to the request or response objects. They can also end the cycle by sending a response when some condition is met. If they don’t send the response when they are done, they start the execution of the next function in the stack. This triggers calling the 3rd argument, `next()`.
+Du hast zuvor von der Middleware-Funktion `express.static()` erfahren. Jetzt ist es an der Zeit, herauszufinden, was Middleware genau ist. Middleware-Funktionen sind Funktionen, denen du bis zu drei Argumente übergeben kannst: das Anfragen- und das Antwortobjekt, sowie die nächste Funktion im Anfrage-Antwort-Zyklus deiner Anwendung. Diese Funktionen führen einen Code aus, der auf deine Anwendung Nebeneffekte haben kann; zudem werden normalerweise Informationen zu den Anfrage- oder Antwortobjekt hinzugefügt. Außerdem können sie den Zyklus beenden, indem sie eine Antwort senden, wenn eine bestimmte Bedingung erfüllt ist. Senden sie nach Abschluss keine Antwort, wird die Ausführung der nächsten Funktion der Reihe ausgelöst. Hierbei wird das dritte Argument – `next()` – aufgerufen.
 
-Look at the following example:
+Sieh dir folgendes Beispiel an:
 
 ```js
 function(req, res, next) {
@@ -19,13 +19,13 @@ function(req, res, next) {
 }
 ```
 
-Let’s suppose you mounted this function on a route. When a request matches the route, it displays the string “I’m a middleware…”, then it executes the next function in the stack. In this exercise, you are going to build root-level middleware. As you have seen in challenge 4, to mount a middleware function at root level, you can use the `app.use(<mware-function>)` method. In this case, the function will be executed for all the requests, but you can also set more specific conditions. For example, if you want a function to be executed only for POST requests, you could use `app.post(<mware-function>)`. Analogous methods exist for all the HTTP verbs (GET, DELETE, PUT, …).
+Nehmen wir an, du hast diese Funktion für eine bestimmte Route aufgesetzt. Wenn eine Anfrage mit der Route übereinstimmt, wird der String “I’m a middleware…” ausgegeben, anschließend wird die nächste Funktion der Reihe ausgeführt. In dieser Übung erfährst du, wie du Middleware auf Hauptverzeichnisebene kreierst. Wie du in Aufgabe 4 erfahren hast, kannst du, um eine Middleware auf Hauptverzeichnisebene aufzusetzen, die Methode `app.use(<mware-function>)` verwenden. In diesem Fall wird die Funktion für alle Anfragen ausgeführt – du kannst jedoch auch spezifischere Bedingungen einstellen. Willst du beispielsweise eine Funktion ausschließlich für POST-Anfragen ausführen, könntest du `app.post(<mware-function>)` verwenden. Analoge Methoden existieren für alle HTTP-Verben (GET, DELETE, PUT, ...).
 
 # --instructions--
 
-Build a simple logger. For every request, it should log to the console a string taking the following format: `method path - ip`. An example would look like this: `GET /json - ::ffff:127.0.0.1`. Note that there is a space between `method` and `path` and that the dash separating `path` and `ip` is surrounded by a space on both sides. You can get the request method (http verb), the relative route path, and the caller’s ip from the request object using `req.method`, `req.path` and `req.ip`. Remember to call `next()` when you are done, or your server will be stuck forever. Be sure to have the ‘Logs’ opened, and see what happens when some request arrives.
+Baue einen einfachen Logger. Für jede Anfrage sollte ein String folgenden Formats geloggt werden: `method path - ip`. Hier ein Beispiel dazu: `GET /json - ::ffff:127.0.0.1`. Achte hierbei auf das Leerzeichen zwischen `method` und `path` und, dass der Bindestrich, der `path` und `ip` trennt, auf beiden Seiten ein Leerzeichen hat. Du kannst sowohl Anfragemethode (HTTP-Verb) als auch den relativen Routenpfad und die IP des Anfragenden dem Anfrageobjekt über `req.method`, `req.path` und `req.ip` entnehmen. Achte darauf, `next()` aufzurufen, sobald du fertig bist – sonst steckt dein Server hier für immer fest. Du solltest zudem 'Logs' geöffnet haben, um zu sehen, was passiert, wenn eine Anfrage eintrifft.
 
-**Note:** Express evaluates functions in the order they appear in the code. This is true for middleware too. If you want it to work for all the routes, it should be mounted before them.
+**Hinweis:** Express bearbeitet Funktionen in der Reihenfolge, in der sie im Code auftauchen. Das trifft auch auf Middleware zu. Möchtest du, dass dies für alle Routen funktioniert, solltest du diese zuvor aufsetzen.
 
 # --hints--
 
diff --git a/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/meet-the-node-console.md b/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/meet-the-node-console.md
index 9f32d837b79..940f9054896 100644
--- a/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/meet-the-node-console.md
+++ b/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/meet-the-node-console.md
@@ -14,7 +14,7 @@ Working on these challenges will involve you writing your code using one of the
 - Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-express" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete these challenges.
 - Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
 
-When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field.
+Wenn du fertig bist, stelle sicher, dass dein Projekt öffentlich zugänglich gehostet ist. Gib dann die URL in das `Solution Link`-Feld ein.
 
 During the development process, it is important to be able to check what’s going on in your code.
 
diff --git a/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/use-body-parser-to-parse-post-requests.md b/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/use-body-parser-to-parse-post-requests.md
index 5d6ba3175d4..f3eb31ef9eb 100644
--- a/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/use-body-parser-to-parse-post-requests.md
+++ b/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/use-body-parser-to-parse-post-requests.md
@@ -28,7 +28,7 @@ As you can see, the body is encoded like the query string. This is the default f
 
 `body-parser` has already been installed and is in your project's `package.json` file. `require` it at the top of the `myApp.js` file and store it in a variable named `bodyParser`. The middleware to handle URL encoded data is returned by `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.
 
-**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. 
+**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.
 
diff --git a/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/use-the-.env-file.md b/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/use-the-.env-file.md
index 80708e3fdb9..372499f97bf 100644
--- a/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/use-the-.env-file.md
+++ b/curriculum/challenges/german/05-back-end-development-and-apis/basic-node-and-express/use-the-.env-file.md
@@ -1,6 +1,6 @@
 ---
 id: 587d7fb1367417b2b2512bf2
-title: Use the .env File
+title: Verwende .env-Dateien
 challengeType: 2
 forumTopicId: 301521
 dashedName: use-the--env-file
@@ -8,25 +8,25 @@ dashedName: use-the--env-file
 
 # --description--
 
-The `.env` file is a hidden file that is used to pass environment variables to your application. This file is secret, no one but you can access it, and it can be used to store data that you want to keep private or hidden. For example, you can store API keys from external services or your database URI. You can also use it to store configuration options. By setting configuration options, you can change the behavior of your application, without the need to rewrite some code.
+Die `.env`-Datei ist eine versteckte Datei, mit der Umgebungsvariablen an eine Anwendung übergeben werden. Diese Datei wird versteckt – niemand außer dir kann auf diese zugreifen, mit ihr kannst du Daten speichern, die du privat oder versteckt halten möchtest. Beispielsweise kannst du API-Schlüssel externer Dienste, oder deine Datenbank-URL speichern. Zudem kannst du Konfigurationsmöglichkeiten speichern. Indem du Konfigurationsmöglichkeiten einstellst, veränderst du das Verhalten deiner Anwendung – ohne den Code umzuschreiben.
 
-The environment variables are accessible from the app as `process.env.VAR_NAME`. The `process.env` object is a global Node object, and variables are passed as strings. By convention, the variable names are all uppercase, with words separated by an underscore. The `.env` is a shell file, so you don’t need to wrap names or values in quotes. It is also important to note that there cannot be space around the equals sign when you are assigning values to your variables, e.g. `VAR_NAME=value`. Usually, you will put each variable definition on a separate line.
+Die Umgebungsvariablen sind innerhalb der App unter `process.env.VAR_NAME` aufrufbar. Das `process.env`-Objekt ist ein globales Node-Objekt, Variablen werden als Strings übergeben. Konventionell werden die Variablennamen alle in Großbuchstaben geschrieben, wobei die Wörter durch einen Unterstrich getrennt werden. `.env` ist eine Shell-Datei, somit musst du Namen oder Werte nicht in Anführungszeichen setzen. Es ist auch wichtig zu beachten, dass um das Gleichheitszeichen kein Leerzeichen stehen darf, wenn du deinen Variablen Werte zuordnest – `VAR_NAME=value`. Normalerweise wird jede Variablendefinition in eine eigene Zeile gesetzt.
 
 # --instructions--
 
-Let's add an environment variable as a configuration option.
+Lass uns eine Umgebungsvariable als Konfigurationsoption setzen.
 
-Create a `.env` file in the root of your project directory, and store the variable `MESSAGE_STYLE=uppercase` in it.
+Erstelle eine `.env`-Datei im Hauptverzeichnis deines Projekts, speichere in dieser anschließend die Variabel `MESSAGE_STYLE=uppercase`.
 
-Then, in the `/json` GET route handler you created in the last challenge access `process.env.MESSAGE_STYLE` and transform the response object's `message` to uppercase if the variable equals `uppercase`. The response object should either be `{"message": "Hello json"}` or `{"message": "HELLO JSON"}`, depending on the `MESSAGE_STYLE` value.
+Greife nun in dem `/json`-GET-Route-Handler, den du in der letzten Aufgabe erstellt hast, auf`process.env.MESSAGE_STYLE` zu und verwandle das Antwort-Objekt der `message` in Großbuchstaben, wenn die Variable `uppercase` entspricht. Das Antwortobjekt sollte entweder `{"message": "Hello json"}` oder `{"message": "HELLO JSON"}` sein, je nachdem welchen Wert du für `MESSAGE_STYLE` gesetzt hast.
 
-**Note:** If you are using Replit, you cannot create a `.env` file. Instead, use the built-in <dfn>SECRETS</dfn> tab to add the variable.
+**Hinweis:** Nutzt du Replit, kannst du keine `.env`-Datei erstellen. Benutze stattdessen den eingebauten <dfn>SECRETS</dfn>-Tab, um eine Variabel hinzuzufügen.
 
-If you are working locally, you will need the `dotenv` package. It loads environment variables from your `.env` file into `process.env`. The `dotenv` package has already been installed, and is in your project's `package.json` file. At the top of your `myApp.js` file, import and load the variables with `require('dotenv').config()`.
+Wenn du lokal arbeitest, benötigst du das `dotenv`-Paket. Dieses lädt Umgebungsvariablen deiner `.env`-Datei in `process.env`. Das `dotenv`-Paket wurde bereits installiert und befindet sich in deiner `package.json`-Projektdatei. At the top of your `myApp.js` file, import and load the variables with `require('dotenv').config()`.
 
 # --hints--
 
-The response of the endpoint `/json` should change according to the environment variable `MESSAGE_STYLE`
+Die Antwort deines `/json`-Endpunkts sollte – abhängig von deiner Umgebungsvariable `MESSAGE_STYLE` – variieren
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/add-a-license-to-your-package.json.md b/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/add-a-license-to-your-package.json.md
index d97b0134019..bc2bf75ea28 100644
--- a/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/add-a-license-to-your-package.json.md
+++ b/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/add-a-license-to-your-package.json.md
@@ -1,6 +1,6 @@
 ---
 id: 587d7fb4367417b2b2512bfe
-title: Add a License to Your package.json
+title: Füge deiner package.json eine Lizenz hinzu
 challengeType: 2
 forumTopicId: 301523
 dashedName: add-a-license-to-your-package-json
@@ -10,7 +10,7 @@ dashedName: add-a-license-to-your-package-json
 
 The `license` field is where you inform users of what they are allowed to do with your project.
 
-Some common licenses for open source projects include MIT and BSD. License information is not required, and copyright laws in most countries will give you ownership of what you create by default. However, it’s always a good practice to explicitly state what users can and can’t do. Here's an example of the license field:
+Einige gängige Lizenzen für Open-Source-Projekte sind MIT und BSD. Lizenzinformation ist nicht erforderlich, und die Urheberrechtsgesetze der meisten Länder geben dir standardmäßig Eigentumsrechte an deiner Kreation. However, it’s always a good practice to explicitly state what users can and can’t do. Hier ist ein Beispiel für das Lizenzfeld:
 
 ```json
 "license": "MIT",
@@ -22,7 +22,7 @@ Fill the `license` field in the package.json file of your project as you find su
 
 # --hints--
 
-package.json should have a valid "license" key
+package.json sollte einen gültigen "license"-Schlüssel haben
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/expand-your-project-with-external-packages-from-npm.md b/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/expand-your-project-with-external-packages-from-npm.md
index fa9056e0992..733ab3f4e9b 100644
--- a/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/expand-your-project-with-external-packages-from-npm.md
+++ b/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/expand-your-project-with-external-packages-from-npm.md
@@ -1,6 +1,6 @@
 ---
 id: 587d7fb4367417b2b2512c00
-title: Expand Your Project with External Packages from npm
+title: Erweitere dein Projekt mit externen Paketen von npm
 challengeType: 2
 forumTopicId: 301527
 dashedName: expand-your-project-with-external-packages-from-npm
@@ -8,9 +8,9 @@ dashedName: expand-your-project-with-external-packages-from-npm
 
 # --description--
 
-One of the biggest reasons to use a package manager, is their powerful dependency management. Instead of manually having to make sure that you get all dependencies whenever you set up a project on a new computer, npm automatically installs everything for you. But how can npm know exactly what your project needs? Meet the `dependencies` section of your package.json file.
+Einer der wichtigsten Gründe für die Verwendung eines Paketmanagers, ist dessen leistungstarkes Abhängigkeitsmanagement. Anstatt manuell sicherzustellen, dass du alle Abhängigkeiten erhältst, wenn du ein Projekt auf einem neuen Computer einrichtest, installiert npm alles automatisch für dich. Aber wie kann npm genau wissen, was dein Projekt benötigt? Meet the `dependencies` section of your package.json file.
 
-In this section, packages your project requires are stored using the following format:
+In diesem Abschnitt werden die Pakete, die dein Projekt benötigt, in folgendem Format gespeichert:
 
 ```json
 "dependencies": {
diff --git a/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/how-to-use-package.json-the-core-of-any-node.js-project-or-npm-package.md b/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/how-to-use-package.json-the-core-of-any-node.js-project-or-npm-package.md
index b6adcfd5061..69daa68c73d 100644
--- a/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/how-to-use-package.json-the-core-of-any-node.js-project-or-npm-package.md
+++ b/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/how-to-use-package.json-the-core-of-any-node.js-project-or-npm-package.md
@@ -12,11 +12,11 @@ Working on these challenges will involve you writing your code using one of the
 
 - Clone <a href="https://github.com/freeCodeCamp/boilerplate-npm/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete these challenges locally.
 - Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-npm" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete these challenges.
-- Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+- Verwende einen Site-Builder deiner Wahl, um das Projekt fertigzustellen. Achte darauf, alle Dateien aus unserem GitHub Repo zu integrieren.
 
-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. 
+Wenn du fertig bist, stelle sicher, dass dein Projekt öffentlich zugänglich gehostet ist. Gib dann die URL in das `Solution Link`-Feld ein.
 
-The `package.json` file is the center of any Node.js project or npm package. It stores information about your project, similar to how the &lt;head> section of an HTML document describes the content of a webpage. It consists of a single JSON object where information is stored in key-value pairs. There are only two required fields; "name" and "version", but it’s good practice to provide additional information about your project that could be useful to future users or maintainers.
+The `package.json` file is the center of any Node.js project or npm package. Es speichert Informationen über dein Projekt, ähnlich wie der Abschnitt &lt;head> eines HTML-Dokuments den Inhalt einer Webseite beschreibt. Es besteht aus einem einzigen JSON-Objekt, in dem Informationen in Schlüssel-Wert-Paaren gespeichert sind. There are only two required fields; "name" and "version", but it’s good practice to provide additional information about your project that could be useful to future users or maintainers.
 
 If you look at the file tree of your project, you will find the package.json file on the top level of the tree. This is the file that you will be improving in the next couple of challenges.
 
diff --git a/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/remove-a-package-from-your-dependencies.md b/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/remove-a-package-from-your-dependencies.md
index 2d05d271d17..b53b171ad72 100644
--- a/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/remove-a-package-from-your-dependencies.md
+++ b/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/remove-a-package-from-your-dependencies.md
@@ -1,6 +1,6 @@
 ---
 id: 587d7fb5367417b2b2512c04
-title: Remove a Package from Your Dependencies
+title: Entferne ein Paket aus deinen Abhängigkeiten
 challengeType: 2
 forumTopicId: 301530
 dashedName: remove-a-package-from-your-dependencies
@@ -10,7 +10,7 @@ dashedName: remove-a-package-from-your-dependencies
 
 You have now tested a few ways you can manage dependencies of your project by using the package.json's dependencies section. You have also included external packages by adding them to the file and even told npm what types of versions you want, by using special characters such as the tilde or the caret.
 
-But what if you want to remove an external package that you no longer need? You might already have guessed it, just remove the corresponding key-value pair for that package from your dependencies.
+Aber was passiert, wenn du ein externes Paket entfernen möchtest, das du nicht länger benötigst? You might already have guessed it, just remove the corresponding key-value pair for that package from your dependencies.
 
 This same method applies to removing other fields in your package.json as well.
 
diff --git a/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/use-the-caret-character-to-use-the-latest-minor-version-of-a-dependency.md b/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/use-the-caret-character-to-use-the-latest-minor-version-of-a-dependency.md
index 84b47b8d7b7..22a33e3254a 100644
--- a/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/use-the-caret-character-to-use-the-latest-minor-version-of-a-dependency.md
+++ b/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/use-the-caret-character-to-use-the-latest-minor-version-of-a-dependency.md
@@ -8,7 +8,7 @@ dashedName: use-the-caret-character-to-use-the-latest-minor-version-of-a-depende
 
 # --description--
 
-Similar to how the tilde we learned about in the last challenge allows npm to install the latest PATCH for a dependency, the caret (`^`) allows npm to install future updates as well. The difference is that the caret will allow both MINOR updates and PATCHes.
+Similar to how the tilde we learned about in the last challenge allows npm to install the latest PATCH for a dependency, the caret (`^`) allows npm to install future updates as well. Der Unterschied ist, dass das Caret sowohl MINOR-Updates als auch PATCHes zulässt.
 
 Your current version of `@freecodecamp/example` should be "~1.2.13" which allows npm to install to the latest 1.2.x version. If you were to use the caret (^) as a version prefix instead, npm would be allowed to update to any 1.x.x version.
 
@@ -16,13 +16,13 @@ Your current version of `@freecodecamp/example` should be "~1.2.13" which allows
 "package": "^1.3.8"
 ```
 
-This would allow updates to any 1.x.x version of the package.
+Dies würde Aktualisierungen auf jede Version 1.x.x des Pakets ermöglichen.
 
 # --instructions--
 
 Use the caret (`^`) to prefix the version of `@freecodecamp/example` in your dependencies and allow npm to update it to any new MINOR release.
 
-**Note:** The version numbers themselves should not be changed.
+**Hinweis:** Die Versionsnummern selbst sollten nicht geändert werden.
 
 # --hints--
 
diff --git a/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-dependency.md b/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-dependency.md
index 0ef31ff5846..be005b616cb 100644
--- a/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-dependency.md
+++ b/curriculum/challenges/german/05-back-end-development-and-apis/managing-packages-with-npm/use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-dependency.md
@@ -8,7 +8,7 @@ dashedName: use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-
 
 # --description--
 
-In the last challenge, you told npm to only include a specific version of a package. That’s a useful way to freeze your dependencies if you need to make sure that different parts of your project stay compatible with each other. But in most use cases, you don’t want to miss bug fixes since they often include important security patches and (hopefully) don’t break things in doing so.
+In the last challenge, you told npm to only include a specific version of a package. Das ist eine nützliche Methode, um Abhängigkeiten einzufrieren, wenn du sicherstellen möchtest, dass verschiedene Teile deines Projekts miteinander kompatibel bleiben. But in most use cases, you don’t want to miss bug fixes since they often include important security patches and (hopefully) don’t break things in doing so.
 
 To allow an npm dependency to update to the latest PATCH version, you can prefix the dependency’s version with the tilde (`~`) character. Here's an example of how to allow updates to any 1.3.x version.
 
diff --git a/curriculum/challenges/german/05-back-end-development-and-apis/mongodb-and-mongoose/create-and-save-a-record-of-a-model.md b/curriculum/challenges/german/05-back-end-development-and-apis/mongodb-and-mongoose/create-and-save-a-record-of-a-model.md
index ae385b6b21d..909330b47ee 100644
--- a/curriculum/challenges/german/05-back-end-development-and-apis/mongodb-and-mongoose/create-and-save-a-record-of-a-model.md
+++ b/curriculum/challenges/german/05-back-end-development-and-apis/mongodb-and-mongoose/create-and-save-a-record-of-a-model.md
@@ -1,6 +1,6 @@
 ---
 id: 587d7fb6367417b2b2512c09
-title: Create and Save a Record of a Model
+title: Erstellen und Speichern eines Datensatzes für ein Modell
 challengeType: 2
 forumTopicId: 301536
 dashedName: create-and-save-a-record-of-a-model
@@ -8,7 +8,7 @@ dashedName: create-and-save-a-record-of-a-model
 
 # --description--
 
-In this challenge you will have to create and save a record of a model.
+In dieser Aufgabe musst du einen Datensatz für ein Modell erstellen und speichern.
 
 # --instructions--
 
diff --git a/curriculum/challenges/german/05-back-end-development-and-apis/mongodb-and-mongoose/create-many-records-with-model.create.md b/curriculum/challenges/german/05-back-end-development-and-apis/mongodb-and-mongoose/create-many-records-with-model.create.md
index 08812efbd1b..20513e7cab3 100644
--- a/curriculum/challenges/german/05-back-end-development-and-apis/mongodb-and-mongoose/create-many-records-with-model.create.md
+++ b/curriculum/challenges/german/05-back-end-development-and-apis/mongodb-and-mongoose/create-many-records-with-model.create.md
@@ -8,13 +8,13 @@ dashedName: create-many-records-with-model-create
 
 # --description--
 
-Sometimes you need to create many instances of your models, e.g. when seeding a database with initial data. `Model.create()` takes an array of objects like `[{name: 'John', ...}, {...}, ...]` as the first argument, and saves them all in the db.
+Manchmal ist es notwendig, viele Instanzen deiner Modelle zu erstellen, z.B. wenn du eine Datenbank mit Anfangsdaten versorgst. `Model.create()` takes an array of objects like `[{name: 'John', ...}, {...}, ...]` as the first argument, and saves them all in the db.
 
 # --instructions--
 
 Modify the `createManyPeople` function to create many people using `Model.create()` with the argument `arrayOfPeople`.
 
-**Note:** You can reuse the model you instantiated in the previous exercise.
+**Hinweis:** Du kannst das Modell, das du in der vorherigen Übung instanziiert hast, wiederverwenden.
 
 # --hints--
 
diff --git a/curriculum/challenges/german/05-back-end-development-and-apis/mongodb-and-mongoose/install-and-set-up-mongoose.md b/curriculum/challenges/german/05-back-end-development-and-apis/mongodb-and-mongoose/install-and-set-up-mongoose.md
index 826b4b3ab6c..a93e12e98ea 100644
--- a/curriculum/challenges/german/05-back-end-development-and-apis/mongodb-and-mongoose/install-and-set-up-mongoose.md
+++ b/curriculum/challenges/german/05-back-end-development-and-apis/mongodb-and-mongoose/install-and-set-up-mongoose.md
@@ -1,6 +1,6 @@
 ---
 id: 587d7fb6367417b2b2512c06
-title: Install and Set Up Mongoose
+title: Installieren und Einrichten von Mongoose
 challengeType: 2
 forumTopicId: 301540
 dashedName: install-and-set-up-mongoose
@@ -12,11 +12,11 @@ Working on these challenges will involve you writing your code using one of the
 
 - Clone <a href="https://github.com/freeCodeCamp/boilerplate-mongomongoose/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete these challenges locally.
 - Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-mongomongoose" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete these challenges.
-- Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+- Verwende einen Site-Builder deiner Wahl, um das Projekt fertigzustellen. Be sure to incorporate all the files from our GitHub repo.
 
-When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field.
+Wenn du fertig bist, stelle sicher, dass dein Projekt öffentlich zugänglich gehostet ist. Gib dann die URL in das `Solution Link`-Feld ein.
 
-In this challenge, you will set up a MongoDB Atlas database and import the required packages to connect to it.
+In dieser Aufgabe wirst du eine MongoDB-Atlas-Datenbank einrichten und die erforderlichen Pakete importieren, um sich mit ihr zu verbinden.
 
 Follow <a href='https://www.freecodecamp.org/news/get-started-with-mongodb-atlas/' target="_blank" rel="noopener noreferrer nofollow">this tutorial</a> to set up a hosted database on MongoDB Atlas.
 
diff --git a/curriculum/challenges/german/05-back-end-development-and-apis/mongodb-and-mongoose/use-model.find-to-search-your-database.md b/curriculum/challenges/german/05-back-end-development-and-apis/mongodb-and-mongoose/use-model.find-to-search-your-database.md
index a3e22a5b1eb..22256153502 100644
--- a/curriculum/challenges/german/05-back-end-development-and-apis/mongodb-and-mongoose/use-model.find-to-search-your-database.md
+++ b/curriculum/challenges/german/05-back-end-development-and-apis/mongodb-and-mongoose/use-model.find-to-search-your-database.md
@@ -14,7 +14,7 @@ In its simplest usage, `Model.find()` accepts a query document (a JSON object) a
 
 Modify the `findPeopleByName` function to find all the people having a given name, using <code>Model.find() -\> [Person]</code>
 
-Use the function argument `personName` as the search key.
+Verwende das Funktionsargument `personName` als Suchbegriff.
 
 # --hints--
 
diff --git a/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md b/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md
index 875496d7166..62b0aa99510 100644
--- a/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md
+++ b/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md
@@ -39,7 +39,7 @@ Previously, when we configured the `session` middleware, we didn't explicitly se
 
 Be sure to add the `key` with the cookie name to the `session` middleware that matches the Socket.IO key. Also, add the `store` reference to the options, near where we set `saveUninitialized: true`. This is necessary to tell Socket.IO which session to relate to.
 
-<hr>
+<hr />
 
 Now, define the `success`, and `fail` callback functions:
 
diff --git a/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/create-new-middleware.md b/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/create-new-middleware.md
index b750b36c42f..ff7cbb24de3 100644
--- a/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/create-new-middleware.md
+++ b/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/create-new-middleware.md
@@ -1,6 +1,6 @@
 ---
 id: 5895f70df9fc0f352b528e6a
-title: Create New Middleware
+title: Neue Middleware erstellen
 challengeType: 2
 forumTopicId: 301551
 dashedName: create-new-middleware
@@ -8,9 +8,9 @@ dashedName: create-new-middleware
 
 # --description--
 
-As is, any user can just go to `/profile` whether they have authenticated or not, by typing in the url. We want to prevent this, by checking if the user is authenticated first before rendering the profile page. This is the perfect example of when to create a middleware.
+As is, any user can just go to `/profile` whether they have authenticated or not, by typing in the url. We want to prevent this, by checking if the user is authenticated first before rendering the profile page. Dies ist das perfekte Beispiel für die Erstellung einer Middleware.
 
-The challenge here is creating the middleware function `ensureAuthenticated(req, res, next)`, which will check if a user is authenticated by calling passport's `isAuthenticated` method on the `request` which, in turn, checks if `req.user` is defined. If it is, then `next()` should be called, otherwise, we can just respond to the request with a redirect to our homepage to login. An implementation of this middleware is:
+The challenge here is creating the middleware function `ensureAuthenticated(req, res, next)`, which will check if a user is authenticated by calling passport's `isAuthenticated` method on the `request` which, in turn, checks if `req.user` is defined. If it is, then `next()` should be called, otherwise, we can just respond to the request with a redirect to our homepage to login. Eine Implementierung dieser Middleware ist:
 
 ```js
 function ensureAuthenticated(req, res, next) {
@@ -58,7 +58,7 @@ Middleware ensureAuthenticated should be implemented and on our /profile route.
   );
 ```
 
-A Get request to /profile should correctly redirect to / since we are not authenticated.
+Eine Get-Anfrage an /profile sollte korrekt an / weitergeleitet werden, da wir nicht authentifiziert sind.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md b/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md
index 2b64f9d1b5d..e53b1bdc689 100644
--- a/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md
+++ b/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md
@@ -8,9 +8,9 @@ dashedName: registration-of-new-users
 
 # --description--
 
-Now we need to allow a new user on our site to register an account. On the `res.render` for the home page add a new variable to the object passed along--`showRegistration: true`. When you refresh your page, you should then see the registration form that was already created in your `index.pug` file! This form is set up to **POST** on `/register`, so this is where we should set up to accept the **POST** and create the user object in the database.
+Now we need to allow a new user on our site to register an account. On the `res.render` for the home page add a new variable to the object passed along--`showRegistration: true`. Wenn du deine Seite aktualisierst, solltest du das Registrierungsformular sehen, das bereits in deiner `index.pug` Datei erstellt wurde! This form is set up to **POST** on `/register`, so this is where we should set up to accept the **POST** and create the user object in the database.
 
-The logic of the registration route should be as follows: Register the new user > Authenticate the new user > Redirect to /profile
+Die Logik des Registrierungswegs sollte folgendermaßen aussehen: Registrierung des neuen Benutzers > Authentifizierung des neuen Benutzers > Weiterleitung zu /profile
 
 The logic of step 1, registering the new user, should be as follows: Query database with a findOne command > if user is returned then it exists and redirect back to home *OR* if user is undefined and no error occurs then 'insertOne' into the database with the username and password, and, as long as no errors occur, call *next* to go to step 2, authenticating the new user, which we've already written the logic for in our POST */login* route.
 
@@ -76,7 +76,7 @@ You should register route and display on home.
   );
 ```
 
-Registering should work.
+Die Registrierung sollte funktionieren.
 
 ```js
 async (getUserInput) => {
@@ -104,7 +104,7 @@ async (getUserInput) => {
 };
 ```
 
-Login should work.
+Login sollte funktionieren.
 
 ```js
 async (getUserInput) => {
@@ -153,7 +153,7 @@ async (getUserInput) => {
 };
 ```
 
-Logout should work.
+Logout sollte funktionieren.
 
 ```js
 (getUserInput) =>
@@ -171,7 +171,7 @@ Logout should work.
   );
 ```
 
-Profile should no longer work after logout.
+Das Profil sollte nach dem Abmelden nicht mehr funktionieren.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md b/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md
index ab19e7387f2..c04c9747c10 100644
--- a/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md
+++ b/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md
@@ -16,7 +16,7 @@ $('form').submit(function() {
 });
 ```
 
-Within the form submit code, you should emit an event after you define `messageToSend` but before you clear the text box `#m`. The event should be named `'chat message'` and the data should just be `messageToSend`.
+Within the form submit code, you should emit an event after you define `messageToSend` but before you clear the text box `#m`. Das Ereignis sollte `'chat message'` heißen und die Daten sollten einfach `messageToSend` sein.
 
 ```js
 socket.emit('chat message', messageToSend);
@@ -50,7 +50,7 @@ Server should listen for `'chat message'` and then emit it properly.
   );
 ```
 
-Client should properly handle and display the new data from event `'chat message'`.
+Der Client sollte die neuen Daten aus dem Ereignis `'chat message'` richtig verarbeiten und anzeigen.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md b/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md
index eb99213c0b8..70db536d0c5 100644
--- a/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md
+++ b/curriculum/challenges/german/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: Serialisierung eines Benutzerobjekts
 challengeType: 2
 forumTopicId: 301563
 dashedName: serialization-of-a-user-object
@@ -10,9 +10,9 @@ dashedName: serialization-of-a-user-object
 
 Serialization and deserialization are important concepts in regards to authentication. To serialize an object means to convert its contents into a small *key* that can then be deserialized into the original object. This is what allows us to know who has communicated with the server without having to send the authentication data, like the username and password, at each request for a new page.
 
-To set this up properly, we need to have a serialize function and a deserialize function. In Passport, we create these with `passport.serializeUser( OURFUNCTION )` and `passport.deserializeUser( OURFUNCTION )`
+Um dies richtig einzurichten, benötigen wir eine Serialisierungsfunktion und eine Deserialisierungsfunktion. In Passport, we create these with `passport.serializeUser( OURFUNCTION )` and `passport.deserializeUser( OURFUNCTION )`
 
-The `serializeUser` is called with 2 arguments, the full user object and a callback used by passport. A unique key to identify that user should be returned in the callback, the easiest one to use being the user's `_id` in the object. It should be unique as it is generated by MongoDB. Similarly, `deserializeUser` is called with that key and a callback function for passport as well, but, this time, we have to take that key and return the full user object to the callback. To make a query search for a Mongo `_id`, you will have to create `const ObjectID = require('mongodb').ObjectID;`, and then to use it you call `new ObjectID(THE_ID)`. `mongodb@~3.6.0` has already been added as a dependency. You can see this in the examples below:
+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)`. `mongodb@~3.6.0` has already been added as a dependency. Du kannst dies an den folgenden Beispielen sehen:
 
 ```js
 passport.serializeUser((user, done) => {
@@ -32,7 +32,7 @@ Submit your page when you think you've got it right. If you're running into erro
 
 # --hints--
 
-You should serialize user function correctly.
+Du solltest die Benutzerfunktion korrekt serialisieren.
 
 ```js
 (getUserInput) =>
@@ -55,7 +55,7 @@ You should serialize user function correctly.
   );
 ```
 
-You should deserialize user function correctly.
+Du solltest die Benutzerfunktion korrekt deserialisieren.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md b/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md
index 08d21a01237..b7ed2dbf152 100644
--- a/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md
+++ b/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md
@@ -14,7 +14,7 @@ Working on these challenges will involve you writing your code using one of the
 - Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-advancednode" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete these challenges.
 - Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
 
-When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field.
+Wenn du fertig bist, stelle sicher, dass dein Projekt öffentlich zugänglich gehostet ist. Gib dann die URL in das `Solution Link`-Feld ein.
 
 A template engine enables you to use static template files (such as those written in *Pug*) in your app. At runtime, the template engine replaces variables in a template file with actual values which can be supplied by your server. Then it transforms the template into a static HTML file that is sent to the client. This approach makes it easier to design an HTML page and allows for displaying variables on the page without needing to make an API call from the client.
 
diff --git a/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/set-up-passport.md b/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/set-up-passport.md
index 52d64d22cdc..d534744f60b 100644
--- a/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/set-up-passport.md
+++ b/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/set-up-passport.md
@@ -1,6 +1,6 @@
 ---
 id: 5895f70cf9fc0f352b528e65
-title: Set up Passport
+title: Passport einrichten
 challengeType: 2
 forumTopicId: 301565
 dashedName: set-up-passport
@@ -8,7 +8,7 @@ dashedName: set-up-passport
 
 # --description--
 
-It's time to set up *Passport* so we can finally start allowing a user to register or login to an account! In addition to Passport, we will use Express-session to handle sessions. Express-session has a ton of advanced features you can use, but for now we're just going to use the basics! Using this middleware saves the session id as a cookie in the client and allows us to access the session data using that id on the server. This way we keep personal account information out of the cookie used by the client to verify to our server they are authenticated and just keep the *key* to access the data stored on the server.
+It's time to set up *Passport* so we can finally start allowing a user to register or login to an account! Zusätzlich zu Passport werden wir Express-session verwenden, um Sitzungen zu verwalten. Express-session has a ton of advanced features you can use, but for now we're just going to use the basics! Using this middleware saves the session id as a cookie in the client and allows us to access the session data using that id on the server. This way we keep personal account information out of the cookie used by the client to verify to our server they are authenticated and just keep the *key* to access the data stored on the server.
 
 `passport@~0.4.1` and `express-session@~1.17.1` are already installed, and are both listed as dependencies in your `package.json` file.
 
diff --git a/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md b/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md
index f956f5ea5ec..d7481da8931 100644
--- a/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md
+++ b/curriculum/challenges/german/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md
@@ -13,9 +13,9 @@ One of the greatest features of using a template engine is being able to pass va
 In your Pug file, you're able to use a variable by referencing the variable name as `#{variable_name}` inline with other text on an element or by using an equal sign on the element without a space such as `p=variable_name` which assigns the variable's value to the p element's text.
 
  Pug is all about using whitespace and tabs to show nested elements and cutting down on the amount of code needed to make a beautiful site. Read the Pug documentation for more information on usage and syntax.
- 
- Here is an example: 
- 
+
+ Here is an example:
+
  ```html
  <!--Typing this using Pug-->
  head
@@ -26,7 +26,7 @@ In your Pug file, you're able to use a variable by referencing the variable name
         p You are amazing
       else
         p Get on it!
-    
+
 <!--will lead to creating this code-->
   <head>
     <script type="text/javascript">
diff --git a/curriculum/challenges/german/06-quality-assurance/quality-assurance-and-testing-with-chai/learn-how-javascript-assertions-work.md b/curriculum/challenges/german/06-quality-assurance/quality-assurance-and-testing-with-chai/learn-how-javascript-assertions-work.md
index cd9a19586d2..9570ead0902 100644
--- a/curriculum/challenges/german/06-quality-assurance/quality-assurance-and-testing-with-chai/learn-how-javascript-assertions-work.md
+++ b/curriculum/challenges/german/06-quality-assurance/quality-assurance-and-testing-with-chai/learn-how-javascript-assertions-work.md
@@ -8,21 +8,21 @@ dashedName: learn-how-javascript-assertions-work
 
 # --description--
 
-Working on these challenges will involve you writing your code using one of the following methods:
+Bei der Bearbeitung dieser Aufgaben musst du deinen Code mit einer der folgenden Methoden schreiben:
 
-- Clone <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete these challenges locally.
-- Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete these challenges.
-- Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+- Klone <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">dieses GitHub-Repo</a> und schließe dein Projekt lokal ab.
+- Verwende <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">unser Replit Starterprojekt</a> um diese Aufgaben fertigzustellen.
+- Verwende einen Site-Builder deiner Wahl, um das Projekt fertigzustellen. Achte darauf, alle Dateien aus unserem GitHub Repo zu integrieren.
 
-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.
+Wenn du fertig bist, stelle sicher, dass dein Projekt öffentlich zugänglich gehostet ist. Gib dann die URL in das `Solution Link`-Feld ein.
 
 # --instructions--
 
-Within `tests/1_unit-tests.js` under the test labelled `#1` in the `Basic Assertions` suite, change each `assert` to either `assert.isNull` or `assert.isNotNull` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+Within `tests/1_unit-tests.js` under the test labelled `#1` in the `Basic Assertions` suite, change each `assert` to either `assert.isNull` or `assert.isNotNull` to make the test pass (should evaluate to `true`). Die an die Asserts übergebenen Argumente dürfen nicht verändert werden.
 
 # --hints--
 
-All tests should pass.
+Alle Tests sollten bestanden werden.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/german/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iv---put-method.md b/curriculum/challenges/german/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iv---put-method.md
index 5b62f40dfa4..a8be85067d4 100644
--- a/curriculum/challenges/german/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iv---put-method.md
+++ b/curriculum/challenges/german/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iv---put-method.md
@@ -10,15 +10,15 @@ dashedName: run-functional-tests-on-an-api-response-using-chai-http-iv---put-met
 
 As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
-This exercise is similar to the previous one.
+Diese Übung ist ähnlich zu der vorherigen.
 
-Now that you know how to test a `PUT` request, it's your turn to do it from scratch.
+Jetzt, da du weißt, wie man eine `PUT`-Anfrage testet, bist du an der Reihe, es von Grund auf selbst zu machen.
 
 # --instructions--
 
-Within `tests/2_functional-tests.js`, alter the `'Send {surname: "da Verrazzano"}'` test (`// #4`) and use the `put` and `send` methods to test the  `'/travellers'` endpoint.
+Innerhalb `tests/2_functional-tests.js`, ändere den `'Send {surname: "da Verrazzano"}'` Test (`// #4`) und verwende die `put` und `send` Methoden, um den `'/travellers'` Endpunkt zu testen.
 
-Send the following JSON object with your PUT request:
+Sende das folgende JSON-Objekt mit deiner PUT-Anfrage:
 
 ```json
 {
@@ -26,18 +26,18 @@ Send the following JSON object with your PUT request:
 }
 ```
 
-Check for the following within the `request.end` callback:
+Überprüfe, ob der `request.end` Callback Folgendes enthält:
 
-1.  The `status` should be `200`
-2.  The `type` should be `application/json`
-3.  The `body.name` should be `Giovanni`
-4.  The `body.surname` should be `da Verrazzano`
+1.  Der `status` sollte `200` betragen
+2.  Der `type` sollte `application/json` sein
+3.  Der `body.name` sollte `Giovanni` sein
+4.  Der `body.surname` sollte `da Verrazzano` sein
 
-Follow the assertion order above - we rely on it. Also, be sure to remove `assert.fail()` once complete.
+Folge der obigen Reihenfolge der Behauptung- wir benötigen sie. Stelle außerdem sicher, dass du `assert.fail()` nach der Fertigstellung entfernst.
 
 # --hints--
 
-All tests should pass
+Alle Tests sollten bestanden werden
 
 ```js
 (getUserInput) =>
@@ -51,7 +51,7 @@ All tests should pass
   );
 ```
 
-You should test for `res.status` to be 200
+Du solltest testen ob der `res.status` 200 beträgt
 
 ```js
 (getUserInput) =>
@@ -67,7 +67,7 @@ You should test for `res.status` to be 200
   );
 ```
 
-You should test for `res.type` to be `'application/json'`
+Du solltest testen ob `res.type` Folgendes ist: `'application/json'`
 
 ```js
 (getUserInput) =>
@@ -83,7 +83,7 @@ You should test for `res.type` to be `'application/json'`
   );
 ```
 
-You should test for `res.body.name` to be `'Giovanni'`
+Du solltest testen ob `res.body.name` Folgendes ist: `'Giovanni'`
 
 ```js
 (getUserInput) =>
@@ -99,7 +99,7 @@ You should test for `res.body.name` to be `'Giovanni'`
   );
 ```
 
-You should test for `res.body.surname` to be `'da Verrazzano'`
+Du solltest testen ob `res.body.surname` Folgendes ist: `'da Verrazzano'`
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/german/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http-ii.md b/curriculum/challenges/german/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http-ii.md
index d5ef5fa8260..72c7a775767 100644
--- a/curriculum/challenges/german/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http-ii.md
+++ b/curriculum/challenges/german/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http-ii.md
@@ -1,6 +1,6 @@
 ---
 id: 587d824f367417b2b2512c59
-title: Run Functional Tests on API Endpoints using Chai-HTTP II
+title: Funktionstests an API-Endpunkten mit Chai-HTTP II durchführen
 challengeType: 2
 forumTopicId: 301592
 dashedName: run-functional-tests-on-api-endpoints-using-chai-http-ii
@@ -12,13 +12,13 @@ As a reminder, this project is being built upon the following starter project on
 
 # --instructions--
 
-Within `tests/2_functional-tests.js`, alter the `'Test GET /hello with your name'` test (`// #2`) to assert the `status` and the `text` of the response to make the test pass.
+Innerhalb von `tests/2_functional-tests.js`, ändere `'Test GET /hello with your name'` Test (`// #2`) um den `status` und den `text` der Antwort geltend zu machen, um den Test zu bestehen.
 
-Send your name as a URL query by appending `?name=<your_name>` to the route. The endpoint responds with `'hello <your_name>'`.
+Sende deinen Namen als URL Query, indem du `?name=<your_name>` an den Pfad anhängst. Der Endpunkt antwortet mit `'hello <your_name>'`.
 
 # --hints--
 
-All tests should pass
+Alle Tests sollten bestanden werden
 
 ```js
 (getUserInput) =>
@@ -32,7 +32,7 @@ All tests should pass
   );
 ```
 
-You should test for `res.status` == 200
+Du solltest auf `res.status` == 200 testen
 
 ```js
 (getUserInput) =>
@@ -48,7 +48,7 @@ You should test for `res.status` == 200
   );
 ```
 
-You should test for `res.text` == `'hello <your_name>'`
+Du solltest auf `res.text` == `'hello <your_name>'` testen
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/german/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser.md b/curriculum/challenges/german/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser.md
index 64ace9d1e36..1ee9f6df20e 100644
--- a/curriculum/challenges/german/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser.md
+++ b/curriculum/challenges/german/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser.md
@@ -1,6 +1,6 @@
 ---
 id: 587d8250367417b2b2512c5d
-title: Run Functional Tests Using a Headless Browser
+title: Funktionstests mit einem Headless Browser ausführen
 challengeType: 2
 forumTopicId: 301595
 dashedName: run-functional-tests-using-a-headless-browser
@@ -10,11 +10,11 @@ dashedName: run-functional-tests-using-a-headless-browser
 
 As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
-On the page there's an input form. It sends data to the `PUT /travellers` endpoint as an AJAX request.
+Auf der Seite befindet sich ein Eingabeformular. Es sendet Daten an den `PUT /travellers` Endpunkt als AJAX Anfrage.
 
-When the request successfully completes, the client code appends a `<div>` containing the information in the response to the DOM.
+Wenn die Anfrage erfolgreich abgeschlossen wurde, fügt der Client-Code einen `<div>` an, der die Informationen in der Antwort auf das DOM enthält.
 
-Here's an example of how to use Zombie.js to interact with the form:
+Hier ist ein Beispiel für die Verwendung von Zombie.js zur Interaktion mit dem Formular:
 
 ```js
 test('Submit the surname "Polo" in the HTML form', function (done) {
@@ -36,32 +36,32 @@ Within the `then` callback, the `pressButton` method of the `browser` object is
 
 Then, once a response is received from the AJAX request, a few assertions are made confirming:
 
-1.  The status of the response is `200`
-2.  The text within the `<span id='name'></span>` element matches `'Marco'`
-3.  The text within the `<span id='surname'></span>` element matches `'Polo'`
+1.  Der Status der Antwort ist `200`
+2.  Der Text innerhalb des `<span id='name'></span>` Elements entspricht `'Marco'`
+3.  Der Text innerhalb des `<span id='surname'></span>` Elements entspricht `'Polo'`
 4.  There is `1` `<span id='dates'></span>` element.
 
-Finally, the `done` callback is invoked, which is needed due to the asynchronous test.
+Schließlich wird der `done` Callback aufgerufen, der aufgrund des asynchronen Tests benötigt wird.
 
 # --instructions--
 
 Within `tests/2_functional-tests.js`, in the `'Submit the surname "Colombo" in the HTML form'` test (`// #5`), automate the following:
 
-1.  Fill in the form with the surname `Colombo`
-2.  Press the submit button
+1.  Fülle das Formular mit dem Nachnamen `Colombo` aus
+2.  Klicke auf den "Bestätigen" Button
 
-And within the `pressButton` callback:
+Und innerhalb des `pressButton` Callback:
 
 1.  Assert that status is OK `200`
-2.  Assert that the text inside the element `span#name` is `'Cristoforo'`
-3.  Assert that the text inside the element `span#surname` is `'Colombo'`
-4.  Assert that the element(s) `span#dates` exist and their count is `1`
+2.  Prüfe, ob der Text innerhalb des Elements `span#name` `'Cristoforo'` ist
+3.  Prüfe, ob der Text innerhalb des Elements `span#surname` `'Colombo'` ist
+4.  Überprüfe, ob das/die Element(e) `span#dates` existieren und deren Zahl `1` ist
 
-Do not forget to remove the `assert.fail()` call.
+Vergiss nicht, den `assert.fail()`-Aufruf zu entfernen.
 
 # --hints--
 
-All tests should pass.
+Alle Tests sollten bestanden werden.
 
 ```js
 (getUserInput) =>
@@ -75,7 +75,7 @@ All tests should pass.
   );
 ```
 
-You should assert that the headless browser request succeeded.
+Du solltest überprüfen, ob die Anfrage des Headless Browsers erfolgreich war.
 
 ```js
 (getUserInput) =>
@@ -89,7 +89,7 @@ You should assert that the headless browser request succeeded.
   );
 ```
 
-You should assert that the text inside the element `span#name` is `'Cristoforo'`.
+Prüfe, ob der Text innerhalb des Elements `span#name` `'Cristoforo'` ist.
 
 ```js
 (getUserInput) =>
@@ -105,7 +105,7 @@ You should assert that the text inside the element `span#name` is `'Cristoforo'`
   );
 ```
 
-You should assert that the text inside the element `span#surname` is `'Colombo'`.
+Prüfe, ob der Text innerhalb des Elements `span#surname` `'Colombo'` ist.
 
 ```js
 (getUserInput) =>
@@ -121,7 +121,7 @@ You should assert that the text inside the element `span#surname` is `'Colombo'`
   );
 ```
 
-You should assert that the element `span#dates` exist and its count is 1.
+Du solltest überprüfen, ob das Element `span#dates` existiert und seine Anzahl 1 ist.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/german/06-quality-assurance/quality-assurance-projects/american-british-translator.md b/curriculum/challenges/german/06-quality-assurance/quality-assurance-projects/american-british-translator.md
index 1ded4cbdef6..49a3f27397b 100644
--- a/curriculum/challenges/german/06-quality-assurance/quality-assurance-projects/american-british-translator.md
+++ b/curriculum/challenges/german/06-quality-assurance/quality-assurance-projects/american-british-translator.md
@@ -14,7 +14,7 @@ Build a full stack JavaScript app that is functionally similar to this: <a href=
 -   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-american-british-english-translator" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 -   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
 
-When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+Wenn du fertig bist, stelle sicher, dass dein Projekt öffentlich zugänglich gehostet ist. Gib dann die URL in das `Solution Link`-Feld ein. Füge optional einen Link zum Quellcode deines Projekts in das `GitHub Link`-Feld ein.
 
 # --instructions--
 
diff --git a/curriculum/challenges/german/06-quality-assurance/quality-assurance-projects/issue-tracker.md b/curriculum/challenges/german/06-quality-assurance/quality-assurance-projects/issue-tracker.md
index 8f35ed0b14a..99d135f22d3 100644
--- a/curriculum/challenges/german/06-quality-assurance/quality-assurance-projects/issue-tracker.md
+++ b/curriculum/challenges/german/06-quality-assurance/quality-assurance-projects/issue-tracker.md
@@ -10,18 +10,18 @@ dashedName: issue-tracker
 
 Erstelle eine vollständige JavaScript-Anwendung, die eine ähnliche Funktionalität wie <a href="https://issue-tracker.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://issue-tracker.freecodecamp.rocks/</a> aufweist. Bei der Arbeit an diesem Projekt schreibst du deinen Code mit einer der folgenden Methoden:
 
--   Klone <a href="https://github.com/freeCodeCamp/boilerplate-project-issuetracker/" target="_blank" rel="noopener noreferrer nofollow">dieses GitHub Repo</a> und schließe dein Projekt lokal ab.
--   Benutze <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-issuetracker" target="_blank" rel="noopener noreferrer nofollow"> dieses Replit Starterprojekt</a> um dein Projekt zu vervollständigen.
--   Verwende einen Site-Builder deiner Wahl, um das Projekt fertigzustellen. Achte darauf, alle Dateien aus unserem GitHub Repo zu integrieren.
+-   Klone <a href="https://github.com/freeCodeCamp/boilerplate-project-issuetracker/" target="_blank" rel="noopener noreferrer nofollow">diese GitHub-Repo</a> und schließe dein Projekt lokal ab.
+-   Verwende<a href="https://replit.com/github/freeCodeCamp/boilerplate-project-issuetracker" target="_blank" rel="noopener noreferrer nofollow"> dieses Replit-Starterprojekt</a>, um dein Projekt fertigzustellen.
+-   Verwende einen Site-Builder deiner Wahl, um das Projekt fertigzustellen. Be sure to incorporate all the files from our GitHub repo.
 
 Wenn du fertig bist, stelle sicher, dass dein Projekt öffentlich zugänglich gehostet ist. Gib dann die URL in das `Solution Link`-Feld ein. Füge optional einen Link zum Quellcode deines Projekts in das `GitHub Link`-Feld ein.
 
 # --instructions--
 
 -   Erfülle die notwendigen Pfade in `/routes/api.js`
--   Erstelle alle funktionalen Tests in `tests/2_functional-tests.js`
--   Kopiere die `sample.env` Datei in `.env` und setze Sie die Variablen entsprechend
--   Entkommentiere `NODE_ENV=test` in deiner `.env` Datei, um die Tests durchzuführen
+-   Create all of the functional tests in `tests/2_functional-tests.js`
+-   Copy the `sample.env` file to `.env` and set the variables appropriately
+-   Entkommentiere `NODE_ENV=test` in deiner `.env`-Datei, um die Tests durchzuführen
 -   Verwende den Befehl `npm run test`, um die Tests in deiner Konsole durchzuführen. Drücke Strg+Umschalt+P (Cmd auf Mac) und gib "open shell" ein, um die Replit-Konsole zu öffnen
 
 Schreibe die folgenden Tests in `tests/2_functional-tests.js`:
diff --git a/curriculum/challenges/german/06-quality-assurance/quality-assurance-projects/metric-imperial-converter.md b/curriculum/challenges/german/06-quality-assurance/quality-assurance-projects/metric-imperial-converter.md
index bfb32ba850b..8add8252130 100644
--- a/curriculum/challenges/german/06-quality-assurance/quality-assurance-projects/metric-imperial-converter.md
+++ b/curriculum/challenges/german/06-quality-assurance/quality-assurance-projects/metric-imperial-converter.md
@@ -14,7 +14,7 @@ Build a full stack JavaScript app that is functionally similar to this: <a href=
 - Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-metricimpconverter" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 - Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
 
-When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+Wenn du fertig bist, stelle sicher, dass dein Projekt öffentlich zugänglich gehostet ist. Gib dann die URL in das `Solution Link`-Feld ein. Füge optional einen Link zum Quellcode deines Projekts in das `GitHub Link`-Feld ein.
 
 # --instructions--
 
diff --git a/curriculum/challenges/german/06-quality-assurance/quality-assurance-projects/personal-library.md b/curriculum/challenges/german/06-quality-assurance/quality-assurance-projects/personal-library.md
index 3a1b1573d67..0146c951c84 100644
--- a/curriculum/challenges/german/06-quality-assurance/quality-assurance-projects/personal-library.md
+++ b/curriculum/challenges/german/06-quality-assurance/quality-assurance-projects/personal-library.md
@@ -14,12 +14,11 @@ Build a full stack JavaScript app that is functionally similar to this: <a href=
 -   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-library" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 -   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
 
-When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+Wenn du fertig bist, stelle sicher, dass dein Projekt öffentlich zugänglich gehostet ist. Then submit the URL to it in the `Solution Link` field. Füge optional einen Link zum Quellcode deines Projekts in das `GitHub Link`-Feld ein.
 
 # --instructions--
 
-1.  Add your MongoDB connection string to `.env` without quotes as `DB`
-    Example: `DB=mongodb://admin:pass@1234.mlab.com:1234/fccpersonallib`
+1.  Add your MongoDB connection string to `.env` without quotes as `DB` Example: `DB=mongodb://admin:pass@1234.mlab.com:1234/fccpersonallib`
 2.  In your `.env` file set `NODE_ENV` to `test`, without quotes
 3.  You need to create all routes within `routes/api.js`
 4.  You will create all functional tests in `tests/2_functional-tests.js`
diff --git a/curriculum/challenges/german/06-quality-assurance/quality-assurance-projects/sudoku-solver.md b/curriculum/challenges/german/06-quality-assurance/quality-assurance-projects/sudoku-solver.md
index bf42138e9fd..604a6e39170 100644
--- a/curriculum/challenges/german/06-quality-assurance/quality-assurance-projects/sudoku-solver.md
+++ b/curriculum/challenges/german/06-quality-assurance/quality-assurance-projects/sudoku-solver.md
@@ -14,7 +14,7 @@ Build a full stack JavaScript app that is functionally similar to this: <a href=
 -   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-sudoku-solver" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 -   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
 
-When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+Wenn du fertig bist, stelle sicher, dass dein Projekt öffentlich zugänglich gehostet ist. Gib dann die URL in das `Solution Link`-Feld ein. Füge optional einen Link zum Quellcode deines Projekts in das `GitHub Link`-Feld ein.
 
 # --instructions--
 
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-and-visualizations.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-and-visualizations.md
index 340cd5351d6..47ec12a35ad 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-and-visualizations.md
+++ b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-and-visualizations.md
@@ -17,7 +17,7 @@ dashedName: data-cleaning-and-visualizations
 More resources:
 
 -  <a href="https://github.com/ine-rmotr-curriculum/data-cleaning-rmotr-freecodecamp" target="_blank" rel="noopener noreferrer nofollow">Notebooks on GitHub</a>
--  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">How to open Notebooks from GitHub using Google Colab.</a>
+-  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">Wie man Notebooks über Github mit Google Colab öffnet.</a>
 
 # --question--
 
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-with-dataframes.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-with-dataframes.md
index e1a58cfd19c..c59d40f4ddb 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-with-dataframes.md
+++ b/curriculum/challenges/german/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: Datenbereinigung mit DataFrames
 challengeType: 11
 videoId: sTMN_pdI6S0
 bilibiliIds:
@@ -12,18 +12,18 @@ dashedName: data-cleaning-with-dataframes
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*Anstatt, wie in dem Video gezeigt, notebooks.ai zu verwenden, kannst du auch Google Colab verwenden.*
 
-More resources:
+Weitere Ressourcen:
 
--  <a href="https://github.com/ine-rmotr-curriculum/data-cleaning-rmotr-freecodecamp" target="_blank" rel="noopener noreferrer nofollow">Notebooks on GitHub</a>
+-  <a href="https://github.com/ine-rmotr-curriculum/data-cleaning-rmotr-freecodecamp" target="_blank" rel="noopener noreferrer nofollow">Notebooks auf GitHub</a>
 -  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">How to open Notebooks from GitHub using Google Colab.</a>
 
 # --question--
 
 ## --text--
 
-What will the following code print out?
+Was gibt der folgende Code aus?
 
 ```py
 import pandas as pd
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/how-to-use-jupyter-notebooks-intro.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/how-to-use-jupyter-notebooks-intro.md
index 64166a8d41e..211e59b4802 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/how-to-use-jupyter-notebooks-intro.md
+++ b/curriculum/challenges/german/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: Einführung in die Verwendung von Jupyter Notebooks
 challengeType: 11
 videoId: h8caJq2Bb9w
 bilibiliIds:
@@ -12,18 +12,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.*
+*Anstatt, wie in dem Video gezeigt, notebooks.ai zu verwenden, kannst du auch Google Colab verwenden.*
 
-More resources:
+Weitere Ressourcen:
 
--  <a href="https://github.com/ine-rmotr-curriculum/ds-content-interactive-jupyterlab-tutorial" target="_blank" rel="noopener noreferrer nofollow">Notebooks on GitHub</a>
+-  <a href="https://github.com/ine-rmotr-curriculum/ds-content-interactive-jupyterlab-tutorial" target="_blank" rel="noopener noreferrer nofollow">Notebooks auf GitHub</a>
 -  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">How to open Notebooks from GitHub using Google Colab.</a>
 
 # --question--
 
 ## --text--
 
-What is **not** allowed in a Jupyter Notebook's cell?
+Was ist in einer Jupyter Notebook Zelle **nicht** erlaubt?
 
 ## --answers--
 
@@ -31,11 +31,11 @@ Markdown
 
 ---
 
-Python code
+Python Code
 
 ---
 
-An Excel sheet
+Ein Excel-Arbeitsblatt
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-cells.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-cells.md
index d266151844d..bb6d5aa2909 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-cells.md
+++ b/curriculum/challenges/german/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 Zellen
 challengeType: 11
 videoId: 5PPegAs9aLA
 bilibiliIds:
@@ -12,30 +12,30 @@ dashedName: jupyter-notebooks-cells
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*Anstatt, wie in dem Video gezeigt, notebooks.ai zu verwenden, kannst du auch Google Colab verwenden.*
 
-More resources:
+Weitere Ressourcen:
 
--  <a href="https://github.com/ine-rmotr-curriculum/ds-content-interactive-jupyterlab-tutorial" target="_blank" rel="noopener noreferrer nofollow">Notebooks on GitHub</a>
+-  <a href="https://github.com/ine-rmotr-curriculum/ds-content-interactive-jupyterlab-tutorial" target="_blank" rel="noopener noreferrer nofollow">Notebooks auf GitHub</a>
 -  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">How to open Notebooks from GitHub using Google Colab.</a>
 
 # --question--
 
 ## --text--
 
-What are the three main types of Jupyter Notebook Cell?
+Was sind die drei wichtigsten Typen von Jupyter Notebook Zellen?
 
 ## --answers--
 
-Code, Markdown, and Python
+Code, Markdown und Python
 
 ---
 
-Code, Markdown, and Raw
+Code, Markdown und Raw
 
 ---
 
-Markdown, Python, and Raw
+Markdown, Python und Raw
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-importing-and-exporting-data.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-importing-and-exporting-data.md
index be927727e87..bd340a88692 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-importing-and-exporting-data.md
+++ b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-importing-and-exporting-data.md
@@ -12,38 +12,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.*
+*Anstatt, wie in dem Video gezeigt, notebooks.ai zu verwenden, kannst du auch Google Colab verwenden.*
 
-More resources:
+Weitere Ressourcen:
 
--  <a href="https://github.com/ine-rmotr-curriculum/ds-content-interactive-jupyterlab-tutorial" target="_blank" rel="noopener noreferrer nofollow">Notebooks on GitHub</a>
--  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">How to open Notebooks from GitHub using Google Colab.</a>
+-  <a href="https://github.com/ine-rmotr-curriculum/ds-content-interactive-jupyterlab-tutorial" target="_blank" rel="noopener noreferrer nofollow">Notebooks auf GitHub</a>
+-  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">Wie man Notebooks über Github mit Google Colab öffnet.</a>
 
 # --question--
 
 ## --text--
 
-What kind of data can you import and work with in a Jupyter Notebook?
+Welche Dateiformate kannst du in ein Jupyter Notebook importieren und bearbeiten?
 
 ## --answers--
 
-Excel files.
+Excel-Dateien.
 
 ---
 
-CSV files.
+CSV-Dateien.
 
 ---
 
-XML files.
+XML-Dateien.
 
 ---
 
-Data from an API.
+Daten aus einer API.
 
 ---
 
-All of the above.
+Alle der oben genannten Möglichkeiten.
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/numpy-boolean-arrays.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/numpy-boolean-arrays.md
index 630ad66ca26..cd95d501e3c 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/numpy-boolean-arrays.md
+++ b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/numpy-boolean-arrays.md
@@ -12,18 +12,18 @@ dashedName: numpy-boolean-arrays
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*Anstatt, wie in dem Video gezeigt, notebooks.ai zu verwenden, kannst du auch Google Colab verwenden.*
 
-More resources:
+Weitere Ressourcen:
 
--  <a href="https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy" target="_blank" rel="noopener noreferrer nofollow">Notebooks on GitHub</a>
+-  <a href="https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy" target="_blank" rel="noopener noreferrer nofollow">Notebooks auf GitHub</a>
 -  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">How to open Notebooks from GitHub using Google Colab.</a>
 
 # --question--
 
 ## --text--
 
-What will the following code print out?
+Was gibt der folgende Code aus?
 
 ```py
 a = np.arange(5)
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-a.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-a.md
index d9f980b8ae1..c0787c2ddfd 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-a.md
+++ b/curriculum/challenges/german/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 Einführung A
 challengeType: 11
 videoId: P-JjV6GBCmk
 bilibiliIds:
@@ -12,30 +12,30 @@ dashedName: numpy-introduction-a
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*Anstatt, wie in dem Video gezeigt, notebooks.ai zu verwenden, kannst du auch Google Colab verwenden.*
 
-More resources:
+Weitere Ressourcen:
 
--  <a href="https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy" target="_blank" rel="noopener noreferrer nofollow">Notebooks on GitHub</a>
+-  <a href="https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy" target="_blank" rel="noopener noreferrer nofollow">Notebooks auf GitHub</a>
 -  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">How to open Notebooks from GitHub using Google Colab.</a>
 
 # --question--
 
 ## --text--
 
-Why is Numpy an important, but unpopular Python library?
+Warum ist Numpy eine wichtige, aber unbeliebte Python-Bibliothek?
 
 ## --answers--
 
-Often you won't work directly with Numpy.
+Meistens arbeitet man nicht direkt mit Numpy.
 
 ---
 
-It is extremely slow.
+Es ist extrem langsam.
 
 ---
 
-Working with Numpy is difficult.
+Die Arbeit mit Numpy ist schwierig.
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-b.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-b.md
index f76d5bf6d1c..16a607484c1 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-b.md
+++ b/curriculum/challenges/german/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 Einführung B
 challengeType: 11
 videoId: YIqgrNLAZkA
 bilibiliIds:
@@ -12,11 +12,11 @@ dashedName: numpy-introduction-b
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*Anstatt notebooks.ai zu verwenden, wie es im Video gezeigt wird, kannst du stattdessen Google Colab verwenden.*
 
-More resources:
+Weitere Ressourcen:
 
--  <a href="https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy" target="_blank" rel="noopener noreferrer nofollow">Notebooks on GitHub</a>
+-  <a href="https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy" target="_blank" rel="noopener noreferrer nofollow">Notebooks auf GitHub</a>
 -  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">How to open Notebooks from GitHub using Google Colab.</a>
 
 # --question--
@@ -27,19 +27,19 @@ About how much memory does the integer `5` consume in plain Python?
 
 ## --answers--
 
-32 bits
+32 Bits
 
 ---
 
-20 bytes
+20 Byte
 
 ---
 
-16 bytes
+16 Byte
 
 ---
 
-8 bits
+8 Bits
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/numpy-operations.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/numpy-operations.md
index 166ee7c6d05..326bfa0f5a4 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/numpy-operations.md
+++ b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/numpy-operations.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c155
-title: Numpy Operations
+title: Numpy Operationen
 challengeType: 11
 videoId: eqSVcJbaPdk
 bilibiliIds:
@@ -12,18 +12,18 @@ dashedName: numpy-operations
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*Anstatt, wie in dem Video gezeigt, notebooks.ai zu verwenden, kannst du auch Google Colab verwenden.*
 
-More resources:
+Weitere Ressourcen:
 
--  <a href="https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy" target="_blank" rel="noopener noreferrer nofollow">Notebooks on GitHub</a>
+-  <a href="https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy" target="_blank" rel="noopener noreferrer nofollow">Notebooks auf GitHub</a>
 -  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">How to open Notebooks from GitHub using Google Colab.</a>
 
 # --question--
 
 ## --text--
 
-What is the value of `a` after you run the following code?
+Was ist der Wert von `a` nachdem du den Code ausgeführt hast?
 
 ```py
 a = np.arange(5)
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/pandas-conditional-selection-and-modifying-dataframes.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/pandas-conditional-selection-and-modifying-dataframes.md
index d16b2a8235f..a499499862e 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/pandas-conditional-selection-and-modifying-dataframes.md
+++ b/curriculum/challenges/german/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 bedingte Auswahl und die Änderung von DataFrames
 challengeType: 11
 videoId: BFlH0fN5xRQ
 bilibiliIds:
@@ -12,18 +12,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.*
+*Anstatt, wie in dem Video gezeigt, notebooks.ai zu verwenden, kannst du auch Google Colab verwenden.*
 
-More resources:
+Weitere Ressourcen:
 
--  <a href="https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas" target="_blank" rel="noopener noreferrer nofollow">Notebooks on GitHub</a>
+-  <a href="https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas" target="_blank" rel="noopener noreferrer nofollow">Notebooks auf GitHub</a>
 -  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">How to open Notebooks from GitHub using Google Colab.</a>
 
 # --question--
 
 ## --text--
 
-What will the following code print out?
+Was gibt der folgende Code aus?
 
 ```py
 import pandas as pd
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/pandas-creating-columns.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/pandas-creating-columns.md
index c9bd03fcb63..3c27d72a3e7 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/pandas-creating-columns.md
+++ b/curriculum/challenges/german/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 Spalten erstellen
 challengeType: 11
 videoId: _sSo2XZoB3E
 bilibiliIds:
@@ -12,18 +12,18 @@ dashedName: pandas-creating-columns
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*Anstatt, wie in dem Video gezeigt, notebooks.ai zu verwenden, kannst du auch Google Colab verwenden.*
 
-More resources:
+Weitere Ressourcen:
 
--  <a href="https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas" target="_blank" rel="noopener noreferrer nofollow">Notebooks on GitHub</a>
+-  <a href="https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas" target="_blank" rel="noopener noreferrer nofollow">Notebooks auf GitHub</a>
 -  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">How to open Notebooks from GitHub using Google Colab.</a>
 
 # --question--
 
 ## --text--
 
-What code would add a "Certificates per month" column to the `certificates_earned` DataFrame like the one below?
+Welcher Code würde eine "Certificates per month" Spalte zu dem `certificates_earned` DataFrame, wie unten gezeigt, hinzufügen?
 
 <pre>      Certificates  Time (in months)  Certificates per month
 Tom               8                16                    0.50
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/pandas-dataframes.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/pandas-dataframes.md
index d43e94785ca..daf6f451e48 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/pandas-dataframes.md
+++ b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/pandas-dataframes.md
@@ -12,18 +12,18 @@ dashedName: pandas-dataframes
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*Anstatt, wie in dem Video gezeigt, notebooks.ai zu verwenden, kannst du auch Google Colab verwenden.*
 
-More resources:
+Weitere Ressourcen:
 
--  <a href="https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas" target="_blank" rel="noopener noreferrer nofollow">Notebooks on GitHub</a>
+-  <a href="https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas" target="_blank" rel="noopener noreferrer nofollow">Notebooks auf GitHub</a>
 -  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">How to open Notebooks from GitHub using Google Colab.</a>
 
 # --question--
 
 ## --text--
 
-What will the following code print out?
+Was gibt der folgende Code aus?
 
 ```py
 import pandas as pd
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/pandas-indexing-and-conditional-selection.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/pandas-indexing-and-conditional-selection.md
index ed1e427084f..0fdfb37c690 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/pandas-indexing-and-conditional-selection.md
+++ b/curriculum/challenges/german/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 Indizierung und bedingte Auswahl
 challengeType: 11
 videoId: '-ZOrgV_aA9A'
 bilibiliIds:
@@ -12,18 +12,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.*
+*Anstatt, wie in dem Video gezeigt, notebooks.ai zu verwenden, kannst du auch Google Colab verwenden.*
 
-More resources:
+Weitere Ressourcen:
 
--  <a href="https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas" target="_blank" rel="noopener noreferrer nofollow">Notebooks on GitHub</a>
+-  <a href="https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas" target="_blank" rel="noopener noreferrer nofollow">Notebooks auf GitHub</a>
 -  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">How to open Notebooks from GitHub using Google Colab.</a>
 
 # --question--
 
 ## --text--
 
-What will the following code print out?
+Was gibt der folgende Code aus?
 
 ```py
 import pandas as pd
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/pandas-introduction.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/pandas-introduction.md
index c1df4108803..4090bc3d80c 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/pandas-introduction.md
+++ b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/pandas-introduction.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c158
-title: Pandas Introduction
+title: Pandas Einführung
 challengeType: 11
 videoId: 0xACW-8cZU0
 bilibiliIds:
@@ -12,18 +12,18 @@ dashedName: pandas-introduction
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*Anstatt, wie in dem Video gezeigt, notebooks.ai zu verwenden, kannst du auch Google Colab verwenden.*
 
-More resources:
+Weitere Ressourcen:
 
--  <a href="https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas" target="_blank" rel="noopener noreferrer nofollow">Notebooks on GitHub</a>
+-  <a href="https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas" target="_blank" rel="noopener noreferrer nofollow">Notebooks auf GitHub</a>
 -  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">How to open Notebooks from GitHub using Google Colab.</a>
 
 # --question--
 
 ## --text--
 
-What will the following code print out?
+Was gibt der folgende Code aus?
 
 ```py
 import pandas as pd
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/parsing-html-and-saving-data.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/parsing-html-and-saving-data.md
index f2c5997639c..66261a9d343 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/parsing-html-and-saving-data.md
+++ b/curriculum/challenges/german/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 parsen und Dateispeicherung
 challengeType: 11
 videoId: bJaqnTWQmb0
 bilibiliIds:
@@ -12,18 +12,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.*
+*Anstatt, wie in dem Video gezeigt, notebooks.ai zu verwenden, kannst du auch Google Colab verwenden.*
 
-More resources:
+Weitere Ressourcen:
 
--  <a href="https://github.com/krishnatray/RDP-Reading-Data-with-Python-and-Pandas" target="_blank" rel="noopener noreferrer nofollow">Notebooks on GitHub</a>
+-  <a href="https://github.com/krishnatray/RDP-Reading-Data-with-Python-and-Pandas" target="_blank" rel="noopener noreferrer nofollow">Notebooks auf GitHub</a>
 -  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">How to open Notebooks from GitHub using Google Colab.</a>
 
 # --question--
 
 ## --text--
 
-What Python library has the `.read_html()` method we can use for parsing HTML documents and extracting tables?
+Welche Python-Bibliothek beinhaltet die `.read_html()`-Methode, die wir nutzen können, um HTML-Dokumente zu parsen und Tabellen zu extrahieren?
 
 ## --answers--
 
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/python-functions-and-collections.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/python-functions-and-collections.md
index fdce91d05f7..1d198d2bdd0 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/python-functions-and-collections.md
+++ b/curriculum/challenges/german/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-Funktionen und Sammlungen
 challengeType: 11
 videoId: NzpU17ZVlUw
 bilibiliIds:
@@ -12,30 +12,30 @@ dashedName: python-functions-and-collections
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*Anstatt, wie in dem Video gezeigt, notebooks.ai zu verwenden, kannst du auch Google Colab verwenden.*
 
-More resources:
+Weitere Ressourcen:
 
--  <a href="https://github.com/ine-rmotr-curriculum/ds-content-python-under-10-minutes" target="_blank" rel="noopener noreferrer nofollow">Notebooks on GitHub</a>
+-  <a href="https://github.com/ine-rmotr-curriculum/ds-content-python-under-10-minutes" target="_blank" rel="noopener noreferrer nofollow">Notebooks auf GitHub</a>
 -  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">How to open Notebooks from GitHub using Google Colab.</a>
 
 # --question--
 
 ## --text--
 
-What is the main difference between lists and tuples in Python?
+Was ist der Hauptunterschied zwischen Listen und Tuples in Python?
 
 ## --answers--
 
-Tuples are immutable.
+Tuples sind unveränderlich.
 
 ---
 
-Lists are ordered.
+Listen sind sortiert.
 
 ---
 
-Tuples are unordered.
+Tuples sind unsortiert.
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/python-introduction.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/python-introduction.md
index 8bd079a0a4f..589440b036e 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/python-introduction.md
+++ b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/python-introduction.md
@@ -1,6 +1,6 @@
 ---
 id: 5e9a093a74c4063ca6f7c165
-title: Python Introduction
+title: Python Einführung
 challengeType: 11
 videoId: PrQV9JkLhb4
 bilibiliIds:
@@ -12,34 +12,34 @@ dashedName: python-introduction
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*Anstatt, wie in dem Video gezeigt, notebooks.ai zu verwenden, kannst du auch Google Colab verwenden.*
 
-More resources:
+Weitere Ressourcen:
 
--  <a href="https://github.com/ine-rmotr-curriculum/ds-content-python-under-10-minutes" target="_blank" rel="noopener noreferrer nofollow">Notebooks on GitHub</a>
+-  <a href="https://github.com/ine-rmotr-curriculum/ds-content-python-under-10-minutes" target="_blank" rel="noopener noreferrer nofollow">Notebooks auf GitHub</a>
 -  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">How to open Notebooks from GitHub using Google Colab.</a>
 
 # --question--
 
 ## --text--
 
-How do we define blocks of code in the body of functions in Python?
+Wie definieren wir Code-Blöcke im Körper der Funktionen in Python?
 
 ## --answers--
 
-We use a set of curly braces, one on either side of each new block of our code.
+Wir verwenden ein Set von geschweiften Klammern, eine auf jeder Seite von jedem neuen Block unseres Codes.
 
 ---
 
-We use indentation, usually right-aligned 4 spaces.
+Wir verwenden Einrückungen, in der Regel 4 rechts ausgerichtete Leerzeichen.
 
 ---
 
-We do not denote blocks of code.
+Wir kennzeichnen keine Codeblöcke.
 
 ---
 
-We could use curly braces or indentation to denote blocks of code.
+Wir könnten geschweifte Klammern oder Einrückungen verwenden, um Code-Blöcke zu kennzeichnen.
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/python-iteration-and-modules.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/python-iteration-and-modules.md
index fddbd3b10c9..33432b8e62f 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/python-iteration-and-modules.md
+++ b/curriculum/challenges/german/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 Iteration und Module
 challengeType: 11
 videoId: XzosGWLafrY
 bilibiliIds:
@@ -12,18 +12,18 @@ dashedName: python-iteration-and-modules
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*Anstatt, wie in dem Video gezeigt, notebooks.ai zu verwenden, kannst du auch Google Colab verwenden.*
 
-More resources:
+Weitere Ressourcen:
 
--  <a href="https://github.com/ine-rmotr-curriculum/ds-content-python-under-10-minutes" target="_blank" rel="noopener noreferrer nofollow">Notebooks on GitHub</a>
+-  <a href="https://github.com/ine-rmotr-curriculum/ds-content-python-under-10-minutes" target="_blank" rel="noopener noreferrer nofollow">Notebooks auf GitHub</a>
 -  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">How to open Notebooks from GitHub using Google Colab.</a>
 
 # --question--
 
 ## --text--
 
-How would you iterate over and print the keys and values of a dictionary named `user`?
+Wie würdest du die Schlüssel und Werte eines Wörterbuchs mit dem Namen `user` iterieren und ausgeben?
 
 ## --answers--
 
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-csv-and-txt.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-csv-and-txt.md
index 0291043e715..da2d69b369f 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-csv-and-txt.md
+++ b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-csv-and-txt.md
@@ -12,18 +12,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.*
+*Anstatt, wie in dem Video gezeigt, notebooks.ai zu verwenden, kannst du auch Google Colab verwenden.*
 
-More resources:
+Weitere Ressourcen:
 
--  <a href="https://github.com/krishnatray/RDP-Reading-Data-with-Python-and-Pandas" target="_blank" rel="noopener noreferrer nofollow">Notebooks on GitHub</a>
+-  <a href="https://github.com/krishnatray/RDP-Reading-Data-with-Python-and-Pandas" target="_blank" rel="noopener noreferrer nofollow">Notebooks auf GitHub</a>
 -  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">How to open Notebooks from GitHub using Google Colab.</a>
 
 # --question--
 
 ## --text--
 
-How would you import the CSV file `data.csv` and store it in a DataFrame using the Pandas module?
+Wie würdest du die CSV-Datei `data.csv` importieren und mit dem Pandas-Modul in einem DataFrame speichern?
 
 ## --answers--
 
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-from-databases.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-from-databases.md
index 21186179430..d831a167948 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-from-databases.md
+++ b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-from-databases.md
@@ -12,30 +12,30 @@ dashedName: reading-data-from-databases
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*Anstatt, wie in dem Video gezeigt, notebooks.ai zu verwenden, kannst du auch Google Colab verwenden.*
 
-More resources:
+Weitere Ressourcen:
 
--  <a href="https://github.com/krishnatray/RDP-Reading-Data-with-Python-and-Pandas" target="_blank" rel="noopener noreferrer nofollow">Notebooks on GitHub</a>
+-  <a href="https://github.com/krishnatray/RDP-Reading-Data-with-Python-and-Pandas" target="_blank" rel="noopener noreferrer nofollow">Notebooks auf GitHub</a>
 -  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">How to open Notebooks from GitHub using Google Colab.</a>
 
 # --question--
 
 ## --text--
 
-What method does a `Cursor` instance have and what does it allow?
+Welche Methode hat eine `Cursor` Instanz und was erlaubt diese?
 
 ## --answers--
 
-The `Cursor` instance has a `.run()` method which allows you to run SQL queries.
+Die `Cursor`-Instanz hat eine `.run()`-Methode, mit der man SQL-Queries ausführen kann.
 
 ---
 
-The `Cursor` instance has a `.select()` method which allows you to select records.
+Die `Cursor`-Instanz hat eine `.select()`-Methode, mit der man Datensätze auswählen kann.
 
 ---
 
-The `Cursor` instance has an `.execute()` method which will receive SQL parameters to run against the database.
+Die `Cursor`-Instanz hat eine `.execute()`-Methode, die SQL-Parameter erhält, welche in der Datenbank geprüft werden.
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-introduction.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-introduction.md
index 2822287ab61..17be7b27df8 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-introduction.md
+++ b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-introduction.md
@@ -12,18 +12,18 @@ dashedName: reading-data-introduction
 
 # --description--
 
-*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+*Anstatt, wie in dem Video gezeigt, notebooks.ai zu verwenden, kannst du auch Google Colab verwenden.*
 
-More resources:
+Weitere Ressourcen:
 
--  <a href="https://github.com/krishnatray/RDP-Reading-Data-with-Python-and-Pandas" target="_blank" rel="noopener noreferrer nofollow">Notebooks on GitHub</a>
+-  <a href="https://github.com/krishnatray/RDP-Reading-Data-with-Python-and-Pandas" target="_blank" rel="noopener noreferrer nofollow">Notebooks auf GitHub</a>
 -  <a href="https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb" target="_blank" rel="noopener noreferrer nofollow">How to open Notebooks from GitHub using Google Colab.</a>
 
 # --question--
 
 ## --text--
 
-Given a file named `certificates.csv` with these contents:
+Gegeben ist eine Datei namens `certificates.csv` mit folgenden Inhalten:
 
 <pre>
 Name$Certificates$Time (in months)
@@ -33,7 +33,7 @@ Ahmad$5$9
 Beau$6$12
 </pre>
 
-Fill in the blanks for the missing arguments below:
+Trage die fehlenden Argumente in die Lücken ein:
 
 ```py
 import csv
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md
index d0d07e0dc72..72a5273727b 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md
+++ b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md
@@ -8,38 +8,38 @@ dashedName: medical-data-visualizer
 
 # --description--
 
-You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-medical-data-visualizer" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
+Du wirst <a href="https://replit.com/github/freeCodeCamp/boilerplate-medical-data-visualizer" target="_blank" rel="noopener noreferrer nofollow">mit unserem Replit-Startercode an diesem Projekt arbeiten</a>.
 
-We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you everything you need to know to complete this project:
+Wir sind noch dabei, den interaktiven Teil des Python-Kurses zu entwickeln. Hier sind erstmal einige Videos auf dem freeCodeCamp.org YouTube-Kanal, die dir alles beibringen, was du wissen musst, um dieses Projekt abzuschließen:
 
-- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a>(14 hours)
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Videokurs: Python für jedermann</a> (14 Stunden)
 
-- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">How to Analyze Data with Python Pandas</a> (10 hours)
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">Wie man Daten mit Python-Pandas analysiert </a> (10 Stunden)
 
 # --instructions--
 
-In this project, you will visualize and make calculations from medical examination data using matplotlib, seaborn, and pandas. The dataset values were collected during medical examinations.
+In diesem Projekt wirst du mit Hilfe von matplotlib, seaborn und pandas Berechnungen aus medizinischen Untersuchungsdaten visualisieren und durchführen. Die Datensatzwerte wurden bei medizinischen Untersuchungen gesammelt.
 
-## Data description
+## Datenbeschreibung
 
-The rows in the dataset represent patients and the columns represent information like body measurements, results from various blood tests, and lifestyle choices. You will use the dataset to explore the relationship between cardiac disease, body measurements, blood markers, and lifestyle choices.
+Die Zeilen des Datensatzes repräsentieren Patienten und die Spalten stellen Informationen wie Körpermessungen, Ergebnisse verschiedener Bluttests und Lebensweisen dar. Du wirst den Datensatz verwenden, um die Beziehung zwischen Herzkrankheiten, Körpermessungen, Blutmarkern und Lebensweisen zu erforschen.
 
-File name: medical_examination.csv
+Dateiname: medical_examination.csv
 
-| Feature | Variable Type | Variable      | Value Type |
-|:-------:|:------------:|:-------------:|:----------:|
-| Age | Objective Feature | `age` | int (days) |
-| Height | Objective Feature | `height` | int (cm) |
-| Weight | Objective Feature | `weight` | float (kg) |
-| Gender | Objective Feature | `gender` | categorical code |
-| Systolic blood pressure | Examination Feature | `ap_hi` | int |
-| Diastolic blood pressure | Examination Feature | `ap_lo` | int |
-| Cholesterol | Examination Feature | `cholesterol` | 1: normal, 2: above normal, 3: well above normal |
-| Glucose | Examination Feature | `gluc` | 1: normal, 2: above normal, 3: well above normal |
-| Smoking | Subjective Feature | `smoke` | binary |
-| Alcohol intake | Subjective Feature | `alco` | binary |
-| Physical activity | Subjective Feature | `active` | binary |
-| Presence or absence of cardiovascular disease | Target Variable | `cardio` | binary |
+|                 Merkmal                  |    Variablentyp     |   Variable    |                       Wert                       |
+|:----------------------------------------:|:-------------------:|:-------------:|:------------------------------------------------:|
+|                  Alter                   |  Objective Feature  |     `age`     |                    int (Tage)                    |
+|                  Größe                   |  Objective Feature  |   `height`    |                     int (cm)                     |
+|                 Gewicht                  |  Objective Feature  |   `weight`    |                    float (kg)                    |
+|                Geschlecht                |  Objective Feature  |   `gender`    |                  Kategorie-Code                  |
+|          Systolischer Blutdruck          | Examination Feature |    `ap_hi`    |                       int                        |
+|         Diastolischer Blutdruck          | Examination Feature |    `ap_lo`    |                       int                        |
+|               Cholesterin                | Examination Feature | `cholesterol` | 1: normal, 2: above normal, 3: well above normal |
+|                 Glucose                  | Examination Feature |    `gluc`     | 1: normal, 2: above normal, 3: well above normal |
+|                 Rauchen                  | Subjective Feature  |    `smoke`    |                      binary                      |
+|              Alkoholkonsum               | Subjective Feature  |    `alco`     |                      binary                      |
+|          Körperliche Aktivität           | Subjective Feature  |   `active`    |                      binary                      |
+| Leiden unter Herz-Kreislauf-Erkrankungen |   Target Variable   |   `cardio`    |                      binary                      |
 
 ## Tasks
 
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md
index 70478f31ad5..bec991c92d0 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md
+++ b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md
@@ -8,45 +8,45 @@ dashedName: page-view-time-series-visualizer
 
 # --description--
 
-You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-page-view-time-series-visualizer" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
+Du wirst <a href="https://replit.com/github/freeCodeCamp/boilerplate-page-view-time-series-visualizer" target="_blank" rel="noopener noreferrer nofollow">mit unserem Replit-Startercode</a> an diesem Projekt arbeiten.
 
-We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you everything you need to know to complete this project:
+Wir sind noch dabei, den interaktiven Teil des Python-Kurses zu entwickeln. Hier sind erstmal einige Videos auf dem freeCodeCamp.org YouTube-Kanal, die dir alles beibringen, was du wissen musst, um dieses Projekt abzuschließen:
 
-- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a>(14 hours)
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Videokurs: Python für jedermann</a>(14 Stunden)
 
-- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">How to Analyze Data with Python Pandas</a> (10 hours)
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">Wie man Daten mit Python-Pandas analysiert </a> (10 Stunden)
 
 # --instructions--
 
-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.
+Für dieses Projekt visualisierst du die Daten der Zeitserie mit Hilfe eines Liniendiagramms, Balkendiagramms und eines Boxplots. Du wirst Pandas, Matplotlib und Seaborn verwenden, um einen Datensatz zu visualisieren, der die Anzahl der täglichen FreeCodeCamp Seitenaufrufe vom 2016-05-09 bis 2019-12-03 enthält. Die Datenvisualisierungen wird dir helfen, die Muster bei Besuchen zu verstehen sowie das jährliche und monatliche Wachstum zu ermitteln.
 
-Use the data to complete the following tasks:
+Benutze die Daten, um die folgenden Aufgaben abzuschließen:
 
-- Use Pandas to import the data from "fcc-forum-pageviews.csv". Set the index to the `date` column.
-- Clean the data by filtering out days when the page views were in the top 2.5% of the dataset or bottom 2.5% of the dataset.
-- Create a `draw_line_plot` function that uses Matplotlib to draw a line chart similar to "examples/Figure_1.png". The title should be `Daily freeCodeCamp Forum Page Views 5/2016-12/2019`. The label on the x axis should be `Date` and the label on the y axis should be `Page Views`.
-- Create a `draw_bar_plot` function that draws a bar chart similar to "examples/Figure_2.png". It should show average daily page views for each month grouped by year. The legend should show month labels and have a title of `Months`. On the chart, the label on the x axis should be `Years` and the label on the y axis should be `Average Page Views`.
-- Create a `draw_box_plot` function that uses Seaborn to draw two adjacent box plots similar to "examples/Figure_3.png". These box plots should show how the values are distributed within a given year or month and how it compares over time. The title of the first chart should be `Year-wise Box Plot (Trend)` and the title of the second chart should be `Month-wise Box Plot (Seasonality)`. Make sure the month labels on bottom start at `Jan` and the x and y axis are labeled correctly. The boilerplate includes commands to prepare the data.
+- Benutze Pandas, um die Daten von "fcc-forum-pageviews.csv" zu importieren. Setze den Index auf die `date`-Spalte.
+- Bereinige die Daten, indem du Tage filterst, an denen die Seitenaufrufe in den oberen 2.5% oder unteren 2.5% des Datensatzes waren.
+- Erstelle eine `draw_line_plot` Funktion, die Matplotlib verwendet, um ein Liniendiagramm, ähnlich wie "examples/Figure_1.png", zu zeichnen. Der Titel sollte `Daily freeCodeCamp Forum Page Views 5/2016-12/2019` sein. Die Beschriftung der x-Achse sollte `Date` sein und die Beschriftung auf der y-Achse sollte `Page Views` lauten.
+- Erstelle eine `draw_bar_plot`-Funktion, die ein Balkendiagramm, ähnlich wie "examples/Figure_2.png", verwendet. Es sollte die durchschnittlichen täglichen Seitenaufrufe pro Monat nach Jahr anzeigen. Die Legende sollte Monatsbeschriftungen anzeigen und `Months` als Titel haben. Beim Diagramm sollte die Beschriftung der x-Achse `Years` lauten und die Beschriftung der y-Achse sollte `Average Page Views` lauten.
+- Erstelle eine `draw_box_plot`-Funktion, die Seaborn verwendet, um zwei angrenzende Boxplots, ähnlich wie "examples/Figure_3.png", zu zeichnen. Diese Boxplots sollten zeigen, wie die Werte innerhalb eines bestimmten Jahres oder Monats verteilt sind und wie sie im Laufe der Zeit abschneiden. Der Titel des ersten Diagramms sollte `Year-wise Box Plot (Trend)` lauten und der des zweiten Diagramms sollte `Month-wise Box Plot (Seasonality)` lauten. Stelle sicher, dass die Monatsbeschriftungen unten bei `Jan` starten und, dass die x- und y-Achse korrekt gekennzeichnet sind. Der Boilerplate-Code enthält auch Befehle zur Datenvorbereitung.
 
-For each chart, make sure to use a copy of the data frame. Unit tests are written for you under `test_module.py`.
+Bitte verwende für jedes Diagramm eine Kopie des Dataframes. Unit-Tests werden für dich unter `test_module.py` geschrieben.
 
-The boilerplate also includes commands to save and return the image.
+Der Boilerplate-Code enthält auch Befehle zum Speichern und Übermitteln des Bildes.
 
-## Development
+## Entwicklung
 
-For development, you can use `main.py` to test your functions. Click the "run" button and `main.py` will run.
+Für die Entwicklung kannst du `main.py` verwenden, um deinen Code zu testen. Klicke den "Run"-Button und `main.py` wird ausgeführt.
 
-## Testing
+## Testen
 
-We imported the tests from `test_module.py` to `main.py` for your convenience. The tests will run automatically whenever you hit the "run" button.
+Wir haben die Tests von `test_module.py` zu `main.py` bereits für dich importiert. Die Tests werden automatisch ausgeführt, wenn du auf den "Run"-Button klickst.
 
-## Submitting
+## Absenden
 
-Copy your project's URL and submit it to freeCodeCamp.
+Kopiere die URL deines Projekts und übermittle sie an freeCodeCamp.
 
 # --hints--
 
-It should pass all Python tests.
+Es sollte alle Python-Tests bestehen.
 
 ```js
 
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md
index 3931fd8089a..be3e2cd375f 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md
+++ b/curriculum/challenges/german/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md
@@ -45,6 +45,7 @@ We imported the tests from `test_module.py` to `main.py` for your convenience. T
 Copy your project's URL and submit it to freeCodeCamp.
 
 ## Data Source
+
 <a href="https://datahub.io/core/sea-level-rise" target="_blank" rel="noopener noreferrer nofollow">Global Average Absolute Sea Level Change</a>, 1880-2014 from the US Environmental Protection Agency using data from CSIRO, 2015; NOAA, 2015.
 
 
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/numpy/basics-of-numpy.md b/curriculum/challenges/german/08-data-analysis-with-python/numpy/basics-of-numpy.md
index 7a4a17909b1..ed181537994 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/numpy/basics-of-numpy.md
+++ b/curriculum/challenges/german/08-data-analysis-with-python/numpy/basics-of-numpy.md
@@ -14,7 +14,7 @@ dashedName: basics-of-numpy
 
 ## --text--
 
-What will the following code print?
+Welches Ergebnis liefert folgender Code?
 
 ```python
 b = np.array([[1.0,2.0,3.0],[3.0,4.0,5.0]])
diff --git a/curriculum/challenges/german/08-data-analysis-with-python/numpy/initializing-different-arrays.md b/curriculum/challenges/german/08-data-analysis-with-python/numpy/initializing-different-arrays.md
index debbf356d30..301cac029c6 100644
--- a/curriculum/challenges/german/08-data-analysis-with-python/numpy/initializing-different-arrays.md
+++ b/curriculum/challenges/german/08-data-analysis-with-python/numpy/initializing-different-arrays.md
@@ -14,7 +14,7 @@ dashedName: initializing-different-arrays
 
 ## --text--
 
-What will the following code print?
+Welches Ergebnis liefert folgender Code?
 
 ```py
 a = np.array([[1, 2, 3, 4, 5], [6, 7, 8, 9, 10]])
diff --git a/curriculum/challenges/german/09-information-security/information-security-projects/anonymous-message-board.md b/curriculum/challenges/german/09-information-security/information-security-projects/anonymous-message-board.md
index 5045bf4efb0..32d21d89f8c 100644
--- a/curriculum/challenges/german/09-information-security/information-security-projects/anonymous-message-board.md
+++ b/curriculum/challenges/german/09-information-security/information-security-projects/anonymous-message-board.md
@@ -1,6 +1,6 @@
 ---
 id: 587d824a367417b2b2512c45
-title: Anonymous Message Board
+title: Anonymes Nachrichtenbrett
 challengeType: 4
 forumTopicId: 301568
 dashedName: anonymous-message-board
@@ -10,21 +10,21 @@ dashedName: anonymous-message-board
 
 Build a full stack JavaScript app that is functionally similar to this: <a href="https://anonymous-message-board.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://anonymous-message-board.freecodecamp.rocks/</a>.
 
-Working on this project will involve you writing your code using one of the following methods:
+Bei der Arbeit an diesem Projekt musst du deinen Code mit einer der folgenden Methoden schreiben:
 
 -   Clone <a href="https://github.com/freeCodeCamp/boilerplate-project-messageboard/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete your project locally.
 -   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-messageboard" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> 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.
+-   Verwende einen Site-Builder deiner Wahl, um das Projekt fertigzustellen. Be sure to incorporate all the files from our GitHub repo.
 
-When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+Wenn du fertig bist, stelle sicher, dass dein Projekt öffentlich zugänglich gehostet ist. Gib dann die URL in das `Solution Link`-Feld ein. Füge optional einen Link zum Quellcode deines Projekts in das `GitHub Link`-Feld ein.
 
 # --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`
+3.  Füge alle Security-Features zu `server.js` hinzu
 
-Write the following tests in `tests/2_functional-tests.js`:
+Schreibe die folgenden Tests in `tests/2_functional-tests.js`:
 
 -   Creating a new thread: POST request to `/api/threads/{board}`
 -   Viewing the 10 most recent threads with 3 replies each: GET request to `/api/threads/{board}`
@@ -39,7 +39,7 @@ Write the following tests in `tests/2_functional-tests.js`:
 
 # --hints--
 
-You can provide your own project, not the example URL.
+Du kannst dein eigenes Projekt angeben, nicht die Beispiel-URL.
 
 ```js
 (getUserInput) => {
@@ -61,7 +61,7 @@ async (getUserInput) => {
 };
 ```
 
-Do not allow DNS prefetching.
+DNS-Prefetching nicht erlauben.
 
 ```js
 async (getUserInput) => {
@@ -268,7 +268,7 @@ async (getUserInput) => {
   let res = await fetch(`${url}/api/threads/fcc_test`);
   let threads = await res.json();
   const thread_id = threads[0]._id;
-  
+
   const reply_data = { thread_id, text: "fcc_test_reply", delete_password: "delete_me" };
   await fetch(`${url}/api/replies/fcc_test`, {
     method: 'POST',
@@ -315,7 +315,7 @@ async (getUserInput) => {
   const threads = await res.json();
   const report_id = threads[0]._id;
   const data = { report_id };
-  
+
   res = await fetch(`${url}/api/threads/fcc_test`, {
     method: 'PUT',
     headers: { 'Content-Type': 'application/json' },
@@ -347,7 +347,7 @@ async (getUserInput) => {
   const thread_id = threads[0]._id;
   const reply_id = threads[0].replies[0]._id;
   const data = { thread_id, reply_id };
-  
+
   res = await fetch(`${url}/api/replies/fcc_test`, {
     method: 'PUT',
     headers: { 'Content-Type': 'application/json' },
@@ -368,7 +368,7 @@ async (getUserInput) => {
 };
 ```
 
-All 10 functional tests are complete and passing.
+Alle 10 Funktionstests sind abgeschlossen und wurden bestanden.
 
 ```js
 async (getUserInput) => {
diff --git a/curriculum/challenges/german/09-information-security/information-security-projects/port-scanner.md b/curriculum/challenges/german/09-information-security/information-security-projects/port-scanner.md
index 4f5d0456333..f9b8fc8a54a 100644
--- a/curriculum/challenges/german/09-information-security/information-security-projects/port-scanner.md
+++ b/curriculum/challenges/german/09-information-security/information-security-projects/port-scanner.md
@@ -1,6 +1,6 @@
 ---
 id: 5e46f979ac417301a38fb932
-title: Port Scanner
+title: Portscanner
 challengeType: 10
 forumTopicId: 462372
 helpCategory: Python
@@ -9,15 +9,15 @@ dashedName: port-scanner
 
 # --description--
 
-You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-port-scanner" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
+Du wirst <a href="https://replit.com/github/freeCodeCamp/boilerplate-port-scanner" target="_blank" rel="noopener noreferrer nofollow">mit unserem Replit-Startercode</a> an diesem Projekt arbeiten.
 
-We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you everything you need to know to complete this project:
+Wir sind noch dabei, den interaktiven Teil des Python-Kurses zu entwickeln. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you everything you need to know to complete this project:
 
 - <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a> (14 hours)
 
-- <a href="https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/" target="_blank" rel="noopener noreferrer nofollow">Learn Python Basics in Depth</a> (4 hours)
+- <a href="https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/" target="_blank" rel="noopener noreferrer nofollow">Lerne ausführlich die Python-Grundlagen </a> (4 Stunden)
 
-- <a href="https://www.freecodecamp.org/news/intermediate-python-course/" target="_blank" rel="noopener noreferrer nofollow">Intermediate Python Course</a> (6 hours)
+- <a href="https://www.freecodecamp.org/news/intermediate-python-course/" target="_blank" rel="noopener noreferrer nofollow">Python-Kurs für Fortgeschrittene</a> (6 Stunden)
 
 # --instructions--
 
diff --git a/curriculum/challenges/german/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md b/curriculum/challenges/german/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md
index 11050099d93..60a0e9ea56d 100644
--- a/curriculum/challenges/german/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md
+++ b/curriculum/challenges/german/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md
@@ -14,7 +14,7 @@ Develop a 2D real time multiplayer game using the HTML Canvas API and Socket.io
 -   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-secure-real-time-multiplayer-game" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 -   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
 
-When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+Wenn du fertig bist, stelle sicher, dass dein Projekt öffentlich zugänglich gehostet ist. Gib dann die URL in das `Solution Link`-Feld ein. Füge optional einen Link zum Quellcode deines Projekts in das `GitHub Link`-Feld ein.
 
 # --instructions--
 
diff --git a/curriculum/challenges/german/09-information-security/information-security-projects/stock-price-checker.md b/curriculum/challenges/german/09-information-security/information-security-projects/stock-price-checker.md
index dc605701836..86bbc3844d4 100644
--- a/curriculum/challenges/german/09-information-security/information-security-projects/stock-price-checker.md
+++ b/curriculum/challenges/german/09-information-security/information-security-projects/stock-price-checker.md
@@ -18,7 +18,7 @@ Working on this project will involve you writing your code using one of the foll
 -   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-stockchecker" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 -   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
 
-When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+Wenn du fertig bist, stelle sicher, dass dein Projekt öffentlich zugänglich gehostet ist. Gib dann die URL in das `Solution Link`-Feld ein. Füge optional einen Link zum Quellcode deines Projekts in das `GitHub Link`-Feld ein.
 
 # --instructions--
 
diff --git a/curriculum/challenges/german/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md b/curriculum/challenges/german/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md
index 64fc17c3a70..befd29d76e5 100644
--- a/curriculum/challenges/german/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md
+++ b/curriculum/challenges/german/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md
@@ -8,7 +8,7 @@ dashedName: hash-and-compare-passwords-synchronously
 
 # --description--
 
-As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-bcrypt" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-bcrypt/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
+Zur Erinnerung: Dieses Projekt baut auf dem folgenden Starterprojekt auf: <a href="https://replit.com/github/freeCodeCamp/boilerplate-bcrypt" target="_blank" rel="noopener noreferrer nofollow">Replit</a> oder geklont von <a href="https://github.com/freeCodeCamp/boilerplate-bcrypt/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 Hashing synchronously is just as easy to do but can cause lag if using it server side with a high cost or with hashing done very often. Hashing with this method is as easy as calling
 
diff --git a/curriculum/challenges/german/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md b/curriculum/challenges/german/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md
index 14d946d6414..58d402cbc5e 100644
--- a/curriculum/challenges/german/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md
+++ b/curriculum/challenges/german/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md
@@ -8,25 +8,25 @@ dashedName: install-and-require-helmet
 
 # --description--
 
-Working on these challenges will involve you writing your code using one of the following methods:
+Bei der Arbeit an diesen Aufgaben wirst du deinen Code mithilfe folgender Methoden schreiben:
 
-- Clone <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete these challenges locally.
+- Klone <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">dieses GitHub-Repo</a> und beende diese Aufgaben lokal.
 - Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete these challenges.
-- Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+- Benutze einen Website-Builder deiner Wahl, um das Projekt abzuschließen. Be sure to incorporate all the files from our GitHub repo.
 
-When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field.
+Wenn du fertig bist, stelle sicher, dass dein Projekt öffentlich zugänglich gehostet ist. Gib dann die URL in das `Solution Link`-Feld ein.
 
-Helmet helps you secure your Express apps by setting various HTTP headers.
+Helmet hilft, die Express-Anwendungen durch das Setzen verschiedener HTTP-Header zu sichern.
 
 # --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.
+Der gesamte Code für diese Lektionen befindet sich in der Datei `myApp.js` zwischen den Codezeilen, mit denen wir begonnen haben. Verändere oder lösche den Code nicht, den wir zur Verfügung gestellt haben.
 
 Helmet version `3.21.3` has already been installed, so require it as `helmet` in `myApp.js`.
 
 # --hints--
 
-`helmet` version `3.21.3` should be in `package.json`
+`helmet` Version `3.21.3` sollte in `package.json` sein
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/german/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md b/curriculum/challenges/german/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md
index f2f28e0aa83..2ec2f36fb95 100644
--- a/curriculum/challenges/german/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md
+++ b/curriculum/challenges/german/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md
@@ -1,8 +1,7 @@
 ---
 id: 587d8247367417b2b2512c39
 title: >-
-  Mitigate the Risk of Cross Site Scripting (XSS) Attacks with
-  helmet.xssFilter()
+  Mitigate the Risk of Cross Site Scripting (XSS) Attacks with helmet.xssFilter()
 challengeType: 2
 forumTopicId: 301583
 dashedName: mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet-xssfilter
diff --git a/curriculum/challenges/german/09-information-security/python-for-penetration-testing/developing-a-banner-grabber.md b/curriculum/challenges/german/09-information-security/python-for-penetration-testing/developing-a-banner-grabber.md
index 41a2b4606ee..83f607dc534 100644
--- a/curriculum/challenges/german/09-information-security/python-for-penetration-testing/developing-a-banner-grabber.md
+++ b/curriculum/challenges/german/09-information-security/python-for-penetration-testing/developing-a-banner-grabber.md
@@ -1,6 +1,6 @@
 ---
 id: 5ea9997bbec2e9bc47e94db3
-title: Developing a Banner Grabber
+title: Entwicklung eines Banner-Grabbers
 challengeType: 11
 videoId: CeGW761BIsA
 bilibiliIds:
diff --git a/curriculum/challenges/german/10-coding-interview-prep/algorithms/implement-binary-search.md b/curriculum/challenges/german/10-coding-interview-prep/algorithms/implement-binary-search.md
index bd2e8306ee1..75078c61000 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/algorithms/implement-binary-search.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/algorithms/implement-binary-search.md
@@ -43,20 +43,20 @@ const testArray = [
 assert(typeof binarySearch == 'function');
 ```
 
-`binarySearch(testArray, 0)` should return `[13, 5, 2, 0]`.
+`binarySearch(testArray, 0)` sollte `[13, 5, 2, 0]` zurückgeben.
 
 ```js
 assert.deepEqual(binarySearch(_testArray, 0), [13, 5, 2, 0]);
 ```
 
-`binarySearch(testArray, 1)` should return `[13, 5, 2, 0, 1]`.
+`binarySearch(testArray, 1)` sollte `[13, 5, 2, 0, 1]` zurückgeben.
 
 ```js
 assert.deepEqual(binarySearch(_testArray, 1), [13, 5, 2, 0, 1]);
 ```
 
 
-`binarySearch(testArray, 2)` should return `[13, 5, 2]`.
+`binarySearch(testArray, 2)` sollte `[13, 5, 2]` zurückgeben.
 
 ```js
 assert.deepEqual(binarySearch(_testArray, 2), [13, 5, 2]);
@@ -68,19 +68,19 @@ assert.deepEqual(binarySearch(_testArray, 2), [13, 5, 2]);
 assert.strictEqual(binarySearch(_testArray, 6), 'Value Not Found');
 ```
 
-`binarySearch(testArray, 11)` should return `[13, 5, 10, 11]`.
+`binarySearch(testArray, 11)` sollte `[13, 5, 10, 11]` zurückgeben.
 
 ```js
 assert.deepEqual(binarySearch(_testArray, 11), [13, 5, 10, 11])
 ```
 
-`binarySearch(testArray, 13)` should return `[13]`.
+`binarySearch(testArray, 13)` sollte `[13]` zurückgeben.
 
 ```js
 assert.deepEqual(binarySearch(_testArray, 13), [13]);
 ```
 
-`binarySearch(testArray, 70)` should return `[13, 19, 22, 49, 70]`.
+`binarySearch(testArray, 70)` sollte `[13, 19, 22, 49, 70]` zurückgeben.
 
 ```js
 assert.deepEqual(binarySearch(_testArray, 70), [13, 19, 22, 49, 70]);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/algorithms/implement-insertion-sort.md b/curriculum/challenges/german/10-coding-interview-prep/algorithms/implement-insertion-sort.md
index 74d77163d21..bbfcb4e33d7 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/algorithms/implement-insertion-sort.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/algorithms/implement-insertion-sort.md
@@ -1,6 +1,6 @@
 ---
 id: 587d8259367417b2b2512c86
-title: Implement Insertion Sort
+title: Implementiere einen Insertionsort-Algorithmus
 challengeType: 1
 forumTopicId: 301613
 dashedName: implement-insertion-sort
@@ -8,19 +8,19 @@ dashedName: implement-insertion-sort
 
 # --description--
 
-The next sorting method we'll look at is insertion sort. This method works by building up a sorted array at the beginning of the list. It begins the sorted array with the first element. Then it inspects the next element and swaps it backwards into the sorted array until it is in sorted position. It continues iterating through the list and swapping new items backwards into the sorted portion until it reaches the end. This algorithm has quadratic time complexity in the average and worst cases.
+Die nächste Sortiermethode, die wir uns ansehen, ist Insertionsort. Bei dieser Methode wird ein sortiertes Array am Anfang der Liste erstellt. Das Array wird mit dem ersten Element sortiert. Dann wird das nächste Element untersucht und rückwärts in das sortierte Array verschoben, bis es sich in der sortierten Position befindet. Es fährt fort, die Liste zu durchlaufen und neue Elemente rückwärts in den sortierten Teil zu verschieben, bis es das Ende erreicht. Dieser Algorithmus hat im mittleren und schlimmsten Fall eine quadratische Zeitkomplexität.
 
 **Instructions:** Write a function `insertionSort` which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest.
 
 # --hints--
 
-`insertionSort` should be a function.
+`insertionSort` sollte eine Funktion sein.
 
 ```js
 assert(typeof insertionSort == 'function');
 ```
 
-`insertionSort` should return a sorted array (least to greatest).
+`insertionSort` sollte ein sortiertes Array (vom kleinsten zum größten) zurückgeben.
 
 ```js
 assert(
@@ -48,7 +48,7 @@ assert(
 );
 ```
 
-`insertionSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92])` should return an array that is unchanged except for order.
+`insertionSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92])` sollte ein Array zurückgeben, das bis auf die Reihenfolge unverändert ist.
 
 ```js
 assert.sameMembers(
@@ -75,13 +75,13 @@ assert.sameMembers(
 );
 ```
 
-`insertionSort([5, 4, 33, 2, 8])` should return `[2, 4, 5, 8, 33]`.
+`insertionSort([5, 4, 33, 2, 8])` sollte `[2, 4, 5, 8, 33]` zurückgeben.
 
 ```js
 assert.deepEqual(insertionSort([5, 4, 33, 2, 8]), [2, 4, 5, 8, 33])
 ```
 
-`insertionSort` should not use the built-in `.sort()` method.
+`insertionSort` sollte nicht die eingebaute Methode `.sort()` verwenden.
 
 ```js
 assert(isBuiltInSortUsed());
diff --git a/curriculum/challenges/german/10-coding-interview-prep/algorithms/implement-quick-sort.md b/curriculum/challenges/german/10-coding-interview-prep/algorithms/implement-quick-sort.md
index 53ac770885b..acb828ebeb9 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/algorithms/implement-quick-sort.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/algorithms/implement-quick-sort.md
@@ -1,6 +1,6 @@
 ---
 id: 587d825a367417b2b2512c89
-title: Implement Quick Sort
+title: Implementiere einen Quicksort-Algorithmus
 challengeType: 1
 forumTopicId: 301615
 dashedName: implement-quick-sort
@@ -8,21 +8,21 @@ dashedName: implement-quick-sort
 
 # --description--
 
-Here we will move on to an intermediate sorting algorithm: quick sort. Quick sort is an efficient, recursive divide-and-conquer approach to sorting an array. In this method, a pivot value is chosen in the original array. The array is then partitioned into two subarrays of values less than and greater than the pivot value. We then combine the result of recursively calling the quick sort algorithm on both sub-arrays. This continues until the base case of an empty or single-item array is reached, which we return. The unwinding of the recursive calls return us the sorted array.
+Here we will move on to an intermediate sorting algorithm: quick sort. Quicksort ist ein effizientes, rekursives Teile-und-herrsche-Verfahren (Divide-and-conquer algorithm) zum Sortieren eines Arrays. Bei dieser Methode wird ein Pivot-Wert im ursprünglichen Array gewählt. Das Array wird dann in zwei Subarrays mit Werten kleiner und größer als der Pivot-Wert unterteilt. Dann kombinieren wir das Ergebnis des rekursiven Abrufs des Quicksort-Algorithmus für beide Subarrays. Dies wird so lange fortgesetzt, bis der grundlegende Fall eines leeren Arrays oder eines Arrays mit nur einem Element erreicht ist, das wir zurückgeben. The unwinding of the recursive calls return us the sorted array.
 
-Quick sort is a very efficient sorting method, providing *O(nlog(n))* performance on average. It is also relatively easy to implement. These attributes make it a popular and useful sorting method.
+Quicksort ist eine sehr effiziente Sortiermethode, die im Durchschnitt *O(nlog(n))* ausführt. It is also relatively easy to implement. These attributes make it a popular and useful sorting method.
 
-**Instructions:** Write a function `quickSort` which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest. While the choice of the pivot value is important, any pivot will do for our purposes here. For simplicity, the first or last element could be used.
+**Instructions:** Write a function `quickSort` which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest. While the choice of the pivot value is important, any pivot will do for our purposes here. Der Einfachkeit halber, kann das erste oder das letzte Element benutzt werden.
 
 # --hints--
 
-`quickSort` should be a function.
+`quickSort` sollte eine Funktion sein.
 
 ```js
 assert(typeof quickSort == 'function');
 ```
 
-`quickSort` should return a sorted array (least to greatest).
+`quickSort` sollte ein sortieres Array zurückgeben (vom kleinsten zum größten)
 
 ```js
 assert(
diff --git a/curriculum/challenges/german/10-coding-interview-prep/data-structures/check-if-an-element-is-present-in-a-binary-search-tree.md b/curriculum/challenges/german/10-coding-interview-prep/data-structures/check-if-an-element-is-present-in-a-binary-search-tree.md
index e45bd5a51aa..03daa65cb23 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/data-structures/check-if-an-element-is-present-in-a-binary-search-tree.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/data-structures/check-if-an-element-is-present-in-a-binary-search-tree.md
@@ -145,7 +145,7 @@ function Node(value) {
 function BinarySearchTree() {
   this.root = null;
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```
diff --git a/curriculum/challenges/german/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md b/curriculum/challenges/german/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md
index 4a6f0bb9b5c..db3165a4b73 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md
@@ -107,7 +107,7 @@ function BinarySearchTree() {
 }
 function isBinarySearchTree(tree) {
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```
diff --git a/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md b/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md
index 46ba6082670..b9f3f12d767 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md
@@ -160,7 +160,7 @@ assert(
 DoublyLinkedList.prototype = Object.assign(
   DoublyLinkedList.prototype,
   {
-  
+
   print() {
     if (this.head == null) {
       return null;
@@ -204,7 +204,7 @@ var DoublyLinkedList = function() {
   this.head = null;
   this.tail = null;
   // Only change code below this line
-  
+
   // Only change code above this line
 };
 ```
diff --git a/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-a-hash-table.md b/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-a-hash-table.md
index af26da6ba50..824fd19c87f 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-a-hash-table.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-a-hash-table.md
@@ -1,6 +1,6 @@
 ---
 id: 587d825b367417b2b2512c8e
-title: Create a Hash Table
+title: Erstelle eine Hashtabelle
 challengeType: 1
 forumTopicId: 301627
 dashedName: create-a-hash-table
@@ -10,13 +10,13 @@ dashedName: create-a-hash-table
 
 In this challenge we will learn about hash tables. A Hash table is used to implement associative arrays, or mappings of key-value pairs, like the objects and Maps we have just been studying. A JavaScript object could be implemented as a hash table, for instance (its actual implementation will depend on the environment it's running in). The way a hash table works is that it takes a key input and hashes this key in a deterministic way to some numerical value. This numerical value is then used as the actual key the associated value is stored by. Then, if you try to access the same key again, the hashing function will process the key, return the same numerical result, which will then be used to look up the associated value. This provides very efficient O(1) lookup time on average.
 
-Hash tables can be implemented as arrays with hash functions producing array indices within a specified range. In this method, the choice of the array size is important, as is the hashing function. For instance, what if the hashing function produces the same value for two different keys? This is called a collision. One way to handle collisions is to just store both key-value pairs at that index. Then, upon lookup of either, you would have to iterate through the bucket of items to find the key you are looking for. A good hashing function will minimize collisions to maintain efficient search time.
+Hash tables can be implemented as arrays with hash functions producing array indices within a specified range. In this method, the choice of the array size is important, as is the hashing function. For instance, what if the hashing function produces the same value for two different keys? Dies nennt man eine Kollision. One way to handle collisions is to just store both key-value pairs at that index. Then, upon lookup of either, you would have to iterate through the bucket of items to find the key you are looking for. A good hashing function will minimize collisions to maintain efficient search time.
 
 Here, we won't be concerned with the details of hashing or hash table implementation, we will just try to get a general sense of how they work.
 
 # --instructions--
 
-Let's create the basic functionality of a hash table. We've created a naive hashing function for you to use. You can pass a string value to the function `hash` and it will return a hashed value you can use as a key for storage. Store items based on this hashed value in the `this.collection` object. Create these three methods: `add`, `remove`, and `lookup`. The first should accept a key value pair to add to the hash table. The second should remove a key-value pair when passed a key. The third should accept a key and return the associated value or `null` if the key is not present.
+Lass uns die grundlegende Funktionalität einer Hashtabelle erstellen. Wir haben eine einfache Hashfunktion für dich erstellt. You can pass a string value to the function `hash` and it will return a hashed value you can use as a key for storage. Store items based on this hashed value in the `this.collection` object. Create these three methods: `add`, `remove`, and `lookup`. The first should accept a key value pair to add to the hash table. The second should remove a key-value pair when passed a key. The third should accept a key and return the associated value or `null` if the key is not present.
 
 Be sure to write your code to account for collisions!
 
@@ -139,7 +139,7 @@ assert(
 );
 ```
 
-Items should be added using the hash function.
+Elemente sollten über die Hashfunktion hinzugefügt werden.
 
 ```js
 assert(
@@ -210,7 +210,7 @@ var hash = string => {
 var HashTable = function() {
   this.collection = {};
   // Only change code below this line
-  
+
   // Only change code above this line
 };
 ```
diff --git a/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-a-map-data-structure.md b/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-a-map-data-structure.md
index 25d99a18438..f02202cc5f9 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-a-map-data-structure.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-a-map-data-structure.md
@@ -158,7 +158,7 @@ assert(
 var Map = function() {
   this.collection = {};
   // Only change code below this line
-  
+
   // Only change code above this line
 };
 ```
diff --git a/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-a-set-class.md b/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-a-set-class.md
index 8dae14f7644..d818be6a807 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-a-set-class.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-a-set-class.md
@@ -170,7 +170,7 @@ class Set {
   }
 
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```
diff --git a/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md b/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md
index c6c56bfcc07..b1495efd441 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md
@@ -139,7 +139,7 @@ var Node = function() {
 };
 var Trie = function() {
   // Only change code below this line
-  
+
   // Only change code above this line
 };
 ```
diff --git a/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md b/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md
index 8e895d9b218..02bcedd36db 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md
@@ -8,14 +8,14 @@ dashedName: create-an-es6-javascript-map
 
 # --description--
 
-The new version of JavaScript provides us with a built-in Map object which provides much of the functionality we wrote by hand in the last challenge. This Map object, although similar to regular JavaScript objects, provides some useful functionality that normal objects lack. For example, an ES6 Map tracks the insertion order of items that are added to it. Here is a more complete overview of its methods: 
+The new version of JavaScript provides us with a built-in Map object which provides much of the functionality we wrote by hand in the last challenge. This Map object, although similar to regular JavaScript objects, provides some useful functionality that normal objects lack. For example, an ES6 Map tracks the insertion order of items that are added to it. Here is a more complete overview of its methods:
 
-- `.has(key)` returns true or false based on the presence of a key 
-- `.get(key)` returns the value associated with a key 
-- `.set(key, value)` sets a new key, value pair 
-- `.delete(key)` removes a key, value pair 
-- `.clear()` removes all key, value pairs 
-- `.entries()` returns an array of all the keys in insertion order 
+- `.has(key)` returns true or false based on the presence of a key
+- `.get(key)` returns the value associated with a key
+- `.set(key, value)` sets a new key, value pair
+- `.delete(key)` removes a key, value pair
+- `.clear()` removes all key, value pairs
+- `.entries()` returns an array of all the keys in insertion order
 - `.values()` returns an array of all the values in insertion order
 
 # --instructions--
diff --git a/curriculum/challenges/german/10-coding-interview-prep/data-structures/depth-first-search.md b/curriculum/challenges/german/10-coding-interview-prep/data-structures/depth-first-search.md
index 4467b7eeba1..d03cf5a4b33 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/data-structures/depth-first-search.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/data-structures/depth-first-search.md
@@ -16,7 +16,7 @@ Once it reaches one end of a path, the search will backtrack to the last node wi
 
 The animation below shows how the algorithm works. The algorithm starts with the top node and visits the nodes in the numbered order.
 
-<img class='img-responsive' src='https://camo.githubusercontent.com/aaad9e39961daf34d967c616edeb50abf3bf1235/68747470733a2f2f75706c6f61642e77696b696d656469612e6f72672f77696b6970656469612f636f6d6d6f6e732f372f37662f44657074682d46697273742d5365617263682e676966'>
+<img class='img-responsive' src='https://camo.githubusercontent.com/aaad9e39961daf34d967c616edeb50abf3bf1235/68747470733a2f2f75706c6f61642e77696b696d656469612e6f72672f77696b6970656469612f636f6d6d6f6e732f372f37662f44657074682d46697273742d5365617263682e676966' />
 
 Notice how, unlike breadth-first search, every time a node is visited, it doesn't visit all of its neighbors. Instead, it first visits one of its neighbors and continues down that path until there are no more nodes to be visited on that path.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-height-of-a-binary-search-tree.md b/curriculum/challenges/german/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-height-of-a-binary-search-tree.md
index b049822d4ad..eb71f5ea47f 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-height-of-a-binary-search-tree.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-height-of-a-binary-search-tree.md
@@ -261,7 +261,7 @@ function Node(value) {
 function BinarySearchTree() {
   this.root = null;
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```
@@ -278,7 +278,7 @@ function Node(value) {
 function BinarySearchTree() {
   this.root = null;
   // Only change code below this line
-  
+
   // Only change code above this line
   this.findMinHeight = function(root = this.root) {
     // empty tree.
diff --git a/curriculum/challenges/german/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-value-in-a-binary-search-tree.md b/curriculum/challenges/german/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-value-in-a-binary-search-tree.md
index 590820dd490..23077f9d938 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-value-in-a-binary-search-tree.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-value-in-a-binary-search-tree.md
@@ -187,7 +187,7 @@ function Node(value) {
 function BinarySearchTree() {
   this.root = null;
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```
diff --git a/curriculum/challenges/german/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md b/curriculum/challenges/german/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md
index 01a5a15780c..efc98e7be70 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md
@@ -125,14 +125,14 @@ function createRandomArray(size = 5){
   let a = new Array(size);
   for(let i = 0; i < size; i++)
     a[i] = Math.floor(Math.random() * 100);
-  
+
   return a;
 }
 const array = createRandomArray(25);
 
 var MinHeap = function() {
   // Only change code below this line
-  
+
   // Only change code above this line
 };
 ```
diff --git a/curriculum/challenges/german/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md b/curriculum/challenges/german/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
index 6492f8bdc37..3528a99be9a 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
@@ -127,7 +127,7 @@ assert(
 ```js
 var MaxHeap = function() {
   // Only change code below this line
-    
+
   // Only change code above this line
 };
 ```
diff --git a/curriculum/challenges/german/10-coding-interview-prep/data-structures/invert-a-binary-tree.md b/curriculum/challenges/german/10-coding-interview-prep/data-structures/invert-a-binary-tree.md
index bb2226fac89..8be38b0d5d8 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/data-structures/invert-a-binary-tree.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/data-structures/invert-a-binary-tree.md
@@ -160,7 +160,7 @@ function Node(value) {
 function BinarySearchTree() {
   this.root = null;
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```
diff --git a/curriculum/challenges/german/10-coding-interview-prep/data-structures/perform-a-difference-on-two-sets-of-data.md b/curriculum/challenges/german/10-coding-interview-prep/data-structures/perform-a-difference-on-two-sets-of-data.md
index 8c40ae51616..1c793291283 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/data-structures/perform-a-difference-on-two-sets-of-data.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/data-structures/perform-a-difference-on-two-sets-of-data.md
@@ -124,7 +124,7 @@ class Set {
     return newSet;
   }
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```
diff --git a/curriculum/challenges/german/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md b/curriculum/challenges/german/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md
index ae49ebc0be8..3c099ab1d33 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md
@@ -200,7 +200,7 @@ class Set {
     return newSet;
   }
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```
diff --git a/curriculum/challenges/german/10-coding-interview-prep/data-structures/perform-an-intersection-on-two-sets-of-data.md b/curriculum/challenges/german/10-coding-interview-prep/data-structures/perform-an-intersection-on-two-sets-of-data.md
index e2bef363771..a108cb3b4ee 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/data-structures/perform-an-intersection-on-two-sets-of-data.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/data-structures/perform-an-intersection-on-two-sets-of-data.md
@@ -101,7 +101,7 @@ class Set {
     return newSet;
   }
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```
diff --git a/curriculum/challenges/german/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list.md b/curriculum/challenges/german/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list.md
index 871cf51e9d9..a202036ff08 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list.md
@@ -194,7 +194,7 @@ function LinkedList() {
       previous = currentNode;
       currentNode = currentNode.next;
     }
-    
+
     if (currentNode.next === null && currentNode.element !== element) {
       return;
     }
diff --git a/curriculum/challenges/german/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md b/curriculum/challenges/german/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
index 0f3876daf49..c26c4677db7 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
@@ -165,7 +165,7 @@ var DoublyLinkedList = function() {
   this.head = null;
   this.tail = null;
   // Only change code below this line
-  
+
   // Only change code above this line
 };
 ```
diff --git a/curriculum/challenges/german/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md b/curriculum/challenges/german/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md
index d048a3a43cb..b02f10043d3 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md
@@ -214,7 +214,7 @@ function Node(value) {
 function BinarySearchTree() {
   this.root = null;
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```
diff --git a/curriculum/challenges/german/10-coding-interview-prep/data-structures/use-depth-first-search-in-a-binary-search-tree.md b/curriculum/challenges/german/10-coding-interview-prep/data-structures/use-depth-first-search-in-a-binary-search-tree.md
index 8dc78340bfe..c03fb750777 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/data-structures/use-depth-first-search-in-a-binary-search-tree.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/data-structures/use-depth-first-search-in-a-binary-search-tree.md
@@ -278,7 +278,7 @@ function Node(value) {
 function BinarySearchTree() {
   this.root = null;
   // Only change code below this line
-  
+
   // Only change code above this line
 }
 ```
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
index 34ccf02d079..21ada56df45 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
@@ -60,32 +60,46 @@ primeSummation(2000000);
 # --solutions--
 
 ```js
-const NUM_PRIMES = 2000000;
-const PRIME_SEIVE = Array(Math.floor((NUM_PRIMES-1)/2)).fill(true);
-(function initPrimes(num) {
-  const upper = Math.floor((num - 1) / 2);
-  const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
-  for (let i = 0; i <= sqrtUpper; i++) {
-    if (PRIME_SEIVE[i]) {
-      // Mark value in PRIMES array
-      const prime = 2 * i + 3;
-      // Mark all multiples of this number as false (not prime)
-      const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
-      for (let j = primeSqaredIndex; j < upper; j += prime) {
-        PRIME_SEIVE[j] = false;
+class PrimeSeive {
+  constructor(num) {
+    const seive = Array(Math.floor((num - 1) / 2)).fill(true);
+    const upper = Math.floor((num - 1) / 2);
+    const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+
+    for (let i = 0; i <= sqrtUpper; i++) {
+      if (seive[i]) {
+        // Mark value in seive array
+        const prime = 2 * i + 3;
+        // Mark all multiples of this number as false (not prime)
+        const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+        for (let j = primeSqaredIndex; j < upper; j += prime) {
+          seive[j] = false;
+        }
       }
     }
+
+    this._seive = seive;
   }
-})(NUM_PRIMES);
 
-function isOddNumberPrime(num) {
-  return PRIME_SEIVE[(num - 3) / 2];
-}
+  isPrime(num) {
+    return num === 2
+      ? true
+      : num % 2 === 0
+        ? false
+        : this.isOddPrime(num);
+  }
+
+  isOddPrime(num) {
+    return this._seive[(num - 3) / 2];
+  }
+};
+
+function primeSummation(num) {
+  const primeSeive = new PrimeSeive(num);
 
-function primeSummation(n) {
   let sum = 2;
-  for (let i = 3; i < n; i += 2) {
-    if (isOddNumberPrime(i)) sum += i;
+  for (let i = 3; i < num; i += 2) {
+    if (primeSeive.isOddPrime(i)) sum += i;
   }
   return sum;
 }
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md
index a29433afa01..803f95dc33e 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md
@@ -20,12 +20,9 @@ As a basis, if we were only given the first term of sequence, it would be most s
 
 Hence we obtain the following OPs for the cubic sequence:
 
-$$\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}$$
+$$\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 $\color{red}{red}$ above), we obtain 1 + 15 + 58 = 74. Consider the following tenth degree polynomial generating function:
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md
index 37ef60cd908..bf85eef1f76 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md
@@ -15,12 +15,9 @@ Let $S(A)$ represent the sum of elements in set A of size n. We shall call it a
 
 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\\} \\\\
+$$\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}$$
 
 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.
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-107-minimal-network.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
index 75338badbfa..3b69363096d 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
@@ -10,12 +10,12 @@ dashedName: problem-107-minimal-network
 
 The following undirected network consists of seven vertices and twelve edges with a total weight of 243.
 
-<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;">
+<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;" />
 
 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 | -  |
@@ -27,7 +27,7 @@ The same network can be represented by the matrix below.
 
 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 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;">
+<img class="img-responsive center-block" alt="Network with 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`.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md
index a4f34e849ee..56fbe532238 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md
@@ -14,13 +14,9 @@ $$\frac{1}{x} + \frac{1}{y} = \frac{1}{n}$$
 
 For `n` = 4 there are exactly three distinct solutions:
 
-$$\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}$$
+$$\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?
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-109-darts.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-109-darts.md
index 68a417c914d..5064f7e146c 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-109-darts.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-109-darts.md
@@ -10,7 +10,7 @@ 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.
 
-<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;">
+<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;" />
 
 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.
 
@@ -20,19 +20,12 @@ There are many variations of rules but in the most popular game the players will
 
 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:
 
-$$\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}$$
+$$\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}$$
 
 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?
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md
index fee32260b93..7f22fbffb6c 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md
@@ -19,7 +19,7 @@ So $M(4, 1) = 3$ is the maximum number of repeated digits for a 4-digit prime wh
 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      |
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md
index ff84a9bf090..3e1b2f85927 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md
@@ -10,7 +10,7 @@ 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.
 
-<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;">
+<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?
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md
index 15fc613e0db..b0b1969a3df 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md
@@ -12,15 +12,15 @@ 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;">
+<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;">
+<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.
 
-<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;">
+<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?
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md
index 65a9d3749e7..4a4873aac95 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md
@@ -10,7 +10,7 @@ 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.
 
-<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;">
+<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?
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md
index c8400c506e2..78c29aa7952 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md
@@ -14,24 +14,16 @@ $$n × n × \ldots × n = n^{15}$$
 
 But using a "binary" method you can compute it in six multiplications:
 
-$$\begin{align}
-  & n × n = n^2\\\\
-  & n^2 × n^2 = n^4\\\\
-  & n^4 × n^4 = n^8\\\\
-  & n^8 × n^4 = n^{12}\\\\
-  & n^{12} × n^2 = n^{14}\\\\
-  & n^{14} × n = n^{15}
-\end{align}$$
+$$\begin{align}   & n × n = n^2\\\\
+  & n^2 × n^2 = n^4\\\\   & n^4 × n^4 = n^8\\\\
+  & n^8 × n^4 = n^{12}\\\\   & n^{12} × n^2 = n^{14}\\\\
+  & n^{14} × n = n^{15} \end{align}$$
 
 However it is yet possible to compute it in only five multiplications:
 
-$$\begin{align}
-  & n × n = n^2\\\\
-  & n^2 × n = n^3\\\\
-  & n^3 × n^3 = n^6\\\\
-  & n^6 × n^6 = n^{12}\\\\
-  & n^{12} × n^3 = n^{15}
-\end{align}$$
+$$\begin{align}   & n × n = n^2\\\\
+  & n^2 × n = n^3\\\\   & n^3 × n^3 = n^6\\\\
+  & n^6 × n^6 = n^{12}\\\\ & n^{12} × n^3 = n^{15} \end{align}$$
 
 We shall define $m(k)$ to be the minimum number of multiplications to compute $n^k$; for example $m(15) = 5$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md
index 1f7725c7baf..d089c18aff0 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md
@@ -10,7 +10,7 @@ dashedName: problem-126-cuboid-layers
 
 The minimum number of cubes to cover every visible face on a cuboid measuring 3 x 2 x 1 is twenty-two.
 
-<img class="img-responsive center-block" alt="3x2x1 cuboid covered by twenty-two 1x1x1 cubes" src="https://cdn.freecodecamp.org/curriculum/project-euler/cuboid-layers.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="3x2x1 cuboid covered by twenty-two 1x1x1 cubes" src="https://cdn.freecodecamp.org/curriculum/project-euler/cuboid-layers.png" style="background-color: white; padding: 10px;" />
 
 If we add a second layer to this solid it would require forty-six cubes to cover every visible face, the third layer would require seventy-eight cubes, and the fourth layer would require one-hundred and eighteen cubes to cover every visible face.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
index 80309b4cff3..7e8bea5482e 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
@@ -12,7 +12,7 @@ A hexagonal tile with number 1 is surrounded by a ring of six hexagonal tiles, s
 
 New rings are added in the same fashion, with the next rings being numbered 8 to 19, 20 to 37, 38 to 61, and so on. The diagram below shows the first three rings.
 
-<img class="img-responsive center-block" alt="three first rings of arranged hexagonal tiles with numbers 1 to 37, and with highlighted tiles 8 and 17" src="https://cdn.freecodecamp.org/curriculum/project-euler/hexagonal-tile-differences.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="three first rings of arranged hexagonal tiles with numbers 1 to 37, and with highlighted tiles 8 and 17" src="https://cdn.freecodecamp.org/curriculum/project-euler/hexagonal-tile-differences.png" style="background-color: white; padding: 10px;" />
 
 By finding the difference between tile $n$ and each of its six neighbours we shall define $PD(n)$ to be the number of those differences which are prime.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.md
index c2d8829a280..b700dba62d0 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.md
@@ -14,18 +14,15 @@ For this problem we shall be interested in values of $x$ for which $A_{F}(x)$ is
 
 Surprisingly
 
-$$\begin{align}
-A_F(\frac{1}{2}) & = (\frac{1}{2}) × 1 + {(\frac{1}{2})}^2 × 1 + {(\frac{1}{2})}^3 × 2 + {(\frac{1}{2})}^4 × 3 + {(\frac{1}{2})}^5 × 5 + \cdots \\\\
-                 & = \frac{1}{2} + \frac{1}{4} + \frac{2}{8} + \frac{3}{16} + \frac{5}{32} + \cdots \\\\
-                 & = 2
-\end{align}$$
+$$\begin{align} A_F(\frac{1}{2}) & = (\frac{1}{2}) × 1 + {(\frac{1}{2})}^2 × 1 + {(\frac{1}{2})}^3 × 2 + {(\frac{1}{2})}^4 × 3 + {(\frac{1}{2})}^5 × 5 + \cdots \\\\
+                 & = \frac{1}{2} + \frac{1}{4} + \frac{2}{8} + \frac{3}{16} + \frac{5}{32} + \cdots \\\\ & = 2 \end{align}$$
 
 The corresponding values of $x$ for the first five natural numbers are shown below.
 
-| $x$                       | $A_F(x)$ |
-|---------------------------|----------|
-| $\sqrt{2} − 1$            | $1$      |
-| $\frac{1}{2}$             | $2$      |
+| $x$                         | $A_F(x)$ |
+| --------------------------- | -------- |
+| $\sqrt{2} − 1$             | $1$      |
+| $\frac{1}{2}$              | $2$      |
 | $\frac{\sqrt{13} − 2}{3}$ | $3$      |
 | $\frac{\sqrt{89} − 5}{8}$ | $4$      |
 | $\frac{\sqrt{34} − 3}{5}$ | $5$      |
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-138-special-isosceles-triangles.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-138-special-isosceles-triangles.md
index e65f3e8f573..6391b7523c4 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-138-special-isosceles-triangles.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-138-special-isosceles-triangles.md
@@ -10,7 +10,7 @@ dashedName: problem-138-special-isosceles-triangles
 
 Consider the isosceles triangle with base length, $b = 16$, and legs, $L = 17$.
 
-<img class="img-responsive center-block" alt="isosceles triangle with edges named as L - two edges with the same length and base of the triangle as b; and height of the triangle - h from the base of the triangle to the angle between L edges" src="https://cdn.freecodecamp.org/curriculum/project-euler/special-isosceles-triangles.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="isosceles triangle with edges named as L - two edges with the same length and base of the triangle as b; and height of the triangle - h from the base of the triangle to the angle between L edges" src="https://cdn.freecodecamp.org/curriculum/project-euler/special-isosceles-triangles.png" style="background-color: white; padding: 10px;" />
 
 By using the Pythagorean theorem, it can be seen that the height of the triangle, $h = \sqrt{{17}^2 − 8^2} = 15$, which is one less than the base length.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md
index ad26713611a..19f12579cb2 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md
@@ -12,7 +12,7 @@ Let (a, b, c) represent the three sides of a right angle triangle with integral
 
 For example, (3, 4, 5) triangles can be placed together to form a 5 by 5 square with a 1 by 1 hole in the middle and it can be seen that the 5 by 5 square can be tiled with twenty-five 1 by 1 squares.
 
-<img class="img-responsive center-block" alt="two 5 x 5 squares: one with four 3x4x5 triangles placed to create 1x1 hole in the middle; second with twenty-five 1x1 squares" src="https://cdn.freecodecamp.org/curriculum/project-euler/pythagorean-tiles.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="two 5 x 5 squares: one with four 3x4x5 triangles placed to create 1x1 hole in the middle; second with twenty-five 1x1 squares" src="https://cdn.freecodecamp.org/curriculum/project-euler/pythagorean-tiles.png" style="background-color: white; padding: 10px;" />
 
 However, if (5, 12, 13) triangles were used, the hole would measure 7 by 7. These 7 by 7 squares could not be used to tile the 13 by 13 square.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.md
index 0b32413e499..bdd6612a63c 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.md
@@ -14,13 +14,13 @@ For this problem we shall be concerned with values of $x$ for which $A_G(x)$ is
 
 The corresponding values of $x$ for the first five natural numbers are shown below.
 
-| $x$                         | $A_G(x)$ |
-|-----------------------------|----------|
+| $x$                           | $A_G(x)$ |
+| ----------------------------- | -------- |
 | $\frac{\sqrt{5} − 1}{4}$    | $1$      |
-| $\frac{2}{5}$               | $2$      |
+| $\frac{2}{5}$                | $2$      |
 | $\frac{\sqrt{22} − 2}{6}$   | $3$      |
 | $\frac{\sqrt{137} − 5}{14}$ | $4$      |
-| $\frac{1}{2}$               | $5$      |
+| $\frac{1}{2}$                | $5$      |
 
 We shall call $A_G(x)$ a golden nugget if $x$ is rational because they become increasingly rarer; for example, the 20th golden nugget is 211345365. Find the sum of the first thirty golden nuggets.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.md
index 740abfaab0e..8051dd4317d 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.md
@@ -14,7 +14,7 @@ Fermat challenged Torricelli to find the position of X such that p + q + r was m
 
 Torricelli was able to prove that if equilateral triangles AOB, BNC and AMC are constructed on each side of triangle ABC, the circumscribed circles of AOB, BNC, and AMC will intersect at a single point, T, inside the triangle. Moreover he proved that T, called the Torricelli/Fermat point, minimises $p + q + r$. Even more remarkable, it can be shown that when the sum is minimised, $AN = BM = CO = p + q + r$ and that AN, BM and CO also intersect at T.
 
-<img class="img-responsive center-block" alt="equilateral triangles AOB, BNC and AMC constructed on each side of triangle ABC; with the circumscribed circles of AOB, BNC, and AMC will intersecting at a single point, T, inside the triangle" src="https://cdn.freecodecamp.org/curriculum/project-euler/investigating-the-torricelli-point-of-a-triangle.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="equilateral triangles AOB, BNC and AMC constructed on each side of triangle ABC; with the circumscribed circles of AOB, BNC, and AMC will intersecting at a single point, T, inside the triangle" src="https://cdn.freecodecamp.org/curriculum/project-euler/investigating-the-torricelli-point-of-a-triangle.png" style="background-color: white; padding: 10px;" />
 
 If the sum is minimised and a, b, c, p, q and r are all positive integers we shall call triangle ABC a Torricelli triangle. For example, $a = 399$, $b = 455$, $c = 511$ is an example of a Torricelli triangle, with $p + q + r = 784$. Find the sum of all distinct values of $p + q + r ≤ 120000$ for Torricelli triangles.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md
index 6714f94d5fc..40978bdd4ef 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md
@@ -10,18 +10,11 @@ dashedName: problem-147-rectangles-in-cross-hatched-grids
 
 In a 3x2 cross-hatched grid, a total of 37 different rectangles could be situated within that grid as indicated in the sketch.
 
-<img class="img-responsive center-block" alt="ways of situating different rectangles wihtin cross-hatched 3x2 grid" src="https://cdn.freecodecamp.org/curriculum/project-euler/rectangles-in-cross-hatched-grids.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="ways of situating different rectangles wihtin cross-hatched 3x2 grid" src="https://cdn.freecodecamp.org/curriculum/project-euler/rectangles-in-cross-hatched-grids.png" style="background-color: white; padding: 10px;" />
 
 There are 5 grids smaller than 3x2, vertical and horizontal dimensions being important, i.e. 1x1, 2x1, 3x1, 1x2 and 2x2. If each of them is cross-hatched, the following number of different rectangles could be situated within those smaller grids:
 
-$$\begin{array}{|c|c|}
-\hline
-  1 \times 1 & 1  \\\\ \hline
-  2 \times 1 & 4  \\\\ \hline
-  3 \times 1 & 8  \\\\ \hline
-  1 \times 2 & 4  \\\\ \hline
-  2 \times 2 & 18 \\\\ \hline
-\end{array}$$
+$$\begin{array}{|c|c|} \hline 1 \times 1 & 1  \\\\ \hline 2 \times 1 & 4  \\\\ \hline 3 \times 1 & 8  \\\\ \hline 1 \times 2 & 4  \\\\ \hline 2 \times 2 & 18 \\\\ \hline \end{array}$$
 
 Adding those to the 37 of the 3x2 grid, a total of 72 different rectangles could be situated within 3x2 and smaller grids.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.md
index 1d300dbcefc..c1fbd34962d 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.md
@@ -10,13 +10,7 @@ dashedName: problem-149-searching-for-a-maximum-sum-subsequence
 
 Looking at the table below, it is easy to verify that the maximum possible sum of adjacent numbers in any direction (horizontal, vertical, diagonal or anti-diagonal) is $16 (= 8 + 7 + 1)$.
 
-$$\begin{array}{|r|r|r|r|}
-  \hline
-  −2 &  5 &  3 & 2 \\\\ \hline
-   9 & −6 &  5 & 1 \\\\ \hline
-   3 &  2 &  7 & 3 \\\\ \hline
-  −1 &  8 & −4 & 8 \\\\ \hline
-\end{array}$$
+$$\begin{array}{|r|r|r|r|} \hline −2 &  5 &  3 & 2 \\\\ \hline 9 & −6 &  5 & 1 \\\\ \hline 3 &  2 &  7 & 3 \\\\ \hline −1 &  8 & −4 & 8 \\\\ \hline \end{array}$$
 
 Now, let us repeat the search, but on a much larger scale:
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-15-lattice-paths.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-15-lattice-paths.md
index a3c9a068102..225eddd68e7 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-15-lattice-paths.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-15-lattice-paths.md
@@ -10,7 +10,7 @@ dashedName: problem-15-lattice-paths
 
 Starting in the top left corner of a 2×2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.
 
-<img class="img-responsive center-block" alt="a diagram of 6 2 by 2 grids showing all the routes to the bottom right corner" src="https://cdn-media-1.freecodecamp.org/project-euler/1Atixoj.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="a diagram of 6 2 by 2 grids showing all the routes to the bottom right corner" src="https://cdn-media-1.freecodecamp.org/project-euler/1Atixoj.gif" style="background-color: white; padding: 10px;" />
 
 How many such routes are there through a given `gridSize`?
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md
index 7ae755c60ff..366d5dd9bd0 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md
@@ -1,8 +1,7 @@
 ---
 id: 5900f4031000cf542c50ff15
 title: >-
-  Problem 150: Searching a triangular array for a sub-triangle having
-  minimum-sum
+  Problem 150: Searching a triangular array for a sub-triangle having minimum-sum
 challengeType: 1
 forumTopicId: 301781
 dashedName: problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum
@@ -14,28 +13,21 @@ In a triangular array of positive and negative integers, we wish to find a sub-t
 
 In the example below, it can be easily verified that the marked triangle satisfies this condition having a sum of −42.
 
-<img class="img-responsive center-block" alt="triangular array, with marked sub-triangle, having sum of -42" src="https://cdn.freecodecamp.org/curriculum/project-euler/searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="triangular array, with marked sub-triangle, having sum of -42" src="https://cdn.freecodecamp.org/curriculum/project-euler/searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.gif" style="background-color: white; padding: 10px;" />
 
 We wish to make such a triangular array with one thousand rows, so we generate 500500 pseudo-random numbers $s_k$ in the range $±2^{19}$, using a type of random number generator (known as a Linear Congruential Generator) as follows:
 
-$$\begin{align}
-  t := & \\ 0\\\\
-  \text{for}\\ & k = 1\\ \text{up to}\\ k = 500500:\\\\
-  & t := (615949 × t + 797807)\\ \text{modulo}\\ 2^{20}\\\\
-  & s_k := t − 219\\\\
-\end{align}$$
+$$\begin{align}   t := & \\ 0\\\\
+  \text{for}\\ & k = 1\\ \text{up to}\\ k = 500500:\\\\   & t := (615949 × t + 797807)\\ \text{modulo}\\ 2^{20}\\\\
+  & s_k := t − 219\\\\ \end{align}$$
 
 Thus: $s_1 = 273519$, $s_2 = −153582$, $s_3 = 450905$ etc.
 
 Our triangular array is then formed using the pseudo-random numbers thus:
 
-$$
-s_1 \\\\
-s_2\\;s_3 \\\\
-s_4\\; s_5\\; s_6 \\\\
-s_7\\; s_8\\; s_9\\; s_{10} \\\\
-\ldots
-$$
+$$ s_1 \\\\
+s_2\\;s_3 \\\\ s_4\\; s_5\\; s_6 \\\\
+s_7\\; s_8\\; s_9\\; s_{10} \\\\ \ldots $$
 
 Sub-triangles can start at any element of the array and extend down as far as we like (taking-in the two elements directly below it from the next row, the three elements directly below from the row after that, and so on).
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md
index f5d8ba23b58..47f785ed97b 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md
@@ -16,7 +16,7 @@ He proceeds to cut it in half, thus getting two sheets of size A2. Then he cuts
 
 All the unused sheets are placed back in the envelope.
 
-<img class="img-responsive center-block" alt="A1-size sheet split into: A2, A3, A4 and two A5 sheets" src="https://cdn.freecodecamp.org/curriculum/project-euler/paper-sheets-of-standard-sizes-an-expected-value-problem.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="A1-size sheet split into: A2, A3, A4 and two A5 sheets" src="https://cdn.freecodecamp.org/curriculum/project-euler/paper-sheets-of-standard-sizes-an-expected-value-problem.png" style="background-color: white; padding: 10px;" />
 
 At the beginning of each subsequent batch, he takes one sheet of paper from the envelope at random. If it is of size A5, he uses it. If it is larger, he repeats the 'cut-in-half' procedure until he has what he needs, and any remaining sheets are always placed back in the envelope.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md
index 48eaca04587..a66c05c4f97 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md
@@ -43,7 +43,7 @@ Note also that if the Gaussian Integer ($a + bi$) is a divisor of a rational int
 The following is a table of all of the divisors for the first five positive rational integers:
 
 | n | Gaussian integer divisors with positive real part | Sum s(n) of these divisors |
-|---|---------------------------------------------------|----------------------------|
+| - | ------------------------------------------------- | -------------------------- |
 | 1 | 1                                                 | 1                          |
 | 2 | 1, 1 + i, 1 - i, 2                                | 5                          |
 | 3 | 1, 3                                              | 4                          |
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md
index 7c7f2da7de6..40533ba38f8 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md
@@ -10,7 +10,7 @@ dashedName: problem-154-exploring-pascals-pyramid
 
 A triangular pyramid is constructed using spherical balls so that each ball rests on exactly three balls of the next lower level.
 
-<img class="img-responsive center-block" alt="triangular pyramid constructed using spherical balls with four levels" src="https://cdn.freecodecamp.org/curriculum/project-euler/exploring-pascals-pyramid.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="triangular pyramid constructed using spherical balls with four levels" src="https://cdn.freecodecamp.org/curriculum/project-euler/exploring-pascals-pyramid.png" style="background-color: white; padding: 10px;" />
 
 Then, we calculate the number of paths leading from the apex to each position: A path starts at the apex and progresses downwards to any of the three spheres directly below the current position. Consequently, the number of paths to reach a certain position is the sum of the numbers immediately above it (depending on the position, there are up to three numbers above it).
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md
index 689d8757526..ee1b1f97d9b 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md
@@ -14,7 +14,7 @@ The capacitors can be connected in series or in parallel to form sub-units, whic
 
 Using this simple procedure and up to n identical capacitors, we can make circuits having a range of different total capacitances. For example, using up to $n = 3$ capacitors of $60 μF$ each, we can obtain the following 7 distinct total capacitance values:
 
-<img class="img-responsive center-block" alt="example circuits having up to three capacitors, each of 60 μF" src="https://cdn.freecodecamp.org/curriculum/project-euler/counting-capacitor-circuits.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="example circuits having up to three capacitors, each of 60 μF" src="https://cdn.freecodecamp.org/curriculum/project-euler/counting-capacitor-circuits.gif" style="background-color: white; padding: 10px;" />
 
 If we denote by $D(n)$ the number of distinct total capacitance values we can obtain when using up to $n$ equal-valued capacitors and the simple procedure described above, we have: $D(1) = 1, D(2) = 3, D(3)=7, \ldots$
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-156-counting-digits.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-156-counting-digits.md
index 18df0f1c408..fb820e64aa0 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-156-counting-digits.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-156-counting-digits.md
@@ -15,7 +15,7 @@ Starting from zero the natural numbers are written down in base 10 like this:
 Consider the digit $d = 1$. After we write down each number n, we will update the number of ones that have occurred and call this number $f(n, 1)$. The first values for $f(n, 1)$, then, are as follows:
 
 | $n$ | $f(n, 1)$ |
-|-----|-----------|
+| --- | --------- |
 | 0   | 0         |
 | 1   | 1         |
 | 2   | 1         |
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md
index 1755588066e..aa5e8185547 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md
@@ -12,20 +12,10 @@ Consider the diophantine equation $\frac{1}{a} + \frac{1}{b} = \frac{p}{{10}^n}$
 
 For $n = 1$ this equation has 20 solutions that are listed below:
 
-$$\begin{array}{lllll}
-  \frac{1}{1}  + \frac{1}{1}  = \frac{20}{10} & \frac{1}{1} + \frac{1}{2}  = \frac{15}{10}
-& \frac{1}{1}  + \frac{1}{5}  = \frac{12}{10} & \frac{1}{1} + \frac{1}{10} = \frac{11}{10}
-& \frac{1}{2}  + \frac{1}{2}  = \frac{10}{10} \\\\
-  \frac{1}{2}  + \frac{1}{5}  = \frac{7}{10}   & \frac{1}{2} + \frac{1}{10} = \frac{6}{10}
-& \frac{1}{3}  + \frac{1}{6}  = \frac{5}{10}   & \frac{1}{3} + \frac{1}{15} = \frac{4}{10}
-& \frac{1}{4}  + \frac{1}{4}  = \frac{5}{10} \\\\
-  \frac{1}{4}  + \frac{1}{4}  = \frac{5}{10}  & \frac{1}{5}  + \frac{1}{5}  = \frac{4}{10}
-& \frac{1}{5}  + \frac{1}{10} = \frac{3}{10}  & \frac{1}{6}  + \frac{1}{30} = \frac{2}{10}
-& \frac{1}{10} + \frac{1}{10} = \frac{2}{10} \\\\
-  \frac{1}{11} + \frac{1}{110} = \frac{1}{10} & \frac{1}{12} + \frac{1}{60}  = \frac{1}{10}
-& \frac{1}{14} + \frac{1}{35}  = \frac{1}{10} & \frac{1}{15} + \frac{1}{30}  = \frac{1}{10}
-& \frac{1}{20} + \frac{1}{20}  = \frac{1}{10}
-\end{array}$$
+$$\begin{array}{lllll} \frac{1}{1}  + \frac{1}{1}  = \frac{20}{10} & \frac{1}{1} + \frac{1}{2}  = \frac{15}{10} & \frac{1}{1}  + \frac{1}{5}  = \frac{12}{10} & \frac{1}{1} + \frac{1}{10} = \frac{11}{10} & \frac{1}{2}  + \frac{1}{2}  = \frac{10}{10} \\\\
+  \frac{1}{2}  + \frac{1}{5}  = \frac{7}{10}   & \frac{1}{2} + \frac{1}{10} = \frac{6}{10} & \frac{1}{3}  + \frac{1}{6}  = \frac{5}{10}   & \frac{1}{3} + \frac{1}{15} = \frac{4}{10} & \frac{1}{4}  + \frac{1}{4}  = \frac{5}{10} \\\\
+  \frac{1}{4}  + \frac{1}{4}  = \frac{5}{10}  & \frac{1}{5}  + \frac{1}{5}  = \frac{4}{10} & \frac{1}{5}  + \frac{1}{10} = \frac{3}{10}  & \frac{1}{6}  + \frac{1}{30} = \frac{2}{10} & \frac{1}{10} + \frac{1}{10} = \frac{2}{10} \\\\
+  \frac{1}{11} + \frac{1}{110} = \frac{1}{10} & \frac{1}{12} + \frac{1}{60}  = \frac{1}{10} & \frac{1}{14} + \frac{1}{35}  = \frac{1}{10} & \frac{1}{15} + \frac{1}{30}  = \frac{1}{10} & \frac{1}{20} + \frac{1}{20}  = \frac{1}{10} \end{array}$$
 
 How many solutions has this equation for $1 ≤ n ≤ 9$?
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md
index 0958ce2b50c..845e2be3303 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md
@@ -1,8 +1,7 @@
 ---
 id: 5900f40a1000cf542c50ff1d
 title: >-
-  Problem 158: Exploring strings for which only one character comes
-  lexicographically after its neighbour to the left
+  Problem 158: Exploring strings for which only one character comes lexicographically after its neighbour to the left
 challengeType: 1
 forumTopicId: 301789
 dashedName: >-
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md
index 23d78359ac2..07a2e4945a4 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md
@@ -12,29 +12,24 @@ A composite number can be factored many different ways.
 
 For instance, not including multiplication by one, 24 can be factored in 7 distinct ways:
 
-$$\begin{align}
-  & 24 = 2 \times 2 \times 2 \times 3\\\\
-  & 24 = 2 \times 3 \times 4  \\\\
-  & 24 = 2 \times 2 \times 6  \\\\
-  & 24 = 4 \times 6    \\\\
-  & 24 = 3 \times 8    \\\\
-  & 24 = 2 \times 12   \\\\
-  & 24 = 24
-\end{align}$$
+$$\begin{align}   & 24 = 2 \times 2 \times 2 \times 3\\\\
+  & 24 = 2 \times 3 \times 4  \\\\   & 24 = 2 \times 2 \times 6  \\\\
+  & 24 = 4 \times 6    \\\\   & 24 = 3 \times 8    \\\\
+  & 24 = 2 \times 12   \\\\ & 24 = 24 \end{align}$$
 
 Recall that the digital root of a number, in base 10, is found by adding together the digits of that number, and repeating that process until a number arrives at less than 10. Thus the digital root of 467 is 8.
 
 We shall call a Digital Root Sum (DRS) the sum of the digital roots of the individual factors of our number. The chart below demonstrates all of the DRS values for 24.
 
 | Factorisation | Digital Root Sum |
-|---------------|------------------|
-|    2x2x2x3    |        9         |
-|     2x3x4     |        9         |
-|     2x2x6     |        10        |
-|      4x6      |        10        |
-|      3x8      |        11        |
-|      2x12     |        5         |
-|      24       |        6         |
+| ------------- | ---------------- |
+| 2x2x2x3       | 9                |
+| 2x3x4         | 9                |
+| 2x2x6         | 10               |
+| 4x6           | 10               |
+| 3x8           | 11               |
+| 2x12          | 5                |
+| 24            | 6                |
 
 The maximum Digital Root Sum of 24 is 11. The function $mdrs(n)$ gives the maximum Digital Root Sum of $n$. So $mdrs(24) = 11$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md
index 931bc41006e..ceec9db70d3 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md
@@ -12,11 +12,8 @@ For any $N$, let $f(N)$ be the last five digits before the trailing zeroes in $N
 
 For example,
 
-$$\begin{align}
-  & 9! = 362880 \\; \text{so} \\; f(9) = 36288 \\\\
-  & 10! = 3628800 \\; \text{so} \\; f(10) = 36288 \\\\
-  & 20! = 2432902008176640000 \\; \text{so} \\; f(20) = 17664
-\end{align}$$
+$$\begin{align}   & 9! = 362880 \\; \text{so} \\; f(9) = 36288 \\\\
+  & 10! = 3628800 \\; \text{so} \\; f(10) = 36288 \\\\ & 20! = 2432902008176640000 \\; \text{so} \\; f(20) = 17664 \end{align}$$
 
 Find $f(1,000,000,000,000)$
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-161-triominoes.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-161-triominoes.md
index 2388b67b547..8e0a070c788 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-161-triominoes.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-161-triominoes.md
@@ -12,15 +12,15 @@ A triomino is a shape consisting of three squares joined via the edges.
 
 There are two basic forms:
 
-<img class="img-responsive center-block" alt="two basic triominoes forms" src="https://cdn.freecodecamp.org/curriculum/project-euler/triominoes-1.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="two basic triominoes forms" src="https://cdn.freecodecamp.org/curriculum/project-euler/triominoes-1.gif" style="background-color: white; padding: 10px;" />
 
 If all possible orientations are taken into account there are six:
 
-<img class="img-responsive center-block" alt="triominoes forms including orientation" src="https://cdn.freecodecamp.org/curriculum/project-euler/triominoes-2.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="triominoes forms including orientation" src="https://cdn.freecodecamp.org/curriculum/project-euler/triominoes-2.gif" style="background-color: white; padding: 10px;" />
 
 Any n by m grid for which nxm is divisible by 3 can be tiled with triominoes. If we consider tilings that can be obtained by reflection or rotation from another tiling as different there are 41 ways a 2 by 9 grid can be tiled with triominoes:
 
-<img class="img-responsive center-block" alt="animation showing 41 ways of filling 2x9 grid with triominoes" src="https://cdn.freecodecamp.org/curriculum/project-euler/triominoes-3.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="animation showing 41 ways of filling 2x9 grid with triominoes" src="https://cdn.freecodecamp.org/curriculum/project-euler/triominoes-3.gif" style="background-color: white; padding: 10px;" />
 
 In how many ways can a 9 by 12 grid be tiled in this way by triominoes?
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md
index 45a8ed0be6e..e5fa50fb8e9 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md
@@ -10,7 +10,7 @@ dashedName: problem-163-cross-hatched-triangles
 
 Consider an equilateral triangle in which straight lines are drawn from each vertex to the middle of the opposite side, such as in the size 1 triangle in the sketch below.
 
-<img class="img-responsive center-block" alt="triangles with size 1 and size 2" src="https://cdn.freecodecamp.org/curriculum/project-euler/cross-hatched-triangles.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="triangles with size 1 and size 2" src="https://cdn.freecodecamp.org/curriculum/project-euler/cross-hatched-triangles.gif" style="background-color: white; padding: 10px;" />
 
 Sixteen triangles of either different shape or size or orientation or location can now be observed in that triangle. Using size 1 triangles as building blocks, larger triangles can be formed, such as the size 2 triangle in the above sketch. One-hundred and four triangles of either different shape or size or orientation or location can now be observed in that size 2 triangle.
 
@@ -18,10 +18,8 @@ It can be observed that the size 2 triangle contains 4 size 1 triangle building
 
 If we denote $T(n)$ as the number of triangles present in a triangle of size $n$, then
 
-$$\begin{align}
-  & T(1) = 16 \\\\
-  & T(2) = 104
-\end{align}$$
+$$\begin{align}   & T(1) = 16 \\\\
+  & T(2) = 104 \end{align}$$
 
 Find $T(36)$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md
index a41ebead4d5..83215f99ba4 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md
@@ -1,8 +1,7 @@
 ---
 id: 5900f4111000cf542c50ff23
 title: >-
-  Problem 164: Numbers for which no three consecutive digits have a sum greater
-  than a given value
+  Problem 164: Numbers for which no three consecutive digits have a sum greater than a given value
 challengeType: 1
 forumTopicId: 301798
 dashedName: >-
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-165-intersections.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-165-intersections.md
index ce5c0152ebc..04fef3d3e53 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-165-intersections.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-165-intersections.md
@@ -16,20 +16,16 @@ We will call a common point $T$ of two segments $L_1$ and $L_2$ a true intersect
 
 Consider the three segments $L_1$, $L_2$, and $L_3$:
 
-$$\begin{align}
-  & L_1: (27, 44) \\;\text{to}\\; (12, 32) \\\\
-  & L_2: (46, 53) \\;\text{to}\\; (17, 62) \\\\
-  & L_3: (46, 70) \\;\text{to}\\; (22, 40) \\\\
+$$\begin{align}   & L_1: (27, 44) \\;\text{to}\\; (12, 32) \\\\
+  & L_2: (46, 53) \\;\text{to}\\; (17, 62) \\\\   & L_3: (46, 70) \\;\text{to}\\; (22, 40) \\\\
 \end{align}$$
 
 It can be verified that line segments $L_2$ and $L_3$ have a true intersection point. We note that as the one of the end points of $L_3$: (22, 40) lies on $L_1$ this is not considered to be a true point of intersection. $L_1$ and $L_2$ have no common point. So among the three line segments, we find one true intersection point.
 
 Now let us do the same for 5000 line segments. To this end, we generate 20000 numbers using the so-called "Blum Blum Shub" pseudo-random number generator.
 
-$$\begin{align}
-  & s_0 = 290797 \\\\
-  & s_{n + 1} = s_n × s_n (\text{modulo}\\; 50515093) \\\\
-  & t_n = s_n (\text{modulo}\\; 500) \\\\
+$$\begin{align}   & s_0 = 290797 \\\\
+  & s_{n + 1} = s_n × s_n (\text{modulo}\\; 50515093) \\\\   & t_n = s_n (\text{modulo}\\; 500) \\\\
 \end{align}$$
 
 To create each line segment, we use four consecutive numbers $t_n$. That is, the first line segment is given by:
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-166-criss-cross.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-166-criss-cross.md
index fbe5a1f7536..f413a225835 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-166-criss-cross.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-166-criss-cross.md
@@ -12,12 +12,9 @@ A 4x4 grid is filled with digits $d$, $0 ≤ d ≤ 9$.
 
 It can be seen that in the grid
 
-$$\begin{array}{}
-  6 & 3 & 3 & 0 \\\\
-  5 & 0 & 4 & 3 \\\\
-  0 & 7 & 1 & 4 \\\\
-  1 & 2 & 4 & 5
-\end{array}$$
+$$\begin{array}{}   6 & 3 & 3 & 0 \\\\
+  5 & 0 & 4 & 3 \\\\   0 & 7 & 1 & 4 \\\\
+  1 & 2 & 4 & 5 \end{array}$$
 
 the sum of each row and each column has the value 12. Moreover the sum of each diagonal is also 12.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
index bc4e5eb44e2..52005157a98 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
@@ -1,8 +1,7 @@
 ---
 id: 5900f4151000cf542c50ff28
 title: >-
-  Problem 169: Exploring the number of different ways a number can be expressed
-  as a sum of powers of 2
+  Problem 169: Exploring the number of different ways a number can be expressed as a sum of powers of 2
 challengeType: 1
 forumTopicId: 301803
 dashedName: >-
@@ -15,13 +14,9 @@ Define $f(0)=1$ and $f(n)$ to be the number of different ways $n$ can be express
 
 For example, $f(10)=5$ since there are five different ways to express 10:
 
-$$\begin{align}
-  & 1 + 1 + 8 \\\\
-  & 1 + 1 + 4 + 4 \\\\
-  & 1 + 1 + 2 + 2 + 4 \\\\
-  & 2 + 4 + 4 \\\\
-  & 2 + 8
-\end{align}$$
+$$\begin{align}   & 1 + 1 + 8 \\\\
+  & 1 + 1 + 4 + 4 \\\\   & 1 + 1 + 2 + 2 + 4 \\\\
+  & 2 + 4 + 4 \\\\ & 2 + 8 \end{align}$$
 
 What is $f({10}^{25})$?
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md
index a05f5fadd3b..b6886e18764 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md
@@ -1,8 +1,7 @@
 ---
 id: 5900f4161000cf542c50ff29
 title: >-
-  Problem 170: Find the largest 0 to 9 pandigital that can be formed by
-  concatenating products
+  Problem 170: Find the largest 0 to 9 pandigital that can be formed by concatenating products
 challengeType: 1
 forumTopicId: 301805
 dashedName: >-
@@ -13,10 +12,8 @@ dashedName: >-
 
 Take the number 6 and multiply it by each of 1273 and 9854:
 
-$$\begin{align}
-  & 6 × 1273 = 7638 \\\\
-  & 6 × 9854 = 59124 \\\\
-\end{align}$$
+$$\begin{align}   & 6 × 1273 = 7638 \\\\
+  & 6 × 9854 = 59124 \\\\ \end{align}$$
 
 By concatenating these products we get the 1 to 9 pandigital 763859124. We will call 763859124 the "concatenated product of 6 and (1273, 9854)". Notice too, that the concatenation of the input numbers, 612739854, is also 1 to 9 pandigital.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md
index ed0eeb2523f..6d50fc0a151 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md
@@ -1,8 +1,7 @@
 ---
 id: 5900f41a1000cf542c50ff2d
 title: >-
-  Problem 174: Counting the number of "hollow" square laminae that can form one,
-  two, three, ... distinct arrangements
+  Problem 174: Counting the number of "hollow" square laminae that can form one, two, three, ... distinct arrangements
 challengeType: 1
 forumTopicId: 301809
 dashedName: >-
@@ -15,17 +14,17 @@ We shall define a square lamina to be a square outline with a square "hole" so t
 
 Given eight tiles it is possible to form a lamina in only one way: 3x3 square with a 1x1 hole in the middle. However, using thirty-two tiles it is possible to form two distinct laminae.
 
-<img class="img-responsive center-block" alt="two square lamina with holes 2x2 and 7x7" src="https://cdn.freecodecamp.org/curriculum/project-euler/using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="two square lamina with holes 2x2 and 7x7" src="https://cdn.freecodecamp.org/curriculum/project-euler/using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.gif" style="background-color: white; padding: 10px;" />
 
 If $t$ represents the number of tiles used, we shall say that $t = 8$ is type $L(1)$ and $t = 32$ is type $L(2)$.
 
 Let $N(n)$ be the number of $t ≤ 1000000$ such that $t$ is type $L(n)$; for example, $N(15) = 832$.
 
-What is $\sum N(n)$ for $1 ≤ n ≤ 10$?
+Was ist $\sum N(n)$ für $1 ≤ n ≤ 10$?
 
 # --hints--
 
-`hollowSquareLaminaeDistinctArrangements()` should return `209566`.
+`hollowSquareLaminaeDistinctArrangements()` sollte `209566` zurückgeben.
 
 ```js
 assert.strictEqual(hollowSquareLaminaeDistinctArrangements(), 209566);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
index 216cfa1937f..b3419c34823 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
@@ -1,8 +1,7 @@
 ---
 id: 5900f41c1000cf542c50ff2e
 title: >-
-  Problem 175: Fractions involving the number of different ways a number can be
-  expressed as a sum of powers of 2
+  Problem 175: Fractions involving the number of different ways a number can be expressed as a sum of powers of 2
 challengeType: 1
 forumTopicId: 301810
 dashedName: >-
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md
index 750a7e26e8b..c6f7b8ee5c4 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md
@@ -10,7 +10,7 @@ dashedName: problem-177-integer-angled-quadrilaterals
 
 Let ABCD be a convex quadrilateral, with diagonals AC and BD. At each vertex the diagonal makes an angle with each of the two sides, creating eight corner angles.
 
-<img class="img-responsive center-block" alt="convex quadrilateral ABCD, with diagonals AC and BD" src="https://cdn.freecodecamp.org/curriculum/project-euler/integer-angled-quadrilaterals.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="convex quadrilateral ABCD, with diagonals AC and BD" src="https://cdn.freecodecamp.org/curriculum/project-euler/integer-angled-quadrilaterals.gif" style="background-color: white; padding: 10px;" />
 
 For example, at vertex A, the two angles are CAD, CAB.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md
index d23abc56409..f98d3a71b9e 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md
@@ -1,8 +1,7 @@
 ---
 id: 5900f4231000cf542c50ff34
 title: >-
-  Problem 181: Investigating in how many ways objects of two different colours
-  can be grouped
+  Problem 181: Investigating in how many ways objects of two different colours can be grouped
 challengeType: 1
 forumTopicId: 301817
 dashedName: >-
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md
index 2d45244cc5c..561fd4e5ecf 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md
@@ -8,58 +8,47 @@ dashedName: problem-182-rsa-encryption
 
 # --description--
 
-The RSA encryption is based on the following procedure:
+Die RSA-Verschlüsselung basiert auf dem folgenden Verfahren:
 
-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`
+Erzeuge zwei unterschiedlichen Primzahlen `p` und `q`. Berechne `n=p*q` und `φ=(p-1)(q-1)`. Finde eine ganze Zahl `e`, `1 < e < φ`, so wie `gcd(e,φ) = 1`
 
-A message in this system is a number in the interval `[0,n-1]`.
-A text to be encrypted is then somehow converted to messages (numbers in the interval `[0,n-1]`).
-To encrypt the text, for each message, `m`, c=m<sup>e</sup> mod n is calculated.
+Eine Nachricht in diesem System ist eine Zahl im Intervall `[0,n-1]`. Ein zu verschlüsselnder Text wird dann irgendwie in Nachrichten (Zahlen im Intervall `[0,n-1]`) umgewandelt. Um den Text zu verschlüsseln, wird für jede Nachricht `m`, c=m<sup>e</sup> mod n berechnet.
 
-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.
+Um den Text zu entschlüsseln, wird folgende Prozedur benötigt: berechne `d` so dass `ed=1 mod φ` und berechne dann für jede verschlüsselte Nachricht, `c`, 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.
+Es gibt Werte von `e` und `m`, so dass 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.
+Ein Problem bei der Wahl von `e` ist, dass es nicht zu viele unverschlüsselte Nachrichten geben sollte. Lasse zum Beispiel `p=19` und `q=37`. Danach `n=19*37=703` und `φ=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. Für jede gültige Wahl von `e` gibt es einige unverschlüsselte Nachrichten. Es ist wichtig, dass die Anzahl an unverschlüsselten Nachrichten auf ein Minimum beschränkt ist.
 
 For any given `p` and `q`, find the sum of all values of `e`, `1 < e < φ(p,q)` and `gcd(e,φ)=1`, so that the number of unconcealed messages for this value of `e` is at a minimum.
 
 # --hints--
 
-`RSAEncryption` should be a function.
+`RSAEncryption` sollte eine Funktion sein.
 
 ```js
 assert(typeof RSAEncryption === 'function')
 ```
 
-`RSAEncryption` should return a number.
+`RSAEncryption` sollte eine Zahl zurückgeben.
 
 ```js
 assert.strictEqual(typeof RSAEncryption(19, 37), 'number');
 ```
 
-`RSAEncryption(19, 37)` should return `17766`.
+`RSAEncryption(19, 37)` sollte `17766` zurückgeben.
 
 ```js
 assert.strictEqual(RSAEncryption(19, 37), 17766);
 ```
 
-`RSAEncryption(283, 409)` should return `466196580`.
+`RSAEncryption(283, 409)` sollte `466196580` zurückgeben.
 
 ```js
 assert.strictEqual(RSAEncryption(283, 409), 466196580);
 ```
 
-`RSAEncryption(1009, 3643)` should return `399788195976`.
+`RSAEncryption(1009, 3643)` sollte `399788195976` zurückgeben.
 
 ```js
 assert.strictEqual(RSAEncryption(19, 37), 17766);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md
index 98b697822e1..336fb1cecf5 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md
@@ -8,19 +8,19 @@ dashedName: problem-184-triangles-containing-the-origin
 
 # --description--
 
-Consider the set $I_r$ of points $(x,y)$ with integer coordinates in the interior of the circle with radius $r$, centered at the origin, i.e. $x^2 + y^2 &lt; r^2$.
+Man betrachte die Menge $I_r$ von Punkten $(x,y)$ mit ganzzahligen Koordinaten im Inneren des Kreises mit Radius $r$, der im Ursprung zentriert ist, d.h. $x^2 + y^2 &lt; r^2$.
 
-For a radius of 2, $I_2$ contains the nine points (0,0), (1,0), (1,1), (0,1), (-1,1), (-1,0), (-1,-1), (0,-1) and (1,-1). There are eight triangles having all three vertices in $I_2$ which contain the origin in the interior. Two of them are shown below, the others are obtained from these by rotation.
+Für einen Radius von 2 enthält $I_2$ die neun Punkte (0,0), (1,0), (1,1), (0,1), (-1,1), (-1,0), (-1,-1), (0,-1) und (1,-1). Es gibt acht Dreiecke, bei denen alle drei Eckpunkte in $I_2$ liegen und die den Ursprung im Inneren enthalten. Zwei davon sind unten abgebildet, die anderen ergeben sich aus diesen durch Rotation.
 
-<img class="img-responsive center-block" alt="circle with radius 2, centered at the origin, with nine marked points and two triangles - (-1,0), (0,1), (1,-1) and (-1,1), (0,-1), (1,1)" src="https://cdn.freecodecamp.org/curriculum/project-euler/triangles-containing-the-origin.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="Kreis mit Radius 2, zentriert im Ursprung, mit neun markierten Punkten und zwei Dreiecken - (-1,0), (0,1), (1,-1) und (-1,1), (0,-1), (1,1)" src="https://cdn.freecodecamp.org/curriculum/project-euler/triangles-containing-the-origin.gif" style="background-color: white; padding: 10px;" />
 
-For a radius of 3, there are 360 triangles containing the origin in the interior and having all vertices in $I_3$ and for $I_5$ the number is 10600.
+Für einen Radius von 3 gibt es 360 Dreiecke, die den Ursprung im Inneren enthalten und alle Scheitelpunkte in $I_3$ haben, und für $I_5$ sind es 10600.
 
-How many triangles are there containing the origin in the interior and having all three vertices in $I_{105}$?
+Wie viele Dreiecke gibt es, die den Ursprung im Inneren enthalten und alle drei Scheitelpunkte in $I_{105}$ haben?
 
 # --hints--
 
-`trianglesContainingOrigin()` should return `1725323624056`.
+`trianglesContainingOrigin()` sollte `1725323624056` zurückgeben.
 
 ```js
 assert.strictEqual(trianglesContainingOrigin(), 1725323624056);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-185-number-mind.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-185-number-mind.md
index e7908a7c808..7dcfd6d1c79 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-185-number-mind.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-185-number-mind.md
@@ -8,55 +8,39 @@ dashedName: problem-185-number-mind
 
 # --description--
 
-The game Number Mind is a variant of the well known game Master Mind.
+Das Spiel Number Mind ist eine Variante des bekannten Spiels Master Mind.
 
-Instead of coloured pegs, you have to guess a secret sequence of digits. After each guess you're only told in how many places you've guessed the correct digit. So, if the sequence was 1234 and you guessed 2036, you'd be told that you have one correct digit; however, you would NOT be told that you also have another digit in the wrong place.
+Statt farbiger Stifte musst du eine geheime Ziffernfolge erraten. Nach jedem Raten wird dir nur mitgeteilt, an wie vielen Stellen du die richtige Ziffer erraten hast. Wenn also die Zahlenfolge 1234 lautet und du 2036 erraten hast, wird dir gesagt, dass du eine richtige Ziffer hast, aber NICHT, dass du auch eine andere Ziffer an der falschen Stelle hast.
 
-For instance, given the following guesses for a 5-digit secret sequence,
+Nehmen wir zum Beispiel an, dass eine 5-stellige geheime Sequenz wie folgt erraten wird,
 
-$$\begin{align}
-  & 90342 ;2\\;\text{correct}\\\\
-  & 70794 ;0\\;\text{correct}\\\\
-  & 39458 ;2\\;\text{correct}\\\\
-  & 34109 ;1\\;\text{correct}\\\\
-  & 51545 ;2\\;\text{correct}\\\\
-  & 12531 ;1\\;\text{correct}
-\end{align}$$
+$$\begin{align}   & 90342 ;2\\;\text{correct}\\\\
+  & 70794 ;0\\;\text{correct}\\\\   & 39458 ;2\\;\text{correct}\\\\
+  & 34109 ;1\\;\text{correct}\\\\   & 51545 ;2\\;\text{correct}\\\\
+  & 12531 ;1\\;\text{correct} \end{align}$$
 
-The correct sequence 39542 is unique.
+Die richtige Reihenfolge 39542 ist eindeutig.
 
-Based on the following guesses,
+Basierend auf den folgenden Vermutungen,
 
-$$\begin{align}
-  & 5616185650518293 ;2\\;\text{correct}\\\\
-  & 3847439647293047 ;1\\;\text{correct}\\\\
-  & 5855462940810587 ;3\\;\text{correct}\\\\
-  & 9742855507068353 ;3\\;\text{correct}\\\\
-  & 4296849643607543 ;3\\;\text{correct}\\\\
-  & 3174248439465858 ;1\\;\text{correct}\\\\
-  & 4513559094146117 ;2\\;\text{correct}\\\\
-  & 7890971548908067 ;3\\;\text{correct}\\\\
-  & 8157356344118483 ;1\\;\text{correct}\\\\
-  & 2615250744386899 ;2\\;\text{correct}\\\\
-  & 8690095851526254 ;3\\;\text{correct}\\\\
-  & 6375711915077050 ;1\\;\text{correct}\\\\
-  & 6913859173121360 ;1\\;\text{correct}\\\\
-  & 6442889055042768 ;2\\;\text{correct}\\\\
-  & 2321386104303845 ;0\\;\text{correct}\\\\
-  & 2326509471271448 ;2\\;\text{correct}\\\\
-  & 5251583379644322 ;2\\;\text{correct}\\\\
-  & 1748270476758276 ;3\\;\text{correct}\\\\
-  & 4895722652190306 ;1\\;\text{correct}\\\\
-  & 3041631117224635 ;3\\;\text{correct}\\\\
-  & 1841236454324589 ;3\\;\text{correct}\\\\
-  & 2659862637316867 ;2\\;\text{correct}
-\end{align}$$
+$$\begin{align}   & 5616185650518293 ;2\\;\text{correct}\\\\
+  & 3847439647293047 ;1\\;\text{correct}\\\\   & 5855462940810587 ;3\\;\text{correct}\\\\
+  & 9742855507068353 ;3\\;\text{correct}\\\\   & 4296849643607543 ;3\\;\text{correct}\\\\
+  & 3174248439465858 ;1\\;\text{correct}\\\\   & 4513559094146117 ;2\\;\text{correct}\\\\
+  & 7890971548908067 ;3\\;\text{correct}\\\\   & 8157356344118483 ;1\\;\text{correct}\\\\
+  & 2615250744386899 ;2\\;\text{correct}\\\\   & 8690095851526254 ;3\\;\text{correct}\\\\
+  & 6375711915077050 ;1\\;\text{correct}\\\\   & 6913859173121360 ;1\\;\text{correct}\\\\
+  & 6442889055042768 ;2\\;\text{correct}\\\\   & 2321386104303845 ;0\\;\text{correct}\\\\
+  & 2326509471271448 ;2\\;\text{correct}\\\\   & 5251583379644322 ;2\\;\text{correct}\\\\
+  & 1748270476758276 ;3\\;\text{correct}\\\\   & 4895722652190306 ;1\\;\text{correct}\\\\
+  & 3041631117224635 ;3\\;\text{correct}\\\\   & 1841236454324589 ;3\\;\text{correct}\\\\
+  & 2659862637316867 ;2\\;\text{correct} \end{align}$$
 
-Find the unique 16-digit secret sequence.
+Finde die einzigartige 16-stellige Geheimfolge.
 
 # --hints--
 
-`numberMind()` should return `4640261571849533`.
+`numberMind()` sollte `4640261571849533` zurückgeben.
 
 ```js
 assert.strictEqual(numberMind(), 4640261571849533);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md
index d3e4fef7c0b..a864f4ed5e2 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f4281000cf542c50ff39
-title: 'Problem 186: Connectedness of a network'
+title: 'Problem 186: Verbundenheit eines Netzes'
 challengeType: 1
 forumTopicId: 301822
 dashedName: problem-186-connectedness-of-a-network
@@ -11,27 +11,27 @@ dashedName: problem-186-connectedness-of-a-network
 Here are the records from a busy telephone system with one million users:
 
 | RecNr | Caller | Called |
-|-------|--------|--------|
-|   1   | 200007 | 100053 |
-|   2   | 600183 | 500439 |
-|   3   | 600863 | 701497 |
-|  ...  |  ...   |  ...   |
+| ----- | ------ | ------ |
+| 1     | 200007 | 100053 |
+| 2     | 600183 | 500439 |
+| 3     | 600863 | 701497 |
+| ...   | ...    | ...    |
 
 The telephone number of the caller and the called number in record $n$ are $Caller(n) = S_{2n - 1}$ and $Called(n) = S_{2n}$ where ${S}_{1,2,3,\ldots}$ come from the "Lagged Fibonacci Generator":
 
-For $1 ≤ k ≤ 55$, $S_k = [100003 - 200003k + 300007{k}^3]\\;(\text{modulo}\\;1000000)$
+Für $1 ≤ k ≤ 55$, $S_k = [100003 - 200003k + 300007{k}^3]\\;(\text{modulo}\\;1000000)$
 
-For $56 ≤ k$, $S_k = [S_{k - 24} + S_{k - 55}]\\;(\text{modulo}\\;1000000)$
+Für $56 ≤ k$, $S_k = [S_{k - 24} + S_{k - 55}]\\;(\text{modulo}\\;1000000)$
 
-If $Caller(n) = Called(n)$ then the user is assumed to have misdialled and the call fails; otherwise the call is successful.
+Wenn $Caller(n) = Called(n)$ ist, wird angenommen, dass der Benutzer sich verwählt hat, und der Anruf schlägt fehl; andernfalls ist der Anruf erfolgreich.
 
-From the start of the records, we say that any pair of users $X$ and $Y$ are friends if $X$ calls $Y$ or vice-versa. Similarly, $X$ is a friend of a friend of $Z$ if $X$ is a friend of $Y$ and $Y$ is a friend of $Z$; and so on for longer chains.
+Von Beginn der Aufzeichnungen an sagen wir, dass ein beliebiges Paar von Benutzern $X$ und $Y$ befreundet ist, wenn $X$ $Y$ anruft oder andersherum. In ähnlicher Weise ist $X$ ein Freund eines Freundes von $Z$, wenn $X$ ein Freund von $Y$ ist und $Y$ ein Freund von $Z$ ist; und so weiter für längere Ketten.
 
-The Prime Minister's phone number is 524287. After how many successful calls, not counting misdials, will 99% of the users (including the PM) be a friend, or a friend of a friend etc., of the Prime Minister?
+Die Telefonnummer des Premierministers lautet 524287. Nach wie vielen erfolgreichen Anrufen, Fehlanrufe nicht mitgezählt, werden 99 % der Nutzer (einschließlich des Premierministers) ein Freund oder ein Freund eines Freundes usw. des Premierministers sein?
 
 # --hints--
 
-`connectednessOfANetwork()` should return `2325629`.
+`connectednessOfANetwork()` sollte `2325629` zurückgeben.
 
 ```js
 assert.strictEqual(connectednessOfANetwork(), 2325629);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md
index 8058ded8ffb..cf099bc9428 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md
@@ -10,13 +10,13 @@ dashedName: problem-189-tri-colouring-a-triangular-grid
 
 Consider the following configuration of 64 triangles:
 
-<img class="img-responsive center-block" alt="64 triangles arranged to create larger triangle with side length of 8 triangles" src="https://cdn.freecodecamp.org/curriculum/project-euler/tri-colouring-a-triangular-grid-1.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="64 triangles arranged to create larger triangle with side length of 8 triangles" src="https://cdn.freecodecamp.org/curriculum/project-euler/tri-colouring-a-triangular-grid-1.gif" style="background-color: white; padding: 10px;" />
 
 We wish to colour the interior of each triangle with one of three colours: red, green or blue, so that no two neighbouring triangles have the same colour. Such a colouring shall be called valid. Here, two triangles are said to be neighbouring if they share an edge. Note: if they only share a vertex, then they are not neighbours.
 
 For example, here is a valid colouring of the above grid:
 
-<img class="img-responsive center-block" alt="colored grid of 64 triangles" src="https://cdn.freecodecamp.org/curriculum/project-euler/tri-colouring-a-triangular-grid-2.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="colored grid of 64 triangles" src="https://cdn.freecodecamp.org/curriculum/project-euler/tri-colouring-a-triangular-grid-2.gif" style="background-color: white; padding: 10px;" />
 
 A colouring C' which is obtained from a colouring C by rotation or reflection is considered distinct from C unless the two are identical.
 
@@ -24,7 +24,7 @@ How many distinct valid colourings are there for the above configuration?
 
 # --hints--
 
-`triangularGridColoring()` should return `10834893628237824`.
+`triangularGridColoring()` sollte `10834893628237824` zurückgeben.
 
 ```js
 assert.strictEqual(triangularGridColoring(), 10834893628237824);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-19-counting-sundays.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-19-counting-sundays.md
index 5a3e24cc431..debb18a8124 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-19-counting-sundays.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-19-counting-sundays.md
@@ -11,7 +11,7 @@ dashedName: problem-19-counting-sundays
 You are given the following information, but you may prefer to do some research for yourself.
 
 <ul>
-  <li>1 Jan 1900 was a Monday.</li>
+  <li>Der 1. Januar 1900 war ein Montag.</li>
   <li>Thirty days has September,<br>April, June and November.<br>All the rest have thirty-one,<br>Saving February alone,<br>Which has twenty-eight, rain or shine.<br>And on leap years, twenty-nine.</li>
   <li>A leap year occurs on any year evenly divisible by 4, but not on a century unless it is divisible by 400.</li>
 </ul>
@@ -20,7 +20,7 @@ How many Sundays fell on the first of the month during the twentieth century (1
 
 # --hints--
 
-`countingSundays(1943, 1946)` should return a number.
+`countingSundays(1943, 1946)` sollte eine Zahl zurückgeben.
 
 ```js
 assert(typeof countingSundays(1943, 1946) === 'number');
@@ -32,13 +32,13 @@ assert(typeof countingSundays(1943, 1946) === 'number');
 assert.strictEqual(countingSundays(1943, 1946), 6);
 ```
 
-`countingSundays(1995, 2000)` should return 10.
+`countingSundays(1995, 2000)` sollte 10 zurückgeben.
 
 ```js
 assert.strictEqual(countingSundays(1995, 2000), 10);
 ```
 
-`countingSundays(1901, 2000)` should return 171.
+`countingSundays(1901, 2000)` sollte 171 zurückgeben.
 
 ```js
 assert.strictEqual(countingSundays(1901, 2000), 171);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-191-prize-strings.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-191-prize-strings.md
index 8e4e35e5736..0febce5ba94 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-191-prize-strings.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-191-prize-strings.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f42b1000cf542c50ff3e
-title: 'Problem 191: Prize Strings'
+title: 'Problem 191: Preis-Strings'
 challengeType: 1
 forumTopicId: 301829
 dashedName: problem-191-prize-strings
@@ -8,9 +8,9 @@ dashedName: problem-191-prize-strings
 
 # --description--
 
-A particular school offers cash rewards to children with good attendance and punctuality. If they are absent for three consecutive days or late on more than one occasion then they forfeit their prize.
+Eine bestimmte Schule bietet Kindern mit guter Anwesenheit und Pünktlichkeit Geldprämien an. If they are absent for three consecutive days or late on more than one occasion then they forfeit their prize.
 
-During an n-day period a trinary string is formed for each child consisting of L's (late), O's (on time), and A's (absent).
+Während eines n-tägigen Zeitraums wird ein – aus den Buchstaben L (late), O (on time) und A (abwesend) bestehender – dreigliedriger String gebildet.
 
 Although there are eighty-one trinary strings for a 4-day period that can be formed, exactly forty-three strings would lead to a prize:
 
@@ -22,11 +22,11 @@ AALO AALA ALOO ALOA ALAO ALAA LOOO LOOA LOAO LOAA
 LAOO LAOA LAAO
 ```
 
-How many "prize" strings exist over a 30-day period?
+Wie viele "Preis"-Strings würden über einen dreißigtägigen Zeitraums entstehen?
 
 # --hints--
 
-`prizeStrings()` should return `1918080160`.
+`prizeStrings()` sollte `1918080160` zurückgeben.
 
 ```js
 assert.strictEqual(prizeStrings(), 1918080160);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md
index 608f288e3e9..1c5e01af1c7 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md
@@ -10,11 +10,11 @@ dashedName: problem-197-investigating-the-behaviour-of-a-recursively-defined-seq
 
 Given is the function $f(x) = ⌊{2}^{30.403243784 - x^2}⌋ × {10}^{-9}$ ( ⌊ ⌋ is the floor-function), the sequence $u_n$ is defined by $u_0 = -1$ and $u_{n + 1} = f(u_n)$.
 
-Find $u_n + u_{n + 1}$ for $n = {10}^{12}$. Give your answer with 9 digits after the decimal point.
+Finde $u_n + u_{n + 1}$ für $n = {10}^{12}$. Give your answer with 9 digits after the decimal point.
 
 # --hints--
 
-`recursivelyDefinedSequence()` should return `1.710637717`.
+`recursivelyDefinedSequence()` sollte `1.710637717` zurückgeben.
 
 ```js
 assert.strictEqual(recursivelyDefinedSequence(), 1.710637717);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md
index 69c2ba856dc..0e89e6dfb38 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md
@@ -16,7 +16,7 @@ How many ambiguous numbers $x = \frac{p}{q}$, $0 &lt; x &lt; \frac{1}{100}$, are
 
 # --hints--
 
-`ambiguousNumbers()` should return `52374425`.
+`ambiguousNumbers()` sollte `52374425` zurückgeben.
 
 ```js
 assert.strictEqual(ambiguousNumbers(), 52374425);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md
index f7a4c56e5aa..bfe00f6da38 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f4341000cf542c50ff46
-title: 'Problem 199: Iterative Circle Packing'
+title: 'Problem 199: Iterative Kreise'
 challengeType: 1
 forumTopicId: 301837
 dashedName: problem-199-iterative-circle-packing
@@ -10,7 +10,7 @@ dashedName: problem-199-iterative-circle-packing
 
 Three circles of equal radius are placed inside a larger circle such that each pair of circles is tangent to one another and the inner circles do not overlap. There are four uncovered "gaps" which are to be filled iteratively with more tangent circles.
 
-<img class="img-responsive center-block" alt="a diagram of non-overlapping circles" src="https://cdn-media-1.freecodecamp.org/project-euler/199-circles-in-circles.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="a diagram of non-overlapping circles" src="https://cdn-media-1.freecodecamp.org/project-euler/199-circles-in-circles.gif" style="background-color: white; padding: 10px;" />
 
 At each iteration, a maximally sized circle is placed in each gap, which creates more gaps for the next iteration. After 3 iterations (pictured), there are 108 gaps and the fraction of the area which is not covered by circles is 0.06790342, rounded to eight decimal places.
 
@@ -18,19 +18,19 @@ What fraction of the area is not covered by circles after `n` iterations? Give y
 
 # --hints--
 
-`iterativeCirclePacking(10)` should return a number.
+`iterativeCirclePacking(10)` sollte eine Zahl zurückgeben.
 
 ```js
 assert(typeof iterativeCirclePacking(10) === 'number');
 ```
 
-`iterativeCirclePacking(10)` should return `0.00396087`.
+`iterativeCirclePacking(10)` sollte `0.00396087` zurückgeben.
 
 ```js
 assert.strictEqual(iterativeCirclePacking(10), 0.00396087);
 ```
 
-`iterativeCirclePacking(3)` should return `0.06790342`.
+`iterativeCirclePacking(3)` sollte `0.06790342` zurückgeben.
 
 ```js
 assert.strictEqual(iterativeCirclePacking(3), 0.06790342);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md
index 5637da54304..e0513d008ec 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md
@@ -12,28 +12,17 @@ For any set $A$ of numbers, let $sum(A)$ be the sum of the elements of $A$.
 
 Consider the set $B = \\{1,3,6,8,10,11\\}$. There are 20 subsets of $B$ containing three elements, and their sums are:
 
-$$\begin{align}
-  & sum(\\{1,3,6\\}) = 10 \\\\
-  & sum(\\{1,3,8\\}) = 12 \\\\
-  & sum(\\{1,3,10\\}) = 14 \\\\
-  & sum(\\{1,3,11\\}) = 15 \\\\
-  & sum(\\{1,6,8\\}) = 15 \\\\
-  & sum(\\{1,6,10\\}) = 17 \\\\
-  & sum(\\{1,6,11\\}) = 18 \\\\
-  & sum(\\{1,8,10\\}) = 19 \\\\
-  & sum(\\{1,8,11\\}) = 20 \\\\
-  & sum(\\{1,10,11\\}) = 22 \\\\
-  & sum(\\{3,6,8\\}) = 17 \\\\
-  & sum(\\{3,6,10\\}) = 19 \\\\
-  & sum(\\{3,6,11\\}) = 20 \\\\
-  & sum(\\{3,8,10\\}) = 21 \\\\
-  & sum(\\{3,8,11\\}) = 22 \\\\
-  & sum(\\{3,10,11\\}) = 24 \\\\
-  & sum(\\{6,8,10\\}) = 24 \\\\
-  & sum(\\{6,8,11\\}) = 25 \\\\
-  & sum(\\{6,10,11\\}) = 27 \\\\
-  & sum(\\{8,10,11\\}) = 29
-\\end{align}$$
+$$\begin{align}   & sum(\\{1,3,6\\}) = 10 \\\\
+  & sum(\\{1,3,8\\}) = 12 \\\\   & sum(\\{1,3,10\\}) = 14 \\\\
+  & sum(\\{1,3,11\\}) = 15 \\\\   & sum(\\{1,6,8\\}) = 15 \\\\
+  & sum(\\{1,6,10\\}) = 17 \\\\   & sum(\\{1,6,11\\}) = 18 \\\\
+  & sum(\\{1,8,10\\}) = 19 \\\\   & sum(\\{1,8,11\\}) = 20 \\\\
+  & sum(\\{1,10,11\\}) = 22 \\\\   & sum(\\{3,6,8\\}) = 17 \\\\
+  & sum(\\{3,6,10\\}) = 19 \\\\   & sum(\\{3,6,11\\}) = 20 \\\\
+  & sum(\\{3,8,10\\}) = 21 \\\\   & sum(\\{3,8,11\\}) = 22 \\\\
+  & sum(\\{3,10,11\\}) = 24 \\\\   & sum(\\{6,8,10\\}) = 24 \\\\
+  & sum(\\{6,8,11\\}) = 25 \\\\   & sum(\\{6,10,11\\}) = 27 \\\\
+  & sum(\\{8,10,11\\}) = 29 \\end{align}$$
 
 Some of these sums occur more than once, others are unique. For a set $A$, let $U(A,k)$ be the set of unique sums of $k$-element subsets of $A$, in our example we find $U(B,3) = \\{10,12,14,18,21,25,27,29\\}$ and $sum(U(B,3)) = 156$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md
index 8c572981d57..4e418715771 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md
@@ -10,17 +10,11 @@ dashedName: problem-203-squarefree-binomial-coefficients
 
 The binomial coefficients $\displaystyle\binom{n}{k}$ can be arranged in triangular form, Pascal's triangle, like this:
 
-$$\begin{array}{ccccccccccccccc}
-   &   &   &   &    &    &    &  1 &    &    &    &   &   &   &   \\\\
-   &   &   &   &    &    &  1 &    & 1  &    &    &   &   &   &   \\\\
-   &   &   &   &    &  1 &    &  2 &    &  1 &    &   &   &   &   \\\\
-   &   &   &   &  1 &    &  3 &    &  3 &    &  1 &   &   &   &   \\\\
-   &   &   & 1 &    &  4 &    &  6 &    &  4 &    & 1 &   &   &   \\\\
-   &   & 1 &   &  5 &    & 10 &    & 10 &    &  5 &   & 1 &   &   \\\\
-   & 1 &   & 6 &    & 15 &    & 20 &    & 15 &    & 6 &   & 1 &   \\\\
- 1 &   & 7 &   & 21 &    & 35 &    & 35 &    & 21 &   & 7 &   & 1 \\\\
-   &   &   &   &    &    &    & \ldots
-\end{array}$$
+$$\begin{array}{ccccccccccccccc}    &   &   &   &    &    &    &  1 &    &    &    &   &   &   &   \\\\
+   &   &   &   &    &    &  1 &    & 1  &    &    &   &   &   &   \\\\    &   &   &   &    &  1 &    &  2 &    &  1 &    &   &   &   &   \\\\
+   &   &   &   &  1 &    &  3 &    &  3 &    &  1 &   &   &   &   \\\\    &   &   & 1 &    &  4 &    &  6 &    &  4 &    & 1 &   &   &   \\\\
+   &   & 1 &   &  5 &    & 10 &    & 10 &    &  5 &   & 1 &   &   \\\\    & 1 &   & 6 &    & 15 &    & 20 &    & 15 &    & 6 &   & 1 &   \\\\
+ 1 &   & 7 &   & 21 &    & 35 &    & 35 &    & 21 &   & 7 &   & 1 \\\\ &   &   &   &    &    &    & \ldots \end{array}$$
 
 It can be seen that the first eight rows of Pascal's triangle contain twelve distinct numbers: 1, 2, 3, 4, 5, 6, 7, 10, 15, 20, 21 and 35.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-206-concealed-square.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-206-concealed-square.md
index 596f703da28..a7fbe567fec 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-206-concealed-square.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-206-concealed-square.md
@@ -12,7 +12,7 @@ Find the unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0,
 
 # --hints--
 
-`concealedSquare()` should return `1389019170`.
+`concealedSquare()` sollte `1389019170` zurückgeben.
 
 ```js
 assert.strictEqual(concealedSquare(), 1389019170);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md
index 38925650fad..d67bde9dcaf 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md
@@ -8,35 +8,29 @@ dashedName: problem-207-integer-partition-equations
 
 # --description--
 
-For some positive integers $k$, there exists an integer partition of the form $4^t = 2^t + k$,
+Für einige positive ganze Zahlen $k$ gibt es eine ganzzahlige Partition der Form $4^t = 2^t + k$,
 
-where $4^t$, $2^t$, and $k$ are all positive integers and $t$ is a real number.
+wobei $4^t$, $2^t$ und $k$ alle positive ganze Zahlen sind und $t$ eine reelle Zahl ist.
 
-The first two such partitions are $4^1 = 2^1 + 2$ and $4^{1.584\\,962\\,5\ldots} = 2^{1.584\\,962\\,5\ldots} + 6$.
+Die ersten beiden dieser Partitionen sind $4^1 = 2^1 + 2$ und $4^{1.584\\,962\\,5\ldots} = 2^{1.584\\,962\\,5\ldots}. + 6$.
 
-Partitions where $t$ is also an integer are called perfect. For any $m ≥ 1$ let $P(m)$ be the proportion of such partitions that are perfect with $k ≤ m$.
+Partitionen, bei denen $t$ ebenfalls eine ganze Zahl ist, nennt man perfekt. Für jedes $m ≥ 1$ sei $P(m)$ der Anteil solcher Partitionen, die mit $k ≤ m$ perfekt sind.
 
-Thus $P(6) = \frac{1}{2}$.
+Somit ist $P(6) = \frac{1}{2}$.
 
-In the following table are listed some values of $P(m)$
+In der folgenden Tabelle sind einige Werte von $P(m)$ aufgeführt
 
-$$\begin{align}
-  & P(5) = \frac{1}{1}    \\\\
-  & P(10) = \frac{1}{2}   \\\\
-  & P(15) = \frac{2}{3}   \\\\
-  & P(20) = \frac{1}{2}   \\\\
-  & P(25) = \frac{1}{2}   \\\\
-  & P(30) = \frac{2}{5}   \\\\
-  & \ldots                \\\\
-  & P(180) = \frac{1}{4}  \\\\
-  & P(185) = \frac{3}{13}
-\end{align}$$
+$$\begin{align}   & P(5) = \frac{1}{1}    \\\\
+  & P(10) = \frac{1}{2}   \\\\   & P(15) = \frac{2}{3}   \\\\
+  & P(20) = \frac{1}{2}   \\\\   & P(25) = \frac{1}{2}   \\\\
+  & P(30) = \frac{2}{5}   \\\\   & \ldots                \\\\
+  & P(180) = \frac{1}{4}  \\\\ & P(185) = \frac{3}{13} \end{align}$$
 
-Find the smallest $m$ for which $P(m) &lt; \frac{1}{12\\,345}$
+Finde die kleinste $m$, für die $P(m) &lt; \frac{1}{12\,345}$
 
 # --hints--
 
-`integerPartitionEquations()` should return `44043947822`.
+`integerPartitionEquations()` sollte `44043947822` zurückgeben.
 
 ```js
 assert.strictEqual(integerPartitionEquations(), 44043947822);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-208-robot-walks.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-208-robot-walks.md
index 032ec4cec7e..b23cc34ed50 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-208-robot-walks.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-208-robot-walks.md
@@ -12,7 +12,7 @@ A robot moves in a series of one-fifth circular arcs (72°), with a free choice
 
 One of 70932 possible closed paths of 25 arcs starting northward is
 
-<img class="img-responsive center-block" alt="closed path of 25 arcs, starting northward" src="https://cdn.freecodecamp.org/curriculum/project-euler/robot-walks.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="closed path of 25 arcs, starting northward" src="https://cdn.freecodecamp.org/curriculum/project-euler/robot-walks.gif" style="background-color: white; padding: 10px;" />
 
 Given that the robot starts facing North, how many journeys of 70 arcs in length can it take that return it, after the final arc, to its starting position?
 
@@ -20,7 +20,7 @@ Given that the robot starts facing North, how many journeys of 70 arcs in length
 
 # --hints--
 
-`robotWalks()` should return `331951449665644800`.
+`robotWalks()` sollte `331951449665644800` zurückgeben.
 
 ```js
 assert.strictEqual(robotWalks(), 331951449665644800);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-209-circular-logic.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-209-circular-logic.md
index 7556ba3e54d..1ac1739a85f 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-209-circular-logic.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-209-circular-logic.md
@@ -1,6 +1,6 @@
 ---
 id: 5900f43e1000cf542c50ff4f
-title: 'Problem 209: Circular Logic'
+title: 'Problem 209: Zirkuläre Logik'
 challengeType: 1
 forumTopicId: 301850
 dashedName: problem-209-circular-logic
@@ -11,28 +11,28 @@ dashedName: problem-209-circular-logic
 A $k$-input binary truth table is a map from $k$ input bits (binary digits, 0 [false] or 1 [true]) to 1 output bit. For example, the $2$-input binary truth tables for the logical $AND$ and $XOR$ functions are:
 
 | x | y | x AND y |
-|---|---|---------|
-| 0 | 0 |    0    |
-| 0 | 1 |    0    |
-| 1 | 0 |    0    |
-| 1 | 1 |    1    |
+| - | - | ------- |
+| 0 | 0 | 0       |
+| 0 | 1 | 0       |
+| 1 | 0 | 0       |
+| 1 | 1 | 1       |
 
 | x | y | x XOR y |
-|---|---|---------|
-| 0 | 0 |    0    |
-| 0 | 1 |    1    |
-| 1 | 0 |    1    |
-| 1 | 1 |    0    |
+| - | - | ------- |
+| 0 | 0 | 0       |
+| 0 | 1 | 1       |
+| 1 | 0 | 1       |
+| 1 | 1 | 0       |
 
 How many $6$-input binary truth tables, $τ$, satisfy the formula
 
 $$τ(a, b, c, d, e, f) \\; AND \\; τ(b, c, d, e, f, a \\; XOR \\; (b \\; AND \\; c)) = 0$$
 
-for all $6$-bit inputs ($a$, $b$, $c$, $d$, $e$, $f$)?
+für alle $6$-bit Eingaben ($a$, $b$, $c$, $d$, $e$, $f$)?
 
 # --hints--
 
-`circularLogic()` should return `15964587728784`.
+`circularLogic()` sollte `15964587728784` zurückgeben.
 
 ```js
 assert.strictEqual(circularLogic(), 15964587728784);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md
index 0dbbed2f9b0..64adb9c9e3c 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md
@@ -8,19 +8,19 @@ dashedName: problem-210-obtuse-angled-triangles
 
 # --description--
 
-Consider the set $S(r)$ of points ($x$,$y$) with integer coordinates satisfying $|x| + |y| ≤ r$.
+Man betrachte die Menge $S(r)$ von Punkten ($x$,$y$) mit ganzzahligen Koordinaten, die $|x| + |y| ≤ r$ erfüllen.
 
 Let $O$ be the point (0,0) and $C$ the point ($\frac{r}{4}$,$\frac{r}{4}$).
 
-Let $N(r)$ be the number of points $B$ in $S(r)$, so that the triangle $OBC$ has an obtuse angle, i.e. the largest angle $α$ satisfies $90°&lt;α&lt;180°$.
+Lasse $N(r)$ die Anzahl der Punkte $B$ in $S(r)$ sein, sodass das Dreieck $OBC$ einen stumpfen Winkel hat, d.h. der größte Winkel $α$ erfüllt $90°&lt;α&lt;180°$.
 
-So, for example, $N(4)=24$ and $N(8)=100$.
+So ist zum Beispiel $N(4)=24$ und $N(8)=100$.
 
-What is $N(1\\,000\\,000\\,000)$?
+Was ist $N(1\\.000\.000\.000)$?
 
 # --hints--
 
-`obtuseAngledTriangles()` should return `1598174770174689500`.
+`obtuseAngledTriangles()` sollte `1598174770174689500` zurückgeben.
 
 ```js
 assert.strictEqual(obtuseAngledTriangles(), 1598174770174689500);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md
index 3dddacaadbb..b1dc361be05 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md
@@ -8,7 +8,7 @@ dashedName: problem-211-divisor-square-sum
 
 # --description--
 
-For a positive integer $n$, let $σ_2(n)$ be the sum of the squares of its divisors. For example,
+For a positive integer $n$, let $σ_2(n)$ be the sum of the squares of its divisors. Zum Beispiel,
 
 $$σ_2(10) = 1 + 4 + 25 + 100 = 130$$
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md
index 763042d4950..d8abc30117b 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md
@@ -8,34 +8,30 @@ dashedName: problem-212-combined-volume-of-cuboids
 
 # --description--
 
-An axis-aligned cuboid, specified by parameters $\{ (x_0,y_0,z_0), (dx,dy,dz) \}$, consists of all points ($X$,$Y$,$Z$) such that $x_0 ≤ X ≤ x_0 + dx$, $y_0 ≤ Y ≤ y_0 + dy$ and $z_0 ≤ Z ≤ z_0 + dz$. The volume of the cuboid is the product, $dx × dy × dz$. The combined volume of a collection of cuboids is the volume of their union and will be less than the sum of the individual volumes if any cuboids overlap.
+An axis-aligned cuboid, specified by parameters $\{ (x_0,y_0,z_0), (dx,dy,dz) \}$, consists of all points ($X$,$Y$,$Z$) such that $x_0 ≤ X ≤ x_0 + dx$, $y_0 ≤ Y ≤ y_0 + dy$ and $z_0 ≤ Z ≤ z_0 + dz$. Das Volumen des Quaders ist das Produkt $dx × dy × dz$. Das kombinierte Volumen einer Sammlung von Quadern ist das Volumen ihrer Vereinigung und ist kleiner als die Summe der einzelnen Volumina, wenn sich irgendwelche Quader überschneiden.
 
-Let $C_1, \ldots, C_{50000}$ be a collection of 50000 axis-aligned cuboids such that $C_n$ has parameters
+Lasse $C_1, \ldots, C_{50000}$ eine Sammlung von 50000 achsenausgerichteten Quadern sein, sodass $C_n$ Parameter hat
 
-$$\begin{align}
-  & x_0 = S_{6n - 5} \\; \text{modulo} \\; 10000    \\\\
-  & y_0 = S_{6n - 4} \\; \text{modulo} \\; 10000    \\\\
-  & z_0 = S_{6n - 3} \\; \text{modulo} \\; 10000    \\\\
-  & dx = 1 + (S_{6n - 2} \\; \text{modulo} \\; 399) \\\\
-  & dy = 1 + (S_{6n - 1} \\; \text{modulo} \\; 399) \\\\
-  & dz = 1 + (S_{6n} \\; \text{modulo} \\; 399)     \\\\
-\end{align}$$
+$$\begin{align}   & x_0 = S_{6n - 5} \\; \text{modulo} \\; 10000    \\\\
+  & y_0 = S_{6n - 4} \\; \text{modulo} \\; 10000    \\\\   & z_0 = S_{6n - 3} \\; \text{modulo} \\; 10000    \\\\
+  & dx = 1 + (S_{6n - 2} \\; \text{modulo} \\; 399) \\\\   & dy = 1 + (S_{6n - 1} \\; \text{modulo} \\; 399) \\\\
+  & dz = 1 + (S_{6n} \\; \text{modulo} \\; 399)     \\\\ \end{align}$$
 
-where $S_1, \ldots, S_{300000}$ come from the "Lagged Fibonacci Generator":
+wobei $S_1, \ldots, S_{300000}$ aus dem "Lagged Fibonacci Generator" stammen:
 
-For $1 ≤ k ≤ 55$, $S_k = [100003 - 200003k + 300007k^3] \\; (modulo \\; 1000000)$
+Für $1 ≤ k ≤ 55$, $S_k = [100003 - 200003k + 300007k^3] \\; (modulo \\; 1000000)$
 
-For $56 ≤ k$, $S_k = [S_{k - 24} + S_{k - 55}] \\; (modulo \\; 1000000)$
+Für $56 ≤ k$, $S_k = [S_{k - 24} + S_{k - 55}] \\; (modulo \\; 1000000)$
 
-Thus, $C_1$ has parameters $\{(7,53,183), (94,369,56)\}$, $C_2$ has parameters $\{(2383,3563,5079), (42,212,344)\}$, and so on.
+Somit hat $C_1$ die Parameter $\{(7,53,183), (94,369,56)\}$, $C_2$ die Parameter $\{(2383,3563,5079), (42,212,344)\}$, und so weiter.
 
-The combined volume of the first 100 cuboids, $C_1, \ldots, C_{100}$, is 723581599.
+Das Gesamtvolumen der ersten 100 Quader, $C_1, \ldots, C_{100}$, beträgt 723581599.
 
-What is the combined volume of all 50000 cuboids, $C_1, \ldots, C_{50000}$?
+Wie groß ist das Volumen aller 50000 Quader $C_1, \ldots, C_{50000}$ zusammen?
 
 # --hints--
 
-`combinedValueOfCuboids()` should return `328968937309`.
+`combinedValueOfCuboids()` sollte `328968937309` zurückgeben.
 
 ```js
 assert.strictEqual(combinedValueOfCuboids(), 328968937309);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-214-totient-chains.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-214-totient-chains.md
index 3b9e74edfee..497d541bc82 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-214-totient-chains.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-214-totient-chains.md
@@ -12,16 +12,11 @@ Let $φ$ be Euler's totient function, i.e. for a natural number $n$, $φ(n)$ is
 
 By iterating $φ$, each positive integer generates a decreasing chain of numbers ending in 1. E.g. if we start with 5 the sequence 5,4,2,1 is generated. Here is a listing of all chains with length 4:
 
-$$\begin{align}
-   5,4,2,1 & \\\\
-   7,6,2,1 & \\\\
-   8,4,2,1 & \\\\
-   9,6,2,1 & \\\\
-  10,4,2,1 & \\\\
-  12,4,2,1 & \\\\
-  14,6,2,1 & \\\\
-  18,6,2,1 &
-\end{align}$$
+$$\begin{align}    5,4,2,1 & \\\\
+   7,6,2,1 & \\\\    8,4,2,1 & \\\\
+   9,6,2,1 & \\\\   10,4,2,1 & \\\\
+  12,4,2,1 & \\\\   14,6,2,1 & \\\\
+  18,6,2,1 & \end{align}$$
 
 Only two of these chains start with a prime, their sum is 12.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md
index 2fec8a79dc7..f2065c8821f 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md
@@ -12,7 +12,7 @@ Consider the problem of building a wall out of 2×1 and 3×1 bricks (horizontal
 
 For example, the following 9×3 wall is not acceptable due to the running crack shown in red:
 
-<img class="img-responsive center-block" alt="9x3 wall with one lined up gap between horizontally-adjacent bricks" src="https://cdn.freecodecamp.org/curriculum/project-euler/crack-free-walls.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="9x3 wall with one lined up gap between horizontally-adjacent bricks" src="https://cdn.freecodecamp.org/curriculum/project-euler/crack-free-walls.gif" style="background-color: white; padding: 10px;" />
 
 There are eight ways of forming a crack-free 9×3 wall, written $W(9,3) = 8$.
 
@@ -20,7 +20,7 @@ Calculate $W(32,10)$.
 
 # --hints--
 
-`crackFreeWalls()` should return `806844323190414`.
+`crackFreeWalls()` sollte `806844323190414` zurückgeben.
 
 ```js
 assert.strictEqual(crackFreeWalls(), 806844323190414);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md
index a528915ab9a..ebfeda6ea93 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md
@@ -20,7 +20,7 @@ How many numbers $t(n)$ are prime for $n ≤ 50\\,000\\,000$?
 
 # --hints--
 
-`primalityOfNumbers()` should return `5437849`.
+`primalityOfNumbers()` sollte `5437849` zurückgeben.
 
 ```js
 assert.strictEqual(primalityOfNumbers(), 5437849);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md
index f685410fcd3..1d6d8493583 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md
@@ -16,11 +16,11 @@ Let $T(n)$ be the sum of all balanced numbers less than $10^n$.
 
 Thus: $T(1) = 45$, $T(2) = 540$ and $T(5) = 334\\,795\\,890$.
 
-Find $T(47)\\,mod\\,3^{15}$
+Finde $T(47)\\,mod\\,3^{15}$
 
 # --hints--
 
-`balancedNumbers()` should return `6273134`.
+`balancedNumbers()` sollte `6273134` zurückgeben.
 
 ```js
 assert.strictEqual(balancedNumbers(), 6273134);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md
index c799ec60baf..5a3cb82f84d 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md
@@ -8,30 +8,30 @@ dashedName: problem-220-heighway-dragon
 
 # --description--
 
-Let $D_0$ be the two-letter string "Fa". For $n ≥ 1$, derive $D_n$ from $D_{n - 1}$ by the string-rewriting rules:
+Lasse $D_0$ die zweibuchstabige Zeichenfolge "Fa" sein. For $n ≥ 1$, derive $D_n$ from $D_{n - 1}$ by the string-rewriting rules:
 
 - "a" → "aRbFR"
 - "b" → "LFaLb"
 
-Thus, $D_0$ = "Fa", $D_1$ = "FaRbFR", $D_2$ = "FaRbFRRLFaLbFR", and so on.
+Somit ist $D_0$ = "Fa", $D_1$ = "FaRbFR", $D_2$ = "FaRbFRRLFaLbFR", und so weiter.
 
-These strings can be interpreted as instructions to a computer graphics program, with "F" meaning "draw forward one unit", "L" meaning "turn left 90 degrees", "R" meaning "turn right 90 degrees", and "a" and "b" being ignored. The initial position of the computer cursor is (0,0), pointing up towards (0,1).
+Diese Zeichenketten können als Anweisungen an ein Computergrafikprogramm interpretiert werden, wobei "F" für "eine Einheit vorwärts ziehen", "L" für "90 Grad nach links drehen", "R" für "90 Grad nach rechts drehen" steht und "a" und "b" ignoriert werden. Die Ausgangsposition des Computer-Cursors ist (0,0), er zeigt nach oben in Richtung (0,1).
 
-Then $D_n$ is an exotic drawing known as the Heighway Dragon of order $n$. For example, $D_{10}$ is shown below; counting each "F" as one step, the highlighted spot at (18,16) is the position reached after 500 steps.
+Dann ist $D_n$ eine exotische Zeichnung, bekannt als der Heighway-Drache der Ordnung $n$. Zum Beispiel ist $D_{10}$ unten dargestellt; jedes "F" wird als ein Schritt gezählt, die hervorgehobene Stelle bei (18,16) ist die Position, die nach 500 Schritten erreicht wurde.
 
-<img class="img-responsive center-block" alt="drawing of the Heighway Dragon after 500 steps" src="https://cdn.freecodecamp.org/curriculum/project-euler/heighway-dragon.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="Zeichnung des Heighway Dragon nach 500 Schritten" src="https://cdn.freecodecamp.org/curriculum/project-euler/heighway-dragon.gif" style="background-color: white; padding: 10px;" />
 
-What is the position of the cursor after ${10}^{12}$ steps in $D_{50}$? Give your answer as a string in the form `x,y` with no spaces.
+Wie ist die Position des Cursors nach ${10}^{12}$ Schritten in $D_{50}$? Gib deine Antwort als String in der Form `x,y` ohne Leerzeichen an.
 
 # --hints--
 
-`heighwayDragon()` should return a string.
+`heighwayDragon()` sollte einen String zurückgeben.
 
 ```js
 assert(typeof heighwayDragon() === 'string');
 ```
 
-`heighwayDragon()` should return the string `139776,963904`.
+`heighwayDragon()` sollte den String `139776,963904` zurückgeben.
 
 ```js
 assert.strictEqual(heighwayDragon(), '139776,963904');
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md
index cdb6a9c3977..6832fe18dc4 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md
@@ -8,13 +8,13 @@ dashedName: problem-222-sphere-packing
 
 # --description--
 
-What is the length of the shortest pipe, of internal radius 50mm, that can fully contain 21 balls of radii 30mm, 31mm, ..., 50mm?
+Wie lang ist das kürzeste Rohr mit einem Innenradius von 50 mm, das 21 Kugeln mit den Radien 30 mm, 31 mm, ..., 50 mm vollständig aufnehmen kann?
 
-Give your answer in micrometres (${10}^{-6}$ m) rounded to the nearest integer.
+Gib deine Antwort in Mikrometern (${10}^{-6}$ m) an, gerundet auf die nächste ganze Zahl.
 
 # --hints--
 
-`spherePacking()` should return `1590933`.
+`spherePacking()` sollte `1590933` zurückgeben.
 
 ```js
 assert.strictEqual(spherePacking(), 1590933);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md
index c9f9b44cb3f..96a1fd940ed 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md
@@ -8,13 +8,13 @@ dashedName: problem-224-almost-right-angled-triangles-ii
 
 # --description--
 
-Let us call an integer sided triangle with sides $a ≤ b ≤ c$ barely obtuse if the sides satisfy $a^2 + b^2 = c^2 - 1$.
+Ein ganzseitiges Dreieck mit den Seiten $a ≤ b ≤ c$ sei gerade stumpf, wenn die Seiten $a^2 + b^2 = c^2 - 1$ erfüllen.
 
-How many barely obtuse triangles are there with perimeter $≤ 75\\,000\\,000$?
+Wie viele gerade stumpfe Dreiecke gibt es mit dem Umfang $≤ 75\\.000\\.000$?
 
 # --hints--
 
-`almostRightAngledTrianglesTwo()` should return `4137330`.
+`almostRightAngledTrianglesTwo()` sollte `4137330` zurückgeben.
 
 ```js
 assert.strictEqual(almostRightAngledTrianglesTwo(), 4137330);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md
index 2221b445314..054207382f9 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md
@@ -8,7 +8,7 @@ dashedName: problem-225-tribonacci-non-divisors
 
 # --description--
 
-The sequence 1, 1, 1, 3, 5, 9, 17, 31, 57, 105, 193, 355, 653, 1201 ...
+Die Abfolge 1, 1, 1, 3, 5, 9, 17, 31, 57, 105, 193, 355, 653, 1201 ...
 
 is defined by $T_1 = T_2 = T_3 = 1$ and $T_n = T_{n - 1} + T_{n - 2} + T_{n - 3}$.
 
@@ -18,7 +18,7 @@ Find the ${124}^{\text{th}}$ odd number that does not divide any terms of the ab
 
 # --hints--
 
-`tribonacciNonDivisors()` should return `2009`.
+`tribonacciNonDivisors()` sollte `2009` zurückgeben.
 
 ```js
 assert.strictEqual(tribonacciNonDivisors(), 2009);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md
index fcbb82920e3..3bccd240ed2 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md
@@ -10,10 +10,8 @@ dashedName: problem-228-minkowski-sums
 
 Let $S_n$ be the regular $n$-sided polygon – or shape – whose vertices $v_k (k = 1, 2, \ldots, n)$ have coordinates:
 
-$$\begin{align}
-  & x_k = cos(\frac{2k - 1}{n} × 180°) \\\\
-  & y_k = sin(\frac{2k - 1}{n} × 180°)
-\end{align}$$
+$$\begin{align}   & x_k = cos(\frac{2k - 1}{n} × 180°) \\\\
+  & y_k = sin(\frac{2k - 1}{n} × 180°) \end{align}$$
 
 Each $S_n$ is to be interpreted as a filled shape consisting of all points on the perimeter and in the interior.
 
@@ -21,7 +19,7 @@ The Minkowski sum, $S + T$, of two shapes $S$ and $T$ is the result of adding ev
 
 For example, the sum of $S_3$ and $S_4$ is the six-sided shape shown in pink below:
 
-<img class="img-responsive center-block" alt="image showing S_3, S_4 and S_3 + S_4" src="https://cdn.freecodecamp.org/curriculum/project-euler/minkowski-sums.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="image showing S_3, S_4 and S_3 + S_4" src="https://cdn.freecodecamp.org/curriculum/project-euler/minkowski-sums.png" style="background-color: white; padding: 10px;" />
 
 How many sides does $S_{1864} + S_{1865} + \ldots + S_{1909}$ have?
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md
index 1d295a8968b..3903d30320f 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md
@@ -10,23 +10,17 @@ dashedName: problem-229-four-representations-using-squares
 
 Consider the number 3600. It is very special, because
 
-$$\begin{align}
-  & 3600 = {48}^2 + {36}^2   \\\\
-  & 3600 = {20}^2 + {2×40}^2 \\\\
-  & 3600 = {30}^2 + {3×30}^2 \\\\
-  & 3600 = {45}^2 + {7×15}^2 \\\\
-\end{align}$$
+$$\begin{align}   & 3600 = {48}^2 + {36}^2   \\\\
+  & 3600 = {20}^2 + {2×40}^2 \\\\   & 3600 = {30}^2 + {3×30}^2 \\\\
+  & 3600 = {45}^2 + {7×15}^2 \\\\ \end{align}$$
 
 Similarly, we find that $88201 = {99}^2 + {280}^2 = {287}^2 + 2 × {54}^2 = {283}^2 + 3 × {52}^2 = {197}^2 + 7 × {84}^2$.
 
 In 1747, Euler proved which numbers are representable as a sum of two squares. We are interested in the numbers $n$ which admit representations of all of the following four types:
 
-$$\begin{align}
-  & n = {a_1}^2 + {b_1}^2  \\\\
-  & n = {a_2}^2 + 2{b_2}^2 \\\\
-  & n = {a_3}^2 + 3{b_3}^2 \\\\
-  & n = {a_7}^2 + 7{b_7}^2 \\\\
-\end{align}$$
+$$\begin{align}   & n = {a_1}^2 + {b_1}^2  \\\\
+  & n = {a_2}^2 + 2{b_2}^2 \\\\   & n = {a_3}^2 + 3{b_3}^2 \\\\
+  & n = {a_7}^2 + 7{b_7}^2 \\\\ \end{align}$$
 
 where the $a_k$ and $b_k$ are positive integers.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md
index 92fa72ed62c..bc6cd70f1cc 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md
@@ -18,29 +18,21 @@ Let $A = 1\\,415\\,926\\,535$, $B = 8\\,979\\,323\\,846$. We wish to find $D_{A,
 
 The first few terms of $F_{A,B}$ are:
 
-$$\begin{align}
-  & 1\\,415\\,926\\,535 \\\\
-  & 8\\,979\\,323\\,846 \\\\
-  & 14\\,159\\,265\\,358\\,979\\,323\\,846 \\\\
-  & 897\\,932\\,384\\,614\\,159\\,265\\,358\\,979\\,323\\,846 \\\\
-  & 14\\,159\\,265\\,358\\,979\\,323\\,846\\,897\\,932\\,384\\,614\\,15\color{red}{9}\\,265\\,358\\,979\\,323\\,846
-\end{align}$$
+$$\begin{align}   & 1\\,415\\,926\\,535 \\\\
+  & 8\\,979\\,323\\,846 \\\\   & 14\\,159\\,265\\,358\\,979\\,323\\,846 \\\\
+  & 897\\,932\\,384\\,614\\,159\\,265\\,358\\,979\\,323\\,846 \\\\ & 14\\,159\\,265\\,358\\,979\\,323\\,846\\,897\\,932\\,384\\,614\\,15\color{red}{9}\\,265\\,358\\,979\\,323\\,846 \end{align}$$
 
 Then $D_{A,B}(35)$ is the ${35}^{\text{th}}$ digit in the fifth term, which is 9.
 
 Now we use for $A$ the first 100 digits of $π$ behind the decimal point:
 
-$$\begin{align}
-  & 14\\,159\\,265\\,358\\,979\\,323\\,846\\,264\\,338\\,327\\,950\\,288\\,419\\,716\\,939\\,937\\,510 \\\\
-  & 58\\,209\\,749\\,445\\,923\\,078\\,164\\,062\\,862\\,089\\,986\\,280\\,348\\,253\\,421\\,170\\,679
-\end{align}$$
+$$\begin{align}   & 14\\,159\\,265\\,358\\,979\\,323\\,846\\,264\\,338\\,327\\,950\\,288\\,419\\,716\\,939\\,937\\,510 \\\\
+  & 58\\,209\\,749\\,445\\,923\\,078\\,164\\,062\\,862\\,089\\,986\\,280\\,348\\,253\\,421\\,170\\,679 \end{align}$$
 
 and for $B$ the next hundred digits:
 
-$$\begin{align}
-  & 82\\,148\\,086\\,513\\,282\\,306\\,647\\,093\\,844\\,609\\,550\\,582\\,231\\,725\\,359\\,408\\,128 \\\\
-  & 48\\,111\\,745\\,028\\,410\\,270\\,193\\,852\\,110\\,555\\,964\\,462\\,294\\,895\\,493\\,038\\,196
-\end{align}$$
+$$\begin{align}   & 82\\,148\\,086\\,513\\,282\\,306\\,647\\,093\\,844\\,609\\,550\\,582\\,231\\,725\\,359\\,408\\,128 \\\\
+  & 48\\,111\\,745\\,028\\,410\\,270\\,193\\,852\\,110\\,555\\,964\\,462\\,294\\,895\\,493\\,038\\,196 \end{align}$$
 
 Find $\sum_{n = 0, 1, \ldots, 17} {10}^n × D_{A,B}((127 + 19n) × 7^n)$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md
index f577307aee9..2ae12a0ab04 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md
@@ -10,12 +10,12 @@ dashedName: problem-236-luxury-hampers
 
 Suppliers 'A' and 'B' provided the following numbers of products for the luxury hamper market:
 
-|       Product      | 'A'  | 'B'  |
-|--------------------|------|------|
-|    Beluga Caviar   | 5248 | 640  |
-|    Christmas Cake  | 1312 | 1888 |
-|    Gammon Joint    | 2624 | 3776 |
-|    Vintage Port    | 5760 | 3776 |
+| Product            | 'A'  | 'B'  |
+| ------------------ | ---- | ---- |
+| Beluga Caviar      | 5248 | 640  |
+| Christmas Cake     | 1312 | 1888 |
+| Gammon Joint       | 2624 | 3776 |
+| Vintage Port       | 5760 | 3776 |
 | Champagne Truffles | 3936 | 5664 |
 
 Although the suppliers try very hard to ship their goods in perfect condition, there is inevitably some spoilage - i.e. products gone bad.
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md
index ba032576e8c..ef7c2a30c04 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md
@@ -17,7 +17,7 @@ Let $T(n)$ be the number of tours over a 4 × $n$ playing board such that:
 
 The diagram shows one tour over a 4 × 10 board:
 
-<img class="img-responsive center-block" alt="one tour over 4 x 10 board" src="https://cdn.freecodecamp.org/curriculum/project-euler/tours-on-a-4-x-n-playing-board.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="one tour over 4 x 10 board" src="https://cdn.freecodecamp.org/curriculum/project-euler/tours-on-a-4-x-n-playing-board.gif" style="background-color: white; padding: 10px;" />
 
 $T(10)$ is 2329. What is $T({10}^{12})$ modulo ${10}^8$?
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md
index 52dd3f15143..6f49452d838 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md
@@ -10,10 +10,8 @@ dashedName: problem-238-infinite-string-tour
 
 Create a sequence of numbers using the "Blum Blum Shub" pseudo-random number generator:
 
-$$
-s_0 = 14025256 \\\\
-s_{n + 1} = {s_n}^2 \\; mod \\; 20\\,300\\,713
-$$
+$$ s_0 = 14025256 \\\\
+s_{n + 1} = {s_n}^2 \\; mod \\; 20\\,300\\,713 $$
 
 Concatenate these numbers $s_0s_1s_2\ldots$ to create a string $w$ of infinite length. Then, $w = 14025256741014958470038053646\ldots$
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-240-top-dice.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-240-top-dice.md
index 3a49399014c..97f89f17305 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-240-top-dice.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-240-top-dice.md
@@ -10,12 +10,9 @@ dashedName: problem-240-top-dice
 
 There are 1111 ways in which five 6-sided dice (sides numbered 1 to 6) can be rolled so that the top three sum to 15. Some examples are:
 
-$$\begin{align}
-  & D_1,D_2,D_3,D_4,D_5 = 4,3,6,3,5 \\\\
-  & D_1,D_2,D_3,D_4,D_5 = 4,3,3,5,6 \\\\
-  & D_1,D_2,D_3,D_4,D_5 = 3,3,3,6,6 \\\\
-  & D_1,D_2,D_3,D_4,D_5 = 6,6,3,3,3
-\end{align}$$
+$$\begin{align}   & D_1,D_2,D_3,D_4,D_5 = 4,3,6,3,5 \\\\
+  & D_1,D_2,D_3,D_4,D_5 = 4,3,3,5,6 \\\\   & D_1,D_2,D_3,D_4,D_5 = 3,3,3,6,6 \\\\
+  & D_1,D_2,D_3,D_4,D_5 = 6,6,3,3,3 \end{align}$$
 
 In how many ways can twenty 12-sided dice (sides numbered 1 to 12) be rolled so that the top ten sum to 70?
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-244-sliders.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-244-sliders.md
index dab5b245135..ebe4a76b838 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-244-sliders.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-244-sliders.md
@@ -12,31 +12,21 @@ You probably know the game Fifteen Puzzle. Here, instead of numbered tiles, we h
 
 A move is denoted by the uppercase initial of the direction (Left, Right, Up, Down) in which the tile is slid, e.g. starting from configuration ($S$), by the sequence $LULUR$ we reach the configuration ($E$):
 
-($S$) <img class="img-responsive" alt="configuration S" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliders-1.gif" style="display: inline-block; background-color: white; padding: 10px;">, ($E$) <img class="img-responsive" alt="configuration E" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliders-2.gif" style="display: inline-block; background-color: white; padding: 10px;">
+($S$) <img class="img-responsive" alt="configuration S" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliders-1.gif" style="display: inline-block; background-color: white; padding: 10px;" />, ($E$) <img class="img-responsive" alt="configuration E" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliders-2.gif" style="display: inline-block; background-color: white; padding: 10px;" />
 
 For each path, its checksum is calculated by (pseudocode):
 
-$$\begin{align}
-  & \text{checksum} = 0 \\\\
-  & \text{checksum} = (\text{checksum} × 243 + m_1) \\; \text{mod} \\; 100\\,000\\,007 \\\\
-  & \text{checksum} = (\text{checksum} × 243 + m_2) \\; \text{mod} \\; 100\\,000\\,007 \\\\
-  & \ldots \\\\
-  & \text{checksum} = (\text{checksum} × 243 + m_n) \\; \text{mod} \\; 100\\,000\\,007
-\end{align}$$
+$$\begin{align}   & \text{checksum} = 0 \\\\
+  & \text{checksum} = (\text{checksum} × 243 + m_1) \\; \text{mod} \\; 100\\,000\\,007 \\\\   & \text{checksum} = (\text{checksum} × 243 + m_2) \\; \text{mod} \\; 100\\,000\\,007 \\\\
+  & \ldots \\\\ & \text{checksum} = (\text{checksum} × 243 + m_n) \\; \text{mod} \\; 100\\,000\\,007 \end{align}$$
 
 where $m_k$ is the ASCII value of the $k^{\text{th}}$ letter in the move sequence and the ASCII values for the moves are:
 
-$$\begin{array}{|c|c|}
-  \hline
-  L & 76 \\\\ \hline
-  R & 82 \\\\ \hline
-  U & 85 \\\\ \hline
-  D & 68 \\\\ \hline
-\end{array}$$
+$$\begin{array}{|c|c|} \hline L & 76 \\\\ \hline R & 82 \\\\ \hline U & 85 \\\\ \hline D & 68 \\\\ \hline \end{array}$$
 
 For the sequence $LULUR$ given above, the checksum would be 19761398. Now, starting from configuration ($S$), find all shortest ways to reach configuration ($T$).
 
-($S$) <img class="img-responsive center-block" alt="configuration S" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliders-3.gif" style="display: inline-block; background-color: white; padding: 10px;">, ($T$) <img class="img-responsive center-block" alt="configuration T" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliders-4.gif" style="display: inline-block; background-color: white; padding: 10px;">
+($S$) <img class="img-responsive center-block" alt="configuration S" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliders-3.gif" style="display: inline-block; background-color: white; padding: 10px;" />, ($T$) <img class="img-responsive center-block" alt="configuration T" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliders-4.gif" style="display: inline-block; background-color: white; padding: 10px;" />
 
 What is the sum of all checksums for the paths having the minimal length?
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md
index 14d2bf86670..16c5d89e23b 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md
@@ -14,7 +14,7 @@ Given a circle $c$ with centre $M$ and radius $r$ and a point $G$ such that $d(G
 
 The construction of the points of the ellipse is shown below.
 
-<img class="img-responsive center-block" alt="animation of ellipse construction" src="https://cdn.freecodecamp.org/curriculum/project-euler/tangents-to-an-ellipse-1.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="animation of ellipse construction" src="https://cdn.freecodecamp.org/curriculum/project-euler/tangents-to-an-ellipse-1.gif" style="background-color: white; padding: 10px;" />
 
 Given are the points $M(-2000, 1500)$ and $G(8000, 1500)$.
 
@@ -26,7 +26,7 @@ From a point $P$ outside $e$ the two tangents $t_1$ and $t_2$ to the ellipse are
 
 Let the points where $t_1$ and $t_2$ touch the ellipse be $R$ and $S$.
 
-<img class="img-responsive center-block" alt="circle c with the centre M, radius 15000, and point P outsie of ellipse e; from point P two tangents t_1 and t_2 are drawn to the ellipse, with points touching ellipse are R and S" src="https://cdn.freecodecamp.org/curriculum/project-euler/tangents-to-an-ellipse-2.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="circle c with the centre M, radius 15000, and point P outsie of ellipse e; from point P two tangents t_1 and t_2 are drawn to the ellipse, with points touching ellipse are R and S" src="https://cdn.freecodecamp.org/curriculum/project-euler/tangents-to-an-ellipse-2.gif" style="background-color: white; padding: 10px;" />
 
 For how many lattice points $P$ is angle $RPS$ greater than 45°?
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md
index e9397f355d0..d84036f8701 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md
@@ -16,7 +16,7 @@ Let $S_2$ be the largest square that fits in the remaining area, and so on.
 
 Let the index of $S_n$ be the pair (left, below) indicating the number of squares to the left of $S_n$ and the number of squares below $S_n$.
 
-<img class="img-responsive center-block" alt="diagram with squares under the hyperbola" src="https://cdn.freecodecamp.org/curriculum/project-euler/squares-under-a-hyperbola.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="diagram with squares under the hyperbola" src="https://cdn.freecodecamp.org/curriculum/project-euler/squares-under-a-hyperbola.gif" style="background-color: white; padding: 10px;" />
 
 The diagram shows some such squares labelled by number.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-252-convex-holes.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-252-convex-holes.md
index e275539e846..ec671c067aa 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-252-convex-holes.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-252-convex-holes.md
@@ -12,15 +12,12 @@ Given a set of points on a plane, we define a convex hole to be a convex polygon
 
 As an example, the image below shows a set of twenty points and a few such convex holes. The convex hole shown as a red heptagon has an area equal to 1049694.5 square units, which is the highest possible area for a convex hole on the given set of points.
 
-<img class="img-responsive center-block" alt="set of twenty points and convex holes on plane" src="https://cdn.freecodecamp.org/curriculum/project-euler/convex-holes.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="set of twenty points and convex holes on plane" src="https://cdn.freecodecamp.org/curriculum/project-euler/convex-holes.gif" style="background-color: white; padding: 10px;" />
 
 For our example, we used the first 20 points ($T_{2k − 1}$, $T_{2k}$), for $k = 1, 2, \ldots, 20$, produced with the pseudo-random number generator:
 
-$$\begin{align}
-  S_0 & = 290\\,797 \\\\
-  S_{n+1} & = {S_n}^2 \\; \text{mod} \\; 50\\,515\\,093 \\\\
-  T_n & = (S_n \\; \text{mod} \\; 2000) − 1000
-\end{align}$$
+$$\begin{align}   S_0 & = 290\\,797 \\\\
+  S_{n+1} & = {S_n}^2 \\; \text{mod} \\; 50\\,515\\,093 \\\\ T_n & = (S_n \\; \text{mod} \\; 2000) − 1000 \end{align}$$
 
 i.e. (527, 144), (−488, 732), (−454, −947), …
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-253-tidying-up.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-253-tidying-up.md
index 1afe16e9182..3dbeca51b38 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-253-tidying-up.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-253-tidying-up.md
@@ -17,25 +17,25 @@ As the caterpillar is built up in this way, it forms distinct segments that grad
 For example:
 
 | Piece Placed | Segments So Far |
-| -------------|-----------------|
-|       12     |        1        |
-|        4     |        2        |
-|       29     |        3        |
-|        6     |        4        |
-|       34     |        5        |
-|        5     |        4        |
-|       35     |        4        |
-|       …      |        …        |
+| ------------ | --------------- |
+| 12           | 1               |
+| 4            | 2               |
+| 29           | 3               |
+| 6            | 4               |
+| 34           | 5               |
+| 5            | 4               |
+| 35           | 4               |
+| …            | …               |
 
 Let $M$ be the maximum number of segments encountered during a random tidy-up of the caterpillar. For a caterpillar of ten pieces, the number of possibilities for each $M$ is
 
 | M | Possibilities |
-|---|---------------|
-| 1 |      512      |
-| 2 |     250912    |
-| 3 |    1815264    |
-| 4 |    1418112    |
-| 5 |     144000    |
+| - | ------------- |
+| 1 | 512           |
+| 2 | 250912        |
+| 3 | 1815264       |
+| 4 | 1418112       |
+| 5 | 144000        |
 
 so the most likely value of $M$ is 3 and the average value is $\frac{385\\,643}{113\\,400} = 3.400732$, rounded to six decimal places.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md
index ad8cad6ae02..a1fba0b5f2a 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md
@@ -16,7 +16,7 @@ For this problem, we consider only rectangular rooms with integer dimensions $a$
 
 There is one rule to follow when laying out tatami: there must be no points where corners of four different mats meet. For example, consider the two arrangements below for a 4×4 room:
 
-<img class="img-responsive center-block" alt="two arragements of mats in 4x4 room" src="https://cdn.freecodecamp.org/curriculum/project-euler/tatami-free-rooms.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="two arragements of mats in 4x4 room" src="https://cdn.freecodecamp.org/curriculum/project-euler/tatami-free-rooms.gif" style="background-color: white; padding: 10px;" />
 
 The arrangement on the left is acceptable, whereas the one on the right is not: a red "<strong><span style="color: red;">X</span></strong>" in the middle, marks the point where four tatami meet.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
index 3b4fe6d7708..60864ac52e1 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
@@ -12,7 +12,7 @@ Given is an integer sided triangle $ABC$ with sides $a ≤ b ≤ c$ ($AB = c$, $
 
 The angular bisectors of the triangle intersect the sides at points $E$, $F$ and $G$ (see picture below).
 
-<img class="img-responsive center-block" alt="triangle ABC, with angular bisectors intersecting sides at the points E, F and G" src="https://cdn.freecodecamp.org/curriculum/project-euler/angular-bisectors.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="triangle ABC, with angular bisectors intersecting sides at the points E, F and G" src="https://cdn.freecodecamp.org/curriculum/project-euler/angular-bisectors.gif" style="background-color: white; padding: 10px;" />
 
 The segments $EF$, $EG$ and $FG$ partition the triangle $ABC$ into four smaller triangles: $AEG$, $BFE$, $CGF$ and $EFG$. It can be proven that for each of these four triangles the ratio $\frac{\text{area}(ABC)}{\text{area}(\text{subtriangle})}$ is rational. However, there exist triangles for which some or all of these ratios are integral.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md
index 21b58c42559..af6e1b5aa27 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md
@@ -14,12 +14,9 @@ $${(k - m)}^2 + \ldots + k^2 = {(n + 1)}^2 + \ldots + {(n + m)}^2$$
 
 Some small square-pivots are
 
-$$\begin{align}
-  & \mathbf{4}: 3^2 + \mathbf{4}^2 = 5^2 \\\\
-  & \mathbf{21}: {20}^2 + \mathbf{21}^2 = {29}^2 \\\\
-  & \mathbf{24}: {21}^2 + {22}^2 + {23}^2 + \mathbf{24}^2 = {25}^2 + {26}^2 + {27}^2 \\\\
-  & \mathbf{110}: {108}^2 + {109}^2 + \mathbf{110}^2 = {133}^2 + {134}^2 \\\\
-\end{align}$$
+$$\begin{align}   & \mathbf{4}: 3^2 + \mathbf{4}^2 = 5^2 \\\\
+  & \mathbf{21}: {20}^2 + \mathbf{21}^2 = {29}^2 \\\\   & \mathbf{24}: {21}^2 + {22}^2 + {23}^2 + \mathbf{24}^2 = {25}^2 + {26}^2 + {27}^2 \\\\
+  & \mathbf{110}: {108}^2 + {109}^2 + \mathbf{110}^2 = {133}^2 + {134}^2 \\\\ \end{align}$$
 
 Find the sum of all distinct square-pivots $≤ {10}^{10}$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-265-binary-circles.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-265-binary-circles.md
index 44edab86345..4262d97c798 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-265-binary-circles.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-265-binary-circles.md
@@ -12,7 +12,7 @@ $2^N$ binary digits can be placed in a circle so that all the $N$-digit clockwis
 
 For $N = 3$, two such circular arrangements are possible, ignoring rotations:
 
-<img class="img-responsive center-block" alt="two circular arrangements for N = 3" src="https://cdn.freecodecamp.org/curriculum/project-euler/binary-circles.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="two circular arrangements for N = 3" src="https://cdn.freecodecamp.org/curriculum/project-euler/binary-circles.gif" style="background-color: white; padding: 10px;" />
 
 For the first arrangement, the 3-digit subsequences, in clockwise order, are: 000, 001, 010, 101, 011, 111, 110 and 100.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md
index 553550d2da8..bd295d89e67 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md
@@ -1,8 +1,7 @@
 ---
 id: 5900f4791000cf542c50ff8b
 title: >-
-  Problem 268: Counting numbers with at least four distinct prime factors less
-  than 100
+  Problem 268: Counting numbers with at least four distinct prime factors less than 100
 challengeType: 1
 forumTopicId: 301917
 dashedName: >-
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md
index 0f495dbd40f..0458e257f05 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md
@@ -16,7 +16,7 @@ A square piece of paper with integer dimensions $N×N$ is placed with a corner a
 
 Counting any reflections or rotations as distinct, we call $C(N)$ the number of ways to cut an $N×N$ square. For example, $C(1) = 2$ and $C(2) = 30$ (shown below).
 
-<img class="img-responsive center-block" alt="ways to cut 2x2 square, counting reflections and rotations as distinct" src="https://cdn.freecodecamp.org/curriculum/project-euler/cutting-squares.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="ways to cut 2x2 square, counting reflections and rotations as distinct" src="https://cdn.freecodecamp.org/curriculum/project-euler/cutting-squares.gif" style="background-color: white; padding: 10px;" />
 
 What is $C(30)\bmod {10}^8$ ?
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md
index 0ea3a8e1e3b..decc755a9ee 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md
@@ -17,7 +17,7 @@ Let us define a balanced sculpture of order $n$ as follows:
 
 When counting the sculptures, any arrangements which are simply reflections about the $y$-axis, are <u>not</u> counted as distinct. For example, the 18 balanced sculptures of order 6 are shown below; note that each pair of mirror images (about the $y$-axis) is counted as one sculpture:
 
-<img class="img-responsive center-block" alt="18 balanced sculptures of order 6" src="https://cdn.freecodecamp.org/curriculum/project-euler/balanced-sculptures.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="18 balanced sculptures of order 6" src="https://cdn.freecodecamp.org/curriculum/project-euler/balanced-sculptures.gif" style="background-color: white; padding: 10px;" />
 
 There are 964 balanced sculptures of order 10 and 360505 of order 15.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md
index c99d803a255..60b84a893f8 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md
@@ -14,7 +14,7 @@ Let $f(m,n)$ denote the number of ways you can have toppings on the pizza with $
 
 Thus, for instance, $f(2,1) = 1$, $f(2,2) = f(3,1) = 2$ and $f(3,2) = 16$. $f(3,2)$ is shown below:
 
-<img class="img-responsive center-block" alt="animation with 16 ways to have 3 different toppings on 2 slices each" src="https://cdn.freecodecamp.org/curriculum/project-euler/pizza-toppings.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="animation with 16 ways to have 3 different toppings on 2 slices each" src="https://cdn.freecodecamp.org/curriculum/project-euler/pizza-toppings.gif" style="background-color: white; padding: 10px;" />
 
 Find the sum of all $f(m,n)$ such that $f(m,n) ≤ {10}^{15}$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md
index 1d1cb0426b6..c9cbb75087d 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md
@@ -10,12 +10,8 @@ dashedName: problem-282-the-ackermann-function
 
 For non-negative integers $m$, $n$, the Ackermann function $A(m, n)$ is defined as follows:
 
-$$A(m, n) =
-\begin{cases}
-n + 1                 & \text{if $m = 0$}             \\\\
-A(m - 1, 1)           & \text{if $m > 0$ and $n = 0$} \\\\
-A(m - 1, A(m, n - 1)) & \text{if $m > 0$ and $n > 0$}
-\end{cases}$$
+$$A(m, n) = \begin{cases} n + 1                 & \text{if $m = 0$}             \\\\
+A(m - 1, 1)           & \text{if $m > 0$ and $n = 0$} \\\\ A(m - 1, A(m, n - 1)) & \text{if $m > 0$ and $n > 0$} \end{cases}$$
 
 For example $A(1, 0) = 2$, $A(2, 2) = 7$ and $A(3, 4) = 125$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md
index 0016dd73f29..707a6fa97e7 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md
@@ -19,7 +19,7 @@ The quadtree encoding allows us to describe a $2^N×2^N$ black and white image a
 
 Consider the following 4×4 image (colored marks denote places where a split can occur):
 
-<img class="img-responsive center-block" alt="4x4 image with colored marks denoting place where split can occur" src="https://cdn.freecodecamp.org/curriculum/project-euler/quadtree-encoding-a-simple-compression-algorithm.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="4x4 image with colored marks denoting place where split can occur" src="https://cdn.freecodecamp.org/curriculum/project-euler/quadtree-encoding-a-simple-compression-algorithm.gif" style="background-color: white; padding: 10px;" />
 
 This image can be described by several sequences, for example : "<strong><span style="color: red">0</span></strong><strong><span style="color: blue">0</span></strong>10101010<strong><span style="color: green">0</span></strong>1011111011<strong><span style="color: orange">0</span></strong>10101010", of length 30, or "<strong><span style="color: red">0</span></strong>10<strong><span style="color: green">0</span></strong>101111101110", of length 16, which is the minimal sequence for this image.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md
index fd30ed566d7..cd92a15cd8c 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md
@@ -10,11 +10,8 @@ dashedName: problem-288-an-enormous-factorial
 
 For any prime $p$ the number $N(p,q)$ is defined by $N(p,q) = \sum_{n=0}^q T_n \times p^n$ with $T_n$ generated by the following random number generator:
 
-$$\begin{align}
-  & S_0 = 290797 \\\\
-  & S_{n + 1} = {S_n}^2\bmod 50\\,515\\,093 \\\\
-  & T_n = S_n\bmod p
-\end{align}$$
+$$\begin{align}   & S_0 = 290797 \\\\
+  & S_{n + 1} = {S_n}^2\bmod 50\\,515\\,093 \\\\ & T_n = S_n\bmod p \end{align}$$
 
 Let $Nfac(p,q)$ be the factorial of $N(p,q)$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md
index f45f837d698..e491cab3612 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md
@@ -16,7 +16,7 @@ An Eulerian cycle on $E(m,n)$ is a closed path that passes through each arc exac
 
 The image below shows $E(3,3)$ and an example of an Eulerian non-crossing path.
 
-<img class="img-responsive center-block" alt="Eulerian cycle E(3, 3) and Eulerian non-crossing path" src="https://cdn.freecodecamp.org/curriculum/project-euler/eulerian-cycles.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="Eulerian cycle E(3, 3) and Eulerian non-crossing path" src="https://cdn.freecodecamp.org/curriculum/project-euler/eulerian-cycles.gif" style="background-color: white; padding: 10px;" />
 
 Let $L(m,n)$ be the number of Eulerian non-crossing paths on $E(m,n)$. For example, $L(1,2) = 2$, $L(2,2) = 37$ and $L(3,3) = 104290$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md
index 54ef688e22b..9354ea7c840 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md
@@ -16,15 +16,12 @@ We call the convex area enclosed by two circles a lenticular hole if:
 
 Consider the circles:
 
-$$\begin{align}
-  & C_0: x^2 + y^2 = 25 \\\\
-  & C_1: {(x + 4)}^2 + {(y - 4)}^2 = 1 \\\\
-  & C_2: {(x - 12)}^2 + {(y - 4)}^2 = 65
-\end{align}$$
+$$\begin{align}   & C_0: x^2 + y^2 = 25 \\\\
+  & C_1: {(x + 4)}^2 + {(y - 4)}^2 = 1 \\\\ & C_2: {(x - 12)}^2 + {(y - 4)}^2 = 65 \end{align}$$
 
 The circles $C_0$, $C_1$ and $C_2$ are drawn in the picture below.
 
-<img class="img-responsive center-block" alt="C_0, C_1 and C_2 circles" src="https://cdn.freecodecamp.org/curriculum/project-euler/lenticular-holes.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="C_0, C_1 and C_2 circles" src="https://cdn.freecodecamp.org/curriculum/project-euler/lenticular-holes.gif" style="background-color: white; padding: 10px;" />
 
 $C_0$ and $C_1$ form a lenticular hole, as well as $C_0$ and $C_2$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md
index 806828a809c..660d66eabb4 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md
@@ -12,7 +12,7 @@ Given is an integer sided triangle $ABC$ with $BC ≤ AC ≤ AB$. $k$ is the ang
 
 The intersection of $n$ and $k$ is called $E$.
 
-<img class="img-responsive center-block" alt="triangle ABC, with k - the angular bisector of angle ACB, m - tangent at point C, n - line parallel to m through B, and point E - intersection of k and n" src="https://cdn.freecodecamp.org/curriculum/project-euler/angular-bisector-and-tangent.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="triangle ABC, with k - the angular bisector of angle ACB, m - tangent at point C, n - line parallel to m through B, and point E - intersection of k and n" src="https://cdn.freecodecamp.org/curriculum/project-euler/angular-bisector-and-tangent.gif" style="background-color: white; padding: 10px;" />
 
 How many triangles $ABC$ with a perimeter not exceeding $100\\,000$ exist such that $BE$ has integral length?
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md
index cc787a72fd2..da401b24b95 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md
@@ -15,17 +15,17 @@ Both players start with empty memories. Both players always add new missed numbe
 Example game:
 
 | Turn | Called number | Larry's memory | Larry's score | Robin's memory | Robin's score |
-|------|---------------|---------------:|---------------|----------------|---------------|
-|   1  |       1       |              1 |       0       |              1 |       0       |
-|   2  |       2       |            1,2 |       0       |            1,2 |       0       |
-|   3  |       4       |          1,2,4 |       0       |          1,2,4 |       0       |
-|   4  |       6       |        1,2,4,6 |       0       |        1,2,4,6 |       0       |
-|   5  |       1       |        1,2,4,6 |       1       |        1,2,4,6 |       1       |
-|   6  |       8       |      1,2,4,6,8 |       1       |      1,2,4,6,8 |       1       |
-|   7  |      10       |     1,4,6,8,10 |       1       |     2,4,6,8,10 |       1       |
-|   8  |       2       |     1,2,6,8,10 |       1       |     2,4,6,8,10 |       2       |
-|   9  |       4       |     1,2,4,8,10 |       1       |     2,4,6,8,10 |       3       |
-|  10  |       1       |     1,2,4,8,10 |       2       |     1,4,6,8,10 |       3       |
+| ---- | ------------- | --------------:| ------------- | -------------- | ------------- |
+| 1    | 1             |              1 | 0             | 1              | 0             |
+| 2    | 2             |            1,2 | 0             | 1,2            | 0             |
+| 3    | 4             |          1,2,4 | 0             | 1,2,4          | 0             |
+| 4    | 6             |        1,2,4,6 | 0             | 1,2,4,6        | 0             |
+| 5    | 1             |        1,2,4,6 | 1             | 1,2,4,6        | 1             |
+| 6    | 8             |      1,2,4,6,8 | 1             | 1,2,4,6,8      | 1             |
+| 7    | 10            |     1,4,6,8,10 | 1             | 2,4,6,8,10     | 1             |
+| 8    | 2             |     1,2,6,8,10 | 1             | 2,4,6,8,10     | 2             |
+| 9    | 4             |     1,2,4,8,10 | 1             | 2,4,6,8,10     | 3             |
+| 10   | 1             |     1,2,4,8,10 | 2             | 1,4,6,8,10     | 3             |
 
 Denoting Larry's score by $L$ and Robin's score by $R$, what is the expected value of $|L - R|$ after 50 turns? Give your answer rounded to eight decimal places using the format x.xxxxxxxx .
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md
index f12f154aea6..5bd781949f5 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md
@@ -14,7 +14,7 @@ $A(a, 0)$, $B(b, 0)$, $C(0, c)$ and $D(0, d)$, with $0 &lt; a &lt; b$ and $0 &lt
 
 Point $P$, also with integer coordinates, is chosen on the line $AC$ so that the three triangles $ABP$, $CDP$ and $BDP$ are all similar.
 
-<img class="img-responsive center-block" alt="points A, B, C, D and P creating three triangles: ABP, CDP, and BDP" src="https://cdn.freecodecamp.org/curriculum/project-euler/three-similar-triangles.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="points A, B, C, D and P creating three triangles: ABP, CDP, and BDP" src="https://cdn.freecodecamp.org/curriculum/project-euler/three-similar-triangles.gif" style="background-color: white; padding: 10px;" />
 
 It is easy to prove that the three triangles can be similar, only if $a = c$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-300-protein-folding.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-300-protein-folding.md
index 235032ed349..d5f2020b784 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-300-protein-folding.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-300-protein-folding.md
@@ -20,7 +20,7 @@ Natural proteins are folded in three dimensions of course, but we will only cons
 
 The figure below shows two possible ways that our example protein could be folded (H-H contact points are shown with red dots).
 
-<img class="img-responsive center-block" alt="two possible ways to fold example protein" src="https://cdn.freecodecamp.org/curriculum/project-euler/protein-folding.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="two possible ways to fold example protein" src="https://cdn.freecodecamp.org/curriculum/project-euler/protein-folding.gif" style="background-color: white; padding: 10px;" />
 
 The folding on the left has only six H-H contact points, thus it would never occur naturally. On the other hand, the folding on the right has nine H-H contact points, which is optimal for this string.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md
index 613af2c38fb..3dd4604bc13 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md
@@ -18,7 +18,7 @@ Two players start with a strip of $n$ white squares and they take alternate turn
 - $n = 4$: There are three valid moves for the first player; who is able to win the game by painting the two middle squares.
 - $n = 5$: Four valid moves for the first player (shown below in red); but no matter what the player does, the second player (blue) wins.
 
-<img class="img-responsive center-block" alt="valid starting moves for strip with 5 squares" src="https://cdn.freecodecamp.org/curriculum/project-euler/paper-strip-game.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="valid starting moves for strip with 5 squares" src="https://cdn.freecodecamp.org/curriculum/project-euler/paper-strip-game.gif" style="background-color: white; padding: 10px;" />
 
 So, for $1 ≤ n ≤ 5$, there are 3 values of $n$ for which the first player can force a win.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md
index d7be6f1530d..721b756f533 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md
@@ -10,7 +10,7 @@ dashedName: problem-309-integer-ladders
 
 In the classic "Crossing Ladders" problem, we are given the lengths $x$ and $y$ of two ladders resting on the opposite walls of a narrow, level street. We are also given the height $h$ above the street where the two ladders cross and we are asked to find the width of the street ($w$).
 
-<img class="img-responsive center-block" alt="ladders x and y, crossing at the height h, and resting on opposite walls of the street of width w" src="https://cdn.freecodecamp.org/curriculum/project-euler/integer-ladders.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="ladders x and y, crossing at the height h, and resting on opposite walls of the street of width w" src="https://cdn.freecodecamp.org/curriculum/project-euler/integer-ladders.gif" style="background-color: white; padding: 10px;" />
 
 Here, we are only concerned with instances where all four variables are positive integers. For example, if $x = 70$, $y = 119$ and $h = 30$, we can calculate that $w = 56$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md
index 8337692aa49..97736d98034 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md
@@ -16,7 +16,7 @@ We'll call $ABCD$ a biclinic integral quadrilateral if $AO = CO ≤ BO = DO$.
 
 For example, the following quadrilateral is a biclinic integral quadrilateral: $AB = 19$, $BC = 29$, $CD = 37$, $AD = 43$, $BD = 48$ and $AO = CO = 23$.
 
-<img class="img-responsive center-block" alt="quadrilateral ABCD, with point O, an midpoint of BD" src="https://cdn.freecodecamp.org/curriculum/project-euler/biclinic-integral-quadrilaterals.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="quadrilateral ABCD, with point O, an midpoint of BD" src="https://cdn.freecodecamp.org/curriculum/project-euler/biclinic-integral-quadrilaterals.gif" style="background-color: white; padding: 10px;" />
 
 Let $B(N)$ be the number of distinct biclinic integral quadrilaterals $ABCD$ that satisfy ${AB}^2 + {BC}^2 + {CD}^2 + {AD}^2 ≤ N$. We can verify that $B(10\\,000) = 49$ and $B(1\\,000\\,000) = 38239$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md
index d90dc2ae352..122f28f97dc 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md
@@ -11,20 +11,17 @@ dashedName: problem-312-cyclic-paths-on-sierpiski-graphs
 - A Sierpiński graph of order-1 ($S_1$) is an equilateral triangle.
 - $S_{n + 1}$ is obtained from $S_n$ by positioning three copies of $S_n$ so that every pair of copies has one common corner.
 
-<img class="img-responsive center-block" alt="Sierpinski graphs of order-1 to order-5" src="https://cdn.freecodecamp.org/curriculum/project-euler/cyclic-paths-on-sierpinski-graphs-1.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="Sierpinski graphs of order-1 to order-5" src="https://cdn.freecodecamp.org/curriculum/project-euler/cyclic-paths-on-sierpinski-graphs-1.gif" style="background-color: white; padding: 10px;" />
 
 Let $C(n)$ be the number of cycles that pass exactly once through all the vertices of $S_n$. For example, $C(3) = 8$ because eight such cycles can be drawn on $S_3$, as shown below:
 
-<img class="img-responsive center-block" alt="eight cycles that pass exactly once through all vertices of S_3" src="https://cdn.freecodecamp.org/curriculum/project-euler/cyclic-paths-on-sierpinski-graphs-2.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="eight cycles that pass exactly once through all vertices of S_3" src="https://cdn.freecodecamp.org/curriculum/project-euler/cyclic-paths-on-sierpinski-graphs-2.gif" style="background-color: white; padding: 10px;" />
 
 It can also be verified that:
 
-$$\begin{align}
-  & C(1) = C(2) = 1 \\\\
-  & C(5) = 71\\,328\\,803\\,586\\,048 \\\\
-  & C(10 000)\bmod {10}^8 = 37\\,652\\,224 \\\\
-  & C(10 000)\bmod {13}^8 = 617\\,720\\,485 \\\\
-\end{align}$$
+$$\begin{align}   & C(1) = C(2) = 1 \\\\
+  & C(5) = 71\\,328\\,803\\,586\\,048 \\\\   & C(10 000)\bmod {10}^8 = 37\\,652\\,224 \\\\
+  & C(10 000)\bmod {13}^8 = 617\\,720\\,485 \\\\ \end{align}$$
 
 Find $C(C(C(10\\,000)))\bmod {13}^8$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-313-sliding-game.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-313-sliding-game.md
index 2b62f881a70..8f5726b71f4 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-313-sliding-game.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-313-sliding-game.md
@@ -10,11 +10,11 @@ dashedName: problem-313-sliding-game
 
 In a sliding game a counter may slide horizontally or vertically into an empty space. The objective of the game is to move the red counter from the top left corner of a grid to the bottom right corner; the space always starts in the bottom right corner. For example, the following sequence of pictures show how the game can be completed in five moves on a 2 by 2 grid.
 
-<img class="img-responsive center-block" alt="completing game in five moves on grid 2x2" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliding-game-1.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="completing game in five moves on grid 2x2" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliding-game-1.gif" style="background-color: white; padding: 10px;" />
 
 Let $S(m, n)$ represent the minimum number of moves to complete the game on an $m$ by $n$ grid. For example, it can be verified that $S(5, 4) = 25$.
 
-<img class="img-responsive center-block" alt="initial grid state and final grid state for game on grid 5x4" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliding-game-2.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="initial grid state and final grid state for game on grid 5x4" src="https://cdn.freecodecamp.org/curriculum/project-euler/sliding-game-2.gif" style="background-color: white; padding: 10px;" />
 
 There are exactly 5482 grids for which $S(m, n) = p^2$, where $p &lt; 100$ is prime.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md
index 2266fd3a7af..0bb0e4f9ab9 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md
@@ -18,7 +18,7 @@ Although not allowed, but to get an idea if this is anything better: if you plac
 
 However, if you cut off from the square four triangles with sides 75 m, 75 m and $75\sqrt{2}$ m the total area becomes 238750 $\text{m}^2$ and the perimeter becomes $1400 + 300\sqrt{2}$ m. So this gives an $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio of 130.87, which is significantly better.
 
-<img class="img-responsive center-block" alt="picture showing difference in encosed-area between circle and square with cut off four triangles" src="https://cdn.freecodecamp.org/curriculum/project-euler/the-mouse-on-the-moon.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="picture showing difference in encosed-area between circle and square with cut off four triangles" src="https://cdn.freecodecamp.org/curriculum/project-euler/the-mouse-on-the-moon.gif" style="background-color: white; padding: 10px;" />
 
 Find the maximum $\frac{\text{enclosed-area}}{\text{wall-length}}$ ratio. Give your answer rounded to 8 places behind the decimal point in the form abc.defghijk.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md
index d69506d1b93..59389d4a7ff 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md
@@ -8,7 +8,7 @@ dashedName: problem-315-digital-root-clocks
 
 # --description--
 
-<img class="img-responsive center-block" alt="animation of Sam's and Max's clocks calculating digital roots starting from 137" src="https://cdn.freecodecamp.org/curriculum/project-euler/digital-root-clocks.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="animation of Sam's and Max's clocks calculating digital roots starting from 137" src="https://cdn.freecodecamp.org/curriculum/project-euler/digital-root-clocks.gif" style="background-color: white; padding: 10px;" />
 
 Sam and Max are asked to transform two digital clocks into two "digital root" clocks.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-318-2011-nines.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-318-2011-nines.md
index 0b00fa2d7fc..f4b4f8315b5 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-318-2011-nines.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-318-2011-nines.md
@@ -12,16 +12,11 @@ Consider the real number $\sqrt{2} + \sqrt{3}$.
 
 When we calculate the even powers of $\sqrt{2} + \sqrt{3}$ we get:
 
-$$\begin{align}
-  & {(\sqrt{2} + \sqrt{3})}^2 = 9.898979485566356\ldots \\\\
-  & {(\sqrt{2} + \sqrt{3})}^4 = 97.98979485566356\ldots \\\\
-  & {(\sqrt{2} + \sqrt{3})}^6 = 969.998969071069263\ldots \\\\
-  & {(\sqrt{2} + \sqrt{3})}^8 = 9601.99989585502907\ldots \\\\
-  & {(\sqrt{2} + \sqrt{3})}^{10} = 95049.999989479221\ldots \\\\
-  & {(\sqrt{2} + \sqrt{3})}^{12} = 940897.9999989371855\ldots \\\\
-  & {(\sqrt{2} + \sqrt{3})}^{14} = 9313929.99999989263\ldots \\\\
-  & {(\sqrt{2} + \sqrt{3})}^{16} = 92198401.99999998915\ldots \\\\
-\end{align}$$
+$$\begin{align}   & {(\sqrt{2} + \sqrt{3})}^2 = 9.898979485566356\ldots \\\\
+  & {(\sqrt{2} + \sqrt{3})}^4 = 97.98979485566356\ldots \\\\   & {(\sqrt{2} + \sqrt{3})}^6 = 969.998969071069263\ldots \\\\
+  & {(\sqrt{2} + \sqrt{3})}^8 = 9601.99989585502907\ldots \\\\   & {(\sqrt{2} + \sqrt{3})}^{10} = 95049.999989479221\ldots \\\\
+  & {(\sqrt{2} + \sqrt{3})}^{12} = 940897.9999989371855\ldots \\\\   & {(\sqrt{2} + \sqrt{3})}^{14} = 9313929.99999989263\ldots \\\\
+  & {(\sqrt{2} + \sqrt{3})}^{16} = 92198401.99999998915\ldots \\\\ \end{align}$$
 
 It looks like that the number of consecutive nines at the beginning of the fractional part of these powers is non-decreasing. In fact it can be proven that the fractional part of ${(\sqrt{2} + \sqrt{3})}^{2n}$ approaches 1 for large $n$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md
index 584763b700b..177610fd3c7 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md
@@ -10,11 +10,11 @@ dashedName: problem-321-swapping-counters
 
 A horizontal row comprising of $2n + 1$ squares has $n$ red counters placed at one end and $n$ blue counters at the other end, being separated by a single empty square in the center. For example, when $n = 3$.
 
-<img class="img-responsive center-block" alt="three squares with red and blue counters placed on opposite ends of the row, separated by one empty square" src="https://cdn.freecodecamp.org/curriculum/project-euler/swapping-counters-1.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="three squares with red and blue counters placed on opposite ends of the row, separated by one empty square" src="https://cdn.freecodecamp.org/curriculum/project-euler/swapping-counters-1.gif" style="background-color: white; padding: 10px;" />
 
 A counter can move from one square to the next (slide) or can jump over another counter (hop) as long as the square next to that counter is unoccupied.
 
-<img class="img-responsive center-block" alt="allowed moves of the counter" src="https://cdn.freecodecamp.org/curriculum/project-euler/swapping-counters-2.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="allowed moves of the counter" src="https://cdn.freecodecamp.org/curriculum/project-euler/swapping-counters-2.gif" style="background-color: white; padding: 10px;" />
 
 Let $M(n)$ represent the minimum number of moves/actions to completely reverse the positions of the colored counters; that is, move all the red counters to the right and all the blue counters to the left.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md
index 492e7aa030c..e79296a5f0f 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md
@@ -12,13 +12,9 @@ Let $f(n)$ represent the number of ways one can fill a $3×3×n$ tower with bloc
 
 For example (with $q = 100\\,000\\,007$):
 
-$$\begin{align}
-  & f(2) = 229, \\\\
-  & f(4) = 117\\,805, \\\\
-  & f(10)\bmod q = 96\\,149\\,360, \\\\
-  & f({10}^3)\bmod q = 24\\,806\\,056, \\\\
-  & f({10}^6)\bmod q = 30\\,808\\,124.
-\end{align}$$
+$$\begin{align}   & f(2) = 229, \\\\
+  & f(4) = 117\\,805, \\\\   & f(10)\bmod q = 96\\,149\\,360, \\\\
+  & f({10}^3)\bmod q = 24\\,806\\,056, \\\\ & f({10}^6)\bmod q = 30\\,808\\,124. \end{align}$$
 
 Find $f({10}^{10000})\bmod 100\\,000\\,007$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md
index 96f4d4ab618..d324e96908a 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md
@@ -10,7 +10,7 @@ dashedName: problem-327-rooms-of-doom
 
 A series of three rooms are connected to each other by automatic doors.
 
-<img class="img-responsive center-block" alt="series of three rooms, connected to each other by automatic doors" src="https://cdn.freecodecamp.org/curriculum/project-euler/rooms-of-doom.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="series of three rooms, connected to each other by automatic doors" src="https://cdn.freecodecamp.org/curriculum/project-euler/rooms-of-doom.gif" style="background-color: white; padding: 10px;" />
 
 Each door is operated by a security card. Once you enter a room, the door automatically closes, and that security card cannot be used again. A machine will dispense an unlimited number of cards at the start, but each room (including the starting room) contains scanners. If they detect that you are holding more than three security cards or if they detect an unattended security card on the floor, then all the doors will become permanently locked. However, each room contains a box where you may safely store any number of security cards for use at a later stage.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-330-eulers-number.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-330-eulers-number.md
index 07d3dde36ba..33079aadd49 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-330-eulers-number.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-330-eulers-number.md
@@ -10,20 +10,13 @@ dashedName: problem-330-eulers-number
 
 An infinite sequence of real numbers $a(n)$ is defined for all integers $n$ as follows:
 
-$$ a(n) =
-\begin{cases}
-1                                                       & n < 0 \\\\
-\displaystyle \sum_{i = 1}^{\infty} \frac{a(n - 1)}{i!} & n \ge 0
-\end{cases}
-$$
+$$ a(n) = \begin{cases} 1                                                       & n < 0 \\\\
+\displaystyle \sum_{i = 1}^{\infty} \frac{a(n - 1)}{i!} & n \ge 0 \end{cases} $$
 
 For example,
 
-$$\begin{align}
-  & a(0) = \frac{1}{1!} + \frac{1}{2!} + \frac{1}{3!} + \ldots = e − 1 \\\\
-  & a(1) = \frac{e − 1}{1!} + \frac{1}{2!} + \frac{1}{3!} + \ldots = 2e − 3 \\\\
-  & a(2) = \frac{2e − 3}{1!} + \frac{e − 1}{2!} + \frac{1}{3!} + \ldots = \frac{7}{2} e − 6
-\end{align}$$
+$$\begin{align}   & a(0) = \frac{1}{1!} + \frac{1}{2!} + \frac{1}{3!} + \ldots = e − 1 \\\\
+  & a(1) = \frac{e − 1}{1!} + \frac{1}{2!} + \frac{1}{3!} + \ldots = 2e − 3 \\\\ & a(2) = \frac{2e − 3}{1!} + \frac{e − 1}{2!} + \frac{1}{3!} + \ldots = \frac{7}{2} e − 6 \end{align}$$
 
 with $e = 2.7182818\ldots$ being Euler's constant.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-331-cross-flips.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-331-cross-flips.md
index 03b30215538..84e5ffbdd51 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-331-cross-flips.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-331-cross-flips.md
@@ -12,7 +12,7 @@ N×N disks are placed on a square game board. Each disk has a black side and whi
 
 At each turn, you may choose a disk and flip all the disks in the same row and the same column as this disk: thus $2 × N - 1$ disks are flipped. The game ends when all disks show their white side. The following example shows a game on a 5×5 board.
 
-<img class="img-responsive center-block" alt="animation showing game on 5x5 board" src="https://cdn.freecodecamp.org/curriculum/project-euler/cross-flips.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="animation showing game on 5x5 board" src="https://cdn.freecodecamp.org/curriculum/project-euler/cross-flips.gif" style="background-color: white; padding: 10px;" />
 
 It can be proven that 3 is the minimal number of turns to finish this game.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md
index 45dcdd790ec..54fe2d09a50 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md
@@ -10,7 +10,7 @@ dashedName: problem-332-spherical-triangles
 
 A spherical triangle is a figure formed on the surface of a sphere by three great circular arcs intersecting pairwise in three vertices.
 
-<img class="img-responsive center-block" alt="spherical triangle formed on the surface of a sphere" src="https://cdn.freecodecamp.org/curriculum/project-euler/spherical-triangles.jpg" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="spherical triangle formed on the surface of a sphere" src="https://cdn.freecodecamp.org/curriculum/project-euler/spherical-triangles.jpg" style="background-color: white; padding: 10px;" />
 
 Let $C(r)$ be the sphere with the centre (0,0,0) and radius $r$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-333-special-partitions.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-333-special-partitions.md
index 04f147bf860..27cad095741 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-333-special-partitions.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-333-special-partitions.md
@@ -14,10 +14,8 @@ Let's consider only those such partitions where none of the terms can divide any
 
 Many integers have more than one valid partition, the first being 11 having the following two partitions.
 
-$$\begin{align}
-  & 11 = 2 + 9 = (2^1 \times 3^0 + 2^0 \times 3^2) \\\\
-  & 11 = 8 + 3 = (2^3 \times 3^0 + 2^0 \times 3^1)
-\end{align}$$
+$$\begin{align}   & 11 = 2 + 9 = (2^1 \times 3^0 + 2^0 \times 3^2) \\\\
+  & 11 = 8 + 3 = (2^3 \times 3^0 + 2^0 \times 3^1) \end{align}$$
 
 Let's define $P(n)$ as the number of valid partitions of $n$. For example, $P(11) = 2$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md
index 44541830f9b..d8be81c5efa 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md
@@ -12,19 +12,14 @@ In Plato's heaven, there exist an infinite number of bowls in a straight line. E
 
 For example, consider two adjacent bowls containing 2 and 3 beans respectively, all other bowls being empty. The following eight moves will finish the game:
 
-<img class="img-responsive center-block" alt="animation of game when two adjacent bowls contains 2 and 3 beans respectivelly" src="https://cdn.freecodecamp.org/curriculum/project-euler/spilling-the-beans.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="animation of game when two adjacent bowls contains 2 and 3 beans respectivelly" src="https://cdn.freecodecamp.org/curriculum/project-euler/spilling-the-beans.gif" style="background-color: white; padding: 10px;" />
 
 You are given the following sequences:
 
-$$\begin{align}
-  & t_0 = 123456, \\\\
-  & t_i = \begin{cases}
-         \frac{t_{i - 1}}{2},               & \text{if $t_{i - 1}$ is even} \\\\
-         \left\lfloor\frac{t_{i - 1}}{2}\right\rfloor \oplus 926252, & \text{if $t_{i - 1}$ is odd}
-         \end{cases} \\\\
-         & \qquad \text{where $⌊x⌋$ is the floor function and $\oplus$ is the bitwise XOR operator.} \\\\
-  & b_i = (t_i\bmod 2^{11}) + 1.
-\end{align}$$
+$$\begin{align}   & t_0 = 123456, \\\\
+  & t_i = \begin{cases}          \frac{t_{i - 1}}{2},               & \text{if $t_{i - 1}$ is even} \\\\
+         \left\lfloor\frac{t_{i - 1}}{2}\right\rfloor \oplus 926252, & \text{if $t_{i - 1}$ is odd}          \end{cases} \\\\
+         & \qquad \text{where $⌊x⌋$ is the floor function and $\oplus$ is the bitwise XOR operator.} \\\\ & b_i = (t_i\bmod 2^{11}) + 1. \end{align}$$
 
 The first two terms of the last sequence are $b_1 = 289$ and $b_2 = 145$. If we start with $b_1$ and $b_2$ beans in two adjacent bowls, 3419100 moves would be required to finish the game.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md
index b871f96d6c9..c1b35177c9b 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md
@@ -10,7 +10,7 @@ dashedName: problem-335-gathering-the-beans
 
 Whenever Peter feels bored, he places some bowls, containing one bean each, in a circle. After this, he takes all the beans out of a certain bowl and drops them one by one in the bowls going clockwise. He repeats this, starting from the bowl he dropped the last bean in, until the initial situation appears again. For example with 5 bowls he acts as follows:
 
-<img class="img-responsive center-block" alt="animation of moving beans in 5 bowls" src="https://cdn.freecodecamp.org/curriculum/project-euler/gathering-the-beans.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="animation of moving beans in 5 bowls" src="https://cdn.freecodecamp.org/curriculum/project-euler/gathering-the-beans.gif" style="background-color: white; padding: 10px;" />
 
 So with 5 bowls it takes Peter 15 moves to return to the initial situation.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md
index dc3c704a151..c5df56c3d7b 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md
@@ -18,7 +18,7 @@ However, Simple Simon, the train driver, is not known for his efficiency, so he
 
 Using four carriages, the worst possible arrangements for Simon, which we shall call maximix arrangements, are $DACB$ and $DBAC$; each requiring him five rotations (although, using the most efficient approach, they could be solved using just three rotations). The process he uses for $DACB$ is shown below.
 
-<img class="img-responsive center-block" alt="five rotations for maximix arrangement DACB" src="https://cdn.freecodecamp.org/curriculum/project-euler/maximix-arrangements.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="five rotations for maximix arrangement DACB" src="https://cdn.freecodecamp.org/curriculum/project-euler/maximix-arrangements.gif" style="background-color: white; padding: 10px;" />
 
 It can be verified that there are 24 maximix arrangements for six carriages, of which the tenth lexicographic maximix arrangement is $DFAECB$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md
index c0c2bbc8beb..9a2143b65fd 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md
@@ -14,7 +14,7 @@ When we cut the sheet along the grid lines into two pieces and rearrange those p
 
 For example, from a sheet with dimensions 9 × 4, we can make rectangles with dimensions 18 × 2, 12 × 3 and 6 × 6 by cutting and rearranging as below:
 
-<img class="img-responsive center-block" alt="sheet with 9 x 4 dimensions cut in three different ways to make rectangles with 18 x 2, 12 x 3 and 6 x 6 dimensions" src="https://cdn.freecodecamp.org/curriculum/project-euler/cutting-rectangular-grid-paper.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="sheet with 9 x 4 dimensions cut in three different ways to make rectangles with 18 x 2, 12 x 3 and 6 x 6 dimensions" src="https://cdn.freecodecamp.org/curriculum/project-euler/cutting-rectangular-grid-paper.gif" style="background-color: white; padding: 10px;" />
 
 Similarly, from a sheet with dimensions 9 × 8, we can make rectangles with dimensions 18 × 4 and 12 × 6.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-340-crazy-function.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-340-crazy-function.md
index eeee6c9c868..72da02c1095 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-340-crazy-function.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-340-crazy-function.md
@@ -10,10 +10,8 @@ dashedName: problem-340-crazy-function
 
 For fixed integers $a$, $b$, $c$, define the crazy function $F(n)$ as follows:
 
-$$\begin{align}
-  & F(n) = n - c \\;\text{ for all } n > b \\\\
-  & F(n) = F(a + F(a + F(a + F(a + n)))) \\;\text{ for all } n ≤ b.
-\end{align}$$
+$$\begin{align}   & F(n) = n - c \\;\text{ for all } n > b \\\\
+  & F(n) = F(a + F(a + F(a + F(a + n)))) \\;\text{ for all } n ≤ b. \end{align}$$
 
 Also, define $S(a, b, c) = \displaystyle\sum_{n = 0}^b F(n)$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md
index 989907ccbb4..f3ebbd9cdd0 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md
@@ -10,10 +10,8 @@ dashedName: problem-341-golombs-self-describing-sequence
 
 The Golomb's self-describing sequence ($G(n)$) is the only nondecreasing sequence of natural numbers such that $n$ appears exactly $G(n)$ times in the sequence. The values of $G(n)$ for the first few $n$ are
 
-$$\begin{array}{c}
-  n    & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 & 11 & 12 & 13 & 14 & 15 & \ldots \\\\
-  G(n) & 1 & 2 & 2 & 3 & 3 & 4 & 4 & 4 & 5 & 5  &  5 &  6 &  6 &  6 &  6 & \ldots
-\end{array}$$
+$$\begin{array}{c}   n    & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 & 11 & 12 & 13 & 14 & 15 & \ldots \\\\
+  G(n) & 1 & 2 & 2 & 3 & 3 & 4 & 4 & 4 & 5 & 5  &  5 &  6 &  6 &  6 &  6 & \ldots \end{array}$$
 
 You are given that $G({10}^3) = 86$, $G({10}^6) = 6137$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
index 7e8cf816e6b..0f9fcc5f2e6 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
@@ -18,7 +18,7 @@ Alternatively, the player can choose to make the special move of pocketing the l
 
 The winner is the player who pockets the silver dollar.
 
-<img class="img-responsive center-block" alt="silver dollar game" src="https://cdn.freecodecamp.org/curriculum/project-euler/silver-dollar-game.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="silver dollar game" src="https://cdn.freecodecamp.org/curriculum/project-euler/silver-dollar-game.gif" style="background-color: white; padding: 10px;" />
 
 A winning configuration is an arrangement of coins on the strip where the first player can force a win no matter what the second player does.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md
index cf884f8734e..19aa26fd74f 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md
@@ -12,33 +12,20 @@ We define the Matrix Sum of a matrix as the maximum sum of matrix elements with
 
 For example, the Matrix Sum of the matrix below equals $3315 ( = 863 + 383 + 343 + 959 + 767)$:
 
-$$\begin{array}{rrrrr}
-    7                &  53                & 183                & 439                & \color{lime}{863} \\\\
-  497                & \color{lime}{383} & 563                &  79                & 973 \\\\
-  287                &  63                & \color{lime}{343} & 169                & 583 \\\\
-  627                & 343                & 773                & \color{lime}{959} & 943 \\\\
-  \color{lime}{767} & 473                & 103                & 699                & 303
-\end{array}$$
+$$\begin{array}{rrrrr}     7                &  53                & 183                & 439                & \color{lime}{863} \\\\
+  497                & \color{lime}{383} & 563                &  79                & 973 \\\\   287                &  63                & \color{lime}{343} & 169                & 583 \\\\
+  627                & 343                & 773                & \color{lime}{959} & 943 \\\\ \color{lime}{767} & 473                & 103                & 699                & 303 \end{array}$$
 
 Find the Matrix Sum of:
 
-$$\\begin{array}{r}
-    7 &  53 & 183 & 439 & 863 & 497 & 383 & 563 &  79 & 973 & 287 &  63 & 343 & 169 & 583 \\\\
-  627 & 343 & 773 & 959 & 943 & 767 & 473 & 103 & 699 & 303 & 957 & 703 & 583 & 639 & 913 \\\\
-  447 & 283 & 463 &  29 &  23 & 487 & 463 & 993 & 119 & 883 & 327 & 493 & 423 & 159 & 743 \\\\
-  217 & 623 &   3 & 399 & 853 & 407 & 103 & 983 &  89 & 463 & 290 & 516 & 212 & 462 & 350 \\\\
-  960 & 376 & 682 & 962 & 300 & 780 & 486 & 502 & 912 & 800 & 250 & 346 & 172 & 812 & 350 \\\\
-  870 & 456 & 192 & 162 & 593 & 473 & 915 &  45 & 989 & 873 & 823 & 965 & 425 & 329 & 803 \\\\
-  973 & 965 & 905 & 919 & 133 & 673 & 665 & 235 & 509 & 613 & 673 & 815 & 165 & 992 & 326 \\\\
-  322 & 148 & 972 & 962 & 286 & 255 & 941 & 541 & 265 & 323 & 925 & 281 & 601 &  95 & 973 \\\\
-  445 & 721 &  11 & 525 & 473 &  65 & 511 & 164 & 138 & 672 &  18 & 428 & 154 & 448 & 848 \\\\
-  414 & 456 & 310 & 312 & 798 & 104 & 566 & 520 & 302 & 248 & 694 & 976 & 430 & 392 & 198 \\\\
-  184 & 829 & 373 & 181 & 631 & 101 & 969 & 613 & 840 & 740 & 778 & 458 & 284 & 760 & 390 \\\\
-  821 & 461 & 843 & 513 &  17 & 901 & 711 & 993 & 293 & 157 & 274 &  94 & 192 & 156 & 574 \\\\
-   34 & 124 &   4 & 878 & 450 & 476 & 712 & 914 & 838 & 669 & 875 & 299 & 823 & 329 & 699 \\\\
-  815 & 559 & 813 & 459 & 522 & 788 & 168 & 586 & 966 & 232 & 308 & 833 & 251 & 631 & 107 \\\\
-  813 & 883 & 451 & 509 & 615 &  77 & 281 & 613 & 459 & 205 & 380 & 274 & 302 &  35 & 805
-\end{array}$$
+$$\\begin{array}{r}     7 &  53 & 183 & 439 & 863 & 497 & 383 & 563 &  79 & 973 & 287 &  63 & 343 & 169 & 583 \\\\
+  627 & 343 & 773 & 959 & 943 & 767 & 473 & 103 & 699 & 303 & 957 & 703 & 583 & 639 & 913 \\\\   447 & 283 & 463 &  29 &  23 & 487 & 463 & 993 & 119 & 883 & 327 & 493 & 423 & 159 & 743 \\\\
+  217 & 623 &   3 & 399 & 853 & 407 & 103 & 983 &  89 & 463 & 290 & 516 & 212 & 462 & 350 \\\\   960 & 376 & 682 & 962 & 300 & 780 & 486 & 502 & 912 & 800 & 250 & 346 & 172 & 812 & 350 \\\\
+  870 & 456 & 192 & 162 & 593 & 473 & 915 &  45 & 989 & 873 & 823 & 965 & 425 & 329 & 803 \\\\   973 & 965 & 905 & 919 & 133 & 673 & 665 & 235 & 509 & 613 & 673 & 815 & 165 & 992 & 326 \\\\
+  322 & 148 & 972 & 962 & 286 & 255 & 941 & 541 & 265 & 323 & 925 & 281 & 601 &  95 & 973 \\\\   445 & 721 &  11 & 525 & 473 &  65 & 511 & 164 & 138 & 672 &  18 & 428 & 154 & 448 & 848 \\\\
+  414 & 456 & 310 & 312 & 798 & 104 & 566 & 520 & 302 & 248 & 694 & 976 & 430 & 392 & 198 \\\\   184 & 829 & 373 & 181 & 631 & 101 & 969 & 613 & 840 & 740 & 778 & 458 & 284 & 760 & 390 \\\\
+  821 & 461 & 843 & 513 &  17 & 901 & 711 & 993 & 293 & 157 & 274 &  94 & 192 & 156 & 574 \\\\    34 & 124 &   4 & 878 & 450 & 476 & 712 & 914 & 838 & 669 & 875 & 299 & 823 & 329 & 699 \\\\
+  815 & 559 & 813 & 459 & 522 & 788 & 168 & 586 & 966 & 232 & 308 & 833 & 251 & 631 & 107 \\\\ 813 & 883 & 451 & 509 & 615 &  77 & 281 & 613 & 459 & 205 & 380 & 274 & 302 &  35 & 805 \end{array}$$
 
 # --hints--
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md
index c2447c6c908..8e69b16ca7a 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md
@@ -14,12 +14,9 @@ Consider the palindromic numbers that can be expressed as the sum of a square an
 
 For example, 5229225 is a palindromic number and it can be expressed in exactly 4 different ways:
 
-$$\begin{align}
-  & {2285}^2 + {20}^3 \\\\
-  & {2223}^2 + {66}^3 \\\\
-  & {1810}^2 + {125}^3 \\\\
-  & {1197}^2 + {156}^3
-\end{align}$$
+$$\begin{align}   & {2285}^2 + {20}^3 \\\\
+  & {2223}^2 + {66}^3 \\\\   & {1810}^2 + {125}^3 \\\\
+  & {1197}^2 + {156}^3 \end{align}$$
 
 Find the sum of the five smallest such palindromic numbers.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-35-circular-primes.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-35-circular-primes.md
index f87d29775fc..aaae9562bb0 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-35-circular-primes.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-35-circular-primes.md
@@ -14,7 +14,7 @@ There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73
 
 How many circular primes are there below `n`, whereas 100 ≤ `n` ≤ 1000000?
 
-**Note:**  
+**Note:**
 
 Circular primes individual rotation can exceed `n`.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md
index c5f4e5a2288..b40eb3cd67a 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md
@@ -16,12 +16,9 @@ The least common multiple, or $lcm$, of a list is the smallest natural number di
 
 Let $f(G, L, N)$ be the number of lists of size $N$ with $gcd ≥ G$ and $lcm ≤ L$. For example:
 
-$$\begin{align}
-  & f(10, 100, 1) = 91 \\\\
-  & f(10, 100, 2) = 327 \\\\
-  & f(10, 100, 3) = 1135 \\\\
-  & f(10, 100, 1000)\bmod {101}^4 = 3\\,286\\,053
-\end{align}$$
+$$\begin{align}   & f(10, 100, 1) = 91 \\\\
+  & f(10, 100, 2) = 327 \\\\   & f(10, 100, 3) = 1135 \\\\
+  & f(10, 100, 1000)\bmod {101}^4 = 3\\,286\\,053 \end{align}$$
 
 Find $f({10}^6, {10}^{12}, {10}^{18})\bmod {101}^4$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md
index 75c78da3044..fa6811e9185 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md
@@ -10,7 +10,7 @@ dashedName: problem-351-hexagonal-orchards
 
 A hexagonal orchard of order $n$ is a triangular lattice made up of points within a regular hexagon with side $n$. The following is an example of a hexagonal orchard of order 5:
 
-<img class="img-responsive center-block" alt="hexagonal orchard of order 5, with highlighted in green points, which are hidden from the center by a point closer to it" src="https://cdn.freecodecamp.org/curriculum/project-euler/hexagonal-orchards.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="hexagonal orchard of order 5, with highlighted in green points, which are hidden from the center by a point closer to it" src="https://cdn.freecodecamp.org/curriculum/project-euler/hexagonal-orchards.png" style="background-color: white; padding: 10px;" />
 
 Highlighted in green are the points which are hidden from the center by a point closer to it. It can be seen that for a hexagonal orchard of order 5, 30 points are hidden from the center.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md
index f60039e5fdd..f7d023146ca 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md
@@ -10,7 +10,7 @@ dashedName: problem-354-distances-in-a-bees-honeycomb
 
 Consider a honey bee's honeycomb where each cell is a perfect regular hexagon with side length 1.
 
-<img class="img-responsive center-block" alt="honeycomb with hexagon sides of length 1" src="https://cdn.freecodecamp.org/curriculum/project-euler/distances-in-a-bees-honeycomb.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="honeycomb with hexagon sides of length 1" src="https://cdn.freecodecamp.org/curriculum/project-euler/distances-in-a-bees-honeycomb.png" style="background-color: white; padding: 10px;" />
 
 One particular cell is occupied by the queen bee. For a positive real number $L$, let $B(L)$ count the cells with distance $L$ from the queen bee cell (all distances are measured from centre to centre); you may assume that the honeycomb is large enough to accommodate for any distance we wish to consider.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md
index b298050648d..9a7f94d3bff 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md
@@ -14,24 +14,16 @@ When it is multiplied by 1, 2, 3, 4, ... $n$, all the products have exactly the
 
 The smallest cyclic number is the 6-digit number 142857:
 
-$$\begin{align}
-  & 142857 × 1 = 142857 \\\\
-  & 142857 × 2 = 285714 \\\\
-  & 142857 × 3 = 428571 \\\\
-  & 142857 × 4 = 571428 \\\\
-  & 142857 × 5 = 714285 \\\\
-  & 142857 × 6 = 857142
-\end{align}$$
+$$\begin{align}   & 142857 × 1 = 142857 \\\\
+  & 142857 × 2 = 285714 \\\\   & 142857 × 3 = 428571 \\\\
+  & 142857 × 4 = 571428 \\\\   & 142857 × 5 = 714285 \\\\
+  & 142857 × 6 = 857142 \end{align}$$
 
 The next cyclic number is 0588235294117647 with 16 digits:
 
-$$\begin{align}
-  & 0588235294117647 × 1 = 0588235294117647 \\\\
-  & 0588235294117647 × 2 = 1176470588235294 \\\\
-  & 0588235294117647 × 3 = 1764705882352941 \\\\
-  & \ldots \\\\
-  & 0588235294117647 × 16 = 9411764705882352
-\end{align}$$
+$$\begin{align}   & 0588235294117647 × 1 = 0588235294117647 \\\\
+  & 0588235294117647 × 2 = 1176470588235294 \\\\   & 0588235294117647 × 3 = 1764705882352941 \\\\
+  & \ldots \\\\ & 0588235294117647 × 16 = 9411764705882352 \end{align}$$
 
 Note that for cyclic numbers, leading zeros are important.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md
index 1fd01d0a3da..0cfd6a75f09 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md
@@ -27,14 +27,10 @@ Eventually, every person in the line gets a room in the hotel.
 
 Define $P(f, r)$ to be $n$ if person $n$ occupies room $r$ in floor $f$, and 0 if no person occupies the room. Here are a few examples:
 
-$$\begin{align}
-  & P(1, 1) = 1 \\\\
-  & P(1, 2) = 3 \\\\
-  & P(2, 1) = 2 \\\\
-  & P(10, 20) = 440 \\\\
-  & P(25, 75) = 4863 \\\\
-  & P(99, 100) = 19454
-\end{align}$$
+$$\begin{align}   & P(1, 1) = 1 \\\\
+  & P(1, 2) = 3 \\\\   & P(2, 1) = 2 \\\\
+  & P(10, 20) = 440 \\\\   & P(25, 75) = 4863 \\\\
+  & P(99, 100) = 19454 \end{align}$$
 
 Find the sum of all $P(f, r)$ for all positive $f$ and $r$ such that $f × r = 71\\,328\\,803\\,586\\,048$ and give the last 8 digits as your answer.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md
index 60d72bff3e9..efae1fb220c 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md
@@ -20,10 +20,8 @@ We define $\\{A_n\\}$ as the sorted sequence of integers such that the binary ex
 
 The first several terms of $A_n$ are given as follows:
 
-$$\begin{array}{cr}
-  n   & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 &  8 &  9 & 10 & 11 & 12 & \ldots \\\\
-  A_n & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 9 & 10 & 11 & 12 & 13 & 18 & \ldots
-\end{array}$$
+$$\begin{array}{cr}   n   & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 &  8 &  9 & 10 & 11 & 12 & \ldots \\\\
+  A_n & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 9 & 10 & 11 & 12 & 13 & 18 & \ldots \end{array}$$
 
 We can also verify that $A_{100} = 3251$ and $A_{1000} = 80\\,852\\,364\\,498$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md
index 78c4885b0ec..df13df6a0c5 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md
@@ -12,7 +12,7 @@ A cubic Bézier curve is defined by four points: $P_0$, $P_1$, $P_2$ and $P_3$.
 
 The curve is constructed as follows:
 
-<img class="img-responsive center-block" alt="construction of Bézier curve" src="https://cdn.freecodecamp.org/curriculum/project-euler/bzier-curves.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="construction of Bézier curve" src="https://cdn.freecodecamp.org/curriculum/project-euler/bzier-curves.png" style="background-color: white; padding: 10px;" />
 
 On the segments $P_0P_1$, $P_1P_2$ and $P_2P_3$ the points $Q_0$,$Q_1$ and $Q_2$ are drawn such that $\frac{P_0Q_0}{P_0P_1} = \frac{P_1Q_1}{P_1P_2} = \frac{P_2Q_2}{P_2P_3} = t$, with $t$ in [0,1].
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md
index 3ee50dbdde7..83f8f7ec5d4 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md
@@ -16,7 +16,7 @@ There are $N$ seats in a row. $N$ people come after each other to fill the seats
 
 Let $T(N)$ be the number of possibilities that $N$ seats are occupied by $N$ people with the given rules. The following figure shows $T(4) = 8$.
 
-<img class="img-responsive center-block" alt="eight ways for N seats to be occupied by N people" src="https://cdn.freecodecamp.org/curriculum/project-euler/comfortable-distance.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="eight ways for N seats to be occupied by N people" src="https://cdn.freecodecamp.org/curriculum/project-euler/comfortable-distance.gif" style="background-color: white; padding: 10px;" />
 
 We can verify that $T(10) = 61\\,632$ and $T(1\\,000)\bmod 100\\,000\\,007 = 47\\,255\\,094$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md
index 2b3b9c73114..082d94ef69c 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md
@@ -10,10 +10,8 @@ dashedName: problem-375-minimum-of-subsequences
 
 Let $S_n$ be an integer sequence produced with the following pseudo-random number generator:
 
-$$\begin{align}
-        S_0 & = 290\\,797 \\\\
-  S_{n + 1} & = {S_n}^2\bmod 50\\,515\\,093
-\end{align}$$
+$$\begin{align}         S_0 & = 290\\,797 \\\\
+  S_{n + 1} & = {S_n}^2\bmod 50\\,515\\,093 \end{align}$$
 
 Let $A(i, j)$ be the minimum of the numbers $S_i, S_{i + 1}, \ldots, S_j$ for $i ≤ j$. Let $M(N) = \sum A(i, j)$ for $1 ≤ i ≤ j ≤ N$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.md
index a6c6ffb8fbc..344a1e84e90 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.md
@@ -10,10 +10,8 @@ dashedName: problem-376-nontransitive-sets-of-dice
 
 Consider the following set of dice with nonstandard pips:
 
-$$\begin{array}{}
-  \text{Die A: } & 1 & 4 & 4 & 4 & 4 & 4 \\\\
-  \text{Die B: } & 2 & 2 & 2 & 5 & 5 & 5 \\\\
-  \text{Die C: } & 3 & 3 & 3 & 3 & 3 & 6 \\\\
+$$\begin{array}{}   \text{Die A: } & 1 & 4 & 4 & 4 & 4 & 4 \\\\
+  \text{Die B: } & 2 & 2 & 2 & 5 & 5 & 5 \\\\   \text{Die C: } & 3 & 3 & 3 & 3 & 3 & 6 \\\\
 \end{array}$$
 
 A game is played by two players picking a die in turn and rolling it. The player who rolls the highest value wins.
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md
index 5ee26df1f5e..a1190e84f39 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md
@@ -10,10 +10,8 @@ dashedName: problem-38-pandigital-multiples
 
 Take the number 192 and multiply it by each of 1, 2, and 3:
 
-$$\begin{align}
-  192 × 1 = 192\\\\
-  192 × 2 = 384\\\\
-  192 × 3 = 576\\\\
+$$\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).
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md
index e3d7c665fac..15ae5170a74 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md
@@ -10,7 +10,7 @@ dashedName: problem-380-amazing-mazes
 
 An $m×n$ maze is an $m×n$ rectangular grid with walls placed between grid cells such that there is exactly one path from the top-left square to any other square. The following are examples of a 9×12 maze and a 15×20 maze:
 
-<img class="img-responsive center-block" alt="9x12 maze and 15x20 maze" src="https://cdn.freecodecamp.org/curriculum/project-euler/amazing-mazes.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="9x12 maze and 15x20 maze" src="https://cdn.freecodecamp.org/curriculum/project-euler/amazing-mazes.gif" style="background-color: white; padding: 10px;" />
 
 Let $C(m, n)$ be the number of distinct $m×n$ mazes. Mazes which can be formed by rotation and reflection from another maze are considered distinct.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md
index d1dd089852a..9f11652c82f 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md
@@ -18,12 +18,9 @@ Also consider the summatory sequence of $b(n)$: $s(n) = \displaystyle\sum_{i = 0
 
 The first couple of values of these sequences are:
 
-$$\begin{array}{lr}
-  n    & 0 & 1 & 2 &  3 & 4 & 5 &  6 & 7 \\\\
-  a(n) & 0 & 0 & 0 &  1 & 0 & 0 &  1 & 2 \\\\
-  b(n) & 1 & 1 & 1 & -1 & 1 & 1 & -1 & 1 \\\\
-  s(n) & 1 & 2 & 3 &  2 & 3 & 4 &  3 & 4
-\end{array}$$
+$$\begin{array}{lr}   n    & 0 & 1 & 2 &  3 & 4 & 5 &  6 & 7 \\\\
+  a(n) & 0 & 0 & 0 &  1 & 0 & 0 &  1 & 2 \\\\   b(n) & 1 & 1 & 1 & -1 & 1 & 1 & -1 & 1 \\\\
+  s(n) & 1 & 2 & 3 &  2 & 3 & 4 &  3 & 4 \end{array}$$
 
 The sequence $s(n)$ has the remarkable property that all elements are positive and every positive integer $k$ occurs exactly $k$ times.
 
@@ -33,10 +30,8 @@ E.g.: $g(3, 3) = 6$, $g(4, 2) = 7$ and $g(54321, 12345) = 1\\,220\\,847\\,710$.
 
 Let $F(n)$ be the fibonacci sequence defined by:
 
-$$\begin{align}
-  & F(0) = F(1) = 1 \text{ and} \\\\
-  & F(n) = F(n - 1) + F(n - 2) \text{ for } n > 1.
-\end{align}$$
+$$\begin{align}   & F(0) = F(1) = 1 \text{ and} \\\\
+  & F(n) = F(n - 1) + F(n - 2) \text{ for } n > 1. \end{align}$$
 
 Define $GF(t) = g(F(t), F(t - 1))$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md
index aef1ea66857..96df0312f03 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md
@@ -10,7 +10,7 @@ dashedName: problem-385-ellipses-inside-triangles
 
 For any triangle $T$ in the plane, it can be shown that there is a unique ellipse with largest area that is completely inside $T$.
 
-<img class="img-responsive center-block" alt="ellipse completely insisde of triangle" src="https://cdn.freecodecamp.org/curriculum/project-euler/ellipses-inside-triangles.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="ellipse completely insisde of triangle" src="https://cdn.freecodecamp.org/curriculum/project-euler/ellipses-inside-triangles.png" style="background-color: white; padding: 10px;" />
 
 For a given $n$, consider triangles $T$ such that:
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md
index 5065da0c80a..7e40a574c29 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md
@@ -24,7 +24,7 @@ For this problem we would like you to find the positions of the remaining $N$ in
 
 E.g. here is a picture of the solution for $N = 10$:
 
-<img class="img-responsive center-block" alt="solution for N = 10" src="https://cdn.freecodecamp.org/curriculum/project-euler/enmeshed-unit-circle.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="solution for N = 10" src="https://cdn.freecodecamp.org/curriculum/project-euler/enmeshed-unit-circle.png" style="background-color: white; padding: 10px;" />
 
 The area occupied by the red cells for $N = 10$ rounded to 10 digits behind the decimal point is 3.3469640797.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-394-eating-pie.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-394-eating-pie.md
index 5901e193913..a6b40bf39bc 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-394-eating-pie.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-394-eating-pie.md
@@ -19,7 +19,7 @@ While there is at least a given fraction $F$ of pie left, he performs the follow
 
 When less than a fraction $F$ of pie remains, he does not repeat this procedure. Instead, he eats all of the remaining pie.
 
-<img class="img-responsive center-block" alt="animation of pie slicing procedure" src="https://cdn.freecodecamp.org/curriculum/project-euler/eating-pie.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="animation of pie slicing procedure" src="https://cdn.freecodecamp.org/curriculum/project-euler/eating-pie.gif" style="background-color: white; padding: 10px;" />
 
 For $x ≥ 1$, let $E(x)$ be the expected number of times Jeff repeats the procedure above with $F = \frac{1}{x}$. It can be verified that $E(1) = 1$, $E(2) ≈ 1.2676536759$, and $E(7.5) ≈ 2.1215732071$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md
index 28477a1edd0..cff705c06fb 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md
@@ -18,7 +18,7 @@ Start with a unit square. Then, calling one of the sides its base (in the animat
 
 The resulting figure, after an infinite number of iterations, is the Pythagorean tree.
 
-<img class="img-responsive center-block" alt="animation showing 8 iterations of the procedure" src="https://cdn.freecodecamp.org/curriculum/project-euler/pythagorean-tree.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="animation showing 8 iterations of the procedure" src="https://cdn.freecodecamp.org/curriculum/project-euler/pythagorean-tree.gif" style="background-color: white; padding: 10px;" />
 
 It can be shown that there exists at least one rectangle, whose sides are parallel to the largest square of the Pythagorean tree, which encloses the Pythagorean tree completely.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md
index ed865dc0e93..2b2e220949c 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md
@@ -18,7 +18,7 @@ On such a tree two players play a take-away game. On each turn a player selects
 
 Here are the winning moves of the first player on the first turn for $T(k)$ from $k = 1$ to $k = 6$.
 
-<img class="img-responsive center-block" alt="winning moves of first player, on the first turn for k = 1 to k = 6" src="https://cdn.freecodecamp.org/curriculum/project-euler/fibonacci-tree-game.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="winning moves of first player, on the first turn for k = 1 to k = 6" src="https://cdn.freecodecamp.org/curriculum/project-euler/fibonacci-tree-game.png" style="background-color: white; padding: 10px;" />
 
 Let $f(k)$ be the number of winning moves of the first player (i.e. the moves for which the second player has no winning strategy) on the first turn of the game when this game is played on $T(k)$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md
index edd17b0958a..92690bd7a6d 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md
@@ -12,7 +12,7 @@ $E_a$ is an ellipse with an equation of the form $x^2 + 4y^2 = 4a^2$.
 
 $E_a'$ is the rotated image of $E_a$ by $θ$ degrees counterclockwise around the origin $O(0, 0)$ for $0° &lt; θ &lt; 90°$.
 
-<img class="img-responsive center-block" alt="ellipse E_a and ellipse rotated by θ degrees E_a'" src="https://cdn.freecodecamp.org/curriculum/project-euler/crisscross-ellipses.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="ellipse E_a and ellipse rotated by θ degrees E_a'" src="https://cdn.freecodecamp.org/curriculum/project-euler/crisscross-ellipses.gif" style="background-color: white; padding: 10px;" />
 
 $b$ is the distance to the origin of the two intersection points closest to the origin and $c$ is the distance of the two other intersection points.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md
index cb151b7764c..43ceb097a66 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md
@@ -14,11 +14,11 @@ Let $T(0)$ be the tiling consisting of a single rectangle.
 
 For $n > 0$, let $T(n)$ be obtained from $T( n- 1)$ by replacing all tiles in the following manner:
 
-<img class="img-responsive center-block" alt="obtaining T(n) from T(n - 1)" src="https://cdn.freecodecamp.org/curriculum/project-euler/a-rectangular-tiling-1.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="obtaining T(n) from T(n - 1)" src="https://cdn.freecodecamp.org/curriculum/project-euler/a-rectangular-tiling-1.png" style="background-color: white; padding: 10px;" />
 
 The following animation demonstrates the tilings $T(n)$ for $n$ from 0 to 5:
 
-<img class="img-responsive center-block" alt="animation with tilings T(n) for n from 0 to 5" src="https://cdn.freecodecamp.org/curriculum/project-euler/a-rectangular-tiling-2.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="animation with tilings T(n) for n from 0 to 5" src="https://cdn.freecodecamp.org/curriculum/project-euler/a-rectangular-tiling-2.gif" style="background-color: white; padding: 10px;" />
 
 Let $f(n)$ be the number of points where four tiles meet in $T(n)$. For example, $f(1) = 0$, $f(4) = 82$ and $f({10}^9)\bmod {17}^7 = 126\\,897\\,180$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-406-guessing-game.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-406-guessing-game.md
index 6e1478d371a..6907ad6dae2 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-406-guessing-game.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-406-guessing-game.md
@@ -32,12 +32,9 @@ Let $C(n, a, b)$ be the worst-case cost achieved by an optimal strategy for the
 
 Here are a few examples:
 
-$$\begin{align}
-  & C(5, 2, 3) = 5 \\\\
-  & C(500, \sqrt{2}, \sqrt{3}) = 13.220\\,731\\,97\ldots \\\\
-  & C(20\\,000, 5, 7) = 82 \\\\
-  & C(2\\,000\\,000, √5, √7) = 49.637\\,559\\,55\ldots \\\\
-\end{align}$$
+$$\begin{align}   & C(5, 2, 3) = 5 \\\\
+  & C(500, \sqrt{2}, \sqrt{3}) = 13.220\\,731\\,97\ldots \\\\   & C(20\\,000, 5, 7) = 82 \\\\
+  & C(2\\,000\\,000, √5, √7) = 49.637\\,559\\,55\ldots \\\\ \end{align}$$
 
 Let $F_k$ be the Fibonacci numbers: $F_k = F_{k - 1} + F_{k - 2}$ with base cases $F_1 = F_2 = 1$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md
index e7ea4cb4212..09ace26cdea 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md
@@ -16,7 +16,7 @@ Let $S(n)$ be the maximum number of stations such a path can pass through.
 
 For example, if $n = 22$, there are 11 distinct stations, and a valid path can pass through at most 5 stations. Therefore, $S(22) = 5$. The case is illustrated below, with an example of an optimal path:
 
-<img class="img-responsive center-block" alt="valid path passing through 5 stations, for n = 22, with 11 distinct stations" src="https://cdn.freecodecamp.org/curriculum/project-euler/uphill-paths.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="valid path passing through 5 stations, for n = 22, with 11 distinct stations" src="https://cdn.freecodecamp.org/curriculum/project-euler/uphill-paths.png" style="background-color: white; padding: 10px;" />
 
 It can also be verified that $S(123) = 14$ and $S(10\\,000) = 48$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md
index f50157e924c..ac00f985c10 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md
@@ -12,13 +12,13 @@ For integers $m$, $n$ ($0 ≤ n &lt; m$), let $L(m, n)$ be an $m×m$ grid with t
 
 For example, $L(5, 3)$ looks like this:
 
-<img class="img-responsive center-block" alt="5x5 grid, with removed 3x3 grid from the top-right" src="https://cdn.freecodecamp.org/curriculum/project-euler/gnomon-numbering-1.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="5x5 grid, with removed 3x3 grid from the top-right" src="https://cdn.freecodecamp.org/curriculum/project-euler/gnomon-numbering-1.png" style="background-color: white; padding: 10px;" />
 
 We want to number each cell of $L(m, n)$ with consecutive integers 1, 2, 3, ... such that the number in every cell is smaller than the number below it and to the left of it.
 
 For example, here are two valid numberings of $L(5, 3)$:
 
-<img class="img-responsive center-block" alt="two valid numberings of L(5, 3)" src="https://cdn.freecodecamp.org/curriculum/project-euler/gnomon-numbering-2.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="two valid numberings of L(5, 3)" src="https://cdn.freecodecamp.org/curriculum/project-euler/gnomon-numbering-2.png" style="background-color: white; padding: 10px;" />
 
 Let $LC(m, n)$ be the number of valid numberings of $L(m, n)$. It can be verified that $LC(3, 0) = 42$, $LC(5, 3) = 250\\,250$, $LC(6, 3) = 406\\,029\\,023\\,400$ and $LC(10, 5)\bmod 76\\,543\\,217 = 61\\,251\\,715$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
index 0d3500b139d..e50ab2c9a7e 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
@@ -16,18 +16,14 @@ This also works with numbers that have less than 4 digits if we pad the number w
 
 E.g. let's start with the number 0837:
 
-$$\begin{align}
-  & 8730 - 0378 = 8352 \\\\
-  & 8532 - 2358 = 6174
-\end{align}$$
+$$\begin{align}   & 8730 - 0378 = 8352 \\\\
+  & 8532 - 2358 = 6174 \end{align}$$
 
 6174 is called the Kaprekar constant. The process of sorting and subtracting and repeating this until either 0 or the Kaprekar constant is reached is called the Kaprekar routine.
 
 We can consider the Kaprekar routine for other bases and number of digits. Unfortunately, it is not guaranteed a Kaprekar constant exists in all cases; either the routine can end up in a cycle for some input numbers or the constant the routine arrives at can be different for different input numbers. However, it can be shown that for 5 digits and a base $b = 6t + 3 ≠ 9$, a Kaprekar constant exists.
 
-E.g.
-base 15: ${(10, 4, 14, 9, 5)}\_{15}$
-base 21: $(14, 6, 20, 13, 7)\_{21}$
+E.g. base 15: ${(10, 4, 14, 9, 5)}\_{15}$ base 21: $(14, 6, 20, 13, 7)\_{21}$
 
 Define $C_b$ to be the Kaprekar constant in base $b$ for 5 digits. Define the function $sb(i)$ to be:
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md
index c4292cef8bc..aa0880c13f4 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md
@@ -10,16 +10,11 @@ dashedName: problem-417-reciprocal-cycles-ii
 
 A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:
 
-$$\begin{align}
-  & \frac{1}{2}  = 0.5 \\\\
-  & \frac{1}{3}  = 0.(3) \\\\
-  & \frac{1}{4}  = 0.25 \\\\
-  & \frac{1}{5}  = 0.2 \\\\
-  & \frac{1}{6}  = 0.1(6) \\\\
-  & \frac{1}{7}  = 0.(142857) \\\\
-  & \frac{1}{8}  = 0.125 \\\\
-  & \frac{1}{9}  = 0.(1) \\\\
-  & \frac{1}{10} = 0.1 \\\\
+$$\begin{align}   & \frac{1}{2}  = 0.5 \\\\
+  & \frac{1}{3}  = 0.(3) \\\\   & \frac{1}{4}  = 0.25 \\\\
+  & \frac{1}{5}  = 0.2 \\\\   & \frac{1}{6}  = 0.1(6) \\\\
+  & \frac{1}{7}  = 0.(142857) \\\\   & \frac{1}{8}  = 0.125 \\\\
+  & \frac{1}{9}  = 0.(1) \\\\   & \frac{1}{10} = 0.1 \\\\
 \end{align}$$
 
 Where $0.1(6)$ means $0.166666\ldots$, and has a 1-digit recurring cycle. It can be seen that $\frac{1}{7}$ has a 6-digit recurring cycle.
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md
index e9d58f43440..50a7c676cb8 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md
@@ -12,18 +12,14 @@ A positive integer matrix is a matrix whose elements are all positive integers.
 
 Some positive integer matrices can be expressed as a square of a positive integer matrix in two different ways. Here is an example:
 
-$$\begin{pmatrix}
-  40 & 12 \\\\
-  48 & 40
-\end{pmatrix} =
+$$\begin{pmatrix}   40 & 12 \\\\
+  48 & 40 \end{pmatrix} =
 {\begin{pmatrix}
   2 & 3 \\\\
- 12 & 2
-\end{pmatrix}}^2 =
+ 12 & 2 \end{pmatrix}}^2 =
 {\begin{pmatrix}
   6 & 1 \\\\
-  4 & 6
-\end{pmatrix}}^2$$
+  4 & 6 \end{pmatrix}}^2$$
 
 We define $F(N)$ as the number of the 2x2 positive integer matrices which have a trace less than N and which can be expressed as a square of a positive integer matrix in two different ways.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md
index bb46ddcc35c..7ea875b71ab 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md
@@ -18,7 +18,7 @@ Now we define a sequence of points in $H, \\{P_i : i ≥ 1\\}$, as:
 - $P_2 = (\frac{-43}{6}, -4)$.
 - For $i > 2$, $P_i$ is the unique point in $H$ that is different from $P_{i - 1}$ and such that line $P_iP_{i - 1}$ is parallel to line $P_{i - 2}X$. It can be shown that $P_i$ is well-defined, and that its coordinates are always rational.
 
-<img class="img-responsive center-block" alt="animation showing defining points P_1 to P_6" src="https://cdn.freecodecamp.org/curriculum/project-euler/sequence-of-points-on-a-hyperbola.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="animation showing defining points P_1 to P_6" src="https://cdn.freecodecamp.org/curriculum/project-euler/sequence-of-points-on-a-hyperbola.gif" style="background-color: white; padding: 10px;" />
 
 You are given that $P_3 = (\frac{-19}{2}, \frac{-229}{24})$, $P_4 = (\frac{1267}{144}, \frac{-37}{12})$ and $P_7 = (\frac{17\\,194\\,218\\,091}{143\\,327\\,232}, \frac{274\\,748\\,766\\,781}{1\\,719\\,926\\,784})$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md
index 9497832e44c..9969311f0de 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md
@@ -14,11 +14,8 @@ A 6-sided die is thrown $n$ times. Let $c$ be the number of pairs of consecutive
 
 For example, if $n = 7$ and the values of the die throws are (1, 1, 5, 6, 6, 6, 3), then the following pairs of consecutive throws give the same value:
 
-$$\begin{align}
-  & (\underline{1}, \underline{1}, 5, 6, 6, 6, 3) \\\\
-  & (1, 1, 5, \underline{6}, \underline{6}, 6, 3) \\\\
-  & (1, 1, 5, 6, \underline{6}, \underline{6}, 3)
-\end{align}$$
+$$\begin{align}   & (\underline{1}, \underline{1}, 5, 6, 6, 6, 3) \\\\
+  & (1, 1, 5, \underline{6}, \underline{6}, 6, 3) \\\\ & (1, 1, 5, 6, \underline{6}, \underline{6}, 3) \end{align}$$
 
 Therefore, $c = 3$ for (1, 1, 5, 6, 6, 6, 3).
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-424-kakuro.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-424-kakuro.md
index ddd2fc86590..90b1b38773f 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-424-kakuro.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-424-kakuro.md
@@ -8,7 +8,7 @@ dashedName: problem-424-kakuro
 
 # --description--
 
-<img class="img-responsive center-block" alt="kakuro example" src="https://cdn.freecodecamp.org/curriculum/project-euler/kakuro.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="kakuro example" src="https://cdn.freecodecamp.org/curriculum/project-euler/kakuro.gif" style="background-color: white; padding: 10px;" />
 
 The above is an example of a cryptic kakuro (also known as cross sums, or even sums cross) puzzle, with its final solution on the right. (The common rules of kakuro puzzles can be found easily on numerous internet sites. Other related information can also be currently found at krazydad.com whose author has provided the puzzle data for this challenge.)
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md
index 332a15aa0e3..89314f8aa76 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md
@@ -14,21 +14,18 @@ A turn consists of moving each ball exactly once according to the following rule
 
 After one turn the sequence (2, 2, 2, 1, 2) becomes (2, 2, 1, 2, 3) as can be seen below; note that we begin the new sequence starting at the first occupied box.
 
-<img class="img-responsive center-block" alt="animation showing one complete turn from (2, 2, 2, 1, 2) to (2, 2, 1, 2, 3)" src="https://cdn.freecodecamp.org/curriculum/project-euler/box-ball-system-1.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="animation showing one complete turn from (2, 2, 2, 1, 2) to (2, 2, 1, 2, 3)" src="https://cdn.freecodecamp.org/curriculum/project-euler/box-ball-system-1.gif" style="background-color: white; padding: 10px;" />
 
 A system like this is called a Box-Ball System or BBS for short.
 
 It can be shown that after a sufficient number of turns, the system evolves to a state where the consecutive numbers of occupied boxes is invariant. In the example below, the consecutive numbers of occupied boxes evolves to [1, 2, 3]; we shall call this the final state.
 
-<img class="img-responsive center-block" alt="four turns from occupied boxes [2, 2, 2] to final state [1, 2, 3]" src="https://cdn.freecodecamp.org/curriculum/project-euler/box-ball-system-2.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="four turns from occupied boxes [2, 2, 2] to final state [1, 2, 3]" src="https://cdn.freecodecamp.org/curriculum/project-euler/box-ball-system-2.gif" style="background-color: white; padding: 10px;" />
 
 We define the sequence $\\{t_i\\}$:
 
-$$\begin{align}
-  & s_0 = 290\\,797 \\\\
-  & s_{k + 1} = {s_k}^2\bmod 50\\,515\\,093 \\\\
-  & t_k = (s_k\bmod 64) + 1
-\end{align}$$
+$$\begin{align}   & s_0 = 290\\,797 \\\\
+  & s_{k + 1} = {s_k}^2\bmod 50\\,515\\,093 \\\\ & t_k = (s_k\bmod 64) + 1 \end{align}$$
 
 Starting from the initial configuration $(t_0, t_1, \ldots, t_{10})$, the final state becomes [1, 3, 10, 24, 51, 75].
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md
index ac3ff6f0190..bf6e6bdaa12 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md
@@ -25,7 +25,7 @@ The triplet ($a$, $b$, $c$) is called a *necklace triplet* if you can place $k 
 
 For example, (5, 5, 5) and (4, 3, 21) are necklace triplets, while it can be shown that (2, 2, 5) is not.
 
-<img class="img-responsive center-block" alt="a visual representation of a necklace triplet" src="https://cdn.freecodecamp.org/curriculum/project-euler/necklace-of-circles.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="a visual representation of a necklace triplet" src="https://cdn.freecodecamp.org/curriculum/project-euler/necklace-of-circles.png" style="background-color: white; padding: 10px;" />
 
 Let $T(n)$ be the number of necklace triplets $(a, b, c)$ such that $a$, $b$ and $c$ are positive integers, and $b ≤ n$. For example, $T(1) = 9$, $T(20) = 732$ and $T(3\\,000) = 438\\,106$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-430-range-flips.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-430-range-flips.md
index 78a6eeed1e4..d8838dbe162 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-430-range-flips.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-430-range-flips.md
@@ -16,7 +16,7 @@ At each turn, two, not necessarily distinct, integers $A$ and $B$ between 1 and
 
 The following example shows the case $N = 8$. At the first turn $A = 5$ and $B = 2$, and at the second turn $A = 4$ and $B = 6$.
 
-<img class="img-responsive center-block" alt="example for N = 8, with first turn A = 5 and B = 2, and second turn A = 4 and B = 6" src="https://cdn.freecodecamp.org/curriculum/project-euler/range-flips.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="example for N = 8, with first turn A = 5 and B = 2, and second turn A = 4 and B = 6" src="https://cdn.freecodecamp.org/curriculum/project-euler/range-flips.gif" style="background-color: white; padding: 10px;" />
 
 Let $E(N, M)$ be the expected number of disks that show their white side after $M$ turns. We can verify that $E(3, 1) = \frac{10}{9}$, $E(3, 2) = \frac{5}{3}$, $E(10, 4) ≈ 5.157$ and $E(100, 10) ≈ 51.893$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md
index 32bcb7efb58..4199819468b 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md
@@ -12,7 +12,7 @@ Fred the farmer arranges to have a new storage silo installed on his farm and ha
 
 Quick thinking Quentin explains that when granular materials are delivered from above a conical slope is formed and the natural angle made with the horizontal is called the angle of repose. For example if the angle of repose, $\alpha = 30°$, and grain is delivered at the centre of the silo then a perfect cone will form towards the top of the cylinder. In the case of this silo, which has a diameter of 6m, the amount of space wasted would be approximately 32.648388556 m<sup>3</sup>. However, if grain is delivered at a point on the top which has a horizontal distance of $x$ metres from the centre then a cone with a strangely curved and sloping base is formed. He shows Fred a picture.
 
-<img class="img-responsive center-block" alt="image presenting forming of the perfect cone towards the top of the cylinder" src="https://cdn.freecodecamp.org/curriculum/project-euler/square-space-silo.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="image presenting forming of the perfect cone towards the top of the cylinder" src="https://cdn.freecodecamp.org/curriculum/project-euler/square-space-silo.png" style="background-color: white; padding: 10px;" />
 
 We shall let the amount of space wasted in cubic metres be given by $V(x)$. If $x = 1.114\\,785\\,284$, which happens to have three squared decimal places, then the amount of space wasted, $V(1.114\\,785\\,284) \approx 36$. Given the range of possible solutions to this problem there is exactly one other option: $V(2.511\\,167\\,869) \approx 49$. It would be like knowing that the square is king of the silo, sitting in splendid glory on top of your grain.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.md
index d90b355906a..4db4c121e91 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.md
@@ -10,10 +10,8 @@ dashedName: problem-433-steps-in-euclids-algorithm
 
 Let $E(x_0, y_0)$ be the number of steps it takes to determine the greatest common divisor of $x_0$ and $y_0$ with Euclid's algorithm. More formally:
 
-$$\begin{align}
-  & x_1 = y_0, y_1 = x_0\bmod y_0 \\\\
-  & x_n = y_{n - 1}, y_n = x_{n - 1}\bmod y_{n - 1}
-\end{align}$$
+$$\begin{align}   & x_1 = y_0, y_1 = x_0\bmod y_0 \\\\
+  & x_n = y_{n - 1}, y_n = x_{n - 1}\bmod y_{n - 1} \end{align}$$
 
 $E(x_0, y_0)$ is the smallest $n$ such that $y_n = 0$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md
index 8c8fa902baf..a570e51bccb 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md
@@ -20,11 +20,11 @@ Informally, a graph is rigid if by replacing the vertices with fully rotating hi
 
 The grid graphs embedded in the Euclidean plane are not rigid, as the following animation demonstrates:
 
-<img class="img-responsive center-block" alt="animation showing grid graphs are not rigid in Euclidean plane" src="https://cdn.freecodecamp.org/curriculum/project-euler/rigid-graphs-1.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="animation showing grid graphs are not rigid in Euclidean plane" src="https://cdn.freecodecamp.org/curriculum/project-euler/rigid-graphs-1.gif" style="background-color: white; padding: 10px;" />
 
 However, one can make them rigid by adding diagonal edges to the cells. For example, for the 2x3 grid graph, there are 19 ways to make the graph rigid:
 
-<img class="img-responsive center-block" alt="19 ways to make 2x3 grid graph rigid" src="https://cdn.freecodecamp.org/curriculum/project-euler/rigid-graphs-2.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="19 ways to make 2x3 grid graph rigid" src="https://cdn.freecodecamp.org/curriculum/project-euler/rigid-graphs-2.png" style="background-color: white; padding: 10px;" />
 
 Note that for the purposes of this problem, we do not consider changing the orientation of a diagonal edge or adding both diagonal edges to a cell as a different way of making a grid graph rigid.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md
index db2aa25da0e..47f1606285d 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md
@@ -16,17 +16,11 @@ But there is more:
 
 If we take a closer look we see:
 
-$$\begin{align}
-  & 1 + 8 = 9 \\\\
-  & 8 + 9 = 17 ≡ 6\bmod 11 \\\\
-  & 9 + 6 = 15 ≡ 4\bmod 11 \\\\
-  & 6 + 4 = 10 \\\\
-  & 4 + 10 = 14 ≡ 3\bmod 11 \\\\
-  & 10 + 3 = 13 ≡ 2\bmod 11 \\\\
-  & 3 + 2 = 5 \\\\
-  & 2 + 5 = 7 \\\\
-  & 5 + 7 = 12 ≡ 1\bmod 11.
-\end{align}$$
+$$\begin{align}   & 1 + 8 = 9 \\\\
+  & 8 + 9 = 17 ≡ 6\bmod 11 \\\\   & 9 + 6 = 15 ≡ 4\bmod 11 \\\\
+  & 6 + 4 = 10 \\\\   & 4 + 10 = 14 ≡ 3\bmod 11 \\\\
+  & 10 + 3 = 13 ≡ 2\bmod 11 \\\\   & 3 + 2 = 5 \\\\
+  & 2 + 5 = 7 \\\\ & 5 + 7 = 12 ≡ 1\bmod 11. \end{align}$$
 
 So the powers of 8 mod 11 are cyclic with period 10, and $8^n + 8^{n + 1} ≡ 8^{n + 2} (\text{mod } 11)$. 8 is called a Fibonacci primitive root of 11.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md
index 91d21dddaf6..49afa9608aa 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md
@@ -10,11 +10,11 @@ dashedName: problem-440-gcd-and-tiling
 
 We want to tile a board of length $n$ and height 1 completely, with either 1 × 2 blocks or 1 × 1 blocks with a single decimal digit on top:
 
-<img class="img-responsive center-block" alt="ten blocks 1x1 with single decimal digit on top, and 1x2 block" src="https://cdn.freecodecamp.org/curriculum/project-euler/gcd-and-tiling-1.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="ten blocks 1x1 with single decimal digit on top, and 1x2 block" src="https://cdn.freecodecamp.org/curriculum/project-euler/gcd-and-tiling-1.png" style="background-color: white; padding: 10px;" />
 
 For example, here are some of the ways to tile a board of length $n = 8$:
 
-<img class="img-responsive center-block" alt="examples of ways to tile a board of length n = 8" src="https://cdn.freecodecamp.org/curriculum/project-euler/gcd-and-tiling-2.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="examples of ways to tile a board of length n = 8" src="https://cdn.freecodecamp.org/curriculum/project-euler/gcd-and-tiling-2.png" style="background-color: white; padding: 10px;" />
 
 Let $T(n)$ be the number of ways to tile a board of length $n$ as described above.
 
@@ -24,11 +24,8 @@ Let $S(L)$ be the triple sum $\sum_{a, b, c} gcd(T(c^a), T(c^b))$ for $1 ≤ a,
 
 For example:
 
-$$\begin{align}
-  & S(2) = 10\\,444 \\\\
-  & S(3) = 1\\,292\\,115\\,238\\,446\\,807\\,016\\,106\\,539\\,989 \\\\
-  & S(4)\bmod 987\\,898\\,789 = 670\\,616\\,280.
-\end{align}$$
+$$\begin{align}   & S(2) = 10\\,444 \\\\
+  & S(3) = 1\\,292\\,115\\,238\\,446\\,807\\,016\\,106\\,539\\,989 \\\\ & S(4)\bmod 987\\,898\\,789 = 670\\,616\\,280. \end{align}$$
 
 Find $S(2000)\bmod 987\\,898\\,789$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md
index d9cfbf04795..17fc8db1cb5 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md
@@ -10,17 +10,13 @@ dashedName: problem-443-gcd-sequence
 
 Let $g(n)$ be a sequence defined as follows:
 
-$$\begin{align}
-  & g(4) = 13, \\\\
-  & g(n) = g(n-1) + gcd(n, g(n - 1)) \text{ for } n > 4.
-\end{align}$$
+$$\begin{align}   & g(4) = 13, \\\\
+  & g(n) = g(n-1) + gcd(n, g(n - 1)) \text{ for } n > 4. \end{align}$$
 
 The first few values are:
 
-$$\begin{array}{l}
-  n    & 4  & 5  & 6  & 7  & 8  & 9  & 10 & 11 & 12 & 13 & 14 & 15 & 16 & 17 & 18 & 19 & 20 & \ldots \\\\
-  g(n) & 13 & 14 & 16 & 17 & 18 & 27 & 28 & 29 & 30 & 31 & 32 & 33 & 34 & 51 & 54 & 55 & 60 & \ldots
-\end{array}$$
+$$\begin{array}{l}   n    & 4  & 5  & 6  & 7  & 8  & 9  & 10 & 11 & 12 & 13 & 14 & 15 & 16 & 17 & 18 & 19 & 20 & \ldots \\\\
+  g(n) & 13 & 14 & 16 & 17 & 18 & 27 & 28 & 29 & 30 & 31 & 32 & 33 & 34 & 51 & 54 & 55 & 60 & \ldots \end{array}$$
 
 You are given that $g(1\\,000) = 2\\,524$ and $g(1\\,000\\,000) = 2\\,624\\,152$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
index 8460397f7fc..9bfd7f5d15a 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
@@ -24,11 +24,8 @@ Let $T(N) = \sum_{R = 3}^N \sum_{r=1}^{\left\lfloor \frac{R - 1}{2} \right\rfloo
 
 You are given:
 
-$$\begin{align}
-  C(3, 1) = & \\{(3, 0), (-1, 2), (-1,0), (-1,-2)\\} \\\\
-  C(2500, 1000) = & \\{(2500, 0), (772, 2376), (772, -2376), (516, 1792), (516, -1792), (500, 0), (68, 504), \\\\
-                  &(68, -504),(-1356, 1088), (-1356, -1088), (-1500, 1000), (-1500, -1000)\\}
-\end{align}$$
+$$\begin{align}   C(3, 1) = & \\{(3, 0), (-1, 2), (-1,0), (-1,-2)\\} \\\\
+  C(2500, 1000) = & \\{(2500, 0), (772, 2376), (772, -2376), (516, 1792), (516, -1792), (500, 0), (68, 504), \\\\ &(68, -504),(-1356, 1088), (-1356, -1088), (-1500, 1000), (-1500, -1000)\\} \end{align}$$
 
 **Note:** (-625, 0) is not an element of $C(2500, 1000)$ because $\sin(t)$ is not a rational number for the corresponding values of $t$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md
index a4f286b70b8..39ebff17846 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md
@@ -14,14 +14,10 @@ There are eight positive numbers less than 15 which are coprime to 15: 1, 2, 4,
 
 The modular inverses of these numbers modulo 15 are: 1, 8, 4, 13, 2, 11, 7, 14 because
 
-$$\begin{align}
-  & 1  \times 1\bmod 15 = 1 \\\\
-  & 2  \times 8  = 16\bmod 15 = 1 \\\\
-  & 4  \times 4  = 16\bmod 15 = 1 \\\\
-  & 7  \times 13 = 91\bmod 15 = 1 \\\\
-  & 11 \times 11 = 121\bmod 15 = 1 \\\\
-  & 14 \times 14 = 196\bmod 15 = 1
-\end{align}$$
+$$\begin{align}   & 1  \times 1\bmod 15 = 1 \\\\
+  & 2  \times 8  = 16\bmod 15 = 1 \\\\   & 4  \times 4  = 16\bmod 15 = 1 \\\\
+  & 7  \times 13 = 91\bmod 15 = 1 \\\\   & 11 \times 11 = 121\bmod 15 = 1 \\\\
+  & 14 \times 14 = 196\bmod 15 = 1 \end{align}$$
 
 Let $I(n)$ be the largest positive number $m$ smaller than $n - 1$ such that the modular inverse of $m$ modulo $n$ equals $m$ itself.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md
index 391f8b818c7..f809ebc60a5 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md
@@ -14,7 +14,7 @@ Let $Q(m, n)$ be the number of simple quadrilaterals whose vertices are lattice
 
 For example, $Q(2, 2) = 94$ as can be seen below:
 
-<img class="img-responsive center-block" alt="94 quadrilaterals whose vertices are lattice points with coordinates (x, y) satiffying 0 &le; x &le; m and 0 &le; y &le; n" src="https://cdn.freecodecamp.org/curriculum/project-euler/lattice-quadrilaterals.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="94 quadrilaterals whose vertices are lattice points with coordinates (x, y) satiffying 0 &le; x &le; m and 0 &le; y &le; n" src="https://cdn.freecodecamp.org/curriculum/project-euler/lattice-quadrilaterals.png" style="background-color: white; padding: 10px;" />
 
 It can also be verified that $Q(3, 7) = 39\\,590$, $Q(12, 3) = 309\\,000$ and $Q(123, 45) = 70\\,542\\,215\\,894\\,646$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md
index 1a0f74b0ee3..8e453a983c2 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md
@@ -12,12 +12,9 @@ Let $f(n)$ be the largest positive integer $x$ less than ${10}^9$ such that the
 
 For example:
 
-$$\begin{align}
-  & f(4) = 411\\,728\\,896 (4^{411\\,728\\,896} = ...490\underline{411728896}) \\\\
-  & f(10) = 0 \\\\
-  & f(157) = 743\\,757 (157^{743\\,757} = ...567\underline{000743757}) \\\\
-  & Σf(n), 2 ≤ n ≤ 103 = 442\\,530\\,011\\,399
-\end{align}$$
+$$\begin{align}   & f(4) = 411\\,728\\,896 (4^{411\\,728\\,896} = ...490\underline{411728896}) \\\\
+  & f(10) = 0 \\\\   & f(157) = 743\\,757 (157^{743\\,757} = ...567\underline{000743757}) \\\\
+  & Σf(n), 2 ≤ n ≤ 103 = 442\\,530\\,011\\,399 \end{align}$$
 
 Find $\sum f(n)$, $2 ≤ n ≤ {10}^6$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.md
index f4284a86faf..b622b8ac411 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.md
@@ -10,24 +10,17 @@ dashedName: problem-456-triangles-containing-the-origin-ii
 
 Define:
 
-$$\begin{align}
-  & x_n = ({1248}^n\bmod 32323) - 16161 \\\\
-  & y_n = ({8421}^n\bmod 30103) - 15051 \\\\
-  & P_n = \\{(x_1, y_1), (x_2, y_2), \ldots, (x_n, y_n)\\}
-\end{align}$$
+$$\begin{align}   & x_n = ({1248}^n\bmod 32323) - 16161 \\\\
+  & y_n = ({8421}^n\bmod 30103) - 15051 \\\\ & P_n = \\{(x_1, y_1), (x_2, y_2), \ldots, (x_n, y_n)\\} \end{align}$$
 
-For example,
-$$P_8 = \\{(-14913, -6630), (-10161, 5625), (5226, 11896), (8340, -10778), (15852, -5203), (-15165, 11295), (-1427, -14495), (12407, 1060)\\}$$
+For example, $$P_8 = \\{(-14913, -6630), (-10161, 5625), (5226, 11896), (8340, -10778), (15852, -5203), (-15165, 11295), (-1427, -14495), (12407, 1060)\\}$$
 
 Let $C(n)$ be the number of triangles whose vertices are in $P_n$ which contain the origin in the interior.
 
 Examples:
 
-$$\begin{align}
-  & C(8) = 20 \\\\
-  & C(600) = 8\\,950\\,634 \\\\
-  & C(40\\,000) = 2\\,666\\,610\\,948\\,988
-\end{align}$$
+$$\begin{align}   & C(8) = 20 \\\\
+  & C(600) = 8\\,950\\,634 \\\\ & C(40\\,000) = 2\\,666\\,610\\,948\\,988 \end{align}$$
 
 Find $C(2\\,000\\,000)$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-459-flipping-game.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-459-flipping-game.md
index afb26476054..13473d922bf 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-459-flipping-game.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-459-flipping-game.md
@@ -20,7 +20,7 @@ A turn consists of flipping all disks in a rectangle with the following properti
 - the rectangle width is a perfect square (1, 4, 9, 16, ...)
 - the rectangle height is a triangular number (1, 3, 6, 10, ...)
 
-<img class="img-responsive center-block" alt="flipping all disks in a 4x3 rectangle on a 5x5 board" src="https://cdn.freecodecamp.org/curriculum/project-euler/flipping-game-1.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="flipping all disks in a 4x3 rectangle on a 5x5 board" src="https://cdn.freecodecamp.org/curriculum/project-euler/flipping-game-1.png" style="background-color: white; padding: 10px;" />
 
 Players alternate turns. A player wins by turning the grid all black.
 
@@ -30,7 +30,7 @@ $W(1) = 1$, $W(2) = 0$, $W(5) = 8$ and $W({10}^2) = 31\\,395$.
 
 For $N = 5$, the first player's eight winning first moves are:
 
-<img class="img-responsive center-block" alt="eight winning first moves for N = 5" src="https://cdn.freecodecamp.org/curriculum/project-euler/flipping-game-2.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="eight winning first moves for N = 5" src="https://cdn.freecodecamp.org/curriculum/project-euler/flipping-game-2.png" style="background-color: white; padding: 10px;" />
 
 Find $W({10}^6)$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md
index 405654158fe..2bb68f203f4 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md
@@ -23,7 +23,7 @@ Thus the total required time is $1.2283 + 0.6667 + 1.2283 = 3.1233$.
 
 The right image is another path. The total required time is calculated as $0.98026 + 1 + 0.98026 = 2.96052$. It can be shown that this is the quickest path for $d = 4$.
 
-<img class="img-responsive center-block" alt="two possible paths for d = 4" src="https://cdn.freecodecamp.org/curriculum/project-euler/an-ant-on-the-move.jpg" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="two possible paths for d = 4" src="https://cdn.freecodecamp.org/curriculum/project-euler/an-ant-on-the-move.jpg" style="background-color: white; padding: 10px;" />
 
 Let $F(d)$ be the total required time if the ant chooses the quickest path. For example, $F(4) ≈ 2.960\\,516\\,287$. We can verify that $F(10) ≈ 4.668\\,187\\,834$ and $F(100) ≈ 9.217\\,221\\,972$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-461-almost-pi.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-461-almost-pi.md
index 8eb0e298723..1ff7e49ee6b 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-461-almost-pi.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-461-almost-pi.md
@@ -56,7 +56,7 @@ assert.strictEqual(almostPi(200), 64658);
 
 ```js
 function almostPi(n) {
-  
+
   return true;
 }
 ```
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md
index 168f99d525c..a8e3607195e 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md
@@ -10,13 +10,9 @@ dashedName: problem-463-a-weird-recurrence-relation
 
 The function $f$ is defined for all positive integers as follows:
 
-$$\begin{align}
-  & f(1) = 1 \\\\
-  & f(3) = 3 \\\\
-  & f(2n) = f(n) \\\\
-  & f(4n + 1) = 2f(2n + 1) - f(n) \\\\
-  & f(4n + 3) = 3f(2n + 1) - 2f(n)
-\end{align}$$
+$$\begin{align}   & f(1) = 1 \\\\
+  & f(3) = 3 \\\\   & f(2n) = f(n) \\\\
+  & f(4n + 1) = 2f(2n + 1) - f(n) \\\\ & f(4n + 3) = 3f(2n + 1) - 2f(n) \end{align}$$
 
 The function $S(n)$ is defined as $\sum_{i=1}^{n} f(i)$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md
index ec34690f6ff..57ad5b291d6 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md
@@ -14,7 +14,7 @@ For this problem, a polygon can have collinear consecutive vertices. However, a
 
 For example, only the first of the following is a polar polygon (the kernels of the second, third, and fourth do not strictly contain the origin, and the fifth does not have a kernel at all):
 
-<img class="img-responsive center-block" alt="five example polygons" src="https://cdn.freecodecamp.org/curriculum/project-euler/polar-polygons.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="five example polygons" src="https://cdn.freecodecamp.org/curriculum/project-euler/polar-polygons.png" style="background-color: white; padding: 10px;" />
 
 Notice that the first polygon has three consecutive collinear vertices.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md
index f362b243c5d..cfefe6e7b9f 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md
@@ -12,21 +12,16 @@ Let $P(m,n)$ be the number of distinct terms in an $m×n$ multiplication table.
 
 For example, a 3×4 multiplication table looks like this:
 
-$$\begin{array}{c}
-  ×          & \mathbf{1} & \mathbf{2} & \mathbf{3} & \mathbf{4}  \\\\
-  \mathbf{1} & 1          & 2          & 3          & 4  \\\\
-  \mathbf{2} & 2          & 4          & 6          & 8  \\\\
-  \mathbf{3} & 3          & 6          & 9          & 12
-\end{array}$$
+$$\begin{array}{c}   ×          & \mathbf{1} & \mathbf{2} & \mathbf{3} & \mathbf{4}  \\\\
+  \mathbf{1} & 1          & 2          & 3          & 4  \\\\   \mathbf{2} & 2          & 4          & 6          & 8  \\\\
+  \mathbf{3} & 3          & 6          & 9          & 12 \end{array}$$
 
 There are 8 distinct terms {1, 2, 3, 4, 6, 8, 9, 12}, therefore $P(3, 4) = 8$.
 
 You are given that:
 
-$$\begin{align}
-  & P(64, 64) = 1\\,263, \\\\
-  & P(12, 345) = 1\\,998, \text{ and} \\\\
-  & P(32, {10}^{15}) = 13\\,826\\,382\\,602\\,124\\,302. \\\\
+$$\begin{align}   & P(64, 64) = 1\\,263, \\\\
+  & P(12, 345) = 1\\,998, \text{ and} \\\\   & P(32, {10}^{15}) = 13\\,826\\,382\\,602\\,124\\,302. \\\\
 \end{align}$$
 
 Find $P(64, {10}^{16})$.
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-467-superinteger.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-467-superinteger.md
index f3c46934f29..9b0caad1704 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-467-superinteger.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-467-superinteger.md
@@ -14,24 +14,18 @@ For example, 2718281828 is a superinteger of 18828, while 314159 is not a superi
 
 Let $p(n)$ be the $n$th prime number, and let $c(n)$ be the $n$th composite number. For example, $p(1) = 2$, $p(10) = 29$, $c(1) = 4$ and $c(10) = 18$.
 
-$$\begin{align}
-  & \\{p(i) : i ≥ 1\\} = \\{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, \ldots \\} \\\\
-  & \\{c(i) : i ≥ 1\\} = \\{4, 6, 8, 9, 10, 12, 14, 15, 16, 18, \ldots \\}
-\end{align}$$
+$$\begin{align}   & \\{p(i) : i ≥ 1\\} = \\{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, \ldots \\} \\\\
+  & \\{c(i) : i ≥ 1\\} = \\{4, 6, 8, 9, 10, 12, 14, 15, 16, 18, \ldots \\} \end{align}$$
 
 Let $P^D$ the sequence of the digital roots of $\\{p(i)\\}$ ($C^D$ is defined similarly for $\\{c(i)\\}$):
 
-$$\begin{align}
-  & P^D = \\{2, 3, 5, 7, 2, 4, 8, 1, 5, 2, \ldots \\} \\\\
-  & C^D = \\{4, 6, 8, 9, 1, 3, 5, 6, 7, 9, \ldots \\}
-\end{align}$$
+$$\begin{align}   & P^D = \\{2, 3, 5, 7, 2, 4, 8, 1, 5, 2, \ldots \\} \\\\
+  & C^D = \\{4, 6, 8, 9, 1, 3, 5, 6, 7, 9, \ldots \\} \end{align}$$
 
 Let $P_n$ be the integer formed by concatenating the first $n$ elements of $P^D$ ($C_n$ is defined similarly for $C^D$).
 
-$$\begin{align}
-  & P_{10} = 2\\,357\\,248\\,152 \\\\
-  & C_{10} = 4\\,689\\,135\\,679
-\end{align}$$
+$$\begin{align}   & P_{10} = 2\\,357\\,248\\,152 \\\\
+  & C_{10} = 4\\,689\\,135\\,679 \end{align}$$
 
 Let $f(n)$ be the smallest positive integer that is a common superinteger of $P_n$ and $C_n$. For example, $f(10) = 2\\,357\\,246\\,891\\,352\\,679$, and $f(100)\bmod 1\\,000\\,000\\,007 = 771\\,661\\,825$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md
index 04f9a164613..dbd4119b933 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md
@@ -14,21 +14,15 @@ Let $SB(n)$ be the largest B-smooth divisor of $n$.
 
 Examples:
 
-$$\begin{align}
-  & S_1(10) = 1 \\\\
-  & S_4(2\\,100) = 12 \\\\
-  & S_{17}(2\\,496\\,144) = 5\\,712
-\end{align}$$
+$$\begin{align}   & S_1(10) = 1 \\\\
+  & S_4(2\\,100) = 12 \\\\ & S_{17}(2\\,496\\,144) = 5\\,712 \end{align}$$
 
 Define $F(n) = \displaystyle\sum_{B = 1}^n \sum_{r = 0}^n S_B(\displaystyle\binom{n}{r})$. Here, $\displaystyle\binom{n}{r}$ denotes the binomial coefficient.
 
 Examples:
 
-$$\begin{align}
-  & F(11) = 3132 \\\\
-  & F(1\\,111)\bmod 1\\,000\\,000\\,993 = 706\\,036\\,312 \\\\
-  & F(111\\,111)\bmod 1\\,000\\,000\\,993 = 22\\,156\\,169
-\end{align}$$
+$$\begin{align}   & F(11) = 3132 \\\\
+  & F(1\\,111)\bmod 1\\,000\\,000\\,993 = 706\\,036\\,312 \\\\ & F(111\\,111)\bmod 1\\,000\\,000\\,993 = 22\\,156\\,169 \end{align}$$
 
 Find $F(11\\,111\\,111)\bmod 1\\,000\\,000\\,993$.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md
index da790b74fa5..87fba0ff50a 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md
@@ -14,9 +14,9 @@ Let $r(a, b)$ be the radius of the incircle of $ΔABC$ when the incircle has cen
 
 For example, $r(3, 1) = \frac{1}{2}, r(6, 2) = 1, r(12, 3) = 2$.
 
-<img class="img-responsive center-block" alt="triangle ΔABC inscribed in an ellipse, radius of the incircle of ΔABC r(6, 2) = 1" src="https://cdn.freecodecamp.org/curriculum/project-euler/triangle-inscribed-in-ellipse-1.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="triangle ΔABC inscribed in an ellipse, radius of the incircle of ΔABC r(6, 2) = 1" src="https://cdn.freecodecamp.org/curriculum/project-euler/triangle-inscribed-in-ellipse-1.png" style="background-color: white; padding: 10px;" />
 
-<img class="img-responsive center-block" alt="triangle ΔABC inscribed in an ellipse, radius of the incircle of ΔABC r(12, 3) = 2" src="https://cdn.freecodecamp.org/curriculum/project-euler/triangle-inscribed-in-ellipse-2.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="triangle ΔABC inscribed in an ellipse, radius of the incircle of ΔABC r(12, 3) = 2" src="https://cdn.freecodecamp.org/curriculum/project-euler/triangle-inscribed-in-ellipse-2.png" style="background-color: white; padding: 10px;" />
 
 Let $G(n) = \sum_{a = 3}^n \sum_{b = 1}^{\left\lfloor\frac{a - 1}{2} \right\rfloor} r(a, b)$
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md
index f4a0fe402b7..25c9c601cf6 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md
@@ -18,7 +18,7 @@ Note that due to rule 1, some seats will surely be left unoccupied, and the maxi
 
 Here are the possible seating arrangements for $N = 15$:
 
-<img class="img-responsive center-block" alt="seating arrangements for N = 15" src="https://cdn.freecodecamp.org/curriculum/project-euler/comfortable-distance-ii.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="seating arrangements for N = 15" src="https://cdn.freecodecamp.org/curriculum/project-euler/comfortable-distance-ii.png" style="background-color: white; padding: 10px;" />
 
 We see that if the first person chooses correctly, the 15 seats can seat up to 7 people. We can also see that the first person has 9 choices to maximize the number of people that may be seated.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-480-the-last-question.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-480-the-last-question.md
index fbe75d0ddb7..b07b59bb692 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-480-the-last-question.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-480-the-last-question.md
@@ -16,34 +16,20 @@ Suppose those with 15 letters or less are listed in alphabetical order and numbe
 
 The list would include:
 
-$$\begin{align}
-  & 1: \text{a} \\\\
-  & 2: \text{aa} \\\\
-  & 3: \text{aaa} \\\\
-  & 4: \text{aaaa} \\\\
-  & 5: \text{aaaaa} \\\\
-  & 6: \text{aaaaaa} \\\\
-  & 7: \text{aaaaaac} \\\\
-  & 8: \text{aaaaaacd} \\\\
-  & 9: \text{aaaaaacde} \\\\
-  & 10: \text{aaaaaacdee} \\\\
-  & 11: \text{aaaaaacdeee} \\\\
-  & 12: \text{aaaaaacdeeee} \\\\
-  & 13: \text{aaaaaacdeeeee} \\\\
-  & 14: \text{aaaaaacdeeeeee} \\\\
-  & 15: \text{aaaaaacdeeeeeef} \\\\
-  & 16: \text{aaaaaacdeeeeeeg} \\\\
-  & 17: \text{aaaaaacdeeeeeeh} \\\\
-  & \ldots \\\\
-  & 28: \text{aaaaaacdeeeeeey} \\\\
-  & 29: \text{aaaaaacdeeeeef} \\\\
-  & 30: \text{aaaaaacdeeeeefe} \\\\
-  & \ldots \\\\
-  & 115246685191495242: \text{euleoywuttttsss} \\\\
-  & 115246685191495243: \text{euler} \\\\
-  & 115246685191495244: \text{eulera} \\\\
-  & ... \\\\
-  & 525069350231428029: \text{ywuuttttssssrrr} \\\\
+$$\begin{align}   & 1: \text{a} \\\\
+  & 2: \text{aa} \\\\   & 3: \text{aaa} \\\\
+  & 4: \text{aaaa} \\\\   & 5: \text{aaaaa} \\\\
+  & 6: \text{aaaaaa} \\\\   & 7: \text{aaaaaac} \\\\
+  & 8: \text{aaaaaacd} \\\\   & 9: \text{aaaaaacde} \\\\
+  & 10: \text{aaaaaacdee} \\\\   & 11: \text{aaaaaacdeee} \\\\
+  & 12: \text{aaaaaacdeeee} \\\\   & 13: \text{aaaaaacdeeeee} \\\\
+  & 14: \text{aaaaaacdeeeeee} \\\\   & 15: \text{aaaaaacdeeeeeef} \\\\
+  & 16: \text{aaaaaacdeeeeeeg} \\\\   & 17: \text{aaaaaacdeeeeeeh} \\\\
+  & \ldots \\\\   & 28: \text{aaaaaacdeeeeeey} \\\\
+  & 29: \text{aaaaaacdeeeeef} \\\\   & 30: \text{aaaaaacdeeeeefe} \\\\
+  & \ldots \\\\   & 115246685191495242: \text{euleoywuttttsss} \\\\
+  & 115246685191495243: \text{euler} \\\\   & 115246685191495244: \text{eulera} \\\\
+  & ... \\\\   & 525069350231428029: \text{ywuuttttssssrrr} \\\\
 \end{align}$$
 
 Define $P(w)$ as the position of the word $w$.
@@ -54,15 +40,11 @@ We can see that $P(w)$ and $W(p)$ are inverses: $P(W(p)) = p$ and $W(P(w)) = w$.
 
 Examples:
 
-$$\begin{align}
-  & W(10) = \text{ aaaaaacdee} \\\\
-  & P(\text{aaaaaacdee}) = 10 \\\\
-  & W(115246685191495243) = \text{ euler} \\\\
-  & P(\text{euler}) = 115246685191495243 \\\\
-\end{align}$$
+$$\begin{align}   & W(10) = \text{ aaaaaacdee} \\\\
+  & P(\text{aaaaaacdee}) = 10 \\\\   & W(115246685191495243) = \text{ euler} \\\\
+  & P(\text{euler}) = 115246685191495243 \\\\ \end{align}$$
 
-Find
-$$W(P(\text{legionary}) + P(\text{calorimeters}) - P(\text{annihilate}) + P(\text{orchestrated}) - P(\text{fluttering})).$$
+Find $$W(P(\text{legionary}) + P(\text{calorimeters}) - P(\text{annihilate}) + P(\text{orchestrated}) - P(\text{fluttering})).$$
 
 Give your answer using lowercase characters (no punctuation or space).
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-54-poker-hands.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-54-poker-hands.md
index cb51571ae47..b08e9a13bda 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-54-poker-hands.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-54-poker-hands.md
@@ -29,11 +29,11 @@ If two players have the same ranked hands then the rank made up of the highest v
 
 Consider the following five hands dealt to two players:
 
-| Hand               | Player 1                                                  | Player 2                                                   | Winner   |
-| ------------------ | --------------------------------------------------------- | ---------------------------------------------------------- | -------- |
-| <strong>1</strong> | 5H 5C 6S 7S KD <br> Pair of Fives                         | 2C 3S 8S 8D TD <br> Pair of Eights                         | Player 2 |
-| <strong>2</strong> | 5D 8C 9S JS AC <br> Highest card Ace                      | 2C 5C 7D 8S QH <br> Highest card Queen                     | Player 1 |
-| <strong>3</strong> | 2D 9C AS AH AC <br> Three Aces                            | 3D 6D 7D TD QD <br> Flush with Diamonds                    | Player 2 |
+| Hand                      | Player 1                                                              | Player 2                                                               | Winner   |
+| ------------------------- | --------------------------------------------------------------------- | ---------------------------------------------------------------------- | -------- |
+| <strong>1</strong> | 5H 5C 6S 7S KD <br> Pair of Fives                               | 2C 3S 8S 8D TD <br> Pair of Eights                               | Player 2 |
+| <strong>2</strong> | 5D 8C 9S JS AC <br> Highest card Ace                            | 2C 5C 7D 8S QH <br> Highest card Queen                           | Player 1 |
+| <strong>3</strong> | 2D 9C AS AH AC <br> Three Aces                                  | 3D 6D 7D TD QD <br> Flush with Diamonds                          | Player 2 |
 | <strong>4</strong> | 4D 6S 9H QH QC <br> Pair of Queens <br> Highest card Nine | 3D 6D 7H QD QS <br> Pair of Queens <br> Highest card Seven | Player 1 |
 | <strong>5</strong> | 2H 2D 4C 4D 4S <br> Full House <br> with Three Fours      | 3C 3D 3S 9S 9D <br> Full House <br> with Three Threes      | Player 1 |
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-6-sum-square-difference.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-6-sum-square-difference.md
index 65a460bd803..822dd6fd243 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-6-sum-square-difference.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-6-sum-square-difference.md
@@ -8,39 +8,39 @@ dashedName: problem-6-sum-square-difference
 
 # --description--
 
-The sum of the squares of the first ten natural numbers is,
+Die Summe der Quadrate der ersten zehn natürlichen Zahlen ist,
 
 <div style='text-align: center;'>1<sup>2</sup> + 2<sup>2</sup> + ... + 10<sup>2</sup> = 385</div>
 
-The square of the sum of the first ten natural numbers is,
+Das Quadrat der Summe der ersten zehn natürlichen Zahlen ist,
 
 <div style='text-align: center;'>(1 + 2 + ... + 10)<sup>2</sup> = 55<sup>2</sup> = 3025</div>
 
-Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is 3025 − 385 = 2640.
+Die Differenz zwischen der Summe der Quadrate der ersten zehn natürlichen Zahlen und dem Quadrat der Summe ist also 3025 - 385 = 2640.
 
-Find the difference between the sum of the squares of the first `n` natural numbers and the square of the sum.
+Finde die Differenz zwischen der Summe der Quadrate der ersten `n` natürlichen Zahlen und dem Quadrat der Summe.
 
 # --hints--
 
-`sumSquareDifference(10)` should return a number.
+`sumSquareDifference(10)` sollte eine Zahl zurückgeben.
 
 ```js
 assert(typeof sumSquareDifference(10) === 'number');
 ```
 
-`sumSquareDifference(10)` should return 2640.
+`sumSquareDifference(10)` sollte 2640 zurückgeben.
 
 ```js
 assert.strictEqual(sumSquareDifference(10), 2640);
 ```
 
-`sumSquareDifference(20)` should return 41230.
+`sumSquareDifference(20)` sollte 41230 zurückgeben.
 
 ```js
 assert.strictEqual(sumSquareDifference(20), 41230);
 ```
 
-`sumSquareDifference(100)` should return 25164150.
+`sumSquareDifference(100)` sollte 25164150 zurückgeben.
 
 ```js
 assert.strictEqual(sumSquareDifference(100), 25164150);
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md
index fd477f11acd..99fee7255e8 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md
@@ -10,14 +10,14 @@ 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              |
-| -------------- | ---------------------------- | --------------------- |
+| 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, ...  |
+| 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, ... |
+| 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, ... |
+| 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.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md
index 9745f016a6b..7be38bfabe1 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md
@@ -10,7 +10,7 @@ dashedName: problem-68-magic-5-gon-ring
 
 Consider the following "magic" 3-gon ring, filled with the numbers 1 to 6, and each line adding to nine.
 
-<img class="img-responsive center-block" alt="a completed example of a 3-gon ring" src="https://cdn-media-1.freecodecamp.org/project-euler/3-gon-ring.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="a completed example of a 3-gon ring" src="https://cdn-media-1.freecodecamp.org/project-euler/3-gon-ring.png" style="background-color: white; padding: 10px;" />
 
 Working **clockwise**, and starting from the group of three with the numerically lowest external node (4,3,2 in this example), each solution can be described uniquely. For example, the above solution can be described by the set: 4,3,2; 6,2,1; 5,1,3.
 
@@ -18,7 +18,7 @@ It is possible to complete the ring with four different totals: 9, 10, 11, and 1
 
 <div style='text-align: center;'>
 
-| <div style='width: 100px;'>Total</div> | <div style='width: 250px;'>Solution Set</div> |
+| !!crwdBlockTags_6_sgaTkcolBdwrc!! |!!crwdBlockTags_7_sgaTkcolBdwrc!! |
 | -------------------------------------- | --------------------------------------------- |
 | 9                                      | 4,2,3; 5,3,1; 6,1,2                           |
 | 9                                      | 4,3,2; 6,2,1; 5,1,3                           |
@@ -35,7 +35,7 @@ By concatenating each group it is possible to form 9-digit strings; the maximum
 
 Using the numbers 1 to 10, and depending on arrangements, it is possible to form 16- and 17-digit strings. What is the maximum **16-digit** string for a "magic" 5-gon ring?
 
-<img class="img-responsive center-block" alt="a blank diagram of a 5-gon ring" src="https://cdn-media-1.freecodecamp.org/project-euler/5-gon-ring.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="a blank diagram of a 5-gon ring" src="https://cdn-media-1.freecodecamp.org/project-euler/5-gon-ring.png" style="background-color: white; padding: 10px;" />
 
 # --hints--
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md
index 372b5c50601..0b94dee88dd 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md
@@ -14,18 +14,14 @@ $$1! + 4! + 5! = 1 + 24 + 120 = 145$$
 
 Perhaps less well known is 169, in that it produces the longest chain of numbers that link back to 169; it turns out that there are only three such loops that exist:
 
-$$\begin{align}
-&169 → 363601 → 1454 → 169\\\\
-&871 → 45361 → 871\\\\
-&872 → 45362 → 872\\\\
+$$\begin{align} &169 → 363601 → 1454 → 169\\\\
+&871 → 45361 → 871\\\\ &872 → 45362 → 872\\\\
 \end{align}$$
 
 It is not difficult to prove that EVERY starting number will eventually get stuck in a loop. For example,
 
-$$\begin{align}
-&69 → 363600 → 1454 → 169 → 363601\\ (→ 1454)\\\\
-&78 → 45360 → 871 → 45361\\ (→ 871)\\\\
-&540 → 145\\ (→ 145)\\\\
+$$\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.
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md
index baae4061caf..5fe3982048f 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md
@@ -10,13 +10,9 @@ dashedName: problem-81-path-sum-two-ways
 
 In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by **only moving to the right and down**, is indicated in bold red and is equal to `2427`.
 
-  $$\begin{pmatrix}
-  \color{red}{131} & 673 & 234 & 103 & 18\\\\
-  \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\\\
-  630 & 803 & \color{red}{746} & \color{red}{422} & 111\\\\
-  537 & 699 & 497 & \color{red}{121} & 956\\\\
-  805 & 732 & 524 & \color{red}{37} & \color{red}{331}
-  \end{pmatrix}$$
+  $$\begin{pmatrix}   \color{red}{131} & 673 & 234 & 103 & 18\\\\
+  \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\\\   630 & 803 & \color{red}{746} & \color{red}{422} & 111\\\\
+  537 & 699 & 497 & \color{red}{121} & 956\\\\ 805 & 732 & 524 & \color{red}{37} & \color{red}{331} \end{pmatrix}$$
 
 Find the minimal path sum from the top left to the bottom right by only moving right and down in `matrix`, a 2D array representing a matrix. The maximum matrix size used in the tests will be 80 by 80.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md
index 1cad1c0e006..0895540d468 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md
@@ -12,13 +12,9 @@ dashedName: problem-82-path-sum-three-ways
 
 The minimal path sum in the 5 by 5 matrix below, by starting in any cell in the left column and finishing in any cell in the right column, and only moving up, down, and right, is indicated in red and bold; the sum is equal to `994`.
 
-  $$\begin{pmatrix}
-  131 & 673 & \color{red}{234} & \color{red}{103} & \color{red}{18}\\\\
-  \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\\\
-  630 & 803 & 746 & 422 & 111\\\\
-  537 & 699 & 497 & 121 & 956\\\\
-  805 & 732 & 524 & 37 & 331
-  \end{pmatrix}$$
+  $$\begin{pmatrix}   131 & 673 & \color{red}{234} & \color{red}{103} & \color{red}{18}\\\\
+  \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\\\   630 & 803 & 746 & 422 & 111\\\\
+  537 & 699 & 497 & 121 & 956\\\\ 805 & 732 & 524 & 37 & 331 \end{pmatrix}$$
 
 Find the minimal path sum from the left column to the right column in `matrix`, a 2D array representing a matrix. The maximum matrix size used in tests will be 80 by 80.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md
index 5e695983ce8..8d3b60e0c0b 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md
@@ -12,13 +12,9 @@ dashedName: problem-83-path-sum-four-ways
 
 In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by moving left, right, up, and down, is indicated in bold red and is equal to `2297`.
 
-  $$\begin{pmatrix}
-  \color{red}{131} & 673 & \color{red}{234} & \color{red}{103} & \color{red}{18}\\\\
-  \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & \color{red}{150}\\\\
-  630 & 803 & 746 & \color{red}{422} & \color{red}{111}\\\\
-  537 & 699 & 497 & \color{red}{121} & 956\\\\
-  805 & 732 & 524 & \color{red}{37} & \color{red}{331}
-  \end{pmatrix}$$
+  $$\begin{pmatrix}   \color{red}{131} & 673 & \color{red}{234} & \color{red}{103} & \color{red}{18}\\\\
+  \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & \color{red}{150}\\\\   630 & 803 & 746 & \color{red}{422} & \color{red}{111}\\\\
+  537 & 699 & 497 & \color{red}{121} & 956\\\\ 805 & 732 & 524 & \color{red}{37} & \color{red}{331} \end{pmatrix}$$
 
 Find the minimal path sum from the top left to the bottom right by moving left, right, up, and down in `matrix`, a 2D array representing a matrix. The maximum matrix size used in tests will be 80 by 80.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md
index 9de90d942a0..eafbccb8aee 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md
@@ -10,7 +10,7 @@ dashedName: problem-85-counting-rectangles
 
 By counting carefully it can be seen that a rectangular grid measuring 3 by 2 contains eighteen rectangles:
 
-<img class="img-responsive center-block" alt="a diagram of the different rectangles found within a 3 by 2 rectangular grid" src="https://cdn-media-1.freecodecamp.org/project-euler/counting-rectangles.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="a diagram of the different rectangles found within a 3 by 2 rectangular grid" src="https://cdn-media-1.freecodecamp.org/project-euler/counting-rectangles.png" style="background-color: white; padding: 10px;" />
 
 Although there may not exists a rectangular grid that contains exactly `n` rectangles, find the area of the grid with the nearest solution.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md
index fc4762bb6d8..39a860bd794 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md
@@ -10,7 +10,7 @@ dashedName: problem-86-cuboid-route
 
 A spider, S, sits in one corner of a cuboid room, measuring 6 by 5 by 3, and a fly, F, sits in the opposite corner. By travelling on the surfaces of the room the shortest "straight line" distance from S to F is 10 and the path is shown on the diagram.
 
-<img class="img-responsive center-block" alt="a diagram of a spider and fly's path from one corner of a cuboid room to the opposite corner" src="https://cdn-media-1.freecodecamp.org/project-euler/cuboid-route.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="a diagram of a spider and fly's path from one corner of a cuboid room to the opposite corner" src="https://cdn-media-1.freecodecamp.org/project-euler/cuboid-route.png" style="background-color: white; padding: 10px;" />
 
 However, there are up to three "shortest" path candidates for any given cuboid and the shortest route doesn't always have integer length.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md
index cd56e94fe93..3e1206b4c4f 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md
@@ -12,7 +12,7 @@ Each of the six faces on a cube has a different digit (0 to 9) written on it; th
 
 For example, the square number 64 could be formed:
 
-<img class="img-responsive center-block" alt="two cubes, one with the number 6 and the other with number 4" src="https://cdn-media-1.freecodecamp.org/project-euler/cube-digit-pairs.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="two cubes, one with the number 6 and the other with number 4" src="https://cdn-media-1.freecodecamp.org/project-euler/cube-digit-pairs.png" style="background-color: white; padding: 10px;" />
 
 In fact, by carefully choosing the digits on both cubes it is possible to display all of the square numbers below one-hundred: 01, 04, 09, 16, 25, 36, 49, 64, and 81.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md
index 2e6e3b343ee..7874cbab3fc 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md
@@ -10,11 +10,11 @@ dashedName: problem-91-right-triangles-with-integer-coordinates
 
 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;">
+<img class="img-responsive center-block" alt="a graph plotting points P (x_1, y_1) and Q(x_2, y_2) at integer coordinates that are joined to the origin O (0, 0)" src="https://cdn-media-1.freecodecamp.org/project-euler/right-triangles-integer-coordinates-1.png" style="background-color: white; padding: 10px;" />
 
 There are exactly fourteen triangles containing a right angle that can be formed when each co-ordinate lies between 0 and 2 inclusive; that is, $0 ≤ x_1, y_1, x_2, y_2 ≤ 2$.
 
-<img class="img-responsive center-block" alt="a diagram showing the 14 triangles containing a right angle that can be formed when each coordinate is between 0 and 2" src="https://cdn-media-1.freecodecamp.org/project-euler/right-triangles-integer-coordinates-2.png" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="a diagram showing the 14 triangles containing a right angle that can be formed when each coordinate is between 0 and 2" src="https://cdn-media-1.freecodecamp.org/project-euler/right-triangles-integer-coordinates-2.png" style="background-color: white; padding: 10px;" />
 
 Given that $0 ≤ x_1, y_1, x_2, y_2 ≤ limit$, how many right triangles can be formed?
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-92-square-digit-chains.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-92-square-digit-chains.md
index 6b5f3bdd45d..c560f06847c 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-92-square-digit-chains.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-92-square-digit-chains.md
@@ -12,10 +12,8 @@ A number chain is created by continuously adding the square of the digits in a n
 
 For example,
 
-$$\begin{align}
-  & 44 → 32 → 13 → 10 → \boldsymbol{1} → \boldsymbol{1}\\\\
-  & 85 → \boldsymbol{89} → 145 → 42 → 20 → 4 → 16 → 37 → 58 → \boldsymbol{89}\\\\
-\end{align}$$
+$$\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.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-95-amicable-chains.md b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-95-amicable-chains.md
index 66805b9940a..fe2d422a206 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-95-amicable-chains.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/project-euler/problem-95-amicable-chains.md
@@ -14,9 +14,7 @@ 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:
 
-$$
-  12496 → 14288 → 15472 → 14536 → 14264 \\,(→ 12496 → \cdots)
-$$
+$$ 12496 → 14288 → 15472 → 14536 → 14264 \\,(→ 12496 → \cdots) $$
 
 Since this chain returns to its starting point, it is called an amicable chain.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/100-doors.md b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/100-doors.md
index 1db8228f4af..d9660cb9e8a 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/100-doors.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/100-doors.md
@@ -1,6 +1,6 @@
 ---
 id: 594810f028c0303b75339acb
-title: 100 doors
+title: 100 Türen
 challengeType: 1
 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.
+Es gibt 100 Türen in einer Reihe, die zunächst alle geschlossen sind. 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--
 
@@ -16,13 +16,13 @@ Implement a function to determine the state of the doors after the last pass. Re
 
 # --hints--
 
-`getFinalOpenedDoors` should be a function.
+`getFinalOpenedDoors` sollte eine Funktion sein.
 
 ```js
 assert(typeof getFinalOpenedDoors === 'function');
 ```
 
-`getFinalOpenedDoors` should return an array.
+`getFinalOpenedDoors` sollte einen Array zurückgeben.
 
 ```js
 assert(Array.isArray(getFinalOpenedDoors(100)));
diff --git a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/24-game.md b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/24-game.md
index 02282d828f0..ac16df78509 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/24-game.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/24-game.md
@@ -24,10 +24,10 @@ Implement a function that takes a string of four digits as its argument, with ea
   <li> The order of the digits when given does not have to be preserved. </li>
 </ul>
 
-| Example input                 | Example output            |
-| ----------------------------- | ------------------------- |
-| <code>solve24("4878");</code> | <code>(7-8/8)\*4</code>   |
-| <code>solve24("1234");</code> | <code>3\*1\*4\*2</code>   |
+| Example input             | Example output            |
+| ------------------------- | ------------------------- |
+| <code>solve24("4878");</code> | <code>(7-8/8)\*4</code> |
+| <code>solve24("1234");</code> | <code>3\*1\*4\*2</code> |
 | <code>solve24("6789");</code> | <code>(6\*8)/(9-7)</code> |
 | <code>solve24("1127");</code> | <code>(1+7)\*(2+1)</code> |
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/balanced-brackets.md b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/balanced-brackets.md
index 9332dcea513..1de7c2352ce 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/balanced-brackets.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/balanced-brackets.md
@@ -13,11 +13,11 @@ Determine whether a generated string of brackets is balanced; that is, whether i
 **Examples:**
 | Input                     | Output |
 | ------------------------- | ------ |
-| <code>\[]</code>          | true   |
-| <code>]\[</code>          | false  |
-| <code>[][]</code>         | true   |
-| <code>]\[]</code>         | false  |
-| <code>\[]]\[\[]</code>    | false  |
+| <code>\[]</code> | true   |
+| <code>]\[</code> | false  |
+| <code>[][]</code> | true   |
+| <code>]\[]</code> | false  |
+| <code>\[]]\[\[]</code> | false  |
 | <code>\[\[\[\[]]]]</code> | true   |
 
 # --hints--
diff --git a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
index 0ae699eca5b..df465f24694 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
@@ -12,7 +12,7 @@ A list is a ordered set of values that may contain duplicates. Here is an exampl
 
 ```js
 const list = [['AA',  'BB', 'CC'], ['AA', 'ACB', 'AA'], [], ['AA']];
-````
+```
 
 Given a list of arbitrarily many strings, implement a function for each of the following conditions:
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md
index 9024a9ebd7c..683a565c301 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md
@@ -19,10 +19,10 @@ Demonstrate that it passes the following three test-cases:
 
 <div style='font-size:115%; font-weight: bold;'>Test Cases</div>
 
-| Input number | Output number                         |
-| ------------ | ------------------------------------- |
-| 7259         | <code>2 hr, 59 sec</code>             |
-| 86400        | <code>1 d</code>                      |
+| Input number | Output number             |
+| ------------ | ------------------------- |
+| 7259         | <code>2 hr, 59 sec</code> |
+| 86400        | <code>1 d</code> |
 | 6000000      | <code>9 wk, 6 d, 10 hr, 40 min</code> |
 
 <div style="font-size:115%; font-weight: bold;">Details</div>
@@ -32,11 +32,11 @@ Demonstrate that it passes the following three test-cases:
 
 | Unit   | Suffix used in Output | Conversion            |
 | ------ | --------------------- | --------------------- |
-| week   | <code>wk</code>       | 1 week = 7 days       |
-| day    | <code>d</code>        | 1 day = 24 hours      |
-| hour   | <code>hr</code>       | 1 hour = 60 minutes   |
-| minute | <code>min</code>      | 1 minute = 60 seconds |
-| second | <code>sec</code>      | ---                   |
+| week   |!!crwdBlockTags_18_sgaTkcolBdwrc!!       | 1 week = 7 days       |
+| day    |!!crwdBlockTags_19_sgaTkcolBdwrc!!        | 1 day = 24 hours      |
+| hour   |!!crwdBlockTags_20_sgaTkcolBdwrc!!       | 1 hour = 60 minutes   |
+| minute |!!crwdBlockTags_21_sgaTkcolBdwrc!!      | 1 minute = 60 seconds |
+| second |!!crwdBlockTags_22_sgaTkcolBdwrc!!      | ---                   |
 
   </li>
   <li>
diff --git a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md
index 893cca49aa5..2802c448aaa 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md
@@ -18,12 +18,12 @@ $$\mu ={\frac {2+4+4+4+5+5+7+9}{8}}={\frac {40}{8}}=5$$
 
 First, calculate the deviations of each data point from the mean, and square the result of each:
 
-| Deviations of each data|  Square the result  |
-| ---------------------- | --------------------|
-| $(2-5)^{2}=(-3)^{2}=9$ | $(5-5)^{2}=0^{2}=0$ |
-| $(4-5)^{2}=(-1)^{2}=1$ | $(5-5)^{2}=0^{2}=0$ |
-| $(4-5)^{2}=(-1)^{2}=1$ | $(7-5)^{2}=2^{2}=4$ |
-| $(4-5)^{2}=(-1)^{2}=1$ | $(9-5)^{2}=4^{2}=16$|
+| Deviations of each data | Square the result    |
+| ----------------------- | -------------------- |
+| $(2-5)^{2}=(-3)^{2}=9$  | $(5-5)^{2}=0^{2}=0$  |
+| $(4-5)^{2}=(-1)^{2}=1$  | $(5-5)^{2}=0^{2}=0$  |
+| $(4-5)^{2}=(-1)^{2}=1$  | $(7-5)^{2}=2^{2}=4$  |
+| $(4-5)^{2}=(-1)^{2}=1$  | $(9-5)^{2}=4^{2}=16$ |
 
 The variance is the mean of these values:
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/discordian-date.md b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/discordian-date.md
index 2137292f8a2..bff43ccc37e 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/discordian-date.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/discordian-date.md
@@ -14,7 +14,7 @@ The <a href="http://www.rosettacode.org/wiki/Discordian_date" target="_blank" re
 The months, weekdays, Apostle events, and Holidays in the Discordian calendar are given by:
 
 Seasons: `'Chaos', 'Discord', 'Confusion', 'Bureaucracy', 'The Aftermath'`.
-  
+
 Weekdays: `'Sweetmorn', 'Boomtime', 'Pungenday', 'Prickle-Prickle', 'Setting Orange'`.
 
 Apostle: `'Mungday', 'Mojoday', 'Syaday', 'Zaraday', 'Maladay'`.
diff --git a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/euler-method.md b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/euler-method.md
index 90628549c3f..184c5a06891 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/euler-method.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/euler-method.md
@@ -89,7 +89,7 @@ and compare with the analytical solution.
   <li>room temperature <big>$T_R$</big> shall be <code>20 °C</code></li>
   <li>cooling constant <big>$k$</big> shall be <code>0.07</code></li>
   <li>time interval to calculate shall be from <code>0 s</code> to <code>100 s</code></li>
-</ul>  
+</ul>
 
 First parameter to the function is initial time, second parameter is initial temperature, third parameter is elapsed time and fourth parameter is step size.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/execute-brain.md b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/execute-brain.md
index 62a7d597284..20cb9d4da39 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/execute-brain.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/execute-brain.md
@@ -8,54 +8,54 @@ dashedName: execute-brain
 
 # --description--
 
-Write a function to implement a Brain\*\*\*\* interpreter. The function will take a string as a parameter and should return a string as the output. More details are given below:
+Write a function to implement a Brain\*\*\*\* interpreter. The function will take a string as a parameter and should return a string as the output. Weitere Details werden unten angegeben:
 
 RCBF is a set of <a href="https://rosettacode.org/wiki/Brainf***" target="_blank" rel="noopener noreferrer nofollow">Brainf\*\*\*</a> compilers and interpreters written for Rosetta Code in a variety of languages.
 
 Below are links to each of the versions of RCBF.
 
-An implementation need only properly implement the following instructions:
+Eine Implementierung muss lediglich die folgenden Anweisungen ordnungsgemäß implementieren:
 
-| Command           | Description                                                                        |
-| ----------------- | ---------------------------------------------------------------------------------- |
-| <code>></code>    | Move the pointer to the right                                                      |
-| <code>&lt;</code> | Move the pointer to the left                                                       |
-| <code>+</code>    | Increment the memory cell under the pointer                                        |
-| <code>-</code>    | Decrement the memory cell under the pointer                                        |
-| <code>.</code>    | Output the character signified by the cell at the pointer                          |
-| <code>,</code>    | Input a character and store it in the cell at the pointer                          |
-| <code>\[</code>   | Jump past the matching <code>]</code> if the cell under the pointer is 0           |
-| <code>]</code>    | Jump back to the matching <code>\[</code> if the cell under the pointer is nonzero |
+| Befehl                    | Beschreibung                                                                                |
+| ------------------------- | ------------------------------------------------------------------------------------------- |
+| <code>></code> | Bewege den Zeiger nach rechts                                                               |
+| <code>&lt;</code> | Bewege den Zeiger nach links                                                                |
+| <code>+</code> | Increment the memory cell under the pointer                                                 |
+| <code>-</code> | Decrement the memory cell under the pointer                                                 |
+| <code>.</code> | Output the character signified by the cell at the pointer                                   |
+| <code>,</code> | Input a character and store it in the cell at the pointer                                   |
+| <code>\[</code> | Jump past the matching <code>]</code> if the cell under the pointer is 0           |
+| <code>]</code> | Jump back to the matching <code>\[</code> if the cell under the pointer is nonzero |
 
 Any cell size is allowed, EOF (*E*nd-*O*-*F*ile) support is optional, as is whether you have bounded or unbounded memory.
 
 # --hints--
 
-`brain(bye)` should return a string
+`brain(bye)` sollte einen String zurückgeben
 
 ```js
 assert(typeof brain(bye) === 'string');
 ```
 
-`brain("++++++[>++++++++++<-]>+++++.")` should return "A"
+`brain("++++++[>++++++++++<-]>+++++.")` sollte "A" zurückgeben
 
 ```js
 assert.equal(brain('++++++[>++++++++++<-]>+++++.'), 'A');
 ```
 
-`brain(bye)` should return `Goodbye, World!\r\n`
+`brain(bye)` sollte `Goodbye, World!\r\n` zurückgeben
 
 ```js
 assert.equal(brain(bye), 'Goodbye, World!\r\n');
 ```
 
-`brain(hello)` should return `Hello World!\n`
+`brain(hello)` sollte `Hello World!\n` zurückgeben
 
 ```js
 assert.equal(brain(hello), 'Hello World!\n');
 ```
 
-`brain(fib)` should return `1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89`
+`brain(fib)` sollte `1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89` zurückgeben
 
 ```js
 assert.equal(brain(fib), '1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89');
diff --git a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
index debc5f4db0a..e05d87270f2 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
@@ -28,9 +28,7 @@ Create two functions named `ffr` and `ffs` that return `R(n)` or `S(n)`, respect
 
 No maximum value for `n` should be assumed.
 
-**References**
-
- <p>Rosetta: <a href='https://rosettacode.org/wiki/Hofstadter_Figure-Figure_sequences' target='_blank'>Hofstadter Figure-Figure sequences</a></p>.
+**References**<p>Rosetta: <a href='https://rosettacode.org/wiki/Hofstadter_Figure-Figure_sequences' target='_blank'>Hofstadter Figure-Figure sequences</a></p>.
 
 
 # --hints--
diff --git a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/least-common-multiple.md b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/least-common-multiple.md
index a3c747b6523..d84da1b8b61 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/least-common-multiple.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/least-common-multiple.md
@@ -8,11 +8,9 @@ dashedName: least-common-multiple
 
 # --description--
 
-The least common multiple of 12 and 18 is 36, because 12 is a factor (12 × 3 = 36), and 18 is a factor (18 × 2 = 36), and there is no positive integer less than 36 that has both factors. As a special case, if either $m$ or $n$ is zero, then the least common multiple is zero. One way to calculate the least common multiple is to iterate all the multiples of $m$, until you find one that is also a multiple of $n$. If you already have $gcd$ for <a href="https://rosettacode.org/wiki/Greatest_common_divisor" target="_blank" rel="noopener noreferrer nofollow">greatest common divisor</a>, then this formula calculates $lcm$. 
+The least common multiple of 12 and 18 is 36, because 12 is a factor (12 × 3 = 36), and 18 is a factor (18 × 2 = 36), and there is no positive integer less than 36 that has both factors. As a special case, if either $m$ or $n$ is zero, then the least common multiple is zero. One way to calculate the least common multiple is to iterate all the multiples of $m$, until you find one that is also a multiple of $n$. If you already have $gcd$ for <a href="https://rosettacode.org/wiki/Greatest_common_divisor" target="_blank" rel="noopener noreferrer nofollow">greatest common divisor</a>, then this formula calculates $lcm$.
 
-$$
-\\operatorname{lcm}(m, n) = \\frac{|m \\times n|}{\\operatorname{gcd}(m, n)}
-$$
+$$ \\operatorname{lcm}(m, n) = \\frac{|m \\times n|}{\\operatorname{gcd}(m, n)} $$
 
 # --instructions--
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
index 7b8dd9dbfc5..5b4f0d4c1d3 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
@@ -8,14 +8,10 @@ dashedName: longest-common-subsequence
 
 # --description--
 
-The **longest common subsequence** (or **LCS**) of groups A and B is the longest group of elements from A and B that are common between the two groups and in the same order in each group. For example, the sequences `1234` and `1224533324` have an LCS of `1234`:
-
-<u>1234</u>
-
+The **longest common subsequence** (or **LCS**) of groups A and B is the longest group of elements from A and B that are common between the two groups and in the same order in each group. For example, the sequences `1234` and `1224533324` have an LCS of `1234`:<u>1234</u>
 <u>12</u>245<u>3</u>332<u>4</u>
 
 For a string example, consider the sequences `thisisatest` and `testing123testing`. An LCS would be `tsitest`:
-
 <u>t</u>hi<u>si</u>sa<u>test</u>
 
 <u>t</u>e<u>s</u>t<u>i</u>ng123<u>test</u>ing.
diff --git a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
index 32c0af13202..8117215835e 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
@@ -8,11 +8,11 @@ dashedName: sailors-coconuts-and-a-monkey-problem
 
 # --description--
 
-Five sailors are shipwrecked on an island and collect a large pile of coconuts during the day. 
+Five sailors are shipwrecked on an island and collect a large pile of coconuts during the day.
 
-That night the first sailor wakes up and decides to take his first share early so tries to divide the pile of coconuts equally into five piles but finds that there is one coconut left over, so he tosses it to a monkey and then hides "his" one of the five equally sized piles of coconuts and pushes the other four piles together to form a single visible pile of coconuts again and goes to bed. 
+That night the first sailor wakes up and decides to take his first share early so tries to divide the pile of coconuts equally into five piles but finds that there is one coconut left over, so he tosses it to a monkey and then hides "his" one of the five equally sized piles of coconuts and pushes the other four piles together to form a single visible pile of coconuts again and goes to bed.
 
-To cut a long story short, each of the sailors in turn gets up once during the night and performs the same actions of dividing the coconut pile into five, finding that one coconut is left over and giving that single remainder coconut to the monkey, then push the other four piles together to form a single pile. 
+To cut a long story short, each of the sailors in turn gets up once during the night and performs the same actions of dividing the coconut pile into five, finding that one coconut is left over and giving that single remainder coconut to the monkey, then push the other four piles together to form a single pile.
 
 In the morning (after the surreptitious and separate action of each of the five sailors during the night), the remaining coconuts are divided into five equal piles for each of the sailors, whereupon it is found that the pile of coconuts divides equally amongst the sailors with no remainder. (Nothing for the monkey in the morning.)
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/sedols.md b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/sedols.md
index ca0b378bdfe..9ace124614e 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/sedols.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/sedols.md
@@ -67,7 +67,7 @@ assert(sedol('228276') === '2282765');
 ```js
 function sedol(input) {
   const checkSum = 0
-  
+
   return checkSum;
 }
 ```
diff --git a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/self-describing-numbers.md b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
index c3c93dbfa70..dc5318141ce 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
@@ -89,7 +89,7 @@ function isSelfDescribing(n) {
     if (digits.length != count.length) {
         return false;
     }
-    
+
     for (let i=0; i< digits.length; i++){
       if (digits[i] !== count[i]) {
         return false;
diff --git a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/sha-256.md b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/sha-256.md
index a607324d77e..183173a97d2 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/sha-256.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/sha-256.md
@@ -8,8 +8,7 @@ dashedName: sha-256
 
 # --description--
 
-The `SHA-2` family is a stronger alternative to `SHA-1`. The main difference between them is the length of the hash.
-Meaning `SHA-1` provides a shorter code with fewer possibilities for unique combinations. `SHA-2` or `SHA-256` creates a longer and thus more complex hash with more possibilities.
+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--
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
index 0c4d197eef9..af66009395b 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
@@ -8,7 +8,7 @@ dashedName: sorting-algorithmsstrand-sort
 
 # --description--
 
-The **Strand sort** creates sorted subsets that are merged to create the final result. 
+The **Strand sort** creates sorted subsets that are merged to create the final result.
 
 Consider an `unsortedArray = [3, 1, 4, 2]`. Pick the first item `3` and copy it into a separate array. Search for any bigger item following this item. When you find the a larger item, in this case `4`, copy it to the separate array, `[3, 4]`, and compare the following items to this new value, `4`.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/soundex.md b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/soundex.md
index 3072f3139f2..b51c5bc6b71 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/soundex.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/soundex.md
@@ -8,15 +8,15 @@ dashedName: soundex
 
 # --description--
 
-**Soundex Algorithm** deals with the *intentions* of the words. It creates a representation for similar sounding words. 
+**Soundex Algorithm** deals with the *intentions* of the words. It creates a representation for similar sounding words.
 
 It is used for searching <em>names</em> and <em>addresses</em>. This means that the person who filled in the <em>name</em>, can focus on how it sounds instead of correcting the spelling of <em>names</em>.
 
-For example: 
+For example:
 
-If you are hearing the name `Quenci` for the first time, and misspelled it, you will get **Soundex** code `Q520`. 
+If you are hearing the name `Quenci` for the first time, and misspelled it, you will get **Soundex** code `Q520`.
 
-When you spell the name `Quincy` correctly next time, you will still get the same code `Q520`, which means you can link multiple name pronunciations into the same <em>person</em> without the need for adding every spelling. 
+When you spell the name `Quincy` correctly next time, you will still get the same code `Q520`, which means you can link multiple name pronunciations into the same <em>person</em> without the need for adding every spelling.
 
 Here is the rules: 
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
index 3ab836e3745..596164f14b5 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
@@ -9,7 +9,7 @@ dashedName: towers-of-hanoi
 # --description--
 
 Solve the Towers of Hanoi problem. The number of objects will be given as the first parameter, followed by the strings used to identify each stack of objects. Create a nested array containing the list of moves, `["source", "destination"]`.
- 
+
 For example, the parameters `(4, 'A', 'B', 'C')`, will result in nested array of moves `[['A', 'C'], ['B', 'A']]`, indicating that the 1st move was to move an object from stack `A` to `C` and the 2nd move was to move an object from stack `B` to `A`.
 
 # --instructions--
diff --git a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/y-combinator.md b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/y-combinator.md
index bd770f28f50..0c867176bc4 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/y-combinator.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/y-combinator.md
@@ -14,7 +14,7 @@ The Y combinator is itself a stateless function that, when applied to another st
 
 # --instructions--
 
-Define the stateless Y combinator function and use it to compute the factorials. The `factorial(N)` function is already given to you. 
+Define the stateless Y combinator function and use it to compute the factorials. The `factorial(N)` function is already given to you.
 
 # --hints--
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
index 6f8cf62dafa..16b17783ed3 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
@@ -44,12 +44,7 @@ It produces the thinned output:
 
 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:
 
-$$\begin{array}{|c|c|c|}
-  \\hline
-  P9 & P2              & P3\\\\ \\hline
-  P8 & \boldsymbol{P1} & P4\\\\ \\hline
-  P7 & P6              & P5\\\\ \\hline
-\end{array}$$
+$$\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.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
index 1895c60f5ae..b9b3f8c8699 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
@@ -10,7 +10,7 @@ dashedName: build-a-freecodecamp-forum-homepage
 
 **Objective:** Build an app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/JqdoMV>.
 
-Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
+Erfülle die folgenden User Stories und bestehe alle Tests. Verwende Bibliotheken und APIs deiner Wahl. Gib dem Ganzen deinen persönlichen Stil.
 
 **User Story:** I can see a list of the most recent posts on the freeCodeCamp forum.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
index 2a80ee5378e..a33a7775579 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
@@ -12,7 +12,7 @@ dashedName: build-a-light-bright-app
 
 **Rule #1:** Don't look at the example project's code. Figure it out for yourself.
 
-**Rule #2:** Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
+**Rule #2:** Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Gib dem Ganzen deinen persönlichen Stil.
 
 **User Story:** I can click or drag the mouse cursor to color the circles.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
index 51255e5a7d5..abd81ad5178 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
@@ -22,7 +22,7 @@ Here are the specific user stories you should implement for this project:
 
 **Hint:** Try using the Yelp API to find venues in the cities your users search for. If you use Yelp's API, be sure to mention so in your app.
 
-When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+Wenn du fertig bist, stelle sicher, dass dein Projekt öffentlich zugänglich gehostet ist. Gib dann die URL in das `Solution Link`-Feld ein. Füge optional einen Link zum Quellcode deines Projekts in das `GitHub Link`-Feld ein.
 
 # --solutions--
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
index 3020d0b7ee8..8d09386d891 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
@@ -10,7 +10,7 @@ dashedName: build-a-pinterest-clone
 
 **Objective:** Build an app that is functionally similar to this: <a href="https://build-a-pinterest-clone.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://build-a-pinterest-clone.freecodecamp.rocks/</a>.
 
-Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
+Erfülle die folgenden User Stories und bestehe alle Tests. Verwende Bibliotheken und APIs deiner Wahl. Gib dem Ganzen deinen persönlichen Stil.
 
 **User Story:** As an unauthenticated user, I can login with GitHub.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-pong-game.md b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
index 3522056c712..89099571dc4 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
@@ -12,7 +12,7 @@ dashedName: build-a-pong-game
 
 **Rule #1:** Don't look at the example project's code. Figure it out for yourself.
 
-**Rule #2:** Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
+**Rule #2:** Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Gib dem Ganzen deinen persönlichen Stil.
 
 **User Story:** I can control a paddle.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
index c457e33ccc1..af26807e9d5 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
@@ -10,7 +10,7 @@ dashedName: build-a-recipe-box
 
 **Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/dNVazZ/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/dNVazZ/</a>.
 
-Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
+Erfülle die folgenden User Stories und bestehe alle Tests. Verwende Bibliotheken und APIs deiner Wahl. Gib dem Ganzen deinen persönlichen Stil.
 
 **User Story:** I can create recipes that have names and ingredients.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
index b43936fdfcb..e1117f91960 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
@@ -10,7 +10,7 @@ dashedName: build-a-roguelike-dungeon-crawler-game
 
 **Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/apLXEJ/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/apLXEJ/</a>.
 
-Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Gib dem Ganzen deinen persönlichen Stil.
 
 **User Story:** I have health, a level, and a weapon. I can pick up a better weapon. I can pick up health items.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-simon-game.md b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
index 2ff2d760541..0da0c56a650 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
@@ -10,7 +10,7 @@ dashedName: build-a-simon-game
 
 **Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/obYBjE" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/obYBjE</a>.
 
-Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Gib dem Ganzen deinen persönlichen Stil.
 
 **User Story:** I am presented with a random series of button presses.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
index 2f79f73178e..fdc3bd21ba6 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
@@ -10,7 +10,7 @@ dashedName: build-a-tic-tac-toe-game
 
 **Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/KzXQgy/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/KzXQgy/</a>.
 
-Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Gib dem Ganzen deinen persönlichen Stil.
 
 **User Story:** I can play a game of Tic Tac Toe with the computer.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
index adcef83386e..b5502ce0bca 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
@@ -1,6 +1,6 @@
 ---
 id: bd7158d8c442eddfaeb5bd19
-title: Build a Wikipedia Viewer
+title: Erstelle einen Wikipedia-Viewer
 challengeType: 3
 forumTopicId: 302360
 dashedName: build-a-wikipedia-viewer
@@ -12,13 +12,13 @@ dashedName: build-a-wikipedia-viewer
 
 The MediaWiki software powers Wikipedia, and it helps you collect and organize knowledge and make it available to people.
 
-Using the MediaWiki API, replicate the search function and random article function, similar to the example app above. You can use Wikipedia as your data source.
+Using the MediaWiki API, replicate the search function and random article function, similar to the example app above. Du kannst Wikipedia als deine Datenquelle verwenden.
 
-Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
+Erfülle die folgenden User Stories und bestehe alle Tests. Verwende Bibliotheken und APIs deiner Wahl. Gib dem Ganzen deinen persönlichen Stil.
 
 **User Story:** I can search Wikipedia entries in a search box and see the resulting Wikipedia entries.
 
-**User Story:** I can click a button to see a random Wikipedia entry.
+**User Story:** Ich kann einen Button klicken, um einen zufälligen Wikipedia-Eintrag zu sehen.
 
 When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
index 8a07168f613..bce3948e624 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
@@ -21,7 +21,7 @@ At each step in time, the following transitions occur:
 - Any live cell with more than three live neighbours dies, as if by overpopulation.
 - Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.
 
-Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
+Erfülle die folgenden User Stories und bestehe alle Tests. Verwende Bibliotheken und APIs deiner Wahl. Gib dem Ganzen deinen persönlichen Stil.
 
 **User Story:** When I first arrive at the game, it will randomly generate a board and start playing.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md
index a5562365284..b291dbdbea4 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md
@@ -20,7 +20,7 @@ Here are the specific user stories you should implement for this project:
 
 **User Story:** You can see changes in real-time when any other user adds or removes a stock. For this you will need to use Web Sockets.
 
-When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+Wenn du fertig bist, stelle sicher, dass dein Projekt öffentlich zugänglich gehostet ist. Gib dann die URL in das `Solution Link`-Feld ein. Füge optional einen Link zum Quellcode deines Projekts in das `GitHub Link`-Feld ein.
 
 # --solutions--
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
index fca6420cdc5..219f0b3b098 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
@@ -1,6 +1,6 @@
 ---
 id: bd7158d8c443eddfaeb5bd0f
-title: Manage a Book Trading Club
+title: Verwalte einen Buchhandelsclub
 challengeType: 4
 forumTopicId: 302364
 dashedName: manage-a-book-trading-club
@@ -10,11 +10,11 @@ dashedName: manage-a-book-trading-club
 
 **Objective:** Build an app that is functionally similar to this: <a href="https://manage-a-book-trading-club.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://manage-a-book-trading-club.freecodecamp.rocks/</a>.
 
-Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
+Erfülle die folgenden User Stories und bestehe alle Tests. Verwende Bibliotheken und APIs deiner Wahl. Gib dem Ganzen deinen persönlichen Stil.
 
 **User Story:** I can view all books posted by every user.
 
-**User Story:** I can add a new book.
+**User Story:** Ich kann ein neues Buch hinzufügen.
 
 **User Story:** I can update my settings to store my full name, city, and state.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
index 951f1c5c429..a9d8995b241 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
@@ -10,7 +10,7 @@ dashedName: map-data-across-the-globe
 
 **Objective:** Build an app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/mVEJag>.
 
-Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
+Erfülle die folgenden User Stories und bestehe alle Tests. Verwende Bibliotheken und APIs deiner Wahl. Gib dem Ganzen deinen persönlichen Stil.
 
 **User Story:** I can see where all Meteorites landed on a world map.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md
index 590a5bb4a00..43f4bc699b7 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md
@@ -10,7 +10,7 @@ dashedName: p2p-video-chat-application
 
 **Objective:** Build an app that is functionally similar to this: <a href="https://p2p-video-chat-application.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://p2p-video-chat-application.freecodecamp.rocks/</a>.
 
-Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
+Erfülle die folgenden User Stories und bestehe alle Tests. Verwende Bibliotheken und APIs deiner Wahl. Gib dem Ganzen deinen persönlichen Stil.
 
 **User Story:** Upon arriving, the browser will prompt me to access my camera and microphone.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
index 23f76537c24..913cd6cd045 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
@@ -10,7 +10,7 @@ dashedName: show-national-contiguity-with-a-force-directed-graph
 
 **Objective:** Build an app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/XWEONRz>.
 
-Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Gib dem Ganzen deinen persönlichen Stil.
 
 **User Story:** I can see a Force-directed Graph that shows which countries share borders.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/show-the-local-weather.md b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
index d5b751f8a62..79a930f3cbb 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
@@ -12,7 +12,7 @@ dashedName: show-the-local-weather
 
 **Rule #1:** Don't look at the example project's code. Figure it out for yourself.
 
-**Rule #2:** Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
+**Regel #2:** Erfülle die folgenden User Stories und bestehe alle Tests. Verwende Bibliotheken und APIs deiner Wahl. Gib dem Ganzen deinen persönlichen Stil.
 
 **User Story:** I can see the weather in my current location.
 
diff --git a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
index 328ba2183d2..bc7796e0b4b 100644
--- a/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
+++ b/curriculum/challenges/german/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
@@ -12,7 +12,7 @@ dashedName: use-the-twitch-json-api
 
 The Twitch API is a RESTful API that lets developers build creative integrations for the broader Twitch community.
 
-Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
+Erfülle die folgenden User Stories und bestehe alle Tests. Verwende Bibliotheken und APIs deiner Wahl. Gib dem Ganzen deinen persönlichen Stil.
 
 **User Story:** I can see whether freeCodeCamp is currently streaming on Twitch.tv.
 
diff --git a/curriculum/challenges/german/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md b/curriculum/challenges/german/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md
index f4b640d4768..f43cc60a47c 100644
--- a/curriculum/challenges/german/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md
+++ b/curriculum/challenges/german/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md
@@ -62,7 +62,7 @@ The `plotImages` function will be used a few times to plot images. It takes an a
 
 ## Cell 5
 
-Recreate the `train_image_generator` using `ImageDataGenerator`. 
+Recreate the `train_image_generator` using `ImageDataGenerator`.
 
 Since there are a small number of training examples, there is a risk of overfitting. One way to fix this problem is by creating more training data from existing training examples by using random transformations.
 
@@ -90,7 +90,7 @@ Run this cell to visualize the accuracy and loss of the model.
 
 Now it is time to use your model to predict whether a brand new image is a cat or a dog.
 
-In this cell, get the probability that each test image (from `test_data_gen`) is a dog or a cat. `probabilities` should be a list of integers. 
+In this cell, get the probability that each test image (from `test_data_gen`) is a dog or a cat. `probabilities` should be a list of integers.
 
 Call the `plotImages` function and pass in the test images and the probabilities corresponding to each test image.
 
diff --git a/curriculum/challenges/german/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md b/curriculum/challenges/german/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
index f5535504bbb..11ba8ef9b4e 100644
--- a/curriculum/challenges/german/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
+++ b/curriculum/challenges/german/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
@@ -26,7 +26,7 @@ The file `RPS.py` shows an example function that you will need to update. The ex
 
 ## Development
 
-Do not modify `RPS_game.py`. Write all your code in `RPS.py`. For development, you can use `main.py` to test your code. 
+Do not modify `RPS_game.py`. Write all your code in `RPS.py`. For development, you can use `main.py` to test your code.
 
 `main.py` imports the game function and bots from `RPS_game.py`.
 
@@ -48,7 +48,7 @@ play(player, quincy, 1000, verbose=True)
 
 Click the "run" button and `main.py` will run.
 
-## Testing 
+## Testing
 
 The unit tests for this project are in `test_module.py`. We imported the tests from `test_module.py` to `main.py` for your convenience. If you uncomment the last line in `main.py`, the tests will run automatically whenever you hit the "run" button.
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/build-a-personal-portfolio-webpage-project/build-a-personal-portfolio-webpage.md b/curriculum/challenges/german/14-responsive-web-design-22/build-a-personal-portfolio-webpage-project/build-a-personal-portfolio-webpage.md
index 2290577c9d0..b2b9370f806 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/build-a-personal-portfolio-webpage-project/build-a-personal-portfolio-webpage.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/build-a-personal-portfolio-webpage-project/build-a-personal-portfolio-webpage.md
@@ -13,11 +13,11 @@ dashedName: build-a-personal-portfolio-webpage
 **User Stories:**
 
 1. Dein Portfolio sollte einen Begrüßungsbereich mit einer `id` von `welcome-section` besitzen
-1. Der Begrüßungsbereich sollte ein `h1` Element mit Text enthalten
+1. Der Begrüßungsbereich sollte ein `h1`-Element mit Text enthalten
 1. Dein Portfolio sollte einen Projektabschnitt mit einer `id` von `projects` besitzen
 1. Der Projektabschnitt sollte mindestens ein Element mit einer `class` von `project-tile` besitzen, um das Projekt zu halten
 1. Der Projektabschnitt sollte mindestens einen Link zu einem Projekt enthalten
-1. Dein Portfolio sollte eine Navigationsleiste mit einer Id von `navbar` haben
+1. Dein Portfolio sollte eine Navigationsleiste mit einer ID von `navbar` haben
 1. Die Navigationsleiste sollte mindestens einen auswählbaren Link haben, der zu verschiedenen Bereichen der Seite navigiert
 1. Dein Portfolio sollte einen Link mit der ID `profile-link` haben, der dein GitHub- oder freeCodeCamp-Profil in einem neuen Tab öffnet
 1. Dein Portfolio sollte mindestens eine Media Query (Medienabfrage) enthalten
@@ -37,7 +37,7 @@ const el = document.getElementById('welcome-section')
 assert(!!el);
 ```
 
-Dein `#welcome-section` Element sollte ein `h1` Element beinhalten.
+Your `#welcome-section` element should contain an `h1` element.
 
 ```js
 assert.isAbove(
@@ -47,7 +47,7 @@ assert.isAbove(
 );
 ```
 
-Du solltest keine leeren `h1` Elemente innerhalb des `#welcome-section` Elements haben.
+Du solltest keine leeren `h1`-Elemente innerhalb des `#welcome-section`-Elements haben.
 
 ```js
 assert.isAbove(
@@ -74,7 +74,7 @@ assert.isAbove(
 );
 ```
 
-Dein `#projects` Element sollte mindestens ein `a` Element beinhalten.
+Dein `#projects`-Element sollte mindestens ein `a`-Element beinhalten.
 
 ```js
 assert.isAbove(document.querySelectorAll('#projects a').length, 0);
@@ -87,11 +87,11 @@ const el = document.getElementById('navbar');
 assert(!!el);
 ```
 
-Dein `#navbar` Element sollte mindestens ein `a` Element, dessen `href` Attribut mit `#` beginnt, haben.
+Dein `#navbar`-Element sollte mindestens ein `a`-Element, dessen `href`-Attribut mit `#` beginnt, haben.
 
 ```js
 const links = [...document.querySelectorAll('#navbar a')].filter(
-  (nav) => (nav?.getAttribute('href') || '').substr(0, 1) === '#'
+  (nav) => (nav?.getAttribute('href') || '').substring(0, 1) === '#'
 );
 
 assert.isAbove(
@@ -101,14 +101,14 @@ assert.isAbove(
 );
 ```
 
-Dein Portfolio sollte ein `a` Element mit einer `id` von `profile-link` haben.
+Dein Portfolio sollte ein `a`-Element mit einer `id` von `profile-link` haben.
 
 ```js
 const el = document.getElementById('profile-link');
 assert(!!el && el.tagName === 'A')
 ```
 
-Dein `#profile-link` Element sollte ein `target` Attribut von `_blank` haben.
+Dein `#profile-link`-Element sollte ein `target`-Attribut von `_blank` haben.
 
 ```js
 const el = document.getElementById('profile-link');
@@ -123,7 +123,7 @@ const cssCheck = new __helpers.CSSHelp(document).getCSSRules('media')
 assert(cssCheck.length > 0 || htmlSourceAttr.length > 0);
 ```
 
-Dein `#navbar` Element sollte immer oben im Viewport liegen.
+Dein `#navbar`-Element sollte immer oben im Viewport liegen.
 
 ```js
 (async () => {
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md b/curriculum/challenges/german/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md
index 251e35f52b0..ac8808d9bc6 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md
@@ -91,7 +91,7 @@ const el = document.getElementById('name')
 assert(!!el && el.required)
 ```
 
-Dein `#name` sollte ein Nachfahre von `#survey-form` sein.
+Your `#name` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #name')
@@ -119,7 +119,7 @@ const el = document.getElementById('email')
 assert(!!el && el.required)
 ```
 
-Deine `#email` sollte ein Nachfahre von `#survey-form` sein
+Your `#email` should be a descendant of `#survey-form`
 
 ```js
 const el = document.querySelector('#survey-form #email')
@@ -133,7 +133,7 @@ const el = document.getElementById('number')
 assert(!!el && el.tagName === 'INPUT')
 ```
 
-Deine `#number` sollte ein Nachfahre von `#survey-form` sein.
+Your `#number` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #number')
@@ -203,21 +203,21 @@ const el = document.getElementById('number-label')
 assert(!!el && el.innerText.length > 0)
 ```
 
-Dein `#name-label` sollte ein Nachfahre von `#survey-form` sein.
+Your `#name-label` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #name-label')
 assert(!!el)
 ```
 
-Dein `#email-label` sollte ein Nachfahre von `#survey-form` sein.
+Your `#email-label` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #email-label')
 assert(!!el)
 ```
 
-Dein `#number-label` sollte ein Nachfahre von `#survey-form` sein.
+Your `#number-label` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #number-label')
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/build-a-technical-documentation-page-project/build-a-technical-documentation-page.md b/curriculum/challenges/german/14-responsive-web-design-22/build-a-technical-documentation-page-project/build-a-technical-documentation-page.md
index 9b184a652c2..38077b84c91 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/build-a-technical-documentation-page-project/build-a-technical-documentation-page.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/build-a-technical-documentation-page-project/build-a-technical-documentation-page.md
@@ -1,6 +1,6 @@
 ---
 id: 587d78b0367417b2b2512b05
-title: Build a Technical Documentation Page
+title: Erstellen einer Seite zur technischen Dokumentation
 challengeType: 14
 forumTopicId: 301146
 dashedName: build-a-technical-documentation-page
@@ -12,29 +12,29 @@ dashedName: build-a-technical-documentation-page
 
 **User Stories:**
 
-1. You can see a `main` element with a corresponding `id="main-doc"`, which contains the page's main content (technical documentation)
-1. Within the `#main-doc` element, you can see several `section` elements, each with a class of `main-section`. There should be a minimum of five
-1. The first element within each `.main-section` should be a `header` element, which contains text that describes the topic of that section.
+1. Du kannst ein `main`-Element mit einer entsprechenden `id="main-doc"` sehen, das den Hauptinhalt der Seite enthält (technische Dokumentation)
+1. Within the `#main-doc` element, you can see several `section` elements, each with a class of `main-section`. Es sollten mindestens 5 sein
+1. Das erste Element innerhalb jeder `.main-section` sollte ein `header`-Element sein, das einen Text enthält, der das Thema dieses Abschnitts beschreibt.
 1. Each `section` element with the class of `main-section` should also have an `id` that corresponds with the text of each `header` contained within it. Any spaces should be replaced with underscores (e.g. The section that contains the header "JavaScript and Java" should have a corresponding `id="JavaScript_and_Java"`)
 1. The `.main-section` elements should contain at least ten `p` elements total (not each)
 1. The `.main-section` elements should contain at least five `code` elements total (not each)
 1. The `.main-section` elements should contain at least five `li` items total (not each)
 1. You can see a `nav` element with a corresponding `id="navbar"`
-1. The navbar element should contain one `header` element which contains text that describes the topic of the technical documentation
+1. Das navbar-Element sollte ein `header`-Element enthalten, das einen Text enthält, der das Thema der technischen Dokumentation beschreibt
 1. Additionally, the navbar should contain link (`a`) elements with the class of `nav-link`. There should be one for every element with the class `main-section`
 1. The `header` element in the `#navbar` must come before any link (`a`) elements in the navbar
 1. Each element with the class of `nav-link` should contain text that corresponds to the `header` text within each `section` (e.g. if you have a "Hello world" section/header, your navbar should have an element which contains the text "Hello world")
 1. When you click on a navbar element, the page should navigate to the corresponding section of the `#main-doc` element (e.g. If you click on a `.nav-link` element that contains the text "Hello world", the page navigates to a `section` element with that id, and contains the corresponding header)
 1. On regular sized devices (laptops, desktops), the element with `id="navbar"` should be shown on the left side of the screen and should always be visible to the user
-1. Your technical documentation should use at least one media query
+1. Deine technische Dokumentation sollte mindestens eine Media Query verwenden
 
-Fulfill the user stories and pass all the tests below to complete this project. Give it your own personal style. Happy Coding!
+Erfülle die folgenden User Stories und bestehe alle Tests, um dieses Projekt abzuschließen. Gib dem Ganzen deinen persönlichen Stil. Viel Spaß beim Programmieren!
 
-**Note:** Be sure to add `<link rel="stylesheet" href="styles.css">` in your HTML to link your stylesheet and apply your CSS
+**Hinweis:** Füge unbedingt `<link rel="stylesheet" href="styles.css">` in dein HTML ein, um dein Stylesheet zu verlinken und dein CSS anzuwenden
 
 # --hints--
 
-You should have a `main` element with an `id` of `main-doc`.
+Du solltest ein `main`-Element mit einer `id` von `main-doc` haben.
 
 ```js
 const el = document.getElementById('main-doc')
@@ -48,7 +48,7 @@ const els = document.querySelectorAll('#main-doc section')
 assert(els.length >= 5)
 ```
 
-All of your `.main-section` elements should be `section` elements.
+All deine `.main-section`-Elemente sollten `section`-Elemente sein.
 
 ```js
 const els = document.querySelectorAll('.main-section')
@@ -58,14 +58,14 @@ els.forEach(el => {
 assert(els.length > 0)
 ```
 
-You should have at least five `.main-section` elements that are descendants of `#main-doc`.
+Du solltest mindestens fünf `.main-section`-Elemente haben, die Nachfahren (descendants) von `#main-doc` sind.
 
 ```js
 const els = document.querySelectorAll('#main-doc .main-section')
 assert(els.length >= 5)
 ```
 
-The first child of each `.main-section` should be a `header` element.
+Das erste untergeordnete Element jeder `.main-section` sollte ein `header`-Element sein.
 
 ```js
 const els = document.querySelectorAll('.main-section')
@@ -75,7 +75,7 @@ els.forEach(el => {
 assert(els.length > 0)
 ```
 
-None of your `header` elements should be empty.
+Keines deiner `header`-Elemente sollte leer sein.
 
 ```js
 const els = document.querySelectorAll('header')
@@ -85,7 +85,7 @@ els.forEach(el => {
 assert(els.length > 0)
 ```
 
-All of your `.main-section` elements should have an `id`.
+All deine `.main-section`-Elemente sollten eine `id` haben.
 
 ```js
 const els = document.querySelectorAll('.main-section')
@@ -106,21 +106,21 @@ els.forEach(el => {
 assert(els.length > 0)
 ```
 
-You should have at least 10 `p` elements (total) within your `.main-section` elements.
+Du solltest (insgesamt) mindestens 10 `p`-Elemente innerhalb deiner `.main-section`-Elemente haben.
 
 ```js
 const els = document.querySelectorAll('.main-section p')
 assert(els.length >= 10)
 ```
 
-You should have at least five `code` elements that are descendants of `.main-section` elements.
+Du solltest mindestens fünf `code`-Elemente haben, die Nachfahren (descendants) von `.main-section`-Elementen sind.
 
 ```js
 const els = document.querySelectorAll('.main-section code')
 assert(els.length >= 5)
 ```
 
-You should have at least five `li` elements that are descendants of `.main-section` elements.
+Du solltest mindestens fünf `li`-Elemente haben, die Nachfahren (descendants) von `.main-section`-Elementen sind.
 
 ```js
 const els = document.querySelectorAll('.main-section li')
@@ -166,7 +166,7 @@ const els2 = document.querySelectorAll('#navbar .nav-link')
 assert(els2.length > 0 && els1.length === els2.length)
 ```
 
-You should have the same number of `.nav-link` and `.main-section` elements.
+Du solltest die gleiche Anzahl an `.nav-link`- und `.main-section`-Elementen haben.
 
 ```js
 const els1 = document.querySelectorAll('.main-section')
@@ -174,7 +174,7 @@ const els2 = document.querySelectorAll('.nav-link')
 assert(els1.length > 0 && els2.length > 0 && els1.length === els2.length)
 ```
 
-The `header` element in the `#navbar` should come before any link (`a`) elements also in the `#navbar`.
+Das `header`-Element in der `#navbar` sollte auch vor jedem Linkelement (`a`) in der `#navbar` stehen.
 
 ```js
 const navLinks = document.querySelectorAll('#navbar a.nav-link');
@@ -203,7 +203,7 @@ const remainder = headerText.filter(str => linkText.indexOf(str) === -1)
 assert(headerText.length > 0 && headerText.length > 0 && remainder.length === 0)
 ```
 
-Each `.nav-link` should have an `href` attribute that links to its corresponding `.main-section` (e.g. If you click on a `.nav-link` element that contains the text "Hello world", the page navigates to a `section` element with that id).
+Jede `.nav-link` sollte über ein `href`-Attribut verfügen, das auf die zugehörige `.main-section` verweist (klickst du bspw. auf ein `.nav-link`-Element, das den Text „Hello world“ enthält, navigiert die Seite zu dem `section`-Element mit eben jener ID).
 
 ```js
 const hrefValues = Array.from(document.querySelectorAll('.nav-link')).map(el => el.getAttribute('href'))
@@ -212,7 +212,7 @@ const missingHrefValues = mainSectionIDs.filter(str => hrefValues.indexOf('#' +
 assert(hrefValues.length > 0 && mainSectionIDs.length > 0 && missingHrefValues.length === 0)
 ```
 
-Your `#navbar` should always be on the left edge of the window.
+Deine `#navbar` sollte sich immer am linken Rand des Fensters befinden.
 
 ```js
 const el = document.getElementById('navbar')
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61329b210dac0b08047fd6ab.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61329b210dac0b08047fd6ab.md
index 7454c67519b..c3a8b6ddbbd 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61329b210dac0b08047fd6ab.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61329b210dac0b08047fd6ab.md
@@ -1,6 +1,6 @@
 ---
 id: 61329b210dac0b08047fd6ab
-title: Step 3
+title: Schritt 3
 challengeType: 0
 dashedName: step-3
 ---
@@ -9,7 +9,7 @@ dashedName: step-3
 
 Continuing with the `meta` elements, a `viewport` definition tells the browser how to render the page. Including one betters visual accessibility on mobile, and improves _SEO_ (search engine optimization).
 
-Add a `viewport` definition with a `content` attribute detailing the `width` and `initial-scale` of the page.
+Füge eine `viewport`-Definition mit einem `content`-Attribut hinzu, das die `width` und den `initial-scale` der Seite beschreibt.
 
 # --hints--
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61329d52e5010e08d9b9d66b.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61329d52e5010e08d9b9d66b.md
index 364b18479b6..917e40146ce 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61329d52e5010e08d9b9d66b.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61329d52e5010e08d9b9d66b.md
@@ -7,31 +7,31 @@ dashedName: step-4
 
 # --description--
 
-Ein weiteres wichtiges `meta` Element für Accessibility und SEO ist die `description` Definition. Der Wert des Attributs `content` wird von Suchmaschinen verwendet, um eine Beschreibung deiner Seite bereitzustellen.
+Another important `meta` element for accessibility and SEO is the `description` definition. Der Wert des Attributs `content` wird von Suchmaschinen verwendet, um eine Beschreibung deiner Seite bereitzustellen.
 
-Füge ein `meta` Element mit einem `name` Attribut von `description` hinzu, and gebe ihm ein nützliches `content` Attribut.
+Add a `meta` element with the `name` attribute set to `description`, and give it a useful `content` attribute.
 
 # --hints--
 
-Du solltest ein neues `meta` Element zu dem `head` hinzufügen.
+You should add a new `meta` element to the `head`.
 
 ```js
 assert.equal(document.querySelectorAll('meta').length, 3);
 ```
 
-Du solltest `meta` ein `name` Attribut mit `description` geben.
+You should give the `meta` a `name` attribute of `description`.
 
 ```js
 assert.exists(document.querySelector('meta[name="description"]'));
 ```
 
-Du solltest `meta` ein `content` Attribut geben.
+You should give the `meta` a `content` attribute.
 
 ```js
 assert.notEmpty(document.querySelector('meta[name="description"]')?.content);
 ```
 
-Der `content` Attributwert sollte nicht mehr als 165 Zeichen lang sein. _Das ist die maximale Beschreibungslänge von Google._
+The `content` attribute value should not be more than 165 characters. _Das ist die maximale Beschreibungslänge von Google._
 
 ```js
 assert.isAtMost(document.querySelector('meta[name="description"]')?.content?.length, 165);
@@ -60,9 +60,9 @@ assert.isAtMost(document.querySelector('meta[name="description"]')?.content?.len
 
 ```css
 body {
-    background: #f5f6f7;
-    color: #1b1b32;
-    font-family: Helvetica;
-    margin: 0;
+  background: #f5f6f7;
+  color: #1b1b32;
+  font-family: Helvetica;
+  margin: 0;
 }
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6133d11ef548f51f876149e3.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6133d11ef548f51f876149e3.md
index c04e0afa0c0..9c960bac4c3 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6133d11ef548f51f876149e3.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6133d11ef548f51f876149e3.md
@@ -1,35 +1,35 @@
 ---
 id: 6133d11ef548f51f876149e3
-title: Step 6
+title: Schritt 6
 challengeType: 0
 dashedName: step-6
 ---
 
 # --description--
 
-Navigation is a core part of accessibility, and screen readers rely on you to provide the structure of your page. This is accomplished with semantic HTML elements.
+Navigation is a core part of accessibility, and screen readers rely on you to provide the structure of your page. Das geschieht mit semantischen HTML-Elementen.
 
-Add a `header` and a `main` element to your page.
+Füge die Elemente `header` und `main` deiner Seite hinzu.
 
-The `header` element will be used to introduce the page, as well as provide a navigation menu.
+Das `header`-Element wird verwendet, um die Seite vorzustellen und ein Navigationsmenü bereitzustellen.
 
-The `main` element will contain the core content of your page.
+Das `main`-Element wird den Kerninhalt deiner Seite enthalten.
 
 # --hints--
 
-You should add a `header` element to the `body`.
+Du solltest ein `header`-Element dem `body` hinzufügen.
 
 ```js
 assert.exists(document.querySelector('body > header'));
 ```
 
-You should add a `main` element to the `body`.
+Du solltest ein `main`-Element dem `body` hinzufügen.
 
 ```js
 assert.exists(document.querySelector('body > main'));
 ```
 
-The `header` element should come before the `main` element.
+Das `header`-Element sollte vor `main` stehen.
 
 ```js
 assert.exists(document.querySelector('header + main'));
@@ -51,7 +51,7 @@ assert.exists(document.querySelector('header + main'));
   </head>
 --fcc-editable-region--
   <body>
-    
+
   </body>
 --fcc-editable-region--
 </html>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6140827cff96e906bd38fc2b.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6140827cff96e906bd38fc2b.md
index 3ce0debc394..102363433b7 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6140827cff96e906bd38fc2b.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6140827cff96e906bd38fc2b.md
@@ -1,6 +1,6 @@
 ---
 id: 6140827cff96e906bd38fc2b
-title: Step 9
+title: Schritt 9
 challengeType: 0
 dashedName: step-9
 ---
@@ -9,41 +9,41 @@ dashedName: step-9
 
 As described in the <a href="https://design-style-guide.freecodecamp.org/" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp Style Guide</a>, the logo should retain an aspect ratio of `35 / 4`, and have padding around the text.
 
-First, change the `background-color` to `#0a0a23` so you can see the logo. Then, use the `aspect-ratio` property to set the desired aspect ratio to `35 / 4`. Finally, add a `padding` of `0.4rem` all around.
+Ändere zuerst die `background-color` zu `#0a0a23`, damit du das Logo sehen kannst. Verwende anschließend die `aspect-ratio`-Eigenschaft, um das gewünschte Seitenverhältnis auf `35 / 4` einzustellen. Finally, add a `padding` of `0.4rem` all around.
 
 # --hints--
 
-You should give `#logo` a `background-color` of `#0a0a23`.
+Du solltest `#logo` eine `background-color` von `#0a0a23` zuweisen.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('#logo')?.backgroundColor, 'rgb(10, 10, 35)');
 ```
 
-You should use the `aspect-ratio` property.
+Du solltest die Eigenschaft `aspect-ratio` verwenden.
 
 ```js
 assert.notEmpty(new __helpers.CSSHelp(document).getStyle('#logo')?.aspectRatio);
 ```
 
-You should not use the `height` property.
+Du solltest die Eigenschaft `height` nicht verwenden.
 
 ```js
 assert.isEmpty(new __helpers.CSSHelp(document).getStyle('#logo')?.height);
 ```
 
-You should not change the `width` property.
+Du solltest die Eigenschaft `width` nicht ändern.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('#logo')?.width, 'max(100px, 18vw)');
 ```
 
-You should give the `img` an `aspect-ratio` of `35 / 4`.
+Du solltest dem `img` ein `aspect-ratio` von `35 / 4` zuweisen.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('#logo')?.aspectRatio, '35 / 4');
 ```
 
-You should give the `img` a `padding` of `0.4rem`.
+Du solltest dem `img` ein `padding` von `0.4rem` zuweisen.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('#logo')?.padding, '0.4rem');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6140883f74224508174794c0.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6140883f74224508174794c0.md
index c1d92be6cf6..b4b3e6c1558 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6140883f74224508174794c0.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6140883f74224508174794c0.md
@@ -1,13 +1,13 @@
 ---
 id: 6140883f74224508174794c0
-title: Step 10
+title: Schritt 10
 challengeType: 0
 dashedName: step-10
 ---
 
 # --description--
 
-Make the `header` take up the full width of its parent container, set it's `height` to `50px`, and set the `background-color` to `#1b1b32`. Then, set the `display` to use _Flexbox_.
+Lass den `header` die volle Breite seines übergeordneten Containers annehmen, setze die `height` auf `50px`, und setze die `background-color` auf `#1b1b32`. Then, set the `display` to use _Flexbox_.
 
 # --hints--
 
@@ -17,25 +17,25 @@ You should use the `header` element selector.
 assert.exists(new __helpers.CSSHelp(document).getStyle('header'));
 ```
 
-You should give the `header` a `width` of `100%`.
+Du solltest dem `header` eine `width` von `100%` geben.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('header')?.width, '100%');
 ```
 
-You should give the `header` a `height` of `50px`.
+Du solltest dem `header` eine `height` von `50px` geben.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('header')?.height, '50px');
 ```
 
-You should give the `header` a `background-color` of `#1b1b32`.
+Du solltest `header` eine `background-color` von `#1b1b32` geben.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('header')?.backgroundColor, 'rgb(27, 27, 50)');
 ```
 
-You should give the `header` a `display` of `flex`.
+Du solltest dem `header` ein `display` von `flex` geben.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('header')?.display, 'flex');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61408e4ae3e35d08feb260eb.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61408e4ae3e35d08feb260eb.md
index ce8652ecc0d..52842563298 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61408e4ae3e35d08feb260eb.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61408e4ae3e35d08feb260eb.md
@@ -7,11 +7,11 @@ dashedName: step-11
 
 # --description--
 
-Ändere die `h1` Schriftfarbe auf `#f1be32` und setze die Schriftgröße auf `min(5vw, 1.2em)`.
+Change the `h1` font color to `#f1be32`, and set the font size to `min(5vw, 1.2em)`.
 
 # --hints--
 
-Du solltest den `h1` Element-Selektor verwenden.
+Du solltest den `h1`-Element-Selektor verwenden.
 
 ```js
 assert.exists(new __helpers.CSSHelp(document).getStyle('h1'));
@@ -57,24 +57,24 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('h1')?.fontSize, 'min(5vw,
 
 ```css
 body {
-    background: #f5f6f7;
-    color: #1b1b32;
-    font-family: Helvetica;
-    margin: 0;
+  background: #f5f6f7;
+  color: #1b1b32;
+  font-family: Helvetica;
+  margin: 0;
 }
 
 header {
   width: 100%;
-    height: 50px;
-    background-color: #1b1b32;
-    display: flex;
+  height: 50px;
+  background-color: #1b1b32;
+  display: flex;
 }
 
 #logo {
   width: max(100px, 18vw);
-    background-color: #0a0a23;
+  background-color: #0a0a23;
   aspect-ratio: 35 / 4;
-    padding: 0.4rem;
+  padding: 0.4rem;
 }
 
 --fcc-editable-region--
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61408f155e798909b6908712.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61408f155e798909b6908712.md
index 7e7af1e59db..f5577fec90d 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61408f155e798909b6908712.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61408f155e798909b6908712.md
@@ -1,19 +1,19 @@
 ---
 id: 61408f155e798909b6908712
-title: Step 12
+title: Schritt 12
 challengeType: 0
 dashedName: step-12
 ---
 
 # --description--
 
-To enable navigation on the page, add an unordered list with the following three list items:
+Um die Navigation auf der Seite zu aktivieren, füge eine ungeordnete Liste mit den folgenden drei Listenelementen hinzu:
 
 - `INFO`
 - `HTML`
 - `CSS`
 
-The list items text should be wrapped in anchor tags.
+Der Text der Listenelemente sollte in Anker-Tags eingeschlossen werden.
 
 # --hints--
 
@@ -35,19 +35,19 @@ You should nest one `a` element inside each `li` element.
 assert.equal(document.querySelectorAll('nav > ul > li > a')?.length, 3);
 ```
 
-You should give the first `a` element the text `INFO`.
+Du solltest dem ersten `a`-Element den Text `INFO` geben.
 
 ```js
 assert.equal(document.querySelectorAll('nav > ul > li > a')?.[0]?.textContent, 'INFO');
 ```
 
-You should give the second `a` element the text `HTML`.
+Du solltest dem zweiten `a`-Element den Text `HTML` geben.
 
 ```js
 assert.equal(document.querySelectorAll('nav > ul > li > a')?.[1]?.textContent, 'HTML');
 ```
 
-You should give the third `a` element the text `CSS`.
+Du solltest dem dritten `a`-Element den Text `CSS` geben.
 
 ```js
 assert.equal(document.querySelectorAll('nav > ul > li > a')?.[2]?.textContent, 'CSS');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6141fabd6f75610664e908fd.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6141fabd6f75610664e908fd.md
index fab08b79d1d..671aa32e1dd 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6141fabd6f75610664e908fd.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6141fabd6f75610664e908fd.md
@@ -1,13 +1,13 @@
 ---
 id: 6141fabd6f75610664e908fd
-title: Step 14
+title: Schritt 14
 challengeType: 0
 dashedName: step-14
 ---
 
 # --description--
 
-As this is a quiz, you will need a form for users to submit answers. You can semantically separate the content within the form using `section` elements.
+As this is a quiz, you will need a form for users to submit answers. Du kannst den Inhalt innerhalb des Formulars mit `section`-Elementen semantisch trennen.
 
 Within the `main` element, create a form with three nested `section` elements. Then, make the form submit to `https://freecodecamp.org/practice-project/accessibility-quiz`, using the correct method.
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6141fed65b61320743da5894.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6141fed65b61320743da5894.md
index 6d14ce061af..fda3365fa81 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6141fed65b61320743da5894.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6141fed65b61320743da5894.md
@@ -1,6 +1,6 @@
 ---
 id: 6141fed65b61320743da5894
-title: Step 15
+title: Schritt 15
 challengeType: 0
 dashedName: step-15
 ---
@@ -9,23 +9,23 @@ dashedName: step-15
 
 To increase the page accessibility, the `role` attribute can be used to indicate the purpose behind an element on the page to assistive technologies. The `role` attribute is a part of the _Web Accessibility Initiative_ (WAI), and accepts preset values.
 
-Give each of the `section` elements the `region` role.
+Vergebe an jedes `section`-Element die `region`-Rolle.
 
 # --hints--
 
-You should give the first `section` element the `region` role.
+Du solltest an das erste `section`-Element die `region`-Rolle vergeben.
 
 ```js
 assert.equal(document.querySelectorAll('section')?.[0]?.getAttribute('role'), 'region');
 ```
 
-You should give the second `section` element the `region` role.
+Du solltest an das zweite `section`-Element die `region`-Rolle vergeben.
 
 ```js
 assert.equal(document.querySelectorAll('section')?.[1]?.getAttribute('role'), 'region');
 ```
 
-You should give the third `section` element the `region` role.
+Du solltest an das dritte `section`-Element die `region`-Rolle vergeben.
 
 ```js
 assert.equal(document.querySelectorAll('section')?.[2]?.getAttribute('role'), 'region');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614202874ca576084fca625f.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614202874ca576084fca625f.md
index 98425cf93a9..99fb9e4643d 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614202874ca576084fca625f.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614202874ca576084fca625f.md
@@ -1,6 +1,6 @@
 ---
 id: 614202874ca576084fca625f
-title: Step 16
+title: Schritt 16
 challengeType: 0
 dashedName: step-16
 ---
@@ -15,7 +15,7 @@ To the `section` elements, give the following `aria-labelledby` attributes:
 - `html-questions`
 - `css-questions`
 
-Then, within each `section` element, nest one `h2` element with an `id` matching the corresponding `aria-labelledby` attribute. Give each `h2` suitable text content.
+Then, within each `section` element, nest one `h2` element with an `id` matching the corresponding `aria-labelledby` attribute. Gib jedem `h2` einen passenden Textinhalt.
 
 # --hints--
 
@@ -79,13 +79,13 @@ You should give the first `h2` element suitable text content. _Hint: I would hav
 assert.isAtLeast(document.querySelectorAll('h2')?.[0]?.textContent?.length, 1);
 ```
 
-You should give the second `h2` element suitable text content. _Hint: I would have chosen `HTML`_
+You should give the second `h2` element suitable text content. _Tipp: Ich hätte `HTML` gewählt_
 
 ```js
 assert.isAtLeast(document.querySelectorAll('h2')?.[1]?.textContent?.length, 1);
 ```
 
-You should give the third `h2` element suitable text content. _Hint: I would have chosen `CSS`_
+You should give the third `h2` element suitable text content. _Tipp: Ich hätte `CSS` gewählt_
 
 ```js
 assert.isAtLeast(document.querySelectorAll('h2')?.[2]?.textContent?.length, 1);
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614206033d366c090ca7dd42.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614206033d366c090ca7dd42.md
index 019858e4802..16099768b69 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614206033d366c090ca7dd42.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614206033d366c090ca7dd42.md
@@ -1,13 +1,13 @@
 ---
 id: 614206033d366c090ca7dd42
-title: Step 17
+title: Schritt 17
 challengeType: 0
 dashedName: step-17
 ---
 
 # --description--
 
-Typeface plays an important role in the accessibility of a page. Some fonts are easier to read than others, and this is especially true on low-resolution screens.
+Typeface plays an important role in the accessibility of a page. Einige Schriftarten sind leichter zu lesen als andere, vor allem auf Bildschirmen mit niedriger Auflösung.
 
 Change the font for both the `h1` and `h2` elements to `Verdana`, and use another web-safe font in the sans-serif family as a fallback.
 
@@ -30,7 +30,7 @@ const style = gs('h1, h2') || gs('h2, h1');
 assert.include(style?.fontFamily, 'Verdana');
 ```
 
-You should set the second value of the `font-family` property to another sans-serif, web safe font. _Hint: I would choose Tahoma_.
+You should set the second value of the `font-family` property to another sans-serif, web safe font. _Tipp: Ich würde Tahoma wählen_.
 
 ```js
 // Acceptable fonts: Arial, sans-serif, Helvetica, Tahoma, Trebuchet MS.
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61435e3c0679a306c20f1acc.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61435e3c0679a306c20f1acc.md
index a816c6b9ce1..21cdb692734 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61435e3c0679a306c20f1acc.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61435e3c0679a306c20f1acc.md
@@ -1,6 +1,6 @@
 ---
 id: 61435e3c0679a306c20f1acc
-title: Step 18
+title: Schritt 18
 challengeType: 0
 dashedName: step-18
 ---
@@ -11,19 +11,19 @@ To be able to navigate within the page, give each anchor element an `href` corre
 
 # --hints--
 
-You should give the first `a` element an `href` of `#student-info`.
+Du solltest dem ersten `a`-Element ein `href` von `#student-info` geben.
 
 ```js
 assert.equal(document.querySelectorAll('a')?.[0]?.getAttribute('href'), '#student-info');
 ```
 
-You should give the second `a` element an `href` of `#html-questions`.
+Du solltest dem zweiten `a`-Element ein `href` von `#html-questions` geben.
 
 ```js
 assert.equal(document.querySelectorAll('a')?.[1]?.getAttribute('href'), '#html-questions');
 ```
 
-You should give the third `a` element an `href` of `#css-questions`.
+Du solltest dem dritten `a`-Element ein `href` von `#css-questions` geben.
 
 ```js
 assert.equal(document.querySelectorAll('a')?.[2]?.getAttribute('href'), '#css-questions');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143610161323a081b249c19.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143610161323a081b249c19.md
index d37386d6f5f..21bf5132dcf 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143610161323a081b249c19.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143610161323a081b249c19.md
@@ -1,6 +1,6 @@
 ---
 id: 6143610161323a081b249c19
-title: Step 19
+title: Schritt 19
 challengeType: 0
 dashedName: step-19
 ---
@@ -107,7 +107,7 @@ assert.exists(document.querySelectorAll('h2#student-info ~ div')?.[2]?.querySele
 --fcc-editable-region--
         <section role="region" aria-labelledby="student-info">
           <h2 id="student-info">Student Info</h2>
-          
+
         </section>
 --fcc-editable-region--
         <section role="region" aria-labelledby="html-questions">
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143639d5eddc7094161648c.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143639d5eddc7094161648c.md
index 13bfbbd58af..61a4510e778 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143639d5eddc7094161648c.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143639d5eddc7094161648c.md
@@ -1,17 +1,17 @@
 ---
 id: 6143639d5eddc7094161648c
-title: Step 20
+title: Schritt 20
 challengeType: 0
 dashedName: step-20
 ---
 
 # --description--
 
-It is important to link each `input` to the corresponding `label` element. This provides assistive technology users with a visual reference to the input.
+Es ist wichtig, jeden `input` mit dem entsprechenden `label`-Element zu verknüpfen. This provides assistive technology users with a visual reference to the input.
 
-This is done by giving the `label` a `for` attribute, which contains the `id` of the `input`.
+Dies geschieht, indem `label` ein `for`-Attribut gegeben wird, das die `id` des `input` enthält.
 
-This section will take a student's name, email address, and date of birth. Give the `label` elements appropriate `for` attributes, as well as text content. Then, link the `input` elements to the corresponding `label` elements.
+This section will take a student's name, email address, and date of birth. Gib den `label`-Elementen geeignete `for`-Attribute sowie einen Textinhalt. Verknüpfe anschließend die `input`-Elemente mit den entsprechenden `label`-Elementen.
 
 # --hints--
 
@@ -51,25 +51,25 @@ You should give the third `label` element an appropriate text content.
 assert.isAtLeast(document.querySelectorAll('label')?.[2]?.textContent?.length, 1);
 ```
 
-You should give the first `input` element an `id` attribute matching the `for` attribute of the first `label`.
+Du solltest dem ersten `input`-Element ein `id`-Attribut zuweisen, das mit dem `for`-Attribut des ersten `label` übereinstimmt.
 
 ```js
 assert.equal(document.querySelectorAll('input')?.[0]?.id, document.querySelectorAll('label')?.[0]?.htmlFor);
 ```
 
-You should give the second `input` element an `id` attribute matching the `for` attribute of the second `label`.
+Du solltest dem zweiten `input`-Element ein `id`-Attribut zuweisen, das mit dem `for`-Attribut des ersten `label` übereinstimmt.
 
 ```js
 assert.equal(document.querySelectorAll('input')?.[1]?.id, document.querySelectorAll('label')?.[1]?.htmlFor);
 ```
 
-You should give the third `input` element an `id` attribute matching the `for` attribute of the third `label`.
+Du solltest dem dritten `input`-Element ein `id`-Attribut zuweisen, das mit dem `for`-Attribut des dritten `label` übereinstimmt.
 
 ```js
 assert.equal(document.querySelectorAll('input')?.[2]?.id, document.querySelectorAll('label')?.[2]?.htmlFor);
 ```
 
-You should not use the same `id` attribute for more than one `input` element.
+Du solltest nicht das gleiche `id`-Attribut für mehr als ein `input`-Element verwenden.
 
 ```js
 const id = (n) => document.querySelectorAll('input')?.[n]?.id;
@@ -78,7 +78,7 @@ assert.notEqual(id(0), id(2));
 assert.notEqual(id(1), id(2));
 ```
 
-You should not use the same `for` attribute for more than one `label` element.
+Du solltest nicht das gleiche `for`-Attribut für mehr als ein `label`-Element verwenden.
 
 ```js
 const htmlFor = (n) => document.querySelectorAll('label')?.[n]?.htmlFor;
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143908b6aafb00a659ca189.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143908b6aafb00a659ca189.md
index 6ac9fb954c1..59b041608e6 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143908b6aafb00a659ca189.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143908b6aafb00a659ca189.md
@@ -1,13 +1,13 @@
 ---
 id: 6143908b6aafb00a659ca189
-title: Step 21
+title: Schritt 21
 challengeType: 0
 dashedName: step-21
 ---
 
 # --description--
 
-Keeping in mind best-practices for form inputs, give each `input` an appropriate `type` and `name` attribute. Then, give the first `input` a `placeholder` attribute.
+Keeping in mind best-practices for form inputs, give each `input` an appropriate `type` and `name` attribute. Gib anschließend dem ersten `input` ein `placeholder`-Attribut.
 
 # --hints--
 
@@ -29,25 +29,25 @@ You should give the third `input` a `type` of `date`.
 assert.equal(document.querySelectorAll('input')?.[2]?.type, 'date');
 ```
 
-You should give the first `input` an appropriate `name` attribute.
+Du solltest dem ersten `input` ein geeignetes `name`-Attribut geben.
 
 ```js
 assert.isAtLeast(document.querySelectorAll('input')?.[0]?.name?.length, 1);
 ```
 
-You should give the second `input` an appropriate `name` attribute.
+Du solltest dem zweiten `input` ein geeignetes `name`-Attribut geben.
 
 ```js
 assert.isAtLeast(document.querySelectorAll('input')?.[1]?.name?.length, 1);
 ```
 
-You should give the third `input` an appropriate `name` attribute.
+Du solltest dem dritten `input` ein geeignetes `name`-Attribut geben.
 
 ```js
 assert.isAtLeast(document.querySelectorAll('input')?.[2]?.name?.length, 1);
 ```
 
-You should give the first `input` a `placeholder` attribute.
+Du solltest dem ersten `input` ein `placeholder`-Attribut geben.
 
 ```js
 assert.notEmpty(document.querySelectorAll('input')?.[0]?.placeholder);
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143920c8eafb00b735746ce.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143920c8eafb00b735746ce.md
index e264e63c4dc..113e0a19bd7 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143920c8eafb00b735746ce.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143920c8eafb00b735746ce.md
@@ -1,6 +1,6 @@
 ---
 id: 6143920c8eafb00b735746ce
-title: Step 22
+title: Schritt 22
 challengeType: 0
 dashedName: step-22
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143931a113bb80c45546287.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143931a113bb80c45546287.md
index 730bb597430..7d6bf69b60e 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143931a113bb80c45546287.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143931a113bb80c45546287.md
@@ -1,13 +1,13 @@
 ---
 id: 6143931a113bb80c45546287
-title: Step 23
+title: Schritt 23
 challengeType: 0
 dashedName: step-23
 ---
 
 # --description--
 
-Arguably, `D.O.B.` is not descriptive enough. This is especially true for visually impaired users. One way to get around such an issue, without having to add visible text to the label, is to add text only a screen reader can read.
+Vermutlich ist `D.O.B.` nicht beschreibend genug. Dies gilt insbesondere für sehbehinderte Nutzer. One way to get around such an issue, without having to add visible text to the label, is to add text only a screen reader can read.
 
 Append a `span` element with a class of `sr-only` to the current text content of the third `label` element.
 
@@ -19,7 +19,7 @@ You should add a `span` element within the third `label` element.
 assert.exists(document.querySelector('.info:nth-of-type(3) > label > span'));
 ```
 
-You should give the `span` element a class of `sr-only`.
+Du solltest dem `span`-Element die Klasse `sr-only` zuweisen.
 
 ```js
 assert.equal(document.querySelector('.info:nth-of-type(3) > label > span')?.className, 'sr-only');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143956ed76ed60e012faa51.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143956ed76ed60e012faa51.md
index 7360397c776..1796dbc682f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143956ed76ed60e012faa51.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143956ed76ed60e012faa51.md
@@ -1,13 +1,13 @@
 ---
 id: 6143956ed76ed60e012faa51
-title: Step 25
+title: Schritt 25
 challengeType: 0
 dashedName: step-25
 ---
 
 # --description--
 
-The `.sr-only` text is still visible. There is a common pattern to visually hide text for only screen readers to read. 
+The `.sr-only` text is still visible. There is a common pattern to visually hide text for only screen readers to read.
 
 This pattern is to set the following CSS properties:
 
@@ -45,7 +45,7 @@ You should give the `.sr-only` a `width` of `1px`.
 assert.equal(new __helpers.CSSHelp(document).getStyle('.sr-only')?.width, '1px');
 ```
 
-You should give the `.sr-only` a `height` of `1px`.
+Du solltest dem `.sr-only` eine `height` von `1px` geben.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('.sr-only')?.height, '1px');
@@ -63,7 +63,7 @@ You should give the `.sr-only` a `margin` of `-1px`.
 assert.equal(new __helpers.CSSHelp(document).getStyle('.sr-only')?.margin, '-1px');
 ```
 
-You should give the `.sr-only` an `overflow` of `hidden`.
+Du sollest dem `.sr-only` ein `overflow` von `hidden` geben.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('.sr-only')?.overflow, 'hidden');
@@ -75,7 +75,7 @@ You should give the `.sr-only` a `clip` of `rect(0, 0, 0, 0)`.
 assert.equal(new __helpers.CSSHelp(document).getStyle('.sr-only')?.clip, 'rect(0px, 0px, 0px, 0px)');
 ```
 
-You should give the `.sr-only` a `white-space` of `nowrap`.
+Du solltest dem `.sr-only` ein `white-space` von `nowrap` geben.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('.sr-only')?.whiteSpace, 'nowrap');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614396f7ae83f20ea6f9f4b3.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614396f7ae83f20ea6f9f4b3.md
index 7ce8675e2fe..e2822d0d7a7 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614396f7ae83f20ea6f9f4b3.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614396f7ae83f20ea6f9f4b3.md
@@ -1,6 +1,6 @@
 ---
 id: 614396f7ae83f20ea6f9f4b3
-title: Step 26
+title: Schritt 26
 challengeType: 0
 dashedName: step-26
 ---
@@ -19,13 +19,13 @@ You should nest two `div` elements within the second `section` element.
 assert.equal(document.querySelectorAll('section:nth-of-type(2) > div')?.length, 2);
 ```
 
-You should give the first new `div` element a class of `question-block`.
+Du solltest dem ersten neuen `div`-Element die Klasse `question-block` zuweisen.
 
 ```js
 assert.equal(document.querySelectorAll('section:nth-of-type(2) > div')?.[0]?.className, 'question-block');
 ```
 
-You should give the second new `div` element a class of `question-block`.
+Du solltest dem zweiten neuen `div`-Element die Klasse `question-block` zuweisen.
 
 ```js
 assert.equal(document.querySelectorAll('section:nth-of-type(2) > div')?.[1]?.className, 'question-block');
@@ -37,13 +37,13 @@ You should nest one `p` element within each `div.question-block` element.
 assert.equal(document.querySelectorAll('section:nth-of-type(2) > div.question-block > p')?.length, 2);
 ```
 
-You should give the first `p` element text of `1`.
+Du solltest dem ersten `p`-Element den Text `1` zuweisen.
 
 ```js
 assert.equal(document.querySelectorAll('section:nth-of-type(2) > div.question-block > p')?.[0]?.textContent, '1');
 ```
 
-You should give the second `p` element text of `2`.
+Du solltest dem zweiten `p` Element den Text `2` zuweisen.
 
 ```js
 assert.equal(document.querySelectorAll('section:nth-of-type(2) > div.question-block > p')?.[1]?.textContent, '2');
@@ -67,13 +67,13 @@ You should place the second `fieldset` element after the second `p` element.
 assert.exists(document.querySelector('section:nth-of-type(2) > div.question-block:nth-of-type(2) > p + fieldset'));
 ```
 
-You should give the first `fieldset` element a class of `question`.
+Du solltest dem ersten `fieldset` die Klasse `question` zuweisen.
 
 ```js
 assert.equal(document.querySelectorAll('section:nth-of-type(2) > div.question-block > fieldset')?.[0]?.className, 'question');
 ```
 
-You should give the second `fieldset` element a class of `question`.
+Du solltest dem zweiten `fieldset`-Element die Klasse `question` zuweisen.
 
 ```js
 assert.equal(document.querySelectorAll('section:nth-of-type(2) > div.question-block > fieldset')?.[1]?.className, 'question');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143cb26f7edff2dc28f7da5.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143cb26f7edff2dc28f7da5.md
index 86696a559cf..a0aedf75e52 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143cb26f7edff2dc28f7da5.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6143cb26f7edff2dc28f7da5.md
@@ -1,6 +1,6 @@
 ---
 id: 6143cb26f7edff2dc28f7da5
-title: Step 27
+title: Schritt 27
 challengeType: 0
 dashedName: step-27
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6144e818fd5ea704fe56081d.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6144e818fd5ea704fe56081d.md
index 26fd1bb13a0..035c61b1ca9 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6144e818fd5ea704fe56081d.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6144e818fd5ea704fe56081d.md
@@ -1,6 +1,6 @@
 ---
 id: 6144e818fd5ea704fe56081d
-title: Step 28
+title: Schritt 28
 challengeType: 0
 dashedName: step-28
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6144f8dc6849e405dd8bb829.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6144f8dc6849e405dd8bb829.md
index 5cc59caa92d..161a99891b6 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6144f8dc6849e405dd8bb829.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6144f8dc6849e405dd8bb829.md
@@ -1,6 +1,6 @@
 ---
 id: 6144f8dc6849e405dd8bb829
-title: Step 29
+title: Schritt 29
 challengeType: 0
 dashedName: step-29
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145e6eeaa66c605eb087fe9.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145e6eeaa66c605eb087fe9.md
index 02e8e9eafee..e41bf626ba0 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145e6eeaa66c605eb087fe9.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145e6eeaa66c605eb087fe9.md
@@ -1,6 +1,6 @@
 ---
 id: 6145e6eeaa66c605eb087fe9
-title: Step 30
+title: Schritt 30
 challengeType: 0
 dashedName: step-30
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145e8b5080a5f06bb0223d0.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145e8b5080a5f06bb0223d0.md
index 55da320cbe3..19586f3e26a 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145e8b5080a5f06bb0223d0.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145e8b5080a5f06bb0223d0.md
@@ -1,6 +1,6 @@
 ---
 id: 6145e8b5080a5f06bb0223d0
-title: Step 31
+title: Schritt 31
 challengeType: 0
 dashedName: step-31
 ---
@@ -9,29 +9,29 @@ dashedName: step-31
 
 Give the `label` elements text such that the `input` comes before the text. Then, give the `input` elements a `value` matching the text.
 
-The text should either be `True` or `False`.
+Der Text sollte entweder `True` oder `False` sein.
 
 # --hints--
 
-You should give the first `label` element text content.
+Du solltest dem ersten `label`-Element einen Textinhalt geben.
 
 ```js
 assert.notEmpty(document.querySelectorAll('ul.answers-list > li > label')?.[0]?.textContent?.trim());
 ```
 
-You should give the second `label` element text content.
+Du solltest dem zweiten `label`-Element einen Textinhalt geben.
 
 ```js
 assert.notEmpty(document.querySelectorAll('ul.answers-list > li > label')?.[1]?.textContent?.trim());
 ```
 
-You should give the third `label` element text content.
+Du solltest dem dritten `label`-Element einen Textinhalt geben.
 
 ```js
 assert.notEmpty(document.querySelectorAll('ul.answers-list > li > label')?.[2]?.textContent?.trim());
 ```
 
-You should give the fourth `label` element text content.
+Du solltest dem vierten `label`-Element einen Textinhalt geben.
 
 ```js
 assert.notEmpty(document.querySelectorAll('ul.answers-list > li > label')?.[3]?.textContent?.trim());
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145eb5f08a38a0786c7a80c.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145eb5f08a38a0786c7a80c.md
index d0ecf180c5e..e0cf469bc61 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145eb5f08a38a0786c7a80c.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145eb5f08a38a0786c7a80c.md
@@ -1,6 +1,6 @@
 ---
 id: 6145eb5f08a38a0786c7a80c
-title: Step 32
+title: Schritt 32
 challengeType: 0
 dashedName: step-32
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145ed1f22caab087630aaad.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145ed1f22caab087630aaad.md
index 2f97e479e82..e854f7db10d 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145ed1f22caab087630aaad.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145ed1f22caab087630aaad.md
@@ -1,6 +1,6 @@
 ---
 id: 6145ed1f22caab087630aaad
-title: Step 33
+title: Schritt 33
 challengeType: 0
 dashedName: step-33
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145ee65e2e1530938cb594d.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145ee65e2e1530938cb594d.md
index a85adf80658..e7f87d28e1f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145ee65e2e1530938cb594d.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145ee65e2e1530938cb594d.md
@@ -1,6 +1,6 @@
 ---
 id: 6145ee65e2e1530938cb594d
-title: Step 34
+title: Schritt 34
 challengeType: 0
 dashedName: step-34
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f02240ff8f09f7ec913c.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f02240ff8f09f7ec913c.md
index fe1b243e146..8ab2945982c 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f02240ff8f09f7ec913c.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f02240ff8f09f7ec913c.md
@@ -1,6 +1,6 @@
 ---
 id: 6145f02240ff8f09f7ec913c
-title: Step 35
+title: Schritt 35
 challengeType: 0
 dashedName: step-35
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f14f019a4b0adb94b051.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f14f019a4b0adb94b051.md
index 6d3aa915ee5..bbbabdb8e5f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f14f019a4b0adb94b051.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f14f019a4b0adb94b051.md
@@ -1,6 +1,6 @@
 ---
 id: 6145f14f019a4b0adb94b051
-title: Step 36
+title: Schritt 36
 challengeType: 0
 dashedName: step-36
 ---
@@ -13,7 +13,7 @@ Give the first `option` element a `value` of `""`, and the text `Select an optio
 
 # --hints--
 
-You should nest one `select` element within the first `div.answer` element.
+Du solltest ein `select`-Element innerhalb des ersten `div.answer`-Elements verschachteln.
 
 ```js
 assert.exists(document.querySelector('div.answer > select'));
@@ -61,7 +61,7 @@ You should give the third `option` element a text content of `No`.
 assert.equal(document.querySelector('div.answer > select > option:nth-child(3)')?.textContent, 'No');
 ```
 
-You should give the `select` an attribute of `required`.
+Du solltest `select` das Attribut `required` zuweisen.
 
 ```js
 assert.isTrue(document.querySelector('div.answer > select')?.required);
@@ -167,7 +167,7 @@ assert.isTrue(document.querySelector('div.answer > select')?.required);
             </div>
 --fcc-editable-region--
             <div class="answer">
-              
+
             </div>
 --fcc-editable-region--
             <div class="question-block">
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f47393fbe70c4d885f9c.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f47393fbe70c4d885f9c.md
index 34a14d3463f..8ddc72d8bdf 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f47393fbe70c4d885f9c.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f47393fbe70c4d885f9c.md
@@ -1,6 +1,6 @@
 ---
 id: 6145f47393fbe70c4d885f9c
-title: Step 38
+title: Schritt 38
 challengeType: 0
 dashedName: step-38
 ---
@@ -151,7 +151,7 @@ assert.notEmpty(document.querySelectorAll('div.answer')?.[1]?.querySelector('tex
             </div>
 --fcc-editable-region--
             <div class="answer">
-              
+
             </div>
 --fcc-editable-region--
           </div>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f59029474c0d3dc1c8b8.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f59029474c0d3dc1c8b8.md
index 243326a7b24..c07c4cfb86f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f59029474c0d3dc1c8b8.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f59029474c0d3dc1c8b8.md
@@ -1,6 +1,6 @@
 ---
 id: 6145f59029474c0d3dc1c8b8
-title: Step 39
+title: Schritt 39
 challengeType: 0
 dashedName: step-39
 ---
@@ -11,19 +11,19 @@ As with the other `input` and `label` elements, link the `textarea` to its corre
 
 # --hints--
 
-You should give the `label` element a `for` attribute.
+Du solltest dem `label`-Element ein `for`-Attribut geben.
 
 ```js
 assert.notEmpty(document.querySelectorAll('.formrow > .question-block')?.[1]?.querySelector('label')?.htmlFor);
 ```
 
-You should give the `textarea` element an `id` attribute matching the `for` attribute of the `label` element.
+Du solltest dem `textarea`-Element eine `id` geben, die dem `for`-Attribut des `label`-Elements entspricht.
 
 ```js
 assert.equal(document.querySelectorAll('.formrow > .question-block')?.[1]?.querySelector('label')?.htmlFor, document.querySelectorAll('.answer')?.[1]?.querySelector('textarea')?.id);
 ```
 
-You should give the `textarea` element a `name` attribute.
+Du solltest dem `textarea`-Element ein `name`-Attribut geben.
 
 ```js
 assert.notEmpty(document.querySelectorAll('.answer')?.[1]?.querySelector('textarea')?.name);
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f685797bd30df9784e8c.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f685797bd30df9784e8c.md
index 33a302950b1..33f07528a04 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f685797bd30df9784e8c.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f685797bd30df9784e8c.md
@@ -1,6 +1,6 @@
 ---
 id: 6145f685797bd30df9784e8c
-title: Step 40
+title: Schritt 40
 challengeType: 0
 dashedName: step-40
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f829ac6a920ebf5797d7.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f829ac6a920ebf5797d7.md
index 4ab70c40da2..922c8ce540a 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f829ac6a920ebf5797d7.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f829ac6a920ebf5797d7.md
@@ -1,6 +1,6 @@
 ---
 id: 6145f829ac6a920ebf5797d7
-title: Step 41
+title: Schritt 41
 challengeType: 0
 dashedName: step-41
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f8f8bcd4370f6509078e.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f8f8bcd4370f6509078e.md
index e8bdfc16011..908571ff945 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f8f8bcd4370f6509078e.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145f8f8bcd4370f6509078e.md
@@ -1,6 +1,6 @@
 ---
 id: 6145f8f8bcd4370f6509078e
-title: Step 42
+title: Schritt 42
 challengeType: 0
 dashedName: step-42
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145fb5018cb5b100cb2a88c.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145fb5018cb5b100cb2a88c.md
index a1a778c6396..4785a726c98 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145fb5018cb5b100cb2a88c.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145fb5018cb5b100cb2a88c.md
@@ -1,6 +1,6 @@
 ---
 id: 6145fb5018cb5b100cb2a88c
-title: Step 43
+title: Schritt 43
 challengeType: 0
 dashedName: step-43
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145fc3707fc3310c277f5c8.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145fc3707fc3310c277f5c8.md
index 24b4c4b97a4..ebe31a32f0e 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145fc3707fc3310c277f5c8.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6145fc3707fc3310c277f5c8.md
@@ -1,13 +1,13 @@
 ---
 id: 6145fc3707fc3310c277f5c8
-title: Step 44
+title: Schritt 44
 challengeType: 0
 dashedName: step-44
 ---
 
 # --description--
 
-Back to styling the page. Select the list elements within the navigation bar, and give them the following styles:
+Back to styling the page. Wähle die Listenelemente innerhalb der Navigationsleiste aus und gib ihnen die folgenden Formatierungen:
 
 ```css
 color: #dfdfe2;
@@ -18,14 +18,14 @@ display: block;
 
 # --hints--
 
-You should use either the `nav li` or `nav > ul > li` selector.
+Du solltest entweder den `nav li`- oder `nav > ul > li`-Selektor verwenden.
 
 ```js
 const gs = (s) => new __helpers.CSSHelp(document).getStyle(s);
 assert.exists(gs('nav li') || gs('nav > ul > li'));
 ```
 
-You should give the `li` elements a `color` of `#dfdfe2`.
+Du solltest den `li`-Elementen eine `color` von `#dfdfe2` geben.
 
 ```js
 const gs = (s) => new __helpers.CSSHelp(document).getStyle(s);
@@ -33,7 +33,7 @@ const color = gs('nav li')?.color ?? gs('nav > ul > li')?.color;
 assert.equal(color, 'rgb(223, 223, 226)');
 ```
 
-You should give the `li` elements a `margin` of `0 0.2rem`.
+Du solltest den `li`-Elementen eine `margin` von `0 0.2rem` geben.
 
 ```js
 const gs = (s) => new __helpers.CSSHelp(document).getStyle(s);
@@ -41,7 +41,7 @@ const margin = gs('nav li')?.margin ?? gs('nav > ul > li')?.margin;
 assert.equal(margin, '0px 0.2rem');
 ```
 
-You should give the `li` elements a `padding` of `0.2rem`.
+Du solltest den `li`-Elementen ein `padding` von `0.2rem` geben.
 
 ```js
 const gs = (s) => new __helpers.CSSHelp(document).getStyle(s);
@@ -49,7 +49,7 @@ const padding = gs('nav li')?.padding ?? gs('nav > ul > li')?.padding;
 assert.equal(padding, '0.2rem');
 ```
 
-You should give the `li` elements a `display` of `block`.
+Du solltest den `li`-Elementen ein `display` von `block` geben.
 
 ```js
 const gs = (s) => new __helpers.CSSHelp(document).getStyle(s);
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614796cb8086be482d60e0ac.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614796cb8086be482d60e0ac.md
index 87a7f0775e5..4027a31b174 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614796cb8086be482d60e0ac.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614796cb8086be482d60e0ac.md
@@ -1,6 +1,6 @@
 ---
 id: 614796cb8086be482d60e0ac
-title: Step 45
+title: Schritt 45
 challengeType: 0
 dashedName: step-45
 ---
@@ -13,19 +13,19 @@ Change the font color of all the anchor elements within the list elements to som
 
 # --hints--
 
-You should use the `li > a` selector.
+Du solltest den `li > a` Selektor verwenden.
 
 ```js
 assert.exists(new __helpers.CSSHelp(document).getStyle('li > a'));
 ```
 
-You should give the `a` element a `color` property.
+Du solltest dem `a` Element eine `color` Eigenschaft geben.
 
 ```js
 assert.notEmpty(new __helpers.CSSHelp(document).getStyle('li > a')?.color);
 ```
 
-You should give the `color` property a contrast with the background of at least 7:1. _Hint: I would use `#dfdfe2`_
+Du solltest der `color` Eigenschaft einen Kontrast mit dem Hintergrund von mindestens 7:1 geben. _Tipp: Ich würde `#dfdfe2` verwenden_
 
 ```js
 function luminance(r, g, b) {
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6147a14ef5668b5881ef2297.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6147a14ef5668b5881ef2297.md
index 47204b6e708..1625b43c998 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6147a14ef5668b5881ef2297.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6147a14ef5668b5881ef2297.md
@@ -1,6 +1,6 @@
 ---
 id: 6147a14ef5668b5881ef2297
-title: Step 46
+title: Schritt 46
 challengeType: 0
 dashedName: step-46
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614878f7a412310647873015.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614878f7a412310647873015.md
index f40325e4f82..e474fd43398 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614878f7a412310647873015.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614878f7a412310647873015.md
@@ -1,6 +1,6 @@
 ---
 id: 614878f7a412310647873015
-title: Step 47
+title: Schritt 47
 challengeType: 0
 dashedName: step-47
 ---
@@ -13,25 +13,25 @@ Then, fix the `header` to the top of the viewport.
 
 # --hints--
 
-You should give the `header` a `justify-content` of `space-between`.
+Du solltest dem `header` ein `justify-content` von `space-between` geben.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('header')?.justifyContent, 'space-between');
 ```
 
-You should give the `header` an `align-items` of `center`.
+Du solltest dem `header` ein `align-items` von `center` geben.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('header')?.alignItems, 'center');
 ```
 
-You should give the `header` a `position` of `fixed`.
+Du solltest dem `header` eine `position` von `fixed` geben.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('header')?.position, 'fixed');
 ```
 
-You should give the `header` a `top` of `0`.
+Du solltest dem `header` ein `top` von `0` geben.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('header')?.top, '0px');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61487b77d4a37707073a64e5.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61487b77d4a37707073a64e5.md
index 31c288f1653..e04f1f39b82 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61487b77d4a37707073a64e5.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61487b77d4a37707073a64e5.md
@@ -1,19 +1,19 @@
 ---
 id: 61487b77d4a37707073a64e5
-title: Step 48
+title: Schritt 48
 challengeType: 0
 dashedName: step-48
 ---
 
 # --description--
 
-When the screen width is small, the `h1` does not wrap its text content how it should. Align the text for the `h1` element in the center.
+When the screen width is small, the `h1` does not wrap its text content how it should. Richte den Text für das `h1`-Element in der Mitte aus.
 
 Then, give the `main` padding such that the `Student Info` section header can be fully seen.
 
 # --hints--
 
-You should give the `h1` a `text-align` of `center`.
+Du solltest `h1` ein `text-align` von `center` geben.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('h1')?.textAlign, 'center');
@@ -25,7 +25,7 @@ You should add a `main` selector to target the `main` element.
 assert.exists(new __helpers.CSSHelp(document).getStyle('main'));
 ```
 
-You should give the `main` a `padding-top` of at least `25px`.
+Du solltest `main` ein `padding-top` von mindestens `25px` geben.
 
 ```js
 assert.isAtLeast(Number(new __helpers.CSSHelp(document).getStyle('main')?.paddingTop?.replace(/\D+/, '')), 25);
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61487da611a65307e78d2c20.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61487da611a65307e78d2c20.md
index 76302f5b8c5..94d4aeadf7c 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61487da611a65307e78d2c20.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61487da611a65307e78d2c20.md
@@ -1,6 +1,6 @@
 ---
 id: 61487da611a65307e78d2c20
-title: Step 49
+title: Schritt 49
 challengeType: 0
 dashedName: step-49
 ---
@@ -9,7 +9,7 @@ dashedName: step-49
 
 On small screens, the unordered list in the navigation bar overflows the right side of the screen.
 
-Fix this by using _Flexbox_ to wrap the `ul` content. Then, set the following CSS properties to correctly align the text:
+Fix this by using _Flexbox_ to wrap the `ul` content. Lege anschließend die folgenden CSS-Eigenschaften fest, um den Text korrekt auszurichten:
 
 ```css
 align-items: center;
@@ -20,31 +20,31 @@ height: 100%;
 
 # --hints--
 
-You should give the `ul` a `flex-wrap` of `wrap`.
+Du solltest `ul` einen `flex-wrap` von `wrap` geben.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('nav > ul')?.flexWrap, 'wrap');
 ```
 
-You should give the `ul` an `align-items` of `center`.
+Du solltest `ul` ein `align-items` von `center` geben.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('nav > ul')?.alignItems, 'center');
 ```
 
-You should give the `ul` a `padding-inline-start` of `0`.
+Du solltest `ul` ein `padding-inline-start` von `0` geben.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('nav > ul')?.paddingInlineStart, '0px');
 ```
 
-You should give the `ul` a `margin-block` of `0`.
+Du solltest `ul` ein `margin-block` von `0` geben.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('nav > ul')?.marginBlock, '0px');
 ```
 
-You should give the `ul` a `height` of `100%`.
+Du solltest `ul` ein `height` von `100%` geben.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('nav > ul')?.height, '100%');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61487f703571b60899055cf9.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61487f703571b60899055cf9.md
index 555cea25949..1129161ad6f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61487f703571b60899055cf9.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61487f703571b60899055cf9.md
@@ -1,6 +1,6 @@
 ---
 id: 61487f703571b60899055cf9
-title: Step 50
+title: Schritt 50
 challengeType: 0
 dashedName: step-50
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614883b6fa720e09fb167de9.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614883b6fa720e09fb167de9.md
index 60accd390bc..33d644b3cda 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614883b6fa720e09fb167de9.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614883b6fa720e09fb167de9.md
@@ -1,6 +1,6 @@
 ---
 id: 614883b6fa720e09fb167de9
-title: Step 52
+title: Schritt 52
 challengeType: 0
 dashedName: step-52
 ---
@@ -11,31 +11,31 @@ Add padding to the top and left of the `.info` elements, and set the other value
 
 # --hints--
 
-You should use the `.info` selector.
+Du solltest den `.info` Selektor verwenden.
 
 ```js
 assert.exists(new __helpers.CSSHelp(document).getStyle('.info'));
 ```
 
-You should give `.info` a `padding-top` of at least `1px`.
+Du solltest `.info` ein `padding-top` von mindestens `1px` geben.
 
 ```js
 assert.isAtLeast(Number(new __helpers.CSSHelp(document).getStyle('.info')?.paddingTop?.replace(/\D+/, '')), 1);
 ```
 
-You should give `.info` a `padding-right` of `0`.
+Du solltest `.info` ein `padding-right` von `0` geben.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('.info')?.paddingRight, '0px');
 ```
 
-You should give `.info` a `padding-bottom` of `0`.
+Du solltest `.info` ein `padding-bottom` von `0` geben.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('.info')?.paddingBottom, '0px');
 ```
 
-You should give `.info` a `padding-left` of at least `1px`.
+Du solltest `.info` ein `padding-left` von mindestens `1px` geben.
 
 ```js
 assert.isAtLeast(Number(new __helpers.CSSHelp(document).getStyle('.info')?.paddingLeft?.replace(/\D+/, '')), 1);
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614884c1f5d6f30ab3d78cde.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614884c1f5d6f30ab3d78cde.md
index 558e6754ad7..fe7084af30f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614884c1f5d6f30ab3d78cde.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614884c1f5d6f30ab3d78cde.md
@@ -1,25 +1,25 @@
 ---
 id: 614884c1f5d6f30ab3d78cde
-title: Step 53
+title: Schritt 53
 challengeType: 0
 dashedName: step-53
 ---
 
 # --description--
 
-Give the `.formrow` elements top margin, and left and right padding. The other padding values should be `0`.
+Richte das `.formrow` Element am oberen Rand aus und gib ihm auf der linken und rechten Seite eine Padding-Einheit. Die anderen Padding-Werte sollten bei `0` liegen.
 
-Then, increase the font size for all `input` elements.
+Vergrößere anschließend die Schriftgröße für alle `input` Elemente.
 
 # --hints--
 
-You should use a `.formrow` selector to target the `.formrow` elements.
+Du solltest einen `.formrow` Selektor verwenden, um die `.formrow` Elemente auszurichten.
 
 ```js
 assert.exists(new __helpers.CSSHelp(document).getStyle('.formrow'));
 ```
 
-You should give the `.formrow` a `margin-top` of at least `1px`.
+Du solltest dem `.formrow` ein `margin-top` von mindestens `1px` geben.
 
 ```js
 const val = new __helpers.CSSHelp(document).getStyle('.formrow')?.marginTop;
@@ -40,13 +40,13 @@ function remToPx(rem) {
 assert.isAtLeast(valInPx, 1);
 ```
 
-You should give the `.formrow` a `padding-top` of `0`.
+Du solltest dem `.formrow` ein `padding-top` von `0` zuweisen.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('.formrow')?.paddingTop, '0px');
 ```
 
-You should give the `.formrow` a `padding-right` of at least `1px`.
+Du solltest dem `.formrow` ein `padding-right` von mindestens `1px` geben.
 
 ```js
 const val = new __helpers.CSSHelp(document).getStyle('.formrow')?.paddingRight;
@@ -67,13 +67,13 @@ function remToPx(rem) {
 assert.isAtLeast(valInPx, 1);
 ```
 
-You should give the `.formrow` a `padding-bottom` of `0`.
+Du solltest dem `.formrow` ein `padding-bottom` von `0` zuweisen.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('.formrow')?.paddingBottom, '0px');
 ```
 
-You should give the `.formrow` a `padding-left` of at least `1px`.
+Du solltest dem `.formrow` ein `padding-left` von mindestens `1px` geben.
 
 ```js
 const val = new __helpers.CSSHelp(document).getStyle('.formrow')?.paddingLeft;
@@ -94,7 +94,7 @@ function remToPx(rem) {
 assert.isAtLeast(valInPx, 1);
 ```
 
-You should use an `input` selector to target the `input` elements.
+Du solltest den `input` Selektor verwenden, um das `input` Element auszuwählen.
 
 ```js
 assert.exists(new __helpers.CSSHelp(document).getStyle('input'));
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61488ecfd05e290b5712e6da.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61488ecfd05e290b5712e6da.md
index 24fc01ed209..95d60b0cbdc 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61488ecfd05e290b5712e6da.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/61488ecfd05e290b5712e6da.md
@@ -1,6 +1,6 @@
 ---
 id: 61488ecfd05e290b5712e6da
-title: Step 54
+title: Schritt 54
 challengeType: 0
 dashedName: step-54
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148d99cdc7acd0c519862cb.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148d99cdc7acd0c519862cb.md
index 58edb67c82b..0aafef4d23c 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148d99cdc7acd0c519862cb.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148d99cdc7acd0c519862cb.md
@@ -1,6 +1,6 @@
 ---
 id: 6148d99cdc7acd0c519862cb
-title: Step 55
+title: Schritt 55
 challengeType: 0
 dashedName: step-55
 ---
@@ -11,14 +11,14 @@ Target all `label` elements within `.info` elements, and set their `width` to `1
 
 # --hints--
 
-You should use either the `.info label` or `.info > label` selector.
+Du solltest entweder den `.info label`- oder den `.info > label`-Selektor verwenden.
 
 ```js
 const gs = (s) => new __helpers.CSSHelp(document).getStyle(s);
 assert.exists(gs('.info label') || gs('.info > label'));
 ```
 
-You should give the `label` elements a `width` of `10%`.
+Du solltest den `label`-Elementen eine `width` von `10%` geben.
 
 ```js
 const gs = (s) => new __helpers.CSSHelp(document).getStyle(s)?.width;
@@ -26,7 +26,7 @@ const width = gs('.info label') || gs('.info > label');
 assert.equal(width, '10%');
 ```
 
-You should give the `label` elements a `min-width` of `55px`.
+Du solltest den `label`-Elementen eine `min-width` von `55px` geben.
 
 ```js
 const gs = (s) => new __helpers.CSSHelp(document).getStyle(s)?.minWidth;
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
index 7c063e6e697..90c948b39da 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
@@ -1,6 +1,6 @@
 ---
 id: 6148da157cc0bd0d06df5c0a
-title: Step 56
+title: Schritt 56
 challengeType: 0
 dashedName: step-56
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
index abcf7e41e15..e3d4895af42 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
@@ -1,6 +1,6 @@
 ---
 id: 6148dc095264000dce348bf5
-title: Step 57
+title: Schritt 57
 challengeType: 0
 dashedName: step-57
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
index 658df927f5a..63cc1bcc0fd 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
@@ -1,6 +1,6 @@
 ---
 id: 6148dcaaf2e8750e6cb4501a
-title: Step 58
+title: Schritt 58
 challengeType: 0
 dashedName: step-58
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
index 793efd6c267..19925471dbb 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
@@ -1,6 +1,6 @@
 ---
 id: 6148dd31d210990f0fb140f8
-title: Step 59
+title: Schritt 59
 challengeType: 0
 dashedName: step-59
 ---
@@ -13,7 +13,7 @@ Remove the border and bottom padding on the `.question` elements.
 
 # --hints--
 
-You should use the `.question` selector.
+Du solltest den `.question`-Selektor verwenden.
 
 ```js
 assert.exists(new __helpers.CSSHelp(document).getStyle('.question'));
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
index c6dff098adc..6e7cb619ed2 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
@@ -1,6 +1,6 @@
 ---
 id: 6148defa9c01520fb9d178a0
-title: Step 60
+title: Schritt 60
 challengeType: 0
 dashedName: step-60
 ---
@@ -297,7 +297,7 @@ p::before {
 }
 
 --fcc-editable-region--
-  
+
 --fcc-editable-region--
 
 .sr-only {
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
index 91106de590d..5ad8905a061 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
@@ -1,6 +1,6 @@
 ---
 id: 6148dfab9b54c110577de165
-title: Step 61
+title: Schritt 61
 challengeType: 0
 dashedName: step-61
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
index cc8c38be0b5..a067d72a0d4 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
@@ -266,7 +266,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -277,6 +276,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
index 1b5ef0b727d..9eea856b44f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
@@ -1,24 +1,24 @@
 ---
 id: 6148e161ecec9511941f8833
-title: Step 63
+title: Schritt 63
 challengeType: 0
 dashedName: step-63
 ---
 
 # --description--
 
-Now, we cannot read the text. Target the `footer` and the anchor element within to set the font color to a color of adequate contrast ratio.
+Jetzt können wir den Text nicht lesen. Target the `footer` and the anchor element within to set the font color to a color of adequate contrast ratio.
 
 # --hints--
 
-You should use the `footer, footer a` selector.
+Du solltest den `footer, footer a` Selektor verwenden.
 
 ```js
 const gs = (s) => new __helpers.CSSHelp(document).getStyle(s);
 assert.exists(gs('footer, footer a') || gs('footer a, footer'));
 ```
 
-You should set the `color` to a value with a contrast ratio of at least `7:1`. _Hint: I suggest `#dfdfe2`_
+Du solltest `color` auf einen Wert mit einem Kontrastverhältnis von mindestens `7:1` setzen. _Tipp: Ich empfehle `#dfdfe2`_
 
 ```js
 function luminance(r, g, b) {
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
index 71970b7ed47..6ccbce68797 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
@@ -278,7 +278,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -289,6 +288,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
index f7564e7293b..61e42a6bee8 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
@@ -260,7 +260,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -271,6 +270,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
index 3edd48ab37a..45500d7e6ec 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
@@ -1,6 +1,6 @@
 ---
 id: 6148e41c728f65138addf9cc
-title: Step 66
+title: Schritt 66
 challengeType: 0
 dashedName: step-66
 ---
@@ -28,13 +28,13 @@ Wrap the style rule that sets `scroll-behavior: smooth` within an `@media` at-ru
 
 # --hints--
 
-You should have one `@media (prefers-reduced-motion: no-preference)` rule.
+Du solltest eine `@media (prefers-reduced-motion: no-preference)` Regel haben.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getRuleListsWithinMedia('(prefers-reduced-motion: no-preference)').length, 1);
 ```
 
-You should wrap the existing `*` rule within the `@media` rule.
+Du solltest die existierende `*` Regel in die `@media` Regel einbinden.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getRuleListsWithinMedia('(prefers-reduced-motion: no-preference)')?.find(x => x.selectorText === '*')?.style?.scrollBehavior, 'smooth');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
index c287099cd82..6c61bd1a6d4 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
@@ -280,7 +280,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -291,6 +290,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
@@ -603,12 +603,12 @@ input {
 .info label,
 .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .info input {
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614ccc21ea91ef1736b9b578.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614ccc21ea91ef1736b9b578.md
index 74aed9592fe..fea80e7e916 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614ccc21ea91ef1736b9b578.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/614ccc21ea91ef1736b9b578.md
@@ -1,19 +1,19 @@
 ---
 id: 614ccc21ea91ef1736b9b578
-title: Step 1
+title: Schritt 1
 challengeType: 0
 dashedName: step-1
 ---
 
 # --description--
 
-Welcome to the first part of the Accessibility Quiz. As you are becoming a seasoned HTML and CSS developer, we have started you off with the basic boilerplate.
+Welcome to the first part of the Accessibility Quiz. Da du langsam ein erfahrener HTML- und CSS-Entwickler wirst, haben wir dich bereits mit dem grundlegenden Boilerplate-Code ausgestattet.
 
-Start this accessibility journey by providing a `lang` attribute to your `html` element. This will assist screen readers in identifying the language of the page.
+Start this accessibility journey by providing a `lang` attribute to your `html` element. Das hilft Bildschirmleseprogrammen bei der Identifizierung der Seitensprache.
 
 # --hints--
 
-You should give the `html` element a `lang` attribute. _Hint: You can use the value `en` for English._
+Du solltest dem Element `html` ein `lang`-Attribut geben. _Hinweis: Du kannst den Wert `en` für Englisch verwenden._
 
 ```js
 assert.match(code, /<html\s+lang=('|")[\w\-]+?\1\s*>/i);
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33071498eb2472b87ddee4.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33071498eb2472b87ddee4.md
index 1b430f18e6b..6cacfeae778 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33071498eb2472b87ddee4.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33071498eb2472b87ddee4.md
@@ -1,6 +1,6 @@
 ---
 id: 5f33071498eb2472b87ddee4
-title: Step 1
+title: Schritt 1
 challengeType: 0
 dashedName: step-1
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3313e74582ad9d063e3a38.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3313e74582ad9d063e3a38.md
index ac73dd15cd9..a880fd1236c 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3313e74582ad9d063e3a38.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3313e74582ad9d063e3a38.md
@@ -1,6 +1,6 @@
 ---
 id: 5f3313e74582ad9d063e3a38
-title: Step 2
+title: Schritt 2
 challengeType: 0
 dashedName: step-2
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f331e55dfab7a896e53c3a1.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f331e55dfab7a896e53c3a1.md
index 7a208ad018d..02af618bdf7 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f331e55dfab7a896e53c3a1.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f331e55dfab7a896e53c3a1.md
@@ -1,6 +1,6 @@
 ---
 id: 5f331e55dfab7a896e53c3a1
-title: Step 3
+title: Schritt 3
 challengeType: 0
 dashedName: step-3
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3326b143638ee1a09ff1e3.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3326b143638ee1a09ff1e3.md
index b9e32a5eac3..2db63ef3bc0 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3326b143638ee1a09ff1e3.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3326b143638ee1a09ff1e3.md
@@ -1,6 +1,6 @@
 ---
 id: 5f3326b143638ee1a09ff1e3
-title: Step 4
+title: Schritt 4
 challengeType: 0
 dashedName: step-4
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
index ec9b4675f12..2a5d52726df 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
@@ -1,6 +1,6 @@
 ---
 id: 5f33294a6af5e9188dbdb8f3
-title: Step 5
+title: Schritt 5
 challengeType: 0
 dashedName: step-5
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
index 895bf375d76..ae5d90497fa 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
@@ -1,6 +1,6 @@
 ---
 id: 5f332a88dc25a0fd25c7687a
-title: Step 6
+title: Schritt 6
 challengeType: 0
 dashedName: step-6
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
index 1429ca2c597..8e086a79804 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
@@ -1,6 +1,6 @@
 ---
 id: 5f332b23c2045fb843337579
-title: Step 7
+title: Schritt 7
 challengeType: 0
 dashedName: step-7
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
index 28a1e323ded..bdeaff44c8f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fc1520b6719f2e35605
-title: Schritt 9
+title: Step 8
 challengeType: 0
-dashedName: step-9
+dashedName: step-8
 ---
 
 # --description--
@@ -32,8 +32,9 @@ assert($('main').length === 1);
 Dein `section`-Element sollte sich innerhalb deines `main`-Elements befinden.
 
 ```js
-const main = document.querySelectorAll('main')?.[0];
-assert(main.children[0].tagName === 'SECTION');
+const main = document.querySelector('main');
+const section = document.querySelector('section');
+assert(section.parentElement === main);
 ```
 
 # --seed--
@@ -48,12 +49,10 @@ assert(main.children[0].tagName === 'SECTION');
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
-      <h1>CAMPER CAFE</h1>
-      <p>Est. 2020</p>
-    </header>
 --fcc-editable-region--
     <main>
+      <h1>CAMPER CAFE</h1>
+      <p>Est. 2020</p>
     </main>
 --fcc-editable-region--
   </body>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
index 7cc171c99e3..890144637bc 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
@@ -22,7 +22,7 @@ Your `styles.css` file should have the `h1, h2, p` type selector.
   assert(getUserInput('editableContents').replace(/[\s\n]*/g, "").match(/(h1|h2|p),(h1|h2|p),(h1|h2|p){/));
 }
 ```
- 
+
 Your selector should set the `text-align` property to `center`.
 
 ```js
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
index 7c4f58a9c6a..67bc76a1e03 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
@@ -7,18 +7,18 @@ dashedName: step-24
 
 # --description--
 
-Now it's easy to see that the text is centered inside the `div` element. Currently, the width of the `div` element is specified in pixels (`px`). Change the `width` property's value to be `80%`, to make it 80% the width of its parent element (`body`).
+Nun ist es einfach zu sehen, dass der Text im `div` Element zentriert ist. Derzeit ist die Breite des `div` Elements in Pixeln angegeben (`px`). Change the `width` property's value to be `80%`, to make it 80% the width of its parent element (`body`).
 
 # --hints--
 
-You should set the `width` property to `80%`.
+Du solltest die `width` Eigenschaft auf `80%` setzen.
 
 ```js
 const hasWidth = new __helpers.CSSHelp(document).getCSSRules().some(x => x.style.width === '80%');
 assert(hasWidth);
 ```
 
-You should not have a `width` property of `300px`.
+Du solltest keine `width` Eigenschaft von `300px` haben.
 
 ```js
 const hasWidth = new __helpers.CSSHelp(document).getCSSRules().some(x => x.style.width === '300px');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
index 64e419a137d..d73627a50a6 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
@@ -1,9 +1,9 @@
 ---
 id: 5f356ed60a5decd94ab66986
-title: Schritt 23
+title: Step 22
 challengeType: 0
 removeComments: false
-dashedName: step-23
+dashedName: step-22
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(bodyCSS === "rgba(0, 0, 0, 0)")
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
index 20f78c3658e..0d42ca48a5f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
@@ -7,7 +7,7 @@ dashedName: step-26
 
 # --description--
 
-So far you have been using type selectors to style elements. A <dfn>class selector</dfn> is defined by a name with a dot directly in front of it, like this:
+Bisher hast du Typ-Selektoren für verschiedene Style-Elemente verwendet. Ein <dfn>class selector</dfn> ist durch einen Namen mit einem Punkt definiert, der sich direkt vor ihm befindet, wie folgendes Beispiel:
 
 ```css
 .class-name {
@@ -19,14 +19,14 @@ Change the existing `div` selector into a class selector by replacing `div` with
 
 # --hints--
 
-You should have a `.menu` class selector.
+Du solltest einen `.menu` Klassen-Selektor haben.
 
 ```js
 const hasMenu = new __helpers.CSSHelp(document).getStyle('.menu');
 assert(hasMenu);
 ```
 
-You should not have a `div` selector.
+Du solltest keinen `div` Selektor haben.
 
 ```js
 const hasDiv = new __helpers.CSSHelp(document).getStyle('div');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
index 03b69dc0f08..a8bbe2a8191 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed63c7807a4f1e6d054
-title: Schritt 22
+title: Step 21
 challengeType: 0
-dashedName: step-22
+dashedName: step-21
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(divWidth === '300px');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
index 897d6a76d32..eff4478cf9e 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed63e0fa262326eef05
-title: Schritt 24
+title: Step 23
 challengeType: 0
-dashedName: step-24
+dashedName: step-23
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(divBackground === 'burlywood');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
index 40e67fb290f..0dee72bac66 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
@@ -7,25 +7,25 @@ dashedName: step-25
 
 # --description--
 
-Next, you want to center the `div` horizontally. You can do this by setting its `margin-left` and `margin-right` properties to `auto`. Think of the margin as invisible space around an element. Using these two margin properties, center the `div` element within the `body` element.
+Als nächstes möchtest du den `div` horizontal zentrieren. You can do this by setting its `margin-left` and `margin-right` properties to `auto`. Think of the margin as invisible space around an element. Mit diesen beiden Rand-Eigenschaften zentrierst du das `div` Element innerhalb des `body` Elements.
 
 # --hints--
 
-You should set the `margin-left` property to `auto`.
+Du solltest die `margin-left` Eigenschaft auf `auto` setzen.
 
 ```js
 const hasMargin = new __helpers.CSSHelp(document).getCSSRules().some(x => x.style['margin-left'] === 'auto');
 assert(hasMargin);
 ```
 
-You should set the `margin-right` property to `auto`.
+Du solltest die `margin-right` Eigenschaft auf `auto` setzen.
 
 ```js
 const hasMargin = new __helpers.CSSHelp(document).getCSSRules().some(x => x.style['margin-right'] === 'auto');
 assert(hasMargin);
 ```
 
-You should set the `margin-left` and `margin-right` properties of your `div` to `auto`.
+Du solltest die `margin-left` und `margin-right` Eigenschaften in deinem `div` auf `auto` setzen.
 
 ```js
 const divMarginRight = new __helpers.CSSHelp(document).getStyle('div')?.getPropertyValue('margin-right');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
index 75dba618e62..b0b06cd1c3f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed69db0a491745e2bb6
-title: Schritt 28
+title: Step 27
 challengeType: 0
-dashedName: step-28
+dashedName: step-27
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert($('div').attr('class').includes('menu'));
 --fcc-editable-region--
     <div>
 --fcc-editable-region--
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
index 27af65da331..e472561d25e 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed6cf6eab5f15f5cfe6
-title: Schritt 21
+title: Step 20
 challengeType: 0
-dashedName: step-21
+dashedName: step-20
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(div.parentElement.tagName === 'BODY');
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
index 9090f318108..f536ce35709 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d0fc037f7311b4ac8
-title: Schritt 39
+title: Step 38
 challengeType: 0
-dashedName: step-39
+dashedName: step-38
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(priceWidth === '50%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
index 551432cc671..9639a4528e8 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d28d7ad0de6470505
-title: Schritt 33
+title: Step 32
 challengeType: 0
-dashedName: step-33
+dashedName: step-32
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert($('.flavor')[0].innerText.match(/French Vanilla/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
index 1713b5d1c7a..42db0735927 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d5414453fc2d7b480
-title: Schritt 32
+title: Step 31
 challengeType: 0
-dashedName: step-32
+dashedName: step-31
 ---
 
 # --description--
@@ -90,11 +90,9 @@ assert(children[1].innerText.match(/4\.50/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
 --fcc-editable-region--
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
index 3b25e50b540..a954ef54db0 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866daec9a49519871816
-title: Schritt 31
+title: Step 30
 challengeType: 0
-dashedName: step-31
+dashedName: step-30
 ---
 
 # --description--
@@ -52,11 +52,9 @@ assert(secondP.innerText.match(/3\.00/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
 --fcc-editable-region--
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
index dd0af1c141a..b230c861baf 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
@@ -7,31 +7,31 @@ dashedName: step-37
 
 # --description--
 
-The `p` elements are nested in an `article` element with the class attribute of `item`. You can style all the `p` elements nested anywhere in elements with a class named `item` like this:
+Die `p`-Elemente sind innerhalb eines `article`-Elements mit dem Klassenattribut `item` verschachtelt. You can style all the `p` elements nested anywhere in elements with a class named `item` like this:
 
 ```css
 .item p { }
 ```
 
-Using the above selector, add a `display` property with value `inline-block` so the `p` elements behave more like inline elements.
+Verwende den obigen Selektor, füge eine `display`-Eigenschaft mit dem Wert `inline-block` hinzu, so dass die `p`-Elemente sich mehr wie Inline-Elemente verhalten.
 
 # --hints--
 
-You should use the `.item p` selector.
+Du solltest den `.item p` Selektor verwenden.
 
 ```js
 const hasItemP = new __helpers.CSSHelp(document).getStyle('.item p');
 assert(hasItemP);
 ```
 
-You should set the `display` property to `inline-block`.
+Du solltest die `display`-Eigenschaft auf `inline-block` setzen.
 
 ```js
 const hasDisplay = new __helpers.CSSHelp(document).getCSSRules().some(x => x.style.display === 'inline-block');
 assert(hasDisplay);
 ```
 
-Your `.item p` selector should set the `display` property to `inline-block`.
+Dein `.item p`-Selektor sollte die `display`-Eigenschaft auf `inline-block` setzen.
 
 ```js
 const itemPDisplay = new __helpers.CSSHelp(document).getStyle('.item p')?.getPropertyValue('display');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
index f8c05c3d09a..1043aa383f2 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
@@ -7,20 +7,20 @@ dashedName: step-56
 
 # --description--
 
-The current width of the menu will always take up 80% of the `body` element's width. On a very wide screen, the coffee and dessert appear far apart from their prices.
+Die aktuelle Breite der Speisekarte wird immer 80% der Breite des `body`-Elements beanspruchen. On a very wide screen, the coffee and dessert appear far apart from their prices.
 
 Add a `max-width` property to the `menu` class with a value of `500px` to prevent it from growing too wide.
 
 # --hints--
 
-You should set the `max-width` property to `500px`.
+Du solltest die `max-width`-Eigenschaft auf `500px` setzen.
 
 ```js
 const hasMaxWidth = new __helpers.CSSHelp(document).getCSSRules().some(x => x.style['max-width'] === '500px');
 assert(hasMaxWidth);
 ```
 
-Your `.menu` element should have a `max-width` of `500px`.
+Dein `.menu`-Element sollte ein `max-width` von `500px` haben.
 
 ```js
 const menuMaxWidth = new __helpers.CSSHelp(document).getStyle('.menu')?.getPropertyValue('max-width');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
index eda7dc49aae..4e54f07f7c7 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
@@ -7,35 +7,35 @@ dashedName: step-55
 
 # --description--
 
-Since all 4 sides of the menu have the same internal spacing, go ahead and delete the four properties and use a single `padding` property with the value `20px`.
+Da alle 4 Seiten der Speisekarte die gleichen Abstände haben, lösche die vier Eigenschaften und verwende eine einzige `padding`-Eigenschaft mit dem Wert `20px`.
 
 # --hints--
 
-You should remove the `padding-left` property.
+Du solltest die `padding-left`-Eigenschaft entfernen.
 
 ```js
 assert(!code.match(/padding-left/i));
 ```
 
-You should remove the `padding-right` property.
+Du solltest die `padding-right`-Eigenschaft entfernen.
 
 ```js
 assert(!code.match(/padding-right/i));
 ```
 
-You should remove the `padding-top` property.
+Du solltest die `padding-top`-Eigenschaft entfernen.
 
 ```js
 assert(!code.match(/padding-top/i));
 ```
 
-You should remove the `padding-bottom` property.
+Du solltest die `padding-bottom`-Eigenschaft entfernen.
 
 ```js
 assert(!code.match(/padding-bottom/i));
 ```
 
-You should set the `padding` property to `20px`.
+Du solltest die `padding`-Eigenschaft auf `20px` setzen.
 
 ```js
 const hasPadding = new __helpers.CSSHelp(document).getCSSRules().some(x => x.style['padding'] === '20px');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
index 0caf7454747..1b2732f8192 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
@@ -7,11 +7,11 @@ dashedName: step-54
 
 # --description--
 
-That looks better. Now try to add the same `20px` padding to the top and bottom of the menu.
+Das sieht besser aus. Now try to add the same `20px` padding to the top and bottom of the menu.
 
 # --hints--
 
-You should not remove the `padding-left` or `padding-right` properties.
+Du solltest nicht die `padding-left`- oder `padding-right`-Eigenschaften entfernen.
 
 ```js
 const paddingLeft = new __helpers.CSSHelp(document).getStyle('.menu')?.getPropertyValue('padding-left');
@@ -20,28 +20,28 @@ const paddingRight = new __helpers.CSSHelp(document).getStyle('.menu')?.getPrope
 assert(paddingRight === '20px');
 ```
 
-You should set the `padding-top` property to `20px`.
+Du solltest die `padding-top`-Eigenschaft auf `20px` setzen.
 
 ```js
 const hasPaddingTop = new __helpers.CSSHelp(document).getCSSRules().some(x => x.style['padding-top'] === '20px');
 assert(hasPaddingTop);
 ```
 
-You should set the `padding-bottom` property to `20px`.
+Du solltest die `padding-bottom`-Eigenschaft auf `20px` setzen.
 
 ```js
 const hasPaddingBottom = new __helpers.CSSHelp(document).getCSSRules().some(x => x.style['padding-top'] === '20px');
 assert(hasPaddingBottom);
 ```
 
-Your `.menu` element should have a `padding-top` of `20px`.
+Dein `.menu`-Element sollte ein `padding-top` von `20px` haben.
 
 ```js
 const menuPaddingTop = new __helpers.CSSHelp(document).getStyle('.menu')?.getPropertyValue('padding-top');
 assert(menuPaddingTop === '20px');
 ```
 
-Your `.menu` element should have a `padding-bottom` of `20px`.
+Dein `.menu`-Element sollte ein `padding-bottom` von `20px` haben.
 
 ```js
 const menuPaddingBottom = new __helpers.CSSHelp(document).getStyle('.menu')?.getPropertyValue('padding-bottom');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
index afcc40cab21..1f14fc381f2 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
@@ -13,7 +13,7 @@ Change all the text in your `body`, by adding a `font-family` property with the
 
 # --hints--
 
-You should set the `font-family` property to `sans-serif`.
+Du solltest die `font-family`-Eigenschaft auf `sans-serif` setzen.
 
 ```js
 const hasFontFamily = new __helpers.CSSHelp(document).getCSSRules().some(x => x.style['font-family'] === 'sans-serif');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
index 8bdf01874e1..caaca5e7676 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
@@ -7,13 +7,13 @@ dashedName: step-58
 
 # --description--
 
-It is a bit boring for all the text to have the same `font-family`. You can still have the majority of the text `sans-serif` and make just the `h1` and `h2` elements different using a different selector.
+Es ist ein bisschen langweilig, dass alle Texte in der gleichen `font-family` sind. You can still have the majority of the text `sans-serif` and make just the `h1` and `h2` elements different using a different selector.
 
 Style both the `h1` and the `h2` elements so that only these elements' text use `Impact` font.
 
 # --hints--
 
-You should use an `h1, h2` selector.
+Du solltest einen `h1, h2`-Selektor verwenden.
 
 ```js
 const h1h2Selector = new __helpers.CSSHelp(document).getStyle('h1, h2');
@@ -27,13 +27,13 @@ const hasFontFamily = new __helpers.CSSHelp(document).getCSSRules().some(x => x.
 assert(hasFontFamily);
 ```
 
-Your `h1` element should have a `font-family` of `Impact`.
+Dein `h1`-Element sollte die `font-family` `Impact` verwenden.
 
 ```js
 assert($('h1').css('font-family').match(/impact/i));
 ```
 
-Your `h2` element should have a `font-family` of `Impact`.
+Dein `h2`-Element sollte die `font-family` `Impact` verwenden.
 
 ```js
 assert($('h2').css('font-family').match(/impact/i));
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
index aa23aabc917..dde7081b125 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e06d34faac0447fc44
-title: Schritt 61
+title: Step 60
 challengeType: 0
-dashedName: step-61
+dashedName: step-60
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(establishedFontStyle === 'italic');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
index 00b9ca01a3d..419e9fc1d33 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
@@ -17,7 +17,7 @@ You should not change your existing `h2` element.
 assert($('h2').length === 2);
 ```
 
-Your `article` element should be below your `h2` element.
+Dein `article`-Element sollte unter deinem `h2`-Element stehen.
 
 ```js
 assert($('section')[1].children[1].tagName === 'ARTICLE');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
index f448a4adb71..96788beec97 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
@@ -11,7 +11,7 @@ Now apply the `established` class to the `Est. 2020` text.
 
 # --hints--
 
-You should set the `class` of the `p` element to `established`.
+Du solltest die `class` des `p`-Elements auf `established` setzen.
 
 ```js
 assert(code.match(/<p class=('|")established\1>/i));
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
index 9f72f2380b6..7d83aef878e 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
@@ -97,7 +97,7 @@ assert(document.querySelector("footer > p > a")?.href === "https://www.freecodec
       </main>
 --fcc-editable-region--
       <footer>
-        
+
       </footer>
 --fcc-editable-region--
     </div>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
index a26dfdb2f5e..7bc7befaf2d 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
@@ -7,20 +7,20 @@ dashedName: step-67
 
 # --description--
 
-The default properties of an `hr` element will make it appear as a thin light grey line. You can change the height of the line by specifying a value for the `height` property.
+The default properties of an `hr` element will make it appear as a thin light grey line. Du kannst die Höhe der Zeile ändern, indem du einen Wert für die `height`-Eigenschaft angibst.
 
-Change the height of the `hr` element to be `3px`.
+Ändere die Höhe des `hr`-Elements auf `3px`.
 
 # --hints--
 
-You should use the `hr` selector.
+Du solltest den Selektor `hr` verwenden.
 
 ```js
 const hasHr = new __helpers.CSSHelp(document).getStyle('hr');
 assert(hasHr);
 ```
 
-You should set the `height` property to `3px`.
+Du solltest die `height`-Eigenschaft auf `3px` setzen.
 
 ```js
 const hasHeight = new __helpers.CSSHelp(document).getCSSRules().some(x => x.style.height === '3px');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
index e7445bc56fb..59150ca524e 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
@@ -7,20 +7,20 @@ dashedName: step-69
 
 # --description--
 
-Notice the grey color along the edges of the line. Those edges are known as <dfn>borders</dfn>. Each side of an element can have a different color or they can all be the same.
+Beachte die graue Farbe an den Rändern der Linie. Diese Kanten werden als <dfn>Grenzen</dfn> bezeichnet. Each side of an element can have a different color or they can all be the same.
 
 Make all the edges of the `hr` element the same color as the background of it using the `border-color` property.
 
 # --hints--
 
-You should set the `border-color` property to `brown`.
+Du solltest die Eigenschaft `border-color` auf `brown` setzen.
 
 ```js
 const hasBorderColor = new __helpers.CSSHelp(document).getCSSRules().some(x => x.style['border-color'] === 'brown');
 assert(hasBorderColor);
 ```
 
-Your `hr` element should have a `border-color` of `brown`.
+Dein `hr` Element sollte eine `border-color` von `brown` haben.
 
 ```js
 const hrBorderColor = new __helpers.CSSHelp(document).getStyle('hr')?.getPropertyValue('border-color');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
index c1884808268..2a1be758d00 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
@@ -9,18 +9,18 @@ dashedName: step-70
 
 Notice how the thickness of the line looks bigger? The default value of a property named `border-width` is `1px` for all edges of `hr` elements. By changing the border to the same color as the background, the total height of the line is `5px` (`3px` plus the top and bottom border width of `1px`).
 
-Change the `height` property of the `hr` to be `2px`, so the total height of it becomes `4px`.
+Ändere die `height` Eigenschaft der `hr` auf `2px`, so dass die Gesamthöhe `4px` ist.
 
 # --hints--
 
-You should set the `height` property to `2px`.
+Du solltest die `height` Eigenschaft auf `2px` setzen.
 
 ```js
 const hasHeight = new __helpers.CSSHelp(document).getCSSRules().some(x => x.style.height === '2px');
 assert(hasHeight);
 ```
 
-Your `hr` element should have a `height` of `2px`.
+Dein `hr` Element sollte eine `height` von `2px` haben.
 
 ```js
 const hrHeight = new __helpers.CSSHelp(document).getStyle('hr')?.getPropertyValue('height');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
index 852cb7a7dfa..82c5f65054c 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
@@ -11,13 +11,13 @@ Go ahead and add another `hr` element between the `main` element and the `footer
 
 # --hints--
 
-You should add a second `hr` element.
+Du solltest ein zweites `hr`-Element hinzufügen.
 
 ```js
 assert($('hr').length === 2);
 ```
 
-Your new `hr` element should be between the `main` element and the `footer` element.
+Dein neues `hr` Element sollte zwischen dem `main` Element und dem `footer` Element stehen.
 
 ```js
 assert($('hr')[1].previousElementSibling.tagName === 'MAIN');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
index 074b8f9c29d..68e7ba5e3bf 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
@@ -7,7 +7,7 @@ dashedName: step-89
 
 # --description--
 
-The image you added is not centered horizontally like the `Coffee` heading above it. `img` elements are "like" inline elements.
+The image you added is not centered horizontally like the `Coffee` heading above it. `img` Elemente sind "ähnliche" Inline-Elemente.
 
 To make the image behave like heading elements (which are block-level), create an `img` type selector and use the value `block` for the `display` property and use the applicable `margin-left` and `margin-right` values to center it horizontally.
 
@@ -20,35 +20,35 @@ const hasImg = new __helpers.CSSHelp(document).getStyle('img');
 assert(hasImg);
 ```
 
-You should set the `display` property to `block`.
+Du solltest die `display` Eigenschaft auf `block` setzen.
 
 ```js
 const hasDisplay = new __helpers.CSSHelp(document).getCSSRules().some(x => x.style.display === 'block');
 assert(hasDisplay);
 ```
 
-You should set the `margin-left` property to `auto`.
+Du solltest die `margin-left` Eigenschaft auf `auto` setzen.
 
 ```js
 const marginLeftFilter = new __helpers.CSSHelp(document).getCSSRules().filter(x => x.style['margin-left'] === 'auto');
 assert(marginLeftFilter.length === 2);
 ```
 
-You should set the `margin-right` property to `auto`.
+Du solltest die `margin-right` Eigenschaft auf `auto` setzen.
 
 ```js
 const marginRightFilter = new __helpers.CSSHelp(document).getCSSRules().filter(x => x.style['margin-right'] === 'auto');
 assert(marginRightFilter.length === 2);
 ```
 
-Your `img` element should have a `display` of `block`.
+Dein `img` Element sollte ein `display` von `block` enthalten.
 
 ```js
 const imgDisplay = new __helpers.CSSHelp(document).getStyle('img')?.getPropertyValue('display');
 assert(imgDisplay === 'block');
 ```
 
-Your `img` element should have a `margin-left` and `margin-right` of `auto`.
+Dein `img` Element sollte den `margin-left` und `margin-right` auf `auto` gesetzt haben.
 
 ```js
 const imgMarginLeft = new __helpers.CSSHelp(document).getStyle('img')?.getPropertyValue('margin-left');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
index 4a9c49b00db..88a1c0423e9 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
@@ -7,23 +7,23 @@ dashedName: step-90
 
 # --description--
 
-Add one last image under the `Desserts` heading using the url `https://cdn.freecodecamp.org/curriculum/css-cafe/pie.jpg`. Give the image an `alt` value of `pie icon`.
+Add one last image under the `Desserts` heading using the url `https://cdn.freecodecamp.org/curriculum/css-cafe/pie.jpg`. Gib dem Bild einen `alt` Wert von `pie icon`.
 
 # --hints--
 
-You should add a second `img` element.
+Du solltest ein zweites `img` Element hinzufügen.
 
 ```js
 assert($('img').length === 2);
 ```
 
-Your new `img` element should have a `src` of `https://cdn.freecodecamp.org/curriculum/css-cafe/pie.jpg`.
+Dein neues `img` Element sollte einen `src` von `https://cdn.freecodecamp.org/curriculum/css-cafe/pie.jpg` haben.
 
 ```js
 assert($('img').last().attr('src') === 'https://cdn.freecodecamp.org/curriculum/css-cafe/pie.jpg');
 ```
 
-Your new `img` element should have an `alt` of `pie icon`.
+Dein neues `img`-Element sollte ein `alt` von `pie icon` haben.
 
 ```js
 assert($('img').last().attr('alt').match(/pie icon/i));
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
index 4bf68b3c602..67c6dea4393 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
@@ -7,7 +7,7 @@ dashedName: step-49
 
 # --description--
 
-Nest two `p` elements inside your `article` element. The first one's text should be `Donut`, and the second's text `1.50`. Put both of them on the same line making sure there is no space between them.
+Verschachtel zwei `p` Elemente in deinem `article` Element. The first one's text should be `Donut`, and the second's text `1.50`. Schreibe beide in dieselbe Zeile und achte darauf, dass kein Abstand dazwischen ist.
 
 # --hints--
 
@@ -17,19 +17,19 @@ You should not change your existing `article` element.
 assert($('article').length === 6);
 ```
 
-Your new `article` element should have two `p` elements.
+Dein neues `article` Element sollte zwei `p` Elemente haben.
 
 ```js
 assert($('article').last().children('p').length === 2);
 ```
 
-Your first `p` element should have the text `Donut`.
+Dein erstes `p` Element sollte den Text `Donut` haben.
 
 ```js
 assert($('article').last().children('p')[0].innerText.match(/Donut/i));
 ```
 
-Your second `p` element should have the text `1.50`.
+Dein zweites `p` Element sollte den Text `1.50` enthalten.
 
 ```js
 assert($('article').last().children('p')[1].innerText.match(/1\.50/i));
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
index fdf1b43a424..a5a4b56d681 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
@@ -17,7 +17,7 @@ Cinnamon Roll 2.50
 
 # --hints--
 
-You should have four `article` elements in your second `section`.
+Du solltest vier `article` Elemente in deiner zweiten `section` haben.
 
 ```js
 const secondSection = document.querySelectorAll('section')[1]
@@ -25,19 +25,19 @@ const articles = secondSection.querySelectorAll('article')
 assert(articles.length === 4)
 ```
 
-You should have four `.dessert` elements.
+Du solltest vier `.dessert` Elemente haben.
 
 ```js
 assert($('.dessert').length === 4);
 ```
 
-You should have four new `.price` elements.
+Du solltest vier neue `.price` Elemente haben.
 
 ```js
 assert($('section').last().find('.price').length === 4);
 ```
 
-Your `section` element should have eight `p` elements.
+Dein `section` Element sollte acht `p` Elemente haben.
 
 ```js
 assert($('section').last().find('p').length === 8);
@@ -63,7 +63,7 @@ assert(prices[2].innerText.match(/3\.00/));
 assert(prices[3].innerText.match(/2\.50/));
 ```
 
-You should not have any spaces between your `p` elements.
+Du solltest keine Leerzeichen zwischen deinen `p` Elementen haben.
 
 ```js
 assert(!code.match(/<\/p>\s+<p/));
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
index 37f2d741ccc..c66475d6ff2 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
@@ -13,7 +13,7 @@ Since the `flavor` class selector already has the properties you want, just add
 
 # --hints--
 
-You should add the `.dessert` selector to your `.flavor` selector. 
+You should add the `.dessert` selector to your `.flavor` selector.
 
 ```js
 const selector = new __helpers.CSSHelp(document).getStyle('.flavor, .dessert') || new __helpers.CSSHelp(document).getStyle('.dessert, .flavor');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6140de31b1f5b420410728ff.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6140de31b1f5b420410728ff.md
index 76f9ec80c72..52325486759 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6140de31b1f5b420410728ff.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6140de31b1f5b420410728ff.md
@@ -1,6 +1,6 @@
 ---
 id: 6140de31b1f5b420410728ff
-title: Step 19
+title: Schritt 19
 challengeType: 0
 dashedName: step-19
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6140df547f09402144e40b92.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6140df547f09402144e40b92.md
index 6d83fdb1c68..fd39893d2f1 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6140df547f09402144e40b92.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6140df547f09402144e40b92.md
@@ -1,6 +1,6 @@
 ---
 id: 6140df547f09402144e40b92
-title: Step 20
+title: Schritt 20
 challengeType: 0
 dashedName: step-20
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6140e0d875ec16262f26432b.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6140e0d875ec16262f26432b.md
index af0430c9f6f..fab544ac8b2 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6140e0d875ec16262f26432b.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6140e0d875ec16262f26432b.md
@@ -1,6 +1,6 @@
 ---
 id: 6140e0d875ec16262f26432b
-title: Step 21
+title: Schritt 21
 challengeType: 0
 dashedName: step-21
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6140f4b5c1555a2960de1e5f.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6140f4b5c1555a2960de1e5f.md
index 6c6ae12000e..9797d226a72 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6140f4b5c1555a2960de1e5f.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6140f4b5c1555a2960de1e5f.md
@@ -1,6 +1,6 @@
 ---
 id: 6140f4b5c1555a2960de1e5f
-title: Step 22
+title: Schritt 22
 challengeType: 0
 dashedName: step-22
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/614100d7d335bb2a5ff74f1f.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/614100d7d335bb2a5ff74f1f.md
index 213e9642565..77be9f9e497 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/614100d7d335bb2a5ff74f1f.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/614100d7d335bb2a5ff74f1f.md
@@ -1,6 +1,6 @@
 ---
 id: 614100d7d335bb2a5ff74f1f
-title: Step 23
+title: Schritt 23
 challengeType: 0
 dashedName: step-23
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6141019eadec6d2c6c6f007b.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6141019eadec6d2c6c6f007b.md
index a378bec97d8..46099e8fa5e 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6141019eadec6d2c6c6f007b.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6141019eadec6d2c6c6f007b.md
@@ -1,6 +1,6 @@
 ---
 id: 6141019eadec6d2c6c6f007b
-title: Step 25
+title: Schritt 25
 challengeType: 0
 dashedName: step-25
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6169ab1aaeb4cd1174def700.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6169ab1aaeb4cd1174def700.md
index 976bf2acd56..7400d20b623 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6169ab1aaeb4cd1174def700.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6169ab1aaeb4cd1174def700.md
@@ -1,13 +1,13 @@
 ---
 id: 6169ab1aaeb4cd1174def700
-title: Step 27
+title: Schritt 27
 challengeType: 0
 dashedName: step-27
 ---
 
 # --description--
 
-Because the animation is on an infinite loop and the start and end colors are not the same, the transition appears jerky when it switches back to yellow from red. 
+Because the animation is on an infinite loop and the start and end colors are not the same, the transition appears jerky when it switches back to yellow from red.
 
 To start fixing this, remove the `background-color` from your `0%` selector.
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6169b1357fcb701bb5efc619.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6169b1357fcb701bb5efc619.md
index f66778bf091..9f6054b3af6 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6169b1357fcb701bb5efc619.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6169b1357fcb701bb5efc619.md
@@ -1,6 +1,6 @@
 ---
 id: 6169b1357fcb701bb5efc619
-title: Step 28
+title: Schritt 28
 challengeType: 0
 dashedName: step-28
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6169b284950e171d8d0bb16a.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6169b284950e171d8d0bb16a.md
index 540ac1fa9a8..d0722daaa4a 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6169b284950e171d8d0bb16a.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-animation-by-building-a-ferris-wheel/6169b284950e171d8d0bb16a.md
@@ -1,6 +1,6 @@
 ---
 id: 6169b284950e171d8d0bb16a
-title: Step 29
+title: Schritt 29
 challengeType: 0
 dashedName: step-29
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616d4a84b756d9c4b8255093.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616d4a84b756d9c4b8255093.md
index cc3c488e9cf..5c6b1674beb 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616d4a84b756d9c4b8255093.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616d4a84b756d9c4b8255093.md
@@ -13,7 +13,7 @@ As a reminder, here's how to target the class `freecodecamp`:
 
 ```css
 .freecodecamp {
-  
+
 }
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61764f23ea21477b76f3b80f.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61764f23ea21477b76f3b80f.md
index dc186b95d24..abfc5b7def3 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61764f23ea21477b76f3b80f.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61764f23ea21477b76f3b80f.md
@@ -1,6 +1,6 @@
 ---
 id: 61764f23ea21477b76f3b80f
-title: Step 17
+title: Schritt 17
 challengeType: 0
 dashedName: step-17
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61764fdda535587e1fefb3aa.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61764fdda535587e1fefb3aa.md
index f6d0a957ac2..c3be35e0eac 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61764fdda535587e1fefb3aa.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61764fdda535587e1fefb3aa.md
@@ -1,6 +1,6 @@
 ---
 id: 61764fdda535587e1fefb3aa
-title: Step 19
+title: Schritt 19
 challengeType: 0
 dashedName: step-19
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/6176519636a76b810ab1219a.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/6176519636a76b810ab1219a.md
index c12996ca382..e982ec568a1 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/6176519636a76b810ab1219a.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/6176519636a76b810ab1219a.md
@@ -7,7 +7,7 @@ dashedName: step-20
 
 # --description--
 
-Create a CSS rule that targets the class `two` and set its `background-color` property to `green`. 
+Create a CSS rule that targets the class `two` and set its `background-color` property to `green`.
 
 Also, create a separate CSS rule that targets the class `three` and set its `background-color` to `blue`.
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/617b954d9f4f6217a749380e.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/617b954d9f4f6217a749380e.md
index 2c3b87c8c99..202c96e49d1 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/617b954d9f4f6217a749380e.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/617b954d9f4f6217a749380e.md
@@ -1,6 +1,6 @@
 ---
 id: 617b954d9f4f6217a749380e
-title: Step 25
+title: Schritt 25
 challengeType: 0
 dashedName: step-25
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b7396e57b771f903be90d.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b7396e57b771f903be90d.md
index 9bc0fb6a20d..fd7f6a0ac10 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b7396e57b771f903be90d.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/619b7396e57b771f903be90d.md
@@ -1,6 +1,6 @@
 ---
 id: 619b7396e57b771f903be90d
-title: Step 43
+title: Schritt 43
 challengeType: 0
 dashedName: step-43
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4ae5f29eb5584187201c3.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4ae5f29eb5584187201c3.md
index 64460fa49cf..e8218fdad18 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4ae5f29eb5584187201c3.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61a4ae5f29eb5584187201c3.md
@@ -1,6 +1,6 @@
 ---
 id: 61a4ae5f29eb5584187201c3
-title: Step 61
+title: Schritt 61
 challengeType: 0
 dashedName: step-61
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61adc91467b5d59328b9f781.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61adc91467b5d59328b9f781.md
index 8240849364e..5b6e46ca7c7 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61adc91467b5d59328b9f781.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61adc91467b5d59328b9f781.md
@@ -1,6 +1,6 @@
 ---
 id: 61adc91467b5d59328b9f781
-title: Step 79
+title: Schritt 79
 challengeType: 0
 dashedName: step-79
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b092eb9e7fc020b43b1bb2.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b092eb9e7fc020b43b1bb2.md
index abe6ce28aac..e9f2853c7b1 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b092eb9e7fc020b43b1bb2.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b092eb9e7fc020b43b1bb2.md
@@ -1,6 +1,6 @@
 ---
 id: 61b092eb9e7fc020b43b1bb2
-title: Step 72
+title: Schritt 72
 challengeType: 0
 dashedName: step-72
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0934c9e7fc020b43b1bb7.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0934c9e7fc020b43b1bb7.md
index 4791648d18e..dc54780e95f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0934c9e7fc020b43b1bb7.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0934c9e7fc020b43b1bb7.md
@@ -1,6 +1,6 @@
 ---
 id: 61b0934c9e7fc020b43b1bb7
-title: Step 77
+title: Schritt 77
 challengeType: 0
 dashedName: step-77
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0936d9e7fc020b43b1bb8.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0936d9e7fc020b43b1bb8.md
index ac1b7377b3f..59dd7bf3149 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0936d9e7fc020b43b1bb8.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b0936d9e7fc020b43b1bb8.md
@@ -1,6 +1,6 @@
 ---
 id: 61b0936d9e7fc020b43b1bb8
-title: Step 78
+title: Schritt 78
 challengeType: 0
 dashedName: step-78
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b095a79e7fc020b43b1bba.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b095a79e7fc020b43b1bba.md
index 48a75db6e2c..4e49914e907 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b095a79e7fc020b43b1bba.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b095a79e7fc020b43b1bba.md
@@ -1,6 +1,6 @@
 ---
 id: 61b095a79e7fc020b43b1bba
-title: Step 52
+title: Schritt 52
 challengeType: 0
 dashedName: step-52
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b095c79e7fc020b43b1bbb.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b095c79e7fc020b43b1bbb.md
index f12ed48d45e..f2ccd9d623a 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b095c79e7fc020b43b1bbb.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b095c79e7fc020b43b1bbb.md
@@ -1,6 +1,6 @@
 ---
 id: 61b095c79e7fc020b43b1bbb
-title: Step 62
+title: Schritt 62
 challengeType: 0
 dashedName: step-62
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b30a286c228bd0c493c09a.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b30a286c228bd0c493c09a.md
index 9b91e0184d5..0a935434381 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b30a286c228bd0c493c09a.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b30a286c228bd0c493c09a.md
@@ -1,6 +1,6 @@
 ---
 id: 61b30a286c228bd0c493c09a
-title: Step 89
+title: Schritt 89
 challengeType: 0
 dashedName: step-89
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b315e76a63b3ecbbb11b75.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b315e76a63b3ecbbb11b75.md
index da0027fff13..03df902053f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b315e76a63b3ecbbb11b75.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b315e76a63b3ecbbb11b75.md
@@ -1,6 +1,6 @@
 ---
 id: 61b315e76a63b3ecbbb11b75
-title: Step 91
+title: Schritt 91
 challengeType: 0
 dashedName: step-91
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b3183655ec10efd8c0bb07.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b3183655ec10efd8c0bb07.md
index 1cc0c1b3591..54377054de8 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b3183655ec10efd8c0bb07.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b3183655ec10efd8c0bb07.md
@@ -1,6 +1,6 @@
 ---
 id: 61b3183655ec10efd8c0bb07
-title: Step 92
+title: Schritt 92
 challengeType: 0
 dashedName: step-92
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b31a451057fff645ec09be.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b31a451057fff645ec09be.md
index 8750e8fc2ed..2c2a7479d8d 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b31a451057fff645ec09be.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b31a451057fff645ec09be.md
@@ -1,6 +1,6 @@
 ---
 id: 61b31a451057fff645ec09be
-title: Step 93
+title: Schritt 93
 challengeType: 0
 dashedName: step-93
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b31cd7b0c76bfc076b4719.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b31cd7b0c76bfc076b4719.md
index 8a9dc372ba6..7ee42b3aba6 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b31cd7b0c76bfc076b4719.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/61b31cd7b0c76bfc076b4719.md
@@ -1,6 +1,6 @@
 ---
 id: 61b31cd7b0c76bfc076b4719
-title: Step 94
+title: Schritt 94
 challengeType: 0
 dashedName: step-94
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61537bb9b1a29430ac15ad38.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61537bb9b1a29430ac15ad38.md
index 60b0ca3f063..7121a03e0af 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61537bb9b1a29430ac15ad38.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61537bb9b1a29430ac15ad38.md
@@ -1,6 +1,6 @@
 ---
 id: 61537bb9b1a29430ac15ad38
-title: Step 3
+title: Schritt 3
 challengeType: 0
 dashedName: step-3
 ---
@@ -24,14 +24,14 @@ const title = document.querySelector('title');
 assert.exists(title);
 ```
 
-Your project should have a title of `Photo Gallery`.
+Dein Projekt sollte einen Titel namens `Photo Gallery` tragen.
 
 ```js
 const title = document.querySelector('title');
 assert.equal(title?.text?.trim()?.toLowerCase(), 'photo gallery')
 ```
 
-Remember, the casing and spelling matter for the title.
+Denke daran, dass Schreibweise und Rechtschreibung für den Titel wichtig sind.
 
 ```js
 const title = document.querySelector('title');
@@ -49,7 +49,7 @@ assert.equal(title?.text?.trim(), 'Photo Gallery');
   <head>
     <meta charset="utf-8">
     <meta name="viewport" content="width=device-width, initial-scale=1.0">
-    
+
   </head>
   <body>
   </body>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61537c5f81f0cf325b4a854c.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61537c5f81f0cf325b4a854c.md
index c069eb9299e..55a815178bb 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61537c5f81f0cf325b4a854c.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61537c5f81f0cf325b4a854c.md
@@ -1,6 +1,6 @@
 ---
 id: 61537c5f81f0cf325b4a854c
-title: Step 4
+title: Schritt 4
 challengeType: 0
 dashedName: step-4
 ---
@@ -9,7 +9,7 @@ dashedName: step-4
 
 Add a `header` element within the `body` element and assign a class of `header` to it.
 
-Inside the `header`, create an `h1` with `css flexbox photo gallery` as the text.
+Erstelle im `header` einen `h1` mit `css flexbox photo gallery` als Text.
 
 # --hints--
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61537c9eecea6a335db6da79.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61537c9eecea6a335db6da79.md
index 929dff53a89..396c7018c48 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61537c9eecea6a335db6da79.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61537c9eecea6a335db6da79.md
@@ -1,6 +1,6 @@
 ---
 id: 61537c9eecea6a335db6da79
-title: Step 5
+title: Schritt 5
 challengeType: 0
 dashedName: step-5
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153897c27f6334716ee5abe.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153897c27f6334716ee5abe.md
index e4cb8a61120..ab89d168847 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153897c27f6334716ee5abe.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153897c27f6334716ee5abe.md
@@ -11,7 +11,7 @@ Align your `.header` text in the center. Make the text uppercase using the `text
 
 Give it a padding of `32px` on all sides. Set the background to `#0a0a23` and the text to `#fff` as the color values.
 
-Add a `border-bottom` with `4px solid #fdb347` as the value.
+Füge einen `border-bottom` mit `4px solid #fdb347` als Wert hinzu.
 
 
 # --hints--
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153908a366afb4d57185c8d.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153908a366afb4d57185c8d.md
index b7c95ab2a98..18ee8fed3e8 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153908a366afb4d57185c8d.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153908a366afb4d57185c8d.md
@@ -7,14 +7,14 @@ dashedName: step-12
 
 # --description--
 
-Flexbox has a main and cross axis. The main axis is defined by the `flex-direction` property, which has four possible values:
+Flexbox hat eine Haupt- und Querachse. The main axis is defined by the `flex-direction` property, which has four possible values:
 
-- `row` (default): horizontal axis with flex items from left to right
-- `row-reverse`: horizontal axis with flex items from right to left
-- `column`: vertical axis with flex items from top to bottom
-- `column-reverse`: vertical axis with flex items from bottom to top
+- `row` (Standard): horizontale Achse mit Flex-Elementen von links nach rechts
+- `row-reverse`: horizontale Achse mit Flex-Elementen von rechts nach links
+- `column`: vertikale Achse mit Flex-Elementen von oben nach unten
+- `column-reverse`: vertikale Achse mit Flex-Elementen von unten nach oben
 
-**Note**: The axes and directions will be different depending on the text direction. The values shown are for a left-to-right text direction.
+**Note**: Die Achsen und Richtungen unterscheiden sich je nach Textrichtung. Die angegebenen Werte sind für eine Textrichtung von links nach rechts bestimmt.
 
 Try the different values to see how they affect the layout.
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/615392916d83fa4f02f7e2cf.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/615392916d83fa4f02f7e2cf.md
index 277105f76b3..1c3ac6e16a6 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/615392916d83fa4f02f7e2cf.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/615392916d83fa4f02f7e2cf.md
@@ -8,7 +8,7 @@ dashedName: step-13
 # --description--
 
 
-The `flex-wrap` property determines how your flex items behave when the flex container is too small. Setting it to `wrap` will allow the items to wrap to the next row or column. `nowrap` (default) will prevent your items from wrapping and shrink them if needed.
+The `flex-wrap` property determines how your flex items behave when the flex container is too small. Setting it to `wrap` will allow the items to wrap to the next row or column. Wenn nötig verhindert `nowrap` (standardmäßig) das Umbrechen oder Schrumpfen der Elemente.
 
 
 Make it so your flex items wrap to the next row when they run out of space.
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153947986535e5117e60615.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153947986535e5117e60615.md
index 488165a36f3..22d7937733c 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153947986535e5117e60615.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153947986535e5117e60615.md
@@ -1,13 +1,13 @@
 ---
 id: 6153947986535e5117e60615
-title: Step 15
+title: Schritt 15
 challengeType: 0
 dashedName: step-15
 ---
 
 # --description--
 
-The `align-items` property positions the flex content along the cross axis. In this case, with your `flex-direction` set to `row`, your cross axis would be vertical.
+The `align-items` property positions the flex content along the cross axis. Wenn deine `flex-direction` auf `row` gesetzt ist, wäre deine Querachse in diesem Fall vertikal.
 
 To vertically center your images, give your `.gallery` selector an `align-items` property with `center` as the value.
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61539f32a206bd53ec116465.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61539f32a206bd53ec116465.md
index 0ae907c8829..206ee5ff64f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61539f32a206bd53ec116465.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61539f32a206bd53ec116465.md
@@ -7,7 +7,7 @@ dashedName: step-17
 
 # --description--
 
-Notice how some of your images have become distorted. This is because the images have different aspect ratios. Rather than setting each aspect ratio individually, you can use the `object-fit` property to determine how images should behave.
+Beachte, dass einige deiner Bilder verzerrt sind. Das liegt daran, dass die Bilder verschiedene Seitenverhältnisse haben. Rather than setting each aspect ratio individually, you can use the `object-fit` property to determine how images should behave.
 
 Give your `.gallery img` selector the `object-fit` property and set it to `cover`. This will tell the image to fill the `img` container while maintaining aspect ratio, resulting in cropping to fit.
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3ebb4f7f05b8401b716.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3ebb4f7f05b8401b716.md
index 54faa13bd9b..4ad5c2d33a3 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3ebb4f7f05b8401b716.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3ebb4f7f05b8401b716.md
@@ -1,6 +1,6 @@
 ---
 id: 6153a3ebb4f7f05b8401b716
-title: Step 21
+title: Schritt 21
 challengeType: 0
 dashedName: step-21
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143862a5e54455d262c212e.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143862a5e54455d262c212e.md
index e911ec286f1..f1de0b1e128 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143862a5e54455d262c212e.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143862a5e54455d262c212e.md
@@ -1,6 +1,6 @@
 ---
 id: 6143862a5e54455d262c212e
-title: Step 3
+title: Schritt 3
 challengeType: 0
 dashedName: step-3
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dc084fa5f659cf75d7c.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dc084fa5f659cf75d7c.md
index 4f19487816b..e3645e5c075 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dc084fa5f659cf75d7c.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dc084fa5f659cf75d7c.md
@@ -1,6 +1,6 @@
 ---
 id: 61439dc084fa5f659cf75d7c
-title: Step 12
+title: Schritt 12
 challengeType: 0
 dashedName: step-12
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dfc811e12666b04be6f.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dfc811e12666b04be6f.md
index f4ee0bb5ab3..747142790fa 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dfc811e12666b04be6f.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dfc811e12666b04be6f.md
@@ -1,6 +1,6 @@
 ---
 id: 61439dfc811e12666b04be6f
-title: Step 13
+title: Schritt 13
 challengeType: 0
 dashedName: step-13
 ---
@@ -100,7 +100,7 @@ assert(document.querySelectorAll('.text p')?.[2]?.innerText === "It wasn't as dr
           After years - years - of pondering these two problems and how to solve them, I slipped, hit my head on the sink, and when I came to I had a revelation! A vision! A picture in my head! A picture of this! This is what makes time travel possible: the flux capacitor!
         </p>
 --fcc-editable-region--
-        
+
 --fcc-editable-region--
       </section>
     </main>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439e33e4fb7967609e0c83.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439e33e4fb7967609e0c83.md
index 7f654bcc95c..0d21a020767 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439e33e4fb7967609e0c83.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439e33e4fb7967609e0c83.md
@@ -1,6 +1,6 @@
 ---
 id: 61439e33e4fb7967609e0c83
-title: Step 14
+title: Schritt 14
 challengeType: 0
 dashedName: step-14
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a1a228f7d068ab16a130.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a1a228f7d068ab16a130.md
index db32dfa57dc..d386fc088a3 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a1a228f7d068ab16a130.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a1a228f7d068ab16a130.md
@@ -1,6 +1,6 @@
 ---
 id: 6143a1a228f7d068ab16a130
-title: Step 15
+title: Schritt 15
 challengeType: 0
 dashedName: step-15
 ---
@@ -117,7 +117,7 @@ assert(document.querySelectorAll('.text p')?.[4]?.innerText === 'No more walls o
           <hr />
         </blockquote>
 --fcc-editable-region--
-        
+
 --fcc-editable-region--
       </section>
     </main>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a73279ce6369de4b9bcc.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a73279ce6369de4b9bcc.md
index 7500f1b4667..905b5ec4fbc 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a73279ce6369de4b9bcc.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a73279ce6369de4b9bcc.md
@@ -1,6 +1,6 @@
 ---
 id: 6143a73279ce6369de4b9bcc
-title: Step 16
+title: Schritt 16
 challengeType: 0
 dashedName: step-16
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a778bffc206ac6b1dbe3.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a778bffc206ac6b1dbe3.md
index 250303e45c1..e10f573aff8 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a778bffc206ac6b1dbe3.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a778bffc206ac6b1dbe3.md
@@ -1,6 +1,6 @@
 ---
 id: 6143a778bffc206ac6b1dbe3
-title: Step 17
+title: Schritt 17
 challengeType: 0
 dashedName: step-17
 ---
@@ -26,7 +26,7 @@ You should add a sixth `p` element to the `.text` element.
 assert(document.querySelectorAll('.text p')?.length === 7)
 ```
 
-Your sixth `p` element should have the provided text.
+Dein sechstes `p` sollte den bereitgestellten Text enthalten.
 
 ```js
 assert(document.querySelectorAll('.text p')?.[6]?.innerText === 'Instead of a series of coding challenges, people will be in their code editor passing one test after another, quickly building up a project. People will get into a real flow state, similar to what they experience when they build the required projects at the end of each certification. They\'ll get that sense of forward progress right from the beginning. And freeCodeCamp will be a much smoother experience.')
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a83fcc32c26bcfae3efa.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a83fcc32c26bcfae3efa.md
index b1af2f717d8..fe518f26ffc 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a83fcc32c26bcfae3efa.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a83fcc32c26bcfae3efa.md
@@ -1,6 +1,6 @@
 ---
 id: 6143a83fcc32c26bcfae3efa
-title: Step 18
+title: Schritt 18
 challengeType: 0
 dashedName: step-18
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b97c06c3306d23d5da47.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b97c06c3306d23d5da47.md
index f8148bc77f8..e1fc085d3e7 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b97c06c3306d23d5da47.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b97c06c3306d23d5da47.md
@@ -1,13 +1,13 @@
 ---
 id: 6143b97c06c3306d23d5da47
-title: Step 19
+title: Schritt 19
 challengeType: 0
 dashedName: step-19
 ---
 
 # --description--
 
-Within your `article` element, create an `h3` element with the `class` set to `list-title` and the text of `A Brief History`. Below that, create a `p` element with the text `Of the Curriculum`. Then create a `ul` element with the class `lists`.
+Within your `article` element, create an `h3` element with the `class` set to `list-title` and the text of `A Brief History`. Below that, create a `p` element with the text `Of the Curriculum`. Erstelle dann ein `ul` mit der Klasse `lists`.
 
 # --hints--
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b9e1f5035c6e5f2a8231.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b9e1f5035c6e5f2a8231.md
index b6b2d1bd906..8962d7c9108 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b9e1f5035c6e5f2a8231.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b9e1f5035c6e5f2a8231.md
@@ -1,6 +1,6 @@
 ---
 id: 6143b9e1f5035c6e5f2a8231
-title: Step 20
+title: Schritt 20
 challengeType: 0
 dashedName: step-20
 ---
@@ -33,19 +33,19 @@ const lis = [...document.querySelectorAll('.lists li')];
 assert(lis?.every(li => li?.children?.[0]?.localName === 'h4' && li?.children?.[1]?.localName === 'p'));
 ```
 
-Your first `h4` should have the text `V1 - 2014`.
+Dein erstes `h4` sollte den Text `V1 - 2014` haben.
 
 ```js
 assert(document.querySelectorAll('.lists li h4')?.[0]?.innerText === 'V1 - 2014');
 ```
 
-Your first `p` should have the text `We launched freeCodeCamp with a simple list of 15 resources, including Harvard's CS50 and Stanford's Database Class.`
+Dein erstes `p` sollte den Text `We launched freeCodeCamp with a simple list of 15 resources, including Harvard's CS50 and Stanford's Database Class.` haben
 
 ```js
 assert(document.querySelectorAll('.lists li p')?.[0]?.innerText === 'We launched freeCodeCamp with a simple list of 15 resources, including Harvard\'s CS50 and Stanford\'s Database Class.');
 ```
 
-Your second `h4` should have the text `V2 - 2015`.
+Dein zweites `h4` sollte den Text `V2 - 2015` haben.
 
 ```js
 assert(document.querySelectorAll('.lists li h4')?.[1]?.innerText === 'V2 - 2015');
@@ -57,7 +57,7 @@ Your second `p` should have the text `We added interactive algorithm challenges.
 assert(document.querySelectorAll('.lists li p')?.[1]?.innerText === 'We added interactive algorithm challenges.');
 ```
 
-Your third `h4` should have the text `V3 - 2015`.
+Dein drittes `h4` sollte den Text `V3 - 2015` haben.
 
 ```js
 assert(document.querySelectorAll('.lists li h4')?.[2]?.innerText === 'V3 - 2015');
@@ -69,19 +69,19 @@ Your third `p` should have the text `We added our own HTML+CSS challenges (befor
 assert(document.querySelectorAll('.lists li p')?.[2]?.innerText === 'We added our own HTML+CSS challenges (before we\'d been relying on General Assembly\'s Dash course for these).');
 ```
 
-Your fourth `h4` should have the text `V4 - 2016`.
+Dein viertes `h4` sollte den Text `V4 - 2016` haben.
 
 ```js
 assert(document.querySelectorAll('.lists li h4')?.[3]?.innerText === 'V4 - 2016');
 ```
 
-Your fourth `p` should have the text `We expanded the curriculum to 3 certifications, including Front End, Back End, and Data Visualization. They each had 10 required projects, but only the Front End section had its own challenges. For the other certs, we were still using external resources like Node School`.
+Dein viertes `p` sollte den Text `We expanded the curriculum to 3 certifications, including Front End, Back End, and Data Visualization. They each had 10 required projects, but only the Front End section had its own challenges. For the other certs, we were still using external resources like Node School` haben.
 
 ```js
 assert(document.querySelectorAll('.lists li p')?.[3]?.innerText === 'We expanded the curriculum to 3 certifications, including Front End, Back End, and Data Visualization. They each had 10 required projects, but only the Front End section had its own challenges. For the other certs, we were still using external resources like Node School.');
 ```
 
-Your fifth `h4` should have the text `V5 - 2017`.
+Dein fünftes `h4` sollte den Text `V5 - 2017` haben.
 
 ```js
 assert(document.querySelectorAll('.lists li h4')?.[4]?.innerText === 'V5 - 2017');
@@ -93,7 +93,7 @@ Your fifth `p` should have the text `We added the back end and data visualizatio
 assert(document.querySelectorAll('.lists li p')?.[4]?.innerText === 'We added the back end and data visualization challenges.');
 ```
 
-Your sixth `h4` should have the text `V6 - 2018`.
+Dein sechstes `h4` sollte den Text `V6 - 2018` haben.
 
 ```js
 assert(document.querySelectorAll('.lists li h4')?.[5]?.innerText === 'V6 - 2018');
@@ -212,7 +212,7 @@ assert(h4s?.every(h4 => h4?.classList?.contains('list-subtitle')));
           <h3 class="list-title">A Brief History</h3>
           <p>Of the Curriculum</p>
           <ul class="lists">
-          
+
           </ul>
         </article>
 --fcc-editable-region--
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143bb50e8e48c6f5ef9d8d5.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143bb50e8e48c6f5ef9d8d5.md
index 06fb3da6c3c..e16c907b427 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143bb50e8e48c6f5ef9d8d5.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143bb50e8e48c6f5ef9d8d5.md
@@ -1,6 +1,6 @@
 ---
 id: 6143bb50e8e48c6f5ef9d8d5
-title: Step 21
+title: Schritt 21
 challengeType: 0
 dashedName: step-21
 ---
@@ -29,7 +29,7 @@ Your `blockquote` element should have a `class` set to `image-quote`.
 assert(document.querySelector('aside blockquote')?.classList?.contains('image-quote'));
 ```
 
-Your new elements should be in the correct order.
+Deine neuen Elemente sollten in der richtigen Reihenfolge sein.
 
 ```js
 const children = document.querySelector('aside')?.children;
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143c2a363865c715f1a3f72.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143c2a363865c715f1a3f72.md
index 2a6bd8dc4cb..5408802f9ef 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143c2a363865c715f1a3f72.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143c2a363865c715f1a3f72.md
@@ -1,6 +1,6 @@
 ---
 id: 6143c2a363865c715f1a3f72
-title: Step 22
+title: Schritt 22
 challengeType: 0
 dashedName: step-22
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143cd08fe927072ca3a371d.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143cd08fe927072ca3a371d.md
index 66fe0f88a1d..a6ed22bda56 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143cd08fe927072ca3a371d.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143cd08fe927072ca3a371d.md
@@ -1,6 +1,6 @@
 ---
 id: 6143cd08fe927072ca3a371d
-title: Step 23
+title: Schritt 23
 challengeType: 0
 dashedName: step-23
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144de308591ec10e27d5383.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144de308591ec10e27d5383.md
index 8a5a35a79d4..6df3b9639fb 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144de308591ec10e27d5383.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144de308591ec10e27d5383.md
@@ -1,6 +1,6 @@
 ---
 id: 6144de308591ec10e27d5383
-title: Step 29
+title: Schritt 29
 challengeType: 0
 dashedName: step-29
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144ee790af79815ad15a832.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144ee790af79815ad15a832.md
index defe5fc1693..921cba177e7 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144ee790af79815ad15a832.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144ee790af79815ad15a832.md
@@ -1,6 +1,6 @@
 ---
 id: 6144ee790af79815ad15a832
-title: Step 32
+title: Schritt 32
 challengeType: 0
 dashedName: step-32
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f1410990ea17187a722b.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f1410990ea17187a722b.md
index fc25931639b..b75ed05c8b4 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f1410990ea17187a722b.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f1410990ea17187a722b.md
@@ -7,7 +7,7 @@ dashedName: step-33
 
 # --description--
 
-Now you can style the layout of your grid. CSS Grid is similar to Flexbox in that it has a special property for both the parent and child elements. 
+Now you can style the layout of your grid. CSS Grid is similar to Flexbox in that it has a special property for both the parent and child elements.
 
 In this case, your parent element is the `main` element. Set the content to have a three-column layout by adding a `grid-template-columns` property with a value of `1fr 94rem 1fr`. This will create three columns where the middle column is `94rem` wide, and the first and last columns are both 1 fraction of the remaining space in the grid container.
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b59ef318e03875f35c4a.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b59ef318e03875f35c4a.md
index 4e02bcea6b6..a99c76f6ff2 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b59ef318e03875f35c4a.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b59ef318e03875f35c4a.md
@@ -1,6 +1,6 @@
 ---
 id: 6148b59ef318e03875f35c4a
-title: Step 44
+title: Schritt 44
 challengeType: 0
 dashedName: step-44
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bd62bbb8c83a5f1fc1b3.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bd62bbb8c83a5f1fc1b3.md
index 79cfd07a73b..d39dac573f0 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bd62bbb8c83a5f1fc1b3.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bd62bbb8c83a5f1fc1b3.md
@@ -1,6 +1,6 @@
 ---
 id: 6148bd62bbb8c83a5f1fc1b3
-title: Step 45
+title: Schritt 45
 challengeType: 0
 dashedName: step-45
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d1f9eb63c252e1f8acc4.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d1f9eb63c252e1f8acc4.md
index 8b519c2d9ef..2f620034c52 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d1f9eb63c252e1f8acc4.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d1f9eb63c252e1f8acc4.md
@@ -1,6 +1,6 @@
 ---
 id: 6148d1f9eb63c252e1f8acc4
-title: Step 61
+title: Schritt 61
 challengeType: 0
 dashedName: step-61
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f34ebedc2274bceeb99c.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f34ebedc2274bceeb99c.md
index 89008705e4a..b2206124031 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f34ebedc2274bceeb99c.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f34ebedc2274bceeb99c.md
@@ -1,6 +1,6 @@
 ---
 id: 6148f34ebedc2274bceeb99c
-title: Step 77
+title: Schritt 77
 challengeType: 0
 dashedName: step-77
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f6f7d8914c78e93136ca.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f6f7d8914c78e93136ca.md
index bf702462281..0b4ba8b45f0 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f6f7d8914c78e93136ca.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f6f7d8914c78e93136ca.md
@@ -383,14 +383,14 @@ hr {
   .hero-title {
     font-size: 6rem;
   }
-  
+
   .hero-subtitle,
   .author,
   .quote,
   .list-title {
     font-size: 1.8rem;
   }
-  
+
   .social-icons {
     font-size: 2rem;
   }
@@ -755,14 +755,14 @@ hr {
   .hero-title {
     font-size: 6rem;
   }
-  
+
   .hero-subtitle,
   .author,
   .quote,
   .list-title {
     font-size: 1.8rem;
   }
-  
+
   .social-icons {
     font-size: 2rem;
   }
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614e0e588f0e8a772a8a81a6.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614e0e588f0e8a772a8a81a6.md
index f9fd23824b8..2f754da286e 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614e0e588f0e8a772a8a81a6.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614e0e588f0e8a772a8a81a6.md
@@ -1,6 +1,6 @@
 ---
 id: 614e0e588f0e8a772a8a81a6
-title: Step 6
+title: Schritt 6
 challengeType: 0
 dashedName: step-6
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6165d3b702a5d92ad970b30c.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6165d3b702a5d92ad970b30c.md
index 8b701b945d0..64e0d5f734a 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6165d3b702a5d92ad970b30c.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6165d3b702a5d92ad970b30c.md
@@ -1,6 +1,6 @@
 ---
 id: 6165d3b702a5d92ad970b30c
-title: Step 5
+title: Schritt 5
 challengeType: 0
 dashedName: step-5
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61967e74a8e3690ab6292daa.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61967e74a8e3690ab6292daa.md
index 9812e1b4bdd..1fa374dea06 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61967e74a8e3690ab6292daa.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61967e74a8e3690ab6292daa.md
@@ -36,7 +36,7 @@ assert.include(['linear-gradient(45deg,rgb(118,201,255),rgb(247,255,222))', 'rgb
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968df2acd5550bf1616c34.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968df2acd5550bf1616c34.md
index e401d42eef2..446189e0104 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968df2acd5550bf1616c34.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968df2acd5550bf1616c34.md
@@ -1,6 +1,6 @@
 ---
 id: 61968df2acd5550bf1616c34
-title: Step 3
+title: Schritt 3
 challengeType: 0
 dashedName: step-3
 ---
@@ -30,7 +30,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.padding, '0px');
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
@@ -47,7 +47,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.padding, '0px');
 --fcc-editable-region--
 body {
   background: linear-gradient(45deg, rgb(118, 201, 255), rgb(247, 255, 222));
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968e9243a4090cc805531c.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968e9243a4090cc805531c.md
index 2c1d8594d5d..5ac68dfd4ba 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968e9243a4090cc805531c.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968e9243a4090cc805531c.md
@@ -24,7 +24,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.overflow, 'clip')
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968f8877c6720d6d61aaf5.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968f8877c6720d6d61aaf5.md
index 051f3411d1b..267ea48e9cd 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968f8877c6720d6d61aaf5.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968f8877c6720d6d61aaf5.md
@@ -1,6 +1,6 @@
 ---
 id: 61968f8877c6720d6d61aaf5
-title: Step 6
+title: Schritt 6
 challengeType: 0
 dashedName: step-6
 ---
@@ -36,7 +36,7 @@ assert.exists(document.querySelector('body > div.ground'));
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619691693bc14b0e528f5a20.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619691693bc14b0e528f5a20.md
index e5896cabe05..873f6020624 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619691693bc14b0e528f5a20.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619691693bc14b0e528f5a20.md
@@ -36,7 +36,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.ground')?.height, '400px
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619692ff79f5770fc6d8c0b4.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619692ff79f5770fc6d8c0b4.md
index 672d4bd665b..14f99c19a6d 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619692ff79f5770fc6d8c0b4.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619692ff79f5770fc6d8c0b4.md
@@ -36,7 +36,7 @@ assert.strictEqual(document.querySelector('.ground')?.previousElementSibling, do
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196990f966e8f10a40094f6.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196990f966e8f10a40094f6.md
index 8fd7eb06e2f..ac11e2803a2 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196990f966e8f10a40094f6.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196990f966e8f10a40094f6.md
@@ -1,6 +1,6 @@
 ---
 id: 6196990f966e8f10a40094f6
-title: Step 11
+title: Schritt 11
 challengeType: 0
 dashedName: step-11
 ---
@@ -36,7 +36,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.penguin')?.height, '300p
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619699c10a0f6e11591d73c4.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619699c10a0f6e11591d73c4.md
index 81ba962fab2..f47439d1c81 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619699c10a0f6e11591d73c4.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619699c10a0f6e11591d73c4.md
@@ -31,7 +31,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.penguin')?.marginTop, '7
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969aa6acef5b12200f672e.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969aa6acef5b12200f672e.md
index 49499e43bbc..6a528f7d2cf 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969aa6acef5b12200f672e.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969aa6acef5b12200f672e.md
@@ -38,7 +38,7 @@ assert.strictEqual(document.querySelector('.penguin')?.previousElementSibling, d
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969c487ced6f12db8fef94.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969c487ced6f12db8fef94.md
index d1dedc2cc7b..db410babb3d 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969c487ced6f12db8fef94.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969c487ced6f12db8fef94.md
@@ -1,6 +1,6 @@
 ---
 id: 61969c487ced6f12db8fef94
-title: Step 14
+title: Schritt 14
 challengeType: 0
 dashedName: step-14
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969d66cfcdba137d021558.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969d66cfcdba137d021558.md
index 0ec1d402f55..5c8f538ec38 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969d66cfcdba137d021558.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969d66cfcdba137d021558.md
@@ -24,7 +24,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.left-mountain')?.positio
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969e7451455614217e901b.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969e7451455614217e901b.md
index 87fa0124137..a5aa8477341 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969e7451455614217e901b.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969e7451455614217e901b.md
@@ -38,7 +38,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.left-mountain')?.getProp
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196adc17f77a714d51485f2.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196adc17f77a714d51485f2.md
index 95ffdc3f9af..2ba7cd9ff65 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196adc17f77a714d51485f2.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196adc17f77a714d51485f2.md
@@ -36,7 +36,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.ground')?.zIndex, '3');
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196aead7ac7bf1584b17a7f.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196aead7ac7bf1584b17a7f.md
index 8a12e627d5c..f7ca21ebccf 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196aead7ac7bf1584b17a7f.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196aead7ac7bf1584b17a7f.md
@@ -30,7 +30,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.ground')?.marginTop, '-5
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
@@ -80,7 +80,7 @@ body {
   background: linear-gradient(90deg, rgb(88, 175, 236), rgb(182, 255, 255));
   z-index: 3;
   position: absolute;
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d0cda039d026f7f78d1e.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d0cda039d026f7f78d1e.md
index 4d1e271a017..3563af9d128 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d0cda039d026f7f78d1e.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d0cda039d026f7f78d1e.md
@@ -1,6 +1,6 @@
 ---
 id: 6196d0cda039d026f7f78d1e
-title: Step 22
+title: Schritt 22
 challengeType: 0
 dashedName: step-22
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d213d99f16287bff22ae.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d213d99f16287bff22ae.md
index 1189f3ef131..18d9445f180 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d213d99f16287bff22ae.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d213d99f16287bff22ae.md
@@ -1,6 +1,6 @@
 ---
 id: 6196d213d99f16287bff22ae
-title: Step 24
+title: Schritt 24
 challengeType: 0
 dashedName: step-24
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d2c0f22ca0293107c048.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d2c0f22ca0293107c048.md
index eb97f4d10b0..eefd70ee8a5 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d2c0f22ca0293107c048.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d2c0f22ca0293107c048.md
@@ -1,6 +1,6 @@
 ---
 id: 6196d2c0f22ca0293107c048
-title: Step 25
+title: Schritt 25
 challengeType: 0
 dashedName: step-25
 ---
@@ -91,7 +91,7 @@ body {
 }
 
 --fcc-editable-region--
-    
+
 --fcc-editable-region--
 
 .penguin {
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197f667297bb30a552ce017.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197f667297bb30a552ce017.md
index 1bf1ae8a6f0..e0a9a680300 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197f667297bb30a552ce017.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197f667297bb30a552ce017.md
@@ -30,7 +30,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.ground')?.position, 'abs
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993cf26a8e0f0a553db223.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993cf26a8e0f0a553db223.md
index 0e09016059a..c04190f45b0 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993cf26a8e0f0a553db223.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993cf26a8e0f0a553db223.md
@@ -1,6 +1,6 @@
 ---
 id: 61993cf26a8e0f0a553db223
-title: Step 31
+title: Schritt 31
 challengeType: 0
 dashedName: step-31
 ---
@@ -107,7 +107,7 @@ body {
     gray,
     rgb(239, 240, 228)
   );
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199409834ccaf0d10736596.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199409834ccaf0d10736596.md
index 8c2d7f69749..b9e0d6c8bb5 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199409834ccaf0d10736596.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199409834ccaf0d10736596.md
@@ -1,6 +1,6 @@
 ---
 id: 6199409834ccaf0d10736596
-title: Step 34
+title: Schritt 34
 challengeType: 0
 dashedName: step-34
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619943285a41720e6370d985.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619943285a41720e6370d985.md
index 2885245f1e4..ca7fae63df8 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619943285a41720e6370d985.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619943285a41720e6370d985.md
@@ -141,7 +141,7 @@ body {
     white 67%
   );
   border-radius: 80% 80% 100% 100%;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be946958c6009844f1dee.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be946958c6009844f1dee.md
index 3650ed68e42..7ab20f3c68f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be946958c6009844f1dee.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be946958c6009844f1dee.md
@@ -1,6 +1,6 @@
 ---
 id: 619be946958c6009844f1dee
-title: Step 44
+title: Schritt 44
 challengeType: 0
 dashedName: step-44
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0d18ca99870f884a7bff.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0d18ca99870f884a7bff.md
index c4246b6bc5a..0ca3cc1b25a 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0d18ca99870f884a7bff.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0d18ca99870f884a7bff.md
@@ -1,6 +1,6 @@
 ---
 id: 619d0d18ca99870f884a7bff
-title: Step 60
+title: Schritt 60
 challengeType: 0
 dashedName: step-60
 ---
@@ -63,7 +63,7 @@ assert.exists(document.querySelector('.eye.right > div.eye-lid'));
 
         </div>
         <div class="eye right">
-          
+
         </div>
       </div>
 --fcc-editable-region--
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1340361095175f4b5115.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1340361095175f4b5115.md
index 2cce37d722e..760ea077bc0 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1340361095175f4b5115.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1340361095175f4b5115.md
@@ -1,6 +1,6 @@
 ---
 id: 619d1340361095175f4b5115
-title: Step 71
+title: Schritt 71
 challengeType: 0
 dashedName: step-71
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d204bd73ae51e743b8e94.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d204bd73ae51e743b8e94.md
index 12dfd6b819c..6f6558e7cc8 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d204bd73ae51e743b8e94.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d204bd73ae51e743b8e94.md
@@ -273,7 +273,7 @@ body {
   width:  15%;
   height: 30%;
   background-color: orange;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d20b12996101f430920fb.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d20b12996101f430920fb.md
index e17e69cbf1e..595f2bd2f86 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d20b12996101f430920fb.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d20b12996101f430920fb.md
@@ -90,7 +90,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.foot')?.getPropVal('back
 --fcc-editable-region--
 :root {
   --penguin-face: white;
-  
+
 }
 
 body {
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d23089e787e216a7043d6.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d23089e787e216a7043d6.md
index eafce1fd17a..a4b8f56c177 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d23089e787e216a7043d6.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d23089e787e216a7043d6.md
@@ -1,6 +1,6 @@
 ---
 id: 619d23089e787e216a7043d6
-title: Step 85
+title: Schritt 85
 challengeType: 0
 dashedName: step-85
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2bd9c1d43c2526e96f1f.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2bd9c1d43c2526e96f1f.md
index 0c173bdabbc..fb7bd6ced67 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2bd9c1d43c2526e96f1f.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2bd9c1d43c2526e96f1f.md
@@ -286,7 +286,7 @@ body {
 .arm.left {
   top: 35%;
   left: 5%;
-  
+
 }
 
 .arm.right {
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2d4e80400325ff89664a.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2d4e80400325ff89664a.md
index a8312184351..cbef5de4cc6 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2d4e80400325ff89664a.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2d4e80400325ff89664a.md
@@ -1,6 +1,6 @@
 ---
 id: 619d2d4e80400325ff89664a
-title: Step 91
+title: Schritt 91
 challengeType: 0
 dashedName: step-91
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2f0e9440bc27caee1cec.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2f0e9440bc27caee1cec.md
index cb7d052a130..d69d492d5fc 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2f0e9440bc27caee1cec.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2f0e9440bc27caee1cec.md
@@ -1,6 +1,6 @@
 ---
 id: 619d2f0e9440bc27caee1cec
-title: Step 93
+title: Schritt 93
 challengeType: 0
 dashedName: step-93
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2fd3ff4f772882e3d998.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2fd3ff4f772882e3d998.md
index f2a41bcf9f1..e03ca142650 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2fd3ff4f772882e3d998.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2fd3ff4f772882e3d998.md
@@ -1,6 +1,6 @@
 ---
 id: 619d2fd3ff4f772882e3d998
-title: Step 94
+title: Schritt 94
 challengeType: 0
 dashedName: step-94
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d30350883802921bfcccc.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d30350883802921bfcccc.md
index 26646923045..e830b24464d 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d30350883802921bfcccc.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d30350883802921bfcccc.md
@@ -1,6 +1,6 @@
 ---
 id: 619d30350883802921bfcccc
-title: Step 95
+title: Schritt 95
 challengeType: 0
 dashedName: step-95
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61a8fe15a6a31306e60d1e89.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61a8fe15a6a31306e60d1e89.md
index 7d4ef4402ba..b59c8829d94 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61a8fe15a6a31306e60d1e89.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61a8fe15a6a31306e60d1e89.md
@@ -1,6 +1,6 @@
 ---
 id: 61a8fe15a6a31306e60d1e89
-title: Step 4
+title: Schritt 4
 challengeType: 0
 dashedName: step-4
 ---
@@ -30,7 +30,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.height, '100vh');
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ca.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ca.md
index 2d4a8b2c94d..53cbe8ff42d 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ca.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ca.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98ca
-title: Step 2
+title: Schritt 2
 challengeType: 0
 dashedName: step-2
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98cb.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98cb.md
index 4fe3f645461..1ec0487dd16 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98cb.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98cb.md
@@ -61,7 +61,7 @@ assert([...document.querySelector('html').children].some(x => x.localName === 'b
 <!DOCTYPE html>
 --fcc-editable-region--
 <html lang="en">
-  
+
 </html>
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98cc.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98cc.md
index 68878b23b15..eab541ac3f4 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98cc.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98cc.md
@@ -99,7 +99,7 @@ assert.equal(link.dataset.href, "styles.css");
 <html lang="en">
 --fcc-editable-region--
   <head>
-    
+
   </head>
 --fcc-editable-region--
   <body>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98cf.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98cf.md
index 45b83843303..2aa67c45a0e 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98cf.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98cf.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98cf
-title: Step 7
+title: Schritt 7
 challengeType: 0
 dashedName: step-7
 ---
@@ -64,6 +64,6 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.overflow, 'hidden
 
 
 --fcc-editable-region--
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d1.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d1.md
index 9e589da64da..67f39215c1e 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d1.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d1.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98d1
-title: Step 9
+title: Schritt 9
 challengeType: 0
 dashedName: step-9
 ---
@@ -63,6 +63,6 @@ body {
 
 
 --fcc-editable-region--
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d2.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d2.md
index 39aae73d0cc..a5eb230c7a6 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d2.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d2.md
@@ -78,6 +78,6 @@ body {
   width: 100%;
   height: 100%;
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d3.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d3.md
index bf5c4b30f1f..f75b1b65faf 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d3.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d3.md
@@ -100,6 +100,6 @@ body {
   width: 10%;
   height: 70%;
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d5.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d5.md
index c97b6c1c185..7f0b43b6b49 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d5.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d5.md
@@ -107,6 +107,6 @@ body {
   width: 100%;
   height: 70%;
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d6.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d6.md
index 666ecaffb1d..f89875caf18 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d6.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d6.md
@@ -99,5 +99,5 @@ body {
   width: 100%;
   height: 70%;
 }
-    
+
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d7.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d7.md
index b993c80f852..1160534f287 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d7.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98d7.md
@@ -1,13 +1,13 @@
 ---
 id: 5d822fd413a79914d39e98d7
-title: Step 15
+title: Schritt 15
 challengeType: 0
 dashedName: step-15
 ---
 
 # --description--
 
-To use a variable, put the variable name in parentheses with `var` in front of them like this: `var(--variable-name)`. Whatever value you gave the variable will be applied to whatever property you use it on. 
+To use a variable, put the variable name in parentheses with `var` in front of them like this: `var(--variable-name)`. Whatever value you gave the variable will be applied to whatever property you use it on.
 
 Add the variable `--building-color1` you created in the previous step as the value of the `background-color` property of the `.bb1a` class.
 
@@ -96,5 +96,5 @@ body {
   width: 100%;
   height: 70%;
 }
-    
+
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98da.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98da.md
index 2bdce33b6e4..bebfc1ba677 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98da.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98da.md
@@ -128,6 +128,6 @@ body {
   height: 70%;
   background-color: var(--building-color1);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98dc.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98dc.md
index 77305c578ea..f183cac4415 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98dc.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98dc.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98dc
-title: Step 20
+title: Schritt 20
 challengeType: 0
 dashedName: step-20
 ---
@@ -122,6 +122,6 @@ body {
   width: 11%;
   height: 58%;
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98dd.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98dd.md
index ffbc76b0b1c..70947702891 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98dd.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98dd.md
@@ -137,6 +137,6 @@ body {
   width: 11%;
   height: 58%;
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98de.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98de.md
index 63a0d7177a1..18d57898d59 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98de.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98de.md
@@ -136,5 +136,5 @@ body {
   width: 11%;
   height: 58%;
 }
-    
+
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98df.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98df.md
index 18991ab296c..a4d3de38613 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98df.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98df.md
@@ -120,5 +120,5 @@ body {
   width: 11%;
   height: 58%;
 }
-    
+
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e1.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e1.md
index 1ffeb2c17bb..59dfc773ca9 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e1.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e1.md
@@ -150,6 +150,6 @@ body {
   width: 11%;
   height: 58%;
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e2.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e2.md
index f8a42aa5898..5894d0b8fbe 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e2.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e2.md
@@ -131,5 +131,5 @@ body {
   width: 11%;
   height: 58%;
 }
-    
+
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e3.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e3.md
index 4c1a12a629e..2377196614d 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e3.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e3.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98e3
-title: Step 27
+title: Schritt 27
 challengeType: 0
 dashedName: step-27
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e6.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e6.md
index d434e2aeb01..520e58be14f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e6.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e6.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98e6
-title: Step 30
+title: Schritt 30
 challengeType: 0
 dashedName: step-30
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e7.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e7.md
index d0b1000a10b..f7a6f9a6d14 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e7.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e7.md
@@ -248,6 +248,6 @@ body {
 --fcc-editable-region--
 
 --fcc-editable-region--
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e9.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e9.md
index 19c5650bdf4..f53ca2d0fea 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e9.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98e9.md
@@ -218,6 +218,6 @@ body {
   width: 9%;
   height: 38%;
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ea.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ea.md
index a7ba8c36511..d239fcf498c 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ea.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ea.md
@@ -176,6 +176,6 @@ body {
   width: 9%;
   height: 38%;
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98eb.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98eb.md
index 8d06cc61809..2abd45cff80 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98eb.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98eb.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98eb
-title: Step 35
+title: Schritt 35
 challengeType: 0
 dashedName: step-35
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ec.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ec.md
index 8143d18ec3c..d5b43a7b803 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ec.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ec.md
@@ -198,6 +198,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ed.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ed.md
index 68bb2249960..49dbfe11706 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ed.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ed.md
@@ -197,6 +197,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ee.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ee.md
index bd0e16a4841..4c7d866b313 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ee.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ee.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98ee
-title: Step 38
+title: Schritt 38
 challengeType: 0
 dashedName: step-38
 ---
@@ -191,6 +191,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ef.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ef.md
index 0512796cfb2..07de4b5f0ad 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ef.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ef.md
@@ -192,6 +192,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f0.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f0.md
index e07315019ab..742e08e887b 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f0.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f0.md
@@ -213,6 +213,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f1.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f1.md
index e658de33d12..f3ea5bd8e8a 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f1.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f1.md
@@ -218,6 +218,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f2.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f2.md
index 5f21d781a13..c0c21981a71 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f2.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f2.md
@@ -232,6 +232,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f3.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f3.md
index 5b832df0f87..36dac6ed6f3 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f3.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f3.md
@@ -217,6 +217,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f4.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f4.md
index 6059b2d60a3..1d666325de7 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f4.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f4.md
@@ -222,6 +222,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f5.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f5.md
index 6e64130d7cb..35cd0ef09d7 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f5.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f5.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98f5
-title: Step 45
+title: Schritt 45
 challengeType: 0
 dashedName: step-45
 ---
@@ -193,6 +193,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f6.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f6.md
index ac074fd614c..4eb4a6918af 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f6.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f6.md
@@ -202,6 +202,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f7.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f7.md
index 9e7d9a17d54..419a0d12260 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f7.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f7.md
@@ -198,6 +198,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f8.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f8.md
index 606401d03e2..420c2eab550 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f8.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f8.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98f8
-title: Step 48
+title: Schritt 48
 challengeType: 0
 dashedName: step-48
 ---
@@ -205,6 +205,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f9.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f9.md
index 82bda67e3e4..0f7bc880642 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f9.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98f9.md
@@ -202,6 +202,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fa.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fa.md
index ab1fca84681..60aa166ebaf 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fa.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fa.md
@@ -206,6 +206,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fb.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fb.md
index 89c7828a13d..b70bae5c655 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fb.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fb.md
@@ -146,11 +146,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -213,7 +213,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -235,6 +235,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fc.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fc.md
index e61306e210a..14e970c5a43 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fc.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fc.md
@@ -111,11 +111,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -184,7 +184,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -206,6 +206,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fd.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fd.md
index 5f5aeb1a36c..84efb0f6293 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fd.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fd.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e98fd
-title: Step 53
+title: Schritt 53
 challengeType: 0
 dashedName: step-53
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fe.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fe.md
index fa43165a670..a2d93384071 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fe.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98fe.md
@@ -159,11 +159,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -233,7 +233,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -255,6 +255,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ff.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ff.md
index c7755836830..865daed1337 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ff.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e98ff.md
@@ -129,11 +129,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -211,7 +211,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -233,6 +233,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9900.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9900.md
index f110fe4f8be..edfd777d245 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9900.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9900.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9900
-title: Step 56
+title: Schritt 56
 challengeType: 0
 dashedName: step-56
 ---
@@ -117,11 +117,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -197,7 +197,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -219,6 +219,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9901.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9901.md
index 93559351e86..3af5445bf3b 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9901.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9901.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9901
-title: Step 57
+title: Schritt 57
 challengeType: 0
 dashedName: step-57
 ---
@@ -117,11 +117,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -197,7 +197,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -219,6 +219,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9902.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9902.md
index 01485d6fc62..e9b4b67c76e 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9902.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9902.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9902
-title: Step 58
+title: Schritt 58
 challengeType: 0
 dashedName: step-58
 ---
@@ -123,11 +123,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -201,7 +201,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -223,5 +223,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9903.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9903.md
index a84664027d0..dea1067641e 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9903.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9903.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9903
-title: Step 59
+title: Schritt 59
 challengeType: 0
 dashedName: step-59
 ---
@@ -118,11 +118,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -196,7 +196,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -218,6 +218,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9904.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9904.md
index 826e82e8004..0cc9ecb5b72 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9904.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9904.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9904
-title: Step 60
+title: Schritt 60
 challengeType: 0
 dashedName: step-60
 ---
@@ -140,11 +140,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -218,7 +218,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -240,6 +240,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9905.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9905.md
index be8f279c220..2e6d3c05e5b 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9905.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9905.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9905
-title: Step 61
+title: Schritt 61
 challengeType: 0
 dashedName: step-61
 ---
@@ -112,11 +112,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -196,7 +196,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -218,6 +218,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9906.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9906.md
index 28fd7889ce6..30a89bb0cec 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9906.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9906.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9906
-title: Step 62
+title: Schritt 62
 challengeType: 0
 dashedName: step-62
 ---
@@ -139,11 +139,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -222,7 +222,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -244,6 +244,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9907.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9907.md
index b97da80b656..ab306d762a1 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9907.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9907.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9907
-title: Step 63
+title: Schritt 63
 challengeType: 0
 dashedName: step-63
 ---
@@ -146,11 +146,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -231,7 +231,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -253,6 +253,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9908.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9908.md
index 74f1fa92aaa..7c3190c3662 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9908.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9908.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9908
-title: Step 64
+title: Schritt 64
 challengeType: 0
 dashedName: step-64
 ---
@@ -134,11 +134,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -208,7 +208,7 @@ body {
   width: 80%;
   height: 5%;
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -232,7 +232,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -254,5 +254,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9909.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9909.md
index c1f05cb180c..8ca7ce0c75c 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9909.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9909.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9909
-title: Step 65
+title: Schritt 65
 challengeType: 0
 dashedName: step-65
 ---
@@ -118,11 +118,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -193,7 +193,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -218,7 +218,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -240,6 +240,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990a.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990a.md
index 91c5eaceb1f..4a0b95c948e 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990a.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990a.md
@@ -150,11 +150,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -225,7 +225,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -250,7 +250,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -272,6 +272,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990b.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990b.md
index 6c551ec4605..a0c564519f5 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990b.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990b.md
@@ -127,11 +127,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -202,7 +202,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -227,7 +227,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -249,6 +249,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990c.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990c.md
index 207b0898467..1b8bdafb36d 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990c.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990c.md
@@ -126,11 +126,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -201,7 +201,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -226,7 +226,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -248,6 +248,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990d.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990d.md
index c792b7c315e..6a27d5d0cd6 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990d.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990d.md
@@ -128,11 +128,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -203,7 +203,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -228,7 +228,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -250,6 +250,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990e.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990e.md
index 03e6774811d..6dc46c48fae 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990e.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990e.md
@@ -137,11 +137,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -212,7 +212,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -239,7 +239,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -261,5 +261,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990f.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990f.md
index b0e6c9ac647..a06ce5a3a9f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990f.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990f.md
@@ -153,11 +153,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -228,7 +228,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -259,7 +259,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -281,6 +281,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9910.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9910.md
index 5e0b774f8ab..2e5b99d2689 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9910.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9910.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9910
-title: Step 72
+title: Schritt 72
 challengeType: 0
 dashedName: step-72
 ---
@@ -133,11 +133,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -208,7 +208,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -239,7 +239,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -261,6 +261,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9911.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9911.md
index 2331da101b7..2892b75bceb 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9911.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9911.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9911
-title: Step 73
+title: Schritt 73
 challengeType: 0
 dashedName: step-73
 ---
@@ -158,11 +158,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -233,7 +233,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -264,7 +264,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -286,6 +286,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9912.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9912.md
index 05d085a1be7..076f0e78291 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9912.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9912.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9912
-title: Step 74
+title: Schritt 74
 challengeType: 0
 dashedName: step-74
 ---
@@ -153,11 +153,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -228,7 +228,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -261,7 +261,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -283,5 +283,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9913.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9913.md
index d451d028ebe..73c5cfd8b31 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9913.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9913.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9913
-title: Step 75
+title: Schritt 75
 challengeType: 0
 dashedName: step-75
 ---
@@ -137,11 +137,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -212,7 +212,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -236,7 +236,7 @@ body {
   width: 60%;
   height: 10%;
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -253,7 +253,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -275,6 +275,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9914.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9914.md
index 5cb763bcec7..e80cba88fbe 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9914.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9914.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9914
-title: Step 76
+title: Schritt 76
 challengeType: 0
 dashedName: step-76
 ---
@@ -141,11 +141,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -216,7 +216,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -258,7 +258,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -280,5 +280,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9915.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9915.md
index e476f5d90bc..7cddafd3bed 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9915.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9915.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9915
-title: Step 106
+title: Schritt 106
 challengeType: 0
 dashedName: step-106
 ---
@@ -161,11 +161,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -236,7 +236,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -266,7 +266,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -313,13 +313,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -386,6 +386,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9916.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9916.md
index 8685190853e..2aba286791d 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9916.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9916.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9916
-title: Step 77
+title: Schritt 77
 challengeType: 0
 dashedName: step-77
 ---
@@ -155,11 +155,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -230,7 +230,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -271,7 +271,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -293,5 +293,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9917.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9917.md
index 226aa2791df..fa58e613b76 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9917.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9917.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9917
-title: Step 78
+title: Schritt 78
 challengeType: 0
 dashedName: step-78
 ---
@@ -158,11 +158,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -233,7 +233,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -281,7 +281,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -303,5 +303,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9918.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9918.md
index 891c49a2e13..b89733e8643 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9918.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9918.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9918
-title: Step 79
+title: Schritt 79
 challengeType: 0
 dashedName: step-79
 ---
@@ -141,11 +141,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -216,7 +216,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -242,7 +242,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -272,7 +272,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -294,5 +294,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9919.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9919.md
index 70f365e2891..193557f49b9 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9919.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9919.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9919
-title: Step 80
+title: Schritt 80
 challengeType: 0
 dashedName: step-80
 ---
@@ -141,11 +141,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -216,7 +216,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -244,7 +244,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -274,7 +274,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -296,6 +296,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991a.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991a.md
index 99f5abea099..38a750c2e10 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991a.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991a.md
@@ -150,11 +150,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -225,7 +225,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -255,7 +255,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -285,7 +285,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -307,6 +307,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991b.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991b.md
index f1cc76cabd4..77b222c82d0 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991b.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991b.md
@@ -150,11 +150,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -225,7 +225,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -255,7 +255,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -287,7 +287,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -309,6 +309,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991c.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991c.md
index e047f9f3021..1d752c37238 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991c.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991c.md
@@ -146,11 +146,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -221,7 +221,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -251,7 +251,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -290,7 +290,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -312,6 +312,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991d.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991d.md
index 75eac697004..1c00fbd3581 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991d.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991d.md
@@ -144,11 +144,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -219,7 +219,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -249,7 +249,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -288,7 +288,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -310,6 +310,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991e.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991e.md
index 68bea5beb87..514895c56e9 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991e.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991e.md
@@ -154,11 +154,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -229,7 +229,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -259,7 +259,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -300,7 +300,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -322,5 +322,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991f.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991f.md
index e4198afe229..1f6852e16ec 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991f.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991f.md
@@ -148,11 +148,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -223,7 +223,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -253,7 +253,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -298,7 +298,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -320,5 +320,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9920.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9920.md
index 3ccdb0dbcc5..389c96ab5e2 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9920.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9920.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9920
-title: Step 87
+title: Schritt 87
 challengeType: 0
 dashedName: step-87
 ---
@@ -154,11 +154,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -229,7 +229,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -259,7 +259,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -304,7 +304,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -326,5 +326,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9921.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9921.md
index 3cff4a2acda..a754d57f729 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9921.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9921.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9921
-title: Step 88
+title: Schritt 88
 challengeType: 0
 dashedName: step-88
 ---
@@ -168,11 +168,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -243,7 +243,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -273,7 +273,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -321,7 +321,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -343,6 +343,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9922.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9922.md
index 0fa90cef88b..1d8b8e26ac9 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9922.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9922.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9922
-title: Step 89
+title: Schritt 89
 challengeType: 0
 dashedName: step-89
 ---
@@ -165,11 +165,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -240,7 +240,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -270,7 +270,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -342,6 +342,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9923.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9923.md
index c6942ea1b38..bc876c2ddb1 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9923.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9923.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9923
-title: Step 90
+title: Schritt 90
 challengeType: 0
 dashedName: step-90
 ---
@@ -159,11 +159,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -234,7 +234,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -264,7 +264,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -317,7 +317,7 @@ body {
   width: 80%;
   height: 15%;
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -344,5 +344,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9924.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9924.md
index a7f0e2cb952..789b82bf397 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9924.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9924.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9924
-title: Step 91
+title: Schritt 91
 challengeType: 0
 dashedName: step-91
 ---
@@ -149,11 +149,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -224,7 +224,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -254,7 +254,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -301,13 +301,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -335,6 +335,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9925.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9925.md
index 19ff10935fc..a1cd637b36a 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9925.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9925.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9925
-title: Step 92
+title: Schritt 92
 challengeType: 0
 dashedName: step-92
 ---
@@ -155,11 +155,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -230,7 +230,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -260,7 +260,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -307,13 +307,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -341,6 +341,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9926.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9926.md
index 7c0132cbbd5..db44aeb4ae2 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9926.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9926.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9926
-title: Step 93
+title: Schritt 93
 challengeType: 0
 dashedName: step-93
 ---
@@ -163,11 +163,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -238,7 +238,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -268,7 +268,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -315,13 +315,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -351,5 +351,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9927.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9927.md
index ed213fde285..e6d0407488c 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9927.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9927.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9927
-title: Step 94
+title: Schritt 94
 challengeType: 0
 dashedName: step-94
 ---
@@ -153,11 +153,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -228,7 +228,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -258,7 +258,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -305,13 +305,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -345,6 +345,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9928.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9928.md
index 456c70cfb9f..d0fe5407967 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9928.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9928.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9928
-title: Step 95
+title: Schritt 95
 challengeType: 0
 dashedName: step-95
 ---
@@ -152,11 +152,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -227,7 +227,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -257,7 +257,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -304,13 +304,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -344,6 +344,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9929.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9929.md
index ad6a18db3d8..e4605a77cfb 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9929.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9929.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9929
-title: Step 96
+title: Schritt 96
 challengeType: 0
 dashedName: step-96
 ---
@@ -165,11 +165,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -240,7 +240,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -270,7 +270,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -317,13 +317,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -357,6 +357,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992a.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992a.md
index 7c1fd3dfc0a..dfebdeaabc0 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992a.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992a.md
@@ -160,11 +160,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -235,7 +235,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -265,7 +265,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -312,13 +312,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -354,6 +354,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992b.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992b.md
index 6ec1e954b18..5d7ebb531e1 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992b.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992b.md
@@ -160,11 +160,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -235,7 +235,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -265,7 +265,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -312,13 +312,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -357,5 +357,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992c.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992c.md
index 1548769e3c8..47bd92f34d7 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992c.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992c.md
@@ -162,11 +162,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -237,7 +237,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -267,7 +267,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -314,13 +314,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -359,6 +359,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992d.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992d.md
index 6ddb73f13b4..92949a72523 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992d.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992d.md
@@ -173,11 +173,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -248,7 +248,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -278,7 +278,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -325,13 +325,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -372,6 +372,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992e.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992e.md
index 3fd53b9a1ec..ab57df7fc09 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992e.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992e.md
@@ -167,11 +167,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -242,7 +242,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -272,7 +272,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -319,13 +319,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -370,5 +370,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992f.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992f.md
index d3624b3cfda..40d99100aeb 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992f.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992f.md
@@ -167,11 +167,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -242,7 +242,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -272,7 +272,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -319,13 +319,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -372,6 +372,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9930.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9930.md
index 997ee5ecec0..831ff2bcec4 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9930.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9930.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9930
-title: Step 103
+title: Schritt 103
 challengeType: 0
 dashedName: step-103
 ---
@@ -167,11 +167,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -242,7 +242,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -272,7 +272,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -319,13 +319,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -376,6 +376,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9931.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9931.md
index 742b4250c6c..fb74f17fbe4 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9931.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9931.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9931
-title: Step 109
+title: Schritt 109
 challengeType: 0
 dashedName: step-109
 ---
@@ -161,11 +161,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9932.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9932.md
index 80bdfe3d777..a3b73646bfd 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9932.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9932.md
@@ -179,11 +179,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -254,7 +254,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -284,7 +284,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -331,13 +331,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -391,6 +391,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9933.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9933.md
index f3731819799..60f7fe5ad21 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9933.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9933.md
@@ -179,11 +179,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -254,7 +254,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -284,7 +284,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -331,13 +331,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -397,6 +397,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9934.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9934.md
index 3f172a0388a..648a4117a8b 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9934.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9934.md
@@ -179,11 +179,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -254,7 +254,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -284,7 +284,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -331,13 +331,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9935.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9935.md
index ef5b15a88a7..fbaa78bc615 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9935.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9935.md
@@ -173,11 +173,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -248,7 +248,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -278,7 +278,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -325,13 +325,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9936.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9936.md
index 9d8a3c2d880..4e7ea615300 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9936.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9936.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9936
-title: Step 110
+title: Schritt 110
 challengeType: 0
 dashedName: step-110
 ---
@@ -161,11 +161,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -236,7 +236,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -266,7 +266,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -313,13 +313,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -397,6 +397,6 @@ body {
       var(--window-color3) 30%
     );
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9937.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9937.md
index 0c9bd249eb4..528b3b272c5 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9937.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9937.md
@@ -162,11 +162,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -237,7 +237,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -267,7 +267,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -314,13 +314,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -398,6 +398,6 @@ body {
       var(--window-color3) 30%
     );
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9938.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9938.md
index 0c60ad6415d..75b0a075d9e 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9938.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9938.md
@@ -180,11 +180,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -255,7 +255,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -285,7 +285,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -332,13 +332,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -416,6 +416,6 @@ body {
       var(--window-color3) 30%
     );
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9939.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9939.md
index cb07a8fde0b..82ecd30f91a 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9939.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9939.md
@@ -169,11 +169,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -244,7 +244,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -274,7 +274,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -321,13 +321,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -405,6 +405,6 @@ body {
       var(--window-color3) 30%
     );
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993a.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993a.md
index 12d39cb4c09..fa492b653cb 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993a.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993a.md
@@ -178,11 +178,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -253,7 +253,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -283,7 +283,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -330,13 +330,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993b.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993b.md
index f43412ed800..4cddf77a3d4 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993b.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993b.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e993b
-title: Step 115
+title: Schritt 115
 challengeType: 0
 dashedName: step-115
 ---
@@ -178,11 +178,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -253,7 +253,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -283,7 +283,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -330,13 +330,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -416,7 +416,7 @@ body {
 }
 --fcc-editable-region--
 @media (max-width: 1000px) {
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993c.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993c.md
index 6d77b62b471..cf58f3f6cc0 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993c.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993c.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e993c
-title: Step 116
+title: Schritt 116
 challengeType: 0
 dashedName: step-116
 ---
@@ -432,6 +432,6 @@ var(--window-color3) 30%
   }
 --fcc-editable-region--
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993d.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993d.md
index 1a90ae8e5b9..5211883b97f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993d.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993d.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e993d
-title: Step 117
+title: Schritt 117
 challengeType: 0
 dashedName: step-117
 ---
@@ -194,11 +194,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -269,7 +269,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -299,7 +299,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -346,13 +346,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -445,6 +445,6 @@ body {
       );
   }
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993e.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993e.md
index 592c85e070d..945e7aeb439 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993e.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993e.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e993e
-title: Step 118
+title: Schritt 118
 challengeType: 0
 dashedName: step-118
 ---
@@ -190,11 +190,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -265,7 +265,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -295,7 +295,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -342,13 +342,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -446,7 +446,7 @@ body {
       );
   }
 }
-    
+
 ```
 
 # --solutions--
@@ -600,11 +600,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -675,7 +675,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -705,7 +705,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -752,13 +752,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc17dc8f86c76b9248c6eb5.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc17dc8f86c76b9248c6eb5.md
index 9b01a7afcb3..5565edc4591 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc17dc8f86c76b9248c6eb5.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc17dc8f86c76b9248c6eb5.md
@@ -1,6 +1,6 @@
 ---
 id: 5dc17dc8f86c76b9248c6eb5
-title: Step 4
+title: Schritt 4
 challengeType: 0
 dashedName: step-4
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
index 473976cc277..ea882bb7ebf 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
@@ -18,9 +18,7 @@ Use list item (`li`) elements to create items in a list. Here is an example of l
 
 Within the `ul` element nest three list items to display three things cats love:
 
-`cat nip`
-`laser pointers`
-`lasagna` 
+`cat nip` `laser pointers` `lasagna`
 
 # --hints--
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
index 0bdb922b43f..305071d1ffa 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
@@ -11,9 +11,7 @@ The code for an ordered list (`ol`) is similar to an unordered list, but list it
 
 After the second `section` element's last `h3` element, add an ordered list with these three list items:
 
-`flea treatment`
-`thunder`
-`other cats`
+`flea treatment` `thunder` `other cats`
 
 # --hints--
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
index 014c07c467b..8888abd9156 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
@@ -7,7 +7,7 @@ dashedName: step-34
 
 # --description--
 
-Inside the third `section` element, add an `h2` element with the text: 
+Inside the third `section` element, add an `h2` element with the text:
 
 `Cat Form`
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
index d8b1ddfe44d..8807e7121c8 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
@@ -67,14 +67,14 @@ Although you have set the new `input` element's `type` attribute to `radio`, it
 assert(!/\<\s*input\s+type\s*=\s*radio/i.test(code));
 ```
 
-The `radio` button's ` Indoor` text should be located after it instead of before it.
+The `radio` button's `Indoor` text should be located after it instead of before it.
 
 ```js
 const radioInputElem = $('input')[0];
 assert(!radioInputElem.previousSibling.nodeValue.match(/Indoor/i));
 ```
 
-The text ` Indoor` should be located directly to the right of your `radio` button. You have either omitted the text or have a typo.
+The text `Indoor` should be located directly to the right of your `radio` button. You have either omitted the text or have a typo.
 
 ```js
 const radioInputElem = $('input')[0];
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
index 956de475dea..831dc72c1b7 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
@@ -19,7 +19,7 @@ You should make sure the radio button is still present.
 assert($('input[type="radio"]')[0]);
 ```
 
-The text ` Indoor` should be located directly to the right of your `radio` button. Make sure there is a space between the element and the text. You have either omitted the text or have a typo.
+The text `Indoor` should be located directly to the right of your `radio` button. Make sure there is a space between the element and the text. You have either omitted the text or have a typo.
 
 ```js
 const radioInputElem = $('input')[0];
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
index f45361b9fb5..fe9e5500c4d 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
@@ -59,7 +59,7 @@ Although you have set the new `input` element's `type` attribute to `checkbox`,
 assert(!/\<\s*input\s+type\s*=\s*checkbox/i.test(code));
 ```
 
-The text ` Loving` should be located directly to the right of your checkbox. Make sure there is a space between the element and the text. You have either omitted the text or have a typo.
+The text `Loving` should be located directly to the right of your checkbox. Make sure there is a space between the element and the text. You have either omitted the text or have a typo.
 
 ```js
 const checkboxInputElem = $('input[type="checkbox"]')[0];
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
index 86d5b59b428..c71ffa0dc27 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
@@ -9,7 +9,7 @@ dashedName: step-66
 
 The `title` element determines what browsers show in the title bar or tab for the page.
 
-Add a `title` element within the `head` element using the text below: 
+Add a `title` element within the `head` element using the text below:
 
 `CatPhotoApp`
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
index 3bf1e39f6dc..4465ef2aacb 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
@@ -7,7 +7,7 @@ dashedName: step-67
 
 # --description--
 
-Notice that the entire contents of the page are nested within an `html` element. All other elements must be descendants of this `html` element.
+Notice that the entire contents of the page are nested within an `html` element. Alle anderen Elemente müssen Nachfahren (descendants) dieses `html` Elements sein.
 
 Add the `lang` attribute with the value `en` to the opening `html` tag to specify that the language of the page is English.
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
index 6d32193c974..03bfd1c3c85 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
@@ -25,7 +25,7 @@ Your checkbox should still have an `id` attribute with the value `loving`.  Expe
 assert.equal($('input[type="checkbox"]')[0].id, 'loving');
 ```
 
-The text ` Loving` should no longer be located directly to the right of your checkbox. It should be wrapped in a `label` element. Make sure there is a space between the two elements.
+The text `Loving` should no longer be located directly to the right of your checkbox. It should be wrapped in a `label` element. Make sure there is a space between the two elements.
 
 ```js
 const checkboxInputElem = $('input[type="checkbox"]')[0];
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
index 13a52987810..c1bfa7ed41b 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
@@ -41,7 +41,7 @@ You should not add any attributes to either opening `label` tag.
 assert(code.match(/<label\s*>/g).length === 2);
 ```
 
-Your new `input` should have an `id` attribute with the value `outdoor`. 
+Your new `input` should have an `id` attribute with the value `outdoor`.
 
 ```js
 assert(document.querySelector('label input[id="outdoor"]'));
@@ -69,7 +69,7 @@ assert(
 );
 ```
 
-The label text for your new radio button must be exactly `Outdoor`. This includes capitalization. 
+The label text for your new radio button must be exactly `Outdoor`. This includes capitalization.
 
 ```js
 assert(document.querySelector('label > input[id="outdoor"]')?.nextSibling?.nodeValue?.replace(/^\s+|\s+$/g, '') === 'Outdoor');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f0286404aefb0562a4fdf9.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f0286404aefb0562a4fdf9.md
index fb4a52f4b94..8269009ad39 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f0286404aefb0562a4fdf9.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f0286404aefb0562a4fdf9.md
@@ -47,7 +47,7 @@ assert.equal(title.text, 'Registration Form');
 <html lang="en">
   --fcc-editable-region--
   <head>
-    
+
   </head>
 --fcc-editable-region--
   <body>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f5cb8875ab6a0610f05071.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f5cb8875ab6a0610f05071.md
index 5bc0bb94a19..eeb27deab5f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f5cb8875ab6a0610f05071.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f5cb8875ab6a0610f05071.md
@@ -46,7 +46,7 @@ assert.exists(document.querySelector('fieldset + fieldset + fieldset'));
     <h1>Registration Form</h1>
     <p>Please fill out this form with the required information</p>
     <form action='https://register-demo.freecodecamp.org'>
-    
+
     </form>
   </body>
 --fcc-editable-region--
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f80e0081e0f2052ae5b505.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f80e0081e0f2052ae5b505.md
index 711948bab14..d201a428ab2 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f80e0081e0f2052ae5b505.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f80e0081e0f2052ae5b505.md
@@ -11,8 +11,7 @@ Specifying the `type` attribute of a form element is important for the browser t
 
 Give the first two `input` elements a `type` attribute of `text`, the third a `type` attribute of `email`, and the fourth a `type` attribute of `password`.
 
-The `email` type only allows emails with a `@` and a `.` in the domain.
-The `password` type obscures the input, and warns if the site does not use HTTPS.
+The `email` type only allows emails with a `@` and a `.` in the domain. The `password` type obscures the input, and warns if the site does not use HTTPS.
 
 # --hints--
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60fab9f17fa294054b74228c.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60fab9f17fa294054b74228c.md
index 430214f2d23..f3522eceba2 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60fab9f17fa294054b74228c.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60fab9f17fa294054b74228c.md
@@ -9,11 +9,11 @@ dashedName: step-30
 
 Moving on to the final `fieldset`. What if you wanted to allow a user to upload a profile picture?
 
-Well, the `input` type `file` allows just that. Add a `label` with the text `Upload a profile picture: `, and add an `input` accepting a file upload.
+Well, the `input` type `file` allows just that. Add a `label` with the text `Upload a profile picture:`, and add an `input` accepting a file upload.
 
 # --hints--
 
-You should add a `label` with the text `Upload a profile picture: `.
+You should add a `label` with the text `Upload a profile picture:`.
 
 ```js
 assert.match(document.querySelector('fieldset:nth-child(3) > label')?.innerText, /Upload a profile picture:/i);
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60fabf0dd4959805dbae09e6.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60fabf0dd4959805dbae09e6.md
index 3c16ab478f1..801adffa226 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60fabf0dd4959805dbae09e6.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60fabf0dd4959805dbae09e6.md
@@ -7,7 +7,7 @@ dashedName: step-31
 
 # --description--
 
-Add another `label` after the first, with the text `Input your age (years): `. Then, nest an `input` with the `type` of `number`.
+Add another `label` after the first, with the text `Input your age (years):`. Then, nest an `input` with the `type` of `number`.
 
 Next, add a `min` attribute to the `input` with a value of `13` because users under the age of 13 should not register. Also, users probably will not be over the age of 120; add a `max` attribute with a value of `120`.
 
@@ -21,7 +21,7 @@ You should add a `label` to the third `fieldset`, after the existing `label`.
 assert.exists(document.querySelector('fieldset:nth-child(3) > label + label'));
 ```
 
-You should give the `label` the text `Input your age (years): `.
+You should give the `label` the text `Input your age (years):`.
 
 ```js
 assert.equal(document.querySelector('fieldset:nth-child(3) > label:nth-child(2)')?.textContent?.trim(), 'Input your age (years):');
@@ -77,7 +77,7 @@ assert.equal(document.querySelector('fieldset:nth-child(3) > label:nth-child(2)
 --fcc-editable-region--
       <fieldset>
         <label>Upload a profile picture: <input type="file" /></label>
-        
+
       </fieldset>
 --fcc-editable-region--
       <input type="submit" value="Submit" />
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60faca286cb48b07f6482970.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60faca286cb48b07f6482970.md
index ec2586f6612..2e52af7c3f1 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60faca286cb48b07f6482970.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60faca286cb48b07f6482970.md
@@ -1,6 +1,6 @@
 ---
 id: 60faca286cb48b07f6482970
-title: Step 35
+title: Schritt 35
 challengeType: 0
 dashedName: step-35
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62b30924c5e4ef0daba23b5e.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62b30924c5e4ef0daba23b5e.md
index 058b8e4c6ef..2fd223e3ccf 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62b30924c5e4ef0daba23b5e.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62b30924c5e4ef0daba23b5e.md
@@ -7,7 +7,7 @@ dashedName: step-46
 
 # --description--
 
-The border of the last `fieldset` element looks a little out of place. You can select the last element of a specific type using the `last-of-type` CSS pseudo-class, like this: 
+The border of the last `fieldset` element looks a little out of place. You can select the last element of a specific type using the `last-of-type` CSS pseudo-class, like this:
 
 ```css
 p:last-of-type { }
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51579.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51579.md
index f242bb58261..a68f492a99b 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51579.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51579.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51579
-title: Step 2
+title: Schritt 2
 challengeType: 0
 dashedName: step-2
 ---
@@ -56,7 +56,7 @@ assert(document.querySelector('title')?.innerText === 'Picasso Painting');
   <body>
   </body>
 </html>
-```  
+```
 
 ```css
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157a.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157a.md
index 49fb512d9eb..783059fe6ea 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157a.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157a.md
@@ -25,8 +25,7 @@ Your `link` element should have a `rel` of `stylesheet`.
 assert(document.querySelectorAll('link')?.[1]?.getAttribute('rel') === 'stylesheet');
 ```
 
-Your `link` element should have an `href` of 
-`https://use.fontawesome.com/releases/v5.8.2/css/all.css`.
+Your `link` element should have an `href` of `https://use.fontawesome.com/releases/v5.8.2/css/all.css`.
 
 ```js
 assert(document.querySelectorAll('link')?.[1]?.getAttribute('href') === 'https://use.fontawesome.com/releases/v5.8.2/css/all.css')
@@ -50,7 +49,7 @@ assert(document.querySelectorAll('link')?.[1]?.getAttribute('href') === 'https:/
   <body>
   </body>
 </html>
-```  
+```
 
 ```css
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157b.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157b.md
index fb72bf110b0..991faf7c73c 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157b.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157b.md
@@ -39,7 +39,7 @@ assert(new __helpers.CSSHelp(document).getStyle('body')?.backgroundColor === 'rg
   <body>
   </body>
 </html>
-```  
+```
 
 ```css
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157e.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157e.md
index 9902742c288..bdc0d0abc56 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157e.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157e.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5157e
-title: Step 8
+title: Schritt 8
 challengeType: 0
 dashedName: step-8
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51580.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51580.md
index fc2f26bd044..9dab612dc87 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51580.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51580.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51580
-title: Step 10
+title: Schritt 10
 challengeType: 0
 dashedName: step-10
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51581.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51581.md
index e3c0a6d7133..4f01f86a03f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51581.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51581.md
@@ -45,7 +45,7 @@ assert(document.querySelectorAll('div')?.[1]?.classList?.contains('characters'))
   <body>
     <div id="back-wall"></div>
     --fcc-editable-region--
-      
+
     --fcc-editable-region--
   </body>
 </html>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51582.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51582.md
index cecb3afcc3f..05df784360b 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51582.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51582.md
@@ -46,7 +46,7 @@ assert(document.querySelector('.characters div')?.getAttribute('id') === 'offwhi
     <div id="back-wall"></div>
     <div class="characters">
       --fcc-editable-region--
-      
+
       --fcc-editable-region--
     </div>
   </body>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51583.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51583.md
index 26e10dbd954..3049a1dd86c 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51583.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51583.md
@@ -59,7 +59,7 @@ assert(document.querySelectorAll('#offwhite-character div')[3]?.getAttribute('id
     <div class="characters">
       <div id="offwhite-character">
         --fcc-editable-region--
-        
+
         --fcc-editable-region--
       </div>
     </div>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51584.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51584.md
index 30d7ae1f208..aa02496ffd7 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51584.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51584.md
@@ -51,7 +51,7 @@ assert(document.querySelectorAll('#black-mask div')[1]?.classList.contains('righ
         <div id="white-hat"></div>
         <div id="black-mask">
           --fcc-editable-region--
-          
+
           --fcc-editable-region--
         </div>
         <div id="gray-instrument"></div>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51585.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51585.md
index fe7c93d2a82..6d5987f185e 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51585.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51585.md
@@ -47,7 +47,7 @@ assert(document.querySelectorAll('#gray-instrument .black-dot').length === 5);
         </div>
         <div id="gray-instrument">
           --fcc-editable-region--
-          
+
           --fcc-editable-region--
         </div>
         <div id="tan-table"></div>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51592.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51592.md
index 445f4954806..681e6cabccc 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51592.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51592.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51592
-title: Step 28
+title: Schritt 28
 challengeType: 0
 dashedName: step-28
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51595.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51595.md
index 7b766aa3f42..0a9872ad999 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51595.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51595.md
@@ -142,5 +142,5 @@ body {
   --fcc-editable-region--
 
   --fcc-editable-region--
-  
+
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51598.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51598.md
index cc6008020de..6862ba81e32 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51598.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51598.md
@@ -55,7 +55,7 @@ assert(document.querySelectorAll('.characters > div')?.[1]?.getAttribute('id') =
         <div id="tan-table"></div>
       </div>
       --fcc-editable-region--
-      
+
       --fcc-editable-region--
     </div>
   </body>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51599.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51599.md
index 64752da89e2..ae9aa461f70 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51599.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51599.md
@@ -68,7 +68,7 @@ assert(document.querySelectorAll('#black-character > div')?.[2]?.getAttribute('i
       </div>
       <div id="black-character">
         --fcc-editable-region--
-        
+
         --fcc-editable-region--
       </div>
     </div>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159a.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159a.md
index 80566becc9f..a1a2c90f8c5 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159a.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159a.md
@@ -68,7 +68,7 @@ assert(second?.classList?.contains('right'));
         <div id="black-hat"></div>
         <div id="gray-mask">
           --fcc-editable-region--
-          
+
           --fcc-editable-region--
         </div>
         <div id="white-paper"></div>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159b.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159b.md
index c76ae468664..9362e27ed47 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159b.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159b.md
@@ -72,7 +72,7 @@ for (const icon of icons) {
         </div>
         <div id="white-paper">
           --fcc-editable-region--
-          
+
           --fcc-editable-region--
         </div>
       </div>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a7.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a7.md
index 9de059269f0..786b7e396b0 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a7.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a7.md
@@ -82,7 +82,7 @@ assert(document.querySelectorAll('.characters > div')?.[3]?.getAttribute('id') =
         </div>
       </div>
       --fcc-editable-region--
-      
+
       --fcc-editable-region--
     </div>
   </body>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515aa.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515aa.md
index ea6dc4a08b8..a0cbbbcf863 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515aa.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515aa.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515aa
-title: Step 53
+title: Schritt 53
 challengeType: 0
 dashedName: step-53
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ad.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ad.md
index ac80b322cde..3f503b12ffb 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ad.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ad.md
@@ -70,7 +70,7 @@ assert(document.querySelectorAll('.characters > div')?.[4]?.getAttribute('id') =
       <div class="blue" id="blue-left"></div>
       <div class="blue" id="blue-right"></div>
       --fcc-editable-region--
-      
+
       --fcc-editable-region--
     </div>
   </body>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ae.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ae.md
index bfd1d018cca..6c4d69b4187 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ae.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ae.md
@@ -89,7 +89,7 @@ assert(document.querySelectorAll('#orange-character > div')?.[3]?.getAttribute('
       <div class="blue" id="blue-right"></div>
       <div id="orange-character">
         --fcc-editable-region--
-        
+
         --fcc-editable-region--
       </div>
     </div>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515af.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515af.md
index 48c6238c1c2..2bd83d9d892 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515af.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515af.md
@@ -81,7 +81,7 @@ assert(document.querySelectorAll('#eyes-div > div')?.[1]?.classList?.contains('r
         <div id="black-round-hat"></div>
         <div id="eyes-div">
           --fcc-editable-region--
-          
+
           --fcc-editable-region--
         </div>
         <div id="triangles"></div>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b0.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b0.md
index 366d18b2481..63bd2bd45c5 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b0.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b0.md
@@ -80,7 +80,7 @@ for (const div of divDivDiv) {
         </div>
         <div id="triangles">
           --fcc-editable-region--
-          
+
           --fcc-editable-region--
         </div>
         <div id="guitar"></div>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b1.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b1.md
index 38130fa44a2..86a381cf472 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b1.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b1.md
@@ -141,7 +141,7 @@ assert.notExists(document.querySelector('#guitar > #guitar-neck.guitar'));
         </div>
         <div id="guitar">
           --fcc-editable-region--
-          
+
           --fcc-editable-region--
         </div>
       </div>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b2.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b2.md
index 38be428b773..b59da81bd3e 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b2.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b2.md
@@ -119,10 +119,10 @@ assert(document.querySelector('#guitar-right > i')?.classList?.contains('fa-bars
         <div id="guitar">
           --fcc-editable-region--
           <div class="guitar" id="guitar-left">
-          
+
           </div>
           <div class="guitar" id="guitar-right">
-          
+
           </div>
           --fcc-editable-region--
           <div id="guitar-neck"></div>
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b4.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b4.md
index 754861f47d0..64881c57ee8 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b4.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b4.md
@@ -279,7 +279,7 @@ body {
   height: 550px;
   background-color: rgb(240, 78, 42);
   --fcc-editable-region--
-  
+
   --fcc-editable-region--
 }
 ```
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bc.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bc.md
index c9d3d036cd7..ca812dd2c8c 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bc.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bc.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515bc
-title: Step 70
+title: Schritt 70
 challengeType: 0
 dashedName: step-70
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bf.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bf.md
index 92fde860227..64ccee5d96e 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bf.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bf.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515bf
-title: Step 81
+title: Schritt 81
 challengeType: 0
 dashedName: step-81
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c1.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c1.md
index 9aeb95ac779..2f90cd238c1 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c1.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c1.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515c1
-title: Step 83
+title: Schritt 83
 challengeType: 0
 dashedName: step-83
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c6.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c6.md
index 58e504b96e2..6302f1143f1 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c6.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c6.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515c6
-title: Step 88
+title: Schritt 88
 challengeType: 0
 dashedName: step-88
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba9296d4d6b414c1b10995.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba9296d4d6b414c1b10995.md
index a7e3a17efde..4e37093c045 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba9296d4d6b414c1b10995.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba9296d4d6b414c1b10995.md
@@ -1,6 +1,6 @@
 ---
 id: 60ba9296d4d6b414c1b10995
-title: Step 77
+title: Schritt 77
 challengeType: 0
 dashedName: step-77
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd5a93fd62bb35968adeab.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd5a93fd62bb35968adeab.md
index 38776c35314..08c4af399fc 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd5a93fd62bb35968adeab.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd5a93fd62bb35968adeab.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd5a93fd62bb35968adeab
-title: Step 1
+title: Schritt 1
 challengeType: 0
 dashedName: step-1
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd6343fb42013d99bcd7f3.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd6343fb42013d99bcd7f3.md
index 6b933db49dd..ae59503cca6 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd6343fb42013d99bcd7f3.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd6343fb42013d99bcd7f3.md
@@ -11,7 +11,7 @@ Within your `body` element, nest a `section` element within a `main` element.
 
 # --hints--
 
-The first element inside the `body` element should be your `main` element. 
+The first element inside the `body` element should be your `main` element.
 
 ```js
 assert(document.querySelector('body')?.children?.[0]?.localName === 'main');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd71d596e8f253b9408b39.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd71d596e8f253b9408b39.md
index 083e60b9e97..e04d4d35430 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd71d596e8f253b9408b39.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd71d596e8f253b9408b39.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd71d596e8f253b9408b39
-title: Step 10
+title: Schritt 10
 challengeType: 0
 dashedName: step-10
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd7648a7ba2e5882436831.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd7648a7ba2e5882436831.md
index e45bc92ba64..03e1e2d2b0b 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd7648a7ba2e5882436831.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd7648a7ba2e5882436831.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd7648a7ba2e5882436831
-title: Step 12
+title: Schritt 12
 challengeType: 0
 dashedName: step-12
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd778081276b59d59abad6.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd778081276b59d59abad6.md
index c2f94c4d531..413771781f2 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd778081276b59d59abad6.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd778081276b59d59abad6.md
@@ -7,7 +7,7 @@ dashedName: step-13
 
 # --description--
 
-In your first `tr`, add a `th` element with the text `Cash This is the cash we currently have on hand.`. Wrap all of that text except `Cash ` in a `span` element with the `class` set to `description`.
+In your first `tr`, add a `th` element with the text `Cash This is the cash we currently have on hand.`. Wrap all of that text except `Cash` in a `span` element with the `class` set to `description`.
 
 Following that, add three `td` elements with the following text (in order): `$25`, `$30`, `$28`. Give the third `td` element a `class` attribute set to `current`.
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd77f7ad2aeb5ae34d07d6.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd77f7ad2aeb5ae34d07d6.md
index 6c5d1804d52..65782d0b1e3 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd77f7ad2aeb5ae34d07d6.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd77f7ad2aeb5ae34d07d6.md
@@ -7,7 +7,7 @@ dashedName: step-14
 
 # --description--
 
-In your second `tr` element, add a `th` element with the text `Checking Our primary transactional account.`. Wrap that text, except for `Checking `, in a `span` element with the `class` attribute set to `description`.
+In your second `tr` element, add a `th` element with the text `Checking Our primary transactional account.`. Wrap that text, except for `Checking`, in a `span` element with the `class` attribute set to `description`.
 
 Following that, add three `td` elements with the following text (in order): `$54`, `$56`, `$53`. Give the third `td` element a `class` attribute set to `current`.
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd78621573aa5e8b512f5e.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd78621573aa5e8b512f5e.md
index f36d0c0c001..b7cc33facc9 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd78621573aa5e8b512f5e.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd78621573aa5e8b512f5e.md
@@ -1,13 +1,13 @@
 ---
 id: 61fd78621573aa5e8b512f5e
-title: Step 15
+title: Schritt 15
 challengeType: 0
 dashedName: step-15
 ---
 
 # --description--
 
-In your third `tr` element, add a `th` element with the text `Savings Funds set aside for emergencies.`. Wrap that text, except for `Savings `, in a `span` element with the `class` attribute set to `description`.
+In your third `tr` element, add a `th` element with the text `Savings Funds set aside for emergencies.`. Wrap that text, except for `Savings`, in a `span` element with the `class` attribute set to `description`.
 
 Following that, add three `td` elements with the following text (in order): `$500`, `$650`, `$728`. Give the third `td` element a `class` attribute set to `current`.
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd7b3fcaa5406257abc5d1.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd7b3fcaa5406257abc5d1.md
index 184f5dee82a..27024e48e3f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd7b3fcaa5406257abc5d1.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd7b3fcaa5406257abc5d1.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd7b3fcaa5406257abc5d1
-title: Step 17
+title: Schritt 17
 challengeType: 0
 dashedName: step-17
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd933ba685de776a94997e.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd933ba685de776a94997e.md
index 59d25200fff..65e6c3b1b94 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd933ba685de776a94997e.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd933ba685de776a94997e.md
@@ -1,13 +1,13 @@
 ---
 id: 61fd933ba685de776a94997e
-title: Step 21
+title: Schritt 21
 challengeType: 0
 dashedName: step-21
 ---
 
 # --description--
 
-Within the first `tr`, add a `th` element with the text `Loans The outstanding balance on our startup loan.`. Wrap that text, except for `Loans `, within a `span` element with the `class` set to `description`.
+Within the first `tr`, add a `th` element with the text `Loans The outstanding balance on our startup loan.`. Wrap that text, except for `Loans`, within a `span` element with the `class` set to `description`.
 
 Add three `td` elements below that, and give them the following text, in order: `$500`, `$250`, and `$0`. Give the third `td` element a `class` set to `current`.
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd94056e0355785fbba4d3.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd94056e0355785fbba4d3.md
index 735106d54f9..1f8839c68a9 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd94056e0355785fbba4d3.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd94056e0355785fbba4d3.md
@@ -7,7 +7,7 @@ dashedName: step-22
 
 # --description--
 
-Within the second `tr`, add a `th` element with the text `Expenses Annual anticipated expenses, such as payroll.`. Wrap that text, except for `Expenses `, within a `span` element with the `class` set to `description`.
+Within the second `tr`, add a `th` element with the text `Expenses Annual anticipated expenses, such as payroll.`. Wrap that text, except for `Expenses`, within a `span` element with the `class` set to `description`.
 
 Add three `td` elements below that, and give them the following text, in order: `$200`, `$300`, and `$400`. Give the third `td` element a `class` set to `current`.
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd986ddbcbd47ba8fbc5ec.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd986ddbcbd47ba8fbc5ec.md
index 4598e8a76f9..a7289e5738c 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd986ddbcbd47ba8fbc5ec.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd986ddbcbd47ba8fbc5ec.md
@@ -7,7 +7,7 @@ dashedName: step-23
 
 # --description--
 
-Within the third `tr`, add a `th` element with the text `Credit The outstanding balance on our credit card.`. Wrap that text, except for `Credit `, within a `span` element with the `class` set to `description`.
+Within the third `tr`, add a `th` element with the text `Credit The outstanding balance on our credit card.`. Wrap that text, except for `Credit`, within a `span` element with the `class` set to `description`.
 
 Add three `td` elements below that, and give them the following text, in order: `$50`, `$50`, and `$75`. Give the third `td` element a `class` set to `current`.
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdac1e31692f9a9ad97295.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdac1e31692f9a9ad97295.md
index 0dc22fdcd90..885f63960f6 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdac1e31692f9a9ad97295.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdac1e31692f9a9ad97295.md
@@ -19,7 +19,7 @@ Your `span[class~="sr-only"]` selector should have a `clip` property set to `rec
 assert(new __helpers.CSSHelp(document).getStyle('span[class~="sr-only"]')?.getPropertyValue('clip') === 'rect(1px, 1px, 1px, 1px)');
 ```
 
-Your `span[class~="sr-only"] ` selector should have a `clip-path` property set to `inset(50%)`.
+Your `span[class~="sr-only"]` selector should have a `clip-path` property set to `inset(50%)`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('span[class~="sr-only"]')?.getPropertyValue('clip-path') === 'inset(50%)');
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdaf9ff894b6a084ecdc1b.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdaf9ff894b6a084ecdc1b.md
index 499689068ce..a56ea322291 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdaf9ff894b6a084ecdc1b.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdaf9ff894b6a084ecdc1b.md
@@ -160,7 +160,7 @@ span[class~="sr-only"] {
   -webkit-clip-path: inset(50%);
   height: 1px;
   width: 1px;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdafe6f07fd7a1c6785bc2.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdafe6f07fd7a1c6785bc2.md
index 3a4d5ca00d3..b47b09b3959 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdafe6f07fd7a1c6785bc2.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdafe6f07fd7a1c6785bc2.md
@@ -168,7 +168,7 @@ span[class~="sr-only"] {
   width: 1px;
   overflow: hidden;
   white-space: nowrap;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620179bc0a6a2358c72b90ad.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620179bc0a6a2358c72b90ad.md
index b6eeeb2c832..1be1deb0c0a 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620179bc0a6a2358c72b90ad.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620179bc0a6a2358c72b90ad.md
@@ -1,6 +1,6 @@
 ---
 id: 620179bc0a6a2358c72b90ad
-title: Step 44
+title: Schritt 44
 challengeType: 0
 dashedName: step-44
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620191707bc65579ddd3ce15.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620191707bc65579ddd3ce15.md
index 06e8d0a7344..a4ca6c2e132 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620191707bc65579ddd3ce15.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620191707bc65579ddd3ce15.md
@@ -1,6 +1,6 @@
 ---
 id: 620191707bc65579ddd3ce15
-title: Step 55
+title: Schritt 55
 challengeType: 0
 dashedName: step-55
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620199c7a7a32c81d4db3410.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620199c7a7a32c81d4db3410.md
index 29b9ca506ee..527175779ad 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620199c7a7a32c81d4db3410.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620199c7a7a32c81d4db3410.md
@@ -1,6 +1,6 @@
 ---
 id: 620199c7a7a32c81d4db3410
-title: Step 58
+title: Schritt 58
 challengeType: 0
 dashedName: step-58
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a5258af7b398b030bfaf.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a5258af7b398b030bfaf.md
index 00222d828d5..f7c05d98c43 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a5258af7b398b030bfaf.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a5258af7b398b030bfaf.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a5258af7b398b030bfaf
-title: Step 64
+title: Schritt 64
 challengeType: 0
 dashedName: step-64
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e6afc009b450a437940a1.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e6afc009b450a437940a1.md
index 9a566b90db0..f343e942063 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e6afc009b450a437940a1.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e6afc009b450a437940a1.md
@@ -1,6 +1,6 @@
 ---
 id: 612e6afc009b450a437940a1
-title: Step 1
+title: Schritt 1
 challengeType: 0
 dashedName: step-1
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e77aba7ca691f598feb02.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e77aba7ca691f598feb02.md
index a27f292ea3b..e49750adcb8 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e77aba7ca691f598feb02.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e77aba7ca691f598feb02.md
@@ -1,6 +1,6 @@
 ---
 id: 612e77aba7ca691f598feb02
-title: Step 2
+title: Schritt 2
 challengeType: 0
 dashedName: step-2
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e813b3ba67633222cbe54.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e813b3ba67633222cbe54.md
index 5fa1a5eb88e..97c0418be13 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e813b3ba67633222cbe54.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e813b3ba67633222cbe54.md
@@ -7,7 +7,7 @@ dashedName: step-6
 
 # --description--
 
-Remember that a `class` attribute can have multiple values. To separate your white keys from your black keys, you'll add a second `class` value of `black--key`. Add this to your second, third, fifth, sixth, and seventh `.key` elements. 
+Remember that a `class` attribute can have multiple values. To separate your white keys from your black keys, you'll add a second `class` value of `black--key`. Add this to your second, third, fifth, sixth, and seventh `.key` elements.
 
 # --hints--
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e8279827a28352ce83a72.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e8279827a28352ce83a72.md
index 0f236ccfce1..f13f6677b49 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e8279827a28352ce83a72.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e8279827a28352ce83a72.md
@@ -1,6 +1,6 @@
 ---
 id: 612e8279827a28352ce83a72
-title: Step 7
+title: Schritt 7
 challengeType: 0
 dashedName: step-7
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e89562043183c86df287c.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e89562043183c86df287c.md
index 3501856b806..b1d895550a6 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e89562043183c86df287c.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e89562043183c86df287c.md
@@ -1,6 +1,6 @@
 ---
 id: 612e89562043183c86df287c
-title: Step 9
+title: Schritt 9
 challengeType: 0
 dashedName: step-9
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e95ef2e4bdf41f69067f9.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e95ef2e4bdf41f69067f9.md
index 8e6fea278bc..c429b557029 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e95ef2e4bdf41f69067f9.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e95ef2e4bdf41f69067f9.md
@@ -1,6 +1,6 @@
 ---
 id: 612e95ef2e4bdf41f69067f9
-title: Step 12
+title: Schritt 12
 challengeType: 0
 dashedName: step-12
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e9d142affc44a453655db.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e9d142affc44a453655db.md
index 16e42665df7..4623cf034c5 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e9d142affc44a453655db.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e9d142affc44a453655db.md
@@ -1,6 +1,6 @@
 ---
 id: 612e9d142affc44a453655db
-title: Step 16
+title: Schritt 16
 challengeType: 0
 dashedName: step-16
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612eb8e984cd73677a92b7e9.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612eb8e984cd73677a92b7e9.md
index ec9ef33f472..5821fab8b25 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612eb8e984cd73677a92b7e9.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612eb8e984cd73677a92b7e9.md
@@ -1,6 +1,6 @@
 ---
 id: 612eb8e984cd73677a92b7e9
-title: Step 25
+title: Schritt 25
 challengeType: 0
 dashedName: step-25
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612ebf9a210f2b6d77001e68.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612ebf9a210f2b6d77001e68.md
index 409dcfd0aeb..ed438988bf8 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612ebf9a210f2b6d77001e68.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612ebf9a210f2b6d77001e68.md
@@ -1,6 +1,6 @@
 ---
 id: 612ebf9a210f2b6d77001e68
-title: Step 30
+title: Schritt 30
 challengeType: 0
 dashedName: step-30
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996e.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996e.md
index df9f52fe8a4..a6c9fbc7032 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996e.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6996e.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad6996e
-title: Step 5
+title: Schritt 5
 challengeType: 0
 dashedName: step-5
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69970.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69970.md
index 2dbdf0b6403..b6182dfef7d 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69970.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69970.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69970
-title: Step 7
+title: Schritt 7
 challengeType: 0
 dashedName: step-7
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69971.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69971.md
index 5692e34e757..c7c6f84ded2 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69971.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69971.md
@@ -9,9 +9,7 @@ dashedName: step-8
 
 Time for CSS.
 
-Even though your `<div>` has no text, it's still treated as a box with content.
-Write a CSS rule that uses the `.canvas` class selector and set its `width` to 500 pixels.
-Here's a CSS rule that sets the width of the class `card` to 300 pixels:
+Even though your `<div>` has no text, it's still treated as a box with content. Write a CSS rule that uses the `.canvas` class selector and set its `width` to 500 pixels. Here's a CSS rule that sets the width of the class `card` to 300 pixels:
 
 ```css
 .card {
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69978.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69978.md
index 34a33d9846d..5039d350f64 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69978.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69978.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69978
-title: Step 15
+title: Schritt 15
 challengeType: 0
 dashedName: step-15
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997a.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997a.md
index 6490cbccbe0..4b8487597ad 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997a.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6997a.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad6997a
-title: Step 17
+title: Schritt 17
 challengeType: 0
 dashedName: step-17
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69987.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69987.md
index 1376ec85ccf..0359a5acd95 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69987.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69987.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69987
-title: Step 29
+title: Schritt 29
 challengeType: 0
 dashedName: step-29
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998f.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998f.md
index 251253face2..a759a6ad9b7 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998f.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad6998f.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad6998f
-title: Step 37
+title: Schritt 37
 challengeType: 0
 dashedName: step-37
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69994.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69994.md
index 6656f427a1b..4b20876ea3a 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69994.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-the-css-box-model-by-building-a-rothko-painting/60a3e3396c7b40068ad69994.md
@@ -1,6 +1,6 @@
 ---
 id: 60a3e3396c7b40068ad69994
-title: Step 42
+title: Schritt 42
 challengeType: 0
 dashedName: step-42
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f34948891834dd77655a6.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f34948891834dd77655a6.md
index 94213e09246..c1b590d4f0f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f34948891834dd77655a6.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f34948891834dd77655a6.md
@@ -50,7 +50,7 @@ assert(document.querySelectorAll('p')?.[1]?.innerText === 'Serving size 2/3 cup
   <body>
     <h1>Nutrition Facts</h1>
     <p>8 servings per container</p>
-    
+
   </body>
 </html>
 --fcc-editable-region--
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f38cabc64e3556f98cc1a.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f38cabc64e3556f98cc1a.md
index 13f5f2593b8..6564869c8f2 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f38cabc64e3556f98cc1a.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f38cabc64e3556f98cc1a.md
@@ -1,6 +1,6 @@
 ---
 id: 615f38cabc64e3556f98cc1a
-title: Step 8
+title: Schritt 8
 challengeType: 0
 dashedName: step-8
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3e4af8008c5d494d3afe.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3e4af8008c5d494d3afe.md
index 475d0849491..557d646bca5 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3e4af8008c5d494d3afe.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f3e4af8008c5d494d3afe.md
@@ -1,6 +1,6 @@
 ---
 id: 615f3e4af8008c5d494d3afe
-title: Step 15
+title: Schritt 15
 challengeType: 0
 dashedName: step-15
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f41c979787462e76dab90.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f41c979787462e76dab90.md
index 56e13a5ed71..2d4397eb7ad 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f41c979787462e76dab90.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f41c979787462e76dab90.md
@@ -1,6 +1,6 @@
 ---
 id: 615f41c979787462e76dab90
-title: Step 20
+title: Schritt 20
 challengeType: 0
 dashedName: step-20
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f423cf65d5864132a0956.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f423cf65d5864132a0956.md
index de2bc32eb1e..6c9291bfe88 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f423cf65d5864132a0956.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f423cf65d5864132a0956.md
@@ -1,6 +1,6 @@
 ---
 id: 615f423cf65d5864132a0956
-title: Step 21
+title: Schritt 21
 challengeType: 0
 dashedName: step-21
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f50473cc0196c6dd3892a.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f50473cc0196c6dd3892a.md
index 156382a73d0..cb4e9e632be 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f50473cc0196c6dd3892a.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f50473cc0196c6dd3892a.md
@@ -1,6 +1,6 @@
 ---
 id: 615f50473cc0196c6dd3892a
-title: Step 28
+title: Schritt 28
 challengeType: 0
 dashedName: step-28
 ---
@@ -9,7 +9,7 @@ dashedName: step-28
 
 You may notice there is still a small border at the bottom of your `.lg` element. To reset this, give your `.lg, .md` selector a `border` property set to `0`.
 
-Note: the `md`(medium) class will be utilized in step 37 for the thinner bars of the nutrition label. 
+Note: the `md`(medium) class will be utilized in step 37 for the thinner bars of the nutrition label.
 
 # --hints--
 
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f51e4e5b24a6e80eccce1.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f51e4e5b24a6e80eccce1.md
index b84b3468ee9..669238c0f8d 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f51e4e5b24a6e80eccce1.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f51e4e5b24a6e80eccce1.md
@@ -1,6 +1,6 @@
 ---
 id: 615f51e4e5b24a6e80eccce1
-title: Step 30
+title: Schritt 30
 challengeType: 0
 dashedName: step-30
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f575b50b91e72af079480.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f575b50b91e72af079480.md
index d4458ee3f7e..dc4bfa350cf 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f575b50b91e72af079480.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f575b50b91e72af079480.md
@@ -1,6 +1,6 @@
 ---
 id: 615f575b50b91e72af079480
-title: Step 33
+title: Schritt 33
 challengeType: 0
 dashedName: step-33
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f5c1cb7575c7551ed8a40.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f5c1cb7575c7551ed8a40.md
index cfd6cc33c9e..0992cb922f4 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f5c1cb7575c7551ed8a40.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f5c1cb7575c7551ed8a40.md
@@ -1,6 +1,6 @@
 ---
 id: 615f5c1cb7575c7551ed8a40
-title: Step 35
+title: Schritt 35
 challengeType: 0
 dashedName: step-35
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f666ac5edea782feb7e75.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f666ac5edea782feb7e75.md
index 235c6490c3a..5ec2d367970 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f666ac5edea782feb7e75.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f666ac5edea782feb7e75.md
@@ -1,6 +1,6 @@
 ---
 id: 615f666ac5edea782feb7e75
-title: Step 38
+title: Schritt 38
 challengeType: 0
 dashedName: step-38
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7ad94380408d971d14f6.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7ad94380408d971d14f6.md
index 008b34a3751..57205d2fd5a 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7ad94380408d971d14f6.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7ad94380408d971d14f6.md
@@ -7,7 +7,7 @@ dashedName: step-48
 
 # --description--
 
-The `:not` pseudo-selector can be used to select all elements that do not match the given CSS rule. 
+The `:not` pseudo-selector can be used to select all elements that do not match the given CSS rule.
 
 ```css
 div:not(#example) {
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7d489a581590d1350288.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7d489a581590d1350288.md
index 8540c74155e..a09ea37d34b 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7d489a581590d1350288.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f7d489a581590d1350288.md
@@ -1,6 +1,6 @@
 ---
 id: 615f7d489a581590d1350288
-title: Step 51
+title: Schritt 51
 challengeType: 0
 dashedName: step-51
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f8f1223601fa546e93f31.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f8f1223601fa546e93f31.md
index d9873550e4d..6815f4fc360 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f8f1223601fa546e93f31.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f8f1223601fa546e93f31.md
@@ -1,6 +1,6 @@
 ---
 id: 615f8f1223601fa546e93f31
-title: Step 63
+title: Schritt 63
 challengeType: 0
 dashedName: step-63
 ---
diff --git a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f905fbd1017a65ca224eb.md b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f905fbd1017a65ca224eb.md
index 540ab15d1a3..4645e9fc98f 100644
--- a/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f905fbd1017a65ca224eb.md
+++ b/curriculum/challenges/german/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f905fbd1017a65ca224eb.md
@@ -1,6 +1,6 @@
 ---
 id: 615f905fbd1017a65ca224eb
-title: Step 64
+title: Schritt 64
 challengeType: 0
 dashedName: step-64
 ---
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/build-a-cash-register-project/cash-register.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/build-a-cash-register-project/cash-register.md
index 4653f6358b1..f6a792e652d 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/build-a-cash-register-project/cash-register.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/build-a-cash-register-project/cash-register.md
@@ -1,6 +1,6 @@
 ---
 id: aa2e6f85cab2ab736c9a9b24
-title: Build A Cash Register
+title: Erstelle eine Registrierkasse
 challengeType: 5
 forumTopicId: 16012
 dashedName: build-a-cash-register
@@ -20,7 +20,7 @@ Return `{status: "CLOSED", change: [...]}` with cash-in-drawer as the value for
 
 Otherwise, return `{status: "OPEN", change: [...]}`, with the change due in coins and bills, sorted in highest to lowest order, as the value of the `change` key.
 
-<table class='table table-striped'><tbody><tr><th>Currency Unit</th><th>Amount</th></tr><tr><td>Penny</td><td>$0.01 (PENNY)</td></tr><tr><td>Nickel</td><td>$0.05 (NICKEL)</td></tr><tr><td>Dime</td><td>$0.1 (DIME)</td></tr><tr><td>Quarter</td><td>$0.25 (QUARTER)</td></tr><tr><td>Dollar</td><td>$1 (ONE)</td></tr><tr><td>Five Dollars</td><td>$5 (FIVE)</td></tr><tr><td>Ten Dollars</td><td>$10 (TEN)</td></tr><tr><td>Twenty Dollars</td><td>$20 (TWENTY)</td></tr><tr><td>One-hundred Dollars</td><td>$100 (ONE HUNDRED)</td></tr></tbody></table>
+<table class='table table-striped'><tbody><tr><th>Währungseinheit</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>Fünf Dollar</td><td>$5 (FIVE)</td></tr><tr><td>Zehn Dollar</td><td>$10 (TEN)</td></tr><tr><td>Zwanzig Dollar</td><td>$20 (TWENTY)</td></tr><tr><td>Einhundert Dollar</td><td>$100 (ONE HUNDRED)</td></tr></tbody></table>
 
 See below for an example of a cash-in-drawer array:
 
@@ -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]])` sollte ein Objekt zurückgeben.
 
 ```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]])` sollte `{status: "OPEN", change: [["QUARTER", 0.5]]}` zurückgeben.
 
 ```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]])` sollte `{status: "OPEN", change: [["TWENTY", 60], ["TEN", 20], ["FIVE", 15], ["ONE", 1], ["QUARTER", 0.5], ["DIME", 0.2], ["PENNY", 0.04]]}` zurückgeben.
 
 ```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]])` sollte `{status: "INSUFFICIENT_FUNDS", change: []}` zurückgeben.
 
 ```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]])` sollte `{status: "INSUFFICIENT_FUNDS", change: []}` zurückgeben.
 
 ```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]])` sollte `{status: "CLOSED", change: [["PENNY", 0.5], ["NICKEL", 0], ["DIME", 0], ["QUARTER", 0], ["ONE", 0], ["FIVE", 0], ["TEN", 0], ["TWENTY", 0], ["ONE HUNDRED", 0]]}` zurückgeben.
 
 ```js
 assert.deepEqual(
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/build-a-palindrome-checker-project/palindrome-checker.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/build-a-palindrome-checker-project/palindrome-checker.md
index 5f7ca896a8c..0ca2cfb5461 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/build-a-palindrome-checker-project/palindrome-checker.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/build-a-palindrome-checker-project/palindrome-checker.md
@@ -26,25 +26,25 @@ We'll also pass strings with special symbols, such as `2A3*3a2`, `2A3 3a2`, and
 assert(typeof palindrome('eye') === 'boolean');
 ```
 
-`palindrome("eye")` should return `true`.
+`palindrome("eye")` sollte `true` zurückgeben.
 
 ```js
 assert(palindrome('eye') === true);
 ```
 
-`palindrome("_eye")` should return `true`.
+`palindrome("_eye")` sollte `true` zurückgeben.
 
 ```js
 assert(palindrome('_eye') === true);
 ```
 
-`palindrome("race car")` should return `true`.
+`palindrome("race car")` sollte `true` zurückgeben.
 
 ```js
 assert(palindrome('race car') === true);
 ```
 
-`palindrome("not a palindrome")` should return `false`.
+`palindrome("not a palindrome")` sollte `false` zurückgeben.
 
 ```js
 assert(palindrome('not a palindrome') === false);
@@ -56,43 +56,43 @@ assert(palindrome('not a palindrome') === false);
 assert(palindrome('A man, a plan, a canal. Panama') === true);
 ```
 
-`palindrome("never odd or even")` should return `true`.
+`palindrome("never odd or even")` sollte `true` zurückgeben.
 
 ```js
 assert(palindrome('never odd or even') === true);
 ```
 
-`palindrome("nope")` should return `false`.
+`palindrome("nope")` sollte `false` zurückgeben.
 
 ```js
 assert(palindrome('nope') === false);
 ```
 
-`palindrome("almostomla")` should return `false`.
+`palindrome("almostomla")` sollte `false` zurückgeben.
 
 ```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.")` sollte `true` zurückgeben.
 
 ```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.")` sollte `false` zurückgeben.
 
 ```js
 assert(palindrome('1 eye for of 1 eye.') === false);
 ```
 
-`palindrome("0_0 (: /-\ :) 0-0")` should return `true`.
+`palindrome("0_0 (: /-\ :) 0-0")` sollte `true` zurückgeben.
 
 ```js
 assert(palindrome('0_0 (: /- :) 0-0') === true);
 ```
 
-`palindrome("five|\_/|four")` should return `false`.
+`palindrome("five|\_/|four")` sollte `false` zurückgeben.
 
 ```js
 assert(palindrome('five|_/|four') === false);
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/build-a-roman-numeral-converter-project/roman-numeral-converter.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/build-a-roman-numeral-converter-project/roman-numeral-converter.md
index b3640a1200d..3fb4823d026 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/build-a-roman-numeral-converter-project/roman-numeral-converter.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/build-a-roman-numeral-converter-project/roman-numeral-converter.md
@@ -10,177 +10,177 @@ dashedName: build-a-roman-numeral-converter
 
 Convert the given number into a roman numeral.
 
-| Roman numerals | Arabic numerals |
-|----------------|-----------------|
-| M              | 1000            |
-| CM             | 900             |
-| D              | 500             |
-| CD             | 400             |
-| C              | 100             |
-| XC             | 90              |
-| L              | 50              |
-| XL             | 40              |
-| X              | 10              |
-| IX             | 9               |
-| V              | 5               |
-| IV             | 4               |
-| I              | 1               |
+| Römische Ziffern | Arabische Ziffern |
+| ---------------- | ----------------- |
+| M                | 1000              |
+| CM               | 900               |
+| D                | 500               |
+| CD               | 400               |
+| C                | 100               |
+| XC               | 90                |
+| L                | 50                |
+| XL               | 40                |
+| X                | 10                |
+| IX               | 9                 |
+| V                | 5                 |
+| IV               | 4                 |
+| I                | 1                 |
 
 All roman numerals answers should be provided in upper-case.
 
 # --hints--
 
-`convertToRoman(2)` should return the string `II`.
+`convertToRoman(2)` sollte den String `II` zurückgeben.
 
 ```js
 assert.deepEqual(convertToRoman(2), 'II');
 ```
 
-`convertToRoman(3)` should return the string `III`.
+`convertToRoman(3)` sollte den String `III` zurückgeben.
 
 ```js
 assert.deepEqual(convertToRoman(3), 'III');
 ```
 
-`convertToRoman(4)` should return the string `IV`.
+`convertToRoman(4)` sollte den String `IV` zurückgeben.
 
 ```js
 assert.deepEqual(convertToRoman(4), 'IV');
 ```
 
-`convertToRoman(5)` should return the string `V`.
+`convertToRoman(5)` sollte den String `V` zurückgeben.
 
 ```js
 assert.deepEqual(convertToRoman(5), 'V');
 ```
 
-`convertToRoman(9)` should return the string `IX`.
+`convertToRoman(9)` sollte den String `IX` zurückgeben.
 
 ```js
 assert.deepEqual(convertToRoman(9), 'IX');
 ```
 
-`convertToRoman(12)` should return the string `XII`.
+`convertToRoman(12)` sollte den String `XII` zurückgeben.
 
 ```js
 assert.deepEqual(convertToRoman(12), 'XII');
 ```
 
-`convertToRoman(16)` should return the string `XVI`.
+`convertToRoman(16)` sollte den String `XVI` zurückgeben.
 
 ```js
 assert.deepEqual(convertToRoman(16), 'XVI');
 ```
 
-`convertToRoman(29)` should return the string `XXIX`.
+`convertToRoman(29)` sollte den String `XXIX` zurückgeben.
 
 ```js
 assert.deepEqual(convertToRoman(29), 'XXIX');
 ```
 
-`convertToRoman(44)` should return the string `XLIV`.
+`convertToRoman(44)` sollte den String `XLIV` zurückgeben.
 
 ```js
 assert.deepEqual(convertToRoman(44), 'XLIV');
 ```
 
-`convertToRoman(45)` should return the string `XLV`.
+`convertToRoman(45)` sollte den String `XLV` zurückgeben.
 
 ```js
 assert.deepEqual(convertToRoman(45), 'XLV');
 ```
 
-`convertToRoman(68)` should return the string `LXVIII`
+`convertToRoman(68)` sollte den String `LXVIII` zurückgeben
 
 ```js
 assert.deepEqual(convertToRoman(68), 'LXVIII');
 ```
 
-`convertToRoman(83)` should return the string `LXXXIII`
+`convertToRoman(83)` sollte den String `LXXXIII` zurückgeben
 
 ```js
 assert.deepEqual(convertToRoman(83), 'LXXXIII');
 ```
 
-`convertToRoman(97)` should return the string `XCVII`
+`convertToRoman(97)` sollte den String `XCVII` zurückgeben
 
 ```js
 assert.deepEqual(convertToRoman(97), 'XCVII');
 ```
 
-`convertToRoman(99)` should return the string `XCIX`
+`convertToRoman(99)` sollte den String `XCIX` zurückgeben
 
 ```js
 assert.deepEqual(convertToRoman(99), 'XCIX');
 ```
 
-`convertToRoman(400)` should return the string `CD`
+`convertToRoman(400)` sollte den String `CD` zurückgeben
 
 ```js
 assert.deepEqual(convertToRoman(400), 'CD');
 ```
 
-`convertToRoman(500)` should return the string `D`
+`convertToRoman(500)` sollte den String `D` zurückgeben
 
 ```js
 assert.deepEqual(convertToRoman(500), 'D');
 ```
 
-`convertToRoman(501)` should return the string `DI`
+`convertToRoman(501)` sollte den String `DI` zurückgeben
 
 ```js
 assert.deepEqual(convertToRoman(501), 'DI');
 ```
 
-`convertToRoman(649)` should return the string `DCXLIX`
+`convertToRoman(649)` sollte den String `DCXLIX` zurückgeben
 
 ```js
 assert.deepEqual(convertToRoman(649), 'DCXLIX');
 ```
 
-`convertToRoman(798)` should return the string `DCCXCVIII`
+`convertToRoman(798)` sollte den String `DCCXCVIII` zurückgeben
 
 ```js
 assert.deepEqual(convertToRoman(798), 'DCCXCVIII');
 ```
 
-`convertToRoman(891)` should return the string `DCCCXCI`
+`convertToRoman(891)` sollte den String `DCCCXCI` zurückgeben
 
 ```js
 assert.deepEqual(convertToRoman(891), 'DCCCXCI');
 ```
 
-`convertToRoman(1000)` should return the string `M`
+`convertToRoman(1000)` sollte den String `M` zurückgeben
 
 ```js
 assert.deepEqual(convertToRoman(1000), 'M');
 ```
 
-`convertToRoman(1004)` should return the string `MIV`
+`convertToRoman(1004)` sollte den String `MIV` zurückgeben
 
 ```js
 assert.deepEqual(convertToRoman(1004), 'MIV');
 ```
 
-`convertToRoman(1006)` should return the string `MVI`
+`convertToRoman(1006)` sollte den String `MVI` zurückgeben
 
 ```js
 assert.deepEqual(convertToRoman(1006), 'MVI');
 ```
 
-`convertToRoman(1023)` should return the string `MXXIII`
+`convertToRoman(1023)` sollte den String `MXXIII` zurückgeben
 
 ```js
 assert.deepEqual(convertToRoman(1023), 'MXXIII');
 ```
 
-`convertToRoman(2014)` should return the string `MMXIV`
+`convertToRoman(2014)` sollte den String `MMXIV` zurückgeben
 
 ```js
 assert.deepEqual(convertToRoman(2014), 'MMXIV');
 ```
 
-`convertToRoman(3999)` should return the string `MMMCMXCIX`
+`convertToRoman(3999)` sollte den String `MMMCMXCIX` zurückgeben
 
 ```js
 assert.deepEqual(convertToRoman(3999), 'MMMCMXCIX');
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/build-a-telephone-number-validator-project/telephone-number-validator.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/build-a-telephone-number-validator-project/telephone-number-validator.md
index 282f77b4be9..dae62ffb83e 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/build-a-telephone-number-validator-project/telephone-number-validator.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/build-a-telephone-number-validator-project/telephone-number-validator.md
@@ -10,11 +10,11 @@ dashedName: build-a-telephone-number-validator
 
 Return `true` if the passed string looks like a valid US phone number.
 
-The user may fill out the form field any way they choose as long as it has the format of a valid US number. The following are examples of valid formats for US numbers (refer to the tests below for other variants):
+Der Benutzer kann das Formularfeld auf jede beliebige Weise ausfüllen, solange es das Format einer gültigen US-Nummer hat. The following are examples of valid formats for US numbers (refer to the tests below for other variants):
 
 <blockquote>555-555-5555<br>(555)555-5555<br>(555) 555-5555<br>555 555 5555<br>5555555555<br>1 555 555 5555</blockquote>
 
-For this challenge you will be presented with a string such as `800-692-7753` or `8oo-six427676;laskdjf`. Your job is to validate or reject the US phone number based on any combination of the formats provided above. The area code is required. If the country code is provided, you must confirm that the country code is `1`. Return `true` if the string is a valid US phone number; otherwise return `false`.
+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. Die Vorwahl ist erforderlich. If the country code is provided, you must confirm that the country code is `1`. Return `true` if the string is a valid US phone number; otherwise return `false`.
 
 # --hints--
 
@@ -24,7 +24,7 @@ For this challenge you will be presented with a string such as `800-692-7753` or
 assert(typeof telephoneCheck('555-555-5555') === 'boolean');
 ```
 
-`telephoneCheck("1 555-555-5555")` should return `true`.
+`telephoneCheck("1 555-555-5555")` sollte `true` zurückgeben.
 
 ```js
 assert(telephoneCheck('1 555-555-5555') === true);
@@ -186,7 +186,7 @@ assert(telephoneCheck('(555)5(55?)-5555') === false);
 assert(telephoneCheck('55 55-55-555-5') === false);
 ```
 
-`telephoneCheck("11 555-555-5555")` should return `false`.
+`telephoneCheck("11 555-555-5555")` sollte `false` zurückgeben.
 
 ```js
 assert(telephoneCheck('11 555-555-5555') === false);
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23d1c5f1c93161f3582ae.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23d1c5f1c93161f3582ae.md
index d5d8c611c5c..7d9867b26c7 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23d1c5f1c93161f3582ae.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23d1c5f1c93161f3582ae.md
@@ -7,7 +7,7 @@ dashedName: step-6
 
 # --description--
 
-Similar to your `#stats` element, your `#monsterStats` element needs two `span` elements. Give them the class `stat` and give the first element the text `Monster Name: ` and the second the text `Health: `. After the text in each, add a `strong` element with an empty nested `span` element.
+Similar to your `#stats` element, your `#monsterStats` element needs two `span` elements. Give them the class `stat` and give the first element the text `Monster Name:` and the second the text `Health:`. After the text in each, add a `strong` element with an empty nested `span` element.
 
 # --hints--
 
@@ -26,14 +26,14 @@ assert.equal(spans[0].className, 'stat');
 assert.equal(spans[1].className, 'stat');
 ```
 
-Your first `span` element should have the text `Monster Name: `. Make sure the spacing is correct.
+Your first `span` element should have the text `Monster Name:`. Make sure the spacing is correct.
 
 ```js
 const spans = document.querySelectorAll(`#monsterStats > span`);
 assert.equal(spans[0].innerText, 'Monster Name: ');
 ```
 
-Your second `span` element should have the text `Health: `. Make sure the spacing is correct.
+Your second `span` element should have the text `Health:`. Make sure the spacing is correct.
 
 ```js
 const spans = document.querySelectorAll(`#monsterStats > span`);
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md
index 490ea3e8e2f..3cc2e9eb620 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md
@@ -14,7 +14,7 @@ const info = document.querySelector("#info");
 info.innerText = "Hello World";
 ```
 
-This code would change the element assigned to the `div` variable to have the text `Hello World`. 
+This code would change the element assigned to the `div` variable to have the text `Hello World`.
 
 When a player clicks your `Go to store` button, you want to change the buttons and text. Remove the code inside the `goStore` function and add a line that updates the text of `button1` to say `Buy 10 health (10 gold)`.
 
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md
index d5c3664e5ed..28ff0bb1ad6 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md
@@ -135,7 +135,7 @@ const monsterHealthText =document.querySelector("#monsterHealth");
 --fcc-editable-region--
 const locations = [
     {
-        
+
     }
 ];
 --fcc-editable-region--
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
index d91e6245ebe..8f9a534ce96 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
@@ -206,7 +206,7 @@ function buyWeapon() {
     gold -= 30;
     currentWeapon++;
     goldText.innerText = gold;
-    
+
     text.innerText = "You now have a new weapon.";
   }
 }
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
index 4b1f8fb6cb6..95d244d0f28 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
@@ -7,7 +7,7 @@ dashedName: step-90
 
 # --description--
 
-You can insert variables into a string with the <dfn>concatenation operator</dfn> `+`. Update the `You now have a new weapon.` string to say `You now have a ` and the name of the new weapon. Remember to end the sentence with a period.
+You can insert variables into a string with the <dfn>concatenation operator</dfn> `+`. Update the `You now have a new weapon.` string to say `You now have a` and the name of the new weapon. Remember to end the sentence with a period.
 
 Here is an example that creates the string `Hello, our name is freeCodeCamp.`:
 
@@ -18,7 +18,7 @@ const ourStr = "Hello, our name is " + ourName + ".";
 
 # --hints--
 
-You should update the `text.innerText` assignment to start with the string `You now have a `.
+You should update the `text.innerText` assignment to start with the string `You now have a`.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*=\s*('|")You now have a \1/);
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
index 748ab4d2f08..0adfafd5584 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
@@ -214,7 +214,7 @@ function buyWeapon() {
     goldText.innerText = gold;
     let newWeapon = weapons[currentWeapon].name;
     text.innerText = "You now have a " + newWeapon + ".";
-    
+
   }
 }
 --fcc-editable-region--
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
index b7219fb9be1..4037d95c48c 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
@@ -7,7 +7,7 @@ dashedName: step-92
 
 # --description--
 
-Up until now, any time `text.innerText` was updated the old text was erased. This time, use the `+=` operator to add text to the end of `text.innerText`. Add the string ` In your inventory you have: ` - include the spaces at the beginning and the end.
+Up until now, any time `text.innerText` was updated the old text was erased. This time, use the `+=` operator to add text to the end of `text.innerText`. Add the string `In your inventory you have:` - include the spaces at the beginning and the end.
 
 # --hints--
 
@@ -24,7 +24,7 @@ You should use the `+=` operator to add to `text.innerText`.
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*/)
 ```
 
-You should add the string ` In your inventory you have: ` to the end of `text.innerText`. Mind the spaces!
+You should add the string `In your inventory you have:` to the end of `text.innerText`. Mind the spaces!
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*('|")\sIn your inventory you have:\s\1/)
@@ -203,7 +203,7 @@ function buyWeapon() {
     let newWeapon = weapons[currentWeapon].name;
     text.innerText = "You now have a " + newWeapon + ".";
     inventory.push(newWeapon);
-    
+
   }
 }
 --fcc-editable-region--
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
index 098be4a56e6..908c77e836c 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
@@ -11,7 +11,7 @@ At the end of the second `text.innerText` string you just added, use the concate
 
 # --hints--
 
-You should not change the ` In your inventory you have: ` string.
+You should not change the `In your inventory you have:` string.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*('|")\sIn your inventory you have:\s\1/)
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
index 03e5cceea99..59e7717ce5b 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
@@ -7,7 +7,7 @@ dashedName: step-105
 
 # --description--
 
-After your `currentWeapon`, use the concatenation operator to set `text.innerText` to the string `You sold a `, then `currentWeapon`, then the string `.`.
+After your `currentWeapon`, use the concatenation operator to set `text.innerText` to the string `You sold a`, then `currentWeapon`, then the string `.`.
 
 # --hints--
 
@@ -17,13 +17,13 @@ You should use the assignment operator with `text.innerText`.
 assert.match(sellWeapon.toString(), /text\.innerText\s*=/);
 ```
 
-You should add `You sold a ` to `text.innerText`. Spacing is important.
+You should add `You sold a` to `text.innerText`. Spacing is important.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*=\s*('|")You sold a \1/);
 ```
 
-You should add the value of `currentWeapon` to the `You sold a ` string. Use the concatenation operator to do this on the same line.
+You should add the value of `currentWeapon` to the `You sold a` string. Use the concatenation operator to do this on the same line.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*=\s*('|")You sold a\s\1\s*\+\s*\_currentWeapon/);
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
index bc8435faa22..ab3661c3b47 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
@@ -7,7 +7,7 @@ dashedName: step-106
 
 # --description--
 
-Now use the `+=` operator to add the string ` In your inventory you have: ` and the contents of `inventory` to the `text.innerText`. Make sure to include the space at the beginning and end of the ` In your inventory you have: ` string.
+Now use the `+=` operator to add the string `In your inventory you have:` and the contents of `inventory` to the `text.innerText`. Make sure to include the space at the beginning and end of the `In your inventory you have:` string.
 
 # --hints--
 
@@ -25,7 +25,7 @@ const matches = sellWeapon.toString().match(/text\.innerText\s*\+=/g);
 assert.equal(matches.length, 1);
 ```
 
-You should add the string ` In your inventory you have: ` to the second `text.innerText` line. Spacing matters.
+You should add the string `In your inventory you have:` to the second `text.innerText` line. Spacing matters.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*\+=\s*('|") In your inventory you have: \1/);
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
index 229ca08f2a2..d332dfa1870 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
@@ -17,19 +17,19 @@ You should use dot notation to access the `innerText` property of `text`.
 assert.match(attack.toString(), /text\.innerText/);
 ```
 
-You should assign the string `The ` to `innerText` property of `text`.
+You should assign the string `The` to `innerText` property of `text`.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1/);
 ```
 
-You should use the concatenation operator to add the value of `monsters[fighting].name` to the `The ` string.
+You should use the concatenation operator to add the value of `monsters[fighting].name` to the `The` string.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1\s*\+\s*monsters\[fighting\]\.name/);
 ```
 
-You should use the concatenation operator to add the string ` attacks.` to the `monsters[fighting].name` string.
+You should use the concatenation operator to add the string `attacks.` to the `monsters[fighting].name` string.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1\s*\+\s*monsters\[fighting\]\.name\s*\+\s*('|") attacks\.\2/);
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
index 6566de3802a..a96685f85e9 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
@@ -7,7 +7,7 @@ dashedName: step-119
 
 # --description--
 
-On a new line, add the string ` You attack it with your [weapon].` to the `text` value, replacing `[weapon]` with the player's current weapon.
+On a new line, add the string `You attack it with your [weapon].` to the `text` value, replacing `[weapon]` with the player's current weapon.
 
 # --hints--
 
@@ -24,7 +24,7 @@ You should use compound assignment with `text.innerText`.
 assert.match(attack.toString(), /text\.innerText\s*\+=/);
 ```
 
-You should add the string ` You attack it with your ` to the `text.innerText` value. Remember that spacing matters.
+You should add the string `You attack it with your` to the `text.innerText` value. Remember that spacing matters.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|") You attack it with your \1/);
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
index a2c6fde768a..5e0e6059dff 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
@@ -279,7 +279,7 @@ function attack() {
   text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
   health -= monsters[fighting].level;
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
index acf1efd38b0..055ca35f7fe 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
@@ -275,7 +275,7 @@ function attack() {
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
   healthText.innerText = health;
   monsterHealthText.innerText = monsterHealth;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
index 3524f53b4a3..74b7964b09f 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
@@ -11,7 +11,7 @@ Inside the `dodge` function, set `text.innerText` equal to the string `You dodge
 
 # --hints--
 
-You should assign the string `You dodge the attack from the ` to the `text.innerText` property. Remember that spacing matters.
+You should assign the string `You dodge the attack from the` to the `text.innerText` property. Remember that spacing matters.
 
 ```js
 assert.match(dodge.toString(), /text\.innerText\s*=\s*('|")You dodge the attack from the \1/);
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
index cb9eadcb3ec..c2913614de6 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
@@ -283,7 +283,7 @@ function dodge() {
 function defeatMonster() {
   gold += Math.floor(monsters[fighting].level * 6.7);
   xp += monsters[fighting].level;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
index ca92f837431..0101b5e2285 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
@@ -285,7 +285,7 @@ function defeatMonster() {
   xp += monsters[fighting].level;
   goldText.innerText = gold;
   xpText.innerText = xp;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
index dd0068655fd..93d46489227 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
@@ -10,7 +10,7 @@ dashedName: step-132
 Your `locations` array doesn't have a fifth element, so `locations[4]` doesn't work. Add a new object at the end of the `locations` array, following the same structure as the other objects. Set `name` to `kill monster`, set `button text` to an array with three `Go to town square` strings, set `button functions` to an array with three `goTown` variables, and set `text` to `The monster screams Arg! as it dies. You gain experience points and find gold.`.
 
 # --hints--
- 
+
 Your `locations` array should have five values.
 
 ```js
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
index 3e9df421573..6b3bc12e219 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
@@ -280,7 +280,7 @@ function attack() {
   text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
   health -= getMonsterAttackValue(monsters[fighting].level);
   if (isMonsterHit()) {
-    
+
   }
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
   healthText.innerText = health;
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
index 88836e37794..8bf8c85ac0e 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
@@ -7,7 +7,7 @@ dashedName: step-150
 
 # --description--
 
-Add an `else` statement to your `if` statement. In the `else` statement, use the `+=` operator to add the text ` You miss.` to the end of `text.innerText`.
+Add an `else` statement to your `if` statement. In the `else` statement, use the `+=` operator to add the text `You miss.` to the end of `text.innerText`.
 
 # --hints--
 
@@ -17,7 +17,7 @@ You should add an `else` block after your `if (isMonsterHit())` block.
 assert.match(attack.toString(), /if\s*\(isMonsterHit\(\)\s*\)\s*\{\s*monsterHealth\s*-=\s*weapons\[currentWeapon\]\.power\s*\+\s*Math\.floor\(Math\.random\(\)\s*\*\s*xp\)\s*\+\s*1;\s*\}\s*else/)
 ```
 
-You should add the text ` You miss.` to the end of `text.innerText`. Remember to use compound assignment.
+You should add the text `You miss.` to the end of `text.innerText`. Remember to use compound assignment.
 
 ```js
 assert.match(attack.toString(), /if\s*\(isMonsterHit\(\)\s*\)\s*\{\s*monsterHealth\s*-=\s*weapons\[currentWeapon\]\.power\s*\+\s*Math\.floor\(Math\.random\(\)\s*\*\s*xp\)\s*\+\s*1;\s*\}\s*else\s*\{\s*text\.innerText\s*\+=\s*('|")\sYou miss\.\1/)
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
index 4210b69f7a8..02ffeb838f6 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
@@ -7,7 +7,7 @@ dashedName: step-154
 
 # --description--
 
-Use the `+=` operator to add ` Your [weapon] breaks.` to the end of `text.innerText`, replacing `weapon` with the last item in the `inventory` array. You can get this last item by using `inventory.pop()`, which will remove the last item in the array AND return it so it appears in your string.
+Use the `+=` operator to add `Your [weapon] breaks.` to the end of `text.innerText`, replacing `weapon` with the last item in the `inventory` array. You can get this last item by using `inventory.pop()`, which will remove the last item in the array AND return it so it appears in your string.
 
 # --hints--
 
@@ -30,14 +30,14 @@ You should add the string " Your " to `text.innerText`. Remember that spacing ma
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1/);
 ```
 
-You should add the return value of `inventory.pop()` to the ` Your ` string.
+You should add the return value of `inventory.pop()` to the `Your` string.
 
 ```js
 console.log(attack.toString());
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1\s*\+\s*inventory\.pop\(\)/);
 ```
 
-You should add ` breaks.` to the ` "Your " + inventory.pop()` string.
+You should add `breaks.` to the `"Your " + inventory.pop()` string.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1\s*\+\s*inventory\.pop\(\)\s*\+\s*('|")\sbreaks\.\2/);
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
index b043a04a1a5..bb3a88b2824 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
@@ -375,7 +375,7 @@ function pickEight() {
 --fcc-editable-region--
 function pick(guess) {
   let numbers = [];
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
index ac85513b88f..c0e732491ac 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
@@ -11,13 +11,13 @@ After the `while` loop, set `text.innerText` to equal `You picked [guess]. Here
 
 # --hints--
 
-You should set `text.innerText` to the string `You picked `. Remember that spacing matters.
+You should set `text.innerText` to the string `You picked`. Remember that spacing matters.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1/);
 ```
 
-You should use the concatenation operator to add the value of the `guess` parameter to your `You picked ` string.
+You should use the concatenation operator to add the value of the `guess` parameter to your `You picked` string.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1\s*\+\s*guess/);
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
index 3b20e162326..7b34447692f 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
@@ -11,7 +11,7 @@ Before the final quote in that string you added, insert the new line escape char
 
 # --hints--
 
-You should add the new line escape character `\n` to your `. Here are the random numbers: ` string.
+You should add the new line escape character `\n` to your `. Here are the random numbers:` string.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1\s*\+\s*guess\s*\+\s*('|")\.\sHere are the random numbers:\\n\2/);
diff --git a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
index 180270940d6..c57f4d75914 100644
--- a/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
+++ b/curriculum/challenges/german/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
@@ -369,7 +369,7 @@ function pick(guess) {
     numbers.push(Math.floor(Math.random() * 11));
   }
   text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
index ad30fcc1a9a..6ee9a452890 100644
--- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
+++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
@@ -37,12 +37,6 @@ assert(code.match(/quotient/g).length === 1);
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function(y){return 'quotient = '+y;})(quotient);
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
index 17aad98a65f..aad2a12587d 100644
--- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
+++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
@@ -11,12 +11,12 @@ dashedName: escape-sequences-in-strings
 
 Le virgolette non sono gli unici caratteri dei quali si può fare l'<dfn>escaping</dfn> all'interno di una stringa. Ci sono due motivi per usare i caratteri di escaping:
 
-1.  Per permetterti di utilizzare caratteri che potresti non essere altrimenti in grado di digitare, come ad esempio un ritorno a capo.
+1.  Per permetterti di utilizzare caratteri che potresti non essere altrimenti in grado di digitare, come ad esempio un carattere nuova riga.
 2.  Per permetterti di rappresentare più virgolette in una stringa senza JavaScript interpretare erroneamente ciò che intendi.
 
 Lo abbiamo imparato nella sfida precedente.
 
-<table class='table table-striped'><thead><tr><th>Codice</th><th>Output</th></tr></thead><tbody><tr><td><code>\'</code></td><td>virgoletta singola</td></tr><tr><td><code>\"</code></td><td>doppia citazione</td></tr><tr><td><code>\\</code></td><td>barra rovesciata</td></tr><tr><td><code>\n</code></td><td>nuova riga</td></tr><tr><td><code>\r</code></td><td>ritorno a capo</td></tr><tr><td><code>\t</code></td><td>tabulazione</td></tr><tr><td><code>\b</code></td><td>delimitatore di parola</td></tr><tr><td><code>\f</code></td><td>avanzamento carta (form feed)</td></tr></tbody></table>
+<table class='table table-striped'><thead><tr><th>Codice</th><th>Output</th></tr></thead><tbody><tr><td><code>\'</code></td><td>virgoletta singola</td></tr><tr><td><code>\"</code></td><td>doppia citazione</td></tr><tr><td><code>\\</code></td><td>barra rovesciata</td></tr><tr><td><code>\n</code></td><td>nuova riga</td></tr><tr><td><code>\t</code></td><td>tabulazione</td></tr><tr><td><code>\r</code></td><td>ritorno a capo</td></tr><tr><td><code>\b</code></td><td>delimitatore di parola</td></tr><tr><td><code>\f</code></td><td>avanzamento carta (form feed)</td></tr></tbody></table>
 
 *Nota che la barra rovesciata necessita di escaping perché appaia come barra rovesciata.*
 
@@ -78,14 +78,6 @@ assert(myStr === 'FirstLine\n\t\\SecondLine\nThirdLine');
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function(){
-if (myStr !== undefined){
-console.log('myStr:\n' + myStr);}})();
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
index 82b82af53ea..35dcb3eb114 100644
--- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
+++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
@@ -31,12 +31,6 @@ assert(/var\s+a\s*=\s*9(\s*;?\s*)$/.test(code));
 
 # --seed--
 
-## --after-user-code--
-
-```js
-if(typeof a !== 'undefined') {(function(a){return "a = " + a;})(a);} else { (function() {return 'a is undefined';})(); }
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
index 5f9caec414f..77eec1bd905 100644
--- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
+++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
@@ -62,12 +62,6 @@ assert(code.match(/"/g).length === 4 && code.match(/'/g).length === 2);
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function() { return "myStr = " + myStr; })();
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
index 7bd4639e975..e9c70f7f275 100644
--- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
+++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
@@ -98,7 +98,7 @@ function nextInLine(arr, item) {
 }
 
 // Setup
-const testArr = [1, 2, 3, 4, 5];
+let testArr = [1, 2, 3, 4, 5];
 
 // Display code
 console.log("Before: " + JSON.stringify(testArr));
@@ -109,7 +109,7 @@ console.log("After: " + JSON.stringify(testArr));
 # --solutions--
 
 ```js
-const testArr = [1, 2, 3, 4, 5];
+let testArr = [1, 2, 3, 4, 5];
 
 function nextInLine(arr, item) {
     arr.push(item);
diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
index 282a75b773a..dd1c2796c0a 100644
--- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
+++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
@@ -71,6 +71,13 @@ assert(
 );
 ```
 
+Le variabili globali non dovrebbero essere usate per memorizzare l'array.
+
+```js
+countdown(1)
+assert.deepStrictEqual(countdown(5), [5, 4, 3, 2, 1]);
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
index 11cfe957417..1e51a4efc07 100644
--- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
+++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
@@ -56,6 +56,13 @@ assert.deepStrictEqual(rangeOfNumbers(6, 9), [6, 7, 8, 9]);
 assert.deepStrictEqual(rangeOfNumbers(4, 4), [4]);
 ```
 
+Le variabili globali non dovrebbero essere usate per memorizzare l'array.
+
+```js
+rangeOfNumbers(1, 3)
+assert.deepStrictEqual(rangeOfNumbers(6, 9), [6, 7, 8, 9]);
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/es6/complete-a-promise-with-resolve-and-reject.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/es6/complete-a-promise-with-resolve-and-reject.md
index 889b752a55c..017515e93e2 100644
--- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/es6/complete-a-promise-with-resolve-and-reject.md
+++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/es6/complete-a-promise-with-resolve-and-reject.md
@@ -20,7 +20,7 @@ const myPromise = new Promise((resolve, reject) => {
 });
 ```
 
-L'esempio di cui sopra utilizza stringhe come argomento di queste funzioni, ma essi possono davvero essere qualsiasi cosa. Spesso potrebbe essere un oggetto, di cui potresti voler utilizzare i dati per metterli sul tuo sito web o altrove.
+L'esempio qui sopra utilizza stringhe come argomento di queste funzioni, ma può essere utilizzata davvero qualsiasi cosa. Spesso potrebbe essere un oggetto, di cui potresti voler utilizzare i dati per metterli sul tuo sito web o altrove.
 
 # --instructions--
 
diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/es6/create-a-module-script.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/es6/create-a-module-script.md
index 319417afeb1..282e75c14ef 100644
--- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/es6/create-a-module-script.md
+++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/es6/create-a-module-script.md
@@ -8,7 +8,7 @@ dashedName: create-a-module-script
 
 # --description--
 
-JavaScript ha iniziato con un piccolo ruolo da giocare in un web fatto per lo di HTML. Oggi è enorme, e alcuni siti web sono costruiti quasi interamente con JavaScript. Per rendere JavaScript più modulare, pulito e mantenibile; ES6 ha introdotto un modo per condividere facilmente il codice tra i file JavaScript. Ciò comporta l'esportazione di parti di un file per l'utilizzo in uno o più altri file, e l'importazione delle parti di cui hai bisogno, dove ne hai bisogno. Per sfruttare questa funzionalità, devi creare uno script nel tuo documento HTML con un `type` di `module`. Ecco un esempio:
+JavaScript ha iniziato con un piccolo ruolo da giocare in un web fatto per lo più di HTML. Oggi è enorme, e alcuni siti web sono costruiti quasi interamente con JavaScript. Per rendere JavaScript più modulare, pulito e mantenibile; ES6 ha introdotto un modo per condividere facilmente il codice tra i file JavaScript. Ciò comporta l'esportazione di parti di un file per l'utilizzo in uno o più altri file, e l'importazione delle parti di cui hai bisogno, dove ne hai bisogno. Per sfruttare questa funzionalità, devi creare uno script nel tuo documento HTML con un `type` di `module`. Ecco un esempio:
 
 ```html
 <script type="module" src="filename.js"></script>
diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
index 7d1b3ede7aa..c959cb756c6 100644
--- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
+++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
@@ -12,24 +12,35 @@ ES6 fornisce una nuova sintassi per creare oggetti, utilizzando la parola chiave
 
 Va notato che la sintassi `class` è appunto solo una sintassi, e non la vera e propria implementazione basata su classi di un paradigma orientato agli oggetti, a differenza di quanto accade in linguaggi come Java, Python, Ruby, ecc.
 
-In ES5, di solito definiamo una funzione `constructor` e usiamo la parola chiave `new` per istanziare un oggetto.
-
-```js
-var SpaceShuttle = function(targetPlanet){
-  this.targetPlanet = targetPlanet;
-}
-var zeus = new SpaceShuttle('Jupiter');
-```
-
-La sintassi `class` sostituisce semplicemente la creazione della funzione `constructor`:
+In ES5, un oggetto può essere creato definendo una funzione `constructor` e usando la parola chiave `new` per istanziare l'oggetto.
+
+In ES6, una dichiarazione `class` possiede un metodo `constructor` che viene invocato con la parola chiave `new`. Se il metodo `constructor` non viene esplicitamente definito, allora è definito implicitamente senza argomenti.
 
 ```js
+// Explicit constructor
 class SpaceShuttle {
   constructor(targetPlanet) {
     this.targetPlanet = targetPlanet;
   }
+  takeOff() {
+    console.log("To " + this.targetPlanet + "!");
+  }
 }
+
+// Implicit constructor 
+class Rocket {
+  launch() {
+    console.log("To the moon!");
+  }
+}
+
 const zeus = new SpaceShuttle('Jupiter');
+// prints To Jupiter! in console
+zeus.takeOff();
+
+const atlas = new Rocket();
+// prints To the moon! in console
+atlas.launch();
 ```
 
 Va notato che la parola chiave `class` dichiara una nuova funzione, alla quale viene aggiunto un costruttore. Questo costruttore viene invocato quando `new` viene chiamata per creare un nuovo oggetto.
diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
index c5246309a1f..a077c117239 100644
--- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
+++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
@@ -8,7 +8,7 @@ dashedName: write-concise-declarative-functions-with-es6
 
 # --description--
 
-Quando si definiscono le funzioni all'interno degli oggetti in ES5, dobbiamo usare la parola chiave `function` come segue:
+Quando si definiscono le funzioni all'interno degli oggetti in ES5, occorre usare la parola chiave `function` come segue:
 
 ```js
 const person = {
@@ -53,7 +53,8 @@ assert(
 `bicycle.setGear(48)` dovrebbe cambiare il valore della marcia (`gear`) a 48.
 
 ```js
-assert(new bicycle.setGear(48).gear === 48);
+bicycle.setGear(48);
+assert(bicycle.gear === 48);
 ```
 
 # --seed--
diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
index 25f32aa27c4..a95c7d21f4b 100644
--- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
+++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
@@ -137,14 +137,6 @@ assert.strictEqual(
 
 # --seed--
 
-## --after-user-code--
-
-```js
-if(bob){
-  bob = new Person("Bob Ross");
-}
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
index 30f9a0384c0..8b6e11957bb 100644
--- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
+++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
@@ -42,6 +42,13 @@ La tua soluzione non dovrebbe utilizzare i metodi `Array.prototype.flat()` o `Ar
 assert(!code.match(/\.\s*flat\s*\(/) && !code.match(/\.\s*flatMap\s*\(/));
 ```
 
+Le variabili globali non dovrebbero essere utilizzate.
+
+```js
+steamrollArray([1, {}, [3, [[4]]]])
+assert.deepEqual(steamrollArray([1, {}, [3, [[4]]]]), [1, {}, 3, 4])
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
index 9f2212cacd0..bac1aef0bb9 100644
--- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
+++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
@@ -47,28 +47,48 @@ sumPrimes(10);
 # --solutions--
 
 ```js
-function eratosthenesArray(n) {
-    var primes = [];
-    if (n > 2) {
-        var half = n>>1;
-        var sieve = Array(half);
-        for (var i = 1, limit = Math.sqrt(n)>>1; i <= limit; i++) {
-            if (!sieve[i]) {
-                for (var step = 2*i+1, j = (step*step)>>1; j < half; j+=step) {
-                    sieve[j] = true;
-                }
-            }
-        }
-        primes.push(2);
-        for (var p = 1; p < half; p++) {
-            if (!sieve[p]) primes.push(2*p+1);
+class PrimeSeive {
+  constructor(num) {
+    const seive = Array(Math.floor((num - 1) / 2)).fill(true);
+    const upper = Math.floor((num - 1) / 2);
+    const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+
+    for (let i = 0; i <= sqrtUpper; i++) {
+      if (seive[i]) {
+        // Mark value in seive array
+        const prime = 2 * i + 3;
+        // Mark all multiples of this number as false (not prime)
+        const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+        for (let j = primeSqaredIndex; j < upper; j += prime) {
+          seive[j] = false;
         }
+      }
     }
-    return primes;
-}
+
+    this._seive = seive;
+  }
+
+  isPrime(num) {
+    return num === 2
+      ? true
+      : num % 2 === 0
+        ? false
+        : this.isOddPrime(num);
+  }
+
+  isOddPrime(num) {
+    return this._seive[(num - 3) / 2];
+  }
+};
 
 function sumPrimes(num) {
-  return eratosthenesArray(num+1).reduce(function(a,b) {return a+b;}, 0);
+  const primeSeive = new PrimeSeive(num);
+
+  let sum = 2;
+  for (let i = 3; i <= num; i += 2) {
+    if (primeSeive.isOddPrime(i)) sum += i;
+  }
+  return sum;
 }
 
 sumPrimes(10);
diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
index ddf91d86e1d..c9ac7823023 100644
--- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
+++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
@@ -79,23 +79,55 @@ assert(beagle.constructor === Dog);
 `beagle.eat()` dovrebbe visualizzare nella console la stringa `nom nom nom`
 
 ```js
-console.log = function (msg) {
-  throw msg;
-};
-assert.throws(() => beagle.eat(), 'nom nom nom');
+capture();
+beagle.eat();
+uncapture();
+assert(logOutput == 'nom nom nom');
 ```
 
 `beagle.bark()` dovrebbe visualizzare nella console la stringa `Woof!`
 
 ```js
-console.log = function (msg) {
-  throw msg;
-};
-assert.throws(() => beagle.bark(), 'Woof!');
+capture();
+beagle.bark();
+uncapture();
+assert(logOutput == 'Woof!');
 ```
 
 # --seed--
 
+## --before-user-code--
+
+```js
+var logOutput = "";
+var originalConsole = console
+function capture() {
+    var nativeLog = console.log;
+    console.log = function (message) {
+        logOutput = message;
+        if(nativeLog.apply) {
+          nativeLog.apply(originalConsole, arguments);
+        } else {
+          var nativeMsg = Array.prototype.slice.apply(arguments).join(' ');
+          nativeLog(nativeMsg);
+        }
+    };
+}
+
+function uncapture() {
+  console.log = originalConsole.log;
+}
+
+capture();
+```
+
+## --after-user-code--
+
+```js
+uncapture();
+(function() { return logOutput || "console.log never called"; })();
+```
+
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/regular-expressions/match-characters-that-occur-one-or-more-times.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/regular-expressions/match-characters-that-occur-one-or-more-times.md
index 5822eedb7d5..86a40ae2073 100644
--- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/regular-expressions/match-characters-that-occur-one-or-more-times.md
+++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/regular-expressions/match-characters-that-occur-one-or-more-times.md
@@ -8,9 +8,9 @@ dashedName: match-characters-that-occur-one-or-more-times
 
 # --description--
 
-A volte, è necessario riconoscere un carattere (o un gruppo di caratteri) che appare una o più volte in una riga. Questo significa che esso comprare almeno una volta, e può essere ripetuto.
+A volte, è necessario riconoscere un carattere (o un gruppo di caratteri) che appare una o più volte in una riga. Questo significa che esso compare almeno una volta, e può essere ripetuto.
 
-Puoi usare il carattere `+` per verificare se è così. Ricorda, il carattere o il pattern deve essere presente consecutivamente. Cioè, il carattere deve ripetersi uno dopo l'altro.
+Puoi usare il carattere `+` per verificare se è così. Ricorda, il carattere o il pattern deve essere presente consecutivamente. Cioè, i caratteri ripetuti devono essere adiacenti.
 
 Ad esempio, `/a+/g` troverà una corrispondenza in `abc` e restituirà `["a"]`. A causa del `+`, troverà anche una singola corrispondenza in `aabc` e restituirà `["aa"]`.
 
diff --git a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/regular-expressions/match-characters-that-occur-zero-or-more-times.md b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/regular-expressions/match-characters-that-occur-zero-or-more-times.md
index bd55a9c407c..999fb207c24 100644
--- a/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/regular-expressions/match-characters-that-occur-zero-or-more-times.md
+++ b/curriculum/challenges/italian/02-javascript-algorithms-and-data-structures/regular-expressions/match-characters-that-occur-zero-or-more-times.md
@@ -8,7 +8,7 @@ dashedName: match-characters-that-occur-zero-or-more-times
 
 # --description--
 
-L'ultima sfida ha usato il segno più `+` per cercare caratteri che compaiono una o più volte. C'è anche un'opzione che riconosce i caratteri che si verificano zero o più volte.
+L'ultima sfida ha usato il segno più `+` per cercare caratteri che compaiono una o più volte. C'è anche un'opzione che riconosce i caratteri che sono presenti zero o più volte.
 
 Il simbolo per farlo è l'asterisco: `*`.
 
diff --git a/curriculum/challenges/italian/03-front-end-development-libraries/bootstrap/responsively-style-radio-buttons.md b/curriculum/challenges/italian/03-front-end-development-libraries/bootstrap/responsively-style-radio-buttons.md
index 9ef554d35e4..0f1f25aeeea 100644
--- a/curriculum/challenges/italian/03-front-end-development-libraries/bootstrap/responsively-style-radio-buttons.md
+++ b/curriculum/challenges/italian/03-front-end-development-libraries/bootstrap/responsively-style-radio-buttons.md
@@ -1,6 +1,6 @@
 ---
 id: bad87fee1348bd9aedb08845
-title: Stilizzare responsivamente i pulsanti di opzione
+title: Definire responsivamente lo stile dei pulsanti di opzione
 challengeType: 0
 forumTopicId: 18270
 required:
diff --git a/curriculum/challenges/italian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md b/curriculum/challenges/italian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
index 816bb76ddec..c65ebfa0e25 100644
--- a/curriculum/challenges/italian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
+++ b/curriculum/challenges/italian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
@@ -8,7 +8,7 @@ dashedName: build-a-25--5-clock
 
 # --description--
 
-**Obiettivo:** crea un'app funzionalmente simile a questa: <a href="https://codepen.io/freeCodeCamp/full/XpKrrW" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/XpKrrW</a>.
+**Obiettivo:** crea un'app funzionalmente simile a: <a href="https://25--5-clock.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://25--5-clock.freecodecamp.rocks</a>.
 
 Soddisfa le user story qui sotto e supera tutti i test. Utilizza le librerie o le API di cui hai bisogno. Usa il tuo stile personale.
 
diff --git a/curriculum/challenges/italian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md b/curriculum/challenges/italian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
index 4f2ba24beda..c30d0bf197d 100644
--- a/curriculum/challenges/italian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
+++ b/curriculum/challenges/italian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
@@ -8,7 +8,7 @@ dashedName: build-a-drum-machine
 
 # --description--
 
-**Obiettivo:** crea un'app funzionalmente simile a questa: <a href="https://codepen.io/freeCodeCamp/full/MJyNMd" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/MJyNMd</a>.
+**Obiettivo:** crea un'app funzionalmente simile a: <a href="https://drum-machine.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://drum-machine.freecodecamp.rocks/</a>.
 
 Soddisfa le user story qui sotto e supera tutti i test. Utilizza le librerie o le API di cui hai bisogno. Usa il tuo stile personale.
 
diff --git a/curriculum/challenges/italian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md b/curriculum/challenges/italian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
index 970a259d4da..30df9a5a355 100644
--- a/curriculum/challenges/italian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
+++ b/curriculum/challenges/italian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
@@ -8,7 +8,7 @@ dashedName: build-a-javascript-calculator
 
 # --description--
 
-**Obiettivo:** crea un'app funzionalmente simile a questa: <a href="https://codepen.io/freeCodeCamp/full/wgGVVX" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/wgGVVX</a>.
+**Obiettivo:** crea un'app funzionalmente simile a: <a href="https://javascript-calculator.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://javascript-calculator.freecodecamp.rocks/</a>.
 
 Soddisfa le user story qui sotto e supera tutti i test. Utilizza le librerie o le API di cui hai bisogno. Usa il tuo stile personale.
 
diff --git a/curriculum/challenges/italian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md b/curriculum/challenges/italian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
index ff163331072..ef37214783a 100644
--- a/curriculum/challenges/italian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
+++ b/curriculum/challenges/italian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
@@ -8,7 +8,7 @@ dashedName: build-a-markdown-previewer
 
 # --description--
 
-**Obiettivo:** crea un'app funzionalmente simile a questa: <a href="https://codepen.io/freeCodeCamp/full/GrZVVO" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/GrZVVO</a>.
+**Obiettivo:** crea un'app funzionalmente simile a: <a href="https://markdown-previewer.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://markdown-previewer.freecodecamp.rocks/</a>.
 
 Soddisfa le user story qui sotto e supera tutti i test. Utilizza le librerie o le API di cui hai bisogno. Usa il tuo stile personale.
 
diff --git a/curriculum/challenges/italian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md b/curriculum/challenges/italian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
index 6d417289053..b52590cbf0e 100644
--- a/curriculum/challenges/italian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
+++ b/curriculum/challenges/italian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
@@ -8,7 +8,7 @@ dashedName: build-a-random-quote-machine
 
 # --description--
 
-**Obiettivo:** crea un'app funzionalmente simile a questa: <a href="https://codepen.io/freeCodeCamp/full/qRZeGZ" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/qRZeGZ</a>.
+**Obiettivo:** crea un'app funzionalmente simile a: <a href="https://random-quote-machine.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://random-quote-machine.freecodecamp.rocks/</a>.
 
 Soddisfa le user story qui sotto e supera tutti i test. Utilizza le librerie o le API di cui hai bisogno. Usa il tuo stile personale.
 
diff --git a/curriculum/challenges/italian/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md b/curriculum/challenges/italian/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md
index a9eaf0c60b7..04431694ac0 100644
--- a/curriculum/challenges/italian/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md
+++ b/curriculum/challenges/italian/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md
@@ -10,7 +10,7 @@ dashedName: create-a-model
 
 **C**RUD Parte I - CREATE
 
-Innanzi tutto abbiamo bisogno di uno Schema. Ogni schema mappa a una collezione MongoDB. Definisce la forma dei documenti all'interno di quella collezione. Gli schemi sono elementi costitutivi dei modelli. Possono essere annidati per creare modelli complessi, ma per ora terremo le cose semplici. Un modello ti permette di creare istanze dei tuoi oggetti, chiamate documenti.
+Innanzitutto abbiamo bisogno di uno Schema. Ogni schema mappa a una collezione MongoDB. Definisce la forma dei documenti all'interno di quella collezione. Gli schemi sono elementi costitutivi dei modelli. Possono essere annidati per creare modelli complessi, ma per ora terremo le cose semplici. Un modello ti permette di creare istanze dei tuoi oggetti, chiamate documenti.
 
 Replit è un vero server, e nei server reali le interazioni con il database avvengono nelle funzioni del gestore. Queste funzioni vengono eseguite quando si verifica qualche evento (ad esempio, qualcuno raggiunge un endpoint sulla tua API). Seguiremo lo stesso approccio in questi esercizi. La funzione `done()` è una callback che ci dice che possiamo procedere dopo aver completato un'operazione asincrona come l'inserimento, la ricerca, l'aggiornamento o la cancellazione. Segue la convenzione Node e dovrebbe essere chiamata come `done(null, data)` in caso di successo, o `done(err)` in caso di errore.
 
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
index e2078d21f6a..0a427b60e04 100644
--- a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
@@ -60,32 +60,46 @@ primeSummation(2000000);
 # --solutions--
 
 ```js
-const NUM_PRIMES = 2000000;
-const PRIME_SEIVE = Array(Math.floor((NUM_PRIMES-1)/2)).fill(true);
-(function initPrimes(num) {
-  const upper = Math.floor((num - 1) / 2);
-  const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
-  for (let i = 0; i <= sqrtUpper; i++) {
-    if (PRIME_SEIVE[i]) {
-      // Mark value in PRIMES array
-      const prime = 2 * i + 3;
-      // Mark all multiples of this number as false (not prime)
-      const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
-      for (let j = primeSqaredIndex; j < upper; j += prime) {
-        PRIME_SEIVE[j] = false;
+class PrimeSeive {
+  constructor(num) {
+    const seive = Array(Math.floor((num - 1) / 2)).fill(true);
+    const upper = Math.floor((num - 1) / 2);
+    const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+
+    for (let i = 0; i <= sqrtUpper; i++) {
+      if (seive[i]) {
+        // Mark value in seive array
+        const prime = 2 * i + 3;
+        // Mark all multiples of this number as false (not prime)
+        const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+        for (let j = primeSqaredIndex; j < upper; j += prime) {
+          seive[j] = false;
+        }
       }
     }
+
+    this._seive = seive;
   }
-})(NUM_PRIMES);
 
-function isOddNumberPrime(num) {
-  return PRIME_SEIVE[(num - 3) / 2];
-}
+  isPrime(num) {
+    return num === 2
+      ? true
+      : num % 2 === 0
+        ? false
+        : this.isOddPrime(num);
+  }
+
+  isOddPrime(num) {
+    return this._seive[(num - 3) / 2];
+  }
+};
+
+function primeSummation(num) {
+  const primeSeive = new PrimeSeive(num);
 
-function primeSummation(n) {
   let sum = 2;
-  for (let i = 3; i < n; i += 2) {
-    if (isOddNumberPrime(i)) sum += i;
+  for (let i = 3; i < num; i += 2) {
+    if (primeSeive.isOddPrime(i)) sum += i;
   }
   return sum;
 }
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
index e3131f04c4f..3df62c03488 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
@@ -9,7 +9,7 @@ dashedName: step-56
 
 Per allineare le caselle di `input` tra loro, imposta la proprietà `display` su `inline-block` per tutti gli elementi `input` e `label` all'interno degli elementi `.info`.
 
-Inoltre, allinea il testo a destra.
+Inoltre allinea il testo dell'elemento `label` sulla destra.
 
 # --hints--
 
@@ -28,22 +28,14 @@ const display = gs('.info > label, .info > input') ?? gs('.info label, .info inp
 assert.equal(display, 'inline-block');
 ```
 
-Dovresti dare agli elementi `input` e `label` una proprietà `text-align` con il valore `right`.
+Dovresti dare all'elemento `label` una proprietà `text-align` con il valore `right`.
 
 ```js
 const gs = (s) => new __helpers.CSSHelp(document).getStyle(s)?.textAlign;
-const textAlign = gs('.info > label, .info > input') ?? gs('.info label, .info input') ?? gs('.info > input, .info > label') ?? gs('.info input, .info label');
+const textAlign = gs('.info > label') ?? gs('.info label');
 assert.equal(textAlign, 'right');
 ```
 
-Dovresti impostare la proprietà `text-align: right` prima della regola `.info input`.
-
-```js
-const gs = (s) => new __helpers.CSSHelp(document).getStyleRule(s);
-assert(gs('.info input').isDeclaredAfter('.info label, .info input') || gs('.info input').isDeclaredAfter('.info > label, .info > input') || gs('.info input').isDeclaredAfter('.info > input, .info > label') || gs('.info input').isDeclaredAfter('.info input, .info label'));
-
-```
-
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
index f9b23d3d29c..32b0f76f632 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
@@ -286,7 +286,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -297,6 +296,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 --fcc-editable-region--
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
index aa495752894..b05afef5a17 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
@@ -272,7 +272,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -283,6 +282,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
index 4d69c4026eb..1f860639bcd 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
@@ -262,7 +262,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -273,6 +272,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
index 250cfc0c187..5e1f17aab9b 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
@@ -260,7 +260,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -271,6 +270,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
index e6d4de4ea57..3547319dec9 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
@@ -300,7 +300,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -311,6 +310,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
index 4dbba2a2fe0..9552da20a98 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
@@ -266,7 +266,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -277,6 +276,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
index 5917239db14..8cd6346b195 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
@@ -280,7 +280,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -291,6 +290,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
index 3cc27e4786e..6890046503b 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
@@ -278,7 +278,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -289,6 +288,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
index 9618cb9ced6..2e8cebb73c2 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
@@ -260,7 +260,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -271,6 +270,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
index 3818a03386a..f40a76a1dd1 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
@@ -278,7 +278,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -289,6 +288,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
index 5ba7c7342d1..854ca17572c 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
@@ -280,7 +280,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -291,6 +290,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
@@ -603,12 +603,12 @@ input {
 .info label,
 .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .info input {
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
index e70998597cf..f89cfcee795 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
@@ -7,38 +7,33 @@ dashedName: step-5
 
 # --description--
 
-Il nome del bar è `CAMPER CAFE`. Aggiungi un elemento `h1` all'interno dell'elemento `body`. Dagli il nome del bar in lettere maiuscole per farlo risaltare.
+È ora di aggiungere qualche contenuto al menu. Aggiungi un elemento `main` all'interno dell'elemento `body` esistente. Alla fine conterrà delle informazioni sui prezzi del caffè e dei dessert offerti dal bar.
 
 # --hints--
 
-Dovresti avere un tag di apertura `<h1>`.
+Il codice dovrebbe avere un tag di apertura `<main>`.
 
 ```js
-assert(code.match(/<h1>/i));
+assert(code.match(/<main>/i));
 ```
 
-Dovresti avere un tag di chiusura `</h1>`.
+Il codice dovrebbe avere un tag di chiusura `</main>`.
 
 ```js
-assert(code.match(/<\/h1>/i));
+assert(code.match(/<\/main>/i));
 ```
 
-Non dovresti cambiare l'elemento `body` esistente.
+Non dovresti cambiare l'elemento `body`. Assicurati di non aver eliminato accidentalmente il tag di chiusura.
 
 ```js
 assert($('body').length === 1);
 ```
 
-L'elemento `h1` dovrebbe essere annidato nell'elemento `body`.
+Il tag `main` dovrebbe essere all'interno del tag `body`.
 
 ```js
-assert($('h1')[0].parentElement.tagName === "BODY");
-```
-
-L'elemento `h1` dovrebbe avere il testo `CAMPER CAFE`.
-
-```js
-assert(code.match(/<h1>CAMPER CAFE<\/h1>/));
+const main = document.querySelector('main');
+assert(main.parentElement.tagName === 'BODY');
 ```
 
 # --seed--
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
index 516f72cf3f1..cd432605707 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
@@ -7,38 +7,38 @@ dashedName: step-6
 
 # --description--
 
-Per far sapere ai visitatori che il bar è stato fondato nel 2020, aggiungi un elemento `p` sotto l'elemento `h1` con il testo `Est. 2020`.
+Il nome del bar è `CAMPER CAFE`. Aggiungi un elemento `h1` all'interno dell'elemento `main`. Dagli il nome del bar in lettere maiuscole per farlo risaltare.
 
 # --hints--
 
-Dovresti avere un tag di apertura `<p>`.
+Dovresti avere un tag di apertura `<h1>`.
 
 ```js
-assert(code.match(/<p>/i));
+assert(code.match(/<h1>/i));
 ```
 
-Dovresti avere un tag di chiusura `</p>`.
+Dovresti avere un tag di chiusura `</h1>`.
 
 ```js
-assert(code.match(/<\/p>/i));
+assert(code.match(/<\/h1>/i));
 ```
 
-Non dovresti modificare l'elemento `h1` già esistente. Assicurati di non aver eliminato il tag di chiusura.
+Non dovresti cambiare l'elemento `main` esistente.
 
 ```js
-assert($('h1').length === 1);
+assert($('main').length === 1);
 ```
 
-L'elemento `p` dovrebbe trovarsi sotto l'elemento `h1`.
+L'elemento `h1` dovrebbe essere annidato nell'elemento `main`.
 
 ```js
-assert($('p')[0].previousElementSibling.tagName === 'H1');
+assert($('h1')[0].parentElement.tagName === "MAIN");
 ```
 
-L'elemento `p` dovrebbe avere il testo `Est. 2020`.
+L'elemento `h1` dovrebbe avere il testo `CAMPER CAFE`.
 
 ```js
-assert(document.querySelector("p").innerText === "Est. 2020");
+assert(code.match(/<h1>CAMPER CAFE<\/h1>/));
 ```
 
 # --seed--
@@ -54,7 +54,8 @@ assert(document.querySelector("p").innerText === "Est. 2020");
   </head>
   <body>
 --fcc-editable-region--
-    <h1>CAMPER CAFE</h1>
+    <main>
+    </main>
 --fcc-editable-region--
   </body>
 </html>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
index 90a5690058a..7c734435b68 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
@@ -7,34 +7,38 @@ dashedName: step-7
 
 # --description--
 
-Dato che l'elemento `p` aggiunto nel passaggio precedente fornisce informazioni supplementari sul bar, annida entrambi gli elementi `h1` e `p` in un elemento `header`.
+To let visitors know the cafe was founded in 2020, add a `p` element below the `h1` element with the text `Est. 2020`.
 
 # --hints--
 
-Dovresti avere un tag di apertura `<header>`.
+Dovresti avere un tag di apertura `<p>`.
 
 ```js
-assert(code.match(/<header>/i));
+assert(code.match(/<p>/i));
 ```
 
-Dovresti avere un tag di chiusura `</header>`.
+Dovresti avere un tag di chiusura `</p>`.
 
 ```js
-assert(code.match(/<\/header>/i));
+assert(code.match(/<\/p>/i));
 ```
 
-L'elemento `h1` dovrebbe essere annidato nell'elemento `header`.
+Non dovresti modificare l'elemento `h1` già esistente. Assicurati di non aver eliminato il tag di chiusura.
 
 ```js
-const header = document.querySelectorAll('header')[0];
-assert(header.children[0].tagName === 'H1');
+assert($('h1').length === 1);
 ```
 
-L'elemento `p` dovrebbe essere annidato nell'elemento `header`.
+L'elemento `p` dovrebbe trovarsi sotto l'elemento `h1`.
 
 ```js
-const header = document.querySelectorAll('header')[0];
-assert(header.children[1].tagName === "P");
+assert($('p')[0].previousElementSibling.tagName === 'H1');
+```
+
+Your `p` element should have the text `Est. 2020`.
+
+```js
+assert(document.querySelector("p").innerText === "Est. 2020");
 ```
 
 # --seed--
@@ -49,10 +53,11 @@ assert(header.children[1].tagName === "P");
     <title>Cafe Menu</title>
   </head>
   <body>
+    <main>
 --fcc-editable-region--
-    <h1>CAMPER CAFE</h1>
-    <p>Est. 2020</p>
+      <h1>CAMPER CAFE</h1>
 --fcc-editable-region--
+    </main>
   </body>
 </html>
 ```
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md
index 9e0293e89a3..93650655625 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344f9c805cd193c33d829c
-title: Step 12
+title: Step 11
 challengeType: 0
-dashedName: step-12
+dashedName: step-11
 ---
 
 # --description--
@@ -56,11 +56,9 @@ assert(h1TextAlign === 'center');
 --fcc-editable-region--
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md
index f0f541887df..560636494f5 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fad8bf01691e71a30eb
-title: Step 11
+title: Step 10
 challengeType: 0
-dashedName: step-11
+dashedName: step-10
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(code.match(/<head\s*>[\w\W\s]*<style\s*>[\w\W\s]*<\/style\s*>[\w\W\s]*<\/
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md
index 9f6154c65f2..8ba76a441fa 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fbc22624a2976425065
-title: Step 10
+title: Step 9
 challengeType: 0
-dashedName: step-10
+dashedName: step-9
 ---
 
 # --description--
@@ -55,11 +55,9 @@ assert(h2.innerText === 'Coffee');
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
 --fcc-editable-region--
       <section>
       </section>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
index a41052ffce4..22f1913e2cb 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fc1520b6719f2e35605
-title: Step 9
+title: Step 8
 challengeType: 0
-dashedName: step-9
+dashedName: step-8
 ---
 
 # --description--
@@ -32,8 +32,9 @@ assert($('main').length === 1);
 L'elemento `section` dovrebbe essere all'interno dell'elemento `main`.
 
 ```js
-const main = document.querySelectorAll('main')?.[0];
-assert(main.children[0].tagName === 'SECTION');
+const main = document.querySelector('main');
+const section = document.querySelector('section');
+assert(section.parentElement === main);
 ```
 
 # --seed--
@@ -48,12 +49,10 @@ assert(main.children[0].tagName === 'SECTION');
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
-      <h1>CAMPER CAFE</h1>
-      <p>Est. 2020</p>
-    </header>
 --fcc-editable-region--
     <main>
+      <h1>CAMPER CAFE</h1>
+      <p>Est. 2020</p>
     </main>
 --fcc-editable-region--
   </body>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md
index 1a9cbe7718f..bd9b3089d33 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477ae34c1239cafe128be
-title: Step 14
+title: Step 13
 challengeType: 0
-dashedName: step-14
+dashedName: step-13
 ---
 
 # --description--
@@ -58,11 +58,9 @@ assert(selectors.length === 1);
 --fcc-editable-region--
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md
index ae05cfc2e4f..6c38a10aa5b 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477ae8466a9a3d2cc953c
-title: Step 16
+title: Step 15
 challengeType: 0
-dashedName: step-16
+dashedName: step-15
 ---
 
 # --description--
@@ -46,11 +46,9 @@ Non dovresti avere alcun selettore CSS nel file HTML.
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md
index 02a8aa84805..eb0b8598d4c 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md
@@ -1,13 +1,13 @@
 ---
 id: 5f3477ae9675db8bb7655b30
-title: Step 13
+title: Step 12
 challengeType: 0
-dashedName: step-13
+dashedName: step-12
 ---
 
 # --description--
 
-Nello step precedente, hai usato un <dfn>selettore di tipo</dfn> (type selector) per agire sullo stile dell'elemento `h1`. Centra gli elementi `h2` e `p` con un nuovo selettore di tipo per ciascuno.
+Nello step precedente, hai usato un <dfn>selettore di tipo</dfn> (type selector) per agire sullo stile dell'elemento `h1`. Centra gli elementi `h2` e `p` aggiungendo un nuovo selettore di tipo per ognuno degli elementi `style` esistenti.
 
 # --hints--
 
@@ -18,6 +18,13 @@ const hasH1 = new __helpers.CSSHelp(document).getStyle('h1');
 assert(hasH1);
 ```
 
+Non dovresti aggiungere un nuovo tag `style`. Aggiungi le nuove regole CSS al tag `style` esistente.
+
+```js
+const hasManyStyleTags = document.querySelectorAll('style').length > 1;
+assert(!hasManyStyleTags);
+```
+
 Dovresti aggiungere un nuovo selettore `h2`.
 
 ```js
@@ -32,7 +39,7 @@ const hasP = new __helpers.CSSHelp(document).getStyle('p');
 assert(hasP);
 ```
 
-L'elemento `h1` dovrebbero avere una proprietà `text-align` con valore `center`.
+L'elemento `h1` dovrebbe avere una proprietà `text-align` con valore `center`.
 
 ```js
 const h1TextAlign = new __helpers.CSSHelp(document).getStyle('h1')?.getPropertyValue('text-align');
@@ -72,11 +79,9 @@ assert(pTextAlign === 'center');
 --fcc-editable-region--
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
index 0a229ee6943..8deb2a0e107 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477aefa51bfc29327200b
-title: Step 15
+title: Step 14
 challengeType: 0
-dashedName: step-15
+dashedName: step-14
 ---
 
 # --description--
@@ -54,11 +54,9 @@ Il codice non dovrebbe contenere i tag `<style>`.
     </style>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md
index 062b1f9da83..5d7f7b70610 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477cb2e27333b1ab2b955
-title: Step 17
+title: Step 16
 challengeType: 0
-dashedName: step-17
+dashedName: step-16
 ---
 
 # --description--
@@ -68,11 +68,9 @@ assert(link.dataset.href == 'styles.css')
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md
index 248ccacad0b..a476adf4e89 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477cb303c5cb61b43aa9b
-title: Step 19
+title: Step 18
 challengeType: 0
-dashedName: step-19
+dashedName: step-18
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert(bodyBackground === 'brown');
     <link href="styles.css" rel="stylesheet"/>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md
index ac55e898dc1..74707d1a7e7 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477cbcb6ba47918c1da92
-title: Step 18
+title: Step 17
 challengeType: 0
-dashedName: step-18
+dashedName: step-17
 ---
 
 # --description--
@@ -52,11 +52,9 @@ assert(meta[0].outerHTML.match(/content=('|")width=device-width, initial-scale=1
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md
index d80f2d1e904..ef790bf0461 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md
@@ -1,8 +1,8 @@
 ---
 id: 5f34a1fd611d003edeafd681
-title: Step 20
+title: Step 19
 challengeType: 0
-dashedName: step-20
+dashedName: step-19
 ---
 
 # --description--
@@ -39,11 +39,9 @@ assert(bodyBackground === 'burlywood');
     <link href="styles.css" rel="stylesheet"/>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
index c4fb722de54..9367eea25be 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed60785e1f3e9850b6e
-title: Step 25
+title: Step 24
 challengeType: 0
-dashedName: step-25
+dashedName: step-24
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(!hasWidth);
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
index 73e74bf6f7f..ab55eae41ce 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
@@ -1,9 +1,9 @@
 ---
 id: 5f356ed60a5decd94ab66986
-title: Step 23
+title: Step 22
 challengeType: 0
 removeComments: false
-dashedName: step-23
+dashedName: step-22
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(bodyCSS === "rgba(0, 0, 0, 0)")
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
index 2bdf8f9a6de..0c93ad113a1 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed6199b0cdef1d2be8f
-title: Step 27
+title: Step 26
 challengeType: 0
-dashedName: step-27
+dashedName: step-26
 ---
 
 # --description--
@@ -48,11 +48,9 @@ assert(!hasDiv);
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
index 522c68c8f64..c4dfe548194 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed63c7807a4f1e6d054
-title: Step 22
+title: Step 21
 challengeType: 0
-dashedName: step-22
+dashedName: step-21
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(divWidth === '300px');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
index 7130e032f3a..1b508b35964 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed63e0fa262326eef05
-title: Step 24
+title: Step 23
 challengeType: 0
-dashedName: step-24
+dashedName: step-23
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(divBackground === 'burlywood');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
index b4a16927a34..dc3b0a00b40 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed656a336993abd9f7c
-title: Step 26
+title: Step 25
 challengeType: 0
-dashedName: step-26
+dashedName: step-25
 ---
 
 # --description--
@@ -49,11 +49,9 @@ assert(divMarginLeft === 'auto');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
index 3fd435ccc8f..533a84280cc 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed69db0a491745e2bb6
-title: Step 28
+title: Step 27
 challengeType: 0
-dashedName: step-28
+dashedName: step-27
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert($('div').attr('class').includes('menu'));
 --fcc-editable-region--
     <div>
 --fcc-editable-region--
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
index 6b8183b53c5..5b741151fd3 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed6cf6eab5f15f5cfe6
-title: Step 21
+title: Step 20
 challengeType: 0
-dashedName: step-21
+dashedName: step-20
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(div.parentElement.tagName === 'BODY');
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md
index 52b06fa9fdc..f97ddbf8bf5 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md
@@ -1,8 +1,8 @@
 ---
 id: 5f35e5c4321f818cdc4bed30
-title: Step 30
+title: Step 29
 challengeType: 0
-dashedName: step-30
+dashedName: step-29
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(article.previousElementSibling.tagName === 'H2');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
 --fcc-editable-region--
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md
index 43680dd43ef..fbb4f58ce5e 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f35e5c44359872a137bd98f
-title: Step 29
+title: Step 28
 challengeType: 0
-dashedName: step-29
+dashedName: step-28
 ---
 
 # --description--
@@ -55,11 +55,9 @@ assert(bodyBackground === `url("https://cdn.freecodecamp.org/curriculum/css-cafe
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
index b99ed3f41cb..909d81e5388 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d0fc037f7311b4ac8
-title: Step 39
+title: Step 38
 challengeType: 0
-dashedName: step-39
+dashedName: step-38
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(priceWidth === '50%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
index a6e67500517..a4c6255965a 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d28d7ad0de6470505
-title: Step 33
+title: Step 32
 challengeType: 0
-dashedName: step-33
+dashedName: step-32
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert($('.flavor')[0].innerText.match(/French Vanilla/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
index 3d209aa1240..2783b832e25 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d5414453fc2d7b480
-title: Step 32
+title: Step 31
 challengeType: 0
-dashedName: step-32
+dashedName: step-31
 ---
 
 # --description--
@@ -90,11 +90,9 @@ assert(children[1].innerText.match(/4\.50/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
 --fcc-editable-region--
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
index 76ea8cfc0ff..9f638acd81d 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866daec9a49519871816
-title: Step 31
+title: Step 30
 challengeType: 0
-dashedName: step-31
+dashedName: step-30
 ---
 
 # --description--
@@ -52,11 +52,9 @@ assert(secondP.innerText.match(/3\.00/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
 --fcc-editable-region--
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
index c8fe66fbd41..f5d00c4ec0a 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866dbf362f99b9a0c6d0
-title: Step 38
+title: Step 37
 challengeType: 0
-dashedName: step-38
+dashedName: step-37
 ---
 
 # --description--
@@ -53,11 +53,9 @@ assert(itemPDisplay === 'inline-block');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md
index 96521f24716..2eb251ffff8 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866dd0d0275f01d4d847
-title: Step 40
+title: Step 39
 challengeType: 0
-dashedName: step-40
+dashedName: step-39
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(priceWidth === '49%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md
index bf6b8856aef..8bdf38a4de8 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866de7a5b784048f94b1
-title: Step 37
+title: Step 36
 challengeType: 0
-dashedName: step-37
+dashedName: step-36
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert($('article')[0].className === 'item');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
 --fcc-editable-region--
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md
index 13a27e96048..e19e70ebd68 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade94c6576e7f7b7953f
-title: Step 42
+title: Step 41
 challengeType: 0
-dashedName: step-42
+dashedName: step-41
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(priceWidth === '50%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md
index 5164454abf3..5f4bb886942 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade9993019e26313fa8e
-title: Step 43
+title: Step 42
 challengeType: 0
-dashedName: step-43
+dashedName: step-42
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(articles[4] === items[4]);
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md
index 87d03a325cc..efa05f4a2d2 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade99dda4e6071a85dfd
-title: Step 47
+title: Step 46
 challengeType: 0
-dashedName: step-47
+dashedName: step-46
 ---
 
 # --description--
@@ -50,11 +50,9 @@ assert($('main').children('section').length === 2);
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
 --fcc-editable-region--
         <section>
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md
index fb87effeb1a..c50297c3b8c 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade9fa77275d9f4efe62
-title: Step 41
+title: Step 40
 challengeType: 0
-dashedName: step-41
+dashedName: step-40
 ---
 
 # --description--
@@ -34,11 +34,9 @@ assert(code.match(/Vanilla<\/p><p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md
index 692a2692fc4..bde39deb4aa 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md
@@ -1,15 +1,15 @@
 ---
 id: 5f3ef6e01f288a026d709587
-title: Step 67
+title: Step 66
 challengeType: 0
-dashedName: step-67
+dashedName: step-66
 ---
 
 # --description--
 
 È possibile utilizzare un elemento `hr` per visualizzare un separatore tra sezioni con diverso contenuto.
 
-Per prima cosa, aggiungi un elemento `hr` tra il primo elemento`header`e l'elemento `main`. Nota che gli elementi `hr` sono autoconcludenti.
+Aggiungi un elemento `hr` tra l'elemento `p` con la classe `established` e il primo elemento `section`. Nota che gli elementi `hr` sono autoconcludenti.
 
 # --hints--
 
@@ -20,10 +20,10 @@ assert(code.match(/<hr\s?\/?>/i));
 assert(!code.match(/<\/hr>/i));
 ```
 
-Non dovresti cambiare l'elemento `header` esistente.
+Non dovresti cambiare l'elemento `p` con la classe `established` esistente.
 
 ```js
-assert($('header').length === 1);
+assert($('p.established').length === 1);
 ```
 
 Non dovresti cambiare l'elemento `main` esistente.
@@ -32,11 +32,11 @@ Non dovresti cambiare l'elemento `main` esistente.
 assert($('main').length === 1);
 ```
 
-L'elemento `hr` dovrebbe essere tra l'elemento `header` e l'elemento `main`.
+L'elemento `hr` dovrebbe essere tra l'elemento `p` e l'elemento `section`.
 
 ```js
-assert($('hr')[0].previousElementSibling.tagName === 'HEADER');
-assert($('hr')[0].nextElementSibling.tagName === 'MAIN');
+assert($('hr')[0].previousElementSibling.tagName === 'P');
+assert($('hr')[0].nextElementSibling.tagName === 'SECTION');
 ```
 
 # --seed--
@@ -55,11 +55,9 @@ assert($('hr')[0].nextElementSibling.tagName === 'MAIN');
   <body>
     <div class="menu">
 --fcc-editable-region--
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
index 8656cd68650..5947d8cbd17 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e03d719d5ac4738993
-title: Step 57
+title: Step 56
 challengeType: 0
-dashedName: step-57
+dashedName: step-56
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(menuMaxWidth === '500px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
index 1b19392af09..9a4ff521c70 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e04559b939080db057
-title: Step 56
+title: Step 55
 challengeType: 0
-dashedName: step-56
+dashedName: step-55
 ---
 
 # --description--
@@ -64,11 +64,9 @@ assert(menuPadding === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
index e5ea230e380..40032743cc1 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e050279c7a4a7101d3
-title: Step 55
+title: Step 54
 challengeType: 0
-dashedName: step-55
+dashedName: step-54
 ---
 
 # --description--
@@ -63,11 +63,9 @@ assert(menuPaddingBottom === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
index ecde6ff881b..3e8fbf9fa6e 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e05473f91f948724ab
-title: Step 58
+title: Step 57
 challengeType: 0
-dashedName: step-58
+dashedName: step-57
 ---
 
 # --description--
@@ -41,11 +41,9 @@ assert(bodyFontFamily === 'sans-serif');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
index ec3d50e4fab..05f797ecca6 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e056bdde6ae6892ba2
-title: Step 59
+title: Step 58
 challengeType: 0
-dashedName: step-59
+dashedName: step-58
 ---
 
 # --description--
@@ -54,11 +54,9 @@ assert($('h2').css('font-family').match(/impact/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
index c16f9867b77..60055b63f9a 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e06d34faac0447fc44
-title: Step 61
+title: Step 60
 challengeType: 0
-dashedName: step-61
+dashedName: step-60
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(establishedFontStyle === 'italic');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md
index 56409aa3f28..2badcb63312 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e07276f782bb46b93d
-title: Step 64
+title: Step 63
 challengeType: 0
-dashedName: step-64
+dashedName: step-63
 ---
 
 # --description--
@@ -51,12 +51,10 @@ assert(footer.previousElementSibling.tagName === 'MAIN');
   </head>
   <body>
     <div class="menu">
-      <header>
-        <h1>CAMPER CAFE</h1>
-        <p class="established">Est. 2020</p>
-      </header>
 --fcc-editable-region--
       <main>
+        <h1>CAMPER CAFE</h1>
+        <p class="established">Est. 2020</p>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
index 04b9737066c..33a969d37bf 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0819d4f23ca7285e6
-title: Step 49
+title: Step 48
 challengeType: 0
-dashedName: step-49
+dashedName: step-48
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('section')[1].children[1].className === 'item');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
index 001c8245439..611f78dac7a 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e087d56ed3ffdc36be
-title: Step 62
+title: Step 61
 challengeType: 0
-dashedName: step-62
+dashedName: step-61
 ---
 
 # --description--
@@ -45,13 +45,11 @@ assert($('.established').css('font-style') === 'italic');
   </head>
   <body>
     <div class="menu">
+      <main>
 --fcc-editable-region--
-      <header>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
 --fcc-editable-region--
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
index 0226645aaa4..81b4ccebac9 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0a81099d9a697b550
-title: Step 65
+title: Step 64
 challengeType: 0
-dashedName: step-65
+dashedName: step-64
 ---
 
 # --description--
@@ -58,11 +58,9 @@ assert(document.querySelector("footer > p > a")?.href === "https://www.freecodec
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md
index 756c71e53b1..c06c7945a37 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0b431cc215bb16f55
-title: Step 66
+title: Step 65
 challengeType: 0
-dashedName: step-66
+dashedName: step-65
 ---
 
 # --description--
@@ -38,11 +38,9 @@ assert($('footer').children('p').last().text().match(/123 Free Code Camp Drive/i
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md
index 1268b1dd710..a447399aa16 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0e0c3feaebcf647ad
-title: Step 48
+title: Step 47
 challengeType: 0
-dashedName: step-48
+dashedName: step-47
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('h2')[1].innerText.match(/Desserts/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md
index ece18c7ca59..236a9ea6510 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0e9629bad967cd71e
-title: Step 60
+title: Step 59
 challengeType: 0
-dashedName: step-60
+dashedName: step-59
 ---
 
 # --description--
@@ -35,11 +35,9 @@ assert(fontFamily === 'Impact, serif');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md
index bea33316a66..c6febe7e58b 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0eaa7da26e3d34d78
-title: Step 54
+title: Step 53
 challengeType: 0
-dashedName: step-54
+dashedName: step-53
 ---
 
 # --description--
@@ -56,11 +56,9 @@ assert(menuPaddingRight === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md
index 4de67c4b178..7f8af933170 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0f8c230bdd2349716
-title: Step 63
+title: Step 62
 challengeType: 0
-dashedName: step-63
+dashedName: step-62
 ---
 
 # --description--
@@ -56,11 +56,9 @@ assert(h2FontSize === '30px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
index 1614afffa04..0f792c64e8e 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3f26fa39591db45e5cd7a0
-title: Step 68
+title: Step 67
 challengeType: 0
-dashedName: step-68
+dashedName: step-67
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(hrHeight === '3px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md
index 84b6eb5872d..4b7ac314380 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459225127805351a6ad057
-title: Step 69
+title: Step 68
 challengeType: 0
-dashedName: step-69
+dashedName: step-68
 ---
 
 # --description--
@@ -39,12 +39,10 @@ assert(hrBackgroundColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
index edc656e4e41..c598b462519 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459a7ceb8b5c446656d88b
-title: Step 70
+title: Step 69
 challengeType: 0
-dashedName: step-70
+dashedName: step-69
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(hrBorderColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
index 7252165a8aa..699ecab9857 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459cf202c2a3472fae6a9f
-title: Step 71
+title: Step 70
 challengeType: 0
-dashedName: step-71
+dashedName: step-70
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(hrHeight === '2px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
index 34ad75ee049..08bf3eab23c 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459fd48bdc98491ca6d1a3
-title: Step 72
+title: Step 71
 challengeType: 0
-dashedName: step-72
+dashedName: step-71
 ---
 
 # --description--
@@ -39,13 +39,11 @@ assert($('hr')[1].nextElementSibling.tagName === 'FOOTER');
   </head>
   <body>
     <div class="menu">
-      <header>
-        <h1>CAMPER CAFE</h1>
-        <p class="established">Est. 2020</p>
-      </header>
-      <hr>
 --fcc-editable-region--
       <main>
+        <h1>CAMPER CAFE</h1>
+        <p class="established">Est. 2020</p>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md
index ec1ecd32aa9..ab0147e1dc3 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a05977e2fa49d9119437
-title: Step 73
+title: Step 72
 challengeType: 0
-dashedName: step-73
+dashedName: step-72
 ---
 
 # --description--
@@ -39,12 +39,10 @@ assert(bodyPadding === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md
index d2e7fe3277e..8b1ea075169 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a276c093334f0f6e9df4
-title: Step 74
+title: Step 73
 challengeType: 0
-dashedName: step-74
+dashedName: step-73
 ---
 
 # --description--
@@ -63,12 +63,10 @@ assert(itemPMarginBottom === '5px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md
index e54f3085334..1253be01b44 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a5a7c49a8251f0bdb527
-title: Step 75
+title: Step 74
 challengeType: 0
-dashedName: step-75
+dashedName: step-74
 ---
 
 # --description--
@@ -47,12 +47,10 @@ assert(itemPFontSize === '18px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md
index 835872dde99..f37ff6bc583 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a66d4a2b0453301e5a26
-title: Step 79
+title: Step 78
 challengeType: 0
-dashedName: step-79
+dashedName: step-78
 ---
 
 # --description--
@@ -54,12 +54,10 @@ assert(footerFontSize === '14px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md
index 940616fe832..96b8a168251 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b0731d39e15d54df4dfc
-title: Step 80
+title: Step 79
 challengeType: 0
-dashedName: step-80
+dashedName: step-79
 ---
 
 # --description--
@@ -48,12 +48,10 @@ assert(aColor === 'black');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md
index 6311fe6b4e8..c0880ac399d 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b25e7ec2405f166b9de1
-title: Step 81
+title: Step 80
 challengeType: 0
-dashedName: step-81
+dashedName: step-80
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(aVisitedColor === 'grey' || aVisitedColor === 'gray');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md
index 16cfa6945e8..c4cb0a72dcf 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b3c93c027860d9298dbd
-title: Step 82
+title: Step 81
 challengeType: 0
-dashedName: step-82
+dashedName: step-81
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(aHoverColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md
index dc900195f2b..2234e688e94 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b45d099f3e621fbbb256
-title: Step 83
+title: Step 82
 challengeType: 0
-dashedName: step-83
+dashedName: step-82
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(aActiveColor === 'white');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md
index 3ab8adb45d7..509cc3a929d 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b4c81cea7763550e40df
-title: Step 84
+title: Step 83
 challengeType: 0
-dashedName: step-84
+dashedName: step-83
 ---
 
 # --description--
@@ -40,12 +40,10 @@ assert(aActiveColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md
index b7f429328b6..dc01a1816d5 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b715301bbf667badc04a
-title: Step 85
+title: Step 84
 challengeType: 0
-dashedName: step-85
+dashedName: step-84
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(h1MarginTop === '0px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md
index 09e612335f2..51f2384899c 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e270702a8456a664f0df
-title: Step 86
+title: Step 85
 challengeType: 0
-dashedName: step-86
+dashedName: step-85
 ---
 
 # --description--
@@ -40,12 +40,10 @@ assert(h1MarginBottom === '15px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md
index 661792cc371..ad395438e35 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e36e745ead58487aabf2
-title: Step 87
+title: Step 86
 challengeType: 0
-dashedName: step-87
+dashedName: step-86
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(addressMarginBottom === '5px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md
index 1357169e2ed..1c30b5d33c1 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e7a4750dd05b5a673920
-title: Step 88
+title: Step 87
 challengeType: 0
-dashedName: step-88
+dashedName: step-87
 ---
 
 # --description--
@@ -44,12 +44,10 @@ assert($('.address')[0].innerText.match(/123 Free Code Camp Drive/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md
index 2b48fe0e41d..5c2d01c85a6 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e8284aae155c83015dee
-title: Step 89
+title: Step 88
 challengeType: 0
-dashedName: step-89
+dashedName: step-88
 ---
 
 # --description--
@@ -46,12 +46,10 @@ assert($('img').attr('alt').match(/coffee icon/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
 --fcc-editable-region--
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md
index 06761b33c8c..ab7db14b5c9 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46ede1ff8fec5ba656b44c
-title: Step 78
+title: Step 77
 challengeType: 0
-dashedName: step-78
+dashedName: step-77
 ---
 
 # --description--
@@ -32,12 +32,10 @@ assert(code.match(/\/\*\s*FOOTER\s*\*\//i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md
index 0c61998ec16..e4319c517bf 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46fc57528aa1c4b5ea7c2e
-title: Step 76
+title: Step 75
 challengeType: 0
-dashedName: step-76
+dashedName: step-75
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(bottomLineMargin === '25px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md
index fd7edb48d94..1f9ad142cff 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md
@@ -1,8 +1,8 @@
 ---
 id: 5f4701b942c824109626c3d8
-title: Step 77
+title: Step 76
 challengeType: 0
-dashedName: step-77
+dashedName: step-76
 ---
 
 # --description--
@@ -38,12 +38,10 @@ assert($('hr')[1].className === 'bottom-line');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
index 83176f0b6d4..68a6294908c 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
@@ -1,8 +1,8 @@
 ---
 id: 5f475bb508746c16c9431d42
-title: Step 90
+title: Step 89
 challengeType: 0
-dashedName: step-90
+dashedName: step-89
 ---
 
 # --description--
@@ -72,12 +72,10 @@ assert(imgMarginRight === 'auto');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
index 96e5411a41c..0455ff4ea66 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f475e1c7f71a61d913836c6
-title: Step 91
+title: Step 90
 challengeType: 0
-dashedName: step-91
+dashedName: step-90
 ---
 
 # --description--
@@ -44,12 +44,10 @@ assert($('img').last().attr('alt').match(/pie icon/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md
index e30c356d29e..ea70d34e1f7 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f47633757ae3469f2d33d2e
-title: Step 46
+title: Step 45
 challengeType: 0
-dashedName: step-46
+dashedName: step-45
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(priceWidth === '25%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md
index 7c01d227680..8bf1c8f83bf 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f47fe7e31980053a8d4403b
-title: Step 92
+title: Step 91
 challengeType: 0
-dashedName: step-92
+dashedName: step-91
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(imgMarginTop === '-25px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
@@ -209,12 +207,10 @@ a:active {
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
index b4cef7c8be4..28cddd3c185 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
@@ -1,8 +1,8 @@
 ---
 id: 5f716ad029ee4053c7027a7a
-title: Step 50
+title: Step 49
 challengeType: 0
-dashedName: step-50
+dashedName: step-49
 ---
 
 # --description--
@@ -50,11 +50,9 @@ assert($('article').last().children('p')[1].innerText.match(/1\.50/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
index f43e75c0435..3cfb1d55e38 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
@@ -1,8 +1,8 @@
 ---
 id: 5f716bee5838c354c728a7c5
-title: Step 53
+title: Step 52
 challengeType: 0
-dashedName: step-53
+dashedName: step-52
 ---
 
 # --description--
@@ -84,11 +84,9 @@ assert(!code.match(/<\/p>\s+<p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md
index 80c40af6064..0c0b8101af7 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7691dafd882520797cd2f0
-title: Step 44
+title: Step 43
 challengeType: 0
-dashedName: step-44
+dashedName: step-43
 ---
 
 # --description--
@@ -32,11 +32,9 @@ assert(!code.match(/<\/p>\s+<p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md
index 07e423eb7a2..345908598ac 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7692f7c5b3ce22a57788b6
-title: Step 45
+title: Step 44
 challengeType: 0
-dashedName: step-45
+dashedName: step-44
 ---
 
 # --description--
@@ -62,11 +62,9 @@ assert(p[10] === price[4]);
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md
index 27ad8b72e99..a81d89aa433 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f769541be494f25449b292f
-title: Step 34
+title: Step 33
 challengeType: 0
-dashedName: step-34
+dashedName: step-33
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(flavorTextAlign === 'left');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md
index e5ed7c716ff..1e7aa0fc244 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md
@@ -1,8 +1,8 @@
 ---
 id: 5f76967fad478126d6552b0d
-title: Step 35
+title: Step 34
 challengeType: 0
-dashedName: step-35
+dashedName: step-34
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('.price')[0].innerText.match(/3\.00/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md
index dcf30fda98c..5d5f1ec7bec 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md
@@ -1,8 +1,8 @@
 ---
 id: 5f769702e6e33127d14aa120
-title: Step 36
+title: Step 35
 challengeType: 0
-dashedName: step-36
+dashedName: step-35
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('.price').css('text-align') === 'right');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md
index 2b2283a8e37..8f43e754718 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7b87422a560036fd03ccff
-title: Step 51
+title: Step 50
 challengeType: 0
-dashedName: step-51
+dashedName: step-50
 ---
 
 # --description--
@@ -50,11 +50,9 @@ assert(!code.match(/<\/p>\s+<p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
index 3b43b8e8113..bcdc793cc24 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7b88d37b1f98386f04edc0
-title: Step 52
+title: Step 51
 challengeType: 0
-dashedName: step-52
+dashedName: step-51
 ---
 
 # --description--
@@ -35,11 +35,9 @@ assert(selector)
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md
index f0a946f71c0..090d7c6fc2a 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md
@@ -7,9 +7,7 @@ dashedName: step-5
 
 # --description--
 
-Usa un tag `viewport` `<meta>` per assicurarti che la tua pagina venga visualizzata allo stesso modo su tutti i dispositivi.
-
-Annida un elemento `meta` autoconcludente nell'elemento `head`. Assegnagli un attributo `name` con il valore `viewport` e un attributo `content` con il valore `width=device-width, initial-scale=1.0`.
+Aggiungi un altro elemento `meta` autoconcludente all'interno dell'elemento `head`. Assegnagli un attributo `name` con il valore `viewport` e un attributo `content` con il valore `width=device-width, initial-scale=1.0`, in modo che la pagina abbia lo stesso aspetto su tutti i dispositivi.
 
 # --hints--
 
@@ -26,11 +24,12 @@ Il nuovo elemento `meta` dovrebbe essere un elemento autoconcludente.
 assert(code.match(/<\/meta>/i) === null);
 ```
 
-Il nuovo elemento `meta` dovrebbe avere un attributo `name` con il valore `viewport`, e un attributo `content` con il valore `width=device-width, initial-scale=1.0`.
+Il nuovo elemento `meta` dovrebbe avere un attributo `name` con il valore `viewport` e un attributo `content` con il valore `width=device-width, initial-scale=1.0`.
 
 ```js
 const meta = [...document.querySelectorAll('meta')];
-const target = meta?.find(m => m?.getAttribute('name') === 'viewport' && m?.getAttribute('content') === 'width=device-width, initial-scale=1.0');
+const reValidContent = /^\s*width\s*=\s*device-width\s*,\s*initial-scale\s*=\s*1(?:\.0)?\s*$/;
+const target = meta?.find(m => m?.getAttribute('name') === 'viewport' && reValidContent.test(m?.getAttribute('content')));
 assert.exists(target);
 ```
 
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md
index ea6bb49d361..44333c14016 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md
@@ -9,7 +9,7 @@ dashedName: step-5
 
 In HTML5 alcuni elementi identificano diverse aree di contenuto. Questi elementi rendono il tuo HTML più facile da leggere e aiutano con l'ottimizzazione per i motori di ricerca (SEO) e l'accessibilità.
 
-Identifica la sezione principale di questa pagina aggiungendo un tag di apertura `<main>` dopo l'elemento `h1` e un tag di chiusura `</main>` dopo l'elemento `p`.
+Identifica la sezione principale di questa pagina aggiungendo un tag di apertura `<main>` prima dell'elemento `h1` e un tag di chiusura `</main>` dopo l'elemento `p`.
 
 # --hints--
 
@@ -25,20 +25,20 @@ L'elemento `main` dovrebbe avere un tag di chiusura. I tag di chiusura hanno un
 assert(code.match(/<\/main\>/));
 ```
 
-Il tag di apertura dell'elemento `main` dovrebbe essere al di sotto dell'elemento `h1`. Sono nell'ordine sbagliato.
+Il tag di apertura dell'elemento `main` dovrebbe essere al di sotto dell'elemento `body`. Sono nell'ordine sbagliato.
 
 ```js
 const main = document.querySelector('main');
-assert.equal(main?.previousElementSibling?.tagName, "H1");
+assert.equal(main?.previousElementSibling, null);
 ```
 
-Il tag di apertura dell'elemento `main` dovrebbe essere sopra l'elemento `h2`. Sono nell'ordine sbagliato.
+Il tag di apertura dell'elemento `main` dovrebbe essere sopra l'elemento `h1`. Sono nell'ordine sbagliato.
 
 ```js
-const collection = [...document.querySelectorAll('main,h2')].map(
+const collection = [...document.querySelectorAll('main,h1')].map(
   (node) => node.nodeName
 );
-assert(collection.indexOf('MAIN') < collection.indexOf('H2'));
+assert(collection.indexOf('MAIN') < collection.indexOf('H1'));
 ```
 
 Il tag di chiusura dell'elemento `main` dovrebbe essere al di sotto dell'elemento `p`. Sono nell'ordine sbagliato.
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md
index 1517626cf61..b01655290e0 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md
@@ -7,9 +7,9 @@ dashedName: step-6
 
 # --description--
 
-Nello step precedente, hai inserito l'elemento `h2`, il commento e l'elemento `p` all'interno dell'elemento `main`. Questa operazione si chiama *annidamento*. Gli elementi annidati dovrebbero essere posizionati due spazi più a destra dell'elemento in cui sono annidati. Questa spaziatura è detta indentazione e viene utilizzata per rendere l'HTML più leggibile.
+Nello step precedente, hai inserito gli elementi `h1`, `h2`, il commento e l'elemento `p` all'interno dell'elemento `main`. Questa operazione si chiama *annidamento*. Gli elementi annidati dovrebbero essere posizionati due spazi più a destra dell'elemento in cui sono annidati. Questa spaziatura è detta indentazione e viene utilizzata per rendere l'HTML più leggibile.
 
-Nel seguente codice, l'elemento `h2` e il commento sono indentati di due spazi rispetto all'elemento `main`. Usa la barra spaziatrice della tastiera per aggiungere due spazi prima dell'elemento `p`, in modo che sia indentato nel modo corretto.
+Nel seguente codice, l'elemento `h1`, l'elemento `h2` e il commento sono indentati di due spazi rispetto all'elemento `main`. Usa la barra spaziatrice della tastiera per aggiungere due spazi prima dell'elemento `p`, in modo che sia indentato nel modo corretto.
 
 # --hints--
 
@@ -34,7 +34,7 @@ assert(
 Non dovresti cambiare l'indentazione della riga con l'elemento `h2`. Il suo tag di apertura dovrebbe iniziare a 6 spazi dall'inizio della riga. Puoi riavviare lo step per ripristinare l'indentazione originale.
 
 ```js
-assert(code.toLowerCase().match(/<main\>\s*\n\s{6}<h2>/));
+assert(code.toLowerCase().match(/<\/h1\>\s*\n\s{6}<h2>/));
 ```
 
 Il codice dovrebbe avere un commento. Hai rimosso il commento che era presente.
@@ -89,9 +89,9 @@ assert(code.toLowerCase().match(/-->\s*\n\s{6}<p>/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
---fcc-editable-region--
+    --fcc-editable-region--
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
     <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md
index 6fd510cd7dd..a7c7439be8e 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md
@@ -47,8 +47,8 @@ assert(collection.indexOf('P') < collection.indexOf('IMG'));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md
index eb0e46592db..a258b521083 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md
@@ -46,8 +46,8 @@ assert(!/\<img\s+src\s*=\s*https:\/\/cdn\.freecodecamp\.org\/curriculum\/cat-pho
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md
index 6f6ac2452ad..f1d7807dae4 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md
@@ -44,8 +44,8 @@ assert(altText.match(/A cute orange cat lying on its back\.?$/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md
index d3858682ec7..d8c0bad1534 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md
@@ -64,8 +64,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md
index c2b91019110..152d27bf40d 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md
@@ -41,8 +41,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md
index 9909765d3e3..acaae3c275d 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md
@@ -9,7 +9,7 @@ dashedName: step-12
 
 Nello step precedente hai trasformato le parole `link to cat pictures` in un link inserendole tra un tag di apertura e un tag di chiusura di ancoraggio (`a`). Puoi fare lo stesso con le parole in un elemento, come un elemento `p`.
 
-Nel testo dell'elemento `p`, trasforma le parole `cat photos` in un link a `https://freecatphotoapp.com` posizionando queste parole tra un tag di apertura e un tag di chiusura di ancoraggio (`a`).
+Nel testo dell'elemento `p`, trasforma le parole `cat photos` in un link a `https://freecatphotoapp.com` Aggiungendo dei tag di ancoraggio (`a`) di apertura e di chiusura attorno a queste parole.
 
 
 # --hints--
@@ -55,8 +55,8 @@ assert(pText.match(/click here to view more cat photos\.?$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md
index 494bd80960b..092eb395844 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md
@@ -40,8 +40,8 @@ assert(document.querySelector('a').getAttribute('target') === '_blank');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md
index 41c8164fe4c..ac851600e86 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md
@@ -73,8 +73,8 @@ assert(document.querySelector('img').parentNode.nodeName === 'A');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md
index bdbf96efab2..3295e8ca468 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md
index 243349b5a59..e7517b28c7f 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md
@@ -64,8 +64,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md
index f0d88cc13f0..4230b1a6fee 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md
@@ -37,10 +37,10 @@ assert(secondSectionLastElemNode.nodeName === 'UL');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
-      <h2>Cat Photos</h2>
+        <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
         <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
         <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
index ed3f273bc97..55000621a71 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md
index fe3097c992a..cbbc7f3decf 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md
@@ -68,8 +68,8 @@ assert(!/\<img\s+.+\s+src\s*=\s*https:\/\/cdn\.freecodecamp\.org\/curriculum\/ca
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md
index 0db4bb4d4f7..2c7bf41f030 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md
@@ -48,11 +48,11 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
-      <h2>Cat Photos</h2>
-      <!-- TODO: Add link to cat photos -->
+        <h2>Cat Photos</h2>
+        <!-- TODO: Add link to cat photos -->
         <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
         <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
       </section>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md
index f10310b9706..825c5a7a969 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md
@@ -69,8 +69,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md
index 6f0646882e1..18a497c5db2 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md
@@ -55,8 +55,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md
index a4bf3c33415..c82822baf5b 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md
@@ -51,8 +51,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
index f6371f4c80a..3da6c12fc5b 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
@@ -62,8 +62,8 @@ assert.deepStrictEqual(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md
index 26fcd831451..2fade0a47cb 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md
@@ -36,8 +36,8 @@ assert($('main > section')[1].lastElementChild.nodeName === 'FIGURE');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md
index 30a821f8b0f..78b42f085a8 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
index 7ad7f9eb314..490b0eabf69 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
@@ -63,8 +63,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md
index bce2e76dee7..7818e61e736 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md
@@ -45,8 +45,8 @@ assert($('form')[0].innerHTML.trim().length === 0);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md
index 0cbfd983125..d50335dfd97 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md
@@ -71,8 +71,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md
index 6ff41357adc..4b340592467 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md
@@ -64,8 +64,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md
index cfe5f3e38f0..2475bb0b846 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md
@@ -58,8 +58,8 @@ assert(!/\<\s*input\s+placeholder\s*=\s*cat\s+photo\s+url/i.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md
index c1c12c9c131..fbc87950f8e 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md
@@ -47,8 +47,8 @@ assert(collection.indexOf('INPUT') < collection.indexOf('BUTTON'));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md
index beb148bc629..3a38430dc10 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md
@@ -45,8 +45,8 @@ assert($('input')[0].getAttribute('required') === '');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
index 7bf547b5d89..92b4cc58e44 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
@@ -90,8 +90,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
index c1b4721a158..cb5b036be61 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md
index 2f6c80f75c4..d3c229f0b5b 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md
@@ -57,8 +57,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md
index 51defedbcd6..2fd8bad038b 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md
@@ -47,8 +47,8 @@ assert($('input')[0].id.match(/^indoor$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md
index c26e9ae5af7..52a09993d3b 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md
@@ -53,8 +53,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
index 5978ba2c36b..f8227f414e0 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
@@ -75,8 +75,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md
index d225250ddb1..6fd4b26e33c 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md
@@ -66,8 +66,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md
index 2e5ca0e7438..d31eb889834 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md
@@ -59,8 +59,8 @@ assert(!$('input[type="checkbox"]')[2].hasAttribute('checked'));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md
index 94c90fe46f8..fdfac352570 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md
@@ -44,8 +44,8 @@ assert(document.querySelector('main').nextElementSibling.nodeName === 'FOOTER');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md
index 36c8b5d3a4b..5e9af768e4e 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md
@@ -44,8 +44,8 @@ assert(extraSpacesRemoved.match(/No Copyright - freeCodeCamp\.org$/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md
index 34f956ac373..33ec080fcaf 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md
@@ -55,8 +55,8 @@ assert(pText.match(/^no copyright - freecodecamp.org$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md
index 175ec23d242..a8e49578405 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md
@@ -46,8 +46,8 @@ assert(noSpaces.match(/\<\/head\>\<body\>/));
 <html>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
index a57bbcb8f35..1d722dc4c19 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
@@ -51,8 +51,8 @@ assert(document.title && document.title.toLowerCase() === 'catphotoapp');
   </head>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
index 22c8871a413..0c144a1ba2f 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
@@ -44,8 +44,8 @@ assert(code.match(/<html\s+lang\s*=\s*('|")en\1\s*>/gi));
     <title>CatPhotoApp</title>
   </head>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md
index 9d39941e9d2..6bf9fbaa98b 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md
@@ -38,8 +38,8 @@ assert(noSpaces.match(/^\<\!DOCTYPEhtml\>\<html/));
   </head>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md
index 751493bf4f7..c5f2277a800 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md
@@ -61,8 +61,8 @@ assert(!/\<img\s+.+\s+src\s*=\s*https:\/\/cdn\.freecodecamp\.org\/curriculum\/ca
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md
index bd94b733525..751adc48359 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md
@@ -60,8 +60,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md
index 15d597b667f..0d1b40781eb 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md
@@ -84,8 +84,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md
index c566a410da5..4ada5ba22ab 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md
@@ -58,8 +58,8 @@ assert(!/\<input\s+type\s*=\s*text/.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md
index 2966a4c0519..5cdc2532b48 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md
@@ -54,8 +54,8 @@ assert(!/\<\s*button\s+type\s*=\s*submit/i.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
index 982e6b73e04..51474f91b30 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
@@ -80,8 +80,8 @@ assert(labelElem.textContent.replace(/\s/g, '').match(/Loving/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md
index 03b3a1501cc..8ccea1a092c 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md
@@ -42,8 +42,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md
index d404d13d1bf..8b900a8c4cc 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md
@@ -30,8 +30,8 @@ assert($('input[type="checkbox"]')[0].id.match(/^loving$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md
index d9f4fcd58fb..dd48b1a7927 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md
@@ -67,8 +67,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
index 6d99719cef8..31770ad8928 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
@@ -88,8 +88,8 @@ assert(code.match(/<\/label>\s*<label\s*>\s*<input [^>]+>\s*Outdoor/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md
index dd0527ff547..0efe6b069f0 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md
@@ -9,7 +9,7 @@ dashedName: step-16
 
 Prima di aggiungere qualsiasi nuovo contenuto, dovresti utilizzare un elemento `section` per separare i contenuti che hai già inserito da quelli futuri.
 
-Prendi tutti gli elementi che si trovano attualmente all'interno dell'elemento `main` e annidali in un elemento `section`.
+Prendi l'elemento `h2`, il commento, e gli elementi `p` e di ancoraggio (`a`) e annidali in un elemento `section`.
 
 # --hints--
 
@@ -35,10 +35,18 @@ L'elemento `h2` esistente, il commento, l'elemento `p` e l'elemento di ancoraggi
 
 ```js
 const childrenOfSection = [...document.querySelector('section').childNodes];
-const foundElems = childrenOfSection.filter((child) => {
+const foundElements = childrenOfSection.filter((child) => {
   return ['H2', 'A', 'P'].includes(child.nodeName);
 });
-assert(foundElems.length === 3);
+assert(foundElements.length === 3);
+```
+
+L'elemento `h1` dovrebbe essere annidato nell'elemento `section`.
+
+```js
+const childrenOfSection = [...document.querySelector('section').childNodes];
+const includesH1 = childrenOfSection.some((child) => child.nodeName === 'H1');
+assert.isFalse(includesH1);
 ```
 
 # --seed--
@@ -48,9 +56,9 @@ assert(foundElems.length === 3);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
---fcc-editable-region--
+    --fcc-editable-region--
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md
index 06ee6ede2fa..ca9fffea76c 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md
@@ -64,8 +64,8 @@ assert(foundElems.length === 2);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
 --fcc-editable-region--
       <section>
         <h2>Cat Photos</h2>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md
index 121af96bd6e..60c16e5e6fd 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md
@@ -58,37 +58,37 @@ assert($('main > section')[2].children.length === 0);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
-      <h2>Cat Photos</h2>
-      <!-- TODO: Add link to cat photos -->
-      <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
-      <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
+        <h2>Cat Photos</h2>
+        <!-- TODO: Add link to cat photos -->
+        <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
+        <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
       </section>
 --fcc-editable-region--
       <section>
-      <h2>Cat Lists</h2>
-      <h3>Things cats love:</h3>
-      <ul>
-        <li>cat nip</li>
-        <li>laser pointers</li>
-        <li>lasagna</li>
-      </ul>
-      <figure>
-        <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/lasagna.jpg" alt="A slice of lasagna on a plate.">
-        <figcaption>Cats <em>love</em> lasagna.</figcaption>  
-      </figure>
-      <h3>Top 3 things cats hate:</h3>
-      <ol>
-        <li>flea treatment</li>
-        <li>thunder</li>
-        <li>other cats</li>
-      </ol>
-      <figure>
-        <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/cats.jpg" alt="Five cats looking around a field.">
-        <figcaption>Cats <strong>hate</strong> other cats.</figcaption>  
-      </figure>
+        <h2>Cat Lists</h2>
+        <h3>Things cats love:</h3>
+        <ul>
+          <li>cat nip</li>
+          <li>laser pointers</li>
+          <li>lasagna</li>
+        </ul>
+        <figure>
+          <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/lasagna.jpg" alt="A slice of lasagna on a plate.">
+          <figcaption>Cats <em>love</em> lasagna.</figcaption>  
+        </figure>
+        <h3>Top 3 things cats hate:</h3>
+        <ol>
+          <li>flea treatment</li>
+          <li>thunder</li>
+          <li>other cats</li>
+        </ol>
+        <figure>
+          <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/cats.jpg" alt="Five cats looking around a field.">
+          <figcaption>Cats <strong>hate</strong> other cats.</figcaption>  
+        </figure>
       </section>
 --fcc-editable-region--
     </main>
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md
index dd255053118..2333a0606a7 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md
@@ -54,8 +54,8 @@ assert(extraSpacesRemoved.match(/Is your cat an indoor or outdoor cat\??$/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md
index fe37c3e5d76..020bb8bcf95 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md
@@ -76,8 +76,8 @@ assert(fieldsetChildren[0].length > fieldsetChildren[1].length);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md
index 001c4b0784b..515eef1df9e 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md
@@ -60,8 +60,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md
index ea8c74f4735..856ef21ac1c 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md
@@ -60,8 +60,8 @@ assert(outdoorRadioButton.getAttribute('value').match(/^outdoor$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md
index 6f533e39727..0212756805e 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md
@@ -48,8 +48,8 @@ assert(energeticCheckbox.getAttribute('value').match(/^energetic$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md
index d2d00fc7c9e..23eb8c5d0b7 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md
@@ -37,8 +37,8 @@ assert.equal(document.querySelector('head > meta')?.getAttribute('charset')?.toL
   </head>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
@@ -106,8 +106,8 @@ assert.equal(document.querySelector('head > meta')?.getAttribute('charset')?.toL
     <title>CatPhotoApp</title>
   </head>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md
index 0d84558b8ea..5d536996434 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md
@@ -69,8 +69,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md
index a8d3f44874b..1ee70d3c542 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md
@@ -57,8 +57,8 @@ assert(!/\<\s*input\s+.*\s*=\s*catphotourl/.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md
index 387bafdc6f6..07ac64702d6 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md
@@ -6,12 +6,13 @@ dashedName: step-8
 ---
 
 # --description--
+L'unità `vh` sta per viewport height, ed è relativa all'1% dell'altezza (`height`) del viewport.
 
-Adesso, iniziamo ad abbellire il progetto aggiungendo un po' di CSS. Inizia assegnando al `body` una proprietà `width` del `100%`, e una proprietà `height` di `100vh`.
+È tempo di abbellire il progetto con un po' di CSS. Inizia assegnando al `body` una proprietà `width` del `100%` e una proprietà `height` di `100vh`.
 
 # --hints--
 
-Dovresti usare un selettore `body`.
+Dovresti usare il selettore di elemento `body`.
 
 ```js
 assert.exists(new __helpers.CSSHelp(document).getStyle('body'));
diff --git a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md
index 309e744cc30..4155e1c497d 100644
--- a/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md
+++ b/curriculum/challenges/italian/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md
@@ -6,8 +6,9 @@ dashedName: step-15
 ---
 
 # --description--
+L'unità `rem` sta per root `em`, ed è relativa alla dimensione del carattere dell'elemento `html`.
 
-Visto che gli elementi `label` sono inline di default, vengono visualizzati affiancati sulla stessa riga, rendendo il testo poco leggibile. Per farli apparire su righe separate, aggiungi `display: block` all'elemento `label`, e aggiungi una proprietà `margin` con il valore `0.5rem 0`, per separarli gli uni dagli altri.
+Visto che gli elementi `label` sono inline di default, vengono visualizzati affiancati sulla stessa riga, rendendo il testo poco leggibile. Per farli apparire su righe separate, aggiungi `display: block` all'elemento `label` e aggiungi una proprietà `margin` con il valore `0.5rem 0`, per separarli gli uni dagli altri.
 
 # --hints--
 
@@ -17,7 +18,7 @@ Dovresti usare un selettore `label`.
 assert.exists(new __helpers.CSSHelp(document).getStyle('label'));
 ```
 
-È necessario aggiungere una proprietà `display` con il valore `block`.
+Dovresti aggiungere una proprietà `display` con il valore `block`.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('label')?.display, 'block');
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b49686792938718b90d3.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b49686792938718b90d3.md
index 3ca117f0874..a2c83ce0100 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b49686792938718b90d3.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3b49686792938718b90d3.md
@@ -7,7 +7,7 @@ dashedName: step-26
 
 # --description--
 
-I valori delle variabili che hai assegnato finora sono tutti dei numeri. JavaScript ha diversi tipi di dati. Il prossimo che userai sarà la <dfn>stringa</dfn>. Le stringhe vengono usate per conservare cose come parole o testo. Le stringhe sono racchiuse da virgolette doppie, singole o backtick. Ecco un esempio di dichiarazione di una variabile con una stringa:
+I valori delle variabili che hai assegnato finora sono tutti dei numeri. JavaScript ha diversi tipi di dati. The next one you will use is the <dfn>string</dfn>. Le stringhe vengono usate per conservare cose come parole o testo. Le stringhe sono racchiuse da virgolette doppie, singole o backtick. Ecco un esempio di dichiarazione di una variabile con una stringa:
 
 ```js
 let developer = "Naomi";
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bfabe119461eb13ccbd6.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bfabe119461eb13ccbd6.md
index eed48a208c4..44c2ffe686e 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bfabe119461eb13ccbd6.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bfabe119461eb13ccbd6.md
@@ -7,7 +7,7 @@ dashedName: step-45
 
 # --description--
 
-Now you need to modify your display text. Change the `innerText` of the `text` to be `You enter the store.`.
+Ora devi modificare il testo mostrato. Cambia il valore di `innerText` di `text` in `You enter the store.`.
 
 # --hints--
 
@@ -17,19 +17,19 @@ You should use dot notation to access the `innerText` property of `text`.
 assert.match(code, /text\.innerText/);
 ```
 
-You should not use `let` or `const` to access the `innerText` property of `text`.
+Non dovresti usare `let` o `const` per accedere alla proprietà `innerText` di `text`.
 
 ```js
 assert.notMatch(code, /(let|const)\s+text.innerText/);
 ```
 
-You should update the `innerText` property of `text` to be `You enter the store.`.
+Dovresti aggiornare la proprietà `innerText` di `text` in modo che sia `You enter the store.`.
 
 ```js
 assert.match(code, /text\.innerText\s*=\s*('|")You enter the store.\1/);
 ```
 
-You should update the `innerText` property within your `goStore` function.
+Dovresti aggiornare la proprietà `innerText` nella funzione `goStore`.
 
 ```js
 assert.match(goStore.toString(), /text\.innerText\s*=\s*('|")You enter the store.\1/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ade9b2f5b30ef0b606c2.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ade9b2f5b30ef0b606c2.md
index 7ac20d72a3e..4796fc75d08 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ade9b2f5b30ef0b606c2.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ade9b2f5b30ef0b606c2.md
@@ -7,17 +7,17 @@ dashedName: step-57
 
 # --description--
 
-Add one final property to the object named `text`. Give this property the final `text.innerText` value from the `goTown` function.
+Aggiungi all'oggetto un'ultima proprietà chiamata `text`. Dai a questa proprietà l'ultimo valore di `text.innerText` dalla funzione `goTown`.
 
 # --hints--
 
-Your first `locations` value should have a `text` property.
+Il primo valore di `locations` dovrebbe avere una proprietà `text`.
 
 ```js
 assert.isDefined(locations[0]["text"]);
 ```
 
-Your `text` property should be a string.
+La proprietà `text` dovrebbe essere una stringa.
 
 ```js
 assert.isString(locations[0]["text"]);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b0b5053f16111b0b6b5f.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b0b5053f16111b0b6b5f.md
index c60cf5907da..cfbe82cb30c 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b0b5053f16111b0b6b5f.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b0b5053f16111b0b6b5f.md
@@ -7,41 +7,41 @@ dashedName: step-59
 
 # --description--
 
-Now you can consolidate some of your code. Start by copying the code from inside the `goTown` function and paste it into your `update` function. Then, remove all the code from inside the `goTown` and `goStore` functions.
+Ora puoi consolidare una parte del tuo codice. Inizia copiando il codice dall'interno della funzione `goTown` e incollandolo nella funzione `update`. Poi, rimuovi tutto il codice dalle funzioni `goTown` e `goStore`.
 
 # --hints--
 
-Your `update` function should set `button1.innerText` to `Go to store`.
+La funzione `update` dovrebbe impostare `button1.innerText` su `Go to store`.
 
 ```js
 assert.match(update.toString(), /button1\.innerText\s*=\s*('|")Go to store\1/);
 ```
 
-Your `update` function should set `button2.innerText` to `Go to cave`.
+La funzione `update` dovrebbe impostare `button2.innerText` su `Go to cave`.
 
 ```js
 assert.match(update.toString(), /button2\.innerText\s*=\s*('|")Go to cave\1/);
 ```
 
-Your `update` function should set `button3.innerText` to `Fight dragon`.
+La funzione `update` dovrebbe impostare `button3.innerText` su `Fight dragon`.
 
 ```js
 assert.match(update.toString(), /button3\.innerText\s*=\s*('|")Fight dragon\1/);
 ```
 
-Your `update` function should set `button1.onclick` to `goStore`.
+La funzione `update` dovrebbe impostare `button1.onclick` su `goStore`.
 
 ```js
 assert.match(update.toString(), /button1\.onclick\s*=\s*goStore/);
 ```
 
-Your `update` function should set `button2.onclick` to `goCave`.
+La funzione `update` dovrebbe impostare `button2.onclick` su `goCave`.
 
 ```js
 assert.match(update.toString(), /button2\.onclick\s*=\s*goCave/);
 ```
 
-Your `update` function should set `button3.onclick` to `fightDragon`.
+La funzione `update` dovrebbe impostare `button3.onclick` su `fightDragon`.
 
 ```js
 assert.match(update.toString(), /button3\.onclick\s*=\s*fightDragon/);
@@ -53,13 +53,13 @@ Your `update` function should set `text.innerText` to `You are in the town squar
 assert.match(update.toString(), /text\.innerText\s*=\s*"You are in the town square. You see a sign that says \\"Store\\"\."/);
 ```
 
-Your `goTown` function should be empty.
+La funzione `goTown` dovrebbe essere vuota.
 
 ```js
 assert.match(goTown.toString(), /function goTown\(\) \{\}/);
 ```
 
-Your `goStore` function should be empty.
+La funzione `goStore` dovrebbe essere vuota.
 
 ```js
 assert.match(goStore.toString(), /function goStore\(\) \{\}/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c1154d3ae11aee80353f.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c1154d3ae11aee80353f.md
index 4731c369e1e..281a580536b 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c1154d3ae11aee80353f.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c1154d3ae11aee80353f.md
@@ -7,41 +7,41 @@ dashedName: step-66
 
 # --description--
 
-Following the same pattern as you did for the button text, update the three buttons' `onclick` assignments to be the first, second, and third values of the `button functions` array.
+Seguendo lo stesso schema che hai usato per il testo dei pulsanti, aggiorna le assegnazioni di `onclick` dei tre pulsanti in modo che siano il primo, il secondo e il terzo valore dell'array `button functions`.
 
 # --hints--
 
-You should access the first element of the `button functions` property of the `location` argument.
+Dovresti accedere al primo elemento della proprietà `button functions` dell'argomento `location`.
 
 ```js
 assert.match(update.toString(), /location\[('|")button functions\1\]\[0\]/);
 ```
 
-You should set the `button1.onclick` property to be the second element of the `button functions` property of the `location` argument.
+Dovresti impostare la proprietà `button1.onclick` in modo che sia il primo elemento della proprietà `button functions` dell'argomento `location`.
 
 ```js
 assert.match(update.toString(), /button1\.onclick\s*=\s*location\[('|")button functions\1\]\[0\]/);
 ```
 
-You should access the second element of the `button functions` property of the `location` argument.
+Dovresti accedere al secondo elemento della proprietà `button functions` dell'argomento `location`.
 
 ```js
 assert.match(update.toString(), /location\[('|")button functions\1\]\[1\]/);
 ```
 
-You should set the `button2.onclick` property to be the third element of the `button functions` property of the `location` argument.
+Dovresti impostare la proprietà `button2.onclick` in modo che sia il secondo elemento della proprietà `button functions` dell'argomento `location`.
 
 ```js
 assert.match(update.toString(), /button2\.onclick\s*=\s*location\[('|")button functions\1\]\[1\]/);
 ```
 
-You should access the third element of the `button functions` property of the `location` argument.
+Dovresti accedere al terzo elemento della proprietà `button functions` dell'argomento `location`.
 
 ```js
 assert.match(update.toString(), /location\[('|")button functions\1\]\[2\]/);
 ```
 
-You should set the `button3.onclick` property to be the third element of the `button functions` property of the `location` argument.
+Dovresti impostare la proprietà `button3.onclick` in modo che sia il terzo elemento della proprietà `button functions` dell'argomento `location`.
 
 ```js
 assert.match(update.toString(), /button3\.onclick\s*=\s*location\[('|")button functions\1\]\[2\]/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c151b23bf21bc7c4fcba.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c151b23bf21bc7c4fcba.md
index ca8a532ec15..aa2923d00a1 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c151b23bf21bc7c4fcba.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c151b23bf21bc7c4fcba.md
@@ -7,17 +7,17 @@ dashedName: step-67
 
 # --description--
 
-Finally, update the `text.innerText` assignment to equal the `text` from the location object. However, instead of using bracket notation, use <dfn>dot notation</dfn>. Here is an example of accessing the `name` property of an object called `obj`: `obj.name`.
+Infine, aggiorna l'assegnazione di `text.innerText` in modo che sia uguale a `text` dall'oggetto location. Invece di usare la notazione a parentesi, usa la <dfn>dot notation</dfn>. Ecco un esempio di come accedere alla proprietà `name` di un oggetto chiamato `obj`: `obj.name`.
 
 # --hints--
 
-You should use dot notation to access the `text` property of the `location` object.
+Dovresti usare la dot notation per accedere alla proprietà `text` dell'oggetto `location`.
 
 ```js
 assert.match(update.toString(), /location\.text/);
 ```
 
-You should set the `text.innerText` property to be the `text` property of the `location` object.
+Dovresti impostare la proprietà `text.innerText` in modo che sia la proprietà `text` dell'oggetto `location`.
 
 ```js
 assert.match(update.toString(), /text\.innerText\s*=\s*location\.text/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c173949f851c83c64756.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c173949f851c83c64756.md
index 422ff092c3e..f51175d0dc1 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c173949f851c83c64756.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c173949f851c83c64756.md
@@ -7,19 +7,19 @@ dashedName: step-68
 
 # --description--
 
-Now update your `goStore` function to call the `update` function. Pass the second element of the `locations` array as your argument.
+Adesso aggiorna la funzione `goStore` in modo che chiami la funzione `update`. Passa il secondo elemento dell'array `locations` come argomento.
 
-To make sure your refactoring is correct, try clicking your first button again. You should see the same changes to your webpage that you saw earlier.
+Per assicurarti che il refactoring sia corretto, prova a cliccare di nuovo sul primo pulsante. Dovresti vedere le stesse modifiche alla pagina web che hai visto prima.
 
 # --hints--
 
-Your `goStore` function should call the `update` function.
+La funzione `goStore` dovrebbe chiamare la funzione `update`.
 
 ```js
 assert.match(goStore.toString(), /update\(/);
 ```
 
-Your `goStore` function should pass the second element of the `locations` array as your argument to `update()`.
+La funzione `goStore` dovrebbe passare il secondo elemento dell'array `locations` come argomento di `update()`.
 
 ```js
 assert.match(goStore.toString(), /update\(locations\[1\]\)/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c242b25a531f2909e5bc.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c242b25a531f2909e5bc.md
index d7800eb4dce..fe8794ab284 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c242b25a531f2909e5bc.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c242b25a531f2909e5bc.md
@@ -7,29 +7,29 @@ dashedName: step-69
 
 # --description--
 
-Create two more empty functions named `fightSlime` and `fightBeast`. These functions will be used in your upcoming `cave` object.
+Crea altre due funzioni vuote chiamate `fightSlime` e `fightBeast`. Queste funzioni verranno usate nel futuro oggetto `cave`.
 
 # --hints--
 
-`fightSlime` should be a function.
+`fightSlime` dovrebbe essere una funzione.
 
 ```js
 assert.isFunction(fightSlime);
 ```
 
-`fightBeast` should be a function.
+`fightBeast` dovrebbe essere una funzione.
 
 ```js
 assert.isFunction(fightBeast);
 ```
 
-`fightSlime` should be empty.
+`fightSlime` dovrebbe essere vuota.
 
 ```js
 assert.match(fightSlime.toString(), /function fightSlime\(\) \{\}/);
 ```
 
-`fightBeast` should be empty.
+`fightBeast` dovrebbe essere vuota.
 
 ```js
 assert.match(fightBeast.toString(), /function fightBeast\(\) \{\}/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c2bbbd8aa82052f47c53.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c2bbbd8aa82052f47c53.md
index d96b10aaff6..f10c65d962a 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c2bbbd8aa82052f47c53.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c2bbbd8aa82052f47c53.md
@@ -7,38 +7,38 @@ dashedName: step-70
 
 # --description--
 
-Add a third object to the `locations` array. Give it the same properties as the other two objects.
+Aggiungi un terzo oggetto all'array `locations`. Dagli le stesse proprietà degli altri due oggetti.
 
-Set `name` to `cave`. Set `button text` to an array with the strings `Fight slime`, `Fight fanged beast`, and `Go to town square`. Set the `button functions` to an array with the variables `fightSlime`, `fightBeast`, and `goTown`. Set the `text` property to `You enter the cave. You see some monsters.`.
+Imposta `name` su `cave`. Imposta `button text` su un array con le stringhe `Fight slime`, `Fight fanged beast` e `Go to town square`. Imposta `button functions` su un array con le variabili `fightSlime`, `fightBeast`, `goTown`. Imposta la proprietà `text` su `You enter the cave. You see some monsters.`.
 
 # --hints--
 
-You should have three values in your `locations` array.
+Dovresti avere tre valori nell'array `locations`.
 
 ```js
 console.log(locations);
 assert.lengthOf(locations, 3);
 ```
 
-Your third `locations` value should be an object.
+Il terzo valore di `locations` dovrebbe essere un oggetto.
 
 ```js
 assert.isObject(locations[2]);
 ```
 
-Your third `locations` object should have a `name` property with the value of `cave`.
+Il terzo oggetto di `locations` dovrebbe avere una proprietà `name` con il valore `cave`.
 
 ```js
 assert.equal(locations[2].name, "cave");
 ```
 
-Your third `locations` object should have a `button text` property which is an array.
+Il terzo oggetto di `locations` dovrebbe avere una proprietà `button text` con un array come valore.
 
 ```js
 assert.isArray(locations[2]["button text"]);
 ```
 
-Your `button text` property should have the string values `Fight slime`, `Fight fanged beast`, and `Go to town square`.
+I valori della proprietà `button text` dovrebbero essere le stringhe `Fight slime`, `Fight fanged beast` e `Go to town square`.
 
 ```js
 assert.equal(locations[2]["button text"][0], "Fight slime");
@@ -46,13 +46,13 @@ assert.equal(locations[2]["button text"][1], "Fight fanged beast");
 assert.equal(locations[2]["button text"][2], "Go to town square");
 ```
 
-Your third `locations` object should have a `button functions` property which is an array.
+Il terzo oggetto di `locations` dovrebbe avere una proprietà `button functions` con un array come valore.
 
 ```js
 assert.isArray(locations[2]["button functions"]);
 ```
 
-Your `button functions` property should have the function values `fightSlime`, `fightBeast`, and `goTown`.
+La proprietà `button functions` dovrebbe avere i valori di funzione `fightSlime`, `fightBeast` e `goTown`.
 
 ```js
 assert.equal(locations[2]["button functions"][0], fightSlime);
@@ -60,13 +60,13 @@ assert.equal(locations[2]["button functions"][1], fightBeast);
 assert.equal(locations[2]["button functions"][2], goTown);
 ```
 
-Your third `locations` object should have a `text` property which is a string.
+Il terzo oggetto di `locations` dovrebbe avere una proprietà `text` con una stringa come valore.
 
 ```js
 assert.isString(locations[2].text);
 ```
 
-Your third `locations` object should have a `text` property with the value of `You enter the cave. You see some monsters.`.
+Il terzo oggetto di `locations` dovrebbe avere una proprietà `text` con il valore `You enter the cave. You see some monsters.`.
 
 ```js
 assert.equal(locations[2].text, "You enter the cave. You see some monsters.");
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c31ec0ec78216a1c36a0.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c31ec0ec78216a1c36a0.md
index 1d663fa1670..97d4d3c40f3 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c31ec0ec78216a1c36a0.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c31ec0ec78216a1c36a0.md
@@ -7,31 +7,31 @@ dashedName: step-71
 
 # --description--
 
-Now that you have a `cave` location object, update your `goCave` function to call `update` and pass that new `cave` location. Remember that this is the third element in your `locations` array.
+Ora che hai un oggetto per la location `cave`, aggiorna la funzione `goCave` in modo che chiami `update` e passale la nuova location `cave`. Ricorda che questo è il terzo elemento dell'array `locations`.
 
-Don't forget to remove your `console.log` call!
+Non dimenticare di rimuovere la chiamata `console.log`!
 
 # --hints--
 
-You should use bracket notation to access the third element in your `locations` array.
+Dovresti usare la notazione a parentesi per accedere al terzo elemento dell'array `locations`.
 
 ```js
 assert.match(code, /locations\[2\]/);
 ```
 
-You should pass the third element in your `locations` array to `update`.
+Dovresti passare il terzo elemento dell'array `locations` a `update`.
 
 ```js
 assert.match(code, /update\(locations\[2\]\)/);
 ```
 
-You should call `update` with the third element in your `locations` array in your `goCave` function.
+Dovresti chiamare `update` con il terzo elemento dell'array `locations` nella funzione `goCave`.
 
 ```js
 assert.match(goCave.toString(), /update\(locations\[2\]\)/);
 ```
 
-You should not have the `console.log` statement in your `goCave` function.
+Non dovresti avere l'istruzione `console.log` nella funzione `goCave`.
 
 ```js
 assert.notMatch(goCave.toString(), /console\.log/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c370ad8c68227137e0bc.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c370ad8c68227137e0bc.md
index 4d33b655a6b..37d3055bf8f 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c370ad8c68227137e0bc.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c370ad8c68227137e0bc.md
@@ -7,19 +7,19 @@ dashedName: step-72
 
 # --description--
 
-Now that your `store` and `cave` locations are complete, you can code the actions the player takes at those locations. Inside the `buyHealth` function, set `gold` equal to `gold` minus `10`.
+Ora che le location `store` e `cave` sono complete, puoi mettere in codice le azioni che il giocatore può svolgere in queste location. All'interno della funzione `buyHealth`, imposta `gold` uguale a `gold` meno `10`.
 
-For example, here is how you would set `num` equal to `5` less than `num`: `num = num - 5;`.
+Ad esempio, ecco come puoi impostare `num` uguale a `num` meno `5`: `num = num - 5;`.
 
 # --hints--
 
-You should subtract `10` from `gold`.
+Dovresti sottrarre `10` da `gold`.
 
 ```js
 assert.match(code, /gold\s*=\s*gold\s*-\s*10/);
 ```
 
-Your `buyHealth` function should reduce `gold` by `10`.
+La funzione `buyHealth` dovrebbe ridurre `gold` di `10`.
 
 ```js
 gold = 10;
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c3ebc6c35e23785e1a19.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c3ebc6c35e23785e1a19.md
index df1d38ffce5..bd39178be22 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c3ebc6c35e23785e1a19.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c3ebc6c35e23785e1a19.md
@@ -7,17 +7,17 @@ dashedName: step-73
 
 # --description--
 
-After the `gold` is updated, add a line to set `health` equal to `health` plus `10`.
+Dopo aver aggiornato `gold`, aggiungi una riga per impostare `health` uguale a `health` più `10`.
 
 # --hints--
 
-You should add `10` to `health`.
+Dovresti aggiungere `10` a `health`.
 
 ```js
 assert.match(code, /health\s*=\s*health\s*\+\s*10/);
 ```
 
-Your `buyHealth` function should increase `health` by `10`.
+La funzione `buyHealth` dovrebbe aumentare `health` di `10`.
 
 ```js
 health = 10;
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c41ecaf1bd24536129b8.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c41ecaf1bd24536129b8.md
index a5bb57d211c..15abce15bf1 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c41ecaf1bd24536129b8.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c41ecaf1bd24536129b8.md
@@ -7,25 +7,25 @@ dashedName: step-74
 
 # --description--
 
-There is a shorthand way to add or subtract from a variable called <dfn>compound assignment</dfn>. For example, changing `num = num + 5` to compound assignment would look like `num += 5`.
+Esiste una scorciatoia per aggiungere o sottrarre valori a una variabile chiamata <dfn>assegnazione composta</dfn>. Ad esempio, cambiare `num = num + 5` in un'assegnazione composta sarebbe `num += 5`.
 
-Update both lines inside your `buyHealth` function to use compound assignment.
+Aggiorna entrambe le righe nella funzione `buyHealth` usando l'assegnazione composta.
 
 # --hints--
 
-You should change `gold` to use compound assignment.
+Dovresti cambiare `gold` in modo che utilizzi l'assegnazione composta.
 
 ```js
 assert.notMatch(code, /gold\s*=\s*gold\s*-\s*10/);
 ```
 
-You should change `health` to use compound assignment.
+Dovresti cambiare `health` in modo che utilizzi l'assegnazione composta.
 
 ```js
 assert.notMatch(code, /health\s*=\s*health\s*\+\s*10/);
 ```
 
-Your `buyHealth` function should still update the values.
+La funzione `buyHealth` dovrebbe ancora aggiornare i valori.
 
 ```js
 gold = 10;
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c465fa7b0c252f4a8f0c.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c465fa7b0c252f4a8f0c.md
index 70e928a9bd6..50e9c5fc264 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c465fa7b0c252f4a8f0c.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c465fa7b0c252f4a8f0c.md
@@ -7,9 +7,9 @@ dashedName: step-75
 
 # --description--
 
-Now that you are updating the `gold` and `health` variables, you need to display those new values on the game screen. After your assignment lines, assign the `innerText` property of `goldText` to be the variable `gold`. Use the same pattern to update `healthText` with the `health` variable.
+Ora che stai aggiornando le variabili `gold` e `health`, hai bisogno di mostrare i nuovi valori sullo schermo di gioco. Dopo le righe di assegnazione, assegna la proprietà `innerText` di `goldText` in modo che sia la variabile `gold`. Usa lo stesso modello per aggiornare `healthText` con la variabile `health`.
 
-Here is an example:
+Ecco un esempio:
 
 ```js
 let value = 100;
@@ -17,11 +17,11 @@ const total = document.querySelector('#total');
 total.innerText = value;
 ```
 
-You can test this by clicking your "Go to store" button, followed by your "Buy Health" button.
+Puoi fare un test cliccando il pulsante "Go to store", seguito dal pulsante "Buy Health".
 
 # --hints--
 
-Your `buyHealth` function should update the text of `healthText` to be the value of `health`.
+La funzione `buyHealth` dovrebbe aggiornare il testo di `healthText` in modo che corrisponda al valore di `health`.
 
 ```js
 health = 10;
@@ -30,7 +30,7 @@ const target = document.querySelector('#healthText');
 assert.equal(target.innerText, '20');
 ```
 
-Your `buyHealth` function should update the text of `goldText` to be the value of `gold`.
+La funzione `buyHealth` dovrebbe aggiornare il testo di `goldText` in modo che corrisponda al valore di `gold`.
 
 ```js
 gold = 10;
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c4db0710f3260f867a92.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c4db0710f3260f867a92.md
index 89161b6c20f..ba3e293d886 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c4db0710f3260f867a92.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c4db0710f3260f867a92.md
@@ -7,7 +7,7 @@ dashedName: step-76
 
 # --description--
 
-What if the player doesn't have enough gold to buy health? When you want to run code conditionally, you can use the `if` statement. Put all of the code in your `buyHealth` function inside an `if` statement. For example:
+Cosa succede se il giocatore non ha abbastanza oro per comprare vita? Quando vuoi eseguire del codice in modo condizionale, puoi usare l'istruzione `if`. Metti tutto il codice nella funzione `buyHealth` all'interno di un'istruzione `if`. Ad esempio:
 
 ```js
 function myFunction() {
@@ -17,23 +17,23 @@ function myFunction() {
 }
 ```
 
-For now, follow that pattern to use a string `condition` inside your `if` statement.
+Per ora, segui questo modello per usare una stringa `condition` nell'istruzione `if`.
 
 # --hints--
 
-Your `buyHealth` function should have an `if` statement.
+L'elemento `buyHealth` dovrebbe avere un'istruzione `if`.
 
 ```js
 assert.match(buyHealth.toString(), /if/);
 ```
 
-Your `if` statement should have the string `condition` for the condition.
+L'istruzione `if` dovrebbe avere la stringa `condition` come condizione.
 
 ```js
 assert.match(buyHealth.toString(), /if\s*\(('|")condition\1\)/);
 ```
 
-All of your `buyHealth` code should be inside the `if` statement.
+Tutto il codice di `buyHealth` dovrebbe essere in una istruzione `if`.
 
 ```js
 assert.match(buyHealth.toString(), /if\s*\(('|")condition\1\)\s*\{[\s\S]*\}/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c56247609626fa4a8d6e.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c56247609626fa4a8d6e.md
index e68eacaf744..0d69482d799 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c56247609626fa4a8d6e.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c56247609626fa4a8d6e.md
@@ -7,9 +7,9 @@ dashedName: step-77
 
 # --description--
 
-The `condition` string is just a placeholder. Change the `if` statement condition to check if `gold` is greater than or equal to `10`.
+La stringa `condition` è soltanto un segnaposto. Cambia la condizione dell'istruzione `if` in modo da verificare se `gold` è maggiore o uguale a `10`.
 
-Here is an `if` statement that checks if `num` is greater than or equal to `5`:
+Ecco un'istruzione `if` che verifica se `num` è maggiore o uguale a `5`:
 
 ```js
 if (num >= 5) {
@@ -19,13 +19,13 @@ if (num >= 5) {
 
 # --hints--
 
-Your `if` statement should check if `gold` is greater than or equal to `10`.
+L'istruzione `if` dovrebbe verificare se `gold` è maggiore o uguale a `10`.
 
 ```js
 assert.match(buyHealth.toString(), /if\s*\(gold\s*>=\s*10\)/);
 ```
 
-Your `buyHealth` function should update `health` and `gold` if `gold` is greater than or equal to `10`.
+La funzione `buyHealth` dovrebbe aggiornare `health` e `gold` se `gold` è maggiore o uguale a `10`.
 
 ```js
 gold = 10;
@@ -39,7 +39,7 @@ const goldElement = document.getElementById('goldText');
 assert.equal(goldElement.innerText, '0');
 ```
 
-Your `buyHealth` function should not update `health` and `gold` if `gold` is less than `10`.
+La funzione `buyHealth` non dovrebbe aggiornare `health` e `gold` se `gold` è minore di `10`.
 
 ```js
 gold = 5;
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c5db7888af27af23f0dd.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c5db7888af27af23f0dd.md
index d29d4fa92c7..a9b1cd0a271 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c5db7888af27af23f0dd.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c5db7888af27af23f0dd.md
@@ -7,9 +7,9 @@ dashedName: step-78
 
 # --description--
 
-Now when a player tries to buy health it will only work if they have enough money. If they do not, nothing will happen. Add an `else` statement where you can put code to run if a player does not have enough money.
+Ora quando un giocatore cerca di comprare vita, potrà farlo solo se ha abbastanza soldi. In caso contrario, non accadrà nulla. Aggiungi un'istruzione `else` in cui poter inserire del codice da eseguire se un giocatore non ha abbastanza soldi.
 
-Here is an example of an empty `else` statement:
+Ecco un esempio di un'istruzione `else` vuota:
 
 ```js
 if (num >= 5) {
@@ -21,13 +21,13 @@ if (num >= 5) {
 
 # --hints--
 
-Your `buyHealth` function should have an `else` statement.
+La funzione `buyHealth` dovrebbe avere un'istruzione `else`.
 
 ```js
 assert.match(buyHealth.toString(), /else/);
 ```
 
-Your `else` statement should come after your `if` statement.
+L'istruzione `else` dovrebbe trovarsi dopo l'istruzione `if`.
 
 ```js
 const split = buyHealth.toString().split(/\s/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c65b75664c28a8e59c16.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c65b75664c28a8e59c16.md
index 3ef17db2434..c40c10b8783 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c65b75664c28a8e59c16.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c65b75664c28a8e59c16.md
@@ -7,17 +7,17 @@ dashedName: step-79
 
 # --description--
 
-Inside the `else` statement, set `text.innerText` to equal `You do not have enough gold to buy health.`.
+All'interno dell'istruzione `else`, imposta `text.innerText` in modo che sia `You do not have enough gold to buy health.`.
 
 # --hints--
 
-Your `buyHealth` function should set `text.innerText` to equal `You do not have enough gold to buy health.`.
+La funzione `buyHealth` dovrebbe impostare `text.innerText` su `You do not have enough gold to buy health.`.
 
 ```js
 assert.match(buyHealth.toString(), /text\.innerText\s*=\s*('|")You do not have enough gold to buy health\.\1/);
 ```
 
-Your `buyHealth` function should update `text.innerText` when `gold` is less than `10`.
+La funzione `buyHealth` dovrebbe aggiornare `text.innerText` quando `gold` è minore di `10`.
 
 ```js
 gold = 5;
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c6815f5f1a29735efe1b.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c6815f5f1a29735efe1b.md
index 90b8c75c72f..f4dc955aeb0 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c6815f5f1a29735efe1b.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c6815f5f1a29735efe1b.md
@@ -7,23 +7,23 @@ dashedName: step-80
 
 # --description--
 
-Use `const` to create a `weapons` variable above your `locations` array. Assign it an empty array.
+Usa `const` per creare una variabile `weapons` sopra l'array `locations`. Assegnale un array vuoto.
 
 # --hints--
 
-You should use `const` to declare your `weapons` variable.
+Dovresti usare la parola chiave `const` per dichiarare la variabile `weapons`.
 
 ```js
 assert.match(code, /const weapons/i);
 ```
 
-Your `weapons` variable should be an array.
+La variabile `weapons` dovrebbe essere un array.
 
 ```js
 assert.isArray(weapons);
 ```
 
-Your `weapons` variable should be empty.
+La variabile `weapons` dovrebbe essere vuota.
 
 ```js
 assert.equal(weapons.length, 0);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7322e42962ad53ad204.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7322e42962ad53ad204.md
index bed05c8d88b..b65820a6c09 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7322e42962ad53ad204.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7322e42962ad53ad204.md
@@ -7,17 +7,17 @@ dashedName: step-81
 
 # --description--
 
-Just like your `locations` array, your `weapons` array will hold objects. Add four objects to the `weapons` array, each with two properties: `name` and `power`. The first should have the `name` set to `stick` and the `power` set to `5`. The second should be `dagger` and `30`. The third, `claw hammer` and `50`. The fourth, `sword` and `100`.
+Proprio come l'array `locations`, l'array `weapons` conterrà oggetti. Aggiungi quattro oggetti all'array `weapons`, ognuno con due proprietà: `name` e `power`. Il primo dovrebbe avere `name` impostato su `stick` e `power` impostato a `5`. Il secondo dovrebbe avere `dagger` e `30`. Il terzo, `claw hammer` e `50`. Il quarto, `sword` e `100`.
 
 # --hints--
 
-Your `weapons` array should have four values.
+L'array `weapons` dovrebbe avere quattro valori.
 
 ```js
 assert.lengthOf(weapons, 4);
 ```
 
-Your `weapons` array should have four objects.
+L'array `weapons` dovrebbe avere quattro oggetti.
 
 ```js
 assert.isObject(weapons[0]);
@@ -26,28 +26,28 @@ assert.isObject(weapons[2]);
 assert.isObject(weapons[3]);
 ```
 
-Your first `weapons` object should have the `name` set to `stick` and the `power` set to `5`.
+Il primo oggetto `weapons` dovrebbe avere `name` impostato su `stick` e `power` impostato a `5`.
 
 ```js
 assert.equal(weapons[0].name, 'stick');
 assert.equal(weapons[0].power, 5);
 ```
 
-Your second `weapons` object should have the `name` set to `dagger` and the `power` set to `30`.
+Il secondo oggetto `weapons` dovrebbe avere `name` impostato su `dagger` e `power` impostato a `30`.
 
 ```js
 assert.equal(weapons[1].name, 'dagger');
 assert.equal(weapons[1].power, 30);
 ```
 
-Your third `weapons` object should have the `name` set to `claw hammer` and the `power` set to `50`.
+Il terzo oggetto `weapons` dovrebbe avere `name` impostato su `claw hammer` e `power` impostato a `50`.
 
 ```js
 assert.equal(weapons[2].name, 'claw hammer');
 assert.equal(weapons[2].power, 50);
 ```
 
-Your fourth `weapons` object should have the `name` set to `sword` and the `power` set to `100`.
+Il quarto oggetto `weapons` dovrebbe avere `name` impostato su `sword` e `power` impostato a `100`.
 
 ```js
 assert.equal(weapons[3].name, 'sword');
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7a59e72c02bb1c717d2.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7a59e72c02bb1c717d2.md
index 422e0ad66b5..d19a37955db 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7a59e72c02bb1c717d2.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7a59e72c02bb1c717d2.md
@@ -7,17 +7,17 @@ dashedName: step-82
 
 # --description--
 
-Inside your `buyWeapon` function, add an `if` statement to check if `gold` is greater than or equal to `30`.
+All'interno della funzione `buyWeapon`, aggiungi un'istruzione `if` per verificare se `gold` è maggiore o uguale a `30`.
 
 # --hints--
 
-Your `buyWeapon` function should have an `if` statement.
+La funzione `buyWeapon` dovrebbe avere un'istruzione `if`.
 
 ```js
 assert.include(buyWeapon.toString(), 'if');
 ```
 
-Your `if` statement should check if `gold` is greater than or equal to `30`.
+L'istruzione `if` dovrebbe verificare se `gold` è maggiore o uguale a `30`.
 
 ```js
 assert.match(buyWeapon.toString(), /if\s*\(gold\s*>=\s*30\)/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c89e4272512d44fc1c66.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c89e4272512d44fc1c66.md
index cded49b4395..a0c3e920c41 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c89e4272512d44fc1c66.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c89e4272512d44fc1c66.md
@@ -7,17 +7,17 @@ dashedName: step-83
 
 # --description--
 
-Similar to your `buyHealth` function, set `gold` equal to 30 less than its current value. Make sure this is inside your `if` statement.
+In modo simile alla funzione `buyHealth`, imposta `gold` uguale al suo valore attuale meno 30. Assicurati di farlo all'interno dell'istruzione `if`.
 
 # --hints--
 
-You should use compound assignment to subtract `30` from `gold`.
+Dovresti usare l'assegnazione composta per sottrarre `30` da `gold`.
 
 ```js
 assert.match(buyWeapon.toString(), /gold\s*-=\s*30/);
 ```
 
-Your `buyWeapon` function should reduce `gold` by `30`.
+La funzione `buyWeapon` dovrebbe ridurre `gold` di `30`.
 
 ```js
 gold = 30;
@@ -25,7 +25,7 @@ buyWeapon();
 assert.equal(gold, 0);
 ```
 
-Your code should be in your `if` statement.
+Il codice dovrebbe essere nell'istruzione `if`.
 
 ```js
 gold = 20;
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c8cee8e5cf2e001789b4.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c8cee8e5cf2e001789b4.md
index 7f2575cbb11..1f82babf8df 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c8cee8e5cf2e001789b4.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c8cee8e5cf2e001789b4.md
@@ -9,17 +9,17 @@ dashedName: step-84
 
 The value of the `currentWeapon` variable corresponds to an index in the `weapons` array. The player starts with a `stick`, since `currentWeapon` starts at `0` and `weapons[0]` is the `stick` weapon.
 
-In the `buyWeapon` function, add one to `currentWeapon` - the user is buying the next weapon in the `weapons` array.
+Nella funzione `buyWeapon`, aggiungi uno a `currentWeapon` - l'utente sta comprando l'arma successiva nell'array `weapons`.
 
 # --hints--
 
-You should use compound assignment to add one to `currentWeapon`.
+Dovresti usare l'assegnazione composta per aggiungerne uno a `currentWeapon`.
 
 ```js
 assert.match(buyWeapon.toString(), /currentWeapon\s*\+=\s*1/);
 ```
 
-Your `buyWeapon` function should increase `currentWeapon` by `1`.
+La funzione `buyWeapon` dovrebbe aumentare `currentWeapon` di `1`.
 
 ```js
 gold = 30;
@@ -28,7 +28,7 @@ buyWeapon();
 assert.equal(currentWeapon, 1);
 ```
 
-Your code should be in your `if` statement.
+Il codice dovrebbe essere nell'istruzione `if`.
 
 ```js
 gold = 20;
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ca22d29fe62f3952bdf5.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ca22d29fe62f3952bdf5.md
index dbd8006158d..4bfc38de567 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ca22d29fe62f3952bdf5.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ca22d29fe62f3952bdf5.md
@@ -7,19 +7,19 @@ dashedName: step-85
 
 # --description--
 
-Increasing a value by 1, or <dfn>incrementing</dfn>, has a special operator in JavaScript: `++`. If you wanted to increase `num` by 1, you could write `num++`.
+Per aumentare un valore di 1, o <dfn>incrementare</dfn>, esiste un operatore speciale in JavaScript: `++`. Se voui aumentare `num` di 1, puoi scrivere `num++`.
 
-Change your `currentWeapon` assignment to use the increment operator.
+Cambia l'assegnazione di `currentWeapon` in modo che usi l'operatore di incremento.
 
 # --hints--
 
-You should use the increment operator to increase `currentWeapon` by `1`.
+Dovresti usare l'operatore di incremento per aumentare `currentWeapon` di `1`.
 
 ```js
 assert.match(buyWeapon.toString(), /currentWeapon\s*\+\s*\+/);
 ```
 
-You should not use compound assignment to increase `currentWeapon` by `1`.
+Non dovresti usare l'assegnazione composta per aumentare `currentWeapon` di `1`.
 
 ```js
 assert.notMatch(buyWeapon.toString(), /currentWeapon\s*\+=\s*1/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cb19bd7f8a304e5427a1.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cb19bd7f8a304e5427a1.md
index 29c3d761fb0..b1c1614ead6 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cb19bd7f8a304e5427a1.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cb19bd7f8a304e5427a1.md
@@ -7,17 +7,17 @@ dashedName: step-86
 
 # --description--
 
-Now update the `goldText` element to display the new value of `gold`, and update the `text` element to display `You now have a new weapon.`.
+Adesso aggiorna l'elemento `goldText` per mostrare il nuovo valore di `gold` e aggiorna l'elemento `text` in modo che mostri `You now have a new weapon.`.
 
 # --hints--
 
-You should update the `innerText` property of the `goldText` element to be `gold`.
+Dovresti aggiornare la proprietà `innerText` dell'elemento `goldText` in modo che sia `gold`.
 
 ```js
 assert.match(buyWeapon.toString(), /goldText\.innerText\s*=\s*gold/);
 ```
 
-You should update the `innerText` property of the `text` element to be `You now have a new weapon.`.
+Dovresti aggiornare la proprietà `innerText` dell'elemento `text` in modo che sia `You now have a new weapon.`.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*=\s*('|")You now have a new weapon\.\1/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
index d91e6245ebe..dc65e03e17e 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
@@ -7,29 +7,29 @@ dashedName: step-87
 
 # --description--
 
-You should tell the player what weapon they bought. In between the two lines you just wrote, use `let` to initialize a new variable called `newWeapon`. Set this to equal `weapons`.
+Dovresti dire al giocatore quale arma ha acquistato. Tra le due righe che hai appena scritto, usa `let` per inizializzare una nuova variabile chiamata `newWeapon`. Impostala uguale a `weapons`.
 
 # --hints--
 
-Your `buyWeapon` function should have a variable named `newWeapon`.
+La funzione `buyWeapon` dovrebbe avere una variabile chiamata `newWeapon`.
 
 ```js
 assert.match(buyWeapon.toString(), /newWeapon/);
 ```
 
-You should use `let` to declare `newWeapon`.
+Dovresti usare `let` per dichiarare `newWeapon`.
 
 ```js
 assert.match(code, /let\s+newWeapon/);
 ```
 
-`newWeapon` should be initialised to have the value of `weapons`. Don't forget your semi-colon.
+`newWeapon` dovrebbe essere inizializzata con il valore di `weapons`. Non dimenticare il punto e virgola.
 
 ```js
 assert.match(buyWeapon.toString(), /newWeapon\s*=\s*weapons;/);
 ```
 
-`newWeapon` should be declared before you modify `text`.
+`newWeapon` dovrebbe essere dichiarata prima di modificare `text`.
 
 ```js
 const contents = buyWeapon.toString().split(/\s+/);
@@ -206,7 +206,7 @@ function buyWeapon() {
     gold -= 30;
     currentWeapon++;
     goldText.innerText = gold;
-    
+
     text.innerText = "You now have a new weapon.";
   }
 }
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cce1b0c32c33017cf2e9.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cce1b0c32c33017cf2e9.md
index 165962a1920..ccdc72a75bd 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cce1b0c32c33017cf2e9.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cce1b0c32c33017cf2e9.md
@@ -7,11 +7,11 @@ dashedName: step-88
 
 # --description--
 
-For your `newWeapon` variable, use bracket notation to use the `currentWeapon` variable to access an object within the `weapons` array.
+Per la variabile `newWeapon`, usa la notazione a parentesi per utilizzare la variabile `currentWeapon` per accedere a un oggetto all'interno dell'array `weapons`.
 
-When you use a variable in bracket notation, you are accessing the property or index by the *value* of that variable.
+Quando usi una variabile in notazione a parentesi, stai consultando una proprietà o un indice in base al *valore* di quella variabile.
 
-For example, this code uses the `index` variable to access a value of `array`.
+Ad esempio, questo codice utilizza l'indice (`index`) della variabile per accedere a un valore dell'`array`.
 
 ```js
 let value = array[index];
@@ -19,7 +19,7 @@ let value = array[index];
 
 # --hints--
 
-You should update `newWeapon` to have the value of `weapons[currentWeapon]`.
+Dovresti aggiornare `newWeapon` in modo che abbia il valore di `weapons[currentWeapon]`.
 
 ```js
 assert.match(buyWeapon.toString(), /newWeapon\s*=\s*weapons\[currentWeapon\]/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce1dfc990134162b3bd9.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce1dfc990134162b3bd9.md
index 7165051ad52..659fc1193f4 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce1dfc990134162b3bd9.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce1dfc990134162b3bd9.md
@@ -7,11 +7,11 @@ dashedName: step-89
 
 # --description--
 
-`weapons[currentWeapon]` is an object. Use dot notation to get the `name` property of that object.
+`weapons[currentWeapon]` è un oggetto. Usa la dot notation per ottenere la proprietà `name` dell'oggetto.
 
 # --hints--
 
-You should update `newWeapon` to have the value of `weapons[currentWeapon].name`.
+Dovresti aggiornare `newWeapon` in modo che abbia il valore di `weapons[currentWeapon].name`.
 
 ```js
 assert.match(buyWeapon.toString(), /newWeapon\s*=\s*weapons\[currentWeapon\]\.name;/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
index 4b1f8fb6cb6..f4062d306bc 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
@@ -7,9 +7,9 @@ dashedName: step-90
 
 # --description--
 
-You can insert variables into a string with the <dfn>concatenation operator</dfn> `+`. Update the `You now have a new weapon.` string to say `You now have a ` and the name of the new weapon. Remember to end the sentence with a period.
+Puoi inserire variabili in una stringa con l'<dfn>operatore di concatenazione</dfn> `+`. Aggiorna la stringa `You now have a new weapon.` in modo che dica `You now have a` e il nome della nuova arma. Ricordati di terminare la frase con un punto.
 
-Here is an example that creates the string `Hello, our name is freeCodeCamp.`:
+Ecco un esempio che crea la stringa `Hello, our name is freeCodeCamp.`:
 
 ```js
 const ourName = "freeCodeCamp";
@@ -18,19 +18,19 @@ const ourStr = "Hello, our name is " + ourName + ".";
 
 # --hints--
 
-You should update the `text.innerText` assignment to start with the string `You now have a `.
+Dovresti aggiornare l'assegnazione di `text.innerText` in modo che inizi con la stringa `You now have a`.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*=\s*('|")You now have a \1/);
 ```
 
-You should use the concatenation operator to add `newWeapon` to the end of the `text.innerText` string.
+Dovresti usare l'operatore di concatenazione per aggiungere `newWeapon` alla fine della stringa di `text.innerText`.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*=\s*('|")You now have a \1\s*\+\s*newWeapon/);
 ```
 
-You should use the concatenation operator to end your `text.innerText` string with a `.`.
+Dovresti usare l'operatore di concatenazione per terminare la stringa di `text.innerText` con un `.`.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*=\s*('|")You now have a \1\s*\+\s*newWeapon\s*\+\s*('|")\.\2/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
index 748ab4d2f08..fdfcfec71b0 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
@@ -7,9 +7,9 @@ dashedName: step-91
 
 # --description--
 
-Back at the beginning of this project, you created the `inventory` array. Add the `newWeapon` to the end of the `inventory` array using the `push()` method.
+All'inizio di questo progetto, hai creato l'array `inventory`. Aggiungi `newWeapon` alla fine dell'array `inventory` usando il metodo `push()`.
 
-Here is an example:
+Ecco un esempio:
 
 ```js
 const arr = ["first"];
@@ -17,23 +17,23 @@ const next = "second";
 arr.push(next);
 ```
 
-`arr` would now have the value `["first", "second"]`.
+`arr` adesso avrà il valore `["first", "second"]`.
 
 # --hints--
 
-You should use the `push` method on `inventory`.
+Dovresti usare il metodo `push` su `inventory`.
 
 ```js
 assert.match(buyWeapon.toString(), /inventory\.push/)
 ```
 
-You should `push` the value of `newWeapon` to the `inventory` array.
+Dovresti usare `push` per inserire il valore di `newWeapon` nell'array `inventory`.
 
 ```js
 assert.match(buyWeapon.toString(), /inventory\.push\s*\(\s*newWeapon\s*\)/)
 ```
 
-Your `buyWeapon` function should add the value of `newWeapon` to the `inventory` array.
+La funzione `buyWeapon` dovrebbe aggiungere il valore di `newWeapon` all'array `inventory`.
 
 ```js
 inventory = [];
@@ -214,7 +214,7 @@ function buyWeapon() {
     goldText.innerText = gold;
     let newWeapon = weapons[currentWeapon].name;
     text.innerText = "You now have a " + newWeapon + ".";
-    
+
   }
 }
 --fcc-editable-region--
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
index b7219fb9be1..9f4b158f7ad 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
@@ -7,24 +7,24 @@ dashedName: step-92
 
 # --description--
 
-Up until now, any time `text.innerText` was updated the old text was erased. This time, use the `+=` operator to add text to the end of `text.innerText`. Add the string ` In your inventory you have: ` - include the spaces at the beginning and the end.
+Finora, ogni volta che `text.innerText` è stato aggiornato il vecchio testo è stato cancellato. Stavolta, usa l'operatore `+=` per aggiungere il testo alla fine di `text.innerText`. Aggiungi la stringa `In your inventory you have:` - Includi gli spazi all'inizio e alla fine.
 
 # --hints--
 
-You should add a new line with `text.innerText`.
+Dovresti aggiungere una nuova riga con `text.innerText`.
 
 ```js
 const matches = buyWeapon.toString().match(/text\.innerText/g);
 assert.lengthOf(matches, 2);
 ```
 
-You should use the `+=` operator to add to `text.innerText`.
+Dovresti usare l'operatore `+=` per aggiungere a `text.innerText`.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*/)
 ```
 
-You should add the string ` In your inventory you have: ` to the end of `text.innerText`. Mind the spaces!
+Dovresti aggiungere la stringa `In your inventory you have:` alla fine di `text.innerText`. Attento agli spazi!
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*('|")\sIn your inventory you have:\s\1/)
@@ -203,7 +203,7 @@ function buyWeapon() {
     let newWeapon = weapons[currentWeapon].name;
     text.innerText = "You now have a " + newWeapon + ".";
     inventory.push(newWeapon);
-    
+
   }
 }
 --fcc-editable-region--
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
index 098be4a56e6..2afc9eabfd2 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
@@ -7,17 +7,17 @@ dashedName: step-93
 
 # --description--
 
-At the end of the second `text.innerText` string you just added, use the concatenation operator to add the contents of `inventory` to the string.
+Alla fine della seconda stringa `text.innerText` che hai appena aggiunto, usa l'operatore di concatenazione per aggiungere il contenuto di `inventory` alla stringa.
 
 # --hints--
 
-You should not change the ` In your inventory you have: ` string.
+Non dovresti cambiare la stringa `In your inventory you have:`.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*('|")\sIn your inventory you have:\s\1/)
 ```
 
-You should use the concatenation operator `+` to add the contents of `inventory` to the string.
+Dovresti usare l'operatore di concatenazione `+` per aggiungere il contenuto di `inventory` alla stringa.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*('|")\sIn your inventory you have:\s\1\s*\+\s*inventory/)
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0c4f12c2239b6618582.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0c4f12c2239b6618582.md
index 3ebebb1edd6..c2dc5a63212 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0c4f12c2239b6618582.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0c4f12c2239b6618582.md
@@ -7,30 +7,30 @@ dashedName: step-94
 
 # --description--
 
-Add an `else` statement to your `buyWeapon` function. In that statement, set `text.innerText` to equal `You do not have enough gold to buy a weapon.`.
+Aggiungi un'istruzione `else` alla funzione `buyWeapon`. In questa istruzione, imposta `text.innerText` uguale a `You do not have enough gold to buy a weapon.`.
 
 # --hints--
 
-You should add an `else` statement to your `buyWeapon` function.
+Dovresti aggiungere un'istruzione `else` alla funzione `buyWeapon`.
 
 ```js
 assert.match(buyWeapon.toString(), /else/);
 ```
 
-Your `else` statement should come after your `if` statement.
+L'istruzione `else` dovrebbe trovarsi dopo l'istruzione `if`.
 
 ```js
 const split = buyWeapon.toString().split(/\s|\n/);
 assert.isAbove(split.indexOf('else'), split.indexOf('if'));
 ```
 
-You should set `text.innerText` to `You do not have enough gold to buy a weapon.`.
+Dovresti impostare `text.innerText` su `You do not have enough gold to buy a weapon.`.
 
 ```js
 assert.match(buyWeapon.toString(), /text.innerText\s*=\s*('|")You do not have enough gold to buy a weapon.\1/);
 ```
 
-Your `else` statement should set `text.innerText` to `You do not have enough gold to buy a weapon.`.
+L'istruzione `else` dovrebbe impostare `text.innerText` su `You do not have enough gold to buy a weapon.`.
 
 ```js
 gold = 20;
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0fdf2dad83a92883a80.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0fdf2dad83a92883a80.md
index 1c2b1476e8f..ec5b04ae2b3 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0fdf2dad83a92883a80.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0fdf2dad83a92883a80.md
@@ -7,17 +7,17 @@ dashedName: step-95
 
 # --description--
 
-Once a player has the best weapon, they cannot buy another one. Wrap all of the code in your `buyWeapon` function inside another `if` statement. The condition should check if `currentWeapon` is less than `3` - the index of the last weapon.
+Una volta che un giocatore ha l'arma migliore, non può comprarne un'altra. Metti tutto il codice nella funzione `buyWeapon` all'interno di un'altra istruzione `if`. La condizione dovrebbe verificare se `currentWeapon` è minore di `3` - l'indice dell'ultima arma.
 
 # --hints--
 
-You should have a new `if` statement that checks if `currentWeapon` is less than `3`.
+Dovresti avere una nuova istruzione `if` che verifica se `currentWeapon` è minore di `3`.
 
 ```js
 assert.match(buyWeapon.toString(), /currentWeapon\s*\<\s*3/)
 ```
 
-Your existing `if` statement should be within your new `if` statement.
+L'istruzione `if` esistente dovrebbe trovarsi all'interno della nuova istruzione `if`.
 
 ```js
 currentWeapon = 5;
@@ -26,7 +26,7 @@ buyWeapon();
 assert.equal(gold, 50);
 ```
 
-Your existing `else` statement should be within your new `if` statement.
+L'istruzione `else` esistente dovrebbe trovarsi all'interno della nuova istruzione `if`.
 
 ```js
 currentWeapon = 5;
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d143f2a58e3b6d6e9c33.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d143f2a58e3b6d6e9c33.md
index a705f22a61f..72c1f320323 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d143f2a58e3b6d6e9c33.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d143f2a58e3b6d6e9c33.md
@@ -7,17 +7,17 @@ dashedName: step-96
 
 # --description--
 
-Arrays have a `length` property that returns the number of items in the array. You may want to add new values to the `weapons` array in the future. Change your `if` condition to check if `currentWeapon` is less than the length of the `weapons` array. An example of checking the length of an array `myArray` would look like `myArray.length`.
+Gli array hanno una proprietà `length` che restituisce il numero di elementi nell'array. Potresti voler aggiungere nuovi valori all'array `weapons` in futuro. Cambia la condizione `if` in modo che verifichi se `currentWeapon` è minore della lunghezza dell'array `weapons`. Un esempio di verifica della lunghezza dell'array `myArray` è `myArray.length`.
 
 # --hints--
 
-You should use the `length` property on the `weapons` array.
+Dovresti usare la proprietà `length` sull'array `weapons`.
 
 ```js
 assert.match(buyWeapon.toString(), /weapons\.length/);
 ```
 
-Your `if` statement should check if `currentWeapon` is less than `weapons.length`.
+L'istruzione `if` dovrebbe verificare se `currentWeapon` è minore di `weapons.length`.
 
 ```js
 assert.match(buyWeapon.toString(), /currentWeapon\s*<\s*weapons\.length/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d1c72e8bb13c2074d93c.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d1c72e8bb13c2074d93c.md
index 4db3e483fce..c168ca67678 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d1c72e8bb13c2074d93c.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d1c72e8bb13c2074d93c.md
@@ -7,17 +7,17 @@ dashedName: step-97
 
 # --description--
 
-You now have an error to fix. The `currentWeapon` variable is the index of the `weapons` array, but array indexing starts at zero. The index of the last element in an array is one less than the length of the array. Change the `if` condition to check `weapons.length - 1`, instead of `weapons.length`.
+Ora hai un errore da correggere. La variabile `currentWeapon` è l'indice dell'array `weapons`, ma la numerazione degli array parte da zero. L'indice dell'ultimo elemento in un array è inferiore della lunghezza dell'array di uno. Cambia la condizione `if` per verificare `weapons.length - 1`, invece di `weapons.length`.
 
 # --hints--
 
-You should update the condition to subtract `1` from `weapons.length`.
+Dovresti aggiornare la condizione sottraendo `1` da `weapons.length`.
 
 ```js
 assert.match(buyWeapon.toString(), /weapons\.length\s*-\s*1/);
 ```
 
-Your condition should check if `currentWeapon` is less than `weapons.length - 1`.
+La condizione dovrebbe verificare se `currentWeapon` è minore di `weapons.length - 1`.
 
 ```js
 assert.match(buyWeapon.toString(), /currentWeapon\s*<\s*weapons\.length\s*-\s*1/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2146a3e853d0a6e28ca.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2146a3e853d0a6e28ca.md
index 2061307615c..dd95a7f7c64 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2146a3e853d0a6e28ca.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2146a3e853d0a6e28ca.md
@@ -7,24 +7,24 @@ dashedName: step-98
 
 # --description--
 
-Add an `else` statement for your outer `if` statement. Inside this new `else` statement, set `text.innerText` to `You already have the most powerful weapon!`.
+Aggiungi un'istruzione `else` per l'istruzione `if` esterna. All'interno della nuova istruzione `else`, imposta `text.innerText` su `You already have the most powerful weapon!`.
 
 # --hints--
 
-You should have another `else` statement in your `buyWeapon` function.
+Dovresti avere un'altra istruzione `else` nella funzione `buyWeapon`.
 
 ```js
 const matches = buyWeapon.toString().match(/else/g);
 assert.equal(matches.length, 2);
 ```
 
-You should set `text.innerText` to `You already have the most powerful weapon!`.
+Dovresti impostare `text.innerText` su `You already have the most powerful weapon!`.
 
 ```js
 assert.match(buyWeapon.toString(), /('|")You already have the most powerful weapon!\1/);
 ```
 
-You should modify your `text.innerText` to `You already have the most powerful weapon!` within your outer `else` statement.
+Dovresti modificare `text.innerText` in `You already have the most powerful weapon!` nell'istruzione `else` esterna.
 
 ```js
 currentWeapon = 5;
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d24c97461b3ddb9397c8.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d24c97461b3ddb9397c8.md
index cd0c1476164..24aa17b46de 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d24c97461b3ddb9397c8.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d24c97461b3ddb9397c8.md
@@ -7,29 +7,29 @@ dashedName: step-99
 
 # --description--
 
-Once a player has the most powerful weapon, you can give them the ability to sell their old weapons. In the outer `else` statement, set `button2.innerText` to `Sell weapon for 15 gold`. Also set `button2.onclick` to the function name `sellWeapon`.
+Una volta che un giocatore ha l'arma più potente, puoi dargli la possibilità di vendere le sue vecchie armi. Nell'istruzione `else` esterna, imposta `button2.innerText` su `Sell weapon for 15 gold`. Inoltre, imposta `button2.onclick` sul nome della funzione `sellWeapon`.
 
 # --hints--
 
-You should set the value of `button2.innerText`.
+Dovresti impostare il valore di `button2.innerText`.
 
 ```js
 assert.match(buyWeapon.toString(), /button2\.innerText/);
 ```
 
-You should set the value of `button2.innerText` to `Sell weapon for 15 gold`.
+Dovresti impostare il valore di `button2.innerText` su `Sell weapon for 15 gold`.
 
 ```js
 assert.match(buyWeapon.toString(), /button2\.innerText\s*=\s*('|")Sell weapon for 15 gold\1;/);
 ```
 
-You should set the value of `button2.onclick`.
+Dovresti impostare il valore di `button2.onclick`.
 
 ```js
 assert.match(buyWeapon.toString(), /button2\.onclick/);
 ```
 
-You should set the value of `button2.onclick` to `sellWeapon`.
+Dovresti impostare il valore di `button2.onclick` su `sellWeapon`.
 
 ```js
 assert.match(buyWeapon.toString(), /button2\.onclick\s*=\s*sellWeapon;/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2e2a073be3edb46116f.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2e2a073be3edb46116f.md
index a5e28c829e7..460db503fb0 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2e2a073be3edb46116f.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2e2a073be3edb46116f.md
@@ -7,17 +7,17 @@ dashedName: step-100
 
 # --description--
 
-Create an empty `sellWeapon` function.
+Crea una funzione vuota `sellWeapon`.
 
 # --hints--
 
-You should use the `function` keyword to declare a `sellWeapon` variable.
+Dovresti usare la parola chiave `function` per dichiarare la variabile `sellWeapon`.
 
 ```js
 assert.isFunction(sellWeapon);
 ```
 
-`sellWeapon` should be an empty function.
+`sellWeapon` dovrebbe essere una funzione vuota.
 
 ```js
 assert.match(sellWeapon.toString(), /sellWeapon\(\)\s*\{\s*\}/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d31ebbc10e3fe1b28e03.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d31ebbc10e3fe1b28e03.md
index 77100cf5462..4cafd3b5efd 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d31ebbc10e3fe1b28e03.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d31ebbc10e3fe1b28e03.md
@@ -7,17 +7,17 @@ dashedName: step-101
 
 # --description--
 
-Players should not be able to sell their only weapon. Inside the `sellWeapon` function, add an `if` statement with a condition that checks if the length of the `inventory` array is greater than `1`.
+I giocatori non dovrebbero essere in grado di vendere la loro unica arma. All'interno della funzione `sellWeapon`, aggiungi un'istruzione `if` con una condizione che verifica se la lunghezza dell'array `inventory` è maggiore di `1`.
 
 # --hints--
 
-Your `sellWeapon` function should have an `if` statement.
+La funzione `sellWeapon` dovrebbe avere un'istruzione `if`.
 
 ```js
 assert.match(sellWeapon.toString(), /if/);
 ```
 
-Your `if` statement should check if `inventory.length` is greater than `1`.
+L'istruzione `if` dovrebbe verificare se `inventory.length` è maggiore di `1`.
 
 ```js
 assert.match(sellWeapon.toString(), /if\s*\(inventory\.length\s*>\s*1\)/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d35660db4040ba292193.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d35660db4040ba292193.md
index dbbf432519d..4356e6e5908 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d35660db4040ba292193.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d35660db4040ba292193.md
@@ -7,23 +7,23 @@ dashedName: step-102
 
 # --description--
 
-Inside the `if` statement, set `gold` equal to `15` more than its current value. Also update `goldText.innerText` to the new value.
+All'interno dell'istruzione `if`, imposta `gold` uguale al suo valore corrente più `15`. Aggiorna anche `goldText.innerText` con il nuovo valore.
 
 # --hints--
 
-You should use compound assignment to increase `gold` by `15`.
+Dovresti usare l'assegnazione composta per aumentare `gold` di `15`.
 
 ```js
 assert.match(sellWeapon.toString(), /gold\s*\+=\s*15/);
 ```
 
-You should set `goldText.innerText` to `gold`.
+Dovresti impostare `goldText.innerText` su `gold`.
 
 ```js
 assert.match(sellWeapon.toString(), /goldText\.innerText\s*=\s*gold/);
 ```
 
-Your code should be in your `if` statement.
+Il codice dovrebbe essere nell'istruzione `if`.
 
 ```js
 inventory = ["Naomi"];
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d382cd075f4169223e14.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d382cd075f4169223e14.md
index 8f3764e0ef9..3395a8cc0c5 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d382cd075f4169223e14.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d382cd075f4169223e14.md
@@ -7,13 +7,13 @@ dashedName: step-103
 
 # --description--
 
-Use the `let` keyword to create a variable named `currentWeapon`. Don't assign it a value yet.
+Usa la parola chiave `let` per creare una variabile chiamata `currentWeapon`. Non assegnarle ancora alcun valore.
 
-Notice that you already have a `currentWeapon` variable elsewhere in your code. Since you are using the `let` keyword instead of `var`, the new `currentWeapon` is scoped only to this `if` statement. At the close of the `if` statement, the old `currentWeapon` will be used again.
+Nota che c'è già una variabile `currentWeapon` altrove nel tuo codice. Dato che stai usando la parola chiave `let` invece di `var`, la visibilità della nuova `currentWeapon` è limitata a questa istruzione `if`. Alla chiusura dell'istruzione `if`, la vecchia `currentWeapon` verrà usata di nuovo.
 
 # --hints--
 
-You should use `let` to declare a `currentWeapon` variable.
+Dovresti usare `let` per dichiarare una variabile `currentWeapon`.
 
 ```js
 assert.match(sellWeapon.toString(), /currentWeapon/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d539dc11cb42b5dd7ec8.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d539dc11cb42b5dd7ec8.md
index 1fb5303efc5..1e501a233af 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d539dc11cb42b5dd7ec8.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d539dc11cb42b5dd7ec8.md
@@ -7,23 +7,23 @@ dashedName: step-104
 
 # --description--
 
-The `shift()` method on an array removes the first element in the array and returns it. Use this method to take the first element from the `inventory` array and assign it to your `currentWeapon` variable.
+Il metodo `shift()` su un array rimuove il primo elemento nell'array e lo restituisce. Usa questo metodo per prendere il primo elemento dall'array `inventory` e assegnarlo alla variabile `currentWeapon`.
 
 # --hints--
 
-Your `sellWeapon` function should use the `shift()` method.
+La funzione `sellWeapon` dovrebbe utilizzare il metodo `shift()`.
 
 ```js
 assert.match(sellWeapon.toString(), /shift\(\)/);
 ```
 
-You should use the `shift()` method on the `inventory` array.
+Dovresti usare il metodo `shift()` sull'array `inventory`.
 
 ```js
 assert.match(sellWeapon.toString(), /inventory\.shift\(\)/);
 ```
 
-You should assign the value of `inventory.shift()` to your `currentWeapon` variable.
+Dovresti assegnare il valore di `inventory.shift()` alla variabile `currentWeapon`.
 
 ```js
 assert.match(sellWeapon.toString(), /currentWeapon\s*=\s*inventory\.shift\(\)/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
index 03e5cceea99..7cbaf46dcd2 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
@@ -7,35 +7,35 @@ dashedName: step-105
 
 # --description--
 
-After your `currentWeapon`, use the concatenation operator to set `text.innerText` to the string `You sold a `, then `currentWeapon`, then the string `.`.
+Dopo `currentWeapon`, usa l'operatore di concatenazione per impostare `text.innerText` sulla stringa `You sold a`, poi `currentWeapon`, e poi la stringa `.`.
 
 # --hints--
 
-You should use the assignment operator with `text.innerText`.
+Dovresti usare l'operatore di assegnazione con `text.innerText`.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*=/);
 ```
 
-You should add `You sold a ` to `text.innerText`. Spacing is important.
+Dovresti aggiungere `You sold a` a `text.innerText`. La spaziatura è importante.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*=\s*('|")You sold a \1/);
 ```
 
-You should add the value of `currentWeapon` to the `You sold a ` string. Use the concatenation operator to do this on the same line.
+Dovresti aggiungere il valore di `currentWeapon` alla stringa `You sold a`. Usa l'operatore di concatenazione per farlo sulla stessa riga.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*=\s*('|")You sold a\s\1\s*\+\s*\_currentWeapon/);
 ```
 
-You should add the string `.` to the value of `currentWeapon`. Use the concatenation operator to do this on the same line.
+Dovresti aggiungere la stringa `.` al valore di `currentWeapon`. Usa l'operatore di concatenazione per farlo sulla stessa riga.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*=\s*('|")You sold a \1\s*\+\s*\_currentWeapon\s+\+\s+('|")\.\2/);
 ```
 
-Your `text.innerText` should update to the proper string.
+`text.innerText` dovrebbe essere aggiornato con la stringa appropriata.
 
 ```js
 inventory = ["first", "second"];
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
index bc8435faa22..d346e2184e3 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
@@ -7,31 +7,31 @@ dashedName: step-106
 
 # --description--
 
-Now use the `+=` operator to add the string ` In your inventory you have: ` and the contents of `inventory` to the `text.innerText`. Make sure to include the space at the beginning and end of the ` In your inventory you have: ` string.
+Adesso usa l'operatore `+=` per aggiungere la stringa `In your inventory you have:` e il contenuto di `inventory` a `text.innerText`. Assicurati di includere uno spazio all'inizio e alla fine della stringa `In your inventory you have:`.
 
 # --hints--
 
-You should add another `text.innerText` line.
+Dovresti aggiungere un'altra riga `text.innerText`.
 
 ```js
 const matches = sellWeapon.toString().match(/text\.innerText/g);
 assert.equal(matches.length, 2);
 ```
 
-You should use compound assignment on `text.innerText`.
+Dovresti usare l'assegnazione composta su `text.innerText`.
 
 ```js
 const matches = sellWeapon.toString().match(/text\.innerText\s*\+=/g);
 assert.equal(matches.length, 1);
 ```
 
-You should add the string ` In your inventory you have: ` to the second `text.innerText` line. Spacing matters.
+Dovresti aggiungere la stringa `In your inventory you have:` alla seconda riga `text.innerText`. La spaziatura è importante.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*\+=\s*('|") In your inventory you have: \1/);
 ```
 
-You should use the concatenation operator to add the value of `inventory` to the end of your second `text.innerText` line.
+Dovresti usare l'operatore di concatenazione per aggiungere il valore di `inventory` alla fine della seconda riga `text.innerText`.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*\+=\s*('|") In your inventory you have: \1\s*\+\s*inventory/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d7b8ab568b4649998954.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d7b8ab568b4649998954.md
index 3e59ee00a2d..7232d9f4977 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d7b8ab568b4649998954.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d7b8ab568b4649998954.md
@@ -7,23 +7,23 @@ dashedName: step-107
 
 # --description--
 
-Use an `else` statement to run when the `inventory` length is not more than one. Set the `text.innerText` to say `Don't sell your only weapon!`.
+Usa un'istruzione `else` da eseguire quando la lunghezza di `inventory` non è maggiore di uno. Imposta `text.innerText` su `Don't sell your only weapon!`.
 
 # --hints--
 
-Your `sellWeapon` function should have an `else` statement.
+La funzione `sellWeapon` dovrebbe avere un'istruzione `else`.
 
 ```js
 assert.match(sellWeapon.toString(), /else/);
 ```
 
-You should set `text.innerText` to `Don't sell your only weapon!`.
+Dovresti impostare `text.innerText` su `Don't sell your only weapon!`.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*=\s*('|")Don't sell your only weapon!\1/);
 ```
 
-Your new `text.innerText` line should be in your `else` statement.
+La nuova riga `text.innerText` dovrebbe essere nell'istruzione `else`.
 
 ```js
 inventory = ["Naomi"];
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d81f539f004776dd9b1e.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d81f539f004776dd9b1e.md
index f47ecd3e581..b913dce7bba 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d81f539f004776dd9b1e.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d81f539f004776dd9b1e.md
@@ -7,91 +7,91 @@ dashedName: step-108
 
 # --description--
 
-Now you can start the code to fight monsters. To keep your code organized, your `fightDragon` function has been moved for you to be near the other `fight` functions.
+Ora puoi iniziare il codice per combattere i mostri. Per mantenere il codice organizzato, la funzione `fightDragon` è stata spostata per te vicino alle altre funzioni `fight`.
 
-Below your `weapons` array, define a `monsters` variable and assign it an array. Set that array to have three objects, each with a `name`, `level`, and `health` properties. The first object's values should be `slime`, `2`, and `15`, in order. The second should be `fanged beast`, `8`, and `60`. The third should be `dragon`, `20`, and `300`.
+Sotto l'array `weapons`, definisci una variabile `monsters` e assegnale un array. Imposta questo array in modo che abbia tre oggetti, ognuno con delle proprietà `name`, `level` e `health`. I valori del primo oggetto dovrebbero essere `slime`, `2` e `15`, in ordine. Il secondo dovrebbe essere `fanged beast`, `8` e `60`. Il terzo dovrebbe essere `dragon`, `20` e `300`.
 
 # --hints--
 
-You should use `const` to declare a `monsters` variable.
+Dovresti usare la parola chiave `const` per dichiarare la variabile `monsters`.
 
 ```js
 assert.match(code, /const\s*monsters/);
 ```
 
-Your `monsters` variable should be an array.
+La variabile `monsters` dovrebbe essere un array.
 
 ```js
 assert.isArray(monsters);
 ```
 
-Your `monsters` variable should have 3 values.
+La variabile `monsters` dovrebbe avere 3 valori.
 
 ```js
 assert.lengthOf(monsters, 3);
 ```
 
-Your `monsters` array should have 3 objects.
+L'array `monsters` dovrebbe avere 3 oggetti.
 
 ```js
 assert(monsters.every(val => typeof val === "object"));
 ```
 
-The first value in your `monsters` array should have an object with a `name` property set to `slime`.
+Il primo valore nell'array `monsters` dovrebbe essere un oggetto con una proprietà `name` impostata su `slime`.
 
 ```js
 assert.equal(monsters[0].name, "slime");
 ```
 
-The first value in your `monsters` array should have an object with a `level` property set to `2`.
+Il primo valore nell'array `monsters` dovrebbe essere un oggetto con una proprietà `level` impostata su `2`.
 
 ```js
 assert.equal(monsters[0].level, 2);
 ```
 
-The first value in your `monsters` array should have an object with a `health` property set to `15`.
+Il primo valore nell'array `monsters` dovrebbe essere un oggetto con una proprietà `health` impostata su `15`.
 
 ```js
 assert.equal(monsters[0].health, 15);
 ```
 
-The second value in your `monsters` array should have an object with a `name` property set to `fanged beast`.
+Il secondo valore nell'array `monsters` dovrebbe avere un oggetto con una proprietà `name` impostata su `fanged beast`.
 
 ```js
 assert.equal(monsters[1].name, "fanged beast");
 ```
 
-The second value in your `monsters` array should have an object with a `level` property set to `8`.
+Il secondo valore nell'array `monsters` dovrebbe essere un oggetto con una proprietà `level` impostata su `8`.
 
 ```js
 assert.equal(monsters[1].level, 8);
 ```
 
-The second value in your `monsters` array should have an object with a `health` property set to `60`.
+Il secondo valore nell'array `monsters` dovrebbe essere un oggetto con una proprietà `health` impostata su `60`.
 
 ```js
 assert.equal(monsters[1].health, 60);
 ```
 
-The third value in your `monsters` array should have an object with a `name` property set to `dragon`.
+Il terzo valore nell'array `monsters` dovrebbe essere un oggetto con una proprietà `name` impostata su `dragon`.
 
 ```js
 assert.equal(monsters[2].name, "dragon");
 ```
 
-The third value in your `monsters` array should have an object with a `level` property set to `20`.
+Il terzo valore nell'array `monsters` dovrebbe essere un oggetto con una proprietà `level` impostata su `20`.
 
 ```js
 assert.equal(monsters[2].level, 20);
 ```
 
-The third value in your `monsters` array should have an object with a `health` property set to `300`.
+Il terzo valore nell'array `monsters` dovrebbe essere un oggetto con una proprietà `health` impostata su `300`.
 
 ```js
 assert.equal(monsters[2].health, 300);
 ```
 
-You should not add any extra properties to your objects.
+Non dovresti aggiungere proprietà extra agli oggetti.
 
 ```js
 assert.deepEqual(monsters, [
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd468debb449b4454086.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd468debb449b4454086.md
index 4167fc0a12b..4f0d59c056b 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd468debb449b4454086.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd468debb449b4454086.md
@@ -7,17 +7,17 @@ dashedName: step-109
 
 # --description--
 
-Fighting each type of monster will use similar logic. Create an empty function called `goFight` to manage this logic.
+Combattere ogni tipo di mostro si baserà su una logica simile. Crea una funzione vuota chiamata `goFight` per gestire questa logica.
 
 # --hints--
 
-You should use the `function` keyword to declare `goFight`.
+Dovresti usare la parola chiave `function` per dichiarare `goFight`.
 
 ```js
 assert.match(code, /function\s*goFight/);
 ```
 
-`goFight` should be an empty function.
+`goFight` dovrebbe essere una funzione vuota.
 
 ```js
 assert.match(goFight.toString(), /goFight\s*\(\s*\)\s*\{\s*\}/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd9cdb16324b04cfd958.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd9cdb16324b04cfd958.md
index b960134fac7..1bfd725dff5 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd9cdb16324b04cfd958.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd9cdb16324b04cfd958.md
@@ -7,25 +7,25 @@ dashedName: step-110
 
 # --description--
 
-In your `fightSlime` function, set `fighting` equal to `0` - the index of `slime` in the `monsters` array. Remember that you already declared `fighting` earlier in your code, so you do not need `let` or `const` here.
+Nella funzione `fightSlime`, imposta `fighting` uguale a `0` - l'indice di `slime` nell'array `monsters`. Ricorda che hai già dichiarato `fighting` precedentemente nel tuo codice, quindi non devi usare `let` o `const` qui.
 
-On the next line, call the `goFight` function.
+Nella riga successiva, chiama la funzione `goFight`.
 
 # --hints--
 
-You should set `fighting` equal to `0`.
+Dovresti impostare `fighting` uguale a `0`.
 
 ```js
 assert.match(fightSlime.toString(), /fighting\s*=\s*0;/);
 ```
 
-You should not use `let` or `const`.
+Non dovresti usare `let` o `const`.
 
 ```js
 assert.notMatch(fightSlime.toString(), /let|const|var/);
 ```
 
-You should call the `goFight` function.
+Dovresti chiamare la funzione `goFight`.
 
 ```js
 assert.match(fightSlime.toString(), /goFight\(\);/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dfcf7fb1044d2f478fd1.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dfcf7fb1044d2f478fd1.md
index aa331ca8991..122a4ed8cc4 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dfcf7fb1044d2f478fd1.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dfcf7fb1044d2f478fd1.md
@@ -7,23 +7,23 @@ dashedName: step-111
 
 # --description--
 
-Following the same pattern, use that code in the `fightBeast` and `fightDragon` functions. Remember that `beast` is at index `1` and `dragon` is at index `2`. Also remove the `console.log` call from your `fightDragon` function.
+Seguendo lo stesso schema, usa il codice nelle funzioni `fightBeast` e `fightDragon`. Ricorda che `beast` è all'indice `1` e `dragon` è all'indice `2`. Inoltre rimuovi la chiamata `console.log` dalla funzione `fightDragon`.
 
 # --hints--
 
-You should set `fighting` to `1` in your `fightBeast` function.
+Dovresti impostare `fighting` su `1` nella funzione `fightBeast`.
 
 ```js
 assert.match(fightBeast.toString(), /fighting\s*=\s*1;/);
 ```
 
-You should set `fighting` to `2` in your `fightDragon` function.
+Dovresti impostare `fighting` su `2` nella funzione `fightDragon`.
 
 ```js
 assert.match(fightDragon.toString(), /fighting\s*=\s*2;/);
 ```
 
-You should remove the `console.log` from your `fightDragon` function.
+Dovresti rimuovere `console.log` dalla funzione `fightDragon`.
 
 ```js
 assert.notMatch(fightDragon.toString(), /console\.log/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e0d1d0110b4ec421489f.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e0d1d0110b4ec421489f.md
index 5eccfafdc9b..9794d12abf6 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e0d1d0110b4ec421489f.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e0d1d0110b4ec421489f.md
@@ -7,29 +7,29 @@ dashedName: step-112
 
 # --description--
 
-At the end of your code, create two empty functions named `attack` and `dodge`.
+Alla fine del codice, crea due funzioni vuote chiamate `attack` e `dodge`.
 
 # --hints--
 
-You should use the `function` keyword to declare `attack`.
+Dovresti usare la parola chiave `function` per dichiarare `attack`.
 
 ```js
 assert.match(code, /function\s*attack/);
 ```
 
-`attack` should be an empty function.
+`attack` dovrebbe essere una funzione vuota.
 
 ```js
 assert.match(attack.toString(), /attack\s*\(\s*\)\s*\{\s*\}/);
 ```
 
-You should use the `function` keyword to declare `dodge`.
+Dovresti usare la parola chiave `function` per dichiarare `dodge`.
 
 ```js
 assert.match(code, /function\s*dodge/);
 ```
 
-`dodge` should be an empty function.
+`dodge` dovrebbe essere una funzione vuota.
 
 ```js
 assert.match(dodge.toString(), /dodge\s*\(\s*\)\s*\{\s*\}/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e142f7f0bd4fed898de3.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e142f7f0bd4fed898de3.md
index 70d0725b1d9..32e0a13676a 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e142f7f0bd4fed898de3.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e142f7f0bd4fed898de3.md
@@ -7,42 +7,42 @@ dashedName: step-113
 
 # --description--
 
-Add a new object to the end of the `locations` array, following the same properties as the rest of the objects. Set `name` to `fight`, `button text` to an array with `Attack`, `Dodge`, and `Run`, `button functions` to an array with `attack`, `dodge`, and `goTown`, and `text` to `You are fighting a monster.`.
+Aggiungi un nuovo oggetto alla fine dell'array `locations`, seguendo le stesse proprietà come negli altri oggetti. Imposta `name` su `fight`, `button text` su un array con `Attack`, `Dodge` e `Run`, `button functions` su un array con `attack`, `dodge` e `goTown`, e `text` su `You are fighting a monster.`.
 
 # --hints--
 
-Your `locations` array should have 4 values in it.
+L'array `locations` dovrebbe contenere 4 valori.
 
 ```js
 console.log(locations);
 assert.lengthOf(locations, 4);
 ```
 
-Your new value should be an object.
+Il nuovo valore dovrebbe essere un oggetto.
 
 ```js
 assert.isObject(locations[3]);
 ```
 
-Your new object should have a `name` property set to `fight`.
+Il nuovo oggetto dovrebbe avere una proprietà `name` impostata su `fight`.
 
 ```js
 assert.equal(locations[3].name, "fight");
 ```
 
-Your new object should have a `button text` property set to an array with the strings `Attack`, `Dodge`, and `Run`.
+Il nuovo oggetto dovrebbe avere una proprietà `button text` impostata su un array con le stringhe `Attack`, `Dodge` e `Run`.
 
 ```js
 assert.deepEqual(locations[3]["button text"], ["Attack", "Dodge", "Run"]);
 ```
 
-Your new object should have a `button functions` property set to an array with the variables `attack`, `dodge`, and `goTown`.
+Il nuovo oggetto dovrebbe avere una proprietà `button functions` impostata su un array con le variabili `attack`, `dodge` e `goTown`.
 
 ```js
 assert.deepEqual(locations[3]["button functions"], [attack, dodge, goTown]);
 ```
 
-Your new object should have a `text` property set to `You are fighting a monster.`.
+Il nuovo oggetto dovrebbe avere una proprietà `text` impostata su `You are fighting a monster.`.
 
 ```js
 assert.equal(locations[3].text, "You are fighting a monster.");
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e1dc897df55108bcb5e8.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e1dc897df55108bcb5e8.md
index d87c8179a6e..148fcae7d30 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e1dc897df55108bcb5e8.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e1dc897df55108bcb5e8.md
@@ -7,17 +7,17 @@ dashedName: step-114
 
 # --description--
 
-In the `goFight` function, call your `update` function with the fourth object in `locations` as an argument.
+Nella funzione `goFight`, chiama la funzione `update` con i quattro oggetti in `locations` come argomento.
 
 # --hints--
 
-You should call `update` in your `goFight` function.
+Dovresti chiamare la funzione `update` nella funzione `goFight`.
 
 ```js
 assert.match(goFight.toString(), /update/);
 ```
 
-You should pass the fourth object in your `locations` array to your `update` call.
+Dovresti passare il quarto oggetto dell'array `locations` alla chiamata di `update`.
 
 ```js
 assert.match(goFight.toString(), /update\(locations\[3\]\)/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e21398ad61520edb724f.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e21398ad61520edb724f.md
index ec221bb2490..eab5cad169f 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e21398ad61520edb724f.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e21398ad61520edb724f.md
@@ -7,17 +7,17 @@ dashedName: step-115
 
 # --description--
 
-Below your `update` call, set the `monsterHealth` to be the health of the current monster. You can get this value by accessing the `health` property of `monsters[fighting]`.
+Sotto la chiamata di `update`, imposta `monsterHealth` in modo che sia la vita del mostro corrente. Puoi ottenere questo valore accedendo alla proprietà `health` di `monsters[fighting]`.
 
 # --hints--
 
-You should use bracket notation to access the `monsters` array at the `fighting` index.
+Dovresti usare la notazione a parentesi per accedere all'array `monsters` all'indice di `fighting`.
 
 ```js
 assert.match(goFight.toString(), /monsters\[fighting\]/);
 ```
 
-You should assign the value of `monsters[fighting]` to the `monsterHealth` variable.
+Dovresti assegnare il valore di `monsters[fighting]` alla variabile `monsterHealth`.
 
 ```js
 assert.match(goFight.toString(), /monsterHealth\s*=\s*monsters\[fighting\](\.health|\[('|")health\2\])/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e24c673b075317cc0b09.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e24c673b075317cc0b09.md
index 64379cb2b5d..9fff73a5f92 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e24c673b075317cc0b09.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e24c673b075317cc0b09.md
@@ -7,7 +7,7 @@ dashedName: step-116
 
 # --description--
 
-The HTML element that shows the monster's stats has been hidden with CSS. Display the `monsterStats` element by updating the `display` property of the `style` property to `block`. For example, updating the `first` property of the `name` property of `user` would look like:
+The HTML element that shows the monster's stats has been hidden with CSS. Mostra l'elemento `monsterStats` aggiornando la proprietà `display` della proprietà `style` in `block`. Ad esempio, puoi aggiornare la proprietà `first` della proprietà `name` di `user` in questo modo:
 
 ```js
 user.name.first = "Naomi";
@@ -15,19 +15,19 @@ user.name.first = "Naomi";
 
 # --hints--
 
-You should use dot notation to access the `style` property of `monsterStats`.
+Dovresti usare la dot notation per accedere alla proprietà `style` di `monsterStats`.
 
 ```js
 assert.match(goFight.toString(), /monsterStats\.style/);
 ```
 
-You should use dot notation to access the `display` property of the `style` property.
+Dovresti usare la dot notation per accedere alla proprietà `display` della proprietà `style`.
 
 ```js
 assert.match(goFight.toString(), /monsterStats\.style\.display/);
 ```
 
-You should set the `display` property to `block`.
+Dovresti assegnare alla proprietà `display` il valore `block`.
 
 ```js
 assert.match(goFight.toString(), /monsterStats\.style\.display\s*=\s*('|")block\1/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e271f8e3d1541f9624ad.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e271f8e3d1541f9624ad.md
index 0ccd9de7c1a..fd58757717a 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e271f8e3d1541f9624ad.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e271f8e3d1541f9624ad.md
@@ -7,29 +7,29 @@ dashedName: step-117
 
 # --description--
 
-Now set the `innerText` property of `monsterName` to be the `name` property of the current monster. Do the same for `monsterHealthText` and the `health` property.
+Ora imposta la proprietà `innerText` di `monsterName` in modo che sia la proprietà `name` del mostro attuale. Fai lo stesso per le proprietà `monsterHealthText` e `health`.
 
 # --hints--
 
-You should use dot notation to access the `innerText` property of `monsterName`.
+Dovresti usare la dot notation per accedere alla proprietà `innerText` di `monsterName`.
 
 ```js
 assert.match(goFight.toString(), /monsterName\.innerText/);
 ```
 
-You should set the `innerText` property of `monsterName` to be the `name` value of the current monster. Remember that you can get the current monster with `monsters[fighting]`.
+Dovresti impostare la proprietà `innerText` di `monsterName` in modo che sia il valore di `name` del mostro attuale. Ricorda che puoi ottenere il valore del mostro attuale con `monsters[fighting]`.
 
 ```js
 assert.match(goFight.toString(), /monsterName\.innerText\s*=\s*monsters\[fighting\]\.name/);
 ```
 
-You should use dot notation to access the `innerText` property of `monsterHealthText`.
+Dovresti usare la dot notation per accedere alla proprietà `innerText` di `monsterHealthText`.
 
 ```js
 assert.match(goFight.toString(), /monsterHealthText\.innerText/);
 ```
 
-You should set the `innerText` property of `monsterHealthText` to be the `health` value of the current monster. Remember that you assigned this value to a `monsterHealth` variable.
+Dovresti impostare la proprietà `innerText` di `monsterHealthText` in modo che sia il valore di `health` del mostro attuale. Ricorda che hai assegnato questo valore alla variabile `monsterHealth`.
 
 ```js
 assert.match(goFight.toString(), /monsterHealthText\.innerText\s*=\s*monsterHealth/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
index 229ca08f2a2..3e79be66d27 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
@@ -7,29 +7,29 @@ dashedName: step-118
 
 # --description--
 
-Now you can build the `attack` function. First, update the `text` message to say `The [monster name] attacks.`, replacing `[monster name]` with the name of the monster. Remember you can use the concatenation operator for this.
+Ora puoi costruire la funzione `attack`. Per prima cosa, aggiorna il messaggio `text` in modo che dica `The [monster name] attacks.`, sostituendo `[monster name]` con il nome del mostro. Ricorda che puoi usare l'operatore di concatenazione.
 
 # --hints--
 
-You should use dot notation to access the `innerText` property of `text`.
+Dovresti usare la dot notation per accedere alla proprietà `innerText` di `text`.
 
 ```js
 assert.match(attack.toString(), /text\.innerText/);
 ```
 
-You should assign the string `The ` to `innerText` property of `text`.
+Dovresti assegnare la stringa `The` alla proprietà `innerText` di `text`.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1/);
 ```
 
-You should use the concatenation operator to add the value of `monsters[fighting].name` to the `The ` string.
+Dovresti usare l'operatore di concatenazione per aggiungere il valore di `monsters[fighting].name` alla stringa `The`.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1\s*\+\s*monsters\[fighting\]\.name/);
 ```
 
-You should use the concatenation operator to add the string ` attacks.` to the `monsters[fighting].name` string.
+Dovresti usare l'operatore di concatenazione per aggiungere la stringa `attacks.` alla stringa `monsters[fighting].name`.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1\s*\+\s*monsters\[fighting\]\.name\s*\+\s*('|") attacks\.\2/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
index 6566de3802a..2dc4a8b147c 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
@@ -7,36 +7,36 @@ dashedName: step-119
 
 # --description--
 
-On a new line, add the string ` You attack it with your [weapon].` to the `text` value, replacing `[weapon]` with the player's current weapon.
+Su una nuova riga, aggiungi la stringa `You attack it with your [weapon].` al valore di `text`, sostituendo `[weapon]` con l'arma attuale del giocatore.
 
 # --hints--
 
-You should use dot notation to access the `innerText` property of `text` on a new line.
+Dovresti usare la dot notation per accedere alla proprietà `innerText` di `text` su una nuova riga.
 
 ```js
 const match = attack.toString().match(/text\.innerText/g);
 assert.lengthOf(match, 2);
 ```
 
-You should use compound assignment with `text.innerText`.
+Dovresti usare l'assegnazione composta con `text.innerText`.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*\+=/);
 ```
 
-You should add the string ` You attack it with your ` to the `text.innerText` value. Remember that spacing matters.
+Dovresti aggiungere la stringa `You attack it with your` al valore di `text.innerText`. Ricorda che la spaziatura è importante.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|") You attack it with your \1/);
 ```
 
-You should use the concatenation operator to add the current weapon to the string. You can get the current weapon with `weapons[currentWeapon].name`.
+Dovresti usare l'operatore di concatenazione per aggiungere l'arma attuale alla stringa. Puoi ottenere l'arma attuale con `weapons[currentWeapon].name`.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|") You attack it with your \1\s*\+\s*weapons\[currentWeapon\]\.name/);
 ```
 
-You should use the concatenation operator to end your string with `.`.
+Dovresti usare l'operatore di concatenazione per terminare la stringa con un `.`.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|") You attack it with your \1\s*\+\s*weapons\[currentWeapon\]\.name\s*\+\s*('|")\.\2/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e45cc600c3591cee671a.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e45cc600c3591cee671a.md
index 7ebd6d5383a..0372ae6d221 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e45cc600c3591cee671a.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e45cc600c3591cee671a.md
@@ -7,17 +7,17 @@ dashedName: step-120
 
 # --description--
 
-Next, set `health` to equal `health` minus the monster's level. Remember you can get this from the `monsters[fighting].level` property.
+Adesso imposta `health` uguale a `health` meno il livello del mostro. Ricorda che puoi ottenerlo con la proprietà `monsters[fighting].level`.
 
 # --hints--
 
-You should use compound assignment with `health`.
+Dovresti usare l'assegnazione composta con `health`.
 
 ```js
 assert.match(attack.toString(), /health\s*-=/);
 ```
 
-You should subtract the monster's current level from `health`.
+Dovresti sottrarre il livello del mostro attuale da `health`.
 
 ```js
 assert.match(attack.toString(), /health\s*-=\s*monsters\[fighting\]\.level/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e49f4df7af5ae2d7a616.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e49f4df7af5ae2d7a616.md
index 687f2f04e57..5fd50b0d72d 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e49f4df7af5ae2d7a616.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e49f4df7af5ae2d7a616.md
@@ -7,29 +7,29 @@ dashedName: step-121
 
 # --description--
 
-Set `monsterHealth` to `monsterHealth` minus the power of the player's current weapon. Remember you have the `currentWeapon` variable and the `power` property.
+Imposta `monsterHealth` su `monsterHealth` meno la potenza dell'arma attuale del giocatore. Ricorda che hai la variabile `currentWeapon` e la proprietà `power`.
 
 # --hints--
 
-You should use compound assignment to modify the `monsterHealth` variable.
+Dovresti usare l'assegnazione composta per modificare la variabile `monsterHealth`.
 
 ```js
 assert.match(attack.toString(), /monsterHealth\s*-=/);
 ```
 
-You should use bracket notation with `currentWeapon` to access `weapons`.
+Dovresti usare la notazione a parentesi con `currentWeapon` per accedere a `weapons`.
 
 ```js
 assert.match(attack.toString(), /weapons\[currentWeapon\]/);
 ```
 
-You should use dot notation to access the `power` property of `weapons[currentWeapon]`.
+Dovresti usare la dot notation per accedere alla proprietà `power` di `weapons[currentWeapon]`.
 
 ```js
 assert.match(attack.toString(), /weapons\[currentWeapon\]\.power/);
 ```
 
-You should subtract the `power` of the current weapon from `monsterHealth`.
+Dovresti sottrarre il valore di `power` dell'arma attuale da `monsterHealth`.
 
 ```js
 assert.match(attack.toString(), /monsterHealth\s*-=\s*weapons\[currentWeapon\]\.power/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e4dc6a60f85bf256a0cb.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e4dc6a60f85bf256a0cb.md
index fe85bcd7f75..5e2f631e270 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e4dc6a60f85bf256a0cb.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e4dc6a60f85bf256a0cb.md
@@ -7,57 +7,57 @@ dashedName: step-122
 
 # --description--
 
-JavaScript offers the built-in `Math` utility which offers a number of mathematical tools. One of those is `Math.random()`, which generates a random number between 0 and 1. Another is `Math.floor()`, which rounds a given number down to the nearest integer.
+JavaScript offre l'utilità integrata `Math` che possiede svariati strumenti matematici. Uno di questi è `Math.random()`, che genera un numero casuale tra 0 e 1. Un'altra è `Math.floor()`, che arrotonda per difetto un dato numero all'intero più vicino.
 
-Using these, you can generate a random number within a range. For example, this generates a random number between 1 and 5: `Math.floor(Math.random() * 5) + 1;`.
+Utilizzandoli, puoi generare un numero casuale all'interno di un intervallo. Ad esempio, questo genera un numero casuale tra 1 e 5: `Math.floor(Math.random() * 5) + 1;`.
 
-Following this pattern, add a random number between one and the value of `xp` at the end of your `monsterHealth` variable change.
+Seguendo questo modello, aggiungi un numero casuale tra uno e il valore di `xp` alla fine della modifica della variabile `monsterHealth`.
 
 # --hints--
 
-You should use the same `monsterHealth` line you already wrote.
+Dovresti usare la stessa riga `monsterHealth` che hai già scritto.
 
 ```js
 assert.lengthOf(attack.toString().match(/monsterHealth/g), 1);
 ```
 
-You should add to the `weapons[currentWeapon].power` value.
+Dovresti aggiungerlo al valore `weapons[currentWeapon].power`.
 
 ```js
 assert.match(attack.toString(), /monsterHealth\s*-=\s*weapons\[currentWeapon\]\.power\s*\+/);
 ```
 
-You should use `Math.floor()`.
+Dovresti usare `Math.floor()`.
 
 ```js
 assert.match(attack.toString(), /Math\.floor/);
 ```
 
-You should use `Math.random()`.
+Dovresti usare `Math.random()`.
 
 ```js
 assert.match(attack.toString(), /Math\.random/);
 ```
 
-You should multiply `Math.random()` by the value of `xp`.
+Dovresti moltiplicare `Math.random()` per il valore di `xp`.
 
 ```js
 assert.match(attack.toString(), /Math\.random\(\)\s*\*\s*xp/);
 ```
 
-You should use `Math.floor()` to round the result of `Math.random() * xp` down.
+Dovresti usare `Math.floor()` per arrotondare per difetto il risultato di `Math.random() * xp`.
 
 ```js
 assert.match(attack.toString(), /Math\.floor\(\s*Math\.random\(\)\s*\*\s*xp\s*\)/);
 ```
 
-You should add `1` to the result of `Math.floor()`.
+Dovresti aggiungere `1` al risultato di `Math.floor()`.
 
 ```js
 assert.match(attack.toString(), /Math\.floor\(\s*Math\.random\(\)\s*\*\s*xp\s*\)\s*\+\s*1/);
 ```
 
-You should add the result of `Math.floor(Math.random() * xp) + 1` to the result of `weapons[currentWeapon].power`.
+Dovresti aggiungere il risultato di `Math.floor(Math.random() * xp) + 1` al risultato di `weapons[currentWeapon].power`.
 
 ```js
 assert.match(attack.toString(), /monsterHealth\s*-=\s*weapons\[currentWeapon\]\.power\s*\+\s*Math\.floor\(\s*Math\.random\(\)\s*\*\s*xp\s*\)\s*\+\s*1/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
index a2c6fde768a..04b87ac8ace 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
@@ -7,29 +7,29 @@ dashedName: step-123
 
 # --description--
 
-Update `healthText.innerText` and `monsterHealthText.innerText` to equal `health` and `monsterHealth`.
+Aggiorna `healthText.innerText` e `monsterHealthText.innerText` in modo che siano uguali a `health` e `monsterHealth`.
 
 # --hints--
 
-You should update `healthText.innerText`.
+Dovresti aggiornare `healthText.innerText`.
 
 ```js
 assert.match(attack.toString(), /healthText\.innerText/);
 ```
 
-You should set `healthText.innerText` to `health`.
+Dovresti impostare `healthText.innerText` su `health`.
 
 ```js
 assert.match(attack.toString(), /healthText\.innerText\s*=\s*health/);
 ```
 
-You should update `monsterHealthText.innerText`.
+Dovresti aggiornare `monsterHealthText.innerText`.
 
 ```js
 assert.match(attack.toString(), /monsterHealthText\.innerText/);
 ```
 
-You should set `monsterHealthText.innerText` to `monsterHealth`.
+Dovresti impostare `monsterHealthText.innerText` su `monsterHealth`.
 
 ```js
 assert.match(attack.toString(), /monsterHealthText\.innerText\s*=\s*monsterHealth/);
@@ -279,7 +279,7 @@ function attack() {
   text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
   health -= monsters[fighting].level;
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
index acf1efd38b0..b493cdc449f 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
@@ -7,23 +7,23 @@ dashedName: step-124
 
 # --description--
 
-Add an `if` statement to check if `health` is less than or equal to `0`. If it is, call the `lose` function.
+Aggiungi un'istruzione `if` per verificare se `health` è minore o uguale a `0`. Se lo è, chiama la funzione `lose`.
 
 # --hints--
 
-Your `attack` function should have an `if` statement.
+La funzione `attack` dovrebbe avere un'istruzione `if`.
 
 ```js
 assert.match(attack.toString(), /if/);
 ```
 
-Your `if` statement should check if `health` is less than or equal to `0`.
+L'istruzione `if` dovrebbe verificare se `health` è minore o uguale a `0`.
 
 ```js
 assert.match(attack.toString(), /if\s*\(health\s*<=\s*0\)/);
 ```
 
-Your `if` statement should call the `lose` function.
+L'istruzione `if` dovrebbe chiamare la funzione `lose`.
 
 ```js
 assert.match(attack.toString(), /lose\(\)/);
@@ -275,7 +275,7 @@ function attack() {
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
   healthText.innerText = health;
   monsterHealthText.innerText = monsterHealth;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee154c8946678775c4a4.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee154c8946678775c4a4.md
index ac058ac03bc..7a5c86efa42 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee154c8946678775c4a4.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee154c8946678775c4a4.md
@@ -7,9 +7,9 @@ dashedName: step-125
 
 # --description--
 
-You can make an `else` statement conditional by using `else if`. At the end of your `if` statement, add an `else if` statement to check if `monsterHealth` is less than or equal to `0`. In your `else if`, call the `defeatMonster` function.
+Puoi rendere un'istruzione `else` condizionale usando `else if`. Alla fine dell'istruzione `if`, aggiungi un'istruzione `else if` per verificare se `monsterHealth` è minore o uguale a `0`. Nell'istruzione `else if`, chiama la funzione `defeatMonster`.
 
-Here's an example:
+Ecco un esempio:
 
 ```js
 if (num > 10) {
@@ -21,19 +21,19 @@ if (num > 10) {
 
 # --hints--
 
-You should have an `else if` statement.
+Dovresti avere un'istruzione `else if`.
 
 ```js
 assert.match(attack.toString(), /else if/);
 ```
 
-Your `else if` statement should check if `monsterHealth` is less than or equal to `0`.
+L'istruzione `else if` dovrebbe verificare se `monsterHealth` è minore o uguale a `0`.
 
 ```js
 assert.match(attack.toString(), /else\s*if\s*\(\s*monsterHealth\s*<=\s*0\s*\)/);
 ```
 
-Your `else if` statement should call the `defeatMonster` function.
+L'istruzione `else if` dovrebbe chiamare la funzione `defeatMonster`.
 
 ```js
 assert.match(attack.toString(), /else\s*if\s*\(\s*monsterHealth\s*<=\s*0\s*\)\s*\{\s*defeatMonster/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee71f018e968a056d369.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee71f018e968a056d369.md
index 94244500db9..04b3df3e194 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee71f018e968a056d369.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee71f018e968a056d369.md
@@ -7,29 +7,29 @@ dashedName: step-126
 
 # --description--
 
-At the end of your code, create the `defeatMonster` and `lose` functions. Leave them empty for now.
+Alla fine del codice, crea le funzioni `defeatMonster` e `lose`. Per ora, lasciale vuote.
 
 # --hints--
 
-You should use the `function` keyword to declare `defeatMonster`.
+Dovresti usare la parola chiave `function` per dichiarare `defeatMonster`.
 
 ```js
 assert.match(code, /function\s+defeatMonster/);
 ```
 
-`defeatMonster` should be an empty function.
+`defeatMonster` dovrebbe essere una funzione vuota.
 
 ```js
 assert.match(defeatMonster.toString(), /defeatMonster\s*\(\)\s*\{\s*\}/);
 ```
 
-You should use the `function` keyword to declare `lose`.
+Dovresti usare la parola chiave `function` per dichiarare `lose`.
 
 ```js
 assert.match(code, /function\s+lose/);
 ```
 
-`lose` should be an empty function.
+`lose` dovrebbe essere una funzione vuota.
 
 ```js
 assert.match(lose.toString(), /lose\s*\(\)\s*\{\s*\}/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
index 3524f53b4a3..cd14d9fb73e 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
@@ -7,17 +7,17 @@ dashedName: step-127
 
 # --description--
 
-Inside the `dodge` function, set `text.innerText` equal to the string `You dodge the attack from the [monster]`. Replace `[monster]` with the name of the monster, using the `name` property.
+All'interno della funzione `dodge`, imposta `text.innerText` uguale alla stringa `You dodge the attack from the [monster]`. Sostituisci `[monster]` con il nome del mostro, usando la proprietà `name`.
 
 # --hints--
 
-You should assign the string `You dodge the attack from the ` to the `text.innerText` property. Remember that spacing matters.
+Dovresti assegnare la stringa `You dodge the attack from the` alla proprietà `text.innerText`. Ricorda che la spaziatura è importante.
 
 ```js
 assert.match(dodge.toString(), /text\.innerText\s*=\s*('|")You dodge the attack from the \1/);
 ```
 
-You should use the concatenation operator to add the name of the monster to the end of the string. You can get this with `monster[fighting].name`.
+Dovresti usare l'operazione di concatenazione per aggiungere il nome del mostro alla fine della stringa. Puoi ottenerlo con `monster[fighting].name`.
 
 ```js
 assert.match(dodge.toString(), /text\.innerText\s*=\s*('|")You dodge the attack from the \1\s*\+\s*monsters\[fighting\]\.name/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eefe2e68b66ac563816b.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eefe2e68b66ac563816b.md
index f67c008aa05..89ce76686b4 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eefe2e68b66ac563816b.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eefe2e68b66ac563816b.md
@@ -7,25 +7,25 @@ dashedName: step-128
 
 # --description--
 
-In your `defeatMonster` function, set `gold` equal to `gold` plus the monster's level times `6.7`. You can get the monster's level with the `level` property.
+Nella funzione `defeatMonster`, imposta `gold` uguale a `gold` più il livello del mostro per `6.7`. Puoi ottenere il livello del mostro con la proprietà `level`.
 
-Here is an example of setting `num` to `num` plus `5` * `8`: `num += 5 * 8`. Use `Math.floor()` to round the result down.
+Ecco un esempio dell'impostazione di `num` su `num` più `5` * `8`: `num += 5 * 8`. Usa `Math.floor()` per arrotondare il risultato per difetto.
 
 # --hints--
 
-You should use compound assignment to modify `gold`.
+Dovresti usare l'assegnazione composta per modificare `gold`.
 
 ```js
 assert.match(defeatMonster.toString(), /gold\s*\+=/);
 ```
 
-You should use `Math.floor()` to round the result of the monster's level times `6.7`.
+Dovresti usare `Math.floor()` per arrotondare il risultato del livello del mostro moltiplicato per `6.7`.
 
 ```js
 assert.match(defeatMonster.toString(), /Math\.floor\(\s*monsters\[fighting\]\.level\s*\*\s*6\.7\s*\)/);
 ```
 
-You should add the result of `Math.floor(gold + monsters[fighting].level * 6.7)` to `gold`.
+Dovresti aggiungere il risultato di `Math.floor(gold + monsters[fighting].level * 6.7)` a `gold`.
 
 ```js
 assert.match(defeatMonster.toString(), /gold\s*\+=\s*Math\.floor\(\s*monsters\[fighting\]\.level\s*\*\s*6\.7\s*\)/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef6a52292f6bdca4f6f8.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef6a52292f6bdca4f6f8.md
index 678fd1314fc..02690a5e879 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef6a52292f6bdca4f6f8.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef6a52292f6bdca4f6f8.md
@@ -7,17 +7,17 @@ dashedName: step-129
 
 # --description--
 
-Set `xp` to `xp` plus the monster's level.
+Imposta `xp` su `xp` più il livello del mostro.
 
 # --hints--
 
-You should use compound assignment to modify `xp`.
+Dovresti usare l'assegnazione composta per modificare `xp`.
 
 ```js
 assert.match(defeatMonster.toString(), /xp\s*\+=/);
 ```
 
-You should add the monster's level to `xp`.
+Dovresti aggiungere il livello del mostro a `xp`.
 
 ```js
 assert.match(defeatMonster.toString(), /xp\s*\+=\s*monsters\[fighting\]\.level/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
index cb9eadcb3ec..ac3e5c728c1 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
@@ -7,17 +7,17 @@ dashedName: step-130
 
 # --description--
 
-Now update `goldText` and `xpText` to display the updated values.
+Ora aggiorna `goldText` e `xpText` in modo che mostrino i valori aggiornati.
 
 # --hints--
 
-You should update `goldText.innerText` to the value of `gold`.
+Dovresti aggiornare `goldText.innerText` con il valore di `gold`.
 
 ```js
 assert.match(defeatMonster.toString(), /goldText\.innerText\s*=\s*gold/);
 ```
 
-You should update `xpText.innerText` to the value of `xp`.
+Dovresti aggiornare `xpText.innerText` con il valore di `xp`.
 
 ```js
 assert.match(defeatMonster.toString(), /xpText\.innerText\s*=\s*xp/);
@@ -283,7 +283,7 @@ function dodge() {
 function defeatMonster() {
   gold += Math.floor(monsters[fighting].level * 6.7);
   xp += monsters[fighting].level;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
index ca92f837431..de842b9d749 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
@@ -7,17 +7,17 @@ dashedName: step-131
 
 # --description--
 
-Finish the `defeatMonster` function by calling the `update` function with `locations[4]` as the argument.
+Termina la funzione `defeatMonster` chiamando la funzione `update` con `locations[4]` come argomento.
 
 # --hints--
 
-You should call the `update` function.
+Dovresti chiamare la funzione `update`.
 
 ```js
 assert.match(defeatMonster.toString(), /update/);
 ```
 
-You should pass `locations[4]` as the argument.
+Dovresti passare `locations[4]` come argomento.
 
 ```js
 assert.match(defeatMonster.toString(), /update\(locations\[4\]\)/);
@@ -285,7 +285,7 @@ function defeatMonster() {
   xp += monsters[fighting].level;
   goldText.innerText = gold;
   xpText.innerText = xp;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
index dd0068655fd..4632d6eadbe 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
@@ -7,35 +7,35 @@ dashedName: step-132
 
 # --description--
 
-Your `locations` array doesn't have a fifth element, so `locations[4]` doesn't work. Add a new object at the end of the `locations` array, following the same structure as the other objects. Set `name` to `kill monster`, set `button text` to an array with three `Go to town square` strings, set `button functions` to an array with three `goTown` variables, and set `text` to `The monster screams Arg! as it dies. You gain experience points and find gold.`.
+L'array `locations` non possiede un quinto elemento, quindi `locations[4]` non funziona. Aggiungi un nuovo oggetto alla fine dell'array `locations`, seguendo la stessa struttura degli altri oggetti. Set `name` to `kill monster`, set `button text` to an array with three `Go to town square` strings, set `button functions` to an array with three `goTown` variables, and set `text` to `The monster screams Arg! as it dies. You gain experience points and find gold.`.
 
 # --hints--
- 
-Your `locations` array should have five values.
+
+L'array `locations` dovrebbe contenere cinque valori.
 
 ```js
 assert.lengthOf(locations, 5);
 ```
 
-Your fifth `locations` value should be an object.
+Il quinto valore di `locations` dovrebbe essere un oggetto.
 
 ```js
 assert.isObject(locations[4]);
 ```
 
-Your fifth `locations` value should have a `name` property with the value `kill monster`.
+Il quinto valore di `locations` dovrebbe avere una proprietà `name` con il valore `kill monster`.
 
 ```js
 assert.equal(locations[4].name, 'kill monster');
 ```
 
-Your fifth `locations` value should have a `button text` property with the value an array with three `Go to town square` strings.
+Il quinto valore di `locations` dovrebbe avere una proprietà `button text` con il valore di un array con tre stringhe `Go to town square`.
 
 ```js
 assert.deepEqual(locations[4]["button text"], ['Go to town square', 'Go to town square', 'Go to town square']);
 ```
 
-Your fifth `locations` value should have a `button functions` property with the value an array with three `goTown` variables.
+Il quinto valore di `locations` dovrebbe avere una proprietà `button functions` con il valore di un array con tre variabili `goTown`.
 
 ```js
 assert.deepEqual(locations[4]["button functions"], [goTown, goTown, goTown]);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f06fb318666fef69f91e.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f06fb318666fef69f91e.md
index ad30c67858d..43d57088b00 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f06fb318666fef69f91e.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f06fb318666fef69f91e.md
@@ -7,17 +7,17 @@ dashedName: step-133
 
 # --description--
 
-The word `Arg!` should have quotes around it. Besides escaping quotes, there is another way you can include quotation marks inside a string. Change the double quotes around the string `The monster screams Arg! as it dies. You gain experience points and find gold.` to single quotes `'`, then add double quotes around `Arg!`.
+La parola `Arg!` dovrebbe avere delle virgolette intorno. Oltre all'escaping delle virgolette, c'è un altro modo per includere le virgolette all'interno di una stringa. Change the double quotes around the string `The monster screams Arg! as it dies. You gain experience points and find gold.` to single quotes `'`, then add double quotes around `Arg!`.
 
 # --hints--
 
-You should use single quotes around the string.
+Dovresti usare virgolette singole attorno alla stringa.
 
 ```js
 assert.match(code, /'The monster screams "?Arg!"? as it dies. You gain experience points and find gold.'/);
 ```
 
-You should use double quotes around `Arg!`.
+Dovresti usare le virgolette doppie intorno ad `Arg!`.
 
 ```js
 assert.equal(locations[4].text, 'The monster screams "Arg!" as it dies. You gain experience points and find gold.');
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f14fe6d1fc72454648c7.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f14fe6d1fc72454648c7.md
index ee850581fa7..5a75a3de402 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f14fe6d1fc72454648c7.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f14fe6d1fc72454648c7.md
@@ -7,17 +7,17 @@ dashedName: step-134
 
 # --description--
 
-After a monster is defeated, the monster's stat box should no longer display. On the first line of the `update` function, use `monsterStats.style.display` to change the `display` value to `none`.
+Dopo che un mostro è stato sconfitto, la stat box del mostro non dovrebbe essere più visualizzata. Nella prima riga della funzione `update`, usa `monsterStats.style.display` per cambiare il valore di `display` in `none`.
 
 # --hints--
 
-You should use `monsterStats.style.display` in the `update` function.
+Dovresti usare `monsterStats.style.display` nella funzione `update`.
 
 ```js
 assert.match(update.toString(), /monsterStats\.style\.display/);
 ```
 
-You should set `monsterStats.style.display` to `none`.
+Dovresti impostare `monsterStats.style.display` su `none`.
 
 ```js
 assert.match(update.toString(), /monsterStats\.style\.display\s*=\s*('|")none\1/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f1d5f5ddbf74c07f733b.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f1d5f5ddbf74c07f733b.md
index de99851e153..714a09e4353 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f1d5f5ddbf74c07f733b.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f1d5f5ddbf74c07f733b.md
@@ -7,7 +7,7 @@ dashedName: step-135
 
 # --description--
 
-In the `lose` function, call the `update` function and pass in the sixth object of your `locations` array. Note that you haven't created this object just yet.
+Nella funzione `lose`, chiama la funzione `update` e passale il sesto oggetto dell'array `locations`. Nota che non hai ancora creato questo oggetto.
 
 # --hints--
 
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f20463b324759953edad.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f20463b324759953edad.md
index 097ae332be3..f6525ed53b2 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f20463b324759953edad.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f20463b324759953edad.md
@@ -7,69 +7,69 @@ dashedName: step-136
 
 # --description--
 
-At the end of your code, create a `restart` function. Inside this function, set `xp` to `0`, `health` to `100`, `gold` to `50`, `currentWeapon` to `0`, and set `inventory` to an array with the string `stick`.
+Alla fine del tuo codice, crea una funzione `restart`. All'interno di questa funzione, imposta `xp` a `0`, `health` a `100`, `gold` a `50`, `currentWeapon` a `0` e imposta `inventory` su un array con la stringa `stick`.
 
-Also update the `innerText` properties of `goldText`, `healthText`, and `xpText` to their current values.
+Aggiorna anche le proprietà `innerText` di `goldText`, `healthText` e `xpText` con i loro valori attuali.
 
-Finally, call the `goTown()` function.
+Infine, chiama la funzione `goTown()`.
 
 # --hints--
 
-You should use the `function` keyword to declare `restart`.
+Dovresti usare la parola chiave `function` per dichiarare `restart`.
 
 ```js
 assert.match(code, /function\s+restart/);
 ```
 
-Your `restart` function should set `xp` to `0`.
+La funzione `restart` dovrebbe impostare `xp` a `0`.
 
 ```js
 assert.match(restart.toString(), /xp\s*=\s*0/);
 ```
 
-Your `restart` function should set `health` to `100`.
+La funzione `restart` dovrebbe impostare `health` a `100`.
 
 ```js
 assert.match(restart.toString(), /health\s*=\s*100/);
 ```
 
-Your `restart` function should set `gold` to `50`.
+La funzione `restart` dovrebbe impostare `gold` a `50`.
 
 ```js
 assert.match(restart.toString(), /gold\s*=\s*50/);
 ```
 
-Your `restart` function should set `currentWeapon` to `0`.
+La funzione `restart` dovrebbe impostare `currentWeapon` a `0`.
 
 ```js
 assert.match(restart.toString(), /currentWeapon\s*=\s*0/);
 ```
 
-Your `restart` function should set `inventory` to an array with the string `stick`.
+La funzione `restart` dovrebbe impostare `inventory` su un array con la stringa `stick`.
 
 ```js
 assert.match(restart.toString(), /inventory\s*=\s*\[\s*('|")stick\1\s*\]/);
 ```
 
-Your `restart` function should call the `goTown()` function.
+La funzione `restart` dovrebbe chiamare la funzione `goTown()`.
 
 ```js
 assert.match(restart.toString(), /goTown\(\)/);
 ```
 
-You should set `goldText.innerText` to the value of `gold`.
+Dovresti impostare `goldText.innerText` con il valore di `gold`.
 
 ```js
 assert.match(restart.toString(), /goldText\.innerText\s*=\s*gold/);
 ```
 
-You should set `healthText.innerText` to the value of `health`.
+Dovresti impostare `healthText.innerText` con il valore di `health`.
 
 ```js
 assert.match(restart.toString(), /healthText\.innerText\s*=\s*health/);
 ```
 
-You should set `xpText.innerText` to the value of `xp`.
+Dovresti impostare `xpText.innerText` con il valore di `xp`.
 
 ```js
 assert.match(restart.toString(), /xpText\.innerText\s*=\s*xp/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f256b813a476cae51f49.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f256b813a476cae51f49.md
index 84ad6a8fbc2..7ad659d85ae 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f256b813a476cae51f49.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f256b813a476cae51f49.md
@@ -7,9 +7,9 @@ dashedName: step-138
 
 # --description--
 
-Back to your `attack` function - inside the `else if` block, create another `if` and `else` statement. If the player is fighting the dragon (`fighting` would be `2`), call the `winGame` function. Move the `defeatMonster()` call to the `else` block.
+Torna alla funzione `attack` - all'interno del blocco `else if`, crea delle altre istruzioni `if` ed `else`. Se il giocatore sta combattendo il drago (`fighting` ha il valore `2`), chiama la funzione `winGame`. Sposta la chiamata `defeatMonster()` nel blocco `else`.
 
-Here is an example that checks if `num` is equal to `5`:
+Ecco un esempio che verifica se `num` è uguale a `5`:
 
 ```js
 if (num === 5) {
@@ -21,35 +21,35 @@ if (num === 5) {
 
 # --hints--
 
-You should add a new `if` statement in your `else if` block.
+Dovresti aggiungere una nuova istruzione `if` nel blocco `else if`.
 
 ```js
 const block = attack.toString().split("else if");
 assert.include(block[1], "if");
 ```
 
-Your new `if` statement should check if `fighting` is equal to `2`.
+La nuova istruzione `if` dovrebbe verificare se `fighting` è uguale a `2`.
 
 ```js
 const block = attack.toString().split("else if");
 assert.match(block[1], /if\s*\(\s*fighting\s*===\s*2\s*\)/);
 ```
 
-You should call the `winGame` function in your `if` block.
+Dovresti chiamare la funzione `winGame` nel blocco `if`.
 
 ```js
 const block = attack.toString().split("else if");
 assert.match(block[1], /if\s*\(\s*fighting\s*===\s*2\s*\)\s*\{\s*winGame\(\)/);
 ```
 
-You should add an `else` block.
+Dovresti aggiungere un blocco `else`.
 
 ```js
 const block = attack.toString().split("else if");
 assert.include(block[1], "else");
 ```
 
-Your `else` block should call the `defeatMonster` function.
+Il blocco `else` dovrebbe chiamare la funzione `defeatMonster`.
 
 ```js
 const block = attack.toString().split("else if");
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f2bc37675e77d5835235.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f2bc37675e77d5835235.md
index cd564871491..327853f77d2 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f2bc37675e77d5835235.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f2bc37675e77d5835235.md
@@ -7,9 +7,9 @@ dashedName: step-139
 
 # --description--
 
-JavaScript has a conditional operator called the <dfn>ternary operator</dfn>. This can be used as a one-line `if-else` expression. The syntax is: `condition ? true : false`.
+JavaScript possiede un operatore condizionale chiamato <dfn>operatore ternario</dfn>. Può essere usato come un'espressione `if-else` su una riga. The syntax is: `condition ? true : false`.
 
-Here is an example of an `if-else` expression changed to a ternary:
+Ecco un esempio di espressione `if-else` cambiata in una ternaria:
 
 ```js
 if (num > 5) {
@@ -21,11 +21,11 @@ if (num > 5) {
 num > 5 ? bigger() : smaller();
 ```
 
-Change your new `if-else` expression to a ternary.
+Cambia la nuova espressione `if-else` in una ternaria.
 
 # --hints--
 
-You should remove the `if` and `else` from your `else if` block.
+Dovresti rimuovere `if` e `else` dal blocco `else if`.
 
 ```js
 const block = attack.toString().split("else if");
@@ -33,21 +33,21 @@ assert.notMatch(block[1], /if/);
 assert.notMatch(block[1], /else/);
 ```
 
-You should check if `fighting` is equal to `2`.
+Dovresti verificare se `fighting` è uguale a `2`.
 
 ```js
 const block = attack.toString().split("else if");
 assert.match(block[1], /fighting\s*===\s*2/);
 ```
 
-Using the ternary syntax, you should call `winGame` if `fighting` is equal to `2`.
+Usando la sintassi ternaria, dovresti chiamare `winGame` se `fighting` è uguale a `2`.
 
 ```js
 const block = attack.toString().split("else if");
 assert.match(block[1], /fighting\s*===\s*2\s*\?\s*winGame\(\)/);
 ```
 
-Using the ternary syntax, you should call `defeatMonster` if `fighting` is not equal to `2`.
+Usando la sintassi ternaria, dovresti chiamare `defeatMonster` se `fighting` non è uguale a `2`.
 
 ```js
 const block = attack.toString().split("else if");
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f35bde1750791f58773f.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f35bde1750791f58773f.md
index 6cf34e927c5..030f5de011e 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f35bde1750791f58773f.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f35bde1750791f58773f.md
@@ -7,17 +7,17 @@ dashedName: step-140
 
 # --description--
 
-After the `lose` function, create a function called `winGame`. Inside the `winGame` function, call the `update` function and pass in `locations[6]`.
+Dopo la funzione `lose`, crea una funzione chiamata `winGame`. All'interno della funzione `winGame`, chiama la funzione `update` e passale `locations[6]`.
 
 # --hints--
 
-You should use the `function` keyword to declare `winGame`.
+Dovresti usare la parola chiave `function` per dichiarare `winGame`.
 
 ```js
 assert.match(code, /function\s+winGame/);
 ```
 
-Your `winGame` function should call the `update` function and pass in `locations[6]`.
+La funzione `winGame` dovrebbe chiamare la funzione `update` passandole `locations[6]`.
 
 ```js
 assert.match(winGame.toString(), /update\s*\(\s*locations\[6\]\s*\)/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a94114ce0b8918b487390f.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a94114ce0b8918b487390f.md
index 8522ebd7445..7f68d0d53cf 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a94114ce0b8918b487390f.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a94114ce0b8918b487390f.md
@@ -7,35 +7,35 @@ dashedName: step-141
 
 # --description--
 
-Add another object in the `locations` array. Everything should be the same as the `lose` object, except the `name` should be `win` and the `text` should be `You defeat the dragon! YOU WIN THE GAME! 🎉`.
+Aggiungi un altro oggetto all'array `locations`. Everything should be the same as the `lose` object, except the `name` should be `win` and the `text` should be `You defeat the dragon! YOU WIN THE GAME! 🎉`.
 
 # --hints--
 
-You should have seven values in the `locations` array.
+Dovresti avere sette valori nell'array `locations`.
 
 ```js
 assert.lengthOf(locations, 7);
 ```
 
-Your seventh `locations` value should be an object.
+Il settimo valore di `locations` dovrebbe essere un oggetto.
 
 ```js
 assert.isObject(locations[6]);
 ```
 
-Your seventh `locations` value should have a `name` property with the value `win`.
+Il settimo valore di `locations` dovrebbe avere una proprietà `name` con il valore `win`.
 
 ```js
 assert.equal(locations[6].name, 'win');
 ```
 
-Your seventh `locations` value should have a `button text` property with the value an array with three `REPLAY?` strings.
+Il settimo valore di `locations` dovrebbe avere una proprietà `button text` con il valore di un array con tre stringhe `REPLAY?`.
 
 ```js
 assert.deepEqual(locations[6]["button text"], ['REPLAY?', 'REPLAY?', 'REPLAY?']);
 ```
 
-Your seventh `locations` value should have a `button functions` property with the value an array with three `restart` variables.
+Il settimo valore di `locations` dovrebbe avere una proprietà `button functions` con il valore di un array con tre variabili `restart`.
 
 ```js
 assert.deepEqual(locations[6]["button functions"], [restart, restart, restart]);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1cea594f152ba626b872.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1cea594f152ba626b872.md
index d38e7a2c1e2..78d2eedddd2 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1cea594f152ba626b872.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1cea594f152ba626b872.md
@@ -7,13 +7,13 @@ dashedName: step-142
 
 # --description--
 
-Your game could be complete now, but you can also make it more interesting.
+Il gioco potrebbe essere completo ora, ma si può anche rendere più interessante.
 
-Inside your `attack` function, change your `health -= monsters[fighting].level;` line to `health -= getMonsterAttackValue(monsters[fighting].level);`. This sets `health` equal to `health` minus the return value of the `getMonsterAttackValue` function, and passes the `level` of the monster as an argument.
+All'interno della funzione `attack`, cambia la riga `health -= monsters[fighting].level;` in `health -= getMonsterAttackValue(monsters[fighting].level);`. Questo imposta `health` uguale a `health` meno il valore di ritorno della funzione `getMonsterAttackValue` e passa il livello (`level`) del mostro come argomento.
 
 # --hints--
 
-You should update your `health` line to be `health -= getMonsterAttackValue(monsters[fighting].level);`.
+Dovresti aggiornare la riga `health` in modo che sia `health -= getMonsterAttackValue(monsters[fighting].level);`.
 
 ```js
 assert.match(attack.toString(), /health\s*-=\s*getMonsterAttackValue\(monsters\[fighting\].level\)/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d6736ba262cfa74344b.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d6736ba262cfa74344b.md
index 1dd06a164f4..9d3267240f5 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d6736ba262cfa74344b.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d6736ba262cfa74344b.md
@@ -7,17 +7,17 @@ dashedName: step-143
 
 # --description--
 
-Below your `attack` function, create an empty function named `getMonsterAttackValue`. It should take `level` as a parameter.
+Sotto la funzione `attack`, crea una funzione vuota chiamata `getMonsterAttackValue`. Dovrebbe prendere `level` come parametro.
 
 # --hints--
 
-You should use the `function` keyword to declare `getMonsterAttackValue`.
+Dovresti usare la parola chiave `function` per dichiarare `getMonsterAttackValue`.
 
 ```js
 assert.match(code, /function\s+getMonsterAttackValue/);
 ```
 
-Your `getMonsterAttackValue` should take `level` as a parameter.
+`getMonsterAttackValue` dovrebbe prendere `level` come parametro.
 
 ```js
 assert.match(code, /getMonsterAttackValue\(\s*level\s*\)/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d9f535e102e4663e7a6.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d9f535e102e4663e7a6.md
index 62f2bd62862..cb3bfa4bf21 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d9f535e102e4663e7a6.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d9f535e102e4663e7a6.md
@@ -7,25 +7,25 @@ dashedName: step-144
 
 # --description--
 
-The attack of the monster will be based on the monster's `level` and the player's `xp`. In the `getMonsterAttackValue` function, use `const` to create a variable called `hit`. Assign it the equation `(level * 5) - (Math.floor(Math.random() * xp));`.
+L'attacco del mostro sarà basato sul livello (`level`) del mostro e l'esperienza (`xp`) del giocatore. Nella funzione `getMonsterAttackValue`, usa `const` per creare una variabile chiamata `hit`. Assegnale l'equazione `(level * 5) - (Math.floor(Math.random() * xp));`.
 
-This will set the monster's attack to five times their `level` minus a random number between 0 and the player's `xp`.
+Questo imposterà l'attacco del mostro uguale a cinque volte il valore di `level` meno un numero casuale tra 0 e il valore `xp` del giocatore.
 
 # --hints--
 
-You should use `const` to declare the variable `hit`.
+Dovresti usare `const` per dichiarare la variabile `hit`.
 
 ```js
 assert.match(code, /const\s*hit/);
 ```
 
-You should use the equation `(level * 5) - (Math.floor(Math.random() * xp))`.
+Dovresti usare l'equazione `(level * 5) - (Math.floor(Math.random() * xp))`.
 
 ```js
 assert.match(getMonsterAttackValue, /(level\s*\*\s*5)\s*-\s*(Math.floor\(Math.random\(\)\s*\*\s*xp\))/);
 ```
 
-You should set `hit` to the value of `(level * 5) - (Math.floor(Math.random() * xp))`.
+Dovresti impostare `hit` sul valore `(level * 5) - (Math.floor(Math.random() * xp))`.
 
 ```js
 assert.match(code, /hit\s*=\s*\(level\s*\*\s*5\)\s*-\s*\(Math.floor\(Math.random\(\)\s*\*\s*xp\)\)/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e3c7c3d552fb04f0f18.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e3c7c3d552fb04f0f18.md
index 0e1f69267c5..1e843b4ed1d 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e3c7c3d552fb04f0f18.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e3c7c3d552fb04f0f18.md
@@ -7,11 +7,11 @@ dashedName: step-145
 
 # --description--
 
-Log the value of `hit` to the console to use in debugging. Remember that you can do this with `console.log()`.
+Mostra il valore di `hit` sulla console per usarlo nel debugging. Ricorda che puoi farlo con `console.log()`.
 
 # --hints--
 
-You should use the `console.log()` function to log the value of `hit`.
+Dovresti usare la funzione `console.log()` per mostrare il valore di `hit`.
 
 ```js
 assert.match(getMonsterAttackValue.toString(), /console\.log\(\s*hit\s*\)/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e8ccd579330e097ce44.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e8ccd579330e097ce44.md
index bcc2b14ee5a..181a8937e1e 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e8ccd579330e097ce44.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e8ccd579330e097ce44.md
@@ -7,9 +7,9 @@ dashedName: step-146
 
 # --description--
 
-Functions run specific blocks of code when they are called, but they can also <dfn>return</dfn> a value. This value can be assigned to a variable and used elsewhere in your code.
+Le funzioni eseguono specifici blocchi di codice quando sono chiamate, ma possono anche <dfn>restituire</dfn> un valore. Questo valore può essere assegnato a una variabile e usato altrove nel tuo codice.
 
-Use the `return` keyword to return the value of `hit` at the end of the function.
+Usa la parola chiave `return` per restituire il valore di `hit` alla fine della funzione.
 
 # --hints--
 
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
index 3e9df421573..6b3bc12e219 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
@@ -280,7 +280,7 @@ function attack() {
   text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
   health -= getMonsterAttackValue(monsters[fighting].level);
   if (isMonsterHit()) {
-    
+
   }
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
   healthText.innerText = health;
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
index 88836e37794..8bf8c85ac0e 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
@@ -7,7 +7,7 @@ dashedName: step-150
 
 # --description--
 
-Add an `else` statement to your `if` statement. In the `else` statement, use the `+=` operator to add the text ` You miss.` to the end of `text.innerText`.
+Add an `else` statement to your `if` statement. In the `else` statement, use the `+=` operator to add the text `You miss.` to the end of `text.innerText`.
 
 # --hints--
 
@@ -17,7 +17,7 @@ You should add an `else` block after your `if (isMonsterHit())` block.
 assert.match(attack.toString(), /if\s*\(isMonsterHit\(\)\s*\)\s*\{\s*monsterHealth\s*-=\s*weapons\[currentWeapon\]\.power\s*\+\s*Math\.floor\(Math\.random\(\)\s*\*\s*xp\)\s*\+\s*1;\s*\}\s*else/)
 ```
 
-You should add the text ` You miss.` to the end of `text.innerText`. Remember to use compound assignment.
+You should add the text `You miss.` to the end of `text.innerText`. Remember to use compound assignment.
 
 ```js
 assert.match(attack.toString(), /if\s*\(isMonsterHit\(\)\s*\)\s*\{\s*monsterHealth\s*-=\s*weapons\[currentWeapon\]\.power\s*\+\s*Math\.floor\(Math\.random\(\)\s*\*\s*xp\)\s*\+\s*1;\s*\}\s*else\s*\{\s*text\.innerText\s*\+=\s*('|")\sYou miss\.\1/)
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
index 4210b69f7a8..02ffeb838f6 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
@@ -7,7 +7,7 @@ dashedName: step-154
 
 # --description--
 
-Use the `+=` operator to add ` Your [weapon] breaks.` to the end of `text.innerText`, replacing `weapon` with the last item in the `inventory` array. You can get this last item by using `inventory.pop()`, which will remove the last item in the array AND return it so it appears in your string.
+Use the `+=` operator to add `Your [weapon] breaks.` to the end of `text.innerText`, replacing `weapon` with the last item in the `inventory` array. You can get this last item by using `inventory.pop()`, which will remove the last item in the array AND return it so it appears in your string.
 
 # --hints--
 
@@ -30,14 +30,14 @@ You should add the string " Your " to `text.innerText`. Remember that spacing ma
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1/);
 ```
 
-You should add the return value of `inventory.pop()` to the ` Your ` string.
+You should add the return value of `inventory.pop()` to the `Your` string.
 
 ```js
 console.log(attack.toString());
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1\s*\+\s*inventory\.pop\(\)/);
 ```
 
-You should add ` breaks.` to the ` "Your " + inventory.pop()` string.
+You should add `breaks.` to the `"Your " + inventory.pop()` string.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1\s*\+\s*inventory\.pop\(\)\s*\+\s*('|")\sbreaks\.\2/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
index b043a04a1a5..bb3a88b2824 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
@@ -375,7 +375,7 @@ function pickEight() {
 --fcc-editable-region--
 function pick(guess) {
   let numbers = [];
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
index ac85513b88f..c0e732491ac 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
@@ -11,13 +11,13 @@ After the `while` loop, set `text.innerText` to equal `You picked [guess]. Here
 
 # --hints--
 
-You should set `text.innerText` to the string `You picked `. Remember that spacing matters.
+You should set `text.innerText` to the string `You picked`. Remember that spacing matters.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1/);
 ```
 
-You should use the concatenation operator to add the value of the `guess` parameter to your `You picked ` string.
+You should use the concatenation operator to add the value of the `guess` parameter to your `You picked` string.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1\s*\+\s*guess/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
index 3b20e162326..7b34447692f 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
@@ -11,7 +11,7 @@ Before the final quote in that string you added, insert the new line escape char
 
 # --hints--
 
-You should add the new line escape character `\n` to your `. Here are the random numbers: ` string.
+You should add the new line escape character `\n` to your `. Here are the random numbers:` string.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1\s*\+\s*guess\s*\+\s*('|")\.\sHere are the random numbers:\\n\2/);
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
index 180270940d6..c57f4d75914 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
@@ -369,7 +369,7 @@ function pick(guess) {
     numbers.push(Math.floor(Math.random() * 11));
   }
   text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62ba17beef16c563069a65d8.md b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62ba17beef16c563069a65d8.md
index e5d8098b79a..ae771f670ee 100644
--- a/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62ba17beef16c563069a65d8.md
+++ b/curriculum/challenges/italian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62ba17beef16c563069a65d8.md
@@ -7,35 +7,35 @@ dashedName: step-137
 
 # --description--
 
-In the `locations` array, add another object at the end. Set the `name` property to `lose`, set `button text` to an array with three `REPLAY?` strings, set `button functions` to an array with three `restart` variables, and set `text` to `You die. ☠️`. You can copy that text to use the emote.
+Nell'array `locations`, aggiungi un altro oggetto alla fine. Set the `name` property to `lose`, set `button text` to an array with three `REPLAY?` strings, set `button functions` to an array with three `restart` variables, and set `text` to `You die. ☠️`. You can copy that text to use the emote.
 
 # --hints--
 
-You should have six values in the `locations` array.
+Dovresti avere sei valori nell'array `locations`.
 
 ```js
 assert.lengthOf(locations, 6);
 ```
 
-Your sixth `locations` value should be an object.
+Il sesto valore di `locations` dovrebbe essere un oggetto.
 
 ```js
 assert.isObject(locations[5]);
 ```
 
-Your sixth `locations` value should have a `name` property with the value `lose`.
+Il sesto valore di `locations` dovrebbe avere una proprietà `name` con il valore `lose`.
 
 ```js
 assert.equal(locations[5].name, 'lose');
 ```
 
-Your sixth `locations` value should have a `button text` property with the value an array with three `REPLAY?` strings.
+Il sesto valore di `locations` dovrebbe avere una proprietà `button text` con il valore di un array con tre stringhe `REPLAY?`.
 
 ```js
 assert.deepEqual(locations[5]["button text"], ['REPLAY?', 'REPLAY?', 'REPLAY?']);
 ```
 
-Your sixth `locations` value should have a `button functions` property with the value an array with three `restart` variables.
+Il sesto valore di `locations` dovrebbe avere una proprietà `button functions` con il valore di un array con tre variabili `restart`.
 
 ```js
 assert.deepEqual(locations[5]["button functions"], [restart, restart, restart]);
diff --git a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md
index 749dea65d49..38c4b0276f8 100644
--- a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md
+++ b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md
@@ -8,7 +8,7 @@ dashedName: falsy-bouncer
 
 # --description--
 
-すべての偽値を配列から取り除いてください。
+Remove all falsy values from an array. Return a new array; do not mutate the original array.
 
 JavaScriptにおける偽値とは、`false`、`null`、`0`、`""`、`undefined`、そして `NaN` です。
 
@@ -40,6 +40,14 @@ assert.deepEqual(bouncer([false, null, 0, NaN, undefined, '']), []);
 assert.deepEqual(bouncer([null, NaN, 1, 2, undefined]), [1, 2]);
 ```
 
+You should not mutate `arr`.
+
+```js
+const arr = ['a', false, 0, 'Naomi'];
+bouncer(arr);
+assert.deepEqual(arr, ['a', false, 0, 'Naomi'])
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
index 7a80c0ce756..f07b4d00bac 100644
--- a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
+++ b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
@@ -37,12 +37,6 @@ assert(code.match(/quotient/g).length === 1);
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function(y){return 'quotient = '+y;})(quotient);
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
index e6f6b221480..4c2dec37553 100644
--- a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
+++ b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
@@ -11,12 +11,12 @@ dashedName: escape-sequences-in-strings
 
 文字列の中で<dfn>エスケープ</dfn>できる文字は引用符だけではありません。 エスケープ文字を使用するのには 2 つ理由があります。
 
-1.  キャリッジリターンのように、他に入力する方法がない文字を使用できるようになります。
+1.  To allow you to use characters you may not otherwise be able to type out, such as a newline.
 2.  文字列中で複数の引用符を表現でき、JavaScript が正しく解釈できるようになります。
 
 前のチャレンジでは次のことを学習しました。
 
-<table class='table table-striped'><thead><tr><th>コード</th><th>出力</th></tr></thead><tbody><tr><td><code>\'</code></td><td>シングルクォート</td></tr><tr><td><code>\"</code></td><td>ダブルクォート</td></tr><tr><td><code>\\</code></td><td>バックスラッシュ (日本語では円記号)</td></tr><tr><td><code>\n</code></td><td>改行</td></tr><tr><td><code>\r</code></td><td>キャリッジリターン</td></tr><tr><td><code>\t</code></td><td>タブ</td></tr><tr><td><code>\b</code></td><td>単語境界</td></tr><tr><td><code>\f</code></td><td>改ページ</td></tr></tbody></table>
+<table class='table table-striped'><thead><tr><th>コード</th><th>出力</th></tr></thead><tbody><tr><td><code>\'</code></td><td>シングルクォート</td></tr><tr><td><code>\"</code></td><td>ダブルクォート</td></tr><tr><td><code>\\</code></td><td>バックスラッシュ (日本語では円記号)</td></tr><tr><td><code>\n</code></td><td>改行</td></tr><tr><td><code>\t</code></td><td>tab</td></tr><tr><td><code>\r</code></td><td>carriage return</td></tr><tr><td><code>\b</code></td><td>単語境界</td></tr><tr><td><code>\f</code></td><td>改ページ</td></tr></tbody></table>
 
 *バックスラッシュ自体をバックスラッシュとして表示するためにはエスケープする必要があります。*
 
@@ -78,14 +78,6 @@ assert(myStr === 'FirstLine\n\t\\SecondLine\nThirdLine');
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function(){
-if (myStr !== undefined){
-console.log('myStr:\n' + myStr);}})();
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
index c143f463a81..56464f48a60 100644
--- a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
+++ b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
@@ -31,12 +31,6 @@ assert(/var\s+a\s*=\s*9(\s*;?\s*)$/.test(code));
 
 # --seed--
 
-## --after-user-code--
-
-```js
-if(typeof a !== 'undefined') {(function(a){return "a = " + a;})(a);} else { (function() {return 'a is undefined';})(); }
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
index 9a58532c41a..1a4e470ef15 100644
--- a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
+++ b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
@@ -62,12 +62,6 @@ assert(code.match(/"/g).length === 4 && code.match(/'/g).length === 2);
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function() { return "myStr = " + myStr; })();
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
index 3e6a0e9a5bd..ee1fbe2d447 100644
--- a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
+++ b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
@@ -98,7 +98,7 @@ function nextInLine(arr, item) {
 }
 
 // Setup
-const testArr = [1, 2, 3, 4, 5];
+let testArr = [1, 2, 3, 4, 5];
 
 // Display code
 console.log("Before: " + JSON.stringify(testArr));
@@ -109,7 +109,7 @@ console.log("After: " + JSON.stringify(testArr));
 # --solutions--
 
 ```js
-const testArr = [1, 2, 3, 4, 5];
+let testArr = [1, 2, 3, 4, 5];
 
 function nextInLine(arr, item) {
     arr.push(item);
diff --git a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
index c0e09b07a8f..01ed88f780d 100644
--- a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
+++ b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
@@ -71,6 +71,13 @@ assert(
 );
 ```
 
+Global variables should not be used to cache the array.
+
+```js
+countdown(1)
+assert.deepStrictEqual(countdown(5), [5, 4, 3, 2, 1]);
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
index 019ff36438f..7193be81812 100644
--- a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
+++ b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
@@ -56,6 +56,13 @@ assert.deepStrictEqual(rangeOfNumbers(6, 9), [6, 7, 8, 9]);
 assert.deepStrictEqual(rangeOfNumbers(4, 4), [4]);
 ```
 
+Global variables should not be used to cache the array.
+
+```js
+rangeOfNumbers(1, 3)
+assert.deepStrictEqual(rangeOfNumbers(6, 9), [6, 7, 8, 9]);
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
index a933f518286..cb97b882688 100644
--- a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
+++ b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
@@ -12,24 +12,35 @@ ES6 では、<dfn>class</dfn> キーワードを使用してオブジェクト
 
 `class` 構文は単なる構文にすぎません。Java、Python、Ruby などの言語とは異なり、オブジェクト指向のパラダイムをクラスベースで本格的に実装するものではないことに注意してください。
 
-ES5 では、通常は `constructor` 関数を定義し、`new` キーワードを使用してオブジェクトをインスタンス化します。
-
-```js
-var SpaceShuttle = function(targetPlanet){
-  this.targetPlanet = targetPlanet;
-}
-var zeus = new SpaceShuttle('Jupiter');
-```
-
-`class` 構文は、こうした `constructor` 関数による作成の代わりとなるだけです。
+In ES5, an object can be created by defining a `constructor` function and using the `new` keyword to instantiate the object.
+
+In ES6, a `class` declaration has a `constructor` method that is invoked with the `new` keyword. If the `constructor` method is not explicitly defined, then it is implicitly defined with no arguments.
 
 ```js
+// Explicit constructor
 class SpaceShuttle {
   constructor(targetPlanet) {
     this.targetPlanet = targetPlanet;
   }
+  takeOff() {
+    console.log("To " + this.targetPlanet + "!");
+  }
 }
+
+// Implicit constructor 
+class Rocket {
+  launch() {
+    console.log("To the moon!");
+  }
+}
+
 const zeus = new SpaceShuttle('Jupiter');
+// prints To Jupiter! in console
+zeus.takeOff();
+
+const atlas = new Rocket();
+// prints To the moon! in console
+atlas.launch();
 ```
 
 `class` キーワードによって、コンストラクターの追加先となる新しい関数を宣言していることに注意してください。 このコンストラクターは、新しいオブジェクトを作成するために `new` が呼び出されるときに呼び出されます。
diff --git a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
index e066df98c6e..ea910750ca1 100644
--- a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
+++ b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
@@ -53,7 +53,8 @@ assert(
 `bicycle.setGear(48)` は、`gear` の値を 48 に変更する必要があります。
 
 ```js
-assert(new bicycle.setGear(48).gear === 48);
+bicycle.setGear(48);
+assert(bicycle.gear === 48);
 ```
 
 # --seed--
diff --git a/curriculum/challenges/japanese/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/japanese/02-javascript-algorithms-and-data-structures/functional-programming/add-elements-to-the-end-of-an-array-using-concat-instead-of-push.md
index c9241f55fc7..09487c8504a 100644
--- a/curriculum/challenges/japanese/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/japanese/02-javascript-algorithms-and-data-structures/functional-programming/add-elements-to-the-end-of-an-array-using-concat-instead-of-push.md
@@ -10,20 +10,20 @@ dashedName: add-elements-to-the-end-of-an-array-using-concat-instead-of-push
 
 関数型プログラミングで重要なのは、ミューテーションを起こさない関数を作成して使用することです。
 
-前回のチャレンジでは、元の配列をミューテートさせずに配列を新しい配列に結合する方法として、`concat` メソッドを紹介しました。 `concat` を `push` メソッドと比較してみましょう。 `push` は、呼び出された同じ配列の末尾にアイテムを追加し、その配列をミューテートさせます。 例を示します。
+The last challenge introduced the `concat` method as a way to merge arrays into a new array without mutating the original arrays. `concat` を `push` メソッドと比較してみましょう。 `push` adds items to the end of the same array it is called on, which mutates that array. 例を示します。
 
 ```js
 const arr = [1, 2, 3];
-arr.push([4, 5, 6]);
+arr.push(4, 5, 6);
 ```
 
-`arr` の変更後の値は `[1, 2, 3, [4, 5, 6]]` となりますが、これは関数型プログラミングの方法ではありません。
+`arr` would have a modified value of `[1, 2, 3, 4, 5, 6]`, which is not the functional programming way.
 
-`concat` では、ミューテーションの副作用を起こさずに、配列の末尾に新しいアイテムを追加できます。
+`concat` offers a way to merge new items to the end of an array without any mutating side effects.
 
 # --instructions--
 
-`nonMutatingPush` 関数を変更し、`push` の代わりに `concat` を使用して `newItem` を `original` の末尾に追加するようにしてください。 この関数は配列を返す必要があります。
+Change the `nonMutatingPush` function so it uses `concat` to merge `newItem` to the end of `original` without mutating `original` or `newItem` arrays. この関数は配列を返す必要があります。
 
 # --hints--
 
diff --git a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
index e561c29e10f..27bb5c2b4d7 100644
--- a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
+++ b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
@@ -137,14 +137,6 @@ assert.strictEqual(
 
 # --seed--
 
-## --after-user-code--
-
-```js
-if(bob){
-  bob = new Person("Bob Ross");
-}
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
index d162d540324..40ea3b19910 100644
--- a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
+++ b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
@@ -42,6 +42,13 @@ assert.deepEqual(steamrollArray([1, {}, [3, [[4]]]]), [1, {}, 3, 4]);
 assert(!code.match(/\.\s*flat\s*\(/) && !code.match(/\.\s*flatMap\s*\(/));
 ```
 
+Global variables should not be used.
+
+```js
+steamrollArray([1, {}, [3, [[4]]]])
+assert.deepEqual(steamrollArray([1, {}, [3, [[4]]]]), [1, {}, 3, 4])
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
index fb36c83c931..2c312d901a0 100644
--- a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
+++ b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
@@ -47,28 +47,48 @@ sumPrimes(10);
 # --solutions--
 
 ```js
-function eratosthenesArray(n) {
-    var primes = [];
-    if (n > 2) {
-        var half = n>>1;
-        var sieve = Array(half);
-        for (var i = 1, limit = Math.sqrt(n)>>1; i <= limit; i++) {
-            if (!sieve[i]) {
-                for (var step = 2*i+1, j = (step*step)>>1; j < half; j+=step) {
-                    sieve[j] = true;
-                }
-            }
-        }
-        primes.push(2);
-        for (var p = 1; p < half; p++) {
-            if (!sieve[p]) primes.push(2*p+1);
+class PrimeSeive {
+  constructor(num) {
+    const seive = Array(Math.floor((num - 1) / 2)).fill(true);
+    const upper = Math.floor((num - 1) / 2);
+    const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+
+    for (let i = 0; i <= sqrtUpper; i++) {
+      if (seive[i]) {
+        // Mark value in seive array
+        const prime = 2 * i + 3;
+        // Mark all multiples of this number as false (not prime)
+        const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+        for (let j = primeSqaredIndex; j < upper; j += prime) {
+          seive[j] = false;
         }
+      }
     }
-    return primes;
-}
+
+    this._seive = seive;
+  }
+
+  isPrime(num) {
+    return num === 2
+      ? true
+      : num % 2 === 0
+        ? false
+        : this.isOddPrime(num);
+  }
+
+  isOddPrime(num) {
+    return this._seive[(num - 3) / 2];
+  }
+};
 
 function sumPrimes(num) {
-  return eratosthenesArray(num+1).reduce(function(a,b) {return a+b;}, 0);
+  const primeSeive = new PrimeSeive(num);
+
+  let sum = 2;
+  for (let i = 3; i <= num; i += 2) {
+    if (primeSeive.isOddPrime(i)) sum += i;
+  }
+  return sum;
 }
 
 sumPrimes(10);
diff --git a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
index 2e5398f000f..5a3ded0d592 100644
--- a/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
+++ b/curriculum/challenges/japanese/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
@@ -79,23 +79,55 @@ assert(beagle.constructor === Dog);
 `beagle.eat()` は文字列 `nom nom nom` を出力する必要があります。
 
 ```js
-console.log = function (msg) {
-  throw msg;
-};
-assert.throws(() => beagle.eat(), 'nom nom nom');
+capture();
+beagle.eat();
+uncapture();
+assert(logOutput == 'nom nom nom');
 ```
 
 `beagle.bark()` は文字列 `Woof!` を出力する必要があります。
 
 ```js
-console.log = function (msg) {
-  throw msg;
-};
-assert.throws(() => beagle.bark(), 'Woof!');
+capture();
+beagle.bark();
+uncapture();
+assert(logOutput == 'Woof!');
 ```
 
 # --seed--
 
+## --before-user-code--
+
+```js
+var logOutput = "";
+var originalConsole = console
+function capture() {
+    var nativeLog = console.log;
+    console.log = function (message) {
+        logOutput = message;
+        if(nativeLog.apply) {
+          nativeLog.apply(originalConsole, arguments);
+        } else {
+          var nativeMsg = Array.prototype.slice.apply(arguments).join(' ');
+          nativeLog(nativeMsg);
+        }
+    };
+}
+
+function uncapture() {
+  console.log = originalConsole.log;
+}
+
+capture();
+```
+
+## --after-user-code--
+
+```js
+uncapture();
+(function() { return logOutput || "console.log never called"; })();
+```
+
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/japanese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md b/curriculum/challenges/japanese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
index 7524991590a..b65e2faa349 100644
--- a/curriculum/challenges/japanese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
+++ b/curriculum/challenges/japanese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
@@ -8,7 +8,7 @@ dashedName: build-a-25--5-clock
 
 # --description--
 
-**目標:** こちらと似た機能を持つアプリを構築してください: <a href="https://codepen.io/freeCodeCamp/full/XpKrrW" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/XpKrrW</a>
+**目標:** こちらと似た機能を持つアプリを構築してください: <a href="https://25--5-clock.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://25--5-clock.freecodecamp.rocks</a>
 
 下記のユーザーストーリーを満たして、すべてのテストに合格してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなた独自のスタイルを加えましょう。
 
diff --git a/curriculum/challenges/japanese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md b/curriculum/challenges/japanese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
index b3bec88b6fc..9512fb40f9a 100644
--- a/curriculum/challenges/japanese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
+++ b/curriculum/challenges/japanese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
@@ -8,7 +8,7 @@ dashedName: build-a-drum-machine
 
 # --description--
 
-**目標:** こちらと似た機能を持つアプリを構築してください: <a href="https://codepen.io/freeCodeCamp/full/MJyNMd" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/MJyNMd</a>
+**目標:** こちらと似た機能を持つアプリを構築してください: <a href="https://drum-machine.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://drum-machine.freecodecamp.rocks</a>
 
 下記のユーザーストーリーを満たして、すべてのテストに合格してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなた独自のスタイルを加えましょう。
 
diff --git a/curriculum/challenges/japanese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md b/curriculum/challenges/japanese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
index b8cfb9c620e..e22af23839c 100644
--- a/curriculum/challenges/japanese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
+++ b/curriculum/challenges/japanese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
@@ -8,7 +8,7 @@ dashedName: build-a-javascript-calculator
 
 # --description--
 
-**目標:** こちらと似た機能を持つアプリを構築してください: <a href="https://codepen.io/freeCodeCamp/full/wgGVVX" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/wgGVVX</a>
+**目標:** こちらと似た機能を持つアプリを構築してください: <a href="https://javascript-calculator.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://javascript-calculator.freecodecamp.rocks</a>
 
 下記のユーザーストーリーを満たして、すべてのテストに合格してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなた独自のスタイルを加えましょう。
 
diff --git a/curriculum/challenges/japanese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md b/curriculum/challenges/japanese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
index 7e63130edfa..0dd2365122a 100644
--- a/curriculum/challenges/japanese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
+++ b/curriculum/challenges/japanese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
@@ -8,7 +8,7 @@ dashedName: build-a-markdown-previewer
 
 # --description--
 
-**目標:** こちらと似た機能を持つアプリを構築してください: <a href="https://codepen.io/freeCodeCamp/full/GrZVVO" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/GrZVVO</a>
+**目標:** こちらと似た機能を持つアプリを構築してください: <a href="https://markdown-previewer.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://markdown-previewer.freecodecamp.rocks</a>
 
 下記のユーザーストーリーを満たして、すべてのテストに合格してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなた独自のスタイルを加えましょう。
 
diff --git a/curriculum/challenges/japanese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md b/curriculum/challenges/japanese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
index 7da5603856f..791ac859bdc 100644
--- a/curriculum/challenges/japanese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
+++ b/curriculum/challenges/japanese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
@@ -8,7 +8,7 @@ dashedName: build-a-random-quote-machine
 
 # --description--
 
-**目標:** こちらと似た機能を持つアプリを構築してください: <a href="https://codepen.io/freeCodeCamp/full/qRZeGZ" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/qRZeGZ</a>
+**目標:** こちらと似た機能を持つアプリを構築してください: <a href="https://random-quote-machine.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://random-quote-machine.freecodecamp.rocks</a>
 
 下記のユーザーストーリーを満たして、すべてのテストに合格してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなた独自のスタイルを加えましょう。
 
diff --git a/curriculum/challenges/japanese/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md b/curriculum/challenges/japanese/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
index c948ba4f0bf..afaebb6efc2 100644
--- a/curriculum/challenges/japanese/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
+++ b/curriculum/challenges/japanese/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
@@ -8,7 +8,7 @@ dashedName: visualize-data-with-a-bar-chart
 
 # --description--
 
-**目標:** こちらと似た機能を持つアプリを構築してください: <a href="https://codepen.io/freeCodeCamp/full/GrZVaM" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/GrZVaM</a>
+**目標:** こちらと似た機能を持つアプリを構築してください: <a href="https://bar-chart.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://bar-chart.freecodecamp.rocks</a>
 
 下記のユーザーストーリーを満たして、すべてのテストに合格してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなた独自のスタイルを加えましょう。
 
diff --git a/curriculum/challenges/japanese/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md b/curriculum/challenges/japanese/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
index cd165505796..87b86e9cc43 100644
--- a/curriculum/challenges/japanese/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
+++ b/curriculum/challenges/japanese/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
@@ -8,7 +8,7 @@ dashedName: visualize-data-with-a-choropleth-map
 
 # --description--
 
-**目標:** こちらと似た機能を持つアプリを構築してください: <a href="https://codepen.io/freeCodeCamp/full/EZKqza" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/EZKqza</a>
+**目標:** こちらと似た機能を持つアプリを構築してください: <a href="https://choropleth-map.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://choropleth-map.freecodecamp.rocks</a>
 
 下記のユーザーストーリーを満たして、すべてのテストに合格してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなた独自のスタイルを加えましょう。
 
diff --git a/curriculum/challenges/japanese/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md b/curriculum/challenges/japanese/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
index f796989a239..364fbc7991d 100644
--- a/curriculum/challenges/japanese/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
+++ b/curriculum/challenges/japanese/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
@@ -8,7 +8,7 @@ dashedName: visualize-data-with-a-heat-map
 
 # --description--
 
-**目標:** こちらと似た機能を持つアプリを構築してください: <a href="https://codepen.io/freeCodeCamp/full/JEXgeY" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/JEXgeY</a>
+**目標:** こちらと似た機能を持つアプリを構築してください: <a href="https://heat-map.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://heat-map.freecodecamp.rocks</a>
 
 下記のユーザーストーリーを満たして、すべてのテストに合格してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなた独自のスタイルを加えましょう。
 
diff --git a/curriculum/challenges/japanese/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md b/curriculum/challenges/japanese/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
index a18f3d7c922..1126201b478 100644
--- a/curriculum/challenges/japanese/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
+++ b/curriculum/challenges/japanese/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
@@ -8,7 +8,7 @@ dashedName: visualize-data-with-a-scatterplot-graph
 
 # --description--
 
-**目標:** こちらと似た機能を持つアプリを構築してください: <a href="https://codepen.io/freeCodeCamp/full/bgpXyK" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/bgpXyK</a>
+**目標:** こちらと似た機能を持つアプリを構築してください: <a href="https://scatterplot-graph.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://scatterplot-graph.freecodecamp.rocks</a>
 
 下記のユーザーストーリーを満たして、すべてのテストに合格してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなた独自のスタイルを加えましょう。
 
diff --git a/curriculum/challenges/japanese/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md b/curriculum/challenges/japanese/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
index bff9e2ce792..c0b9376b76b 100644
--- a/curriculum/challenges/japanese/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
+++ b/curriculum/challenges/japanese/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
@@ -8,7 +8,7 @@ dashedName: visualize-data-with-a-treemap-diagram
 
 # --description--
 
-**目標:** こちらと似た機能を持つアプリを構築してください: <a href="https://codepen.io/freeCodeCamp/full/KaNGNR" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/KaNGNR</a>
+**目標:** こちらと似た機能を持つアプリを構築してください: <a href="https://treemap-diagram.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://treemap-diagram.freecodecamp.rocks</a>
 
 下記のユーザーストーリーを満たして、すべてのテストに合格してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなた独自のスタイルを加えましょう。
 
diff --git a/curriculum/challenges/japanese/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md b/curriculum/challenges/japanese/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md
index 6635af199d4..a0074fbc6e9 100644
--- a/curriculum/challenges/japanese/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md
+++ b/curriculum/challenges/japanese/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md
@@ -10,9 +10,9 @@ dashedName: create-a-model
 
 **C**RUD パート I - 作成する
 
-まず最初に、スキーマが必要です。 各スキーマは、MongoDB コレクションにマップされます。 スキーマにより、コレクション内のドキュメントの形状を定義します。 スキーマは、モデルを組み立てるための基礎的な要素になります。 スキーマをネストさせて複雑なモデルを作成することもできますが、この例ではシンプルな構造にします。 モデルにより、ドキュメントと呼ばれるオブジェクトのインスタンスを作成できます。
+First of all, we need a Schema. 各スキーマは、MongoDB コレクションにマップされます。 スキーマにより、コレクション内のドキュメントの形状を定義します。 Schemas are building blocks for Models. They can be nested to create complex models, but in this case, we'll keep things simple. モデルにより、ドキュメントと呼ばれるオブジェクトのインスタンスを作成できます。
 
-Replit は実際のサーバーであり、実際のサーバーではデータベースとのやり取りはハンドラ関数の中で行います。 これらの関数は、何らかのイベントが発生した時に実行されます (たとえば、誰かが API 上のエンドポイントにアクセスしたとき)。 演習でも同じアプローチに従います。 `done()` 関数は、挿入、検索、更新または削除などの非同期操作を完了した後に処理を続行できることを示すコールバック関数です。 Node の規約に従い、成功時には `done(null, data)` を呼び出し、エラー時には `done(err)` を呼び出します。
+Replit is a real server, and in real servers, the interactions with the database happen in handler functions. これらの関数は、何らかのイベントが発生した時に実行されます (たとえば、誰かが API 上のエンドポイントにアクセスしたとき)。 演習でも同じアプローチに従います。 `done()` 関数は、挿入、検索、更新または削除などの非同期操作を完了した後に処理を続行できることを示すコールバック関数です。 Node の規約に従い、成功時には `done(null, data)` を呼び出し、エラー時には `done(err)` を呼び出します。
 
 警告 - リモートサービスとのやり取りではエラーが発生する可能性があります！
 
diff --git a/curriculum/challenges/japanese/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md b/curriculum/challenges/japanese/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md
index 8dabd05941c..26ddb64a43c 100644
--- a/curriculum/challenges/japanese/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md
+++ b/curriculum/challenges/japanese/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md
@@ -19,7 +19,7 @@ const io = require('socket.io')(http);
 
 *http* サーバーを *Express アプリ*にマウントしたので、*http* サーバーからリッスンする必要があります。 `app.listen` の行を `http.listen` に変更します。
 
-最初の処理として、クライアントからの新しい接続をリッスンします。 <dfn>on</dfn> キーワードがその処理を行い、特定のイベントがないかリッスンします。 ここでは、エミットされたイベントのタイトルを含む文字列と、データを渡すための関数の、2 つの引数が必要です。 コネクションリスナーの場合は、*ソケット*を使用して第 2 引数でデータを定義します。 ソケットとは、接続している個々のクライアントのことです。
+最初の処理として、クライアントからの新しい接続をリッスンします。 <dfn>on</dfn> キーワードがその処理を行い、特定のイベントがないかリッスンします。 It requires 2 arguments: a string containing the title of the event that's emitted, and a function with which the data is passed through. コネクションリスナーの場合は、*ソケット*を使用して第 2 引数でデータを定義します。 ソケットとは、接続している個々のクライアントのことです。
 
 サーバーへの接続をリッスンするには、データベース接続の中に次を追加します。
 
diff --git a/curriculum/challenges/japanese/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md b/curriculum/challenges/japanese/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md
index 2acffab6fab..e2c21c944e1 100644
--- a/curriculum/challenges/japanese/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md
+++ b/curriculum/challenges/japanese/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md
@@ -12,15 +12,39 @@ dashedName: use-a-template-engines-powers
 
 Pug ファイルでは変数を使用することができます。それには、変数名を `#{variable_name}` として参照し、要素上の他のテキストとともにインラインで記述します。または、要素に対して `p=variable_name` のように空白を付けずに等号を使用します (この例では変数の値が p 要素のテキストに割り当てられます)。
 
-Pug のシンタックスと構造については、[こちら](https://github.com/pugjs/pug)の GitHub README をぜひご覧してください。 Pug は、空白とタブを使用してネストされた要素を示し、少ないコード量で美しいサイトを作成することを目標としています。
+ Pug is all about using whitespace and tabs to show nested elements and cutting down on the amount of code needed to make a beautiful site. Read the Pug documentation for more information on usage and syntax.
 
-プロジェクトに含まれている pug ファイル「index.pug」では、変数 *title* と *message* を使用しました。
+ Here is an example:
 
-これらをサーバーから渡すには、*res.render* への 2 番目の引数として、変数とその値を持つオブジェクトを追加する必要があります。 たとえば、インデックスビューの変数を設定するために、`{title: 'Hello', message: 'Please login'}` というオブジェクトを渡すことができます。
+ ```html
+ <!--Typing this using Pug-->
+ head
+    script(type='text/javascript').
+      if (foo) bar(1 + 5);
+  body
+    if youAreUsingPug
+        p You are amazing
+      else
+        p Get on it!
 
-コードは `res.render(process.cwd() + '/views/pug/index', {title: 'Hello', message: 'Please login'});` のようになります。これでページを更新すると、index.pug ファイルに配置されているビュー内の正しい場所に、これらの値がレンダーされるはずです！
+<!--will lead to creating this code-->
+  <head>
+    <script type="text/javascript">
+      if (foo) bar(1 + 5);
+    </script>
+  </head>
+  <body>
+    <p>You are amazing</p>
+  </body>
+  ```
 
-正しいと思ったら、ページを送信してください。 エラーが発生している場合は、ここまでに完了したプロジェクトを[こちら](https://gist.github.com/camperbot/4af125119ed36e6e6a8bb920db0c0871)で確認できます。
+プロジェクトに含まれている pug ファイル `index.pug` では、変数 `title` と `message` を使用しました。
+
+これらをサーバーから渡すには、`res.render` への 2 番目の引数として、変数とその値を持つオブジェクトを追加する必要があります。 たとえば、インデックスビューの変数を設定するために、`{title: 'Hello', message: 'Please login'}` というオブジェクトを渡すことができます。
+
+コードは `res.render(process.cwd() + '/views/pug/index', {title: 'Hello', message: 'Please login'});` のようになります。これでページを更新すると、`index.pug` ファイルに配置されているビュー内の正しい場所に、これらの値がレンダーされるはずです！
+
+正しいと思ったら、ページを送信してください。 エラーが発生している場合は、ここまでに完了したプロジェクトを<a href="https://gist.github.com/camperbot/4af125119ed36e6e6a8bb920db0c0871" target="_blank" rel="noopener noreferrer nofollow">こちら</a>で確認できます。
 
 # --hints--
 
diff --git a/curriculum/challenges/japanese/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md b/curriculum/challenges/japanese/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md
index 7c69a5ee05e..d1e1599e74d 100644
--- a/curriculum/challenges/japanese/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md
+++ b/curriculum/challenges/japanese/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md
@@ -8,7 +8,7 @@ dashedName: assert-deep-equality-with--deepequal-and--notdeepequal
 
 # --description--
 
-注意点として、このプロジェクトは <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a> にあるスタータープロジェクトをベースに構築されているか、または <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a> からクローンされています。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>  or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `deepEqual()` は、2 つのオブジェクトが deep equal であることをアサートします。
 
diff --git a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md
index e813f2f69f2..577dce28740 100644
--- a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md
+++ b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md
@@ -14,7 +14,7 @@ dashedName: build-your-own-functions
 
 その他のリソース:
 
-\- [演習](https://www.youtube.com/watch?v=ksvGhDsjtpw)
+\- <a href="https://www.youtube.com/watch?v=ksvGhDsjtpw" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md
index 72249b87b25..6790d67fc0b 100644
--- a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md
+++ b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md
@@ -14,7 +14,7 @@ dashedName: comparing-and-sorting-tuples
 
 その他のリソース:
 
-\- [演習](https://www.youtube.com/watch?v=EhQxwzyT16E)
+\- <a href="https://www.youtube.com/watch?v=EhQxwzyT16E" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/dictionaries-and-loops.md b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/dictionaries-and-loops.md
index 12552e6ef1b..3111e3e56cc 100644
--- a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/dictionaries-and-loops.md
+++ b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/dictionaries-and-loops.md
@@ -14,7 +14,7 @@ dashedName: dictionaries-and-loops
 
 その他のリソース:
 
-\- [演習](https://www.youtube.com/watch?v=PrhZ9qwBDD8)
+\- <a href="https://www.youtube.com/watch?v=PrhZ9qwBDD8" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md
index 8f4af068323..8b3aaaaf333 100644
--- a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md
+++ b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md
@@ -14,7 +14,7 @@ dashedName: files-as-a-sequence
 
 その他のリソース:
 
-\- [演習](https://www.youtube.com/watch?v=il1j4wkte2E)
+\- <a href="https://www.youtube.com/watch?v=il1j4wkte2E" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md
index 101de1ccc63..b62a68102c4 100644
--- a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md
+++ b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md
@@ -14,9 +14,9 @@ dashedName: intermediate-expressions
 
 その他のリソース:
 
-\- [演習 1](https://youtu.be/t_4DPwsaGDY)
+\- <a href="https://youtu.be/t_4DPwsaGDY" target="_blank" rel="noopener noreferrer nofollow">Exercise 1</a>
 
-\- [演習 2](https://youtu.be/wgkC8SxraAQ)
+\- <a href="https://youtu.be/wgkC8SxraAQ" target="_blank" rel="noopener noreferrer nofollow">Exercise 2</a>
 
 # --question--
 
diff --git a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/intermediate-strings.md b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/intermediate-strings.md
index 6af49f32cb2..6f9fbc8c7d5 100644
--- a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/intermediate-strings.md
+++ b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/intermediate-strings.md
@@ -14,7 +14,7 @@ dashedName: intermediate-strings
 
 その他のリソース:
 
-\- [演習](https://www.youtube.com/watch?v=1bSqHot-KwE)
+\- <a href="https://www.youtube.com/watch?v=1bSqHot-KwE" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md
index bec73b54a0b..a02f61618b3 100644
--- a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md
+++ b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md
@@ -18,9 +18,9 @@ dashedName: introduction-why-program
 
 その他のリソース:
 
-\- [Windows に Python をインストール](https://youtu.be/F7mtLrYzZP8)
+\- <a href="https://youtu.be/F7mtLrYzZP8" target="_blank" rel="noopener noreferrer nofollow">Install Python on Windows</a>
 
-\- [MacOS に Python をインストール](https://youtu.be/wfLnZP-4sZw)
+\- <a href="https://youtu.be/wfLnZP-4sZw" target="_blank" rel="noopener noreferrer nofollow">Install Python on MacOS</a>
 
 # --question--
 
diff --git a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md
index ebc603df712..493b8019db7 100644
--- a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md
+++ b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md
@@ -14,7 +14,7 @@ dashedName: iterations-more-patterns
 
 その他のリソース:
 
-\- [演習](https://www.youtube.com/watch?v=kjxXZQw0uPg)
+\- <a href="https://www.youtube.com/watch?v=kjxXZQw0uPg" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md
index ead01683048..1fdbaefe36c 100644
--- a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md
+++ b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md
@@ -14,9 +14,9 @@ dashedName: more-conditional-structures
 
 その他のリソース:
 
-\- [演習 1](https://www.youtube.com/watch?v=crLerB4ZxMI)
+\- <a href="https://www.youtube.com/watch?v=crLerB4ZxMI" target="_blank" rel="noopener noreferrer nofollow">Exercise 1</a>
 
-\- [演習 2](https://www.youtube.com/watch?v=KJN3-7HH6yk)
+\- <a href="https://www.youtube.com/watch?v=KJN3-7HH6yk" target="_blank" rel="noopener noreferrer nofollow">Exercise 2</a>
 
 # --question--
 
diff --git a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md
index d0d5c1668b3..963f18be24e 100644
--- a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md
+++ b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md
@@ -14,11 +14,11 @@ dashedName: networking-web-scraping-with-python
 
 その他のリソース:
 
-\- [演習: socket1](https://www.youtube.com/watch?v=dWLdI143W-g)
+\- <a href="https://www.youtube.com/watch?v=dWLdI143W-g" target="_blank" rel="noopener noreferrer nofollow">Exercise: socket1</a>
 
-\- [演習: urllib](https://www.youtube.com/watch?v=8yis2DvbBkI)
+\- <a href="https://www.youtube.com/watch?v=8yis2DvbBkI" target="_blank" rel="noopener noreferrer nofollow">Exercise: urllib</a>
 
-\- [演習: urllinks](https://www.youtube.com/watch?v=g9flPDG9nnY)
+\- <a href="https://www.youtube.com/watch?v=g9flPDG9nnY" target="_blank" rel="noopener noreferrer nofollow">Exercise: urllinks</a>
 
 # --question--
 
diff --git a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md
index 391701abb78..d5b0841b8ae 100644
--- a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md
+++ b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md
@@ -10,27 +10,33 @@ bilibiliIds:
 dashedName: relational-databases-and-sqlite
 ---
 
+# --description--
+
+<a href="https://www.sqlite.org/download.html" target="_blank" rel="noopener noreferrer nofollow">Download SQLite</a>  
+<a href="https://sqlitebrowser.org/dl/" target="_blank" rel="noopener noreferrer nofollow">Download DB Browser for SQLite</a>  
+<a href="https://www.sqlite.org/famous.html" target="_blank" rel="noopener noreferrer nofollow">SQLite usage</a>
+
 # --question--
 
 ## --text--
 
-データベースの主要なデータ構造「ではない」ものはどれですか？
+Which is NOT a primary data structure in a database?
 
 ## --answers--
 
-インデックス
+index
 
 ---
 
-テーブル
+table
 
 ---
 
-行
+row
 
 ---
 
-列
+column
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md
index 91b324bcf71..dcb27c2938b 100644
--- a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md
+++ b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md
@@ -14,15 +14,15 @@ dashedName: relational-databases-many-to-many-relationships
 
 その他のリソース:
 
-\- [演習: Email](https://www.youtube.com/watch?v=uQ3Qv1z_Vao)
+\- <a href="https://www.youtube.com/watch?v=uQ3Qv1z_Vao" target="_blank" rel="noopener noreferrer nofollow">Exercise: Email</a>
 
-\- [演習: Roster](https://www.youtube.com/watch?v=qEkUEAz8j3o)
+\- <a href="https://www.youtube.com/watch?v=qEkUEAz8j3o" target="_blank" rel="noopener noreferrer nofollow">Exercise: Roster</a>
 
-\- [演習: Tracks](https://www.youtube.com/watch?v=I-E7avcPeSE)
+\- <a href="https://www.youtube.com/watch?v=I-E7avcPeSE" target="_blank" rel="noopener noreferrer nofollow">Exercise: Tracks</a>
 
-\- [演習: Twfriends](https://www.youtube.com/watch?v=RZRAoBFIH6A)
+\- <a href="https://www.youtube.com/watch?v=RZRAoBFIH6A" target="_blank" rel="noopener noreferrer nofollow">Exercise: Twfriends</a>
 
-\- [演習: Twspider](https://www.youtube.com/watch?v=xBaJddvJL4A)
+\- <a href="https://www.youtube.com/watch?v=xBaJddvJL4A" target="_blank" rel="noopener noreferrer nofollow">Exercise: Twspider</a>
 
 # --question--
 
diff --git a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md
index e9f9cf65328..0fed39d36a3 100644
--- a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md
+++ b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md
@@ -14,7 +14,7 @@ dashedName: strings-and-lists
 
 その他のリソース:
 
-\- [演習](https://www.youtube.com/watch?v=-9TfJF2dwHI)
+\- <a href="https://www.youtube.com/watch?v=-9TfJF2dwHI" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/web-services-api-rate-limiting-and-security.md b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/web-services-api-rate-limiting-and-security.md
index 7617e5a5c1e..d97eb6c0202 100644
--- a/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/web-services-api-rate-limiting-and-security.md
+++ b/curriculum/challenges/japanese/07-scientific-computing-with-python/python-for-everybody/web-services-api-rate-limiting-and-security.md
@@ -14,13 +14,13 @@ dashedName: web-services-api-rate-limiting-and-security
 
 その他のリソース:
 
-\- [演習: GeoJSON](https://www.youtube.com/watch?v=TJGJN0T8tak)
+\- <a href="https://www.youtube.com/watch?v=TJGJN0T8tak" target="_blank" rel="noopener noreferrer nofollow">Exercise: GeoJSON</a>
 
-\- [演習: JSON](https://www.youtube.com/watch?v=vTmw5RtfGMY)
+\- <a href="https://www.youtube.com/watch?v=vTmw5RtfGMY" target="_blank" rel="noopener noreferrer nofollow">Exercise: JSON</a>
 
-\- [演習: Twitter](https://www.youtube.com/watch?v=2c7YwhvpCro)
+\- <a href="https://www.youtube.com/watch?v=2c7YwhvpCro" target="_blank" rel="noopener noreferrer nofollow">Exercise: Twitter</a>
 
-\- [演習: XML](https://www.youtube.com/watch?v=AopYOlDa-vY)
+\- <a href="https://www.youtube.com/watch?v=AopYOlDa-vY" target="_blank" rel="noopener noreferrer nofollow">Exercise: XML</a>
 
 # --question--
 
diff --git a/curriculum/challenges/japanese/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md b/curriculum/challenges/japanese/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md
index a1b1526ba9d..e626aae158d 100644
--- a/curriculum/challenges/japanese/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md
+++ b/curriculum/challenges/japanese/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md
@@ -8,11 +8,11 @@ dashedName: arithmetic-formatter
 
 # --description--
 
-このプロジェクトは [Replit スターターコード](https://replit.com/github/freeCodeCamp/boilerplate-arithmetic-formatter)を使用して作業を行います。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-arithmetic-formatter" target="_blank" rel="noopener noreferrer nofollow"> working on this project with our Replit starter code</a>.
 
 # --instructions--
 
-Students in primary school often arrange arithmetic problems vertically to make them easier to solve. For example, "235 + 52" becomes:
+小学校の算数では計算問題を解きやすくするために縦書きにすることが多くあります。 たとえば「235 + 52」を次のように記述します。
 
 ```py
   235
@@ -64,7 +64,7 @@ The function will return the correct conversion if the supplied problems are pro
   - Each number (operand) should only contain digits. Otherwise, the function will return: `Error: Numbers must only contain digits.`
   - Each operand (aka number on each side of the operator) has a max of four digits in width. Otherwise, the error string returned will be: `Error: Numbers cannot be more than four digits.`
 - If the user supplied the correct format of problems, the conversion you return will follow these rules:
-  - There should be a single space between the operator and the longest of the two operands, the operator will be on the same line as the second operand, both operands will be in the same order as provided (the first will be the top one and the second will be the bottom.
+  - There should be a single space between the operator and the longest of the two operands, the operator will be on the same line as the second operand, both operands will be in the same order as provided (the first will be the top one and the second will be the bottom).
   - Numbers should be right-aligned.
   - There should be four spaces between each problem.
   - There should be dashes at the bottom of each problem. The dashes should run along the entire length of each problem individually. (The example above shows what this should look like.)
diff --git a/curriculum/challenges/japanese/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md b/curriculum/challenges/japanese/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md
index 85c5ccb8112..e4fb4a58d4b 100644
--- a/curriculum/challenges/japanese/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md
+++ b/curriculum/challenges/japanese/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md
@@ -8,25 +8,25 @@ dashedName: budget-app
 
 # --description--
 
-このプロジェクトは [Replit スターターコード](https://replit.com/github/freeCodeCamp/boilerplate-budget-app)を使用して作業を行います。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-budget-app" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 # --instructions--
 
 Complete the `Category` class in `budget.py`. It should be able to instantiate objects based on different budget categories like *food*, *clothing*, and *entertainment*. When objects are created, they are passed in the name of the category. The class should have an instance variable called `ledger` that is a list. The class should also contain the following methods:
 
-- A `deposit` method that accepts an amount and description. If no description is given, it should default to an empty string. The method should append an object to the ledger list in the form of `{"amount": amount, "description": description}`.
-- A `withdraw` method that is similar to the `deposit` method, but the amount passed in should be stored in the ledger as a negative number. If there are not enough funds, nothing should be added to the ledger. This method should return `True` if the withdrawal took place, and `False` otherwise.
-- A `get_balance` method that returns the current balance of the budget category based on the deposits and withdrawals that have occurred.
-- A `transfer` method that accepts an amount and another budget category as arguments. The method should add a withdrawal with the amount and the description "Transfer to [Destination Budget Category]". The method should then add a deposit to the other budget category with the amount and the description "Transfer from [Source Budget Category]". If there are not enough funds, nothing should be added to either ledgers. This method should return `True` if the transfer took place, and `False` otherwise.
-- A `check_funds` method that accepts an amount as an argument. It returns `False` if the amount is greater than the balance of the budget category and returns `True` otherwise. This method should be used by both the `withdraw` method and `transfer` method.
+- `deposit` (預け入れ) メソッド。金額と説明を受け取ります。 説明がない場合は、デフォルトで空の文字列にします。 The method should append an object to the ledger list in the form of `{"amount": amount, "description": description}`.
+- A `withdraw` method that is similar to the `deposit` method, but the amount passed in should be stored in the ledger as a negative number. If there are not enough funds, nothing should be added to the ledger. このメソッドは、引き出しが行われた場合は `True` を返し、それ以外の場合は `False` を返す必要があります。
+- `get_balance` (残高確認) メソッド。発生した入出金に基づいて予算カテゴリの現在の残高を返します。
+- `transfer` (送金) メソッド。引数として金額と別の予算カテゴリを受け取ります。 The method should add a withdrawal with the amount and the description "Transfer to [Destination Budget Category]". The method should then add a deposit to the other budget category with the amount and the description "Transfer from [Source Budget Category]". If there are not enough funds, nothing should be added to either ledgers. このメソッドは、送金が行われた場合は `True` を返し、それ以外の場合は `False` を返す必要があります。
+- `check_funds` (資金確認) メソッド。引数として金額を受け取ります。 It returns `False` if the amount is greater than the balance of the budget category and returns `True` otherwise. このメソッドは `withdraw` メソッドと `transfer` メソッドの両方で使用する必要があります。
 
 When the budget object is printed it should display:
 
-- A title line of 30 characters where the name of the category is centered in a line of `*` characters.
-- A list of the items in the ledger. Each line should show the description and amount. The first 23 characters of the description should be displayed, then the amount. The amount should be right aligned, contain two decimal places, and display a maximum of 7 characters.
-- A line displaying the category total.
+- 30 文字のタイトル行。`*` 文字を並べて 1 行とし、中央にカテゴリの名前を置きます。
+- 帳簿にある品目のリスト。 各行に説明と金額を表示します。 説明の最初の 23 文字を表示し、その後に金額を表示します。 金額は右揃えで、小数点以下 2 桁までを含み、最大 7 文字まで表示します。
+- カテゴリの合計を表示する行。
 
-Here is an example of the output:
+出力の例を次に示します。
 
 ```bash
 *************Food*************
@@ -37,13 +37,13 @@ Transfer to Clothing    -50.00
 Total: 923.96
 ```
 
-Besides the `Category` class, create a function (outside of the class) called `create_spend_chart` that takes a list of categories as an argument. It should return a string that is a bar chart.
+`Category` クラスの他に、カテゴリのリストを引数に取る `create_spend_chart` という関数を (クラスの外で) 作成してください。 この関数は棒グラフとなる文字列を返す必要があります。
 
-The chart should show the percentage spent in each category passed in to the function. The percentage spent should be calculated only with withdrawals and not with deposits. Down the left side of the chart should be labels 0 - 100. The "bars" in the bar chart should be made out of the "o" character. The height of each bar should be rounded down to the nearest 10. The horizontal line below the bars should go two spaces past the final bar. Each category name should be written vertically below the bar. There should be a title at the top that says "Percentage spent by category".
+The chart should show the percentage spent in each category passed in to the function. The percentage spent should be calculated only with withdrawals and not with deposits. Down the left side of the chart should be labels 0 - 100. The "bars" in the bar chart should be made out of the "o" character. 各棒の高さは最も近い 10 に切り下げる必要があります。 The horizontal line below the bars should go two spaces past the final bar. Each category name should be written vertically below the bar. There should be a title at the top that says "Percentage spent by category".
 
-This function will be tested with up to four categories.
+この関数は最大 4 つのカテゴリでテストされます。
 
-Look at the example output below very closely and make sure the spacing of the output matches the example exactly.
+次の出力例を参考にして、出力の間隔を例と正確に合わせてください。
 
 ```bash
 Percentage spent by category
@@ -69,7 +69,7 @@ Percentage spent by category
         g     
 ```
 
-The unit tests for this project are in `test_module.py`.
+このプロジェクトの単体テストは `test_module.py` にあります。
 
 ## 開発
 
diff --git a/curriculum/challenges/japanese/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md b/curriculum/challenges/japanese/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md
index 5d230fc031a..b23e922c67d 100644
--- a/curriculum/challenges/japanese/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md
+++ b/curriculum/challenges/japanese/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md
@@ -8,11 +8,11 @@ dashedName: polygon-area-calculator
 
 # --description--
 
-このプロジェクトは [Replit スターターコード](https://replit.com/github/freeCodeCamp/boilerplate-polygon-area-calculator)を使用して作業を行います。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-polygon-area-calculator" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 # --instructions--
 
-In this project you will use object oriented programming to create a Rectangle class and a Square class. The Square class should be a subclass of Rectangle and inherit methods and attributes.
+このプロジェクトでは、オブジェクト指向プログラミングを使用して、Rectangle クラスと Square クラスを作成します。 Square クラスは Rectangle のサブクラスであり、メソッドと属性を継承する必要があります。
 
 ## Rectangle クラス
 
@@ -20,21 +20,21 @@ When a Rectangle object is created, it should be initialized with `width` and `h
 
 - `set_width`
 - `set_height`
-- `get_area`: Returns area (`width * height`)
-- `get_perimeter`: Returns perimeter (`2 * width + 2 * height`)
-- `get_diagonal`: Returns diagonal (`(width ** 2 + height ** 2) ** .5`)
-- `get_picture`: Returns a string that represents the shape using lines of "\*". The number of lines should be equal to the height and the number of "\*" in each line should be equal to the width. There should be a new line (`\n`) at the end of each line. If the width or height is larger than 50, this should return the string: "Too big for picture.".
-- `get_amount_inside`: Takes another shape (square or rectangle) as an argument. Returns the number of times the passed in shape could fit inside the shape (with no rotations). For instance, a rectangle with a width of 4 and a height of 8 could fit in two squares with sides of 4.
+- `get_area`: 面積を返します (`width * height`)
+- `get_perimeter`: 外周を返します (`2 * width + 2 * height`)
+- `get_diagonal`: 対角線を返します(`(width ** 2 + height ** 2) ** .5`)
+- `get_picture`: "\*" の行を使用して図形を表す文字列を返します。 行数は高さと等しく、各行の"\*"の数は幅と等しくする必要があります。 各行の末尾に改行 (`\n`) が必要です。 幅または高さが 50 より大きい場合は、文字列 "Too big for picture." を返す必要があります。
+- `get_amount_inside`: 引数として別の図形 (正方形または長方形) を受け取ります。 渡された図形が、その図形の中に何個収まるかを返します (回転はしません)。 たとえば、幅が 4 で高さが 8 の長方形には、一辺が 4 の正方形が 2つ収まります。
 
 Additionally, if an instance of a Rectangle is represented as a string, it should look like: `Rectangle(width=5, height=10)`
 
 ## Square クラス
 
-The Square class should be a subclass of Rectangle. When a Square object is created, a single side length is passed in. The `__init__` method should store the side length in both the `width` and `height` attributes from the Rectangle class.
+Square クラスは Rectangle のサブクラスである必要があります。 Square オブジェクトが生成されるときは、一辺の長さを渡します。 `__init__` メソッドでは、一辺の長さを Rectangle クラスの `width` 属性と `height` 属性の両方に格納する必要があります。
 
-The Square class should be able to access the Rectangle class methods but should also contain a `set_side` method. If an instance of a Square is represented as a string, it should look like: `Square(side=9)`
+Square クラスは、Rectangle クラスのメソッドにアクセスできる必要があり、加えて `set_side` メソッドも含める必要があります。 If an instance of a Square is represented as a string, it should look like: `Square(side=9)`
 
-Additionally, the `set_width` and `set_height` methods on the Square class should set both the width and height.
+また、Square クラスの `set_width` と `set_height` メソッドでは、幅と高さの両方を設定する必要があります。
 
 ## 使用例
 
@@ -58,7 +58,7 @@ rect.set_width(16)
 print(rect.get_amount_inside(sq))
 ```
 
-That code should return:
+上記のコードは次を返す必要があります。
 
 ```bash
 50
@@ -79,11 +79,11 @@ Square(side=4)
 8
 ```
 
-The unit tests for this project are in `test_module.py`.
+このプロジェクトの単体テストは `test_module.py` にあります。
 
 ## 開発
 
-Write your code in `shape_calculator.py`. For development, you can use `main.py` to test your `shape_calculator()` function. Click the "run" button and `main.py` will run.
+`shape_calculator.py` でコードを記述してください。 開発には `main.py` を使用して `shape_calculator()` 関数をテストすることができます。 Click the "run" button and `main.py` will run.
 
 ## テスト
 
@@ -91,11 +91,11 @@ We imported the tests from `test_module.py` to `main.py` for your convenience. T
 
 ## 提出
 
-Copy your project's URL and submit it to freeCodeCamp.
+プロジェクトの URL をコピーし、freeCodeCamp に提出してください。
 
 # --hints--
 
-It should create a Rectangle class and Square class and pass all tests.
+Rectangle クラスと Square クラスを作成し、すべてのテストに合格する必要があります。
 
 ```js
 
diff --git a/curriculum/challenges/japanese/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md b/curriculum/challenges/japanese/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md
index 923413b43f1..63566ebbab7 100644
--- a/curriculum/challenges/japanese/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md
+++ b/curriculum/challenges/japanese/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md
@@ -8,7 +8,7 @@ dashedName: probability-calculator
 
 # --description--
 
-このプロジェクトは [Replit スターターコード](https://replit.com/github/freeCodeCamp/boilerplate-probability-calculator)を使用して作業を行います。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-probability-calculator" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 # --instructions--
 
@@ -28,18 +28,18 @@ A hat will always be created with at least one ball. The arguments passed into t
 
 The `Hat` class should have a `draw` method that accepts an argument indicating the number of balls to draw from the hat. This method should remove balls at random from `contents` and return those balls as a list of strings. The balls should not go back into the hat during the draw, similar to an urn experiment without replacement. If the number of balls to draw exceeds the available quantity, return all the balls.
 
-Next, create an `experiment` function in `prob_calculator.py` (not inside the `Hat` class). This function should accept the following arguments:
+次に、(`Hat` クラスの中ではなく) `prob_calculator.py` で `experiment` 関数を作成してください。 この関数は次の引数を受け取る必要があります。
 
-- `hat`: A hat object containing balls that should be copied inside the function.
-- `expected_balls`: An object indicating the exact group of balls to attempt to draw from the hat for the experiment. For example, to determine the probability of drawing 2 blue balls and 1 red ball from the hat, set `expected_balls` to `{"blue":2, "red":1}`.
-- `num_balls_drawn`: The number of balls to draw out of the hat in each experiment.
-- `num_experiments`: The number of experiments to perform. (The more experiments performed, the more accurate the approximate probability will be.)
+- `hat`: 関数内でコピーする必要のあるボールを含む帽子オブジェクト。
+- `expected_balls`: 実験で帽子から取り出そうとするボールの正確なグループを示すオブジェクト。 たとえば、青のボール 2 個と赤のボール 1 個を帽子から取り出す確率を調べるには、`expected_balls` を `{"blue":2, "red":1}` に設定します。
+- `num_balls_drawn`: 各実験で帽子から取り出すボールの数。
+- `num_experiments`: 実行する実験の回数 (実験の回数が多いほど、おおよその確率の正確性が高まります)。
 
-The `experiment` function should return a probability.
+`experiment` 関数は、確率を返す必要があります。
 
-For example, let's say that you want to determine the probability of getting at least 2 red balls and 1 green ball when you draw 5 balls from a hat containing 6 black, 4 red, and 3 green. To do this, we perform `N` experiments, count how many times `M` we get at least 2 red balls and 1 green ball, and estimate the probability as `M/N`. Each experiment consists of starting with a hat containing the specified balls, drawing a number of balls, and checking if we got the balls we were attempting to draw.
+For example, if you want to determine the probability of getting at least two red balls and one green ball when you draw five balls from a hat containing six black, four red, and three green. To do this, you will perform `N` experiments, count how many times `M` you get at least two red balls and one green ball, and estimate the probability as `M/N`. Each experiment consists of starting with a hat containing the specified balls, drawing several balls, and checking if you got the balls you were attempting to draw.
 
-Here is how you would call the `experiment` function based on the example above with 2000 experiments:
+上記の例で 2000 回の実験を行う場合は、`experiment` 関数を次のように呼び出します。
 
 ```py
 hat = Hat(black=6, red=4, green=3)
@@ -49,27 +49,27 @@ probability = experiment(hat=hat,
                   num_experiments=2000)
 ```
 
-Since this is based on random draws, the probability will be slightly different each time the code is run.
+この方法は無作為抽出に基づいているため、コードが実行されるたびに確率が多少変わります。
 
-*Hint: Consider using the modules that are already imported at the top of `prob_calculator.py`. Do not initialize random seed within `prob_calculator.py`.*
+*ヒント: `prob_calculator.py` の先頭ですでにインポートされているモジュールを使用することを検討してください。 `prob_calculator.py` の中で乱数シードを初期化しないでください。*
 
 ## 開発
 
-Write your code in `prob_calculator.py`. For development, you can use `main.py` to test your code. Click the "run" button and `main.py` will run.
+`prob_calculator.py` でコードを記述してください。 開発には `main.py` を使用してコードをテストすることができます。 Click the "run" button and `main.py` will run.
 
-The boilerplate includes `import` statements for the `copy` and `random` modules. Consider using those in your project.
+ボイラープレートには `copy` モジュールと `random` モジュール用の `import` ステートメントが含まれています。 これらをプロジェクトで使用することを検討してください。
 
 ## テスト
 
-The unit tests for this project are in `test_module.py`. We imported the tests from `test_module.py` to `main.py` for your convenience. The tests will run automatically whenever you hit the "run" button.
+このプロジェクトの単体テストは `test_module.py` にあります。 We imported the tests from `test_module.py` to `main.py` for your convenience. The tests will run automatically whenever you hit the "run" button.
 
 ## 提出
 
-Copy your project's URL and submit it to freeCodeCamp.
+プロジェクトの URL をコピーし、freeCodeCamp に提出してください。
 
 # --hints--
 
-It should correctly calculate probabilities and pass all tests.
+確率を正しく計算し、すべてのテストに合格する必要があります。
 
 ```js
 
diff --git a/curriculum/challenges/japanese/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md b/curriculum/challenges/japanese/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md
index 7b7bcfcad16..b57c40ba15a 100644
--- a/curriculum/challenges/japanese/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md
+++ b/curriculum/challenges/japanese/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md
@@ -8,7 +8,7 @@ dashedName: time-calculator
 
 # --description--
 
-このプロジェクトは [Replit スターターコード](https://replit.com/github/freeCodeCamp/boilerplate-time-calculator)を使用して作業を行います。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-time-calculator" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 # --instructions--
 
diff --git a/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md b/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md
index 43656aad96f..5a7fcd7fab3 100644
--- a/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md
+++ b/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md
@@ -11,32 +11,33 @@ dashedName: introduction-to-data-analysis
 ---
 
 # --description--
+Data analysis is the act of turning raw, messy data into useful insights by cleaning the data up, transforming it, manipulating it, and inspecting it.
 
-その他のリソース:
+More resources:
 
-\- [スライド](https://docs.google.com/presentation/d/1cUIt8b2ySz-85_ykfeuuWsurccwTAuFPn782pZBzFsU/edit?usp=sharing)
+\- <a href="https://www.freecodecamp.org/news/what-is-data-analysis/" rel="noopener noreferrer nofollow">News article</a>
 
 # --question--
 
 ## --text--
 
-次のうち、**データ分析の一部ではない**ことはどれですか？
+Which of the following is **not** part of Data Analysis?
 
 ## --answers--
 
-統計モデルとデータ可視化を構築すること。
+Building statistical models and data visualizations.
 
 ---
 
-分析にとって望ましい結論を選ぶこと。
+Picking a desired conclusion for the analysis.
 
 ---
 
-不正な値を修正し、無効なデータを削除すること。
+Fixing incorrect values and removing invalid data.
 
 ---
 
-データを適切なデータ構造に変換すること。
+Transforming data into an appropriate data structure.
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md b/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md
index f969e7bab2b..f5da0d46944 100644
--- a/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md
+++ b/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md
@@ -8,12 +8,13 @@ dashedName: demographic-data-analyzer
 
 # --description--
 
-このプロジェクトは [Replit スターターコード](https://replit.com/github/freeCodeCamp/boilerplate-demographic-data-analyzer)を使用して作業を行います。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-demographic-data-analyzer" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 Python カリキュラムの対話式教育コンテンツを引き続き開発中です。 現在、下記の freeCodeCamp.org YouTube チャンネルで、このプロジェクトの完了に必要なすべての知識について説明する動画をいくつか公開しています。
 
-- [「みんなで Python」ビデオコース](https://www.freecodecamp.org/news/python-for-everybody/) (14 時間)
-- [「Python を学ぶ」ビデオコース](https://www.freecodecamp.org/news/learn-python-video-course/) (10 時間)
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a> (14 hours)
+
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">How to Analyze Data with Python Pandas</a> (10 hours)
 
 # --instructions--
 
@@ -59,7 +60,7 @@ Pandas を使用して次の問いに答える必要があります。
 
 ## データセットのソース
 
-Dua, D. and Graff, C. (2019). [UCI Machine Learning Repository](http://archive.ics.uci.edu/ml). Irvine, CA: University of California, School of Information and Computer Science.
+Dua, D. and Graff, C. (2019). <a href="http://archive.ics.uci.edu/ml" target="_blank" rel="noopener noreferrer nofollow">UCI Machine Learning Repository</a>. Irvine, CA: University of California, School of Information and Computer Science.
 
 # --hints--
 
diff --git a/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md b/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md
index 4f531aac1a5..d6448cf0c5e 100644
--- a/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md
+++ b/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md
@@ -8,12 +8,13 @@ dashedName: mean-variance-standard-deviation-calculator
 
 # --description--
 
-このプロジェクトは [Replit スターターコード](https://replit.com/github/freeCodeCamp/boilerplate-mean-variance-standard-deviation-calculator)を使用して作業を行います。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-mean-variance-standard-deviation-calculator" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 Python カリキュラムの対話式教育コンテンツを引き続き開発中です。 現在、下記の freeCodeCamp.org YouTube チャンネルで、このプロジェクトの完了に必要なすべての知識について説明する動画をいくつか公開しています。
 
-- [「みんなで Python」ビデオコース](https://www.freecodecamp.org/news/python-for-everybody/) (14 時間)
-- [「Python を学ぶ」ビデオコース](https://www.freecodecamp.org/news/learn-python-video-course/) (10 時間)
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a>(14 hours)
+
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">How to Analyze Data with Python Pandas</a> (10 hours)
 
 # --instructions--
 
diff --git a/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md b/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md
index badd75c960c..f3a6ecec78d 100644
--- a/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md
+++ b/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md
@@ -8,12 +8,13 @@ dashedName: medical-data-visualizer
 
 # --description--
 
-このプロジェクトは [Replit スターターコード](https://replit.com/github/freeCodeCamp/boilerplate-medical-data-visualizer)を使用して作業を行います。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-medical-data-visualizer" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 Python カリキュラムの対話式教育コンテンツを引き続き開発中です。 現在、下記の freeCodeCamp.org YouTube チャンネルで、このプロジェクトの完了に必要なすべての知識について説明する動画をいくつか公開しています。
 
-- [「みんなで Python」ビデオコース](https://www.freecodecamp.org/news/python-for-everybody/) (14 時間)
-- [「Python を学ぶ」ビデオコース](https://www.freecodecamp.org/news/learn-python-video-course/) (10 時間)
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a>(14 hours)
+
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">How to Analyze Data with Python Pandas</a> (10 hours)
 
 # --instructions--
 
@@ -25,20 +26,20 @@ Python カリキュラムの対話式教育コンテンツを引き続き開発
 
 ファイル名: medical_examination.csv
 
-|                            特徴                            | 変数のタイプ |     変数      |             値のタイプ              |
-|:--------------------------------------------------------:|:------:|:-----------:|:------------------------------:|
-|                         Age (年齢)                         | 客観的特徴  |     age     |            int (日数)            |
-|                       Height (身長)                        | 客観的特徴  |   height    |            int (cm)            |
-|                       Weight (体重)                        | 客観的特徴  |   weight    |           float (kg)           |
-|                       Gender (性別)                        | 客観的特徴  |   gender    |            カテゴリコード             |
-|              Systolic blood pressure (最高血圧)              | 検査の特徴  |    ap_hi    |              int               |
-|             Diastolic blood pressure (最低血圧)              | 検査の特徴  |    ap_lo    |              int               |
-|                  Cholesterol (コレステロール値)                  | 検査の特徴  | cholesterol | 1: 正常値、2: 正常値より高い、3: 正常値を優に超える |
-|                      Glucose (血糖値)                       | 検査の特徴  |    gluc     | 1: 正常値、2: 正常値より高い、3: 正常値を優に超える |
-|                       Smoking (喫煙)                       | 主観的特徴  |    smoke    |             binary             |
-|                 Alcohol intake (アルコール摂取)                 | 主観的特徴  |    alco     |             binary             |
-|                Physical activity (身体活動状況)                | 主観的特徴  |   active    |             binary             |
-| Presence or absence of cardiovascular disease (心血管疾患の有無) | 目的の変数  |   cardio    |             binary             |
+|                            特徴                            | 変数のタイプ |      変数       |             値のタイプ              |
+|:--------------------------------------------------------:|:------:|:-------------:|:------------------------------:|
+|                         Age (年齢)                         | 客観的特徴  |     `age`     |            int (日数)            |
+|                       Height (身長)                        | 客観的特徴  |   `height`    |            int (cm)            |
+|                       Weight (体重)                        | 客観的特徴  |   `weight`    |           float (kg)           |
+|                       Gender (性別)                        | 客観的特徴  |   `gender`    |            カテゴリコード             |
+|              Systolic blood pressure (最高血圧)              | 検査の特徴  |    `ap_hi`    |              int               |
+|             Diastolic blood pressure (最低血圧)              | 検査の特徴  |    `ap_lo`    |              int               |
+|                  Cholesterol (コレステロール値)                  | 検査の特徴  | `cholesterol` | 1: 正常値、2: 正常値より高い、3: 正常値を優に超える |
+|                      Glucose (血糖値)                       | 検査の特徴  |    `gluc`     | 1: 正常値、2: 正常値より高い、3: 正常値を優に超える |
+|                       Smoking (喫煙)                       | 主観的特徴  |    `smoke`    |             binary             |
+|                 Alcohol intake (アルコール摂取)                 | 主観的特徴  |    `alco`     |             binary             |
+|                Physical activity (身体活動状況)                | 主観的特徴  |   `active`    |             binary             |
+| Presence or absence of cardiovascular disease (心血管疾患の有無) | 目的の変数  |   `cardio`    |             binary             |
 
 ## タスク
 
diff --git a/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md b/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md
index ec848ea34f0..78b7988ef78 100644
--- a/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md
+++ b/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md
@@ -8,12 +8,13 @@ dashedName: page-view-time-series-visualizer
 
 # --description--
 
-このプロジェクトは [Replit スターターコード](https://replit.com/github/freeCodeCamp/boilerplate-page-view-time-series-visualizer)を使用して作業を行います。
+<a href="https://replit.com/github/freeCodeCamp/boilerplate-page-view-time-series-visualizer" target="_blank" rel="noopener noreferrer nofollow">このプロジェクトには Replit スターターコードを使用して取り組んでください</a>。
 
 Python カリキュラムの対話式教育コンテンツを引き続き開発中です。 現在、下記の freeCodeCamp.org YouTube チャンネルで、このプロジェクトの完了に必要なすべての知識について説明する動画をいくつか公開しています。
 
-- [「みんなで Python」ビデオコース](https://www.freecodecamp.org/news/python-for-everybody/) (14 時間)
-- [「Python を学ぶ」ビデオコース](https://www.freecodecamp.org/news/learn-python-video-course/) (10 時間)
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">「みんなで Python」ビデオコース</a> (14 時間)
+
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">Python Pandas でデータを分析する方法</a> (10 時間)
 
 # --instructions--
 
@@ -21,11 +22,11 @@ Python カリキュラムの対話式教育コンテンツを引き続き開発
 
 データを使用して、次のタスクを完了してください。
 
-- Pandas を使用して "fcc-forum-pageviews.csv" からデータをインポートします。 インデックスとして "date" 列を設定します。
+- Pandas を使用して "fcc-forum-pageviews.csv" からデータをインポートします。 Set the index to the `date` column.
 - データをクリーニングするため、ページビュー数がデータセットの上位 2.5% または下位 2.5% となった日を除外します。
-- `draw_line_plot` 関数を作成します。この関数は、Matplotlib を使用して "examples/Figure_1.png" に示すような折れ線グラフを描きます。 タイトルは "Daily freeCodeCamp Forum Page Views 5/2016-12/2019" とします。 x 軸のラベルを "Date"、y 軸のラベルを "Page Views" とします。
-- `draw_bar_plot` 関数を作成します。この関数は "examples/Figure_2.png" に示すような棒グラフを描きます。 月ごとの 1 日の平均ページビュー数を表示し、年ごとにグループ化する必要があります。 凡例には月のラベルを表示し、タイトルを "Months" とします。 グラフの x 軸のラベルを "Years"、y 軸のラベルを "Average Page Views" とします。
-- `draw_box_plot` 関数を作成します。この関数は、Seaborn を使用して "examples/Figure_3.png" に示すような 2 つの隣接するボックスプロットを描きます。 これらのボックスプロットでは、特定の年または月の中で値がどのように分布しているかを示し、経時的に比較できるようにする必要があります。 最初のグラフのタイトルを "Year-wise Box Plot (Trend)"、2 つ目のグラフのタイトルを "Month-wise Box Plot (Seasonality)" とします。 一番下の月ラベルの始まりを "Jan" とし、x および x 軸のラベルを正しく設定する必要があります。 ボイラープレートには、データを準備するコマンドが含まれています。
+- `draw_line_plot` 関数を作成します。この関数は、Matplotlib を使用して "examples/Figure_1.png" に示すような折れ線グラフを描きます。 The title should be `Daily freeCodeCamp Forum Page Views 5/2016-12/2019`. The label on the x axis should be `Date` and the label on the y axis should be `Page Views`.
+- `draw_bar_plot` 関数を作成します。この関数は "examples/Figure_2.png" に示すような棒グラフを描きます。 月ごとの 1 日の平均ページビュー数を表示し、年ごとにグループ化する必要があります。 The legend should show month labels and have a title of `Months`. On the chart, the label on the x axis should be `Years` and the label on the y axis should be `Average Page Views`.
+- `draw_box_plot` 関数を作成します。この関数は、Seaborn を使用して "examples/Figure_3.png" に示すような 2 つの隣接するボックスプロットを描きます。 これらのボックスプロットでは、特定の年または月の中で値がどのように分布しているかを示し、経時的に比較できるようにする必要があります。 The title of the first chart should be `Year-wise Box Plot (Trend)` and the title of the second chart should be `Month-wise Box Plot (Seasonality)`. Make sure the month labels on bottom start at `Jan` and the x and y axis are labeled correctly. ボイラープレートには、データを準備するコマンドが含まれています。
 
 グラフごとに、必ずデータフレームのコピーを使用してください。 `test_module.py` の下に単体テストが記述してあります。
 
diff --git a/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md b/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md
index 4757e3aa2bc..30470cc6bc0 100644
--- a/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md
+++ b/curriculum/challenges/japanese/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md
@@ -8,12 +8,13 @@ dashedName: sea-level-predictor
 
 # --description--
 
-このプロジェクトは [Replit スターターコード](https://replit.com/github/freeCodeCamp/boilerplate-sea-level-predictor)を使用して作業を行います。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-sea-level-predictor" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 Python カリキュラムの対話式教育コンテンツを引き続き開発中です。 現在、下記の freeCodeCamp.org YouTube チャンネルで、このプロジェクトの完了に必要なすべての知識について説明する動画をいくつか公開しています。
 
-- [「みんなで Python」ビデオコース](https://www.freecodecamp.org/news/python-for-everybody/) (14 時間)
-- [「Python を学ぶ」ビデオコース](https://www.freecodecamp.org/news/learn-python-video-course/) (10 時間)
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a>(14 hours)
+
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">How to Analyze Data with Python Pandas</a> (10 hours)
 
 # --instructions--
 
@@ -22,10 +23,10 @@ Python カリキュラムの対話式教育コンテンツを引き続き開発
 データを使用して、次のタスクを完了してください。
 
 - Pandas を使用して `epa-sea-level.csv` からデータをインポートします。
-- matplotlib を使用し、x 軸として "Year" 列、y 軸として "CSIRO Adjusted Sea Level" 列を使用する散布図を作成します。
+- Use matplotlib to create a scatter plot using the `Year` column as the x-axis and the `CSIRO Adjusted Sea Level` column as the y-axix.
 - `scipy.stats` の `linregress` 関数を使用して、最も良く当てはまる線の傾きと y 切片を得ます。 散布図の上に最良の当てはめ線 (回帰直線) を描きます。 線を 2050 年まで伸ばし、2050 年の海面上昇を予測します。
 - データセットにある 2000 年から最新年までのデータを使用し、新しい最良の当てはめ線をプロットします。 線を 2050 年まで伸ばし、2000 年以降の上昇率が続くと仮定した場合の 2050 年の海面上昇を予測します。
-- x のラベルを "Year"、y のラベルを "Sea Level (inches)" とし、タイトルを "Rise in Sea Level" とします。
+- The x label should be `Year`, the y label should be `Sea Level (inches)`, and the title should be `Rise in Sea Level`.
 
 `test_module.py` の下に単体テストが記述してあります。
 
@@ -44,7 +45,8 @@ Python カリキュラムの対話式教育コンテンツを引き続き開発
 プロジェクトの URL をコピーし、freeCodeCamp に提出してください。
 
 ## データのソース
-[世界的な海面絶対高の変化](https://datahub.io/core/sea-level-rise)、1880 ～ 2014年、米国環境保護庁提供。CSIRO (2015 年)、NOAA (2015 年) のデータを使用。
+
+<a href="https://datahub.io/core/sea-level-rise" target="_blank" rel="noopener noreferrer nofollow">Global Average Absolute Sea Level Change</a>, 1880-2014 from the US Environmental Protection Agency using data from CSIRO, 2015; NOAA, 2015.
 
 
 # --hints--
diff --git a/curriculum/challenges/japanese/09-information-security/information-security-projects/anonymous-message-board.md b/curriculum/challenges/japanese/09-information-security/information-security-projects/anonymous-message-board.md
index ff91a9e7bff..2b291dfaecf 100644
--- a/curriculum/challenges/japanese/09-information-security/information-security-projects/anonymous-message-board.md
+++ b/curriculum/challenges/japanese/09-information-security/information-security-projects/anonymous-message-board.md
@@ -8,12 +8,12 @@ dashedName: anonymous-message-board
 
 # --description--
 
-<https://anonymous-message-board.freecodecamp.rocks/> と同様の機能を持つフルスタック JavaScript アプリを構築してください。
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://anonymous-message-board.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://anonymous-message-board.freecodecamp.rocks/</a>.
 
 プロジェクトに取り組むにあたり、以下の方法のうち 1 つを用いてコードを記述します。
 
--   [GitHub リポジトリ](https://github.com/freeCodeCamp/boilerplate-project-messageboard/)をクローンし、ローカル環境でプロジェクトを完了させる。
--   [Replit 始動プロジェクト](https://replit.com/github/freeCodeCamp/boilerplate-project-messageboard)を使用して、プロジェクトを完了させる。
+-   Clone <a href="https://github.com/freeCodeCamp/boilerplate-project-messageboard/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete your project locally.
+-   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-messageboard" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 -   使い慣れたサイトビルダーを使用してプロジェクトを完了させる。 必ず GitHub リポジトリのすべてのファイルを取り込む。
 
 完了したら、プロジェクトの動作デモをどこか公開の場にホストしてください。 そして、`Solution Link` フィールドでデモへの URL を送信してください。 必要に応じて、`GitHub Link` フィールドでプロジェクトのソースコードへのリンクを送信してください。
diff --git a/curriculum/challenges/japanese/09-information-security/information-security-projects/port-scanner.md b/curriculum/challenges/japanese/09-information-security/information-security-projects/port-scanner.md
index b06c9697e90..46ae21c2638 100644
--- a/curriculum/challenges/japanese/09-information-security/information-security-projects/port-scanner.md
+++ b/curriculum/challenges/japanese/09-information-security/information-security-projects/port-scanner.md
@@ -9,13 +9,15 @@ dashedName: port-scanner
 
 # --description--
 
-このプロジェクトは [Replit スターターコード](https://replit.com/github/freeCodeCamp/boilerplate-port-scanner)を使用して作業を行います。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-port-scanner" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 Python カリキュラムの対話式教育コンテンツを引き続き開発中です。 現在、下記の freeCodeCamp.org YouTube チャンネルで、このプロジェクトの完了に必要なすべての知識について説明する動画をいくつか公開しています。
 
-- [「みんなで Python」ビデオコース](https://www.freecodecamp.org/news/python-for-everybody/) (14 時間)
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a> (14 hours)
 
-- [「Python を学ぶ」ビデオコース](https://www.freecodecamp.org/news/learn-python-video-course/) (10 時間)
+- <a href="https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/" target="_blank" rel="noopener noreferrer nofollow">Learn Python Basics in Depth</a> (4 hours)
+
+- <a href="https://www.freecodecamp.org/news/intermediate-python-course/" target="_blank" rel="noopener noreferrer nofollow">Intermediate Python Course</a> (6 hours)
 
 # --instructions--
 
diff --git a/curriculum/challenges/japanese/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md b/curriculum/challenges/japanese/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md
index c87e8e3e060..2b7e8604364 100644
--- a/curriculum/challenges/japanese/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md
+++ b/curriculum/challenges/japanese/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md
@@ -8,21 +8,32 @@ dashedName: secure-real-time-multiplayer-game
 
 # --description--
 
-HTML Canvas API と [Socket.io](https://socket.io/) を使用して、<https://secure-real-time-multiplayer-game.freecodecamp.rocks/> と同様の機能を持つ 2D リアルタイムマルチプレイヤーゲームを開発します。 プロジェクトに取り組むにあたり、以下の方法のうち1つを用いてコードを記述します。
+Develop a 2D real time multiplayer game using the HTML Canvas API and Socket.io that is functionally similar to this: <a href="https://secure-real-time-multiplayer-game.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://secure-real-time-multiplayer-game.freecodecamp.rocks/</a>. プロジェクトに取り組むにあたり、以下の方法のうち1つを用いてコードを記述します。
 
--   [GitHub リポジトリ](https://github.com/freeCodeCamp/boilerplate-project-secure-real-time-multiplayer-game/)をクローンし、ローカル環境でプロジェクトを完了させる。
--   [Replit 始動プロジェクト](https://replit.com/github/freeCodeCamp/boilerplate-project-secure-real-time-multiplayer-game)を使用して、プロジェクトを完了させる。
+-   Clone <a href="https://github.com/freeCodeCamp/boilerplate-project-secure-real-time-multiplayer-game/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete your project locally.
+-   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-secure-real-time-multiplayer-game" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 -   使い慣れたサイトビルダーを使用してプロジェクトを完了させる。 必ず GitHub リポジトリのすべてのファイルを取り込む。
 
 完了したら、プロジェクトの動作デモをどこか公開の場にホストしてください。 そして、`Solution Link` フィールドでデモへの URL を送信してください。 必要に応じて、`GitHub Link` フィールドでプロジェクトのソースコードへのリンクを送信してください。
 
 # --instructions--
 
-**メモ**: ユーザーストーリーの実行には `helmet@^3.21.3` が必要です。 このため、ユーザーストーリーを実現するための情報として、Helmet の旧バージョンのドキュメントを参照する必要があります。
+Create a secure multiplayer game in which each player can move their avatar, there is at least one collectible item, and the rank of the players is calculated based on their score.
+
+For details consult the tests below.
+
+Make sure that your game is secure! Include these security measures:
+
+- The client should not be able to guess/sniff the MIME type
+- Prevent XSS attacks
+- Do not cache anything from the website in the client
+- The headers say that the site is powered by `PHP 7.4.3`
+
+**Note**: `helmet@^3.21.3` is needed for the user stories. This means you will need to use the previous version of Helmet's docs, for information on how to achieve the user stories.
 
 # --hints--
 
-サンプルの URL ではなく、自分で作成したプロジェクトを提供することができます。
+You can provide your own project, not the example URL.
 
 ```js
 (getUserInput) => {
@@ -34,91 +45,91 @@ HTML Canvas API と [Socket.io](https://socket.io/) を使用して、<https://s
 };
 ```
 
-複数のプレイヤーがサーバーに接続してプレイすることができます。
+Multiple players can connect to a server and play.
 
 ```js
 
 ```
 
-プレイヤーはそれぞれアバターを持ちます。
+Each player has an avatar.
 
 ```js
 
 ```
 
-各プレイヤーは、`Player.mjs` の `Player` クラスによって作成されるオブジェクトにより表現されます。
+Each player is represented by an object created by the `Player` class in `Player.mjs`.
 
 ```js
 
 ```
 
-各プレーヤーオブジェクトには、最低限として、固有の `id`、`score`、プレーヤーの現在の位置を示す `x` および `y` 座標を含める必要があります。
+At a minimum, each player object should contain a unique `id`, a `score`, and `x` and `y` coordinates representing the player's current position.
 
 ```js
 
 ```
 
-ゲームには少なくとも 1 種類のコレクションアイテムがあります。 それを実装するために、`Collectible.mjs` で `Collectible` クラスを作成してください。
+The game has at least one type of collectible item. Complete the `Collectible` class in `Collectible.mjs` to implement this.
 
 ```js
 
 ```
 
-`Collectible` クラスにより作成された各コレクションアイテムオブジェクトには、最低限として、固有の `id`、`value`、アイテムの現在の位置を示す `x` および `y` 座標を含める必要があります。
+At a minimum, each collectible item object created by the `Collectible` class should contain a unique `id`, a `value`, and `x` and `y` coordinates representing the item's current position.
 
 ```js
 
 ```
 
-プレイヤーは、WASD キーや矢印キーを使用してアバターを動かすことができます。 それを実装するために、`Player.mjs` で `movePlayer` メソッドを作成してください。
+Players can use the WASD and/or arrow keys to move their avatar. Complete the `movePlayer` method in `Player.mjs` to implement this.
 
 ```js
 
 ```
 
-`movePlayer` メソッドは、"up"、"down"、"left"、"right " のいずれかの文字列と、プレーヤーの位置を変更するピクセル量を表す数値の、2 つの引数を受け取る必要があります。 `movePlayer` は、呼び出し元のプレイヤーオブジェクトの `x` 座標と `y` 座標を調整する必要があります。
+The `movePlayer` method should accept two arguments: a string of "up", "down", "left", or "right", and a number for the amount of pixels the player's position should change. `movePlayer` should adjust the `x` and `y` coordinates of the player object it's called from.
 
 ```js
 
 ```
 
-プレーヤーのスコアを使用して、他のプレーヤーとの相対順位を計算する必要があります。 それを実装するために、`Player` で `calculateRank` メソッドを作成してください。
+The player's score should be used to calculate their rank among the other players. Complete the `calculateRank` method in the `Player` class to implement this.
 
 ```js
 
 ```
 
-`calculateRank` メソッドは、すべての接続中のプレイヤーを表すオブジェクトの配列を受け取り、文字列 `Rank: currentRanking/totalPlayers` を返す必要があります。 たとえば、プレイヤーが 2 人のゲームで、プレイヤー A のスコアが 3、プレイヤー B のスコアが 5 の場合、プレイヤー A の `calculateRank` は `Rank: 2/2` を返す必要があります。
+The `calculateRank` method should accept an array of objects representing all connected players and return the string `Rank: currentRanking/totalPlayers`. For example, in a game with two players, if Player A has a score of 3 and Player B has a score of 5, `calculateRank` for Player A should return `Rank: 2/2`.
 
 ```js
 
 ```
 
-プレイヤーはコレクションアイテムにぶつかって接触することができます。 それを実装するために、`Player.mjs` で `collision` メソッドを作成してください。
+Players can collide with a collectible item. Complete the `collision` method in `Player.mjs` to implement this.
 
 ```js
 
 ```
 
-`collision` メソッドは、コレクションアイテムのオブジェクトを引数として受け取る必要があります。 プレイヤーのアバターがアイテムに接触した場合、`collision` メソッドは `true` を返す必要があります。
+The `collision` method should accept a collectible item's object as an argument. If the player's avatar intersects with the item, the `collision` method should return `true`.
 
 ```js
 
 ```
 
-すべてのプレイヤーは同期が保たれます。
+All players are kept in sync.
 
 ```js
 
 ```
 
-プレイヤーはいつでもゲームから離れることができます。
+Players can disconnect from the game at any time.
 
 ```js
 
 ```
 
-クライアントによる MIME タイプの推測や参照の試行を防いでください。
+Prevent the client from trying to guess / sniff the MIME type.
 
 ```js
 async (getUserInput) => {
@@ -128,7 +139,7 @@ async (getUserInput) => {
 };
 ```
 
-クロスサイトスクリプティング (XSS) 攻撃を防いでください。
+Prevent cross-site scripting (XSS) attacks.
 
 ```js
 async (getUserInput) => {
@@ -138,7 +149,7 @@ async (getUserInput) => {
 };
 ```
 
-ウェブサイトからクライアントにキャッシュされるものは何もありません。
+Nothing from the website is cached in the client.
 
 ```js
 async (getUserInput) => {
@@ -154,7 +165,7 @@ async (getUserInput) => {
 };
 ```
 
-ヘッダーには、サイトで "PHP 7.4.3" が使用されていることを記述します。ただし実際には使用されていません (セキュリティ対策が目的です)。
+The headers say that the site is powered by "PHP 7.4.3" even though it isn't (as a security measure).
 
 ```js
 async (getUserInput) => {
diff --git a/curriculum/challenges/japanese/09-information-security/information-security-projects/sha-1-password-cracker.md b/curriculum/challenges/japanese/09-information-security/information-security-projects/sha-1-password-cracker.md
index 4aa68189a2e..86f922e6ef6 100644
--- a/curriculum/challenges/japanese/09-information-security/information-security-projects/sha-1-password-cracker.md
+++ b/curriculum/challenges/japanese/09-information-security/information-security-projects/sha-1-password-cracker.md
@@ -9,13 +9,15 @@ dashedName: sha-1-password-cracker
 
 # --description--
 
-このプロジェクトは [Replit スターターコード](https://replit.com/github/freeCodeCamp/boilerplate-SHA-1-password-cracker)を使用して作業を行います。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-SHA-1-password-cracker" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
 Python カリキュラムの対話式教育コンテンツを引き続き開発中です。 現在、下記の freeCodeCamp.org YouTube チャンネルで、このプロジェクトの完了に必要なすべての知識について説明する動画をいくつか公開しています。
 
-- [「みんなで Python」ビデオコース](https://www.freecodecamp.org/news/python-for-everybody/) (14 時間)
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a> (14 hours)
 
-- [「Python を学ぶ」ビデオコース](https://www.freecodecamp.org/news/learn-python-video-course/) (10 時間)
+- <a href="https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/" target="_blank" rel="noopener noreferrer nofollow">Learn Python Basics in Depth</a> (4 hours)
+
+- <a href="https://www.freecodecamp.org/news/intermediate-python-course/" target="_blank" rel="noopener noreferrer nofollow">Intermediate Python Course</a> (6 hours)
 
 # --instructions--
 
@@ -41,7 +43,7 @@ Python カリキュラムの対話式教育コンテンツを引き続き開発
 - `da5a4e8cf89539e66097acd2f8af128acae2f8ae` は "q1w2e3r4t5" を返す
 - `ea3f62d498e3b98557f9f9cd0d905028b3b019e1` は "bubbles1" を返す
 
-`hashlib` ライブラリをあらかじめインポートしてあります。 コードでこのライブラリを使用してみてください。 hashlib の詳細については[こちら](https://docs.python.org/3/library/hashlib.html)を参照してください。
+`hashlib` ライブラリをあらかじめインポートしてあります。 You should consider using it in your code. <a href="https://docs.python.org/3/library/hashlib.html" target="_blank" rel="noopener noreferrer nofollow">Learn more about "hashlib" here</a>.
 
 ## 開発
 
diff --git a/curriculum/challenges/japanese/09-information-security/information-security-projects/stock-price-checker.md b/curriculum/challenges/japanese/09-information-security/information-security-projects/stock-price-checker.md
index b52b75d8ba0..37231f2a820 100644
--- a/curriculum/challenges/japanese/09-information-security/information-security-projects/stock-price-checker.md
+++ b/curriculum/challenges/japanese/09-information-security/information-security-projects/stock-price-checker.md
@@ -8,14 +8,14 @@ dashedName: stock-price-checker
 
 # --description--
 
-<https://stock-price-checker.freecodecamp.rocks/> と同様の機能を持つフルスタック JavaScript アプリを構築してください。
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://stock-price-checker.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://stock-price-checker.freecodecamp.rocks/</a>.
 
-信頼できる株価 API の利用にはすべて API キーが必要になるため、ここでは回避策を用意しました。 <https://stock-price-checker-proxy.freecodecamp.rocks/> を使用すれば、登録して自分のキーを取得しなくても最新の株価情報を得ることができます。
+信頼できる株価 API の利用にはすべて API キーが必要になるため、ここでは回避策を用意しました。 Use <a href="https://stock-price-checker-proxy.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://stock-price-checker-proxy.freecodecamp.rocks/</a> to get up-to-date stock price information without needing to sign up for your own key.
 
 プロジェクトに取り組むにあたり、以下の方法のうち 1 つを用いてコードを記述します。
 
--   [ GitHub リポジトリ](https://github.com/freeCodeCamp/boilerplate-project-stockchecker/)をクローンし、ローカル環境でプロジェクトを完了させる。
--   [Replit 始動プロジェクト](https://replit.com/github/freeCodeCamp/boilerplate-project-stockchecker)を使用して、プロジェクトを完了させる。
+-   Clone <a href="https://github.com/freeCodeCamp/boilerplate-project-stockchecker/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete your project locally.
+-   Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-stockchecker" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete your project.
 -   使い慣れたサイトビルダーを使用してプロジェクトを完了させる。 必ず GitHub リポジトリのすべてのファイルを取り込む。
 
 完了したら、プロジェクトの動作デモをどこか公開の場にホストしてください。 そして、`Solution Link` フィールドでデモへの URL を送信してください。 必要に応じて、`GitHub Link` フィールドでプロジェクトのソースコードへのリンクを送信してください。
diff --git a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md
index 0b8e61b4441..07b198e04ca 100644
--- a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md
+++ b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md
@@ -8,7 +8,7 @@ dashedName: ask-browsers-to-access-your-site-via-https-only-with-helmet-hsts
 
 # --description--
 
-注意点として、このプロジェクトは [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec) にある次のスタータープロジェクトをベースに構築されているか、または [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) からクローンされています。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 HTTP Strict Transport Security (HSTS) は、プロトコルのダウングレード攻撃や Cookie のハイジャックからウェブサイトを保護するのに役立つウェブセキュリティポリシーです。 自分のウェブサイトが HTTPS 経由でのアクセスに対応している場合、ユーザーのブラウザーに対して、安全でない HTTP の使用を避けるよう求めることができます。 Strict-Transport-Security ヘッダーを設定することで、ブラウザーに対して、指定された期間、以降のリクエストで HTTPS を使用するよう指示します。 このポリシーは、最初のリクエスト後に発生するリクエストに対して有効になります。
 
diff --git a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md
index dadb75fb901..f9ed88f251e 100644
--- a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md
+++ b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md
@@ -8,7 +8,7 @@ dashedName: avoid-inferring-the-response-mime-type-with-helmet-nosniff
 
 # --description--
 
-注意点として、このプロジェクトは [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec) にある次のスタータープロジェクトをベースに構築されているか、または [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) からクローンされています。 ブラウザーでコンテンツまたは MIME スニッフィングを使用すると、レスポンスの `Content-Type` ヘッダーを上書きし、暗黙のコンテンツタイプを使用してデータを推測し、処理することが可能になります。 これは便利な場合もありますが、危険な攻撃につながる可能性もあります。 このミドルウェアは、X-Content-Type-Options ヘッダーを `nosniff` に設定することで、提供された `Content-Type` を回避しないようにブラウザーに指示します。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>. ブラウザーでコンテンツまたは MIME スニッフィングを使用すると、レスポンスの `Content-Type` ヘッダーを上書きし、暗黙のコンテンツタイプを使用してデータを推測し、処理することが可能になります。 これは便利な場合もありますが、危険な攻撃につながる可能性もあります。 このミドルウェアは、X-Content-Type-Options ヘッダーを `nosniff` に設定することで、提供された `Content-Type` を回避しないようにブラウザーに指示します。
 
 # --instructions--
 
diff --git a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md
index 870d8e58874..348667575e9 100644
--- a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md
+++ b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md
@@ -8,7 +8,7 @@ dashedName: configure-helmet-using-the-parent-helmet-middleware
 
 # --description--
 
-注意点として、このプロジェクトは [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec) にある次のスタータープロジェクトをベースに構築されているか、または [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) からクローンされています。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `app.use(helmet())` では、前に紹介したすべてのミドルウェアが自動的にインクルードされますが、`noCache()` と `contentSecurityPolicy()` は除外されます。しかし、必要に応じてこれらを有効にすることができます。 config オブジェクトを使用して、他のミドルウェアを個別に無効化または構成することもできます。
 
diff --git a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md
index 1bd412eaf07..ba60c5204e4 100644
--- a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md
+++ b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md
@@ -8,7 +8,7 @@ dashedName: disable-client-side-caching-with-helmet-nocache
 
 # --description--
 
-注意点として、このプロジェクトは [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec) にある次のスタータープロジェクトをベースに構築されているか、または [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) からクローンされています。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 ウェブサイトのアップデートを行う際に、ユーザーに常に新しいバージョンをダウンロードしてもらいたい場合、クライアントのブラウザーでキャッシュの無効化を行う (または試みる) ことができます。 これは開発の場合にも役立ちます。 キャッシュにはパフォーマンス上の利点がありますが、それを失うことになるため、このオプションは本当に必要な場合にのみ使用してください。
 
diff --git a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md
index e8c2bdce325..a4077738743 100644
--- a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md
+++ b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md
@@ -8,7 +8,7 @@ dashedName: disable-dns-prefetching-with-helmet-dnsprefetchcontrol
 
 # --description--
 
-注意点として、このプロジェクトは [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec) にある次のスタータープロジェクトをベースに構築されているか、または [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) からクローンされています。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 ほとんどのブラウザーでは、パフォーマンスを向上させるために、ページ内のリンクの DNS レコードを先読み (プリフェッチ) します。 これにより、ユーザーがリンクをクリックしたときには、すでに目的の IP がわかっている状態になります。 その結果、DNS サービスの過度の使用 (何百万人もの人が訪れる大規模なウェブサイトの運営を想像してみてください…)、プライバシーの問題 (特定のページを閲覧しているユーザーを盗聴者が推測できる可能性がある)、ページ統計の改ざん (リンク先が訪問されていなくても訪問されているように表示される) などが発生する可能性があります。 高度なセキュリティを必要とする場合は、パフォーマンスの低下を犠牲にして、DNS プリフェッチを無効にすることができます。
 
diff --git a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md
index 71242b65ddd..1584de45f39 100644
--- a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md
+++ b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md
@@ -8,7 +8,7 @@ dashedName: hash-and-compare-passwords-asynchronously
 
 # --description--
 
-注意点として、このプロジェクトは [Replit](https://replit.com/github/freeCodeCamp/boilerplate-bcrypt) にある次のスタータープロジェクトをベースに構築されているか、または [GitHub](https://github.com/freeCodeCamp/boilerplate-bcrypt/) からクローンされています。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-bcrypt" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-bcrypt/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 ハッシュは計算量が多くなるように設計されているので、ハッシュ処理中に接続がブロックされないように、サーバー上で非同期的に処理することをお勧めします。 次の呼び出しを実行するだけで、パスワードを非同期にハッシュ化できます。
 
diff --git a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md
index 7a595b65593..5f156e274eb 100644
--- a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md
+++ b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md
@@ -8,7 +8,7 @@ dashedName: hash-and-compare-passwords-synchronously
 
 # --description--
 
-注意点として、このプロジェクトは [Replit](https://replit.com/github/freeCodeCamp/boilerplate-bcrypt) にある次のスタータープロジェクトをベースに構築されているか、または [GitHub](https://github.com/freeCodeCamp/boilerplate-bcrypt/) からクローンされています。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-bcrypt" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-bcrypt/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 同期的にハッシュ化することも同様に簡単ですが、サーバーサイドで高いコストをかけて使用する場合や、頻繁にハッシュ化を行う場合には遅延が発生する可能性があります。 次の呼び出しだけで、このメソッドによるハッシュ化を実行できます。
 
diff --git a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md
index 655d83db80c..6ebc2698c81 100644
--- a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md
+++ b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md
@@ -8,7 +8,7 @@ dashedName: hide-potentially-dangerous-information-using-helmet-hidepoweredby
 
 # --description--
 
-注意点として、このプロジェクトは [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec) にある次のスタータープロジェクトをベースに構築されているか、または [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) からクローンされています。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 サイトで Express を使用していることがハッカーに知られた場合、ハッカーは Express や Node の既知の脆弱性を悪用する可能性があります。 デフォルトでは、Express からリクエストが発生するたびに `X-Powered-By: Express` が送信されます。 `helmet.hidePoweredBy()` ミドルウェアを使用して X-Powered-By ヘッダーを削除してください。
 
diff --git a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md
index d42c1ac254a..8ccca1f6722 100644
--- a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md
+++ b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md
@@ -10,8 +10,8 @@ dashedName: install-and-require-helmet
 
 これらのチャレンジに取り組むにあたり、以下の方法のうち 1 つを用いてコードを記述します。
 
-- [GitHub リポジトリ](https://github.com/freeCodeCamp/boilerplate-infosec/)をクローンし、ローカル環境でプロジェクトを完了させる。
-- [Replit 始動プロジェクト](https://replit.com/github/freeCodeCamp/boilerplate-infosec)を使用して、チャレンジを完了させる。
+- Clone <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">this GitHub repo</a> and complete these challenges locally.
+- Use <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">our Replit starter project</a> to complete these challenges.
 - 使い慣れたサイトビルダーを使用してプロジェクトを完了させる。 必ず GitHub リポジトリのすべてのファイルを取り込む。
 
 完了したら、プロジェクトの動作デモをどこか公開の場にホストしてください。 そして、`Solution Link` フィールドでデモへの URL を送信してください。
@@ -22,7 +22,7 @@ Helmet を使用すると、さまざまな HTTP ヘッダーを設定するこ
 
 これらのレッスンで使用するコードはすべて、`myApp.js`ファイルの中で、最初に示したコードの行の間に記載されています。 追加したコードを変更したり削除したりしないでください。
 
-Helmet のバージョン `3.21.3` をインストールし、require してください。 `npm install --save-exact package@version` を使用するか、`package.json` に直接追加することで、特定のバージョンのパッケージをインストールできます。
+Helmet version `3.21.3` has already been installed, so require it as `helmet` in `myApp.js`.
 
 # --hints--
 
diff --git a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md
index c7fbdb89075..3eee1f5a357 100644
--- a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md
+++ b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md
@@ -8,7 +8,7 @@ dashedName: mitigate-the-risk-of-clickjacking-with-helmet-frameguard
 
 # --description--
 
-注意点として、このプロジェクトは [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec) にある次のスタータープロジェクトをベースに構築されているか、または [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) からクローンされています。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 あなたのページは、あなたの同意なしに `<frame>` や `<iframe>` に挿入される可能性があります。 こうした可能性は、特にクリックジャック攻撃につながるおそれがあります。 クリックジャック攻撃とは、ユーザーをだまして、ユーザーが意図しているものとは違うページとやり取りさせる手法です。 これを利用し、iframe を通じて悪意のあるコンテキストでページを実行することが可能です。 こうした状況では、ハッカーによってあなたのページ上に隠れたレイヤーが配置されます。 悪意のあるスクリプトを実行するために、隠しボタンが使用されることがあります。 このミドルウェアは、X-Frame-Options ヘッダーを設定して、 サイトをフレーム内に配置できるユーザーを制限します。 DENY、SAMEORIGIN、ALLOW-FROM の 3 つのモードがあります。
 
diff --git a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md
index 38c97b6f9cb..2ad159a3581 100644
--- a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md
+++ b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md
@@ -9,7 +9,7 @@ dashedName: mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet-xs
 
 # --description--
 
-注意点として、このプロジェクトは [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec) にある次のスタータープロジェクトをベースに構築されているか、または [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) からクローンされています。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 クロスサイトスクリプティング (XSS) はよくある攻撃の一種で、セッションの cookie やパスワードなどの機密データを盗む目的で、悪意のあるスクリプトを脆弱なページに挿入するものです。
 
diff --git a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md
index 9798498d036..d380e323b16 100644
--- a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md
+++ b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md
@@ -8,7 +8,7 @@ dashedName: prevent-ie-from-opening-untrusted-html-with-helmet-ienoopen
 
 # --description--
 
-注意点として、このプロジェクトは [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec) にある次のスタータープロジェクトをベースに構築されているか、または [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) からクローンされています。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 一部のウェブアプリケーションでは、信頼されていない HTML をダウンロード用に提供しています。 Internet Explorer の一部のバージョンではデフォルトで、あなたのサイトのコンテキストで、こうした HTML ファイルを開きます。 つまり、あなたのページのコンテキストで、信頼されていない HTML ページが悪意のある動作を始める可能性があります。 このミドルウェアは、X-Download-Options ヘッダーを設定して、そうしたファイルを開かないようにします。 これにより、IE ユーザーは信頼されたサイトのコンテキストでダウンロードを実行できなくなります。
 
diff --git a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md
index cc5d628af31..fc668dcd58c 100644
--- a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md
+++ b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md
@@ -8,7 +8,7 @@ dashedName: set-a-content-security-policy-with-helmet-contentsecuritypolicy
 
 # --description--
 
-注意点として、このプロジェクトは [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec) にある次のスタータープロジェクトをベースに構築されているか、または [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/) からクローンされています。
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 このチャレンジでは、最新のブラウザーでさまざまなタイプの攻撃のリスクや影響を大幅に軽減することができる、新しい有望な防御方法を紹介します。 コンテンツセキュリティポリシー (CSP) を設定および構成すると、意図しないものがページに挿入されるのを防ぐことができます。 これにより、XSS の脆弱性、望ましくないトラッキング、悪意のあるフレームなどのさまざまな攻撃からアプリが保護されます。 CSP を機能させるには、信頼できるコンテンツソースの許可リストを定義します。 これらは、ウェブページが必要とするリソースの種類ごと (スクリプト、スタイルシート、フォント、フレーム、メディアなど) に構成できます。 複数のディレクティブを利用できるため、ウェブサイトの所有者はきめ細かい制御が可能です。 詳細については、HTML 5 Rocks、KeyCDN を参照してください。 残念ながら、CSP は古いブラウザではサポートされていません。
 
diff --git a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md
index e5d25384a0e..ee53c188947 100644
--- a/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md
+++ b/curriculum/challenges/japanese/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md
@@ -8,17 +8,17 @@ dashedName: understand-bcrypt-hashes
 
 # --description--
 
-以降のチャレンジについては、以前のチャレンジとは異なる新しいスタータープロジェクトで作業します。 新しいスタータープロジェクトは [Replit](https://replit.com/github/freeCodeCamp/boilerplate-bcrypt) にあります。または [GitHub](https://github.com/freeCodeCamp/boilerplate-bcrypt/) からクローンできます。
+以降のチャレンジについては、以前のチャレンジとは異なる新しいスタータープロジェクトで作業します。 You can find the new starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-bcrypt" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or clone it from <a href="https://github.com/freeCodeCamp/boilerplate-bcrypt/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 BCrypt ハッシュは非常に安全です。 ハッシュは、基本的には元のデータのフィンガープリントであり、常に一意です。 元のデータをアルゴリズムに入力し、固定長の結果を返すことで実現しています。 このプロセスをさらに複雑にして安全性を高めるため、ハッシュをソルト (*salt*) することもできます。 ハッシュをソルトするには、ハッシュ処理の前にランダムなデータを元のデータに追加する必要があります。これにより、ハッシュの解読がさらに困難になります。
 
-BCrypt のハッシュは、常に `$2a$13$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm` のような構造になります。 データの先頭の小さなビット `$2a` は、どのようなハッシュアルゴリズムが使用されたかを定義しています。 次の部分 `$13` は*コスト*を定義しています。 コストとは、ハッシュの計算に必要となる処理能力のことです。 コストは 2 の累乗の対数スケールで示され、データが何回ハッシュアルゴリズムを通過するかを決定します。 たとえば、コストが 10 の場合は平均的なコンピュータで 1 秒間に 10 個のパスワードをハッシュ化できますが、コストが 15 の場合は 1 回のハッシュ化に 3 秒かかり、さらにコストが 31 の場合は 1 回のハッシュ化の完了に数日かかることになります。 現時点では、コスト 12 が非常に安全だと考えられています。 ハッシュの最後の部分 `$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm` は、数字、ピリオド、文字からなる 1 つの大きな文字列のように見えますが、実際には 2 つの別々の情報です。 最初の 22 文字はプレーンテキストのソルトで、残りはハッシュ化されたパスワードです。
+BCrypt hashes will always look like `$2a$13$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm` which does have a structure. データの先頭の小さなビット `$2a` は、どのようなハッシュアルゴリズムが使用されたかを定義しています。 次の部分 `$13` は*コスト*を定義しています。 コストとは、ハッシュの計算に必要となる処理能力のことです。 コストは 2 の累乗の対数スケールで示され、データが何回ハッシュアルゴリズムを通過するかを決定します。 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 take multiple days to complete a hash. 現時点では、コスト 12 が非常に安全だと考えられています。 ハッシュの最後の部分 `$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm` は、数字、ピリオド、文字からなる 1 つの大きな文字列のように見えますが、実際には 2 つの別々の情報です。 最初の 22 文字はプレーンテキストのソルトで、残りはハッシュ化されたパスワードです。
 
 # --instructions--
 
-BCrypt の使用を始めるため、BCrypt を依存関係としてプロジェクトに追加し、サーバーで 'bcrypt' として require してください。
+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`ファイルの中に、これらのレッスンで使用するすべてのコードを最初に示したコードの間に追加してください。 追加したコードを変更したり削除したりしないでください。
+BCrypt has already been added as a dependency, so require it as `bcrypt` in your server.
 
 正しいと思ったら、ページを送信してください。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md b/curriculum/challenges/japanese/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md
index 9e57a878232..c0056f9c6f3 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md
@@ -1,7 +1,7 @@
 ---
 id: a3f503de51cf954ede28891d
 title: 対称差を見つける
-challengeType: 5
+challengeType: 1
 forumTopicId: 301611
 dashedName: find-the-symmetric-difference
 ---
@@ -54,7 +54,7 @@ assert.sameMembers(sym([1, 2, 3], [5, 2, 1, 4, 5]), [3, 4, 5]);
 assert.equal(sym([1, 2, 3], [5, 2, 1, 4, 5]).length, 3);
 ```
 
-`sym([1, 2, 5], [2, 3, 5], [3, 4, 5])` は `[1, 4, 5]` を返す必要があります。
+`sym([1, 2, 5], [2, 3, 5], [3, 4, 5])` should return `[1, 4, 5]`.
 
 ```js
 assert.sameMembers(sym([1, 2, 5], [2, 3, 5], [3, 4, 5]), [1, 4, 5]);
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md
index 32864f7a55a..4b09757d0b0 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md
@@ -22,7 +22,7 @@ dashedName: add-a-new-element-to-a-binary-search-tree
 
 # --instructions--
 
-シンプルなもので始めましょう。 ここでは、木のノードを作成する関数に加えて、二分探索木構造のスケルトンを定義してあります。 各ノードの左右に値があることを確認してください (ない場合もあります)。 それらには子部分木が割り当てられます (それらが存在する場合)。 ここで、この二分探索木に新しい値を追加するメソッドを作成してください。 そのメソッドは `add` と呼ばれ、木に追加する整数値を受け入れる必要があります。 二分探索木の不変条件を必ず守ってください。つまり、左側のそれぞれの子の値は親値以下、右側のそれぞれ子の値は親値以上でなければなりません。 ここでは、ツリーが重複値を保持できないようにしましょう。 既に存在する値を追加しようとした場合、メソッドから `null` が返される必要があります。 それ以外の場合、追加が成功したら `undefined` が返される必要があります。
+シンプルなもので始めましょう。 ここでは、木のノードを作成する関数に加えて、二分探索木構造のスケルトンを定義してあります。 各ノードの左右に値があることを確認してください (ない場合もあります)。 それらには子部分木が割り当てられます (それらが存在する場合)。 In our binary search tree, you will create a method to add new values to the tree. そのメソッドは `add` と呼ばれ、木に追加する整数値を受け入れる必要があります。 二分探索木の不変条件を必ず守ってください。つまり、左側のそれぞれの子の値は親値以下、右側のそれぞれ子の値は親値以上でなければなりません。 ここでは、ツリーが重複値を保持できないようにしましょう。 既に存在する値を追加しようとした場合、メソッドから `null` が返される必要があります。 それ以外の場合、追加が成功したら `undefined` が返される必要があります。
 
 **ヒント:** 木は本質的に再帰的なデータ構造です！
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md
index 80e2eb237e3..006973c948d 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md
@@ -14,13 +14,13 @@ dashedName: create-a-doubly-linked-list
 
 # --instructions--
 
-`Node` オブジェクトが既に用意され、`DoublyLinkedList` が開始しています。 二重リンクリストに、`add`、`remove` と呼ばれる 2 つのメソッドを追加しましょう。 `add` メソッドは与えられた要素をリストに追加する必要があります。`remove` メソッドは、リスト内で、与えられた要素のすべての出現を削除する必要があります。
+`Node` オブジェクトが用意され、`DoublyLinkedList` の最初の部分が書いてあります。 二重リンクリストに、`add`、`remove` と呼ばれる 2 つのメソッドを追加しましょう。 `add` メソッドは与えられた要素をリストに追加する必要があります。`remove` メソッドは、与えられた要素をリストからすべて削除する必要があります。
 
 これらのメソッドを記述する際は、先頭または末尾の要素の削除など、起こり得るエッジケースを慎重に処理してください。 また、空のリスト上で要素を削除すると、`null` が返される必要があります。
 
 # --hints--
 
-DoublyLinkedList データ構造が存在する必要があります。
+The `DoublyLinkedList` data structure should exist.
 
 ```js
 assert(
@@ -34,7 +34,7 @@ assert(
 );
 ```
 
-DoublyLinkedList に add というメソッドが必要です。
+The `DoublyLinkedList` should have a method called `add`.
 
 ```js
 assert(
@@ -51,7 +51,7 @@ assert(
 );
 ```
 
-DoublyLinkedList に remove というメソッドが必要です。
+The `DoublyLinkedList` should have a method called `remove`.
 
 ```js
 assert(
@@ -68,7 +68,7 @@ assert(
 );
 ```
 
-また、空のリストから要素を削除すると、null が返される必要があります。
+Removing an item from an empty list should return `null`.
 
 ```js
 assert(
@@ -82,7 +82,7 @@ assert(
 );
 ```
 
-add メソッドはリストに要素を追加する必要があります。
+The `add` method should add items to the list.
 
 ```js
 assert(
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/create-a-hash-table.md b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/create-a-hash-table.md
index 5f7ed148568..9d3fb5f33f6 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/create-a-hash-table.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/create-a-hash-table.md
@@ -24,7 +24,7 @@ dashedName: create-a-hash-table
 
 # --hints--
 
-HashTable データ構造が存在する必要があります。
+The `HashTable` data structure should exist.
 
 ```js
 assert(
@@ -38,7 +38,7 @@ assert(
 );
 ```
 
-HashTable に add メソッドが必要です。
+The `HashTable` should have an `add` method.
 
 ```js
 assert(
@@ -52,7 +52,7 @@ assert(
 );
 ```
 
-HashTable に lookup メソッドが必要です。
+The `HashTable` should have a `lookup` method.
 
 ```js
 assert(
@@ -66,7 +66,7 @@ assert(
 );
 ```
 
-HashTable に remove メソッドが必要です。
+The `HashTable` should have a `remove` method.
 
 ```js
 assert(
@@ -80,7 +80,7 @@ assert(
 );
 ```
 
-add メソッドはキーと値のペアを追加し、lookup メソッドは与えられたキーに関連付けられた値を返す必要があります。
+The `add` method should add key value pairs and the `lookup` method should return the values associated with a given key.
 
 ```js
 assert(
@@ -95,7 +95,7 @@ assert(
 );
 ```
 
-remove メソッドはキーを入力として受け入れ、関連付けられたキーと値のペアを削除する必要があります。
+The `remove` method should accept a key as input and should remove the associated key value pair.
 
 ```js
 assert(
@@ -113,7 +113,7 @@ assert(
 );
 ```
 
-remove メソッドは、キーと値の正しいペアのみを削除する必要があります。
+The `remove` method should only remove the correct key value pair.
 
 ```js
 assert(
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/create-a-map-data-structure.md b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/create-a-map-data-structure.md
index 3c782ed14bb..7d00f92ab1b 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/create-a-map-data-structure.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/create-a-map-data-structure.md
@@ -26,7 +26,7 @@ dashedName: create-a-map-data-structure
 
 # --hints--
 
-Map データ構造が存在する必要があります。
+The `Map` data structure should exist.
 
 ```js
 assert(
@@ -40,7 +40,7 @@ assert(
 );
 ```
 
-Map オブジェクトには add、remove、get、has、value、clear、size の各メソッドが必要です 。
+The `Map` object should have the following methods: `add`, `remove`, `get`, `has`, `values`, `clear`, and `size`.
 
 ```js
 assert(
@@ -62,7 +62,7 @@ assert(
 );
 ```
 
-add メソッドはマップに要素を追加する必要があります。
+The `add` method should add items to the map.
 
 ```js
 assert(
@@ -79,7 +79,7 @@ assert(
 );
 ```
 
-has メソッドは、追加された要素に対して true を、存在しない要素に対して false を返す必要があります。
+The `has` method should return `true` for added items and `false` for absent items.
 
 ```js
 assert(
@@ -94,7 +94,7 @@ assert(
 );
 ```
 
-get メソッドはキーを入力として受け入れ、関連付けられた値を返す必要があります。
+The `get` method should accept keys as input and should return the associated values.
 
 ```js
 assert(
@@ -109,7 +109,7 @@ assert(
 );
 ```
 
-values メソッドは、マップに格納されているすべての値を、文字列の配列として返す必要があります。
+The `values` method should return all the values stored in the map as strings in an array.
 
 ```js
 assert(
@@ -131,7 +131,7 @@ assert(
 );
 ```
 
-clear メソッドはマップを空にし、size メソッドはマップに存在する要素の数を返す必要があります。
+The `clear` method should empty the map and the `size` method should return the number of items present in the map.
 
 ```js
 assert(
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md
index 3e5567aa0b3..0dbdffcd98a 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md
@@ -12,11 +12,11 @@ dashedName: create-a-trie-search-tree
 
 # --instructions--
 
-単語を格納するためのトライを作成しましょう。 そのトライは、`add` メソッドで単語を受け入れ、それらをトライデータ構造に格納します。 また、与えられた文字列が単語かどうかを問い合わせるために `isWord` メソッドを使ったり、トライに格納されたすべての単語を取得するために `print` メソッドを使ったりできます。 `isWord` はブール値を返し、print はこれらすべての単語の配列を文字列値として返す必要があります。 このデータ構造が正しく実装されていることを確認するために、木の各ノードに `Node` 構造が用意されています。 各ノードは、JavaScript Map オブジェクトである `keys` プロパティを持つオブジェクトです。 これには、各ノードの有効なキーである個々の文字が格納されます。 また、各ノードには `end` プロパティが既に作成されており、ノードが単語の終了を表す場合にこのプロパティを `true` に設定することができます。
+単語を格納するためのトライを作成しましょう。 そのトライは、`add` メソッドで単語を受け入れ、それらをトライデータ構造に格納します。 また、与えられた文字列が単語かどうかを問い合わせるために `isWord` メソッドを使ったり、トライに格納されたすべての単語を取得するために `print` メソッドを使ったりできます。 `isWord` should return a boolean value and `print` should return an array of all these words as string values. このデータ構造が正しく実装されていることを確認するために、木の各ノードに `Node` 構造が用意されています。 各ノードは、JavaScript Map オブジェクトである `keys` プロパティを持つオブジェクトです。 これには、各ノードの有効なキーである個々の文字が格納されます。 また、各ノードには `end` プロパティが既に作成されており、ノードが単語の終了を表す場合にこのプロパティを `true` に設定することができます。
 
 # --hints--
 
-Trie に add メソッドが必要です。
+The `Trie` should have an `add` method.
 
 ```js
 assert(
@@ -32,7 +32,7 @@ assert(
 );
 ```
 
-Trie に print メソッドが必要です。
+The `Trie` should have a `print` method.
 
 ```js
 assert(
@@ -48,7 +48,7 @@ assert(
 );
 ```
 
-Trie に isWord メソッドが必要です。
+The `Trie` should have an `isWord` method.
 
 ```js
 assert(
@@ -64,7 +64,7 @@ assert(
 );
 ```
 
-print メソッドは、トライに追加されたすべての値を文字列の配列として返す必要があります。
+The `print` method should return all items added to the trie as strings in an array.
 
 ```js
 assert(
@@ -93,7 +93,7 @@ assert(
 );
 ```
 
-isWord メソッドは、トライに追加された単語に対してのみ true を返し、他のすべての単語に対して false を返す必要があります。
+The `isWord` method should return `true` only for words added to the trie and `false` for all other words.
 
 ```js
 assert(
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md
index 12b487c70be..62e87b2d0ef 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md
@@ -8,7 +8,15 @@ dashedName: create-an-es6-javascript-map
 
 # --description--
 
-JavaScript の新バージョンでは、前回のチャレンジで手書きした機能の多くを提供する、組み込みの Map ブジェクトが提供されています。 この Map オブジェクトは通常の JavaScript オブジェクトと似ていますが、通常のオブジェクトにはない便利な機能を提供します。 例えば ES6 Map は、それに追加された要素の挿入順序を追跡します。 より網羅的なメソッドの概要を次に示します。`.has(key)` はキーの有無に基づいて true または false を返します。`.get(key)` はキーに関連付けられた値を返します。`.set(key, value)` は新しいキーと値のペアを設定します。`.delete(key)` はキーと値のペアを削除します。`.clear()` はすべてのキーと値のペアを削除します。`.entries()` は挿入順にすべてのキーの配列を返します。`.values()` は挿入順にすべての値の配列を返します。
+JavaScript の新バージョンでは、前回のチャレンジで手書きした機能の多くを提供する、組み込みの Map ブジェクトが提供されています。 この Map オブジェクトは通常の JavaScript オブジェクトと似ていますが、通常のオブジェクトにはない便利な機能を提供します。 例えば ES6 Map は、それに追加された要素の挿入順序を追跡します。 Here is a more complete overview of its methods:
+
+- `.has(key)` returns true or false based on the presence of a key
+- `.get(key)` returns the value associated with a key
+- `.set(key, value)` sets a new key, value pair
+- `.delete(key)` removes a key, value pair
+- `.clear()` removes all key, value pairs
+- `.entries()` returns an array of all the keys in insertion order
+- `.values()` returns an array of all the values in insertion order
 
 # --instructions--
 
@@ -16,13 +24,13 @@ JavaScript Map オブジェクトを定義し、変数 myMap をそのオブジ
 
 # --hints--
 
-myMap オブジェクトが存在する必要があります。
+The `myMap` object should exist.
 
 ```js
 assert(typeof myMap === 'object');
 ```
 
-myMap にはキーと値のペア `freeCodeCamp`、`Awesome!` が含まれている必要があります。
+`myMap` should contain the key value pair `freeCodeCamp`, `Awesome!`.
 
 ```js
 assert(myMap.get('freeCodeCamp') === 'Awesome!');
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md
index 899f73edb2c..6414b34da42 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md
@@ -18,7 +18,7 @@ dashedName: implement-heap-sort-with-a-min-heap
 
 # --hints--
 
-MinHeap データ構造が存在する必要があります。
+The `MinHeap` data structure should exist.
 
 ```js
 assert(
@@ -32,7 +32,7 @@ assert(
 );
 ```
 
-MinHeap に insert というメソッドが必要です。
+`MinHeap` should have a method called `insert`.
 
 ```js
 assert(
@@ -48,7 +48,7 @@ assert(
 );
 ```
 
-MinHeap に remove というメソッドが必要です。
+`MinHeap` should have a method called `remove`.
 
 ```js
 assert(
@@ -64,7 +64,7 @@ assert(
 );
 ```
 
-MinHeap に sort というメソッドが必要です。
+`MinHeap` should have a method called `sort`.
 
 ```js
 assert(
@@ -80,7 +80,7 @@ assert(
 );
 ```
 
-sort メソッドは、最小ヒープに追加されたすべての要素がソート順に格納されている配列を返す必要があります。
+The `sort` method should return an array containing all items added to the min heap in sorted order.
 
 ```js
 assert(
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/incidence-matrix.md b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/incidence-matrix.md
index 11d776fe927..cf9126e525a 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/incidence-matrix.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/incidence-matrix.md
@@ -18,7 +18,7 @@ dashedName: incidence-matrix
 
 <blockquote>    1<br>   ---<br>1 | 1<br>2 | 0<br>3 | 1</blockquote>
 
-4 本のエッジと 4 つのノードを持つ`接続行列`の例を示します。 列はエッジ、行はノード自体であることを思い出してください。
+Here is an example of an incidence matrix with 4 edges and 4 nodes. 列はエッジ、行はノード自体であることを思い出してください。
 
 <blockquote>    1 2 3 4<br>   --------<br>1 | 0 1 1 1<br>2 | 1 1 0 0<br>3 | 1 0 0 1<br>4 | 0 0 1 0</blockquote>
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
index 34e3a383e53..0e9100c2072 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
@@ -48,7 +48,7 @@ dashedName: insert-an-element-into-a-max-heap
 
 # --hints--
 
-MaxHeap データ構造が存在する必要があります。
+The `MaxHeap` data structure should exist.
 
 ```js
 assert(
@@ -62,7 +62,7 @@ assert(
 );
 ```
 
-MaxHeap に insert というメソッドが必要です。
+`MaxHeap` should have a method called `insert`.
 
 ```js
 assert(
@@ -78,7 +78,7 @@ assert(
 );
 ```
 
-MaxHeap に print というメソッドが必要です。
+`MaxHeap` should have a method called `print`.
 
 ```js
 assert(
@@ -94,7 +94,7 @@ assert(
 );
 ```
 
-insert メソッドは最大ヒーププロパティに従って要素を追加する必要があります。
+The `insert` method should add elements according to the max heap property.
 
 ```js
 assert(
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md
index c400a0b028c..32cbe2653fd 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md
@@ -8,7 +8,7 @@ dashedName: perform-a-subset-check-on-two-sets-of-data
 
 # --description--
 
-この課題では、2 つのデータセットに対してサブセット (部分集合) テ ストを実行します。 `isSubsetOf` と呼ばれるメソッドを `Set` データ構造に作成します。 これは最初のセットを 2 番目のセットと比較し、最初のセットがすべて 2 番目のセットに含まれている場合に `true` を返します。
+この課題では、2 つのデータセットに対してサブセット (部分集合) テストを実行します。 `isSubsetOf` と呼ばれるメソッドを `Set` データ構造に作成します。 これは最初のセットを 2 番目のセットと比較し、最初のセットがすべて 2 番目のセットに含まれている場合に `true` を返します。
 
 例えば、`setA = ['a','b']` かつ `setB = ['a','b','c','d']` の場合、 `setA` は `setB` のサブセットなので、`setA.isSubsetOf(setB)` は `true` を返す必要があります。
 
@@ -25,7 +25,7 @@ assert(
 );
 ```
 
-最初の Set() が 2 番目の Set に含まれている必要があります。
+The first `Set` should be contained in the second `Set`.
 
 ```js
 assert(
@@ -43,7 +43,7 @@ assert(
 );
 ```
 
-`['a', 'b'].isSubsetOf(['a', 'b', 'c', 'd'])` は `true` を返す必要があります。
+`['a', 'b'].isSubsetOf(['a', 'b', 'c', 'd'])` should return `true`.
 
 ```js
 assert(
@@ -62,7 +62,7 @@ assert(
 );
 ```
 
-`['a', 'b', 'c'].isSubsetOf(['a', 'b'])` は `false` を返す必要があります。
+`['a', 'b', 'c'].isSubsetOf(['a', 'b'])` should return `false`.
 
 ```js
 assert(
@@ -80,7 +80,7 @@ assert(
 );
 ```
 
-`[].isSubsetOf([])` は `true` を返す必要があります。
+`[].isSubsetOf([])` should return `true`.
 
 ```js
 assert(
@@ -93,7 +93,7 @@ assert(
 );
 ```
 
-`['a', 'b'].isSubsetOf(['c', 'd'])` は `false` を返す必要があります。
+`['a', 'b'].isSubsetOf(['c', 'd'])` should return `false`.
 
 ```js
 assert(
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md
index 064ee8ec938..edd5c660795 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md
@@ -25,7 +25,7 @@ assert(
 );
 ```
 
-値 ["a", "b", "c"] を含む Set と値 ["c", "d"] を含む Set の和集合は、値 ["a", "b", "c", "d"] を含む新しい Set を返す必要があります。
+The union of a `Set` containing values `["a", "b", "c"]` and a `Set` containing values `["c", "d"]` should return a new `Set` containing values `["a", "b", "c", "d"]`.
 
 ```js
 assert(
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
index c1f235284bd..0dd072e980a 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
@@ -22,7 +22,7 @@ dashedName: remove-an-element-from-a-max-heap
 
 # --hints--
 
-MaxHeap データ構造が存在する必要があります。
+The `MaxHeap` data structure should exist.
 
 ```js
 assert(
@@ -36,7 +36,7 @@ assert(
 );
 ```
 
-MaxHeap に print というメソッドが必要です。
+`MaxHeap` should have a method called `print`.
 
 ```js
 assert(
@@ -52,7 +52,7 @@ assert(
 );
 ```
 
-MaxHeap に insert というメソッドが必要です。
+`MaxHeap` should have a method called `insert`.
 
 ```js
 assert(
@@ -68,7 +68,7 @@ assert(
 );
 ```
 
-MaxHeap に remove というメソッドが必要です。
+`MaxHeap` should have a method called `remove`.
 
 ```js
 assert(
@@ -84,7 +84,7 @@ assert(
 );
 ```
 
-remove メソッドは max heap プロパティを維持しながら最大ヒープから最大要素を削除する必要があります。
+The `remove` method should remove the greatest element from the max heap while maintaining the max heap property.
 
 ```js
 assert(
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
index 66b2a376eca..b085220bf4d 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
@@ -12,7 +12,7 @@ dashedName: reverse-a-doubly-linked-list
 
 # --hints--
 
-DoublyLinkedList データ構造が存在する必要があります。
+The `DoublyLinkedList` data structure should exist.
 
 ```js
 assert(
@@ -26,7 +26,7 @@ assert(
 );
 ```
 
-DoublyLinkedList に reverse というメソッドが必要です。
+The `DoublyLinkedList` should have a method called `reverse`.
 
 ```js
 assert(
@@ -43,7 +43,7 @@ assert(
 );
 ```
 
-空のリストを逆順にすると、null が返される必要があります。
+Reversing an empty list should return `null`.
 
 ```js
 assert(
@@ -57,7 +57,7 @@ assert(
 );
 ```
 
-reverse メソッドはリストを逆順にする必要があります。
+The `reverse` method should reverse the list.
 
 ```js
 assert(
@@ -77,7 +77,7 @@ assert(
 );
 ```
 
-リストが逆順になったとき、次の参照と前の参照が正しく維持される必要があります。
+The `next` and `previous` references should be correctly maintained when a list is reversed.
 
 ```js
 assert(
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/search-within-a-linked-list.md b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/search-within-a-linked-list.md
index a2d4f14dd87..a0f07b0d965 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/search-within-a-linked-list.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/data-structures/search-within-a-linked-list.md
@@ -16,7 +16,7 @@ dashedName: search-within-a-linked-list
 
 # --instructions--
 
-リンクリストが空かどうかを調べる `isEmpty` メソッド、与えられた要素の `index` を返す `indexOf` メソッド、および、与えられた `index` にある `element` を返す `elementAt` メソッドを記述してください。
+Write an `isEmpty` method that checks if the linked list is empty, an `indexOf` method that returns the `index` of a given element, and an `elementAt` that returns an `element` at a given `index`.
 
 # --hints--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
index f858fc38566..b4dc49b5230 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
@@ -60,32 +60,46 @@ primeSummation(2000000);
 # --solutions--
 
 ```js
-const NUM_PRIMES = 2000000;
-const PRIME_SEIVE = Array(Math.floor((NUM_PRIMES-1)/2)).fill(true);
-(function initPrimes(num) {
-  const upper = Math.floor((num - 1) / 2);
-  const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
-  for (let i = 0; i <= sqrtUpper; i++) {
-    if (PRIME_SEIVE[i]) {
-      // Mark value in PRIMES array
-      const prime = 2 * i + 3;
-      // Mark all multiples of this number as false (not prime)
-      const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
-      for (let j = primeSqaredIndex; j < upper; j += prime) {
-        PRIME_SEIVE[j] = false;
+class PrimeSeive {
+  constructor(num) {
+    const seive = Array(Math.floor((num - 1) / 2)).fill(true);
+    const upper = Math.floor((num - 1) / 2);
+    const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+
+    for (let i = 0; i <= sqrtUpper; i++) {
+      if (seive[i]) {
+        // Mark value in seive array
+        const prime = 2 * i + 3;
+        // Mark all multiples of this number as false (not prime)
+        const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+        for (let j = primeSqaredIndex; j < upper; j += prime) {
+          seive[j] = false;
+        }
       }
     }
+
+    this._seive = seive;
   }
-})(NUM_PRIMES);
 
-function isOddNumberPrime(num) {
-  return PRIME_SEIVE[(num - 3) / 2];
-}
+  isPrime(num) {
+    return num === 2
+      ? true
+      : num % 2 === 0
+        ? false
+        : this.isOddPrime(num);
+  }
+
+  isOddPrime(num) {
+    return this._seive[(num - 3) / 2];
+  }
+};
+
+function primeSummation(num) {
+  const primeSeive = new PrimeSeive(num);
 
-function primeSummation(n) {
   let sum = 2;
-  for (let i = 3; i < n; i += 2) {
-    if (isOddNumberPrime(i)) sum += i;
+  for (let i = 3; i < num; i += 2) {
+    if (primeSeive.isOddPrime(i)) sum += i;
   }
   return sum;
 }
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-107-minimal-network.md b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
index a59f63eec59..6a6357a2677 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d91000cf542c50feea
 title: '問題 107: 最小ネットワーク'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301731
 dashedName: problem-107-minimal-network
 ---
@@ -27,7 +27,7 @@ dashedName: problem-107-minimal-network
 
 しかし、ネットワーク上のすべての頂点がつながっている状態を保ちながら一部の辺を取り除くことにより、このネットワークを最適化することができます。 最大限の節約を実現するネットワークを下に示します。 このネットワークの重みは 93 で、元のネットワークからの節約量は 243 - 93 = 150 となります。
 
-<img class="img-responsive center-block" alt="7 頂点と残された 6 辺 (AB, BD, CA, DE, DF, EG) で構成されるネットワーク" src="https://cdn.freecodecamp.org/curriculum/project-euler/minimal-network-2.png" style="background-color: white; padding: 10px;" />
+<img class="img-responsive center-block" alt="Network with 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;" />
 
 ネットワークを行列形式で表す二次元配列 `network` を使用して、ネットワークの連結を保ちながら余分な辺を取り除くことで実現できる最大節約量を求めなさい。 連結されていない頂点は `-1` で表されます。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
index 5395ecfdebc..7b1bff7fa2b 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ec1000cf542c50feff
 title: '問題 128: 六角形タイルの差'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301755
 dashedName: problem-128-hexagonal-tile-differences
 ---
@@ -28,10 +28,16 @@ $PD(n) = 3$ が成り立つすべてのタイルを昇順に並べて数列を
 
 # --hints--
 
-`hexagonalTile()` は `14516824220` を返す必要があります。
+`hexagonalTile(10)` should return `271`.
 
 ```js
-assert.strictEqual(hexagonalTile(), 14516824220);
+assert.strictEqual(hexagonalTile(10), 271);
+```
+
+`hexagonalTile(2000)` should return `14516824220`.
+
+```js
+assert.strictEqual(hexagonalTile(2000), 14516824220);
 ```
 
 # --seed--
@@ -39,16 +45,62 @@ assert.strictEqual(hexagonalTile(), 14516824220);
 ## --seed-contents--
 
 ```js
-function hexagonalTile() {
+function hexagonalTile(tileIndex) {
 
   return true;
 }
 
-hexagonalTile();
+hexagonalTile(10);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+const NUM_PRIMES = 840000;
+const PRIME_SEIVE = Array(Math.floor((NUM_PRIMES-1)/2)).fill(true);
+(function initPrimes(num) {
+  const upper = Math.floor((num - 1) / 2);
+  const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+  for (let i = 0; i <= sqrtUpper; i++) {
+    if (PRIME_SEIVE[i]) {
+      // Mark value in PRIMES array
+      const prime = 2 * i + 3;
+      // Mark all multiples of this number as false (not prime)
+      const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+      for (let j = primeSqaredIndex; j < upper; j += prime) {
+        PRIME_SEIVE[j] = false;
+      }
+    }
+  }
+})(NUM_PRIMES);
+
+function isPrime(num) {
+  if (num === 2) return true;
+  else if (num % 2 === 0) return false
+  else return PRIME_SEIVE[(num - 3) / 2];
+}
+
+function hexagonalTile(tileIndex) {
+  let count = 1;
+  let n = 1;
+  let number = 0;
+
+  while (count < tileIndex) {
+    if (isPrime(6*n - 1) &&
+        isPrime(6*n + 1) &&
+        isPrime(12*n + 5)) {
+      number = 3*n*n - 3*n + 2;
+      count++;
+      if (count >= tileIndex) break;
+    }
+    if (isPrime(6*n + 5) &&
+        isPrime(6*n - 1) &&
+        isPrime(12*n - 7) && n != 1) {
+      number = 3*n*n + 3*n + 1;
+      count++;
+    }
+    n++;
+  }
+  return number;
+}
 ```
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-168-number-rotations.md b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-168-number-rotations.md
index 7117d133f29..4390480ae7b 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-168-number-rotations.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-168-number-rotations.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4151000cf542c50ff27
 title: '問題 168: 数の循環'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301802
 dashedName: problem-168-number-rotations
 ---
@@ -14,14 +14,20 @@ $714285 = 5 × 142857$ であることを確認できます。
 
 これは、右に循環させた数の約数であるという、142857 が持つ珍しい性質を示しています。
 
-$10 &lt; n &lt; 10100$ のとき、この性質を持つ整数 $n$ の総和の下位 5 桁を求めなさい。
+For integer number of digits $a$ and $b$, find the last 5 digits of the sum of all integers $n$, $10^a &lt; n &lt; 10^b$, that have this property.
 
 # --hints--
 
-`numberRotations()` は `59206` を返す必要があります。
+`numberRotations(2, 10)` should return `98311`.
 
 ```js
-assert.strictEqual(numberRotations(), 59206);
+assert.strictEqual(numberRotations(2, 10), 98311);
+```
+
+`numberRotations(2, 100)` should return `59206`.
+
+```js
+assert.strictEqual(numberRotations(2, 100), 59206);
 ```
 
 # --seed--
@@ -29,9 +35,9 @@ assert.strictEqual(numberRotations(), 59206);
 ## --seed-contents--
 
 ```js
-function numberRotations() {
+function numberRotations(a, b) {
 
-  return true;
+  return 0;
 }
 
 numberRotations();
@@ -40,5 +46,37 @@ numberRotations();
 # --solutions--
 
 ```js
-// solution required
+function numberRotations(minDigits, maxDigits) {
+  const DIGITS_TO_KEEP = 100000n;
+  const powersOfTen = Array(maxDigits).fill(0);
+  powersOfTen[0] = 1n;
+  for (let i = 1; i < maxDigits; i++) {
+    powersOfTen[i] = powersOfTen[i - 1] * 10n;
+  }
+
+  // We want numbers of the form xd * m = dx
+  // Or more precisely:
+  //   (x * 10 + d) * m = d*10^(n-1) + x
+  // Solving for x:
+  //   x = d (10^(n-1) - m) / (10 * m - 1)
+  let total = 0n;
+  for (let numDigits = minDigits; numDigits <= maxDigits; numDigits++) {
+    // Check all multiplier - digit pairs to see if a candidate can be built
+    //  with the correct number of digits
+    for (let multiplier = 1n; multiplier < 10n; multiplier++) {
+      for (let lastDigit = 1n; lastDigit < 10n; lastDigit++) {
+        const numerator   = lastDigit * (powersOfTen[numDigits - 1] - multiplier);
+        const denominator = (powersOfTen[1] * multiplier - 1n);
+        if (numerator % denominator === 0n) {
+          const candidate = (numerator / denominator) * 10n + lastDigit;
+          if (candidate.toString().length === numDigits) {
+            total = (total + candidate) % DIGITS_TO_KEEP;
+          }
+        }
+      }
+    }
+  }
+
+  return parseInt(total);
+}
 ```
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md
index 270794e6223..70959c7a194 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4241000cf542c50ff37
 title: '問題 184: 原点を内包する三角形'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301820
 dashedName: problem-184-triangles-containing-the-origin
 ---
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md
index 48c88643789..3cb4b537077 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f36e1000cf542c50fe81
 title: '問題 2: 偶数のフィボナッチ数'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301838
 dashedName: problem-2-even-fibonacci-numbers
 ---
@@ -22,7 +22,7 @@ dashedName: problem-2-even-fibonacci-numbers
 assert(typeof fiboEvenSum(10) === 'number');
 ```
 
-この関数は `even` 値を返す必要があります。
+Your function should return an even value.
 
 ```js
 assert.equal(fiboEvenSum(10) % 2 === 0, true);
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-250-250250.md b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-250-250250.md
index 76855faf135..06a2687d81a 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-250-250250.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-250-250250.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4661000cf542c50ff78
 title: '問題 250: 250250'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301898
 dashedName: problem-250-250250
 ---
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
index 75c66c2b7ee..ea8c15f321c 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f46e1000cf542c50ff80
 title: '問題 257: 角の二等分線'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301905
 dashedName: problem-257-angular-bisectors
 ---
 
 # --description--
 
-整数の辺長を持つ三角形 $ABC$ が与えられ、辺は $a ≤ b ≤ c$ です ($AB = c$, $BC = a$, $AC = b$)。
+Given is an integer sided triangle $ABC$ with sides $a ≤ b ≤ c$ ($AB = c$, $BC = a$ and $AC = b$).
 
 三角形の角の二等分線は、点 $E$, $F$, $G$ で辺と交わります (下図参照)。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
index cc62d803f4b..7c17f908993 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
@@ -1,29 +1,27 @@
 ---
 id: 5900f4b01000cf542c50ffc2
 title: '問題 323: 乱数整数のビット論理和演算'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301980
 dashedName: problem-323-bitwise-or-operations-on-random-integers
 ---
 
 # --description--
 
-$y_0, y_1, y_2, \ldots$ を、符号なしの 32 ビット整数の数列とします
+Let $y_0, y_1, y_2, \ldots$ be a sequence of random unsigned 32 bit integers (i.e. $0 ≤ y_i &lt; 2^{32}$, every value equally likely).
 
-(つまり、$0 ≤ y_i &lt; 2^{32}$ であり、すべての値が等しく現れ得ます)。
-
-数列 $x_i$ について、次の反復が与えられます。
+For the sequence $x_i$ the following recursion is given:
 
 - $x_0 = 0$ かつ
 - $x_i = x_{i - 1} \mathbf{|} y_{i - 1}$ ($i > 0$) ($\mathbf{|}$ はビット論理和演算子)
 
-すべての $i ≥ N$ について、$x_i = 2^{32} - 1$ (すべてが 1 であるビットパターン) となるような添え字 $N$ が最終的に存在することが分かります。
+It can be seen that eventually there will be an index $N$ such that $x_i = 2^{32} - 1$ (a bit-pattern of all ones) for all $i ≥ N$.
 
-$N$ の期待値を求めなさい。 回答は、四捨五入して小数第 10 位まで示すこと。
+Find the expected value of $N$. Give your answer rounded to 10 digits after the decimal point.
 
 # --hints--
 
-`bitwiseOrOnRandomIntegers()` は `6.3551758451` を返す必要があります。
+`bitwiseOrOnRandomIntegers()` should return `6.3551758451`.
 
 ```js
 assert.strictEqual(bitwiseOrOnRandomIntegers(), 6.3551758451);
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md
index a67f1280bcd..70ce0d9e95f 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f4b21000cf542c50ffc5
 title: '問題 326: 剰余の総和 (Modulo Summation)'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301983
 dashedName: problem-326-modulo-summations
 ---
 
 # --description--
 
-$a_1 = 1$, $\displaystyle a_n = \left(\sum_{k = 1}^{n - 1} k \times a_k\right)\bmod n$ によって再帰的に定義される数列を $a_n$ とします。
+Let $a_n$ be a sequence recursively defined by: $a_1 = 1$, $\displaystyle a_n = \left(\sum_{k = 1}^{n - 1} k \times a_k\right)\bmod n$.
 
 したがって、$a_n$ の最初の 10 項は 1, 1, 0, 3, 0, 3, 5, 4, 1, 9 です。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
index 9be6dd072f1..3cb5c0257ee 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4c51000cf542c50ffd7
 title: '問題 344: 銀貨ゲーム'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302003
 dashedName: problem-344-silver-dollar-game
 ---
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
index 042910ccef6..09ce2d7d0a4 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f4d01000cf542c50ffe3
 title: '問題 356: 三次多項式の最大根'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302016
 dashedName: problem-356-largest-roots-of-cubic-polynomials
 ---
 
 # --description--
 
-$a_n$ を、多項式 $g(x) = x^3 - 2^n \times x^2 + n$ の最大の実根とします。
+Let $a_n$ be the largest real root of a polynomial $g(x) = x^3 - 2^n \times x^2 + n$.
 
 例: $a_2 = 3.86619826\ldots$
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-371-licence-plates.md b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-371-licence-plates.md
index 3979cf01174..676aeb999b3 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-371-licence-plates.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-371-licence-plates.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4e01000cf542c50fff2
 title: '問題 371: ナンバープレート'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302033
 dashedName: problem-371-licence-plates
 ---
@@ -14,7 +14,7 @@ dashedName: problem-371-licence-plates
 
 移動中に見た 2 枚のナンバープレートの数字の合計が 1000 になったら勝ちです。
 
-例: `MIC-012` と `HAN-988` の組み合わせは勝ちで、`RYU-500` と `SET-500` でも勝ちになります (1 回の移動中に見たものであれば)。
+例: `MIC-012` and `HAN-988` is a win and `RYU-500` and `SET-500` too (as long as he sees them in the same trip).
 
 勝つために見る必要のあるナンバープレートの枚数の期待値を求めなさい。 回答は、四捨五入して小数第 8 位まで示すこと。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
index d4c04c5d6bc..a901b996464 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f50b1000cf542c51001d
 title: '問題 414: カプレカ定数'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302083
 dashedName: problem-414-kaprekar-constant
 ---
@@ -23,7 +23,7 @@ $$\begin{align}   & 8730 - 0378 = 8352 \\\\
 
 基数や桁数が異なる数に対するカプレカ操作を考えることができます。 残念ながら、すべてのケースに必ずカプレカ定数があるわけではありません。一部の入力値が最終的に循環に入るか、または入力値ごとに定数が異なるかのいずれかが起こります。 しかし、5 桁かつ基数が $b = 6t + 3 ≠ 9$ の場合にカプレカ定数が存在することが分かっています。
 
-例えば、 基数が 15 のとき: ${(10, 4, 14, 9, 5)}\_{15}$、基数が 21 のとき: $(14, 6, 20, 13, 7)_{21}$ です。
+例えば、 base 15: ${(10, 4, 14, 9, 5)}\_{15}$ base 21: $(14, 6, 20, 13, 7)\_{21}$
 
 5 桁かつ基数が $b$ の場合のカプレカ定数を $C_b$ と定義します。 また、関数 $sb(i)$ を次のように定義します。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md
index 40ea595de5c..099e6caaba8 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5231000cf542c510034
 title: '問題 438: 多項式の解の整数部'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302109
 dashedName: problem-438-integer-part-of-polynomial-equations-solutions
 ---
@@ -19,7 +19,7 @@ $n = 4$ のとき、両方の条件を満たす $n$ 個の整数の組は 12 個
 
 $t$ 内の整数の絶対値の和を $S(t)$ とします。
 
-$n = 4$ のとき、両方の条件を満たす $n$ 個の整数の組 $t$ のすべてについて $\sum S(t) = 2087$ となることを確認できます。
+For $n = 4$ we can verify that $\sum S(t) = 2087$ for all $n$-tuples $t$ which satisfy both conditions.
 
 $n = 7$ のとき、$\sum S(t)$ を求めなさい。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
index 1d1e64d0edb..8fa6f7248c0 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f52e1000cf542c510041
 title: '問題 450: 内サイクロイドと格子点'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302123
 dashedName: problem-450-hypocycloid-and-lattice-points
 ---
@@ -24,9 +24,10 @@ $C(R, r)$ に含まれる点の $x$ 座標と $y$ 座標の絶対値の総和を
 
 次が与えられます。
 
-$$\begin{align} C(3, 1) = & \\{(3, 0), (-1, 2), (-1,0), (-1,-2)\\} \\\\ C(2500, 1000) = & \\{(2500, 0), (772, 2376), (772, -2376), (516, 1792), (516, -1792), (500, 0), (68, 504), \\\\ &(68, -504),(-1356, 1088), (-1356, -1088), (-1500, 1000), (-1500, -1000)\\} \end{align}$$
+$$\begin{align}   C(3, 1) = & \\{(3, 0), (-1, 2), (-1,0), (-1,-2)\\} \\\\
+  C(2500, 1000) = & \\{(2500, 0), (772, 2376), (772, -2376), (516, 1792), (516, -1792), (500, 0), (68, 504), \\\\ &(68, -504),(-1356, 1088), (-1356, -1088), (-1500, 1000), (-1500, -1000)\\} \end{align}$$
 
-** 注:** (-625, 0) は $C(2500, 1000)$ の要素ではありません。なぜなら、$t$ の相当値で $\sin(t)$ が有理数とならないからです。
+**Note:** (-625, 0) is not an element of $C(2500, 1000)$ because $\sin(t)$ is not a rational number for the corresponding values of $t$.
 
 $S(3, 1) = (|3| + |0|) + (|-1| + |2|) + (|-1| + |0|) + (|-1| + |-2|) = 10$
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md
index ff847fa8a57..6692b2bf1e9 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5461000cf542c510058
 title: '問題 473: フィジタル進数'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302150
 dashedName: problem-473-phigital-number-base
 ---
@@ -22,7 +22,7 @@ $2 = \varphi + \varphi^{-2}$, $3 = \varphi^{2} + \varphi^{-2}$
 
 $\varphi$ の累乗の和を表すために、0 と 1 からなり、負の指数の開始点が小数点で示されている文字列を使用します。 この表記法を「フィジタル進数」と呼ぶことにします。
 
-したがって、$1 = 1_{\varphi}$, $2 = 10.01_{\varphi}$, $3 = 100.01_{\varphi}$, $14 = 100100.001001_{\varphi}$ となります。 フィジタル進数の 1, 2, 14 を表す文字列は回文数で、3 を表す文字列は回文数ではありません (フィジタル進数の小数点が中央の文字ではありません)。
+したがって、$1 = 1_{\varphi}$, $2 = 10.01_{\varphi}$, $3 = 100.01_{\varphi}$, $14 = 100100.001001_{\varphi}$ となります。 The strings representing 1, 2 and 14 in the phigital number base are palindromic, while the string representing 3 is not (the phigital point is not the middle character).
 
 フィジタル進数で表すと回文数になる 1000 以下の正の整数の和は 4345 です。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md
index 41a21965fd2..b8fa9312b95 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ac1000cf542c50febf
 title: '問題 64: 奇数の周期を持つ平方根'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302176
 dashedName: problem-64-odd-period-square-roots
 ---
@@ -12,7 +12,7 @@ dashedName: problem-64-odd-period-square-roots
 
 $\\displaystyle \\quad \\quad \\sqrt{N}=a_0+\\frac 1 {a_1+\\frac 1 {a_2+ \\frac 1 {a3+ \\dots}}}$
 
-例えば、$\\sqrt{23}:$ を考えてみます。
+For example, let us consider $\\sqrt{23}$:
 
 $\\quad \\quad \\sqrt{23}=4+\\sqrt{23}-4=4+\\frac 1 {\\frac 1 {\\sqrt{23}-4}}=4+\\frac 1 {1+\\frac{\\sqrt{23}-3}7}$
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md
index 3ea0336a42f..6011272b49e 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3761000cf542c50fe88
 title: '問題 9: 特殊なピタゴラスの三つ組数'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302205
 dashedName: problem-9-special-pythagorean-triplet
 ---
@@ -30,7 +30,7 @@ assert(typeof specialPythagoreanTriplet(24) === 'number');
 assert.strictEqual(specialPythagoreanTriplet(24), 480);
 ```
 
-`specialPythagoreanTriplet(120)` は 49920, 55080, 60000 のいずれかを返す必要があります。
+`specialPythagoreanTriplet(120)` should return 49920, 55080 or 60000.
 
 ```js
 assert([49920, 55080, 60000].includes(specialPythagoreanTriplet(120)));
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/24-game.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/24-game.md
index 58760ce94b0..37826769391 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/24-game.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/24-game.md
@@ -1,14 +1,14 @@
 ---
 id: 5951e88f64ebf159166a1176
 title: 24 game
-challengeType: 5
+challengeType: 1
 forumTopicId: 302218
 dashedName: 24-game
 ---
 
 # --description--
 
-[24 Game](https://en.wikipedia.org/wiki/24_Game) では、人の暗算能力をテストします。
+The 24 Game tests a person's mental arithmetic.
 
 ゲームの目的は、算出結果が24になるように4つの数字を配置することです。
 
@@ -39,28 +39,28 @@ dashedName: 24-game
 assert(typeof solve24 === 'function');
 ```
 
-`solve24("4878")` は `(7-8/8)*4` または `4*(7-8/8)` を返します。
+`solve24("4878")` should return `(7-8/8)*4`, `4*(7-8/8)`, or a similar valid string
 
 ```js
-assert(include(answers[0], removeParentheses(solve24(testCases[0]))));
+assert(isValidSolution_(solve24(testCases_[0])));
 ```
 
-`solve24("1234")` は任意の配列で `1*2*3*4` を返します。
+`solve24("1234")` should return `1*2*3*4` or a similar valid string
 
 ```js
-assert(include(answers[1], removeParentheses(solve24(testCases[1]))));
+assert(isValidSolution_(solve24(testCases_[1])));
 ```
 
-`solve24("6789")` は `(6*8)/(9-7)` または `(8*6)/(9-7)` を返します。
+`solve24("6789")` should return `(6*8)/(9-7)`, `(8*6)/(9-7)`, or a similar valid string
 
 ```js
-assert(include(answers[2], removeParentheses(solve24(testCases[2]))));
+assert(isValidSolution_(solve24(testCases_[2])));
 ```
 
-`solve24("1127")` は `(1+7)*(1+2)` の順列を返します。
+`solve24("1127")` should return `(1+7)*(1+2)` or a similar valid string
 
 ```js
-assert(include(answers[3], removeParentheses(solve24(testCases[3]))));
+assert(isValidSolution_(solve24(testCases_[3])));
 ```
 
 # --seed--
@@ -68,56 +68,101 @@ assert(include(answers[3], removeParentheses(solve24(testCases[3]))));
 ## --after-user-code--
 
 ```js
-const testCases = [
+const testCases_ = [
   '4878',
   '1234',
   '6789',
   '1127'
 ];
 
-const answers = [
-  ['(7-8/8)*4', '4*(7-8/8)', '(4-8+7)*8', '(4+7-8)*8', '(7+4-8)*8', '(7-8+4)*8', '8*(4-8+7)', '8*(4+7-8)', '8*(7+4-8)', '8*(7-8+4)'],
-  ['1*2*3*4', '1*2*4*3', '1*3*2*4', '1*3*4*2', '1*4*2*3', '1*4*3*2', '2*1*3*4', '2*1*4*3', '2*3*1*4', '2*3*4*1', '2*4*3*1', '2*4*1*3', '3*1*2*4', '3*1*4*2', '3*2*1*4', '3*2*4*1', '3*4*1*2', '3*4*2*1', '4*1*2*3', '4*1*3*2', '4*2*1*3', '4*2*3*1', '4*3*1*2', '4*3*2*1', '(1+2+3)*4', '(1+3+2)*4', '(2+1+3)*4', '(2+3+1)*4', '(3+1+2)*4', '(3+2+1)*4', '4*(1+2+3)', '4*(2+1+3)', '4*(2+3+1)', '4*(3+1+2)', '4*(3+2+1)'],
-  ['(6*8)/(9-7)', '(8*6)/(9-7)', '6*8/(9-7)', '8*6/(9-7)'],
-  ['(1+7)*(2+1)', '(1+7)*(1+2)', '(1+2)*(1+7)', '(1+2)*(7+1)', '(2+1)*(1+7)', '(7+1)*(2+1)']
-];
-
-function include(ansArr, res) {
-  const index = ansArr.indexOf(res);
-  return index >= 0;
+const OPERATORS_ = {
+  "+": (a, b) => a + b,
+  "-": (a, b) => a - b,
+  "*": (a, b) => a * b,
+  "/": (a, b) => a / b,
 }
 
-//The main method for detecting single parentheses
-function removeParentheses(ans) {
-  for (let i = 0; i < ans.length; i++) {
-    if (!isNaN(ans[i])) {
-      ans = removeParenthesesHelper(ans, i);
+const PRECIDENCE_ = {
+  "+": 1,
+  "-": 1,
+  "*": 2,
+  "/": 2,
+}
+
+function evaluate_(expression) {
+  expression = expression.replace('/\s+/g', '');
+  const stack = [];
+  let postfix = "";
+
+  // Convert from infix to postfix
+  let head = 0;
+  while (head < expression.length) {
+    let c = expression[head];
+    switch (c) {
+      case "(":
+        stack.push(c);
+        break;
+      case ")":
+        let last = stack.pop();
+        while (last !== "(") {
+          postfix += last;
+          last = stack.pop();
+        }
+        break;
+      case "+":
+      case "-":
+      case "*":
+      case "/":
+        while (stack.length &&
+               PRECIDENCE_[c] <= PRECIDENCE_[stack[stack.length-1]]) {
+          postfix += stack.pop();
+        }
+        stack.push(c);
+        break;
+      case "0":
+      case "1":
+      case "2":
+      case "3":
+      case "4":
+      case "5":
+      case "6":
+      case "7":
+      case "8":
+      case "9":
+        postfix += c;
+        break;
+      default:
+        return false;
+    }
+    head++;
+  }
+
+  // Clear out stack
+  while (stack.length) {
+    postfix += stack.pop();
+  }
+
+  // Evaluate postfix
+  for (let c of postfix) {
+    switch (c) {
+      case "+":
+      case "-":
+      case "*":
+      case "/":
+        const b = +stack.pop();
+        const a = +stack.pop();
+        stack.push(OPERATORS_[c](a, b));
+        break;
+      default:
+        stack.push(c);
     }
   }
-  return ans;
+  return stack.pop();
 }
 
-//Helper to remove left and right parantheses
-function removeParenthesesHelper(ans, i) {
-  while (i > 0 && i < ans.length - 1) {
-    if (ans[i - 1] === '(' && ans[i + 1] === ')') {
-      //Paranthesis detected. Remove them.
-      ans = replaceChar(ans, '', i - 1);
-      ans = replaceChar(ans, '', i);
-      i--;
-    } else {
-      return ans;
-    }
-  }
-  return ans;
-}
-
-//Replace a character at a given index for the provided character
-function replaceChar(origString, replaceChar, index) {
-  let firstPart = origString.substr(0, index);
-  let lastPart = origString.substr(index + 1);
-  let newString = firstPart + replaceChar + lastPart;
-  return newString;
+// Check solution validity
+function isValidSolution_(userSolution) {
+  return evaluate_(userSolution) === 24;
 }
 ```
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md
index a7b9c9d2108..aea781a25b0 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md
@@ -1,14 +1,14 @@
 ---
 id: 5949b579404977fbaefcd736
 title: 90億の神の御名 整数
-challengeType: 5
+challengeType: 1
 forumTopicId: 302219
 dashedName: 9-billion-names-of-god-the-integer
 ---
 
 # --description--
 
-このタスクは、[アーサー・C・クラークの短編](https://en.wikipedia.org/wiki/The Nine Billion Names of God#Plot_summary "wp: The Nine Billion Names of God#Plot_summary")のバリエーションです。
+This task is a variation of the short story by Arthur C. Clarke.
 
 (ソルバーは、このタスクの完了結果を認識している必要があります。)
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/accumulator-factory.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/accumulator-factory.md
index 02bc8b26253..3830e0a31eb 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/accumulator-factory.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/accumulator-factory.md
@@ -1,14 +1,14 @@
 ---
 id: 594810f028c0303b75339ace
 title: アキュムレータ・ファクトリ
-challengeType: 5
+challengeType: 1
 forumTopicId: 302222
 dashedName: accumulator-factory
 ---
 
 # --description--
 
-[ポール・グレアム](https://en.wikipedia.org/wiki/Paul_Graham_(programmer)) は、1 つの数値引数を取り、アキュムレータである別の関数を返す関数を作成する問題を考え出しました。 返されたアキュムレータ関数は、1つの数値引数を取り、これまでにアキュムレータに渡されたすべての数値の合計 (アキュムレータが作成されたときに渡された初期値を含む) を返します。
+A problem posed by Paul Graham is that of creating a function that takes a single (numeric) argument and which returns another function that is an accumulator. 返されたアキュムレータ関数は、1つの数値引数を取り、これまでにアキュムレータに渡されたすべての数値の合計 (アキュムレータが作成されたときに渡された初期値を含む) を返します。
 
 # --instructions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/amicable-pairs.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/amicable-pairs.md
index 4c585127369..1405a946538 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/amicable-pairs.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/amicable-pairs.md
@@ -1,49 +1,51 @@
 ---
 id: 5949b579404977fbaefcd737
 title: 友愛数
-challengeType: 5
+challengeType: 1
 forumTopicId: 302225
 dashedName: amicable-pairs
 ---
 
 # --description--
 
-2つの整数、$N$と$M$は、 $N \\neq M$であり、[真の約数](https://rosettacode.org/wiki/Proper divisors "Proper divisors") の合計に関して、$N$ ($\\mathrm{sum}(\\mathrm{propDivs}(N))$) $= M$ かつ $\\mathrm{sum}(\\mathrm{propDivs}(M)) = N$である場合に、[友愛数](https://en.wikipedia.org/wiki/Amicable numbers "wp: Amicable numbers")です。
+Two integers $N$ and $M$ are said to be amicable pairs if $N \\neq M$ and the sum of the proper divisors of $N$ ($\\mathrm{sum}(\\mathrm{propDivs}(N))$) $= M$ as well as $\\mathrm{sum}(\\mathrm{propDivs}(M)) = N$.
 
 **例:**
 
 **1184** と **1210** は、真の約数の和から友愛数だと分かります。
 
 <ul>
-  <li>1、2、4、8、16、32、37、74、148、296、592</li>
-  <li>1、2、5、10、11、22、55、110、121、242、605</li>
+  <li>1, 2, 4, 8, 16, 32, 37, 74, 148, 296, 592 and</li>
+  <li>1, 2, 5, 10, 11, 22, 55, 110, 121, 242, 605 respectively.</li>
 </ul>
 
+The sum of the divisors for the first value, **1184**, is **1210** and the sum of the divisors for the second value, **1210**, is **1184**.
+
 # --instructions--
 
-計算して、20,000 以下の 友愛数を表示します (8 つあります)。
+Calculate and show here the Amicable pairs below 20,000 (there are eight).
 
 # --hints--
 
-`amicablePairsUpTo` という関数です。
+`amicablePairsUpTo` should be a function.
 
 ```js
 assert(typeof amicablePairsUpTo === 'function');
 ```
 
-`amicablePairsUpTo(300)` は `[[220,284]]` を返します。
+`amicablePairsUpTo(300)` should return `[[220,284]]`.
 
 ```js
 assert.deepEqual(amicablePairsUpTo(300), answer300);
 ```
 
-`amicablePairsUpTo(3000)` は `[[220,284],[1184,1210],[2620,2924]]` を返します。
+`amicablePairsUpTo(3000)` should return `[[220,284],[1184,1210],[2620,2924]]`.
 
 ```js
 assert.deepEqual(amicablePairsUpTo(3000), answer3000);
 ```
 
-`amicablePairsUpTo(20000)` は `[[220,284],[1184,1210],[2620,2924],[5020,5564],[6232,6368],[10744,10856],[12285,14595],[17296,18416]]` を返します。
+`amicablePairsUpTo(20000)` should return `[[220,284],[1184,1210],[2620,2924],[5020,5564],[6232,6368],[10744,10856],[12285,14595],[17296,18416]]`.
 
 ```js
 assert.deepEqual(amicablePairsUpTo(20000), answer20000);
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/averages-mode.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/averages-mode.md
index 7118b3092d1..37c5635bc73 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/averages-mode.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/averages-mode.md
@@ -1,14 +1,14 @@
 ---
 id: 594d8d0ab97724821379b1e6
 title: 平均/最頻値
-challengeType: 5
+challengeType: 1
 forumTopicId: 302226
 dashedName: averagesmode
 ---
 
 # --description--
 
-データ全体の [最頻値](https://en.wikipedia.org/wiki/Mode (statistics) "wp: Mode (statistics)") を見つけるためのプログラムを作成します。
+Write a function `mode` to find the value that appears most in an array.
 
 データが空の場合は無視します。 最頻値が1つではない場合には注意が必要です。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md
index 7343c88df2c..037f420f3bc 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md
@@ -1,14 +1,14 @@
 ---
 id: 594d966a1467eb84194f0086
 title: 平均/ピタゴラス平均
-challengeType: 5
+challengeType: 1
 forumTopicId: 302227
 dashedName: averagespythagorean-means
 ---
 
 # --description--
 
-$1$ から $10$ を含む整数の集合における全部で3つの [ピタゴラス平均](https://en.wikipedia.org/wiki/Pythagorean means "wp: Pythagorean means") を計算します。
+Compute all three of the <a href="https://en.wikipedia.org/wiki/Pythagorean_means" target="_blank" rel="noopener noreferrer nofollow">Pythagorean means</a> of the set of integers $1$ through $10$ (inclusive).
 
 正の整数の集合において、$A(x_1,\\ldots,x_n) \\geq G(x_1,\\ldots,x_n) \\geq H(x_1,\\ldots,x_n)$ を示します。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md
index cc525337e73..af3e9fdca96 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md
@@ -1,30 +1,28 @@
 ---
 id: 594da033de4190850b893874
 title: 平均／二乗平均平方根
-challengeType: 5
+challengeType: 1
 forumTopicId: 302228
 dashedName: averagesroot-mean-square
 ---
 
 # --description--
 
-1から10までの数字の [二乗平均平方根](https://en.wikipedia.org/wiki/Root mean square "wp: Root mean square") を計算します。
+Compute the Root Mean Square (RMS) of the numbers 1 through 10 inclusive.
 
-*二乗平均平方根* は、頭文字のRMS(またはrms) や **平方平均** としても知られています。
-
-RMSは、二乗値の平均の平方根として計算されます。
+The <abbr title="Root mean square">RMS</abbr> is calculated by taking the square root of the mean of the squares of the numbers, given by the equation:
 
 $$x\_{\\mathrm{rms}} = \\sqrt {{{x_1}^2 + {x_2}^2 + \\cdots + {x_n}^2} \\over n}. $$
 
 # --hints--
 
-`rms` という関数です。
+`rms` should be a function.
 
 ```js
 assert(typeof rms === 'function');
 ```
 
-`rms([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])` は `6.2048368229954285` と等しくなります。
+`rms([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])` should equal `6.2048368229954285`.
 
 ```js
 assert.equal(rms(arr1), answer1);
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/babbage-problem.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/babbage-problem.md
index c8b12d71543..4a0f7328316 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/babbage-problem.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/babbage-problem.md
@@ -1,14 +1,14 @@
 ---
 id: 594db4d0dedb4c06a2a4cefd
 title: バベッジの問題
-challengeType: 5
+challengeType: 1
 forumTopicId: 302229
 dashedName: babbage-problem
 ---
 
 # --description--
 
-[チャールズ・バベッジ](https://en.wikipedia.org/wiki/Charles_Babbage "wp: Charles_Babbage")は、解析機関が解決できる問題の種類に目を向け、次の例を挙げました。
+Charles Babbage, looking ahead to the sorts of problems his Analytical Engine would be able to solve, gave this example:
 
 <blockquote>
   2乗の末尾が269,696になる最小の正の整数は何ですか?
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/comma-quibbling.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/comma-quibbling.md
index 713372d49a0..13aa7b9ecde 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/comma-quibbling.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/comma-quibbling.md
@@ -1,14 +1,14 @@
 ---
 id: 596e414344c3b2872167f0fe
 title: コンマキブリング
-challengeType: 5
+challengeType: 1
 forumTopicId: 302234
 dashedName: comma-quibbling
 ---
 
 # --description--
 
-カンマキブリング はもともとエリック・リッパートが彼の [ブログ](https://blogs.msdn.com/b/ericlippert/archive/2009/04/15/comma-quibbling.aspx) で提示したタスクです。
+<a href="https://rosettacode.org/wiki/Comma_quibbling" target="_blank" rel="noopener noreferrer nofollow">Comma quibbling</a> is a task originally set by Eric Lippert in his blog.
 
 # --instructions--
 
@@ -52,19 +52,19 @@ assert(typeof quibble(['ABC']) === 'string');
 assert.equal(quibble(testCases[0]), results[0]);
 ```
 
-`quibble(["ABC"])` は "{ABC}"を返します。
+`quibble(["ABC"])` should return `"{ABC}"`.
 
 ```js
 assert.equal(quibble(testCases[1]), results[1]);
 ```
 
-`quibble(["ABC", "DEF"])` は "{ABC and DEF}"を返します。
+`quibble(["ABC", "DEF"])` should return `"{ABC and DEF}"`.
 
 ```js
 assert.equal(quibble(testCases[2]), results[2]);
 ```
 
-`quibble(["ABC", "DEF", "G", "H"])` は "{ABC,DEF,G and H}"を返します。
+`quibble(["ABC", "DEF", "G", "H"])` should return `"{ABC, DEF, G and H}"`.
 
 ```js
 assert.equal(quibble(testCases[3]), results[3]);
@@ -76,7 +76,7 @@ assert.equal(quibble(testCases[3]), results[3]);
 
 ```js
 const testCases = [[], ["ABC"], ["ABC", "DEF"], ["ABC", "DEF", "G", "H"]];
-const results = ["{}", "{ABC}", "{ABC and DEF}", "{ABC,DEF,G and H}"];
+const results = ["{}", "{ABC}", "{ABC and DEF}", "{ABC, DEF, G and H}"];
 ```
 
 ## --seed-contents--
@@ -93,7 +93,7 @@ function quibble(words) {
 ```js
 function quibble(words) {
   return "{" +
-    words.slice(0, words.length - 1).join(",") +
+    words.slice(0, words.length - 1).join(", ") +
    (words.length > 1 ? " and " : "") +
    (words[words.length - 1] || '') +
   "}";
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
index 57e2722d523..d5d348205c3 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
@@ -1,14 +1,20 @@
 ---
 id: 596e457071c35c882915b3e4
 title: 文字列リストの比較
-challengeType: 5
+challengeType: 1
 forumTopicId: 302235
 dashedName: compare-a-list-of-strings
 ---
 
 # --description--
 
-任意の多くの文字列 [リスト](https://en.wikipedia.org/wiki/List_(abstract_data_type) "wp: List\_(abstract_data_type)") が与えられた場合、以下の各条件で関数を作成します。
+A list is a ordered set of values that may contain duplicates. Here is an example:
+
+```js
+const list = [['AA',  'BB', 'CC'], ['AA', 'ACB', 'AA'], [], ['AA']];
+```
+
+Given a list of arbitrarily many strings, implement a function for each of the following conditions:
 
 <ul>
   <li>それらがすべて語彙として等しいかどうかをテストします</li>
@@ -17,73 +23,73 @@ dashedName: compare-a-list-of-strings
 
 # --hints--
 
-`allEqual` という関数です。
+`allEqual` should be a function.
 
 ```js
 assert(typeof allEqual === 'function');
 ```
 
-`azSorted` という関数です。
+`azSorted` should be a function.
 
 ```js
 assert(typeof azSorted === 'function');
 ```
 
-`allEqual(["AA", "AA", "AA", "AA"])` は真を返します。
+`allEqual(["AA", "AA", "AA", "AA"])` should return true.
 
 ```js
 assert(allEqual(testCases[0]));
 ```
 
-`azSorted(["AA", "AA", "AA", "AA"])` は偽を返します。
+`azSorted(["AA", "AA", "AA", "AA"])` should return false.
 
 ```js
 assert(!azSorted(testCases[0]));
 ```
 
-`allEqual(["AA", "ACB", "BB", "CC"])` は偽を返します。
+`allEqual(["AA", "ACB", "BB", "CC"])` should return false.
 
 ```js
 assert(!allEqual(testCases[1]));
 ```
 
-`azSorted(["AA", "ACB", "BB", "CC"])` は真を返します。
+`azSorted(["AA", "ACB", "BB", "CC"])` should return true.
 
 ```js
 assert(azSorted(testCases[1]));
 ```
 
-`allEqual([])` は真を返します。
+`allEqual([])` should return true.
 
 ```js
 assert(allEqual(testCases[2]));
 ```
 
-`azSorted([])` は真を返します。
+`azSorted([])` should return true.
 
 ```js
 assert(azSorted(testCases[2]));
 ```
 
-`allEqual(["AA"])` は真を返します。
+`allEqual(["AA"])` should return true.
 
 ```js
 assert(allEqual(testCases[3]));
 ```
 
-`azSorted(["AA"])` は真を返します。
+`azSorted(["AA"])` should return true.
 
 ```js
 assert(azSorted(testCases[3]));
 ```
 
-`allEqual(["BB", "AA"])` は偽を返します。
+`allEqual(["BB", "AA"])` should return false.
 
 ```js
 assert(!allEqual(testCases[4]));
 ```
 
-`azSorted(["BB", "AA"])` は偽を返します。
+`azSorted(["BB", "AA"])` should return false.
 
 ```js
 assert(!azSorted(testCases[4]));
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/count-the-coins.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/count-the-coins.md
index 7f707417fed..a57589311d8 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/count-the-coins.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/count-the-coins.md
@@ -1,14 +1,14 @@
 ---
 id: 59713bd26bdeb8a594fb9413
 title: 硬貨を数える
-challengeType: 5
+challengeType: 1
 forumTopicId: 302238
 dashedName: count-the-coins
 ---
 
 # --description--
 
-[米国](https://en.wikipedia.org/wiki/United_States) 通貨には4種類の共通硬貨があります。
+There are four types of common coins in US currency:
 
 <ul>
   <li>25セント硬貨</li>
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/cramers-rule.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/cramers-rule.md
index 9d343139fb1..1a2b182a301 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/cramers-rule.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/cramers-rule.md
@@ -1,50 +1,54 @@
 ---
 id: 59713da0a428c1a62d7db430
 title: クラメルの公式
-challengeType: 5
+challengeType: 1
 forumTopicId: 302239
 dashedName: cramers-rule
 ---
 
 # --description--
 
-[線形代数で](https://en.wikipedia.org/wiki/linear algebra "wp: linear algebra")、[クラメルの公式](https://en.wikipedia.org/wiki/Cramer's rule "wp: Cramer's rule") は未知数と同じくらい多くの方程式を含む [線形方程式のシステム](https://en.wikipedia.org/wiki/system of linear equations "wp: system of linear equations") を解くための明示的な公式であり、システムに一意の解があれば常に有効です。 解を、(正方) 係数行列と、列を方程式右辺のベクトルで置き換えて得られる行列の行列式で表します。
+<a href="https://rosettacode.org/wiki/Cramer%27s_rule" target="_blank" rel="noopener noreferrer nofollow">Cramer's rule</a> is a formula for solving a system of linear equations by using the determinants of matrices formed from subsets of the coefficients and right hand side values.
 
-次のように仮定します。
+The determinant of a matrix with 2 rows and two columns is given by:
+
+$\begin{aligned}|A|={\begin{vmatrix}a&b\\\c&d\end{vmatrix}}=ad-bc.\end{aligned}$
+
+Given a system of linear equations:
 
 $\\left\\{\\begin{matrix}a_1x + b_1y + c_1z&= {\\color{red}d_1}\\\\a_2x + b_2y + c_2z&= {\\color{red}d_2}\\\\a_3x + b_3y + c_3z&= {\\color{red}d_3}\\end{matrix}\\right.$
 
-行列形式で、上記は以下のように表されます。
+which in matrix format is
 
 $\\begin{bmatrix} a_1 & b_1 & c_1 \\\\ a_2 & b_2 & c_2 \\\\ a_3 & b_3 & c_3 \\end{bmatrix}\\begin{bmatrix} x \\\\ y \\\\ z \\end{bmatrix}=\\begin{bmatrix} {\\color{red}d_1} \\\\ {\\color{red}d_2} \\\\ {\\color{red}d_3} \\end{bmatrix}.$
 
-したがって、$x、y$、および $z$ の値は以下のようになります。
+Then the values of $x, y$ and $z$ can be found as follows:
 
 $x = \\frac{\\begin{vmatrix} {\\color{red}d_1} & b_1 & c_1 \\\\ {\\color{red}d_2} & b_2 & c_2 \\\\ {\\color{red}d_3} & b_3 & c_3 \\end{vmatrix} } { \\begin{vmatrix} a_1 & b_1 & c_1 \\\\ a_2 & b_2 & c_2 \\\\ a_3 & b_3 & c_3 \\end{vmatrix}}, \\quad y = \\frac {\\begin{vmatrix} a_1 & {\\color{red}d_1} & c_1 \\\\ a_2 & {\\color{red}d_2} & c_2 \\\\ a_3 & {\\color{red}d_3} & c_3 \\end{vmatrix}} {\\begin{vmatrix} a_1 & b_1 & c_1 \\\\ a_2 & b_2 & c_2 \\\\ a_3 & b_3 & c_3 \\end{vmatrix}}, \\text{ and }z = \\frac { \\begin{vmatrix} a_1 & b_1 & {\\color{red}d_1} \\\\ a_2 & b_2 & {\\color{red}d_2} \\\\ a_3 & b_3 & {\\color{red}d_3} \\end{vmatrix}} {\\begin{vmatrix} a_1 & b_1 & c_1 \\\\ a_2 & b_2 & c_2 \\\\ a_3 & b_3 & c_3 \\end{vmatrix} }.$
 
 # --instructions--
 
-以下の連立方程式が与えられます。
+Given the following system of equations:
 
 $\\begin{cases} 2w-x+5y+z=-3 \\\\ 3w+2x+2y-6z=-32 \\\\ w+3x+3y-z=-47 \\\\ 5w-2x-3y+3z=49 \\\\ \\end{cases}$
 
-クラメルの公式を使用すると、解は $w$、$x$、$y$ および $z$となります。
+solve for $w$, $x$, $y$ and $z$, using Cramer's rule.
 
 # --hints--
 
-`cramersRule` という関数です。
+`cramersRule` should be a function.
 
 ```js
 assert(typeof cramersRule === 'function');
 ```
 
-`cramersRule([[2, -1, 5, 1], [3, 2, 2, -6], [1, 3, 3, -1], [5, -2, -3, 3]], [-3, -32, -47, 49])` は `[2, -12, -4, 1]` を返します。
+`cramersRule([[2, -1, 5, 1], [3, 2, 2, -6], [1, 3, 3, -1], [5, -2, -3, 3]], [-3, -32, -47, 49])` should return `[2, -12, -4, 1]`.
 
 ```js
 assert.deepEqual(cramersRule(matrices[0], freeTerms[0]), answers[0]);
 ```
 
-`cramersRule([[3, 1, 1], [2, 2, 5], [1, -3, -4]], [3, -1, 2])` は `[1, 1, -1]` を返します。
+`cramersRule([[3, 1, 1], [2, 2, 5], [1, -3, -4]], [3, -1, 2])` should return `[1, 1, -1]`.
 
 ```js
 assert.deepEqual(cramersRule(matrices[1], freeTerms[1]), answers[1]);
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md
index 93c49e468da..38f8adc73d2 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md
@@ -1,48 +1,73 @@
 ---
 id: 5a23c84252665b21eecc7e03
 title: 累積標準偏差
-challengeType: 5
+challengeType: 1
 forumTopicId: 302240
 dashedName: cumulative-standard-deviation
 ---
 
 # --description--
 
-数値の配列をパラメータとして取り、級数の [標準偏差](https://en.wikipedia.org/wiki/Standard_deviation) を返す関数を作成します。
+Suppose that the entire population of interest is eight students in a particular class. For a finite set of numbers, the population standard deviation is found by taking the square root of the average of the squared deviations of the values subtracted from their average value. The marks of a class of eight students (that is, a statistical population) are the following eight values:
+
+$2, 4, 4, 4, 5, 5, 7, 9$
+
+These eight data points have the mean (average) of 5:
+
+$$\mu ={\frac {2+4+4+4+5+5+7+9}{8}}={\frac {40}{8}}=5$$
+
+First, calculate the deviations of each data point from the mean, and square the result of each:
+
+| Deviations of each data | Square the result    |
+| ----------------------- | -------------------- |
+| $(2-5)^{2}=(-3)^{2}=9$  | $(5-5)^{2}=0^{2}=0$  |
+| $(4-5)^{2}=(-1)^{2}=1$  | $(5-5)^{2}=0^{2}=0$  |
+| $(4-5)^{2}=(-1)^{2}=1$  | $(7-5)^{2}=2^{2}=4$  |
+| $(4-5)^{2}=(-1)^{2}=1$  | $(9-5)^{2}=4^{2}=16$ |
+
+The variance is the mean of these values:
+
+$$\sigma ^{2}={\frac {9+1+1+1+0+0+4+16}{8}}={\frac {32}{8}}=4$$
+
+and the population standard deviation is equal to the square root of the variance:
+
+$$\sigma ={\sqrt {4}}=2$$
+
+Write a function that takes an array of numbers as parameter and returns the <a href="https://rosettacode.org/wiki/Standard_deviation" target="_blank" rel="noopener noreferrer nofollow">standard deviation</a> of the series.
 
 # --hints--
 
-`standardDeviation` という関数です。
+`standardDeviation` should be a function.
 
 ```js
 assert(typeof standardDeviation == 'function');
 ```
 
-`standardDeviation([2, 4, 4, 4, 5, 5, 7, 9])` は数字を返します。
+`standardDeviation([2, 4, 4, 4, 5, 5, 7, 9])` should return a number.
 
 ```js
 assert(typeof standardDeviation([2, 4, 4, 4, 5, 5, 7, 9]) == 'number');
 ```
 
-`standardDeviation([2, 4, 4, 4, 5, 5, 7, 9])` は `2` を返します。
+`standardDeviation([2, 4, 4, 4, 5, 5, 7, 9])` should return `2`.
 
 ```js
 assert.equal(standardDeviation([2, 4, 4, 4, 5, 5, 7, 9]), 2);
 ```
 
-`standardDeviation([600, 470, 170, 430, 300])` は `147.323` を返します。
+`standardDeviation([600, 470, 170, 430, 300])` should return `147.323`.
 
 ```js
 assert.equal(standardDeviation([600, 470, 170, 430, 300]), 147.323);
 ```
 
-`standardDeviation([75, 83, 96, 100, 121, 125])` は `18.239` を返します。
+`standardDeviation([75, 83, 96, 100, 121, 125])` should return `18.239`.
 
 ```js
 assert.equal(standardDeviation([75, 83, 96, 100, 121, 125]), 18.239);
 ```
 
-`standardDeviation([23, 37, 45, 49, 56, 63, 63, 70, 72, 82])` は `16.87` を返します。
+`standardDeviation([23, 37, 45, 49, 56, 63, 63, 70, 72, 82])` should return `16.87`.
 
 ```js
 assert.equal(
@@ -51,7 +76,7 @@ assert.equal(
 );
 ```
 
-`standardDeviation([271, 354, 296, 301, 333, 326, 285, 298, 327, 316, 287, 314])` は `22.631` を返します。
+`standardDeviation([271, 354, 296, 301, 333, 326, 285, 298, 327, 316, 287, 314])` should return `22.631`.
 
 ```js
 assert.equal(
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md
index 849d7b56e8b..9433bd3a11f 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md
@@ -1,18 +1,18 @@
 ---
 id: 59694356a6e7011f7f1c5f4e
 title: フリーセルのカードを配る
-challengeType: 5
+challengeType: 1
 forumTopicId: 302246
 dashedName: deal-cards-for-freecell
 ---
 
 # --description--
 
-*フリーセル* は、ポール・アルフィレ (Paul Alfille) が1978年にPLATOシステムに導入したソリティアというカードゲームです。 Microsoftのジム・ホーン (Jim Horne) は、ゲーム名をフリーセルに変更し、[DOS](https://rosettacode.org/wiki/DOS "DOS")向け、そして[Windows](https://rosettacode.org/wiki/Windows "Windows")向けに、ゲームを再実装しました。 このバージョンでは、32000のゲーム番号が導入されました。
+*フリーセル* は、ポール・アルフィレ (Paul Alfille) が1978年にPLATOシステムに導入したソリティアというカードゲームです。 Jim Horne, at Microsoft, changed the name to FreeCell and reimplemented the game for DOS, then Windows. このバージョンでは、32000のゲーム番号が導入されました。
 
 ゲームが普及し、ジム・ホーンがアルゴリズムを開示したため、他のフリーセル実装でもMicrosoftと同様のアルゴリズムでカードが配られるようになりました。 カードの配り方には1から32000まで番号が付けられています。 Microsoftの新しいバージョンでは、1から1000000までの番号が付けられた100万のゲーム番号があります。一部の実装では、この範囲外の番号も使用されています。
 
-Microsoft Cにおける [線形合同法](https://rosettacode.org/wiki/linear congruential generator "linear congruential generator") をアルゴリズムに使用しています。
+The algorithm uses this linear congruential generator from Microsoft C:
 
 <ul>
   <li>$state_{n + 1} \equiv 214013 \times state_n + 2531011 \pmod{2^{31}}$</li>
@@ -24,7 +24,7 @@ Microsoft Cにおける [線形合同法](https://rosettacode.org/wiki/linear co
 
 <ol>
   <li>RNGにゲーム番号を与えます。
-  </li><li>52枚のカードの <a href='https://rosettacode.org/wiki/array' title='array' target='_blank'>配列</a> を作成します。クラブのエース、ダイヤモンドのエース、ハートのエース、スペードのエース、クラブの2、ダイヤモンドの2、と続きます。エース、2、3、4、5、6、7、8、9、10、ジャック、クイーン、キングの順番です。 配列インデックスは0から51で、クラブのエースは0、スペードのキングは51です。</li>
+  </li><li>Create an array of 52 cards: Ace of Clubs, Ace of Diamonds, Ace of Hearts, Ace of Spades, 2 of Clubs, 2 of Diamonds, and so on through the ranks: Ace, 2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King. 配列インデックスは0から51で、クラブのエースは0、スペードのキングは51です。</li>
   <li>配列が空になるまでです。</li>
   <li>インデックスでランダムなカードを選択します≡ 次の乱数(Mod配列の長さ)。</li>
     <ul>
@@ -79,35 +79,33 @@ Microsoft Cにおける [線形合同法](https://rosettacode.org/wiki/linear co
 
 ゲーム番号を受け取り、このアルゴリズムと同じ順序でカードを配る関数を作成します。 この関数はフリーセルボードを表す2次元配列を返します。
 
-ゲーム番号は、[1000000ゲームのフリーセルソリューション](https://freecellgamesolutions.com/) に照らし合わせて確認することもできます (ビデオソリューションを呼び出し、最初のゲーム番号を表示する)。
-
 # --hints--
 
-`dealFreeCell` という関数です。
+`dealFreeCell` should be a function.
 
 ```js
 assert(typeof dealFreeCell === 'function');
 ```
 
-`dealFreeCell(seed)` はオブジェクトを返します。
+`dealFreeCell(seed)` should return an object.
 
 ```js
 assert(typeof dealFreeCell(1) === 'object');
 ```
 
-`dealFreeCell(seed)` は長さ7の配列を返します。
+`dealFreeCell(seed)` should return an array of length 7.
 
 ```js
 assert(dealFreeCell(1).length === 7);
 ```
 
-`dealFreeCell(1)` は例「Game #1」と同一の配列を返します。
+`dealFreeCell(1)` should return an array identical to example "Game #1"
 
 ```js
 assert.deepEqual(dealFreeCell(1), game1);
 ```
 
-`dealFreeCell(617)` は「Game #617」と同一の配列を返します。
+`dealFreeCell(617)` should return an array identical to example "Game #617"
 
 ```js
 assert.deepEqual(dealFreeCell(617), game617);
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/discordian-date.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/discordian-date.md
index d8194cb2f27..fb54ccdc8e4 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/discordian-date.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/discordian-date.md
@@ -1,24 +1,41 @@
 ---
 id: 59f4eafba0343628bb682785
 title: ディスコルディア暦の日付
-challengeType: 5
+challengeType: 1
 forumTopicId: 302250
 dashedName: discordian-date
 ---
 
 # --description--
+The Gregorian calendar is a solar calendar with 12 months of 28-31 days each. A week consists of seven days, and there are 52 weeks and 1 day per year. The year consists of 365 days with a leap day added to February every leap year. A leap year occurs every four years, except for the first three centurial years of every 400 years.
 
-与えられた日付を[グレゴリオ暦](https://en.wikipedia.org/wiki/Gregorian calendar "wp: Gregorian calendar") から [ディスコルディア暦](https://en.wikipedia.org/wiki/Discordian calendar "wp: Discordian calendar")に変換します。
+The <a href="http://www.rosettacode.org/wiki/Discordian_date" target="_blank" rel="noopener noreferrer nofollow">Discordian calendar</a> is aligned with the Gregorian calendar, and begins on January 1. The week consists of five days, and there are 73 weeks per year. The year also consists of 365 days, with an extra day inserted between Chaos 59 and Chaos 60 every leap year.
+
+The months, weekdays, Apostle events, and Holidays in the Discordian calendar are given by:
+
+Seasons: `'Chaos', 'Discord', 'Confusion', 'Bureaucracy', 'The Aftermath'`.
+
+Weekdays: `'Sweetmorn', 'Boomtime', 'Pungenday', 'Prickle-Prickle', 'Setting Orange'`.
+
+Apostle: `'Mungday', 'Mojoday', 'Syaday', 'Zaraday', 'Maladay'`.
+
+Holidays: `'Chaoflux', 'Discoflux', 'Confuflux', 'Bureflux', 'Afflux'`.
+
+# --instructions--
+
+Convert a given date from the Gregorian calendar to the Discordian calendar.
+
+Note that the day Chaos 1, 3188 YOLD in the Discordian calendar is the day January 1, 2022 in the Gregorian calendar.
 
 # --hints--
 
-`discordianDate` という関数です。
+`discordianDate` should be a function.
 
 ```js
 assert(typeof discordianDate === 'function');
 ```
 
-`discordianDate(new Date(2010, 6, 22))` は `"Pungenday, the 57th day of Confusion in the YOLD 3176"` を返します。
+`discordianDate(new Date(2010, 6, 22))` should return `"Pungenday, the 57th day of Confusion in the YOLD 3176"`.
 
 ```js
 assert(
@@ -27,7 +44,7 @@ assert(
 );
 ```
 
-`discordianDate(new Date(2012, 1, 28))` は `"Prickle-Prickle, the 59th day of Chaos in the YOLD 3178"` を返します。
+`discordianDate(new Date(2012, 1, 28))` should return `"Prickle-Prickle, the 59th day of Chaos in the YOLD 3178"`.
 
 ```js
 assert(
@@ -36,7 +53,7 @@ assert(
 );
 ```
 
-`discordianDate(new Date(2012, 1, 29))` は `"Setting Orange, the 60th day of Chaos in the YOLD 3178. Celebrate St. Tib\'s Day!"` を返します。
+`discordianDate(new Date(2012, 1, 29))` should return `"Setting Orange, the 60th day of Chaos in the YOLD 3178. Celebrate St. Tib\'s Day!"`.
 
 ```js
 assert(
@@ -45,7 +62,7 @@ assert(
 );
 ```
 
-`discordianDate(new Date(2012, 2, 1))` は `"Setting Orange, the 60th day of Chaos in the YOLD 3178"` を返します。
+`discordianDate(new Date(2012, 2, 1))` should return `"Setting Orange, the 60th day of Chaos in the YOLD 3178"`.
 
 ```js
 assert(
@@ -54,7 +71,7 @@ assert(
 );
 ```
 
-`discordianDate(new Date(2010, 0, 5))` は `"Setting Orange, the 5th day of Chaos in the YOLD 3176. Celebrate Mungday!"` を返します。
+`discordianDate(new Date(2010, 0, 5))` should return `"Setting Orange, the 5th day of Chaos in the YOLD 3176. Celebrate Mungday!"`.
 
 ```js
 assert(
@@ -63,7 +80,7 @@ assert(
 );
 ```
 
-`discordianDate(new Date(2011, 4, 3))` は `"Pungenday, the 50th day of Discord in the YOLD 3177. Celebrate Discoflux!"` を返します。
+`discordianDate(new Date(2011, 4, 3))` should return `"Pungenday, the 50th day of Discord in the YOLD 3177. Celebrate Discoflux!"`.
 
 ```js
 assert(
@@ -72,7 +89,7 @@ assert(
 );
 ```
 
-`discordianDate(new Date(2015, 9, 19))` は `"Boomtime, the 73rd day of Bureaucracy in the YOLD 3181"` を返します。
+`discordianDate(new Date(2015, 9, 19))` should return `"Boomtime, the 73rd day of Bureaucracy in the YOLD 3181"`.
 
 ```js
 assert(
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/dot-product.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/dot-product.md
index f8bb9b11884..df42df7be06 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/dot-product.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/dot-product.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7e1e
 title: ドット積
-challengeType: 5
+challengeType: 1
 forumTopicId: 302251
 dashedName: dot-product
 ---
 
 # --description--
 
-2つのベクトルの**スカラー積**としても知られる**[ドット積](https://en.wikipedia.org/wiki/Dot product)**を計算する関数を作成します。
+Create a function, to compute the **dot product**, also known as the **scalar product** of two vectors.
 
 # --hints--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/euler-method.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/euler-method.md
index befea4cccff..39403e19fc2 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/euler-method.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/euler-method.md
@@ -1,14 +1,14 @@
 ---
 id: 59880443fb36441083c6c20e
 title: オイラー法
-challengeType: 5
+challengeType: 1
 forumTopicId: 302258
 dashedName: euler-method
 ---
 
 # --description--
 
-オイラー法は、所定の初期値を持つ1階の常微分方程式 (ODE) の解における近似値を求めます。 [記事](https://www.freecodecamp.org/news/eulers-method-explained-with-examples/ "news: Euler's Method Explained with Examples") で論説されているように、初期値の問題(IVP)を解くための明示的な方法です。
+オイラー法は、所定の初期値を持つ1階の常微分方程式 (ODE) の解における近似値を求めます。 It is an explicit method for solving initial value problems (IVPs), as described in <a href="https://www.freecodecamp.org/news/eulers-method-explained-with-examples/" title="Euler's Method Explained with Examples" target="_blank" rel="noopener noreferrer nofollow">this article</a>.
 
 ODEは以下の形式で書きます。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md
index e55e1336784..97655716845 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md
@@ -1,183 +1,115 @@
 ---
 id: 59e09e6d412c5939baa02d16
 title: マルコフアルゴリズム
-challengeType: 5
+challengeType: 1
 forumTopicId: 302260
 dashedName: execute-a-markov-algorithm
 ---
 
 # --description--
 
-[マルコフアルゴリズム](https://en.wikipedia.org/wiki/Markov algorithm "wp: Markov algorithm") のインタプリタを作成します。
+Markov Concepts are used in machine learning, because of its simple approach in data manipulation. With a set number of `rules` you can manipulate given `data` to create a desired `output`.
 
-ルールの構文は以下のとおりです。
+We have added in the background:
 
-<pre>[ruleset] ::= (([comment] | [rule]) [newline]+)*
-[comment] ::= # {[any character]}
-[rule] ::= [pattern] [whitespace] -> [whitespace] [.] [replacement]
-[whitespace] ::= ([tab] | [space]) [[whitespace]]
-</pre>
+The `rules` in the form of nested array, and the `data` in the form of array, too. And the desired `outputs`.
 
-1行に1つのルールがあります。
+The `rules`:
 
-\[replacement] の前に`.` (ピリオド) がある場合、インタプリタが演算を停止する規則があります。
+```js
+let rules=[
+[
+"A -> apple","B -> bag","S -> shop","T -> the",
+"the shop -> my brother","a never used -> .terminating rule"
+],
 
-ルールセットは、任意のコメントを含む一連のルールで構成されます。
+[
+ "A -> apple","B -> bag","S -> .shop","T -> the",
+ "the shop -> my brother","a never used -> .terminating rule"
+],
 
-ルールセット
+[
+ "A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag",
+ "->.* -> money","W -> WW","S -> .shop","T -> the",
+ "the shop -> my brother","a never used -> .terminating rule"
+],
 
-以下のテストを入力に使用します。
+[
+ "_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX",
+ "X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y",
+ "1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "
+],
 
-**ルールセット1:**
+[
+"A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11",
+"B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"
+]
 
-<pre># This rules file is extracted from Wikipedia:
-# <code>http://en.wikipedia.org/wiki/Markov_Algorithm</code>
-A -> apple
-B -> bag
-S -> shop
-T -> the
-the shop -> my brother
-a never used -> .terminating rule
-</pre>
+];
+```
 
-`I bought a B of As from T S.` というサンプルテキストで、 `I bought a bag of apples from my brother.` が出力されます。
+The `data`:
 
-**ルールセット2:**
+```js
+let data=[
+        "I bought a B of As from T S.",
+        "I bought a B of As from T S.",
+        "I bought a B of As W my Bgage from T S.",
+        "_1111*11111_",
+        "000000A000000"
+        ];
+```
 
-停止規則のテスト
+The `outputs`:
 
-<pre># Slightly modified from the rules on Wikipedia
-A -> apple
-B -> bag
-S -> .shop
-T -> the
-the shop -> my brother
-a never used -> .terminating rule
-</pre>
+```js
+let outputs=[
+    "I bought a bag of apples from my brother.",
+    "I bought a bag of apples from T shop.",
+    "I bought a bag of apples with my money from T shop.",
+    "11111111111111111111",
+    "00011H1111000"
+    ]
+```
 
-`I bought a B of As from T S.` というサンプルテキストで、 `I bought a bag of apples from T shop.` が出力されます。
-
-**ルールセット3:**
-
-これは正しい置換順序をテストします。特別な正規表現文字がエスケープされない場合、単純な正規表現ベースの置換ルーチンをトラップする場合があります。
-
-<pre># BNF Syntax testing rules
-A -> apple
-WWWW -> with
-Bgage -> ->.*
-B -> bag
-->.* -> money
-W -> WW
-S -> .shop
-T -> the
-the shop -> my brother
-a never used -> .terminating rule
-</pre>
-
-`I bought a B of As W my Bgage from T S.` というサンプルテキストで、 `I bought a bag of apples with my money from T shop.` が出力されます。
-
-**ルールセット4:**
-
-これはルールスキャンの正しい順序をテストし、誤った順序でスキャンする置換ルーチンをトラップする場合があります。 一般的な単項乗算エンジンを実装します。 (この実装では、入力式をアンダースコア内に置くことに注意してください。）
-
-<pre>### Unary Multiplication Engine, for testing Markov Algorithm implementations
-### By Donal Fellows.
-# Unary addition engine
-_+1 -> _1+
-1+1 -> 11+
-# Pass for converting from the splitting of multiplication into ordinary
-# addition
-1! -> !1
-,! -> !+
-_! -> _
-# Unary multiplication by duplicating left side, right side times
-1*1 -> x,@y
-1x -> xX
-X, -> 1,1
-X1 -> 1X
-_x -> _X
-,x -> ,X
-y1 -> 1y
-y_ -> _
-# Next phase of applying
-1@1 -> x,@y
-1@_ -> @_
-,@_ -> !_
-++ -> +
-# Termination cleanup for addition
-_1 -> 1
-1+_ -> 1
-_+_ ->
-</pre>
-
-`_1111*11111_` というサンプルテキストで、`11111111111111111111` が出力されます。
-
-**ルールセット5:**
-
-シンプルな [チューリングマシン](http://en.wikipedia.org/wiki/Turing_machine "link: http&#x3A;//en.wikipedia.org/wiki/Turing_machine")は、3-状態 [ビジービーバー](http://en.wikipedia.org/wiki/Busy_beaver "link: http&#x3A;//en.wikipedia.org/wiki/Busy_beaver")を実装します。
-
-このテープは `0`と`1`からなり、状態は `A`、`B`、`C` および`H` (`H`altの場合) であり、先頭の位置は先頭文字の前に状態文字を書くことにより示されます。 マシンが操作する元のテープをすべて入力する必要あります。
-
-マルコフアルゴリズムがチューリング完全であることを示すだけでなく、 最初の4つのルールセットでは見つからなかったC++実装のバグを検出することができました。
-
-<pre># Turing machine: three-state busy beaver
-#
-# state A, symbol 0 => write 1, move right, new state B
-A0 -> 1B
-# state A, symbol 1 => write 1, move left, new state C
-0A1 -> C01
-1A1 -> C11
-# state B, symbol 0 => write 1, move left, new state A
-0B0 -> A01
-1B0 -> A11
-# state B, symbol 1 => write 1, move right, new state B
-B1 -> 1B
-# state C, symbol 0 => write 1, move left, new state B
-0C0 -> B01
-1C0 -> B11
-# state C, symbol 1 => write 1, move left, halt
-0C1 -> H01
-1C1 -> H11
-</pre>
-
-このルールセットで `000000A000000` が `00011H1111000`に変更されます。
+Using Markov Algorithm, change the `data` into the desired `outputs` using the `rules` provided for you.
 
 # --hints--
 
-`markov` という関数です。
+`markov` should be a function.
 
 ```js
 assert(typeof markov === 'function');
 ```
 
-`markov(["A -> apple","B -> bag","S -> shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")`は「I bought a bag of apples from my brother.」を返します。
+`markov(["A -> apple","B -> bag","S -> shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` should return the string `I bought a bag of apples from my brother.`.
 
 ```js
-assert.deepEqual(markov(rules[0], tests[0]), outputs[0]);
+assert.deepEqual(markov(rules[0], datas[0]), outputs[0]);
 ```
 
-`markov(["A -> apple","B -> bag","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` は「I bought a bag of apples from T shop.」を返します。
+`markov(["A -> apple","B -> bag","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` should return the string `I bought a bag of apples from T shop.`.
 
 ```js
-assert.deepEqual(markov(rules[1], tests[1]), outputs[1]);
+assert.deepEqual(markov(rules[1], datas[1]), outputs[1]);
 ```
 
-`markov(["A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag","->.* -> money","W -> WW","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As W my Bgage from T S.")` は「I bought a bag of apples with my money from T shop.」を返します。
+`markov(["A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag","->.* -> money","W -> WW","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As W my Bgage from T S.")` should return the string `I bought a bag of apples with my money from T shop.`.
 
 ```js
-assert.deepEqual(markov(rules[2], tests[2]), outputs[2]);
+assert.deepEqual(markov(rules[2], datas[2]), outputs[2]);
 ```
 
-`markov(["_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX","X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y","1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "],"_1111*11111_")` は「11111111111111111111」を返します。
+`markov(["_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX","X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y","1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "],"_1111*11111_")` should return the string `11111111111111111111`.
 
 ```js
-assert.deepEqual(markov(rules[3], tests[3]), outputs[3]);
+assert.deepEqual(markov(rules[3], datas[3]), outputs[3]);
 ```
 
-`markov(["A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11","B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"],"")` は「00011H1111000」を返します。
+`markov(["A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11","B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"],"")` should return the string `00011H1111000`.
 
 ```js
-assert.deepEqual(markov(rules[4], tests[4]), outputs[4]);
+assert.deepEqual(markov(rules[4], datas[4]), outputs[4]);
 ```
 
 # --seed--
@@ -191,7 +123,7 @@ let rules=[["A -> apple","B -> bag","S -> shop","T -> the","the shop -> my broth
             ["A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag","->.* -> money","W -> WW","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],
             ["_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX","X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y","1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "],
             ["A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11","B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"]];
-let tests=["I bought a B of As from T S.",
+let datas=["I bought a B of As from T S.",
             "I bought a B of As from T S.",
             "I bought a B of As W my Bgage from T S.",
             "_1111*11111_",
@@ -208,7 +140,7 @@ let outputs=["I bought a bag of apples from my brother.",
 ## --seed-contents--
 
 ```js
-function markov(rules,test) {
+function markov(rules,data) {
 
 }
 ```
@@ -216,9 +148,9 @@ function markov(rules,test) {
 # --solutions--
 
 ```js
-function markov(rules,test) {
+function markov(rules,data) {
     let pattern = new RegExp("^([^#]*?)\\s+->\\s+(\\.?)(.*)");
-    let origTest = test;
+    let origData = data;
 
     let captures = [];
 
@@ -229,18 +161,18 @@ function markov(rules,test) {
         captures.push(m);
     });
 
-    test = origTest;
-    let copy = test;
+    data = origData;
+    let copy = data;
     for (let j = 0; j < captures.length; j++) {
         let c = captures[j];
-        test = test.replace(c[0], c[2]);
+        data = data.replace(c[0], c[2]);
         if (c[1]==".")
             break;
-        if (test!=copy) {
+        if (data!=copy) {
             j = -1;
-            copy = test;
+            copy = data;
         }
     }
-    return test;
+    return data;
 }
 ```
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/execute-brain.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/execute-brain.md
index 2ca5d2b2a52..fda4d895fd6 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/execute-brain.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/execute-brain.md
@@ -1,7 +1,7 @@
 ---
 id: 59e0a8df964e4540d5abe599
 title: Brain****の実行
-challengeType: 5
+challengeType: 1
 forumTopicId: 302261
 dashedName: execute-brain
 ---
@@ -10,21 +10,21 @@ dashedName: execute-brain
 
 Brain\*\*\*\*\* インタプリタを実行する関数を作成します。 関数はパラメータとして文字列を取り、出力文字列を返します。 詳細は以下の通りです。
 
-RCBFは ロゼッタコード用に様々な言語で書かれた[Brainf\*\*\*](https://rosettacode.org/wiki/Brainf*** "Brainf\*\*\*") コンパイラおよびインタプリタのセットです。
+RCBF is a set of <a href="https://rosettacode.org/wiki/Brainf***" target="_blank" rel="noopener noreferrer nofollow">Brainf\*\*\*</a> compilers and interpreters written for Rosetta Code in a variety of languages.
 
 以下は、RCBFの各バージョンへのリンクです。
 
 実装には以下の手順を適切に実行する必要があります。
 
-| コマンド                      | 説明                                                         |
-| ------------------------- | ---------------------------------------------------------- |
-| <code>></code> | ポインタを右に移動します                                               |
-| <code>&lt;</code> | ポインタを左に移動します                                               |
-| <code>+</code> | ポインタの下にあるメモリーセルを増やします                                      |
-| <code>-</code> | ポインタの下にあるメモリーセルを減らします                                      |
-| <code>.</code> | ポインターのセルで示された文字を出力します                                      |
-| <code>,</code> | 文字を入力し、ポインタのセルに格納します                                       |
-| <code>\[</code> | ポインタの下のセルが 0 の場合、一致する <code>]</code> をジャンプします     |
+| コマンド                      | 説明                                                          |
+| ------------------------- | ----------------------------------------------------------- |
+| <code>></code> | ポインタを右に移動します                                                |
+| <code>&lt;</code> | ポインタを左に移動します                                                |
+| <code>+</code> | ポインタの下にあるメモリーセルを増やします                                       |
+| <code>-</code> | ポインタの下にあるメモリーセルを減らします                                       |
+| <code>.</code> | ポインターのセルで示された文字を出力します                                       |
+| <code>,</code> | 文字を入力し、ポインタのセルに格納します                                        |
+| <code>\[</code> | ポインタの下のセルが 0 の場合、一致する <code>]</code> をジャンプします      |
 | <code>]</code> | ポインタの下のセルがゼロでない場合、一致する <code>\[</code> にジャンプして戻ります |
 
 セルのサイズに制限はありません。メモリに制限があるかどうかに関わらず、EOF (*E*nd-*O*-*F*ile) のサポートは任意です。
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
index 02e9e1d9670..98a952b9388 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
@@ -1,7 +1,7 @@
 ---
 id: 598eea87e5cf4b116c3ff81a
 title: メルセンヌ数の因数
-challengeType: 5
+challengeType: 1
 forumTopicId: 302264
 dashedName: factors-of-a-mersenne-number
 ---
@@ -12,7 +12,7 @@ dashedName: factors-of-a-mersenne-number
 
 `P` が素数の場合、メルセンヌ数はメルセンヌの素数である場合があります。 ( `P` が素数でない場合、メルセンヌ数も素数ではありません。)
 
-メルセンヌ素数を求めるには、長い時間を要する可能性がある [Lucas-Lehmer test](https://rosettacode.org/wiki/Lucas-Lehmer test "Lucas-Lehmer test") を開始する前に、小さな因数を見つけることによって指数を除去することをお勧めします。
+In the search for Mersenne prime numbers it is advantageous to eliminate exponents by finding a small factor before starting a, potentially lengthy, <a href="https://rosettacode.org/wiki/Lucas-Lehmer test" target="_blank" rel="noopener noreferrer nofollow">Lucas-Lehmer test</a>.
 
 数字が <code>2<sup>P</sup>-1</code> を割るかどうか (すなわち、<code>2<sup>P</sup> mod (the number) = 1</code> となるかどうか) を判定するのに適した非常に効率的なアルゴリズムがあります。
 
@@ -48,7 +48,7 @@ square        top bit  multiply by 2  mod 47
 
 <code>2<sup>P</sup>-1</code> の因数 `q` は `2kP+1`の形を取り、`k` は正の整数またはゼロです。 さらに、`q` は `1` または `7 mod 8` です。
 
-最後に、潜在的因数 `q` は [素数](https://rosettacode.org/wiki/Primality by Trial Division "Primality by Trial Division") でなければなりません。
+Finally any potential factor `q` must be <a href="https://rosettacode.org/wiki/Primality_by_trial_division" target="_blank" rel="noopener noreferrer nofollow">prime</a>.
 
 他の試行徐算アルゴリズムと同様に、アルゴリズムは `2kP+1 > sqrt(N)`となった場合に停止します。これらのテストは、`P` が素数である場合に、メルセンヌ数に対してのみ働きます。 例えば、<code>M<sub>4</sub>=15</code> はこれらの手法で因数を生成しません。3と5を考えると、いずれも`2kP+1`に適合しません。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/farey-sequence.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/farey-sequence.md
index fae81ca57f1..d8526c2ddf6 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/farey-sequence.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/farey-sequence.md
@@ -1,14 +1,14 @@
 ---
 id: 59c3ec9f15068017c96eb8a3
 title: ファレイ数列
-challengeType: 5
+challengeType: 1
 forumTopicId: 302266
 dashedName: farey-sequence
 ---
 
 # --description--
 
-位数 `n` の [ファレイ数列](https://en.wikipedia.org/wiki/Farey sequence "wp: Farey sequence") <code>F<sub>n</sub></code> は、`0` から `1` の間の既約分数の数列であり、`n` 以下の分母を持ち、昇順に並べられます。
+The Farey sequence <code>F<sub>n</sub></code> of order `n` is the sequence of completely reduced fractions between `0` and `1` which, when in lowest terms, have denominators less than or equal to `n`, arranged in order of increasing size.
 
 *ファレイ数列* は、 間違って *ファレイseries* と呼ばれることがあります。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md
index a52a963b11d..8580cdcfce8 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md
@@ -1,14 +1,14 @@
 ---
 id: 598eef80ba501f1268170e1e
 title: フィボナッチ n-ステップ 数列
-challengeType: 5
+challengeType: 1
 forumTopicId: 302267
 dashedName: fibonacci-n-step-number-sequences
 ---
 
 # --description--
 
-これらは、通常の[フィボナッチ数列](https://rosettacode.org/wiki/Fibonacci sequence "Fibonacci sequence") を応用したものです。
+These number series are an expansion of the ordinary Fibonacci sequence where:
 
 <ol>
   <li>$n = 2$ の場合、初期値が$[1, 1]$ と $F_k^2 = F_{k-1}^2 + F_{k-2}^2$ であるフィボナッチ数列となります。</li>
@@ -17,7 +17,7 @@ dashedName: fibonacci-n-step-number-sequences
   <li>通常の $n>2$ の場合は、フィボナッチ $n$-ステップ数列 - $F_k^n$となります。初期値は、$(n-1)$'th フィボナッチ $n$-ステップ数列 $F_k^{n-1}$ の最初の $n$ 値で、$n$ 番目の数列の $k$' 番目の値は、$F_k^n = \sum_{i=1}^{(n)} {F_{k-i}^{(n)}}$です。</li>
 </ol>
 
-$n$ が小さい値の場合、[ギリシャ語の数を表す接頭辞](https://en.wikipedia.org/wiki/Number prefix#Greek_series "wp: Number prefix#Greek_series") が各列の名前を付けるのに使用されることがあります。
+For small values of $n$, Greek numeric prefixes are sometimes used to individually name each series.
 
 フィボナッチ $n$-ステップ 数列:
 
@@ -33,7 +33,7 @@ $n$ が小さい値の場合、[ギリシャ語の数を表す接頭辞](https:/
 | 9   | ノナナッチ  | 1 1 2 4 8 16 32 64 128 256 511 1021 2040 4076 8144 ... |
 | 10  | デカナッチ  | 1 1 2 4 8 16 32 64 128 256 512 1023 2045 4088 8172 ... |
 
-類似の数列は、初期値が変更された場合に生成されます。[ルーカスシリーズ](https://en.wikipedia.org/wiki/Lucas number "wp: Lucas number") は $n=2$ のフィボナッチシリーズのように先行する2つの値を合計しますが、$\[2, 1]$ を初期値として使用します。
+Allied sequences can be generated where the initial values are changed: The Lucas series sums the two preceding values like the fibonacci series for $n=2$ but uses $\[2, 1]$ as its initial values.
 
 # --instructions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/fibonacci-word.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/fibonacci-word.md
index 4f7d71e91be..05744fd83d9 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/fibonacci-word.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/fibonacci-word.md
@@ -1,14 +1,14 @@
 ---
 id: 5992e222d397f00d21122931
 title: フィボナッチ列
-challengeType: 5
+challengeType: 1
 forumTopicId: 302269
 dashedName: fibonacci-word
 ---
 
 # --description--
 
-[文書で説明されているように](https://hal.archives-ouvertes.fr/docs/00/36/79/72/PDF/The_Fibonacci_word_fractal.pdf)、フィボナッチ列は、フィボナッチ数列と類似した方法で作成されます。
+The Fibonacci Word Sequence may be created in a manner analogous to the Fibonacci Sequence, but it focuses on iterating concatenation.
 
 <pre>F_Word<sub>1</sub> を <strong>1</strong> と定義します
 F_Word<sub>2</sub> を <strong>0</strong> と定義します
@@ -16,28 +16,36 @@ F_Word<sub>3</sub> を F_Word <sub>1</sub> と結びついた F_Word<sub>2</sub>
 F_Word<sub>n</sub> を F_word <sub>n-2</sub> と結びついた F_Word<sub>n-1</sub> として作成します
 </pre>
 
+このチャレンジでは、<a href="https://www.freecodecamp.org/japanese/learn/coding-interview-prep/rosetta-code/entropy" target="_blank" rel="noopener noreferrer nofollow">こちらのロゼッタコードのチャレンジで説明されている</a>エントロピーの計算が必要です。
+
 # --instructions--
 
-`n` までのフィボナッチ列を返す関数を作成します。 関数のパラメータとして `n` が与えられます。 この関数はオブジェクトの配列を返します。 オブジェクトは `{ N: 1, Length: 1, Entropy: 0, Word: '1' }` の形式である必要があります。
+Write a function to return the first `n` Fibonacci Words. The number of `n` is provided as a parameter to the function. The function should return an array of objects. The objects should be of the form: `{ N: 1, Length: 1, Entropy: 0, Word: '1' }`. `Entropy` is computed for the string `Word` and rounded to 8 decimal digits of accuracy. Note that the indices of this sequence start at `1`.
 
 # --hints--
 
-`fibWord` という関数です。
+`fibWord` should be a function.
 
 ```js
 assert(typeof fibWord === 'function');
 ```
 
-`fibWord(5)` は配列を返します。
+`fibWord(5)` should return an array.
 
 ```js
 assert(Array.isArray(fibWord(5)));
 ```
 
-`fibWord(5)` は `[{ N:1, Length:1, Entropy:0, Word:"1" },{ N:2, Length:1, Entropy:0, Word:"0" },{ N:3, Length:2, Entropy:1, Word:"01" },{ N:4, Length:3, Entropy:0.9182958340544896, Word:"010" },{ N:5, Length:5, Entropy:0.9709505944546688, Word:"01001" }]` を返します。
+`fibWord(5)` should return `[{ N:1, Length:1, Entropy:0, Word:"1" },{ N:2, Length:1, Entropy:0, Word:"0" },{ N:3, Length:2, Entropy:1, Word:"01" },{ N:4, Length:3, Entropy:0.91829583, Word:"010" },{ N:5, Length:5, Entropy:0.97095059, Word:"01001" }]`.
 
 ```js
-assert.deepEqual(fibWord(5), ans);
+assert.deepEqual(fibWord(5), words5);
+```
+
+`fibWord(7)` should return `[{ N:1, Length:1, Entropy:0, Word:"1" },{ N:2, Length:1, Entropy:0, Word:"0" },{ N:3, Length:2, Entropy:1, Word:"01" },{ N:4, Length:3, Entropy:0.91829583, Word:"010" },{ N:5, Length:5, Entropy:0.97095059, Word:"01001" }, { N:6, Length:8, Entropy:0.954434, Word:'01001010' }, { N:7, Length:13, Entropy:0.9612366, Word:'0100101001001' }]`.
+
+```js
+assert.deepEqual(fibWord(7), words7);
 ```
 
 # --seed--
@@ -45,15 +53,23 @@ assert.deepEqual(fibWord(5), ans);
 ## --after-user-code--
 
 ```js
-let ans=[ { N: 1, Length: 1, Entropy: 0, Word: '1' },
-
+const words5 = [
+  { N: 1, Length: 1, Entropy: 0, Word: '1' },
   { N: 2, Length: 1, Entropy: 0, Word: '0' },
-
   { N: 3, Length: 2, Entropy: 1, Word: '01' },
+  { N: 4, Length: 3, Entropy: 0.91829583, Word: '010' },
+  { N: 5, Length: 5, Entropy: 0.97095059, Word: '01001' }
+];
 
-  { N: 4, Length: 3, Entropy: 0.9182958340544896, Word: '010' },
-
-  { N: 5, Length: 5, Entropy: 0.9709505944546688, Word: '01001' }];
+const words7 = [
+  { N: 1, Length: 1, Entropy: 0, Word: '1' },
+  { N: 2, Length: 1, Entropy: 0, Word: '0' },
+  { N: 3, Length: 2, Entropy: 1, Word: '01' },
+  { N: 4, Length: 3, Entropy: 0.91829583, Word: '010' },
+  { N: 5, Length: 5, Entropy: 0.97095059, Word: '01001' },
+  { N: 6, Length: 8, Entropy: 0.954434, Word: '01001010' },
+  { N: 7, Length: 13, Entropy: 0.9612366, Word: '0100101001001' }
+];
 ```
 
 ## --seed-contents--
@@ -67,55 +83,33 @@ function fibWord(n) {
 # --solutions--
 
 ```js
+// Round to digits
+function roundFloat(num, digits) {
+  return Math.round(num * 10.0**digits) / (10.0**digits);
+}
+
+// Entropy calculation for string with only 0 and 1
+function entropy(word) {
+  function digitEntropy(count) {
+    return count < 1 ? 0
+      : - count / word.length * Math.log2(count / word.length);
+  }
+  const numZeros = word.split('').filter(e => e === '0').length;
+  const numOnes  = word.length - numZeros;
+  return roundFloat(digitEntropy(numZeros) + digitEntropy(numOnes), 8);
+}
+
+// Compute array of Fibonacci words
 function fibWord(n) {
-    function entropy(s) {
-         //create an object containing each individual char
-      //and the amount of iterations per char
-        function prob(s) {
-            var h = Object.create(null);
-            s.split('').forEach(function(c) {
-               h[c] && h[c]++ || (h[c] = 1);
-            });
-            return h;
-        }
-
-        s = s.toString(); //just in case
-        var e = 0, l = s.length, h = prob(s);
-
-        for (var i in h ) {
-            var p = h[i]/l;
-            e -= p * Math.log(p) / Math.log(2);
-        }
-        return e;
-    }
-    var wOne = "1", wTwo = "0", wNth = [wOne, wTwo], w = "", o = [];
-
-    for (var i = 0; i < n; i++) {
-        if (i === 0 || i === 1) {
-            w = wNth[i];
-        } else {
-            w = wNth[i - 1] + wNth[i - 2];
-            wNth.push(w);
-        }
-        var l = w.length;
-        var e = entropy(w);
-
-        if (l <= 21) {
-            o.push({
-                N: i + 1,
-                Length: l,
-                Entropy: e,
-                Word: w
-            });
-        } else {
-            o.push({
-                N: i + 1,
-                Length: l,
-                Entropy: e,
-                Word: "..."
-            });
-        }
-    }
-  return o;
+  return [...Array(n).keys()]
+    .reduce((words, i) => {
+      const word = i === 0 ? "1"
+                 : i === 1 ? "0"
+                 : words[i - 1].Word + words[i - 2].Word;
+      words.push(
+        { N: i + 1, Length: word.length, Entropy: entropy(word), Word: word }
+      );
+      return words;
+    }, []);
 }
 ```
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/fractran.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/fractran.md
index 066c055a8f9..257dcea34fd 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/fractran.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/fractran.md
@@ -1,14 +1,14 @@
 ---
 id: 5a7dad05be01840e1778a0d1
 title: FRACTRAN
-challengeType: 5
+challengeType: 1
 forumTopicId: 302270
 dashedName: fractran
 ---
 
 # --description--
 
-[FRACTRAN](https://en.wikipedia.org/wiki/FRACTRAN "wp: FRACTRAN") は、数学者 [ジョン・ホートン・コンウェイ](https://en.wikipedia.org/wiki/John Horton Conway "wp: John Horton Conway") 氏によって発明されたチューリング完全で難解なプログラミング言語です。
+FRACTRAN is a Turing-complete esoteric programming language invented by the mathematician John Horton Conway.
 
 FRACTRAN プログラムは、最初の正の整数入力 $n$ を含む、正の分数$P = (f_1, f_2, \\ldots, f_m)$の順序付きリストです。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/gamma-function.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/gamma-function.md
index 4c7c508dc24..deba39c32f4 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/gamma-function.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/gamma-function.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7e76
 title: ガンマ関数
-challengeType: 5
+challengeType: 1
 forumTopicId: 302271
 dashedName: gamma-function
 ---
 
 # --description--
 
-1 つのアルゴリズム (またはそれ以上) を実装して、 [ガンマ](https://en.wikipedia.org/wiki/Gamma function) ($\\Gamma$) 関数を計算します(実体においてのみ)。
+Implement one algorithm (or more) to compute the Gamma function (in the real field only).
 
 ガンマ関数は次のように定義できます。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md
index b46219f7e78..8f2fa8329d2 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7e78
 title: 一般的な FizzBuzz プログラム
-challengeType: 5
+challengeType: 1
 forumTopicId: 302273
 dashedName: general-fizzbuzz
 ---
 
 # --description--
 
-[FizzBuzz](https://rosettacode.org/wiki/FizzBuzz) プログラムの一般化されたバージョンを記述します。このバージョンは、倍数と単語を含むあらゆるリストに適しています。
+Write a generalized version of <a href="https://rosettacode.org/wiki/FizzBuzz" target="_blank" rel="noopener noreferrer nofollow">FizzBuzz</a> that works for any list of factors, along with their words.
 
 これは基本的に、このゲームのルールをユーザーに提供する "fizzbuzz" 実装です。 これを実装する関数を作成します。 この関数は 2 つのパラメーターを取得する必要があります。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/gray-code.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/gray-code.md
index c3875f4d4bf..8c69e73363d 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/gray-code.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/gray-code.md
@@ -1,18 +1,18 @@
 ---
 id: 5a23c84252665b21eecc7e80
 title: グレイコード
-challengeType: 5
+challengeType: 1
 forumTopicId: 302276
 dashedName: gray-code
 ---
 
 # --description--
 
-[グレイコード](https://en.wikipedia.org/wiki/Gray code)はバイナリエンコーディングの一形態で、連続する数値の変化が 1 ビットのみとなっています。
+Gray code is a form of binary encoding where transitions between consecutive numbers differ by only one bit.
 
 これは、急速に変化する値を持つ場合や入力時に動作の遅いハードウェアに接続する場合に、ハードウェアのデータハザードを減少させるのに役立つエンコーディングです。
 
-また、 [カルノー図](https://en.wikipedia.org/wiki/Karnaugh map) への入力を左から右へ、または上から下へと順に生成するのにも便利です。
+It is also useful for generating inputs for Karnaugh maps in order from left to right or top to bottom.
 
 # --instructions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/happy-numbers.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/happy-numbers.md
index 6cd487efe5e..ab7d0377a7f 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/happy-numbers.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/happy-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 594810f028c0303b75339ad1
 title: ハッピー数
-challengeType: 5
+challengeType: 1
 forumTopicId: 302280
 dashedName: happy-numbers
 ---
 
 # --description--
 
-[ハッピー数](https://en.wikipedia.org/wiki/Happy_number) は次のプロセスで定義されます。
+A happy number is defined by the following process:
 
 任意の正の整数から開始して、その各桁をそれぞれ 2 乗して足した数で置き換え、この数が `1` に等しくなる (1 からは変化しない) か、`1`を含まないサイクルで無限ループするまでこのプロセスを繰り返します。 このプロセスが`1`で終わる場合の数字がハッピー数となり、`1`で終わらない場合はアンハッピー数となります。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
index 547e63c8f3a..f3df12166a8 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
@@ -1,60 +1,64 @@
 ---
 id: 595671d4d2cdc305f0d5b36f
 title: 2つの配列からハッシュを作成する
-challengeType: 5
+challengeType: 1
 forumTopicId: 302283
 dashedName: hash-from-two-arrays
 ---
 
 # --description--
 
-長さの等しい 2 つの配列を使用して、1 つの配列の要素 (キー) が他方の要素 (値) にリンクしているハッシュオブジェクトを作成します。
+Given two arrays, create a hash object where the elements from one array (the keys) are linked to the elements of the other (the values).
 
-**関連タスク:**
+Example:
 
-<ul>
-  <li><a href='https://rosettacode.org/wiki/Associative arrays/Creation' title='連想配列/作成' target='_blank'>連想配列/作成</a></li>
-</ul>
+```js
+const firstArr = [1, 2, 3];
+const secondArr = ["a", "b", "c"];
+const hashObj = arrToObj(firstArr, secondArr);
+```
+
+The hash object created from the arrays above will be `{1: "a", 2: "b", 3: "c"}`.
 
 # --hints--
 
-`arrToObj` は関数とします。
+`arrToObj` should be a function.
 
 ```js
 assert(typeof arrToObj === 'function');
 ```
 
-`arrToObj([1, 2, 3, 4, 5], ["a", "b", "c", "d", "e"])` は`{ 1: "a", 2: "b", 3: "c", 4: "d", 5: "e" }`を返す必要があります。
+`arrToObj([1, 2, 3, 4, 5], ["a", "b", "c", "d", "e"])` should return `{ 1: "a", 2: "b", 3: "c", 4: "d", 5: "e" }`
 
 ```js
 assert.deepEqual(arrToObj(...testCases[0]), res[0]);
 ```
 
-`arrToObj([1, 2, 3, 4, 5], ["a", "b", "c", "d"])`は`{ 1: "a", 2: "b", 3: "c", 4: "d", 5: undefined }`を返す必要があります。
+`arrToObj([1, 2, 3, 4, 5], ["a", "b", "c", "d"])` should return `{ 1: "a", 2: "b", 3: "c", 4: "d", 5: undefined }`
 
 ```js
 assert.deepEqual(arrToObj(...testCases[1]), res[1]);
 ```
 
-`arrToObj([1, 2, 3], ["a", "b", "c", "d", "e"])` は`{ 1: "a", 2: "b", 3: "c" }`を返す必要があります。
+`arrToObj([1, 2, 3], ["a", "b", "c", "d", "e"])` should return `{ 1: "a", 2: "b", 3: "c" }`
 
 ```js
 assert.deepEqual(arrToObj(...testCases[2]), res[2]);
 ```
 
-`arrToObj(["a", "b", "c", "d", "e"], [1, 2, 3, 4, 5])` は `{ "a": 1, "b": 2, "c": 3 , "d": 4, "e": 5 }`を返す必要があります。
+`arrToObj(["a", "b", "c", "d", "e"], [1, 2, 3, 4, 5])` should return `{ "a": 1, "b": 2, "c": 3 , "d": 4, "e": 5 }`
 
 ```js
 assert.deepEqual(arrToObj(...testCases[3]), res[3]);
 ```
 
-`arrToObj(["a", "b", "c", "d", "e"], [1, 2, 3, 4])` は `{ "a": 1, "b": 2, "c": 3 , "d": 4, "e": undefined }`を返す必要があります。
+`arrToObj(["a", "b", "c", "d", "e"], [1, 2, 3, 4])` should return `{ "a": 1, "b": 2, "c": 3 , "d": 4, "e": undefined }`
 
 ```js
 assert.deepEqual(arrToObj(...testCases[4]), res[4]);
 ```
 
-`arrToObj(["a", "b", "c"], [1, 2, 3, 4, 5])` は`{ "a": 1, "b": 2, "c": 3 }`を返す必要があります。
+`arrToObj(["a", "b", "c"], [1, 2, 3, 4, 5])` should return `{ "a": 1, "b": 2, "c": 3 }`
 
 ```js
 assert.deepEqual(arrToObj(...testCases[5]), res[5]);
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/hash-join.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/hash-join.md
index e1cc901fbdb..ce3bba7a5d0 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/hash-join.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/hash-join.md
@@ -1,19 +1,19 @@
 ---
 id: 5956795bc9e2c415eb244de1
 title: ハッシュ結合 (hash join)
-challengeType: 5
+challengeType: 1
 forumTopicId: 302284
 dashedName: hash-join
 ---
 
 # --description--
 
-[内部結合 (inner join)](https://www.freecodecamp.org/news/sql-join-types-inner-join-vs-outer-join-example/#how-to-use-an-inner-join-in-sql "news: SQL Join Types – Inner Join VS Outer Join Example#How to Use an INNER JOIN in SQL") は、一致している列の値に基づいて、2つのデータテーブルを1つのテーブルに結合する操作です。 この操作を実行する最も簡単な方法は、 [nested loop join](https://en.wikipedia.org/wiki/Nested loop join "wp: Nested loop join") アルゴリズムを使用する方法ですが、 よりスケーラブルな代替方法として、[hash join](https://en.wikipedia.org/wiki/hash join "wp: hash join") アルゴリズムを使用する方法が挙げられます。
+An inner join is an operation that combines two data tables into one table, based on matching column values. The simplest way of implementing this operation is the nested loop join algorithm, but a more scalable alternative is the hash join algorithm.
 
 「hash join」アルゴリズムは次の 2 つのステップで構成されています。
 
 <ol>
-  <li><strong>Hash phase:</strong> 2つのテーブルのいずれかから <a href='https://en.wikipedia.org/wiki/Multimap' title='wp: Multimap' target='_blank'>multimap</a> を作成し、 各結合列の値をそれを含むすべての行にマッピングします。</li>
+  <li><strong>Hash phase:</strong> Create a multimap from one of the two tables, mapping from each join column value to all the rows that contain it.</li>
   <ul>
     <li>multimapは単純な線形探索よりもスケーラブルなハッシュベースの探索をサポートする必要があります。それこそが、このアルゴリズムの肝要な点だからです。</li>
     <li>理想としては、小さい方のテーブルのmultimapを作成することを推奨します。これにより、作成時間とメモリサイズを最小化できます。</li>
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/heronian-triangles.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/heronian-triangles.md
index ee6c7d97680..aed0c05f8c6 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/heronian-triangles.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/heronian-triangles.md
@@ -1,14 +1,14 @@
 ---
 id: 595b98f8b5a2245e243aa831
 title: ヘロンの三角形
-challengeType: 5
+challengeType: 1
 forumTopicId: 302285
 dashedName: heronian-triangles
 ---
 
 # --description--
 
-三角形の面積についての[ヘロンの公式](https://en.wikipedia.org/wiki/Heron's formula "wp: Heron's formula")は、3辺の長さが `a`、`b`、`c` である場合、以下のとおりです。
+Hero's formula for the area of a triangle given the length of its three sides `a`, `b`, and `c` is given by:
 
 $A = \\sqrt{s(s-a)(s-b)(s-c)},$
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
index 78eba78eabb..27cec723ef6 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
@@ -1,113 +1,105 @@
 ---
 id: 59622f89e4e137560018a40e
 title: ホフスタッターフィギュア-フィギュア数列 (Hofstadter Figure-Figure sequences)
-challengeType: 5
+challengeType: 1
 forumTopicId: 302286
 dashedName: hofstadter-figure-figure-sequences
 ---
 
 # --description--
 
-この正の整数の2つの数列は次のように定義されます。
+The Hofstadter Figure-Figure sequences $R_n$ and $S_n$ are given by
 
-$R(1)=1\\ ;\\ S(1)=2 \\\\R(n)=R(n-1)+S(n-1), \\quad n>1.$
+$R_1 = 1\\ ;\\ S_1 = 2 \\\\R_n = R_{n-1} + S_{n-1}, \\quad n>1.$
 
-数列 $S(n)$ は $R(n)$ に存在しない正の整数の数列としてさらに定義されます。
-
-数列 $R$ は次のように始まります:
+Specifically, the sequence $R_n$ contains the values
 
 <pre>1, 3, 7, 12, 18, ...</pre>
 
-数列 $S$ は次のように始まります:
+and the sequence $S_n$ contains the values
 
 <pre>2, 4, 5, 6, 8, ...</pre>
 
+The sequence $R_n$ is defined by the recurrence relation $R_n = R_{n-1} + S_{n-1}$, while $S_n$ is defined as sequence of positive integers that are not included in the sequence $R_n$.
+
 # --instructions--
 
-`n` を与えられると、それぞれ `R(n)` または`S(n)` を返す、`ffr` と `ffs` という名前の2つの関数を作成してください。 （オフバイワンエラーを避けるために、R(1) = 1であり、 S(1) = 2 であることに注意してください。）
+Create two functions named `ffr` and `ffs` that return `R(n)` or `S(n)`, respectively, for any index `n`. Note that the Hofstadter Figure-Figure sequences are 1-indexed, with $R_1 = 1$ and $S_1 = 2$.
 
 `n` の最大値は仮定しないものとします。
 
-**参照**
+**参照**<p>Rosetta: <a href='https://rosettacode.org/wiki/Hofstadter_Figure-Figure_sequences' target='_blank'>Hofstadter Figure-Figure sequences</a></p>.
 
-<ul>
-  <li>
-    Sloaneの<a href='https://oeis.org/A005228' target='_blank'>A005228</a> と <a href='https://oeis.org/A030124' target='_blank'>A030124</a>
-  </li>
-  <li>
-    Wikipedia: <a href='https://en.wikipedia.org/wiki/Hofstadter_sequence#Hofstadter_Figure-Figure_sequences' title='wp: Hofstadter_sequence#Hofstadter_Figure-Figure_sequences' target='_blank'>Hofstadter Figure-Figure sequences</a>.
-  </li>
-</ul>
 
 # --hints--
 
-`ffr` は関数とします。
+`ffr` should be a function.
 
 ```js
 assert(typeof ffr === 'function');
 ```
 
-`ffs` は関数とします。
+`ffs` should be a function.
 
 ```js
 assert(typeof ffs === 'function');
 ```
 
-`ffr` は整数を返す必要があります。
+`ffr` should return integer.
 
 ```js
 assert(Number.isInteger(ffr(1)));
 ```
 
-`ffs` は整数を返す必要があります。
+`ffs` should return integer.
 
 ```js
 assert(Number.isInteger(ffs(1)));
 ```
 
-`ffr(10)` は`69`を返す必要があります。
+`ffr(10)` should return `69`
 
 ```js
 assert.equal(ffr(ffrParamRes[0][0]), ffrParamRes[0][1]);
 ```
 
-`ffr(50)` は`1509`を返す必要があります。
+`ffr(50)` should return `1509`
 
 ```js
 assert.equal(ffr(ffrParamRes[1][0]), ffrParamRes[1][1]);
 ```
 
-`ffr(100)` は`5764`を返す必要があります。
+`ffr(100)` should return `5764`
 
 ```js
 assert.equal(ffr(ffrParamRes[2][0]), ffrParamRes[2][1]);
 ```
 
-`ffr(1000)` は`526334`を返す必要があります。
+`ffr(1000)` should return `526334`
 
 ```js
 assert.equal(ffr(ffrParamRes[3][0]), ffrParamRes[3][1]);
 ```
 
-`ffs(10)` は`14`を返す必要があります。
+`ffs(10)` should return `14`
 
 ```js
 assert.equal(ffs(ffsParamRes[0][0]), ffsParamRes[0][1]);
 ```
 
-`ffs(50)` は `59`を返す必要があります。
+`ffs(50)` should return `59`
 
 ```js
 assert.equal(ffs(ffsParamRes[1][0]), ffsParamRes[1][1]);
 ```
 
-`ffs(100)` は `112`を返す必要があります。
+`ffs(100)` should return `112`
 
 ```js
 assert.equal(ffs(ffsParamRes[2][0]), ffsParamRes[2][1]);
 ```
 
-`ffs(1000)` は`1041`を返す必要があります。
+`ffs(1000)` should return `1041`
 
 ```js
 assert.equal(ffs(ffsParamRes[3][0]), ffsParamRes[3][1]);
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
index d01348cc060..ae88edd0b86 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
@@ -1,18 +1,18 @@
 ---
 id: 59637c4d89f6786115efd814
 title: ホフスタッター Q 数列
-challengeType: 5
+challengeType: 1
 forumTopicId: 302287
 dashedName: hofstadter-q-sequence
 ---
 
 # --description--
 
-[ホフスタッター Q 数列](https://en.wikipedia.org/wiki/Hofstadter_sequence#Hofstadter_Q_sequence "wp: Hofstadter_sequence#Hofstadter_Q_sequence") は次のように定義されます。
+The Hofstadter Q sequence is defined as:
 
 $Q(1)=Q(2)=1, \\\\ Q(n)=Q\\big(n-Q(n-1)\\big)+Q\\big(n-Q(n-2)), \\quad n>2.$
 
-これは [フィボナッチ数列](https://rosettacode.org/wiki/Fibonacci sequence "Fibonacci sequence")に似た定義ですが、 フィボナッチ数列の次の項が前の2つの項の合計であるのに対し、 Q数列では、前の2つの項は、次の項を作成するために合計する2つの数字を見つけるためにQ数列内で戻る距離を示しています。
+It is defined like the Fibonacci sequence, but whereas the next term in the Fibonacci sequence is the sum of the previous two terms, in the Q sequence the previous two terms tell you how far to go back in the Q sequence to find the two numbers to sum to make the next term of the sequence.
 
 # --instructions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md
index ec49853b910..85585fb8374 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7eb0
 title: I before E except after C
-challengeType: 5
+challengeType: 1
 forumTopicId: 302288
 dashedName: i-before-e-except-after-c
 ---
 
 # --description--
 
-["I before E, except after C"](https://en.wikipedia.org/wiki/I before E except after C) は広く知られているニーモニック (覚え歌) で、英単語を綴る場合に役立つものです。
+**<a href="http://www.rosettacode.org/wiki/I_before_E_except_after_C" target="_blank" rel="noopener noreferrer nofollow">"I before E, except after C"</a>** is a general rule for English language spelling. If one is unsure whether a word is spelled with the digraph `ei` or `ie`, the rhyme suggests that the correct order is `ie` unless the preceding letter is `c`, in which case it may be `ei`.
 
 与えられた単語を使用して、フレーズの2つの従属節がそれぞれ妥当かどうかを確認します。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/iban.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/iban.md
index 290e14b3542..41a9a2dd77f 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/iban.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/iban.md
@@ -1,19 +1,19 @@
 ---
 id: 5a23c84252665b21eecc7eaf
 title: IBAN（国際銀行口座番号）
-challengeType: 5
+challengeType: 1
 forumTopicId: 302289
 dashedName: iban
 ---
 
 # --description--
 
-[International Bank Account Number (IBAN)](https://en.wikipedia.org/wiki/International_Bank_Account_Number) は、国境を越えて銀行口座を特定する国際的に合意された手段であり、 [transcription errors](https://en.wikipedia.org/wiki/Transcription_error) を起こすリスクを減少させます。
+The International Bank Account Number (IBAN) is an internationally agreed means of identifying bank accounts across national borders with a reduced risk of propagating transcription errors.
 
-IBANは最大で英数字34文字からなります。
+The <abbr title="International Bank Account Number">IBAN</abbr> consists of up to 34 alphanumeric characters:
 
 <ul>
-  <li>最初の2文字は、ISO 3166-1 alpha-2 の国コードです。</li>
+  <li>first the two-letter <abbr title="International Organization for Standardization">ISO</abbr> 3166-1 alpha-2 country code</li>
   <li>続いて 2 桁のチェックデジット、</li>
   <li>最後に、国ごとの基本銀行口座番号 (BBAN) となっています。</li>
 </ul>
@@ -95,10 +95,10 @@ function isValid(iban) {
     iban = __helpers.removeWhiteSpace(iban)
     if (!iban.match(/^[\dA-Z]+$/)) return false
     var len = iban.length
-    if (len != ibanLen[iban.substr(0,2)]) return false
-    iban = iban.substr(4) + iban.substr(0,4)
+    if (len != ibanLen[iban.substring(0,2)]) return false
+    iban = iban.substring(4) + iban.substring(0,4)
     for (var s='', i=0; i<len; i+=1) s+=parseInt(iban.charAt(i),36)
-    for (var m=s.substr(0,15)%97, s=s.substr(15); s; s=s.substr(13)) m=(m+s.substr(0,13))%97
+    for (var m=s.substring(0,15)%97, s=s.substring(15); s; s=s.substring(13)) m=(m+s.substring(0,13))%97
     return m == 1
 }
 ```
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/jortsort.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/jortsort.md
index 220611c1b07..df2180725e9 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/jortsort.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/jortsort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7ec4
 title: JortSort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302293
 dashedName: jortsort
 ---
 
 # --description--
 
-jortSortは、ユーザーがソート作業に使用するソート用ツールセットで、ソート作業をやり直さずにすむよう効率性を保証します。 もとは権威ある [JSConf](https://www.youtube.com/watch?v=pj4U_W0OFoE) においてJenn "Moneydollars" Schiffer によって提唱されました。
+jortSortは、ユーザーがソート作業に使用するソート用ツールセットで、ソート作業をやり直さずにすむよう効率性を保証します。 It was originally presented by Jenn "Moneydollars" Schiffer at the prestigious JSConf2014.
 
 jortSort は、比較可能なオブジェクトの単一の配列を引数として取る関数とします。 その後、配列を昇順にソートし、ソートされた配列を元の配列と比較します。 配列が一致する (つまり、元の配列がすでにソートされていた) 場合、関数は true を返します。 配列が一致しない (つまり、元の配列がソートされていなかった) 場合、関数は false を返します。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/josephus-problem.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/josephus-problem.md
index fa80c290bc2..1fc8ff2c845 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/josephus-problem.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/josephus-problem.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7ec5
 title: ヨセフスの問題
-challengeType: 5
+challengeType: 1
 forumTopicId: 302294
 dashedName: josephus-problem
 ---
 
 # --description--
 
-[ヨセフスの問題](https://en.wikipedia.org/wiki/Josephus problem) とは、次のような恐ろしい描写付きの数学パズルです。$n$ 人の囚人が円状に立っており、$0$ から順に $n-1$ まで番号が付けられています。
+Josephus problem is a math puzzle with a grim description: $n$ prisoners are standing on a circle, sequentially numbered from $0$ to $n-1$.
 
 死刑執行人が円の周囲を歩きながら、囚人 $0$ から始め、$k$ 番目ごとに囚人を処刑していきます。
 
@@ -26,7 +26,7 @@ dashedName: josephus-problem
 
 # --instructions--
 
-囚人の最初の数と「k」をパラメータとして取り、生き残った囚人の番号を返す関数を記述してください。
+Write a function that takes the initial number of prisoners and `k` as parameters and returns the number of the prisoner that survives.
 
 # --hints--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md
index 4ed3cea6e99..a9530253310 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7eca
 title: カプレカ数
-challengeType: 5
+challengeType: 1
 forumTopicId: 302296
 dashedName: kaprekar-numbers
 ---
 
 # --description--
 
-正の整数は以下の場合、[カプレカ数](https://en.wikipedia.org/wiki/Kaprekar number) となります。
+A positive integer is a Kaprekar number if:
 
 <ul>
   <li>1 である、または</li>
@@ -21,7 +21,7 @@ dashedName: kaprekar-numbers
 
 <ul>
   <li><code>2223</code> は以下のとおりカプレカ数です。<code>2223 * 2223 = 4941729</code> であり、<code>4941729</code> が <code>494</code> と <code>1729</code> に分割でき、かつ <code>494 + 1729 = 2223</code> となります。</li>
-  <li>カプレカ数の数列は <a href='https://oeis.org/A006886' target='_blank'>A006886</a> として知られており、<code>1, 9, 45, 55, ...</code> で始まります。</li>
+  <li>The series of Kaprekar numbers is known as A006886, and begins as <code>1, 9, 45, 55, ...</code></li>
 </ul>
 
 # --instructions--
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/knights-tour.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/knights-tour.md
index 6b5c40aa499..d359b2c5fe5 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/knights-tour.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/knights-tour.md
@@ -1,18 +1,18 @@
 ---
 id: 5a23c84252665b21eecc7ed5
 title: ナイトツアー
-challengeType: 5
+challengeType: 1
 forumTopicId: 302297
 dashedName: knights-tour
 ---
 
 # --description--
 
-[ナイトツアー](https://en.wikipedia.org/wiki/Knight%27s_tour)の問題: 空の `w` \* `h` のチェスボードがあり、その上の任意のマスに 1 つのナイトの駒が置いてあります。 ナイトは一連のルールに従って動き、チェスボード上のすべてのマスを 1 度だけ訪れなければなりません。 ツアーを「終了する」必要は*ない*ことに注意してください。つまり、ナイトは開始地点の一手以内を終了地点にする必要はありません。
+Knight's Tour Problem: You have an empty `width` \* `height` chessboard, but for a single knight on some square. ナイトは一連のルールに従って動き、チェスボード上のすべてのマスを 1 度だけ訪れなければなりません。 ツアーを「終了する」必要は*ない*ことに注意してください。つまり、ナイトは開始地点の一手以内を終了地点にする必要はありません。
 
 # --instructions--
 
-パラメータとして `w` と `h` を取る関数を記述し、上記のタスクの達成が可能な開始位置の数値を返してください。
+Write a function that takes `width` and `height` as parameters and returns the number of initial positions from where it is possible to achieve the task stated above.
 
 # --hints--
 
@@ -63,7 +63,7 @@ assert.equal(knightTour(8, 6), 48);
 ## --seed-contents--
 
 ```js
-function knightTour(w, h) {
+function knightTour(width, height) {
 
 }
 ```
@@ -71,7 +71,7 @@ function knightTour(w, h) {
 # --solutions--
 
 ```js
-function knightTour(w, h) {
+function knightTour(width, height) {
   function createBoards(rows, columns) {
     const board = [];
     const visited = [];
@@ -210,11 +210,11 @@ function knightTour(w, h) {
     [1, -2]
   ];
 
-  const [baseBoard, baseVisited] = createBoards(h, w);
+  const [baseBoard, baseVisited] = createBoards(height, width);
   fillAllowedMovesCounts(baseBoard);
   let solvedCount = 0;
-  for (let row = 0; row < h; row++) {
-    for (let column = 0; column < w; column++) {
+  for (let row = 0; row < height; row++) {
+    for (let column = 0; column < width; column++) {
       if (solveStart(baseBoard, baseVisited, row, column)) {
         solvedCount++;
       }
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/least-common-multiple.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/least-common-multiple.md
index e1d12516b73..1fa66c2b5b6 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/least-common-multiple.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/least-common-multiple.md
@@ -1,58 +1,60 @@
 ---
 id: 5a23c84252665b21eecc7edf
 title: 最小公倍数
-challengeType: 5
+challengeType: 1
 forumTopicId: 302301
 dashedName: least-common-multiple
 ---
 
 # --description--
 
-12 と 18 の最小公倍数は 36 です。なぜなら、12 は倍数 (12×3 = 36) そして 18 は倍数 (18×2=36) を持ち、36 より小さい両方の倍数となる正の整数はないからです。 特殊なケースとして、 *m* または *n* がゼロの場合、最小公倍数はゼロになります。 最小公倍数を計算する 1 つの方法は、*m* のすべての倍数を、*n* の倍数でもあるものが見つかるまで繰り返すことです。 [最大公約数](https://rosettacode.org/wiki/greatest common divisor) の *gcd* がすでにある場合、以下の公式で *lcm* を計算します。 ( \\operatorname{lcm}(m, n) = \\frac{|m \\times n|}{\\operatorname{gcd}(m, n)} )
+12 と 18 の最小公倍数は 36 です。なぜなら、12 は倍数 (12×3 = 36) そして 18 は倍数 (18×2=36) を持ち、36 より小さい両方の倍数となる正の整数はないからです。 As a special case, if either $m$ or $n$ is zero, then the least common multiple is zero. One way to calculate the least common multiple is to iterate all the multiples of $m$, until you find one that is also a multiple of $n$. If you already have $gcd$ for <a href="https://rosettacode.org/wiki/Greatest_common_divisor" target="_blank" rel="noopener noreferrer nofollow">greatest common divisor</a>, then this formula calculates $lcm$.
+
+$$ \\operatorname{lcm}(m, n) = \\frac{|m \\times n|}{\\operatorname{gcd}(m, n)} $$
 
 # --instructions--
 
-整数の配列の最小公倍数を計算してください。 *m* と *n* が指定されている場合、最小公倍数は、*m* と *n* の両方の倍数を持つ最小の正の整数となります。
+Compute the least common multiple of an array of integers. Given *m* and *n*, the least common multiple is the smallest positive integer that has both *m* and *n* as factors.
 
 # --hints--
 
-`LCM` は関数とします。
+`LCM` should be a function.
 
 ```js
 assert(typeof LCM == 'function');
 ```
 
-`LCM([2, 4, 8])` は数値を返す必要があります。
+`LCM([2, 4, 8])` should return a number.
 
 ```js
 assert(typeof LCM([2, 4, 8]) == 'number');
 ```
 
-`LCM([2, 4, 8])` は `8` を返す必要があります。
+`LCM([2, 4, 8])` should return `8`.
 
 ```js
 assert.equal(LCM([2, 4, 8]), 8);
 ```
 
-`LCM([4, 8, 12])` は `24` を返す必要があります。
+`LCM([4, 8, 12])` should return `24`.
 
 ```js
 assert.equal(LCM([4, 8, 12]), 24);
 ```
 
-`LCM([3, 4, 5, 12, 40])` は `120` を返す必要があります。
+`LCM([3, 4, 5, 12, 40])` should return `120`.
 
 ```js
 assert.equal(LCM([3, 4, 5, 12, 40]), 120);
 ```
 
-`LCM([11, 33, 90])` は `990` を返す必要があります。
+`LCM([11, 33, 90])` should return `990`.
 
 ```js
 assert.equal(LCM([11, 33, 90]), 990);
 ```
 
-`LCM([-50, 25, -45, -18, 90, 447])` は `67050` を返す必要があります。
+`LCM([-50, 25, -45, -18, 90, 447])` should return `67050`.
 
 ```js
 assert.equal(LCM([-50, 25, -45, -18, 90, 447]), 67050);
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/levenshtein-distance.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/levenshtein-distance.md
index 0e0b500a4b3..eaca22650ce 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/levenshtein-distance.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/levenshtein-distance.md
@@ -1,14 +1,14 @@
 ---
 id: 5e4ce2eaac708cc68c1df260
 title: レーベンシュタイン距離
-challengeType: 5
+challengeType: 1
 forumTopicId: 385264
 dashedName: levenshtein-distance
 ---
 
 # --description--
 
-情報理論とコンピュータサイエンスでは、**レーベンシュタイン距離** は 2 つのシーケンスがどの程度異なっているかを測定するための [メトリック](https://en.wikipedia.org/wiki/string metric) です ([編集距離](https://en.wikipedia.org/wiki/edit distance)ともいう)。 2 つの文字列間のレーベンシュタイン距離は、1 つの文字の挿入、削除、置換を行うことで、1 つの文字列をもう 1 つの文字列に変換するために必要な最小編集回数として定義されます。
+In information theory and computer science, the **Levenshtein distance** is a metric for measuring the amount of difference between two sequences (i.e. an edit distance). 2 つの文字列間のレーベンシュタイン距離は、1 つの文字の挿入、削除、置換を行うことで、1 つの文字列をもう 1 つの文字列に変換するために必要な最小編集回数として定義されます。
 
 例:
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
index 3be278b6298..e1df8cdfb7d 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
@@ -1,14 +1,14 @@
 ---
 id: 5e4ce2f5ac708cc68c1df261
 title: 線形合同法
-challengeType: 5
+challengeType: 1
 forumTopicId: 385266
 dashedName: linear-congruential-generator
 ---
 
 # --description--
 
-[線形合同法](https://en.wikipedia.org/wiki/linear congruential generator) は、 [乱数発生器](http://rosettacode.org/wiki/random number generator)の非常に単純な例です。 すべての線形合同法は次の式を使用します。
+A linear congruential generator (LCG) is an <em>algorithm</em> that yields a sequence of pseudo-randomized numbers calculated with a discontinuous piecewise linear equation. すべての線形合同法は次の式を使用します。
 
 $$r_{n + 1} = (a \times r_n + c) \bmod m$$
 
@@ -22,7 +22,7 @@ $$r_{n + 1} = (a \times r_n + c) \bmod m$$
 
 $a$、$c$、および $m$ の値を慎重に選択すると、発生器は $0$ から $m -1$ までの整数の一様分布を発生させます。
 
-LCG (線形合同法) の乱数の質は低いです。 $r_n$ と $r\_{n + 1}$ には真の乱数にあるような独立性がありません。 $r_n$ を知っている人は誰でも $r\_{n + 1}$ を予測できるため、LCG は暗号的に安全ではありません。 LCG は [ミラー–ラビン素数判定法](http://rosettacode.org/wiki/Miller-Rabin primality test)や [フリーセルの駆け引き](http://rosettacode.org/wiki/deal cards for FreeCell) のようなシンプルなタスクには十分です。 LCG の利点に、同じ $r_0$ から簡単に数列を再現できることがあります。 式がとても簡単なので、このような数列を異なるプログラミング言語で再現することも可能です。
+<abbr title="linear congruential generator">LCG</abbr> numbers have poor quality. $r_n$ と $r\_{n + 1}$ には真の乱数にあるような独立性がありません。 Anyone who knows $r_n$ can predict $r\_{n + 1}$, therefore <abbr title="linear congruential generator">LCG</abbr> is not cryptographically secure. The <abbr title="linear congruential generator">LCG</abbr> is still good enough for simple tasks like Miller-Rabin primality test, or FreeCell deals. Among the benefits of the <abbr title="linear congruential generator">LCG</abbr>, one can easily reproduce a sequence of numbers, from the same $r_0$. 式がとても簡単なので、このような数列を異なるプログラミング言語で再現することも可能です。
 
 # --instructions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/long-multiplication.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/long-multiplication.md
index 62ba0d38c21..2fa51b01ead 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/long-multiplication.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/long-multiplication.md
@@ -1,14 +1,14 @@
 ---
 id: 5e4ce2a1ac708cc68c1df25d
 title: 桁数の多い数字の掛け算
-challengeType: 5
+challengeType: 1
 forumTopicId: 385269
 dashedName: long-multiplication
 ---
 
 # --description--
 
-[桁数の多い数字の掛け算](https://en.wikipedia.org/wiki/long multiplication)を明示的に実装します。
+Explicitly implement long multiplication.
 
 これは任意精度の整数代数に対するアプローチの一つです。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
index e4370713c00..24f1f638a63 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
@@ -1,72 +1,66 @@
 ---
 id: 5e6dd1278e6ca105cde40ea9
 title: 最長共通部分列
-challengeType: 5
+challengeType: 1
 forumTopicId: 385271
 dashedName: longest-common-subsequence
 ---
 
 # --description--
 
-グループAおよびBの **最長共通部分列** (または [**LCS**](http://en.wikipedia.org/wiki/Longest_common_subsequence_problem)) とは、2つのグループ間で共通していて、各グループで同じ順序であるAおよびBの要素の最長グループです。 たとえば、数列 "1234" と "1224533324" の LCS は "1234" です。
+The **longest common subsequence** (or **LCS**) of groups A and B is the longest group of elements from A and B that are common between the two groups and in the same order in each group. For example, the sequences `1234` and `1224533324` have an LCS of `1234`:<u>1234</u>
+<u>12</u>245<u>3</u>332<u>4</u>
 
-***1234***
+For a string example, consider the sequences `thisisatest` and `testing123testing`. An LCS would be `tsitest`:
+<u>t</u>hi<u>si</u>sa<u>test</u>
 
-***12***245***3***332***4***
+<u>t</u>e<u>s</u>t<u>i</u>ng123<u>test</u>ing.
 
-文字列の例として、文字列 "thisisatest" と "testing123testing" の場合を考えてみましょう。 LCS は "tsitest" となります。
-
-***t***hi***si***sa***test***
-
-***t***e***s***t***i***ng123***test***ing.
-
-今回のコードでは文字列のみを扱います。
-
-この問題の詳細については、 [Wikipedia](https://en.wikipedia.org/wiki/Longest_common_subsequence_problem) を参照してください。
+Your code only needs to deal with strings.
 
 # --instructions--
 
-2 つの文字列の LCS を返す関数 (大文字と小文字を区別する) を記述してください。 複数の LCS を表示する必要はありません。
+Write a case-sensitive function that returns the LCS of two strings. You don't need to show multiple LCS's.
 
 # --hints--
 
-`lcs` は関数とします。
+`lcs` should be a function.
 
 ```js
 assert(typeof lcs == 'function');
 ```
 
-`lcs("thisisatest", "testing123testing")` は文字列を返す必要があります。
+`lcs("thisisatest", "testing123testing")` should return a string.
 
 ```js
 assert(typeof lcs('thisisatest', 'testing123testing') == 'string');
 ```
 
-`lcs("thisisatest", "testing123testing")` は `"tsitest"` を返す必要があります。
+`lcs("thisisatest", "testing123testing")` should return `"tsitest"`.
 
 ```js
 assert.equal(lcs('thisisatest', 'testing123testing'), 'tsitest');
 ```
 
-`lcs("ABCDGH", "AEDFHR")` は `"ADH"` を返す必要があります。
+`lcs("ABCDGH", "AEDFHR")` should return `"ADH"`.
 
 ```js
 assert.equal(lcs('ABCDGH', 'AEDFHR'), 'ADH');
 ```
 
-`lcs("AGGTAB", "GXTXAYB")` は `"GTAB"` を返す必要があります。
+`lcs("AGGTAB", "GXTXAYB")` should return `"GTAB"`.
 
 ```js
 assert.equal(lcs('AGGTAB', 'GXTXAYB'), 'GTAB');
 ```
 
-`lcs("BDACDB", "BDCB")` は `"BDCB"` を返す必要があります。
+`lcs("BDACDB", "BDCB")` should return `"BDCB"`.
 
 ```js
 assert.equal(lcs('BDACDB', 'BDCB'), 'BDCB');
 ```
 
-`lcs("ABAZDC", "BACBAD")` は `"ABAD"` を返す必要があります。
+`lcs("ABAZDC", "BACBAD")` should return `"ABAD"`.
 
 ```js
 assert.equal(lcs('ABAZDC', 'BACBAD'), 'ABAD');
@@ -86,8 +80,8 @@ function lcs(a, b) {
 
 ```js
 function lcs(a, b) {
-  var aSub = a.substr(0, a.length - 1);
-  var bSub = b.substr(0, b.length - 1);
+  var aSub = a.substring(0, a.length - 1);
+  var bSub = b.substring(0, b.length - 1);
 
   if (a.length === 0 || b.length === 0) {
     return '';
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md
index 2ce4c8b1715..d36b5ef5df8 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md
@@ -1,7 +1,7 @@
 ---
 id: 5e6dd139859c290b6ab80292
 title: 最長増加部分列
-challengeType: 5
+challengeType: 1
 forumTopicId: 385272
 dashedName: longest-increasing-subsequence
 ---
@@ -12,53 +12,53 @@ dashedName: longest-increasing-subsequence
 
 次の配列の場合:
 
-$\\{3, 10, 2, 1, 20\\}$
+```js
+const array = [3, 10, 2, 1, 20];
+```
 
-最長増加部分列は:
+Longest increasing sequence is:
 
 $\\{3, 10, 20\\}$
 
-この問題の詳細については、 [Wikipedia](https://en.wikipedia.org/wiki/Longest increasing subsequence) を参照してください。
-
 # --instructions--
 
-数列をパラメータとして取り、最長増加部分列を返す関数を記述してください。
+Write a function that takes an array of numbers as a parameter and returns the longest increasing subsequence.
 
-数列はすべて最長増加部分列を持つことが保証されています。
+It is guaranteed that every array will have a longest increasing subsequence.
 
 # --hints--
 
-`findSequence` は関数とします。
+`findSequence` should be a function.
 
 ```js
 assert(typeof findSequence == 'function');
 ```
 
-`findSequence([3, 10, 2, 1, 20])` は配列を返す必要があります。
+`findSequence([3, 10, 2, 1, 20])` should return a array.
 
 ```js
 assert(Array.isArray(findSequence([3, 10, 2, 1, 20])));
 ```
 
-`findSequence([3, 10, 2, 1, 20])` は `[3, 10, 20]` を返す必要があります。
+`findSequence([3, 10, 2, 1, 20])` should return `[3, 10, 20]`.
 
 ```js
 assert.deepEqual(findSequence([3, 10, 2, 1, 20]), [3, 10, 20]);
 ```
 
-`findSequence([2, 7, 3, 5, 8])` は `[2, 3, 5, 8]` を返す必要があります。
+`findSequence([2, 7, 3, 5, 8])` should return `[2, 3, 5, 8]`.
 
 ```js
 assert.deepEqual(findSequence([2, 7, 3, 5, 8]), [2, 3, 5, 8]);
 ```
 
-`findSequence([2, 6, 4, 5, 1])` は `[2, 4, 5]` を返す必要があります。
+`findSequence([2, 6, 4, 5, 1])` should return `[2, 4, 5]`.
 
 ```js
 assert.deepEqual(findSequence([2, 6, 4, 5, 1]), [2, 4, 5]);
 ```
 
-`findSequence([10, 22, 9, 33, 21, 50, 60, 80])` は `[10, 22, 33, 50, 60, 80]` を返す必要があります。
+`findSequence([10, 22, 9, 33, 21, 50, 60, 80])` should return `[10, 22, 33, 50, 60, 80]`.
 
 ```js
 assert.deepEqual(findSequence([10, 22, 9, 33, 21, 50, 60, 80]), [
@@ -71,7 +71,7 @@ assert.deepEqual(findSequence([10, 22, 9, 33, 21, 50, 60, 80]), [
 ]);
 ```
 
-`findSequence([0, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15])` は `[0, 2, 6, 9, 11, 15` を返す必要があります。
+`findSequence([0, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15])` should return `[0, 2, 6, 9, 11, 15`.
 
 ```js
 assert.deepEqual(
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md
index 3b1a4759d8d..13f39137500 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md
@@ -1,14 +1,14 @@
 ---
 id: 5e6dd14797f5ce267c2f19d0
 title: 読み上げ数列
-challengeType: 5
+challengeType: 1
 forumTopicId: 385277
 dashedName: look-and-say-sequence
 ---
 
 # --description--
 
-[読み上げ数列](https://en.wikipedia.org/wiki/Look and say sequence) は、再帰的に定義された数列です。
+The Look and say sequence is a recursively defined sequence of numbers.
 
 数列の定義
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/lu-decomposition.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/lu-decomposition.md
index 88a0a526cfb..dcb858fc81c 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/lu-decomposition.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/lu-decomposition.md
@@ -1,20 +1,20 @@
 ---
 id: 5e6decd8ec8d7db960950d1c
 title: LU 分解
-challengeType: 5
+challengeType: 1
 forumTopicId: 385280
 dashedName: lu-decomposition
 ---
 
 # --description--
 
-[LU 分解](https://en.wikipedia.org/wiki/LU decomposition) で説明されているように、すべての正方行列 $A$ は、下三角行列 $L$ と上三角行列 $U$ の積に分解できます。
+Every square matrix $A$ can be decomposed into a product of a lower triangular matrix $L$ and a upper triangular matrix $U$. This is known as the LU decomposition.
 
 $A = LU$
 
 これはガウスの消去法の修正版です。
 
-[コレスキー分解](http://rosettacode.org/wiki/Cholesky decomposition) が正定値対称行列に対してのみ機能するのに対し、より一般的な LU 分解は任意の正方行列に対して機能します。
+While the Cholesky decomposition only works for symmetric, positive definite matrices, the more general LU decomposition works for any square matrix.
 
 $L$ と $U$ を計算するためのアルゴリズムはいくつかあります。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/ludic-numbers.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/ludic-numbers.md
index 6db8ccf28b5..1464354ab7c 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/ludic-numbers.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/ludic-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 5ea281203167d2b0bdefca00
 title: ルディック数
-challengeType: 5
+challengeType: 1
 forumTopicId: 385282
 dashedName: ludic-numbers
 ---
 
 # --description--
 
-[ルディック数](https://oeis.org/wiki/Ludic_numbers)は素数を生成するのに[エラトステネスの篩](https://rosettacode.org/wiki/Sieve_of_Eratosthenes)が使用されるのとちょうど同じように、篩法による素数生成に関わります。
+Ludic numbers are related to prime numbers as they are generated by a sieve quite like the Sieve of Eratosthenes is used to generate prime numbers.
 
 最初のルディック数は1です。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md
index a6b70eaae85..db1004d532b 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 5ea28156e79528a9ab248f27
 title: クレジットカード番号のLuhnテスト
-challengeType: 5
+challengeType: 1
 forumTopicId: 385284
 dashedName: luhn-test-of-credit-card-numbers
 ---
 
 # --description--
 
-[Luhnテスト](https://en.wikipedia.org/wiki/Luhn algorithm) は、クレジットカード会社によって有効なクレジットカード番号と数字のランダムな選択を区別するために使用されることがあります。
+The Luhn test is used by some credit card companies to distinguish valid credit card numbers from what could be a random selection of digits.
 
 Luhnテストで検証可能なクレジットカード番号を使用している企業が発行するカード番号は、以下のテストをパスします。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/lzw-compression.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/lzw-compression.md
index d9910359a31..502caa2c0af 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/lzw-compression.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/lzw-compression.md
@@ -1,7 +1,7 @@
 ---
 id: 5ea2815e364d9a2222ea55f8
 title: LZW 圧縮
-challengeType: 5
+challengeType: 1
 forumTopicId: 385288
 dashedName: lzw-compression
 ---
@@ -10,27 +10,25 @@ dashedName: lzw-compression
 
 Lempel-Ziv-Welch (LZW) アルゴリズムは、可逆圧縮 (ロスレス圧縮) を提供します。
 
-この主題に関する説明の全体は、 [Wikipediaの記事](https://en.wikipedia.org/wiki/Lempel-Ziv-Welch) で読むことができます。
-
 # --instructions--
 
-2つのパラメータを取る関数を記述してください。 最初のパラメータはブール値で、`true` は圧縮を、`false` は解凍を示します。 2番目のパラメータは、処理する文字列または配列のいずれかです。 文字列を圧縮する場合は、数値の配列を返します。 数値の配列を解凍する場合は、文字列を返します。
+Write a function that takes two parameters. The first parameter is a boolean where `true` indicates compress and `false` indicates decompress. The second parameter is either a string or an array to be processed. If it is a string to be compressed, return an array of numbers. If it's an array of numbers to be decompressed, return a string.
 
 # --hints--
 
-`LZW` は関数とします。
+`LZW` should be a function.
 
 ```js
 assert(typeof LZW === 'function');
 ```
 
-`LZW(true, "TOBEORNOTTOBEORTOBEORNOT")` は配列を返す必要があります。
+`LZW(true, "TOBEORNOTTOBEORTOBEORNOT")` should return a array.
 
 ```js
 assert(Array.isArray(LZW(true, 'TOBEORNOTTOBEORTOBEORNOT')));
 ```
 
-`LZW(false, [84, 79, 66, 69, 79, 82, 78, 79, 84, 256, 258, 260, 265, 259, 261, 263])` は文字列を返す必要があります。
+`LZW(false, [84, 79, 66, 69, 79, 82, 78, 79, 84, 256, 258, 260, 265, 259, 261, 263])` should return a string.
 
 ```js
 assert(
@@ -55,7 +53,7 @@ assert(
 );
 ```
 
-`LZW(true, "TOBEORNOTTOBEORTOBEORNOT")` は `[84, 79, 66, 69, 79, 82, 78, 79, 84, 256, 258, 260, 265, 259, 261, 263]` を返す必要があります。
+`LZW(true, "TOBEORNOTTOBEORTOBEORNOT")` should return `[84, 79, 66, 69, 79, 82, 78, 79, 84, 256, 258, 260, 265, 259, 261, 263]`.
 
 ```js
 assert.deepEqual(LZW(true, 'TOBEORNOTTOBEORTOBEORNOT'), [
@@ -78,7 +76,7 @@ assert.deepEqual(LZW(true, 'TOBEORNOTTOBEORTOBEORNOT'), [
 ]);
 ```
 
-`LZW(false, [84, 79, 66, 69, 79, 82, 78, 79, 84, 256, 258, 260, 265, 259, 261, 263])` は `"TOBEORNOTTOBEORTOBEORNOT"` を返す必要があります。
+`LZW(false, [84, 79, 66, 69, 79, 82, 78, 79, 84, 256, 258, 260, 265, 259, 261, 263])` should return `"TOBEORNOTTOBEORTOBEORNOT"`.
 
 ```js
 assert.equal(
@@ -104,7 +102,7 @@ assert.equal(
 );
 ```
 
-`LZW(true, "0123456789")` は `[48, 49, 50, 51, 52, 53, 54, 55, 56, 57]` を返す必要があります。
+`LZW(true, "0123456789")` should return `[48, 49, 50, 51, 52, 53, 54, 55, 56, 57]`.
 
 ```js
 assert.deepEqual(LZW(true, '0123456789'), [
@@ -121,7 +119,7 @@ assert.deepEqual(LZW(true, '0123456789'), [
 ]);
 ```
 
-`LZW(false, [48, 49, 50, 51, 52, 53, 54, 55, 56, 57])` は `"0123456789"` を返す必要があります。
+`LZW(false, [48, 49, 50, 51, 52, 53, 54, 55, 56, 57])` should return `"0123456789"`.
 
 ```js
 assert.equal(
@@ -130,13 +128,13 @@ assert.equal(
 );
 ```
 
-`LZW(true, "BABAABAAA")` は `[66, 65, 256, 257, 65, 260]` を返す必要があります。
+`LZW(true, "BABAABAAA")` should return `[66, 65, 256, 257, 65, 260]`.
 
 ```js
 assert.deepEqual(LZW(true, 'BABAABAAA'), [66, 65, 256, 257, 65, 260]);
 ```
 
-`LZW(false, [66, 65, 256, 257, 65, 260])` は `"BABAABAAA"` を返す必要があります。
+`LZW(false, [66, 65, 256, 257, 65, 260])` should return `"BABAABAAA"`.
 
 ```js
 assert.equal(LZW(false, [66, 65, 256, 257, 65, 260]), 'BABAABAAA');
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/s-expressions.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/s-expressions.md
index b3c6731daeb..d7c73c9767d 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/s-expressions.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/s-expressions.md
@@ -1,14 +1,14 @@
 ---
 id: 59667989bf71cf555dd5d2ff
 title: S式
-challengeType: 5
+challengeType: 1
 forumTopicId: 302303
 dashedName: s-expressions
 ---
 
 # --description--
 
-[S式](https://en.wikipedia.org/wiki/S-Expression "wp: S-Expression") はデータの解析や保存に便利な方法です。
+<a href="https://rosettacode.org/wiki/S-expressions" target="_blank" rel="noopener noreferrer nofollow">S-Expressions</a> are one convenient way to parse and store data.
 
 # --instructions--
 
@@ -32,7 +32,7 @@ dashedName: s-expressions
 (data (!@# (4.5) "(more" "data)")))
 </pre>
 
-それをネイティブデータ構造に変換します (ネイティブデータ構造の実装例については、[Pike](https://rosettacode.org/wiki/S-Expressions#Pike "\#Pike")、[Python](https://rosettacode.org/wiki/S-Expressions#Python "\#Python")、[Ruby](https://rosettacode.org/wiki/S-Expressions#Ruby "\#Ruby") を参照してください。)
+and turn it into a native data structure.
 
 # --hints--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
index 7c8b35cb88d..c4dc9f6078c 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
@@ -1,45 +1,46 @@
 ---
 id: 59da22823d04c95919d46269
 title: '水兵、ココナッツ、サルの問題'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302304
 dashedName: sailors-coconuts-and-a-monkey-problem
 ---
 
 # --description--
 
-5人の水兵がある島に漂着し、日中の間にココナッツをたくさん集めました。 その夜、最初の水兵が目を覚まし、早めに自分の分を取ろうと考え、ココナッツの山を 5 つに均等に分けようとしたところ、ココナッツが 1 つ余ることに気づきました。そこで、1 つをサルに投げ与え、均等に分けられた 5 つの山から「自分の分け前」の1 つを隠し、他の 4 つの山を再び 1 つにまとめて、ベッドに戻りました。 長い話なので端折って言うと、夜の間、それぞれの水兵が順番に 1 度起き、ココナッツの山を 5 つに分け、ココナッツが 1 つ余ることに気付いて、その 1 つをサルに投げ与えるという同じ行動をしました。 (夜、5 人の水兵がそれぞれ秘密の行動を取った後) 朝になり、残りのココナッツをそれぞれの水兵の分として 5 つに均等に分けたところ、ココナッツの山はきっちり等分になり、1 つも余りませんでした。 (朝には、サルの分け前はなかったのです)。
+Five sailors are shipwrecked on an island and collect a large pile of coconuts during the day.
+
+That night the first sailor wakes up and decides to take his first share early so tries to divide the pile of coconuts equally into five piles but finds that there is one coconut left over, so he tosses it to a monkey and then hides "his" one of the five equally sized piles of coconuts and pushes the other four piles together to form a single visible pile of coconuts again and goes to bed.
+
+To cut a long story short, each of the sailors in turn gets up once during the night and performs the same actions of dividing the coconut pile into five, finding that one coconut is left over and giving that single remainder coconut to the monkey, then push the other four piles together to form a single pile.
+
+In the morning (after the surreptitious and separate action of each of the five sailors during the night), the remaining coconuts are divided into five equal piles for each of the sailors, whereupon it is found that the pile of coconuts divides equally amongst the sailors with no remainder. (Nothing for the monkey in the morning.)
 
 # --instructions--
 
-`N` 人の水兵が日中に集めたココナッツの元々の数について、最も少ない場合の値を返す関数を記述してください。 **注意:** もちろん、この物語は日中にいくらでもココナッツを集められたり、ココナッツの山を何度も分けられたりと、話の筋に都合のいい時間に物事が起きる世界のお話です。この世界の条件が数学に影響を与えることはありません。 **参照:**
-
-<ul>
-  <li><a href="https://www.youtube.com/watch?v=U9qU20VmvaU" target="_blank"> Monkeys and Coconuts - Numberphile</a> (動画) 解析的解法。</li>
-  <li><a href="https://oeis.org/A002021" target="_blank">A002021 Pile of coconuts problem</a> オンライン整数列大辞典 (The On-Line Encyclopedia of Integer Sequences) (ただし、参照先により物語が多少異なる場合があります)。</li>
-</ul>
+Create a function that returns the minimum possible size of the initial pile of coconuts collected during the day for `N` sailors. **Note:** Of course the tale is told in a world where the collection of any number of coconuts in a day and multiple divisions of the pile, etc. can occur in time fitting the story line, so as not to affect mathematics.
 
 # --hints--
 
-`splitCoconuts` は関数とします。
+`splitCoconuts` should be a function.
 
 ```js
 assert(typeof splitCoconuts === 'function');
 ```
 
-`splitCoconuts(5)` は 3121 を返す必要があります。
+`splitCoconuts(5)` should return 3121.
 
 ```js
 assert(splitCoconuts(5) === 3121);
 ```
 
-`splitCoconuts(6)` は 233275 を返す必要があります。
+`splitCoconuts(6)` should return 233275.
 
 ```js
 assert(splitCoconuts(6) === 233275);
 ```
 
-`splitCoconuts(7)` は 823537 を返す必要があります。
+`splitCoconuts(7)` should return 823537.
 
 ```js
 assert(splitCoconuts(7) === 823537);
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sedols.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sedols.md
index 77b78b94f02..f3cd0d705ec 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sedols.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sedols.md
@@ -1,14 +1,16 @@
 ---
 id: 59d9c6bc214c613ba73ff012
 title: SEDOLコード
-challengeType: 5
+challengeType: 1
 forumTopicId: 302305
 dashedName: sedols
 ---
 
 # --description--
 
-6桁の [SEDOL コード](https://en.wikipedia.org/wiki/SEDOL "wp: SEDOL")の数字リストごとに、チェックディジットを計算して追加します。 つまり、左側の入力文字列に対して、関数は対応する右側の文字列を返す必要があります。
+<abbr title="Stock Exchange Daily Official List">SEDOL</abbr> is a list of securities identification numbers issued by the London Stock Exchange.
+
+For each number list of 6-digit <abbr title="Stock Exchange Daily Official List">SEDOL</abbr>s, calculate and append the checksum digit. That is, given the input string on the left, your function should return the corresponding string on the right:
 
 <pre>
 710889 => 7108899
@@ -24,35 +26,35 @@ B0YBKT => B0YBKT7
 B00030 => B000300
 </pre>
 
-各入力が正しい形式であるか、特に、SEDOL 文字列で許可されている有効な文字であるかについて確認を行います。 無効な入力に対して関数は `null` を返す必要があります。
+Check that each input is correctly formed, especially with respect to valid characters allowed in a SEDOL string. Your function should return `null` on an invalid input.
 
 # --hints--
 
-`sedol` は関数とします。
+`sedol` should be a function.
 
 ```js
 assert(typeof sedol === 'function');
 ```
 
-`sedol('a')` は null を返す必要があります。
+`sedol('a')` should return null.
 
 ```js
 assert(sedol('a') === null);
 ```
 
-`sedol('710889')` は '7108899' を返す必要があります。
+`sedol('710889')` should return '7108899'.
 
 ```js
 assert(sedol('710889') === '7108899');
 ```
 
-`sedol('BOATER')` は null を返す必要があります。
+`sedol('BOATER')` should return null.
 
 ```js
 assert(sedol('BOATER') === null);
 ```
 
-`sedol('228276')` は '2282765' を返す必要があります。
+`sedol('228276')` should return '2282765'.
 
 ```js
 assert(sedol('228276') === '2282765');
@@ -64,8 +66,9 @@ assert(sedol('228276') === '2282765');
 
 ```js
 function sedol(input) {
+  const checkSum = 0
 
-  return true;
+  return checkSum;
 }
 ```
 
@@ -90,7 +93,7 @@ function sedolCheckDigit(char6) {
   for (let i = 0; i < char6.length; i++) {
     sum += weight[i] * parseInt(char6.charAt(i), 36);
   }
-  const check = (10 - (sum % 10)) % 10;
-  return check.toString();
+  const checkSum = (10 - (sum % 10)) % 10;
+  return checkSum.toString();
 }
 ```
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/self-describing-numbers.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
index cceebb4ec39..3c8507c3436 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 5eaf48389ee512d4d103684b
 title: 自己記述数
-challengeType: 5
+challengeType: 1
 forumTopicId: 385289
 dashedName: self-describing-numbers
 ---
 
 # --description--
 
-いわゆる[「自己記述数」](https://en.wikipedia.org/wiki/Self-descriptive_number) と呼ばれる整数がいくつかあります。
+There are several so-called "self-describing" or "self-descriptive" integers.
 
 各桁が 0 から N-1 にラベル付けされているとき、各桁の数字がこの数字内でその桁が現れる回数と同じという性質を持つ場合、その整数は「自己記述数」と呼ばれます。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/self-referential-sequence.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/self-referential-sequence.md
index 6d9e57b462a..018514c240d 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/self-referential-sequence.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/self-referential-sequence.md
@@ -1,14 +1,14 @@
 ---
 id: 5eb3e4a21f462f409d656c73
 title: 自己参照数列
-challengeType: 5
+challengeType: 1
 forumTopicId: 385317
 dashedName: self-referential-sequence
 ---
 
 # --description--
 
-自己参照数列を生成する方法はいくつかあります。 特によく知られた例の 1 つである ( [読み上げ数列](https://rosettacode.org/wiki/Look-and-say sequence)) は、正の整数から始め、次いで隣接する同じ数字のまとまりを数え上げ、連結することにより、次の項を生成します。
+自己参照数列を生成する方法はいくつかあります。 One very common one (the <a href="https://rosettacode.org/wiki/Look-and-say_sequence" target="_blank" rel="noopener noreferrer nofollow">Look-and-say sequence</a>) is to start with a positive integer, then generate the next term by concatenating enumerated groups of adjacent alike digits:
 
 <pre>0, 10, 1110, 3110, 132110, 1113122110, 311311222110 ...</pre>
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/semiprime.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/semiprime.md
index eed225bca57..6a13288634c 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/semiprime.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/semiprime.md
@@ -1,14 +1,14 @@
 ---
 id: 5eb3e4aa847216613aa81983
 title: 半素数
-challengeType: 5
+challengeType: 1
 forumTopicId: 385318
 dashedName: semiprime
 ---
 
 # --description--
 
-半素数は、2つ (同じ数字も可) の[素数](https://rosettacode.org/wiki/prime_number)の積である自然数です。
+Semiprime numbers are natural numbers that are products of exactly two (possibly equal) <a href="https://rosettacode.org/wiki/prime_number" target="_blank" rel="noopener noreferrer nofollow">prime numbers</a>.
 
 <pre>1679  =  23 x 73</pre>
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sha-1.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sha-1.md
index 51c9c0fd9d2..f94e0610fba 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sha-1.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sha-1.md
@@ -1,7 +1,7 @@
 ---
 id: 5eb3e4b5f629b9a07429a5d2
 title: SHA-1
-challengeType: 5
+challengeType: 1
 forumTopicId: 385326
 dashedName: sha-1
 ---
@@ -16,7 +16,7 @@ BitTorrentは、ダウンロードを確認するためにSHA-1を使用して
 
 Git と Mercurial は SHA-1 ダイジェストを使用してコミットを識別しています。
 
-米国政府の連邦情報処理標準 (FIPS) [FIPS 180-1](https://rosettacode.org/wiki/SHA-1/FIPS-180-1)で、SHA-1 が定義されています。
+A US government standard, <a href="https://rosettacode.org/wiki/SHA-1/FIPS-180-1" target="_blank" rel="noopener noreferrer nofollow">FIPS 180-1</a>, defines SHA-1.
 
 # --instructions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sort-stability.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sort-stability.md
index fba3a0cea04..e06455750c6 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sort-stability.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sort-stability.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8014
 title: ソートの安定性
-challengeType: 5
+challengeType: 1
 forumTopicId: 302308
 dashedName: sort-stability
 ---
 
 # --description--
 
-表のレコードを特定の列またはフィールドで並び替える時、[安定ソート](https://en.wikipedia.org/wiki/Stable_sort#Stability) は同じキーを持つレコードの相対的な順序を常に保持します。
+When sorting records in a table by a particular column or field, a <a href="https://www.freecodecamp.org/news/stability-in-sorting-algorithms-a-treatment-of-equality-fa3140a5a539/" target="_blank" rel="noopener noreferrer nofollow">stable sort</a> will always retain the relative order of records that have the same key.
 
 例えば、この国と都市の表で **2 番目**の列の都市で安定ソートを行うと、米国のバーミンガムが英国のバーミンガムの上という順序が保たれます。 (このケースでは、不安定ソートでも米国のバーミンガムが英国のバーミンガムの上に配置される*可能性*はありますが、安定ソートのルーチンはそれを*保証*します）。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md
index 32f048392cd..60c0c46166a 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md
@@ -1,20 +1,20 @@
 ---
 id: 5a23c84252665b21eecc8001
 title: ソートアルゴリズム / ビーズソート
-challengeType: 5
+challengeType: 1
 forumTopicId: 302310
 dashedName: sorting-algorithmsbead-sort
 ---
 
 # --description--
 
-[ビーズソートアルゴリズム](https://en.wikipedia.org/wiki/Bead_sort) を使用して正の整数の配列をソートします。
+A *bead sort* starts by creating a matrix of zeroes whose length is equal to the value of the largest element in the input array. The matrix is transformed by adding one to all elements between the zeroth index and the index indicated by the current element. This process is repeated, until you have filled the matrix.
 
-*ビーズソート* は *重力ソート*とも呼ばれます。
+Iterating over the matrix, summing the number of elements greater than zero, then decreasing the value of each element by one yields the sorted array.
 
-アルゴリズムには O(S) があり、ここでの S は入力セット内の整数の合計です。各ビーズは個別に移動します。
+**Note:** Each element in the input array is unique.
 
-これは、ビーズの下の空白を効率的に確認できるメカニズムなしにビーズソートが実装される場合で、例えばソフトウェアの実装などの場合があります。
+Sort an array of positive integers using the Bead Sort Algorithm.
 
 # --hints--
 
@@ -90,31 +90,31 @@ function beadSort(arr) {
 
 ```js
 function beadSort(arr) {
-  var max = 0;
-  for (var i = 0; i < arr.length; i++) if (arr[i] > max) max = arr[i];
-  var grid = new Array(arr.length);
-  for (var i = 0; i < grid.length; i++) {
+  let max = 0;
+  for (let i = 0; i < arr.length; i++) if (arr[i] > max) max = arr[i];
+  const grid = new Array(arr.length);
+  for (let i = 0; i < grid.length; i++) {
     grid[i] = new Array(max);
   }
-  var levelcount = new Array(max);
+  const levelcount = new Array(max);
   levelcount.fill(0);
-  for (var i = 0; i < max; i++) {
+  for (let i = 0; i < max; i++) {
     levelcount[i] = 0;
-    for (var j = 0; j < arr.length; j++) grid[j][i] = '_';
+    for (let j = 0; j < arr.length; j++) grid[j][i] = '_';
   }
-  for (var i = 0; i < arr.length; i++) {
-    var num = arr[i];
-    for (var j = 0; num > 0; j++) {
+  for (let i = 0; i < arr.length; i++) {
+    let num = arr[i];
+    for (let j = 0; num > 0; j++) {
       grid[levelcount[j]++][j] = '*';
       num--;
     }
   }
-  var sorted = new Array(arr.length);
+  const sorted = new Array(arr.length);
   sorted.fill(0);
-  for (var i = 0; i < arr.length; i++) {
-    var putt = 0;
+  for (let i = 0; i < arr.length; i++) {
+    let putt = 0;
     for (
-      var j = 0;
+      let j = 0;
       j < max &&
       (function(c) {
         return c.charCodeAt == null ? c : c.charCodeAt(0);
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md
index 7dfc9a11f01..e9ac571d8a5 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8002
 title: ソートアルゴリズム / ボゴソート
-challengeType: 5
+challengeType: 1
 forumTopicId: 302311
 dashedName: sorting-algorithmsbogosort
 ---
 
 # --description--
 
-数字のリストを[ボゴソート](https://en.wikipedia.org/wiki/Bogosort)します。
+Bogosort a list of numbers.
 
 ボゴソートは、ソートされるまで集合をランダムに、単にシャッフルするものです。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
index 1822403e8f4..c6a7789c36c 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
@@ -1,36 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8004
 title: ソートアルゴリズム / カクテルシェーカーソート
-challengeType: 5
+challengeType: 1
 forumTopicId: 302312
 dashedName: sorting-algorithmscocktail-sort
 ---
 
 # --description--
 
-カクテルシェーカーソートは、[バブルソート](https://rosettacode.org/wiki/Bubble Sort)の改良版です。 改善点は基本的に、配列の値を双方向に「バブル」する点です。それぞれの反復でカクテルシェーカーソートは、前後に 1 回ずつバブルソートするからです。 アルゴリズムの擬似コード ( [wikipedia](https://en.wikipedia.org/wiki/Cocktail sort) より):
-
-<pre><b>function</b> <i>cocktailSort</i>( A : list of sortable items )
-  <b>do</b>
-    swapped := false
-    <b>for each</b> i <b>in</b> 0 <b>to</b> length( A ) - 2 <b>do</b>
-      <b>if</b> A[ i ] > A[ i+1 ] <b>then</b> <i>// test whether the two</i>
-                                <i>// elements are in the wrong</i>
-                                <i>// order</i>
-        swap( A[ i ], A[ i+1 ] ) <i>// let the two elements</i>
-                                 <i>// change places</i>
-        swapped := true;
-    <b>if</b> swapped = false <b>then</b>
-      <i>// we can exit the outer loop here if no swaps occurred.</i>
-      <b>break do-while loop</b>;
-    swapped := false
-    <b>for each</b> i <b>in</b> length( A ) - 2 <b>down to</b> 0 <b>do</b>
-      <b>if</b> A[ i ] > A[ i+1 ] <b>then</b>
-        swap( A[ i ], A[ i+1 ] )
-        swapped := true;
-  <b>while</b> swapped; <i>// if no elements have been swapped,</i>
-                <i>// then the list is sorted</i>
-</pre>
+The <a href="https://rosettacode.org/wiki/Sorting_algorithms/Cocktail_sort" target="_blank" rel="noopener noreferrer nofollow">cocktail sort</a> is an improvement on the Bubble Sort. Given an array of numbers, the cocktail sort will traverse the array from start to finish, moving the largest number to the end. Then, it will traverse the array backwards and move the smallest number to the start. It repeats these two passes, moving the next largest/smallest number to its correct position in the array until it is sorted.
 
 # --instructions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
index fecfd017569..064c935a40b 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8005
 title: ソートアルゴリズム / コムソート
-challengeType: 5
+challengeType: 1
 forumTopicId: 302313
 dashedName: sorting-algorithmscomb-sort
 ---
@@ -10,28 +10,22 @@ dashedName: sorting-algorithmscomb-sort
 
 *コムソート*を実装します。
 
-**コムソート**は[バブルソート](https://rosettacode.org/wiki/Bubble Sort)の改変版です。
+The **Comb Sort** is a variant of the Bubble Sort.
 
-[シェルソート](https://rosettacode.org/wiki/Shell sort)と同様、コムソートは比較交換する要素の間隔を大きくします。
+Like the Shell sort, the Comb Sort increases the gap used in comparisons and exchanges.
 
 間隔を $(1-e^{-\\varphi})^{-1} \\approx 1.247330950103979$ で割るのが最適ですが、1.3 がより実用的かもしれません。
 
 一部の実装では、間隔が一定距離以下になると挿入ソートを使用します。
 
-**参照:**
+Variants:
 
 <ul>
-  <li>Wikipediaの記事: <a href='https://en.wikipedia.org/wiki/Comb sort' target='_blank'>コムソート</a>。</li>
+  <li>Combsort11 makes sure the gap ends in (11, 8, 6, 4, 3, 2, 1), which is significantly faster than the other two possible endings.</li>
+  <li>Combsort with different endings changes to a more efficient sort when the data is almost sorted (when the gap is small). Comb sort with a low gap isn't much better than the Bubble Sort.</li>
 </ul>
 
-バリエーション:
-
-<ul>
-  <li>コムソート11 は、間隔の結果を (11, 8, 6, 4, 3, 2, 1) となるようにするもので、他の 2 つの起こり得る間隔の場合よりもずっと高速になります。</li>
-  <li>データがほぼソートされたとき (間隔が小さいとき) 、間隔の結果を変化させると、より効率的なソートになります。 間隔が小さい時のコムソートはバブルソートとほぼ変わりません。</li>
-</ul>
-
-擬似コード:
+Pseudocode:
 
 <pre><b>function</b> combsort(<b>array</b> input)
   gap := input<b>.size</b> <i>//initialize gap size</i>
@@ -59,41 +53,41 @@ dashedName: sorting-algorithmscomb-sort
 
 # --instructions--
 
-コムソートを使って、与えられた配列をソートする関数を記述してください。
+Write a function that sorts a given array using Comb sort.
 
 # --hints--
 
-`combSort` は関数とします。
+`combSort` should be a function.
 
 ```js
 assert(typeof combSort == 'function');
 ```
 
-`combSort([25, 32, 12, 7, 20])` は配列を返す必要があります。
+`combSort([25, 32, 12, 7, 20])` should return an array.
 
 ```js
 assert(Array.isArray(combSort([25, 32, 12, 7, 20])));
 ```
 
-`combSort([25, 32, 12, 7, 20])` は `[7, 12, 20, 25, 32]` を返す必要があります。
+`combSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
 
 ```js
 assert.deepEqual(combSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
 ```
 
-`combSort([38, 45, 35, 8, 13])` は `[8, 13, 35, 38, 45]` を返す必要があります。
+`combSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
 
 ```js
 assert.deepEqual(combSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
 ```
 
-`combSort([43, 36, 20, 34, 24])` は `[20, 24, 34, 36, 43]` を返す必要があります。
+`combSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
 
 ```js
 assert.deepEqual(combSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
 ```
 
-`combSort([12, 33, 26, 18, 1, 16, 38])` は `[1, 12, 16, 18, 26, 33, 38]` を返す必要があります。
+`combSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
 
 ```js
 assert.deepEqual(combSort([12, 33, 26, 18, 1, 16, 38]), [
@@ -107,7 +101,7 @@ assert.deepEqual(combSort([12, 33, 26, 18, 1, 16, 38]), [
 ]);
 ```
 
-`combSort([3, 39, 48, 16, 1, 4, 29])` は `[1, 3, 4, 16, 29, 39, 48]` を返す必要があります。
+`combSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
 
 ```js
 assert.deepEqual(combSort([3, 39, 48, 16, 1, 4, 29]), [
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
index 24b1701dcb9..565c8fa1c96 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8007
 title: ソートアルゴリズム / ノームソート
-challengeType: 5
+challengeType: 1
 forumTopicId: 302314
 dashedName: sorting-algorithmsgnome-sort
 ---
 
 # --description--
 
-ノームソートは、[挿入ソート](https://rosettacode.org/wiki/Insertion sort)に似たソートアルゴリズムですが、適切な場所への要素の移動が[バブルソート](https://rosettacode.org/wiki/Bubble Sort)のように一連の交換で行われる点のみが異なっています。
+Gnome sort is a sorting algorithm which is similar to <a href="https://rosettacode.org/wiki/Insertion_sort" target="_blank" rel="noopener noreferrer nofollow">Insertion sort</a>, except that moving an element to its proper place is accomplished by a series of swaps, as in <a href="https://rosettacode.org/wiki/Bubble" target="_blank" rel="noopener noreferrer nofollow">Bubble Sort</a>.
 
 アルゴリズムの疑似コードは次のとおりです。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md
index b57660e013d..45504a65054 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc800b
 title: ソートアルゴリズム / パンケーキソート
-challengeType: 5
+challengeType: 1
 forumTopicId: 302315
 dashedName: sorting-algorithmspancake-sort
 ---
 
 # --description--
 
-(手頃なサイズの) 整数の配列を [パンケーキソート](https://en.wikipedia.org/wiki/Pancake sorting)を使って昇順にソートする関数を記述してください。 この関数はソートされた配列を返す必要があります。
+Write a function to sort an array of integers (of any convenient size) into ascending order using Pancake sorting. この関数はソートされた配列を返す必要があります。
 
 つまり、個々の要素をソートするのではなく、以下のように、可能な操作はリストの 1 つの端で「ひっくり返す」ことだけとなります。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md
index 409bae6f11d..4b625013054 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8010
 title: ソートアルゴリズム / シェルソート
-challengeType: 5
+challengeType: 1
 forumTopicId: 302317
 dashedName: sorting-algorithmsshell-sort
 ---
 
 # --description--
 
-[シェルソート](https://en.wikipedia.org/wiki/Shell sort)アルゴリズム (減少増分ソート) を使用して、要素の配列をソートする関数を記述してください。 この関数はソートされた配列を返す必要があります。
+Write a function to sort an array of elements using the Shell sort algorithm, a diminishing increment sort. この関数はソートされた配列を返す必要があります。
 
 シェルソート (シェルメソッドとも呼ばれます) は、1959年にこのアルゴリズムを発表した発案者のドナルド・シェルにちなんで名付けられています。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md
index 84d91bbfbae..6a35497027b 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8012
 title: ソートアルゴリズム / ストゥージソート
-challengeType: 5
+challengeType: 1
 forumTopicId: 302318
 dashedName: sorting-algorithmsstooge-sort
 ---
 
 # --description--
 
-整数の配列で[ストゥージソート](https://en.wikipedia.org/wiki/Stooge sort)を実行する関数を記述してください。 この関数はソートされた配列を返す必要があります。
+Write a function to perform Stooge Sort on an array of integers. この関数はソートされた配列を返す必要があります。
 
 ストゥージソートのアルゴリズムは次のとおりです。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
index e25811c363d..b4f10da8b88 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
@@ -1,50 +1,62 @@
 ---
 id: 5a23c84252665b21eecc8013
 title: ソートアルゴリズム / ストランドソート
-challengeType: 5
+challengeType: 1
 forumTopicId: 302319
 dashedName: sorting-algorithmsstrand-sort
 ---
 
 # --description--
 
-[ストランドソート](https://en.wikipedia.org/wiki/Strand sort)を使用して配列をソートする関数を記述してください。 この関数はソートされた配列を返す必要があります。
+The **Strand sort** creates sorted subsets that are merged to create the final result.
+
+Consider an `unsortedArray = [3, 1, 4, 2]`. Pick the first item `3` and copy it into a separate array. Search for any bigger item following this item. When you find the a larger item, in this case `4`, copy it to the separate array, `[3, 4]`, and compare the following items to this new value, `4`.
+
+After you have reached the end of the array, remove the items you copied, `[3, 4]`, and start again with the first item remaining in the `unsortedArray`, in this case `1`.
+
+Following this process results in two sorted arrays, `[3, 4]` and `[1, 2]`. Merge these two arrays to create the `strandSortedArray`.
+
+```js
+const unsortedArray = [3, 1, 4, 2];
+const strandsortedArray = [1, 2, 3, 4];
+```
+
+Write a function to sort an array using the **Strand sort**. The function should return the sorted array.
 
-これは、ソートされていないリストから、ソート済み数値の短い数列を抽出することによって、数値をソートする方法です。
 
 # --hints--
 
-`strandSort` は関数とします。
+`strandSort` should be a function.
 
 ```js
 assert(typeof strandSort == 'function');
 ```
 
-`strandSort([25, 32, 12, 7, 20])` は配列を返す必要があります。
+`strandSort([25, 32, 12, 7, 20])` should return an array.
 
 ```js
 assert(Array.isArray(strandSort([25, 32, 12, 7, 20])));
 ```
 
-`strandSort([25, 32, 12, 7, 20])` は `[7, 12, 20, 25, 32]` を返す必要があります。
+`strandSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
 
 ```js
 assert.deepEqual(strandSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
 ```
 
-`strandSort([38, 45, 35, 8, 13])` は `[8, 13, 35, 38, 45]` を返す必要があります。
+`strandSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
 
 ```js
 assert.deepEqual(strandSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
 ```
 
-`strandSort([43, 36, 20, 34, 24])` は `[20, 24, 34, 36, 43]` を返す必要があります。
+`strandSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
 
 ```js
 assert.deepEqual(strandSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
 ```
 
-`strandSort([12, 33, 26, 18, 1, 16, 38])` は `[1, 12, 16, 18, 26, 33, 38]` を返す必要があります。
+`strandSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
 
 ```js
 assert.deepEqual(strandSort([12, 33, 26, 18, 1, 16, 38]), [
@@ -58,7 +70,7 @@ assert.deepEqual(strandSort([12, 33, 26, 18, 1, 16, 38]), [
 ]);
 ```
 
-`strandSort([3, 39, 48, 16, 1, 4, 29])` は `[1, 3, 4, 16, 29, 39, 48]` を返す必要があります。
+`strandSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
 
 ```js
 assert.deepEqual(strandSort([3, 39, 48, 16, 1, 4, 29]), [
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/soundex.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/soundex.md
index 1ec004496d5..917fc42eb00 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/soundex.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/soundex.md
@@ -1,14 +1,24 @@
 ---
 id: 5a23c84252665b21eecc8017
 title: サウンデックス
-challengeType: 5
+challengeType: 1
 forumTopicId: 302320
 dashedName: soundex
 ---
 
 # --description--
 
-サウンデックスは発音から単語のインデックスを作成するためのアルゴリズムです。 目的は、複数の同音異義語を同じ表記にコード化して、スペルの微小な違いにもかかわらず、一致させることです ([wikipedia記事](https://en.wikipedia.org/wiki/soundex)より)。 同じサウンデックスコードを持つ 2 つの子音の分離に関する実装には、多くの場合、大きな問題があります。 ([公式ルール](https://www.archives.gov/research/census/soundex.html) より)。 では、**Ashcraft** を **A-261** にコード化する場合を確認してみましょう。
+**Soundex Algorithm** deals with the *intentions* of the words. It creates a representation for similar sounding words.
+
+It is used for searching <em>names</em> and <em>addresses</em>. This means that the person who filled in the <em>name</em>, can focus on how it sounds instead of correcting the spelling of <em>names</em>.
+
+For example:
+
+If you are hearing the name `Quenci` for the first time, and misspelled it, you will get **Soundex** code `Q520`.
+
+When you spell the name `Quincy` correctly next time, you will still get the same code `Q520`, which means you can link multiple name pronunciations into the same <em>person</em> without the need for adding every spelling.
+
+Here is the rules: 
 
 <ul>
   <li>母音 (A、E、I、O、U) が同じサウンデックスコードを持つ2つの子音を分離している場合、母音の右側の子音がコード化されます。 Tymczak は T-522 (T、Mを5、Cを2、Zは無視 (上記の隣接ルールを参照)、Kを2) としてコード化されます。 母音 "A" が Z と K を分離しているため、K がコード化されます。</li>
@@ -17,77 +27,77 @@ dashedName: soundex
 
 # --instructions--
 
-1つの文字列をパラメータとして取り、コード化した文字列を返す関数を記述してください。
+Write a function that takes a string as a parameter and returns the encoded string.
 
 # --hints--
 
-`soundex` は関数とします。
+`soundex` should be a function.
 
 ```js
 assert(typeof soundex == 'function');
 ```
 
-`soundex("Soundex")` は文字列を返す必要があります。
+`soundex("Soundex")` should return a string.
 
 ```js
 assert(typeof soundex('Soundex') == 'string');
 ```
 
-`soundex("Soundex")` は `"S532"` を返す必要があります。
+`soundex("Soundex")` should return `"S532"`.
 
 ```js
 assert.equal(soundex('Soundex'), 'S532');
 ```
 
-`soundex("Example")` は `"E251"` を返す必要があります。
+`soundex("Example")` should return `"E251"`.
 
 ```js
 assert.equal(soundex('Example'), 'E251');
 ```
 
-`soundex("Sownteks")` は `"S532"` を返す必要があります。
+`soundex("Sownteks")` should return `"S532"`.
 
 ```js
 assert.equal(soundex('Sownteks'), 'S532');
 ```
 
-`soundex("Ekzampul")` は `"E251"` を返す必要があります。
+`soundex("Ekzampul")` should return `"E251"`.
 
 ```js
 assert.equal(soundex('Ekzampul'), 'E251');
 ```
 
-`soundex("Euler")` は `"E460"` を返す必要があります。
+`soundex("Euler")` should return `"E460"`.
 
 ```js
 assert.equal(soundex('Euler'), 'E460');
 ```
 
-`soundex("Gauss")` は `"G200"` を返す必要があります。
+`soundex("Gauss")` should return `"G200"`.
 
 ```js
 assert.equal(soundex('Gauss'), 'G200');
 ```
 
-`soundex("Hilbert")` は `"H416"` を返す必要があります。
+`soundex("Hilbert")` should return `"H416"`.
 
 ```js
 assert.equal(soundex('Hilbert'), 'H416');
 ```
 
-`soundex("Knuth")` は `"K530"` を返す必要があります。
+`soundex("Knuth")` should return `"K530"`.
 
 ```js
 assert.equal(soundex('Knuth'), 'K530');
 ```
 
-`soundex("Lloyd")` は `"L300"` を返す必要があります。
+`soundex("Lloyd")` should return `"L300"`.
 
 ```js
 assert.equal(soundex('Lloyd'), 'L300');
 ```
 
-`soundex("Lukasiewicz")` は `"L222"` を返す必要があります。
+`soundex("Lukasiewicz")` should return `"L222"`.
 
 ```js
 assert.equal(soundex('Lukasiewicz'), 'L222');
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/state-name-puzzle.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/state-name-puzzle.md
index 7b7edc2f778..699e816215e 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/state-name-puzzle.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/state-name-puzzle.md
@@ -1,28 +1,31 @@
 ---
 id: 5a23c84252665b21eecc8024
 title: 州名のパズル
-challengeType: 5
+challengeType: 1
 forumTopicId: 302323
 dashedName: state-name-puzzle
 ---
 
 # --description--
 
-このタスクは、Mark Nelson 氏 の DDJ コラム「Wordplay (言葉遊び)」と、NPR 週末版の Will Shortz 氏の週ごとのパズルチャレンジの 1 つ[\[1\]](https://www.npr.org/templates/story/story.php?storyId=9264290) にインスパイアされたもので、もとは David Edelheit 氏の発案によるものです。 チャレンジの内容は、アメリカの州の名前を 2 つ選び、すべての文字を混ぜて並べ替え、 *別の* 2 つの州の名前を作成するというものでした。(つまり、4 つの州の名前がすべて異なるようにします。) これらの州名は何でしょうか? この問題は [Unicon Discussion Web](https://tapestry.tucson.az.us/twiki/bin/view/Main/StateNamesPuzzle) で再び出題され、幾つかの解答が解説付きで紹介されています。 いくつかの役立つと思われるテクニックがあります。[Gödel numbering](https://en.wikipedia.org/wiki/Goedel_numbering)、[equivalence relations](https://en.wikipedia.org/wiki/Equivalence_relation)、[equivalence classes](https://en.wikipedia.org/wiki/Equivalence_classes) などを参考にすると良いでしょう。 これらの基本的なメリットは、Unicon Discussion Web で説明されています。 架空の新しい州のセットを使用する形式で、第 2 のチャレンジも出題されています。
+**State name** is a <em>word puzzle</em> in which you take the letters from two U.S. state names and rearrange them to form the names of two different U.S. states.
+
 
 # --instructions--
 
-与えられた州名の配列で、この課題を解く関数を記述してください。 この関数は配列を返す必要があります。 各要素はこの形式 (`{"from":[],"to":[]}`) のオブジェクトでなければなりません。 "from" 配列には元の名前を含め、"to" 配列には結果として生じる名前を含める必要があります。
+Write a function to solve the challenge for a given array of actual U.S. state names, and for fictional state names.
+
+The function should return an array. Each element should be an object in this form: `{"from":[],"to":[]}`. The `"from"` array should contain the original names and the `"to"` array should contain the resultant names.
 
 # --hints--
 
-`solve` は関数とします。
+`solve` should be a function.
 
 ```js
 assert(typeof solve == 'function');
 ```
 
-`solve(["New Mexico", "New York", "North Carolina ", "North Dakota", "Ohio", "Oklahoma", "Oregon", "Pennsylvania", "Rhode Island", "South Carolina", "South Dakota"])` は配列を返す必要があります。
+`solve(["New Mexico", "New York", "North Carolina ", "North Dakota", "Ohio", "Oklahoma", "Oregon", "Pennsylvania", "Rhode Island", "South Carolina", "South Dakota"])` should return an array.
 
 ```js
 assert(
@@ -44,7 +47,7 @@ assert(
 );
 ```
 
-`solve(["New Mexico", "New York", "North Carolina ", "North Dakota", "Ohio", "Oklahoma", "Oregon", "Pennsylvania", "Rhode Island", "South Carolina", "South Dakota"])` は `[{ from: ["North Carolina ", "South Dakota"], to: ["North Dakota", "South Carolina"] }]` を返す必要があります。
+`solve(["New Mexico", "New York", "North Carolina ", "North Dakota", "Ohio", "Oklahoma", "Oregon", "Pennsylvania", "Rhode Island", "South Carolina", "South Dakota"])` should return `[{ from: ["North Carolina ", "South Dakota"], to: ["North Dakota", "South Carolina"] }]`.
 
 ```js
 assert.deepEqual(
@@ -70,7 +73,7 @@ assert.deepEqual(
 );
 ```
 
-`solve(["New York", "New Kory", "Wen Kory", "York New", "Kory New", "New Kory"])` は `[{ from: ["New Kory", "New York"], to: ["Wen Kory", "York New"] }, { from: ["New Kory", "New York"], to: ["Kory New", "Wen Kory"] }, { from: ["New Kory", "New York"], to: ["Kory New", "York New"] }, { from: ["New York", "Wen Kory"], to: ["New Kory", "York New"] }, { from: ["New York", "Wen Kory"], to: ["Kory New", "New Kory"] }, { from: ["New York", "Wen Kory"], to: ["Kory New", "York New"] }, { from: ["New York", "York New"], to: ["New Kory", "Wen Kory"] }, { from: ["New York", "York New"], to: ["Kory New", "New Kory"] }, { from: ["New York", "York New"], to: ["Kory New", "Wen Kory"] }, { from: ["Kory New", "New York"], to: ["New Kory", "Wen Kory"] }, { from: ["Kory New", "New York"], to: ["New Kory", "York New"] }, { from: ["Kory New", "New York"], to: ["Wen Kory", "York New"] }, { from: ["New Kory", "Wen Kory"], to: ["Kory New", "York New"] }, { from: ["New Kory", "York New"], to: ["Kory New", "Wen Kory"] }, { from: ["Kory New", "New Kory"], to: ["Wen Kory", "York New"] }]` を返す必要があります。
+`solve(["New York", "New Kory", "Wen Kory", "York New", "Kory New", "New Kory"])` should return `[{ from: ["New Kory", "New York"], to: ["Wen Kory", "York New"] }, { from: ["New Kory", "New York"], to: ["Kory New", "Wen Kory"] }, { from: ["New Kory", "New York"], to: ["Kory New", "York New"] }, { from: ["New York", "Wen Kory"], to: ["New Kory", "York New"] }, { from: ["New York", "Wen Kory"], to: ["Kory New", "New Kory"] }, { from: ["New York", "Wen Kory"], to: ["Kory New", "York New"] }, { from: ["New York", "York New"], to: ["New Kory", "Wen Kory"] }, { from: ["New York", "York New"], to: ["Kory New", "New Kory"] }, { from: ["New York", "York New"], to: ["Kory New", "Wen Kory"] }, { from: ["Kory New", "New York"], to: ["New Kory", "Wen Kory"] }, { from: ["Kory New", "New York"], to: ["New Kory", "York New"] }, { from: ["Kory New", "New York"], to: ["Wen Kory", "York New"] }, { from: ["New Kory", "Wen Kory"], to: ["Kory New", "York New"] }, { from: ["New Kory", "York New"], to: ["Kory New", "Wen Kory"] }, { from: ["Kory New", "New Kory"], to: ["Wen Kory", "York New"] }]`.
 
 ```js
 assert.deepEqual(
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
index 84ea8da6453..0726f4183d2 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8028
 title: スターン＝ブロコット数列
-challengeType: 5
+challengeType: 1
 forumTopicId: 302324
 dashedName: stern-brocot-sequence
 ---
 
 # --description--
 
-このタスクでは、[フィボナッチ数列](https://rosettacode.org/wiki/Fibonacci sequence)の生成に使用されるのと同様のアルゴリズムによって、スターン＝ブロコット数列を生成します。
+For this task, the Stern-Brocot sequence is to be generated by an algorithm similar to that employed in generating the <a href="https://rosettacode.org/wiki/Fibonacci_sequence" target="_blank" rel="noopener noreferrer nofollow">Fibonacci sequence</a>.
 
 <ol>
   <li>数列の1番目と2番目の要素はどちらも1です。</li>
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md
index 640e77162bf..92b5f94d52c 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md
@@ -1,24 +1,30 @@
 ---
 id: 5a23c84252665b21eecc8029
 title: ストラドリングチェッカーボード
-challengeType: 5
+challengeType: 1
 forumTopicId: 302325
 dashedName: straddling-checkerboard
 ---
 
 # --description--
 
-[ストラドリングチェッカーボード](https://en.wikipedia.org/wiki/Straddling_checkerboard) メソッドを使用して、メッセージの暗号化と復号を行う関数を実装します。 関数はパラメータとして文字列と配列を取ります。 この配列にはチェッカーボードの3行を表す3つの文字列が含まれます。 出力は一連の 10 進数になります。 数字は各桁の前にエスケープ文字を挿入し、次に暗号化されていない桁を組み込んで暗号化する必要があります。 復号の場合は逆にします。
+Implement functions to encrypt and decrypt a message using the **straddling checkerboard** method.
+
+Each function will take two arguments, a `message` string and an `alphabet` array. The `alphabet` array will contain 3 strings representing the 3 rows of the straddling checkerboard.
+
+The output of the `straddle()` function should be a series of decimal digits. Numbers should be encrypted by inserting the escape character before each digit, then including the digit <em>unencrypted</em>.
+
+This should be reversed for decryption with the `unstraddle()` function.
 
 # --hints--
 
-`straddle` は関数とします。
+`straddle` should be a function.
 
 ```js
 assert(typeof straddle == 'function');
 ```
 
-`straddle("One night-it was on the twentieth of March, 1888-I was returning.",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` は文字列を返す必要があります。
+`straddle("One night-it was on the twentieth of March, 1888-I was returning.",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` should return a string.
 
 ```js
 assert(
@@ -29,7 +35,7 @@ assert(
 );
 ```
 
-`straddle("One night-it was on the twentieth of March, 1888-I was returning.",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` は `"34045747525284613427502840425027537379697175891898898898584619028294547488"` を返す必要があります。
+`straddle("One night-it was on the twentieth of March, 1888-I was returning.",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` should return `"34045747525284613427502840425027537379697175891898898898584619028294547488"`.
 
 ```js
 assert.equal(
@@ -41,7 +47,7 @@ assert.equal(
 );
 ```
 
-`straddle("One night-it was on the twentieth of March, 1888-I was returning",["HOL MES RT", "ABCDFGIJKN", "PQUVWXYZ./"])` は `"139539363509369743061399059745399365901344308320791798798798367430685972839363935"` を返す必要があります。
+`straddle("One night-it was on the twentieth of March, 1888-I was returning",["HOL MES RT", "ABCDFGIJKN", "PQUVWXYZ./"])` should return `"139539363509369743061399059745399365901344308320791798798798367430685972839363935"`.
 
 ```js
 assert.equal(
@@ -54,7 +60,7 @@ assert.equal(
 );
 ```
 
-`straddle("Thecheckerboardcakerecipespecifies3largeeggsand2.25cupsofflour.",["ET AON RIS", "BCDFGHJKLM", "PQ/UVWXYZ."])` は `"125021250212707204372221327070218600960021823809623283724002424935226226962262521636094232328463769"` を返す必要があります。
+`straddle("Thecheckerboardcakerecipespecifies3largeeggsand2.25cupsofflour.",["ET AON RIS", "BCDFGHJKLM", "PQ/UVWXYZ."])` should return `"125021250212707204372221327070218600960021823809623283724002424935226226962262521636094232328463769"`.
 
 ```js
 assert.equal(
@@ -67,13 +73,13 @@ assert.equal(
 );
 ```
 
-`unstraddle` は関数とします。
+`unstraddle` should be a function.
 
 ```js
 assert(typeof unstraddle == 'function');
 ```
 
-`unstraddle("34045747525284613427502840425027537379697175891898898898584619028294547488",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` は文字列を返す必要があります。
+`unstraddle("34045747525284613427502840425027537379697175891898898898584619028294547488",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` should return a string.
 
 ```js
 assert(
@@ -84,7 +90,7 @@ assert(
 );
 ```
 
-`unstraddle("34045747525284613427502840425027537379697175891898898898584619028294547488",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` は `"ONENIGHTITWASONTHETWENTIETHOFMARCH1888IWASRETURNING."` を返す必要があります。
+`unstraddle("34045747525284613427502840425027537379697175891898898898584619028294547488",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` should return `"ONENIGHTITWASONTHETWENTIETHOFMARCH1888IWASRETURNING."`.
 
 ```js
 assert.equal(
@@ -96,7 +102,7 @@ assert.equal(
 );
 ```
 
-`unstraddle("139539363509369743061399059745399365901344308320791798798798367430685972839363935",["HOL MES RT", "ABCDFGIJKN", "PQUVWXYZ./"])` は `"ONENIGHTITWASONTHETWENTIETHOFMARCH1888IWASRETURNING"` を返す必要があります。
+`unstraddle("139539363509369743061399059745399365901344308320791798798798367430685972839363935",["HOL MES RT", "ABCDFGIJKN", "PQUVWXYZ./"])` should return `"ONENIGHTITWASONTHETWENTIETHOFMARCH1888IWASRETURNING"`.
 
 ```js
 assert.equal(
@@ -108,7 +114,7 @@ assert.equal(
 );
 ```
 
-`unstraddle("125021250212707204372221327070218600960021823809623283724002424935226226962262521636094232328463769",["ET AON RIS", "BCDFGHJKLM", "PQ/UVWXYZ."])` は `"THECHECKERBOARDCAKERECIPESPECIFIES3LARGEEGGSAND2.25CUPSOFFLOUR."` を返す必要があります。
+`unstraddle("125021250212707204372221327070218600960021823809623283724002424935226226962262521636094232328463769",["ET AON RIS", "BCDFGHJKLM", "PQ/UVWXYZ."])` should return `"THECHECKERBOARDCAKERECIPESPECIFIES3LARGEEGGSAND2.25CUPSOFFLOUR."`.
 
 ```js
 assert.equal(
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/subleq.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/subleq.md
index 236e4ff4314..92ad7eb220a 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/subleq.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/subleq.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8038
 title: Subleq
-challengeType: 5
+challengeType: 1
 forumTopicId: 302328
 dashedName: subleq
 ---
 
 # --description--
 
-[Subleq](https://rosettacode.org/wiki/eso:Subleq) は [One-Instruction Set Computer (OISC)](https://en.wikipedia.org/wiki/One_instruction_set_computer) の 1 つの例です。
+Subleq is an example of a One-Instruction Set Computer (OISC).
 
 この名前は、**SU**btract and **B**ranch if **L**ess than or **EQ**ual to zero というこのコンピュータの唯一の命令から取られています。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sudoku.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sudoku.md
index ff79461c373..12bfad3fc03 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sudoku.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sudoku.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc803c
 title: 数独
-challengeType: 5
+challengeType: 1
 forumTopicId: 302329
 dashedName: sudoku
 ---
 
 # --description--
 
-部分的にマスが埋まっている通常の 9x9 の [数独](https://en.wikipedia.org/wiki/Sudoku)ブロックを解き、結果を返します。 空白のマスは `-1` で表します。 [数独のアルゴリズム](https://en.wikipedia.org/wiki/Algorithmics_of_sudoku)は今回の実装に役立つかもしれません。
+Write a function to solve a partially filled-in normal 9x9 Sudoku grid and return the result. 空白のマスは `-1` で表します。
 
 # --hints--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sum-of-a-series.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sum-of-a-series.md
index 896ee3cc6da..23a696766da 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sum-of-a-series.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sum-of-a-series.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8041
 title: 級数の和
-challengeType: 5
+challengeType: 1
 forumTopicId: 302333
 dashedName: sum-of-a-series
 ---
 
 # --description--
 
-[級数](https://en.wikipedia.org/wiki/Series (mathematics))の 第 **n** 項までの和、 つまり対応する[数列](https://en.wikipedia.org/wiki/sequence)の最初の **n** 項の和を計算します。 この値、または**n**が無限となる傾向がある場合の極限を、非公式に、*級数の和*とも呼ぶため、このタスクのタイトルにしています。 このタスクでは以下を使用します: $S_n = \displaystyle\sum_{k=1}^n \frac{1}{k^2}$
+Compute the **n**<sup>th</sup> term of a <em>series</em>, i.e. the sum of the **n** first terms of the corresponding <em>sequence</em>. この値、または**n**が無限となる傾向がある場合の極限を、非公式に、*級数の和*とも呼ぶため、このタスクのタイトルにしています。 このタスクでは以下を使用します: $S_n = \displaystyle\sum_{k=1}^n \frac{1}{k^2}$
 
 # --instructions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
index a328dfd2960..d1fb77506ca 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8045
 title: サザーランド・ホッジマン・ポリゴンクリッピング
-challengeType: 5
+challengeType: 1
 forumTopicId: 302336
 dashedName: sutherland-hodgman-polygon-clipping
 ---
 
 # --description--
 
-[サザーランド・ホッジマン・ポリゴンクリッピング・アルゴリズム](https://en.wikipedia.org/wiki/Sutherland-Hodgman clipping algorithm) は、任意のポリゴン (「サブジェクトポリゴン」) と凸ポリゴン (「クリップポリゴン」) との共通部分であるポリゴンを求めます。 これは、表示する必要のないポリゴンのパーツを排除することによって、シーンの表示の複雑さを軽減するためにコンピュータグラフィックス (特に2Dグラフィックス) に使用されます。 点によって定義されたクローズドポリゴンを取ります:
+The Sutherland-Hodgman clipping algorithm finds the polygon that is the intersection between an arbitrary polygon (the "subject polygon") and a convex polygon (the "clip polygon"). これは、表示する必要のないポリゴンのパーツを排除することによって、シーンの表示の複雑さを軽減するためにコンピュータグラフィックス (特に2Dグラフィックス) に使用されます。 点によって定義されたクローズドポリゴンを取ります:
 
 <pre>[(50, 150), (200, 50), (350, 150), (350, 300), (250, 300), (200, 250), (150, 350), (100, 250), (100, 200)]</pre>
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/symmetric-difference.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/symmetric-difference.md
index 23df7104047..143dd49a7cf 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/symmetric-difference.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/symmetric-difference.md
@@ -1,28 +1,32 @@
 ---
 id: 5a23c84252665b21eecc8046
 title: 対称差
-challengeType: 5
+challengeType: 1
 forumTopicId: 16086
 dashedName: symmetric-difference
 ---
 
 # --description--
 
-2つの [集合](https://rosettacode.org/wiki/set)の* A *と*B*について、$(A \\setminus B) \\cup (B \\setminus A).$ を計算します。つまり、*A* または *B* に属しているが、両方共には属していない項目を列挙します。 この集合は、 *A* と *B* の [対称差](https://en.wikipedia.org/wiki/Symmetric difference)と呼ばれます。 言い換えれば: $(A \\cup B) \\setminus (A \\cap B)$ となります。(少なくとも *A* または *B* のいずれかに属している項目の集合から *A* と *B* の両方に属している項目の集合を引きます)。
+Given two sets *A* and *B*, compute $(A \\setminus B) \\cup (B \\setminus A).$ That is, enumerate the items that are in *A* or *B* but not both. This set is called the symmetric difference of *A* and *B*. 言い換えれば: $(A \\cup B) \\setminus (A \\cap B)$ となります。(少なくとも *A* または *B* のいずれかに属している項目の集合から *A* と *B* の両方に属している項目の集合を引きます)。
+
+Example:
+
+For sets `A = [1, 2, 3]`, and `B = [1, 3, 4]`, the symmetric difference of *A* and *B* is `[2, 4]`.
 
 # --instructions--
 
-2つの配列をパラメータとして取り、対称差を返す関数を記述してください。 返す前に、結果の配列をソートします。
+Write a function that takes two arrays as parameters and returns the symmetric difference. Sort the resultant array before returning it.
 
 # --hints--
 
-`symmetricDifference` は関数とします。
+`symmetricDifference` should be a function.
 
 ```js
 assert(typeof symmetricDifference == 'function');
 ```
 
-`symmetricDifference(["John", "Bob", "Mary", "Serena"], ["Jim", "Mary", "John", "Bob"])` は配列を返す必要があります。
+`symmetricDifference(["John", "Bob", "Mary", "Serena"], ["Jim", "Mary", "John", "Bob"])` should return an array.
 
 ```js
 assert(
@@ -35,7 +39,7 @@ assert(
 );
 ```
 
-`symmetricDifference(["John", "Bob", "Mary", "Serena"], ["Jim", "Mary", "John", "Bob"])` は `["Jim", "Serena"]` を返す必要があります。
+`symmetricDifference(["John", "Bob", "Mary", "Serena"], ["Jim", "Mary", "John", "Bob"])` should return `["Jim", "Serena"]`.
 
 ```js
 assert.deepEqual(
@@ -47,13 +51,13 @@ assert.deepEqual(
 );
 ```
 
-`symmetricDifference([1, 2, 3], [3, 4])` は `[1, 2, 4]` を返す必要があります。
+`symmetricDifference([1, 2, 3], [3, 4])` should return `[1, 2, 4]`.
 
 ```js
 assert.deepEqual(symmetricDifference([1, 2, 3], [3, 4]), [1, 2, 4]);
 ```
 
-`symmetricDifference([1, 2, 3, 4, 5], [3, 4, 8, 7])` は `[1, 2, 5, 7, 8]` を返す必要があります。
+`symmetricDifference([1, 2, 3, 4, 5], [3, 4, 8, 7])` should return `[1, 2, 5, 7, 8]`.
 
 ```js
 assert.deepEqual(symmetricDifference([1, 2, 3, 4, 5], [3, 4, 8, 7]), [
@@ -65,7 +69,7 @@ assert.deepEqual(symmetricDifference([1, 2, 3, 4, 5], [3, 4, 8, 7]), [
 ]);
 ```
 
-`symmetricDifference([1, 2, 3, 4, 5, 6, 7, 8], [1, 3, 5, 6, 7, 8, 9])` は `[2, 4, 9]` を返す必要があります。
+`symmetricDifference([1, 2, 3, 4, 5, 6, 7, 8], [1, 3, 5, 6, 7, 8, 9])` should return `[2, 4, 9]`.
 
 ```js
 assert.deepEqual(
@@ -74,7 +78,7 @@ assert.deepEqual(
 );
 ```
 
-`symmetricDifference([1, 2, 4, 7, 9], [2, 3, 7, 8, 9])` は `[1, 3, 4, 8]` を返す必要があります。
+`symmetricDifference([1, 2, 4, 7, 9], [2, 3, 7, 8, 9])` should return `[1, 3, 4, 8]`.
 
 ```js
 assert.deepEqual(symmetricDifference([1, 2, 4, 7, 9], [2, 3, 7, 8, 9]), [
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/taxicab-numbers.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/taxicab-numbers.md
index 4abff442106..53331c2ae38 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/taxicab-numbers.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/taxicab-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 594ecc0d9a8cf816e3340187
 title: タクシー数
-challengeType: 5
+challengeType: 1
 forumTopicId: 302337
 dashedName: taxicab-numbers
 ---
 
 # --description--
 
-[タクシー数](https://en.wikipedia.org/wiki/Hardy–Ramanujan number "wp: Hardy–Ramanujan number") (ここで使用されている定義) は、2 通り以上の 2 つの正の立方数の和として表すことのできる正の整数です。
+A taxicab number (the definition that is being used here) is a positive integer that can be expressed as the sum of two positive cubes in more than one way.
 
 最初のタクシー数は `1729`で、次のようになります:
 
@@ -29,46 +29,39 @@ dashedName: taxicab-numbers
 
 最小の `n` 個のタクシー数を返す関数を記述してください。 それぞれのタクシー数について、数値とその構成立方数を示します。
 
-**こちらもご参照ください:**
-
-<ul>
-  <li>オンライン整数列大辞典の <a href='https://oeis.org/A001235' target='_blank'>A001235 タクシー数</a></li>
-  <li>Wikipedia の<a href='https://en.wikipedia.org/wiki/Taxicab_number' target='_blank'>タクシー数</a></li>
-</ul>
-
 # --hints--
 
-`taxicabNumbers` は関数とします。
+`taxicabNumbers` should be a function.
 
 ```js
 assert(typeof taxicabNumbers === 'function');
 ```
 
-`taxicabNumbers` は配列を返す必要があります。
+`taxicabNumbers` should return an array.
 
 ```js
 assert(typeof taxicabNumbers(2) === 'object');
 ```
 
-`taxicabNumbers` は数値の配列を返す必要があります。
+`taxicabNumbers` should return an array of numbers.
 
 ```js
 assert(typeof taxicabNumbers(100)[0] === 'number');
 ```
 
-`taxicabNumbers(4)` は [1729, 4104, 13832, 20683] を返す必要があります。
+`taxicabNumbers(4)` should return [1729, 4104, 13832, 20683].
 
 ```js
 assert.deepEqual(taxicabNumbers(4), res4);
 ```
 
-`taxicabNumbers(25)` は [1729, 4104, 13832, 20683, 32832, 39312, 40033, 46683, 64232, 65728, 110656, 110808, 134379, 149389, 165464, 171288, 195841, 216027, 216125, 262656, 314496, 320264, 327763, 373464, 402597] を返す必要があります。
+`taxicabNumbers(25)` should return [1729, 4104, 13832, 20683, 32832, 39312, 40033, 46683, 64232, 65728, 110656, 110808, 134379, 149389, 165464, 171288, 195841, 216027, 216125, 262656, 314496, 320264, 327763, 373464, 402597]
 
 ```js
 assert.deepEqual(taxicabNumbers(25), res25);
 ```
 
-`taxicabNumbers(39)` の 20 ～ 29 番目の数値は [314496,320264,327763,373464,402597,439101,443889,513000,513856] となる必要があります。
+`taxicabNumbers(39)` resulting numbers from 20 - 29 should be [314496,320264,327763,373464,402597,439101,443889,513000,513856].
 
 ```js
 assert.deepEqual(taxicabNumbers(39).slice(20, 29), res39From20To29);
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
index 700550efb2b..ef081670650 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
@@ -1,48 +1,48 @@
 ---
 id: 5951ed8945deab770972ae56
 title: ハノイの塔
-challengeType: 5
+challengeType: 1
 forumTopicId: 302341
 dashedName: towers-of-hanoi
 ---
 
 # --description--
 
-[ハノイの塔](https://en.wikipedia.org/wiki/Towers_of_Hanoi "wp: Towers_of_Hanoi") の問題を解いてください。
+Solve the Towers of Hanoi problem. The number of objects will be given as the first parameter, followed by the strings used to identify each stack of objects. Create a nested array containing the list of moves, `["source", "destination"]`.
 
-解では最初のパラメータとしてディスクの数を取り、ディスクを重ねるそれぞれの塔の名前として3つの文字列を使用します。たとえば、`towerOfHanoi(4, 'A', 'B', 'C')` のように記述します。 関数は、元の位置から目的地となる位置への移動のリストを含む配列の配列を返さなければなりません。
+For example, the parameters `(4, 'A', 'B', 'C')`, will result in nested array of moves `[['A', 'C'], ['B', 'A']]`, indicating that the 1st move was to move an object from stack `A` to `C` and the 2nd move was to move an object from stack `B` to `A`.
 
-例えば、配列 `[['A', 'C'], ['B', 'A']]` は、最初の移動で塔 Aから塔 Cにディスクを動かし、2 回目の移動で塔 Bから塔 Aにディスクを動かすことを意味します。
+# --instructions--
 
-<p></p>
+Write a function that returns the moves to stack the objects in a nested array.
 
 # --hints--
 
-`towerOfHanoi` は関数とします。
+`towerOfHanoi` should be a function.
 
 ```js
 assert(typeof towerOfHanoi === 'function');
 ```
 
-`towerOfHanoi(3, ...)` は 7 回分の移動を返す必要があります。
+`towerOfHanoi(3, ...)` should return 7 moves.
 
 ```js
 assert(res3.length === 7);
 ```
 
-`towerOfHanoi(3, 'A', 'B', 'C')` は `[['A','B'], ['A','C'], ['B','C'], ['A','B'], ['C','A'], ['C','B'], ['A','B']]` を返す必要があります。
+`towerOfHanoi(3, 'A', 'B', 'C')` should return `[['A','B'], ['A','C'], ['B','C'], ['A','B'], ['C','A'], ['C','B'], ['A','B']]`.
 
 ```js
 assert.deepEqual(towerOfHanoi(3, 'A', 'B', 'C'), res3Moves);
 ```
 
-`towerOfHanoi(5, "X", "Y", "Z")` の 10 番目の移動は Y -> X となる必要があります。
+`towerOfHanoi(5, "X", "Y", "Z")` 10th move should be Y -> X.
 
 ```js
 assert.deepEqual(res5[9], ['Y', 'X']);
 ```
 
-`towerOfHanoi(7, 'A', 'B', 'C')` の最初の10 回の移動は `[['A','B'], ['A','C'], ['B','C'], ['A','B'], ['C','A'], ['C','B'], ['A','B'], ['A','C'], ['B','C'], ['B','A']]` となる必要があります。
+`towerOfHanoi(7, 'A', 'B', 'C')` first ten moves should be `[['A','B'], ['A','C'], ['B','C'], ['A','B'], ['C','A'], ['C','B'], ['A','B'], ['A','C'], ['B','C'], ['B','A']]`
 
 ```js
 assert.deepEqual(towerOfHanoi(7, 'A', 'B', 'C').slice(0, 10), res7First10Moves);
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/y-combinator.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/y-combinator.md
index a04f7dc89b7..65d1958fc30 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/y-combinator.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/y-combinator.md
@@ -1,56 +1,54 @@
 ---
 id: 594810f028c0303b75339ad5
 title: Y コンビネータ
-challengeType: 5
+challengeType: 1
 forumTopicId: 302345
 dashedName: y-combinator
 ---
 
 # --description--
 
-厳密な[関数型プログラミング](https://www.freecodecamp.org/news/the-principles-of-functional-programming/ "news: the principles of functional programming")や[ラムダ計算](https://en.wikipedia.org/wiki/lambda calculus "wp: lambda calculus")では、関数 (ラムダ式) はステートを持たず、関数の引数のみを参照することができます。 これにより、関数は変数の状態と関連し、変数の状態は関数本体で使用されるという通常の再帰関数の定義が排除されます。 [Y コンビネータ](https://mvanier.livejournal.com/2897.html) は、それ自体がステートレス関数であり、他のステートレス関数に適用されると、関数の再帰バージョンを返します。 Yコンビネータは、 [不動点コンビネータ](https://en.wikipedia.org/wiki/Fixed-point combinator "wp: fixed-point combinator")と呼ばれる、このような関数のクラスのうち、最も単純なものです。
+In strict <a href="https://www.freecodecamp.org/news/the-principles-of-functional-programming/" target="_blank" rel="noopener noreferrer nofollow">functional programming</a> and the lambda calculus, functions (lambda expressions) don't have state and are only allowed to refer to arguments of enclosing functions. これにより、関数は変数の状態と関連し、変数の状態は関数本体で使用されるという通常の再帰関数の定義が排除されます。
+
+The Y combinator is itself a stateless function that, when applied to another stateless function, returns a recursive version of the function. The Y combinator is the simplest of the class of such functions, called fixed-point combinators.
 
 # --instructions--
 
-ステートレスな Y コンビネータ関数を定義し、これを使用して、[階乗](https://en.wikipedia.org/wiki/Factorial "wp: factorial")を計算してください。 `factorial(N)` 関数はすでに与えられています。 **以下も参照してください:**
-
-<ul>
-  <li><a href="https://vimeo.com/45140590" target="_blank">Jim Weirich: Adventures in Functional Programming</a>.</li>
-</ul>
+Define the stateless Y combinator function and use it to compute the factorials. The `factorial(N)` function is already given to you.
 
 # --hints--
 
-Yは関数を返す必要があります。
+Y should return a function.
 
 ```js
 assert.equal(typeof Y((f) => (n) => n), 'function');
 ```
 
-factorial(1) は 1 を返す必要があります。
+factorial(1) should return 1.
 
 ```js
 assert.equal(factorial(1), 1);
 ```
 
-factorial(2) は 2 を返す必要があります。
+factorial(2) should return 2.
 
 ```js
 assert.equal(factorial(2), 2);
 ```
 
-factorial(3) は 6 を返す必要があります。
+factorial(3) should return 6.
 
 ```js
 assert.equal(factorial(3), 6);
 ```
 
-factorial(4) は 24 を返す必要があります。
+factorial(4) should return 24.
 
 ```js
 assert.equal(factorial(4), 24);
 ```
 
-factorial(10) は 3628800 を返す必要があります。
+factorial(10) should return 3628800.
 
 ```js
 assert.equal(factorial(10), 3628800);
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
index c9163624318..19fabfa80f3 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
@@ -51,7 +51,7 @@ $$\begin{array}{|c|c|c|} \\hline P9 & P2              & P3\\\\ \\hline P8 & \bol
 - 数列 P2, P3, P4, P5, P6, P7, P8, P9, P2 において、$A(P1)$ = 白から黒 ($0 \to 1$) になっている場所の数として定義します。 (最後に追加の P2 が来て、環状になります)
 - $B(P1)$ = P1 の近傍の黒のピクセル数として定義します。 ($= \\sum(P2 \ldots P9)$)
 
-**ステップ1:**
+**ステップ 1:**
 
 すべてのピクセルをテストし、この段階では次のすべての条件を (同時に) 満たすピクセルに注目します。
 
@@ -63,7 +63,7 @@ $$\begin{array}{|c|c|c|} \\hline P9 & P2              & P3\\\\ \\hline P8 & \bol
 
 画像への条件の適用を反復し、ステップ 1 の条件を満たすピクセルをすべて収集した後、この条件を満たす全ピクセルを白にします。
 
-**ステップ2:**
+**ステップ 2:**
 
 すべてのピクセルを再度テストし、この段階では次のすべての条件を満たすピクセルに注目します。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md
index 2e9bb21a649..78869abf8b4 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md
@@ -1,14 +1,14 @@
 ---
 id: 594810f028c0303b75339ad8
 title: ジグザグ行列
-challengeType: 5
+challengeType: 1
 forumTopicId: 302348
 dashedName: zig-zag-matrix
 ---
 
 # --description--
 
-「ジグザグ」配列は、最初の $N^2$ 個の整数の正方形の配置であり、配列の[反対角](https://en.wiktionary.org/wiki/antidiagonal)に沿ってジグザグに進むにつれて、数値が順番に増加します。
+A 'zig-zag' array is a square arrangement of the first $N^2$ integers, where the numbers increase sequentially as you zig-zag along the array's anti-diagonals.
 
 例えば、入力 `5`の場合、次の結果となります。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
index 68453e1b7f7..22ddf07cf4b 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
@@ -8,9 +8,9 @@ dashedName: build-a-freecodecamp-forum-homepage
 
 # --description--
 
-**目標:** <https://codepen.io/freeCodeCamp/full/JqdoMV> と同じような機能を持つ、[CodePen.io](https://codepen.io) アプリを構築してください。
+**目標:** こちらと似た機能を持つアプリを構築してください: <https://codepen.io/freeCodeCamp/full/JqdoMV>
 
-以下の[ユーザーストーリー](https://en.wikipedia.org/wiki/User_story)を実装してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
+Fulfill the below user stories and get all of the tests to pass. 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
 
 **ユーザーストーリー:** freeCodeCamp フォーラムの、最新の投稿の一覧を見ることができます。
 
@@ -22,7 +22,7 @@ dashedName: build-a-freecodecamp-forum-homepage
 
 完了したら、CodePen のプロジェクトへのリンクを入れて、「このチャレンジを完了しました」ボタンをクリックしてください。
 
-[freeCodeCamp フォーラム](https://forum.freecodecamp.org/c/project-feedback/409)でプロジェクトを共有することにより、フィードバックを得ることができます。
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
index b0fdbbc9b98..5a866673fbe 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
@@ -8,11 +8,11 @@ dashedName: build-a-light-bright-app
 
 # --description--
 
-**目標:** <https://codepen.io/freeCodeCamp/full/eyLYXE> と同じような機能を持つ、[CodePen.io](https://codepen.io) アプリを構築してください。
+**目標:** こちらと似た機能を持つアプリを構築してください: <https://codepen.io/freeCodeCamp/full/eyLYXE>
 
 **ルール #1:** 模範プロジェクトのコードを見ないようにしてください。 自分の力で解いてみてください。
 
-**ルール #2:** 以下の[ユーザーストーリー](https://en.wikipedia.org/wiki/User_story)を実装してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
+**Rule #2:** Fulfill the below user stories and get all of the tests to pass. 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
 
 **ユーザーストーリー:** マウスカーソルをクリックまたはドラッグして、円に色をつけることができます。
 
@@ -28,7 +28,7 @@ dashedName: build-a-light-bright-app
 
 完了したら、CodePen のプロジェクトへのリンクを入れて、「このチャレンジを完了しました」ボタンをクリックしてください。
 
-[freeCodeCamp フォーラム](https://forum.freecodecamp.org/c/project-feedback/409)でプロジェクトを共有することにより、フィードバックを得ることができます。
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
index 2c9d8f3342b..0d30f6d2480 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
@@ -8,7 +8,7 @@ dashedName: build-a-nightlife-coordination-app
 
 # --description--
 
-<https://yoyo44.herokuapp.com/> と同じような機能を持つ、フルスタック JavaScript アプリを構築してください。 その際に、ご自身で選択したサイトビルダーを使用して、プロジェクトを完了させてください。
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://yoyo44.herokuapp.com/" target="_blank" rel="noopener noreferrer nofollow">https://yoyo44.herokuapp.com/</a>. その際に、ご自身で選択したサイトビルダーを使用して、プロジェクトを完了させてください。
 
 このプロジェクトに実装する必要がある、具体的なユーザーストーリーはこちらです:
 
@@ -20,7 +20,7 @@ dashedName: build-a-nightlife-coordination-app
 
 **ユーザーストーリー:** 認証されていないユーザーは、ログインする時に、再度検索する必要はありません。
 
-**ヒント:** [Yelp API](https://www.yelp.com/developers/documentation/v3) を試しに使ってみて、ユーザーが探している市内の会場を見つけてください。 Yelp API を使用する場合は、そのことをアプリ内で言及しているか確認してください。
+**Hint:** Try using the Yelp API to find venues in the cities your users search for. Yelp API を使用する場合は、そのことをアプリ内で言及しているか確認してください。
 
 完了したら、プロジェクトの動作デモが、どこか公の場でホストされていることを確認してください。 次に、`Solution Link` フィールドへプロジェクトの URL を提出してください。 必要に応じて、プロジェクトのソースコードへのリンクも、`GitHub Link` フィールドへ提出してください。
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
index 2a3e6b69307..30b55a4f1be 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
@@ -8,9 +8,9 @@ dashedName: build-a-pinterest-clone
 
 # --description--
 
-**目標:** <https://build-a-pinterest-clone.freecodecamp.rocks/> と同じような機能を持つ、[Replit](https://replit.com/) アプリを構築してください。
+**Objective:** Build an app that is functionally similar to this: <a href="https://build-a-pinterest-clone.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://build-a-pinterest-clone.freecodecamp.rocks/</a>.
 
-以下の[ユーザーストーリー](https://en.wikipedia.org/wiki/User_story)を実装してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
+Fulfill the below user stories and get all of the tests to pass. 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
 
 **ユーザーストーリー:** 認証が済んでいないユーザーである時に、GitHub でログインできます。
 
@@ -24,11 +24,11 @@ dashedName: build-a-pinterest-clone
 
 **ユーザーストーリー:** 認証済みのユーザーである時に、破損した画像をアップロードした場合は、プレースホルダー画像に置き換えられます。 (jQuery を使用して破損した画像を検出できます)
 
-**ヒント:** [Masonry.js](https://masonry.desandro.com/) は、Pinterest スタイルのイメージグリッドを割り当てるライブラリです。
+**Hint:** Masonry.js is a library that allows for Pinterest-style image grids.
 
 これらのユーザーストーリーの実装を終えたら、動作可能なアプリの URL を入力し、必要に応じて GitHub リポジトリの URL を入力してください。 それから「このチャレンジを完了しました」ボタンをクリックしてください。
 
-[freeCodeCamp フォーラム](https://forum.freecodecamp.org/c/project-feedback/409)でプロジェクトを共有することにより、フィードバックを得ることができます。
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-pong-game.md b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
index f2f47b28d42..da552afdbd9 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
@@ -8,11 +8,11 @@ dashedName: build-a-pong-game
 
 # --description--
 
-**目標:** <https://codepen.io/satyamdev/full/pdMmBp> と同じような機能を持つ、[CodePen.io](https://codepen.io) アプリを構築してください。
+**目標:** こちらと似た機能を持つアプリを構築してください: <https://codepen.io/satyamdev/full/pdMmBp>
 
 **ルール #1:** 模範プロジェクトのコードを見ないようにしてください。 自分の力で解いてみてください。
 
-**ルール #2:** 以下の[ユーザーストーリー](https://en.wikipedia.org/wiki/User_story)を実装してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
+**Rule #2:** Fulfill the below user stories and get all of the tests to pass. 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
 
 **ユーザーストーリー:** 私はラケットを操作できます。
 
@@ -24,7 +24,7 @@ dashedName: build-a-pong-game
 
 完了したら、CodePen のプロジェクトへのリンクを入れて、「このチャレンジを完了しました」ボタンをクリックしてください。
 
-[freeCodeCamp フォーラム](https://forum.freecodecamp.org/c/project-feedback/409)でプロジェクトを共有することにより、フィードバックを得ることができます。
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
index 5f8c4bb1db7..9dc051b28b0 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
@@ -8,9 +8,9 @@ dashedName: build-a-recipe-box
 
 # --description--
 
-**目標:** [https://codepen.io/freeCodeCamp/full/dNVazZ](https://codepen.io/freeCodeCamp/full/dNVazZ/) と同じような機能を持つ、[CodePen.io](https://codepen.io) アプリを構築してください。
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/dNVazZ/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/dNVazZ/</a>.
 
-以下の[ユーザーストーリー](https://en.wikipedia.org/wiki/User_story)を実装してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
+Fulfill the below user stories and get all of the tests to pass. 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
 
 **ユーザーストーリー:** 料理の名前と材料を載せたレシピを作成できます。
 
@@ -28,7 +28,7 @@ dashedName: build-a-recipe-box
 
 完了したら、CodePen のプロジェクトへのリンクを入れて、「このチャレンジを完了しました」ボタンをクリックしてください。
 
-[freeCodeCamp フォーラム](https://forum.freecodecamp.org/c/project-feedback/409)でプロジェクトを共有することにより、フィードバックを得ることができます。
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
index 6efe1f32b76..d1227de930a 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
@@ -8,9 +8,9 @@ dashedName: build-a-roguelike-dungeon-crawler-game
 
 # --description--
 
-**目標:** <https://codepen.io/freeCodeCamp/full/apLXEJ/> と同じような機能を持つ、[CodePen.io](https://codepen.io) アプリを構築してください。
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/apLXEJ/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/apLXEJ/</a>.
 
-以下の[ユーザーストーリー](https://en.wikipedia.org/wiki/User_story)を実装してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
+Fulfill the below user stories and get all of the tests to pass. 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
 
 **ユーザーストーリー:** 私には健康状態、レベル、武器があります。 より優れた武器を拾うことができます。 健康アイテムを拾うことができます。
 
@@ -32,7 +32,7 @@ dashedName: build-a-roguelike-dungeon-crawler-game
 
 完了したら、CodePen のプロジェクトへのリンクを入れて、「このチャレンジを完了しました」ボタンをクリックしてください。
 
-[freeCodeCamp フォーラム](https://forum.freecodecamp.org/c/project-feedback/409)でプロジェクトを共有することにより、フィードバックを得ることができます。
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-simon-game.md b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
index ed4b2b0bb6c..160341a115f 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
@@ -8,9 +8,9 @@ dashedName: build-a-simon-game
 
 # --description--
 
-**目標:** [https://codepen.io/freeCodeCamp/full/obYBjE](https://codepen.io/freeCodeCamp/full/obYBjE) と同じような機能を持つ、[CodePen.io](https://codepen.io) アプリを構築してください。
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/obYBjE" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/obYBjE</a>.
 
-以下の[ユーザーストーリー](https://en.wikipedia.org/wiki/User_story)を実装してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
+Fulfill the below user stories and get all of the tests to pass. 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
 
 **ユーザーストーリー:** 連続してボタンを押す順番を、ランダムに提示されます。
 
@@ -32,7 +32,7 @@ dashedName: build-a-simon-game
 
 完了したら、CodePen のプロジェクトへのリンクを入れて、「このチャレンジを完了しました」ボタンをクリックしてください。
 
-[freeCodeCamp フォーラム](https://forum.freecodecamp.org/c/project-feedback/409)でプロジェクトを共有することにより、フィードバックを得ることができます。
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
index e58fa063c23..9b653a8f88a 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
@@ -8,9 +8,9 @@ dashedName: build-a-tic-tac-toe-game
 
 # --description--
 
-**目標:** <https://codepen.io/freeCodeCamp/full/KzXQgy/> と同じような機能を持つ、[CodePen.io](https://codepen.io) アプリを構築してください。
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/KzXQgy/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/KzXQgy/</a>.
 
-以下の[ユーザーストーリー](https://en.wikipedia.org/wiki/User_story)を実装してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
+Fulfill the below user stories and get all of the tests to pass. 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
 
 **ユーザーストーリー:** コンピュータでまるばつゲームをプレイできます。
 
@@ -20,7 +20,7 @@ dashedName: build-a-tic-tac-toe-game
 
 完了したら、CodePen のプロジェクトへのリンクを入れて、「このチャレンジを完了しました」ボタンをクリックしてください。
 
-[freeCodeCamp フォーラム](https://forum.freecodecamp.org/c/project-feedback/409)でプロジェクトを共有することにより、フィードバックを得ることができます。
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-voting-app.md b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-voting-app.md
index 1e4b68e7b2e..66a2e832b84 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-voting-app.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-voting-app.md
@@ -8,7 +8,7 @@ dashedName: build-a-voting-app
 
 # --description--
 
-<https://voting-app.freecodecamp.rocks/> と同じような機能を持つ、フルスタック JavaScript アプリを構築してください。 その際に、ご自身で選択したサイトビルダーを使用して、プロジェクトを完了させてください。
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://voting-app.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://voting-app.freecodecamp.rocks/</a>. その際に、ご自身で選択したサイトビルダーを使用して、プロジェクトを完了させてください。
 
 このプロジェクトに実装する必要がある、具体的なユーザーストーリーはこちらです:
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
index 68ea47aaa88..dd46d3e2a59 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
@@ -8,23 +8,21 @@ dashedName: build-a-wikipedia-viewer
 
 # --description--
 
-**目標:** [https://codepen.io/freeCodeCamp/full/wGqEga](https://codepen.io/freeCodeCamp/full/wGqEga/) と同じような機能を持つ、[CodePen.io](https://codepen.io) アプリを構築してください。
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/wGqEga/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/wGqEga/</a>.
 
-以下の[ユーザーストーリー](https://en.wikipedia.org/wiki/User_story)を実装してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
+The MediaWiki software powers Wikipedia, and it helps you collect and organize knowledge and make it available to people.
 
-**ユーザーストーリー:** Wikipedia の項目を検索ボックスで検索し、その結果として Wikipedia の項目を参照することができます。
+Using the MediaWiki API, replicate the search function and random article function, similar to the example app above. You can use Wikipedia as your data source.
 
-**ユーザーストーリー:** ボタンをクリックすることで、ランダムに Wikipedia の項目を表示できます。
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
-ヒント #1: ランダムに Wikipedia の記事を取得するために使用できる URL はこちらです: `https://en.wikipedia.org/wiki/Special:Random`
+**User Story:** I can search Wikipedia entries in a search box and see the resulting Wikipedia entries.
 
-ヒント #2: Wikipedia の API の使用に関する項目はこちらです: `https://www.mediawiki.org/wiki/API:Main_page`
+**User Story:** I can click a button to see a random Wikipedia entry.
 
-ヒント #3: この[リンク](https://en.wikipedia.org/wiki/Special:ApiSandbox#action=query&titles=Main%20Page&prop=revisions&rvprop=content&format=jsonfm)を使用して Wikipedia の API を実験してください。
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-完了したら、CodePen のプロジェクトへのリンクを入れて、「このチャレンジを完了しました」ボタンをクリックしてください。
-
-[freeCodeCamp フォーラム](https://forum.freecodecamp.org/c/project-feedback/409)でプロジェクトを共有することにより、フィードバックを得ることができます。
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md
index 8ce8e5db825..4a7295c9900 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md
@@ -8,7 +8,7 @@ dashedName: build-an-image-search-abstraction-layer
 
 # --description--
 
-次のような、画像を検索できるフルスタック JavaScript アプリを構築してください: <https://image-search-abstraction-layer.freecodecamp.rocks/query/lolcats%20funny?page=10> また、こんなふうにして最近の検索クエリを閲覧できるようにしてください: <https://image-search-abstraction-layer.freecodecamp.rocks/recent/> ご自身で選んだサイトビルダーを使用して、プロジェクトを完了させてください。
+Build a full stack JavaScript app that allows you to search for images like this: <a href="https://image-search-abstraction-layer.freecodecamp.rocks/query/lolcats%20funny?page=10" target="_blank" rel="noopener noreferrer nofollow">https://image-search-abstraction-layer.freecodecamp.rocks/query/lolcats%20funny?page=10</a> and browse recent search queries like this: <a href="https://image-search-abstraction-layer.freecodecamp.rocks/recent/" target="_blank" rel="noopener noreferrer nofollow">https://image-search-abstraction-layer.freecodecamp.rocks/recent/</a>. ご自身で選んだサイトビルダーを使用して、プロジェクトを完了させてください。
 
 このプロジェクトに実装する必要がある、具体的なユーザーストーリーは次のとおりです:
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
index 765e9ecc49e..3fe6af30e91 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
@@ -8,29 +8,36 @@ dashedName: build-the-game-of-life
 
 # --description--
 
-**目標:** <https://codepen.io/freeCodeCamp/full/BpwMZv/> と同じような機能を持つ、[CodePen.io](https://codepen.io) アプリを構築してください。
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/BpwMZv/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/BpwMZv/</a>.
 
-以下の[ユーザーストーリー](https://en.wikipedia.org/wiki/User_story)を実装してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
+The Game of Life is a cellular automaton devised by the British mathematician John Horton Conway. It is a <em>zero-player game</em>, meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and observing how it evolves.
 
-**ユーザーストーリー:** 最初にゲームを訪れたときから、ボードがランダムに生成され、自由に動き始めます。
+The universe of the Game of Life is an infinite, two-dimensional orthogonal grid of square cells, each of which is in one of two possible states, populated and unpopulated. Every cell interacts with its eight neighbours, which are the cells that are horizontally, vertically, or diagonally adjacent.
 
-**ユーザーストーリー:** ボードの動作を開始または停止できます。
+At each step in time, the following transitions occur:
 
-**ユーザーストーリー:** ボードを設定することができます。
+- Any live cell with fewer than two live neighbours dies, as if by underpopulation.
+- Any live cell with two or three live neighbours lives on to the next generation.
+- Any live cell with more than three live neighbours dies, as if by overpopulation.
+- Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.
 
-**ユーザーストーリー:** ボードをクリアすることができます。
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
-**ユーザーストーリー:** start を押すと、ゲームが動き出します。
+**User Story:** When I first arrive at the game, it will randomly generate a board and start playing.
 
-**ユーザーストーリー:** ボードが変化するごとに、どれだけの世代が過ぎ去ったかを見ることができます。
+**User Story:** I can start and stop the board.
 
-**ヒント:** John Conway 自身によるライフゲームの説明はこちらです: <https://www.youtube.com/watch?v=E8kUJL04ELA>
+**User Story:** I can set up the board.
 
-**ヒント:** ルールを含めたライフゲームの概要についてはこちらを参照してください: [https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life](https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life)
+**User Story:** I can clear the board.
 
-完了したら、CodePen のプロジェクトへのリンクを入れて、「このチャレンジを完了しました」ボタンをクリックしてください。
+**User Story:** When I press start, the game will play out.
 
-[freeCodeCamp フォーラム](https://forum.freecodecamp.org/c/project-feedback/409)でプロジェクトを共有することにより、フィードバックを得ることができます。
+**User Story:** Each time the board changes, I can see how many generations have gone by.
+
+When you are finished, include a link to your project and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md
index 8d0e604e2dd..b1f45272538 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md
@@ -8,7 +8,7 @@ dashedName: chart-the-stock-market
 
 # --description--
 
-<https://chart-the-stock-market.freecodecamp.rocks/> と同じような機能を持つ、フルスタック JavaScript アプリを構築してください。 その際に、ご自身で選択したサイトビルダーを使用して、プロジェクトを完了させてください。
+Build a full stack JavaScript app that is functionally similar to this: <a href="https://chart-the-stock-market.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://chart-the-stock-market.freecodecamp.rocks/</a>. その際に、ご自身で選択したサイトビルダーを使用して、プロジェクトを完了させてください。
 
 このプロジェクトに実装する必要がある、具体的なユーザーストーリーはこちらです:
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
index 8b2c631830e..b1420f633b4 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
@@ -8,9 +8,9 @@ dashedName: manage-a-book-trading-club
 
 # --description--
 
-**目標:** <https://manage-a-book-trading-club.freecodecamp.rocks/> と同じような機能を持つ、[Replit](https://replit.com/) アプリを構築してください。
+**Objective:** Build an app that is functionally similar to this: <a href="https://manage-a-book-trading-club.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://manage-a-book-trading-club.freecodecamp.rocks/</a>.
 
-以下の[ユーザーストーリー](https://en.wikipedia.org/wiki/User_story)を実装してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
+Fulfill the below user stories and get all of the tests to pass. 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
 
 **ユーザーストーリー:** すべてのユーザに投稿された本を見ることができます。
 
@@ -22,7 +22,7 @@ dashedName: manage-a-book-trading-club
 
 これらのユーザーストーリーの実装を終えたら、動作可能なアプリの URL を入力し、必要に応じて GitHub リポジトリの URL を入力してください。 それから「このチャレンジを完了しました」ボタンをクリックしてください。
 
-[freeCodeCamp フォーラム](https://forum.freecodecamp.org/c/project-feedback/409)でプロジェクトを共有することにより、フィードバックを得ることができます。
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
index 94d82b44da9..06127ef2f17 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
@@ -8,9 +8,9 @@ dashedName: map-data-across-the-globe
 
 # --description--
 
-**目標:** <https://codepen.io/freeCodeCamp/full/mVEJag> と同じような機能を持つ、[CodePen.io](https://codepen.io) アプリを構築してください。
+**目標:** こちらと似た機能を持つアプリを構築してください: <https://codepen.io/freeCodeCamp/full/mVEJag>
 
-以下の[ユーザーストーリー](https://en.wikipedia.org/wiki/User_story)を実装してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
+Fulfill the below user stories and get all of the tests to pass. 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
 
 **ユーザーストーリー:** 隕石が落下した世界地図上のすべての場所を見ることができます。
 
@@ -22,7 +22,7 @@ dashedName: map-data-across-the-globe
 
 完了したら、CodePen のプロジェクトへのリンクを入れて、「このチャレンジを完了しました」ボタンをクリックしてください。
 
-[freeCodeCamp フォーラム](https://forum.freecodecamp.org/c/project-feedback/409)でプロジェクトを共有することにより、フィードバックを得ることができます。
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md
index 5fbd86eb666..be798eeface 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md
@@ -8,9 +8,9 @@ dashedName: p2p-video-chat-application
 
 # --description--
 
-**目標:** <https://p2p-video-chat-application.freecodecamp.rocks/> と同じような機能を持つ、[Replit](https://replit.com/) アプリを構築してください。
+**Objective:** Build an app that is functionally similar to this: <a href="https://p2p-video-chat-application.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://p2p-video-chat-application.freecodecamp.rocks/</a>.
 
-以下の[ユーザーストーリー](https://en.wikipedia.org/wiki/User_story)を実装してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
+Fulfill the below user stories and get all of the tests to pass. 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
 
 **ユーザーストーリー:** アプリに到着すると同時に、ブラウザはカメラとマイクにアクセスするためにダイアログを表示します。
 
@@ -32,7 +32,7 @@ dashedName: p2p-video-chat-application
 
 これらのユーザーストーリーの実装を終えたら、動作可能なアプリの URL を入力し、必要に応じて GitHub リポジトリの URL を入力してください。 それから「このチャレンジを完了しました」ボタンをクリックしてください。
 
-[freeCodeCamp フォーラム](https://forum.freecodecamp.org/c/project-feedback/409)でプロジェクトを共有することにより、フィードバックを得ることができます。
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
index 0814ff77979..f16321f8d74 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
@@ -8,9 +8,9 @@ dashedName: show-national-contiguity-with-a-force-directed-graph
 
 # --description--
 
-**目標:** <https://codepen.io/freeCodeCamp/full/xVopBo> と同じような機能を持つ、[CodePen.io](https://codepen.io) アプリを構築してください。
+**Objective:** Build an app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/XWEONRz>.
 
-以下の[ユーザーストーリー](https://en.wikipedia.org/wiki/User_story)を実装してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
+Fulfill the below user stories and get all of the tests to pass. 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
 
 **ユーザーストーリー:** どの国が国境を共有しているかを示す力学モデルによるグラフ (Force-directed Graph) を見ることができます。
 
@@ -22,7 +22,7 @@ dashedName: show-national-contiguity-with-a-force-directed-graph
 
 完了したら、CodePen のプロジェクトへのリンクを入れて、「このチャレンジを完了しました」ボタンをクリックしてください。
 
-[freeCodeCamp フォーラム](https://forum.freecodecamp.org/c/project-feedback/409)でプロジェクトを共有することにより、フィードバックを得ることができます。
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/show-the-local-weather.md b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
index 7c712105c64..e2e6f37c718 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
@@ -8,11 +8,11 @@ dashedName: show-the-local-weather
 
 # --description--
 
-**目標:** <https://codepen.io/freeCodeCamp/full/bELRjV> と同じような機能を持つ、[CodePen.io](https://codepen.io) アプリを構築してください。
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/bELRjV" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/bELRjV</a>.
 
 **ルール #1:** 模範プロジェクトのコードを見ないようにしてください。 自分の力で解いてみてください。
 
-**ルール #2:** 以下の[ユーザーストーリー](https://en.wikipedia.org/wiki/User_story)を実装してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
+**Rule #2:** Fulfill the below user stories and get all of the tests to pass. 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
 
 **ユーザーストーリー:** 現在地の天気を見ることができます。
 
@@ -20,11 +20,11 @@ dashedName: show-the-local-weather
 
 **ユーザーストーリー:** ボタンを押して華氏と摂氏の間を切り替えることができます。
 
-**注:** 多くのインターネットブラウザーは現在、HTML5 Geolocation 経由でユーザーのロケールを取得するために、HTTP セキュア (`https://`) 接続を必要とするようになっています。 このため、HTML5 Geolocation を使用してユーザーの場所を取得し、それから HTTP セキュア接続を使用して天気情報を取得する freeCodeCamp の Weather API <https://weather-proxy.freecodecamp.rocks/> を使用することをお勧めします。 また、必ず `https://` 経由で [CodePen.io](https://codepen.io) に接続してください。
+**注:** 多くのインターネットブラウザーは現在、HTML5 Geolocation 経由でユーザーのロケールを取得するために、HTTP セキュア (`https://`) 接続を必要とするようになっています。 For this reason, we recommend using HTML5 Geolocation to get user location and then use the freeCodeCamp Weather API <a href="https://weather-proxy.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://weather-proxy.freecodecamp.rocks/</a> which uses an HTTP Secure connection for the weather. Also, be sure to connect to <a href="https://codepen.io" target="_blank" rel="noopener noreferrer nofollow">CodePen.io</a> via `https://`.
 
 完了したら、CodePen のプロジェクトへのリンクを入れて、「このチャレンジを完了しました」ボタンをクリックしてください。
 
-[freeCodeCamp フォーラム](https://forum.freecodecamp.org/c/project-feedback/409)でプロジェクトを共有することにより、フィードバックを得ることができます。
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
index 3c672d53b88..f31bcca4a33 100644
--- a/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
+++ b/curriculum/challenges/japanese/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
@@ -8,25 +8,25 @@ dashedName: use-the-twitch-json-api
 
 # --description--
 
-**目標:** [https://codepen.io/freeCodeCamp/full/Myvqmo](https://codepen.io/freeCodeCamp/full/Myvqmo/) と同じような機能を持つ、[CodePen.io](https://codepen.io) アプリを構築してください。
+**Objective:** Build an app that is functionally similar to this: <a href="https://codepen.io/freeCodeCamp/full/Myvqmo/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/Myvqmo/</a>.
 
-以下の[ユーザーストーリー](https://en.wikipedia.org/wiki/User_story)を実装してください。 必要に応じて、どのようなライブラリあるいは API を使用してもかまいません。 あなたの独自のスタイルにしましょう。
+The Twitch API is a RESTful API that lets developers build creative integrations for the broader Twitch community.
 
-**ユーザーストーリー:** freeCodeCamp が現在 Twitch.tv にストリーミングしているかどうかがわかります。
+Fulfill the below user stories and get all of the tests to pass. Use whichever libraries or APIs you need. Give it your own personal style.
 
-**ユーザーストーリー:** ステータス出力をクリックすると、freeCodeCamp の Twitch.tv チャンネルに直接移動することができます。
+**User Story:** I can see whether freeCodeCamp is currently streaming on Twitch.tv.
 
-**ユーザーストーリー:** ストリーミング中の Twitch ユーザーがストリーミングしているものについて、詳細を見ることができます。
+**User Story:** I can click the status output and be sent directly to the freeCodeCamp's Twitch.tv channel.
 
-**ヒント:** Twitch.tv の JSON API について関連するドキュメントはこちらです: <https://dev.twitch.tv/docs/api/reference/#get-streams>
+**User Story:** If a Twitch user is currently streaming, I can see additional details about what they are streaming.
 
 **ヒント:** 定期的にストリーミングする人の Twitch.tv ユーザー名の配列は次のとおりです: `["ESL_SC2", "OgamingSC2", "cretetion", "freecodecamp", "storbeck", "habathcx", "RobotCaleb", "noobs2ninjas"]`
 
-**更新:** API の使用状況の変化によって、Twitch.tv は API キーを必要としますが、私達は回避策を作りました。 Twitch API の ベース URL (すなわち、`https://api.twitch.tv/helix`) の代わりに <https://twitch-proxy.freecodecamp.rocks/> を使用することで、API キーにサインアップしなくても、アカウント情報を取得できます。
+**更新:** API の使用状況の変化によって、Twitch.tv は API キーを必要としますが、私達は回避策を作りました。 Use <a href="https://twitch-proxy.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://twitch-proxy.freecodecamp.rocks/</a> instead of Twitch's API base URL and you'll still be able to get account information, without needing to sign up for an API key.
 
 完了したら、CodePen のプロジェクトへのリンクを入れて、「このチャレンジを完了しました」ボタンをクリックしてください。
 
-[freeCodeCamp フォーラム](https://forum.freecodecamp.org/c/project-feedback/409)でプロジェクトを共有することにより、フィードバックを得ることができます。
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/japanese/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md b/curriculum/challenges/japanese/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md
index df1966dbf4a..a94c2f2823e 100644
--- a/curriculum/challenges/japanese/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md
+++ b/curriculum/challenges/japanese/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md
@@ -8,19 +8,52 @@ dashedName: book-recommendation-engine-using-knn
 
 # --description--
 
-このチャレンジでは、K 近傍法を使用した書籍推薦アルゴリズムを作成します。
+You will be <a href="https://colab.research.google.com/github/freeCodeCamp/boilerplate-book-recommendation-engine/blob/master/fcc_book_recommendation_knn.ipynb" target="_blank" rel="noopener noreferrer nofollow">working on this project with Google Colaboratory</a>.
 
-ブッククロッシングのデータセットを使用します。 このデータセットには、90,000 人のユーザーによる 270,000 冊の 110 万件 (一冊当たり 1 ～ 10 件) の評価が含まれています。
+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 でプロジェクト全体の案内とスターターコード](https://colab.research.google.com/github/freeCodeCamp/boilerplate-book-recommendation-engine/blob/master/fcc_book_recommendation_knn.ipynb)にアクセスできます。
+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.
 
-このリンクにアクセスした後、自分のアカウントに、またはローカルに、ノートブックのコピーを作成してください。 プロジェクトを完了し、テストに合格したら (テストはリンクに含まれています)、下記にプロジェクトリンクを送信してください。 Google Colaboratory のリンクを送信する場合は、「リンクを貼った人」のリンク共有を必ず有効にしてください。
+# --instructions--
 
-機械学習カリキュラム向けの対話型教育コンテンツを引き続き開発中です。 現在、この認定講座のビデオチャレンジを実行できます。 また、実際のプロジェクトの取り組みと同様に、場合によってはその他の学習資料を探す必要もあります。
+In this challenge, you will create a book recommendation algorithm using **K-Nearest Neighbors**.
+
+You will use the <a href="http://www2.informatik.uni-freiburg.de/~cziegler/BX/" target="_blank" rel="noopener noreferrer nofollow">Book-Crossings dataset</a>. This dataset contains 1.1 million ratings (scale of 1-10) of 270,000 books by 90,000 users.
+
+After importing and cleaning the data, use `NearestNeighbors` from `sklearn.neighbors` to develop a model that shows books that are similar to a given book. The Nearest Neighbors algorithm measures the distance to determine the “closeness” of instances.
+
+Create a function named `get_recommends` that takes a book title (from the dataset) as an argument and returns a list of 5 similar books with their distances from the book argument.
+
+This code:
+
+```py
+get_recommends("The Queen of the Damned (Vampire Chronicles (Paperback))")
+```
+
+should return:
+
+```py
+[
+  'The Queen of the Damned (Vampire Chronicles (Paperback))',
+  [
+    ['Catch 22', 0.793983519077301], 
+    ['The Witching Hour (Lives of the Mayfair Witches)', 0.7448656558990479], 
+    ['Interview with the Vampire', 0.7345068454742432],
+    ['The Tale of the Body Thief (Vampire Chronicles (Paperback))', 0.5376338362693787],
+    ['The Vampire Lestat (Vampire Chronicles, Book II)', 0.5178412199020386]
+  ]
+]
+```
+
+Notice that the data returned from `get_recommends()` is a list. The first element in the list is the book title passed into the function. The second element in the list is a list of five more lists. Each of the five lists contains a recommended book and the distance from the recommended book to the book passed into the function.
+
+If you graph the dataset (optional), you will notice that most books are not rated frequently. To ensure statistical significance, remove from the dataset users with less than 200 ratings and books with less than 100 ratings.
+
+The first three cells import libraries you may need and the data to use. The final cell is for testing. Write all your code in between those cells.
 
 # --hints--
 
-すべての Python テストに合格する必要があります。
+It should pass all Python tests.
 
 ```js
 
diff --git a/curriculum/challenges/japanese/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md b/curriculum/challenges/japanese/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md
index 1172a2ef5f8..25297a31f6e 100644
--- a/curriculum/challenges/japanese/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md
+++ b/curriculum/challenges/japanese/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md
@@ -8,17 +8,101 @@ dashedName: cat-and-dog-image-classifier
 
 # --description--
 
-このチャレンジでは、TensorFlow 2.0 と Keras を使用して、猫と犬の画像を 63% 以上の精度で正しく分類する畳み込みニューラルネットワークを作成します。
+You will be <a href="https://colab.research.google.com/github/freeCodeCamp/boilerplate-cat-and-dog-image-classifier/blob/master/fcc_cat_dog.ipynb" target="_blank" rel="noopener noreferrer nofollow">working on this project with Google Colaboratory</a>.
 
-[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 のリンクを送信する場合は、「リンクを貼った人」のリンク共有を必ず有効にしてください。
+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.
 
-機械学習カリキュラム向けの対話型教育コンテンツを引き続き開発中です。 現在、この認定講座のビデオチャレンジを実行できます。 また、実際のプロジェクトの取り組みと同様に、場合によってはその他の学習資料を探す必要もあります。
+# --instructions--
+
+For this challenge, you will complete the code  to classify images of dogs and cats. You will use TensorFlow 2.0 and Keras to create a convolutional neural network that correctly classifies images of cats and dogs at least 63% of the time. (Extra credit if you get it to 70% accuracy!)
+
+Some of the code is given to you but some code you must fill in to complete this challenge. Read the instruction in each text cell so you will know what you have to do in each code cell.
+
+The first code cell imports the required libraries. The second code cell downloads the data and sets key variables. The third cell is the first place you will write your own code.
+
+The structure of the dataset files that are downloaded looks like this (You will notice that the test directory has no subdirectories and the images are not labeled):
+
+```py
+cats_and_dogs
+|__ train:
+    |______ cats: [cat.0.jpg, cat.1.jpg ...]
+    |______ dogs: [dog.0.jpg, dog.1.jpg ...]
+|__ validation:
+    |______ cats: [cat.2000.jpg, cat.2001.jpg ...]
+    |______ dogs: [dog.2000.jpg, dog.2001.jpg ...]
+|__ test: [1.jpg, 2.jpg ...]
+```
+
+You can tweak epochs and batch size if you like, but it is not required.
+
+The following instructions correspond to specific cell numbers, indicated with a comment at the top of the cell (such as `# 3`).
+
+## Cell 3
+
+Now it is your turn! Set each of the variables in this cell correctly. (They should no longer equal `None`.)
+
+Create image generators for each of the three image data sets (train, validation, test). Use `ImageDataGenerator` to read / decode the images and convert them into floating point tensors. Use the `rescale` argument (and no other arguments for now) to rescale the tensors from values between 0 and 255 to values between 0 and 1.
+
+For the `*_data_gen` variables, use the `flow_from_directory` method. Pass in the batch size, directory, target size (`(IMG_HEIGHT, IMG_WIDTH)`), class mode, and anything else required. `test_data_gen` will be the trickiest one. For `test_data_gen`, make sure to pass in `shuffle=False` to the `flow_from_directory` method. This will make sure the final predictions stay is in the order that our test expects. For `test_data_gen` it will also be helpful to observe the directory structure.
+
+
+After you run the code, the output should look like this:
+
+```py
+Found 2000 images belonging to 2 classes.
+Found 1000 images belonging to 2 classes.
+Found 50 images belonging to 1 class.
+```
+
+## Cell 4
+
+The `plotImages` function will be used a few times to plot images. It takes an array of images and a probabilities list, although the probabilities list is optional. This code is given to you. If you created the `train_data_gen` variable correctly, then running this cell will plot five random training images.
+
+## Cell 5
+
+Recreate the `train_image_generator` using `ImageDataGenerator`.
+
+Since there are a small number of training examples, there is a risk of overfitting. One way to fix this problem is by creating more training data from existing training examples by using random transformations.
+
+Add 4-6 random transformations as arguments to `ImageDataGenerator`. Make sure to rescale the same as before.
+
+## Cell 6
+
+You don't have to do anything for this cell. `train_data_gen` is created just like before but with the new `train_image_generator`. Then, a single image is plotted five different times using different variations.
+
+## Cell 7
+
+In this cell, create a model for the neural network that outputs class probabilities. It should use the Keras Sequential model. It will probably involve a stack of Conv2D and MaxPooling2D layers and then a fully connected layer on top that is activated by a ReLU activation function.
+
+Compile the model passing the arguments to set the optimizer and loss. Also pass in `metrics=['accuracy']` to view training and validation accuracy for each training epoch.
+
+## Cell 8
+
+Use the `fit` method on your `model` to train the network. Make sure to pass in arguments for `x`, `steps_per_epoch`, `epochs`, `validation_data`, and `validation_steps`.
+
+## Cell 9
+
+Run this cell to visualize the accuracy and loss of the model.
+
+## Cell 10
+
+Now it is time to use your model to predict whether a brand new image is a cat or a dog.
+
+In this cell, get the probability that each test image (from `test_data_gen`) is a dog or a cat. `probabilities` should be a list of integers.
+
+Call the `plotImages` function and pass in the test images and the probabilities corresponding to each test image.
+
+After you run the cell, you should see all 50 test images with a label showing the percentage of "sure" that the image is a cat or a dog. The accuracy will correspond to the accuracy shown in the graph above (after running the previous cell). More training images could lead to a higher accuracy.
+
+## Cell 11
+
+Run this final cell to see if you passed the challenge or if you need to keep trying.
 
 # --hints--
 
-すべての Python テストに合格する必要があります。
+It should pass all Python tests.
 
 ```js
 
diff --git a/curriculum/challenges/japanese/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md b/curriculum/challenges/japanese/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md
index 4df341061ec..fbea101a177 100644
--- a/curriculum/challenges/japanese/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md
+++ b/curriculum/challenges/japanese/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md
@@ -8,19 +8,33 @@ dashedName: linear-regression-health-costs-calculator
 
 # --description--
 
-このチャレンジでは、回帰アルゴリズムを使用して医療費を予測します。
+このプロジェクトには <a href="https://colab.research.google.com/github/freeCodeCamp/boilerplate-linear-regression-health-costs-calculator/blob/master/fcc_predict_health_costs_with_regression.ipynb" target="_blank" rel="noopener noreferrer nofollow">Google Colaboratory</a> を使用して取り組んでください。
 
-医療費を含むさまざまな人々に関する情報を含むデータセットが与えられます。 データを使用し、新しいデータに基づいて医療費を予測してください。
+このリンクにアクセスした後、自分のアカウントに、またはローカルに、ノートブックのコピーを作成してください。 プロジェクトを完了し、テストに合格したら (テストはリンクに含まれています)、下記にプロジェクトリンクを送信してください。 Google Colaboratory のリンクを送信する場合は、リンクの共有設定を必ず「リンクを知っている全員」に設定してください。
 
-[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 のリンクを送信する場合は、「リンクを貼った人」のリンク共有を必ず有効にしてください。
+# --instructions--
 
-機械学習カリキュラム向けの対話型教育コンテンツを引き続き開発中です。 現在、この認定講座のビデオチャレンジを実行できます。 また、実際のプロジェクトの取り組みと同様に、場合によってはその他の学習資料を探す必要もあります。
+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.
+
+The first two cells of this notebook import libraries and the data.
+
+Make sure to convert categorical data to numbers. Use 80% of the data as the `train_dataset` and 20% of the data as the `test_dataset`.
+
+`pop` off the "expenses" column from these datasets to create new datasets called `train_labels` and `test_labels`. Use these labels when training your model.
+
+Create a model and train it with the `train_dataset`. Run the final cell in this notebook to check your model. The final cell will use the unseen `test_dataset` to check how well the model generalizes.
+
+To pass the challenge, `model.evaluate` must return a Mean Absolute Error of under 3500. This means it predicts health care costs correctly within $3500.
+
+The final cell will also predict expenses using the `test_dataset` and graph the results.
 
 # --hints--
 
-すべての Python テストに合格する必要があります。
+It should pass all Python tests.
 
 ```js
 
diff --git a/curriculum/challenges/japanese/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md b/curriculum/challenges/japanese/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
index 2e5826821a2..33d800d817f 100644
--- a/curriculum/challenges/japanese/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
+++ b/curriculum/challenges/japanese/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
@@ -8,17 +8,57 @@ dashedName: rock-paper-scissors
 
 # --description--
 
-このチャレンジでは、じゃんけんするプログラムを作成します。 ランダムに選択するプログラムの勝率は、通常は 50% になります。 このチャレンジに合格するには、プログラムで 4 つの異なるボットを相手に試合を行う必要があり、各試合で 60％ 以上の勝率を達成しなければなりません。
+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.
 
-[Replit でプロジェクトの詳細とスターターコード](https://replit.com/github/freeCodeCamp/boilerplate-rock-paper-scissors)にアクセスできます。
+You will be <a href="https://replit.com/github/freeCodeCamp/boilerplate-rock-paper-scissors" target="_blank" rel="noopener noreferrer nofollow">working on this project with our Replit starter code</a>.
 
-このリンクにアクセスした後、プロジェクトをフォークしてください。 '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.
 
-機械学習カリキュラム向けの対話型教育パートを引き続き開発中です。 現在、このチャレンジに合格する方法を学ぶには他の資料を活用する必要があります。
+# --instructions--
+
+In the file `RPS.py` you are provided with a function called `player`. The function takes an argument that is a string describing the last move of the opponent ("R", "P", or "S"). The function should return a string representing the next move for it to play ("R", "P", or "S").
+
+A player function will receive an empty string as an argument for the first game in a match since there is no previous play.
+
+The file `RPS.py` shows an example function that you will need to update. The example function is defined with two arguments (`player(prev_play, opponent_history = [])`). The function is never called with a second argument so that one is completely optional. The reason why the example function contains a second argument (`opponent_history = []`) is because that is the only way to save state between consecutive calls of the `player` function. You only need the `opponent_history` argument if you want to keep track of the opponent_history.
+
+*Hint: To defeat all four opponents, your program may need to have multiple strategies that change depending on the plays of the opponent.*
+
+## Development
+
+Do not modify `RPS_game.py`. Write all your code in `RPS.py`. For development, you can use `main.py` to test your code.
+
+`main.py` imports the game function and bots from `RPS_game.py`.
+
+To test your code, play a game with the `play` function. The `play` function takes four arguments:
+
+- two players to play against each other (the players are actually functions)
+- the number of games to play in the match
+- an optional argument to see a log of each game. Set it to `True` to see these messages.
+
+```py
+play(player1, player2, num_games[, verbose])
+```
+
+For example, here is how you would call the function if you want `player` and `quincy` to play 1000 games against each other and you want to see the results of each game:
+
+```py
+play(player, quincy, 1000, verbose=True)
+```
+
+Click the "run" button and `main.py` will run.
+
+## Testing
+
+The unit tests for this project are in `test_module.py`. We imported the tests from `test_module.py` to `main.py` for your convenience. If you uncomment the last line in `main.py`, the tests will run automatically whenever you hit the "run" button.
+
+## Submitting
+
+Copy your project's URL and submit it below.
 
 # --hints--
 
-すべての Python テストに合格する必要があります。
+It should pass all Python tests.
 
 ```js
 
diff --git a/curriculum/challenges/japanese/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md b/curriculum/challenges/japanese/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md
index 8f6e4c3c7fa..6d6a8db9ca0 100644
--- a/curriculum/challenges/japanese/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md
+++ b/curriculum/challenges/japanese/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md
@@ -14,7 +14,7 @@ dashedName: neural-networks-activation-functions
 
 ## --text--
 
--1 ～ 1 の間で値が切り替わる活性化関数はどれですか？
+Which activation function squishes values between -1 and 1?
 
 ## --answers--
 
diff --git a/curriculum/challenges/japanese/13-relational-databases/build-a-number-guessing-game-project/build-a-number-guessing-game.md b/curriculum/challenges/japanese/13-relational-databases/build-a-number-guessing-game-project/build-a-number-guessing-game.md
index 16ca001c196..635a800cab6 100644
--- a/curriculum/challenges/japanese/13-relational-databases/build-a-number-guessing-game-project/build-a-number-guessing-game.md
+++ b/curriculum/challenges/japanese/13-relational-databases/build-a-number-guessing-game-project/build-a-number-guessing-game.md
@@ -13,11 +13,11 @@ dashedName: build-a-number-guessing-game
 
 # --instructions--
 
-**重要:** プロジェクトのテストすべてに合格した後に、データベースのダンプを `number_guessers.sql` ファイルに保存し、あわせて `number_guessing_game` フォルダー全体も保存することで、ステップ 2 を完了できます。 仮想マシン内にその方法についての説明があります。
+**Important:** After you pass all the project tests, save a dump of your database into a `number_guess.sql` file, as well as your `number_guess.sh` file, so you can complete step 2. There will be instructions on how to do that within the virtual machine.
 
 # --notes--
 
-必須のファイル: `number_guessers.sql` と、 `number_guessing_game` フォルダー
+Required files: `number_guess.sql`, `number_guess.sh`
 
 # --hints--
 
diff --git a/curriculum/challenges/japanese/13-relational-databases/build-a-periodic-table-database-project/build-a-periodic-table-database.md b/curriculum/challenges/japanese/13-relational-databases/build-a-periodic-table-database-project/build-a-periodic-table-database.md
index 2b8a7bdf678..c32aa0187ee 100644
--- a/curriculum/challenges/japanese/13-relational-databases/build-a-periodic-table-database-project/build-a-periodic-table-database.md
+++ b/curriculum/challenges/japanese/13-relational-databases/build-a-periodic-table-database-project/build-a-periodic-table-database.md
@@ -13,11 +13,11 @@ dashedName: build-a-periodic-table-database
 
 # --instructions--
 
-**重要:** プロジェクトのテストすべてに合格した後に、データベースのダンプを `elements.sql` ファイルに保存し、あわせて `periodic_table` フォルダー全体も保存することで、ステップ 2 を完了できます。 仮想マシン内にその方法についての説明があります。
+**Important:** After you pass all the project tests, save a dump of your database into a `periodic_table.sql` file, as well as your `element.sh` file, so you can complete step 2. There will be instructions on how to do that within the virtual machine.
 
 # --notes--
 
-必須のファイル: `elements.sql` と `periodic_table` フォルダー全体
+Required files: `periodic_table.sql`, `element.sh`
 
 # --hints--
 
diff --git a/curriculum/challenges/japanese/13-relational-databases/learn-advanced-bash-by-building-a-kitty-ipsum-translator/build-a-kitty-ipsum-translator.md b/curriculum/challenges/japanese/13-relational-databases/learn-advanced-bash-by-building-a-kitty-ipsum-translator/build-a-kitty-ipsum-translator.md
index c3faebe93f0..c7799ceb468 100644
--- a/curriculum/challenges/japanese/13-relational-databases/learn-advanced-bash-by-building-a-kitty-ipsum-translator/build-a-kitty-ipsum-translator.md
+++ b/curriculum/challenges/japanese/13-relational-databases/learn-advanced-bash-by-building-a-kitty-ipsum-translator/build-a-kitty-ipsum-translator.md
@@ -9,7 +9,7 @@ dashedName: build-a-kitty-ipsum-translator
 
 # --description--
 
-この 140 のレッスンから成るコースでは、より複雑なコマンドと、コマンドの仕組みについて学びます。
+In this 140-lesson course, you will learn some more complex commands, and the details of how commands work.
 
 # --instructions--
 
diff --git a/curriculum/challenges/japanese/13-relational-databases/learn-bash-and-sql-by-building-a-bike-rental-shop/build-a-bike-rental-shop.md b/curriculum/challenges/japanese/13-relational-databases/learn-bash-and-sql-by-building-a-bike-rental-shop/build-a-bike-rental-shop.md
index 270cb266ee2..8463a47f5e2 100644
--- a/curriculum/challenges/japanese/13-relational-databases/learn-bash-and-sql-by-building-a-bike-rental-shop/build-a-bike-rental-shop.md
+++ b/curriculum/challenges/japanese/13-relational-databases/learn-bash-and-sql-by-building-a-bike-rental-shop/build-a-bike-rental-shop.md
@@ -9,7 +9,7 @@ dashedName: build-a-bike-rental-shop
 
 # --description--
 
-この 210 のレッスンから成るコースでは、PostgreSQL を使用して、自転車レンタルショップのレンタル情報を保存するインタラクティブな Bash プログラムを構築します。
+In this 210-lesson course, you will build an interactive Bash program that stores rental information for your bike rental shop using PostgreSQL.
 
 # --instructions--
 
diff --git a/curriculum/challenges/japanese/13-relational-databases/learn-bash-by-building-a-boilerplate/build-a-boilerplate.md b/curriculum/challenges/japanese/13-relational-databases/learn-bash-by-building-a-boilerplate/build-a-boilerplate.md
index e2184beb3d0..942cd63e7a6 100644
--- a/curriculum/challenges/japanese/13-relational-databases/learn-bash-by-building-a-boilerplate/build-a-boilerplate.md
+++ b/curriculum/challenges/japanese/13-relational-databases/learn-bash-by-building-a-boilerplate/build-a-boilerplate.md
@@ -9,7 +9,7 @@ dashedName: build-a-boilerplate
 
 # --description--
 
-この 170 のレッスンから成るコースでは、コマンドラインのみを使用してウェブサイトのボイラープレートを作成することで、基本のコマンドについて学習します。
+In this 170-lesson course, you will learn terminal commands by creating a website boilerplate using only the command line.
 
 # --instructions--
 
diff --git a/curriculum/challenges/japanese/13-relational-databases/learn-bash-scripting-by-building-five-programs/build-five-programs.md b/curriculum/challenges/japanese/13-relational-databases/learn-bash-scripting-by-building-five-programs/build-five-programs.md
index 4af58f60ccf..b0742296660 100644
--- a/curriculum/challenges/japanese/13-relational-databases/learn-bash-scripting-by-building-five-programs/build-five-programs.md
+++ b/curriculum/challenges/japanese/13-relational-databases/learn-bash-scripting-by-building-five-programs/build-five-programs.md
@@ -9,7 +9,7 @@ dashedName: build-five-programs
 
 # --description--
 
-この 220 のレッスンから成るコースでは、5 つの小規模なプログラムを作成しながら、より多くのターミナルコマンドと、Bash スクリプトでの使い方を学びます。
+In this 220-lesson course, you will learn more terminal commands and how to use them within Bash scripts by creating five small programs.
 
 # --instructions--
 
diff --git a/curriculum/challenges/japanese/13-relational-databases/learn-git-by-building-an-sql-reference-object/build-an-sql-reference-object.md b/curriculum/challenges/japanese/13-relational-databases/learn-git-by-building-an-sql-reference-object/build-an-sql-reference-object.md
index 882a94988c2..22b9994212c 100644
--- a/curriculum/challenges/japanese/13-relational-databases/learn-git-by-building-an-sql-reference-object/build-an-sql-reference-object.md
+++ b/curriculum/challenges/japanese/13-relational-databases/learn-git-by-building-an-sql-reference-object/build-an-sql-reference-object.md
@@ -9,7 +9,7 @@ dashedName: build-an-sql-reference-object
 
 # --description--
 
-この 240 のレッスンから成るコースでは、よく使われる SQL コマンドをデータとして持つオブジェクトを作成しながら、Git がどのようにしてコードの履歴を記録するかを学びます。
+In this 240-lesson course, you will learn how Git keeps track of your code by creating an object containing commonly used SQL commands.
 
 # --instructions--
 
diff --git a/curriculum/challenges/japanese/13-relational-databases/learn-nano-by-building-a-castle/build-a-castle.md b/curriculum/challenges/japanese/13-relational-databases/learn-nano-by-building-a-castle/build-a-castle.md
index d5ba4929089..7ee78bc6544 100644
--- a/curriculum/challenges/japanese/13-relational-databases/learn-nano-by-building-a-castle/build-a-castle.md
+++ b/curriculum/challenges/japanese/13-relational-databases/learn-nano-by-building-a-castle/build-a-castle.md
@@ -9,7 +9,7 @@ dashedName: build-a-castle
 
 # --description--
 
-この 40 のレッスンから成るコースでは、城の絵を作りながら、ターミナルでファイルを編集する方法を学びます。
+In this 40-lesson course, you will learn how to edit files in the terminal with Nano while building a castle.
 
 # --instructions--
 
diff --git a/curriculum/challenges/japanese/13-relational-databases/learn-relational-databases-by-building-a-mario-database/build-a-mario-database.md b/curriculum/challenges/japanese/13-relational-databases/learn-relational-databases-by-building-a-mario-database/build-a-mario-database.md
index 5a190fa1af7..b6b598309c7 100644
--- a/curriculum/challenges/japanese/13-relational-databases/learn-relational-databases-by-building-a-mario-database/build-a-mario-database.md
+++ b/curriculum/challenges/japanese/13-relational-databases/learn-relational-databases-by-building-a-mario-database/build-a-mario-database.md
@@ -9,7 +9,7 @@ dashedName: build-a-mario-database
 
 # --description--
 
-この 165 のレッスンから成るコースでは、テレビゲームのキャラクターのデータが入った PostgreSQL データベースを作成することで、リレーショナルデータベースの基礎を学習します。
+In this 165-lesson course, you will learn the basics of a relational database by creating a PostgreSQL database filled with video game characters.
 
 # --instructions--
 
diff --git a/curriculum/challenges/japanese/13-relational-databases/learn-sql-by-building-a-student-database-part-1/build-a-student-database-part-1.md b/curriculum/challenges/japanese/13-relational-databases/learn-sql-by-building-a-student-database-part-1/build-a-student-database-part-1.md
index 28df535d172..bfce8baad46 100644
--- a/curriculum/challenges/japanese/13-relational-databases/learn-sql-by-building-a-student-database-part-1/build-a-student-database-part-1.md
+++ b/curriculum/challenges/japanese/13-relational-databases/learn-sql-by-building-a-student-database-part-1/build-a-student-database-part-1.md
@@ -9,7 +9,7 @@ dashedName: build-a-student-database-part-1
 
 # --description--
 
-この 140 のレッスンから成るコースでは、SQL でコンピューター科学の学生達の情報を PostgreSQL データベースに入力する、Bash スクリプトを作成します。
+In this 140-lesson course, you will create a Bash script that uses SQL to enter information about your computer science students into PostgreSQL.
 
 # --instructions--
 
diff --git a/curriculum/challenges/japanese/13-relational-databases/learn-sql-by-building-a-student-database-part-2/build-a-student-database-part-2.md b/curriculum/challenges/japanese/13-relational-databases/learn-sql-by-building-a-student-database-part-2/build-a-student-database-part-2.md
index b3328acbd71..2e0226f9a0f 100644
--- a/curriculum/challenges/japanese/13-relational-databases/learn-sql-by-building-a-student-database-part-2/build-a-student-database-part-2.md
+++ b/curriculum/challenges/japanese/13-relational-databases/learn-sql-by-building-a-student-database-part-2/build-a-student-database-part-2.md
@@ -9,7 +9,7 @@ dashedName: build-a-student-database-part-2
 
 # --description--
 
-この 140 のレッスンから成るコースでは、SQL コマンドをより深く掘り下げながら、学生データベースを完成させます。
+In this 140-lesson course, you will complete your student database while diving deeper into SQL commands.
 
 # --instructions--
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md b/curriculum/challenges/japanese/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md
index 83488b23211..ce39c53575e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md
@@ -91,7 +91,7 @@ const el = document.getElementById('name')
 assert(!!el && el.required)
 ```
 
-`#name` は `#survey-form` の子孫要素である必要があります。
+Your `#name` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #name')
@@ -119,7 +119,7 @@ const el = document.getElementById('email')
 assert(!!el && el.required)
 ```
 
-`#email` は `#survey-form` の子孫要素である必要があります
+Your `#email` should be a descendant of `#survey-form`
 
 ```js
 const el = document.querySelector('#survey-form #email')
@@ -133,7 +133,7 @@ const el = document.getElementById('number')
 assert(!!el && el.tagName === 'INPUT')
 ```
 
-`#number` は `#survey-form` の子孫要素である必要があります。
+Your `#number` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #number')
@@ -203,21 +203,21 @@ const el = document.getElementById('number-label')
 assert(!!el && el.innerText.length > 0)
 ```
 
-`#name-label` は `#survey-form` の子孫要素である必要があります。
+Your `#name-label` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #name-label')
 assert(!!el)
 ```
 
-`#email-label` は `#survey-form` の子孫要素である必要があります。
+Your `#email-label` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #email-label')
 assert(!!el)
 ```
 
-`#number-label` は `#survey-form` の子孫要素である必要があります。
+Your `#number-label` should be a descendant of `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #number-label')
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
index bb1f381b76f..10f43b5fe50 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
@@ -9,7 +9,7 @@ dashedName: step-56
 
 `input` ボックスの位置を揃えるため、`.info` 要素内のすべての `input` と `label` 要素を対象に、`display` プロパティを `inline-block` に設定してください。
 
-さらに、テキストを右側にそろえてください。
+Also, align the `label` element's text to the right.
 
 # --hints--
 
@@ -28,22 +28,14 @@ const display = gs('.info > label, .info > input') ?? gs('.info label, .info inp
 assert.equal(display, 'inline-block');
 ```
 
-`input` と `label` 要素の `text-align` を `right` に設定する必要があります。
+You should give the `label` element a `text-align` of `right`.
 
 ```js
 const gs = (s) => new __helpers.CSSHelp(document).getStyle(s)?.textAlign;
-const textAlign = gs('.info > label, .info > input') ?? gs('.info label, .info input') ?? gs('.info > input, .info > label') ?? gs('.info input, .info label');
+const textAlign = gs('.info > label') ?? gs('.info label');
 assert.equal(textAlign, 'right');
 ```
 
-`text-align: right` プロパティの設定は `.info input` ルールより前で行う必要があります。
-
-```js
-const gs = (s) => new __helpers.CSSHelp(document).getStyleRule(s);
-assert(gs('.info input').isDeclaredAfter('.info label, .info input') || gs('.info input').isDeclaredAfter('.info > label, .info > input') || gs('.info input').isDeclaredAfter('.info > input, .info > label') || gs('.info input').isDeclaredAfter('.info input, .info label'));
-
-```
-
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
index 71fe8d8b193..62695acc9fb 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
@@ -286,7 +286,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -297,6 +296,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 --fcc-editable-region--
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
index 374e69f6513..45f548d3192 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
@@ -272,7 +272,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -283,6 +282,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
index 20eb0fd6fe5..e90e5f703ff 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
@@ -262,7 +262,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -273,6 +272,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
index 0667201b98b..75d7a3ec87e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
@@ -260,7 +260,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -271,6 +270,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
index b24067d62c3..e6d255177a6 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
@@ -300,7 +300,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -311,6 +310,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
index 11a845b4f19..a1b8052dfdf 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
@@ -266,7 +266,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -277,6 +276,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
index 4c133e70b60..87437ee6493 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
@@ -280,7 +280,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -291,6 +290,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
index 268bd042c99..9056a94f808 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
@@ -278,7 +278,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -289,6 +288,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
index 86dab228016..23530077e81 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
@@ -260,7 +260,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -271,6 +270,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
index 632813837d0..529f05a6f4e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
@@ -278,7 +278,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -289,6 +288,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
index 041e9c0638c..1ed7a11d275 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
@@ -280,7 +280,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -291,6 +290,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
@@ -603,12 +603,12 @@ input {
 .info label,
 .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .info input {
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
index c47f07de582..8abbb93c52c 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
@@ -7,38 +7,33 @@ dashedName: step-5
 
 # --description--
 
-カフェの名前は `CAMPER CAFE` です。 `h1` 要素を `body` 要素内に 1 つ追加してください。 そこにカフェの名前を目立つように大文字で入れてください。
+It's time to add some menu content. Add a `main` element within the existing `body` element. It will eventually contain pricing information about coffee and desserts offered by the cafe.
 
 # --hints--
 
-`<h1>` の開始タグが 1 つ必要です。
+Your code should have an opening `<main>` tag.
 
 ```js
-assert(code.match(/<h1>/i));
+assert(code.match(/<main>/i));
 ```
 
-終了タグ `</h1>` が 1 つ必要です。
+Your code should have a closing `</main>` tag.
 
 ```js
-assert(code.match(/<\/h1>/i));
+assert(code.match(/<\/main>/i));
 ```
 
-既存の `body` 要素を変更しないでください。
+You should not change your `body` element. Make sure you don't accidentally delete your closing tag.
 
 ```js
 assert($('body').length === 1);
 ```
 
-`h1` 要素は `body` 要素の中にネストされている必要があります。
+Your `main` tag should be within your `body` tag.
 
 ```js
-assert($('h1')[0].parentElement.tagName === "BODY");
-```
-
-`h1` 要素は `CAMPER CAFE` というテキストをもつ必要があります。
-
-```js
-assert(code.match(/<h1>CAMPER CAFE<\/h1>/));
+const main = document.querySelector('main');
+assert(main.parentElement.tagName === 'BODY');
 ```
 
 # --seed--
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
index 9bd232e2c9d..644db7f0fb1 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
@@ -7,38 +7,38 @@ dashedName: step-6
 
 # --description--
 
-カフェが 2020 年にオープンしたということを訪問者に知ってもらうために、`p` 要素を `h1` 要素の下に追加し、そのテキストを `Est. 2020` にしてください。
+The name of the cafe is `CAMPER CAFE`. Add an `h1` element within your `main` element. Give it the name of the cafe in capitalized letters to make it stand out.
 
 # --hints--
 
-`<p>` の開始タグが 1 つ必要です。
+You should have an opening `<h1>` tag.
 
 ```js
-assert(code.match(/<p>/i));
+assert(code.match(/<h1>/i));
 ```
 
-終了タグ `</p>` が 1 つ必要です。
+You should have a closing `</h1>` tag.
 
 ```js
-assert(code.match(/<\/p>/i));
+assert(code.match(/<\/h1>/i));
 ```
 
-既存の `h1` 要素を変更しないでください。 終了タグを削除していないか確認してください。
+You should not change your existing `main` element.
 
 ```js
-assert($('h1').length === 1);
+assert($('main').length === 1);
 ```
 
-`p` 要素は `h1` 要素の下に置く必要があります。
+Your `h1` element should be nested in your `main` element.
 
 ```js
-assert($('p')[0].previousElementSibling.tagName === 'H1');
+assert($('h1')[0].parentElement.tagName === "MAIN");
 ```
 
-`p` 要素は `Est. 2020` というテキストをもつ必要があります。
+Your `h1` element should have the text `CAMPER CAFE`.
 
 ```js
-assert(document.querySelector("p").innerText === "Est. 2020");
+assert(code.match(/<h1>CAMPER CAFE<\/h1>/));
 ```
 
 # --seed--
@@ -54,7 +54,8 @@ assert(document.querySelector("p").innerText === "Est. 2020");
   </head>
   <body>
 --fcc-editable-region--
-    <h1>CAMPER CAFE</h1>
+    <main>
+    </main>
 --fcc-editable-region--
   </body>
 </html>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
index f24dcee5f02..14c01f586e2 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
@@ -7,34 +7,38 @@ dashedName: step-7
 
 # --description--
 
-前回のステップで追加した `p` 要素はカフェについての補足情報を提供しているので、`h1` 要素と `p` 要素の両方を `header` 要素の中にネストしましょう。
+To let visitors know the cafe was founded in 2020, add a `p` element below the `h1` element with the text `Est. 2020`.
 
 # --hints--
 
-`<header>` の開始タグが 1 つ必要です。
+You should have an opening `<p>` tag.
 
 ```js
-assert(code.match(/<header>/i));
+assert(code.match(/<p>/i));
 ```
 
-終了タグ `</header>` が 1 つ必要です。
+You should have a closing `</p>` tag.
 
 ```js
-assert(code.match(/<\/header>/i));
+assert(code.match(/<\/p>/i));
 ```
 
-`h1` 要素は `header` 要素の中にネストされている必要があります。
+You should not change your existing `h1` element. Make sure you did not delete the closing tag.
 
 ```js
-const header = document.querySelectorAll('header')[0];
-assert(header.children[0].tagName === 'H1');
+assert($('h1').length === 1);
 ```
 
-`p` 要素は `header` 要素の中にネストされている必要があります。
+Your `p` element should be below your `h1` element.
 
 ```js
-const header = document.querySelectorAll('header')[0];
-assert(header.children[1].tagName === "P");
+assert($('p')[0].previousElementSibling.tagName === 'H1');
+```
+
+Your `p` element should have the text `Est. 2020`.
+
+```js
+assert(document.querySelector("p").innerText === "Est. 2020");
 ```
 
 # --seed--
@@ -49,10 +53,11 @@ assert(header.children[1].tagName === "P");
     <title>Cafe Menu</title>
   </head>
   <body>
+    <main>
 --fcc-editable-region--
-    <h1>CAMPER CAFE</h1>
-    <p>Est. 2020</p>
+      <h1>CAMPER CAFE</h1>
 --fcc-editable-region--
+    </main>
   </body>
 </html>
 ```
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md
index 6fdb0a7f1a4..e4af7ac7331 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344f9c805cd193c33d829c
-title: ステップ 12
+title: Step 11
 challengeType: 0
-dashedName: step-12
+dashedName: step-11
 ---
 
 # --description--
@@ -56,11 +56,9 @@ assert(h1TextAlign === 'center');
 --fcc-editable-region--
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md
index 4d7080a0929..08a260600a1 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fad8bf01691e71a30eb
-title: ステップ 11
+title: Step 10
 challengeType: 0
-dashedName: step-11
+dashedName: step-10
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(code.match(/<head\s*>[\w\W\s]*<style\s*>[\w\W\s]*<\/style\s*>[\w\W\s]*<\/
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md
index f2d15c184c4..f6a0b7678c5 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fbc22624a2976425065
-title: ステップ 10
+title: Step 9
 challengeType: 0
-dashedName: step-10
+dashedName: step-9
 ---
 
 # --description--
@@ -55,11 +55,9 @@ assert(h2.innerText === 'Coffee');
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
 --fcc-editable-region--
       <section>
       </section>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
index c8b8e0e14a3..34fc67a1bff 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fc1520b6719f2e35605
-title: ステップ 9
+title: Step 8
 challengeType: 0
-dashedName: step-9
+dashedName: step-8
 ---
 
 # --description--
@@ -32,8 +32,9 @@ assert($('main').length === 1);
 `section` 要素は `main` 要素の中にある必要があります。
 
 ```js
-const main = document.querySelectorAll('main')?.[0];
-assert(main.children[0].tagName === 'SECTION');
+const main = document.querySelector('main');
+const section = document.querySelector('section');
+assert(section.parentElement === main);
 ```
 
 # --seed--
@@ -48,12 +49,10 @@ assert(main.children[0].tagName === 'SECTION');
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
-      <h1>CAMPER CAFE</h1>
-      <p>Est. 2020</p>
-    </header>
 --fcc-editable-region--
     <main>
+      <h1>CAMPER CAFE</h1>
+      <p>Est. 2020</p>
     </main>
 --fcc-editable-region--
   </body>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md
index 038b46ae7ce..47dad4f9884 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477ae34c1239cafe128be
-title: ステップ 14
+title: Step 13
 challengeType: 0
-dashedName: step-14
+dashedName: step-13
 ---
 
 # --description--
@@ -58,11 +58,9 @@ assert(selectors.length === 1);
 --fcc-editable-region--
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md
index c3ebdd40892..b981df3fa45 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477ae8466a9a3d2cc953c
-title: ステップ 16
+title: Step 15
 challengeType: 0
-dashedName: step-16
+dashedName: step-15
 ---
 
 # --description--
@@ -46,11 +46,9 @@ HTML ファイル内に CSS セレクターが無いようにしてください
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md
index 69fc058096b..863ce6e9151 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md
@@ -1,13 +1,13 @@
 ---
 id: 5f3477ae9675db8bb7655b30
-title: ステップ 13
+title: Step 12
 challengeType: 0
-dashedName: step-13
+dashedName: step-12
 ---
 
 # --description--
 
-前のステップで、<dfn>要素型セレクター</dfn>を使用して `h1` 要素にスタイルを適用しました。 次は、それぞれ新しく要素型セレクターを追加して、`h2` 要素と `p` 要素を中央に配置してください。
+前のステップで、<dfn>要素型セレクター</dfn>を使用して `h1` 要素にスタイルを適用しました。 Center the `h2` and `p` elements by adding a new type selector for each one to the existing `style` element.
 
 # --hints--
 
@@ -18,35 +18,42 @@ const hasH1 = new __helpers.CSSHelp(document).getStyle('h1');
 assert(hasH1);
 ```
 
-新しい `h2` セレクターを追加してください。
+You should not add a new `style` tag. Add the new CSS rules to the existing `style` tag.
+
+```js
+const hasManyStyleTags = document.querySelectorAll('style').length > 1;
+assert(!hasManyStyleTags);
+```
+
+You should add a new `h2` selector.
 
 ```js
 const hasH2 = new __helpers.CSSHelp(document).getStyle('h2');
 assert(hasH2);
 ```
 
-新しい `p` セレクターを追加してください。
+You should add a new `p` selector.
 
 ```js
 const hasP = new __helpers.CSSHelp(document).getStyle('p');
 assert(hasP);
 ```
 
-`h1` 要素の `text-align` を `center` に設定する必要があります。
+Your `h1` element should have a `text-align` of `center`.
 
 ```js
 const h1TextAlign = new __helpers.CSSHelp(document).getStyle('h1')?.getPropertyValue('text-align');
 assert(h1TextAlign === 'center');
 ```
 
-`h2` 要素の `text-align` を `center` に設定する必要があります。
+Your `h2` element should have a `text-align` of `center`.
 
 ```js
 const h2TextAlign = new __helpers.CSSHelp(document).getStyle('h2')?.getPropertyValue('text-align');
 assert(h2TextAlign === 'center');
 ```
 
-`p` 要素の `text-align` を `center` に設定する必要があります。
+Your `p` element should have a `text-align` of `center`.
 
 ```js
 const pTextAlign = new __helpers.CSSHelp(document).getStyle('p')?.getPropertyValue('text-align');
@@ -72,11 +79,9 @@ assert(pTextAlign === 'center');
 --fcc-editable-region--
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
index c9bbb2fd954..5afdb0d24ff 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477aefa51bfc29327200b
-title: ステップ 15
+title: Step 14
 challengeType: 0
-dashedName: step-15
+dashedName: step-14
 ---
 
 # --description--
@@ -54,11 +54,9 @@ dashedName: step-15
     </style>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md
index 403fa99d277..96dbe5a5a9d 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477cb2e27333b1ab2b955
-title: ステップ 17
+title: Step 16
 challengeType: 0
-dashedName: step-17
+dashedName: step-16
 ---
 
 # --description--
@@ -68,11 +68,9 @@ assert(link.dataset.href == 'styles.css')
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md
index 96a05980559..3245a48876e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477cb303c5cb61b43aa9b
-title: ステップ 19
+title: Step 18
 challengeType: 0
-dashedName: step-19
+dashedName: step-18
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert(bodyBackground === 'brown');
     <link href="styles.css" rel="stylesheet"/>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md
index 939ef798dc6..18d3c043f8e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477cbcb6ba47918c1da92
-title: ステップ 18
+title: Step 17
 challengeType: 0
-dashedName: step-18
+dashedName: step-17
 ---
 
 # --description--
@@ -52,11 +52,9 @@ assert(meta[0].outerHTML.match(/content=('|")width=device-width, initial-scale=1
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md
index f6420bd8c04..9c58f80dab3 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md
@@ -1,8 +1,8 @@
 ---
 id: 5f34a1fd611d003edeafd681
-title: ステップ 20
+title: Step 19
 challengeType: 0
-dashedName: step-20
+dashedName: step-19
 ---
 
 # --description--
@@ -39,11 +39,9 @@ assert(bodyBackground === 'burlywood');
     <link href="styles.css" rel="stylesheet"/>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
index d7ae814b253..d5eb7fcf462 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed60785e1f3e9850b6e
-title: ステップ 25
+title: Step 24
 challengeType: 0
-dashedName: step-25
+dashedName: step-24
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(!hasWidth);
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
index f86c58f8540..48e5b0d86e1 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
@@ -1,9 +1,9 @@
 ---
 id: 5f356ed60a5decd94ab66986
-title: ステップ 23
+title: Step 22
 challengeType: 0
 removeComments: false
-dashedName: step-23
+dashedName: step-22
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(bodyCSS === "rgba(0, 0, 0, 0)")
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
index aa793fec24a..e1d6d4d1cea 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed6199b0cdef1d2be8f
-title: ステップ 27
+title: Step 26
 challengeType: 0
-dashedName: step-27
+dashedName: step-26
 ---
 
 # --description--
@@ -48,11 +48,9 @@ assert(!hasDiv);
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
index 4dbbe75ba94..647bcbe7eff 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed63c7807a4f1e6d054
-title: ステップ 22
+title: Step 21
 challengeType: 0
-dashedName: step-22
+dashedName: step-21
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(divWidth === '300px');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
index 75b25ce54ca..b07532ddadf 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed63e0fa262326eef05
-title: ステップ 24
+title: Step 23
 challengeType: 0
-dashedName: step-24
+dashedName: step-23
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(divBackground === 'burlywood');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
index 106d0d62fe8..dbe18943a58 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed656a336993abd9f7c
-title: ステップ 26
+title: Step 25
 challengeType: 0
-dashedName: step-26
+dashedName: step-25
 ---
 
 # --description--
@@ -49,11 +49,9 @@ assert(divMarginLeft === 'auto');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
index ab4c2a30e0c..898e0a1b5de 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed69db0a491745e2bb6
-title: ステップ 28
+title: Step 27
 challengeType: 0
-dashedName: step-28
+dashedName: step-27
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert($('div').attr('class').includes('menu'));
 --fcc-editable-region--
     <div>
 --fcc-editable-region--
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
index 6cc39dc7bcd..bfc9821d5d6 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed6cf6eab5f15f5cfe6
-title: ステップ 21
+title: Step 20
 challengeType: 0
-dashedName: step-21
+dashedName: step-20
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(div.parentElement.tagName === 'BODY');
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md
index 11fd7905282..a9ffef88c8b 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md
@@ -1,8 +1,8 @@
 ---
 id: 5f35e5c4321f818cdc4bed30
-title: ステップ 30
+title: Step 29
 challengeType: 0
-dashedName: step-30
+dashedName: step-29
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(article.previousElementSibling.tagName === 'H2');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
 --fcc-editable-region--
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md
index 565d35af74a..8984fef938e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f35e5c44359872a137bd98f
-title: ステップ 29
+title: Step 28
 challengeType: 0
-dashedName: step-29
+dashedName: step-28
 ---
 
 # --description--
@@ -55,11 +55,9 @@ assert(bodyBackground === `url("https://cdn.freecodecamp.org/curriculum/css-cafe
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
index 6430d29f56c..ac9310fce97 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d0fc037f7311b4ac8
-title: ステップ 39
+title: Step 38
 challengeType: 0
-dashedName: step-39
+dashedName: step-38
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(priceWidth === '50%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
index 59d3c14d974..22d61e5835a 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d28d7ad0de6470505
-title: ステップ 33
+title: Step 32
 challengeType: 0
-dashedName: step-33
+dashedName: step-32
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert($('.flavor')[0].innerText.match(/French Vanilla/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
index d57f8033cf7..0eb8974b042 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d5414453fc2d7b480
-title: ステップ 32
+title: Step 31
 challengeType: 0
-dashedName: step-32
+dashedName: step-31
 ---
 
 # --description--
@@ -90,11 +90,9 @@ assert(children[1].innerText.match(/4\.50/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
 --fcc-editable-region--
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
index 2d6daf1ca3a..6129e03c7bb 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866daec9a49519871816
-title: ステップ 31
+title: Step 30
 challengeType: 0
-dashedName: step-31
+dashedName: step-30
 ---
 
 # --description--
@@ -52,11 +52,9 @@ assert(secondP.innerText.match(/3\.00/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
 --fcc-editable-region--
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
index 2e4b487036c..60bbc1ae43f 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866dbf362f99b9a0c6d0
-title: ステップ 38
+title: Step 37
 challengeType: 0
-dashedName: step-38
+dashedName: step-37
 ---
 
 # --description--
@@ -53,11 +53,9 @@ assert(itemPDisplay === 'inline-block');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md
index a60d6031b95..24630af7203 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866dd0d0275f01d4d847
-title: ステップ 40
+title: Step 39
 challengeType: 0
-dashedName: step-40
+dashedName: step-39
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(priceWidth === '49%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md
index 4a0ac802db7..6997ae20f1c 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866de7a5b784048f94b1
-title: ステップ 37
+title: Step 36
 challengeType: 0
-dashedName: step-37
+dashedName: step-36
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert($('article')[0].className === 'item');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
 --fcc-editable-region--
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md
index 25db1973744..e07d630e1c8 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade94c6576e7f7b7953f
-title: ステップ 42
+title: Step 41
 challengeType: 0
-dashedName: step-42
+dashedName: step-41
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(priceWidth === '50%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md
index c1f2d90bd0d..00ceb6ae5dd 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade9993019e26313fa8e
-title: ステップ 43
+title: Step 42
 challengeType: 0
-dashedName: step-43
+dashedName: step-42
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(articles[4] === items[4]);
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md
index 02be15f5652..688e87ef70d 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade99dda4e6071a85dfd
-title: ステップ 47
+title: Step 46
 challengeType: 0
-dashedName: step-47
+dashedName: step-46
 ---
 
 # --description--
@@ -50,11 +50,9 @@ assert($('main').children('section').length === 2);
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
 --fcc-editable-region--
         <section>
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md
index 19894f91e39..9d025c60308 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade9fa77275d9f4efe62
-title: ステップ 41
+title: Step 40
 challengeType: 0
-dashedName: step-41
+dashedName: step-40
 ---
 
 # --description--
@@ -34,11 +34,9 @@ assert(code.match(/Vanilla<\/p><p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md
index e1703836c01..d9ee8f05341 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md
@@ -1,15 +1,15 @@
 ---
 id: 5f3ef6e01f288a026d709587
-title: ステップ 67
+title: Step 66
 challengeType: 0
-dashedName: step-67
+dashedName: step-66
 ---
 
 # --description--
 
 `hr` 要素を使用して、コンテンツが異なるセクション間に区切り線を表示できます。
 
-まずは、`hr` 要素を最初の `header` 要素と `main` 要素の間に 1 つ追加してください。 `hr` 要素は自己終了要素であることに注意してください。
+First, add an `hr` element between the `p` element with the class `established` and the first `section` element. `hr` 要素は自己終了要素であることに注意してください。
 
 # --hints--
 
@@ -20,10 +20,10 @@ assert(code.match(/<hr\s?\/?>/i));
 assert(!code.match(/<\/hr>/i));
 ```
 
-既存の `header` 要素を変更しないでください。
+You should not change your existing `p` element with the class `established`.
 
 ```js
-assert($('header').length === 1);
+assert($('p.established').length === 1);
 ```
 
 既存の `main` 要素を変更しないでください。
@@ -32,11 +32,11 @@ assert($('header').length === 1);
 assert($('main').length === 1);
 ```
 
-`hr` 要素は `header` 要素と `main` 要素の間にある必要があります。
+Your `hr` element should be between your `p` element and your `section` element.
 
 ```js
-assert($('hr')[0].previousElementSibling.tagName === 'HEADER');
-assert($('hr')[0].nextElementSibling.tagName === 'MAIN');
+assert($('hr')[0].previousElementSibling.tagName === 'P');
+assert($('hr')[0].nextElementSibling.tagName === 'SECTION');
 ```
 
 # --seed--
@@ -55,11 +55,9 @@ assert($('hr')[0].nextElementSibling.tagName === 'MAIN');
   <body>
     <div class="menu">
 --fcc-editable-region--
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
index fa6eb78ad90..a1fea2f7e71 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e03d719d5ac4738993
-title: ステップ 57
+title: Step 56
 challengeType: 0
-dashedName: step-57
+dashedName: step-56
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(menuMaxWidth === '500px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
index b73a94e964c..139c2df0674 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e04559b939080db057
-title: ステップ 56
+title: Step 55
 challengeType: 0
-dashedName: step-56
+dashedName: step-55
 ---
 
 # --description--
@@ -64,11 +64,9 @@ assert(menuPadding === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
index 704ed311dee..66ba04db483 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e050279c7a4a7101d3
-title: ステップ 55
+title: Step 54
 challengeType: 0
-dashedName: step-55
+dashedName: step-54
 ---
 
 # --description--
@@ -63,11 +63,9 @@ assert(menuPaddingBottom === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
index ef9d9fb8ce1..1870ac32cd3 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e05473f91f948724ab
-title: ステップ 58
+title: Step 57
 challengeType: 0
-dashedName: step-58
+dashedName: step-57
 ---
 
 # --description--
@@ -41,11 +41,9 @@ assert(bodyFontFamily === 'sans-serif');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
index b80a6a20abd..655f7d3faa5 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e056bdde6ae6892ba2
-title: ステップ 59
+title: Step 58
 challengeType: 0
-dashedName: step-59
+dashedName: step-58
 ---
 
 # --description--
@@ -54,11 +54,9 @@ assert($('h2').css('font-family').match(/impact/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
index 0f4083ee1e5..70631a81394 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e06d34faac0447fc44
-title: ステップ 61
+title: Step 60
 challengeType: 0
-dashedName: step-61
+dashedName: step-60
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(establishedFontStyle === 'italic');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md
index f575c6a4d2b..07e5fc5d26e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e07276f782bb46b93d
-title: ステップ 64
+title: Step 63
 challengeType: 0
-dashedName: step-64
+dashedName: step-63
 ---
 
 # --description--
@@ -51,12 +51,10 @@ assert(footer.previousElementSibling.tagName === 'MAIN');
   </head>
   <body>
     <div class="menu">
-      <header>
-        <h1>CAMPER CAFE</h1>
-        <p class="established">Est. 2020</p>
-      </header>
 --fcc-editable-region--
       <main>
+        <h1>CAMPER CAFE</h1>
+        <p class="established">Est. 2020</p>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
index 2779fb2ed24..6d3dd77ccc3 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0819d4f23ca7285e6
-title: ステップ 49
+title: Step 48
 challengeType: 0
-dashedName: step-49
+dashedName: step-48
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('section')[1].children[1].className === 'item');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
index 346e8eb8c90..b25a0d6ae91 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e087d56ed3ffdc36be
-title: ステップ 62
+title: Step 61
 challengeType: 0
-dashedName: step-62
+dashedName: step-61
 ---
 
 # --description--
@@ -45,13 +45,11 @@ assert($('.established').css('font-style') === 'italic');
   </head>
   <body>
     <div class="menu">
+      <main>
 --fcc-editable-region--
-      <header>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
 --fcc-editable-region--
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
index 926e6753db9..34ff1390932 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0a81099d9a697b550
-title: ステップ 65
+title: Step 64
 challengeType: 0
-dashedName: step-65
+dashedName: step-64
 ---
 
 # --description--
@@ -58,11 +58,9 @@ assert(document.querySelector("footer > p > a")?.href === "https://www.freecodec
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md
index a091593b83c..dd673c1bcab 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0b431cc215bb16f55
-title: ステップ 66
+title: Step 65
 challengeType: 0
-dashedName: step-66
+dashedName: step-65
 ---
 
 # --description--
@@ -38,11 +38,9 @@ assert($('footer').children('p').last().text().match(/123 Free Code Camp Drive/i
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md
index 0144d914304..b490e0bc295 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0e0c3feaebcf647ad
-title: ステップ 48
+title: Step 47
 challengeType: 0
-dashedName: step-48
+dashedName: step-47
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('h2')[1].innerText.match(/Desserts/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md
index 181f491aae4..16ed4ab6688 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0e9629bad967cd71e
-title: ステップ 60
+title: Step 59
 challengeType: 0
-dashedName: step-60
+dashedName: step-59
 ---
 
 # --description--
@@ -35,11 +35,9 @@ assert(fontFamily === 'Impact, serif');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md
index ad5af98f7e5..dd9dc8f5550 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0eaa7da26e3d34d78
-title: ステップ 54
+title: Step 53
 challengeType: 0
-dashedName: step-54
+dashedName: step-53
 ---
 
 # --description--
@@ -56,11 +56,9 @@ assert(menuPaddingRight === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md
index 3855a619c22..36d76471f53 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0f8c230bdd2349716
-title: ステップ 63
+title: Step 62
 challengeType: 0
-dashedName: step-63
+dashedName: step-62
 ---
 
 # --description--
@@ -56,11 +56,9 @@ assert(h2FontSize === '30px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
index b5c84e2d7bf..3d59cc49059 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3f26fa39591db45e5cd7a0
-title: ステップ 68
+title: Step 67
 challengeType: 0
-dashedName: step-68
+dashedName: step-67
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(hrHeight === '3px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md
index b7a3acac558..8e46f4b0b14 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459225127805351a6ad057
-title: ステップ 69
+title: Step 68
 challengeType: 0
-dashedName: step-69
+dashedName: step-68
 ---
 
 # --description--
@@ -39,12 +39,10 @@ assert(hrBackgroundColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
index 07d55c500b4..e0006f91649 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459a7ceb8b5c446656d88b
-title: ステップ 70
+title: Step 69
 challengeType: 0
-dashedName: step-70
+dashedName: step-69
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(hrBorderColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
index 37bbf430697..259953d495f 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459cf202c2a3472fae6a9f
-title: ステップ 71
+title: Step 70
 challengeType: 0
-dashedName: step-71
+dashedName: step-70
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(hrHeight === '2px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
index 48e1eed69be..f4d86ecbbc3 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459fd48bdc98491ca6d1a3
-title: ステップ 72
+title: Step 71
 challengeType: 0
-dashedName: step-72
+dashedName: step-71
 ---
 
 # --description--
@@ -39,13 +39,11 @@ assert($('hr')[1].nextElementSibling.tagName === 'FOOTER');
   </head>
   <body>
     <div class="menu">
-      <header>
-        <h1>CAMPER CAFE</h1>
-        <p class="established">Est. 2020</p>
-      </header>
-      <hr>
 --fcc-editable-region--
       <main>
+        <h1>CAMPER CAFE</h1>
+        <p class="established">Est. 2020</p>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md
index ef539584140..301a8b7d1be 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a05977e2fa49d9119437
-title: ステップ 73
+title: Step 72
 challengeType: 0
-dashedName: step-73
+dashedName: step-72
 ---
 
 # --description--
@@ -39,12 +39,10 @@ assert(bodyPadding === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md
index 48ecce7b5b0..8cceb474022 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a276c093334f0f6e9df4
-title: ステップ 74
+title: Step 73
 challengeType: 0
-dashedName: step-74
+dashedName: step-73
 ---
 
 # --description--
@@ -63,12 +63,10 @@ assert(itemPMarginBottom === '5px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md
index af4af6ad79a..c73a269d954 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a5a7c49a8251f0bdb527
-title: ステップ 75
+title: Step 74
 challengeType: 0
-dashedName: step-75
+dashedName: step-74
 ---
 
 # --description--
@@ -47,12 +47,10 @@ assert(itemPFontSize === '18px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md
index 892f9c231ea..66472229260 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a66d4a2b0453301e5a26
-title: ステップ 79
+title: Step 78
 challengeType: 0
-dashedName: step-79
+dashedName: step-78
 ---
 
 # --description--
@@ -54,12 +54,10 @@ assert(footerFontSize === '14px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md
index 69c1e24e213..8b051f5694b 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b0731d39e15d54df4dfc
-title: ステップ 80
+title: Step 79
 challengeType: 0
-dashedName: step-80
+dashedName: step-79
 ---
 
 # --description--
@@ -48,12 +48,10 @@ assert(aColor === 'black');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md
index 573ca5fe0c7..156df67b998 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b25e7ec2405f166b9de1
-title: ステップ 81
+title: Step 80
 challengeType: 0
-dashedName: step-81
+dashedName: step-80
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(aVisitedColor === 'grey' || aVisitedColor === 'gray');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md
index 68f2b7cf4d8..a3642247945 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b3c93c027860d9298dbd
-title: ステップ 82
+title: Step 81
 challengeType: 0
-dashedName: step-82
+dashedName: step-81
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(aHoverColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md
index d7ffd89c9c3..327d567ad23 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b45d099f3e621fbbb256
-title: ステップ 83
+title: Step 82
 challengeType: 0
-dashedName: step-83
+dashedName: step-82
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(aActiveColor === 'white');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md
index aef21624e1c..59f1f2ddcf0 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b4c81cea7763550e40df
-title: ステップ 84
+title: Step 83
 challengeType: 0
-dashedName: step-84
+dashedName: step-83
 ---
 
 # --description--
@@ -40,12 +40,10 @@ assert(aActiveColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md
index 20f7682fe7e..90ec6d8d056 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b715301bbf667badc04a
-title: ステップ 85
+title: Step 84
 challengeType: 0
-dashedName: step-85
+dashedName: step-84
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(h1MarginTop === '0px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md
index 51b8a55e287..136b07c3823 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e270702a8456a664f0df
-title: ステップ 86
+title: Step 85
 challengeType: 0
-dashedName: step-86
+dashedName: step-85
 ---
 
 # --description--
@@ -40,12 +40,10 @@ assert(h1MarginBottom === '15px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md
index 40a394afef1..0e780de877a 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e36e745ead58487aabf2
-title: ステップ 87
+title: Step 86
 challengeType: 0
-dashedName: step-87
+dashedName: step-86
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(addressMarginBottom === '5px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md
index 74357505f79..738bdf9bf3a 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e7a4750dd05b5a673920
-title: ステップ 88
+title: Step 87
 challengeType: 0
-dashedName: step-88
+dashedName: step-87
 ---
 
 # --description--
@@ -44,12 +44,10 @@ assert($('.address')[0].innerText.match(/123 Free Code Camp Drive/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md
index 4abdb6bde89..7a717ef15ee 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e8284aae155c83015dee
-title: ステップ 89
+title: Step 88
 challengeType: 0
-dashedName: step-89
+dashedName: step-88
 ---
 
 # --description--
@@ -46,12 +46,10 @@ assert($('img').attr('alt').match(/coffee icon/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
 --fcc-editable-region--
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md
index 51ee6003ab0..b5c612d3e45 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46ede1ff8fec5ba656b44c
-title: ステップ 78
+title: Step 77
 challengeType: 0
-dashedName: step-78
+dashedName: step-77
 ---
 
 # --description--
@@ -32,12 +32,10 @@ assert(code.match(/\/\*\s*FOOTER\s*\*\//i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md
index c70ade2dc88..964e74a304a 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46fc57528aa1c4b5ea7c2e
-title: ステップ 76
+title: Step 75
 challengeType: 0
-dashedName: step-76
+dashedName: step-75
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(bottomLineMargin === '25px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md
index 16fc5152e46..f63d9669670 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md
@@ -1,8 +1,8 @@
 ---
 id: 5f4701b942c824109626c3d8
-title: ステップ 77
+title: Step 76
 challengeType: 0
-dashedName: step-77
+dashedName: step-76
 ---
 
 # --description--
@@ -38,12 +38,10 @@ assert($('hr')[1].className === 'bottom-line');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
index c9c3016e650..f9e9d3ca5a4 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
@@ -1,8 +1,8 @@
 ---
 id: 5f475bb508746c16c9431d42
-title: ステップ 90
+title: Step 89
 challengeType: 0
-dashedName: step-90
+dashedName: step-89
 ---
 
 # --description--
@@ -72,12 +72,10 @@ assert(imgMarginRight === 'auto');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
index 352b69f9176..009f0f66391 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f475e1c7f71a61d913836c6
-title: ステップ 91
+title: Step 90
 challengeType: 0
-dashedName: step-91
+dashedName: step-90
 ---
 
 # --description--
@@ -44,12 +44,10 @@ assert($('img').last().attr('alt').match(/pie icon/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md
index 9f250143ead..65e13be9991 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f47633757ae3469f2d33d2e
-title: ステップ 46
+title: Step 45
 challengeType: 0
-dashedName: step-46
+dashedName: step-45
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(priceWidth === '25%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md
index 2e181ef7765..4b271b1da39 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f47fe7e31980053a8d4403b
-title: ステップ 92
+title: Step 91
 challengeType: 0
-dashedName: step-92
+dashedName: step-91
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(imgMarginTop === '-25px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
@@ -209,12 +207,10 @@ a:active {
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
index 600f50882dc..665e8b84057 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
@@ -1,8 +1,8 @@
 ---
 id: 5f716ad029ee4053c7027a7a
-title: ステップ 50
+title: Step 49
 challengeType: 0
-dashedName: step-50
+dashedName: step-49
 ---
 
 # --description--
@@ -50,11 +50,9 @@ assert($('article').last().children('p')[1].innerText.match(/1\.50/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
index d7e1426ebb7..2793701aaac 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
@@ -1,8 +1,8 @@
 ---
 id: 5f716bee5838c354c728a7c5
-title: ステップ 53
+title: Step 52
 challengeType: 0
-dashedName: step-53
+dashedName: step-52
 ---
 
 # --description--
@@ -84,11 +84,9 @@ assert(!code.match(/<\/p>\s+<p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md
index 95df8ae1637..85c6b8b8a21 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7691dafd882520797cd2f0
-title: ステップ 44
+title: Step 43
 challengeType: 0
-dashedName: step-44
+dashedName: step-43
 ---
 
 # --description--
@@ -32,11 +32,9 @@ assert(!code.match(/<\/p>\s+<p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md
index 7d03181994b..e139bb73cb9 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7692f7c5b3ce22a57788b6
-title: ステップ 45
+title: Step 44
 challengeType: 0
-dashedName: step-45
+dashedName: step-44
 ---
 
 # --description--
@@ -62,11 +62,9 @@ assert(p[10] === price[4]);
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md
index 83875c4d5ba..91ea2192fdb 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f769541be494f25449b292f
-title: ステップ 34
+title: Step 33
 challengeType: 0
-dashedName: step-34
+dashedName: step-33
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(flavorTextAlign === 'left');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md
index 02da4baced6..2f2e6475ee5 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md
@@ -1,8 +1,8 @@
 ---
 id: 5f76967fad478126d6552b0d
-title: ステップ 35
+title: Step 34
 challengeType: 0
-dashedName: step-35
+dashedName: step-34
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('.price')[0].innerText.match(/3\.00/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md
index 84409ec62ec..2fa697814eb 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md
@@ -1,8 +1,8 @@
 ---
 id: 5f769702e6e33127d14aa120
-title: ステップ 36
+title: Step 35
 challengeType: 0
-dashedName: step-36
+dashedName: step-35
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('.price').css('text-align') === 'right');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md
index 39defe527ce..f4e42cabe18 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7b87422a560036fd03ccff
-title: ステップ 51
+title: Step 50
 challengeType: 0
-dashedName: step-51
+dashedName: step-50
 ---
 
 # --description--
@@ -50,11 +50,9 @@ assert(!code.match(/<\/p>\s+<p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
index 68793a00d8e..ac638369c3e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7b88d37b1f98386f04edc0
-title: ステップ 52
+title: Step 51
 challengeType: 0
-dashedName: step-52
+dashedName: step-51
 ---
 
 # --description--
@@ -35,11 +35,9 @@ assert(selector)
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md
index 49e83c7942a..59316b5e280 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md
@@ -7,30 +7,29 @@ dashedName: step-5
 
 # --description--
 
-最後に、`viewport` の `<meta>` タグを使用して、ページの見た目があらゆるデバイス上で同じになるようにします。
-
-自己終了要素の `meta` 要素を、`head` 要素内に追加してください。 `name` 属性を `viewport` に、`content` 属性を `width=device-width, initial-scale=1.0` に設定してください。
+Add another self-closing `meta` element within the `head`. Give it a `name` attribute set to `viewport` and a `content` attribute set to `width=device-width, initial-scale=1.0` so your page looks the same on all devices.
 
 # --hints--
 
-2 つの `meta` 要素が必要です。
+You should have two `meta` elements.
 
 ```js
 const meta = document.querySelectorAll('meta');
 assert(meta?.length === 2);
 ```
 
-新しい `meta` 要素は自己終了要素である必要があります。
+Your new `meta` element should be a self-closing element.
 
 ```js
 assert(code.match(/<\/meta>/i) === null);
 ```
 
-新しい `meta` 要素の `name` 属性には `viewport` を、`content` 属性には `width=device-width, initial-scale=1.0` を設定する必要があります。
+Your new `meta` element should have a `name` attribute set to `viewport`, and a `content` attribute set to `width=device-width, initial-scale=1.0`.
 
 ```js
 const meta = [...document.querySelectorAll('meta')];
-const target = meta?.find(m => m?.getAttribute('name') === 'viewport' && m?.getAttribute('content') === 'width=device-width, initial-scale=1.0');
+const reValidContent = /^\s*width\s*=\s*device-width\s*,\s*initial-scale\s*=\s*1(?:\.0)?\s*$/;
+const target = meta?.find(m => m?.getAttribute('name') === 'viewport' && reValidContent.test(m?.getAttribute('content')));
 assert.exists(target);
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61537a8054753e2f1f2a1574.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61537a8054753e2f1f2a1574.md
index d41901c2da2..d041d4832dc 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61537a8054753e2f1f2a1574.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61537a8054753e2f1f2a1574.md
@@ -1,26 +1,26 @@
 ---
 id: 61537a8054753e2f1f2a1574
-title: Step 2
+title: ステップ 2
 challengeType: 0
 dashedName: step-2
 ---
 
 # --description--
 
-Within your `head` element, add a `meta` tag with the `name` set to `viewport` and the `content` set to `width=device-width, initial-scale=1`.
+`head` 要素内に、`name` が `viewport` 、`content` が `width=device-width, initial-scale=1` に設定された `meta` タグを追加してください。
 
-Also add a `meta` tag with the `charset` set to `UTF-8`.
+更に、`charset` を `UTF-8` に設定した `meta` タグも追加してください。
 
 # --hints--
 
-You should have two `meta` elements.
+2 つの `meta` 要素が必要です。
 
 ```js
 const meta = document.querySelectorAll('meta');
 assert(meta?.length === 2);
 ```
 
-One `meta` element should have a `name` set to `viewport`, and `content` set to `width=device-width, initial-scale=1.0`.
+`meta` 要素のひとつは `name` 属性を `viewport` に、`content` 属性を `width=device-width, initial-scale=1.0` に設定されている必要があります。
 
 ```js
 const meta = [...document.querySelectorAll('meta')];
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61537c5f81f0cf325b4a854c.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61537c5f81f0cf325b4a854c.md
index c069eb9299e..882ea2b9071 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61537c5f81f0cf325b4a854c.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61537c5f81f0cf325b4a854c.md
@@ -1,37 +1,37 @@
 ---
 id: 61537c5f81f0cf325b4a854c
-title: Step 4
+title: ステップ 4
 challengeType: 0
 dashedName: step-4
 ---
 
 # --description--
 
-Add a `header` element within the `body` element and assign a class of `header` to it.
+`body` 要素内に `header` 要素を追加して、`header` というクラスを割り当ててください。
 
 Inside the `header`, create an `h1` with `css flexbox photo gallery` as the text.
 
 # --hints--
 
-You should have a `header` element within your `body` element.
+`body` 要素の中に `header` 要素が 1 つ必要です。
 
 ```js
 assert.exists(document.querySelector('body')?.querySelector('header'));
 ```
 
-Your `header` element should have a `class` with `header` as the value.
+`header` 要素の `class` の値として `header` を設定する必要があります。
 
 ```js
 assert(document?.querySelector('body')?.querySelector('header')?.classList?.contains('header'));
 ```
 
-Your `header` element should have an `h1` element inside it.
+`header` 要素内に `h1` 要素が 1 つ必要です。
 
 ```js
 assert.exists(document.querySelector('.header')?.querySelector('h1'));
 ```
 
-Your `h1` element should have the text `css flexbox photo gallery` inside it.
+`h1` 要素内に `css flexbox photo gallery` というテキストが必要です。
 
 ```js
 assert(document?.querySelector('.header')?.querySelector('h1')?.innerText === 'css flexbox photo gallery');
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/615380dff67172357fcf0425.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/615380dff67172357fcf0425.md
index 8dc007fa7f3..ec912df8bd6 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/615380dff67172357fcf0425.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/615380dff67172357fcf0425.md
@@ -1,6 +1,6 @@
 ---
 id: 615380dff67172357fcf0425
-title: Step 7
+title: ステップ 7
 challengeType: 0
 dashedName: step-7
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153897c27f6334716ee5abe.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153897c27f6334716ee5abe.md
index e4cb8a61120..5ac1cad9739 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153897c27f6334716ee5abe.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153897c27f6334716ee5abe.md
@@ -1,6 +1,6 @@
 ---
 id: 6153897c27f6334716ee5abe
-title: Step 10
+title: ステップ 10
 challengeType: 0
 dashedName: step-10
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/615389bd81347947ea7ba896.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/615389bd81347947ea7ba896.md
index 7db27249482..f764d2a6812 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/615389bd81347947ea7ba896.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/615389bd81347947ea7ba896.md
@@ -1,17 +1,17 @@
 ---
 id: 615389bd81347947ea7ba896
-title: Step 11
+title: ステップ 11
 challengeType: 0
 dashedName: step-11
 ---
 
 # --description--
 
-Flexbox is a one-dimensional CSS layout that can control the way items are spaced out and aligned within a container.
+フレックスボックスとは、コンテナー内のアイテムの間隔や整列方法を制御するための一次元の CSS レイアウトです。
 
-To use it, give an element a `display` property of `flex`. This will make the element a <em>flex container</em>. Any direct children of a flex container are called <em>flex items</em>.
+To use it, give an element a `display` property of `flex`. これにより、要素が<em>フレックスコンテナー</em>となります。 フレックスコンテナーの直接の子要素は<em>フレックスアイテム</em>と呼ばれます。
 
-Create a `.gallery` selector and make it a flex container.
+`.gallery` セレクターを作成して、それをフレックスコンテナーにしてください。
 
 # --hints--
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153908a366afb4d57185c8d.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153908a366afb4d57185c8d.md
index b7c95ab2a98..5a2d7edab89 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153908a366afb4d57185c8d.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153908a366afb4d57185c8d.md
@@ -1,6 +1,6 @@
 ---
 id: 6153908a366afb4d57185c8d
-title: Step 12
+title: ステップ 12
 challengeType: 0
 dashedName: step-12
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/615392916d83fa4f02f7e2cf.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/615392916d83fa4f02f7e2cf.md
index 277105f76b3..bddcf61ecd7 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/615392916d83fa4f02f7e2cf.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/615392916d83fa4f02f7e2cf.md
@@ -1,6 +1,6 @@
 ---
 id: 615392916d83fa4f02f7e2cf
-title: Step 13
+title: ステップ 13
 challengeType: 0
 dashedName: step-13
 ---
@@ -8,7 +8,7 @@ dashedName: step-13
 # --description--
 
 
-The `flex-wrap` property determines how your flex items behave when the flex container is too small. Setting it to `wrap` will allow the items to wrap to the next row or column. `nowrap` (default) will prevent your items from wrapping and shrink them if needed.
+`flex-wrap` プロパティは、フレックスコンテナーが小さすぎる場合にフレックスアイテムがどのように動作するかを決定します。 Setting it to `wrap` will allow the items to wrap to the next row or column. `nowrap` (default) will prevent your items from wrapping and shrink them if needed.
 
 
 Make it so your flex items wrap to the next row when they run out of space.
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153938dce8b294ff8f5a4e9.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153938dce8b294ff8f5a4e9.md
index dd3c1101a09..8bacd9c8afe 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153938dce8b294ff8f5a4e9.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153938dce8b294ff8f5a4e9.md
@@ -7,7 +7,7 @@ dashedName: step-14
 
 # --description--
 
-The `justify-content` property determines how the items inside a flex container are positioned along the main axis, affecting their position and the space around them.
+`justify-content` プロパティは、フレックスコンテナー内のアイテムが主軸に沿ってどう配置されるかを決定し、アイテムの位置と周りの余白に影響を及ぼします。
 
 Give your `.gallery` selector a `justify-content` property with `center` as the value.
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61539e07e7430b528fbffe21.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61539e07e7430b528fbffe21.md
index 5f23aedb9e9..1e3e6a37799 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61539e07e7430b528fbffe21.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61539e07e7430b528fbffe21.md
@@ -1,6 +1,6 @@
 ---
 id: 61539e07e7430b528fbffe21
-title: Step 16
+title: ステップ 16
 challengeType: 0
 dashedName: step-16
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61539f32a206bd53ec116465.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61539f32a206bd53ec116465.md
index 0ae907c8829..0df67edc75c 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61539f32a206bd53ec116465.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/61539f32a206bd53ec116465.md
@@ -1,6 +1,6 @@
 ---
 id: 61539f32a206bd53ec116465
-title: Step 17
+title: ステップ 17
 challengeType: 0
 dashedName: step-17
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3952facd25a83fe8083.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3952facd25a83fe8083.md
index 5dc832ce2bd..3cf84ad51b8 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3952facd25a83fe8083.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3952facd25a83fe8083.md
@@ -1,6 +1,6 @@
 ---
 id: 6153a3952facd25a83fe8083
-title: Step 20
+title: ステップ 20
 challengeType: 0
 dashedName: step-20
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3ebb4f7f05b8401b716.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3ebb4f7f05b8401b716.md
index 54faa13bd9b..e48cb252fba 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3ebb4f7f05b8401b716.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-flexbox-by-building-a-photo-gallery/6153a3ebb4f7f05b8401b716.md
@@ -1,6 +1,6 @@
 ---
 id: 6153a3ebb4f7f05b8401b716
-title: Step 21
+title: ステップ 21
 challengeType: 0
 dashedName: step-21
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61437d575fb98f57fa8f7f36.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61437d575fb98f57fa8f7f36.md
index 2d083077ee1..66f2ee1b703 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61437d575fb98f57fa8f7f36.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61437d575fb98f57fa8f7f36.md
@@ -1,6 +1,6 @@
 ---
 id: 61437d575fb98f57fa8f7f36
-title: Step 1
+title: ステップ 1
 challengeType: 0
 dashedName: step-1
 ---
@@ -25,13 +25,13 @@ You should include a space after the `DOCTYPE` reference.
 assert(code.match(/<!DOCTYPE\s+/gi));
 ```
 
-You should define the document type to be `html`.
+ドキュメントタイプが `html` であると定義する必要があります。
 
 ```js
 assert(code.match(/<!DOCTYPE\s+html/gi));
 ```
 
-You should close the `DOCTYPE` declaration with a `>` after the type.
+タイプの後ろに `>` を入力して、`DOCTYPE` 宣言を閉じる必要があります。
 
 ```js
 assert(code.match(/<!DOCTYPE\s+html\s*>/gi));
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614385513d91ae5c251c2052.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614385513d91ae5c251c2052.md
index 7f6d7239c43..152d11f9a09 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614385513d91ae5c251c2052.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614385513d91ae5c251c2052.md
@@ -1,6 +1,6 @@
 ---
 id: 614385513d91ae5c251c2052
-title: Step 2
+title: ステップ 2
 challengeType: 0
 dashedName: step-2
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614389f601bb4f611db98563.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614389f601bb4f611db98563.md
index 44fe6eb8cb4..dd384a78f72 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614389f601bb4f611db98563.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614389f601bb4f611db98563.md
@@ -1,6 +1,6 @@
 ---
 id: 614389f601bb4f611db98563
-title: Step 9
+title: ステップ 9
 challengeType: 0
 dashedName: step-9
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dfc811e12666b04be6f.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dfc811e12666b04be6f.md
index f4ee0bb5ab3..4b256470d44 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dfc811e12666b04be6f.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dfc811e12666b04be6f.md
@@ -100,7 +100,7 @@ assert(document.querySelectorAll('.text p')?.[2]?.innerText === "It wasn't as dr
           After years - years - of pondering these two problems and how to solve them, I slipped, hit my head on the sink, and when I came to I had a revelation! A vision! A picture in my head! A picture of this! This is what makes time travel possible: the flux capacitor!
         </p>
 --fcc-editable-region--
-        
+
 --fcc-editable-region--
       </section>
     </main>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a1a228f7d068ab16a130.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a1a228f7d068ab16a130.md
index db32dfa57dc..bd21324c74d 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a1a228f7d068ab16a130.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a1a228f7d068ab16a130.md
@@ -1,6 +1,6 @@
 ---
 id: 6143a1a228f7d068ab16a130
-title: Step 15
+title: ステップ 15
 challengeType: 0
 dashedName: step-15
 ---
@@ -117,7 +117,7 @@ assert(document.querySelectorAll('.text p')?.[4]?.innerText === 'No more walls o
           <hr />
         </blockquote>
 --fcc-editable-region--
-        
+
 --fcc-editable-region--
       </section>
     </main>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a73279ce6369de4b9bcc.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a73279ce6369de4b9bcc.md
index 7500f1b4667..e123ec7a5f8 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a73279ce6369de4b9bcc.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a73279ce6369de4b9bcc.md
@@ -1,6 +1,6 @@
 ---
 id: 6143a73279ce6369de4b9bcc
-title: Step 16
+title: ステップ 16
 challengeType: 0
 dashedName: step-16
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a778bffc206ac6b1dbe3.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a778bffc206ac6b1dbe3.md
index 250303e45c1..82ce21a2ac0 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a778bffc206ac6b1dbe3.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143a778bffc206ac6b1dbe3.md
@@ -1,6 +1,6 @@
 ---
 id: 6143a778bffc206ac6b1dbe3
-title: Step 17
+title: ステップ 17
 challengeType: 0
 dashedName: step-17
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b97c06c3306d23d5da47.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b97c06c3306d23d5da47.md
index f8148bc77f8..6503afc4853 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b97c06c3306d23d5da47.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b97c06c3306d23d5da47.md
@@ -1,6 +1,6 @@
 ---
 id: 6143b97c06c3306d23d5da47
-title: Step 19
+title: ステップ 19
 challengeType: 0
 dashedName: step-19
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b9e1f5035c6e5f2a8231.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b9e1f5035c6e5f2a8231.md
index b6b2d1bd906..ebf5bf08413 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b9e1f5035c6e5f2a8231.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143b9e1f5035c6e5f2a8231.md
@@ -1,6 +1,6 @@
 ---
 id: 6143b9e1f5035c6e5f2a8231
-title: Step 20
+title: ステップ 20
 challengeType: 0
 dashedName: step-20
 ---
@@ -212,7 +212,7 @@ assert(h4s?.every(h4 => h4?.classList?.contains('list-subtitle')));
           <h3 class="list-title">A Brief History</h3>
           <p>Of the Curriculum</p>
           <ul class="lists">
-          
+
           </ul>
         </article>
 --fcc-editable-region--
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143bb50e8e48c6f5ef9d8d5.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143bb50e8e48c6f5ef9d8d5.md
index 06fb3da6c3c..79eb3389fd7 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143bb50e8e48c6f5ef9d8d5.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143bb50e8e48c6f5ef9d8d5.md
@@ -1,6 +1,6 @@
 ---
 id: 6143bb50e8e48c6f5ef9d8d5
-title: Step 21
+title: ステップ 21
 challengeType: 0
 dashedName: step-21
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143c2a363865c715f1a3f72.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143c2a363865c715f1a3f72.md
index 2a6bd8dc4cb..68aaefd162a 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143c2a363865c715f1a3f72.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143c2a363865c715f1a3f72.md
@@ -1,6 +1,6 @@
 ---
 id: 6143c2a363865c715f1a3f72
-title: Step 22
+title: ステップ 22
 challengeType: 0
 dashedName: step-22
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143cd08fe927072ca3a371d.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143cd08fe927072ca3a371d.md
index 66fe0f88a1d..63dbfb56b1b 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143cd08fe927072ca3a371d.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143cd08fe927072ca3a371d.md
@@ -1,6 +1,6 @@
 ---
 id: 6143cd08fe927072ca3a371d
-title: Step 23
+title: ステップ 23
 challengeType: 0
 dashedName: step-23
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143d2842b497779bad947de.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143d2842b497779bad947de.md
index 813ab28b826..664bda601c9 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143d2842b497779bad947de.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6143d2842b497779bad947de.md
@@ -1,6 +1,6 @@
 ---
 id: 6143d2842b497779bad947de
-title: Step 26
+title: ステップ 26
 challengeType: 0
 dashedName: step-26
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144ee790af79815ad15a832.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144ee790af79815ad15a832.md
index defe5fc1693..49036e9e358 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144ee790af79815ad15a832.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144ee790af79815ad15a832.md
@@ -1,6 +1,6 @@
 ---
 id: 6144ee790af79815ad15a832
-title: Step 32
+title: ステップ 32
 challengeType: 0
 dashedName: step-32
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f1410990ea17187a722b.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f1410990ea17187a722b.md
index fc25931639b..b75ed05c8b4 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f1410990ea17187a722b.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f1410990ea17187a722b.md
@@ -7,7 +7,7 @@ dashedName: step-33
 
 # --description--
 
-Now you can style the layout of your grid. CSS Grid is similar to Flexbox in that it has a special property for both the parent and child elements. 
+Now you can style the layout of your grid. CSS Grid is similar to Flexbox in that it has a special property for both the parent and child elements.
 
 In this case, your parent element is the `main` element. Set the content to have a three-column layout by adding a `grid-template-columns` property with a value of `1fr 94rem 1fr`. This will create three columns where the middle column is `94rem` wide, and the first and last columns are both 1 fraction of the remaining space in the grid container.
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f3818bfbc51844152e36.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f3818bfbc51844152e36.md
index 3f24bba4d26..349dd5a8d83 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f3818bfbc51844152e36.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f3818bfbc51844152e36.md
@@ -1,6 +1,6 @@
 ---
 id: 6144f3818bfbc51844152e36
-title: Step 34
+title: ステップ 34
 challengeType: 0
 dashedName: step-34
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f42204c8c8195f1f3345.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f42204c8c8195f1f3345.md
index 15528e7d5d9..ef74aaaccc2 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f42204c8c8195f1f3345.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6144f42204c8c8195f1f3345.md
@@ -1,6 +1,6 @@
 ---
 id: 6144f42204c8c8195f1f3345
-title: Step 35
+title: ステップ 35
 challengeType: 0
 dashedName: step-35
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b07081759c2c691166a9.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b07081759c2c691166a9.md
index 2d133371f79..4dc9789c29c 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b07081759c2c691166a9.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b07081759c2c691166a9.md
@@ -1,6 +1,6 @@
 ---
 id: 6148b07081759c2c691166a9
-title: Step 37
+title: ステップ 37
 challengeType: 0
 dashedName: step-37
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b0d764e4192e5712ed92.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b0d764e4192e5712ed92.md
index 12fc38f790e..f324e20cfe5 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b0d764e4192e5712ed92.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b0d764e4192e5712ed92.md
@@ -1,6 +1,6 @@
 ---
 id: 6148b0d764e4192e5712ed92
-title: Step 38
+title: ステップ 38
 challengeType: 0
 dashedName: step-38
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b30464daf630848c21d4.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b30464daf630848c21d4.md
index 71ae54a2abe..e27cc85a4a4 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b30464daf630848c21d4.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b30464daf630848c21d4.md
@@ -1,6 +1,6 @@
 ---
 id: 6148b30464daf630848c21d4
-title: Step 40
+title: ステップ 40
 challengeType: 0
 dashedName: step-40
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b4b150434734143db6f2.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b4b150434734143db6f2.md
index cb2bf5e6088..b64c912e6f2 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b4b150434734143db6f2.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148b4b150434734143db6f2.md
@@ -1,6 +1,6 @@
 ---
 id: 6148b4b150434734143db6f2
-title: Step 41
+title: ステップ 41
 challengeType: 0
 dashedName: step-41
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bd62bbb8c83a5f1fc1b3.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bd62bbb8c83a5f1fc1b3.md
index 79cfd07a73b..2573317f421 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bd62bbb8c83a5f1fc1b3.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bd62bbb8c83a5f1fc1b3.md
@@ -1,6 +1,6 @@
 ---
 id: 6148bd62bbb8c83a5f1fc1b3
-title: Step 45
+title: ステップ 45
 challengeType: 0
 dashedName: step-45
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148be3d605d6b3ca9425d11.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148be3d605d6b3ca9425d11.md
index 988ec7d9b4d..f2224cc232f 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148be3d605d6b3ca9425d11.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148be3d605d6b3ca9425d11.md
@@ -1,6 +1,6 @@
 ---
 id: 6148be3d605d6b3ca9425d11
-title: Step 46
+title: ステップ 46
 challengeType: 0
 dashedName: step-46
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bf49fcc7913f05dbf9b7.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bf49fcc7913f05dbf9b7.md
index 86afef0ad3a..182874ec3e3 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bf49fcc7913f05dbf9b7.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bf49fcc7913f05dbf9b7.md
@@ -1,6 +1,6 @@
 ---
 id: 6148bf49fcc7913f05dbf9b7
-title: Step 48
+title: ステップ 48
 challengeType: 0
 dashedName: step-48
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bfc43df3bc40fe0e6405.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bfc43df3bc40fe0e6405.md
index 35fc54744f8..fcd17a1da8d 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bfc43df3bc40fe0e6405.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148bfc43df3bc40fe0e6405.md
@@ -1,6 +1,6 @@
 ---
 id: 6148bfc43df3bc40fe0e6405
-title: Step 49
+title: ステップ 49
 challengeType: 0
 dashedName: step-49
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c224ecb157439bc5247c.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c224ecb157439bc5247c.md
index 8a679a698b4..2e99f2cce1b 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c224ecb157439bc5247c.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c224ecb157439bc5247c.md
@@ -1,6 +1,6 @@
 ---
 id: 6148c224ecb157439bc5247c
-title: Step 51
+title: ステップ 51
 challengeType: 0
 dashedName: step-51
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c721e74ecd4c619ae51c.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c721e74ecd4c619ae51c.md
index 6e5b23b6f5a..b7f8748e280 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c721e74ecd4c619ae51c.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148c721e74ecd4c619ae51c.md
@@ -1,6 +1,6 @@
 ---
 id: 6148c721e74ecd4c619ae51c
-title: Step 56
+title: ステップ 56
 challengeType: 0
 dashedName: step-56
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148cf094b3f2b4e8a032c63.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148cf094b3f2b4e8a032c63.md
index 43e50830b1d..960c57ddcae 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148cf094b3f2b4e8a032c63.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148cf094b3f2b4e8a032c63.md
@@ -1,6 +1,6 @@
 ---
 id: 6148cf094b3f2b4e8a032c63
-title: Step 58
+title: ステップ 58
 challengeType: 0
 dashedName: step-58
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d0b863d10d50544ace0e.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d0b863d10d50544ace0e.md
index 06f0be77acf..670f262e39c 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d0b863d10d50544ace0e.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d0b863d10d50544ace0e.md
@@ -1,6 +1,6 @@
 ---
 id: 6148d0b863d10d50544ace0e
-title: Step 59
+title: ステップ 59
 challengeType: 0
 dashedName: step-59
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d1f9eb63c252e1f8acc4.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d1f9eb63c252e1f8acc4.md
index 8b519c2d9ef..5e7c5106d3b 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d1f9eb63c252e1f8acc4.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d1f9eb63c252e1f8acc4.md
@@ -1,6 +1,6 @@
 ---
 id: 6148d1f9eb63c252e1f8acc4
-title: Step 61
+title: ステップ 61
 challengeType: 0
 dashedName: step-61
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d2444d01ab541e64a1e4.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d2444d01ab541e64a1e4.md
index d9b089bb510..286af8da4ab 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d2444d01ab541e64a1e4.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d2444d01ab541e64a1e4.md
@@ -1,6 +1,6 @@
 ---
 id: 6148d2444d01ab541e64a1e4
-title: Step 62
+title: ステップ 62
 challengeType: 0
 dashedName: step-62
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d33e31fccf558696c745.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d33e31fccf558696c745.md
index f9fc3477ffe..f6a9daf5a7d 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d33e31fccf558696c745.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d33e31fccf558696c745.md
@@ -1,6 +1,6 @@
 ---
 id: 6148d33e31fccf558696c745
-title: Step 63
+title: ステップ 63
 challengeType: 0
 dashedName: step-63
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d3fff5186b57123d97e2.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d3fff5186b57123d97e2.md
index 0710da4427f..a76192da85a 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d3fff5186b57123d97e2.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d3fff5186b57123d97e2.md
@@ -1,6 +1,6 @@
 ---
 id: 6148d3fff5186b57123d97e2
-title: Step 64
+title: ステップ 64
 challengeType: 0
 dashedName: step-64
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d4d57b965358c9fa38bf.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d4d57b965358c9fa38bf.md
index 16e04f302e7..382c5398c1d 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d4d57b965358c9fa38bf.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d4d57b965358c9fa38bf.md
@@ -1,6 +1,6 @@
 ---
 id: 6148d4d57b965358c9fa38bf
-title: Step 65
+title: ステップ 65
 challengeType: 0
 dashedName: step-65
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d94fdf6a5d6899f8ff15.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d94fdf6a5d6899f8ff15.md
index 2e1b2b5c3d0..f9e464a1fbe 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d94fdf6a5d6899f8ff15.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148d94fdf6a5d6899f8ff15.md
@@ -1,6 +1,6 @@
 ---
 id: 6148d94fdf6a5d6899f8ff15
-title: Step 67
+title: ステップ 67
 challengeType: 0
 dashedName: step-67
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e162e255676ae0da6a76.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e162e255676ae0da6a76.md
index 49a92044791..cfe385cb4c9 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e162e255676ae0da6a76.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e162e255676ae0da6a76.md
@@ -1,6 +1,6 @@
 ---
 id: 6148e162e255676ae0da6a76
-title: Step 69
+title: ステップ 69
 challengeType: 0
 dashedName: step-69
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e19c3e26436be0155690.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e19c3e26436be0155690.md
index 859891139d8..a802d7eb9a0 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e19c3e26436be0155690.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e19c3e26436be0155690.md
@@ -1,6 +1,6 @@
 ---
 id: 6148e19c3e26436be0155690
-title: Step 70
+title: ステップ 70
 challengeType: 0
 dashedName: step-70
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e246146b646cf4255f0c.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e246146b646cf4255f0c.md
index e3a186c9466..df35d5db68f 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e246146b646cf4255f0c.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e246146b646cf4255f0c.md
@@ -1,6 +1,6 @@
 ---
 id: 6148e246146b646cf4255f0c
-title: Step 71
+title: ステップ 71
 challengeType: 0
 dashedName: step-71
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e4d6861a486f60681f36.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e4d6861a486f60681f36.md
index 36e0d2208a1..a794ef68252 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e4d6861a486f60681f36.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e4d6861a486f60681f36.md
@@ -1,6 +1,6 @@
 ---
 id: 6148e4d6861a486f60681f36
-title: Step 73
+title: ステップ 73
 challengeType: 0
 dashedName: step-73
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e5a204d99e70343a63e4.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e5a204d99e70343a63e4.md
index b9448b07782..c7037a4c323 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e5a204d99e70343a63e4.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148e5a204d99e70343a63e4.md
@@ -1,6 +1,6 @@
 ---
 id: 6148e5a204d99e70343a63e4
-title: Step 74
+title: ステップ 74
 challengeType: 0
 dashedName: step-74
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f6f7d8914c78e93136ca.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f6f7d8914c78e93136ca.md
index bf702462281..0b4ba8b45f0 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f6f7d8914c78e93136ca.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6148f6f7d8914c78e93136ca.md
@@ -383,14 +383,14 @@ hr {
   .hero-title {
     font-size: 6rem;
   }
-  
+
   .hero-subtitle,
   .author,
   .quote,
   .list-title {
     font-size: 1.8rem;
   }
-  
+
   .social-icons {
     font-size: 2rem;
   }
@@ -755,14 +755,14 @@ hr {
   .hero-title {
     font-size: 6rem;
   }
-  
+
   .hero-subtitle,
   .author,
   .quote,
   .list-title {
     font-size: 1.8rem;
   }
-  
+
   .social-icons {
     font-size: 2rem;
   }
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614e0e588f0e8a772a8a81a6.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614e0e588f0e8a772a8a81a6.md
index f9fd23824b8..4f5a6bfe87c 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614e0e588f0e8a772a8a81a6.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/614e0e588f0e8a772a8a81a6.md
@@ -1,6 +1,6 @@
 ---
 id: 614e0e588f0e8a772a8a81a6
-title: Step 6
+title: ステップ 6
 challengeType: 0
 dashedName: step-6
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6165d3b702a5d92ad970b30c.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6165d3b702a5d92ad970b30c.md
index 8b701b945d0..3e91db55139 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6165d3b702a5d92ad970b30c.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6165d3b702a5d92ad970b30c.md
@@ -1,6 +1,6 @@
 ---
 id: 6165d3b702a5d92ad970b30c
-title: Step 5
+title: ステップ 5
 challengeType: 0
 dashedName: step-5
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6169cd8a558aa8434e0ad7f6.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6169cd8a558aa8434e0ad7f6.md
index 4b061e350ff..e2d98bc8aa5 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6169cd8a558aa8434e0ad7f6.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/6169cd8a558aa8434e0ad7f6.md
@@ -1,6 +1,6 @@
 ---
 id: 6169cd8a558aa8434e0ad7f6
-title: Step 8
+title: ステップ 8
 challengeType: 0
 dashedName: step-8
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619665c9abd72906f3ad30f9.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619665c9abd72906f3ad30f9.md
index 4dca0168a6a..064751615d7 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619665c9abd72906f3ad30f9.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619665c9abd72906f3ad30f9.md
@@ -1,6 +1,6 @@
 ---
 id: 619665c9abd72906f3ad30f9
-title: Step 1
+title: ステップ 1
 challengeType: 0
 dashedName: step-1
 ---
@@ -25,13 +25,13 @@ Your code should have an `html` element.
 assert.equal(document.querySelectorAll('html')?.length, 1);
 ```
 
-Your `html` element should have an opening tag with a `lang` attribute of `en`.
+`html` 要素は `lang` 属性が `en` の開始タグをもつ必要があります。
 
 ```js
 assert(code.match(/<html\s+lang\s*=\s*('|")en\1\s*>/gi));
 ```
 
-Your `html` element should have a closing tag.
+`html` 要素には終了タグが必要です。
 
 ```js
 assert(code.match(/<\/html\s*>/gi));
@@ -55,14 +55,14 @@ Your `head` element should come before your `body` element.
 assert.equal(document.querySelector('body')?.previousElementSibling?.tagName, 'HEAD');
 ```
 
-You should have two `meta` elements.
+2 つの `meta` 要素が必要です。
 
 ```js
 const meta = document.querySelectorAll('meta');
 assert.equal(meta?.length, 2);
 ```
 
-One `meta` element should have a `name` set to `viewport`, and `content` set to `width=device-width, initial-scale=1.0`.
+`meta` 要素のひとつは `name` 属性を `viewport` に、`content` 属性を `width=device-width, initial-scale=1.0` に設定されている必要があります。
 
 ```js
 const meta = [...document.querySelectorAll('meta')];
@@ -70,7 +70,7 @@ const target = meta?.find(m => m?.getAttribute('name') === 'viewport' && m?.getA
 assert.exists(target);
 ```
 
-The other `meta` element should have the `charset` attribute set to `UTF-8`.
+もうひとつの `meta` 要素は `charset` 属性を `UTF-8` に設定されている必要があります。
 
 ```js
 const meta = [...document.querySelectorAll('meta')];
@@ -78,7 +78,7 @@ const target = meta?.find(m => !m?.getAttribute('name') && !m?.getAttribute('con
 assert.exists(target);
 ```
 
-Your code should have a `title` element.
+コードには `title` 要素が 1 つ必要です。
 
 ```js
 const title = document.querySelector('title');
@@ -92,19 +92,19 @@ const title = document.querySelector('title');
 assert.isAtLeast(title?.textContent?.length, 1);
 ```
 
-Your code should have a `link` element.
+コードには `link` 要素が 1 つ必要です。
 
 ```js
 assert.exists(document.querySelector('link'));
 ```
 
-Your `link` element should be within your `head` element.
+`link` 要素は `head` 要素の中にある必要があります。
 
 ```js
 assert(code.match(/<head>[\w\W\s]*<link[\w\W\s]*\/?>[\w\W\s]*<\/head>/i));
 ```
 
-Your `link` element should have a `rel` attribute with the value `stylesheet`.
+`link` 要素には `rel` 属性があり、値が `stylesheet` に設定されている必要があります。
 
 ```js
 const link_element = document.querySelector('link');
@@ -112,7 +112,7 @@ const rel = link_element.getAttribute("rel");
 assert.equal(rel, "stylesheet");
 ```
 
-Your `link` element should have an `href` attribute with the value `styles.css`.
+`link` 要素には `href` 属性があり、値が `styles.css` に設定されている必要があります。
 
 ```js
 const link = document.querySelector('link');
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61967e74a8e3690ab6292daa.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61967e74a8e3690ab6292daa.md
index 9812e1b4bdd..fe743308c95 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61967e74a8e3690ab6292daa.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61967e74a8e3690ab6292daa.md
@@ -1,6 +1,6 @@
 ---
 id: 61967e74a8e3690ab6292daa
-title: Step 2
+title: ステップ 2
 challengeType: 0
 dashedName: step-2
 ---
@@ -11,7 +11,7 @@ Target the `body` element to set the `background` to a linear gradient angled 45
 
 # --hints--
 
-You should use the `body` element selector.
+`body` 要素セレクターを使用する必要があります。
 
 ```js
 assert.match(code, /body\s*\{/);
@@ -36,7 +36,7 @@ assert.include(['linear-gradient(45deg,rgb(118,201,255),rgb(247,255,222))', 'rgb
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968df2acd5550bf1616c34.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968df2acd5550bf1616c34.md
index e401d42eef2..53476b35a28 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968df2acd5550bf1616c34.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968df2acd5550bf1616c34.md
@@ -1,6 +1,6 @@
 ---
 id: 61968df2acd5550bf1616c34
-title: Step 3
+title: ステップ 3
 challengeType: 0
 dashedName: step-3
 ---
@@ -30,7 +30,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.padding, '0px');
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
@@ -47,7 +47,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.padding, '0px');
 --fcc-editable-region--
 body {
   background: linear-gradient(45deg, rgb(118, 201, 255), rgb(247, 255, 222));
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968e9243a4090cc805531c.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968e9243a4090cc805531c.md
index 2c1d8594d5d..3b8aecfb9f5 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968e9243a4090cc805531c.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968e9243a4090cc805531c.md
@@ -1,6 +1,6 @@
 ---
 id: 61968e9243a4090cc805531c
-title: Step 5
+title: ステップ 5
 challengeType: 0
 dashedName: step-5
 ---
@@ -24,7 +24,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.overflow, 'clip')
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968f8877c6720d6d61aaf5.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968f8877c6720d6d61aaf5.md
index 051f3411d1b..58003c12895 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968f8877c6720d6d61aaf5.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61968f8877c6720d6d61aaf5.md
@@ -1,6 +1,6 @@
 ---
 id: 61968f8877c6720d6d61aaf5
-title: Step 6
+title: ステップ 6
 challengeType: 0
 dashedName: step-6
 ---
@@ -36,7 +36,7 @@ assert.exists(document.querySelector('body > div.ground'));
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619691693bc14b0e528f5a20.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619691693bc14b0e528f5a20.md
index e5896cabe05..bf67bbfddf5 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619691693bc14b0e528f5a20.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619691693bc14b0e528f5a20.md
@@ -1,6 +1,6 @@
 ---
 id: 619691693bc14b0e528f5a20
-title: Step 7
+title: ステップ 7
 challengeType: 0
 dashedName: step-7
 ---
@@ -36,7 +36,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.ground')?.height, '400px
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196928658b6010f28c39484.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196928658b6010f28c39484.md
index 05b5c3fd7e1..149c9783b14 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196928658b6010f28c39484.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196928658b6010f28c39484.md
@@ -1,6 +1,6 @@
 ---
 id: 6196928658b6010f28c39484
-title: Step 8
+title: ステップ 8
 challengeType: 0
 dashedName: step-8
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619692ff79f5770fc6d8c0b4.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619692ff79f5770fc6d8c0b4.md
index 672d4bd665b..851bb9fb8c4 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619692ff79f5770fc6d8c0b4.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619692ff79f5770fc6d8c0b4.md
@@ -1,6 +1,6 @@
 ---
 id: 619692ff79f5770fc6d8c0b4
-title: Step 10
+title: ステップ 10
 challengeType: 0
 dashedName: step-10
 ---
@@ -36,7 +36,7 @@ assert.strictEqual(document.querySelector('.ground')?.previousElementSibling, do
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196990f966e8f10a40094f6.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196990f966e8f10a40094f6.md
index 8fd7eb06e2f..8374ea10d65 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196990f966e8f10a40094f6.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196990f966e8f10a40094f6.md
@@ -1,6 +1,6 @@
 ---
 id: 6196990f966e8f10a40094f6
-title: Step 11
+title: ステップ 11
 challengeType: 0
 dashedName: step-11
 ---
@@ -36,7 +36,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.penguin')?.height, '300p
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619699c10a0f6e11591d73c4.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619699c10a0f6e11591d73c4.md
index 81ba962fab2..b79e608f9c4 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619699c10a0f6e11591d73c4.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619699c10a0f6e11591d73c4.md
@@ -1,6 +1,6 @@
 ---
 id: 619699c10a0f6e11591d73c4
-title: Step 12
+title: ステップ 12
 challengeType: 0
 dashedName: step-12
 ---
@@ -31,7 +31,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.penguin')?.marginTop, '7
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969aa6acef5b12200f672e.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969aa6acef5b12200f672e.md
index 49499e43bbc..47f4af8bae1 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969aa6acef5b12200f672e.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969aa6acef5b12200f672e.md
@@ -1,6 +1,6 @@
 ---
 id: 61969aa6acef5b12200f672e
-title: Step 13
+title: ステップ 13
 challengeType: 0
 dashedName: step-13
 ---
@@ -38,7 +38,7 @@ assert.strictEqual(document.querySelector('.penguin')?.previousElementSibling, d
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969c487ced6f12db8fef94.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969c487ced6f12db8fef94.md
index d1dedc2cc7b..1c20dc407d6 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969c487ced6f12db8fef94.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969c487ced6f12db8fef94.md
@@ -1,6 +1,6 @@
 ---
 id: 61969c487ced6f12db8fef94
-title: Step 14
+title: ステップ 14
 challengeType: 0
 dashedName: step-14
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969d66cfcdba137d021558.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969d66cfcdba137d021558.md
index 0ec1d402f55..010c65c6319 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969d66cfcdba137d021558.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969d66cfcdba137d021558.md
@@ -1,6 +1,6 @@
 ---
 id: 61969d66cfcdba137d021558
-title: Step 15
+title: ステップ 15
 challengeType: 0
 dashedName: step-15
 ---
@@ -24,7 +24,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.left-mountain')?.positio
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969e7451455614217e901b.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969e7451455614217e901b.md
index 87fa0124137..5f876ddc2c7 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969e7451455614217e901b.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61969e7451455614217e901b.md
@@ -1,6 +1,6 @@
 ---
 id: 61969e7451455614217e901b
-title: Step 16
+title: ステップ 16
 challengeType: 0
 dashedName: step-16
 ---
@@ -38,7 +38,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.left-mountain')?.getProp
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196adc17f77a714d51485f2.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196adc17f77a714d51485f2.md
index 95ffdc3f9af..da267b2ca0d 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196adc17f77a714d51485f2.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196adc17f77a714d51485f2.md
@@ -1,6 +1,6 @@
 ---
 id: 6196adc17f77a714d51485f2
-title: Step 17
+title: ステップ 17
 challengeType: 0
 dashedName: step-17
 ---
@@ -36,7 +36,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.ground')?.zIndex, '3');
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196aead7ac7bf1584b17a7f.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196aead7ac7bf1584b17a7f.md
index 8a12e627d5c..ad93e7c5f8d 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196aead7ac7bf1584b17a7f.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196aead7ac7bf1584b17a7f.md
@@ -1,6 +1,6 @@
 ---
 id: 6196aead7ac7bf1584b17a7f
-title: Step 18
+title: ステップ 18
 challengeType: 0
 dashedName: step-18
 ---
@@ -30,7 +30,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.ground')?.marginTop, '-5
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
@@ -80,7 +80,7 @@ body {
   background: linear-gradient(90deg, rgb(88, 175, 236), rgb(182, 255, 255));
   z-index: 3;
   position: absolute;
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196ce0415498d2463989e84.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196ce0415498d2463989e84.md
index 432db5ff592..4a3c7779973 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196ce0415498d2463989e84.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196ce0415498d2463989e84.md
@@ -1,6 +1,6 @@
 ---
 id: 6196ce0415498d2463989e84
-title: Step 19
+title: ステップ 19
 challengeType: 0
 dashedName: step-19
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196cee94c6da1253809dff9.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196cee94c6da1253809dff9.md
index 44902852d0e..1cb6ad33530 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196cee94c6da1253809dff9.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196cee94c6da1253809dff9.md
@@ -1,6 +1,6 @@
 ---
 id: 6196cee94c6da1253809dff9
-title: Step 20
+title: ステップ 20
 challengeType: 0
 dashedName: step-20
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d00a5d7292262bc02f4c.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d00a5d7292262bc02f4c.md
index 7bda36be539..75b0827f0ca 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d00a5d7292262bc02f4c.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d00a5d7292262bc02f4c.md
@@ -1,6 +1,6 @@
 ---
 id: 6196d00a5d7292262bc02f4c
-title: Step 21
+title: ステップ 21
 challengeType: 0
 dashedName: step-21
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d0cda039d026f7f78d1e.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d0cda039d026f7f78d1e.md
index 4d1e271a017..1865807ff1a 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d0cda039d026f7f78d1e.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d0cda039d026f7f78d1e.md
@@ -1,6 +1,6 @@
 ---
 id: 6196d0cda039d026f7f78d1e
-title: Step 22
+title: ステップ 22
 challengeType: 0
 dashedName: step-22
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d1ac33c68d27dcda5796.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d1ac33c68d27dcda5796.md
index 09794d340aa..760744163ea 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d1ac33c68d27dcda5796.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d1ac33c68d27dcda5796.md
@@ -1,6 +1,6 @@
 ---
 id: 6196d1ac33c68d27dcda5796
-title: Step 23
+title: ステップ 23
 challengeType: 0
 dashedName: step-23
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d213d99f16287bff22ae.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d213d99f16287bff22ae.md
index 1189f3ef131..eb3ea20e8ad 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d213d99f16287bff22ae.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d213d99f16287bff22ae.md
@@ -1,6 +1,6 @@
 ---
 id: 6196d213d99f16287bff22ae
-title: Step 24
+title: ステップ 24
 challengeType: 0
 dashedName: step-24
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d2c0f22ca0293107c048.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d2c0f22ca0293107c048.md
index eb97f4d10b0..a3aab831539 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d2c0f22ca0293107c048.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d2c0f22ca0293107c048.md
@@ -1,6 +1,6 @@
 ---
 id: 6196d2c0f22ca0293107c048
-title: Step 25
+title: ステップ 25
 challengeType: 0
 dashedName: step-25
 ---
@@ -91,7 +91,7 @@ body {
 }
 
 --fcc-editable-region--
-    
+
 --fcc-editable-region--
 
 .penguin {
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d32d1340d829f0f6f57d.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d32d1340d829f0f6f57d.md
index 0c0d1ca0306..d655a887538 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d32d1340d829f0f6f57d.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d32d1340d829f0f6f57d.md
@@ -1,6 +1,6 @@
 ---
 id: 6196d32d1340d829f0f6f57d
-title: Step 26
+title: ステップ 26
 challengeType: 0
 dashedName: step-26
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d41d40bf9b2aaea5d520.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d41d40bf9b2aaea5d520.md
index 60778c2811c..d14b2f916b4 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d41d40bf9b2aaea5d520.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6196d41d40bf9b2aaea5d520.md
@@ -1,6 +1,6 @@
 ---
 id: 6196d41d40bf9b2aaea5d520
-title: Step 27
+title: ステップ 27
 challengeType: 0
 dashedName: step-27
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197cff995d03905b0cca8ad.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197cff995d03905b0cca8ad.md
index ea00c654008..2401a6967fb 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197cff995d03905b0cca8ad.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197cff995d03905b0cca8ad.md
@@ -1,6 +1,6 @@
 ---
 id: 6197cff995d03905b0cca8ad
-title: Step 28
+title: ステップ 28
 challengeType: 0
 dashedName: step-28
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197f40a16afea068c7e60c8.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197f40a16afea068c7e60c8.md
index a40396e2525..4e5f1095b63 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197f40a16afea068c7e60c8.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197f40a16afea068c7e60c8.md
@@ -1,6 +1,6 @@
 ---
 id: 6197f40a16afea068c7e60c8
-title: Step 29
+title: ステップ 29
 challengeType: 0
 dashedName: step-29
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197f667297bb30a552ce017.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197f667297bb30a552ce017.md
index 1bf1ae8a6f0..11a16693a24 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197f667297bb30a552ce017.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6197f667297bb30a552ce017.md
@@ -1,6 +1,6 @@
 ---
 id: 6197f667297bb30a552ce017
-title: Step 9
+title: ステップ 9
 challengeType: 0
 dashedName: step-9
 ---
@@ -30,7 +30,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.ground')?.position, 'abs
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993b72e874e709b8dfd666.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993b72e874e709b8dfd666.md
index de3c23b739e..83019bd20de 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993b72e874e709b8dfd666.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993b72e874e709b8dfd666.md
@@ -1,6 +1,6 @@
 ---
 id: 61993b72e874e709b8dfd666
-title: Step 30
+title: ステップ 30
 challengeType: 0
 dashedName: step-30
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993cf26a8e0f0a553db223.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993cf26a8e0f0a553db223.md
index 0e09016059a..ded760c8180 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993cf26a8e0f0a553db223.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993cf26a8e0f0a553db223.md
@@ -1,6 +1,6 @@
 ---
 id: 61993cf26a8e0f0a553db223
-title: Step 31
+title: ステップ 31
 challengeType: 0
 dashedName: step-31
 ---
@@ -107,7 +107,7 @@ body {
     gray,
     rgb(239, 240, 228)
   );
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993dbb35adf30b10d49e38.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993dbb35adf30b10d49e38.md
index 3bdf0c05374..226505536c2 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993dbb35adf30b10d49e38.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993dbb35adf30b10d49e38.md
@@ -1,6 +1,6 @@
 ---
 id: 61993dbb35adf30b10d49e38
-title: Step 32
+title: ステップ 32
 challengeType: 0
 dashedName: step-32
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993e9adc9e9a0bb4d28fff.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993e9adc9e9a0bb4d28fff.md
index ace7e6a521f..584ef4eeafb 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993e9adc9e9a0bb4d28fff.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61993e9adc9e9a0bb4d28fff.md
@@ -1,6 +1,6 @@
 ---
 id: 61993e9adc9e9a0bb4d28fff
-title: Step 33
+title: ステップ 33
 challengeType: 0
 dashedName: step-33
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199409834ccaf0d10736596.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199409834ccaf0d10736596.md
index 8c2d7f69749..4fb61c052cc 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199409834ccaf0d10736596.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199409834ccaf0d10736596.md
@@ -1,6 +1,6 @@
 ---
 id: 6199409834ccaf0d10736596
-title: Step 34
+title: ステップ 34
 challengeType: 0
 dashedName: step-34
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199429802b7c10dc79ff871.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199429802b7c10dc79ff871.md
index 033f57b0fac..aa688cc98fe 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199429802b7c10dc79ff871.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199429802b7c10dc79ff871.md
@@ -1,6 +1,6 @@
 ---
 id: 6199429802b7c10dc79ff871
-title: Step 35
+title: ステップ 35
 challengeType: 0
 dashedName: step-35
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619943285a41720e6370d985.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619943285a41720e6370d985.md
index 2885245f1e4..63552f5bc56 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619943285a41720e6370d985.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619943285a41720e6370d985.md
@@ -1,6 +1,6 @@
 ---
 id: 619943285a41720e6370d985
-title: Step 36
+title: ステップ 36
 challengeType: 0
 dashedName: step-36
 ---
@@ -141,7 +141,7 @@ body {
     white 67%
   );
   border-radius: 80% 80% 100% 100%;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619943876b706d0f35c01dbc.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619943876b706d0f35c01dbc.md
index cc70348de32..8beec5ac03c 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619943876b706d0f35c01dbc.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619943876b706d0f35c01dbc.md
@@ -1,6 +1,6 @@
 ---
 id: 619943876b706d0f35c01dbc
-title: Step 37
+title: ステップ 37
 challengeType: 0
 dashedName: step-37
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199442866286d0ff421a4fc.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199442866286d0ff421a4fc.md
index 393425cd50b..a93b1623574 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199442866286d0ff421a4fc.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/6199442866286d0ff421a4fc.md
@@ -1,6 +1,6 @@
 ---
 id: 6199442866286d0ff421a4fc
-title: Step 38
+title: ステップ 38
 challengeType: 0
 dashedName: step-38
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619bcf239fc15905ecd66fce.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619bcf239fc15905ecd66fce.md
index 6ac0dcc090c..b71ffa6a710 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619bcf239fc15905ecd66fce.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619bcf239fc15905ecd66fce.md
@@ -1,6 +1,6 @@
 ---
 id: 619bcf239fc15905ecd66fce
-title: Step 39
+title: ステップ 39
 challengeType: 0
 dashedName: step-39
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be73b3c806006ccc00bb0.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be73b3c806006ccc00bb0.md
index ecd856e1572..af378c7dda4 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be73b3c806006ccc00bb0.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be73b3c806006ccc00bb0.md
@@ -1,6 +1,6 @@
 ---
 id: 619be73b3c806006ccc00bb0
-title: Step 40
+title: ステップ 40
 challengeType: 0
 dashedName: step-40
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be7af7b0bf60770f5d2a4.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be7af7b0bf60770f5d2a4.md
index 31c1bab65a3..580d1da7741 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be7af7b0bf60770f5d2a4.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be7af7b0bf60770f5d2a4.md
@@ -1,6 +1,6 @@
 ---
 id: 619be7af7b0bf60770f5d2a4
-title: Step 41
+title: ステップ 41
 challengeType: 0
 dashedName: step-41
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be80062551a080e32c821.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be80062551a080e32c821.md
index 018ff948bf5..d6d9010b0a9 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be80062551a080e32c821.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be80062551a080e32c821.md
@@ -1,6 +1,6 @@
 ---
 id: 619be80062551a080e32c821
-title: Step 42
+title: ステップ 42
 challengeType: 0
 dashedName: step-42
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be8ce4ea49008c5bfbc30.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be8ce4ea49008c5bfbc30.md
index 3f2e93ba9b4..dc41793ba6e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be8ce4ea49008c5bfbc30.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be8ce4ea49008c5bfbc30.md
@@ -1,6 +1,6 @@
 ---
 id: 619be8ce4ea49008c5bfbc30
-title: Step 43
+title: ステップ 43
 challengeType: 0
 dashedName: step-43
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be946958c6009844f1dee.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be946958c6009844f1dee.md
index 3650ed68e42..e2e9ce0e3d0 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be946958c6009844f1dee.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619be946958c6009844f1dee.md
@@ -1,6 +1,6 @@
 ---
 id: 619be946958c6009844f1dee
-title: Step 44
+title: ステップ 44
 challengeType: 0
 dashedName: step-44
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619c155df0063a0a3fec0e32.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619c155df0063a0a3fec0e32.md
index 88156f2b9dc..592e8c3f9d5 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619c155df0063a0a3fec0e32.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619c155df0063a0a3fec0e32.md
@@ -1,6 +1,6 @@
 ---
 id: 619c155df0063a0a3fec0e32
-title: Step 45
+title: ステップ 45
 challengeType: 0
 dashedName: step-45
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619c16debd0c270b01c5ce38.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619c16debd0c270b01c5ce38.md
index 52882871a63..df6b9539cfa 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619c16debd0c270b01c5ce38.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619c16debd0c270b01c5ce38.md
@@ -1,6 +1,6 @@
 ---
 id: 619c16debd0c270b01c5ce38
-title: Step 46
+title: ステップ 46
 challengeType: 0
 dashedName: step-46
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619cfdf2e63ddf05feab86ad.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619cfdf2e63ddf05feab86ad.md
index 2059f320cda..b44f7ecfe15 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619cfdf2e63ddf05feab86ad.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619cfdf2e63ddf05feab86ad.md
@@ -1,6 +1,6 @@
 ---
 id: 619cfdf2e63ddf05feab86ad
-title: Step 47
+title: ステップ 47
 challengeType: 0
 dashedName: step-47
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d019488f98c06acbbb71a.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d019488f98c06acbbb71a.md
index a19064b3067..a0b0b48936f 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d019488f98c06acbbb71a.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d019488f98c06acbbb71a.md
@@ -1,6 +1,6 @@
 ---
 id: 619d019488f98c06acbbb71a
-title: Step 48
+title: ステップ 48
 challengeType: 0
 dashedName: step-48
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d022dc8400c0763829a17.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d022dc8400c0763829a17.md
index 5a68b9e88d3..d5448345861 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d022dc8400c0763829a17.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d022dc8400c0763829a17.md
@@ -1,6 +1,6 @@
 ---
 id: 619d022dc8400c0763829a17
-title: Step 49
+title: ステップ 49
 challengeType: 0
 dashedName: step-49
 ---
@@ -11,7 +11,7 @@ Target the `.face` element with the `left` class, and position it `5%` left of i
 
 # --hints--
 
-You should use the `.face.left` selector.
+`.face.left` セレクターを使用する必要があります。
 
 ```js
 assert.match(code, /\.face\.left\s*\{/);
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d02c7bc95bf0827a5d296.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d02c7bc95bf0827a5d296.md
index db36b467cd4..970f3ecc2a3 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d02c7bc95bf0827a5d296.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d02c7bc95bf0827a5d296.md
@@ -1,6 +1,6 @@
 ---
 id: 619d02c7bc95bf0827a5d296
-title: Step 50
+title: ステップ 50
 challengeType: 0
 dashedName: step-50
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d033915012509031f309a.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d033915012509031f309a.md
index dd8bb15bbee..a72787cce7b 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d033915012509031f309a.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d033915012509031f309a.md
@@ -1,6 +1,6 @@
 ---
 id: 619d033915012509031f309a
-title: Step 51
+title: ステップ 51
 challengeType: 0
 dashedName: step-51
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d03dadadb6509a16f4f5f.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d03dadadb6509a16f4f5f.md
index f375026932a..9892dc82532 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d03dadadb6509a16f4f5f.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d03dadadb6509a16f4f5f.md
@@ -1,6 +1,6 @@
 ---
 id: 619d03dadadb6509a16f4f5f
-title: Step 52
+title: ステップ 52
 challengeType: 0
 dashedName: step-52
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0503e03a790a4179d463.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0503e03a790a4179d463.md
index 538ae5b900d..8ea9a9de0cb 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0503e03a790a4179d463.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0503e03a790a4179d463.md
@@ -1,6 +1,6 @@
 ---
 id: 619d0503e03a790a4179d463
-title: Step 53
+title: ステップ 53
 challengeType: 0
 dashedName: step-53
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d05c54dabca0b10058235.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d05c54dabca0b10058235.md
index f24504c7d5d..1e5499cc4b3 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d05c54dabca0b10058235.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d05c54dabca0b10058235.md
@@ -1,6 +1,6 @@
 ---
 id: 619d05c54dabca0b10058235
-title: Step 54
+title: ステップ 54
 challengeType: 0
 dashedName: step-54
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0882f54bf40bdc4671ed.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0882f54bf40bdc4671ed.md
index 6e3269089e5..f71a8419ff3 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0882f54bf40bdc4671ed.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0882f54bf40bdc4671ed.md
@@ -1,6 +1,6 @@
 ---
 id: 619d0882f54bf40bdc4671ed
-title: Step 55
+title: ステップ 55
 challengeType: 0
 dashedName: step-55
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d090cd8d6db0c93dc5087.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d090cd8d6db0c93dc5087.md
index 9c78f74e37e..21591c2682d 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d090cd8d6db0c93dc5087.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d090cd8d6db0c93dc5087.md
@@ -1,6 +1,6 @@
 ---
 id: 619d090cd8d6db0c93dc5087
-title: Step 56
+title: ステップ 56
 challengeType: 0
 dashedName: step-56
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0b51ca42ed0d74582186.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0b51ca42ed0d74582186.md
index 9a34e11ba50..d3d8c9b5217 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0b51ca42ed0d74582186.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0b51ca42ed0d74582186.md
@@ -1,6 +1,6 @@
 ---
 id: 619d0b51ca42ed0d74582186
-title: Step 57
+title: ステップ 57
 challengeType: 0
 dashedName: step-57
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0bc9cb05360e1bf549c3.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0bc9cb05360e1bf549c3.md
index 6f72a364916..2531acd1a32 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0bc9cb05360e1bf549c3.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0bc9cb05360e1bf549c3.md
@@ -1,6 +1,6 @@
 ---
 id: 619d0bc9cb05360e1bf549c3
-title: Step 58
+title: ステップ 58
 challengeType: 0
 dashedName: step-58
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0c1594c38c0ebae75878.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0c1594c38c0ebae75878.md
index 00fce3bac39..3f9de65dc14 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0c1594c38c0ebae75878.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0c1594c38c0ebae75878.md
@@ -1,6 +1,6 @@
 ---
 id: 619d0c1594c38c0ebae75878
-title: Step 59
+title: ステップ 59
 challengeType: 0
 dashedName: step-59
 ---
@@ -11,7 +11,7 @@ Target the `.eye` element with the `left` class, and position it `25%` from the
 
 # --hints--
 
-You should use the `.eye.left` selector.
+`.eye.left` セレクターを使用する必要があります。
 
 ```js
 assert.match(code, /\.eye\.left\s*\{/);
@@ -23,7 +23,7 @@ You should give `.eye.left` a `left` of `--fcc-expected--`, but found `--fcc-act
 assert.equal(new __helpers.CSSHelp(document).getStyle('.eye.left')?.left, '25%');
 ```
 
-You should use the `.eye.right` selector.
+`.eye.right` セレクターを使用する必要があります。
 
 ```js
 assert.match(code, /\.eye\.right\s*\{/);
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0d18ca99870f884a7bff.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0d18ca99870f884a7bff.md
index c4246b6bc5a..0ca50fe282e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0d18ca99870f884a7bff.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0d18ca99870f884a7bff.md
@@ -1,6 +1,6 @@
 ---
 id: 619d0d18ca99870f884a7bff
-title: Step 60
+title: ステップ 60
 challengeType: 0
 dashedName: step-60
 ---
@@ -63,7 +63,7 @@ assert.exists(document.querySelector('.eye.right > div.eye-lid'));
 
         </div>
         <div class="eye right">
-          
+
         </div>
       </div>
 --fcc-editable-region--
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0daf214542102739b0da.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0daf214542102739b0da.md
index 98f0c969be6..6082d738a80 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0daf214542102739b0da.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0daf214542102739b0da.md
@@ -1,6 +1,6 @@
 ---
 id: 619d0daf214542102739b0da
-title: Step 61
+title: ステップ 61
 challengeType: 0
 dashedName: step-61
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0e56f9ca9710fcb974e3.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0e56f9ca9710fcb974e3.md
index 55a4986c3f4..c44f76792a2 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0e56f9ca9710fcb974e3.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0e56f9ca9710fcb974e3.md
@@ -1,6 +1,6 @@
 ---
 id: 619d0e56f9ca9710fcb974e3
-title: Step 62
+title: ステップ 62
 challengeType: 0
 dashedName: step-62
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0eec0ac40611b41e2ccc.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0eec0ac40611b41e2ccc.md
index ab18d6b7b27..9b9f6d848a2 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0eec0ac40611b41e2ccc.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0eec0ac40611b41e2ccc.md
@@ -1,6 +1,6 @@
 ---
 id: 619d0eec0ac40611b41e2ccc
-title: Step 63
+title: ステップ 63
 challengeType: 0
 dashedName: step-63
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0fc9825c271253df28d4.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0fc9825c271253df28d4.md
index e20794d7cc2..4cb8c8ef544 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0fc9825c271253df28d4.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d0fc9825c271253df28d4.md
@@ -1,6 +1,6 @@
 ---
 id: 619d0fc9825c271253df28d4
-title: Step 64
+title: ステップ 64
 challengeType: 0
 dashedName: step-64
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d102d786c3d13124c37c6.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d102d786c3d13124c37c6.md
index fceedab5837..9b30833cc71 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d102d786c3d13124c37c6.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d102d786c3d13124c37c6.md
@@ -1,6 +1,6 @@
 ---
 id: 619d102d786c3d13124c37c6
-title: Step 65
+title: ステップ 65
 challengeType: 0
 dashedName: step-65
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d107edf7ddf13cc77106a.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d107edf7ddf13cc77106a.md
index 3f87fe671ab..fba6bc7896a 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d107edf7ddf13cc77106a.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d107edf7ddf13cc77106a.md
@@ -1,6 +1,6 @@
 ---
 id: 619d107edf7ddf13cc77106a
-title: Step 66
+title: ステップ 66
 challengeType: 0
 dashedName: step-66
 ---
@@ -11,7 +11,7 @@ Target the `.blush` element with a `class` of `left`, and position it `15%` left
 
 # --hints--
 
-You should use the `.blush.left` selector.
+`.blush.left` セレクターを使用する必要があります。
 
 ```js
 assert.match(code, /\.blush\.left\s*\{/);
@@ -23,7 +23,7 @@ You should give `.blush.left` a `left` of `--fcc-expected--`, but found `--fcc-a
 assert.equal(new __helpers.CSSHelp(document).getStyle('.blush.left')?.left, '15%');
 ```
 
-You should use the `.blush.right` selector.
+`.blush.right` セレクターを使用する必要があります。
 
 ```js
 assert.match(code, /\.blush\.right\s*\{/);
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d10cc98145f14820399c5.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d10cc98145f14820399c5.md
index 1d3c79dd123..7149dc0fa25 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d10cc98145f14820399c5.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d10cc98145f14820399c5.md
@@ -1,6 +1,6 @@
 ---
 id: 619d10cc98145f14820399c5
-title: Step 67
+title: ステップ 67
 challengeType: 0
 dashedName: step-67
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d115e2adcd71538e82ebb.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d115e2adcd71538e82ebb.md
index f17baca2873..477e37abf4a 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d115e2adcd71538e82ebb.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d115e2adcd71538e82ebb.md
@@ -1,6 +1,6 @@
 ---
 id: 619d115e2adcd71538e82ebb
-title: Step 68
+title: ステップ 68
 challengeType: 0
 dashedName: step-68
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d11e6d5ef9515d2a16033.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d11e6d5ef9515d2a16033.md
index 2ad23a1eb32..1a8702715ac 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d11e6d5ef9515d2a16033.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d11e6d5ef9515d2a16033.md
@@ -1,6 +1,6 @@
 ---
 id: 619d11e6d5ef9515d2a16033
-title: Step 69
+title: ステップ 69
 challengeType: 0
 dashedName: step-69
 ---
@@ -11,7 +11,7 @@ Target the `.beak` element with a `class` of `top`, give it a `width` of `20%`,
 
 # --hints--
 
-You should use the `.beak.top` selector.
+`.beak.top` セレクターを使用する必要があります。
 
 ```js
 assert.match(code, /\.beak\.top\s*\{/);
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d129a417d0716a94de913.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d129a417d0716a94de913.md
index ebcf7969f95..e7990872665 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d129a417d0716a94de913.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d129a417d0716a94de913.md
@@ -1,6 +1,6 @@
 ---
 id: 619d129a417d0716a94de913
-title: Step 70
+title: ステップ 70
 challengeType: 0
 dashedName: step-70
 ---
@@ -11,7 +11,7 @@ Target the `.beak` element with a `class` of `bottom`, and give it a `width` `4%
 
 # --hints--
 
-You should use the `.beak.bottom` selector.
+`.beak.bottom` セレクターを使用する必要があります。
 
 ```js
 assert.match(code, /\.beak\.bottom\s*\{/);
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1340361095175f4b5115.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1340361095175f4b5115.md
index 2cce37d722e..88e5197de2c 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1340361095175f4b5115.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1340361095175f4b5115.md
@@ -1,6 +1,6 @@
 ---
 id: 619d1340361095175f4b5115
-title: Step 71
+title: ステップ 71
 challengeType: 0
 dashedName: step-71
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d15797b580c1828b05426.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d15797b580c1828b05426.md
index 604b770fabd..fc2c88695a1 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d15797b580c1828b05426.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d15797b580c1828b05426.md
@@ -1,6 +1,6 @@
 ---
 id: 619d15797b580c1828b05426
-title: Step 72
+title: ステップ 72
 challengeType: 0
 dashedName: step-72
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d15d955d9d418c4487bbc.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d15d955d9d418c4487bbc.md
index 2ba7d8fed23..f8f58a0d16d 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d15d955d9d418c4487bbc.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d15d955d9d418c4487bbc.md
@@ -1,6 +1,6 @@
 ---
 id: 619d15d955d9d418c4487bbc
-title: Step 73
+title: ステップ 73
 challengeType: 0
 dashedName: step-73
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1629a8adc61960ca8b40.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1629a8adc61960ca8b40.md
index e5c9b1d8122..9d30a56cef1 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1629a8adc61960ca8b40.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1629a8adc61960ca8b40.md
@@ -1,6 +1,6 @@
 ---
 id: 619d1629a8adc61960ca8b40
-title: Step 74
+title: ステップ 74
 challengeType: 0
 dashedName: step-74
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1c5fc9f8941a400955da.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1c5fc9f8941a400955da.md
index d9113a4e226..b8863e9bab4 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1c5fc9f8941a400955da.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1c5fc9f8941a400955da.md
@@ -1,6 +1,6 @@
 ---
 id: 619d1c5fc9f8941a400955da
-title: Step 75
+title: ステップ 75
 challengeType: 0
 dashedName: step-75
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1dab9ff3421ae1976991.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1dab9ff3421ae1976991.md
index 3aca16ece5a..0dff8e2fb2a 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1dab9ff3421ae1976991.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1dab9ff3421ae1976991.md
@@ -1,6 +1,6 @@
 ---
 id: 619d1dab9ff3421ae1976991
-title: Step 76
+title: ステップ 76
 challengeType: 0
 dashedName: step-76
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1deb8b04811b8839ffe4.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1deb8b04811b8839ffe4.md
index fedfdba5a3e..c21aa36e0a7 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1deb8b04811b8839ffe4.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1deb8b04811b8839ffe4.md
@@ -1,6 +1,6 @@
 ---
 id: 619d1deb8b04811b8839ffe4
-title: Step 77
+title: ステップ 77
 challengeType: 0
 dashedName: step-77
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1e7a8e81a61c5a819dc4.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1e7a8e81a61c5a819dc4.md
index 845290eeb7a..cca3748af5a 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1e7a8e81a61c5a819dc4.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1e7a8e81a61c5a819dc4.md
@@ -1,6 +1,6 @@
 ---
 id: 619d1e7a8e81a61c5a819dc4
-title: Step 78
+title: ステップ 78
 challengeType: 0
 dashedName: step-78
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1ed33c9a071cf657a0d6.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1ed33c9a071cf657a0d6.md
index adfd82c7324..883d5b6eec2 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1ed33c9a071cf657a0d6.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1ed33c9a071cf657a0d6.md
@@ -1,6 +1,6 @@
 ---
 id: 619d1ed33c9a071cf657a0d6
-title: Step 79
+title: ステップ 79
 challengeType: 0
 dashedName: step-79
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1fb5d244c31db8a7fdb7.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1fb5d244c31db8a7fdb7.md
index dcaecb2f7e9..c8dd412a361 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1fb5d244c31db8a7fdb7.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d1fb5d244c31db8a7fdb7.md
@@ -1,6 +1,6 @@
 ---
 id: 619d1fb5d244c31db8a7fdb7
-title: Step 80
+title: ステップ 80
 challengeType: 0
 dashedName: step-80
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d204bd73ae51e743b8e94.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d204bd73ae51e743b8e94.md
index 12dfd6b819c..ddb482e6957 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d204bd73ae51e743b8e94.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d204bd73ae51e743b8e94.md
@@ -1,6 +1,6 @@
 ---
 id: 619d204bd73ae51e743b8e94
-title: Step 81
+title: ステップ 81
 challengeType: 0
 dashedName: step-81
 ---
@@ -273,7 +273,7 @@ body {
   width:  15%;
   height: 30%;
   background-color: orange;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d20b12996101f430920fb.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d20b12996101f430920fb.md
index e17e69cbf1e..70a7688ac24 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d20b12996101f430920fb.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d20b12996101f430920fb.md
@@ -1,6 +1,6 @@
 ---
 id: 619d20b12996101f430920fb
-title: Step 82
+title: ステップ 82
 challengeType: 0
 dashedName: step-82
 ---
@@ -90,7 +90,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('.foot')?.getPropVal('back
 --fcc-editable-region--
 :root {
   --penguin-face: white;
-  
+
 }
 
 body {
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d21fe6a3f9b2016be9d9d.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d21fe6a3f9b2016be9d9d.md
index f8aacfd20a4..c8d836d1d57 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d21fe6a3f9b2016be9d9d.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d21fe6a3f9b2016be9d9d.md
@@ -1,6 +1,6 @@
 ---
 id: 619d21fe6a3f9b2016be9d9d
-title: Step 83
+title: ステップ 83
 challengeType: 0
 dashedName: step-83
 ---
@@ -11,7 +11,7 @@ Target the `.foot` element with a `class` of `left`, and position it `25%` left
 
 # --hints--
 
-You should use the `.foot.left` selector.
+`.foot.left` セレクターを使用する必要があります。
 
 ```js
 assert.match(code, /\.foot\.left\s*\{/);
@@ -23,7 +23,7 @@ You should give `.foot.left` a `left` of `--fcc-expected--`, but found `--fcc-ac
 assert.equal(new __helpers.CSSHelp(document).getStyle('.foot.left')?.left, '25%');
 ```
 
-You should use the `.foot.right` selector.
+`.foot.right` セレクターを使用する必要があります。
 
 ```js
 assert.match(code, /\.foot\.right\s*\{/);
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d229b0e542520cd91c685.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d229b0e542520cd91c685.md
index 57cd259e1ed..6b8bec07a17 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d229b0e542520cd91c685.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d229b0e542520cd91c685.md
@@ -1,6 +1,6 @@
 ---
 id: 619d229b0e542520cd91c685
-title: Step 84
+title: ステップ 84
 challengeType: 0
 dashedName: step-84
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d23089e787e216a7043d6.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d23089e787e216a7043d6.md
index eafce1fd17a..fc11810ba8a 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d23089e787e216a7043d6.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d23089e787e216a7043d6.md
@@ -1,6 +1,6 @@
 ---
 id: 619d23089e787e216a7043d6
-title: Step 85
+title: ステップ 85
 challengeType: 0
 dashedName: step-85
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d237a107c10221ed743fa.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d237a107c10221ed743fa.md
index f00af96ee32..eaae2777dfc 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d237a107c10221ed743fa.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d237a107c10221ed743fa.md
@@ -1,6 +1,6 @@
 ---
 id: 619d237a107c10221ed743fa
-title: Step 86
+title: ステップ 86
 challengeType: 0
 dashedName: step-86
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d26b12e651022d80cd017.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d26b12e651022d80cd017.md
index 35a067ba4d4..efae57ab719 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d26b12e651022d80cd017.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d26b12e651022d80cd017.md
@@ -1,6 +1,6 @@
 ---
 id: 619d26b12e651022d80cd017
-title: Step 87
+title: ステップ 87
 challengeType: 0
 dashedName: step-87
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2712853306238f41828e.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2712853306238f41828e.md
index 6acbf4fb438..0e46d546c56 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2712853306238f41828e.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2712853306238f41828e.md
@@ -1,6 +1,6 @@
 ---
 id: 619d2712853306238f41828e
-title: Step 88
+title: ステップ 88
 challengeType: 0
 dashedName: step-88
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2b7a84e78b246f2d17a2.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2b7a84e78b246f2d17a2.md
index 195767a154e..68a08a73ab7 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2b7a84e78b246f2d17a2.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2b7a84e78b246f2d17a2.md
@@ -1,6 +1,6 @@
 ---
 id: 619d2b7a84e78b246f2d17a2
-title: Step 89
+title: ステップ 89
 challengeType: 0
 dashedName: step-89
 ---
@@ -11,7 +11,7 @@ Target the `.arm` element with a `class` of `left`, and position it `35%` from t
 
 # --hints--
 
-You should use the `.arm.left` selector.
+`.arm.left` セレクターを使用する必要があります。
 
 ```js
 assert.match(code, /\.arm\.left\s*\{/);
@@ -29,7 +29,7 @@ You should give `.arm.left` a `left` of `--fcc-expected--`, but found `--fcc-act
 assert.equal(new __helpers.CSSHelp(document).getStyle('.arm.left')?.left, '5%');
 ```
 
-You should use the `.arm.right` selector.
+`.arm.right` セレクターを使用する必要があります。
 
 ```js
 assert.match(code, /\.arm\.right\s*\{/);
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2bd9c1d43c2526e96f1f.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2bd9c1d43c2526e96f1f.md
index 0c173bdabbc..71483714a66 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2bd9c1d43c2526e96f1f.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2bd9c1d43c2526e96f1f.md
@@ -1,6 +1,6 @@
 ---
 id: 619d2bd9c1d43c2526e96f1f
-title: Step 90
+title: ステップ 90
 challengeType: 0
 dashedName: step-90
 ---
@@ -286,7 +286,7 @@ body {
 .arm.left {
   top: 35%;
   left: 5%;
-  
+
 }
 
 .arm.right {
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2d4e80400325ff89664a.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2d4e80400325ff89664a.md
index a8312184351..9f870ff9c44 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2d4e80400325ff89664a.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2d4e80400325ff89664a.md
@@ -1,6 +1,6 @@
 ---
 id: 619d2d4e80400325ff89664a
-title: Step 91
+title: ステップ 91
 challengeType: 0
 dashedName: step-91
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2ebc81ba81271460850d.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2ebc81ba81271460850d.md
index a505cbe7fad..11534541a40 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2ebc81ba81271460850d.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2ebc81ba81271460850d.md
@@ -1,6 +1,6 @@
 ---
 id: 619d2ebc81ba81271460850d
-title: Step 92
+title: ステップ 92
 challengeType: 0
 dashedName: step-92
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2f0e9440bc27caee1cec.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2f0e9440bc27caee1cec.md
index cb7d052a130..917264c187e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2f0e9440bc27caee1cec.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2f0e9440bc27caee1cec.md
@@ -1,6 +1,6 @@
 ---
 id: 619d2f0e9440bc27caee1cec
-title: Step 93
+title: ステップ 93
 challengeType: 0
 dashedName: step-93
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2fd3ff4f772882e3d998.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2fd3ff4f772882e3d998.md
index f2a41bcf9f1..ca222c9746b 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2fd3ff4f772882e3d998.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d2fd3ff4f772882e3d998.md
@@ -1,6 +1,6 @@
 ---
 id: 619d2fd3ff4f772882e3d998
-title: Step 94
+title: ステップ 94
 challengeType: 0
 dashedName: step-94
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d30350883802921bfcccc.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d30350883802921bfcccc.md
index 26646923045..1a7b8af2589 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d30350883802921bfcccc.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d30350883802921bfcccc.md
@@ -1,6 +1,6 @@
 ---
 id: 619d30350883802921bfcccc
-title: Step 95
+title: ステップ 95
 challengeType: 0
 dashedName: step-95
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md
index 196d8ca49de..068046281d3 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d324f5915c929f36ae91d.md
@@ -1,6 +1,6 @@
 ---
 id: 619d324f5915c929f36ae91d
-title: Step 96
+title: ステップ 96
 challengeType: 0
 dashedName: step-96
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d32c7fa21f32aaa91d499.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d32c7fa21f32aaa91d499.md
index 882b72e8de8..7134439efe7 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d32c7fa21f32aaa91d499.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d32c7fa21f32aaa91d499.md
@@ -1,6 +1,6 @@
 ---
 id: 619d32c7fa21f32aaa91d499
-title: Step 97
+title: ステップ 97
 challengeType: 0
 dashedName: step-97
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d333b738e3c2b5d58b095.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d333b738e3c2b5d58b095.md
index 73a2ed37e49..d36c2c4436c 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d333b738e3c2b5d58b095.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d333b738e3c2b5d58b095.md
@@ -1,6 +1,6 @@
 ---
 id: 619d333b738e3c2b5d58b095
-title: Step 98
+title: ステップ 98
 challengeType: 0
 dashedName: step-98
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d337765b9f02c10e93722.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d337765b9f02c10e93722.md
index a23611954b9..ee92cc3c2ee 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d337765b9f02c10e93722.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d337765b9f02c10e93722.md
@@ -1,6 +1,6 @@
 ---
 id: 619d337765b9f02c10e93722
-title: Step 99
+title: ステップ 99
 challengeType: 0
 dashedName: step-99
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d33c51140292cc5a21742.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d33c51140292cc5a21742.md
index 1e1d1b853b1..859d1384fc0 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d33c51140292cc5a21742.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d33c51140292cc5a21742.md
@@ -1,6 +1,6 @@
 ---
 id: 619d33c51140292cc5a21742
-title: Step 100
+title: ステップ 100
 challengeType: 0
 dashedName: step-100
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3482f505452d861d0f62.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3482f505452d861d0f62.md
index 81d54d1bee5..c38e811aed7 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3482f505452d861d0f62.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3482f505452d861d0f62.md
@@ -1,6 +1,6 @@
 ---
 id: 619d3482f505452d861d0f62
-title: Step 101
+title: ステップ 101
 challengeType: 0
 dashedName: step-101
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3561a951bf2e41a24f10.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3561a951bf2e41a24f10.md
index 723220f0d88..a77be9a7689 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3561a951bf2e41a24f10.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3561a951bf2e41a24f10.md
@@ -1,6 +1,6 @@
 ---
 id: 619d3561a951bf2e41a24f10
-title: Step 102
+title: ステップ 102
 challengeType: 0
 dashedName: step-102
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d36103839c82efa95dd34.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d36103839c82efa95dd34.md
index d5401ee81ec..43445995ead 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d36103839c82efa95dd34.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d36103839c82efa95dd34.md
@@ -1,6 +1,6 @@
 ---
 id: 619d36103839c82efa95dd34
-title: Step 103
+title: ステップ 103
 challengeType: 0
 dashedName: step-103
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3711d04d623000013e9e.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3711d04d623000013e9e.md
index 3c3dc0c6bf0..d17b99b6c00 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3711d04d623000013e9e.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/619d3711d04d623000013e9e.md
@@ -1,6 +1,6 @@
 ---
 id: 619d3711d04d623000013e9e
-title: Step 104
+title: ステップ 104
 challengeType: 0
 dashedName: step-104
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61a8fe15a6a31306e60d1e89.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61a8fe15a6a31306e60d1e89.md
index 7d4ef4402ba..52a33f4932f 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61a8fe15a6a31306e60d1e89.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-transforms-by-building-a-penguin/61a8fe15a6a31306e60d1e89.md
@@ -1,6 +1,6 @@
 ---
 id: 61a8fe15a6a31306e60d1e89
-title: Step 4
+title: ステップ 4
 challengeType: 0
 dashedName: step-4
 ---
@@ -30,7 +30,7 @@ assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.height, '100vh');
 ```html
 <!DOCTYPE html>
 <html lang="en">
-  
+
   <head>
     <meta charset="UTF-8" />
     <link rel="stylesheet" href="./styles.css" />
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9908.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9908.md
index 74f1fa92aaa..db0e3ebe886 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9908.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9908.md
@@ -1,35 +1,35 @@
 ---
 id: 5d822fd413a79914d39e9908
-title: Step 64
+title: ステップ 64
 challengeType: 0
 dashedName: step-64
 ---
 
 # --description--
 
-Remove the `background-color` property and value from `.bb4`, and add it to the three new sections `.bb4a`, `.bb4b`, and `.bb4c`, so only the sections are filled.
+`background-color` プロパティと値を、`.bb4` から削除して 3 つの新しいセクション `.bb4a`、`.bb4b`、`.bb4c` に追加し、それらのセクションのみが塗りつぶされるようにしてください。
 
 # --hints--
 
-You should remove the `background-color` from `.bb4`.
+`.bb4` から `background-color` を削除する必要があります。
 
 ```js
 assert.isEmpty(new __helpers.CSSHelp(document).getStyle(".bb4")?.backgroundColor);
 ```
 
-You should give `.bb4a` a `background-color` of `--building-color4`.
+`.bb4a` の `background-color` を `--building-color4` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".bb4a")?.backgroundColor.trim(), "var(--building-color4)");
 ```
 
-You should give `.bb4b` a `background-color` of `--building-color4`.
+`.bb4b` の `background-color` を `--building-color4` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".bb4b")?.backgroundColor.trim(), "var(--building-color4)");
 ```
 
-You should give `.bb4c` a `background-color` of `--building-color4`.
+`.bb4c` の `background-color` を `--building-color4` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".bb4c")?.backgroundColor.trim(), "var(--building-color4)");
@@ -134,11 +134,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -208,7 +208,7 @@ body {
   width: 80%;
   height: 5%;
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -232,7 +232,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -254,5 +254,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9909.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9909.md
index c1f05cb180c..31022d4fa83 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9909.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9909.md
@@ -1,17 +1,17 @@
 ---
 id: 5d822fd413a79914d39e9909
-title: Step 65
+title: ステップ 65
 challengeType: 0
 dashedName: step-65
 ---
 
 # --description--
 
-You want `.bb4` to share the properties of `.bb1` that center the sections. Instead of duplicating that code, create a new class above the background building comment called `building-wrap`. Leave it empty for now; this class will be used in a few places to save you some coding.
+`.bb1` の各セクションを中央に配置しているプロパティを、`.bb4` でも使いたいと思います。 そのコードを複製する代わりに、`building-wrap` という新しいクラスを、奥のビル (background building) のコメントの上に作成してください。 新しいクラスは今は空のままにしておきます。このクラスは、この後いくつかの場所でコードを省略するために使います。
 
 # --hints--
 
-You should create a new class declaration called `building-wrap`.
+`building-wrap` という新しいクラス宣言を作成する必要があります。
 
 ```js
 assert.exists(new __helpers.CSSHelp(document).getStyle(".building-wrap"));
@@ -118,11 +118,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -193,7 +193,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -218,7 +218,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -240,6 +240,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990a.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990a.md
index 91c5eaceb1f..71fe67338f2 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990a.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990a.md
@@ -1,47 +1,47 @@
 ---
 id: 5d822fd413a79914d39e990a
-title: Step 66
+title: ステップ 66
 challengeType: 0
 dashedName: step-66
 ---
 
 # --description--
 
-Move the `display`, `flex-direction`, and `align-items` properties and values from `.bb1` to the new `building-wrap` class.
+`display`、`flex-direction`、および `align-items` プロパティとその値を、`.bb1` から新しい `building-wrap` クラスに移動してください。
 
 # --hints--
 
-You should remove `display` from `.bb1`.
+`.bb1` から `display` を削除する必要があります。
 
 ```js
 assert.isEmpty(new __helpers.CSSHelp(document).getStyle(".bb1")?.display);
 ```
 
-You should move `display` with a value of `flex` to `.building-wrap`.
+値 `flex` を持つ `display` を `.building-wrap` に移動する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".building-wrap")?.display, "flex");
 ```
 
-You should remove `flex-direction` from `.bb1`.
+`.bb1` から `flex-direction` を削除する必要があります。
 
 ```js
 assert.isEmpty(new __helpers.CSSHelp(document).getStyle(".bb1")?.flexDirection);
 ```
 
-You should move `flex-direction` with a value of `column` to `.building-wrap`.
+値 `column` を持つ `flex-direction` を `.building-wrap` に移動する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".building-wrap")?.flexDirection, "column");
 ```
 
-You should remove `align-items` from `.bb1`.
+`.bb1` から `align-items` を削除する必要があります。
 
 ```js
 assert.isEmpty(new __helpers.CSSHelp(document).getStyle(".bb1")?.alignItems);
 ```
 
-You should move `align-items` with a value of `center` to `.building-wrap`.
+値 `center` を持つ `align-items` を `.building-wrap` に移動する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".building-wrap")?.alignItems, "center");
@@ -150,11 +150,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -225,7 +225,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -250,7 +250,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -272,6 +272,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990b.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990b.md
index 6c551ec4605..12677fe7d1c 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990b.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990b.md
@@ -1,23 +1,23 @@
 ---
 id: 5d822fd413a79914d39e990b
-title: Step 67
+title: ステップ 67
 challengeType: 0
 dashedName: step-67
 ---
 
 # --description--
 
-Add the new `building-wrap` class to the `.bb1` and `.bb4` elements. This will apply the centering properties to the buildings that need it.
+ではその `building-wrap` クラスを `.bb1` 要素と `.bb4` 要素に追加してください。 これで、中央揃えのプロパティが必要なビルに適用されます。
 
 # --hints--
 
-You should add `building-wrap` to the `.bb1` element.
+`.bb1` 要素に `building-wrap` を追加する必要があります。
 
 ```js
 assert.exists(document.querySelector("div.bb1.building-wrap"));
 ```
 
-You should add `building-wrap` to the `.bb4` element.
+`.bb4` 要素に `building-wrap` を追加する必要があります。
 
 ```js
 assert.exists(document.querySelector("div.bb4.building-wrap"));
@@ -127,11 +127,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -202,7 +202,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -227,7 +227,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -249,6 +249,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990c.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990c.md
index 207b0898467..42f403acbb8 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990c.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990c.md
@@ -1,23 +1,23 @@
 ---
 id: 5d822fd413a79914d39e990c
-title: Step 68
+title: ステップ 68
 challengeType: 0
 dashedName: step-68
 ---
 
 # --description--
 
-Create a new variable called `--window-color4` in `:root` and give it a value of `#8cb3d9`. This will be the secondary color for the last background building.
+`:root` 内に `--window-color4` という新しい変数を作成し、値 `#8cb3d9` を設定してください。 これは奥側の最後のビルに使う二つめの色になります。
 
 # --hints--
 
-You should define a new property variable `--window-color4`.
+新しい変数 `--window-color4` を定義する必要があります。
 
 ```js
 assert(new __helpers.CSSHelp(document).isPropertyUsed("--window-color4"));
 ```
 
-You should give `--window-color4` a value of `#8cb3d9`.
+`--window-color4` に値 `#8cb3d9` を設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(":root")?.getPropertyValue("--window-color4")?.trim(), "#8cb3d9");
@@ -126,11 +126,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -201,7 +201,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -226,7 +226,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -248,6 +248,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990d.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990d.md
index c792b7c315e..c4852b41671 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990d.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990d.md
@@ -1,23 +1,23 @@
 ---
 id: 5d822fd413a79914d39e990d
-title: Step 69
+title: ステップ 69
 challengeType: 0
 dashedName: step-69
 ---
 
 # --description--
 
-Nest four new `div` elements within `.bb4c`, give them all the class of `bb4-window`. These will be windows for this building.
+`.bb4c` の中に 4 つの新しい `div` 要素をネストし、それらすべてに `bb4-window` クラスを設定してください。 これらは、このビルの窓になります。
 
 # --hints--
 
-You should add four `div` elements to `.bb4c`.
+`.bb4c` に 4 つの `div` 要素を追加する必要があります。
 
 ```js
 assert.equal(document.querySelector(".bb4c")?.children?.length, 4);
 ```
 
-You should give each new `div` a class of `bb4-window`.
+それぞれの新しい `div` に `bb4-window` のクラスを設定する必要があります。
 
 ```js
 assert.equal(document.querySelectorAll("div.bb4c > div.bb4-window")?.length, 4);
@@ -128,11 +128,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -203,7 +203,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -228,7 +228,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -250,6 +250,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990e.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990e.md
index 03e6774811d..f3069168226 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990e.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990e.md
@@ -1,29 +1,29 @@
 ---
 id: 5d822fd413a79914d39e990e
-title: Step 70
+title: ステップ 70
 challengeType: 0
 dashedName: step-70
 ---
 
 # --description--
 
-Give the `bb4-window` class a `width` of `18%`, a `height` of `90%`, and add your `--window-color4` variable as the `background-color`.
+`bb4-window` クラスの `width` を `18%` に、`height` を `90%` に設定し、`background-color` として `--window-color4` 変数を設定してください。
 
 # --hints--
 
-You should give `.bb4-window` a `width` of `18%`.
+`.bb4-window` の `width` を `18%` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".bb4-window")?.width, "18%");
 ```
 
-You should give `.bb4-window` a `height` of `90%`.
+`.bb4-window` の `height` を `90%` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".bb4-window")?.height, "90%");
 ```
 
-You should give `.bb4-window` a `background-color` of `--window-color4`.
+`.bb4-window` の `background-color` を `--window-color4` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".bb4-window")?.backgroundColor.trim(), "var(--window-color4)");
@@ -137,11 +137,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -212,7 +212,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -239,7 +239,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -261,5 +261,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990f.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990f.md
index b0e6c9ac647..4d7ede09724 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990f.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e990f.md
@@ -1,13 +1,13 @@
 ---
 id: 5d822fd413a79914d39e990f
-title: Step 71
+title: ステップ 71
 challengeType: 0
 dashedName: step-71
 ---
 
 # --description--
 
-The windows are stacked on top of each other at the left of the section, behind the purple building. Add a new class below `.building-wrap` called `window-wrap`, and add these properties to it:
+窓がセクションの左端、紫色のビルの後ろで互いに積み重なっています。 `.building-wrap` の下に `window-wrap` という名前の新しいクラスを追加し、以下のプロパティを追加してください:
 
 ```css
 display: flex;
@@ -15,29 +15,29 @@ align-items: center;
 justify-content: space-evenly;
 ```
 
-This will be used in a few places to center window elements vertically, and evenly space them in their parent.
+後ほどこれを使って、窓の要素を親要素の垂直方向中央に、等間隔に配置します。
 
 # --hints--
 
-You should create a `.window-wrap` selector.
+`.window-wrap` セレクターを作成する必要があります。
 
 ```js
 assert.exists(new __helpers.CSSHelp(document).getStyle(".window-wrap"));
 ```
 
-You should give `.window-wrap` a `display` of `flex`.
+`.window-wrap` の `display` を `flex` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".window-wrap")?.display, "flex");
 ```
 
-You should give `.window-wrap` an `align-items` of `center`.
+`.window-wrap` の `align-items` を `center` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".window-wrap")?.alignItems, "center");
 ```
 
-You should give `.window-wrap` a `justify-content` of `space-evenly`.
+`.window-wrap` の `justify-content` を `space-evenly` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".window-wrap")?.justifyContent, "space-evenly");
@@ -153,11 +153,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -228,7 +228,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -259,7 +259,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -281,6 +281,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9910.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9910.md
index 5e0b774f8ab..0c8502383fd 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9910.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9910.md
@@ -1,17 +1,17 @@
 ---
 id: 5d822fd413a79914d39e9910
-title: Step 72
+title: ステップ 72
 challengeType: 0
 dashedName: step-72
 ---
 
 # --description--
 
-Add the new `window-wrap` class to the `.bb4c` element.
+では新しいクラス `window-wrap` を `.bb4c` 要素に追加してください。
 
 # --hints--
 
-You should add a class of `window-wrap` to `.bb4c`.
+クラス `window-wrap` を `.bb4c` に追加する必要があります。
 
 ```js
 assert.exists(document.querySelector("div.bb4c.window-wrap"));
@@ -133,11 +133,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -208,7 +208,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -239,7 +239,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -261,6 +261,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9911.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9911.md
index 2331da101b7..1d00b8795bb 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9911.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9911.md
@@ -1,41 +1,41 @@
 ---
 id: 5d822fd413a79914d39e9911
-title: Step 73
+title: ステップ 73
 challengeType: 0
 dashedName: step-73
 ---
 
 # --description--
 
-Looks good! On to the foreground buildings! Turn the `.fb1` building into three sections by nesting three new `div` elements within it. Give them the classes of `fb1a`, `fb1b` and `fb1c`, in that order.
+良い感じになってきました！ 手前の建物に取り掛かりましょう！ `.fb1` の中に新しい `div` 要素を 3 つネストして、このビルを 3 つのセクションに分けてください。 それぞれのクラスを順に `fb1a`、`fb1b`、`fb1c` としてください。
 
 # --hints--
 
-You should add three `div` elements within `.fb1`.
+`.fb1` 内に `div` 要素を 3 つ追加する必要があります。
 
 ```js
 assert.equal(document.querySelector("div.fb1")?.children?.length, 3);
 ```
 
-You should give the first new `div` a class of `fb1a`.
+1 つ目の新しい `div` にクラス `fb1a` を設定する必要があります。
 
 ```js
 assert.exists(document.querySelector("div.fb1 > div.fb1a"));
 ```
 
-You should give the second new `div` a class of `fb1b`.
+2 つ目の新しい `div` にクラス `fb1b` を設定する必要があります。
 
 ```js
 assert.exists(document.querySelector("div.fb1 > div.fb1b"));
 ```
 
-You should give the third new `div` a class of `fb1c`.
+3 つ目の新しい `div` にクラス `fb1c` を設定する必要があります。
 
 ```js
 assert.exists(document.querySelector("div.fb1 > div.fb1c"));
 ```
 
-You should place the new `div` elements in this order `.fb1a + .fb1b + .fb1c`.
+新しい `div` 要素は `.fb1a + .fb1b + .fb1c`. の順に配置する必要があります。
 
 ```js
 assert.exists(document.querySelector("div.fb1a + div.fb1b"));
@@ -158,11 +158,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -233,7 +233,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -264,7 +264,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -286,6 +286,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9912.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9912.md
index 05d085a1be7..fafc1fbf4f3 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9912.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9912.md
@@ -1,35 +1,35 @@
 ---
 id: 5d822fd413a79914d39e9912
-title: Step 74
+title: ステップ 74
 challengeType: 0
 dashedName: step-74
 ---
 
 # --description--
 
-Give `.fb1b` a `width` of `60%` and `height` of `10%`, and `.fb1c` a `width` of `100%` and `height` of `80%`.
+`.fb1b` の `width` を `60%`、`height` を `10%` に設定し、`.fb1c` の `width` を `100%`、`height` を `80%` に設定してください。
 
 # --hints--
 
-You should give `.fb1b` a `width` of `60%`.
+`.fb1b` の `width` を `60%` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb1b")?.width, "60%");
 ```
 
-You should give `.fb1b` a `height` of `10%`.
+`.fb1b` の `height` を `10%` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb1b")?.height, "10%");
 ```
 
-You should give `.fb1c` a `width` of `100%`.
+`.fb1c` の `width` を `100%` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb1c")?.width, "100%");
 ```
 
-You should give `.fb1c` a `height` of `80%`.
+`.fb1c` の `height` を `80%` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb1c")?.height, "80%");
@@ -153,11 +153,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -228,7 +228,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -261,7 +261,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -283,5 +283,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9913.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9913.md
index d451d028ebe..f6f37f432b6 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9913.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9913.md
@@ -1,17 +1,17 @@
 ---
 id: 5d822fd413a79914d39e9913
-title: Step 75
+title: ステップ 75
 challengeType: 0
 dashedName: step-75
 ---
 
 # --description--
 
-Add the `building-wrap` class to the `.fb1` element to center the sections.
+セクションを中央に配置するため、`building-wrap` クラスを `.fb1` 要素に追加してください。
 
 # --hints--
 
-You should add the class `building-wrap` to `.fb1`.
+`building-wrap` クラスを `.fb1` に追加する必要があります。
 
 ```js
 assert.exists(document.querySelector("div.fb1.building-wrap"));
@@ -137,11 +137,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -212,7 +212,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -236,7 +236,7 @@ body {
   width: 60%;
   height: 10%;
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -253,7 +253,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -275,6 +275,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9914.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9914.md
index 5cb763bcec7..a08e0d7b5b9 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9914.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9914.md
@@ -1,23 +1,23 @@
 ---
 id: 5d822fd413a79914d39e9914
-title: Step 76
+title: ステップ 76
 challengeType: 0
 dashedName: step-76
 ---
 
 # --description--
 
-Move the `background-color` property and value from `.fb1` to `.fb1b`.
+`background-color` プロパティと値を `.fb1` から `.fb1b` に移動してください。
 
 # --hints--
 
-You should remove `background-color` from `.fb1`.
+`.fb1` から `background-color` を削除する必要があります。
 
 ```js
 assert.isEmpty(new __helpers.CSSHelp(document).getStyle(".fb1")?.backgroundColor);
 ```
 
-You should add a `background-color` of `--building-color4` to `.fb1b`.
+`--building-color4` の `background-color` を `.fb1b` に追加する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb1b")?.backgroundColor.trim(), "var(--building-color4)");
@@ -141,11 +141,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -216,7 +216,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -258,7 +258,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -280,5 +280,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9915.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9915.md
index e476f5d90bc..f8af0ff75b1 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9915.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9915.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9915
-title: Step 106
+title: ステップ 106
 challengeType: 0
 dashedName: step-106
 ---
@@ -161,11 +161,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -236,7 +236,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -266,7 +266,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -313,13 +313,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -386,6 +386,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9916.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9916.md
index 8685190853e..a001fb43933 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9916.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9916.md
@@ -1,37 +1,37 @@
 ---
 id: 5d822fd413a79914d39e9916
-title: Step 77
+title: ステップ 77
 challengeType: 0
 dashedName: step-77
 ---
 
 # --description--
 
-Don't worry about the space at the bottom, everything will get moved down later when you add some height to the element at the top of the building.
+下部にスペースがありますが心配いりません。後ほどビルの上部の要素に高さを設定すると、全体が下に移動します。
 
-Add a `repeating-linear-gradient` to `.fb1c` with a `90deg` angle, your `--building-color4` from `0%` to `10%` and `transparent` from `10%` to `15%`.
+`.fb1c` に `repeating-linear-gradient` を追加し、角度は `90deg`、`0%` から `10%` まではあなたが定義した変数 `--building-color4`、`10%` から `15%` までは `transparent` に設定してください。
 
 # --hints--
 
-You should give `.fb1c` a `background` with a `repeating-linear-gradient`.
+`.fb1c` の `background` を `repeating-linear-gradient` に設定する必要があります。
 
 ```js
 assert.include(new __helpers.CSSHelp(document).getStyle(".fb1c")?.background, "repeating-linear-gradient");
 ```
 
-You should use a direction of `90deg`.
+`90deg` の方向を使用する必要があります。
 
 ```js
 assert.include(new __helpers.CSSHelp(document).getStyle(".fb1c")?.getPropVal('background', true), "repeating-linear-gradient(90deg");
 ```
 
-You should use a first color of `--building-color4` from `0%` to `10%`.
+`0%` から `10%` までは 1 色目の `--building-color4` を使用する必要があります。
 
 ```js
 assert.match(new __helpers.CSSHelp(document).getStyle(".fb1c")?.getPropVal('background', true), /repeating-linear-gradient\(90deg,var(\(--building-color4\)(0%)?,var\(--building-color4\)10%|\(--building-color4\)0%10%)/);
 ```
 
-You should use a second color of `transparent` from `10%` to `15%`.
+`10%` から `15%` までは 2 色目の `transparent` を使用する必要があります。
 
 ```js
 assert.match(new __helpers.CSSHelp(document).getStyle(".fb1c")?.getPropVal('background', true), /,(transparent10%,transparent15%\)|transparent10%15%\))$/);
@@ -155,11 +155,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -230,7 +230,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -271,7 +271,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -293,5 +293,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9917.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9917.md
index 226aa2791df..75da13fae66 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9917.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9917.md
@@ -1,13 +1,13 @@
 ---
 id: 5d822fd413a79914d39e9917
-title: Step 78
+title: ステップ 78
 challengeType: 0
 dashedName: step-78
 ---
 
 # --description--
 
-You can add multiple gradients to an element by separating them with a comma (`,`) like this:
+要素に複数のグラデーションを追加するには、次のようにコンマ (`,`) で区切ります:
 
 ```css
 gradient1(
@@ -18,23 +18,23 @@ gradient2(
 );
 ```
 
-Add a `repeating-linear-gradient` to `.fb1c` below the one that's there; use your `--building-color4` from `0%` to `10%` and `--window-color4` from `10%` and `90%`. This will fill in behind the gradient you added last.
+`.fb1c` に、今ある物の下にもう 1 つ `repeating-linear-gradient` を追加してください。`0%` から `10%` までは `--building-color4`、`10%` から `90%` までは `--window-color4` を設定してください。 これで、一つ前のステップで追加したグラデーションの後ろが塗りつぶされます。
 
 # --hints--
 
-You should not alter the first `repeating-linear-gradient`.
+最初の `repeating-linear-gradient` は変更しないでください。
 
 ```js
 assert.match(new __helpers.CSSHelp(document).getStyle(".fb1c")?.getPropVal('background', true), /repeating-linear-gradient\(90deg,var\(--building-color4\)(0%)?,var\(--building-color4\)10%,transparent10%,transparent15%\)/);
 ```
 
-You should add a `repeating-linear-gradient` with a first color of `--building-color4` from `0%` to `10%`.
+`repeating-linear-gradient` を追加し、最初の色 `--building-color4` を `0%` から `10%` まで使用する必要があります。
 
 ```js
 assert.match(new __helpers.CSSHelp(document).getStyle(".fb1c")?.getPropVal('background', true), /repeating-linear-gradient\(90deg,var\(--building-color4\)(0%)?,var\(--building-color4\)10%,transparent10%,transparent15%\),repeating-linear-gradient\(var(\(--building-color4\)(0%)?,var\(--building-color4\)10%|\(--building-color4\)0%10%)/);
 ```
 
-You should use a second color of `--window-color4` from `10%` to `90%`.
+2 番目の色 `--window-color4` を `10%` から `90%` まで使用する必要があります。
 
 ```js
 assert.match(new __helpers.CSSHelp(document).getStyle(".fb1c")?.getPropVal('background', true), /,(var\(--window-color4\)10%,var\(--window-color4\)90%\)|var\(--window-color4\)10%90%\))$/);
@@ -158,11 +158,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -233,7 +233,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -281,7 +281,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -303,5 +303,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9918.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9918.md
index 891c49a2e13..77037fb3ae8 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9918.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9918.md
@@ -1,23 +1,23 @@
 ---
 id: 5d822fd413a79914d39e9918
-title: Step 79
+title: ステップ 79
 challengeType: 0
 dashedName: step-79
 ---
 
 # --description--
 
-You're going to use some more border tricks for the top section. Add a `border-bottom` with a value of `7vh solid var(--building-color4)` to `.fb1a`. This will put a `7vh` height border on the bottom. But since the element has zero size, it only shows up as a 2px wide line from the 1px border that is on all the elements.
+一番上のセクションに、また境界線のテクニックを使用します。 `border-bottom` と `7vh solid var(--building-color4)` という値を `.fb1a` に追加してください。 これで要素の下端に `7vh` の高さの境界線が引かれます。 ただし要素のサイズがゼロなので、すべての要素に設定されている 1px の境界線から伸びる幅 2px の線として表示されます。
 
 # --hints--
 
-You should give `.fb1a` a `border-bottom`.
+`.fb1a` に `border-bottom` を設定する必要があります。
 
 ```js
 assert.isNotEmpty(new __helpers.CSSHelp(document).getStyle(".fb1a")?.borderBottom);
 ```
 
-You should use a `border-bottom` of `7vh solid var(--building-color4)`.
+`7vh solid var(--building-color4)` という `border-bottom` を使用する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb1a")?.borderBottom.trim(), "7vh solid var(--building-color4)");
@@ -141,11 +141,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -216,7 +216,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -242,7 +242,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -272,7 +272,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -294,5 +294,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9919.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9919.md
index 70f365e2891..0d84bfd75b0 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9919.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9919.md
@@ -1,23 +1,23 @@
 ---
 id: 5d822fd413a79914d39e9919
-title: Step 80
+title: ステップ 80
 challengeType: 0
 dashedName: step-80
 ---
 
 # --description--
 
-When you increase the size of the left and right borders, the border on the bottom will expand to be the width of the combined left and right border widths. Add `2vw solid transparent` as the value of the `border-left` and `border-right` properties of `.fb1a`. They will be invisible, but it will make the border on the bottom `4vw` wide.
+左右の境界線のサイズを大きくすると、下端の境界線は左右の境界線の幅を足し合わせた幅にまで広がります。 `.fb1a` の `border-left` プロパティと `border-right` プロパティの値として `2vw solid transparent` を追加してください。 左右の境界線は表示されませんが、下端の境界線の幅が `4vw` になります。
 
 # --hints--
 
-You should give `.fb1a` a `border-left` of `2vw solid transparent`.
+`.fb1a` の `border-left` を `2vw solid transparent` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb1a")?.borderLeft, "2vw solid transparent");
 ```
 
-You should give `.fb1a` a `border-right` of `2vw solid transparent`.
+`.fb1a` の `border-right` を `2vw solid transparent` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb1a")?.borderRight, "2vw solid transparent");
@@ -141,11 +141,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -216,7 +216,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -244,7 +244,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -274,7 +274,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -296,6 +296,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991a.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991a.md
index 99f5abea099..0097d75c5d7 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991a.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991a.md
@@ -1,30 +1,30 @@
 ---
 id: 5d822fd413a79914d39e991a
-title: Step 81
+title: ステップ 81
 challengeType: 0
 dashedName: step-81
 ---
 
 # --description--
 
-On to the next building! Nest two `div` elements within `.fb2` and give them classes of `fb2a` and `fb2b`, in that order.
+次のビルに取り掛かりましょう！ `.fb2` の中に 2 つの `div` 要素をネストし、`fb2a` クラスと `fb2b` クラスをこの順序で設定してください。
 
 # --hints--
 
-You should add two `div` elements within `.fb2`.
+`.fb2` 内に `div` 要素を 2 つ追加する必要があります。
 
 ```js
 assert.equal(document.querySelectorAll("div.fb2 > div")?.length, 2);
 ```
 
-You should give the first new `div` a class of `fb2a`.
+1 つ目の新しい `div` にクラス `fb2a` を設定する必要があります。
 
 ```js
 assert.exists(document.querySelector("div.fb2 > div.fb2a"));
 assert(document.querySelector("div.fb2 > div.fb2a") === document.querySelector("div.fb2")?.firstElementChild);
 ```
 
-You should give the second new `div` a class of `fb2b`.
+2 つ目の新しい `div` にクラス `fb2b` を設定する必要があります。
 
 ```js
 assert.exists(document.querySelector("div.fb2 > div.fb2b"));
@@ -150,11 +150,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -225,7 +225,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -255,7 +255,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -285,7 +285,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -307,6 +307,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991b.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991b.md
index f1cc76cabd4..5a59b2f8d34 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991b.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991b.md
@@ -1,29 +1,29 @@
 ---
 id: 5d822fd413a79914d39e991b
-title: Step 82
+title: ステップ 82
 challengeType: 0
 dashedName: step-82
 ---
 
 # --description--
 
-Give `.fb2a` a `width` of `100%` and `.fb2b` a `width` of `100%` and `height` of `75%`.
+`.fb2a` の `width` を `100%` に、`.fb2b` は `width` を `100%`、`height` を `75%` に設定してください。
 
 # --hints--
 
-You should give `.fb2a` a `width` of `100%`.
+`.fb2a` の `width` を `100%` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb2a")?.width, "100%");
 ```
 
-You should give `.fb2b` a `width` of `100%`.
+`.fb2b` の `width` を `100%` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb2b")?.width, "100%");
 ```
 
-You should give `.fb2b` a `height` of `75%`.
+`.fb2b` の `height` を `75%` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb2b")?.height, "75%");
@@ -150,11 +150,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -225,7 +225,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -255,7 +255,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -287,7 +287,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -309,6 +309,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991c.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991c.md
index e047f9f3021..2580c0f8b68 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991c.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991c.md
@@ -1,23 +1,23 @@
 ---
 id: 5d822fd413a79914d39e991c
-title: Step 83
+title: ステップ 83
 challengeType: 0
 dashedName: step-83
 ---
 
 # --description--
 
-Nest three `div` elements within `.fb2b` and give them a class of `fb2-window`. These will be windows for this section of the building.
+`.fb2b` 内に 3 つの `div` 要素をネストし、すべて `fb2-window` のクラスを設定してください。 これらは、ビルのこのセクションにある窓になります。
 
 # --hints--
 
-You should add three `div` elements within `.fb2b`.
+`.fb2b` 内に `div` 要素を 3 つ追加する必要があります。
 
 ```js
 assert.equal(document.querySelectorAll("div.fb2b > div")?.length, 3);
 ```
 
-You should give the three new `div` elements each a class of `fb2-window`.
+3 つの新しい `div` 要素のそれぞれに `fb2-window` のクラスを設定する必要があります。
 
 ```js
 assert.equal(document.querySelectorAll("div.fb2-window")?.length, 3);
@@ -146,11 +146,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -221,7 +221,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -251,7 +251,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -290,7 +290,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -312,6 +312,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991d.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991d.md
index 75eac697004..a6f0dc62857 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991d.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991d.md
@@ -1,17 +1,17 @@
 ---
 id: 5d822fd413a79914d39e991d
-title: Step 84
+title: ステップ 84
 challengeType: 0
 dashedName: step-84
 ---
 
 # --description--
 
-Add your `window-wrap` class to `.fb2b` to position the new window elements.
+新しく追加した窓の要素の配置を調整するため、以前定義した `window-wrap` クラスを `.fb2b` に追加してください。
 
 # --hints--
 
-You should add the class `window-wrap` to `.fb2b`.
+クラス `window-wrap` を `.fb2b` に追加する必要があります。
 
 ```js
 assert.exists(document.querySelector("div.fb2b.window-wrap"));
@@ -144,11 +144,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -219,7 +219,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -249,7 +249,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -288,7 +288,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -310,6 +310,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991e.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991e.md
index 68bea5beb87..f67712c00fa 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991e.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991e.md
@@ -1,29 +1,29 @@
 ---
 id: 5d822fd413a79914d39e991e
-title: Step 85
+title: ステップ 85
 challengeType: 0
 dashedName: step-85
 ---
 
 # --description--
 
-Give the `.fb2-window` elements a `width` of `22%`, `height` of `100%`, and a `background-color` of your `--window-color3` variable.
+`.fb2-window` 要素の `width` を `22%` に、`height` を `100%` に、`background-color` を `--window-color3` 変数に設定してください。
 
 # --hints--
 
-You should give the `.fb2-window` elements a `width` of `22%`.
+`.fb2-window` 要素の `width` を `22%` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb2-window")?.width, "22%");
 ```
 
-You should give the `.fb2-window` elements a `height` of `100%`.
+`.fb2-window` 要素の `height` を `100%` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb2-window")?.height, "100%");
 ```
 
-You should give the `.fb2-window` elements a `background-color` of `--window-color3`.
+`.fb2-window` の `background-color` を `--window-color3` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb2-window")?.backgroundColor.trim(), "var(--window-color3)");
@@ -154,11 +154,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -229,7 +229,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -259,7 +259,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -300,7 +300,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -322,5 +322,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991f.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991f.md
index e4198afe229..a5156a44ba4 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991f.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e991f.md
@@ -1,23 +1,23 @@
 ---
 id: 5d822fd413a79914d39e991f
-title: Step 86
+title: ステップ 86
 challengeType: 0
 dashedName: step-86
 ---
 
 # --description--
 
-Move the `background-color` property and value from `.fb2` to `.fb2b` to just color the section and not the container.
+セクション (内側) にのみ色を付け、コンテナーには色を付けないようにするため、`background-color` プロパティと値を `.fb2` から `.fb2b` に移動してください。
 
 # --hints--
 
-You should remove the `background-color` property from `.fb2`.
+`.fb2` から `background-color` プロパティを削除する必要があります。
 
 ```js
 assert.isEmpty(new __helpers.CSSHelp(document).getStyle(".fb2")?.backgroundColor);
 ```
 
-You should give `.fb2b` a `background-color` of `--building-color3`.
+`.fb2b` の `background-color` を `--building-color3` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb2b")?.backgroundColor.trim(), "var(--building-color3)");
@@ -148,11 +148,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -223,7 +223,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -253,7 +253,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -298,7 +298,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -320,5 +320,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9920.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9920.md
index 3ccdb0dbcc5..cad22a22740 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9920.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9920.md
@@ -1,29 +1,29 @@
 ---
 id: 5d822fd413a79914d39e9920
-title: Step 87
+title: ステップ 87
 challengeType: 0
 dashedName: step-87
 ---
 
 # --description--
 
-For `.fb2a`, add a `border-bottom` of `10vh solid var(--building-color3)`, and a `border-left` and `border-right` of `1vw solid transparent`. This time the border trick will create a trapezoid shape.
+`.fb2a` について、`10vh solid var(--building-color3)` の `border-bottom`、および、`1vw solid transparent` の `border-left` と `border-right` を追加してください。 境界線のテクニックで、今回は台形を作ります。
 
 # --hints--
 
-You should give `.fb2a` a `border-bottom` of `10vh solid var(--building-color3)`.
+`.fb2a` の `border-bottom` を `10vh solid var(--building-color3)` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb2a")?.borderBottom.trim(), "10vh solid var(--building-color3)");
 ```
 
-You should give `.fb2a` a `border-left` of `1vw solid transparent`.
+`.fb2a` の `border-left` を `1vw solid transparent` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb2a")?.borderLeft, "1vw solid transparent");
 ```
 
-You should give `.fb2a` a `border-right` of `1vw solid transparent`.
+`.fb2a` の `border-right` を `1vw solid transparent` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb2a")?.borderRight, "1vw solid transparent");
@@ -154,11 +154,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -229,7 +229,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -259,7 +259,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -304,7 +304,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -326,5 +326,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9921.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9921.md
index 3cff4a2acda..cfc708a206b 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9921.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9921.md
@@ -1,41 +1,41 @@
 ---
 id: 5d822fd413a79914d39e9921
-title: Step 88
+title: ステップ 88
 challengeType: 0
 dashedName: step-88
 ---
 
 # --description--
 
-For the next building, nest four `div` elements within `.fb3` with classes of `fb3a`, `fb3b`, `fb3a` again, and `fb3b` again, in that order. This building will have four sections, and the top two will be almost the same as the bottom two.
+次のビルでは 4 つの `div` 要素を `.fb3` 内にネストして、クラスは `fb3a`、`fb3b`、再び `fb3a`、そして再び `fb3b` を、この順で設定してください。 このビルには 4 つのセクションを作ります。上の 2 つは下の 2 つとほぼ同じになります。
 
 # --hints--
 
-You should add four `div` elements within `.fb3`.
+`.fb3` 内に `div` 要素を 4 つ追加する必要があります。
 
 ```js
 assert.equal(document.querySelectorAll("div.fb3 > div")?.length, 4);
 ```
 
-You should give the first new `div` a class of `fb3a`.
+1 つ目の新しい `div` にクラス `fb3a` を設定する必要があります。
 
 ```js
 assert.equal(document.querySelector("div.fb3").firstElementChild, document.querySelector("div.fb3a"));
 ```
 
-You should give the second new `div` a class of `fb3b`.
+2 つ目の新しい `div` にクラス `fb3b` を設定する必要があります。
 
 ```js
 assert.equal(document.querySelector("div.fb3 :nth-child(2)"), document.querySelector("div.fb3b"));
 ```
 
-You should give the third new `div` a class of `fb3a`.
+3 つ目の新しい `div` にクラス `fb3a` を設定する必要があります。
 
 ```js
 assert.equal(document.querySelector("div.fb3 :nth-child(3)"), document.querySelector("div.fb3b + div.fb3a"));
 ```
 
-You should give the fourth new `div` a class of `fb3b`.
+4 つ目の新しい `div` にクラス `fb3b` を設定する必要があります。
 
 ```js
 assert.exists(document.querySelector("div.fb3 :nth-child(4).fb3b"));
@@ -168,11 +168,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -243,7 +243,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -273,7 +273,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -321,7 +321,7 @@ body {
   height: 35%;
   background-color: var(--building-color1);
 }
-  
+
 .fb4 {
   width: 8%;
   height: 45%;
@@ -343,6 +343,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9922.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9922.md
index 0fa90cef88b..f06fff5d24f 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9922.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9922.md
@@ -1,35 +1,35 @@
 ---
 id: 5d822fd413a79914d39e9922
-title: Step 89
+title: ステップ 89
 challengeType: 0
 dashedName: step-89
 ---
 
 # --description--
 
-Give the `.fb3a` element a `width` of `80%` and `height` of `15%`. Then give the `.fb3b` element a `width` of `100%` and `height` of `35%`.
+`.fb3a` 要素の `width` を `80%` に、`height` を `15%` に設定してください。 次に、`.fb3b` 要素の `width` を `100%` に、`height` を `35%` に設定してください。
 
 # --hints--
 
-You should give `.fb3a` a `width` of `80%`.
+`.fb3a` の `width` を `80%` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb3a")?.width, "80%");
 ```
 
-You should give `.fb3a` a `height` of `15%`.
+`.fb3a` の `height` を `15%` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb3a")?.height, "15%");
 ```
 
-You should give `.fb3b` a `width` of `100%`.
+`.fb3b` の `width` を `100%` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb3b")?.width, "100%");
 ```
 
-You should give `.fb3b` a `height` of `35%`.
+`.fb3b` の `height` を `35%` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb3b")?.height, "35%");
@@ -165,11 +165,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -240,7 +240,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -270,7 +270,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -342,6 +342,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9923.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9923.md
index c6942ea1b38..c98d75d0ab0 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9923.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9923.md
@@ -1,29 +1,29 @@
 ---
 id: 5d822fd413a79914d39e9923
-title: Step 90
+title: ステップ 90
 challengeType: 0
 dashedName: step-90
 ---
 
 # --description--
 
-Remove the `background-color` property and value from `.fb3`, and add them to `.fb3a` and `.fb3b`.
+`background-color` プロパティと値を `.fb3` から削除し、`.fb3a` と `.fb3b` に追加してください。
 
 # --hints--
 
-You should remove the `background-color` from `.fb3`.
+`.fb3` から `background-color` を削除する必要があります。
 
 ```js
 assert.isEmpty(new __helpers.CSSHelp(document).getStyle(".fb3")?.backgroundColor);
 ```
 
-You should give `.fb3a` a `background-color` of `--building-color1`.
+`.fb3a` の `background-color` を `--building-color1` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb3a")?.backgroundColor.trim(), "var(--building-color1)");
 ```
 
-You should give `.fb3b` a `background-color` of `--building-color1`.
+`.fb3b` の `background-color` を `--building-color1` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb3b")?.backgroundColor.trim(), "var(--building-color1)");
@@ -159,11 +159,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -234,7 +234,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -264,7 +264,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -317,7 +317,7 @@ body {
   width: 80%;
   height: 15%;
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -344,5 +344,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9924.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9924.md
index a7f0e2cb952..2b3443571f8 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9924.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9924.md
@@ -1,17 +1,17 @@
 ---
 id: 5d822fd413a79914d39e9924
-title: Step 91
+title: ステップ 91
 challengeType: 0
 dashedName: step-91
 ---
 
 # --description--
 
-Add your `building-wrap` class to the `.fb3` element to center the sections.
+セクションを中央に配置するため、`building-wrap` クラスを `.fb3` 要素に追加してください。
 
 # --hints--
 
-You should add the class `building-wrap` to `.fb3`.
+クラス `building-wrap` を `.fb3` に追加する必要があります。
 
 ```js
 assert.exists(document.querySelector("div.fb3.building-wrap"));
@@ -149,11 +149,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -224,7 +224,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -254,7 +254,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -301,13 +301,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -335,6 +335,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9925.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9925.md
index 19ff10935fc..2d0bf056359 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9925.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9925.md
@@ -1,23 +1,23 @@
 ---
 id: 5d822fd413a79914d39e9925
-title: Step 92
+title: ステップ 92
 challengeType: 0
 dashedName: step-92
 ---
 
 # --description--
 
-Nest three new `div` elements in the first `.fb3a` element. Give them each a class of `fb3-window`. These will be windows for this section.
+1 つ目の `.fb3a` 内に新しい `div` 要素を 3 つネストしてください。 それぞれにクラス `fb3-window` を設定してください。 これらは、このセクションの窓になります。
 
 # --hints--
 
-You should add three `div` elements within the first `.fb3a` element.
+1 つ目の `.fb3a` 要素内に `div` 要素を 3 つ追加する必要があります。
 
 ```js
 assert.equal(document.querySelectorAll("div.fb3a > div")?.length, 3);
 ```
 
-You should give each new `div` a class of `fb3-window`.
+それぞれの新しい `div` に `fb3-window` のクラスを設定する必要があります。
 
 ```js
 assert.equal(document.querySelectorAll("div.fb3-window")?.length, 3)
@@ -155,11 +155,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -230,7 +230,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -260,7 +260,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -307,13 +307,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -341,6 +341,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9926.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9926.md
index 7c0132cbbd5..4de7178d534 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9926.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9926.md
@@ -1,29 +1,29 @@
 ---
 id: 5d822fd413a79914d39e9926
-title: Step 93
+title: ステップ 93
 challengeType: 0
 dashedName: step-93
 ---
 
 # --description--
 
-Give the `.fb3-window` elements a `width` of `25%`, a `height` of `80%`, and use your `--window-color1` variable as the `background-color` value.
+`.fb3-window` 要素の `width` を `25%` に、`height` を `80%` に設定し、`--window-color1` 変数を `background-color` の値として使用してください。
 
 # --hints--
 
-You should give `.fb3-window` a `width` of `25%`.
+`.fb3-window` の `width` を `25%` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb3-window")?.width, "25%");
 ```
 
-You should give `.fb3-window` a `height` of `80%`.
+`.fb3-window` の `height` を `80%` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb3-window")?.height, "80%");
 ```
 
-You should give `.fb3-window` a `background-color` of `--window-color1`.
+`.fb3-window` の `background-color` を `--window-color1` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle(".fb3-window")?.backgroundColor.trim(), "var(--window-color1)");
@@ -163,11 +163,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -238,7 +238,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -268,7 +268,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -315,13 +315,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -351,5 +351,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9927.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9927.md
index ed213fde285..249223de7fb 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9927.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9927.md
@@ -1,17 +1,17 @@
 ---
 id: 5d822fd413a79914d39e9927
-title: Step 94
+title: ステップ 94
 challengeType: 0
 dashedName: step-94
 ---
 
 # --description--
 
-Add your `window-wrap` class to the `.fb3a` element to center and space the windows.
+窓を中央に配置してスペースを入れるため、`window-wrap` クラスを `.fb3a` 要素に追加してください。
 
 # --hints--
 
-You should give `.fb3a` a class of `window-wrap`.
+`.fb3a` にクラス `window-wrap` を設定する必要があります。
 
 ```js
 assert.exists(document.querySelector("div.fb3a.window-wrap"));
@@ -153,11 +153,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -228,7 +228,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -258,7 +258,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -305,13 +305,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -345,6 +345,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9928.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9928.md
index 456c70cfb9f..c78d7d590a6 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9928.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9928.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9928
-title: Step 95
+title: ステップ 95
 challengeType: 0
 dashedName: step-95
 ---
@@ -152,11 +152,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -227,7 +227,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -257,7 +257,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -304,13 +304,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -344,6 +344,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9929.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9929.md
index ad6a18db3d8..4bc1706059d 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9929.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9929.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9929
-title: Step 96
+title: ステップ 96
 challengeType: 0
 dashedName: step-96
 ---
@@ -165,11 +165,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -240,7 +240,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -270,7 +270,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -317,13 +317,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -357,6 +357,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992a.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992a.md
index 7c1fd3dfc0a..d3b19622b01 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992a.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992a.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e992a
-title: Step 97
+title: ステップ 97
 challengeType: 0
 dashedName: step-97
 ---
@@ -160,11 +160,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -235,7 +235,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -265,7 +265,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -312,13 +312,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -354,6 +354,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992b.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992b.md
index 6ec1e954b18..80dc81a6052 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992b.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992b.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e992b
-title: Step 98
+title: ステップ 98
 challengeType: 0
 dashedName: step-98
 ---
@@ -160,11 +160,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -235,7 +235,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -265,7 +265,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -312,13 +312,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -357,5 +357,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992c.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992c.md
index 1548769e3c8..e60587c6590 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992c.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992c.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e992c
-title: Step 99
+title: ステップ 99
 challengeType: 0
 dashedName: step-99
 ---
@@ -162,11 +162,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -237,7 +237,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -267,7 +267,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -314,13 +314,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -359,6 +359,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992d.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992d.md
index 6ddb73f13b4..6eebbe6fb81 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992d.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992d.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e992d
-title: Step 100
+title: ステップ 100
 challengeType: 0
 dashedName: step-100
 ---
@@ -173,11 +173,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -248,7 +248,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -278,7 +278,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -325,13 +325,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -372,6 +372,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992e.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992e.md
index 3fd53b9a1ec..cb1c303cb46 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992e.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992e.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e992e
-title: Step 101
+title: ステップ 101
 challengeType: 0
 dashedName: step-101
 ---
@@ -167,11 +167,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -242,7 +242,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -272,7 +272,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -319,13 +319,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -370,5 +370,5 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992f.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992f.md
index d3624b3cfda..96a0a35de1d 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992f.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e992f.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e992f
-title: Step 102
+title: ステップ 102
 challengeType: 0
 dashedName: step-102
 ---
@@ -167,11 +167,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -242,7 +242,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -272,7 +272,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -319,13 +319,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -372,6 +372,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9930.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9930.md
index 997ee5ecec0..a42b43d3954 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9930.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9930.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9930
-title: Step 103
+title: ステップ 103
 challengeType: 0
 dashedName: step-103
 ---
@@ -167,11 +167,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -242,7 +242,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -272,7 +272,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -319,13 +319,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -376,6 +376,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9931.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9931.md
index 742b4250c6c..1069108a930 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9931.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9931.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9931
-title: Step 109
+title: ステップ 109
 challengeType: 0
 dashedName: step-109
 ---
@@ -161,11 +161,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9932.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9932.md
index 80bdfe3d777..2e11d1b021e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9932.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9932.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9932
-title: Step 104
+title: ステップ 104
 challengeType: 0
 dashedName: step-104
 ---
@@ -179,11 +179,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -254,7 +254,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -284,7 +284,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -331,13 +331,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -391,6 +391,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9933.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9933.md
index f3731819799..5e352d73b61 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9933.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9933.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9933
-title: Step 105
+title: ステップ 105
 challengeType: 0
 dashedName: step-105
 ---
@@ -179,11 +179,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -254,7 +254,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -284,7 +284,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -331,13 +331,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -397,6 +397,6 @@ body {
   height: 38%;
   background-color: var(--building-color3);
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9934.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9934.md
index 3f172a0388a..a7ee4c3cf1e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9934.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9934.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9934
-title: Step 107
+title: ステップ 107
 challengeType: 0
 dashedName: step-107
 ---
@@ -179,11 +179,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -254,7 +254,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -284,7 +284,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -331,13 +331,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9935.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9935.md
index ef5b15a88a7..3a69dde11c7 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9935.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9935.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9935
-title: Step 108
+title: ステップ 108
 challengeType: 0
 dashedName: step-108
 ---
@@ -173,11 +173,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -248,7 +248,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -278,7 +278,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -325,13 +325,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9936.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9936.md
index 9d8a3c2d880..2a27a3a0ac1 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9936.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9936.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9936
-title: Step 110
+title: ステップ 110
 challengeType: 0
 dashedName: step-110
 ---
@@ -161,11 +161,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -236,7 +236,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -266,7 +266,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -313,13 +313,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -397,6 +397,6 @@ body {
       var(--window-color3) 30%
     );
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9937.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9937.md
index 0c9bd249eb4..debfe8d2902 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9937.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9937.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9937
-title: Step 111
+title: ステップ 111
 challengeType: 0
 dashedName: step-111
 ---
@@ -162,11 +162,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -237,7 +237,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -267,7 +267,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -314,13 +314,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -398,6 +398,6 @@ body {
       var(--window-color3) 30%
     );
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9938.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9938.md
index 0c60ad6415d..28c09e8267b 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9938.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9938.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9938
-title: Step 112
+title: ステップ 112
 challengeType: 0
 dashedName: step-112
 ---
@@ -180,11 +180,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -255,7 +255,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -285,7 +285,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -332,13 +332,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -416,6 +416,6 @@ body {
       var(--window-color3) 30%
     );
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9939.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9939.md
index cb07a8fde0b..16e3e835858 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9939.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e9939.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e9939
-title: Step 113
+title: ステップ 113
 challengeType: 0
 dashedName: step-113
 ---
@@ -169,11 +169,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -244,7 +244,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -274,7 +274,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -321,13 +321,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -405,6 +405,6 @@ body {
       var(--window-color3) 30%
     );
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993a.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993a.md
index 12d39cb4c09..57054a78293 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993a.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993a.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e993a
-title: Step 114
+title: ステップ 114
 challengeType: 0
 dashedName: step-114
 ---
@@ -178,11 +178,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -253,7 +253,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -283,7 +283,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -330,13 +330,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993b.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993b.md
index f43412ed800..99410728e9e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993b.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993b.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e993b
-title: Step 115
+title: ステップ 115
 challengeType: 0
 dashedName: step-115
 ---
@@ -178,11 +178,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -253,7 +253,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -283,7 +283,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -330,13 +330,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -416,7 +416,7 @@ body {
 }
 --fcc-editable-region--
 @media (max-width: 1000px) {
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993c.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993c.md
index 6d77b62b471..646d5e44400 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993c.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993c.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e993c
-title: Step 116
+title: ステップ 116
 challengeType: 0
 dashedName: step-116
 ---
@@ -432,6 +432,6 @@ var(--window-color3) 30%
   }
 --fcc-editable-region--
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993d.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993d.md
index 1a90ae8e5b9..44359cef868 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993d.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993d.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e993d
-title: Step 117
+title: ステップ 117
 challengeType: 0
 dashedName: step-117
 ---
@@ -194,11 +194,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -269,7 +269,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -299,7 +299,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -346,13 +346,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -445,6 +445,6 @@ body {
       );
   }
 }
-    
+
 ```
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993e.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993e.md
index 592c85e070d..d1ad5c5856f 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993e.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-css-variables-by-building-a-city-skyline/5d822fd413a79914d39e993e.md
@@ -1,6 +1,6 @@
 ---
 id: 5d822fd413a79914d39e993e
-title: Step 118
+title: ステップ 118
 challengeType: 0
 dashedName: step-118
 ---
@@ -190,11 +190,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -265,7 +265,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -295,7 +295,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -342,13 +342,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
@@ -446,7 +446,7 @@ body {
       );
   }
 }
-    
+
 ```
 
 # --solutions--
@@ -600,11 +600,11 @@ body {
 .bb1a {
   width: 70%;
 }
-  
+
 .bb1b {
   width: 80%;
 }
-  
+
 .bb1c {
   width: 90%;
 }
@@ -675,7 +675,7 @@ body {
   height: 5%;
   background-color: var(--building-color4);
 }
-  
+
 .bb4c {
   width: 100%;
   height: 85%;
@@ -705,7 +705,7 @@ body {
   height: 10%;
   background-color: var(--building-color4);
 }
-  
+
 .fb1c {
   width: 100%;
   height: 80%;
@@ -752,13 +752,13 @@ body {
   width: 10%;
   height: 35%;
 }
-  
+
 .fb3a {
   width: 80%;
   height: 15%;
   background-color: var(--building-color1);
 }
-  
+
 .fb3b {
   width: 100%;
   height: 35%;
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md
index 1a6c01f05e8..d3319cab0a1 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md
@@ -9,7 +9,7 @@ dashedName: step-5
 
 HTML5 には、さまざまなコンテンツの領域を表す要素があります。 これらの要素によって HTML が読みやすくなり、検索エンジン最適化 (SEO) やアクセシビリティの向上に役立ちます。
 
-このページのメインとなるセクションを表すため、`h1` 要素の後に開始タグ `<main>`、`p` 要素の後に終了タグ `</main>` を追加しましょう。
+Identify the main section of this page by adding a `<main>` opening tag before the `h1` element, and a `</main>` closing tag after the `p` element.
 
 # --hints--
 
@@ -25,20 +25,20 @@ assert(document.querySelector('main'));
 assert(code.match(/<\/main\>/));
 ```
 
-`main` 要素の開始タグは `h1` 要素の下に置く必要があります。 順番が誤っているようです。
+Your `main` element's opening tag should be below the `body` element. 順番が誤っているようです。
 
 ```js
 const main = document.querySelector('main');
-assert.equal(main?.previousElementSibling?.tagName, "H1");
+assert.equal(main?.previousElementSibling, null);
 ```
 
-`main` 要素の開始タグは `h2` 要素の上に置く必要があります。 順番が誤っているようです。
+Your `main` element's opening tag should be above the `h1` element. 順番が誤っているようです。
 
 ```js
-const collection = [...document.querySelectorAll('main,h2')].map(
+const collection = [...document.querySelectorAll('main,h1')].map(
   (node) => node.nodeName
 );
-assert(collection.indexOf('MAIN') < collection.indexOf('H2'));
+assert(collection.indexOf('MAIN') < collection.indexOf('H1'));
 ```
 
 `main` 要素の終了タグは `p` 要素の下に置く必要があります。 順番が誤っているようです。
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md
index 1a37ce16f7b..3b1e32c8128 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md
@@ -1,6 +1,6 @@
 ---
 id: 5dc23991f86c76b9248c6eb8
-title: Step 6
+title: ステップ 6
 challengeType: 0
 dashedName: step-6
 ---
@@ -13,7 +13,7 @@ The `h1` element, `h2` element and the comment are indented two spaces more than
 
 # --hints--
 
-Your code should have an `h2` element with text `Cat Photos`. You may have accidentally deleted it, it is missing both opening and closing tags, or the text has changed.
+コード内には、テキストが `Cat Photos` の `h2` 要素が必要です。 誤って削除されたか、開始タグや終了タグが欠けているか、テキストが変更された可能性があります。
 
 ```js
 assert(
@@ -23,7 +23,7 @@ assert(
 );
 ```
 
-You should not add the `ul` or `li` elements from the example.
+例示されたコード内の `ul` 要素や `li` 要素は追加しないでください。
 
 ```js
 assert(
@@ -31,25 +31,25 @@ assert(
 );
 ```
 
-You should not change the indentation on the line with your `h2` element. Its opening tag should start 6 spaces over from the start of the line. You can restart the step to restore the original indentation.
+`h2` 要素の行のインデントは変更しないでください。 Its opening tag should start 6 spaces over from the start of the line. ステップをやり直すと元のインデントを復元することができます。
 
 ```js
 assert(code.toLowerCase().match(/<\/h1\>\s*\n\s{6}<h2>/));
 ```
 
-Your code should have a comment. You removed the comment from an earlier step.
+コード内にはコメントが必要です。 前のステップで追加されたコメントが削除されているようです。
 
 ```js
 assert(code.match(/<!--.*-->/));
 ```
 
-The comment's text should be `TODO: Add link to cat photos`. Do not change the text or spacing of the comment.
+コメントのテキストは `TODO: Add link to cat photos` でなければなりません。 コメントのテキストやスペースを変更しないでください。
 
 ```js
 assert(code.match(/<!--\s*todo:\s+add\s+link\s+to\s+cat\s+photos\.?\s*-->/i));
 ```
 
-You should not change the indentation on the line with your comment element. Its opening tag should start 6 spaces over from the start of the line. You can restart the step to restore the original indentation.
+コメント要素の行のインデントは変更しないでください。 Its opening tag should start 6 spaces over from the start of the line. ステップをやり直すと元のインデントを復元することができます。
 
 ```js
 assert(
@@ -59,13 +59,13 @@ assert(
 );
 ```
 
-Your code should have a `p` element. You have removed the `p` element from an earlier step.
+コードには `p` 要素が 1 つ必要です。 前のステップで追加された `p` 要素が削除されているようです。
 
 ```js
 assert(document.querySelector('p'));
 ```
 
-The text of the `p` element should be `Click here to view more cat photos.` Do not change the text, spacing, or punctuation of the `p` element.
+`p` 要素のテキストは `Click here to view more cat photos.` でなければなりません。 `p` 要素のテキストやスペース、句読点を変更しないでください。
 
 ```js
 assert(
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md
index 43657a134ea..a5a5e284588 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md
@@ -47,8 +47,8 @@ assert(collection.indexOf('P') < collection.indexOf('IMG'));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md
index 1ea88ab6c72..b7a72025163 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md
@@ -1,39 +1,39 @@
 ---
 id: 5dc24073f86c76b9248c6ebb
-title: Step 8
+title: ステップ 8
 challengeType: 0
 dashedName: step-8
 ---
 
 # --description--
 
-HTML <dfn>attributes</dfn> are special words used inside the opening tag of an element to control the element's behavior. The `src` attribute in an `img` element specifies the image's URL (where the image is located). An example of an `img` element using an `src` attribute: `<img src="https://www.example.com/the-image.jpg">`.
+HTML の<dfn>属性 (attributes)</dfn> とは、要素の開始タグ内で使用され、要素の動作を制御する特別な単語です。 `img` 要素の `src` 属性は、画像の URL (画像がある場所) を指定します。 `src` 属性を使用している `img` 要素の例は `<img src="https://www.example.com/the-image.jpg">` のようになります。
 
-Inside the existing `img` element, add an `src` attribute with this URL:
+既存の `img` 要素に、`src` 属性を追加してこの URL を指定してください:
 
 `https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg`
 
 # --hints--
 
-Your code should have an `img` element. You may have removed the `img` element or you have not surrounded the `src` attribute's value with quotes.
+コードには `img` 要素が 1 つ必要です。 `img` 要素を削除してしまったか、`src` 属性の値を引用符 (") で囲んでいない可能性があります。
 
 ```js
 assert(document.querySelector('img'));
 ```
 
-Your `img` element should have an `src` attribute. You have either omitted the attribute or have a typo. Make sure there is a space between the element name and the attribute name.
+`img` 要素には `src` 属性が必要です。 属性が設定されていないか、誤字脱字があります。 要素名と属性名の間には必ず半角スペースを入れてください。
 
 ```js
 assert(document.querySelector('img').src);
 ```
 
-Your `img` element's `src` attribute should be set to '`https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg`'. You have either omitted the URL or have a typo. The case of the URL is important.
+`img` 要素の `src` 属性は '`https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg`' に設定される必要があります。 URL が設定されていないか、誤字脱字があります。 URL の大文字小文字も関係があります。
 
 ```js
 assert(document.querySelector('img').src === 'https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg');
 ```
 
-Although you have set the `img` element's `src` to the correct URL, it is recommended to always surround the value of an attribute with quotation marks.
+`img` 要素の `src` は正しい URL に設定されていますが、属性の値は常に引用符 (") で囲むことが推奨されています。
 
 ```js
 assert(!/\<img\s+src\s*=\s*https:\/\/cdn\.freecodecamp\.org\/curriculum\/cat-photo-app\/relaxing-cat\.jpg/.test(code));
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md
index a1b7a13bafd..f1fea0f9493 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md
@@ -44,8 +44,8 @@ assert(altText.match(/A cute orange cat lying on its back\.?$/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md
index 826cc5f2167..754dcc0dd5e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md
@@ -64,8 +64,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md
index 597f8f42ba0..de76409f559 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md
@@ -9,7 +9,7 @@ dashedName: step-11
 
 リンクのテキストは、アンカー (`a`) 要素の開始タグと終了タグの間に配置します。 例えば `<a href="https://www.freecodecamp.org">click here to go to freeCodeCamp.org</a>` と書くと、`click here to go to freeCodeCamp.org` というテキストのリンクになります。
 
-アンカー要素に、`cat photos` というアンカーテキストを追加してください。 これがリンクのテキストになります。
+アンカー要素に対して、`link to cat pictures` というアンカーテキストを追加してください。 これがリンクのテキストになります。
 
 # --hints--
 
@@ -25,12 +25,12 @@ assert(document.querySelector('a'));
 assert(code.match(/<\/a\>/));
 ```
 
-アンカー (`a`) 要素のテキストは `cat photos` でなければなりません。 リンクテキストがアンカー (`a`) 要素の開始タグと終了タグの間に置かれていることを確認してください。
+アンカー (`a`) 要素のテキストは `link to cat pictures` である必要があります。 リンクテキストがアンカー (`a`) 要素の開始タグと終了タグの間に置かれていることを確認してください。
 
 ```js
 assert(
   document.querySelector('a').innerText.toLowerCase().replace(/\s+/g, ' ') ===
-    'cat photos'
+    'link to cat pictures'
 );
 ```
 
@@ -41,8 +41,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md
index fff1e7c60e3..fc6d7084bbc 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md
@@ -7,9 +7,10 @@ dashedName: step-12
 
 # --description--
 
-プレビュー内の画像の隣に、`cat photos` という語が下線付きで表示されています。 これがあなたが作成したリンクです。試しにクリックしても構いません。
+前のステップでは、`link to cat pictures` という言葉をアンカー (`a`) の開始タグと終了タグの間に配置することで、リンクに変えることができました。 ある要素、例えば `p` 要素の中の言葉に対しても、同じようにリンクを設定することができます。
+
+In the text of your `p` element, turn the words `cat photos` into a link to `https://freecatphotoapp.com` by adding opening and closing anchor (`a`) tags around these words.
 
-`p` 要素内のテキストについて、`cat photos` という部分を新しいアンカー要素の中にネストして、`https://freecatphotoapp.com` へのリンクにしてください。
 
 # --hints--
 
@@ -19,7 +20,7 @@ dashedName: step-12
 assert($('p > a').length);
 ```
 
-リンクの href の値は `https://freecatphotoapp.com` である必要があります。 href の値が設定されていないか、誤字脱字があります。
+このリンクの `href` 属性の値は `https://freecatphotoapp.com` としてください。 `href` の値が設定されていないか、タイプミスがあります。
 
 ```js
 const nestedAnchor = $('p > a')[0];
@@ -54,13 +55,13 @@ assert(pText.match(/click here to view more cat photos\.?$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
       <p>Click here to view more cat photos.</p>
-      <a href="https://freecatphotoapp.com">cat photos</a>
+      <a href="https://freecatphotoapp.com">link to cat pictures</a>
 --fcc-editable-region--
       <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back.">
     </main>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md
index 16b1497533a..8aa84eccc36 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md
@@ -40,8 +40,8 @@ assert(document.querySelector('a').getAttribute('target') === '_blank');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md
index 2238ba3be1c..90650e388d1 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md
@@ -73,8 +73,8 @@ assert(document.querySelector('img').parentNode.nodeName === 'A');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md
index c030b001f16..bf2815b79bb 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md
index e2d2f21508f..8cdac618f7e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md
@@ -64,8 +64,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md
index c612469202a..61b97b4deea 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md
@@ -37,10 +37,10 @@ assert(secondSectionLastElemNode.nodeName === 'UL');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
-      <h2>Cat Photos</h2>
+        <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
         <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
         <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
index abcbda8f1fd..d55e63f7ae1 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md
index 58fa2587a62..06c9e96946e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md
@@ -68,8 +68,8 @@ assert(!/\<img\s+.+\s+src\s*=\s*https:\/\/cdn\.freecodecamp\.org\/curriculum\/ca
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md
index 5a5b4ac38e6..4fb18c3068b 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md
@@ -48,11 +48,11 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
-      <h2>Cat Photos</h2>
-      <!-- TODO: Add link to cat photos -->
+        <h2>Cat Photos</h2>
+        <!-- TODO: Add link to cat photos -->
         <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
         <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
       </section>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md
index 1b0e8cedbbc..d564812106f 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md
@@ -69,8 +69,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md
index a3b58f73c38..84ec894befb 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md
@@ -55,8 +55,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md
index 4aec24d19a4..d5916a1402e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md
@@ -51,8 +51,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
index ab8764fca7f..6d5fe3f4106 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
@@ -62,8 +62,8 @@ assert.deepStrictEqual(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md
index 9a89deafb29..ecf0dc32540 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md
@@ -36,8 +36,8 @@ assert($('main > section')[1].lastElementChild.nodeName === 'FIGURE');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md
index 39e4c441317..3f90607d4fd 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
index 67c27664939..6f31b36c1fe 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
@@ -63,8 +63,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md
index 660a99c2915..cbee444301b 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md
@@ -45,8 +45,8 @@ assert($('form')[0].innerHTML.trim().length === 0);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md
index 497350047d3..bbc77f6c454 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md
@@ -71,8 +71,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md
index bee2ca2dce4..3ff06351ddc 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md
@@ -64,8 +64,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md
index 83132a45e28..52d8f00f3aa 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md
@@ -58,8 +58,8 @@ assert(!/\<\s*input\s+placeholder\s*=\s*cat\s+photo\s+url/i.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md
index 1dfede9dceb..7706bd1d631 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md
@@ -47,8 +47,8 @@ assert(collection.indexOf('INPUT') < collection.indexOf('BUTTON'));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md
index b401544c09f..6796967ea84 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md
@@ -45,8 +45,8 @@ assert($('input')[0].getAttribute('required') === '');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
index c60ed0a88b6..aacad94041d 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
@@ -90,8 +90,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
index 0ea19b740cf..f0b3a2a56c8 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md
index 66bda4cd1e3..57b783c82de 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md
@@ -57,8 +57,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md
index 644fae99b97..bb87b19fabb 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md
@@ -47,8 +47,8 @@ assert($('input')[0].id.match(/^indoor$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md
index b3738f4da08..3e5ca89e63f 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md
@@ -53,8 +53,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
index c45bdbd383d..ca0589c21af 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
@@ -75,8 +75,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md
index c13da036f82..d0912e3ad4c 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md
@@ -66,8 +66,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md
index da5abfbf4fe..bf70461a100 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md
@@ -59,8 +59,8 @@ assert(!$('input[type="checkbox"]')[2].hasAttribute('checked'));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md
index 5aeb9167fb0..76f6b1a551f 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md
@@ -44,8 +44,8 @@ assert(document.querySelector('main').nextElementSibling.nodeName === 'FOOTER');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md
index af544625b65..2dfbec29a30 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md
@@ -44,8 +44,8 @@ assert(extraSpacesRemoved.match(/No Copyright - freeCodeCamp\.org$/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md
index 788ffdd7bcb..153bccb5440 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md
@@ -55,8 +55,8 @@ assert(pText.match(/^no copyright - freecodecamp.org$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md
index 40e6a5d2b06..0963be47df0 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md
@@ -46,8 +46,8 @@ assert(noSpaces.match(/\<\/head\>\<body\>/));
 <html>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
index 1c8783fbe35..7a8d4e06f33 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
@@ -51,8 +51,8 @@ assert(document.title && document.title.toLowerCase() === 'catphotoapp');
   </head>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
index 23b4b5a9e0f..ca34b020c71 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
@@ -44,8 +44,8 @@ assert(code.match(/<html\s+lang\s*=\s*('|")en\1\s*>/gi));
     <title>CatPhotoApp</title>
   </head>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md
index 9de270e0241..caafa2ae487 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md
@@ -38,8 +38,8 @@ assert(noSpaces.match(/^\<\!DOCTYPEhtml\>\<html/));
   </head>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md
index 79681a1d14f..d5d019a9f7f 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md
@@ -61,8 +61,8 @@ assert(!/\<img\s+.+\s+src\s*=\s*https:\/\/cdn\.freecodecamp\.org\/curriculum\/ca
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md
index e632640125f..8d6cd5be983 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md
@@ -60,8 +60,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md
index 0c17a8443ac..ba8268583ba 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md
@@ -84,8 +84,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md
index 733097ec284..24c8507683e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md
@@ -58,8 +58,8 @@ assert(!/\<input\s+type\s*=\s*text/.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md
index ce8fb396451..e5e88bd2157 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md
@@ -1,37 +1,37 @@
 ---
 id: 5efb2c990dc218d6c85f89b2
-title: Step 43
+title: ステップ 43
 challengeType: 0
 dashedName: step-43
 ---
 
 # --description--
 
-Even though you added your button below the text input, they appear next to each other on the page. That's because both `input` and `button` elements are <dfn>inline elements</dfn>, which don't appear on new lines.
+テキスト入力欄の下にボタンを追加しましたが、ページ上では隣に表示されています。 `input` 要素も `button` 要素も、新しい行に表示されない<dfn>インライン要素</dfn>であるため、このように表示されます。
 
-The button you added will submit the form by default. However, relying on default behavior may cause confusion. Add the `type` attribute with the value `submit` to the `button` to make it clear that it is a submit button.
+追加したボタンは、デフォルトでフォームを送信します。 しかし、デフォルトの動作に頼ると混乱を招く可能性があります。 `button` に `type` 属性と値 `submit` を追加して、送信ボタンであることを明確にしましょう。
 
 # --hints--
 
-Your `button` element should have an opening tag. Opening tags have this syntax: `<elementName>`.
+`button` 要素には開始タグが必要です。 開始タグは `<elementName>` のような形式の構文です。
 
 ```js
 assert(document.querySelector('button'));
 ```
 
-Your `button` element should have a closing tag. Closing tags have a `/` just after the `<` character.
+`button` 要素には終了タグが必要です。 終了タグは `<` の直後に `/` があります。
 
 ```js
 assert(code.match(/<\/button\>/));
 ```
 
-Your `button` element does not have a `type` attribute. Check that there is a space after the opening tag's name.
+`button` 要素に `type` 属性がありません。 開始タグのタグ名の後にスペースがあることを確認してください。
 
 ```js
 assert($('button')[0].hasAttribute('type'));
 ```
 
-Your `button` element should have a `type` attribute with the value `submit`. You have either omitted the value or have a typo. Remember that attribute values should be surrounded with quotation marks.
+`button` 要素には `type` 属性があり、値が `submit` に設定されている必要があります。 値が設定されていないか、誤字脱字があります。 属性値は引用符で囲むことを忘れないでください。
 
 ```js
 assert(
@@ -41,7 +41,7 @@ assert(
 );
 ```
 
-Although you have set the `button` element's `type` attribute to `submit`, it is recommended to always surround the value of an attribute with quotation marks.
+`button` 要素の `type` 属性は `submit` に設定されていますが、属性の値は常に引用符で囲むことが推奨されています。
 
 ```js
 assert(!/\<\s*button\s+type\s*=\s*submit/i.test(code));
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
index 2cc534d53f4..adfc2f6f14e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
@@ -19,10 +19,10 @@ dashedName: step-56
 assert($('input[type="checkbox"]')[0]);
 ```
 
-変更前と変わらず、チェックボックスが `id` 属性を持ち、値が `loving` に設定されている必要があります。 属性が削除されたか、値が変更された可能性があります。
+変更前と変わらず、チェックボックスが `id` 属性を持ち、値が `loving` に設定されている必要があります。  期待される値は `--fcc-expected--` ですが、見つかった値は `--fcc-actual--` でした。
 
 ```js
-assert($('input[type="checkbox"]')[0].id === 'loving');
+assert.equal($('input[type="checkbox"]')[0].id, 'loving');
 ```
 
 チェックボックスの右側に、`Loving` というテキストがそのまま置かれていてはいけません。 `label` 要素に囲まれている必要があります。 2 つの要素の間には必ずスペースを入れてください。
@@ -59,11 +59,11 @@ const labelElem = $('input[type="checkbox"]')[0].nextElementSibling;
 assert(labelElem.hasAttribute('for'));
 ```
 
-新しい `label` 要素には `for` 属性があり、値が `loving` に設定されている必要があります。 値が設定されていないか、誤字脱字があります。 属性値は引用符で囲むことを忘れないでください。
+新しい `label` 要素には `for` 属性があり、値が `loving` に設定されている必要があります。  期待される値は `--fcc-expected--` ですが、見つかった値は `--fcc-actual--` でした。
 
 ```js
 const labelElem = $('input[type="checkbox"]')[0].nextElementSibling;
-assert(labelElem.getAttribute('for').match(/^loving$/));
+assert.equal(labelElem.getAttribute('for'), 'loving');
 ```
 
 テキスト `Loving` は新しい `label` 要素内にネストされている必要があります。 テキストが設定されていないか、誤字脱字があります。
@@ -80,8 +80,8 @@ assert(labelElem.textContent.replace(/\s/g, '').match(/Loving/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md
index 5e405157a8e..f3b5ed1832b 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md
@@ -42,8 +42,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md
index f2f4595f7b8..0151c736c9e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md
@@ -30,8 +30,8 @@ assert($('input[type="checkbox"]')[0].id.match(/^loving$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md
index 6c9cb9370ae..c127c1d8c20 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md
@@ -67,8 +67,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
index ed2616d513e..5b0fc7ceaed 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
@@ -88,8 +88,8 @@ assert(code.match(/<\/label>\s*<label\s*>\s*<input [^>]+>\s*Outdoor/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md
index d814400a5ba..bc50467d6c9 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md
@@ -9,7 +9,7 @@ dashedName: step-16
 
 新しいコンテンツを追加する前に、`section` 要素を利用して猫の写真とこれから追加するコンテンツを分けましょう。
 
-現在 `main` 要素内にあるすべての要素を、`section` 要素の中にネストしましょう。
+Take your `h2`, comment, `p`, and anchor (`a`) elements and nest them in a `section` element.
 
 # --hints--
 
@@ -35,10 +35,18 @@ assert(document.querySelector('section').parentNode.nodeName === 'MAIN');
 
 ```js
 const childrenOfSection = [...document.querySelector('section').childNodes];
-const foundElems = childrenOfSection.filter((child) => {
+const foundElements = childrenOfSection.filter((child) => {
   return ['H2', 'A', 'P'].includes(child.nodeName);
 });
-assert(foundElems.length === 3);
+assert(foundElements.length === 3);
+```
+
+The `h1` element should not be nested in the `section` element.
+
+```js
+const childrenOfSection = [...document.querySelector('section').childNodes];
+const includesH1 = childrenOfSection.some((child) => child.nodeName === 'H1');
+assert.isFalse(includesH1);
 ```
 
 # --seed--
@@ -48,9 +56,9 @@ assert(foundElems.length === 3);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
---fcc-editable-region--
+    --fcc-editable-region--
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md
index 17a7d8428fe..97c0b77c136 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md
@@ -64,8 +64,8 @@ assert(foundElems.length === 2);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
 --fcc-editable-region--
       <section>
         <h2>Cat Photos</h2>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md
index 7519008489b..b1f80e890fa 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md
@@ -58,37 +58,37 @@ assert($('main > section')[2].children.length === 0);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
-      <h2>Cat Photos</h2>
-      <!-- TODO: Add link to cat photos -->
-      <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
-      <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
+        <h2>Cat Photos</h2>
+        <!-- TODO: Add link to cat photos -->
+        <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
+        <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
       </section>
 --fcc-editable-region--
       <section>
-      <h2>Cat Lists</h2>
-      <h3>Things cats love:</h3>
-      <ul>
-        <li>cat nip</li>
-        <li>laser pointers</li>
-        <li>lasagna</li>
-      </ul>
-      <figure>
-        <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/lasagna.jpg" alt="A slice of lasagna on a plate.">
-        <figcaption>Cats <em>love</em> lasagna.</figcaption>  
-      </figure>
-      <h3>Top 3 things cats hate:</h3>
-      <ol>
-        <li>flea treatment</li>
-        <li>thunder</li>
-        <li>other cats</li>
-      </ol>
-      <figure>
-        <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/cats.jpg" alt="Five cats looking around a field.">
-        <figcaption>Cats <strong>hate</strong> other cats.</figcaption>  
-      </figure>
+        <h2>Cat Lists</h2>
+        <h3>Things cats love:</h3>
+        <ul>
+          <li>cat nip</li>
+          <li>laser pointers</li>
+          <li>lasagna</li>
+        </ul>
+        <figure>
+          <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/lasagna.jpg" alt="A slice of lasagna on a plate.">
+          <figcaption>Cats <em>love</em> lasagna.</figcaption>  
+        </figure>
+        <h3>Top 3 things cats hate:</h3>
+        <ol>
+          <li>flea treatment</li>
+          <li>thunder</li>
+          <li>other cats</li>
+        </ol>
+        <figure>
+          <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/cats.jpg" alt="Five cats looking around a field.">
+          <figcaption>Cats <strong>hate</strong> other cats.</figcaption>  
+        </figure>
       </section>
 --fcc-editable-region--
     </main>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md
index e170cdd5fc7..0118ded911f 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md
@@ -54,8 +54,8 @@ assert(extraSpacesRemoved.match(/Is your cat an indoor or outdoor cat\??$/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md
index 0542b96d80d..92123597570 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md
@@ -76,8 +76,8 @@ assert(fieldsetChildren[0].length > fieldsetChildren[1].length);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md
index 3526d70d2fb..589946a2ab8 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md
@@ -60,8 +60,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md
index 0b3c757cf87..d2d443e9752 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md
@@ -60,8 +60,8 @@ assert(outdoorRadioButton.getAttribute('value').match(/^outdoor$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md
index e9562ff5b19..caee285b70e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md
@@ -48,8 +48,8 @@ assert(energeticCheckbox.getAttribute('value').match(/^energetic$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md
index e4f041a074c..b2d3a8f5a71 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md
@@ -37,8 +37,8 @@ assert.equal(document.querySelector('head > meta')?.getAttribute('charset')?.toL
   </head>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
@@ -106,8 +106,8 @@ assert.equal(document.querySelector('head > meta')?.getAttribute('charset')?.toL
     <title>CatPhotoApp</title>
   </head>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md
index 069bfea7309..6107dff6378 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md
@@ -1,29 +1,29 @@
 ---
 id: 62dabe2ef403a12d5d295273
-title: Step 13
+title: ステップ 13
 challengeType: 0
 dashedName: step-13
 ---
 
 # --description--
 
-Now that you turned the text `cat photos` inside the `p` element into a link, you don't need the second link below the `p` element. Delete the entire anchor element below the `p` element.
+`p` 要素内のテキスト `cat photos` をリンクに変換したので、`p` 要素の下の 2 つ目のリンクは必要ありません。 `p` 要素の下にあるアンカー要素全体を削除してください。
 
 # --hints--
 
-Your code should only have one anchor (`a`) element.
+コードにはアンカー (`a`) 要素が 1 つだけ必要です。
 
 ```js
 assert(document.querySelectorAll('a').length === 1);
 ```
 
-The `p` element should still have the anchor (`a`) element inside of it.
+変更前と変わらず、`p` 要素内にアンカー(`a`) 要素が含まれている必要があります。
 
 ```js
 assert($('p > a').length);
 ```
 
-The link's `href` value should be `https://freecatphotoapp.com`. You have either omitted the `href` value or have a typo.
+リンクの `href` の値は `https://freecatphotoapp.com` でなければなりません。 `href` の値が設定されていないか、誤字脱字があります。
 
 ```js
 const nestedAnchor = $('p > a')[0];
@@ -32,7 +32,7 @@ assert(
 );
 ```
 
-The link's text should be `cat photos`. You have either omitted the text or have a typo.
+リンクのテキストは `cat photos` でなければなりません。 テキストが設定されていないか、誤字脱字があります。
 
 ```js
 const nestedAnchor = $('p > a')[0];
@@ -41,7 +41,7 @@ assert(
 );
 ```
 
-The `p` element content visible in the browser should be `Click here to view more cat photos.` Double check the text, spacing, or punctuation of both the `p` and nested anchor element.
+ブラウザーに表示される `p` 要素の中身は `Click here to view more cat photos.` になるはずです。`p` 要素およびネストされたアンカー要素の、テキスト、スペース、句読点を再確認してください。
 
 ```js
 const pText = document
@@ -51,7 +51,7 @@ const pText = document
 assert(pText.match(/click here to view more cat photos\.?$/));
 ```
 
-There should not be `cat photos` text below the `p` element.
+`p` 要素の下にテキスト `cat photos` があってはいけません。
 
 ```js
 const pNextSibling = document.querySelector('p').nextSibling;
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md
index add264a4075..a2619cb380b 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md
@@ -57,8 +57,8 @@ assert(!/\<\s*input\s+.*\s*=\s*catphotourl/.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f0286404aefb0562a4fdf9.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f0286404aefb0562a4fdf9.md
index f5d3f53e8b6..97a88965b02 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f0286404aefb0562a4fdf9.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f0286404aefb0562a4fdf9.md
@@ -7,7 +7,7 @@ dashedName: step-4
 
 # --description--
 
-`head` 内に、`title` 要素と `meta` 要素を追加してください。 プロジェクトのタイトルは `Registration Form` とし、`meta` 要素には `charset` 属性と値 `UTF-8` を設定してください。
+Add a `title` and a `meta` element to the `head`. プロジェクトのタイトルは `Registration Form` とし、`meta` 要素には `charset` 属性と値 `UTF-8` を設定してください。
 
 # --hints--
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md
index 08ba2030478..fce08709258 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md
@@ -6,24 +6,25 @@ dashedName: step-8
 ---
 
 # --description--
+The `vh` unit stands for viewport height, and is relative to 1% of the `height` of the viewport.
 
-プロジェクトの見た目を整えるために、CSS を追加しましょう。 まず、`body` の `width` を `100%` に、`height` を `100vh` に設定してください。
+It is time to spruce the project up with some CSS. Begin by giving the `body` a `width` of `100%`, and a `height` of `100vh`.
 
 # --hints--
 
-`body` 要素セレクターを使用する必要があります。
+You should use the `body` element selector.
 
 ```js
 assert.exists(new __helpers.CSSHelp(document).getStyle('body'));
 ```
 
-`body` の `width` を `100%` に設定する必要があります。
+You should give the `body` a `width` of `100%`.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.width, '100%');
 ```
 
-`body` の `height` を `100vh` に設定する必要があります。
+You should give the `body` a `height` of `100vh`.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.height, '100vh');
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f5cb8875ab6a0610f05071.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f5cb8875ab6a0610f05071.md
index 5bc0bb94a19..9d47642a639 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f5cb8875ab6a0610f05071.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f5cb8875ab6a0610f05071.md
@@ -1,6 +1,6 @@
 ---
 id: 60f5cb8875ab6a0610f05071
-title: Step 12
+title: ステップ 12
 challengeType: 0
 dashedName: step-12
 ---
@@ -11,19 +11,19 @@ As the form will have three distinct sections, add three `fieldset` elements wit
 
 # --hints--
 
-You should add three `fieldset` elements.
+`fieldset` 要素を 3 つ追加する必要があります。
 
 ```js
 assert.equal(document.querySelectorAll('fieldset')?.length, 3);
 ```
 
-The three `fieldset` elements should be within the `form`.
+3 つの `fieldset` 要素は `form` 要素内にある必要があります。
 
 ```js
 assert.equal(document.querySelectorAll('form > fieldset')?.length, 3);
 ```
 
-The three `fieldset` elements should be siblings.
+3 つの `fieldset` 要素は兄弟要素である必要があります。
 
 ```js
 assert.exists(document.querySelector('fieldset + fieldset + fieldset'));
@@ -46,7 +46,7 @@ assert.exists(document.querySelector('fieldset + fieldset + fieldset'));
     <h1>Registration Form</h1>
     <p>Please fill out this form with the required information</p>
     <form action='https://register-demo.freecodecamp.org'>
-    
+
     </form>
   </body>
 --fcc-editable-region--
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md
index 3510c1d98c9..38d4f67c16f 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md
@@ -6,24 +6,25 @@ dashedName: step-15
 ---
 
 # --description--
+The `rem` unit stands for root `em`, and is relative to the font size of the `html` element.
 
-`label` 要素はデフォルトではインラインなので、すべて同じ行に並んで表示されてテキストが読みにくくなります。 別の行に表示させるには、`label` 要素に `display: block` を追加してください。また、それぞれ離れて表示させるために、`margin` を `0.5rem 0` に設定してください。
+As `label` elements are inline by default, they are all displayed side by side on the same line, making their text hard to read. To make them appear on separate lines, add `display: block` to the `label` element, and add a `margin` of `0.5rem 0`, to separate them from each other.
 
 # --hints--
 
-`label` セレクターを使用する必要があります。
+You should use the `label` selector.
 
 ```js
 assert.exists(new __helpers.CSSHelp(document).getStyle('label'));
 ```
 
-`display` プロパティの値を `block` に設定してください。
+You should add a `display` property of value `block`.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('label')?.display, 'block');
 ```
 
-`margin` プロパティの値を `0.5rem 0` に設定してください。
+You should add a `margin` property of value `0.5rem 0`.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('label')?.margin, '0.5rem 0px');
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f8604682407e0d017bbf7f.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f8604682407e0d017bbf7f.md
index 7af3a8d040b..b74af0b9cf8 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f8604682407e0d017bbf7f.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f8604682407e0d017bbf7f.md
@@ -7,7 +7,7 @@ dashedName: step-25
 
 # --description--
 
-利用規約用に、3 つ目の `label` 要素内に `type` が `checkbox` の `input` を追加してください。 また、ユーザーに利用規約を読まずにサインアップしてほしくはないので、チェックボックスを `required` にしてください。
+利用規約用に、3 つ目の `label` 要素内に `type` が `checkbox` の `input` を追加してください。 Make this `input` element `required` because users should not sign up without reading the terms and conditions.
 
 # --hints--
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60fabf0dd4959805dbae09e6.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60fabf0dd4959805dbae09e6.md
index ac893e7a306..b548b133cd4 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60fabf0dd4959805dbae09e6.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60fabf0dd4959805dbae09e6.md
@@ -9,7 +9,7 @@ dashedName: step-31
 
 1 つ目の後にもう 1 つの `label` を追加し、テキストは `Input your age (years):` としてください。 次に、`type` が `number` の `input` をネストしてください。
 
-13 歳未満のユーザーは登録できないようにしたいので、`input` に `min` 属性を追加して、値を `13` に設定してください。 また、おそらく 120 歳より年上のユーザーが登録することはないと仮定して良いでしょう。`max` 属性を追加して、値を `120` に設定してください。
+Next, add a `min` attribute to the `input` with a value of `13` because users under the age of 13 should not register. Also, users probably will not be over the age of 120; add a `max` attribute with a value of `120`.
 
 これで、範囲外の値でフォームを送信しようとすると警告が表示され、フォームが送信されないようになりました。 試してみてください。
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60ffe1bc30415f042faea936.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60ffe1bc30415f042faea936.md
index 45d7a82cfdd..68227d93ab9 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60ffe1bc30415f042faea936.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60ffe1bc30415f042faea936.md
@@ -1,6 +1,6 @@
 ---
 id: 60ffe1bc30415f042faea936
-title: Step 52
+title: ステップ 52
 challengeType: 0
 dashedName: step-52
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60ffe3936796ac04959285a9.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60ffe3936796ac04959285a9.md
index 86998e7b4fb..805163e39b8 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60ffe3936796ac04959285a9.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60ffe3936796ac04959285a9.md
@@ -1,6 +1,6 @@
 ---
 id: 60ffe3936796ac04959285a9
-title: Step 53
+title: ステップ 53
 challengeType: 0
 dashedName: step-53
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60ffe69ee377c6055e192a46.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60ffe69ee377c6055e192a46.md
index 06188bb493a..e71a293b690 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60ffe69ee377c6055e192a46.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60ffe69ee377c6055e192a46.md
@@ -1,37 +1,37 @@
 ---
 id: 60ffe69ee377c6055e192a46
-title: Step 55
+title: ステップ 55
 challengeType: 0
 dashedName: step-55
 ---
 
 # --description--
 
-To style the submit button, you can use an _attribute_ selector, which selects an element based on the given attribute value. Here is an example:
+送信ボタンのスタイルを指定するには、与えられた属性値を元に要素を選択する_属性_セレクターが利用できます。 次の例を見てください:
 
 ```css
 input[name="password"]
 ```
 
-The above selects `input` elements with a `name` attribute value of `password`.
+上の例は、`name` 属性の値が `password` である `input` 要素を選択します。
 
 Now, use the attribute selector to style the submit button with a `display` of `block`, and a `width` of `60%`.
 
 # --hints--
 
-You should use an attribute selector of `input[type="submit"]` to style the submit button.
+属性セレクター `input[type="submit"]` を使用して、送信ボタンのスタイルを変更する必要があります。
 
 ```js
 assert.exists(new __helpers.CSSHelp(document).getStyle('input[type="submit"]'));
 ```
 
-You should give the submit button a `display` of `block`.
+送信ボタンの `display` を `block` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('input[type="submit"]')?.display, 'block');
 ```
 
-You should give the submit button a `width` of `60%`.
+送信ボタンの `width` を `60%` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('input[type="submit"]')?.width, '60%');
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60ffe7d8aae62c05bcc9e7eb.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60ffe7d8aae62c05bcc9e7eb.md
index f3ec7deaaad..2a2c5b1ef7a 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60ffe7d8aae62c05bcc9e7eb.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60ffe7d8aae62c05bcc9e7eb.md
@@ -1,6 +1,6 @@
 ---
 id: 60ffe7d8aae62c05bcc9e7eb
-title: Step 56
+title: ステップ 56
 challengeType: 0
 dashedName: step-56
 ---
@@ -9,17 +9,17 @@ dashedName: step-56
 
 With a `display` of `block` the submit button sits flush against the left edge of its parent.
 
-Use the same technique used to center the `form` to center the submit button.
+`form` を中央揃えにする際に使ったのとテクニックを使って、送信ボタンを中央揃えにしてください。
 
 # --hints--
 
-You should give the submit button a `margin` of `0 auto`.
+送信ボタンの `margin` を `0 auto` に設定する必要があります。
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('input[type="submit"]')?.margin, '0px auto');
 ```
 
-You should not give the submit button a `min-width` or `max-width`.
+送信ボタンには `min-width` と `max-width` は必要ありません。
 
 ```js
 assert.isEmpty(new __helpers.CSSHelp(document).getStyle('input[type="submit"]')?.minWidth);
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60ffec2825da1007509ddd06.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60ffec2825da1007509ddd06.md
index 9cb04369228..def62b2b3ec 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60ffec2825da1007509ddd06.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60ffec2825da1007509ddd06.md
@@ -1,6 +1,6 @@
 ---
 id: 60ffec2825da1007509ddd06
-title: Step 60
+title: ステップ 60
 challengeType: 0
 dashedName: step-60
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62b30924c5e4ef0daba23b5e.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62b30924c5e4ef0daba23b5e.md
index 058b8e4c6ef..4b4ec041143 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62b30924c5e4ef0daba23b5e.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62b30924c5e4ef0daba23b5e.md
@@ -1,13 +1,13 @@
 ---
 id: 62b30924c5e4ef0daba23b5e
-title: Step 46
+title: ステップ 46
 challengeType: 0
 dashedName: step-46
 ---
 
 # --description--
 
-The border of the last `fieldset` element looks a little out of place. You can select the last element of a specific type using the `last-of-type` CSS pseudo-class, like this: 
+The border of the last `fieldset` element looks a little out of place. You can select the last element of a specific type using the `last-of-type` CSS pseudo-class, like this:
 
 ```css
 p:last-of-type { }
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62cc5b1779e4d313466f73c5.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62cc5b1779e4d313466f73c5.md
index 3a5ca7d795c..f74bbb26ef3 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62cc5b1779e4d313466f73c5.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62cc5b1779e4d313466f73c5.md
@@ -1,6 +1,6 @@
 ---
 id: 62cc5b1779e4d313466f73c5
-title: Step 5
+title: ステップ 5
 challengeType: 0
 dashedName: step-5
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62ff8b9dab5ac88e4d3d43a3.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62ff8b9dab5ac88e4d3d43a3.md
index 2b3231f3732..ff7296dbe9c 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62ff8b9dab5ac88e4d3d43a3.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62ff8b9dab5ac88e4d3d43a3.md
@@ -1,6 +1,6 @@
 ---
 id: 62ff8b9dab5ac88e4d3d43a3
-title: Step 17
+title: ステップ 17
 challengeType: 0
 dashedName: step-17
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62ff8e998d3e7eae14d6ae3b.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62ff8e998d3e7eae14d6ae3b.md
index d7c0b7e4535..de7f161d704 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62ff8e998d3e7eae14d6ae3b.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62ff8e998d3e7eae14d6ae3b.md
@@ -1,6 +1,6 @@
 ---
 id: 62ff8e998d3e7eae14d6ae3b
-title: Step 28
+title: ステップ 28
 challengeType: 0
 dashedName: step-28
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62ff919a7b5612c0670923a5.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62ff919a7b5612c0670923a5.md
index 816afe0fcb3..f4c86f5de19 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62ff919a7b5612c0670923a5.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/62ff919a7b5612c0670923a5.md
@@ -1,6 +1,6 @@
 ---
 id: 62ff919a7b5612c0670923a5
-title: Step 37
+title: ステップ 37
 challengeType: 0
 dashedName: step-37
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157e.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157e.md
index 9902742c288..75296b2ded4 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157e.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5157e.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5157e
-title: Step 8
+title: ステップ 8
 challengeType: 0
 dashedName: step-8
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51580.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51580.md
index fc2f26bd044..b4670b0ba30 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51580.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51580.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51580
-title: Step 10
+title: ステップ 10
 challengeType: 0
 dashedName: step-10
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51581.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51581.md
index e3c0a6d7133..44b5c130ae7 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51581.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51581.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51581
-title: Step 11
+title: ステップ 11
 challengeType: 0
 dashedName: step-11
 ---
@@ -45,7 +45,7 @@ assert(document.querySelectorAll('div')?.[1]?.classList?.contains('characters'))
   <body>
     <div id="back-wall"></div>
     --fcc-editable-region--
-      
+
     --fcc-editable-region--
   </body>
 </html>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51582.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51582.md
index cecb3afcc3f..05df784360b 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51582.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51582.md
@@ -46,7 +46,7 @@ assert(document.querySelector('.characters div')?.getAttribute('id') === 'offwhi
     <div id="back-wall"></div>
     <div class="characters">
       --fcc-editable-region--
-      
+
       --fcc-editable-region--
     </div>
   </body>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51583.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51583.md
index 26e10dbd954..cf18531d13e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51583.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51583.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51583
-title: Step 13
+title: ステップ 13
 challengeType: 0
 dashedName: step-13
 ---
@@ -59,7 +59,7 @@ assert(document.querySelectorAll('#offwhite-character div')[3]?.getAttribute('id
     <div class="characters">
       <div id="offwhite-character">
         --fcc-editable-region--
-        
+
         --fcc-editable-region--
       </div>
     </div>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51584.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51584.md
index 30d7ae1f208..aa02496ffd7 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51584.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51584.md
@@ -51,7 +51,7 @@ assert(document.querySelectorAll('#black-mask div')[1]?.classList.contains('righ
         <div id="white-hat"></div>
         <div id="black-mask">
           --fcc-editable-region--
-          
+
           --fcc-editable-region--
         </div>
         <div id="gray-instrument"></div>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51585.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51585.md
index fe7c93d2a82..6d5987f185e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51585.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51585.md
@@ -47,7 +47,7 @@ assert(document.querySelectorAll('#gray-instrument .black-dot').length === 5);
         </div>
         <div id="gray-instrument">
           --fcc-editable-region--
-          
+
           --fcc-editable-region--
         </div>
         <div id="tan-table"></div>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51586.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51586.md
index d5e2a92f017..db05a7a1e17 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51586.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51586.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51586
-title: Step 16
+title: ステップ 16
 challengeType: 0
 dashedName: step-16
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51588.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51588.md
index 92841c58470..00eeabc987b 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51588.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51588.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51588
-title: Step 18
+title: ステップ 18
 challengeType: 0
 dashedName: step-18
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158b.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158b.md
index 21f9a6572a9..735de30bfaf 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158b.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158b.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5158b
-title: Step 21
+title: ステップ 21
 challengeType: 0
 dashedName: step-21
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158d.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158d.md
index 8c2d427cdb6..f9f706f5195 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158d.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158d.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5158d
-title: Step 23
+title: ステップ 23
 challengeType: 0
 dashedName: step-23
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158f.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158f.md
index a472aa3b907..a24f087693c 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158f.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5158f.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5158f
-title: Step 25
+title: ステップ 25
 challengeType: 0
 dashedName: step-25
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51591.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51591.md
index b94df3eb3fd..640f3018225 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51591.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51591.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51591
-title: Step 27
+title: ステップ 27
 challengeType: 0
 dashedName: step-27
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51592.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51592.md
index 445f4954806..03d5cf39232 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51592.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51592.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51592
-title: Step 28
+title: ステップ 28
 challengeType: 0
 dashedName: step-28
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51595.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51595.md
index 7b766aa3f42..68e78183993 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51595.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51595.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51595
-title: Step 31
+title: ステップ 31
 challengeType: 0
 dashedName: step-31
 ---
@@ -142,5 +142,5 @@ body {
   --fcc-editable-region--
 
   --fcc-editable-region--
-  
+
 ```
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51598.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51598.md
index cc6008020de..d051b195b0d 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51598.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51598.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c51598
-title: Step 34
+title: ステップ 34
 challengeType: 0
 dashedName: step-34
 ---
@@ -55,7 +55,7 @@ assert(document.querySelectorAll('.characters > div')?.[1]?.getAttribute('id') =
         <div id="tan-table"></div>
       </div>
       --fcc-editable-region--
-      
+
       --fcc-editable-region--
     </div>
   </body>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51599.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51599.md
index 64752da89e2..ae9aa461f70 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51599.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c51599.md
@@ -68,7 +68,7 @@ assert(document.querySelectorAll('#black-character > div')?.[2]?.getAttribute('i
       </div>
       <div id="black-character">
         --fcc-editable-region--
-        
+
         --fcc-editable-region--
       </div>
     </div>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159a.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159a.md
index 80566becc9f..33ba2dad081 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159a.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159a.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5159a
-title: Step 36
+title: ステップ 36
 challengeType: 0
 dashedName: step-36
 ---
@@ -68,7 +68,7 @@ assert(second?.classList?.contains('right'));
         <div id="black-hat"></div>
         <div id="gray-mask">
           --fcc-editable-region--
-          
+
           --fcc-editable-region--
         </div>
         <div id="white-paper"></div>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159b.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159b.md
index c76ae468664..56cd3c7ab64 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159b.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159b.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5159b
-title: Step 37
+title: ステップ 37
 challengeType: 0
 dashedName: step-37
 ---
@@ -72,7 +72,7 @@ for (const icon of icons) {
         </div>
         <div id="white-paper">
           --fcc-editable-region--
-          
+
           --fcc-editable-region--
         </div>
       </div>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159d.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159d.md
index 99fa42a9986..eb2a329ad29 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159d.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159d.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5159d
-title: Step 39
+title: ステップ 39
 challengeType: 0
 dashedName: step-39
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159f.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159f.md
index baae6b354f5..f4fc3af2c57 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159f.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c5159f.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c5159f
-title: Step 42
+title: ステップ 42
 challengeType: 0
 dashedName: step-42
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a1.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a1.md
index b9b8ef0ae6c..0e19faa8f8a 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a1.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a1.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515a1
-title: Step 44
+title: ステップ 44
 challengeType: 0
 dashedName: step-44
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a2.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a2.md
index a026481fefc..938682458eb 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a2.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a2.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515a2
-title: Step 45
+title: ステップ 45
 challengeType: 0
 dashedName: step-45
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a5.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a5.md
index cd79b72769c..585c972747b 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a5.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a5.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515a5
-title: Step 48
+title: ステップ 48
 challengeType: 0
 dashedName: step-48
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a6.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a6.md
index b925595716c..d7aee2505c3 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a6.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a6.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515a6
-title: Step 49
+title: ステップ 49
 challengeType: 0
 dashedName: step-49
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a7.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a7.md
index 9de059269f0..402c07b5612 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a7.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a7.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515a7
-title: Step 50
+title: ステップ 50
 challengeType: 0
 dashedName: step-50
 ---
@@ -82,7 +82,7 @@ assert(document.querySelectorAll('.characters > div')?.[3]?.getAttribute('id') =
         </div>
       </div>
       --fcc-editable-region--
-      
+
       --fcc-editable-region--
     </div>
   </body>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a9.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a9.md
index 2628b7339b3..4a304fed038 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a9.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515a9.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515a9
-title: Step 52
+title: ステップ 52
 challengeType: 0
 dashedName: step-52
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515aa.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515aa.md
index ea6dc4a08b8..ca127258d01 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515aa.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515aa.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515aa
-title: Step 53
+title: ステップ 53
 challengeType: 0
 dashedName: step-53
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ab.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ab.md
index 35843a734ef..ee1717e4b08 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ab.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ab.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515ab
-title: Step 54
+title: ステップ 54
 challengeType: 0
 dashedName: step-54
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ac.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ac.md
index 2ead91a28fe..517236fe1cc 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ac.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ac.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515ac
-title: Step 55
+title: ステップ 55
 challengeType: 0
 dashedName: step-55
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ad.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ad.md
index ac80b322cde..3f503b12ffb 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ad.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ad.md
@@ -70,7 +70,7 @@ assert(document.querySelectorAll('.characters > div')?.[4]?.getAttribute('id') =
       <div class="blue" id="blue-left"></div>
       <div class="blue" id="blue-right"></div>
       --fcc-editable-region--
-      
+
       --fcc-editable-region--
     </div>
   </body>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ae.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ae.md
index bfd1d018cca..6c4d69b4187 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ae.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515ae.md
@@ -89,7 +89,7 @@ assert(document.querySelectorAll('#orange-character > div')?.[3]?.getAttribute('
       <div class="blue" id="blue-right"></div>
       <div id="orange-character">
         --fcc-editable-region--
-        
+
         --fcc-editable-region--
       </div>
     </div>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515af.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515af.md
index 48c6238c1c2..db74deed1e6 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515af.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515af.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515af
-title: Step 58
+title: ステップ 58
 challengeType: 0
 dashedName: step-58
 ---
@@ -81,7 +81,7 @@ assert(document.querySelectorAll('#eyes-div > div')?.[1]?.classList?.contains('r
         <div id="black-round-hat"></div>
         <div id="eyes-div">
           --fcc-editable-region--
-          
+
           --fcc-editable-region--
         </div>
         <div id="triangles"></div>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b0.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b0.md
index 366d18b2481..63bd2bd45c5 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b0.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b0.md
@@ -80,7 +80,7 @@ for (const div of divDivDiv) {
         </div>
         <div id="triangles">
           --fcc-editable-region--
-          
+
           --fcc-editable-region--
         </div>
         <div id="guitar"></div>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b1.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b1.md
index 38130fa44a2..6b239d93603 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b1.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b1.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515b1
-title: Step 60
+title: ステップ 60
 challengeType: 0
 dashedName: step-60
 ---
@@ -141,7 +141,7 @@ assert.notExists(document.querySelector('#guitar > #guitar-neck.guitar'));
         </div>
         <div id="guitar">
           --fcc-editable-region--
-          
+
           --fcc-editable-region--
         </div>
       </div>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b2.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b2.md
index 38be428b773..b59da81bd3e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b2.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b2.md
@@ -119,10 +119,10 @@ assert(document.querySelector('#guitar-right > i')?.classList?.contains('fa-bars
         <div id="guitar">
           --fcc-editable-region--
           <div class="guitar" id="guitar-left">
-          
+
           </div>
           <div class="guitar" id="guitar-right">
-          
+
           </div>
           --fcc-editable-region--
           <div id="guitar-neck"></div>
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b3.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b3.md
index 0b3025790e8..ed078ad0403 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b3.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b3.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515b3
-title: Step 62
+title: ステップ 62
 challengeType: 0
 dashedName: step-62
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b4.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b4.md
index 754861f47d0..c478165f533 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b4.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b4.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515b4
-title: Step 63
+title: ステップ 63
 challengeType: 0
 dashedName: step-63
 ---
@@ -279,7 +279,7 @@ body {
   height: 550px;
   background-color: rgb(240, 78, 42);
   --fcc-editable-region--
-  
+
   --fcc-editable-region--
 }
 ```
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b7.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b7.md
index 5f43f757585..3243c05a48c 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b7.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b7.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515b7
-title: Step 66
+title: ステップ 66
 challengeType: 0
 dashedName: step-66
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b8.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b8.md
index 630dfa5633b..294e030a033 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b8.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b8.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515b8
-title: Step 67
+title: ステップ 67
 challengeType: 0
 dashedName: step-67
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b9.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b9.md
index 20de7ca5e51..3c632714210 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b9.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515b9.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515b9
-title: Step 68
+title: ステップ 68
 challengeType: 0
 dashedName: step-68
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bc.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bc.md
index c9d3d036cd7..7c98877d6c9 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bc.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bc.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515bc
-title: Step 70
+title: ステップ 70
 challengeType: 0
 dashedName: step-70
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bd.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bd.md
index 15522104562..afda31ba66e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bd.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515bd.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515bd
-title: Step 79
+title: ステップ 79
 challengeType: 0
 dashedName: step-79
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515be.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515be.md
index 96cea01cca3..9fd2f4cd213 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515be.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515be.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515be
-title: Step 80
+title: ステップ 80
 challengeType: 0
 dashedName: step-80
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c0.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c0.md
index 61d8eb4eb0d..2dc76f9f2d8 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c0.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c0.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515c0
-title: Step 82
+title: ステップ 82
 challengeType: 0
 dashedName: step-82
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c3.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c3.md
index 315b4c5409f..0eea792c780 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c3.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c3.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515c3
-title: Step 85
+title: ステップ 85
 challengeType: 0
 dashedName: step-85
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c5.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c5.md
index ece6f1c39be..6b31a11daf3 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c5.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60b69a66b6ddb80858c515c5.md
@@ -1,6 +1,6 @@
 ---
 id: 60b69a66b6ddb80858c515c5
-title: Step 87
+title: ステップ 87
 challengeType: 0
 dashedName: step-87
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba8913f1704c0f7a8906b8.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba8913f1704c0f7a8906b8.md
index 4351170e03d..2fc33c20b46 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba8913f1704c0f7a8906b8.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba8913f1704c0f7a8906b8.md
@@ -1,6 +1,6 @@
 ---
 id: 60ba8913f1704c0f7a8906b8
-title: Step 73
+title: ステップ 73
 challengeType: 0
 dashedName: step-73
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba89146b25080f99ab54ad.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba89146b25080f99ab54ad.md
index ac4d90d5a9a..9b380785a39 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba89146b25080f99ab54ad.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba89146b25080f99ab54ad.md
@@ -1,6 +1,6 @@
 ---
 id: 60ba89146b25080f99ab54ad
-title: Step 72
+title: ステップ 72
 challengeType: 0
 dashedName: step-72
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba8914bab51f0fb8228e9c.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba8914bab51f0fb8228e9c.md
index 24839e38369..0f586f18269 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba8914bab51f0fb8228e9c.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba8914bab51f0fb8228e9c.md
@@ -1,6 +1,6 @@
 ---
 id: 60ba8914bab51f0fb8228e9c
-title: Step 71
+title: ステップ 71
 challengeType: 0
 dashedName: step-71
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba929345ab0714a3743655.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba929345ab0714a3743655.md
index a14fdbe188a..8c55d165e4d 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba929345ab0714a3743655.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-intermediate-css-by-building-a-picasso-painting/60ba929345ab0714a3743655.md
@@ -1,6 +1,6 @@
 ---
 id: 60ba929345ab0714a3743655
-title: Step 76
+title: ステップ 76
 challengeType: 0
 dashedName: step-76
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd5a93fd62bb35968adeab.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd5a93fd62bb35968adeab.md
index 38776c35314..c980a30f15a 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd5a93fd62bb35968adeab.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd5a93fd62bb35968adeab.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd5a93fd62bb35968adeab
-title: Step 1
+title: ステップ 1
 challengeType: 0
 dashedName: step-1
 ---
@@ -13,56 +13,56 @@ Give your `head` element the appropriate `meta` elements for the `charset` and `
 
 # --hints--
 
-Your code should have a `<!DOCTYPE html>` declaration.
+コードには `<!DOCTYPE html>` 宣言が必要です。
 
 ```js
 assert(code.match(/<!DOCTYPE html>/i));
 ```
 
-Your code should have an `html` element.
+コードには `html` 要素が 1 つ必要です。
 
 ```js
 assert.equal(document.querySelectorAll('html')?.length, 1);
 ```
 
-Your `html` element should have an opening tag with a `lang` attribute of `en`.
+`html` 要素は `lang` 属性が `en` の開始タグをもつ必要があります。
 
 ```js
 assert(code.match(/<html\s+lang\s*=\s*('|")en\1\s*>/gi));
 ```
 
-Your `html` element should have a closing tag.
+`html` 要素には終了タグが必要です。
 
 ```js
 assert(code.match(/<\/html\s*>/));
 ```
 
-Your code should have a `head` element within the `html` element.
+コードの `html` 要素内に `head` 要素が必要です。
 
 ```js
 assert.equal(document.querySelectorAll('head')?.length, 1);
 ```
 
-Your code should have a `body` element within the `html` element.
+コードの `html` 要素内に `body` 要素が必要です。
 
 ```js
 assert.equal(document.querySelectorAll('body')?.length, 1);
 ```
 
-Your `head` element should come before your `body` element.
+`head` 要素は `body` 要素の前に置く必要があります。
 
 ```js
 assert.equal(document.querySelector('body')?.previousElementSibling?.tagName, 'HEAD');
 ```
 
-You should have two `meta` elements.
+2 つの `meta` 要素が必要です。
 
 ```js
 const meta = document.querySelectorAll('meta');
 assert.equal(meta?.length, 2);
 ```
 
-One `meta` element should have a `name` set to `viewport`, and `content` set to `width=device-width, initial-scale=1.0`.
+`meta` 要素のひとつは `name` 属性を `viewport` に、`content` 属性を `width=device-width, initial-scale=1.0` に設定されている必要があります。
 
 ```js
 const meta = [...document.querySelectorAll('meta')];
@@ -70,7 +70,7 @@ const target = meta?.find(m => m?.getAttribute('name') === 'viewport' && m?.getA
 assert.exists(target);
 ```
 
-The other `meta` element should have the `charset` attribute set to `UTF-8`.
+もうひとつの `meta` 要素は `charset` 属性を `UTF-8` に設定されている必要があります。
 
 ```js
 const meta = [...document.querySelectorAll('meta')];
@@ -78,39 +78,39 @@ const target = meta?.find(m => !m?.getAttribute('name') && !m?.getAttribute('con
 assert.exists(target);
 ```
 
-Your code should have a `title` element.
+コードには `title` 要素が 1 つ必要です。
 
 ```js
 const title = document.querySelector('title');
 assert.exists(title);
 ```
 
-Your `title` should have some text.
+`title` にはテキストが必要です。
 
 ```js
 const title = document.querySelector('title');
 assert.isAtLeast(title?.textContent?.length, 1);
 ```
 
-Your code should have a `link` element.
+コードには `link` 要素が 1 つ必要です。
 
 ```js
 assert(/<link/.test(code))
 ```
 
-Your `link` element should be within your `head` element.
+`link` 要素は `head` 要素の中にある必要があります。
 
 ```js
 assert(code.match(/<head>[\w\W\s]*<link[\w\W\s]*\/?>[\w\W\s]*<\/head>/i))
 ```
 
-Your `link` element should have a `rel` attribute with the value `stylesheet`.
+`link` 要素には `rel` 属性があり、値が `stylesheet` に設定されている必要があります。
 
 ```js
 assert.match(code, /<link[\s\S]*?rel=('|"|`)stylesheet\1/)
 ```
 
-Your `link` element should have an `href` attribute with the value `styles.css`.
+`link` 要素には `href` 属性があり、値が `styles.css` に設定されている必要があります。
 
 ```js
 assert.match(code, /<link[\s\S]*?href=('|"|`)(\.\/)?styles\.css\1/)
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd6343fb42013d99bcd7f3.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd6343fb42013d99bcd7f3.md
index 6b933db49dd..0921ef960a7 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd6343fb42013d99bcd7f3.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd6343fb42013d99bcd7f3.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd6343fb42013d99bcd7f3
-title: Step 2
+title: ステップ 2
 challengeType: 0
 dashedName: step-2
 ---
@@ -11,7 +11,7 @@ Within your `body` element, nest a `section` element within a `main` element.
 
 # --hints--
 
-The first element inside the `body` element should be your `main` element. 
+The first element inside the `body` element should be your `main` element.
 
 ```js
 assert(document.querySelector('body')?.children?.[0]?.localName === 'main');
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd66c687e610436494c6f1.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd66c687e610436494c6f1.md
index 345621fb1db..7fc3fa9cbaa 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd66c687e610436494c6f1.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd66c687e610436494c6f1.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd66c687e610436494c6f1
-title: Step 3
+title: ステップ 3
 challengeType: 0
 dashedName: step-3
 ---
@@ -11,13 +11,13 @@ Within your `section` element, add an `h1` element with a nested `span` element.
 
 # --hints--
 
-Your `section` element should have an `h1` element.
+`section` 要素には `h1` 要素が 1 つ必要です。
 
 ```js
 assert(document.querySelector('section')?.children?.[0]?.localName === 'h1');
 ```
 
-Your `h1` element should have a `span` element.
+`h1` 要素内に `span` 要素が 1 つ必要です。
 
 ```js
 assert(document.querySelector('h1')?.children?.[0]?.localName === 'span');
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd67a656743144844941cb.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd67a656743144844941cb.md
index 0be766dccc7..6b5d3d8326d 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd67a656743144844941cb.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd67a656743144844941cb.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd67a656743144844941cb
-title: Step 4
+title: ステップ 4
 challengeType: 0
 dashedName: step-4
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd6ab779390f49148773bb.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd6ab779390f49148773bb.md
index 2d5052298f7..d4efa76eb6a 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd6ab779390f49148773bb.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd6ab779390f49148773bb.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd6ab779390f49148773bb
-title: Step 5
+title: ステップ 5
 challengeType: 0
 dashedName: step-5
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd6b7c83dbf54a08cf0498.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd6b7c83dbf54a08cf0498.md
index f01ff5c2b64..ccdbd643b4b 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd6b7c83dbf54a08cf0498.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd6b7c83dbf54a08cf0498.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd6b7c83dbf54a08cf0498
-title: Step 6
+title: ステップ 6
 challengeType: 0
 dashedName: step-6
 ---
@@ -11,32 +11,32 @@ Within your `div` element, add three `span` elements. Give each of them a `class
 
 # --hints--
 
-Your `div` element should have three `span` elements.
+`div` 要素内に `span` 要素が 3 つ必要です。
 
 ```js
 assert(document.querySelector('div')?.children?.length === 3);
 ```
 
-Each `span` element should have a `class` attribute set to `year`.
+各 `span` 要素の `class` 属性を `year` に設定する必要があります。
 
 ```js
 const spans = [...document.querySelector('div')?.children];
 spans.forEach(span => assert(span?.classList?.contains('year')));
 ```
 
-Your first `span` should have the text `2019`.
+1 つ目の `span` には `2019` というテキストが必要です。
 
 ```js
 assert(document.querySelector('div')?.children?.[0]?.textContent === '2019');
 ```
 
-Your second `span` should have the text `2020`.
+2 つ目の `span` には `2020` というテキストが必要です。
 
 ```js
 assert(document.querySelector('div')?.children?.[1]?.textContent === '2020');
 ```
 
-Your third `span` should have the text `2021`.
+3 つ目の `span` には `2021` というテキストが必要です。
 
 ```js
 assert(document.querySelector('div')?.children?.[2]?.textContent === '2021');
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd6cc9475a784b7776233e.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd6cc9475a784b7776233e.md
index b8ccec8b812..3ec08662edb 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd6cc9475a784b7776233e.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd6cc9475a784b7776233e.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd6cc9475a784b7776233e
-title: Step 7
+title: ステップ 7
 challengeType: 0
 dashedName: step-7
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd70336ebb3e4f62ee81ba.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd70336ebb3e4f62ee81ba.md
index 630d13d656d..cfdd6718dd3 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd70336ebb3e4f62ee81ba.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd70336ebb3e4f62ee81ba.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd70336ebb3e4f62ee81ba
-title: Step 8
+title: ステップ 8
 challengeType: 0
 dashedName: step-8
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd719788899952e67692b9.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd719788899952e67692b9.md
index 2e0c363fd16..1cf984ebc0f 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd719788899952e67692b9.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd719788899952e67692b9.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd719788899952e67692b9
-title: Step 9
+title: ステップ 9
 challengeType: 0
 dashedName: step-9
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd71d596e8f253b9408b39.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd71d596e8f253b9408b39.md
index 083e60b9e97..cd61d97a898 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd71d596e8f253b9408b39.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd71d596e8f253b9408b39.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd71d596e8f253b9408b39
-title: Step 10
+title: ステップ 10
 challengeType: 0
 dashedName: step-10
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd75ea7f663457612dba02.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd75ea7f663457612dba02.md
index 2bb77338777..eeff5dae177 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd75ea7f663457612dba02.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd75ea7f663457612dba02.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd75ea7f663457612dba02
-title: Step 11
+title: ステップ 11
 challengeType: 0
 dashedName: step-11
 ---
@@ -15,7 +15,7 @@ Leave the `td` element empty. This element exists only to ensure your table has
 
 # --hints--
 
-Each of your `th` elements should have a `span` element.
+各 `th` 要素内に `span` 要素が 1 つ必要です。
 
 ```js
 const ths = [...document.querySelectorAll('th')];
@@ -25,7 +25,7 @@ ths?.forEach(th => {
 });
 ```
 
-Each of your new `span` elements should have the `class` attribute set to `sr-only year`.
+新しく追加した各 `span` 要素の `class` 属性は `sr-only year` に設定する必要があります。
 
 ```js
 const ths = [...document.querySelectorAll('th')];
@@ -35,19 +35,19 @@ ths?.forEach(th => {
 });
 ```
 
-Your first `span` element should have the text `2019`.
+1 つ目の `span` 要素は `2019` というテキストを持つ必要があります。
 
 ```js
 assert(document.querySelectorAll('th')?.[0]?.children?.[0]?.textContent === '2019');
 ```
 
-Your second `span` element should have the text `2020`.
+2 つ目の `span` 要素は `2020` というテキストを持つ必要があります。
 
 ```js
 assert(document.querySelectorAll('th')?.[1]?.children?.[0]?.textContent === '2020');
 ```
 
-Your third `span` element should have the text `2021`.
+3 つ目の `span` 要素は `2021` というテキストを持つ必要があります。
 
 ```js
 assert(document.querySelectorAll('th')?.[2]?.children?.[0]?.textContent === '2021');
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd7648a7ba2e5882436831.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd7648a7ba2e5882436831.md
index e45bc92ba64..183ffc49118 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd7648a7ba2e5882436831.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd7648a7ba2e5882436831.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd7648a7ba2e5882436831
-title: Step 12
+title: ステップ 12
 challengeType: 0
 dashedName: step-12
 ---
@@ -11,7 +11,7 @@ Within your `tbody` element, add four `tr` elements. Give the first three a `cla
 
 # --hints--
 
-Your `tbody` element should have four `tr` elements.
+`tbody` 要素内には `tr` 要素が 4 つ必要です。
 
 ```js
 const children = [...document.querySelector('tbody')?.children];
@@ -19,7 +19,7 @@ assert(children?.length === 4);
 children.forEach(child => assert(child?.localName === 'tr'));
 ```
 
-Your first three `tr` elements should have the `class` attribute set to `data`.
+最初の 3 つの `tr` 要素の `class` 属性を `data` に設定する必要があります。
 
 ```js
 const children = [...document.querySelector('tbody')?.children];
@@ -30,7 +30,7 @@ children.forEach((child, index) => {
 });
 ```
 
-Your fourth `tr` element should have the `class` attribute set to `total`.
+4 つ目の `tr` 要素の `class` 属性を `total` に設定する必要があります。
 
 ```js
 const children = [...document.querySelector('tbody')?.children];
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd778081276b59d59abad6.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd778081276b59d59abad6.md
index c2f94c4d531..96ca339e555 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd778081276b59d59abad6.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd778081276b59d59abad6.md
@@ -1,13 +1,13 @@
 ---
 id: 61fd778081276b59d59abad6
-title: Step 13
+title: ステップ 13
 challengeType: 0
 dashedName: step-13
 ---
 
 # --description--
 
-In your first `tr`, add a `th` element with the text `Cash This is the cash we currently have on hand.`. Wrap all of that text except `Cash ` in a `span` element with the `class` set to `description`.
+In your first `tr`, add a `th` element with the text `Cash This is the cash we currently have on hand.`. Wrap all of that text except `Cash` in a `span` element with the `class` set to `description`.
 
 Following that, add three `td` elements with the following text (in order): `$25`, `$30`, `$28`. Give the third `td` element a `class` attribute set to `current`.
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd77f7ad2aeb5ae34d07d6.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd77f7ad2aeb5ae34d07d6.md
index 6c5d1804d52..d67dccf677d 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd77f7ad2aeb5ae34d07d6.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd77f7ad2aeb5ae34d07d6.md
@@ -1,13 +1,13 @@
 ---
 id: 61fd77f7ad2aeb5ae34d07d6
-title: Step 14
+title: ステップ 14
 challengeType: 0
 dashedName: step-14
 ---
 
 # --description--
 
-In your second `tr` element, add a `th` element with the text `Checking Our primary transactional account.`. Wrap that text, except for `Checking `, in a `span` element with the `class` attribute set to `description`.
+In your second `tr` element, add a `th` element with the text `Checking Our primary transactional account.`. Wrap that text, except for `Checking`, in a `span` element with the `class` attribute set to `description`.
 
 Following that, add three `td` elements with the following text (in order): `$54`, `$56`, `$53`. Give the third `td` element a `class` attribute set to `current`.
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd78621573aa5e8b512f5e.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd78621573aa5e8b512f5e.md
index f36d0c0c001..9be4e216dbc 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd78621573aa5e8b512f5e.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd78621573aa5e8b512f5e.md
@@ -1,67 +1,67 @@
 ---
 id: 61fd78621573aa5e8b512f5e
-title: Step 15
+title: ステップ 15
 challengeType: 0
 dashedName: step-15
 ---
 
 # --description--
 
-In your third `tr` element, add a `th` element with the text `Savings Funds set aside for emergencies.`. Wrap that text, except for `Savings `, in a `span` element with the `class` attribute set to `description`.
+In your third `tr` element, add a `th` element with the text `Savings Funds set aside for emergencies.`. Wrap that text, except for `Savings`, in a `span` element with the `class` attribute set to `description`.
 
 Following that, add three `td` elements with the following text (in order): `$500`, `$650`, `$728`. Give the third `td` element a `class` attribute set to `current`.
 
 # --hints--
 
-Your third `tr` should have a `th` element.
+3 つ目の `tr` 要素内に `th` 要素が 1 つ必要です。
 
 ```js
 assert(document.querySelector('tbody')?.querySelectorAll('tr')?.[2]?.querySelector('th'));
 ```
 
-Your `th` element should have the text `Savings Funds set aside for emergencies.`.
+`th` 要素のテキストは `Savings Funds set aside for emergencies.` にする必要があります。
 
 ```js
 assert(document.querySelector('tbody')?.querySelectorAll('tr')?.[2]?.querySelector('th')?.innerText === 'Savings Funds set aside for emergencies.');
 ```
 
-You should wrap the text `Funds set aside for emergencies.` in a `span` element.
+`Funds set aside for emergencies.` というテキストを `span` 要素で囲む必要があります。
 
 ```js
 assert(document.querySelector('tbody')?.querySelectorAll('tr')?.[2]?.querySelector('th > span')?.textContent === 'Funds set aside for emergencies.');
 ```
 
-Your `span` element should have the `class` attribute set to `description`.
+`span` 要素の `class` 属性を `description` に設定する必要があります。
 
 ```js
 assert(document.querySelector('tbody')?.querySelectorAll('tr')?.[2]?.querySelector('th > span')?.classList?.contains('description'));
 ```
 
-You should have three `td` elements.
+`td` 要素が 3 つ必要です。
 
 ```js
 assert(document.querySelector('tbody')?.querySelectorAll('tr')?.[2]?.querySelectorAll('td').length === 3);
 ```
 
-Your first `td` element should have the text `$500`.
+1 つ目の `td` 要素には `$500` というテキストが必要です。
 
 ```js
 assert(document.querySelector('tbody')?.querySelectorAll('tr')?.[2]?.querySelectorAll('td')?.[0]?.textContent === '$500');
 ```
 
-Your second `td` element should have the text `$650`.
+2 つ目の `td` 要素には `$650` というテキストが必要です。
 
 ```js
 assert(document.querySelector('tbody')?.querySelectorAll('tr')?.[2]?.querySelectorAll('td')?.[1]?.textContent === '$650');
 ```
 
-Your third `td` element should have the text `$728`.
+3 つ目の `td` 要素には `$728` というテキストが必要です。
 
 ```js
 assert(document.querySelector('tbody')?.querySelectorAll('tr')?.[2]?.querySelectorAll('td')?.[2]?.textContent === '$728');
 ```
 
-Your third `td` element should have the `class` set to `current`.
+3 つ目の `td` 要素の `class` を `current` に設定する必要があります。
 
 ```js
 assert(document.querySelector('tbody')?.querySelectorAll('tr')?.[2]?.querySelectorAll('td')?.[2]?.classList?.contains('current'));
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd7a160ed17960e971f28b.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd7a160ed17960e971f28b.md
index 85c417f4780..5fced8300d9 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd7a160ed17960e971f28b.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd7a160ed17960e971f28b.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd7a160ed17960e971f28b
-title: Step 16
+title: ステップ 16
 challengeType: 0
 dashedName: step-16
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd7b3fcaa5406257abc5d1.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd7b3fcaa5406257abc5d1.md
index 184f5dee82a..d39438b34dd 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd7b3fcaa5406257abc5d1.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd7b3fcaa5406257abc5d1.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd7b3fcaa5406257abc5d1
-title: Step 17
+title: ステップ 17
 challengeType: 0
 dashedName: step-17
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd8e491324ce717da97ffe.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd8e491324ce717da97ffe.md
index 40f7da84cdb..db449f90465 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd8e491324ce717da97ffe.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd8e491324ce717da97ffe.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd8e491324ce717da97ffe
-title: Step 18
+title: ステップ 18
 challengeType: 0
 dashedName: step-18
 ---
@@ -11,19 +11,19 @@ Within your `thead`, add a `tr`. Inside that, add a `td` and three `th` elements
 
 # --hints--
 
-Your `thead` element should have a `tr` element.
+`thead` 要素内には `tr` 要素が 1 つ必要です。
 
 ```js
 assert(document.querySelectorAll('table')?.[1]?.querySelector('thead')?.children?.[0]?.localName === 'tr');
 ```
 
-Your `tr` element should have a `td` element as the first child.
+`tr` 要素の最初の子要素は `td` 要素である必要があります。
 
 ```js
 assert(document.querySelectorAll('table')?.[1]?.querySelector('tr')?.children?.[0]?.localName === 'td');
 ```
 
-Your `tr` element should have three `th` elements, after the `td` element.
+`tr` 要素内には `td` 要素の後に 3 つの `th` 要素が必要です。
 
 ```js
 assert(document.querySelectorAll('table')?.[1]?.querySelector('tr')?.children?.[1]?.localName === 'th');
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd8fd08af43372f02952d0.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd8fd08af43372f02952d0.md
index 55c85fb1338..f04b34b766a 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd8fd08af43372f02952d0.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd8fd08af43372f02952d0.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd8fd08af43372f02952d0
-title: Step 19
+title: ステップ 19
 challengeType: 0
 dashedName: step-19
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd9126aa72a474301fc49f.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd9126aa72a474301fc49f.md
index abec451e896..859f19f6300 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd9126aa72a474301fc49f.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd9126aa72a474301fc49f.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd9126aa72a474301fc49f
-title: Step 20
+title: ステップ 20
 challengeType: 0
 dashedName: step-20
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd933ba685de776a94997e.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd933ba685de776a94997e.md
index 59d25200fff..f5755c1d735 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd933ba685de776a94997e.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd933ba685de776a94997e.md
@@ -1,67 +1,67 @@
 ---
 id: 61fd933ba685de776a94997e
-title: Step 21
+title: ステップ 21
 challengeType: 0
 dashedName: step-21
 ---
 
 # --description--
 
-Within the first `tr`, add a `th` element with the text `Loans The outstanding balance on our startup loan.`. Wrap that text, except for `Loans `, within a `span` element with the `class` set to `description`.
+Within the first `tr`, add a `th` element with the text `Loans The outstanding balance on our startup loan.`. Wrap that text, except for `Loans`, within a `span` element with the `class` set to `description`.
 
 Add three `td` elements below that, and give them the following text, in order: `$500`, `$250`, and `$0`. Give the third `td` element a `class` set to `current`.
 
 # --hints--
 
-Your first `tr` should have a `th` element.
+1 つ目の `tr` 内に `th` 要素が 1 つ必要です。
 
 ```js
 assert(document.querySelectorAll('table')?.[1]?.querySelector('tbody')?.querySelectorAll('tr')?.[0]?.querySelector('th'));
 ```
 
-Your `th` element should have the text `Loans The outstanding balance on our startup loan.`.
+`th` 要素のテキストは `Loans The outstanding balance on our startup loan.` にする必要があります。
 
 ```js
 assert(document.querySelectorAll('table')?.[1]?.querySelector('tbody')?.querySelectorAll('tr')?.[0]?.querySelector('th')?.innerText === 'Loans The outstanding balance on our startup loan.');
 ```
 
-You should wrap the text `The outstanding balance on our startup loan.` in a `span` element.
+`The outstanding balance on our startup loan.` というテキストを `span` 要素で囲む必要があります。
 
 ```js
 assert(document.querySelectorAll('table')?.[1]?.querySelector('tbody')?.querySelectorAll('tr')?.[0]?.querySelector('th > span')?.textContent === 'The outstanding balance on our startup loan.');
 ```
 
-Your `span` element should have the `class` attribute set to `description`.
+`span` 要素の `class` 属性を `description` に設定する必要があります。
 
 ```js
 assert(document.querySelectorAll('table')?.[1]?.querySelector('tbody')?.querySelectorAll('tr')?.[0]?.querySelector('th > span')?.classList?.contains('description'));
 ```
 
-You should have three `td` elements.
+`td` 要素が 3 つ必要です。
 
 ```js
 assert(document.querySelectorAll('table')?.[1]?.querySelector('tbody')?.querySelectorAll('tr')?.[0]?.querySelectorAll('td').length === 3);
 ```
 
-Your first `td` element should have the text `$500`.
+1 つ目の `td` 要素には `$500` というテキストが必要です。
 
 ```js
 assert(document.querySelectorAll('table')?.[1]?.querySelector('tbody')?.querySelectorAll('tr')?.[0]?.querySelectorAll('td')?.[0]?.textContent === '$500');
 ```
 
-Your second `td` element should have the text `$250`.
+2 つ目の `td` 要素には `$250` というテキストが必要です。
 
 ```js
 assert(document.querySelectorAll('table')?.[1]?.querySelector('tbody')?.querySelectorAll('tr')?.[0]?.querySelectorAll('td')?.[1]?.textContent === '$250');
 ```
 
-Your third `td` element should have the text `$0`.
+3 つ目の `td` 要素には `$0` というテキストが必要です。
 
 ```js
 assert(document.querySelectorAll('table')?.[1]?.querySelector('tbody')?.querySelectorAll('tr')?.[0]?.querySelectorAll('td')?.[2]?.textContent === '$0');
 ```
 
-Your third `td` element should have the `class` set to `current`.
+3 つ目の `td` 要素の `class` を `current` に設定する必要があります。
 
 ```js
 assert(document.querySelectorAll('table')?.[1]?.querySelector('tbody')?.querySelectorAll('tr')?.[0]?.querySelectorAll('td')?.[2]?.classList?.contains('current'));
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd94056e0355785fbba4d3.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd94056e0355785fbba4d3.md
index 735106d54f9..2f625903bbb 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd94056e0355785fbba4d3.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd94056e0355785fbba4d3.md
@@ -1,13 +1,13 @@
 ---
 id: 61fd94056e0355785fbba4d3
-title: Step 22
+title: ステップ 22
 challengeType: 0
 dashedName: step-22
 ---
 
 # --description--
 
-Within the second `tr`, add a `th` element with the text `Expenses Annual anticipated expenses, such as payroll.`. Wrap that text, except for `Expenses `, within a `span` element with the `class` set to `description`.
+Within the second `tr`, add a `th` element with the text `Expenses Annual anticipated expenses, such as payroll.`. Wrap that text, except for `Expenses`, within a `span` element with the `class` set to `description`.
 
 Add three `td` elements below that, and give them the following text, in order: `$200`, `$300`, and `$400`. Give the third `td` element a `class` set to `current`.
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd986ddbcbd47ba8fbc5ec.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd986ddbcbd47ba8fbc5ec.md
index 4598e8a76f9..4b977bc4cb2 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd986ddbcbd47ba8fbc5ec.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd986ddbcbd47ba8fbc5ec.md
@@ -1,13 +1,13 @@
 ---
 id: 61fd986ddbcbd47ba8fbc5ec
-title: Step 23
+title: ステップ 23
 challengeType: 0
 dashedName: step-23
 ---
 
 # --description--
 
-Within the third `tr`, add a `th` element with the text `Credit The outstanding balance on our credit card.`. Wrap that text, except for `Credit `, within a `span` element with the `class` set to `description`.
+Within the third `tr`, add a `th` element with the text `Credit The outstanding balance on our credit card.`. Wrap that text, except for `Credit`, within a `span` element with the `class` set to `description`.
 
 Add three `td` elements below that, and give them the following text, in order: `$50`, `$50`, and `$75`. Give the third `td` element a `class` set to `current`.
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd990577d8227dd93fbeeb.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd990577d8227dd93fbeeb.md
index 630afca73e9..43f6851149a 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd990577d8227dd93fbeeb.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd990577d8227dd93fbeeb.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd990577d8227dd93fbeeb
-title: Step 24
+title: ステップ 24
 challengeType: 0
 dashedName: step-24
 ---
@@ -13,25 +13,25 @@ Following that, add three `td` elements with the following text (in order): `$75
 
 # --hints--
 
-Your fourth `tr` should have a `th` element.
+4 つ目の `tr` 要素内に `th` 要素が 1 つ必要です。
 
 ```js
 assert(document.querySelectorAll('table')?.[1]?.querySelector('tbody')?.querySelectorAll('tr')?.[3]?.querySelector('th'));
 ```
 
-Your `th` element should have the text `Total Liabilities`.
+`th` 要素のテキストは `Total Liabilities` にする必要があります。
 
 ```js
 assert(document.querySelectorAll('table')?.[1]?.querySelector('tbody')?.querySelectorAll('tr')?.[3]?.querySelector('th')?.innerText === 'Total Liabilities');
 ```
 
-You should wrap the text `Liabilities` in a `span` element.
+`Liabilities` というテキストを `span` 要素で囲む必要があります。
 
 ```js
 assert(document.querySelectorAll('table')?.[1]?.querySelector('tbody')?.querySelectorAll('tr')?.[3]?.querySelector('th > span')?.textContent === 'Liabilities');
 ```
 
-Your `span` element should have the `class` attribute set to `sr-only`.
+`span` 要素の `class` 属性を `sr-only` に設定する必要があります。
 
 ```js
 assert(document.querySelectorAll('table')?.[1]?.querySelector('tbody')?.querySelectorAll('tr')?.[3]?.querySelector('th > span')?.classList?.contains('sr-only'));
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd9a4ff2fc4481b9157bd7.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd9a4ff2fc4481b9157bd7.md
index e2d2e4f80ea..f48f6d17f78 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd9a4ff2fc4481b9157bd7.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd9a4ff2fc4481b9157bd7.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd9a4ff2fc4481b9157bd7
-title: Step 25
+title: ステップ 25
 challengeType: 0
 dashedName: step-25
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd9ad665a4a282c8106be3.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd9ad665a4a282c8106be3.md
index a6d495c9075..ccb2bdee686 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd9ad665a4a282c8106be3.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd9ad665a4a282c8106be3.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd9ad665a4a282c8106be3
-title: Step 26
+title: ステップ 26
 challengeType: 0
 dashedName: step-26
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd9b7285bde783ad5b8aac.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd9b7285bde783ad5b8aac.md
index d0c54524887..b9980ba3766 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd9b7285bde783ad5b8aac.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd9b7285bde783ad5b8aac.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd9b7285bde783ad5b8aac
-title: Step 27
+title: ステップ 27
 challengeType: 0
 dashedName: step-27
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd9d9fbdfe078800317055.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd9d9fbdfe078800317055.md
index a48fc24190f..7ecc45d217f 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd9d9fbdfe078800317055.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fd9d9fbdfe078800317055.md
@@ -1,6 +1,6 @@
 ---
 id: 61fd9d9fbdfe078800317055
-title: Step 28
+title: ステップ 28
 challengeType: 0
 dashedName: step-28
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fda307bde0b091cf7d884a.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fda307bde0b091cf7d884a.md
index 2830b424adc..0cfebdb1fce 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fda307bde0b091cf7d884a.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fda307bde0b091cf7d884a.md
@@ -1,6 +1,6 @@
 ---
 id: 61fda307bde0b091cf7d884a
-title: Step 29
+title: ステップ 29
 challengeType: 0
 dashedName: step-29
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fda339eadcfd92a6812bed.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fda339eadcfd92a6812bed.md
index fb2d7e6f93b..0d4cef53305 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fda339eadcfd92a6812bed.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fda339eadcfd92a6812bed.md
@@ -1,6 +1,6 @@
 ---
 id: 61fda339eadcfd92a6812bed
-title: Step 30
+title: ステップ 30
 challengeType: 0
 dashedName: step-30
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdac1e31692f9a9ad97295.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdac1e31692f9a9ad97295.md
index 0dc22fdcd90..c4e380f5519 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdac1e31692f9a9ad97295.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdac1e31692f9a9ad97295.md
@@ -1,6 +1,6 @@
 ---
 id: 61fdac1e31692f9a9ad97295
-title: Step 31
+title: ステップ 31
 challengeType: 0
 dashedName: step-31
 ---
@@ -19,7 +19,7 @@ Your `span[class~="sr-only"]` selector should have a `clip` property set to `rec
 assert(new __helpers.CSSHelp(document).getStyle('span[class~="sr-only"]')?.getPropertyValue('clip') === 'rect(1px, 1px, 1px, 1px)');
 ```
 
-Your `span[class~="sr-only"] ` selector should have a `clip-path` property set to `inset(50%)`.
+Your `span[class~="sr-only"]` selector should have a `clip-path` property set to `inset(50%)`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('span[class~="sr-only"]')?.getPropertyValue('clip-path') === 'inset(50%)');
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdaea3999cb19d76ce717b.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdaea3999cb19d76ce717b.md
index e3c44addeb3..844b459e59c 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdaea3999cb19d76ce717b.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdaea3999cb19d76ce717b.md
@@ -1,6 +1,6 @@
 ---
 id: 61fdaea3999cb19d76ce717b
-title: Step 32
+title: ステップ 32
 challengeType: 0
 dashedName: step-32
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdaf9ff894b6a084ecdc1b.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdaf9ff894b6a084ecdc1b.md
index 499689068ce..dc4095c2b02 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdaf9ff894b6a084ecdc1b.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdaf9ff894b6a084ecdc1b.md
@@ -1,6 +1,6 @@
 ---
 id: 61fdaf9ff894b6a084ecdc1b
-title: Step 33
+title: ステップ 33
 challengeType: 0
 dashedName: step-33
 ---
@@ -160,7 +160,7 @@ span[class~="sr-only"] {
   -webkit-clip-path: inset(50%);
   height: 1px;
   width: 1px;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdafe6f07fd7a1c6785bc2.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdafe6f07fd7a1c6785bc2.md
index 3a4d5ca00d3..8f530971aed 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdafe6f07fd7a1c6785bc2.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdafe6f07fd7a1c6785bc2.md
@@ -1,6 +1,6 @@
 ---
 id: 61fdafe6f07fd7a1c6785bc2
-title: Step 34
+title: ステップ 34
 challengeType: 0
 dashedName: step-34
 ---
@@ -168,7 +168,7 @@ span[class~="sr-only"] {
   width: 1px;
   overflow: hidden;
   white-space: nowrap;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdb04d9939f0a26ca51c2b.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdb04d9939f0a26ca51c2b.md
index 1355c1ce68a..13e44cee72e 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdb04d9939f0a26ca51c2b.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/61fdb04d9939f0a26ca51c2b.md
@@ -1,6 +1,6 @@
 ---
 id: 61fdb04d9939f0a26ca51c2b
-title: Step 35
+title: ステップ 35
 challengeType: 0
 dashedName: step-35
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620159cd5431aa34bc6a4c9c.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620159cd5431aa34bc6a4c9c.md
index b076cdd1f61..97f88909a61 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620159cd5431aa34bc6a4c9c.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620159cd5431aa34bc6a4c9c.md
@@ -1,6 +1,6 @@
 ---
 id: 620159cd5431aa34bc6a4c9c
-title: Step 36
+title: ステップ 36
 challengeType: 0
 dashedName: step-36
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62015a5da1c95c358f079ebb.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62015a5da1c95c358f079ebb.md
index 32b34fd72f6..a279a7cac28 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62015a5da1c95c358f079ebb.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62015a5da1c95c358f079ebb.md
@@ -1,6 +1,6 @@
 ---
 id: 62015a5da1c95c358f079ebb
-title: Step 37
+title: ステップ 37
 challengeType: 0
 dashedName: step-37
 ---
@@ -19,7 +19,7 @@ You should have an `h1 .flex span:first-of-type` selector.
 assert(new __helpers.CSSHelp(document).getStyle('h1 .flex span:first-of-type'));
 ```
 
-Your `h1 .flex span:first-of-type` selector should have a `font-size` property set to `0.7em`.
+`h1 .flex span:first-of-type` セレクターの `font-size` プロパティを `0.7em` に設定する必要があります。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('h1 .flex span:first-of-type')?.getPropertyValue('font-size') === '0.7em');
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62015cd2654a1139321a89d2.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62015cd2654a1139321a89d2.md
index 49a66d72e60..f8ebce1a753 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62015cd2654a1139321a89d2.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62015cd2654a1139321a89d2.md
@@ -1,6 +1,6 @@
 ---
 id: 62015cd2654a1139321a89d2
-title: Step 38
+title: ステップ 38
 challengeType: 0
 dashedName: step-38
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62015d8942384c3aed48329e.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62015d8942384c3aed48329e.md
index b9a923d8910..b58bbefae56 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62015d8942384c3aed48329e.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62015d8942384c3aed48329e.md
@@ -1,6 +1,6 @@
 ---
 id: 62015d8942384c3aed48329e
-title: Step 39
+title: ステップ 39
 challengeType: 0
 dashedName: step-39
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620167374bb8b4455cd11125.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620167374bb8b4455cd11125.md
index 17cb284ae9f..0977f73e073 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620167374bb8b4455cd11125.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620167374bb8b4455cd11125.md
@@ -1,6 +1,6 @@
 ---
 id: 620167374bb8b4455cd11125
-title: Step 40
+title: ステップ 40
 challengeType: 0
 dashedName: step-40
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620174ed519dd7506c1a4b61.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620174ed519dd7506c1a4b61.md
index 80c7a788145..3d2b5d2892b 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620174ed519dd7506c1a4b61.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620174ed519dd7506c1a4b61.md
@@ -1,6 +1,6 @@
 ---
 id: 620174ed519dd7506c1a4b61
-title: Step 41
+title: ステップ 41
 challengeType: 0
 dashedName: step-41
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620175b3710a0951cfa86edf.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620175b3710a0951cfa86edf.md
index 092574d3811..e4ad10c3e88 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620175b3710a0951cfa86edf.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620175b3710a0951cfa86edf.md
@@ -1,6 +1,6 @@
 ---
 id: 620175b3710a0951cfa86edf
-title: Step 42
+title: ステップ 42
 challengeType: 0
 dashedName: step-42
 ---
@@ -20,19 +20,19 @@ Ensure your years do not get hidden by setting a `z-index` of `999`. Then, give
 
 # --hints--
 
-Your `#years` selector should have a `z-index` property set to `999`.
+`#years` セレクターの `z-index` プロパティを `999` に設定する必要があります。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('#years')?.getPropertyValue('z-index') === '999');
 ```
 
-Your `#years` selector should have a `margin` property set to `0 -2px`.
+`#years` セレクターの `margin` プロパティを `0 -2px` に設定する必要があります。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('#years')?.getPropertyValue('margin') === '0px -2px');
 ```
 
-Your `#years` selector should have a `padding` property set to `0.5rem calc(1.25rem + 2px) 0.5rem 0`.
+`#years` セレクターの `padding` プロパティを `0.5rem calc(1.25rem + 2px) 0.5rem 0` に設定する必要があります。
 
 ```js
 const padding = new __helpers.CSSHelp(document).getStyle('#years')?.getPropertyValue('padding');
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201782cc420715562f36271.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201782cc420715562f36271.md
index 7cdb25f9f96..9e7788df350 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201782cc420715562f36271.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201782cc420715562f36271.md
@@ -1,6 +1,6 @@
 ---
 id: 6201782cc420715562f36271
-title: Step 43
+title: ステップ 43
 challengeType: 0
 dashedName: step-43
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620179bc0a6a2358c72b90ad.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620179bc0a6a2358c72b90ad.md
index b6eeeb2c832..2171184dc66 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620179bc0a6a2358c72b90ad.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620179bc0a6a2358c72b90ad.md
@@ -1,6 +1,6 @@
 ---
 id: 620179bc0a6a2358c72b90ad
-title: Step 44
+title: ステップ 44
 challengeType: 0
 dashedName: step-44
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017b6f47454059bf2d3bd1.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017b6f47454059bf2d3bd1.md
index 8fc45a1d985..5fb26c9042a 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017b6f47454059bf2d3bd1.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017b6f47454059bf2d3bd1.md
@@ -1,6 +1,6 @@
 ---
 id: 62017b6f47454059bf2d3bd1
-title: Step 45
+title: ステップ 45
 challengeType: 0
 dashedName: step-45
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017f47c87be96457c49f46.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017f47c87be96457c49f46.md
index 6f5186cf057..aaf4d768f62 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017f47c87be96457c49f46.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017f47c87be96457c49f46.md
@@ -1,6 +1,6 @@
 ---
 id: 62017f47c87be96457c49f46
-title: Step 46
+title: ステップ 46
 challengeType: 0
 dashedName: step-46
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017fa5bbef406580ceb44f.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017fa5bbef406580ceb44f.md
index b5b1ae3a4a6..323e0c581c7 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017fa5bbef406580ceb44f.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62017fa5bbef406580ceb44f.md
@@ -1,6 +1,6 @@
 ---
 id: 62017fa5bbef406580ceb44f
-title: Step 47
+title: ステップ 47
 challengeType: 0
 dashedName: step-47
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018243f046a368fab8ffb6.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018243f046a368fab8ffb6.md
index adf77e2a248..473b8afe36b 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018243f046a368fab8ffb6.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018243f046a368fab8ffb6.md
@@ -1,6 +1,6 @@
 ---
 id: 62018243f046a368fab8ffb6
-title: Step 48
+title: ステップ 48
 challengeType: 0
 dashedName: step-48
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201830cb0c74b69f1b41635.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201830cb0c74b69f1b41635.md
index 297505ffffc..d503cca97e3 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201830cb0c74b69f1b41635.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201830cb0c74b69f1b41635.md
@@ -1,6 +1,6 @@
 ---
 id: 6201830cb0c74b69f1b41635
-title: Step 49
+title: ステップ 49
 challengeType: 0
 dashedName: step-49
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620186f4b6b8356d2def576b.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620186f4b6b8356d2def576b.md
index b96f42b5e6d..6257c765a05 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620186f4b6b8356d2def576b.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620186f4b6b8356d2def576b.md
@@ -1,6 +1,6 @@
 ---
 id: 620186f4b6b8356d2def576b
-title: Step 50
+title: ステップ 50
 challengeType: 0
 dashedName: step-50
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ba1aa263770c953be66.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ba1aa263770c953be66.md
index 97757703088..c138c3e272d 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ba1aa263770c953be66.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ba1aa263770c953be66.md
@@ -1,6 +1,6 @@
 ---
 id: 62018ba1aa263770c953be66
-title: Step 51
+title: ステップ 51
 challengeType: 0
 dashedName: step-51
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018c3e94434a71af1d5eaa.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018c3e94434a71af1d5eaa.md
index ed2450de59d..7ecf46ac1d3 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018c3e94434a71af1d5eaa.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018c3e94434a71af1d5eaa.md
@@ -1,6 +1,6 @@
 ---
 id: 62018c3e94434a71af1d5eaa
-title: Step 52
+title: ステップ 52
 challengeType: 0
 dashedName: step-52
 ---
@@ -11,25 +11,25 @@ Create a selector to target your `td` elements within your table body. Give them
 
 # --hints--
 
-You should have a `tbody td` selector.
+`tbody td` セレクターが必要です。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('tbody td'));
 ```
 
-Your `tbody td` selector should have a `width` property set to `100vw`.
+`tbody td` セレクターの `width` プロパティを `100vw` に設定する必要があります。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('tbody td')?.getPropertyValue('width') === '100vw');
 ```
 
-Your `tbody td` selector should have a `min-width` property set to `4rem`.
+`tbody td` セレクターの `min-width` プロパティを `4rem` に設定する必要があります。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('tbody td')?.getPropertyValue('min-width') === '4rem');
 ```
 
-Your `tbody td` selector should have a `max-width` property set to `4rem`.
+`tbody td` セレクターの `max-width` プロパティを `4rem` に設定する必要があります。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('tbody td')?.getPropertyValue('max-width') === '4rem');
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ec29b3ae674f40bef31.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ec29b3ae674f40bef31.md
index 121d60e1709..0f39c1b2ba6 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ec29b3ae674f40bef31.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62018ec29b3ae674f40bef31.md
@@ -1,6 +1,6 @@
 ---
 id: 62018ec29b3ae674f40bef31
-title: Step 53
+title: ステップ 53
 challengeType: 0
 dashedName: step-53
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62019093fe30e278e797d2f6.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62019093fe30e278e797d2f6.md
index fb120b271f6..c62ae625a70 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62019093fe30e278e797d2f6.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/62019093fe30e278e797d2f6.md
@@ -1,6 +1,6 @@
 ---
 id: 62019093fe30e278e797d2f6
-title: Step 54
+title: ステップ 54
 challengeType: 0
 dashedName: step-54
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620191707bc65579ddd3ce15.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620191707bc65579ddd3ce15.md
index 06e8d0a7344..82bbb5e5ca4 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620191707bc65579ddd3ce15.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620191707bc65579ddd3ce15.md
@@ -1,6 +1,6 @@
 ---
 id: 620191707bc65579ddd3ce15
-title: Step 55
+title: ステップ 55
 challengeType: 0
 dashedName: step-55
 ---
@@ -11,19 +11,19 @@ Using the same selector syntax, target the `th` elements within your table rows
 
 # --hints--
 
-You should have a `tr[class="total"] th` selector.
+`tr[class="total"] th` セレクターが必要です。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('tr[class="total"] th'));
 ```
 
-Your `tr[class="total"] th` selector should have a `text-align` property set to `left`.
+`tr[class="total"] th` セレクターの `text-align` プロパティを `left` に設定する必要があります。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('tr[class="total"] th')?.getPropertyValue('text-align') === 'left');
 ```
 
-Your `tr[class="total"] th` selector should have a `padding` property set to `0.5rem 0 0.25rem 0.5rem`.
+`tr[class="total"] th` セレクターの `padding` プロパティを `0.5rem 0 0.25rem 0.5rem` に設定する必要があります。
 
 ```js
 assert(new __helpers.CSSHelp(document).getStyle('tr[class="total"] th')?.getPropertyValue('padding') === '0.5rem 0px 0.25rem 0.5rem');
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620192a767533a7ad19d96d7.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620192a767533a7ad19d96d7.md
index b96bedc291f..65c5de136ae 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620192a767533a7ad19d96d7.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620192a767533a7ad19d96d7.md
@@ -1,6 +1,6 @@
 ---
 id: 620192a767533a7ad19d96d7
-title: Step 56
+title: ステップ 56
 challengeType: 0
 dashedName: step-56
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201995d9ab88e80f1989dce.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201995d9ab88e80f1989dce.md
index ea652dd6178..8ae8ccdd878 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201995d9ab88e80f1989dce.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201995d9ab88e80f1989dce.md
@@ -1,6 +1,6 @@
 ---
 id: 6201995d9ab88e80f1989dce
-title: Step 57
+title: ステップ 57
 challengeType: 0
 dashedName: step-57
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620199c7a7a32c81d4db3410.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620199c7a7a32c81d4db3410.md
index 29b9ca506ee..8588b508a17 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620199c7a7a32c81d4db3410.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/620199c7a7a32c81d4db3410.md
@@ -1,6 +1,6 @@
 ---
 id: 620199c7a7a32c81d4db3410
-title: Step 58
+title: ステップ 58
 challengeType: 0
 dashedName: step-58
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1a7af32c287bd6b8183.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1a7af32c287bd6b8183.md
index 0d447563352..792f745023c 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1a7af32c287bd6b8183.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1a7af32c287bd6b8183.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a1a7af32c287bd6b8183
-title: Step 59
+title: ステップ 59
 challengeType: 0
 dashedName: step-59
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1cc668a34888f5b2f52.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1cc668a34888f5b2f52.md
index d7eeb874456..1a10fb6b8be 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1cc668a34888f5b2f52.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a1cc668a34888f5b2f52.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a1cc668a34888f5b2f52
-title: Step 60
+title: ステップ 60
 challengeType: 0
 dashedName: step-60
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a20d742f5c89736c8cfb.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a20d742f5c89736c8cfb.md
index 1ac04dc2bb7..fe70986f30d 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a20d742f5c89736c8cfb.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a20d742f5c89736c8cfb.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a20d742f5c89736c8cfb
-title: Step 61
+title: ステップ 61
 challengeType: 0
 dashedName: step-61
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a42e39bf3b95b6a33bf3.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a42e39bf3b95b6a33bf3.md
index 2980b62b73f..86928bf5efb 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a42e39bf3b95b6a33bf3.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a42e39bf3b95b6a33bf3.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a42e39bf3b95b6a33bf3
-title: Step 62
+title: ステップ 62
 challengeType: 0
 dashedName: step-62
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a4adcc6414968b391592.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a4adcc6414968b391592.md
index a839b4563b9..9300a7b2c1b 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a4adcc6414968b391592.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a4adcc6414968b391592.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a4adcc6414968b391592
-title: Step 63
+title: ステップ 63
 challengeType: 0
 dashedName: step-63
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a5258af7b398b030bfaf.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a5258af7b398b030bfaf.md
index 00222d828d5..521068a68b7 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a5258af7b398b030bfaf.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a5258af7b398b030bfaf.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a5258af7b398b030bfaf
-title: Step 64
+title: ステップ 64
 challengeType: 0
 dashedName: step-64
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a59be346d399c21d10b1.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a59be346d399c21d10b1.md
index 90f5ecf7b24..a040d4dc4ac 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a59be346d399c21d10b1.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-more-about-css-pseudo-selectors-by-building-a-balance-sheet/6201a59be346d399c21d10b1.md
@@ -1,6 +1,6 @@
 ---
 id: 6201a59be346d399c21d10b1
-title: Step 65
+title: ステップ 65
 challengeType: 0
 dashedName: step-65
 ---
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e6afc009b450a437940a1.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e6afc009b450a437940a1.md
index 300f0729028..d02a3a803c8 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e6afc009b450a437940a1.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e6afc009b450a437940a1.md
@@ -7,11 +7,13 @@ dashedName: step-1
 
 # --description--
 
-HTML の基本的な構造から始めましょう。 `DOCTYPE` 宣言と、`html`、`head`、`body`、`title` 要素を追加してください。 `title` を `Piano` に設定してください。
+HTML の基本的な構造から始めましょう。 `DOCTYPE` 宣言と、`html`、`head`、`body`、`title` 要素を追加してください。
+
+Set the language of this page to English. Set the `title` to `Piano`.
 
 # --hints--
 
-コードに `DOCTYPE` 参照を入れる必要があります。
+コードに `DOCTYPE` 参照が含まれている必要があります。
 
 ```js
 assert(code.match(/<!DOCTYPE/gi));
@@ -23,22 +25,22 @@ assert(code.match(/<!DOCTYPE/gi));
 assert(code.match(/<!DOCTYPE\s+/gi));
 ```
 
-ドキュメントのタイプが `html` であると定義する必要があります。
+ドキュメントタイプが `html` であると定義する必要があります。
 
 ```js
 assert(code.match(/<!DOCTYPE\s+html/gi));
 ```
 
-そのタイプの後ろに `>` を入力して、`DOCTYPE` 宣言を閉じる必要があります。
+タイプの後ろに `>` を入力して、`DOCTYPE` 宣言を閉じる必要があります。
 
 ```js
 assert(code.match(/<!DOCTYPE\s+html\s*>/gi));
 ```
 
-`html` 要素には開始タグが必要です。
+`html` 要素は `lang` 属性が `en` の開始タグを持つ必要があります。
 
 ```js
-assert(code.match(/<html\s*>/gi));
+assert(code.match(/<html\s+lang\s*=\s*('|")en\1\s*>/gi));
 ```
 
 `html` 要素には終了タグが必要です。
@@ -109,7 +111,7 @@ const title = document.querySelector('title');
 assert.equal(title?.text?.trim()?.toLowerCase(), 'piano')
 ```
 
-タイトルについて、大文字小文字の区別とスペルに気をつけましょう。
+Remember, the casing and spelling matter for the title.
 
 ```js
 const title = document.querySelector('title');
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e83ec2eca1e370f830511.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e83ec2eca1e370f830511.md
index b2b900b78ae..dc9bb1fd5f4 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e83ec2eca1e370f830511.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612e83ec2eca1e370f830511.md
@@ -24,28 +24,31 @@ const heads = document.querySelectorAll('head');
 assert.equal(heads?.length, 1);
 ```
 
-`link` 要素は自己閉じ要素である必要があります。
+You should have one self-closing `link` element.
 
 ```js
-assert(code.match(/<link[\w\W\s]+\/>/i));
+assert(document.querySelectorAll('link').length === 1);
 ```
 
 `link` 要素は `head` 要素の中にある必要があります。
 
 ```js
-assert(code.match(/<head>[\w\W\s]*<link[\w\W\s]*\/>[\w\W\s]*<\/head>/i))
+assert.exists(document.querySelector('head > link'));
 ```
 
 `link` 要素は値が `stylesheet` に設定されている `rel` 属性を持つ必要があります。
 
 ```js
-assert.match(code, /<link[\s\S]*?rel=('|"|`)stylesheet\1/)
+const link_element = document.querySelector('link');
+const rel = link_element.getAttribute("rel");
+assert.equal(rel, "stylesheet");
 ```
 
 `link` 要素は値が `styles.css` に設定されている `href` 属性を持つ必要があります。
 
 ```js
-assert.match(code, /<link[\s\S]*?href=('|"|`)(\.\/)?styles\.css\1/)
+const link = document.querySelector('link');
+assert.equal(link.dataset.href, "styles.css");
 ```
 
 # --seed--
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612eaf56b7ba3257fdbfb0db.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612eaf56b7ba3257fdbfb0db.md
index 8e371e1fef0..521a8ddb3a3 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612eaf56b7ba3257fdbfb0db.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612eaf56b7ba3257fdbfb0db.md
@@ -27,7 +27,7 @@ assert(img?.nextElementSibling?.className === 'keys');
 assert(img?.previousElementSibling === null);
 ```
 
-`img` 要素の `class` 属性の値は logo に設定されている必要があります。
+Your `img` element should have a `class` set to `logo`.
 
 ```js
 const img = document.querySelector('img');
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612ebcba99bfa46a15370b11.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612ebcba99bfa46a15370b11.md
index 0d4cf86321d..4892bf5af6d 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612ebcba99bfa46a15370b11.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612ebcba99bfa46a15370b11.md
@@ -7,17 +7,29 @@ dashedName: step-27
 
 # --description--
 
-次はピアノをレスポンシブにしましょう。 `max-width` が `768px` の条件を対象とする `@media` クエリを追加してください。
+The `@media` at-rule, also known as a media query, is used to conditionally apply CSS. Media queries are commonly used to apply CSS based on the viewport width using the `max-width` and `min-width` properties.
+
+In the below example the padding is applied to the `.card` class when the viewport is `960px` wide and below.
+
+```css
+@media (max-width: 960px) {
+  .card {
+    padding: 2rem;
+  }
+}
+```
+
+Add a media query that will be applied when the viewport is `768px` wide and below.
 
 # --hints--
 
-新しい `@media` クエリを 1 つ追加する必要があります。
+You should add a new `@media` query.
 
 ```js
 assert(new __helpers.CSSHelp(document).getCSSRules('media')?.length === 1);
 ```
 
-`@media` クエリには `max-width` が `768px` という条件が必要です。
+Your `@media` query should have a `max-width` of `768px`.
 
 ```js
 assert(new __helpers.CSSHelp(document).getCSSRules('media')[0]?.media?.mediaText === '(max-width: 768px)');
diff --git a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612ec19d5268da7074941f84.md b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612ec19d5268da7074941f84.md
index 87fed24296e..48c1cfe5cce 100644
--- a/curriculum/challenges/japanese/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612ec19d5268da7074941f84.md
+++ b/curriculum/challenges/japanese/14-responsive-web-design-22/learn-responsive-web-design-by-building-a-piano/612ec19d5268da7074941f84.md
@@ -7,17 +7,27 @@ dashedName: step-32
 
 # --description--
 
-ブラウザーのウインドウの大きさが `769px` 以上 `1199px` 以下である場合に適用される別の `@media` ルールを追加してください。
+Logical operators can be used to construct more complex media queries. The `and` logical operator is used to query two media conditions.
+
+For example, a media query that targets a display width between 500px and 1000px would be:
+
+```css
+@media (min-width: 500px) and (max-width: 1000px){
+
+}
+```
+
+Add another `@media` rule to apply if the browser window is wider than `769px` but smaller than `1199px`.
 
 # --hints--
 
-新しい `@media` クエリを 1 つ追加する必要があります。
+You should add a new `@media` query.
 
 ```js
 assert(new __helpers.CSSHelp(document).getCSSRules('media')?.length === 2);
 ```
 
-`@media` クエリには、`min-width` が `769px`、`max-width` が `1199px` という条件が必要です。
+Your `@media` query should have a `min-width` of `769px` and a `max-width` of `1199px`.
 
 ```js
 const mediaText = new __helpers.CSSHelp(document).getCSSRules('media')[1]?.media?.mediaText;
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/build-a-roman-numeral-converter-project/roman-numeral-converter.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/build-a-roman-numeral-converter-project/roman-numeral-converter.md
index b3640a1200d..06f0c991879 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/build-a-roman-numeral-converter-project/roman-numeral-converter.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/build-a-roman-numeral-converter-project/roman-numeral-converter.md
@@ -11,7 +11,7 @@ dashedName: build-a-roman-numeral-converter
 Convert the given number into a roman numeral.
 
 | Roman numerals | Arabic numerals |
-|----------------|-----------------|
+| -------------- | --------------- |
 | M              | 1000            |
 | CM             | 900             |
 | D              | 500             |
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23d1c5f1c93161f3582ae.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23d1c5f1c93161f3582ae.md
index d5d8c611c5c..7d9867b26c7 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23d1c5f1c93161f3582ae.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23d1c5f1c93161f3582ae.md
@@ -7,7 +7,7 @@ dashedName: step-6
 
 # --description--
 
-Similar to your `#stats` element, your `#monsterStats` element needs two `span` elements. Give them the class `stat` and give the first element the text `Monster Name: ` and the second the text `Health: `. After the text in each, add a `strong` element with an empty nested `span` element.
+Similar to your `#stats` element, your `#monsterStats` element needs two `span` elements. Give them the class `stat` and give the first element the text `Monster Name:` and the second the text `Health:`. After the text in each, add a `strong` element with an empty nested `span` element.
 
 # --hints--
 
@@ -26,14 +26,14 @@ assert.equal(spans[0].className, 'stat');
 assert.equal(spans[1].className, 'stat');
 ```
 
-Your first `span` element should have the text `Monster Name: `. Make sure the spacing is correct.
+Your first `span` element should have the text `Monster Name:`. Make sure the spacing is correct.
 
 ```js
 const spans = document.querySelectorAll(`#monsterStats > span`);
 assert.equal(spans[0].innerText, 'Monster Name: ');
 ```
 
-Your second `span` element should have the text `Health: `. Make sure the spacing is correct.
+Your second `span` element should have the text `Health:`. Make sure the spacing is correct.
 
 ```js
 const spans = document.querySelectorAll(`#monsterStats > span`);
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md
index 490ea3e8e2f..3cc2e9eb620 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md
@@ -14,7 +14,7 @@ const info = document.querySelector("#info");
 info.innerText = "Hello World";
 ```
 
-This code would change the element assigned to the `div` variable to have the text `Hello World`. 
+This code would change the element assigned to the `div` variable to have the text `Hello World`.
 
 When a player clicks your `Go to store` button, you want to change the buttons and text. Remove the code inside the `goStore` function and add a line that updates the text of `button1` to say `Buy 10 health (10 gold)`.
 
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md
index d5c3664e5ed..28ff0bb1ad6 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md
@@ -135,7 +135,7 @@ const monsterHealthText =document.querySelector("#monsterHealth");
 --fcc-editable-region--
 const locations = [
     {
-        
+
     }
 ];
 --fcc-editable-region--
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
index d91e6245ebe..8f9a534ce96 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
@@ -206,7 +206,7 @@ function buyWeapon() {
     gold -= 30;
     currentWeapon++;
     goldText.innerText = gold;
-    
+
     text.innerText = "You now have a new weapon.";
   }
 }
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
index 4b1f8fb6cb6..95d244d0f28 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
@@ -7,7 +7,7 @@ dashedName: step-90
 
 # --description--
 
-You can insert variables into a string with the <dfn>concatenation operator</dfn> `+`. Update the `You now have a new weapon.` string to say `You now have a ` and the name of the new weapon. Remember to end the sentence with a period.
+You can insert variables into a string with the <dfn>concatenation operator</dfn> `+`. Update the `You now have a new weapon.` string to say `You now have a` and the name of the new weapon. Remember to end the sentence with a period.
 
 Here is an example that creates the string `Hello, our name is freeCodeCamp.`:
 
@@ -18,7 +18,7 @@ const ourStr = "Hello, our name is " + ourName + ".";
 
 # --hints--
 
-You should update the `text.innerText` assignment to start with the string `You now have a `.
+You should update the `text.innerText` assignment to start with the string `You now have a`.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*=\s*('|")You now have a \1/);
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
index 748ab4d2f08..0adfafd5584 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
@@ -214,7 +214,7 @@ function buyWeapon() {
     goldText.innerText = gold;
     let newWeapon = weapons[currentWeapon].name;
     text.innerText = "You now have a " + newWeapon + ".";
-    
+
   }
 }
 --fcc-editable-region--
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
index b7219fb9be1..4037d95c48c 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
@@ -7,7 +7,7 @@ dashedName: step-92
 
 # --description--
 
-Up until now, any time `text.innerText` was updated the old text was erased. This time, use the `+=` operator to add text to the end of `text.innerText`. Add the string ` In your inventory you have: ` - include the spaces at the beginning and the end.
+Up until now, any time `text.innerText` was updated the old text was erased. This time, use the `+=` operator to add text to the end of `text.innerText`. Add the string `In your inventory you have:` - include the spaces at the beginning and the end.
 
 # --hints--
 
@@ -24,7 +24,7 @@ You should use the `+=` operator to add to `text.innerText`.
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*/)
 ```
 
-You should add the string ` In your inventory you have: ` to the end of `text.innerText`. Mind the spaces!
+You should add the string `In your inventory you have:` to the end of `text.innerText`. Mind the spaces!
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*('|")\sIn your inventory you have:\s\1/)
@@ -203,7 +203,7 @@ function buyWeapon() {
     let newWeapon = weapons[currentWeapon].name;
     text.innerText = "You now have a " + newWeapon + ".";
     inventory.push(newWeapon);
-    
+
   }
 }
 --fcc-editable-region--
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
index 098be4a56e6..908c77e836c 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
@@ -11,7 +11,7 @@ At the end of the second `text.innerText` string you just added, use the concate
 
 # --hints--
 
-You should not change the ` In your inventory you have: ` string.
+You should not change the `In your inventory you have:` string.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*('|")\sIn your inventory you have:\s\1/)
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
index 03e5cceea99..59e7717ce5b 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
@@ -7,7 +7,7 @@ dashedName: step-105
 
 # --description--
 
-After your `currentWeapon`, use the concatenation operator to set `text.innerText` to the string `You sold a `, then `currentWeapon`, then the string `.`.
+After your `currentWeapon`, use the concatenation operator to set `text.innerText` to the string `You sold a`, then `currentWeapon`, then the string `.`.
 
 # --hints--
 
@@ -17,13 +17,13 @@ You should use the assignment operator with `text.innerText`.
 assert.match(sellWeapon.toString(), /text\.innerText\s*=/);
 ```
 
-You should add `You sold a ` to `text.innerText`. Spacing is important.
+You should add `You sold a` to `text.innerText`. Spacing is important.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*=\s*('|")You sold a \1/);
 ```
 
-You should add the value of `currentWeapon` to the `You sold a ` string. Use the concatenation operator to do this on the same line.
+You should add the value of `currentWeapon` to the `You sold a` string. Use the concatenation operator to do this on the same line.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*=\s*('|")You sold a\s\1\s*\+\s*\_currentWeapon/);
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
index bc8435faa22..ab3661c3b47 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
@@ -7,7 +7,7 @@ dashedName: step-106
 
 # --description--
 
-Now use the `+=` operator to add the string ` In your inventory you have: ` and the contents of `inventory` to the `text.innerText`. Make sure to include the space at the beginning and end of the ` In your inventory you have: ` string.
+Now use the `+=` operator to add the string `In your inventory you have:` and the contents of `inventory` to the `text.innerText`. Make sure to include the space at the beginning and end of the `In your inventory you have:` string.
 
 # --hints--
 
@@ -25,7 +25,7 @@ const matches = sellWeapon.toString().match(/text\.innerText\s*\+=/g);
 assert.equal(matches.length, 1);
 ```
 
-You should add the string ` In your inventory you have: ` to the second `text.innerText` line. Spacing matters.
+You should add the string `In your inventory you have:` to the second `text.innerText` line. Spacing matters.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*\+=\s*('|") In your inventory you have: \1/);
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
index 229ca08f2a2..d332dfa1870 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
@@ -17,19 +17,19 @@ You should use dot notation to access the `innerText` property of `text`.
 assert.match(attack.toString(), /text\.innerText/);
 ```
 
-You should assign the string `The ` to `innerText` property of `text`.
+You should assign the string `The` to `innerText` property of `text`.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1/);
 ```
 
-You should use the concatenation operator to add the value of `monsters[fighting].name` to the `The ` string.
+You should use the concatenation operator to add the value of `monsters[fighting].name` to the `The` string.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1\s*\+\s*monsters\[fighting\]\.name/);
 ```
 
-You should use the concatenation operator to add the string ` attacks.` to the `monsters[fighting].name` string.
+You should use the concatenation operator to add the string `attacks.` to the `monsters[fighting].name` string.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1\s*\+\s*monsters\[fighting\]\.name\s*\+\s*('|") attacks\.\2/);
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
index 6566de3802a..a96685f85e9 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
@@ -7,7 +7,7 @@ dashedName: step-119
 
 # --description--
 
-On a new line, add the string ` You attack it with your [weapon].` to the `text` value, replacing `[weapon]` with the player's current weapon.
+On a new line, add the string `You attack it with your [weapon].` to the `text` value, replacing `[weapon]` with the player's current weapon.
 
 # --hints--
 
@@ -24,7 +24,7 @@ You should use compound assignment with `text.innerText`.
 assert.match(attack.toString(), /text\.innerText\s*\+=/);
 ```
 
-You should add the string ` You attack it with your ` to the `text.innerText` value. Remember that spacing matters.
+You should add the string `You attack it with your` to the `text.innerText` value. Remember that spacing matters.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|") You attack it with your \1/);
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
index a2c6fde768a..5e0e6059dff 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
@@ -279,7 +279,7 @@ function attack() {
   text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
   health -= monsters[fighting].level;
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
index acf1efd38b0..055ca35f7fe 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
@@ -275,7 +275,7 @@ function attack() {
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
   healthText.innerText = health;
   monsterHealthText.innerText = monsterHealth;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
index 3524f53b4a3..74b7964b09f 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
@@ -11,7 +11,7 @@ Inside the `dodge` function, set `text.innerText` equal to the string `You dodge
 
 # --hints--
 
-You should assign the string `You dodge the attack from the ` to the `text.innerText` property. Remember that spacing matters.
+You should assign the string `You dodge the attack from the` to the `text.innerText` property. Remember that spacing matters.
 
 ```js
 assert.match(dodge.toString(), /text\.innerText\s*=\s*('|")You dodge the attack from the \1/);
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
index cb9eadcb3ec..c2913614de6 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
@@ -283,7 +283,7 @@ function dodge() {
 function defeatMonster() {
   gold += Math.floor(monsters[fighting].level * 6.7);
   xp += monsters[fighting].level;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
index ca92f837431..0101b5e2285 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
@@ -285,7 +285,7 @@ function defeatMonster() {
   xp += monsters[fighting].level;
   goldText.innerText = gold;
   xpText.innerText = xp;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
index dd0068655fd..93d46489227 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
@@ -10,7 +10,7 @@ dashedName: step-132
 Your `locations` array doesn't have a fifth element, so `locations[4]` doesn't work. Add a new object at the end of the `locations` array, following the same structure as the other objects. Set `name` to `kill monster`, set `button text` to an array with three `Go to town square` strings, set `button functions` to an array with three `goTown` variables, and set `text` to `The monster screams Arg! as it dies. You gain experience points and find gold.`.
 
 # --hints--
- 
+
 Your `locations` array should have five values.
 
 ```js
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
index 3e9df421573..6b3bc12e219 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
@@ -280,7 +280,7 @@ function attack() {
   text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
   health -= getMonsterAttackValue(monsters[fighting].level);
   if (isMonsterHit()) {
-    
+
   }
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
   healthText.innerText = health;
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
index 88836e37794..8bf8c85ac0e 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
@@ -7,7 +7,7 @@ dashedName: step-150
 
 # --description--
 
-Add an `else` statement to your `if` statement. In the `else` statement, use the `+=` operator to add the text ` You miss.` to the end of `text.innerText`.
+Add an `else` statement to your `if` statement. In the `else` statement, use the `+=` operator to add the text `You miss.` to the end of `text.innerText`.
 
 # --hints--
 
@@ -17,7 +17,7 @@ You should add an `else` block after your `if (isMonsterHit())` block.
 assert.match(attack.toString(), /if\s*\(isMonsterHit\(\)\s*\)\s*\{\s*monsterHealth\s*-=\s*weapons\[currentWeapon\]\.power\s*\+\s*Math\.floor\(Math\.random\(\)\s*\*\s*xp\)\s*\+\s*1;\s*\}\s*else/)
 ```
 
-You should add the text ` You miss.` to the end of `text.innerText`. Remember to use compound assignment.
+You should add the text `You miss.` to the end of `text.innerText`. Remember to use compound assignment.
 
 ```js
 assert.match(attack.toString(), /if\s*\(isMonsterHit\(\)\s*\)\s*\{\s*monsterHealth\s*-=\s*weapons\[currentWeapon\]\.power\s*\+\s*Math\.floor\(Math\.random\(\)\s*\*\s*xp\)\s*\+\s*1;\s*\}\s*else\s*\{\s*text\.innerText\s*\+=\s*('|")\sYou miss\.\1/)
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
index 4210b69f7a8..02ffeb838f6 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
@@ -7,7 +7,7 @@ dashedName: step-154
 
 # --description--
 
-Use the `+=` operator to add ` Your [weapon] breaks.` to the end of `text.innerText`, replacing `weapon` with the last item in the `inventory` array. You can get this last item by using `inventory.pop()`, which will remove the last item in the array AND return it so it appears in your string.
+Use the `+=` operator to add `Your [weapon] breaks.` to the end of `text.innerText`, replacing `weapon` with the last item in the `inventory` array. You can get this last item by using `inventory.pop()`, which will remove the last item in the array AND return it so it appears in your string.
 
 # --hints--
 
@@ -30,14 +30,14 @@ You should add the string " Your " to `text.innerText`. Remember that spacing ma
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1/);
 ```
 
-You should add the return value of `inventory.pop()` to the ` Your ` string.
+You should add the return value of `inventory.pop()` to the `Your` string.
 
 ```js
 console.log(attack.toString());
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1\s*\+\s*inventory\.pop\(\)/);
 ```
 
-You should add ` breaks.` to the ` "Your " + inventory.pop()` string.
+You should add `breaks.` to the `"Your " + inventory.pop()` string.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1\s*\+\s*inventory\.pop\(\)\s*\+\s*('|")\sbreaks\.\2/);
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
index b043a04a1a5..bb3a88b2824 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
@@ -375,7 +375,7 @@ function pickEight() {
 --fcc-editable-region--
 function pick(guess) {
   let numbers = [];
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
index ac85513b88f..c0e732491ac 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
@@ -11,13 +11,13 @@ After the `while` loop, set `text.innerText` to equal `You picked [guess]. Here
 
 # --hints--
 
-You should set `text.innerText` to the string `You picked `. Remember that spacing matters.
+You should set `text.innerText` to the string `You picked`. Remember that spacing matters.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1/);
 ```
 
-You should use the concatenation operator to add the value of the `guess` parameter to your `You picked ` string.
+You should use the concatenation operator to add the value of the `guess` parameter to your `You picked` string.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1\s*\+\s*guess/);
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
index 3b20e162326..7b34447692f 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
@@ -11,7 +11,7 @@ Before the final quote in that string you added, insert the new line escape char
 
 # --hints--
 
-You should add the new line escape character `\n` to your `. Here are the random numbers: ` string.
+You should add the new line escape character `\n` to your `. Here are the random numbers:` string.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1\s*\+\s*guess\s*\+\s*('|")\.\sHere are the random numbers:\\n\2/);
diff --git a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
index 180270940d6..c57f4d75914 100644
--- a/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
+++ b/curriculum/challenges/japanese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
@@ -369,7 +369,7 @@ function pick(guess) {
     numbers.push(Math.floor(Math.random() * 11));
   }
   text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/portuguese/01-responsive-web-design/responsive-web-design-projects/build-a-survey-form.md b/curriculum/challenges/portuguese/01-responsive-web-design/responsive-web-design-projects/build-a-survey-form.md
index 54b4f6f0661..4d6cd4ab4f6 100644
--- a/curriculum/challenges/portuguese/01-responsive-web-design/responsive-web-design-projects/build-a-survey-form.md
+++ b/curriculum/challenges/portuguese/01-responsive-web-design/responsive-web-design-projects/build-a-survey-form.md
@@ -91,7 +91,7 @@ const el = document.getElementById('name')
 assert(!!el && el.required)
 ```
 
-O elemento `#name` deve estar aninhado dentro de `#survey-form`.
+O elemento `#name` deve ser um descendente de `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #name')
@@ -119,7 +119,7 @@ const el = document.getElementById('email')
 assert(!!el && el.required)
 ```
 
-O elemento `#email` deve estar aninhado dentro de `#survey-form`
+O elemento `#email` deve ser um descendente de `#survey-form`
 
 ```js
 const el = document.querySelector('#survey-form #email')
@@ -133,7 +133,7 @@ const el = document.getElementById('number')
 assert(!!el && el.tagName === 'INPUT')
 ```
 
-O elemento `#number` deve estar aninhado dentro de `#survey-form`.
+O elemento `#number` deve ser um descendente de `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #number')
@@ -203,21 +203,21 @@ const el = document.getElementById('number-label')
 assert(!!el && el.innerText.length > 0)
 ```
 
-O elemento `#name-label` deve estar aninhado dentro de `#survey-form`.
+O elemento `#name-label` deve ser um descendente de `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #name-label')
 assert(!!el)
 ```
 
-O elemento `#email-label` deve estar aninhado dentro de `#survey-form`.
+O elemento `#email-label` deve ser um descendente de `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #email-label')
 assert(!!el)
 ```
 
-O elemento `#number-label` deve estar aninhado dentro de `#survey-form`.
+O elemento `#number-label` deve ser um descendente de `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #number-label')
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/iterate-through-all-an-arrays-items-using-for-loops.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/iterate-through-all-an-arrays-items-using-for-loops.md
index 16597463fc6..7cce9096621 100644
--- a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/iterate-through-all-an-arrays-items-using-for-loops.md
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/iterate-through-all-an-arrays-items-using-for-loops.md
@@ -30,7 +30,7 @@ Usando o laço `for`, essa função itera o array, acessa cada elemento do array
 
 # --instructions--
 
-Definimos uma função, `filteredArray`, a qual recebe `arr`, um array aninhado, e `elem` como argumentos, e retornamos um novo array. `elem` representa um elemento que pode ou não estar presente em um ou mais dos arrays aninhados dentro de `arr`. Modifique a função, usando o laço `for`, para retornar uma versão filtrada do array recebido mode que qualquer array aninhado dentro de `arr` e contendo `elem` seja removido.
+Definimos uma função, `filteredArray`, a qual recebe `arr`, um array aninhado, e `elem` como argumentos, e retornamos um novo array. `elem` representa um elemento que pode ou não estar presente em um ou mais dos arrays aninhados dentro de `arr`. Modifique a função, usando o laço `for`, para retornar uma versão filtrada do array recebido de modo que qualquer array aninhado dentro de `arr` e contendo `elem` seja removido.
 
 # --hints--
 
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
index 67117d004f5..ac9dbb9537d 100644
--- a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
@@ -37,12 +37,6 @@ assert(code.match(/quotient/g).length === 1);
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function(y){return 'quotient = '+y;})(quotient);
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
index f808b75cb79..dcbab92e69f 100644
--- a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
@@ -11,12 +11,12 @@ dashedName: escape-sequences-in-strings
 
 Aspas não são os únicos caracteres que podem ser <dfn>escapados</dfn> dentro de uma string. Há dois motivos para usar caracteres de escapamento:
 
-1.  Para permitir que você use caracteres que você pode não ser capaz de digitar do contrário, como o caractere de retorno de carro.
+1.  Para permitir que você use caracteres que você pode não ser capaz de digitar do contrário, como o caractere de nova linha.
 2.  Para permitir que você represente várias aspas em uma string sem o JavaScript entender erroneamente o que você quis dizer.
 
 Aprendemos isso no desafio anterior.
 
-<table class='table table-striped'><thead><tr><th>Código</th><th>Saída</th></tr></thead><tbody><tr><td><code>\'</code></td><td>aspas simples</td></tr><tr><td><code>\"</code></td><td>aspas duplas</td></tr><tr><td><code>\\</code></td><td>barra invertida</td></tr><tr><td><code>\n</code></td><td>nova linha</td></tr><tr><td><code>\r</code></td><td>retorno de carro</td></tr><tr><td><code>\t</code></td><td>tab</td></tr><tr><td><code>\b</code></td><td>limite de palavra</td></tr><tr><td><code>\f</code></td><td>quebra de página</td></tr></tbody></table>
+<table class='table table-striped'><thead><tr><th>Código</th><th>Saída</th></tr></thead><tbody><tr><td><code>\'</code></td><td>aspas simples</td></tr><tr><td><code>\"</code></td><td>aspas duplas</td></tr><tr><td><code>\\</code></td><td>barra invertida</td></tr><tr><td><code>\n</code></td><td>nova linha</td></tr><tr><td><code>\t</code></td><td>tab</td></tr><tr><td><code>\r</code></td><td>retorno de carro</td></tr><tr><td><code>\b</code></td><td>limite de palavra</td></tr><tr><td><code>\f</code></td><td>quebra de página</td></tr></tbody></table>
 
 *Note que a própria barra invertida deve ser escapada para ser exibida como uma barra invertida.*
 
@@ -78,14 +78,6 @@ assert(myStr === 'FirstLine\n\t\\SecondLine\nThirdLine');
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function(){
-if (myStr !== undefined){
-console.log('myStr:\n' + myStr);}})();
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
index 5d2317fb1c1..2de792c0249 100644
--- a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
@@ -31,12 +31,6 @@ assert(/var\s+a\s*=\s*9(\s*;?\s*)$/.test(code));
 
 # --seed--
 
-## --after-user-code--
-
-```js
-if(typeof a !== 'undefined') {(function(a){return "a = " + a;})(a);} else { (function() {return 'a is undefined';})(); }
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
index cbe779ce0b0..edd2e8495a1 100644
--- a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
@@ -62,12 +62,6 @@ assert(code.match(/"/g).length === 4 && code.match(/'/g).length === 2);
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function() { return "myStr = " + myStr; })();
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
index 5af9aff0661..d285548e9f0 100644
--- a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
@@ -98,7 +98,7 @@ function nextInLine(arr, item) {
 }
 
 // Setup
-const testArr = [1, 2, 3, 4, 5];
+let testArr = [1, 2, 3, 4, 5];
 
 // Display code
 console.log("Before: " + JSON.stringify(testArr));
@@ -109,7 +109,7 @@ console.log("After: " + JSON.stringify(testArr));
 # --solutions--
 
 ```js
-const testArr = [1, 2, 3, 4, 5];
+let testArr = [1, 2, 3, 4, 5];
 
 function nextInLine(arr, item) {
     arr.push(item);
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
index 32da207e910..a9d54c237d1 100644
--- a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
@@ -71,6 +71,13 @@ assert(
 );
 ```
 
+As variáveis globais não devem ser usadas para armazenar em cache o array.
+
+```js
+countdown(1)
+assert.deepStrictEqual(countdown(5), [5, 4, 3, 2, 1]);
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
index bea00af7483..c77f06a0883 100644
--- a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
@@ -56,6 +56,13 @@ assert.deepStrictEqual(rangeOfNumbers(6, 9), [6, 7, 8, 9]);
 assert.deepStrictEqual(rangeOfNumbers(4, 4), [4]);
 ```
 
+As variáveis globais não devem ser usadas para armazenar em cache o array.
+
+```js
+rangeOfNumbers(1, 3)
+assert.deepStrictEqual(rangeOfNumbers(6, 9), [6, 7, 8, 9]);
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
index 0c6a1db254b..640c70c2e6a 100644
--- a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
@@ -12,24 +12,35 @@ ES6 fornece uma nova sintaxe para criar objetos, usando a palavra-chave <dfn>cla
 
 Deve ser notado que a sintaxe `class` é apenas sintaxe, um <dfn>syntatical sugar</dfn>. JavaScript ainda não oferece suporte completo ao paradigma orientado a objetos, ao contrário do que acontece em linguagens como Java, Python, Ruby, etc.
 
-No ES5, geralmente definimos uma função construtora (`constructor` function) e usamos a palavra-chave `new` para instanciar um objeto.
-
-```js
-var SpaceShuttle = function(targetPlanet){
-  this.targetPlanet = targetPlanet;
-}
-var zeus = new SpaceShuttle('Jupiter');
-```
-
-A sintaxe `class` simplesmente substitui a criação da função construtora (`constructor`):
+No ES5, um objeto pode ser criado definindo uma função `constructor` e usando a palavra-chave `new` para instanciar o objeto.
+
+No ES6, uma declaração de `class` tem um método `constructor`, que é invocado com a palavra-chave `new`. Se o método `constructor` não for explicitamente definido, ele será definido implicitamente sem argumentos.
 
 ```js
+// Explicit constructor
 class SpaceShuttle {
   constructor(targetPlanet) {
     this.targetPlanet = targetPlanet;
   }
+  takeOff() {
+    console.log("To " + this.targetPlanet + "!");
+  }
 }
+
+// Implicit constructor 
+class Rocket {
+  launch() {
+    console.log("To the moon!");
+  }
+}
+
 const zeus = new SpaceShuttle('Jupiter');
+// prints To Jupiter! in console
+zeus.takeOff();
+
+const atlas = new Rocket();
+// prints To the moon! in console
+atlas.launch();
 ```
 
 Deve ser notado que a palavra-chave `class` declara uma nova função, para qual um construtor é adicionado. Esse construtor é invocado quando `new` é chamado na criação de um novo objeto.
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
index 39bce775da3..a919460c92f 100644
--- a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
@@ -53,7 +53,8 @@ assert(
 `bicycle.setGear(48)` deve alterar o valor de `gear` para 48.
 
 ```js
-assert(new bicycle.setGear(48).gear === 48);
+bicycle.setGear(48);
+assert(bicycle.gear === 48);
 ```
 
 # --seed--
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 24a8aaa7b17..2c3eeadc7e9 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
@@ -137,14 +137,6 @@ assert.strictEqual(
 
 # --seed--
 
-## --after-user-code--
-
-```js
-if(bob){
-  bob = new Person("Bob Ross");
-}
-```
-
 ## --seed-contents--
 
 ```js
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 dacca9645f4..390e389fb0b 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
@@ -42,6 +42,13 @@ A solução não deve usar os métodos `Array.prototype.flat()` ou `Array.protot
 assert(!code.match(/\.\s*flat\s*\(/) && !code.match(/\.\s*flatMap\s*\(/));
 ```
 
+As variáveis globais não devem ser utilizadas.
+
+```js
+steamrollArray([1, {}, [3, [[4]]]])
+assert.deepEqual(steamrollArray([1, {}, [3, [[4]]]]), [1, {}, 3, 4])
+```
+
 # --seed--
 
 ## --seed-contents--
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 fb9ac14cb44..680e6047c8d 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
@@ -47,28 +47,48 @@ sumPrimes(10);
 # --solutions--
 
 ```js
-function eratosthenesArray(n) {
-    var primes = [];
-    if (n > 2) {
-        var half = n>>1;
-        var sieve = Array(half);
-        for (var i = 1, limit = Math.sqrt(n)>>1; i <= limit; i++) {
-            if (!sieve[i]) {
-                for (var step = 2*i+1, j = (step*step)>>1; j < half; j+=step) {
-                    sieve[j] = true;
-                }
-            }
-        }
-        primes.push(2);
-        for (var p = 1; p < half; p++) {
-            if (!sieve[p]) primes.push(2*p+1);
+class PrimeSeive {
+  constructor(num) {
+    const seive = Array(Math.floor((num - 1) / 2)).fill(true);
+    const upper = Math.floor((num - 1) / 2);
+    const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+
+    for (let i = 0; i <= sqrtUpper; i++) {
+      if (seive[i]) {
+        // Mark value in seive array
+        const prime = 2 * i + 3;
+        // Mark all multiples of this number as false (not prime)
+        const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+        for (let j = primeSqaredIndex; j < upper; j += prime) {
+          seive[j] = false;
         }
+      }
     }
-    return primes;
-}
+
+    this._seive = seive;
+  }
+
+  isPrime(num) {
+    return num === 2
+      ? true
+      : num % 2 === 0
+        ? false
+        : this.isOddPrime(num);
+  }
+
+  isOddPrime(num) {
+    return this._seive[(num - 3) / 2];
+  }
+};
 
 function sumPrimes(num) {
-  return eratosthenesArray(num+1).reduce(function(a,b) {return a+b;}, 0);
+  const primeSeive = new PrimeSeive(num);
+
+  let sum = 2;
+  for (let i = 3; i <= num; i += 2) {
+    if (primeSeive.isOddPrime(i)) sum += i;
+  }
+  return sum;
 }
 
 sumPrimes(10);
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 410bf4b0856..5f58725ef23 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
@@ -79,23 +79,55 @@ assert(beagle.constructor === Dog);
 `beagle.eat()` deve mostrar no console a string `nom nom nom`
 
 ```js
-console.log = function (msg) {
-  throw msg;
-};
-assert.throws(() => beagle.eat(), 'nom nom nom');
+capture();
+beagle.eat();
+uncapture();
+assert(logOutput == 'nom nom nom');
 ```
 
 `beagle.bark()` deve mostrar no console a string `Woof!`
 
 ```js
-console.log = function (msg) {
-  throw msg;
-};
-assert.throws(() => beagle.bark(), 'Woof!');
+capture();
+beagle.bark();
+uncapture();
+assert(logOutput == 'Woof!');
 ```
 
 # --seed--
 
+## --before-user-code--
+
+```js
+var logOutput = "";
+var originalConsole = console
+function capture() {
+    var nativeLog = console.log;
+    console.log = function (message) {
+        logOutput = message;
+        if(nativeLog.apply) {
+          nativeLog.apply(originalConsole, arguments);
+        } else {
+          var nativeMsg = Array.prototype.slice.apply(arguments).join(' ');
+          nativeLog(nativeMsg);
+        }
+    };
+}
+
+function uncapture() {
+  console.log = originalConsole.log;
+}
+
+capture();
+```
+
+## --after-user-code--
+
+```js
+uncapture();
+(function() { return logOutput || "console.log never called"; })();
+```
+
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/portuguese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md b/curriculum/challenges/portuguese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
index d2bca611cf1..18b7f725877 100644
--- a/curriculum/challenges/portuguese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
+++ b/curriculum/challenges/portuguese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
@@ -8,7 +8,7 @@ dashedName: build-a-25--5-clock
 
 # --description--
 
-**Objetivo:** criar uma aplicação que funcione de modo semelhante ao que vemos em: <a href="https://codepen.io/freeCodeCamp/full/XpKrrW" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/XpKrrW</a>.
+**Objetivo:** criar uma aplicação que funcione de modo semelhante ao que vemos em: <a href="https://25--5-clock.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://25--5-clock.freecodecamp.rocks</a>.
 
 Atenda às histórias de usuário abaixo e faça com que todos os testes passem. Use quaisquer bibliotecas ou APIs de que você precisar. Dê ao projeto o seu próprio estilo pessoal.
 
diff --git a/curriculum/challenges/portuguese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md b/curriculum/challenges/portuguese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
index 9bb2e2e449c..9c0bfe1a48d 100644
--- a/curriculum/challenges/portuguese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
+++ b/curriculum/challenges/portuguese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
@@ -8,7 +8,7 @@ dashedName: build-a-drum-machine
 
 # --description--
 
-**Objetivo:** criar uma aplicação que funcione de modo semelhante ao que vemos em: <a href="https://codepen.io/freeCodeCamp/full/MJyNMd" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/MJyNMd</a>.
+**Objetivo:** criar uma aplicação que funcione de modo semelhante ao que vemos em: <a href="https://drum-machine.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://drum-machine.freecodecamp.rocks/</a>.
 
 Atenda às histórias de usuário abaixo e faça com que todos os testes passem. Use quaisquer bibliotecas ou APIs de que você precisar. Dê ao projeto o seu próprio estilo pessoal.
 
diff --git a/curriculum/challenges/portuguese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md b/curriculum/challenges/portuguese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
index 5e785f27c14..cc76954a625 100644
--- a/curriculum/challenges/portuguese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
+++ b/curriculum/challenges/portuguese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
@@ -8,7 +8,7 @@ dashedName: build-a-javascript-calculator
 
 # --description--
 
-**Objetivo:** criar uma aplicação que funcione de modo semelhante ao que vemos em: <a href="https://codepen.io/freeCodeCamp/full/wgGVVX" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/wgGVVX</a>.
+**Objetivo:** criar uma aplicação que funcione de modo semelhante ao que vemos em: <a href="https://javascript-calculator.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://javascript-calculator.freecodecamp.rocks/</a>.
 
 Atenda às histórias de usuário abaixo e faça com que todos os testes passem. Use quaisquer bibliotecas ou APIs de que você precisar. Dê ao projeto o seu próprio estilo pessoal.
 
diff --git a/curriculum/challenges/portuguese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md b/curriculum/challenges/portuguese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
index 920d1e088e6..0a3c172cce9 100644
--- a/curriculum/challenges/portuguese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
+++ b/curriculum/challenges/portuguese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
@@ -8,7 +8,7 @@ dashedName: build-a-markdown-previewer
 
 # --description--
 
-**Objetivo:** criar uma aplicação que funcione de modo semelhante ao que vemos em: <a href="https://codepen.io/freeCodeCamp/full/GrZVVO" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/GrZVVO</a>.
+**Objetivo:** criar uma aplicação que funcione de modo semelhante ao que vemos em: <a href="https://markdown-previewer.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://markdown-previewer.freecodecamp.rocks/</a>.
 
 Atenda às histórias de usuário abaixo e faça com que todos os testes passem. Use quaisquer bibliotecas ou APIs de que você precisar. Dê ao projeto o seu próprio estilo pessoal.
 
diff --git a/curriculum/challenges/portuguese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md b/curriculum/challenges/portuguese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
index 6354785b486..d9200a5fbdf 100644
--- a/curriculum/challenges/portuguese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
+++ b/curriculum/challenges/portuguese/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
@@ -8,7 +8,7 @@ dashedName: build-a-random-quote-machine
 
 # --description--
 
-**Objetivo:** criar uma aplicação que funcione de modo semelhante ao que vemos em: <a href="https://codepen.io/freeCodeCamp/full/qRZeGZ" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/qRZeGZ</a>.
+**Objetivo:** criar uma aplicação que funcione de modo semelhante ao que vemos em: <a href="https://random-quote-machine.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://random-quote-machine.freecodecamp.rocks/</a>.
 
 Atenda às histórias de usuário abaixo e faça com que todos os testes passem. Use quaisquer bibliotecas ou APIs de que você precisar. Dê ao projeto o seu próprio estilo pessoal.
 
diff --git a/curriculum/challenges/portuguese/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md b/curriculum/challenges/portuguese/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md
index ae7263d4234..ac210838cba 100644
--- a/curriculum/challenges/portuguese/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md
+++ b/curriculum/challenges/portuguese/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md
@@ -10,7 +10,7 @@ dashedName: create-a-model
 
 **C**RUD I Parte I - CREATE
 
-Em primeiro lugar, precisamos de um schema. Cada schema mapeia para uma coleção do MongoDB. Ele define a forma dos documentos dentro daquela coleção. Os schemas são os blocos que compõem os modelos. Eles podem ser aninhados para criar modelos complexos, mas nesse caso vamos simplificar as coisas. Um modelo permite que você crie instâncias de seus objetos, chamados documentos.
+Em primeiro lugar, precisamos de um schema. Cada schema mapeia para uma coleção do MongoDB. Ele define a forma dos documentos dentro daquela coleção. Os schemas são os blocos que compõem os modelos. Eles podem ser aninhados para criar modelos complexos, mas, neste caso, vamos simplificar as coisas. Um modelo permite que você crie instâncias de seus objetos, chamados documentos.
 
 O Replit é um servidor real. Em servidores reais, as interações com o banco de dados acontecem em funções de manipulador. Estas funções são executadas quando algum evento acontece (por exemplo, alguém atinge um endpoint na sua API). Seguiremos a mesma abordagem nestes exercícios. A função `done()` é um callback que nos diz que podemos prosseguir após concluir uma operação assíncrona, como inserir, pesquisar, atualizar ou excluir. Ela segue a convenção do Node e deve ser chamada como `done(null, data)` quando houver sucesso, ou `done(err)` quando houver erro.
 
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
index df2e887833c..849cd1538ef 100644
--- a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
@@ -60,32 +60,46 @@ primeSummation(2000000);
 # --solutions--
 
 ```js
-const NUM_PRIMES = 2000000;
-const PRIME_SEIVE = Array(Math.floor((NUM_PRIMES-1)/2)).fill(true);
-(function initPrimes(num) {
-  const upper = Math.floor((num - 1) / 2);
-  const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
-  for (let i = 0; i <= sqrtUpper; i++) {
-    if (PRIME_SEIVE[i]) {
-      // Mark value in PRIMES array
-      const prime = 2 * i + 3;
-      // Mark all multiples of this number as false (not prime)
-      const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
-      for (let j = primeSqaredIndex; j < upper; j += prime) {
-        PRIME_SEIVE[j] = false;
+class PrimeSeive {
+  constructor(num) {
+    const seive = Array(Math.floor((num - 1) / 2)).fill(true);
+    const upper = Math.floor((num - 1) / 2);
+    const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+
+    for (let i = 0; i <= sqrtUpper; i++) {
+      if (seive[i]) {
+        // Mark value in seive array
+        const prime = 2 * i + 3;
+        // Mark all multiples of this number as false (not prime)
+        const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+        for (let j = primeSqaredIndex; j < upper; j += prime) {
+          seive[j] = false;
+        }
       }
     }
+
+    this._seive = seive;
   }
-})(NUM_PRIMES);
 
-function isOddNumberPrime(num) {
-  return PRIME_SEIVE[(num - 3) / 2];
-}
+  isPrime(num) {
+    return num === 2
+      ? true
+      : num % 2 === 0
+        ? false
+        : this.isOddPrime(num);
+  }
+
+  isOddPrime(num) {
+    return this._seive[(num - 3) / 2];
+  }
+};
+
+function primeSummation(num) {
+  const primeSeive = new PrimeSeive(num);
 
-function primeSummation(n) {
   let sum = 2;
-  for (let i = 3; i < n; i += 2) {
-    if (isOddNumberPrime(i)) sum += i;
+  for (let i = 3; i < num; i += 2) {
+    if (primeSeive.isOddPrime(i)) sum += i;
   }
   return sum;
 }
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md
index 54b4f6f0661..4d6cd4ab4f6 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/build-a-survey-form-project/build-a-survey-form.md
@@ -91,7 +91,7 @@ const el = document.getElementById('name')
 assert(!!el && el.required)
 ```
 
-O elemento `#name` deve estar aninhado dentro de `#survey-form`.
+O elemento `#name` deve ser um descendente de `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #name')
@@ -119,7 +119,7 @@ const el = document.getElementById('email')
 assert(!!el && el.required)
 ```
 
-O elemento `#email` deve estar aninhado dentro de `#survey-form`
+O elemento `#email` deve ser um descendente de `#survey-form`
 
 ```js
 const el = document.querySelector('#survey-form #email')
@@ -133,7 +133,7 @@ const el = document.getElementById('number')
 assert(!!el && el.tagName === 'INPUT')
 ```
 
-O elemento `#number` deve estar aninhado dentro de `#survey-form`.
+O elemento `#number` deve ser um descendente de `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #number')
@@ -203,21 +203,21 @@ const el = document.getElementById('number-label')
 assert(!!el && el.innerText.length > 0)
 ```
 
-O elemento `#name-label` deve estar aninhado dentro de `#survey-form`.
+O elemento `#name-label` deve ser um descendente de `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #name-label')
 assert(!!el)
 ```
 
-O elemento `#email-label` deve estar aninhado dentro de `#survey-form`.
+O elemento `#email-label` deve ser um descendente de `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #email-label')
 assert(!!el)
 ```
 
-O elemento `#number-label` deve estar aninhado dentro de `#survey-form`.
+O elemento `#number-label` deve ser um descendente de `#survey-form`.
 
 ```js
 const el = document.querySelector('#survey-form #number-label')
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
index 0bbf6b66f63..81bda640e79 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
@@ -9,7 +9,7 @@ dashedName: step-56
 
 Para alinhar as caixas `input` entre si, defina a propriedade `display` como `inline-block` para todos os elementos `input` e `label` dentro dos elementos `.info`.
 
-Além disso, alinhe o texto à direita.
+Além disso, alinhe o texto do elemento `label` à direita.
 
 # --hints--
 
@@ -28,22 +28,14 @@ const display = gs('.info > label, .info > input') ?? gs('.info label, .info inp
 assert.equal(display, 'inline-block');
 ```
 
-Você deve dar aos elementos `input` e `label` um `text-align` de `right`.
+Você deve dar ao elemento `label` um `text-align` com o valor `right`.
 
 ```js
 const gs = (s) => new __helpers.CSSHelp(document).getStyle(s)?.textAlign;
-const textAlign = gs('.info > label, .info > input') ?? gs('.info label, .info input') ?? gs('.info > input, .info > label') ?? gs('.info input, .info label');
+const textAlign = gs('.info > label') ?? gs('.info label');
 assert.equal(textAlign, 'right');
 ```
 
-Você deve definir a propriedade `text-align: right` antes da regra `.info input`.
-
-```js
-const gs = (s) => new __helpers.CSSHelp(document).getStyleRule(s);
-assert(gs('.info input').isDeclaredAfter('.info label, .info input') || gs('.info input').isDeclaredAfter('.info > label, .info > input') || gs('.info input').isDeclaredAfter('.info > input, .info > label') || gs('.info input').isDeclaredAfter('.info input, .info label'));
-
-```
-
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
index 91ed8f5bd1e..36e5a875f26 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
@@ -286,7 +286,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -297,6 +296,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 --fcc-editable-region--
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
index ba9eab26628..8362b9a94a9 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
@@ -272,7 +272,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -283,6 +282,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
index cec78e03180..25185aab592 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
@@ -262,7 +262,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -273,6 +272,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
index b850fe56e14..385ce6a806f 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
@@ -260,7 +260,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -271,6 +270,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
index 4f61db5b9be..155fbe0e35f 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
@@ -300,7 +300,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -311,6 +310,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
index 634ea7bb387..4002d80e808 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
@@ -266,7 +266,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -277,6 +276,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
index 07889cd06ed..d440b269d04 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
@@ -280,7 +280,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -291,6 +290,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
index 89ef982a551..e8ef4d3a0de 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
@@ -278,7 +278,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -289,6 +288,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
index cf9fb1ed9b1..42d42519890 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
@@ -260,7 +260,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -271,6 +270,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
index 6b6743981d6..cb52af8304e 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
@@ -278,7 +278,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -289,6 +288,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
index fe9b87bade5..59d541772bb 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
@@ -280,7 +280,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -291,6 +290,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
@@ -603,12 +603,12 @@ input {
 .info label,
 .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .info input {
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
index 5b95db2841f..f33567f0d92 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
@@ -7,38 +7,33 @@ dashedName: step-5
 
 # --description--
 
-O nome da cafeteria é `CAMPER CAFE`. Você deve criar um elemento `h1` dentro do elemento `body`. Coloque o nome da cafeteria em letras maiúsculas para que ele se destaque.
+É hora de adicionar o conteúdo do menu. Adicione um elemento `main` dentro do elemento `body` existente. Mais pra frente ele conterá informações sobre preços dos cafés e sobremesas oferecidas pela cafeteria.
 
 # --hints--
 
-Você deve acrescentar uma tag de abertura `<h1>`.
+Você deve acrescentar uma tag de abertura `<main>`.
 
 ```js
-assert(code.match(/<h1>/i));
+assert(code.match(/<main>/i));
 ```
 
-Você deve acrescentar uma tag de fechamento `</h1>`.
+Você deve acrescentar uma tag de fechamento `</main>`.
 
 ```js
-assert(code.match(/<\/h1>/i));
+assert(code.match(/<\/main>/i));
 ```
 
-Você deve manter o elemento `body` preexistente.
+Você deve manter o elemento preexistente `body`. Verifique se você não excluiu a tag de fechamento.
 
 ```js
 assert($('body').length === 1);
 ```
 
-O elemento `h1` deve estar dentro do elemento `body`.
+A tag `main` deve estar dentro da tag `body`.
 
 ```js
-assert($('h1')[0].parentElement.tagName === "BODY");
-```
-
-O elemento `h1` deve conter o texto `CAMPER CAFE`.
-
-```js
-assert(code.match(/<h1>CAMPER CAFE<\/h1>/));
+const main = document.querySelector('main');
+assert(main.parentElement.tagName === 'BODY');
 ```
 
 # --seed--
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
index f5a8c6d5180..77097e26bd4 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
@@ -7,38 +7,38 @@ dashedName: step-6
 
 # --description--
 
-Para que os visitantes saibam que o café foi fundado em 2020, adicione um elemento `p` abaixo do elemento `h1` com o texto `Est. 2020`.
+O nome da cafeteria é `CAMPER CAFE`. Você deve criar um elemento `h1` dentro do elemento `main`. Coloque o nome da cafeteria em letras maiúsculas para que ele se destaque.
 
 # --hints--
 
-Você deve acrescentar uma tag de abertura`<p>`.
+Você deve acrescentar uma tag de abertura `<h1>`.
 
 ```js
-assert(code.match(/<p>/i));
+assert(code.match(/<h1>/i));
 ```
 
-Você deve acrescentar uma tag de encerramento `</p>`.
+Você deve acrescentar uma tag de fechamento `</h1>`.
 
 ```js
-assert(code.match(/<\/p>/i));
+assert(code.match(/<\/h1>/i));
 ```
 
-Você deve manter o elemento `h1` preexistente. Verifique se você não excluiu a tag de fechamento.
+O elemento preexistente `main` deve permanecer o mesmo.
 
 ```js
-assert($('h1').length === 1);
+assert($('main').length === 1);
 ```
 
-O elemento `p` deve estar abaixo do elemento `h1`.
+O elemento `h1` deve estar dentro do elemento `main`.
 
 ```js
-assert($('p')[0].previousElementSibling.tagName === 'H1');
+assert($('h1')[0].parentElement.tagName === "MAIN");
 ```
 
-O elemento `p` deve conter o texto `Est. 2020`.
+O elemento `h1` deve conter o texto `CAMPER CAFE`.
 
 ```js
-assert(document.querySelector("p").innerText === "Est. 2020");
+assert(code.match(/<h1>CAMPER CAFE<\/h1>/));
 ```
 
 # --seed--
@@ -54,7 +54,8 @@ assert(document.querySelector("p").innerText === "Est. 2020");
   </head>
   <body>
 --fcc-editable-region--
-    <h1>CAMPER CAFE</h1>
+    <main>
+    </main>
 --fcc-editable-region--
   </body>
 </html>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
index 051207ccce4..b818981daee 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
@@ -7,34 +7,38 @@ dashedName: step-7
 
 # --description--
 
-Já que o elemento `p` adicionado na etapa anterior fornece informações complementares sobre a cafeteria, aninhe os elementos `h1` e `p` em um elemento `header`.
+Para que os visitantes saibam que o café foi fundado em 2020, adicione um elemento `p` abaixo do elemento `h1` com o texto `Est. 2020`.
 
 # --hints--
 
-Você deve acrescentar uma tag de abertura `<header>`.
+Você deve acrescentar uma tag de abertura`<p>`.
 
 ```js
-assert(code.match(/<header>/i));
+assert(code.match(/<p>/i));
 ```
 
-Você deve acrescentar uma tag de fechamento `</header>`.
+Você deve acrescentar uma tag de encerramento `</p>`.
 
 ```js
-assert(code.match(/<\/header>/i));
+assert(code.match(/<\/p>/i));
 ```
 
-O elemento `h1` deve estar dentro do elemento `header`.
+Você deve manter o elemento `h1` preexistente. Verifique se você não excluiu a tag de fechamento.
 
 ```js
-const header = document.querySelectorAll('header')[0];
-assert(header.children[0].tagName === 'H1');
+assert($('h1').length === 1);
 ```
 
-O elemento `p` deve estar dentro do elemento `header`.
+O elemento `p` deve estar abaixo do elemento `h1`.
 
 ```js
-const header = document.querySelectorAll('header')[0];
-assert(header.children[1].tagName === "P");
+assert($('p')[0].previousElementSibling.tagName === 'H1');
+```
+
+O elemento `p` deve ter o texto `Est. 2020`.
+
+```js
+assert(document.querySelector("p").innerText === "Est. 2020");
 ```
 
 # --seed--
@@ -49,10 +53,11 @@ assert(header.children[1].tagName === "P");
     <title>Cafe Menu</title>
   </head>
   <body>
+    <main>
 --fcc-editable-region--
-    <h1>CAMPER CAFE</h1>
-    <p>Est. 2020</p>
+      <h1>CAMPER CAFE</h1>
 --fcc-editable-region--
+    </main>
   </body>
 </html>
 ```
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md
index a9eaba2ceaf..31bb70f8f43 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344f9c805cd193c33d829c
-title: Passo 12
+title: Passo 11
 challengeType: 0
-dashedName: step-12
+dashedName: step-11
 ---
 
 # --description--
@@ -56,11 +56,9 @@ assert(h1TextAlign === 'center');
 --fcc-editable-region--
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md
index f59c7e4ac07..9c7eb87b399 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fad8bf01691e71a30eb
-title: Passo 11
+title: Passo 10
 challengeType: 0
-dashedName: step-11
+dashedName: step-10
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(code.match(/<head\s*>[\w\W\s]*<style\s*>[\w\W\s]*<\/style\s*>[\w\W\s]*<\/
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md
index f3356f6f9ed..cb2184d456e 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fbc22624a2976425065
-title: Passo 10
+title: Passo 9
 challengeType: 0
-dashedName: step-10
+dashedName: step-9
 ---
 
 # --description--
@@ -55,11 +55,9 @@ assert(h2.innerText === 'Coffee');
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
 --fcc-editable-region--
       <section>
       </section>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
index 9a95328c07b..9070e1c402e 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fc1520b6719f2e35605
-title: Passo 9
+title: Passo 8
 challengeType: 0
-dashedName: step-9
+dashedName: step-8
 ---
 
 # --description--
@@ -32,8 +32,9 @@ assert($('main').length === 1);
 O elemento `section` deve estar dentro do elemento `main`.
 
 ```js
-const main = document.querySelectorAll('main')?.[0];
-assert(main.children[0].tagName === 'SECTION');
+const main = document.querySelector('main');
+const section = document.querySelector('section');
+assert(section.parentElement === main);
 ```
 
 # --seed--
@@ -48,12 +49,10 @@ assert(main.children[0].tagName === 'SECTION');
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
-      <h1>CAMPER CAFE</h1>
-      <p>Est. 2020</p>
-    </header>
 --fcc-editable-region--
     <main>
+      <h1>CAMPER CAFE</h1>
+      <p>Est. 2020</p>
     </main>
 --fcc-editable-region--
   </body>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md
index da5b61be230..6803ad8b9e8 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477ae34c1239cafe128be
-title: Passo 14
+title: Passo 13
 challengeType: 0
-dashedName: step-14
+dashedName: step-13
 ---
 
 # --description--
@@ -58,11 +58,9 @@ assert(selectors.length === 1);
 --fcc-editable-region--
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md
index 7d8cc4b3d76..0162eb01c7e 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477ae8466a9a3d2cc953c
-title: Passo 16
+title: Passo 15
 challengeType: 0
-dashedName: step-16
+dashedName: step-15
 ---
 
 # --description--
@@ -46,11 +46,9 @@ Você não deve ter nenhum seletor CSS no seu arquivo HTML.
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md
index 3afdf93c375..eeace5d0562 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md
@@ -1,13 +1,13 @@
 ---
 id: 5f3477ae9675db8bb7655b30
-title: Passo 13
+title: Passo 12
 challengeType: 0
-dashedName: step-13
+dashedName: step-12
 ---
 
 # --description--
 
-No passo anterior, você usou um <dfn>seletor de tipo</dfn> para estilizar o elemento `h1`. Vá em frente e centralize os elementos `h2` e `p` com um novo seletor de tipo para cada um.
+No passo anterior, você usou um <dfn>seletor de tipo</dfn> para estilizar o elemento `h1`. Centralize os elementos `h2` e `p` adicionando um novo seletor de tipo para cada um dos elementos `style` existentes.
 
 # --hints--
 
@@ -18,6 +18,13 @@ const hasH1 = new __helpers.CSSHelp(document).getStyle('h1');
 assert(hasH1);
 ```
 
+Você não deve adicionar uma nova tag `style`. Adicione as novas regras de CSS à tag `style` existente.
+
+```js
+const hasManyStyleTags = document.querySelectorAll('style').length > 1;
+assert(!hasManyStyleTags);
+```
+
 Você deve usar um novo seletor `h2`.
 
 ```js
@@ -72,11 +79,9 @@ assert(pTextAlign === 'center');
 --fcc-editable-region--
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
index 9272f7e881c..a811c99f579 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477aefa51bfc29327200b
-title: Passo 15
+title: Passo 14
 challengeType: 0
-dashedName: step-15
+dashedName: step-14
 ---
 
 # --description--
@@ -54,11 +54,9 @@ O código não deve conter as tags `<style>`.
     </style>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md
index ec543f7546a..7f866c54bb4 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477cb2e27333b1ab2b955
-title: Passo 17
+title: Passo 16
 challengeType: 0
-dashedName: step-17
+dashedName: step-16
 ---
 
 # --description--
@@ -68,11 +68,9 @@ assert(link.dataset.href == 'styles.css')
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md
index d86207c0ec4..b94b97fd0ac 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477cb303c5cb61b43aa9b
-title: Passo 19
+title: Passo 18
 challengeType: 0
-dashedName: step-19
+dashedName: step-18
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert(bodyBackground === 'brown');
     <link href="styles.css" rel="stylesheet"/>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md
index 1c4eb8fb5a2..5960a4df26f 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477cbcb6ba47918c1da92
-title: Passo 18
+title: Passo 17
 challengeType: 0
-dashedName: step-18
+dashedName: step-17
 ---
 
 # --description--
@@ -52,11 +52,9 @@ assert(meta[0].outerHTML.match(/content=('|")width=device-width, initial-scale=1
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md
index 4e34cab72d8..8221361a7b0 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md
@@ -1,8 +1,8 @@
 ---
 id: 5f34a1fd611d003edeafd681
-title: Passo 20
+title: Passo 19
 challengeType: 0
-dashedName: step-20
+dashedName: step-19
 ---
 
 # --description--
@@ -39,11 +39,9 @@ assert(bodyBackground === 'burlywood');
     <link href="styles.css" rel="stylesheet"/>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
index 16c778a7e43..36f1e044298 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed60785e1f3e9850b6e
-title: Passo 25
+title: Passo 24
 challengeType: 0
-dashedName: step-25
+dashedName: step-24
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(!hasWidth);
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
index 1dcd3e0704d..6fd987cca95 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
@@ -1,9 +1,9 @@
 ---
 id: 5f356ed60a5decd94ab66986
-title: Passo 23
+title: Passo 22
 challengeType: 0
 removeComments: false
-dashedName: step-23
+dashedName: step-22
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(bodyCSS === "rgba(0, 0, 0, 0)")
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
index 6180d87a036..fe075a93529 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed6199b0cdef1d2be8f
-title: Passo 27
+title: Passo 26
 challengeType: 0
-dashedName: step-27
+dashedName: step-26
 ---
 
 # --description--
@@ -48,11 +48,9 @@ assert(!hasDiv);
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
index 9fc07813ffb..14d1348a6a8 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed63c7807a4f1e6d054
-title: Passo 22
+title: Passo 21
 challengeType: 0
-dashedName: step-22
+dashedName: step-21
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(divWidth === '300px');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
index 661afc10eb8..fecafed96d0 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed63e0fa262326eef05
-title: Passo 24
+title: Passo 23
 challengeType: 0
-dashedName: step-24
+dashedName: step-23
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(divBackground === 'burlywood');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
index b104a35c71f..7a5accccadc 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed656a336993abd9f7c
-title: Passo 26
+title: Passo 25
 challengeType: 0
-dashedName: step-26
+dashedName: step-25
 ---
 
 # --description--
@@ -49,11 +49,9 @@ assert(divMarginLeft === 'auto');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
index 5d88db2cf41..e9de93fc2b7 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed69db0a491745e2bb6
-title: Passo 28
+title: Passo 27
 challengeType: 0
-dashedName: step-28
+dashedName: step-27
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert($('div').attr('class').includes('menu'));
 --fcc-editable-region--
     <div>
 --fcc-editable-region--
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
index b938bf5319f..dbce9244bb3 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed6cf6eab5f15f5cfe6
-title: Passo 21
+title: Passo 20
 challengeType: 0
-dashedName: step-21
+dashedName: step-20
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(div.parentElement.tagName === 'BODY');
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md
index f92e85727cb..9c352c946ee 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md
@@ -1,8 +1,8 @@
 ---
 id: 5f35e5c4321f818cdc4bed30
-title: Passo 30
+title: Passo 29
 challengeType: 0
-dashedName: step-30
+dashedName: step-29
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(article.previousElementSibling.tagName === 'H2');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
 --fcc-editable-region--
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md
index 6a7d973ecf4..0bacc3ca426 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f35e5c44359872a137bd98f
-title: Passo 29
+title: Passo 28
 challengeType: 0
-dashedName: step-29
+dashedName: step-28
 ---
 
 # --description--
@@ -55,11 +55,9 @@ assert(bodyBackground === `url("https://cdn.freecodecamp.org/curriculum/css-cafe
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
index 2927bdfea46..1caf95339f7 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d0fc037f7311b4ac8
-title: Passo 39
+title: Passo 38
 challengeType: 0
-dashedName: step-39
+dashedName: step-38
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(priceWidth === '50%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
index dee0b7f09a1..2c34bfe47ee 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d28d7ad0de6470505
-title: Passo 33
+title: Passo 32
 challengeType: 0
-dashedName: step-33
+dashedName: step-32
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert($('.flavor')[0].innerText.match(/French Vanilla/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
index 19a68e92c41..ad71812bf92 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d5414453fc2d7b480
-title: Passo 32
+title: Passo 31
 challengeType: 0
-dashedName: step-32
+dashedName: step-31
 ---
 
 # --description--
@@ -90,11 +90,9 @@ assert(children[1].innerText.match(/4\.50/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
 --fcc-editable-region--
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
index 122557943da..97d5fb80000 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866daec9a49519871816
-title: Passo 31
+title: Passo 30
 challengeType: 0
-dashedName: step-31
+dashedName: step-30
 ---
 
 # --description--
@@ -52,11 +52,9 @@ assert(secondP.innerText.match(/3\.00/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
 --fcc-editable-region--
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
index d22ec85b134..9acba3242bd 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866dbf362f99b9a0c6d0
-title: Passo 38
+title: Passo 37
 challengeType: 0
-dashedName: step-38
+dashedName: step-37
 ---
 
 # --description--
@@ -53,11 +53,9 @@ assert(itemPDisplay === 'inline-block');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md
index 0083fa96c89..505402d50f8 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866dd0d0275f01d4d847
-title: Passo 40
+title: Passo 39
 challengeType: 0
-dashedName: step-40
+dashedName: step-39
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(priceWidth === '49%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md
index 611c2874d9c..b882f5ca371 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866de7a5b784048f94b1
-title: Passo 37
+title: Passo 36
 challengeType: 0
-dashedName: step-37
+dashedName: step-36
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert($('article')[0].className === 'item');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
 --fcc-editable-region--
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md
index 033689aadc5..94e9721295b 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade94c6576e7f7b7953f
-title: Passo 42
+title: Passo 41
 challengeType: 0
-dashedName: step-42
+dashedName: step-41
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(priceWidth === '50%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md
index 8dc4448486f..4013fb0c848 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade9993019e26313fa8e
-title: Passo 43
+title: Passo 42
 challengeType: 0
-dashedName: step-43
+dashedName: step-42
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(articles[4] === items[4]);
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md
index af4e64de119..19bb0ab3099 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade99dda4e6071a85dfd
-title: Passo 47
+title: Passo 46
 challengeType: 0
-dashedName: step-47
+dashedName: step-46
 ---
 
 # --description--
@@ -50,11 +50,9 @@ assert($('main').children('section').length === 2);
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
 --fcc-editable-region--
         <section>
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md
index a3825e67f89..03e898edecf 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade9fa77275d9f4efe62
-title: Passo 41
+title: Passo 40
 challengeType: 0
-dashedName: step-41
+dashedName: step-40
 ---
 
 # --description--
@@ -34,11 +34,9 @@ assert(code.match(/Vanilla<\/p><p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md
index 143bff85074..c2a944d6e2f 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md
@@ -1,15 +1,15 @@
 ---
 id: 5f3ef6e01f288a026d709587
-title: Passo 67
+title: Passo 66
 challengeType: 0
-dashedName: step-67
+dashedName: step-66
 ---
 
 # --description--
 
 Você pode usar um elemento `hr` para exibir um divisor entre seções de conteúdo diferente.
 
-Primeiro, adicione um elemento `hr` entre o primeiro elemento `header` e o elemento `main`. Observe que os elementos `hr` fecham em si mesmos.
+Primeiro, adicione um elemento `hr` entre o elemento `p` com a classe `established` e o primeiro elemento `section`. Observe que os elementos `hr` fecham em si mesmos.
 
 # --hints--
 
@@ -20,10 +20,10 @@ assert(code.match(/<hr\s?\/?>/i));
 assert(!code.match(/<\/hr>/i));
 ```
 
-Você deve manter o elemento `header` preexistente.
+Você não deve alterar o elemento `p` existente com a classe `established`.
 
 ```js
-assert($('header').length === 1);
+assert($('p.established').length === 1);
 ```
 
 O elemento preexistente `main` deve permanecer o mesmo.
@@ -32,11 +32,11 @@ O elemento preexistente `main` deve permanecer o mesmo.
 assert($('main').length === 1);
 ```
 
-O elemento `hr` deve estar entre os elementos `header` e `main`.
+O elemento `hr` deve estar entre os elementos `p` e `section`.
 
 ```js
-assert($('hr')[0].previousElementSibling.tagName === 'HEADER');
-assert($('hr')[0].nextElementSibling.tagName === 'MAIN');
+assert($('hr')[0].previousElementSibling.tagName === 'P');
+assert($('hr')[0].nextElementSibling.tagName === 'SECTION');
 ```
 
 # --seed--
@@ -55,11 +55,9 @@ assert($('hr')[0].nextElementSibling.tagName === 'MAIN');
   <body>
     <div class="menu">
 --fcc-editable-region--
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
index 5ed3db3344b..251a59d6d11 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e03d719d5ac4738993
-title: Passo 57
+title: Passo 56
 challengeType: 0
-dashedName: step-57
+dashedName: step-56
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(menuMaxWidth === '500px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
index ea3d82fb1ff..7191df985e6 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e04559b939080db057
-title: Passo 56
+title: Passo 55
 challengeType: 0
-dashedName: step-56
+dashedName: step-55
 ---
 
 # --description--
@@ -64,11 +64,9 @@ assert(menuPadding === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
index 26b26855091..5c62f4262a5 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e050279c7a4a7101d3
-title: Passo 55
+title: Passo 54
 challengeType: 0
-dashedName: step-55
+dashedName: step-54
 ---
 
 # --description--
@@ -63,11 +63,9 @@ assert(menuPaddingBottom === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
index 48254b8946d..a0b1a0f8eab 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e05473f91f948724ab
-title: Passo 58
+title: Passo 57
 challengeType: 0
-dashedName: step-58
+dashedName: step-57
 ---
 
 # --description--
@@ -41,11 +41,9 @@ assert(bodyFontFamily === 'sans-serif');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
index 381b83c4e44..f1feebcb7cc 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e056bdde6ae6892ba2
-title: Passo 59
+title: Passo 58
 challengeType: 0
-dashedName: step-59
+dashedName: step-58
 ---
 
 # --description--
@@ -54,11 +54,9 @@ assert($('h2').css('font-family').match(/impact/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
index e4ff0623e10..160f69cce5f 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e06d34faac0447fc44
-title: Passo 61
+title: Passo 60
 challengeType: 0
-dashedName: step-61
+dashedName: step-60
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(establishedFontStyle === 'italic');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md
index 090e6d85417..fb0bd990910 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e07276f782bb46b93d
-title: Passo 64
+title: Passo 63
 challengeType: 0
-dashedName: step-64
+dashedName: step-63
 ---
 
 # --description--
@@ -51,12 +51,10 @@ assert(footer.previousElementSibling.tagName === 'MAIN');
   </head>
   <body>
     <div class="menu">
-      <header>
-        <h1>CAMPER CAFE</h1>
-        <p class="established">Est. 2020</p>
-      </header>
 --fcc-editable-region--
       <main>
+        <h1>CAMPER CAFE</h1>
+        <p class="established">Est. 2020</p>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
index 68ced4a569c..ddadaaad37a 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0819d4f23ca7285e6
-title: Passo 49
+title: Passo 48
 challengeType: 0
-dashedName: step-49
+dashedName: step-48
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('section')[1].children[1].className === 'item');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
index d48c44e2b61..2cba7fe481f 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e087d56ed3ffdc36be
-title: Passo 62
+title: Passo 61
 challengeType: 0
-dashedName: step-62
+dashedName: step-61
 ---
 
 # --description--
@@ -45,13 +45,11 @@ assert($('.established').css('font-style') === 'italic');
   </head>
   <body>
     <div class="menu">
+      <main>
 --fcc-editable-region--
-      <header>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
 --fcc-editable-region--
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
index 30be3e14600..8a6a387f291 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0a81099d9a697b550
-title: Passo 65
+title: Passo 64
 challengeType: 0
-dashedName: step-65
+dashedName: step-64
 ---
 
 # --description--
@@ -58,11 +58,9 @@ assert(document.querySelector("footer > p > a")?.href === "https://www.freecodec
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md
index a57e88a1464..38a28633bde 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0b431cc215bb16f55
-title: Passo 66
+title: Passo 65
 challengeType: 0
-dashedName: step-66
+dashedName: step-65
 ---
 
 # --description--
@@ -38,11 +38,9 @@ assert($('footer').children('p').last().text().match(/123 Free Code Camp Drive/i
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md
index bc15b158702..c6d476e4a49 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0e0c3feaebcf647ad
-title: Passo 48
+title: Passo 47
 challengeType: 0
-dashedName: step-48
+dashedName: step-47
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('h2')[1].innerText.match(/Desserts/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md
index bc28273c05a..b8d827ba3aa 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0e9629bad967cd71e
-title: Passo 60
+title: Passo 59
 challengeType: 0
-dashedName: step-60
+dashedName: step-59
 ---
 
 # --description--
@@ -35,11 +35,9 @@ assert(fontFamily === 'Impact, serif');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md
index 8a26cd9cb50..14e03f69d36 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0eaa7da26e3d34d78
-title: Passo 54
+title: Passo 53
 challengeType: 0
-dashedName: step-54
+dashedName: step-53
 ---
 
 # --description--
@@ -56,11 +56,9 @@ assert(menuPaddingRight === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md
index 5368082b4ff..9e6ae1d744d 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0f8c230bdd2349716
-title: Passo 63
+title: Passo 62
 challengeType: 0
-dashedName: step-63
+dashedName: step-62
 ---
 
 # --description--
@@ -56,11 +56,9 @@ assert(h2FontSize === '30px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
index b7baf5abff8..fa8ae461af8 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3f26fa39591db45e5cd7a0
-title: Passo 68
+title: Passo 67
 challengeType: 0
-dashedName: step-68
+dashedName: step-67
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(hrHeight === '3px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md
index 892910dd8b0..e6b5f087ade 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459225127805351a6ad057
-title: Passo 69
+title: Passo 68
 challengeType: 0
-dashedName: step-69
+dashedName: step-68
 ---
 
 # --description--
@@ -39,12 +39,10 @@ assert(hrBackgroundColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
index 3e875661394..6ab4568f843 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459a7ceb8b5c446656d88b
-title: Passo 70
+title: Passo 69
 challengeType: 0
-dashedName: step-70
+dashedName: step-69
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(hrBorderColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
index 230bab634d9..681eddd845a 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459cf202c2a3472fae6a9f
-title: Passo 71
+title: Passo 70
 challengeType: 0
-dashedName: step-71
+dashedName: step-70
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(hrHeight === '2px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
index 83dbc276e14..fa9541a4465 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459fd48bdc98491ca6d1a3
-title: Passo 72
+title: Passo 71
 challengeType: 0
-dashedName: step-72
+dashedName: step-71
 ---
 
 # --description--
@@ -39,13 +39,11 @@ assert($('hr')[1].nextElementSibling.tagName === 'FOOTER');
   </head>
   <body>
     <div class="menu">
-      <header>
-        <h1>CAMPER CAFE</h1>
-        <p class="established">Est. 2020</p>
-      </header>
-      <hr>
 --fcc-editable-region--
       <main>
+        <h1>CAMPER CAFE</h1>
+        <p class="established">Est. 2020</p>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md
index 05289b5c518..a5af2e02dc5 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a05977e2fa49d9119437
-title: Passo 73
+title: Passo 72
 challengeType: 0
-dashedName: step-73
+dashedName: step-72
 ---
 
 # --description--
@@ -39,12 +39,10 @@ assert(bodyPadding === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md
index 5c3f1d32d5b..ae1362104f4 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a276c093334f0f6e9df4
-title: Passo 74
+title: Passo 73
 challengeType: 0
-dashedName: step-74
+dashedName: step-73
 ---
 
 # --description--
@@ -63,12 +63,10 @@ assert(itemPMarginBottom === '5px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md
index 4987926bcf4..cd405a61740 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md
@@ -1,13 +1,13 @@
 ---
 id: 5f45a5a7c49a8251f0bdb527
-title: Passo 75
+title: Passo 74
 challengeType: 0
-dashedName: step-75
+dashedName: step-74
 ---
 
 # --description--
 
-Usando o mesmo seletor de estilo da etapa anterior, torne maior o tamanho da fonte dos itens e preços usando um valor de `18px`.
+Usando o mesmo seletor de estilo do passo anterior, torne maior o tamanho da fonte dos itens e preços usando um valor de `18px`.
 
 # --hints--
 
@@ -47,12 +47,10 @@ assert(itemPFontSize === '18px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md
index 4de7b60c23f..abed11a019a 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a66d4a2b0453301e5a26
-title: Passo 79
+title: Passo 78
 challengeType: 0
-dashedName: step-79
+dashedName: step-78
 ---
 
 # --description--
@@ -54,12 +54,10 @@ assert(footerFontSize === '14px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md
index 0477328400d..51534684e31 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b0731d39e15d54df4dfc
-title: Passo 80
+title: Passo 79
 challengeType: 0
-dashedName: step-80
+dashedName: step-79
 ---
 
 # --description--
@@ -48,12 +48,10 @@ assert(aColor === 'black');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md
index d2e0db5988c..6613e99d949 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b25e7ec2405f166b9de1
-title: Passo 81
+title: Passo 80
 challengeType: 0
-dashedName: step-81
+dashedName: step-80
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(aVisitedColor === 'grey' || aVisitedColor === 'gray');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md
index 6cc0d423392..970e5b03ed7 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b3c93c027860d9298dbd
-title: Passo 82
+title: Passo 81
 challengeType: 0
-dashedName: step-82
+dashedName: step-81
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(aHoverColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md
index 8ed233a36d8..fb3e5f11bdb 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b45d099f3e621fbbb256
-title: Passo 83
+title: Passo 82
 challengeType: 0
-dashedName: step-83
+dashedName: step-82
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(aActiveColor === 'white');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md
index b2e5b063d48..ffb3f9814a8 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b4c81cea7763550e40df
-title: Passo 84
+title: Passo 83
 challengeType: 0
-dashedName: step-84
+dashedName: step-83
 ---
 
 # --description--
@@ -40,12 +40,10 @@ assert(aActiveColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md
index c9912f93187..5a07b2e1a15 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b715301bbf667badc04a
-title: Passo 85
+title: Passo 84
 challengeType: 0
-dashedName: step-85
+dashedName: step-84
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(h1MarginTop === '0px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md
index 96d1ef327c8..5dfce5e2964 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e270702a8456a664f0df
-title: Passo 86
+title: Passo 85
 challengeType: 0
-dashedName: step-86
+dashedName: step-85
 ---
 
 # --description--
@@ -40,12 +40,10 @@ assert(h1MarginBottom === '15px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md
index 57f1f7c2179..044a8a457bf 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e36e745ead58487aabf2
-title: Passo 87
+title: Passo 86
 challengeType: 0
-dashedName: step-87
+dashedName: step-86
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(addressMarginBottom === '5px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md
index cdba18d8cec..8acf15fb29b 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e7a4750dd05b5a673920
-title: Passo 88
+title: Passo 87
 challengeType: 0
-dashedName: step-88
+dashedName: step-87
 ---
 
 # --description--
@@ -44,12 +44,10 @@ assert($('.address')[0].innerText.match(/123 Free Code Camp Drive/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md
index 452f41d050e..f0451f1479e 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e8284aae155c83015dee
-title: Passo 89
+title: Passo 88
 challengeType: 0
-dashedName: step-89
+dashedName: step-88
 ---
 
 # --description--
@@ -46,12 +46,10 @@ assert($('img').attr('alt').match(/coffee icon/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
 --fcc-editable-region--
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md
index d7e32d67830..7577e036409 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46ede1ff8fec5ba656b44c
-title: Passo 78
+title: Passo 77
 challengeType: 0
-dashedName: step-78
+dashedName: step-77
 ---
 
 # --description--
@@ -32,12 +32,10 @@ assert(code.match(/\/\*\s*FOOTER\s*\*\//i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md
index 220958bc395..9065d347e1f 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46fc57528aa1c4b5ea7c2e
-title: Passo 76
+title: Passo 75
 challengeType: 0
-dashedName: step-76
+dashedName: step-75
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(bottomLineMargin === '25px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md
index 2c48f9d95a3..853db676a60 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md
@@ -1,8 +1,8 @@
 ---
 id: 5f4701b942c824109626c3d8
-title: Passo 77
+title: Passo 76
 challengeType: 0
-dashedName: step-77
+dashedName: step-76
 ---
 
 # --description--
@@ -38,12 +38,10 @@ assert($('hr')[1].className === 'bottom-line');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
index 8b2646541e3..80e015e146e 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
@@ -1,8 +1,8 @@
 ---
 id: 5f475bb508746c16c9431d42
-title: Passo 90
+title: Passo 89
 challengeType: 0
-dashedName: step-90
+dashedName: step-89
 ---
 
 # --description--
@@ -72,12 +72,10 @@ assert(imgMarginRight === 'auto');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
index 67b0e244eb0..336a1e5d715 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f475e1c7f71a61d913836c6
-title: Passo 91
+title: Passo 90
 challengeType: 0
-dashedName: step-91
+dashedName: step-90
 ---
 
 # --description--
@@ -44,12 +44,10 @@ assert($('img').last().attr('alt').match(/pie icon/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md
index 26d5bce69a1..9e1b245b9ff 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f47633757ae3469f2d33d2e
-title: Passo 46
+title: Passo 45
 challengeType: 0
-dashedName: step-46
+dashedName: step-45
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(priceWidth === '25%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md
index b1a43c891ad..b9aeda82dc2 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f47fe7e31980053a8d4403b
-title: Passo 92
+title: Passo 91
 challengeType: 0
-dashedName: step-92
+dashedName: step-91
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(imgMarginTop === '-25px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
@@ -209,12 +207,10 @@ a:active {
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
index 67736ef5398..3cda74d2d3b 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
@@ -1,8 +1,8 @@
 ---
 id: 5f716ad029ee4053c7027a7a
-title: Passo 50
+title: Passo 49
 challengeType: 0
-dashedName: step-50
+dashedName: step-49
 ---
 
 # --description--
@@ -50,11 +50,9 @@ assert($('article').last().children('p')[1].innerText.match(/1\.50/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
index 8ddc00b4b3a..4b2c73662e5 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
@@ -1,8 +1,8 @@
 ---
 id: 5f716bee5838c354c728a7c5
-title: Passo 53
+title: Passo 52
 challengeType: 0
-dashedName: step-53
+dashedName: step-52
 ---
 
 # --description--
@@ -84,11 +84,9 @@ assert(!code.match(/<\/p>\s+<p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md
index ea4e259f6b4..e258d9aa415 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7691dafd882520797cd2f0
-title: Passo 44
+title: Passo 43
 challengeType: 0
-dashedName: step-44
+dashedName: step-43
 ---
 
 # --description--
@@ -32,11 +32,9 @@ assert(!code.match(/<\/p>\s+<p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md
index 0f57c507905..801c3a7271f 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7692f7c5b3ce22a57788b6
-title: Passo 45
+title: Passo 44
 challengeType: 0
-dashedName: step-45
+dashedName: step-44
 ---
 
 # --description--
@@ -62,11 +62,9 @@ assert(p[10] === price[4]);
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md
index c72418ac5f9..f66fcba1802 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f769541be494f25449b292f
-title: Passo 34
+title: Passo 33
 challengeType: 0
-dashedName: step-34
+dashedName: step-33
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(flavorTextAlign === 'left');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md
index 53d1514cf57..547ff482872 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md
@@ -1,8 +1,8 @@
 ---
 id: 5f76967fad478126d6552b0d
-title: Passo 35
+title: Passo 34
 challengeType: 0
-dashedName: step-35
+dashedName: step-34
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('.price')[0].innerText.match(/3\.00/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md
index 1302db046fd..b6887f482f7 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md
@@ -1,8 +1,8 @@
 ---
 id: 5f769702e6e33127d14aa120
-title: Passo 36
+title: Passo 35
 challengeType: 0
-dashedName: step-36
+dashedName: step-35
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('.price').css('text-align') === 'right');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md
index 085077a9e96..cabc0f9ab4a 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7b87422a560036fd03ccff
-title: Passo 51
+title: Passo 50
 challengeType: 0
-dashedName: step-51
+dashedName: step-50
 ---
 
 # --description--
@@ -50,11 +50,9 @@ assert(!code.match(/<\/p>\s+<p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
index e22dbf45b3c..0fe1d839193 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7b88d37b1f98386f04edc0
-title: Passo 52
+title: Passo 51
 challengeType: 0
-dashedName: step-52
+dashedName: step-51
 ---
 
 # --description--
@@ -35,11 +35,9 @@ assert(selector)
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md
index 23c496fccce..4c469b37513 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md
@@ -7,9 +7,7 @@ dashedName: step-5
 
 # --description--
 
-Finalmente, use a tag `viewport` `<meta>` para garantir que a página tenha a mesma aparência em todos os dispositivos.
-
-Adicione um elemento `meta` de fechamento automático dentro do elemento `head`. Dê a ele o atributo `name` definido como `viewport` e o atributo `content` definido como `width=device-width, initial-scale=1.0`.
+Adicione outro elemento `meta` de fechamento automático dentro do elemento `head`. Dê a ele o atributo `name` definido como `viewport` e o atributo `content` definido como `width=device-width, initial-scale=1.0` para que a página tenha a mesma aparência em todos os dispositivos.
 
 # --hints--
 
@@ -30,7 +28,8 @@ O novo elemento `meta` deve ter o atributo `name` definido como `viewport` e o a
 
 ```js
 const meta = [...document.querySelectorAll('meta')];
-const target = meta?.find(m => m?.getAttribute('name') === 'viewport' && m?.getAttribute('content') === 'width=device-width, initial-scale=1.0');
+const reValidContent = /^\s*width\s*=\s*device-width\s*,\s*initial-scale\s*=\s*1(?:\.0)?\s*$/;
+const target = meta?.find(m => m?.getAttribute('name') === 'viewport' && reValidContent.test(m?.getAttribute('content')));
 assert.exists(target);
 ```
 
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/617bb5624a75e86463b7e638.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/617bb5624a75e86463b7e638.md
index 1af8033477f..a3eac103396 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/617bb5624a75e86463b7e638.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/617bb5624a75e86463b7e638.md
@@ -7,7 +7,7 @@ dashedName: step-28
 
 # --description--
 
-<dfn>Cores secundárias</dfn> são as cores que você consegue quando você combina as cores primárias. Você pode ter notado algumas cores secundárias na última etapa quando você mudou os valores vermelho, verde e azul.
+<dfn>Cores secundárias</dfn> são as cores que você consegue quando você combina as cores primárias. Você pode ter notado algumas cores secundárias há pouco, quando você mudou os valores de vermelho, verde e azul.
 
 Para criar a primeira cor secundária, amarelo, atualize a função `rgb` na regra CSS de `.one` para combinar vermelho puro e verde puro.
 
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dfc811e12666b04be6f.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dfc811e12666b04be6f.md
index 6ca387148c5..827deeba75c 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dfc811e12666b04be6f.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-css-grid-by-building-a-magazine/61439dfc811e12666b04be6f.md
@@ -1,6 +1,6 @@
 ---
 id: 61439dfc811e12666b04be6f
-title: Etapa 13
+title: Passo 13
 challengeType: 0
 dashedName: step-13
 ---
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md
index 0f934686860..d9a0db66d56 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md
@@ -9,7 +9,7 @@ dashedName: step-5
 
 O HTML5 tem alguns elementos que identificam diferentes áreas de conteúdo. Essas elementos tornam seu HTML mais fácil de ler e ajudam com a otimização dos mecanismos de busca (SEO) e com a acessibilidade.
 
-Identifique a seção principal desta página adicionando uma tag `<main>` após o elemento `h1` e uma tag de fechamento `</main>` depois do elemento `p`.
+Identifique a seção principal desta página adicionando uma tag `<main>` antes do elemento `h1` e uma tag de fechamento `</main>` depois do elemento `p`.
 
 # --hints--
 
@@ -25,20 +25,20 @@ O elemento `main` deve ter uma tag de fechamento. As tags de fechamento têm um
 assert(code.match(/<\/main\>/));
 ```
 
-A tag de abertura do elemento `main` deve estar abaixo do elemento `h1`. Eles estão na ordem errada.
+A tag de abertura do elemento `main` deve estar abaixo do elemento `body`. Eles estão na ordem errada.
 
 ```js
 const main = document.querySelector('main');
-assert.equal(main?.previousElementSibling?.tagName, "H1");
+assert.equal(main?.previousElementSibling, null);
 ```
 
-A tag de abertura do elemento `main` deve estar acima do elemento `h2`. Eles estão na ordem errada.
+A tag de abertura do elemento `main` deve estar acima do elemento `h1`. Eles estão na ordem errada.
 
 ```js
-const collection = [...document.querySelectorAll('main,h2')].map(
+const collection = [...document.querySelectorAll('main,h1')].map(
   (node) => node.nodeName
 );
-assert(collection.indexOf('MAIN') < collection.indexOf('H2'));
+assert(collection.indexOf('MAIN') < collection.indexOf('H1'));
 ```
 
 A tag de fechamento do elemento `main` deve estar abaixo do elemento `p`. Eles estão na ordem errada.
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md
index 863944f062f..11c60feae11 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md
@@ -7,9 +7,9 @@ dashedName: step-6
 
 # --description--
 
-No passo anterior, você colocou o elemento `h2`, o comentário e o elemento `p` dentro do elemento `main`. Isso é chamado de *aninhamento*. Elementos aninhados devem ser colocados dois espaços mais à direita do elemento em qual estão aninhados. Este espaçamento é chamado de indentação e é usado para facilitar a leitura do HTML.
+No passo anterior, você colocou os elementos `h1` e `h2`, o comentário e os elementos `p` dentro do elemento `main`. Isso é chamado de *aninhamento*. Elementos aninhados devem ser colocados dois espaços mais à direita do elemento em qual estão aninhados. Este espaçamento é chamado de indentação e é usado para facilitar a leitura do HTML.
 
-O elemento `h2` e o comentário estão indentados dois espaços adiante do elemento `main` no código abaixo. Use a barra de espaço no seu teclado para adicionar mais dois espaços na frente do elemento `p` para que ele também seja indentado corretamente.
+Os elementos `h1` e `h2`, assim como o comentário, estão indentados dois espaços adiante do elemento `main` no código abaixo. Use a barra de espaço no seu teclado para adicionar mais dois espaços na frente do elemento `p` para que ele também seja indentado corretamente.
 
 # --hints--
 
@@ -34,7 +34,7 @@ assert(
 Você não deve alterar o recuo na linha com o elemento `h2`. A tag de abertura deve começar 6 espaços após o início da linha. Você pode reiniciar o passo para restaurar o recuo original.
 
 ```js
-assert(code.toLowerCase().match(/<main\>\s*\n\s{6}<h2>/));
+assert(code.toLowerCase().match(/<\/h1\>\s*\n\s{6}<h2>/));
 ```
 
 O código deve ter um comentário. Você excluiu o comentário de um passo anterior.
@@ -89,9 +89,9 @@ assert(code.toLowerCase().match(/-->\s*\n\s{6}<p>/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
---fcc-editable-region--
+    --fcc-editable-region--
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
     <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md
index c5eb857c7c0..5eeb9f61e5c 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md
@@ -47,8 +47,8 @@ assert(collection.indexOf('P') < collection.indexOf('IMG'));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md
index ccc70cf1bf4..05d3d36ae10 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md
@@ -46,8 +46,8 @@ assert(!/\<img\s+src\s*=\s*https:\/\/cdn\.freecodecamp\.org\/curriculum\/cat-pho
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md
index fd5f425ff50..b7014876e47 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md
@@ -44,8 +44,8 @@ assert(altText.match(/A cute orange cat lying on its back\.?$/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md
index 33aaeb31cff..bc8d71f9692 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md
@@ -64,8 +64,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md
index 8081b745103..cd8b6bad2f6 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md
@@ -41,8 +41,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md
index c993e07e66f..e52cfb8ab6c 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md
@@ -9,7 +9,7 @@ dashedName: step-12
 
 No passo anterior, você transformou as palavras `link to cat pictures` em um link, colocando-as entre as tags de abertura e fechamento de âncora (`a`). Você pode fazer o mesmo com as palavras dentro de um elemento, como em um elemento `p`.
 
-No texto do elemento `p`, transforme as palavras `cat photos` em um link para `https://freecatphotoapp.com` colocando essas palavras dentro das tags de abertura e fechamento de um elemento de âncora (`a`).
+No texto do elemento `p`, transforme as palavras `cat photos` em um link para `https://freecatphotoapp.com` adicionando as tags de abertura e fechamento de um elemento de âncora (`a`) ao redor dessas palavras.
 
 
 # --hints--
@@ -55,8 +55,8 @@ assert(pText.match(/click here to view more cat photos\.?$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md
index 247d9f20b3a..5d749b7598b 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md
@@ -40,8 +40,8 @@ assert(document.querySelector('a').getAttribute('target') === '_blank');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md
index 8dbe6a5baab..591ecd332cb 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md
@@ -73,8 +73,8 @@ assert(document.querySelector('img').parentNode.nodeName === 'A');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md
index 0f2998f84ef..c44aedf16ce 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md
index fb2e10e993d..e054973b11a 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md
@@ -64,8 +64,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md
index a0c1f35a4a6..61766b05e6a 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md
@@ -37,10 +37,10 @@ assert(secondSectionLastElemNode.nodeName === 'UL');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
-      <h2>Cat Photos</h2>
+        <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
         <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
         <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
index d32f1bea9f7..eff86b89bf7 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md
index 3909b044e79..70bb7608b64 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md
@@ -68,8 +68,8 @@ assert(!/\<img\s+.+\s+src\s*=\s*https:\/\/cdn\.freecodecamp\.org\/curriculum\/ca
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md
index 765d64b729c..cce2788fcf6 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md
@@ -48,11 +48,11 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
-      <h2>Cat Photos</h2>
-      <!-- TODO: Add link to cat photos -->
+        <h2>Cat Photos</h2>
+        <!-- TODO: Add link to cat photos -->
         <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
         <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
       </section>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md
index a43738d8125..a416e963dc2 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md
@@ -69,8 +69,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md
index 023684dff70..cd20d9919a8 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md
@@ -55,8 +55,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md
index aa64d3f200c..cdc4aa12905 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md
@@ -51,8 +51,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
index ff1f7c5a0dc..a11d442a8ce 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
@@ -62,8 +62,8 @@ assert.deepStrictEqual(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md
index 1314d7edb98..b2f622b02eb 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md
@@ -36,8 +36,8 @@ assert($('main > section')[1].lastElementChild.nodeName === 'FIGURE');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md
index eabb0471744..8fb103ff0f5 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
index 64c3229986a..d3941b11069 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
@@ -63,8 +63,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md
index 8363433f9ff..de31bf67a04 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md
@@ -45,8 +45,8 @@ assert($('form')[0].innerHTML.trim().length === 0);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md
index 9ef58cc519a..aeda1be25b3 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md
@@ -71,8 +71,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md
index 985a5ed6d2a..ec5a0990060 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md
@@ -64,8 +64,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md
index 37e9a900000..4c3fecf58bf 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md
@@ -58,8 +58,8 @@ assert(!/\<\s*input\s+placeholder\s*=\s*cat\s+photo\s+url/i.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md
index 31b17a2a6bd..603599f9667 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md
@@ -47,8 +47,8 @@ assert(collection.indexOf('INPUT') < collection.indexOf('BUTTON'));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md
index d1819eb43f1..1252d207809 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md
@@ -45,8 +45,8 @@ assert($('input')[0].getAttribute('required') === '');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
index 578bb295af5..e490d4365e6 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
@@ -90,8 +90,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
index 866de1f5f3e..ba1150fed45 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md
index 2c2c503dd34..e42dbad9b35 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md
@@ -57,8 +57,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md
index d5fdd1b561a..95e820cc046 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md
@@ -47,8 +47,8 @@ assert($('input')[0].id.match(/^indoor$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md
index 0e022e48ecf..651d57fba26 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md
@@ -53,8 +53,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
index 1acdfad0b03..db990e8529d 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
@@ -75,8 +75,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md
index f505c06a0de..a891201c1c1 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md
@@ -66,8 +66,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md
index 183bdea1ecd..d128145aec7 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md
@@ -59,8 +59,8 @@ assert(!$('input[type="checkbox"]')[2].hasAttribute('checked'));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md
index e3e468ddade..b9323b5ca88 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md
@@ -44,8 +44,8 @@ assert(document.querySelector('main').nextElementSibling.nodeName === 'FOOTER');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md
index 275ccf012c0..e0a54f20bec 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md
@@ -44,8 +44,8 @@ assert(extraSpacesRemoved.match(/No Copyright - freeCodeCamp\.org$/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md
index 070dffa5908..27713f8edb7 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md
@@ -55,8 +55,8 @@ assert(pText.match(/^no copyright - freecodecamp.org$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md
index b947776a249..9d5bf32ae45 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md
@@ -46,8 +46,8 @@ assert(noSpaces.match(/\<\/head\>\<body\>/));
 <html>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
index e90e8105b7c..c8666356faa 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
@@ -51,8 +51,8 @@ assert(document.title && document.title.toLowerCase() === 'catphotoapp');
   </head>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
index b2b7a10097d..6c92fdac5e5 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
@@ -44,8 +44,8 @@ assert(code.match(/<html\s+lang\s*=\s*('|")en\1\s*>/gi));
     <title>CatPhotoApp</title>
   </head>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md
index da8102b5e92..36f44f9d1c2 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md
@@ -38,8 +38,8 @@ assert(noSpaces.match(/^\<\!DOCTYPEhtml\>\<html/));
   </head>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md
index b5251a52f1d..87224278b7c 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md
@@ -61,8 +61,8 @@ assert(!/\<img\s+.+\s+src\s*=\s*https:\/\/cdn\.freecodecamp\.org\/curriculum\/ca
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md
index 1b32d48e7f6..da66b47e991 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md
@@ -60,8 +60,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md
index 70cdf6a5565..d5d48a7caa0 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md
@@ -84,8 +84,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md
index 22be61a3a92..4059b3f2376 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md
@@ -58,8 +58,8 @@ assert(!/\<input\s+type\s*=\s*text/.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md
index d2289b96188..6e44cbbbc0e 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md
@@ -54,8 +54,8 @@ assert(!/\<\s*button\s+type\s*=\s*submit/i.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
index bea808837ee..1c0428a1e74 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
@@ -80,8 +80,8 @@ assert(labelElem.textContent.replace(/\s/g, '').match(/Loving/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md
index 2cc08bd3252..53319657b57 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md
@@ -42,8 +42,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md
index 96724b2ba2b..a4bcb77b129 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md
@@ -30,8 +30,8 @@ assert($('input[type="checkbox"]')[0].id.match(/^loving$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md
index 4397d85d57f..a58871210b2 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md
@@ -67,8 +67,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
index 0b72ee435d3..36da50abe50 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
@@ -88,8 +88,8 @@ assert(code.match(/<\/label>\s*<label\s*>\s*<input [^>]+>\s*Outdoor/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md
index decc55b23f4..304fd7188c5 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md
@@ -9,7 +9,7 @@ dashedName: step-16
 
 Antes de adicionar conteúdo novo, você deve usar um elemento `section` para separar o conteúdo de fotos de gatos do resto do conteúdo.
 
-Pegue todos os elementos atualmente localizados no elemento `main` e aninhe-os em um elemento `section`.
+Faça com que os elementos `h2`, de comentário, `p` e âncora (`a`) fiquem aninhados em um elemento `section`.
 
 # --hints--
 
@@ -35,10 +35,18 @@ O elemento `h2`, o comentário, o elemento `p` e o elemento de âncora (`a`) dev
 
 ```js
 const childrenOfSection = [...document.querySelector('section').childNodes];
-const foundElems = childrenOfSection.filter((child) => {
+const foundElements = childrenOfSection.filter((child) => {
   return ['H2', 'A', 'P'].includes(child.nodeName);
 });
-assert(foundElems.length === 3);
+assert(foundElements.length === 3);
+```
+
+O elemento `h1` não deve estar dentro do elemento `section`.
+
+```js
+const childrenOfSection = [...document.querySelector('section').childNodes];
+const includesH1 = childrenOfSection.some((child) => child.nodeName === 'H1');
+assert.isFalse(includesH1);
 ```
 
 # --seed--
@@ -48,9 +56,9 @@ assert(foundElems.length === 3);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
---fcc-editable-region--
+    --fcc-editable-region--
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md
index f717cbb8d82..a86df2419c2 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md
@@ -64,8 +64,8 @@ assert(foundElems.length === 2);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
 --fcc-editable-region--
       <section>
         <h2>Cat Photos</h2>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md
index 44a24d2b7b1..c67e7597610 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md
@@ -58,37 +58,37 @@ assert($('main > section')[2].children.length === 0);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
-      <h2>Cat Photos</h2>
-      <!-- TODO: Add link to cat photos -->
-      <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
-      <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
+        <h2>Cat Photos</h2>
+        <!-- TODO: Add link to cat photos -->
+        <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
+        <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
       </section>
 --fcc-editable-region--
       <section>
-      <h2>Cat Lists</h2>
-      <h3>Things cats love:</h3>
-      <ul>
-        <li>cat nip</li>
-        <li>laser pointers</li>
-        <li>lasagna</li>
-      </ul>
-      <figure>
-        <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/lasagna.jpg" alt="A slice of lasagna on a plate.">
-        <figcaption>Cats <em>love</em> lasagna.</figcaption>  
-      </figure>
-      <h3>Top 3 things cats hate:</h3>
-      <ol>
-        <li>flea treatment</li>
-        <li>thunder</li>
-        <li>other cats</li>
-      </ol>
-      <figure>
-        <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/cats.jpg" alt="Five cats looking around a field.">
-        <figcaption>Cats <strong>hate</strong> other cats.</figcaption>  
-      </figure>
+        <h2>Cat Lists</h2>
+        <h3>Things cats love:</h3>
+        <ul>
+          <li>cat nip</li>
+          <li>laser pointers</li>
+          <li>lasagna</li>
+        </ul>
+        <figure>
+          <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/lasagna.jpg" alt="A slice of lasagna on a plate.">
+          <figcaption>Cats <em>love</em> lasagna.</figcaption>  
+        </figure>
+        <h3>Top 3 things cats hate:</h3>
+        <ol>
+          <li>flea treatment</li>
+          <li>thunder</li>
+          <li>other cats</li>
+        </ol>
+        <figure>
+          <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/cats.jpg" alt="Five cats looking around a field.">
+          <figcaption>Cats <strong>hate</strong> other cats.</figcaption>  
+        </figure>
       </section>
 --fcc-editable-region--
     </main>
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md
index b1b5909164c..386589bf3ec 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md
@@ -54,8 +54,8 @@ assert(extraSpacesRemoved.match(/Is your cat an indoor or outdoor cat\??$/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md
index c2589d0c732..f4eb9178469 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md
@@ -76,8 +76,8 @@ assert(fieldsetChildren[0].length > fieldsetChildren[1].length);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md
index 47ba423abc9..05d6e1ca3be 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md
@@ -60,8 +60,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md
index d690678aff7..b91ffc6b5a2 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md
@@ -60,8 +60,8 @@ assert(outdoorRadioButton.getAttribute('value').match(/^outdoor$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md
index c0e889574cb..f875c8a017a 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md
@@ -48,8 +48,8 @@ assert(energeticCheckbox.getAttribute('value').match(/^energetic$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md
index ee4926a964c..1c006107844 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md
@@ -37,8 +37,8 @@ assert.equal(document.querySelector('head > meta')?.getAttribute('charset')?.toL
   </head>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
@@ -106,8 +106,8 @@ assert.equal(document.querySelector('head > meta')?.getAttribute('charset')?.toL
     <title>CatPhotoApp</title>
   </head>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md
index 6afbeea3897..94ef8ea797a 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md
@@ -1,6 +1,6 @@
 ---
 id: 62dabe2ef403a12d5d295273
-title: Etapa 13
+title: Passo 13
 challengeType: 0
 dashedName: step-13
 ---
@@ -69,8 +69,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md
index 4fd0c7771dc..56fc905f4e7 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md
@@ -57,8 +57,8 @@ assert(!/\<\s*input\s+.*\s*=\s*catphotourl/.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md
index 72a70aaf2b5..e8c5ed0731a 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md
@@ -6,8 +6,9 @@ dashedName: step-8
 ---
 
 # --description--
+A unidade `vh` significa viewport height (altura da viewport) e é relativa a 1% da `height` (altura) da viewport.
 
-Para dar uma arrumada no projeto, vamos adicionar um pouco de CSS. Comece fornecendo ao `body` uma `width` de `100%`, e uma `height` de `100vh`.
+É hora de melhorar o projeto com um pouco de CSS. Comece fornecendo ao `body` uma `width` de `100%`, e uma `height` de `100vh`.
 
 # --hints--
 
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md
index 52531a6a26e..d9c890114a0 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md
@@ -6,6 +6,7 @@ dashedName: step-15
 ---
 
 # --description--
+A unidade `rem` significa root `em` e é relativa ao tamanho da fonte do elemento `html`.
 
 Como os elementos `label` estão em linha por padrão, serão exibidos lado a lado na mesma linha, tornando o texto difícil de ler. Para fazer com que apareçam em linhas separadas, adicione `display: block` ao elemento `label` e adicione uma `margin` de `0.5rem 0`, para separá-los um do outro.
 
diff --git a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f50473cc0196c6dd3892a.md b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f50473cc0196c6dd3892a.md
index 298944b05bd..b5963577d9b 100644
--- a/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f50473cc0196c6dd3892a.md
+++ b/curriculum/challenges/portuguese/14-responsive-web-design-22/learn-typography-by-building-a-nutrition-label/615f50473cc0196c6dd3892a.md
@@ -9,7 +9,7 @@ dashedName: step-28
 
 Você pode notar que ainda há uma pequena borda na parte inferior do seu elemento `.lg`. Para redefinir, dê ao seletor `.lg, .md` uma propriedade `border` definida como `0`.
 
-Observação: a classe `md` (médio) será utilizada na etapa 37 para as barras mais finas da etiqueta nutricional.
+Observação: a classe `md` (médio) será utilizada no passo 37 para as barras mais finas da etiqueta nutricional.
 
 # --hints--
 
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23d1c5f1c93161f3582ae.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23d1c5f1c93161f3582ae.md
index d5d8c611c5c..7d9867b26c7 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23d1c5f1c93161f3582ae.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a23d1c5f1c93161f3582ae.md
@@ -7,7 +7,7 @@ dashedName: step-6
 
 # --description--
 
-Similar to your `#stats` element, your `#monsterStats` element needs two `span` elements. Give them the class `stat` and give the first element the text `Monster Name: ` and the second the text `Health: `. After the text in each, add a `strong` element with an empty nested `span` element.
+Similar to your `#stats` element, your `#monsterStats` element needs two `span` elements. Give them the class `stat` and give the first element the text `Monster Name:` and the second the text `Health:`. After the text in each, add a `strong` element with an empty nested `span` element.
 
 # --hints--
 
@@ -26,14 +26,14 @@ assert.equal(spans[0].className, 'stat');
 assert.equal(spans[1].className, 'stat');
 ```
 
-Your first `span` element should have the text `Monster Name: `. Make sure the spacing is correct.
+Your first `span` element should have the text `Monster Name:`. Make sure the spacing is correct.
 
 ```js
 const spans = document.querySelectorAll(`#monsterStats > span`);
 assert.equal(spans[0].innerText, 'Monster Name: ');
 ```
 
-Your second `span` element should have the text `Health: `. Make sure the spacing is correct.
+Your second `span` element should have the text `Health:`. Make sure the spacing is correct.
 
 ```js
 const spans = document.querySelectorAll(`#monsterStats > span`);
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md
index 490ea3e8e2f..3cc2e9eb620 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md
@@ -14,7 +14,7 @@ const info = document.querySelector("#info");
 info.innerText = "Hello World";
 ```
 
-This code would change the element assigned to the `div` variable to have the text `Hello World`. 
+This code would change the element assigned to the `div` variable to have the text `Hello World`.
 
 When a player clicks your `Go to store` button, you want to change the buttons and text. Remove the code inside the `goStore` function and add a line that updates the text of `button1` to say `Buy 10 health (10 gold)`.
 
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md
index d5c3664e5ed..28ff0bb1ad6 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md
@@ -135,7 +135,7 @@ const monsterHealthText =document.querySelector("#monsterHealth");
 --fcc-editable-region--
 const locations = [
     {
-        
+
     }
 ];
 --fcc-editable-region--
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
index d91e6245ebe..8f9a534ce96 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
@@ -206,7 +206,7 @@ function buyWeapon() {
     gold -= 30;
     currentWeapon++;
     goldText.innerText = gold;
-    
+
     text.innerText = "You now have a new weapon.";
   }
 }
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
index 4b1f8fb6cb6..95d244d0f28 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
@@ -7,7 +7,7 @@ dashedName: step-90
 
 # --description--
 
-You can insert variables into a string with the <dfn>concatenation operator</dfn> `+`. Update the `You now have a new weapon.` string to say `You now have a ` and the name of the new weapon. Remember to end the sentence with a period.
+You can insert variables into a string with the <dfn>concatenation operator</dfn> `+`. Update the `You now have a new weapon.` string to say `You now have a` and the name of the new weapon. Remember to end the sentence with a period.
 
 Here is an example that creates the string `Hello, our name is freeCodeCamp.`:
 
@@ -18,7 +18,7 @@ const ourStr = "Hello, our name is " + ourName + ".";
 
 # --hints--
 
-You should update the `text.innerText` assignment to start with the string `You now have a `.
+You should update the `text.innerText` assignment to start with the string `You now have a`.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*=\s*('|")You now have a \1/);
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
index 748ab4d2f08..0adfafd5584 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
@@ -214,7 +214,7 @@ function buyWeapon() {
     goldText.innerText = gold;
     let newWeapon = weapons[currentWeapon].name;
     text.innerText = "You now have a " + newWeapon + ".";
-    
+
   }
 }
 --fcc-editable-region--
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
index b7219fb9be1..4037d95c48c 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
@@ -7,7 +7,7 @@ dashedName: step-92
 
 # --description--
 
-Up until now, any time `text.innerText` was updated the old text was erased. This time, use the `+=` operator to add text to the end of `text.innerText`. Add the string ` In your inventory you have: ` - include the spaces at the beginning and the end.
+Up until now, any time `text.innerText` was updated the old text was erased. This time, use the `+=` operator to add text to the end of `text.innerText`. Add the string `In your inventory you have:` - include the spaces at the beginning and the end.
 
 # --hints--
 
@@ -24,7 +24,7 @@ You should use the `+=` operator to add to `text.innerText`.
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*/)
 ```
 
-You should add the string ` In your inventory you have: ` to the end of `text.innerText`. Mind the spaces!
+You should add the string `In your inventory you have:` to the end of `text.innerText`. Mind the spaces!
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*('|")\sIn your inventory you have:\s\1/)
@@ -203,7 +203,7 @@ function buyWeapon() {
     let newWeapon = weapons[currentWeapon].name;
     text.innerText = "You now have a " + newWeapon + ".";
     inventory.push(newWeapon);
-    
+
   }
 }
 --fcc-editable-region--
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
index 098be4a56e6..908c77e836c 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
@@ -11,7 +11,7 @@ At the end of the second `text.innerText` string you just added, use the concate
 
 # --hints--
 
-You should not change the ` In your inventory you have: ` string.
+You should not change the `In your inventory you have:` string.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*('|")\sIn your inventory you have:\s\1/)
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
index 03e5cceea99..59e7717ce5b 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
@@ -7,7 +7,7 @@ dashedName: step-105
 
 # --description--
 
-After your `currentWeapon`, use the concatenation operator to set `text.innerText` to the string `You sold a `, then `currentWeapon`, then the string `.`.
+After your `currentWeapon`, use the concatenation operator to set `text.innerText` to the string `You sold a`, then `currentWeapon`, then the string `.`.
 
 # --hints--
 
@@ -17,13 +17,13 @@ You should use the assignment operator with `text.innerText`.
 assert.match(sellWeapon.toString(), /text\.innerText\s*=/);
 ```
 
-You should add `You sold a ` to `text.innerText`. Spacing is important.
+You should add `You sold a` to `text.innerText`. Spacing is important.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*=\s*('|")You sold a \1/);
 ```
 
-You should add the value of `currentWeapon` to the `You sold a ` string. Use the concatenation operator to do this on the same line.
+You should add the value of `currentWeapon` to the `You sold a` string. Use the concatenation operator to do this on the same line.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*=\s*('|")You sold a\s\1\s*\+\s*\_currentWeapon/);
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
index bc8435faa22..ab3661c3b47 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
@@ -7,7 +7,7 @@ dashedName: step-106
 
 # --description--
 
-Now use the `+=` operator to add the string ` In your inventory you have: ` and the contents of `inventory` to the `text.innerText`. Make sure to include the space at the beginning and end of the ` In your inventory you have: ` string.
+Now use the `+=` operator to add the string `In your inventory you have:` and the contents of `inventory` to the `text.innerText`. Make sure to include the space at the beginning and end of the `In your inventory you have:` string.
 
 # --hints--
 
@@ -25,7 +25,7 @@ const matches = sellWeapon.toString().match(/text\.innerText\s*\+=/g);
 assert.equal(matches.length, 1);
 ```
 
-You should add the string ` In your inventory you have: ` to the second `text.innerText` line. Spacing matters.
+You should add the string `In your inventory you have:` to the second `text.innerText` line. Spacing matters.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*\+=\s*('|") In your inventory you have: \1/);
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
index 229ca08f2a2..d332dfa1870 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
@@ -17,19 +17,19 @@ You should use dot notation to access the `innerText` property of `text`.
 assert.match(attack.toString(), /text\.innerText/);
 ```
 
-You should assign the string `The ` to `innerText` property of `text`.
+You should assign the string `The` to `innerText` property of `text`.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1/);
 ```
 
-You should use the concatenation operator to add the value of `monsters[fighting].name` to the `The ` string.
+You should use the concatenation operator to add the value of `monsters[fighting].name` to the `The` string.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1\s*\+\s*monsters\[fighting\]\.name/);
 ```
 
-You should use the concatenation operator to add the string ` attacks.` to the `monsters[fighting].name` string.
+You should use the concatenation operator to add the string `attacks.` to the `monsters[fighting].name` string.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1\s*\+\s*monsters\[fighting\]\.name\s*\+\s*('|") attacks\.\2/);
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
index 6566de3802a..a96685f85e9 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
@@ -7,7 +7,7 @@ dashedName: step-119
 
 # --description--
 
-On a new line, add the string ` You attack it with your [weapon].` to the `text` value, replacing `[weapon]` with the player's current weapon.
+On a new line, add the string `You attack it with your [weapon].` to the `text` value, replacing `[weapon]` with the player's current weapon.
 
 # --hints--
 
@@ -24,7 +24,7 @@ You should use compound assignment with `text.innerText`.
 assert.match(attack.toString(), /text\.innerText\s*\+=/);
 ```
 
-You should add the string ` You attack it with your ` to the `text.innerText` value. Remember that spacing matters.
+You should add the string `You attack it with your` to the `text.innerText` value. Remember that spacing matters.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|") You attack it with your \1/);
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
index a2c6fde768a..5e0e6059dff 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
@@ -279,7 +279,7 @@ function attack() {
   text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
   health -= monsters[fighting].level;
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
index acf1efd38b0..055ca35f7fe 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
@@ -275,7 +275,7 @@ function attack() {
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
   healthText.innerText = health;
   monsterHealthText.innerText = monsterHealth;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
index 3524f53b4a3..74b7964b09f 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
@@ -11,7 +11,7 @@ Inside the `dodge` function, set `text.innerText` equal to the string `You dodge
 
 # --hints--
 
-You should assign the string `You dodge the attack from the ` to the `text.innerText` property. Remember that spacing matters.
+You should assign the string `You dodge the attack from the` to the `text.innerText` property. Remember that spacing matters.
 
 ```js
 assert.match(dodge.toString(), /text\.innerText\s*=\s*('|")You dodge the attack from the \1/);
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
index cb9eadcb3ec..c2913614de6 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
@@ -283,7 +283,7 @@ function dodge() {
 function defeatMonster() {
   gold += Math.floor(monsters[fighting].level * 6.7);
   xp += monsters[fighting].level;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
index ca92f837431..0101b5e2285 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
@@ -285,7 +285,7 @@ function defeatMonster() {
   xp += monsters[fighting].level;
   goldText.innerText = gold;
   xpText.innerText = xp;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
index dd0068655fd..93d46489227 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
@@ -10,7 +10,7 @@ dashedName: step-132
 Your `locations` array doesn't have a fifth element, so `locations[4]` doesn't work. Add a new object at the end of the `locations` array, following the same structure as the other objects. Set `name` to `kill monster`, set `button text` to an array with three `Go to town square` strings, set `button functions` to an array with three `goTown` variables, and set `text` to `The monster screams Arg! as it dies. You gain experience points and find gold.`.
 
 # --hints--
- 
+
 Your `locations` array should have five values.
 
 ```js
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
index 3e9df421573..6b3bc12e219 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
@@ -280,7 +280,7 @@ function attack() {
   text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
   health -= getMonsterAttackValue(monsters[fighting].level);
   if (isMonsterHit()) {
-    
+
   }
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
   healthText.innerText = health;
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
index 88836e37794..8bf8c85ac0e 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
@@ -7,7 +7,7 @@ dashedName: step-150
 
 # --description--
 
-Add an `else` statement to your `if` statement. In the `else` statement, use the `+=` operator to add the text ` You miss.` to the end of `text.innerText`.
+Add an `else` statement to your `if` statement. In the `else` statement, use the `+=` operator to add the text `You miss.` to the end of `text.innerText`.
 
 # --hints--
 
@@ -17,7 +17,7 @@ You should add an `else` block after your `if (isMonsterHit())` block.
 assert.match(attack.toString(), /if\s*\(isMonsterHit\(\)\s*\)\s*\{\s*monsterHealth\s*-=\s*weapons\[currentWeapon\]\.power\s*\+\s*Math\.floor\(Math\.random\(\)\s*\*\s*xp\)\s*\+\s*1;\s*\}\s*else/)
 ```
 
-You should add the text ` You miss.` to the end of `text.innerText`. Remember to use compound assignment.
+You should add the text `You miss.` to the end of `text.innerText`. Remember to use compound assignment.
 
 ```js
 assert.match(attack.toString(), /if\s*\(isMonsterHit\(\)\s*\)\s*\{\s*monsterHealth\s*-=\s*weapons\[currentWeapon\]\.power\s*\+\s*Math\.floor\(Math\.random\(\)\s*\*\s*xp\)\s*\+\s*1;\s*\}\s*else\s*\{\s*text\.innerText\s*\+=\s*('|")\sYou miss\.\1/)
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
index 4210b69f7a8..73ec9b3bfdc 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
@@ -7,7 +7,7 @@ dashedName: step-154
 
 # --description--
 
-Use the `+=` operator to add ` Your [weapon] breaks.` to the end of `text.innerText`, replacing `weapon` with the last item in the `inventory` array. You can get this last item by using `inventory.pop()`, which will remove the last item in the array AND return it so it appears in your string.
+Use the `+=` operator to add `Your [weapon] breaks.` to the end of `text.innerText`, replacing `weapon` with the last item in the `inventory` array. You can get this last item by using `inventory.pop()`, which will remove the last item in the array AND return it so it appears in your string.
 
 # --hints--
 
@@ -24,20 +24,20 @@ You should use the `pop` method on the `inventory` array.
 assert.match(attack.toString(), /inventory\.pop\(\)/);
 ```
 
-You should add the string " Your " to `text.innerText`. Remember that spacing matters.
+Você deve adicionar a string " Your " a `text.innerText`. Remember that spacing matters.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1/);
 ```
 
-You should add the return value of `inventory.pop()` to the ` Your ` string.
+You should add the return value of `inventory.pop()` to the `Your` string.
 
 ```js
 console.log(attack.toString());
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1\s*\+\s*inventory\.pop\(\)/);
 ```
 
-You should add ` breaks.` to the ` "Your " + inventory.pop()` string.
+You should add `breaks.` to the `"Your " + inventory.pop()` string.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1\s*\+\s*inventory\.pop\(\)\s*\+\s*('|")\sbreaks\.\2/);
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
index b043a04a1a5..bb3a88b2824 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
@@ -375,7 +375,7 @@ function pickEight() {
 --fcc-editable-region--
 function pick(guess) {
   let numbers = [];
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
index ac85513b88f..c0e732491ac 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
@@ -11,13 +11,13 @@ After the `while` loop, set `text.innerText` to equal `You picked [guess]. Here
 
 # --hints--
 
-You should set `text.innerText` to the string `You picked `. Remember that spacing matters.
+You should set `text.innerText` to the string `You picked`. Remember that spacing matters.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1/);
 ```
 
-You should use the concatenation operator to add the value of the `guess` parameter to your `You picked ` string.
+You should use the concatenation operator to add the value of the `guess` parameter to your `You picked` string.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1\s*\+\s*guess/);
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
index 3b20e162326..7b34447692f 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
@@ -11,7 +11,7 @@ Before the final quote in that string you added, insert the new line escape char
 
 # --hints--
 
-You should add the new line escape character `\n` to your `. Here are the random numbers: ` string.
+You should add the new line escape character `\n` to your `. Here are the random numbers:` string.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1\s*\+\s*guess\s*\+\s*('|")\.\sHere are the random numbers:\\n\2/);
diff --git a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
index 180270940d6..c57f4d75914 100644
--- a/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
+++ b/curriculum/challenges/portuguese/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
@@ -369,7 +369,7 @@ function pick(guess) {
     numbers.push(Math.floor(Math.random() * 11));
   }
   text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md
index cd81f870cfa..06f4a95515c 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md
@@ -8,7 +8,7 @@ dashedName: falsy-bouncer
 
 # --description--
 
-Видалити всі неправильні значення з масиву.
+Remove all falsy values from an array. Return a new array; do not mutate the original array.
 
 Неправильні значення в JavaScript: `false`, `null`, `0`, `""`, `undefined`, і `NaN`.
 
@@ -40,6 +40,14 @@ assert.deepEqual(bouncer([false, null, 0, NaN, undefined, '']), []);
 assert.deepEqual(bouncer([null, NaN, 1, 2, undefined]), [1, 2]);
 ```
 
+You should not mutate `arr`.
+
+```js
+const arr = ['a', false, 0, 'Naomi'];
+bouncer(arr);
+assert.deepEqual(arr, ['a', false, 0, 'Naomi'])
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/access-array-data-with-indexes.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/access-array-data-with-indexes.md
index d4d6a1d7e4e..3a1f17aae33 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/access-array-data-with-indexes.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/access-array-data-with-indexes.md
@@ -19,21 +19,19 @@ dashedName: access-array-data-with-indexes
 
 ```js
 const array = [50, 60, 70];
-array[0];
+console.log(array[0]);
 const data = array[1];
 ```
 
-`array[0]` становить `50`, і`data` має значення `60`.
-
-**Примітка:** ніколи не вставляйте пробіл між ім'ям масиву і квадратними дужками, наприклад `array [0]`. Хоча JavaScript прочитає це правильно, але це може створити труднощі для інших програмістів, які читатимуть ваш код.
+The `console.log(array[0])` prints `50`, and `data` has the value `60`.
 
 # --instructions--
 
-Створіть змінну з назвою `myData` і встановіть її значення рівне до першому елементу `myArray`, використовуючи квадратні дужки.
+Create a variable called `myData` and set it to equal the first value of `myArray` using bracket notation.
 
 # --hints--
 
-Змінна `myData` повинна дорівнювати першому значенню `myArray`.
+The variable `myData` should equal the first value of `myArray`.
 
 ```js
 assert(
@@ -51,7 +49,7 @@ assert(
 );
 ```
 
-До даних в змінній `myArray` слід отримати доступ за допомогою індексу у квадратних дужках.
+The data in variable `myArray` should be accessed using bracket notation.
 
 ```js
 assert(
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/access-multi-dimensional-arrays-with-indexes.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/access-multi-dimensional-arrays-with-indexes.md
index 7a781fa9987..c0f403a62f4 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/access-multi-dimensional-arrays-with-indexes.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/access-multi-dimensional-arrays-with-indexes.md
@@ -21,12 +21,12 @@ const arr = [
   [[10, 11, 12], 13, 14]
 ];
 
-arr[3];
-arr[3][0];
-arr[3][0][1];
+const subarray = arr[3];
+const nestedSubarray = arr[3][0];
+const element = arr[3][0][1];
 ```
 
-`arr[3]` є `[[10, 11, 12], 13, 14]`, `arr[3][0]` є `[10, 11, 12]`, і `arr[3][0][1]` є `11`.
+In this example, `subarray` has the value `[[10, 11, 12], 13, 14]`, `nestedSubarray` has the value `[10, 11, 12]`,   and `element` has the value `11` .
 
 **Примітка:** ніколи не вставляйте пробіл між ім'ям масиву і квадратними дужками, наприклад, так `array [0][0]` і навіть так `array [0] [0]` не можна робити. Незважаючи на те, що для JavaScript це є дрібницею, ця звичка може ускладнити читання коду іншими програмістами.
 
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-object-properties-with-variables.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-object-properties-with-variables.md
index 8089c51ba6f..76dfd9efba5 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-object-properties-with-variables.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-object-properties-with-variables.md
@@ -27,63 +27,45 @@ console.log(myBreed);
 
 У консолі відображатиметься рядок `Doberman`.
 
-Інший спосіб, у який можна використовувати цей метод, - коли назви властивостей активно накопичуються протягом роботи у програмі, як показано далі:
-
-```js
-const someObj = {
-  propName: "John"
-};
-
-function propPrefix(str) {
-  const s = "prop";
-  return s + str;
-}
-
-const someProp = propPrefix("Name");
-console.log(someObj[someProp]);
-```
-
-`someProp` матиме значення рядка `propName`, і рядок `John` відображатиметься в консолі.
-
-Зверніть увагу, що ми *не* використовуємо лапки із змінними назвами, коли нам потрібен доступ до властивостей, тому що ми використовуємо *значення* змінної, а не її *назву*.
+Note that we do *not* use quotes around the variable name when using it to access the property because we are using the *value* of the variable, not the *name*.
 
 # --instructions--
 
-Вкажіть, що `playerNumber` може змінюватися до `16`. Потім використовуйте змінну для пошуку імені гравця та закріпіть її за `player`.
+Set the `playerNumber` variable to `16`. Then, use the variable to look up the player's name and assign it to `player`.
 
 # --hints--
 
-`playerNumber` має бути числом
+`playerNumber` should be a number
 
 ```js
 assert(typeof playerNumber === 'number');
 ```
 
-Змінна `player` повинна бути рядком
+The variable `player` should be a string
 
 ```js
 assert(typeof player === 'string');
 ```
 
-Значення `player` повинне бути рядком `Montana`
+The value of `player` should be the string `Montana`
 
 ```js
 assert(player === 'Montana');
 ```
 
-Використовуйте дужкову нотацію, щоб отримати доступ до `testObj`
+You should use bracket notation to access `testObj`
 
 ```js
 assert(/testObj\s*?\[.*?\]/.test(code));
 ```
 
-Значення `Montana` не можна закріплювати безпосередньо за змінною `player`.
+You should not assign the value `Montana` to the variable `player` directly.
 
 ```js
 assert(!code.match(/player\s*=\s*"|\'\s*Montana\s*"|\'\s*;/gi));
 ```
 
-Слід використовувати змінну `playerNumber` у квадратних дужках
+You should be using the variable `playerNumber` in your bracket notation
 
 ```js
 assert(/testObj\s*?\[\s*playerNumber\s*\]/.test(code));
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/assignment-with-a-returned-value.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/assignment-with-a-returned-value.md
index 21ecd65d53a..a30cff0f9dc 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/assignment-with-a-returned-value.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/assignment-with-a-returned-value.md
@@ -9,7 +9,7 @@ dashedName: assignment-with-a-returned-value
 
 # --description--
 
-Якщо Ви пригадаєте з нашого обговорення [Storing Values with the Assignment Operator](/learn/javascript-algorithms-and-data-structures/basic-javascript/storing-values-with-the-assignment-operator), все, що знаходиться справа від знака рівності визначається ще до того, як присвоюється значення. Це означає, що ми можемо взяти повернене значення функції та присвоїти її змінній.
+If you'll recall from our discussion about <a href="/learn/javascript-algorithms-and-data-structures/basic-javascript/storing-values-with-the-assignment-operator" target="_blank" rel="noopener noreferrer nofollow">Storing Values with the Assignment Operator</a>, everything to the right of the equal sign is resolved before the value is assigned. Це означає, що ми можемо взяти повернене значення функції та присвоїти її змінній.
 
 Припустимо, у нас уже є визначена функція `sum`, яка додає два числа, тоді:
 
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comment-your-javascript-code.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comment-your-javascript-code.md
index 906385c3af7..cdaf36a5d38 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comment-your-javascript-code.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comment-your-javascript-code.md
@@ -27,7 +27,7 @@ dashedName: comment-your-javascript-code
 multi-line comment */
 ```
 
-**ПРИМІТКА:**, написавши код, вам слід постійно додавати коментарі, щоб уточнити функцію частин вашого коду. Хороші і якісні коментарі допоможуть допомогти розібратись в значенні вашого коду - як для іншим людям, так і *and* для вас у майбутньому.
+**ПРИМІТКА:**, написавши код, вам слід постійно додавати коментарі, щоб уточнити функцію частин вашого коду. Хороші і якісні коментарі можуть допомогти передати мету вашого коду – як для інших людей, *так і* для себе в майбутньому.
 
 # --instructions--
 
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-equality-operator.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-equality-operator.md
index 651c8fa8ca8..b7e763afd11 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-equality-operator.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-equality-operator.md
@@ -25,39 +25,37 @@ function equalityTest(myVal) {
 Якщо `myVal` рівнозначний `10`, оператор рівності видає `true`, тож код у фігурних дужках виконається, і функція буде `Equal`. В іншому випадку, функція буде `Not Equal`. Для того, щоб JavaScript порівняв два різні <dfn>типи даних</dfn> (наприклад, `numbers` і `strings`), потрібно конвертувати один тип в інший. Це називається Перетворення Типів. Однак, після його виконання поняття порівнюються наступним чином:
 
 ```js
-1   ==  1
-1   ==  2
-1   == '1'
-"3" ==  3
+1   ==  1  // true
+1   ==  2  // false
+1   == '1' // true
+"3" ==  3  // true
 ```
 
-У такому ж порядку, як вони є, ці вирази будуть оцінені, як `true`, `false`, `true`, і `true`.
-
 # --instructions--
 
-Додайте оператор рівності до зазначеного рядка, щоб функція визначила рядок, як `Equal`, коли `val` еквівалентна `12`.
+Add the equality operator to the indicated line so that the function will return the string `Equal` when `val` is equivalent to `12`.
 
 # --hints--
 
-`testEqual(10)` повинен повернути рядок `Not Equal`
+`testEqual(10)` should return the string `Not Equal`
 
 ```js
 assert(testEqual(10) === 'Not Equal');
 ```
 
-`testEqual(12)` повинен повернути рядок `Equal`
+`testEqual(12)` should return the string `Equal`
 
 ```js
 assert(testEqual(12) === 'Equal');
 ```
 
-`testEqual("12")` повинен повернути рядок `Equal`
+`testEqual("12")` should return the string `Equal`
 
 ```js
 assert(testEqual('12') === 'Equal');
 ```
 
-Слід використовувати оператор `==`
+You should use the `==` operator
 
 ```js
 assert(code.match(/==/g) && !code.match(/===/g));
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-greater-than-operator.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-greater-than-operator.md
index 6fe33d7e394..e9a0e6445ed 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-greater-than-operator.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-greater-than-operator.md
@@ -16,21 +16,19 @@ dashedName: comparison-with-the-greater-than-operator
 **Приклади**
 
 ```js
-5   >  3
-7   > '3'
-2   >  3
-'1' >  9
+5   >  3  // true
+7   > '3' // true
+2   >  3  // false
+'1' >  9  // false
 ```
 
-По-порядку, ці вирази оцінюватимуться як `true`, `true`, `false`, та `false`.
-
 # --instructions--
 
-Додайте оператор «більше ніж» до вказаних рядків, щоб оператор повернення спрацював.
+Add the greater than operator to the indicated lines so that the return statements make sense.
 
 # --hints--
 
-`GreaterThan(0)` має повернути рядок `10 або Under`
+`testGreaterThan(0)` має повернути рядок `10 or Under`
 
 ```js
 assert(testGreaterThan(0) === '10 or Under');
@@ -72,7 +70,7 @@ assert(testGreaterThan(101) === 'Over 100');
 assert(testGreaterThan(150) === 'Over 100');
 ```
 
-Ви повинні використати оператор `>` принаймні двічі
+You should use the `>` operator at least twice
 
 ```js
 assert(code.match(/val\s*>\s*('|")*\d+('|")*/g).length > 1);
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-greater-than-or-equal-to-operator.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-greater-than-or-equal-to-operator.md
index c2f18748b26..0c3ac040fe7 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-greater-than-or-equal-to-operator.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-greater-than-or-equal-to-operator.md
@@ -16,63 +16,61 @@ dashedName: comparison-with-the-greater-than-or-equal-to-operator
 **Наприклад**
 
 ```js
-6   >=  6
-7   >= '3'
-2   >=  3
-'7' >=  9
+6   >=  6  // true
+7   >= '3' // true
+2   >=  3  // false
+'7' >=  9  // false
 ```
 
-У такому ж порядку, як вони є, ці вирази будуть оцінені, як `true`, `true`, `false`, і `false`.
-
 # --instructions--
 
-Додайте оператор "більше ніж дорівнює" до зазначених рядків, щоб оператор повернення мав сенс.
+Add the greater than or equal to operator to the indicated lines so that the return statements make sense.
 
 # --hints--
 
-`testGreaterOrEqual(0)` повинен повернути рядок `Less than 10`
+`testGreaterOrEqual(0)` має повертати рядок `Less than 10`
 
 ```js
 assert(testGreaterOrEqual(0) === 'Less than 10');
 ```
 
-`testGreaterOrEqual(9)` повинен повернути рядок `Less than 10`
+`testGreaterOrEqual(9)` має повертати рядок `Less than 10`
 
 ```js
 assert(testGreaterOrEqual(9) === 'Less than 10');
 ```
 
-`testGreaterOrEqual(10)` повинен повернути рядок `10 or Over`
+`testGreaterOrEqual(10)` має повертати рядок `10 or Over`
 
 ```js
 assert(testGreaterOrEqual(10) === '10 or Over');
 ```
 
-`testGreaterOrEqual(11)` повинен повернути рядок `10 or Over`
+`testGreaterOrEqual(11)` має повертати рядок `10 or Over`
 
 ```js
 assert(testGreaterOrEqual(11) === '10 or Over');
 ```
 
-`testGreaterOrEqual(19)` повинен повернути рядок `10 or Over`
+`testGreaterOrEqual(19)` має повертати рядок `10 or Over`
 
 ```js
 assert(testGreaterOrEqual(19) === '10 or Over');
 ```
 
-`testGreaterOrEqual(100)` повинен повернути рядок `20 or Over`
+`testGreaterOrEqual(100)` має повертати рядок `20 or Over`
 
 ```js
 assert(testGreaterOrEqual(100) === '20 or Over');
 ```
 
-`testGreaterOrEqual(21)` повинен повернути рядок `20 or Over`
+`testGreaterOrEqual(21)` має повертати рядок `20 or Over`
 
 ```js
 assert(testGreaterOrEqual(21) === '20 or Over');
 ```
 
-Слід використовувати оператор `>=` принаймні двічі
+You should use the `>=` operator at least twice
 
 ```js
 assert(code.match(/val\s*>=\s*('|")*\d+('|")*/g).length > 1);
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-inequality-operator.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-inequality-operator.md
index c83a2270215..1a88f8a6761 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-inequality-operator.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-inequality-operator.md
@@ -14,18 +14,16 @@ dashedName: comparison-with-the-inequality-operator
 **Наприклад**
 
 ```js
-1 !=  2
-1 != "1"
-1 != '1'
-1 != true
-0 != false
+1 !=  2    // true
+1 != "1"   // false
+1 != '1'   // false
+1 != true  // false
+0 != false // false
 ```
 
-У такому ж порядку, як вони є, ці вирази будуть оцінені, як `true`, `false`, `false`, `false` і `false`.
-
 # --instructions--
 
-Додайте оператора нерівності `!=` до команди `if`, щоб функція повернула рядок `Not Equal`, коли `val` не дорівнює `99`.
+Add the inequality operator `!=` in the `if` statement so that the function will return the string `Not Equal` when `val` is not equivalent to `99`.
 
 # --hints--
 
@@ -59,7 +57,7 @@ assert(testNotEqual('12') === 'Not Equal');
 assert(testNotEqual('bob') === 'Not Equal');
 ```
 
-Слід використовувати оператор `!=`
+You should use the `!=` operator
 
 ```js
 assert(code.match(/(?!!==)!=/));
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-less-than-operator.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-less-than-operator.md
index 38ac8eb9fd5..436963ac208 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-less-than-operator.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-less-than-operator.md
@@ -14,58 +14,56 @@ dashedName: comparison-with-the-less-than-operator
 **Наприклад:**
 
 ```js
-2   < 5
-'3' < 7
-5   < 5
-3   < 2
-'8' < 4
+2   < 5 // true
+'3' < 7 // true
+5   < 5 // false
+3   < 2 // false
+'8' < 4 // false
 ```
 
-Відповідно, ці вирази будуть оцінені як `true`, `true`, `false`, `false`, та `false`.
-
 # --instructions--
 
-Додайте оператор "менше ніж" до вказаних рядків, щоб оператор повернення спрацював.
+Add the less than operator to the indicated lines so that the return statements make sense.
 
 # --hints--
 
-`testLessThan(0)` повинен видати рядок `Under 25`
+`testLessThan(0)` повинен повертати рядок `Under 25`
 
 ```js
 assert(testLessThan(0) === 'Under 25');
 ```
 
-`testLessThan(24)` повинен видати рядок `Under 25`
+`testLessThan(24)` повинен повертати рядок `Under 25`
 
 ```js
 assert(testLessThan(24) === 'Under 25');
 ```
 
-`testLessThan(25)` повинен видати рядок `Under 55`
+`testLessThan(25)` повинен повертати рядок `Under 55`
 
 ```js
 assert(testLessThan(25) === 'Under 55');
 ```
 
-`testLessThan(54)` повинен видати рядок `Under 55`
+`testLessThan(54)` повинен повертати рядок `Under 55`
 
 ```js
 assert(testLessThan(54) === 'Under 55');
 ```
 
-`testLessThan(55)` повинен видати рядок `55 or Over`
+`testLessThan(55)` повинен повертати рядок `55 or Over`
 
 ```js
 assert(testLessThan(55) === '55 or Over');
 ```
 
-`testLessThan(99)` повинен видати рядок `55 or Over`
+`testLessThan(99)` повинен повертати рядок `55 or Over`
 
 ```js
 assert(testLessThan(99) === '55 or Over');
 ```
 
-Оператор `<` потрібно використати принаймні двічі
+You should use the `<` operator at least twice
 
 ```js
 assert(code.match(/val\s*<\s*('|")*\d+('|")*/g).length > 1);
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-less-than-or-equal-to-operator.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-less-than-or-equal-to-operator.md
index 0e796b4b086..065a55f4b9f 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-less-than-or-equal-to-operator.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-less-than-or-equal-to-operator.md
@@ -14,64 +14,62 @@ dashedName: comparison-with-the-less-than-or-equal-to-operator
 **Наприклад:**
 
 ```js
-4   <= 5
-'7' <= 7
-5   <= 5
-3   <= 2
-'8' <= 4
+4   <= 5 // true
+'7' <= 7 // true
+5   <= 5 // true
+3   <= 2 // false
+'8' <= 4 // false
 ```
 
-Відповідно, ці вирази будуть оцінені як `true`, `true`, `true`, `false`, та `false`.
-
 # --instructions--
 
-Додайте оператор "менше або рівне до вказаних рядків, щоб оператор повернення спрацював.
+Add the less than or equal to operator to the indicated lines so that the return statements make sense.
 
 # --hints--
 
-`testLessOrEqual(0)` повинен повернути рядок `Smaller Than or Equal to 12`
+`testLessOrEqual(0)` should return the string `Smaller Than or Equal to 12`
 
 ```js
 assert(testLessOrEqual(0) === 'Smaller Than or Equal to 12');
 ```
 
-`testLessOrEqual(11)` повинен повернути рядок `Smaller Than or Equal to 12`
+`testLessOrEqual(11)` should return the string `Smaller Than or Equal to 12`
 
 ```js
 assert(testLessOrEqual(11) === 'Smaller Than or Equal to 12');
 ```
 
-`testLessOrEqual(12)` повинен повернути рядок `Smaller Than or Equal to 12`
+`testLessOrEqual(12)` should return the string `Smaller Than or Equal to 12`
 
 ```js
 assert(testLessOrEqual(12) === 'Smaller Than or Equal to 12');
 ```
 
-`testLessOrEqual(23)` повинен повернути рядок `Smaller Than or Equal to 24`
+`testLessOrEqual(23)` should return the string `Smaller Than or Equal to 24`
 
 ```js
 assert(testLessOrEqual(23) === 'Smaller Than or Equal to 24');
 ```
 
-`testLessOrEqual(24)` повинен повернути рядок `Smaller Than or Equal to 24`
+`testLessOrEqual(24)` should return the string `Smaller Than or Equal to 24`
 
 ```js
 assert(testLessOrEqual(24) === 'Smaller Than or Equal to 24');
 ```
 
-`testLessOrEqual(25)` повинен повернути рядок `More Than 24`
+`testLessOrEqual(25)` should return the string `More Than 24`
 
 ```js
 assert(testLessOrEqual(25) === 'More Than 24');
 ```
 
-`testLessOrEqual(55)` повинен повернути рядок `More Than 24`
+`testLessOrEqual(55)` should return the string `More Than 24`
 
 ```js
 assert(testLessOrEqual(55) === 'More Than 24');
 ```
 
-Оператор `<=` потрібно використати принаймні двічі
+You should use the `<=` operator at least twice
 
 ```js
 assert(code.match(/val\s*<=\s*('|")*\d+('|")*/g).length > 1);
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-strict-equality-operator.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-strict-equality-operator.md
index 3cf94152ff3..99e857fe2c4 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-strict-equality-operator.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-strict-equality-operator.md
@@ -16,39 +16,37 @@ dashedName: comparison-with-the-strict-equality-operator
 **Наприклад**
 
 ```js
-3 ===  3
-3 === '3'
+3 ===  3  // true
+3 === '3' // false
 ```
 
-Ці умови повертаються відповідно `true` та `false` відповідно.
-
-У другому прикладі, `3` є типом `Number`, а `'3'` є типом `String`.
+In the second example, `3` is a `Number` type and `'3'` is a `String` type.
 
 # --instructions--
 
-Використовуйте оператора абсолютної рівності з командою `if`, щоб функція повернула рядок `Equal`, коли `val` точно дорівнює `7`.
+Use the strict equality operator in the `if` statement so the function will return the string `Equal` when `val` is strictly equal to `7`.
 
 # --hints--
 
-`testStrict(10)` перетворюється в рядку на `Not Equal`
+`testStrict(10)` should return the string `Not Equal`
 
 ```js
 assert(testStrict(10) === 'Not Equal');
 ```
 
-`testStrict(7)` перетворюється в рядку на `Equal`
+`testStrict(7)` should return the string `Equal`
 
 ```js
 assert(testStrict(7) === 'Equal');
 ```
 
-`testStrict("7")` перетворюється в рядку на `Not Equal`
+`testStrict("7")` should return the string `Not Equal`
 
 ```js
 assert(testStrict('7') === 'Not Equal');
 ```
 
-Вам слід використовувати оператора `===`
+You should use the `===` operator
 
 ```js
 assert(code.match(/(val\s*===\s*\d+)|(\d+\s*===\s*val)/g).length > 0);
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-strict-inequality-operator.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-strict-inequality-operator.md
index e20fea2e738..8b10589d45c 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-strict-inequality-operator.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-strict-inequality-operator.md
@@ -14,44 +14,42 @@ dashedName: comparison-with-the-strict-inequality-operator
 **Приклади**
 
 ```js
-3 !==  3
-3 !== '3'
-4 !==  3
+3 !==  3  // false
+3 !== '3' // true
+4 !==  3  // true
 ```
 
-У такому порядку, ці вирази будуть оцінювати, як `false`, `true`,`true`.
-
 # --instructions--
 
-Додайте оператора абсолютної нерівності до команди `if`, щоб функція визначила рядок `Not Equal`, коли `val` не є абсолютно рівним `17`
+Add the strict inequality operator to the `if` statement so the function will return the string `Not Equal` when `val` is not strictly equal to `17`
 
 # --hints--
 
-`testStrictNotEqual(17)` перетворюється в рядку на `Equal`
+`testStrictNotEqual(17)` має повернути рядок `Equal`
 
 ```js
 assert(testStrictNotEqual(17) === 'Equal');
 ```
 
-`testStrictNotEqual("17")` перетворюється в рядку на `Not Equal`
+`testStrictNotEqual("17")` має повернути рядок `Not Equal`
 
 ```js
 assert(testStrictNotEqual('17') === 'Not Equal');
 ```
 
-`testStrictNotEqual(12)` перетворюється в рядку на `Not Equal`
+`testStrictNotEqual(12)` має повернути рядок `Not Equal`
 
 ```js
 assert(testStrictNotEqual(12) === 'Not Equal');
 ```
 
-`testStrictNotEqual("bob")` перетворюється в рядку на `Not Equal`
+`testStrictNotEqual("bob")` має повернути рядок `Not Equal`
 
 ```js
 assert(testStrictNotEqual('bob') === 'Not Equal');
 ```
 
-Вам слід використовувати оператора`!==`
+You should use the `!==` operator
 
 ```js
 assert(code.match(/(val\s*!==\s*\d+)|(\d+\s*!==\s*val)/g).length > 0);
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/concatenating-strings-with-plus-operator.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/concatenating-strings-with-plus-operator.md
index 457c1e63c02..7d3762e6621 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/concatenating-strings-with-plus-operator.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/concatenating-strings-with-plus-operator.md
@@ -25,32 +25,38 @@ dashedName: concatenating-strings-with-plus-operator
 const ourStr = "I come first. " + "I come second.";
 ```
 
-Рядок ` I come first. I come second.` відображатиметься у консолі.
+The string `I come first. I come second.` would be displayed in the console.
 # --instructions--
 
 Створіть `myStr` з рядків `This is the start.` й `This is the end.` за допомогою `+` оператору. Обов'язково використовуйте пробіл між двома рядками.
 
 # --hints--
 
-`myStr` повинен мати таке ж значення як і рядок `This is the start. This is the end.`
+`myStr` should have a single space character between the two strings.
+
+```js
+assert(/start\. This/.test(myStr));
+```
+
+`myStr` should have a value of the string `This is the start. This is the end.`
 
 ```js
 assert(myStr === 'This is the start. This is the end.');
 ```
 
-Для створення `myStr` потрібно використовувати `+`.
+You should use the `+` operator to build `myStr`.
 
 ```js
 assert(code.match(/(["']).*\1\s*\+\s*(["']).*\2/g));
 ```
 
-Для створення `myStr` потрібно використати ключове слово `const`.
+`myStr` should be created using the `const` keyword.
 
 ```js
 assert(/const\s+myStr/.test(code));
 ```
 
-Слід призначити результат для змінної `myStr`.
+You should assign the result to the `myStr` variable.
 
 ```js
 assert(/myStr\s*=/.test(code));
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/concatenating-strings-with-the-plus-equals-operator.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/concatenating-strings-with-the-plus-equals-operator.md
index 3e117d5e1c3..658a1aab17d 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/concatenating-strings-with-the-plus-equals-operator.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/concatenating-strings-with-the-plus-equals-operator.md
@@ -28,13 +28,19 @@ ourStr += "I come second.";
 
 # --hints--
 
-`myStr` повинен мати значення рядка `This is the first sentence. This is the second sentence.`
+`myStr` should have a single space character between the two strings.
+
+```js
+assert(/sentence\. This/.test(myStr));
+```
+
+`myStr` should have a value of the string `This is the first sentence. This is the second sentence.`
 
 ```js
 assert(myStr === 'This is the first sentence. This is the second sentence.');
 ```
 
-Для створення `myStr` потрібно використовувати `+=`.
+You should use the `+=` operator to build `myStr`.
 
 ```js
 assert(code.match(/myStr\s*\+=\s*(["']).*\1/g));
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/constructing-strings-with-variables.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/constructing-strings-with-variables.md
index 34359026545..e9d3669424c 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/constructing-strings-with-variables.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/constructing-strings-with-variables.md
@@ -9,7 +9,7 @@ dashedName: constructing-strings-with-variables
 
 # --description--
 
-Інколи потрібно створити рядок у стилі гри [Mad Libs](https://en.wikipedia.org/wiki/Mad_Libs). Використовуючи оператор об'єднання (`+`), можна вставити одну або декілька змінних у рядок, який ви створюєте.
+Sometimes you will need to build a string. Використовуючи оператор об'єднання (`+`), можна вставити одну або декілька змінних у рядок, який ви створюєте.
 
 Наприклад:
 
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/counting-cards.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/counting-cards.md
index eb9043c6e16..be26b93440c 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/counting-cards.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/counting-cards.md
@@ -9,7 +9,7 @@ dashedName: counting-cards
 
 # --description--
 
-У казино грі Blackjack гравець може здобути перевагу над казино, відстежуючи відносне число старших та молодших карт, що залишились в колоді. Це називається [Підрахунок карт](https://en.wikipedia.org/wiki/Card_counting).
+In the casino game Blackjack, a player can determine whether they have an advantage on the next hand over the house by keeping track of the relative number of high and low cards remaining in the deck. This is called Card Counting.
 
 Чим більше старших карт у колоді, тим краще для гравця. Кожній карті присвоєно значення відповідно до нижчеподаної таблиці. Коли рахунок є більшим за нуль, гравець повинен ставити старшу карту. Коли рахунок дорівнює нулю або є меншим, гравець повинен ставити молодшу карту.
 
@@ -25,7 +25,20 @@ dashedName: counting-cards
 
 # --hints--
 
-Послідовність карт 2, 3, 4, 5, 6 має повернути рядок `5 Bet`
+Your function should return a value for count and the text (`Bet` or `Hold`) with one space character between them.
+
+```js
+assert(//
+  (function () {
+    count = 0;
+    let out = cc(10);
+    const hasSpace = /-?\d+ (Bet|Hold)/.test('' + out);
+    return hasSpace;
+  })()
+);
+```
+
+Cards Sequence 2, 3, 4, 5, 6 should return the string `5 Bet`
 
 ```js
 assert(
@@ -44,7 +57,7 @@ assert(
 );
 ```
 
-Послідовність карт 7, 8, 9 має повернути рядок `0 Hold`
+Cards Sequence 7, 8, 9 should return the string `0 Hold`
 
 ```js
 assert(
@@ -61,7 +74,7 @@ assert(
 );
 ```
 
-Послідовність карт 10, J, Q, K, A має повернути рядок `-5 Hold`
+Cards Sequence 10, J, Q, K, A should return the string `-5 Hold`
 
 ```js
 assert(
@@ -80,7 +93,7 @@ assert(
 );
 ```
 
-Послідовність карт 3, 7, Q, 8, A має повернути рядок `-1 Hold`
+Cards Sequence 3, 7, Q, 8, A should return the string `-1 Hold`
 
 ```js
 assert(
@@ -99,7 +112,7 @@ assert(
 );
 ```
 
-Послідовність карт 2, J, 9, 2, 7 має повернути рядок `1 Bet`
+Cards Sequence 2, J, 9, 2, 7 should return the string `1 Bet`
 
 ```js
 assert(
@@ -118,7 +131,7 @@ assert(
 );
 ```
 
-Послідовність карт 2, 2, 10 має повернути рядок `1 Bet`
+Cards Sequence 2, 2, 10 should return the string `1 Bet`
 
 ```js
 assert(
@@ -135,7 +148,7 @@ assert(
 );
 ```
 
-Послідовність карт 3, 2, A, 10, K має повернути рядок `-1 Hold`
+Cards Sequence 3, 2, A, 10, K should return the string `-1 Hold`
 
 ```js
 assert(
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/create-decimal-numbers-with-javascript.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/create-decimal-numbers-with-javascript.md
index 749893d8b7e..3b32e51bd24 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/create-decimal-numbers-with-javascript.md
+++ b/curriculum/challenges/ukrainian/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>floating point</dfn> або <dfn>floats</dfn>.
 
-**Примітка:** Не всі дійсні числа можуть бути віднесені до <dfn>рухомої коми</dfn>. Це може призвести до помилок заокруглення. [Детальніше Тут](https://en.wikipedia.org/wiki/Floating-point_arithmetic#Accuracy_problems).
+**Note:** when you compute numbers, they are computed with finite precision. Operations using floating points may lead to different results than the desired outcome. If you are getting one of these results, open a topic on the <a href="https://forum.freecodecamp.org/" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --instructions--
 
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/declare-a-read-only-variable-with-the-const-keyword.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/declare-a-read-only-variable-with-the-const-keyword.md
index 1d1a68baeca..54d09b76687 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/declare-a-read-only-variable-with-the-const-keyword.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/declare-a-read-only-variable-with-the-const-keyword.md
@@ -21,49 +21,49 @@ FAV_PET = "Dogs";
 
 Змінні, які не передбачають перепризначення, слід називати, використовуючи ключове слово `const`. Це може знадобитися, якщо ви випадково спробуєте перепризначити змінну, яка повинна бути константною.
 
-Як правило, назву пишуть великими літерами, а слова виокремлюють знаком підкреслення.
-
-**Зверніть увагу:** Зазвичай, розробники пишуть назву ідентифікаторів незмінних значень великими літерами, а назви змінних значень (об'єктів та масивів) — маленькими літерами або через camelCase. Ви дізнаєтесь більше про предмети, масиви, незмінні та незмінні цінності в наступних завданнях. Також у наступних завданнях ви побачите приклади використання нижнього та верхнього регістру, а також ідентифікаторів змінної camelCase.
+**Note:** It is common for developers to use uppercase variable identifiers for immutable values and lowercase or camelCase for mutable values (objects and arrays). You will learn more about objects, arrays, and immutable and mutable values in later challenges. Also in later challenges, you will see examples of uppercase, lowercase, or camelCase variable identifiers.
 
 # --instructions--
 
-Змініть код так, щоб усі змінні були оголошені за допомогою `let` або `const`. Використовуйте `let` для змінних значень, а `const` для незмінних значень. Крім того, змініть назву змінної, оголошеної з `const`, відповідно до поширених методів роботи: назви констант мають писатися великими літерами.
+Change the code so that all variables are declared using `let` or `const`. Use `let` when you want the variable to change, and `const` when you want the variable to remain constant. Also, rename variables declared with `const` to conform to common practices. Do not change the strings assigned to the variables.
 
 # --hints--
 
-`var` має бути відсутнім у коді.
+`var` should not exist in your code.
 
 ```js
-(getUserInput) => assert(!getUserInput('index').match(/var/g));
+assert.notMatch(code, /var/g);
 ```
 
-Ви повинні змінити `fCC` на верхні регістри.
+You should change `fCC` to all uppercase.
 
 ```js
-(getUserInput) => {
-  assert(getUserInput('index').match(/(FCC)/));
-  assert(!getUserInput('index').match(/fCC/));
-}
+assert.match(code, /(FCC)/);
+assert.notMatch(code, /(fCC)/);
 ```
 
-`FCC` має бути константною змінною, оголошеною з `const`.
+`FCC` should be a constant variable declared with `const`.
 
 ```js
-assert.equal(FCC, 'freeCodeCamp');
 assert.match(code, /const\s+FCC/);
 ```
 
-`fact` має оголошуватися з `let`.
+The string assigned to `FCC` should not be changed.
 
 ```js
-(getUserInput) => assert(getUserInput('index').match(/(let fact)/g));
+assert.equal(FCC, 'freeCodeCamp');
 ```
 
-`console.log` необхідно змінити, щоб вивести на екран змінні `FCC` та `fact`.
+`fact` should be declared with `let`.
 
 ```js
-(getUserInput) =>
-  assert(getUserInput('index').match(/console\.log\(\s*FCC\s*\,\s*fact\s*\)\s*;?/g));
+assert.match(code, /(let\s+fact)/g);
+```
+
+`console.log` should be changed to print the `FCC` and `fact` variables.
+
+```js
+assert.match(code, /console\.log\(\s*FCC\s*\,\s*fact\s*\)\s*;?/g);
 ```
 
 # --seed--
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/decrement-a-number-with-javascript.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/decrement-a-number-with-javascript.md
index 5beb517c8f2..254af851896 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/decrement-a-number-with-javascript.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/decrement-a-number-with-javascript.md
@@ -38,18 +38,22 @@ assert(myVar === 10);
 `myVar = myVar - 1;` слід змінити.
 
 ```js
-assert(
-  /let\s*myVar\s*=\s*11;\s*\/*.*\s*([-]{2}\s*myVar|myVar\s*[-]{2});/.test(code)
-);
+assert(!code.match(/myVar\s*=\s*myVar\s*[-]\s*1.*?;?/));
 ```
 
-Вам слід користуватись оператором `--` у `myVar`.
+You should not assign `myVar` with `10`.
+
+```js
+assert(!code.match(/myVar\s*=\s*10.*?;?/));
+```
+
+You should use the `--` operator on `myVar`.
 
 ```js
 assert(/[-]{2}\s*myVar|myVar\s*[-]{2}/.test(code));
 ```
 
-Не слід змінювати код над зазначеним коментарем.
+You should not change code above the specified comment.
 
 ```js
 assert(/let myVar = 11;/.test(code));
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
index 480592dc62e..f639c4fb07f 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
@@ -37,12 +37,6 @@ assert(code.match(/quotient/g).length === 1);
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function(y){return 'quotient = '+y;})(quotient);
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
index 0d30c558701..cd5f24a763c 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
@@ -11,12 +11,12 @@ dashedName: escape-sequences-in-strings
 
 Лапки - не єдині символи, що можуть бути <dfn>екрановані</dfn> в рядку. Існує дві причини використовувати екрановані символи:
 
-1.  Щоб дозволити вам використовувати символи, які ви не можете інакше вводити, такі як повернення каретки.
+1.  To allow you to use characters you may not otherwise be able to type out, such as a newline.
 2.  Щоб дозволити вам відобразити декілька лапок в рядку без неправильного тлумачення JavaScript того, що ви маєте на увазі.
 
 Ми вивчили це в попередньому завданні.
 
-<table class='table table-striped'><thead><tr><th>Код</th><th>При виведенні буде</th></tr></thead><tbody><tr><td><code>\'</code></td><td>одинарні лапки</td></tr><tr><td><code>\"</code></td><td>подвійні лапки</td></tr><tr><td><code>\\</code></td><td>зворотня коса риска</td></tr><tr><td><code>\n</code></td><td>новий рядок</td></tr><tr><td><code>\r</code></td><td>повернення каретки</td></tr><tr><td><code>\t</code></td><td>вкладка</td></tr><tr><td><code>\b</code></td><td>границі слова</td></tr><tr><td><code>\f</code></td><td>розрив сторінки</td></tr></tbody></table>
+<table class='table table-striped'><thead><tr><th>Код</th><th>При виведенні буде</th></tr></thead><tbody><tr><td><code>\'</code></td><td>одинарні лапки</td></tr><tr><td><code>\"</code></td><td>подвійні лапки</td></tr><tr><td><code>\\</code></td><td>зворотня коса риска</td></tr><tr><td><code>\n</code></td><td>новий рядок</td></tr><tr><td><code>\t</code></td><td>tab</td></tr><tr><td><code>\r</code></td><td>carriage return</td></tr><tr><td><code>\b</code></td><td>границі слова</td></tr><tr><td><code>\f</code></td><td>розрив сторінки</td></tr></tbody></table>
 
 *Зверніть увагу, що сама зворотня коса риска повинна бути екранована для того, щоб вона відображалась.*
 
@@ -78,14 +78,6 @@ assert(myStr === 'FirstLine\n\t\\SecondLine\nThirdLine');
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function(){
-if (myStr !== undefined){
-console.log('myStr:\n' + myStr);}})();
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/escaping-literal-quotes-in-strings.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/escaping-literal-quotes-in-strings.md
index f5cbda40593..84c1e5b448f 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/escaping-literal-quotes-in-strings.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/escaping-literal-quotes-in-strings.md
@@ -39,7 +39,7 @@ I am a "double quoted" string inside "double quotes".
 assert(code.match(/\\"/g).length === 4 && code.match(/[^\\]"/g).length === 2);
 ```
 
-Змінний myStr повинен містити рядок: `I am a "double quoted" string inside "double quotes".`
+Variable `myStr` should contain the string: `I am a "double quoted" string inside "double quotes".`
 
 ```js
 assert(/I am a "double quoted" string inside "double quotes(\."|"\.)$/.test(myStr));
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/find-the-length-of-a-string.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/find-the-length-of-a-string.md
index 157e0f120e7..1edce78a1f3 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/find-the-length-of-a-string.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/find-the-length-of-a-string.md
@@ -15,13 +15,13 @@ dashedName: find-the-length-of-a-string
 console.log("Alan Peter".length);
 ```
 
-У консолі відображатиметься значення `10`.
+The value `10` would be displayed in the console. Note that the space character between "Alan" and "Peter" is also counted.
 
 Наприклад, якби ми створили змінну `const firstName = "Ada"`, ми б змогли визначити довжину рядка `Ada` за допомогою властивості `firstName.length`.
 
 # --instructions--
 
-Використовуйте властивість `.length`, щоб вирахувати кількість символів у змінній `lastName` і призначити її до `lastNameLength`.
+Use the `.length` property to set `lastNameLength` to the number of characters in `lastName`.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/generate-random-fractions-with-javascript.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/generate-random-fractions-with-javascript.md
index ffe36aef4e8..a31e0b5e33a 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/generate-random-fractions-with-javascript.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/generate-random-fractions-with-javascript.md
@@ -13,7 +13,7 @@ dashedName: generate-random-fractions-with-javascript
 
 JavaScript має функцію `Math.random()`, що генерує випадкові десяткові числа між `0` (включно) and `1` (виключно). Таким чином `Math.random()` може повернути `0` але ніколи не поверне `1`.
 
-**Примітка:** Як [Storing Values with the Assignment Operator](/learn/javascript-algorithms-and-data-structures/basic-javascript/storing-values-with-the-assignment-operator), всі виклики функцій будуть вирішені до того, як `return` виконується, тому ми можемо повернути значення `return` функції `Math.random()`.
+**Note:** Like <a href="/learn/javascript-algorithms-and-data-structures/basic-javascript/storing-values-with-the-assignment-operator" target="_blank" rel="noopener noreferrer nofollow">Storing Values with the Assignment Operator</a>, all function calls will be resolved before the `return` executes, so we can `return` the value of the `Math.random()` function.
 
 # --instructions--
 
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/global-scope-and-functions.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/global-scope-and-functions.md
index c1177712df0..01a422a875d 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/global-scope-and-functions.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/global-scope-and-functions.md
@@ -17,7 +17,7 @@ dashedName: global-scope-and-functions
 
 Використовуючи `let` чи `const`, визначте глобальну змінну `myGlobal` поза будь-якою функцією. Привласніть їй значення `10`.
 
-Призначте `5` для `oopsGlobal` всередині функції `fun1` ***не*** використовуючи ключове слово `let` чи `const`.
+Inside function `fun1`, assign `5` to `oopsGlobal` ***without*** using the `var`, `let` or `const` keywords.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/golf-code.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/golf-code.md
index 0a21c6f8312..6291697d897 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/golf-code.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/golf-code.md
@@ -9,7 +9,7 @@ dashedName: golf-code
 
 # --description--
 
-У грі [гольф](https://en.wikipedia.org/wiki/Golf), кожен отвір має `par`, значення від середньої кількості очікуваних `ударів`, які повинен зробити гравець, щоб потрапити м'ячем у лунку, для завершення гри. Залежно від того, на скільки вище або нижче `par` є ваші `удари`, існують різні псевдоніми.
+In the game of Golf, each hole has a `par`, meaning, the average number of `strokes` a golfer is expected to make in order to sink the ball in the hole to complete the play. Залежно від того, на скільки вище або нижче `par` є ваші `удари`, існують різні псевдоніми.
 
 Ваша функція проходитиме аргументи `par` та `strokes`. Поверніть правильний рядок відповідно до цієї таблиці, яка перелічує удари в порядку пріоритету; зверху (найвищий) до низу (найнижчий):
 
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
index 6f90c4db90e..adc9b5b872c 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
@@ -31,12 +31,6 @@ assert(/var\s+a\s*=\s*9(\s*;?\s*)$/.test(code));
 
 # --seed--
 
-## --after-user-code--
-
-```js
-if(typeof a !== 'undefined') {(function(a){return "a = " + a;})(a);} else { (function() {return 'a is undefined';})(); }
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-with-javascript-do...while-loops.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-with-javascript-do...while-loops.md
index 938e32f2005..779306c8279 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-with-javascript-do...while-loops.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-with-javascript-do...while-loops.md
@@ -21,7 +21,7 @@ do {
 } while (i < 5);
 ```
 
-Приклад вище поводиться аналогічно з іншими типами циклів, і результуючий масив буде виглядати як `[0, 1, 2, 3, 4]`. Однак, що відрізняє `do...while` від інших циклів, так це те, як він поводиться, коли умова підводить при першій перевірці. Давайте розглянемо це в дії: Ось звичайний `while` цикл, який запустить код за умови, якщо `i < 5`:
+Приклад вище поводиться аналогічно з іншими типами циклів, і результуючий масив буде виглядати як `[0, 1, 2, 3, 4]`. Однак, що відрізняє `do...while` від інших циклів, так це те, як він поводиться, коли умова підводить при першій перевірці. Let's see this in action. Here is a regular `while` loop that will run the code in the loop as long as `i < 5`:
 
 ```js
 const ourArray = []; 
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/local-scope-and-functions.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/local-scope-and-functions.md
index 266159518a9..8591ea42a55 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/local-scope-and-functions.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/local-scope-and-functions.md
@@ -23,7 +23,7 @@ myTest();
 console.log(loc);
 ```
 
-Виклик функції `myTest()` відображатиме рядок `foo` в консолі. Рядок `console.log(loc)` видасть помилку, тому що `loc` не є визначеним за діапазоном функції.
+Виклик функції `myTest()` відображатиме рядок `foo` в консолі. The `console.log(loc)` line (outside of the `myTest` function) will throw an error, as `loc` is not defined outside of the function.
 
 # --instructions--
 
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/practice-comparing-different-values.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/practice-comparing-different-values.md
index 9ef0daa67eb..9776cfef6dd 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/practice-comparing-different-values.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/practice-comparing-different-values.md
@@ -15,7 +15,7 @@ dashedName: practice-comparing-different-values
 
 **Наприклад:**
 
-`3 == '3'` повертає результат `true` тому, що JavaScript конвертує рядок у число. `3 === '3'` повертає результат false, оскільки ці типи є різними і конвертація не виконується.
+`3 == '3'` повертає результат `true` тому, що JavaScript конвертує рядок у число. `3 === '3'` returns `false` because the types are different and type conversion is not performed.
 
 **Примітка:** В JavaScript, ви можете визначити тип змінної або значення за допомогою оператора `typeof`, наступним чином:
 
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
index 3f1ec71bc7f..cf4c208fffa 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
@@ -62,12 +62,6 @@ assert(code.match(/"/g).length === 4 && code.match(/'/g).length === 2);
 
 # --seed--
 
-## --after-user-code--
-
-```js
-(function() { return "myStr = " + myStr; })();
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md
index fd4b106fbce..b20db1b155d 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md
@@ -31,13 +31,13 @@ assert(
 );
 ```
 
-Після `updateRecords(recordCollection, 5439, "tracks", "Take a Chance on Me")`, `tracks` повинні мати рядок `Take a Chance on Me` останнім елементом.
+After `updateRecords(recordCollection, 5439, "tracks", "Take a Chance on Me")`, `tracks` should have the string `Take a Chance on Me` as the last and only element.
 
 ```js
 assert(
-  updateRecords(_recordCollection, 5439, 'tracks', 'Take a Chance on Me')[5439][
-    'tracks'
-  ].pop() === 'Take a Chance on Me'
+  updateRecords(_recordCollection, 5439, 'tracks', 'Take a Chance on Me') &&
+  _recordCollection[5439]['tracks'].length === 1 &&
+  _recordCollection[5439]['tracks'].pop() === 'Take a Chance on Me'
 );
 ```
 
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/return-early-pattern-for-functions.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/return-early-pattern-for-functions.md
index 82309ee99e2..c0c5264303f 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/return-early-pattern-for-functions.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/return-early-pattern-for-functions.md
@@ -28,8 +28,8 @@ myFun();
 
 Модифікуйте функцію `abTest` і тому, якщо `a` або `b` дорівнюватиме менше `0`, функція відразу вийде зі значенням `undefined`.
 
-**Підказка**  
-Пам'ятайте, що [`undefined` - це ключове слово](https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/basic-javascript/understanding-uninitialized-variables), а не рядок.
+**Hint**  
+Remember that <a href="https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/basic-javascript/understanding-uninitialized-variables" target="_blank" rel="noopener noreferrer nofollow"><code>undefined</code> is a keyword</a>, not a string.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/returning-boolean-values-from-functions.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/returning-boolean-values-from-functions.md
index e5f8f7be462..8eacab1dfb0 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/returning-boolean-values-from-functions.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/returning-boolean-values-from-functions.md
@@ -9,7 +9,7 @@ dashedName: returning-boolean-values-from-functions
 
 # --description--
 
-Ви можете пригадати з [Порівняння з оператором рівності](/learn/javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-equality-operator), що всі порівняльні оператори повертають логічне `true` або `false` значення.
+You may recall from <a href="/learn/javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-equality-operator" target="_blank" rel="noopener noreferrer nofollow">Comparison with the Equality Operator</a> that all comparison operators return a boolean `true` or `false` value.
 
 Інколи люди використовують `if/else` команду для того, щоб зробити порівняння на зразок цього:
 
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
index 20ecae5715e..fa01106df13 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
@@ -98,7 +98,7 @@ function nextInLine(arr, item) {
 }
 
 // Setup
-const testArr = [1, 2, 3, 4, 5];
+let testArr = [1, 2, 3, 4, 5];
 
 // Display code
 console.log("Before: " + JSON.stringify(testArr));
@@ -109,7 +109,7 @@ console.log("After: " + JSON.stringify(testArr));
 # --solutions--
 
 ```js
-const testArr = [1, 2, 3, 4, 5];
+let testArr = [1, 2, 3, 4, 5];
 
 function nextInLine(arr, item) {
     arr.push(item);
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/understand-string-immutability.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/understand-string-immutability.md
index 05acda6c646..6cbcddaec17 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/understand-string-immutability.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/understand-string-immutability.md
@@ -11,14 +11,14 @@ dashedName: understand-string-immutability
 
 У JavaScript, `String` значення <dfn>immutable</dfn>, означає, що їх не можна буде змінити після створення.
 
-Наприклад, у такому коді:
+For example, the following code will produce an error because the letter `B` in the string `Bob` cannot be changed to the letter `J`:
 
 ```js
 let myStr = "Bob";
 myStr[0] = "J";
 ```
 
-неможливо змінити значення `myStr` на `Job`, тому що вміст `myStr` не може бути зміненим. Зауважте, що *not* означає, що `myStr` не можна змінити, так само як окремі елементи в коді <dfn>string literal</dfn>. Єдиний спосіб змінити `myStr` - це додати новий рядок:
+Note that this does *not* mean that `myStr` could not be re-assigned. The only way to change `myStr` would be to assign it with a new value, like this:
 
 ```js
 let myStr = "Bob";
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-uninitialized-variables.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-uninitialized-variables.md
index e223322dce0..8aeb65007bd 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-uninitialized-variables.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-uninitialized-variables.md
@@ -9,7 +9,7 @@ dashedName: understanding-uninitialized-variables
 
 # --description--
 
-Коли змінні JavaScript проголошено, вони мають початкове значення `undefined`. Якщо ви виконуєте математичну дію з `undefined` змінної, вашим результатом буде `NaN`, що означає <dfn>"Not a Number"</dfn>. Якщо ви об'єднаєте рядок з `undefined` змінною, ви отримаєте <dfn>рядок</dfn> літерала з `undefined`.
+Коли змінні JavaScript проголошено, вони мають початкове значення `undefined`. Якщо ви виконуєте математичну дію з `undefined` змінної, вашим результатом буде `NaN`, що означає <dfn>"Not a Number"</dfn>. If you concatenate a string with an `undefined` variable, you will get a <dfn>string</dfn> of `undefined`.
 
 # --instructions--
 
@@ -17,19 +17,19 @@ dashedName: understanding-uninitialized-variables
 
 # --hints--
 
-`a` має бути визначене й обчислене, щоб мати значення `6`.
+`a` should be defined and have a final value of `6`.
 
 ```js
 assert(typeof a === 'number' && a === 6);
 ```
 
-`b` має бути визначене й обчислене, щоб мати значення `15`.
+`b` should be defined and have a final value of `15`.
 
 ```js
 assert(typeof b === 'number' && b === 15);
 ```
 
-`c` не має містити `undefined` і повинне мати значення рядка `I am a String!`
+`c` should not contain `undefined` and should have a final value of the string `I am a String!`
 
 ```js
 assert(!/undefined/.test(c) && c === 'I am a String!');
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
index 7c322089104..b46d142741e 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
@@ -8,7 +8,7 @@ dashedName: use-recursion-to-create-a-countdown
 
 # --description--
 
-У [попередньому завданні](/learn/javascript-algorithms-and-data-structures/basic-javascript/replace-loops-using-recursion) ви навчилися використовувати рекурсію для заміни циклу `for`. Тепер подивимося на більш складну функцію, яка повертає масив послідовних чисел, починаючи з `1` до числа, переданого функції.
+In a <a href="/learn/javascript-algorithms-and-data-structures/basic-javascript/replace-loops-using-recursion" target="_blank" rel="noopener noreferrer nofollow">previous challenge</a>, you learned how to use recursion to replace a `for` loop. Тепер подивимося на більш складну функцію, яка повертає масив послідовних чисел, починаючи з `1` до числа, переданого функції.
 
 Як уже було згадано в попередньому завданні, це буде <dfn>base case</dfn>. Він повідомляє рекурсивній функції, коли їй більше не потрібно викликати саму себе. Це простий випадок, коли значення, яке повертається, вже відоме. Також існує <dfn>recursive call</dfn>, який виконує початкову функцію з різними параметрами. Якщо функція написана правильно, то буде досягнутий базовий випадок.
 
@@ -71,6 +71,13 @@ assert(
 );
 ```
 
+Global variables should not be used to cache the array.
+
+```js
+countdown(1)
+assert.deepStrictEqual(countdown(5), [5, 4, 3, 2, 1]);
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
index 9c8b6de6624..52192450bb6 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
@@ -56,6 +56,13 @@ assert.deepStrictEqual(rangeOfNumbers(6, 9), [6, 7, 8, 9]);
 assert.deepStrictEqual(rangeOfNumbers(4, 4), [4]);
 ```
 
+Global variables should not be used to cache the array.
+
+```js
+rangeOfNumbers(1, 3)
+assert.deepStrictEqual(rangeOfNumbers(6, 9), [6, 7, 8, 9]);
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/using-objects-for-lookups.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/using-objects-for-lookups.md
index 09fc1f0f21c..4d1ed87646e 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/using-objects-for-lookups.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/using-objects-for-lookups.md
@@ -25,14 +25,14 @@ const alpha = {
   26:"A"
 };
 
-alpha[2];
-alpha[24];
+const thirdLetter = alpha[2];
+const lastLetter = alpha[24];
 
 const value = 2;
-alpha[value];
+const valueLookup = alpha[value];
 ```
 
-`alpha[2]` - це рядок `Y`, `alpha[24]` - це рядок `C`, а `alpha[value]` - це рядок `Y`.
+`thirdLetter` is the string `Y`, `lastLetter` is the string `C`, and `valueLookup` is the string `Y`.
 
 # --instructions--
 
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/word-blanks.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/word-blanks.md
index 5e18338737f..b8e66955219 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/word-blanks.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/basic-javascript/word-blanks.md
@@ -9,11 +9,9 @@ dashedName: word-blanks
 
 # --description--
 
-Тепер ми використаємо наші знання про рядки, щоб створити стильну гру у слова [Mad Libs](https://en.wikipedia.org/wiki/Mad_Libs), яку ми називаємо "Пропуски в словах". Ви створите (за бажанням гумористичні) речення типу "Заповніть пропуски".
+You are provided sentences with some missing words, like nouns, verbs, adjectives and adverbs. You then fill in the missing pieces with words of your choice in a way that the completed sentence makes sense.
 
-У грі "Пропуски в словах", у вас є речення з пропущеними частинами мови, наприклад, іменниками, дієсловами, прикметниками та прислівниками. Потім ви заповнюєте вибрані вами відсутні фрагменти слів так, аби завершене реченням мало сенс.
-
-Розгляньте це речення - Було дуже **\_\_\_\_**, і ми **\_\_\_\_** себе **\_\_\_\_**. У цьому реченні відсутні три фрагменти: прикметник, дієслово та прислівник; ми можемо додати вибрані нами слова для того, щоб завершити його. Потім ми можемо призначити надіслане речення змінній наступним чином:
+Consider this sentence - It was really **\_\_\_\_**, and we **\_\_\_\_** ourselves **\_\_\_\_**. This sentence has three missing pieces- an adjective, a verb and an adverb, and we can add words of our choice to complete it. We can then assign the completed sentence to a variable as follows:
 
 ```js
 const sentence = "It was really " + "hot" + ", and we " + "laughed" + " ourselves " + "silly" + ".";
@@ -21,11 +19,11 @@ const sentence = "It was really " + "hot" + ", and we " + "laughed" + " ourselve
 
 # --instructions--
 
-У цьому завданні у вас є іменник, дієслово, прикметник та прислівник. Вам потрібно створити завершене речення зі словами на ваш вибір, а також використати ті, які ми надаємо.
+In this challenge, we provide you with a noun, a verb, an adjective and an adverb. You need to form a complete sentence using words of your choice, along with the words we provide.
 
-Вам потрібно використати рядок оператор конкатенації `+`, щоб створити новий, за допомогою наданих змінних: `myNoun`, `myAdjective`, `myVerb`, і `myAdverb`. Потім ви задасте сформованому рядку змінну `wordBlanks`. Не слід змінювати слова, які зазначені як змінні.
+You will need to use the string concatenation operator `+` to build a new string, using the provided variables: `myNoun`, `myAdjective`, `myVerb`, and `myAdverb`. You will then assign the formed string to the `wordBlanks` variable. You should not change the words assigned to the variables.
 
-Вам також потрібно враховувати пропуски у вашому рядку для того, щоб кінцеве речення містило пробіли між усіма словами. У результаті ви маєте отримати завершене речення.
+You will also need to account for spaces in your string, so that the final sentence has spaces between all the words. The result should be a complete sentence.
 
 # --hints--
 
@@ -35,7 +33,7 @@ const sentence = "It was really " + "hot" + ", and we " + "laughed" + " ourselve
 assert(typeof wordBlanks === 'string');
 ```
 
-Ви не повинні змінювати значення, задані як `myNoun`, `myVerb`, `myAdjective` або `myAdverb`.
+You should not change the values assigned to `myNoun`, `myVerb`, `myAdjective` or `myAdverb`.
 
 ```js
 assert(
@@ -46,7 +44,7 @@ assert(
 );
 ```
 
-Ви не повинні безпосередньо використовувати змінні `собака`, `біг`, `великий`, або `швидко` для того, щоб створити `wordBlanks`.
+You should not directly use the values `dog`, `ran`, `big`, or `quickly` to create `wordBlanks`.
 
 ```js
 const newCode = removeAssignments(code);
@@ -58,7 +56,7 @@ assert(
 );
 ```
 
-`wordBlanks` має містити всі слова, які задані як змінні: `myNoun`, `myVerb`, `myAdjective` і `myAdverb` виокремленими словами, які не є символами (а також будь-якими додатковими словами у вашій madlib).
+`wordBlanks` should contain all of the words assigned to the variables `myNoun`, `myVerb`, `myAdjective` and `myAdverb` separated by non-word characters (and any additional words of your choice).
 
 ```js
 assert(
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/es6/mutate-an-array-declared-with-const.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/es6/mutate-an-array-declared-with-const.md
index 4f6744962e7..2594e86a699 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/es6/mutate-an-array-declared-with-const.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/es6/mutate-an-array-declared-with-const.md
@@ -23,7 +23,7 @@ s[2] = 45;
 console.log(s);
 ```
 
-`s = [1, 2, 3]` призведе до помилки. Виклик `console.log` відображає `[5, 6, 45]`.
+`s = [1, 2, 3]` призведе до помилки. After commenting out that line, the `console.log` will display the value `[5, 6, 45]`.
 
 Як ви помітили, можна змінювати об'єкт `[5, 6, 7]`. Змінна `s` все ще вказуватиме на змінений масив `[5, 6, 45]`. Як і усі масиви, елементи масиву в `s` є незмінними, бо було використано `const`. Ви не можете використовувати ідентифікатор змінної `s`, щоб вказувати на інший масив оператору призначення.
 
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
index 7b22883c605..0559a8fa7b1 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
@@ -12,24 +12,35 @@ ES6 забезпечує новий синтаксис для створення
 
 Варто зазначити, що синтаксис `class` є просто синтаксисом, а не повноцінною реалізацією об'єктно-орієнтованої парадигми, на відміну від таких мов як Java, Python, Ruby, і т.д.
 
-В ES5 зазвичай визначається функція `constructor` та використовується ключове слово `new` для створення об'єкта.
-
-```js
-var SpaceShuttle = function(targetPlanet){
-  this.targetPlanet = targetPlanet;
-}
-var zeus = new SpaceShuttle('Jupiter');
-```
-
-Синтаксис `class` просто замінює створення функції `constructor`:
+In ES5, an object can be created by defining a `constructor` function and using the `new` keyword to instantiate the object.
+
+In ES6, a `class` declaration has a `constructor` method that is invoked with the `new` keyword. If the `constructor` method is not explicitly defined, then it is implicitly defined with no arguments.
 
 ```js
+// Explicit constructor
 class SpaceShuttle {
   constructor(targetPlanet) {
     this.targetPlanet = targetPlanet;
   }
+  takeOff() {
+    console.log("To " + this.targetPlanet + "!");
+  }
 }
+
+// Implicit constructor 
+class Rocket {
+  launch() {
+    console.log("To the moon!");
+  }
+}
+
 const zeus = new SpaceShuttle('Jupiter');
+// prints To Jupiter! in console
+zeus.takeOff();
+
+const atlas = new Rocket();
+// prints To the moon! in console
+atlas.launch();
 ```
 
 Варто зазначити, що ключове слово `class` оголошує нову функцію, до якої додається конструктор. Конструктор викликається, коли ключове слово `new` використовується для створення нового об'єкту.
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
index 4aed1da84b0..ddc23302e0d 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
@@ -53,7 +53,8 @@ assert(
 `bicycle.setGear(48)` повинен змінити значення `gear` для 48.
 
 ```js
-assert(new bicycle.setGear(48).gear === 48);
+bicycle.setGear(48);
+assert(bicycle.gear === 48);
 ```
 
 # --seed--
diff --git a/curriculum/challenges/ukrainian/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/ukrainian/02-javascript-algorithms-and-data-structures/functional-programming/add-elements-to-the-end-of-an-array-using-concat-instead-of-push.md
index 04274ee8e53..840e2c9cda0 100644
--- a/curriculum/challenges/ukrainian/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/ukrainian/02-javascript-algorithms-and-data-structures/functional-programming/add-elements-to-the-end-of-an-array-using-concat-instead-of-push.md
@@ -10,20 +10,20 @@ dashedName: add-elements-to-the-end-of-an-array-using-concat-instead-of-push
 
 Функціональне програмування - це створення та використання функцій, що не змінюються.
 
-Останній виклик представив метод `контикату ` як спосіб об'єднання масивів у новий без  мутації вихідних масивів. Порівняйте метод `concat` з методом `push`. `push` додає елемент в кінець викликаного масиву, який змінює його. Ось один із прикладів:
+The last challenge introduced the `concat` method as a way to merge arrays into a new array without mutating the original arrays. Порівняйте метод `concat` з методом `push`. `push` adds items to the end of the same array it is called on, which mutates that array. Ось один із прикладів:
 
 ```js
 const arr = [1, 2, 3];
-arr.push([4, 5, 6]);
+arr.push(4, 5, 6);
 ```
 
-`arr` матиме модифіковане значення `[1, 2, 3, [4, 5, 6]]`,що не є функціональним способом програмування.
+`arr` would have a modified value of `[1, 2, 3, 4, 5, 6]`, which is not the functional programming way.
 
-`concat` пропонує спосіб додавання нових елементів до кінця масиву без побічних ефектів, що мутують.
+`concat` offers a way to merge new items to the end of an array without any mutating side effects.
 
 # --instructions--
 
-Змініть функцію `nonMutatingPush` так що вона використовує `concat`, щоб додати `newItem` до кінця `original` замість `push`. Функція повинна повертати масив.
+Change the `nonMutatingPush` function so it uses `concat` to merge `newItem` to the end of `original` without mutating `original` or `newItem` arrays. Функція повинна повертати масив.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/functional-programming/understand-functional-programming-terminology.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/functional-programming/understand-functional-programming-terminology.md
index 0b7615571c0..f12a89e9970 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/functional-programming/understand-functional-programming-terminology.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/functional-programming/understand-functional-programming-terminology.md
@@ -18,7 +18,7 @@ dashedName: understand-functional-programming-terminology
 
 Функції, що призначені для змінної, передані в іншу функцію, або навпаки повернені від іншої функції, так само як інше звичайне значення, називається функції <dfn>first class</dfn>. У JavaScript, всі функції - це функції першого класу.
 
-Функції, що приймають функцію як аргумент, або повертають функцію як повернуте значення, називаються <dfn>higher order</dfn> функції.
+The functions that take a function as an argument, or return a function as a return value, are called <dfn>higher order</dfn> functions.
 
 Коли функції передаються або повертаються від іншої функції, тоді ті функції, які були передані або повернені, можуть називатися <dfn>lambda</dfn>.
 
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
index 1779f63073d..2ff6a730547 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
@@ -137,14 +137,6 @@ assert.strictEqual(
 
 # --seed--
 
-## --after-user-code--
-
-```js
-if(bob){
-  bob = new Person("Bob Ross");
-}
-```
-
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/map-the-debris.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/map-the-debris.md
index ac3139e1266..ae4e3db264a 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/map-the-debris.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/map-the-debris.md
@@ -1,26 +1,33 @@
 ---
 id: af4afb223120f7348cdfc9fd
 title: Мапа Debris
-challengeType: 5
+challengeType: 1
 forumTopicId: 16021
 dashedName: map-the-debris
 ---
 
 # --description--
 
-Повернути новий масив, який трансформує середню висоту елементів у їхні орбітальні періоди (у секундах).
+Згідно з третім законом Кеплера, орбітальний період $T$ двох точкових мас, що обертаються навколо одна одної по круговій або еліптичній орбіті, є:
 
-Масив буде містити об'єкти у форматі `{name: 'name', avgAlt: avgAlt}`.
+$$ T = 2 \pi \sqrt{\frac{a^{3}}{\mu}} $$
 
-Ви можете прочитати про орбітальні періоди [у Вікіпедії](http://en.wikipedia.org/wiki/Orbital_period).
+- $a$ is the orbit's semi-major axis
+- $μ = GM$ is the standard gravitational parameter
+- $G$ is the gravitational constant,
+- $M$ is the mass of the more massive body.
 
-Значення потрібно округлити до найближчого цілого числа. Тіло, що знаходиться на орбіті - це Земля.
+Return a new array that transforms the elements' average altitude into their orbital periods (in seconds).
 
-Радіус Землі - 6367.4447 кілометрів, а значення GM Землі - 398600.4418 km<sup>3</sup>s<sup>-2</sup>.
+The array will contain objects in the format `{name: 'name', avgAlt: avgAlt}`.
+
+The values should be rounded to the nearest whole number. The body being orbited is Earth.
+
+The radius of the earth is 6367.4447 kilometers, and the GM value of earth is 398600.4418 km<sup>3</sup>s<sup>-2</sup>.
 
 # --hints--
 
-`orbitalPeriod([{name : "sputnik", avgAlt : 35873.5553}])` повинен повертатися як `[{name: "sputnik", orbitalPeriod: 86400}]`.
+`orbitalPeriod([{name : "sputnik", avgAlt : 35873.5553}])` повинен повертати `[{name: "sputnik", orbitalPeriod: 86400}]`.
 
 ```js
 assert.deepEqual(orbitalPeriod([{ name: 'sputnik', avgAlt: 35873.5553 }]), [
@@ -28,7 +35,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}])` повинен повертатися як `[{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}])` повинен повертати `[{name : "iss", orbitalPeriod: 5557}, {name: "hubble", orbitalPeriod: 5734}, {name: "moon", orbitalPeriod: 2377399}]`.
 
 ```js
 assert.deepEqual(
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
index 14214423b97..ad2dbf65380 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
@@ -42,6 +42,13 @@ assert.deepEqual(steamrollArray([1, {}, [3, [[4]]]]), [1, {}, 3, 4]);
 assert(!code.match(/\.\s*flat\s*\(/) && !code.match(/\.\s*flatMap\s*\(/));
 ```
 
+Global variables should not be used.
+
+```js
+steamrollArray([1, {}, [3, [[4]]]])
+assert.deepEqual(steamrollArray([1, {}, [3, [[4]]]]), [1, {}, 3, 4])
+```
+
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
index 8bfc9cefd24..35abbb0b85e 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
@@ -47,28 +47,48 @@ sumPrimes(10);
 # --solutions--
 
 ```js
-function eratosthenesArray(n) {
-    var primes = [];
-    if (n > 2) {
-        var half = n>>1;
-        var sieve = Array(half);
-        for (var i = 1, limit = Math.sqrt(n)>>1; i <= limit; i++) {
-            if (!sieve[i]) {
-                for (var step = 2*i+1, j = (step*step)>>1; j < half; j+=step) {
-                    sieve[j] = true;
-                }
-            }
-        }
-        primes.push(2);
-        for (var p = 1; p < half; p++) {
-            if (!sieve[p]) primes.push(2*p+1);
+class PrimeSeive {
+  constructor(num) {
+    const seive = Array(Math.floor((num - 1) / 2)).fill(true);
+    const upper = Math.floor((num - 1) / 2);
+    const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+
+    for (let i = 0; i <= sqrtUpper; i++) {
+      if (seive[i]) {
+        // Mark value in seive array
+        const prime = 2 * i + 3;
+        // Mark all multiples of this number as false (not prime)
+        const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+        for (let j = primeSqaredIndex; j < upper; j += prime) {
+          seive[j] = false;
         }
+      }
     }
-    return primes;
-}
+
+    this._seive = seive;
+  }
+
+  isPrime(num) {
+    return num === 2
+      ? true
+      : num % 2 === 0
+        ? false
+        : this.isOddPrime(num);
+  }
+
+  isOddPrime(num) {
+    return this._seive[(num - 3) / 2];
+  }
+};
 
 function sumPrimes(num) {
-  return eratosthenesArray(num+1).reduce(function(a,b) {return a+b;}, 0);
+  const primeSeive = new PrimeSeive(num);
+
+  let sum = 2;
+  for (let i = 3; i <= num; i += 2) {
+    if (primeSeive.isOddPrime(i)) sum += i;
+  }
+  return sum;
 }
 
 sumPrimes(10);
diff --git a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
index 2c1708d6d3e..80027fccb30 100644
--- a/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
+++ b/curriculum/challenges/ukrainian/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
@@ -79,23 +79,55 @@ assert(beagle.constructor === Dog);
 `beagle.eat()` має бути зазначеним на рядку `nom nom nom`
 
 ```js
-console.log = function (msg) {
-  throw msg;
-};
-assert.throws(() => beagle.eat(), 'nom nom nom');
+capture();
+beagle.eat();
+uncapture();
+assert(logOutput == 'nom nom nom');
 ```
 
 `beagle.bark()` має бути зазначеним на рядку `Woof!`
 
 ```js
-console.log = function (msg) {
-  throw msg;
-};
-assert.throws(() => beagle.bark(), 'Woof!');
+capture();
+beagle.bark();
+uncapture();
+assert(logOutput == 'Woof!');
 ```
 
 # --seed--
 
+## --before-user-code--
+
+```js
+var logOutput = "";
+var originalConsole = console
+function capture() {
+    var nativeLog = console.log;
+    console.log = function (message) {
+        logOutput = message;
+        if(nativeLog.apply) {
+          nativeLog.apply(originalConsole, arguments);
+        } else {
+          var nativeMsg = Array.prototype.slice.apply(arguments).join(' ');
+          nativeLog(nativeMsg);
+        }
+    };
+}
+
+function uncapture() {
+  console.log = originalConsole.log;
+}
+
+capture();
+```
+
+## --after-user-code--
+
+```js
+uncapture();
+(function() { return logOutput || "console.log never called"; })();
+```
+
 ## --seed-contents--
 
 ```js
diff --git a/curriculum/challenges/ukrainian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md b/curriculum/challenges/ukrainian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
index 8994e51bdb1..6a9c9e0e9c7 100644
--- a/curriculum/challenges/ukrainian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
+++ b/curriculum/challenges/ukrainian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-25-5-clock.md
@@ -8,7 +8,7 @@ dashedName: build-a-25--5-clock
 
 # --description--
 
-**Мета:** Створити застосунок, функціонально схожий до цього: <a href="https://codepen.io/freeCodeCamp/full/XpKrrW" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/XpKrrW</a>.
+**Мета:** створити застосунок, функціонально схожий до цього: <a href="https://25--5-clock.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://25--5-clock.freecodecamp.rocks</a>.
 
 Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
diff --git a/curriculum/challenges/ukrainian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md b/curriculum/challenges/ukrainian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
index ca7095ea6e3..add30799e5b 100644
--- a/curriculum/challenges/ukrainian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
+++ b/curriculum/challenges/ukrainian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-drum-machine.md
@@ -8,7 +8,7 @@ dashedName: build-a-drum-machine
 
 # --description--
 
-**Мета:** Створити застосунок, функціонально схожий до цього: <a href="https://codepen.io/freeCodeCamp/full/MJyNMd" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/MJyNMd</a>.
+**Мета:** створити застосунок, функціонально схожий до цього: <a href="https://drum-machine.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://drum-machine.freecodecamp.rocks/</a>.
 
 Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
@@ -28,9 +28,21 @@ dashedName: build-a-drum-machine
 
 **Історія користувача #7:** Коли `.drum-pad` запускається, рядок, що описує відповідний звуковий запис, відображається як внутрішній текст елемента `#display` (кожен рядок має бути унікальним).
 
-Ви можете створити свій проєкт, <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel="noopener noreferrer nofollow">використовуючи цей шаблон CodePen</a> і натиснувши `Save`. Або ви можете використати це посилання CDN для запуску тестів у будь-якому середовищі, яке вам подобається:`https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+Ось декілька зразків аудіо, які можна використовувати для драм-машини:
 
-Після того, як закінчите, надішліть URL-адресу до свого робочого проєкту з усіма його тестами.
+- [Heater 1](https://s3.amazonaws.com/freecodecamp/drums/Heater-1.mp3)
+- [Heater 2](https://s3.amazonaws.com/freecodecamp/drums/Heater-2.mp3)
+- [Heater 3](https://s3.amazonaws.com/freecodecamp/drums/Heater-3.mp3)
+- [Heater 4](https://s3.amazonaws.com/freecodecamp/drums/Heater-4_1.mp3)
+- [Clap](https://s3.amazonaws.com/freecodecamp/drums/Heater-6.mp3)
+- [Open-HH](https://s3.amazonaws.com/freecodecamp/drums/Dsc_Oh.mp3)
+- [Kick-n'-Hat](https://s3.amazonaws.com/freecodecamp/drums/Kick_n_Hat.mp3)
+- [Kick](https://s3.amazonaws.com/freecodecamp/drums/RP4_KICK_1.mp3)
+- [Closed-HH](https://s3.amazonaws.com/freecodecamp/drums/Cev_H2.mp3)
+
+Ви можете створити свій проєкт, <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel="noopener noreferrer nofollow">використовуючи цей шаблон CodePen</a> і натиснувши `Save`. Або ж ви можете скористатися цим посиланням на CDN, щоб запустити тести в будь-якому середовищі: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+
+Після того, як ви закінчите, надішліть URL-адресу свого робочого проєкту з усіма його пройденими тестами.
 
 # --solutions--
 
diff --git a/curriculum/challenges/ukrainian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md b/curriculum/challenges/ukrainian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
index 931045ee9b2..81f97a46ff8 100644
--- a/curriculum/challenges/ukrainian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
+++ b/curriculum/challenges/ukrainian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-javascript-calculator.md
@@ -8,7 +8,7 @@ dashedName: build-a-javascript-calculator
 
 # --description--
 
-**Мета:** Створити застосунок, функціонально схожий до цього: <a href="https://codepen.io/freeCodeCamp/full/wgGVVX" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/wgGVVX</a>.
+**Мета:** створити застосунок, функціонально схожий до цього: <a href="https://javascript-calculator.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://javascript-calculator.freecodecamp.rocks/</a>.
 
 Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
diff --git a/curriculum/challenges/ukrainian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md b/curriculum/challenges/ukrainian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
index 2b5294c6388..38eb62f081a 100644
--- a/curriculum/challenges/ukrainian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
+++ b/curriculum/challenges/ukrainian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-markdown-previewer.md
@@ -8,7 +8,7 @@ dashedName: build-a-markdown-previewer
 
 # --description--
 
-**Мета:** Створити застосунок, функціонально схожий до цього: <a href="https://codepen.io/freeCodeCamp/full/GrZVVO" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/GrZVVO</a>.
+**Мета:** створити застосунок, функціонально схожий до цього: <a href="https://markdown-previewer.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://markdown-previewer.freecodecamp.rocks/</a>.
 
 Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
diff --git a/curriculum/challenges/ukrainian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md b/curriculum/challenges/ukrainian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
index 2de2d5561a4..c5d0f456315 100644
--- a/curriculum/challenges/ukrainian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
+++ b/curriculum/challenges/ukrainian/03-front-end-development-libraries/front-end-development-libraries-projects/build-a-random-quote-machine.md
@@ -8,7 +8,7 @@ dashedName: build-a-random-quote-machine
 
 # --description--
 
-**Мета:** Створити застосунок, функціонально схожий до цього: <a href="https://codepen.io/freeCodeCamp/full/qRZeGZ" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/qRZeGZ</a>.
+**Мета:** створити застосунок, функціонально схожий до цього: <a href="https://random-quote-machine.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://random-quote-machine.freecodecamp.rocks/</a>.
 
 Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
diff --git a/curriculum/challenges/ukrainian/03-front-end-development-libraries/react-and-redux/moving-forward-from-here.md b/curriculum/challenges/ukrainian/03-front-end-development-libraries/react-and-redux/moving-forward-from-here.md
index ed112fe2b74..6ba7fa75c4e 100644
--- a/curriculum/challenges/ukrainian/03-front-end-development-libraries/react-and-redux/moving-forward-from-here.md
+++ b/curriculum/challenges/ukrainian/03-front-end-development-libraries/react-and-redux/moving-forward-from-here.md
@@ -10,7 +10,7 @@ dashedName: moving-forward-from-here
 
 Вітаємо! Ви закінчили уроки з React та Redux. Є ще одна річ, на яку варто звернути увагу, перш ніж рухатися далі. Як правило, ви не будете писати програми React в редакторі коду, як цей. Це завдання дає вам уявлення про те, як виглядає синтаксис, якщо ви працюєте з npm і файловою системою на своєму пристрої. Код повинен виглядати подібно, за винятком використання команд `import` (які викличуть усі залежності, які були передбачені для вас у завданнях). Розділ "Керування пакунками з npm" містить детальнішу інформацію про npm.
 
-Зрештою, написання коду React і Redux зазвичай вимагає певного налаштування. Це може швидко ускладнитись. Якщо вам цікаво експериментувати на власному пристрої, <a href="https://github.com/facebookincubator/create-react-app" target="_blank" rel="nofollow">Create React App</a> вже є налаштованим та готовим до роботи.
+Зрештою, написання коду React і Redux зазвичай вимагає певного налаштування. Це може швидко ускладнитись. Якщо вам цікаво експериментувати на власному пристрої, <a href="https://www.freecodecamp.org/news/install-react-with-create-react-app/" target="_blank" rel="noopener noreferrer nofollow">Create React App</a> вже є налаштованим та готовим до роботи.
 
 Крім того, ви можете включити Babel як JavaScript Preprocessor в CodePen, додати React і ReactDOM як зовнішні ресурси JavaScript, а також працювати там.
 
diff --git a/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/create-a-stateful-component.md b/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/create-a-stateful-component.md
index f87bc81152f..b9793373bc6 100644
--- a/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/create-a-stateful-component.md
+++ b/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/create-a-stateful-component.md
@@ -22,7 +22,7 @@ this.state = {
 
 # --instructions--
 
-У кодовому редакторі є компонент, який намагається візуалізувати властивість `name` з його `state`. Однак, `state` є невизначеним. Ініціалізуйте компонент з `state` в `constructor` і призначте ваше ім'я до властивості `name`.
+У кодовому редакторі є компонент, який намагається візуалізувати властивість `firstName` з його `state`. Однак, `state` є невизначеним. Ініціалізуйте компонент з `state` в `constructor` і призначте своє ім'я до властивості `firstName`.
 
 # --hints--
 
@@ -55,7 +55,7 @@ assert(
 );
 ```
 
-Стан `StatefulComponent` повинен бути ініціалізований з властивістю `name`, яка встановлена на рядок.
+Стан `StatefulComponent` повинен бути ініціалізований з властивістю `firstName`, яка встановлена на рядок.
 
 ```js
 assert(
@@ -65,13 +65,13 @@ assert(
     );
     const initialState = mockedComponent.state();
     return (
-      typeof initialState === 'object' && typeof initialState.name === 'string'
+      typeof initialState === 'object' && typeof initialState.firstName === 'string'
     );
   })()
 );
 ```
 
-Значення `name` у стані `StatefulComponent` повинне візуалізувати елемент `h1`.
+Властивість `firstName` у стані `StatefulComponent` повинна візуалізуватись в елементі `h1`.
 
 ```js
 assert(
@@ -80,7 +80,7 @@ assert(
       React.createElement(StatefulComponent)
     );
     const initialState = mockedComponent.state();
-    return mockedComponent.find('h1').text() === initialState.name;
+    return mockedComponent.find('h1').text() === initialState.firstName;
   })()
 );
 ```
@@ -106,7 +106,7 @@ class StatefulComponent extends React.Component {
   render() {
     return (
       <div>
-        <h1>{this.state.name}</h1>
+        <h1>{this.state.firstName}</h1>
       </div>
     );
   }
@@ -120,13 +120,13 @@ class StatefulComponent extends React.Component {
   constructor(props) {
     super(props);
     this.state = {
-      name: 'freeCodeCamp!'
+      firstName: 'freeCodeCamp!'
     }
   }
   render() {
     return (
       <div>
-        <h1>{this.state.name}</h1>
+        <h1>{this.state.firstName}</h1>
       </div>
     );
   }
diff --git a/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/introducing-inline-styles.md b/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/introducing-inline-styles.md
index e62ae45d581..78d00886ae2 100644
--- a/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/introducing-inline-styles.md
+++ b/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/introducing-inline-styles.md
@@ -8,7 +8,7 @@ dashedName: introducing-inline-styles
 
 # --description--
 
-Наявні інші складні концепції, що додають потужних можливостей для вашого коду React. Проте вас може зацікавити, більш проста задача, як стилізувати ті JSX елементи, які ви створюєте в React. Ви, можливо, знаєте, що це не буде в точності теж саме, що і робота з HTML, тому що [ це спосіб, за допомогою якого ви застосовуєте класи до JSX елементів](/learn/front-end-development-libraries/react/define-an-html-class-in-jsx).
+Наявні інші складні концепції, що додають потужних можливостей для вашого коду React. Проте вас може зацікавити, більш проста задача, як стилізувати ті JSX елементи, які ви створюєте в React. Ви, можливо, знаєте, що це не буде в точності теж саме, що і робота з HTML, тому що <a href="/learn/front-end-development-libraries/react/define-an-html-class-in-jsx" target="_blank" rel="noopener noreferrer nofollow"> є способом, за допомогою якого ви застосовуєте класи до JSX елементів</a>.
 
 Якщо ви імпортували стилі із таблиці стилів, то не суттєво відрізняється. Ви застосовуєте класи для вашого JSX елементу, користуючись `className` атрибута, також використовуєте стилі класу до вашої таблиці стилів. Інший варіант – це застосувати вбудовані стилі, які дуже поширені в розробці ReactJS.
 
diff --git a/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/render-conditionally-from-props.md b/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/render-conditionally-from-props.md
index 4d57f5580e7..fd86d23e580 100644
--- a/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/render-conditionally-from-props.md
+++ b/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/render-conditionally-from-props.md
@@ -8,7 +8,7 @@ dashedName: render-conditionally-from-props
 
 # --description--
 
-Поки ви бачили, як використовувати `if/else`, `&&` та трикомпонентний оператор (`condition ? expressionIfTrue : expressionIfFalse`) для прийняття умовних рішень про те, що треба рендерити та коли. Проте залишилася ще одна важлива для огляду тема, вивчення якої дозволить поєднувати всі ці поняття з іншою потужною функцією React: пропс. Використання пропсів для умовного рендерингу коду є дуже поширеним явищем серед React-розробників, таким чином, вони використовують значення даного пропсу для автоматичного прийняття рішень про те, що рендерити.
+Наразі ви бачили, як використовувати `if/else`, `&&` та тернарний оператор (`condition ? expressionIfTrue : expressionIfFalse`), щоб приймати умовні рішення про те, що і коли відображати. Проте залишилася ще одна важлива для огляду тема, вивчення якої дозволить поєднувати всі ці поняття з іншою потужною функцією React: пропси. Використання пропсів для умовного рендерингу коду є дуже поширеним явищем серед React-розробників: вони використовують значення даного пропсу для автоматичного прийняття рішень про те, що відображати.
 
 В цьому завданні вам доведеться налаштовувати дочірній компонент задля прийняття рішень на основі пропс стосовно рендерингу. Також ви зіштовхнетеся з використанням трикомпонентного оператора та побачите, як деякі з інших, описаних у минулих завданнях, понять можуть бути настільки ж корисними у даному контексті.
 
@@ -123,7 +123,7 @@ assert.strictEqual(
 })();
 ```
 
-Коли компонент `GameOfChance` спочатку підключається до DOM, і далі, після кожного натискання кнопки, має повертатися одинарний елемент `h1`, який випадковим чином відображає або `You Win!`, або `You Lose!`.
+Коли компонент `GameOfChance` підключається спочатку до DOM і після того, як натискають на кнопку, має повертатися одинарний елемент `h1`, який випадковим чином показує `You Win!` або `You Lose!`. Примітка: це може випадково вийти з ладу. Якщо це сталося, спробуйте ще раз.
 
 ```js
 (() => {
@@ -265,6 +265,11 @@ class GameOfChance extends React.Component {
 # --solutions--
 
 ```jsx
+// We want this to be deterministic for testing purposes.
+const randomSequence = [true, false, false, true, true, false, false, true, true, false];
+let index = 0;
+const fiftyFifty = () => randomSequence[index++ % randomSequence.length];
+
 class Results extends React.Component {
   constructor(props) {
     super(props);
@@ -290,11 +295,10 @@ class GameOfChance extends React.Component {
     });
   }
   render() {
-    const expression = Math.random() >= 0.5;
     return (
       <div>
         <button onClick={this.handleClick}>Play Again</button>
-        <Results fiftyFifty={expression} />
+        <Results fiftyFifty={fiftyFifty()} />
         <p>{'Turn: ' + this.state.counter}</p>
       </div>
     );
diff --git a/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/set-state-with-this.setstate.md b/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/set-state-with-this.setstate.md
index 79e8af494f2..455a04f2b10 100644
--- a/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/set-state-with-this.setstate.md
+++ b/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/set-state-with-this.setstate.md
@@ -16,7 +16,7 @@ this.setState({
 });
 ```
 
-React очікує, що ви ніколи не будете змінювати `state` безпосередньо, натомість завжди будете використовувати `this.setState()`, коли відбуваються зміни стану. Також зверніть увагу на те, що React може пакетно оновлювати кілька станів, щоб покращити продуктивність. Це означає, що оновлення стану за допомогою методу `setState` можуть бути асинхронними. Існує альтернативний синтаксис для методу `setState`, який дозволяє обійти цю проблему. Він використовується рідко, але добре мати його на увазі! Для отримання додаткової інформації зверніться до [React документації](https://reactjs.org/docs/state-and-lifecycle.html#state-updates-may-be-asynchronous).
+React очікує, що ви ніколи не будете змінювати `state` безпосередньо, натомість завжди будете використовувати `this.setState()`, коли відбуваються зміни стану. Також зверніть увагу на те, що React може пакетно оновлювати кілька станів, щоб покращити продуктивність. Це означає, що оновлення стану за допомогою методу `setState` можуть бути асинхронними. Існує альтернативний синтаксис для методу `setState`, який дозволяє обійти цю проблему. Він використовується рідко, але добре мати його на увазі! Для отримання додаткової інформації, див. <a href="https://www.freecodecamp.org/news/what-is-state-in-react-explained-with-examples/" target="_blank" rel="noopener noreferrer nofollow">публікацію про React</a>.
 
 # --instructions--
 
diff --git a/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/use-array.map-to-dynamically-render-elements.md b/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/use-array.map-to-dynamically-render-elements.md
index 9702f011112..222b14f31e0 100644
--- a/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/use-array.map-to-dynamically-render-elements.md
+++ b/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/use-array.map-to-dynamically-render-elements.md
@@ -16,7 +16,7 @@ dashedName: use-array-map-to-dynamically-render-elements
 
 У редакторі вже встановлено більшість компонентів `MyToDoList`. Дещо з цього коду може виглядати знайомо, якщо ви виконали завдання з контрольованої форми. Можна помітити `textarea` і `button`, так само як і кільки методів, що відстежують стан, але на сторінці ще нічого немає.
 
-У `constructor` створіть об'єкт `this.state` і виділіть 2 стани: `userInput` має ініціалізуватися як порожній рядок, а `toDoList`- як порожній масив. Далі видаліть коментар з методу `render()` поруч зі змінною `items`. Натомість нанесіть на карту масив `toDoList`, збережений у внутрішньому стані компонента і динамічно виведіть `li` для кожного об'єкта. Спробуйте відобразити рядок `eat, code, sleep, repeat` у `textarea`, а потім натисніть на кнопку і подивіться, що трапиться.
+У `constructor` створіть об'єкт `this.state` і виділіть 2 стани: `userInput` має ініціалізуватися як порожній рядок, а `toDoList`- як порожній масив. Далі видаліть значення `null` з методу `render()` поруч зі змінною `items`. Натомість нанесіть на карту масив `toDoList`, збережений у внутрішньому стані компонента і динамічно виведіть `li` для кожного об'єкта. Спробуйте відобразити рядок `eat, code, sleep, repeat` у `textarea`, а потім натисніть на кнопку і подивіться, що трапиться.
 
 **Note:** Ви, можливо, знаєте, що всі дочірні елементи, створені за допомогою такої операції, мають бути оснащені унікальним атрибутом `key`. Не хвилюйтесь, це тема наступного завдання.
 
diff --git a/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/use-proptypes-to-define-the-props-you-expect.md b/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/use-proptypes-to-define-the-props-you-expect.md
index 4353c41d384..fe730f54c50 100644
--- a/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/use-proptypes-to-define-the-props-you-expect.md
+++ b/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/use-proptypes-to-define-the-props-you-expect.md
@@ -16,7 +16,7 @@ React має корисні функції перевірки типу пара
 MyComponent.propTypes = { handleClick: PropTypes.func.isRequired }
 ```
 
-У даному прикладі, частина `PropTypes.func` перевіряє, чи є `handleClick` функцією. Додавання `isRequired` говорить React, що `handleClick` - це відповідне значення для даного компонента. З'явиться повідомлення, якщо цього параметру не буде. Також зверніть увагу, що `func` означає `function`. Серед семи простих типів JavaScript, лише `function` й `boolean` (написаний як `bool`) пишуться незвично. На додаток до цих простих типів, є й інші. Наприклад, можете перевірити, чи є параметр елементом React. Будь ласка, зверніться до [документації](https://reactjs.org/docs/typechecking-with-proptypes.html#proptypes), щоб дізнатися про інші варіанти.
+У даному прикладі, частина `PropTypes.func` перевіряє, чи є `handleClick` функцією. Додавання `isRequired` говорить React, що `handleClick` - це відповідне значення для даного компонента. З'явиться повідомлення, якщо цього параметру не буде. Також зверніть увагу, що `func` означає `function`. Серед семи простих типів JavaScript, лише `function` й `boolean` (написаний як `bool`) пишуться незвично. На додаток до цих простих типів, є й інші. Наприклад, можете перевірити, чи є параметр елементом React. Будь ласка, зверніться до <a href="https://reactjs.org/docs/typechecking-with-proptypes.html#proptypes" target="_blank" rel="noopener noreferrer nofollow">документації</a>, щоб дізнатися про інші варіанти.
 
 **Note:** у React v15.5.0 `PropTypes` імпортується незалежно від React, ось так: `import PropTypes from 'prop-types';`
 
diff --git a/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/use-the-lifecycle-method-componentwillmount.md b/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/use-the-lifecycle-method-componentwillmount.md
index f79e34f7da7..665b958666b 100644
--- a/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/use-the-lifecycle-method-componentwillmount.md
+++ b/curriculum/challenges/ukrainian/03-front-end-development-libraries/react/use-the-lifecycle-method-componentwillmount.md
@@ -10,7 +10,7 @@ dashedName: use-the-lifecycle-method-componentwillmount
 
 Компоненти у React мають декілька спеціальних методів, що забезпечують можливість виконувати дії у визначений час у їхньому життєвому циклі. Вони називаються методами життєвого циклу, чи перехоплювачами життєвого циклу і дозволяють виловити компонент у визначений час. Це може бути до того, як вони будуть показані, перш ніж вони оновляться, перш ніж вони отримають реквізити, перш ніж від'єднати і так далі. Ось список декількох методів життєвого циклу: `componentWillMount()` `componentDidMount()` `shouldComponentUpdate()` `componentDidUpdate()` `componentWillUnmount()`. Протягом наступних уроків розглянемо деякі основні випадки використання даних методів.
 
-**Примітка:** метод життєвого циклу `componentWillMount` буде виключено з майбутньої версії 16.X і видалено з версії 17. [(Джерело)](https://reactjs.org/blog/2018/03/27/update-on-async-rendering.html)
+**Примітка:** метод життєвого циклу `componentWillMount` буде виключено з майбутньої версії 16.X і видалено з версії 17. Дізнайтесь більше у цій <a href="https://www.freecodecamp.org/news/how-to-safely-use-reacts-life-cycles-with-fiber-s-async-rendering-fd4469ebbd8f/" target="_blank" rel="noopener noreferrer nofollow">публікації</a>
 
 # --instructions--
 
diff --git a/curriculum/challenges/ukrainian/03-front-end-development-libraries/redux/create-a-redux-store.md b/curriculum/challenges/ukrainian/03-front-end-development-libraries/redux/create-a-redux-store.md
index 0bb0a5c52b0..346655b7b43 100644
--- a/curriculum/challenges/ukrainian/03-front-end-development-libraries/redux/create-a-redux-store.md
+++ b/curriculum/challenges/ukrainian/03-front-end-development-libraries/redux/create-a-redux-store.md
@@ -20,7 +20,7 @@ Redux `store` (сховище) - це об'єкт, який містить та
 
 Вкажіть `store` змінною та призначте її методу `createStore()`, передавши у `reducer` як аргумент.
 
-**Примітка:** код в редакторі за замовчуванням використовує синтаксис аргументів ES6 для ініціалізаціїї цього стану для утримання значення `5`. Якщо ви не знайомі з аргументами за замовчуванням, ви можете дізнатися більше у [секції ES6 в Навчальному плані ](https://learn.freecodecamp.org/javascript-algorithms-and-data-structures/es6/set-default-parameters-for-your-functions), що охоплює цю тему.
+**Примітка:** код в редакторі за замовчуванням використовує синтаксис аргументів ES6 для ініціалізаціїї цього стану для утримання значення `5`. Якщо ви не знайомі з аргументами за замовчуванням, ви можете дізнатися більше у <a href="https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/es6/set-default-parameters-for-your-functions" target="_blank" rel="noopener noreferrer nofollow">розділі навчальної програми ES6</a>, що охоплює цю тему.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md b/curriculum/challenges/ukrainian/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
index 0259b9d07c2..81453f98a4f 100644
--- a/curriculum/challenges/ukrainian/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
+++ b/curriculum/challenges/ukrainian/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
@@ -8,7 +8,7 @@ dashedName: visualize-data-with-a-bar-chart
 
 # --description--
 
-**Мета:** Створити застосунок, функціонально схожий до цього: <a href="https://codepen.io/freeCodeCamp/full/GrZVaM" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/GrZVaM</a>.
+**Мета:** створити застосунок, функціонально схожий до цього: <a href="https://bar-chart.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://bar-chart.freecodecamp.rocks</a>.
 
 Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
diff --git a/curriculum/challenges/ukrainian/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md b/curriculum/challenges/ukrainian/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
index 768c766ddf8..e2043e13e8c 100644
--- a/curriculum/challenges/ukrainian/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
+++ b/curriculum/challenges/ukrainian/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
@@ -8,7 +8,7 @@ dashedName: visualize-data-with-a-choropleth-map
 
 # --description--
 
-**Мета:** Створити застосунок, функціонально схожий до цього: <a href="https://codepen.io/freeCodeCamp/full/EZKqza" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/EZKqza</a>.
+**Мета:** створити застосунок, функціонально схожий до цього: <a href="https://choropleth-map.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://choropleth-map.freecodecamp.rocks</a>.
 
 Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
diff --git a/curriculum/challenges/ukrainian/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md b/curriculum/challenges/ukrainian/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
index 87eb83cee53..7354d63cd3c 100644
--- a/curriculum/challenges/ukrainian/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
+++ b/curriculum/challenges/ukrainian/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
@@ -8,7 +8,7 @@ dashedName: visualize-data-with-a-heat-map
 
 # --description--
 
-**Мета:** Створити застосунок, функціонально схожий до цього: <a href="https://codepen.io/freeCodeCamp/full/JEXgeY" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/JEXgeY</a>.
+**Мета:** створити застосунок, функціонально схожий до цього: <a href="https://heat-map.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://heat-map.freecodecamp.rocks</a>.
 
 Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
diff --git a/curriculum/challenges/ukrainian/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md b/curriculum/challenges/ukrainian/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
index 815e8311c60..6ec3542f951 100644
--- a/curriculum/challenges/ukrainian/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
+++ b/curriculum/challenges/ukrainian/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
@@ -8,7 +8,7 @@ dashedName: visualize-data-with-a-scatterplot-graph
 
 # --description--
 
-**Мета:** Створити застосунок, функціонально схожий до цього: <a href="https://codepen.io/freeCodeCamp/full/bgpXyK" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/bgpXyK</a>.
+**Мета:** створити застосунок, функціонально схожий до цього: <a href="https://scatterplot-graph.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://scatterplot-graph.freecodecamp.rocks</a>.
 
 Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
diff --git a/curriculum/challenges/ukrainian/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md b/curriculum/challenges/ukrainian/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
index d43929a961f..6290f235c3e 100644
--- a/curriculum/challenges/ukrainian/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
+++ b/curriculum/challenges/ukrainian/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
@@ -8,7 +8,7 @@ dashedName: visualize-data-with-a-treemap-diagram
 
 # --description--
 
-**Мета:** Створити застосунок, функціонально схожий до цього: <a href="https://codepen.io/freeCodeCamp/full/KaNGNR" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/KaNGNR</a>.
+**Мета:** створити застосунок, функціонально схожий до цього: <a href="https://treemap-diagram.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://treemap-diagram.freecodecamp.rocks</a>.
 
 Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
diff --git a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/back-end-development-and-apis-projects/exercise-tracker.md b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/back-end-development-and-apis-projects/exercise-tracker.md
index 3575d4d6d79..df9658f68c0 100644
--- a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/back-end-development-and-apis-projects/exercise-tracker.md
+++ b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/back-end-development-and-apis-projects/exercise-tracker.md
@@ -8,10 +8,10 @@ dashedName: exercise-tracker
 
 # --description--
 
-Створіть full stack додаток на JavaScript, який функціонально схожий до цього: <https://exercise-tracker.freecodecamp.rocks/>. Робота над цим проектом залучатиме тебе писати свій код використовуючи один з наступних методів:
+Створіть повний пакет додатку JavaScript, який функціонально схожий до <a href="https://exercise-tracker.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://exercise-tracker.freecodecamp.rocks</a>. Робота над цим проектом залучатиме тебе писати свій код використовуючи один з наступних методів:
 
--   Клонувати [цей репозиторій з GitHub](https://github.com/freeCodeCamp/boilerplate-project-exercisetracker/) та локально завершити свій проект.
--   Використати [наш проект для початківців на Replit](https://replit.com/github/freeCodeCamp/boilerplate-project-exercisetracker) для завершення свого проекту.
+-   Клонуйте <a href="https://github.com/freeCodeCamp/boilerplate-project-exercisetracker/" target="_blank" rel="noopener noreferrer nofollow">цей репозиторій GitHub</a> та виконайте свій проєкт локально.
+-   Використайте <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-exercisetracker" target="_blank" rel="noopener noreferrer nofollow">наш стартовий проєкт Replit</a> для виконання свого проєкту.
 -   Використати конструктор сайтів на свій вибір для завершення проекту. Впевніться, що ви зберегли всі файли із нашого GitHub репозиторію.
 
 По завершенню переконайтеся, що працююча демоверсія вашого проекту розміщена у відкритому доступі. Потім введіть його URL-адресу в поле `Solution Link`. За бажанням також можете ввести посилання на вихідний код вашого проекту в полі `GitHub Link`.
@@ -79,7 +79,7 @@ async (getUserInput) => {
   const res = await fetch(url + '/api/users', {
     method: 'POST',
     headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
-    body: `username=fcc_test_${Date.now()}`.substr(0, 29)
+    body: `username=fcc_test_${Date.now()}`.substring(0, 29)
   });
   assert.isTrue(res.ok);
   if(!res.ok) {
@@ -96,7 +96,7 @@ async (getUserInput) => {
   const res = await fetch(url + '/api/users', {
     method: 'POST',
     headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
-    body: `username=fcc_test_${Date.now()}`.substr(0, 29)
+    body: `username=fcc_test_${Date.now()}`.substring(0, 29)
   });
   if (res.ok) {
     const { _id, username } = await res.json();
@@ -164,7 +164,7 @@ async (getUserInput) => {
   const res = await fetch(url + '/api/users', {
     method: 'POST',
     headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
-    body: `username=fcc_test_${Date.now()}`.substr(0, 29)
+    body: `username=fcc_test_${Date.now()}`.substring(0, 29)
   });
   if (res.ok) {
     const { _id, username } = await res.json();
@@ -198,7 +198,7 @@ async (getUserInput) => {
   const res = await fetch(url + '/api/users', {
     method: 'POST',
     headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
-    body: `username=fcc_test_${Date.now()}`.substr(0, 29)
+    body: `username=fcc_test_${Date.now()}`.substring(0, 29)
   });
   if (res.ok) {
     const { _id, username } = await res.json();
@@ -237,7 +237,7 @@ async (getUserInput) => {
   const res = await fetch(url + '/api/users', {
     method: 'POST',
     headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
-    body: `username=fcc_test_${Date.now()}`.substr(0, 29)
+    body: `username=fcc_test_${Date.now()}`.substring(0, 29)
   });
   if (res.ok) {
     const { _id, username } = await res.json();
@@ -276,7 +276,7 @@ async (getUserInput) => {
   const res = await fetch(url + '/api/users', {
     method: 'POST',
     headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
-    body: `username=fcc_test_${Date.now()}`.substr(0, 29)
+    body: `username=fcc_test_${Date.now()}`.substring(0, 29)
   });
   if (res.ok) {
     const { _id, username } = await res.json();
@@ -309,7 +309,7 @@ async (getUserInput) => {
 };
 ```
 
-Запит `GET` на `/api/users/:id/logs` поверне об'єкт користувача з `log`, - масивом всіх доданих вправ.
+A `GET` request to `/api/users/:_id/logs` will return the user object with a `log` array of all the exercises added.
 
 ```js
 async(getUserInput) => {
@@ -319,7 +319,7 @@ async(getUserInput) => {
     headers: {
       'Content-Type': 'application/x-www-form-urlencoded'
     },
-    body: `username=fcc_test_${Date.now()}`.substr(0, 29)
+    body: `username=fcc_test_${Date.now()}`.substring(0, 29)
   })
   if(res.ok){
     const {_id, username} = await res.json();
@@ -353,7 +353,7 @@ async(getUserInput) => {
 };
 ```
 
-Кожен елемент у масиві `log`, який повернувся з `GET /api/users/:id/logs` це об'єкт, який повинен мати `description` `duration` і `date` властивості.
+Each item in the `log` array that is returned from `GET /api/users/:_id/logs` is an object that should have a `description`, `duration`, and `date` properties.
 
 ```js
 async(getUserInput) => {
@@ -363,7 +363,7 @@ async(getUserInput) => {
     headers: {
       'Content-Type': 'application/x-www-form-urlencoded'
     },
-    body: `username=fcc_test_${Date.now()}`.substr(0, 29)
+    body: `username=fcc_test_${Date.now()}`.substring(0, 29)
   });
   if(res.ok) {
     const {_id, username} = await res.json();
@@ -400,7 +400,7 @@ async(getUserInput) => {
 };
 ```
 
-Властивість `description` будь-якого об'єкту в масиві `log`, що повернувся з `GET /api/users/:id/logs` повинен бути рядкового типу.
+The `description` property of any object in the `log` array that is returned from `GET /api/users/:_id/logs` should be a string.
 
 ```js
 async(getUserInput) => {
@@ -410,7 +410,7 @@ async(getUserInput) => {
     headers: {
       'Content-Type': 'application/x-www-form-urlencoded',
     },
-    body: `username=fcc_test_${Date.now()}`.substr(0,29)
+    body: `username=fcc_test_${Date.now()}`.substring(0,29)
   });
   if(res.ok) {
     const {_id, username} = await res.json();
@@ -447,7 +447,7 @@ async(getUserInput) => {
 };
 ```
 
-Властивість `duration` будь-якого об'єкту в масиві `log`, що повернувся з `GET /api/users/:id/logs`, повинна бути числового типу.
+The `duration` property of any object in the `log` array that is returned from `GET /api/users/:_id/logs` should be a number.
 
 ```js
 async(getUserInput) => {
@@ -457,7 +457,7 @@ async(getUserInput) => {
     headers: {
       'Content-Type': 'application/x-www-form-urlencoded',
     },
-    body: `username=fcc_test_${Date.now()}`.substr(0,29)
+    body: `username=fcc_test_${Date.now()}`.substring(0,29)
   });
   if(res.ok) {
     const {_id, username} = await res.json();
@@ -494,7 +494,7 @@ async(getUserInput) => {
 };
 ```
 
-Властивість `date` будь-якого об'єкту в масиві `log`, що повернувся з `GET /api/users/:id/logs`, повинна бути рядкового типу.. Використовуйте `dateString` формат з `Date` API.
+The `date` property of any object in the `log` array that is returned from `GET /api/users/:_id/logs` should be a string. Використовуйте `dateString` формат з `Date` API.
 
 ```js
 async(getUserInput) => {
@@ -504,7 +504,7 @@ async(getUserInput) => {
     headers: {
       'Content-Type': 'application/x-www-form-urlencoded',
     },
-    body: `username=fcc_test_${Date.now()}`.substr(0,29)
+    body: `username=fcc_test_${Date.now()}`.substring(0,29)
   });
   if(res.ok) {
     const {_id, username} = await res.json();
@@ -549,7 +549,7 @@ async (getUserInput) => {
   const res = await fetch(url + '/api/users', {
     method: 'POST',
     headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
-    body: `username=fcc_test_${Date.now()}`.substr(0, 29)
+    body: `username=fcc_test_${Date.now()}`.substring(0, 29)
   });
   if (res.ok) {
     const { _id, username } = await res.json();
diff --git a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/back-end-development-and-apis-projects/timestamp-microservice.md b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/back-end-development-and-apis-projects/timestamp-microservice.md
index 5bb3dc83668..70ef925d34e 100644
--- a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/back-end-development-and-apis-projects/timestamp-microservice.md
+++ b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/back-end-development-and-apis-projects/timestamp-microservice.md
@@ -8,10 +8,10 @@ dashedName: timestamp-microservice
 
 # --description--
 
-Створіть full stack додаток на JavaScript, який функціонально схожий до цього: <https://timestamp-microservice.freecodecamp.rocks/>. Робота над цим проектом залучатиме тебе писати свій код використовуючи один з наступних методів:
+Створіть повний пакет додатку JavaScript, який функціонально схожий до <a href="https://timestamp-microservice.freecodecamp.rocks" target="_blank" rel="noopener noreferrer nofollow">https://timestamp-microservice.freecodecamp.rocks</a>. Робота над цим проектом залучатиме тебе писати свій код використовуючи один з наступних методів:
 
--   Клонувати [цей репозиторій з GitHub](https://github.com/freeCodeCamp/boilerplate-project-timestamp/) та локально завершити свій проект.
--   Використати [наш проект для початківців на Replit](https://replit.com/github/freeCodeCamp/boilerplate-project-timestamp) для завершення свого проекту.
+-   Клонуйте <a href="https://github.com/freeCodeCamp/boilerplate-project-timestamp/"  target="_blank" rel="noopener noreferrer nofollow">цей репозиторій GitHub</a> та виконайте свій проєкт локально.
+-   Використайте <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-timestamp"  target="_blank" rel="noopener noreferrer nofollow">наш стартовий проєкт Replit</a> для виконання свого проєкту.
 -   Використати конструктор сайтів на свій вибір для завершення проекту. Впевніться, що ви зберегли всі файли із нашого GitHub репозиторію.
 
 По завершенню переконайтеся, що працююча демоверсія вашого проєкту розміщена у відкритому доступі. Потім введіть його URL-адресу в поле `Solution Link`. За бажанням також можете ввести посилання на вихідний код вашого проєкту в полі `GitHub Link`.
@@ -30,7 +30,7 @@ dashedName: timestamp-microservice
 };
 ```
 
-Запит на `/api/:date?` з дійсною датою має повернути об’єкт JSON з `unix` ключем, який є часовою міткою Unix введеної дати в мілісекундах
+A request to `/api/:date?` with a valid date should return a JSON object with a `unix` key that is a Unix timestamp of the input date in milliseconds (as type Number)
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/basic-node-and-express/chain-middleware-to-create-a-time-server.md b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/basic-node-and-express/chain-middleware-to-create-a-time-server.md
index 58c83aa2639..a25c14a3f63 100644
--- a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/basic-node-and-express/chain-middleware-to-create-a-time-server.md
+++ b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/basic-node-and-express/chain-middleware-to-create-a-time-server.md
@@ -8,7 +8,7 @@ dashedName: chain-middleware-to-create-a-time-server
 
 # --description--
 
-Програмне забезпечення можна підключити за певним маршрутом за допомогою `app.METHOD(path, middlewareFunction)`. Підрограмне забезпечення також може бути поєднане всередині визначення маршруту.
+Програмне забезпечення можна підключити за певним маршрутом за допомогою `app.METHOD(path, middlewareFunction)`. Middleware can also be chained within a route definition.
 
 Розглянемо наступний приклад:
 
@@ -49,7 +49,7 @@ app.get('/user', function(req, res, next) {
   );
 ```
 
-/now кінцева точка повинна повернути час, який відтепер складає +/-20 сек
+The `/now` endpoint should return the current time.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/basic-node-and-express/use-body-parser-to-parse-post-requests.md b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/basic-node-and-express/use-body-parser-to-parse-post-requests.md
index 4bc0721107d..939e82a1c88 100644
--- a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/basic-node-and-express/use-body-parser-to-parse-post-requests.md
+++ b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/basic-node-and-express/use-body-parser-to-parse-post-requests.md
@@ -22,11 +22,11 @@ Content-Length: 20
 name=John+Doe&age=25
 ```
 
-Як ви можете побачити, тіло закодоване як рядок запиту. Це типовий формат, який використовується у HTML-формах. За допомогою Ajax, ви також можете використати JSON для обробки даних, що мають більш складну структуру. Існує також інший тип кодування: multipart/form-data. Цей файл використовується для завантаження бінарних файлів. У цій вправі ви будете використовувати тіло, кодоване посиланням. Щоб аналізувати дані, отримані з POST-запитів, необхідно встановити пакет `body-parser`. Цей пакет дозволяє використовувати низку підпрограмного забезпечення, який може декодувати дані в різних форматах.
+Як ви можете побачити, тіло закодоване як рядок запиту. Це типовий формат, який використовується у HTML-формах. За допомогою Ajax, ви також можете використати JSON для обробки даних, що мають більш складну структуру. Існує також інший тип кодування: multipart/form-data. Цей файл використовується для завантаження бінарних файлів. In this exercise, you will use a URL encoded body. To parse the data coming from POST requests, you must use the `body-parser` package. Цей пакет дозволяє використовувати низку підпрограмного забезпечення, який може декодувати дані в різних форматах.
 
 # --instructions--
 
-Встановіть модуль `body-parser` до вашого `package.json`. Тоді `require` його у верхній частині файлу. Збережіть його у змінній під назвою `bodyParser`. Проміжне програмне забезпечення, що має обробити Url-закодовані дані, повертається за допомогою `bodyParser.urlencoded({extended: false})`. Передайте функцію, повернуту попереднім викликом типу `app.use()`. Зазвичай підпрограмне забезпечення потрібно встановити перед маршрутами, які залежать від нього.
+`body-parser` has already been installed and is in your project's `package.json` file. `require` it at the top of the `myApp.js` file and store it in a variable named `bodyParser`. The middleware to handle URL encoded data is returned by `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.
 
 **Note:** `extended` це опція конфігурації, яка вказує `body-parser`, який парсинг необхідно використати. Коли `extended=false` він використовує класичне кодування `querystring` бібліотеки. Коли `extended=true` він використовує `qs` бібліотеку для парсингу.
 
diff --git a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/basic-node-and-express/use-the-.env-file.md b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/basic-node-and-express/use-the-.env-file.md
index 9c7971ce364..27591f29159 100644
--- a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/basic-node-and-express/use-the-.env-file.md
+++ b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/basic-node-and-express/use-the-.env-file.md
@@ -18,11 +18,11 @@ dashedName: use-the--env-file
 
 Створіть файл `.env` в основі каталогу вашого проєкту та збережіть в ньому змінну `MESSAGE_STYLE=uppercase`.
 
-Потім, в обробнику маршруту `/json` GET, який ви створили в останній задачі, перетворіть повідомлення об'єкта-відповіді у верхній регістр, якщо `process.env.MESSAGE_STYLE` дорівнює `uppercase`. Об'єкт відповіді має бути `{"message": "Hello json"}` або `{"message": "HELLO JSON"}`, в залежності від значення `MESSAGE_STYLE`.
+Then, in the `/json` GET route handler you created in the last challenge access `process.env.MESSAGE_STYLE` and transform the response object's `message` to uppercase if the variable equals `uppercase`. Об'єкт відповіді має бути `{"message": "Hello json"}` або `{"message": "HELLO JSON"}`, в залежності від значення `MESSAGE_STYLE`.
 
 **Примітка:** Якщо ви використовуєте Replit, ви не можете створити файл `.env`. Замість цього використовуйте вбудовану вкладку <dfn>SECRETS</dfn> для додавання змінної.
 
-При локальній роботі вам знадобиться пакет `dotenv`. Він завантажує змінні середовища з вашого `.env` файлу в `process.env`. Встановіть його з `npm install dotenv`. Тоді, зверху вашого `myApp.js` файлу, оберіть імпортувати та завантажити змінні з `require('dotenv').config()`.
+При локальній роботі вам знадобиться пакет `dotenv`. Він завантажує змінні середовища з вашого `.env` файлу в `process.env`. The `dotenv` package has already been installed, and is in your project's `package.json` file. At the top of your `myApp.js` file, import and load the variables with `require('dotenv').config()`.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/managing-packages-with-npm/expand-your-project-with-external-packages-from-npm.md b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/managing-packages-with-npm/expand-your-project-with-external-packages-from-npm.md
index f4605767ab1..7b44c482346 100644
--- a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/managing-packages-with-npm/expand-your-project-with-external-packages-from-npm.md
+++ b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/managing-packages-with-npm/expand-your-project-with-external-packages-from-npm.md
@@ -22,13 +22,13 @@ dashedName: expand-your-project-with-external-packages-from-npm
 
 # --instructions--
 
-Додайте версію пакету "2.14.0" у поле `dependencies` вашого файлу package.json.
+Add version "1.1.0" of the `@freecodecamp/example` package to the `dependencies` field of your `package.json` file.
 
-**Примітка:** Момент - це зручна бібліотека для дій з часом і днями.
+**Note:** `@freecodecamp/example` is a faux package used as a learning tool.
 
 # --hints--
 
-"взаємозв'язки" повинні включати "момент"
+`"dependencies"` should include `"@freecodecamp/example"`.
 
 ```js
 (getUserInput) =>
@@ -37,8 +37,8 @@ dashedName: expand-your-project-with-external-packages-from-npm
       var packJson = JSON.parse(data);
       assert.property(
         packJson.dependencies,
-        'moment',
-        '"dependencies" does not include "moment"'
+        '@freecodecamp/example',
+        '"dependencies" does not include "@freecodecamp/example"'
       );
     },
     (xhr) => {
@@ -47,7 +47,7 @@ dashedName: expand-your-project-with-external-packages-from-npm
   );
 ```
 
-версія "момент" повинна бути "2.14.0"
+`"@freecodecamp/example"` version should be `"1.1.0"`.
 
 ```js
 (getUserInput) =>
@@ -55,9 +55,9 @@ dashedName: expand-your-project-with-external-packages-from-npm
     (data) => {
       var packJson = JSON.parse(data);
       assert.match(
-        packJson.dependencies.moment,
-        /^[\^\~]?2\.14\.0/,
-        'Wrong version of "moment" installed. It should be 2.14.0'
+        packJson.dependencies["@freecodecamp/example"],
+        /^[\^\~]?1\.1\.0/,
+        'Wrong version of "@freecodecamp/example" installed. It should be 1.1.0'
       );
     },
     (xhr) => {
diff --git a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/managing-packages-with-npm/manage-npm-dependencies-by-understanding-semantic-versioning.md b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/managing-packages-with-npm/manage-npm-dependencies-by-understanding-semantic-versioning.md
index d2cc635dc45..cc841613c1a 100644
--- a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/managing-packages-with-npm/manage-npm-dependencies-by-understanding-semantic-versioning.md
+++ b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/managing-packages-with-npm/manage-npm-dependencies-by-understanding-semantic-versioning.md
@@ -20,11 +20,11 @@ dashedName: manage-npm-dependencies-by-understanding-semantic-versioning
 
 # --instructions--
 
-У розділі залежностей вашого файлу package.json, змініть версію моменту `version`, щоб вона відповідала ОСНОВНІЙ версії 2, ДРУГОРЯДНІЙ версії 10 та версії ПАТЧА 2
+In the dependencies section of your `package.json` file, change the version of `@freecodecamp/example` to match MAJOR version 1, MINOR version 2 and PATCH version 13
 
 # --hints--
 
-"dependencies" повинні містити "moment"
+`"dependencies"` should include `"@freecodecamp/example"`.
 
 ```js
 (getUserInput) =>
@@ -33,8 +33,8 @@ dashedName: manage-npm-dependencies-by-understanding-semantic-versioning
       var packJson = JSON.parse(data);
       assert.property(
         packJson.dependencies,
-        'moment',
-        '"dependencies" does not include "moment"'
+        '@freecodecamp/example',
+        '"dependencies" does not include "@freecodecamp/example"'
       );
     },
     (xhr) => {
@@ -43,7 +43,7 @@ dashedName: manage-npm-dependencies-by-understanding-semantic-versioning
   );
 ```
 
-версія "moment" повинна бути "2.10.2"
+`"@freecodecamp/example"` version should be `"1.2.13"`.
 
 ```js
 (getUserInput) =>
@@ -51,9 +51,9 @@ dashedName: manage-npm-dependencies-by-understanding-semantic-versioning
     (data) => {
       var packJson = JSON.parse(data);
       assert.equal(
-        packJson.dependencies.moment,
-        '2.10.2',
-        'Wrong version of "moment". It should be 2.10.2'
+        packJson.dependencies["@freecodecamp/example"],
+        '1.2.13',
+        'Wrong version of "@freecodecamp/example". It should be 1.2.13'
       );
     },
     (xhr) => {
diff --git a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/managing-packages-with-npm/remove-a-package-from-your-dependencies.md b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/managing-packages-with-npm/remove-a-package-from-your-dependencies.md
index 872fe1e5794..96532310ee1 100644
--- a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/managing-packages-with-npm/remove-a-package-from-your-dependencies.md
+++ b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/managing-packages-with-npm/remove-a-package-from-your-dependencies.md
@@ -12,17 +12,17 @@ dashedName: remove-a-package-from-your-dependencies
 
 Але що робити, якщо Ви бажаєте видалити більше не потрібний зовнішній пакет? Певно, Ви вже здогадалися, треба просто видалити відповідну пару "ключ-значення" цього пакету із залежностей.
 
-Видалення інших полів package.json також здійснюється цим методом
+This same method applies to removing other fields in your package.json as well.
 
 # --instructions--
 
-Видаліть пакет moment із залежностей.
+Remove the `@freecodecamp/example` package from your dependencies.
 
 **Примітка:** Переконайтесь, що після видалення пакету у Вас вказано правильну кількість ком.
 
 # --hints--
 
-"dependencies" не має містити "moment"
+`"dependencies"` should not include `"@freecodecamp/example"`.
 
 ```js
 (getUserInput) =>
@@ -31,8 +31,8 @@ dashedName: remove-a-package-from-your-dependencies
       var packJson = JSON.parse(data);
       assert.notProperty(
         packJson.dependencies,
-        'moment',
-        '"dependencies" still includes "moment"'
+        '@freecodecamp/example',
+        '"dependencies" still includes "@freecodecamp/example"'
       );
     },
     (xhr) => {
diff --git a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/managing-packages-with-npm/use-the-caret-character-to-use-the-latest-minor-version-of-a-dependency.md b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/managing-packages-with-npm/use-the-caret-character-to-use-the-latest-minor-version-of-a-dependency.md
index 191969f1435..058589b5322 100644
--- a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/managing-packages-with-npm/use-the-caret-character-to-use-the-latest-minor-version-of-a-dependency.md
+++ b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/managing-packages-with-npm/use-the-caret-character-to-use-the-latest-minor-version-of-a-dependency.md
@@ -10,7 +10,7 @@ dashedName: use-the-caret-character-to-use-the-latest-minor-version-of-a-depende
 
 Подібно символу тильда, про який ми дізналися в останньому завданні, npm дозволяє встановити найновіший ПАТЧ для залежності, символ карет (`^`) дозволяє npm також встановлювати майбутні оновлення. Відмінність полягає в тому, що символ карет дозволяє і ДРУГОРЯДНІ оновлення, і ПАТЧІ.
 
-Ваша поточна версія моменту повинна бути "~ 2.10.2", що дозволяє npm встановлювати останню версію 2.10.x. Якби ви використовували символ (^) як префікс версії замість цього, npm було б дозволено оновлюватись до будь-якої версії 2.xx.
+Your current version of `@freecodecamp/example` should be "~1.2.13" which allows npm to install to the latest 1.2.x version. If you were to use the caret (^) as a version prefix instead, npm would be allowed to update to any 1.x.x version.
 
 ```json
 "package": "^1.3.8"
@@ -20,13 +20,13 @@ dashedName: use-the-caret-character-to-use-the-latest-minor-version-of-a-depende
 
 # --instructions--
 
-Використовуйте символ (`^`), щоб встановити префікс версії моменту у ваших залежностях і дозволити npm оновити його до будь-якого оновлення ДРУГОРЯДНОЇ версії.
+Use the caret (`^`) to prefix the version of `@freecodecamp/example` in your dependencies and allow npm to update it to any new MINOR release.
 
 **Примітка:** Номери версій не слід змінювати.
 
 # --hints--
 
-"dependencies" повинні містити "moment"
+`"dependencies"` should include `"@freecodecamp/example"`.
 
 ```js
 (getUserInput) =>
@@ -35,8 +35,8 @@ dashedName: use-the-caret-character-to-use-the-latest-minor-version-of-a-depende
       var packJson = JSON.parse(data);
       assert.property(
         packJson.dependencies,
-        'moment',
-        '"dependencies" does not include "moment"'
+        '@freecodecamp/example',
+        '"dependencies" does not include "@freecodecamp/example"'
       );
     },
     (xhr) => {
@@ -45,7 +45,7 @@ dashedName: use-the-caret-character-to-use-the-latest-minor-version-of-a-depende
   );
 ```
 
-версія "moment" повинна бути "^2.x.x"
+`"@freecodecamp/example"` version should match `"^1.x.x"`.
 
 ```js
 (getUserInput) =>
@@ -53,9 +53,9 @@ dashedName: use-the-caret-character-to-use-the-latest-minor-version-of-a-depende
     (data) => {
       var packJson = JSON.parse(data);
       assert.match(
-        packJson.dependencies.moment,
-        /^\^2\./,
-        'Wrong version of "moment". It should be ^2.10.2'
+        packJson.dependencies["@freecodecamp/example"],
+        /^\^1\./,
+        'Wrong version of "@freecodecamp/example". It should be ^1.2.13'
       );
     },
     (xhr) => {
diff --git a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/managing-packages-with-npm/use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-dependency.md b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/managing-packages-with-npm/use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-dependency.md
index 2af662dc43d..283fb937c31 100644
--- a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/managing-packages-with-npm/use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-dependency.md
+++ b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/managing-packages-with-npm/use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-dependency.md
@@ -18,15 +18,15 @@ dashedName: use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-
 
 # --instructions--
 
-У файлі package.json вашим поточним правилом для моменту оновлення npm є використання конкретної версії (2.10.2). Але тепер ви захочете останню версію 2.10.x.
+In the package.json file, your current rule for how npm may upgrade `@freecodecamp/example` is to use a specific version (1.2.13). But now, you want to allow the latest 1.2.x version.
 
-Використовуйте символ тильди (`~`), щоб встановити префікс версії моменту у ваших залежностях і дозволити npm оновити його до будь-якого оновлення версії PATCH.
+Use the tilde (`~`) character to prefix the version of `@freecodecamp/example` in your dependencies, and allow npm to update it to any new _patch_ release.
 
 **Примітка:** Номери версій не слід змінювати.
 
 # --hints--
 
-"dependencies" повинні містити "moment"
+`"dependencies"` should include `"@freecodecamp/example"`.
 
 ```js
 (getUserInput) =>
@@ -35,8 +35,8 @@ dashedName: use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-
       var packJson = JSON.parse(data);
       assert.property(
         packJson.dependencies,
-        'moment',
-        '"dependencies" does not include "moment"'
+        '@freecodecamp/example',
+        '"dependencies" does not include "@freecodecamp/example"'
       );
     },
     (xhr) => {
@@ -45,7 +45,7 @@ dashedName: use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-
   );
 ```
 
-версія "moment" повинна бути "~2.10.2"
+`"@freecodecamp/example"` version should match `"~1.2.13"`.
 
 ```js
 (getUserInput) =>
@@ -53,9 +53,9 @@ dashedName: use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-
     (data) => {
       var packJson = JSON.parse(data);
       assert.match(
-        packJson.dependencies.moment,
-        /^\~2\.10\.2/,
-        'Wrong version of "moment". It should be ~2.10.2'
+        packJson.dependencies["@freecodecamp/example"],
+        /^\~1\.2\.13/,
+        'Wrong version of "@freecodecamp/example". It should be ~1.2.13'
       );
     },
     (xhr) => {
diff --git a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md
index 094efc1e7ef..f46fdbd56e9 100644
--- a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md
+++ b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/mongodb-and-mongoose/create-a-model.md
@@ -10,9 +10,9 @@ dashedName: create-a-model
 
 **C**RUD Частина І - Створення
 
-Перш за все, вам необхідна схема. Кожна схема пов'язана з колекцією MongoDB. Вона визначає форму документів у цій колекції. Схеми - це блоки, які складають моделі. Вони можуть бути вкладеними для того, щоб створити складні моделі, але в цьому випадку ми не будемо все ускладнювати. Модель дозволяє створювати екземпляри ваших об’єктів, які називаються документами.
+First of all, we need a Schema. Кожна схема пов'язана з колекцією MongoDB. Вона визначає форму документів у цій колекції. Schemas are building blocks for Models. They can be nested to create complex models, but in this case, we'll keep things simple. Модель дозволяє створювати екземпляри ваших об’єктів, які називаються документами.
 
-Replit - це справжній сервер, і на реальних серверах взаємодії з базою даних відбуваються у функціях обробника. Ці функції виконуються, коли трапляється якась подія (наприклад, хтось попадає на кінцеву точку вашого API). Ми будемо дотримуватись того самого підходу в цих вправах. Функція `done()` - це зворотний виклик, який повідомляє нас про те, що ми можемо продовжувати після завершення асинхронної операції, такої як вставка, оновлення чи видалення. Він відповідає конвенції Node і повинен називатися `done(null, data)` on success, or `done(err)` в разі помилки.
+Replit is a real server, and in real servers, the interactions with the database happen in handler functions. Ці функції виконуються, коли трапляється якась подія (наприклад, хтось попадає на кінцеву точку вашого API). Ми будемо дотримуватись того самого підходу в цих вправах. Функція `done()` - це зворотний виклик, який повідомляє нас про те, що ми можемо продовжувати після завершення асинхронної операції, такої як вставка, оновлення чи видалення. Він відповідає конвенції Node і повинен називатися `done(null, data)` on success, or `done(err)` в разі помилки.
 
 Увага! Помилки можуть виникнути при взаємодії з віддаленими службами!
 
@@ -38,7 +38,7 @@ age :  number
 favoriteFoods : array of strings (*)
 ```
 
-Використовуйте основні типи схем Mongoose. Якщо ви хочете, то також можете додати більше полів, використовувати прості валідатори, такі як обов’язкові або унікальні, і встановити значення за замовчуванням. Перегляньте [Mongoose docs](http://mongoosejs.com/docs/guide.html).
+Використовуйте основні типи схем Mongoose. Якщо ви хочете, то також можете додати більше полів, використовувати прості валідатори, такі як обов’язкові або унікальні, і встановити значення за замовчуванням. See our <a href="https://www.freecodecamp.org/news/introduction-to-mongoose-for-mongodb-d2a7aa593c57/" target="_blank" rel="noopener noreferrer nofollow">Mongoose article</a>.
 
 Тепер створіть модель під назвою `Person` from the `personSchema`.
 
diff --git a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/mongodb-and-mongoose/install-and-set-up-mongoose.md b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/mongodb-and-mongoose/install-and-set-up-mongoose.md
index c6fcc86ff57..b14f6c98ddd 100644
--- a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/mongodb-and-mongoose/install-and-set-up-mongoose.md
+++ b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/mongodb-and-mongoose/install-and-set-up-mongoose.md
@@ -10,19 +10,23 @@ dashedName: install-and-set-up-mongoose
 
 Робота над цими завданнями включатиме написання вашого коду з використанням одного з наступних методів:
 
-- Створіть [цей GitHub репозитарій](https://github.com/freeCodeCamp/boilerplate-mongomongoose/) і локально завершіть ці завдання.
-- Використовуйте [наш стартовий проєкт Replit](https://replit.com/github/freeCodeCamp/boilerplate-mongomongoose) для виконання цих завдань.
+- Клонуйте <a href="https://github.com/freeCodeCamp/boilerplate-mongomongoose/" target="_blank" rel="noopener noreferrer nofollow">цей репозиторій GitHub</a> та виконайте ці завдання локально.
+- Використайте <a href="https://replit.com/github/freeCodeCamp/boilerplate-mongomongoose" target="_blank" rel="noopener noreferrer nofollow">наш стартовий проєкт Replit</a> для виконання цих завдань.
 - Використовуйте конструктор сайту на власний розсуд, щоб завершити проєкт. Перевірте, що ви зберегли усі файли з нашого репозиторію GitHub.
 
 По завершенню, переконайтеся, що працююча демоверсія вашого проєкту розміщена у відкритому доступі. Потім введіть URL - адресу проєкту в поле `Solution Link` field.
 
 У цьому завданні, створіть базу даних MongoDB Atlas та імпортуйте необхідні пакети для підключення до неї.
 
-Дотримуйтесь <a href='https://www.freecodecamp.org/news/get-started-with-mongodb-atlas/' rel='noopener noreferrer' target='_blank'>цих вказівок</a>, щоб налаштувати розміщену базу даних на MongoDB Atlas.
+Follow <a href='https://www.freecodecamp.org/news/get-started-with-mongodb-atlas/' target="_blank" rel="noopener noreferrer nofollow">this tutorial</a> to set up a hosted database on MongoDB Atlas.
 
 # --instructions--
 
-Додайте `mongodb@~3.6.0` і `mongoose@~5.4.0` до `package.json` проєкту. Потім, необхідно встановити mongoose як `mongoose` у `myApp.js`. Створіть файл `.env` і додайте до нього змінну `MONGO_URI`. Його значенням має бути ваш URI бази даних MongoDB Atlas. Обов'язково помістіть URI в одинарні чи подвійні лапки, і пам'ятайте, що ви не можете використовувати пробіли навколо `=` у змінних середовища. Наприклад, `MONGO_URI='VALUE'`. Після завершення, під'єднайтесь до бази даних, використовуючи наступний синтаксис:
+`mongoose@^5.11.15` has been added to your project’s `package.json` file. First, require mongoose as `mongoose` in `myApp.js`. Next, create a `.env` file and add a `MONGO_URI` variable to it. Його значенням має бути ваш URI бази даних MongoDB Atlas. Обов'язково помістіть URI в одинарні чи подвійні лапки, і пам'ятайте, що ви не можете використовувати пробіли навколо `=` у змінних середовища. Наприклад, `MONGO_URI='VALUE'`.
+
+**Note:** If you are using Replit, you cannot create a `.env` file. Instead, use the built-in <dfn>SECRETS</dfn> tab to add the variable. <em>Do not</em> surround the values with quotes when using the <em>SECRETS</em> tab.
+
+When you are done, connect to the database using the following syntax:
 
 ```js
 mongoose.connect(<Your URI>, { useNewUrlParser: true, useUnifiedTopology: true });
@@ -30,22 +34,7 @@ mongoose.connect(<Your URI>, { useNewUrlParser: true, useUnifiedTopology: true }
 
 # --hints--
 
-Залежність "mongodb" слід вказати в package.json
-
-```js
-(getUserInput) =>
-  $.get(getUserInput('url') + '/_api/file/package.json').then(
-    (data) => {
-      var packJson = JSON.parse(data);
-      assert.property(packJson.dependencies, 'mongodb');
-    },
-    (xhr) => {
-      throw new Error(xhr.responseText);
-    }
-  );
-```
-
-Залежність "mongoose" слід вказати в package.json
+"mongoose version ^5.11.15" dependency should be in package.json
 
 ```js
 (getUserInput) =>
@@ -53,6 +42,11 @@ mongoose.connect(<Your URI>, { useNewUrlParser: true, useUnifiedTopology: true }
     (data) => {
       var packJson = JSON.parse(data);
       assert.property(packJson.dependencies, 'mongoose');
+      assert.match(
+        packJson.dependencies.mongoose,
+        /^\^5\.11\.15/,
+        'Wrong version of "mongoose". It should be ^5.11.15'
+      );
     },
     (xhr) => {
       throw new Error(xhr.responseText);
@@ -60,7 +54,7 @@ mongoose.connect(<Your URI>, { useNewUrlParser: true, useUnifiedTopology: true }
   );
 ```
 
-"mongoose" слід підключити до бази даних
+"mongoose" should be connected to a database
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/mongodb-and-mongoose/perform-classic-updates-by-running-find-edit-then-save.md b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/mongodb-and-mongoose/perform-classic-updates-by-running-find-edit-then-save.md
index f94b18e88e4..7db63555d48 100644
--- a/curriculum/challenges/ukrainian/05-back-end-development-and-apis/mongodb-and-mongoose/perform-classic-updates-by-running-find-edit-then-save.md
+++ b/curriculum/challenges/ukrainian/05-back-end-development-and-apis/mongodb-and-mongoose/perform-classic-updates-by-running-find-edit-then-save.md
@@ -14,7 +14,7 @@ dashedName: perform-classic-updates-by-running-find-edit-then-save
 
 Змініть функцію `findEditThenSave`, щоб знайти особу за `_id` (використовуйте будь - який із вищезгаданих методів) з параметром `personId` як ключ пошуку. Додайте `"hamburger"` до списку `favoriteFoods` людини (можна використовувати `Array.push()`). Потім всередині зворотного виклику пошуку - `save()` оновлений`Person`.
 
-**Примітка:** Це може бути складно, якщо у вашій схемі, ви визначили `favoriteFoods` як масив, не вказуючи тип (тобто `[String]`). В такому випадку `favoriteFoods` за замовчуванням приймає змішаний тип, і вам потрібно вручну позначити його як відредагований за допомогою `document.markModified('edited-field')`. Перегляньте [Mongoose documentation](https://mongoosejs.com/docs/schematypes.html#Mixed)
+**Примітка:** Це може бути складно, якщо у вашій схемі, ви визначили `favoriteFoods` як масив, не вказуючи тип (тобто `[String]`). В такому випадку `favoriteFoods` за замовчуванням приймає змішаний тип, і вам потрібно вручну позначити його як відредагований за допомогою `document.markModified('edited-field')`. See our <a href="https://www.freecodecamp.org/news/introduction-to-mongoose-for-mongodb-d2a7aa593c57/" target="_blank" rel="noopener noreferrer nofollow">Mongoose article</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/announce-new-users.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/announce-new-users.md
index 4b9e00c9036..29c9c8b12e4 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/announce-new-users.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/announce-new-users.md
@@ -34,7 +34,7 @@ socket.on('user', data => {
 });
 ```
 
-Відправте сторінку, якщо все було виконано правильно. Якщо виникла помилка, ви можете перевірити виконання проєкту до цього етапу [тут](https://gist.github.com/camperbot/bf95a0f74b756cf0771cd62c087b8286).
+Відправте сторінку, якщо все було виконано правильно. If you're running into errors, you can check out <a href="https://gist.github.com/camperbot/bf95a0f74b756cf0771cd62c087b8286" target="_blank" rel="noopener noreferrer nofollow">the project completed up to this point </a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/authentication-strategies.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/authentication-strategies.md
index 1e0aec53fc1..34e172b8f84 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/authentication-strategies.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/authentication-strategies.md
@@ -8,9 +8,9 @@ dashedName: authentication-strategies
 
 # --description--
 
-Стратегія - це процес авторизації користувача. Ви можете вибрати стратегію, яка дозволяє користувачам авторизуватись на основі збережених даних (якщо ви їх вказували) або від різних провайдерів таких, як Google або GitHub. До цього проєкту ми встановимо локальну стратегію. Для того, щоб переглянути перелік сотень стратегій, перейдіть на сайт Passport [сюди](http://passportjs.org/).
+Стратегія - це процес авторизації користувача. Ви можете вибрати стратегію, яка дозволяє користувачам авторизуватись на основі збережених даних (якщо ви їх вказували) або від різних провайдерів таких, як Google або GitHub. For this project, we will use Passport middleware. Passport provides a comprehensive set of strategies that support authentication using a username and password, GitHub, Google, and more.
 
-Вкажіть `passport-local@~1.0.0` як залежний елемент і додайте його на ваш сервер, як показано далі: `const LocalStrategy = require('passport-local');`
+`passport-local@~1.0.0` has already been added as a dependency, so add it to your server as follows: `const LocalStrategy = require('passport-local');`
 
 Далі ви повинні вказати паспорту (passport) **використати (use)** макет об'єкту LocalStrategy із певними вказаними параметрами. Переконайтесь у тому, що це (як і все з цього моменту) інкапсульовано в з'єднанні з базою даних (database), оскільки воно залежить від цього!
 
@@ -34,7 +34,7 @@ passport.use(new LocalStrategy(
 
 Далі ми дізнаємося, як за допомогою стратегії авторизації перевірити користувача на основі заповнених даних!
 
-Відправте вашу сторінку, якщо все зрозуміло. Якщо сталась якась помилка, ви маєте змогу перевірити статус проєкту до цього етапу [ тут ](https://gist.github.com/camperbot/53b495c02b92adeee0aa1bd3f3be8a4b).
+Відправте вашу сторінку, якщо все зрозуміло. If you're running into errors, you can <a href="https://gist.github.com/camperbot/53b495c02b92adeee0aa1bd3f3be8a4b" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md
index ff3ee21a873..925967e6965 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md
@@ -10,7 +10,7 @@ dashedName: authentication-with-socket-io
 
 Наразі ви не можете визначити, хто підключений до вашого веб-сокету. Хоча й `req.user` містить об'єкт "користувач", проте тільки тоді, коли ваш користувач взаємодіє з веб-сервером, тоді ж як до веб-сокетів у вас немає `req` (запиту), а, як наслідок, немає і даних користувача. Одним зі способів розв'язання проблеми відсутності інформації про те, хто підключений до вашого веб-сокету, є застосування синтаксичного аналізу та декодування файлів cookie, які містять сесію паспорту, далі - отриманні дані десеріалізуються задля отримання об'єкту "користувач". На щастя, NPM має спеціальний пакет для цього, який перетворює колись складну задачу на щось просте!
 
-Додайте `passport.socketio@~3.7.0`, `connect-mongo@~3.2.0` та `cookie-parser@~1.4.5` як залежності та встановіть(require) їх як `passportSocketIo`, `MongoStore` та `cookieParser` відповідно. Крім того, нам потрібно ініціалізувати нове сховище пам'яті з `express-session`, яке ми вже потребували (required). Воно повинно мати такий вигляд:
+`passport.socketio@~3.7.0`, `connect-mongo@~3.2.0`, and `cookie-parser@~1.4.5` have already been added as dependencies. Require them as `passportSocketIo`, `MongoStore`, and `cookieParser` respectively. Also, we need to initialize a new memory store, from `express-session` which we previously required. It should look like this:
 
 ```js
 const MongoStore = require('connect-mongo')(session);
@@ -65,7 +65,7 @@ console.log('user ' + socket.request.user.name + ' connected');
 
 Це дозволить увійти у підключену консоль серверу!
 
-Відправте сторінку, якщо все було виконано правильно. Якщо сталась якась помилка, то можна перевірити проєкт до цього етапу [ тут ](https://gist.github.com/camperbot/1414cc9433044e306dd7fd0caa1c6254).
+Відправте сторінку, якщо все було виконано правильно. If you're running into errors, you can check out the project up to this point <a href="https://gist.github.com/camperbot/1414cc9433044e306dd7fd0caa1c6254" target="_blank" rel="noopener noreferrer nofollow">https://gist.github.com/camperbot/1414cc9433044e306dd7fd0caa1c6254</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/clean-up-your-project-with-modules.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/clean-up-your-project-with-modules.md
index 87467958264..27c45795d79 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/clean-up-your-project-with-modules.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/clean-up-your-project-with-modules.md
@@ -26,7 +26,7 @@ module.exports = function (app, myDataBase) {
 
 Тепер зробіть те саме в вашому файлі auth.js з усім, що пов'язане з автентифікацією, як ось серіалізація і налаштування локальної стратегії, і видаліть їх з вашого серверного файлу. Обов'язково додайте залежності і наберіть `auth(app, myDataBase)` на сервері в цьому ж місці.
 
-Підтвердьте вашу сторінку, якщо все зрозуміло. Якщо ви натрапите на помилки, можете перевірити виконання проєкту до цього етапу [тут](https://gist.github.com/camperbot/2d06ac5c7d850d8cf073d2c2c794cc92).
+Підтвердьте вашу сторінку, якщо все зрозуміло. If you're running into errors, you can <a href="https://gist.github.com/camperbot/2d06ac5c7d850d8cf073d2c2c794cc92" target="_blank" rel="noopener noreferrer nofollow">check out an example of the completed project</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/communicate-by-emitting.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/communicate-by-emitting.md
index 735bc080fcc..a5c35824628 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/communicate-by-emitting.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/communicate-by-emitting.md
@@ -38,7 +38,7 @@ socket.on('user count', function(data) {
 
 Тепер спробуйте завантажити ваш додаток, автентифікуватись і ви повинні побачити на консолі клієнта '1', яка показує поточну кількість користувачів! Спробуйте завантажити більше клієнтів і автентифікуйтеся, щоб побачити, як число зростає.
 
-Відправте сторінку, якщо все було виконано правильно. Якщо ви зіткнулись з помилкою, ви можете перевірити зроблений проєкт до цього етапу [here](https://gist.github.com/camperbot/28ef7f1078f56eb48c7b1aeea35ba1f5).
+Відправте сторінку, якщо все було виконано правильно. If you're running into errors, you can <a href="https://gist.github.com/camperbot/28ef7f1078f56eb48c7b1aeea35ba1f5" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/create-new-middleware.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/create-new-middleware.md
index e2de9c78bbe..0a79eaf4c88 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/create-new-middleware.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/create-new-middleware.md
@@ -31,7 +31,7 @@ app
  });
 ```
 
-Підтвердьте сторінку, якщо все виконано вірно. Якщо стались помилки, ви можете перевірити виконання проєкту до цього етапу [тут](https://gist.github.com/camperbot/ae49b8778cab87e93284a91343da0959).
+Підтвердьте сторінку, якщо все виконано вірно. If you're running into errors, you can <a href="https://gist.github.com/camperbot/ae49b8778cab87e93284a91343da0959" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/handle-a-disconnect.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/handle-a-disconnect.md
index 95d76be590f..63ab39f222d 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/handle-a-disconnect.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/handle-a-disconnect.md
@@ -22,7 +22,7 @@ socket.on('disconnect', () => {
 
 **Примітка:** Як і `'disconnect'`, всі інші події, які сокет може передавати на сервер слід обробити в процесі підключення слухача де ми маємо 'сокет'.
 
-Підтвердіть вашу сторінку, якщо все зрозуміло. Якщо сталась якась помилка, ви маєте змогу перевірити зроблений проєкт до цього етапу [тут](https://gist.github.com/camperbot/ab1007b76069884fb45b215d3c4496fa).
+Підтвердіть вашу сторінку, якщо все зрозуміло. If you're running into errors, you can <a href="https://gist.github.com/camperbot/ab1007b76069884fb45b215d3c4496fa" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/hashing-your-passwords.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/hashing-your-passwords.md
index e5ad32d9acc..600ba417687 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/hashing-your-passwords.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/hashing-your-passwords.md
@@ -10,7 +10,7 @@ dashedName: hashing-your-passwords
 
 Якщо ви повернетесь до розділу з інформаційної безпеки, пригадаєте, що зберігання звичайних паролів *не* є гарною ідеєю. Тепер час реалізувати BCrypt для вирішення даної проблеми.
 
-Додайте `bcrypt@~5.0.0` як залежність та викличте її у своєму сервері. Вам буде потрібно виконати гешування у двох ключових місцях: де ви виконуєте реєстрацію/збереження нового облікового запису і коли ви переконуєтесь, що пароль правильний при вході в систему.
+`bcrypt@~5.0.0` has already been added as a dependency, so require it in your server. Вам буде потрібно виконати гешування у двох ключових місцях: де ви виконуєте реєстрацію/збереження нового облікового запису і коли ви переконуєтесь, що пароль правильний при вході в систему.
 
 Наразі під час реєстрації ви вводите пароль користувача у базу даних таким чином: `password: req.body.password`. Легкий спосіб зберегти хеш – це додати перед логікою бази даних: `const hash = bcrypt.hashSync(req.body.password, 12);` та замінити в базі даних `req.body.password`, зберігши лише `password: hash`.
 
@@ -24,7 +24,7 @@ if (!bcrypt.compareSync(password, user.password)) {
 
 Це все, що потрібно, щоб реалізувати одну з найважливіших функцій безпеки, коли вам потрібно зберігати паролі!
 
-Підтвердьте вашу сторінку, якщо все зрозуміло. Якщо виникла помилка, ви можете перевірити виконання проєкту до цього етапу [тут](https://gist.github.com/camperbot/dc16cca09daea4d4151a9c36a1fab564).
+Підтвердьте вашу сторінку, якщо все зрозуміло. If you're running into errors, you can <a href="https://gist.github.com/camperbot/dc16cca09daea4d4151a9c36a1fab564" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/how-to-put-a-profile-together.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/how-to-put-a-profile-together.md
index 96b7208f2f2..f1afb9ff4e9 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/how-to-put-a-profile-together.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/how-to-put-a-profile-together.md
@@ -24,7 +24,7 @@ h2.center#welcome Welcome, #{username}!
 a(href='/logout') Logout
 ```
 
-Відправте сторінку, якщо все було виконано правильно. Якщо ви натрапили на помилки, ви можете перевірити виконання проєкту до цього етапу [here](https://gist.github.com/camperbot/136b3ad611cc80b41cab6f74bb460f6a).
+Відправте сторінку, якщо все було виконано правильно. If you're running into errors, you can <a href="https://gist.github.com/camperbot/136b3ad611cc80b41cab6f74bb460f6a" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/how-to-use-passport-strategies.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/how-to-use-passport-strategies.md
index d5e0eab0d5a..744c40d68e4 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/how-to-use-passport-strategies.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/how-to-use-passport-strategies.md
@@ -18,7 +18,7 @@ dashedName: how-to-use-passport-strategies
 
 Зараз, якщо ви введете ім'я користувача і пароль у форму, вас має переадресувати на домашню сторінку `/`, а консоль вашого серверу повинна показувати `'User {USERNAME} attempted to log in.'`, оскільки ми на цей час не можемо увійти в обліковий запис користувача, який не зареєстрований.
 
-Підтвердіть сторінку, якщо все зрозуміло. Якщо сталась якась помилка, ви маєте змогу перевірити статус проєкту до цього етапу [here](https://gist.github.com/camperbot/7ad011ac54612ad53188b500c5e99cb9).
+Підтвердіть сторінку, якщо все зрозуміло. If you're running into errors, you can <a href="https://gist.github.com/camperbot/7ad011ac54612ad53188b500c5e99cb9" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/implement-the-serialization-of-a-passport-user.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/implement-the-serialization-of-a-passport-user.md
index 4dc2cb9d836..07310579d25 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/implement-the-serialization-of-a-passport-user.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/implement-the-serialization-of-a-passport-user.md
@@ -10,7 +10,7 @@ dashedName: implement-the-serialization-of-a-passport-user
 
 Зараз ми не завантажуємо поточний об’єкт користувача, оскільки ми ще не налаштували нашу базу даних. Це можна зробити багатьма різними способами, але для нашого проєкту ми під'єднаємось до бази даних один раз при запуску сервера і збережемо постійне з'єднання протягом усього життєвого циклу додатку. Для цього додайте рядок з'єднання вашої бази даних (наприклад: `mongodb+srv://:@cluster0-jvwxi.mongodb.net/?retryWrites=true&w=majority`) до змінної середовища `MONGO_URI`. Це використовується у файлі `connection.js`.
 
-*Ви можете створити безкоштовну базу даних на [MongoDB Atlas](https://www.mongodb.com/cloud/atlas).*
+*If you are having issues setting up a free database on MongoDB Atlas, check out <a href="https://www.freecodecamp.org/news/get-started-with-mongodb-atlas/" target="_blank" rel="noopener noreferrer nofollow">tutorial</a>.*
 
 Тепер ми хочемо підключитися до нашої бази даних, а після того почати створювати запити. Це робимо з метою, щоб заборонити запити до того, як наша база даних буде підключена або якщо у неї виникне помилка. Для досягнення цього вам потрібно включити свою серіалізацію та маршрути додатків у такий код:
 
@@ -40,7 +40,7 @@ myDB(async client => {
 
 Не забудьте розкоментувати код `myDataBase` в `deserializeUser` та відредагувати свій `done(null, null)` для того, щоб включити `doc`.
 
-Відправте сторінку, якщо все було виконано правильно. Якщо ви зіткнулись з помилкою, ви можете перевірити зроблений проєкт до цього етапу [тут](https://gist.github.com/camperbot/175f2f585a2d8034044c7e8857d5add7).
+Відправте сторінку, якщо все було виконано правильно. If you're running into errors, you can <a href="https://gist.github.com/camperbot/175f2f585a2d8034044c7e8857d5add7" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-ii.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-ii.md
index c4aa13a21e0..cf715397f48 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-ii.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-ii.md
@@ -8,11 +8,13 @@ dashedName: implementation-of-social-authentication-ii
 
 # --description--
 
-Остання частина налаштування автентифікації GitHub – це створення самої стратегії. Для цього вам потрібно буде додати залежність від `passport-github@~1.1.0` до вашого проєкту та викликати її у своєму `auth.js` як `GithubStrategy`, це: `const GitHubStrategy = require('passport-github').Strategy;`. Не забудьте викликати та налаштовувати `dotenv` для використання змінних середовища.
+Остання частина налаштування автентифікації GitHub – це створення самої стратегії. `passport-github@~1.1.0` has already been added as a dependency, so require it in your `auth.js` file as `GithubStrategy` like this: `const GitHubStrategy = require('passport-github').Strategy;`. Не забудьте викликати та налаштовувати `dotenv` для використання змінних середовища.
 
-Щоб налаштувати стратегію GitHub, ви повинні сказати Passport використовувати примірник `GitHubStrategy`, який приймає 2 аргументи: об'єкт (який містить `clientID`, `clientSecret` та `callbackURL`) та функцію, яку слід викликати після успішної автентифікації користувача, яка визначатиме, чи є користувач новим і які поля спочатку зберегти в об’єкті бази даних користувача. Це типово для багатьох стратегій, але деяким може знадобитися більше інформації, як зазначено в цій конкретній стратегії GitHub README. Наприклад, так Google вимагає *scope*, що визначає, яку інформацію просить повернути ваш запит, і просить користувача надати дозвіл на такий доступ. Використання поточної стратегії, яку ми впроваджуємо описане [тут](https://github.com/jaredhanson/passport-github/), але ми все це розглянемо тут, на freeCodeCamp!
+Щоб налаштувати стратегію GitHub, ви повинні сказати Passport використовувати примірник `GitHubStrategy`, який приймає 2 аргументи: об'єкт (який містить `clientID`, `clientSecret` та `callbackURL`) та функцію, яку слід викликати після успішної автентифікації користувача, яка визначатиме, чи є користувач новим і які поля спочатку зберегти в об’єкті бази даних користувача. Це типово для багатьох стратегій, але деяким може знадобитися більше інформації, як зазначено в цій конкретній стратегії GitHub README. Наприклад, так Google вимагає *scope*, що визначає, яку інформацію просить повернути ваш запит, і просить користувача надати дозвіл на такий доступ.
 
-Ось як ваша нова стратегія має виглядати на цьому етапі:
+The current strategy we are implementing authenticates users using a GitHub account and OAuth 2.0 tokens. The client ID and secret obtained when creating an application are supplied as options when creating the strategy. The strategy also requires a `verify` callback, which receives the access token and optional refresh token, as well as `profile` which contains the authenticated user's GitHub profile. The `verify` callback must call `cb` providing a user to complete authentication.
+
+Here's how your new strategy should look at this point:
 
 ```js
 passport.use(new GitHubStrategy({
@@ -27,13 +29,13 @@ passport.use(new GitHubStrategy({
 ));
 ```
 
-Ваша автентифікація ще не є успішною, і насправді видасть помилку без логіки бази даних та зворотного виклику, але вона повинна зареєструвати ваш профіль GitHub на вашій консолі, якщо ви це спробуєте!
+Your authentication won't be successful yet, and it will actually throw an error without the database logic and callback, but it should log your GitHub profile to your console if you try it!
 
-Підтвердьте сторінку, якщо все зрозуміло. Якщо виникла помилка, ви можете перевірити виконання проєкту до цього етапу [тут](https://gist.github.com/camperbot/ff3a1166684c1b184709ac0bee30dee6).
+Submit your page when you think you've got it right. If you're running into errors, you can <a href="https://gist.github.com/camperbot/ff3a1166684c1b184709ac0bee30dee6" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
-Необхідно додати залежність passport-github.
+passport-github dependency should be added.
 
 ```js
 (getUserInput) =>
@@ -52,7 +54,7 @@ passport.use(new GitHubStrategy({
   );
 ```
 
-Слід вказати passport-github.
+passport-github should be required.
 
 ```js
 (getUserInput) =>
@@ -70,7 +72,7 @@ passport.use(new GitHubStrategy({
   );
 ```
 
-Стратегію GitHub слід правильно налаштувати.
+GitHub strategy should be setup correctly thus far.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-iii.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-iii.md
index c5251b68dc7..3a697302f4f 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-iii.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-iii.md
@@ -42,7 +42,7 @@ myDataBase.findOneAndUpdate(
 
 Ви повинні мати змогу увійти в ваш додаток прямо зараз — спробуйте!
 
-Підтвердьте сторінку, якщо все виконано вірно. Якщо виникла помилка, ви можете перевірити виконання проєкту до цього етапу [тут](https://gist.github.com/camperbot/183e968f0e01d81dde015d45ba9d2745).
+Підтвердьте сторінку, якщо все виконано вірно. If you're running into errors, you can <a href="https://gist.github.com/camperbot/183e968f0e01d81dde015d45ba9d2745" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication.md
index 178950a287a..0131cd78ab1 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication.md
@@ -18,7 +18,7 @@ dashedName: implementation-of-social-authentication
 
 Стратегії з OAuth потребують, щоб ви мали принаймні *Client ID* та *Client Secret*, так сервіс перевірить, від кого надходить запит автентифікації та чи є він дійсним. Вони отримані з сайту, з яким ви намагаєтеся здійснити автентифікацію, наприклад, з сайту GitHub і вони є унікальними для вашого застосунку **ВОНИ НЕ Є ДЛЯ ЗАГАЛЬНОГО ДОСТУПУ** і ніколи не повинні бути завантажені в публічне сховище або написані безпосередньо у вашому коді. Поширеною практикою є розміщення їх у файлі `.env` і посилання на них таким чином: `process.env.GITHUB_CLIENT_ID`. Для вирішення цього завдання ми будемо використовувати стратегію GitHub.
 
-Отримання вашого *Client ID and Secret* від GitHub можна зробити в налаштуваннях профілю вашого облікового запису в розділі "Налаштування розробника", потім '[OAuth applications](https://github.com/settings/developers)'. Натисніть "Зареєструвати нову програму", назвіть свій додаток, вставте URL-адресу на свою домашню сторінку Replit (**Not the project code's url**), і, зрештою, для URL-адреси зворотного виклику, вставте ту саму URL-адресу як і домашню сторінку, але з додаванням `/auth/github/callback`. Сюди користувачі будуть переадресовані для обробки після автентифікації на GitHub. Збережіть отриману інформацію як `'GITHUB_CLIENT_ID'` та `'GITHUB_CLIENT_SECRET'` у вашому файлі `.env`.
+Obtaining your *Client ID and Secret* from GitHub is done in your account profile settings under 'developer settings', then <a href="https://github.com/settings/developers" target="_blank" rel="noopener noreferrer nofollow">'OAuth applications'</a>. Натисніть "Зареєструвати нову програму", назвіть свій додаток, вставте URL-адресу на свою домашню сторінку Replit (**Not the project code's url**), і, зрештою, для URL-адреси зворотного виклику, вставте ту саму URL-адресу як і домашню сторінку, але з додаванням `/auth/github/callback`. Сюди користувачі будуть переадресовані для обробки після автентифікації на GitHub. Збережіть отриману інформацію як `'GITHUB_CLIENT_ID'` та `'GITHUB_CLIENT_SECRET'` у вашому файлі `.env`.
 
 У вашому файлі `routes.js` додайте `showSocialAuth: true` до маршруту головної сторінки після `showRegistration: true`. Тепер створіть 2 маршрути, які прийматимуть запити GET: `/auth/github` та `/auth/github/callback`. Перший повинен лише викликати паспорт для автентифікації `'github'`. Другий повинен викликати паспорт для автентифікації `'github'` з помилкою переадресації на `/`, а потім, якщо вдалося, переадресувати на `/profile` (подібно до нашого останнього проєкту).
 
@@ -31,7 +31,7 @@ app.route('/login')
   });
 ```
 
-Підтвердьте сторінку, якщо все зрозуміло. Якщо сталась якась помилка, ви маєте змогу перевірити статус проєкту до цього етапу [тут](https://gist.github.com/camperbot/1f7f6f76adb178680246989612bea21e).
+Підтвердьте сторінку, якщо все зрозуміло. If you're running into errors, you can check out the project up to this point <a href="https://gist.github.com/camperbot/1f7f6f76adb178680246989612bea21e" target="_blank" rel="noopener noreferrer nofollow">https://gist.github.com/camperbot/1f7f6f76adb178680246989612bea21e</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/logging-a-user-out.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/logging-a-user-out.md
index ea44be27c79..c8090694e1d 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/logging-a-user-out.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/logging-a-user-out.md
@@ -30,11 +30,11 @@ app.use((req, res, next) => {
 });
 ```
 
-Підтвердьте сторінку, якщо все виконано вірно. Якщо виникла помилка, Ви можете перевірити виконаний до цього етапу проєкт [тут](https://gist.github.com/camperbot/c3eeb8a3ebf855e021fd0c044095a23b).
+Підтвердьте сторінку, якщо все виконано вірно. If you're running into errors, you can <a href="https://gist.github.com/camperbot/c3eeb8a3ebf855e021fd0c044095a23b" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
-`req.Logout` має викликатися у маршруті `/logout`.
+`req.logout()` should be called in your `/logout` route.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md
index b8cdac35434..025dd8da552 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md
@@ -47,7 +47,7 @@ app.route('/register')
   );
 ```
 
-Підтвердьте сторінку, якщо все виконано вірно. Якщо сталась якась помилка, ви маєте змогу перевірити зроблений проєкт до цього етапу [тут](https://gist.github.com/camperbot/b230a5b3bbc89b1fa0ce32a2aa7b083e).
+Підтвердьте сторінку, якщо все виконано вірно. If you're running into errors, you can <a href="https://gist.github.com/camperbot/b230a5b3bbc89b1fa0ce32a2aa7b083e" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 **ПРИМІТКА:** З цього моменту можуть виникнути проблеми з використанням браузеру *picture-in-picture*. Якщо ви використовуєте онлайн IDE, який має попередній перегляд програми в редакторі, рекомендується відкрити цей попередній перегляд у новій вкладці.
 
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md
index 69283a31389..8ecbe9837f4 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md
@@ -28,7 +28,7 @@ socket.emit('chat message', messageToSend);
 
 На даний момент чат повинен бути повністю функціональним і спроможним відправляти повідомлення всім клієнтам!
 
-Підтвердіть вашу сторінку, якщо все зрозуміло. Якщо сталась якась помилка, ви маєте змогу перевірити зроблений проєкт до цього етапу [тут](https://gist.github.com/camperbot/d7af9864375207e254f73262976d2016).
+Підтвердіть вашу сторінку, якщо все зрозуміло. If you're running into errors, you can <a href="https://gist.github.com/camperbot/d7af9864375207e254f73262976d2016" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md
index ae63f63d8c3..0f23aa9d22a 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md
@@ -12,7 +12,7 @@ dashedName: serialization-of-a-user-object
 
 Щоб налаштувати його належним чином, потрібно мати функцію серіалізації та функцію десеріалізації. У Passport, ми створюємо їх за допомогою `passport.serializeUser( OURFUNCTION )` та `passport.deserializeUser( OURFUNCTION )`
 
-`serializeUser` викликається 2 аргументами, повним об'єктом користувача та зворотним викликом, що використовується паспортом. Унікальний ключ для ідентифікації того, що користувача слід повернути у зворотному виклику, найпростіший у використанні `_id` користувача в об'єкті. Він повинен бути унікальним, оскільки він створений MongoDB. Аналогічно, `deserializeUser` викликається за допомогою цього ключа і також функції зворотного виклику паспорта, але цього разу ми повинні взяти цей ключ і повернути повний об'єкт користувача до зворотного виклику. Щоб здійснити пошук за запитом для Mongo `_id`, вам потрібно створити `const ObjectID = require('mongodb').ObjectID;`, а потім, щоб використати його, викличте `new ObjectID(THE_ID)`. Обов’язково додайте `mongodb@~3.6.0` як залежність. Ви можете побачити це в наведених нижче прикладах:
+`serializeUser` викликається 2 аргументами, повним об'єктом користувача та зворотним викликом, що використовується паспортом. Унікальний ключ для ідентифікації того, що користувача слід повернути у зворотному виклику, найпростіший у використанні `_id` користувача в об'єкті. Він повинен бути унікальним, оскільки він створений MongoDB. Аналогічно, `deserializeUser` викликається за допомогою цього ключа і також функції зворотного виклику паспорта, але цього разу ми повинні взяти цей ключ і повернути повний об'єкт користувача до зворотного виклику. Щоб здійснити пошук за запитом для Mongo `_id`, вам потрібно створити `const ObjectID = require('mongodb').ObjectID;`, а потім, щоб використати його, викличте `new ObjectID(THE_ID)`. `mongodb@~3.6.0` has already been added as a dependency. Ви можете побачити це в наведених нижче прикладах:
 
 ```js
 passport.serializeUser((user, done) => {
@@ -28,7 +28,7 @@ passport.deserializeUser((id, done) => {
 
 ПРИМІТКА: `deserializeUser` видасть помилку, поки ми не налаштуємо базу даних (DB) на наступному кроці, тому поки що прокоментуйте весь блок і просто викличте `done(null, null)` у функції `deserializeUser`.
 
-Підтвердіть сторінку, якщо все виконано вірно. Якщо виникла помилка, ви можете перевірити виконання проєкту до цього етапу [here](https://gist.github.com/camperbot/7068a0d09e61ec7424572b366751f048).
+Підтвердіть сторінку, якщо все виконано вірно. If you're running into errors, you can <a href="https://gist.github.com/camperbot/7068a0d09e61ec7424572b366751f048" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md
index b1c205021af..ecb3d77268e 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md
@@ -10,25 +10,25 @@ dashedName: set-up-a-template-engine
 
 Робота над цими завданнями передбачає написання коду одним із таких методів:
 
-- Клонуйте [ цей GitHub репозиторій](https://github.com/freeCodeCamp/boilerplate-advancednode/) і локально виконайте ці завдання.
-- Використовуйте [наш стартовий проєкт Replit](https://replit.com/github/freeCodeCamp/boilerplate-advancednode) для виконання цих завдань.
+- Клонуйте <a href="https://github.com/freeCodeCamp/boilerplate-advancednode/" target="_blank" rel="noopener noreferrer nofollow">цей репозиторій GitHub</a> та виконайте ці завдання локально.
+- Використайте <a href="https://replit.com/github/freeCodeCamp/boilerplate-advancednode" target="_blank" rel="noopener noreferrer nofollow">наш стартовий проєкт Replit</a> для виконання цих завдань.
 - Використовуйте конструктор сайтів на ваш розсуд для завершення проекту. Впевніться, що ви маєте усі файли з нашого GitHub репозиторію.
 
 По завершенню, переконайтеся, що демоверсія вашого проєкту розміщена у відкритому доступі. Потім введіть URL-адресу проєкту у поле `Solution Link`.
 
 Шаблон двигуна дозволяє використовувати статичні шаблони файлів (такі як написані в *Pug*) у вашому додатку. У той час шаблон двигуна замінює варіації у файлі шаблону фактичними значеннями, які можуть надаватися вашим сервером. Потім він перетворює шаблон в статичний HTML файл, який надсилається клієнту. Цей підхід спрощує дизайн HTML сторінки та дозволяє показувати змінні на сторінці без необхідності виклику API від клієнта.
 
-Додайте `pug@~3.0.0` в якості залежності у файлі `package.json`.
+`pug@~3.0.0` has already been installed, and is listed as a dependency in your `package.json` file.
 
 Висловіть свої потреби для розуміння, який шаблон двигуна ви використовуєте. Ми будемо використовувати метод `set` для призначення `pug` як `view engine` значення властивості: `app.set('view engine', 'pug')`
 
-Ваша сторінка не буде завантажуватися, поки ви не зобразите правильно індексний файл у каталозі `views/pug`.
+Your page will be blank until you correctly render the index file in the `views/pug` directory.
 
-Змініть аргумент `res.render()` оголошення в маршруті `/` як шлях до файлу каталогу `views/pug`. Шлях може бути відносним шляхом (відносно переглядів) або абсолютним шляхом і не потребує розширення файлу.
+To render the `pug` template, you need to use `res.render()` in the `/` route. Pass the file path to the `views/pug` directory as the argument to the method. The path can be a relative path (relative to views), or an absolute path, and does not require a file extension.
 
-Якщо все пройшло по плану, ваша домашня сторінка додатку зупинить показ повідомлення "`Pug template is not defined.`" і тепер буде показано повідомлення, яке вказує, що ви успішно зобразили шаблон Pug!
+If all went as planned, your app home page will no longer be blank and will display a message indicating you've successfully rendered the Pug template!
 
-Підтвердіть свою сторінку, коли зрозумієте, що все працює коректно. Якщо виникла помилка, ви можете перевірити виконання проєкту до цього етапу [тут](https://gist.github.com/camperbot/3515cd676ea4dfceab4e322f59a37791).
+Підтвердіть свою сторінку, коли зрозумієте, що все працює коректно. If you're running into errors, you can <a href="https://gist.github.com/camperbot/3515cd676ea4dfceab4e322f59a37791" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/set-up-passport.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/set-up-passport.md
index 21404cb817a..853f298684e 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/set-up-passport.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/set-up-passport.md
@@ -8,15 +8,13 @@ dashedName: set-up-passport
 
 # --description--
 
-Час встановити *Passport*, щоб нарешті дозволити користувачеві реєструватися або входити в обліковий запис! Разом з Passport, ми будемо використовувати експрес-сесію (Express-session) для обробки сесій. Використання цього проміжного програмного забезпечення зберігає id сесії як файл cookie в клієнті та дозволяє нам отримувати доступ до даних сесії за допомогою цього id на сервері. Таким чином ми зберігаємо особисту інформацію облікового запису поза файлом cookie, який клієнт використовує для перевірки на нашому сервері їх автентичності, і просто зберігаємо *ключ* для доступу до даних, що зберігаються на сервері.
+Час встановити *Passport*, щоб нарешті дозволити користувачеві реєструватися або входити в обліковий запис! Разом з Passport, ми будемо використовувати експрес-сесію (Express-session) для обробки сесій. Express-session has a ton of advanced features you can use, but for now we're just going to use the basics! Using this middleware saves the session id as a cookie in the client and allows us to access the session data using that id on the server. This way we keep personal account information out of the cookie used by the client to verify to our server they are authenticated and just keep the *key* to access the data stored on the server.
 
-Щоб налаштувати Passport для використання в своєму проекті, вам потрібно буде спочатку додати його як залежність у вашому package.json. `passport@~0.4.1`
+`passport@~0.4.1` and `express-session@~1.17.1` are already installed, and are both listed as dependencies in your `package.json` file.
 
-Крім того, додайте також експрес-сесію як залежність. Експрес-сесія має дуже великий набір розширених функцій, які ви можете використати, але зараз ми збираємося використовувати лише базові функції! `express-session@~1.17.1`
+You will need to set up the session settings now and initialize Passport. Be sure to first create the variables 'session' and 'passport' to require 'express-session' and 'passport' respectively.
 
-Зараз вам потрібно буде встановити налаштування сесії та ініціалізувати Passport. Переконайтеся, що створили змінні 'session' та 'passport', це потрібно для 'express-session' та 'passport'.
-
-Щоб налаштувати експрес-застосунок для використання у сесії, ми визначимо лише декілька основних параметрів. Не забудьте додати 'SESSION_SECRET' до вашого .env файлу і надати йому випадкове значення. Це використовується для обчислення хешу, яке використовується для шифрування вашого cookie!
+To set up your express app to use the session we'll define just a few basic options. Be sure to add 'SESSION_SECRET' to your .env file and give it a random value. This is used to compute the hash used to encrypt your cookie!
 
 ```js
 app.use(session({
@@ -27,13 +25,13 @@ app.use(session({
 }));
 ```
 
-Крім того, ви можете продовжити та повідомити своєму експрес-застосунку **використовувати** 'Passpor.initialize()' та 'Pasort.session()'. (Наприклад, `app.use(passport.initialize());`)
+As well you can go ahead and tell your express app to **use** 'passport.initialize()' and 'passport.session()'. (For example, `app.use(passport.initialize());`)
 
-Відправте сторінку, якщо все було виконано правильно. Якщо виникають помилки, ви можете перевірити виконання проєкту до цього етапу [тут](https://gist.github.com/camperbot/4068a7662a2f9f5d5011074397d6788c).
+Submit your page when you think you've got it right. If you're running into errors, you can <a href="https://gist.github.com/camperbot/4068a7662a2f9f5d5011074397d6788c" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
-Passport і експрес-сесії повинні бути залежностями.
+Passport and Express-session should be dependencies.
 
 ```js
 (getUserInput) =>
@@ -57,7 +55,7 @@ Passport і експрес-сесії повинні бути залежност
   );
 ```
 
-Пов'язані залежності повинні бути правильно заповнені.
+Dependencies should be correctly required.
 
 ```js
 (getUserInput) =>
@@ -80,7 +78,7 @@ Passport і експрес-сесії повинні бути залежност
   );
 ```
 
-Експрес застосунок має використовувати нові залежності.
+Express app should use new dependencies.
 
 ```js
 (getUserInput) =>
@@ -103,7 +101,7 @@ Passport і експрес-сесії повинні бути залежност
   );
 ```
 
-Сесія і секрет сесії мають бути правильно налаштовані.
+Session and session secret should be correctly set up.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md
index a829f2af025..f4b5c04a7fd 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md
@@ -10,7 +10,7 @@ dashedName: set-up-the-environment
 
 Наступні завдання використовуватимуть файл `chat.pug`. Отже, у файлі `routes.js` додайте шлях GET, вказавши на `/chat`, що використовує `ensureAuthenticated` і відображає `chat.pug`, передаючи `{ user: req.user }` як аргумент до відповіді. Тепер змініть існуючий шлях `/auth/github/callback`, щоб встановити `req.session.user_id = req.user.id`, і перенаправте до `/chat`.
 
-Додайте `socket.io@~2.3.0` як залежність і запросіть/встановіть її на свій сервер, визначивши наступним чином, із `http` (постачається вбудованою з Nodejs):
+`socket.io@~2.3.0` has already been added as a dependency, so require/instantiate it in your server as follows with `http` (comes built-in with Nodejs):
 
 ```javascript
 const http = require('http').createServer(app);
@@ -19,7 +19,7 @@ const io = require('socket.io')(http);
 
 Тепер, коли сервер *http* встановлений в *експрес застосунку*, чекайте відповіді від сервера *http*. Змініть рядок `app.listen` на `http.listen`.
 
-Спершу необхідно прослухати нове з'єднання від клієнта. Ключове слово <dfn>on</dfn> робить лише це — прослуховує конкретну подію. Йому треба 2 аргумента: рядок, що містить заголовок події, що передається, і функція, якою проходять дані. У випадку нашого слухача зв'язку, скористаємось *socket*, щоб визначити дані в наступному аргументі. Сокет (socket) – це підключений індивідуальний клієнт.
+Спершу необхідно прослухати нове з'єднання від клієнта. Ключове слово <dfn>on</dfn> робить лише це — прослуховує конкретну подію. It requires 2 arguments: a string containing the title of the event that's emitted, and a function with which the data is passed through. У випадку нашого слухача зв'язку, скористаємось *socket*, щоб визначити дані в наступному аргументі. Сокет (socket) – це підключений індивідуальний клієнт.
 
 Щоб прослухати підключення до вашого сервера, додайте до вашого підключення бази даних наступне:
 
@@ -42,7 +42,7 @@ let socket = io();
 
 **Примітка:**`io()` працює лише тоді коли підключений до сокета, який знаходиться на тому ж url/сервері. Щоб підключитись до зовнішнього сокета, який знаходиться в іншому місці, скористайтесь `io.connect('URL');`.
 
-Підтвердіть свою сторінку, коли зрозумієте, що все працює коректно. Якщо ви натрапите на помилки, можете перевірити виконання проєкту до цього етапу [тут](https://gist.github.com/camperbot/aae41cf59debc1a4755c9a00ee3859d1).
+Підтвердіть свою сторінку, коли зрозумієте, що все працює коректно. If you're running into errors, you can <a href="https://gist.github.com/camperbot/aae41cf59debc1a4755c9a00ee3859d1" target="_blank" rel="noopener noreferrer nofollow">check out the project completed up to this point</a>.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md
index 5538c11ac99..d244a3f7a4d 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md
@@ -12,19 +12,43 @@ dashedName: use-a-template-engines-powers
 
 У вашому файлі Pug ви можете використовувати змінну, посилаючись на ім'я змінної як `#{variable_name}` в рядку з іншим текстом в елементі або використовуючи знак рівності в елементі без пробілу, наприклад, `p=variable_name`, що присвоює значення змінної тексту елемента p.
 
-Ми рекомендуємо вивчити синтаксис і структуру Pug [тут](https://github.com/pugjs/pug) у README GitHub. Файл Pug націлений на використання прогалин і вкладок для зображення гніздових елементів і скорочення обсягу коду, необхідного для створення красивого сайту.
+ Pug is all about using whitespace and tabs to show nested elements and cutting down on the amount of code needed to make a beautiful site. Read the Pug documentation for more information on usage and syntax.
 
-Коли йдеться про наш файл pug «index.pug», включений у ваш проєкт, ми використовували змінні *title* і *message*.
+ Here is an example:
 
-Щоб передати їх з нашого сервера, вам потрібно буде додати об'єкт як другий аргумент у ваш *res.render* зі змінними та їх значеннями. Наприклад, передайте цьому об'єкту установку змінних для індексного перегляду: `{title: 'Hello', message: 'Please login'}`
+ ```html
+ <!--Typing this using Pug-->
+ head
+    script(type='text/javascript').
+      if (foo) bar(1 + 5);
+  body
+    if youAreUsingPug
+        p You are amazing
+      else
+        p Get on it!
 
-Це має мати наступний вигляд: `res.render(process.cwd() + '/views/pug/index', {title: 'Hello', message: 'Please login'});` Тепер оновіть свою сторінку. Під час перегляду ви повинні побачити ці значення у потрібному місці, як зазначено у файлі index.pug!
+<!--will lead to creating this code-->
+  <head>
+    <script type="text/javascript">
+      if (foo) bar(1 + 5);
+    </script>
+  </head>
+  <body>
+    <p>You are amazing</p>
+  </body>
+  ```
 
-Якщо вам вдалося, запустіть сторінку. Якщо ви зіткнулися з помилками, можете перевірити завершений до цього етапу проєкт [тут](https://gist.github.com/camperbot/4af125119ed36e6e6a8bb920db0c0871).
+Looking at our pug file `index.pug` included in your project, we used the variables `title` and `message`.
+
+To pass those along from our server, you will need to add an object as a second argument to your `res.render` with the variables and their values. For example, pass this object along setting the variables for your index view: `{title: 'Hello', message: 'Please login'}`
+
+It should look like: `res.render(process.cwd() + '/views/pug/index', {title: 'Hello', message: 'Please login'});` Now refresh your page and you should see those values rendered in your view in the correct spot as laid out in your `index.pug` file!
+
+Submit your page when you think you've got it right. If you're running into errors, you can check out the <a href="https://gist.github.com/camperbot/4af125119ed36e6e6a8bb920db0c0871" target="_blank" rel="noopener noreferrer nofollow">project completed up to this point</a>.
 
 # --hints--
 
-Файл Pug повинен правильно відображати змінні.
+Pug should correctly render variables.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md b/curriculum/challenges/ukrainian/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md
index 578fbf47e8b..1a0028334e8 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md
@@ -8,7 +8,7 @@ dashedName: assert-deep-equality-with--deepequal-and--notdeepequal
 
 # --description--
 
-Нагадуємо, що цей проєкт створюється на основі наступного стартового проєкту на <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a> або клонований з <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
+As a reminder, this project is being built upon the following starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a>  or cloned from <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `deepEqual()` підтверджує, що два об'єкти дуже однакові.
 
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/quality-assurance-and-testing-with-chai/compare-the-properties-of-two-elements.md b/curriculum/challenges/ukrainian/06-quality-assurance/quality-assurance-and-testing-with-chai/compare-the-properties-of-two-elements.md
index 40152c28fee..06f497d4620 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/quality-assurance-and-testing-with-chai/compare-the-properties-of-two-elements.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/quality-assurance-and-testing-with-chai/compare-the-properties-of-two-elements.md
@@ -8,15 +8,15 @@ dashedName: compare-the-properties-of-two-elements
 
 # --description--
 
-Нагадуємо, що цей проєкт будується на основі наступного стартового проєкту на [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), або клонується з [ GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+Нагадуємо, що цей проєкт створюється на основі наступного стартового проєкту на <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a> або клонований з <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 # --instructions--
 
-У межах `test/1_unit-tests.js` під тестом з міткою `#8` у наборі `Comparisons` змініть кожне `assert` на `assert.isAbove` або `assert.isAtMost`, щоб тест міг бути успішно пройдений (слід оцінити як `true`). Не змінюйте аргументи, передані до тверджень.
+Within `tests/1_unit-tests.js` under the test labelled `#8` in the `Comparisons` suite, change each `assert` to either `assert.isAbove` or `assert.isAtMost` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
 
 # --hints--
 
-Всі тести повинні бути успішно пройдені.
+All tests should pass.
 
 ```js
 (getUserInput) =>
@@ -30,7 +30,7 @@ dashedName: compare-the-properties-of-two-elements
   );
 ```
 
-Ви повинні вибрати правильний метод для першого твердження - `isAbove` або `isAtMost`.
+You should choose the correct method for the first assertion - `isAbove` vs. `isAtMost`.
 
 ```js
 (getUserInput) =>
@@ -48,7 +48,7 @@ dashedName: compare-the-properties-of-two-elements
   );
 ```
 
-Ви повинні вибрати правильний метод для другого твердження - `isAbove` або `isAtMost`.
+You should choose the correct method for the second assertion - `isAbove` vs. `isAtMost`.
 
 ```js
 (getUserInput) =>
@@ -62,7 +62,7 @@ dashedName: compare-the-properties-of-two-elements
   );
 ```
 
-Ви повинні обрати правильний метод третього твердження - `isAbove` або `isAtMost`.
+You should choose the correct method for the third assertion - `isAbove` vs. `isAtMost`.
 
 ```js
 (getUserInput) =>
@@ -80,7 +80,7 @@ dashedName: compare-the-properties-of-two-elements
   );
 ```
 
-Ви повинні вибрати правильний метод для четвертого твердження - `isAbove` або `isAtMost`.
+You should choose the correct method for the fourth assertion - `isAbove` vs. `isAtMost`.
 
 ```js
 (getUserInput) =>
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser-ii.md b/curriculum/challenges/ukrainian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser-ii.md
index ebae4f73a06..6a485be9d9e 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser-ii.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser-ii.md
@@ -8,11 +8,11 @@ dashedName: run-functional-tests-using-a-headless-browser-ii
 
 # --description--
 
-Нагадуємо, що цей проєкт створюється на основі початкового проєкту на [ Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai) або копіюється з [ GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+Нагадуємо, що цей проєкт створюється на основі наступного стартового проєкту на <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a> або клонований з <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 # --instructions--
 
-У межах `tests/2_functional-tests.js` у тесті `'Submit the surname "Vespucci" in the HTML form'` (`// #5`) потрібно автоматизувати такі умови:
+Within `tests/2_functional-tests.js`, in the `'Submit the surname "Vespucci" in the HTML form'` test (`// #6`), automate the following:
 
 1.  Впишіть у форму прізвище `Vespucci`
 2.  Натисніть кнопку підтвердження
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/quality-assurance-and-testing-with-chai/use-assert.isok-and-assert.isnotok.md b/curriculum/challenges/ukrainian/06-quality-assurance/quality-assurance-and-testing-with-chai/use-assert.isok-and-assert.isnotok.md
index 1bcf640f3a7..c3607fbf49d 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/quality-assurance-and-testing-with-chai/use-assert.isok-and-assert.isnotok.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/quality-assurance-and-testing-with-chai/use-assert.isok-and-assert.isnotok.md
@@ -8,11 +8,11 @@ dashedName: use-assert-isok-and-assert-isnotok
 
 # --description--
 
-Нагадуємо, що цей проєкт будується на основі такого початкового проєкту на [ Replit ](https://replit.com/github/freeCodeCamp/boilerplate-mochachai) або клонується з [ GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+Нагадуємо, що цей проєкт створюється на основі наступного стартового проєкту на <a href="https://replit.com/github/freeCodeCamp/boilerplate-mochachai" target="_blank" rel="noopener noreferrer nofollow">Replit</a> або клонований з <a href="https://github.com/freeCodeCamp/boilerplate-mochachai/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 `isOk()` перевіряє правдиве значення, а `isNotOk()` перевіряє хибне значення.
 
-Щоб дізнатися більше про правдиві й хибні значення, перейдіть на завдання [Хибний вибивало](https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer).
+To learn more about truthy and falsy values, try our <a href="https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer" target="_blank" rel="noopener noreferrer nofollow">Falsy Bouncer</a> challenge.
 
 # --instructions--
 
diff --git a/curriculum/challenges/ukrainian/06-quality-assurance/quality-assurance-projects/sudoku-solver.md b/curriculum/challenges/ukrainian/06-quality-assurance/quality-assurance-projects/sudoku-solver.md
index dafa8e2fdf2..880d7d87f1d 100644
--- a/curriculum/challenges/ukrainian/06-quality-assurance/quality-assurance-projects/sudoku-solver.md
+++ b/curriculum/challenges/ukrainian/06-quality-assurance/quality-assurance-projects/sudoku-solver.md
@@ -8,10 +8,10 @@ dashedName: sudoku-solver
 
 # --description--
 
-Створіть повний пакет додатку JavaScript, який функціонально схожий до цього: <https://sudoku-solver.freecodecamp.rocks/>. Робота над цим проєктом включатиме написання коду одним з наступних методів:
+Створіть повний пакет додатку JavaScript, який функціонально схожий до <a href="https://sudoku-solver.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://sudoku-solver.freecodecamp.rocks/</a>. Робота над цим проєктом включатиме написання коду одним з наступних методів:
 
--   Клонуйте цей [репозиторій GitHub ](https://github.com/freecodecamp/boilerplate-project-sudoku-solver) і локально завершіть ваш проєкт.
--   Використовуйте [наш Replit проєкт](https://replit.com/github/freeCodeCamp/boilerplate-project-sudoku-solver), щоб завершити ваш проєкт.
+-   Клонуйте <a href="https://github.com/freecodecamp/boilerplate-project-sudoku-solver" target="_blank" rel="noopener noreferrer nofollow">цей репозиторій GitHub</a> та виконайте свій проєкт локально.
+-   Використайте <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-sudoku-solver" target="_blank" rel="noopener noreferrer nofollow">наш стартовий проєкт Replit</a> для виконання свого проєкту.
 -   Для завершення проєкту використовуйте вибраний вами розробник сайтів. Переконайтеся, що зберегли усі файли з нашого репозиторію GitHub.
 
 Коли ви завершили, переконайтеся, що ця демоверсія вашого проєкту розміщена у відкритому місці. Потім введіть URL-адресу у поле `Solution Link`. При необхідності, також введіть посилання на джерело коду вашого проєкту у полі `GitHub Link`.
@@ -270,7 +270,7 @@ async (getUserInput) => {
 };
 ```
 
-Якщо об'єкт представлений в `/api/check` немає `puzzle`, `coordinate` чи `value`, то зворотне значення буде `{ error: Required field(s) missing }`
+If the object submitted to `/api/check` is missing `puzzle`, `coordinate` or `value`, the returned value will be `{ error: 'Required field(s) missing' }`
 
 ```js
 async (getUserInput) => {
@@ -324,7 +324,7 @@ async (getUserInput) => {
 };
 ```
 
-Якщо `value` представлене в `/api/check` не є числом між 1 і 9, то зворотне значення буде `{ error: 'Invalid value' }`
+If the `value` submitted to `/api/check` is not a number between 1 and 9, the returned value will be `{ error: 'Invalid value' }`
 
 ```js
 async (getUserInput) => {
@@ -353,9 +353,11 @@ async (getUserInput) => {
   try {
     const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
     assert.isArray(getTests);
-    const units = getTests.filter((el) => el.context.includes('UnitTests'));
-    assert.isAtLeast(units.length, 12, 'At least 12 tests passed');
-    units.forEach((test) => {
+    const unitTests = getTests.filter((test) => {
+      return !!test.context.match(/Unit\s*Tests/gi);
+    });
+    assert.isAtLeast(unitTests.length, 12, 'At least 12 tests passed');
+    unitTests.forEach((test) => {
       assert.equal(test.state, 'passed', 'Test in Passed State');
       assert.isAtLeast(
         test.assertions.length,
@@ -369,18 +371,18 @@ async (getUserInput) => {
 };
 ```
 
-Усі 14 функціональних тестів завершено та успішно пройдено. Дивіться `/tests/2_functional-tests.js` для функціональності, для якої вам слід написати тести.
+Усі 14 функціональних тестів завершено та успішно пройдено. See `/tests/2_functional-tests.js` for the expected functionality you should write tests for.
 
 ```js
 async (getUserInput) => {
   try {
     const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
     assert.isArray(getTests);
-    const funcs = getTests.filter((el) =>
-      el.context.includes('Functional Tests')
-    );
-    assert.isAtLeast(funcs.length, 14, 'At least 14 tests passed');
-    funcs.forEach((test) => {
+    const functTests = getTests.filter((test) => {
+      return !!test.context.match(/Functional\s*Tests/gi);
+    });
+    assert.isAtLeast(functTests.length, 14, 'At least 14 tests passed');
+    functTests.forEach((test) => {
       assert.equal(test.state, 'passed', 'Test in Passed State');
       assert.isAtLeast(
         test.assertions.length,
diff --git a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md
index 02890545bb8..407c59b80f0 100644
--- a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md
+++ b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md
@@ -14,7 +14,7 @@ dashedName: build-your-own-functions
 
 Додаткові ресурси:
 
-\- [Відео з поясненнями](https://www.youtube.com/watch?v=ksvGhDsjtpw)
+\- <a href="https://www.youtube.com/watch?v=ksvGhDsjtpw" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md
index 74c0dec5343..dac38e4549d 100644
--- a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md
+++ b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md
@@ -14,7 +14,7 @@ dashedName: comparing-and-sorting-tuples
 
 Додаткові ресурси:
 
-\- [Відео-урок](https://www.youtube.com/watch?v=EhQxwzyT16E)
+\- <a href="https://www.youtube.com/watch?v=EhQxwzyT16E" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md
index 0216369fab8..12319090650 100644
--- a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md
+++ b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md
@@ -14,7 +14,7 @@ dashedName: files-as-a-sequence
 
 Додаткові ресурси:
 
-\- [Відео-урок](https://www.youtube.com/watch?v=il1j4wkte2E)
+\- <a href="https://www.youtube.com/watch?v=il1j4wkte2E" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md
index bc59f3d7645..07e0a579dbf 100644
--- a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md
+++ b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md
@@ -14,9 +14,9 @@ dashedName: intermediate-expressions
 
 Додаткові ресурси:
 
-\- [Відео-урок 1](https://youtu.be/t_4DPwsaGDY)
+\- <a href="https://youtu.be/t_4DPwsaGDY" target="_blank" rel="noopener noreferrer nofollow">Exercise 1</a>
 
-\- [Відео-урок 2](https://youtu.be/wgkC8SxraAQ)
+\- <a href="https://youtu.be/wgkC8SxraAQ" target="_blank" rel="noopener noreferrer nofollow">Exercise 2</a>
 
 # --question--
 
diff --git a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md
index 589700e4b31..349b8b9fb00 100644
--- a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md
+++ b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md
@@ -18,9 +18,9 @@ dashedName: introduction-why-program
 
 Додаткові ресурси:
 
-\- [Встановити Python для Windows](https://youtu.be/F7mtLrYzZP8)
+\- <a href="https://youtu.be/F7mtLrYzZP8" target="_blank" rel="noopener noreferrer nofollow">Install Python on Windows</a>
 
-\- [Встановити Python для MacOS](https://youtu.be/wfLnZP-4sZw)
+\- <a href="https://youtu.be/wfLnZP-4sZw" target="_blank" rel="noopener noreferrer nofollow">Install Python on MacOS</a>
 
 # --question--
 
diff --git a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md
index 13ebb0913d4..3ee55ac1c88 100644
--- a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md
+++ b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md
@@ -14,7 +14,7 @@ dashedName: iterations-more-patterns
 
 Додаткові ресурси:
 
-\- [Відео-урок](https://www.youtube.com/watch?v=kjxXZQw0uPg)
+\- <a href="https://www.youtube.com/watch?v=kjxXZQw0uPg" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md
index c832ffc6638..b6ba16afced 100644
--- a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md
+++ b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md
@@ -14,9 +14,9 @@ dashedName: more-conditional-structures
 
 Додаткові ресурси:
 
-\- [Відео-урок 1](https://www.youtube.com/watch?v=crLerB4ZxMI)
+\- <a href="https://www.youtube.com/watch?v=crLerB4ZxMI" target="_blank" rel="noopener noreferrer nofollow">Exercise 1</a>
 
-\- [Відео-урок 2](https://www.youtube.com/watch?v=KJN3-7HH6yk)
+\- <a href="https://www.youtube.com/watch?v=KJN3-7HH6yk" target="_blank" rel="noopener noreferrer nofollow">Exercise 2</a>
 
 # --question--
 
diff --git a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md
index a2290668f2e..f93674d1dc2 100644
--- a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md
+++ b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md
@@ -14,11 +14,11 @@ dashedName: networking-web-scraping-with-python
 
 Додаткові ресурси:
 
-\- [Відео-урок: socket1](https://www.youtube.com/watch?v=dWLdI43W-g)
+\- <a href="https://www.youtube.com/watch?v=dWLdI143W-g" target="_blank" rel="noopener noreferrer nofollow">Exercise: socket1</a>
 
-\- [Відео-урок: urllib](https://www.youtube.com/watch?v=8yis2DvbBkI)
+\- <a href="https://www.youtube.com/watch?v=8yis2DvbBkI" target="_blank" rel="noopener noreferrer nofollow">Exercise: urllib</a>
 
-\- [Відео-урок: urllinks](https://www.youtube.com/watch?v=g9flPDG9nnY)
+\- <a href="https://www.youtube.com/watch?v=g9flPDG9nnY" target="_blank" rel="noopener noreferrer nofollow">Exercise: urllinks</a>
 
 # --question--
 
diff --git a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md
index 7afce70af7b..552c52dab6e 100644
--- a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md
+++ b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md
@@ -10,11 +10,17 @@ bilibiliIds:
 dashedName: relational-databases-and-sqlite
 ---
 
+# --description--
+
+<a href="https://www.sqlite.org/download.html" target="_blank" rel="noopener noreferrer nofollow">Download SQLite</a>  
+<a href="https://sqlitebrowser.org/dl/" target="_blank" rel="noopener noreferrer nofollow">Download DB Browser for SQLite</a>  
+<a href="https://www.sqlite.org/famous.html" target="_blank" rel="noopener noreferrer nofollow">SQLite usage</a>
+
 # --question--
 
 ## --text--
 
-Що НЕ є первинною структурою даних в базі даних?
+Which is NOT a primary data structure in a database?
 
 ## --answers--
 
diff --git a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md
index 57286aa75f1..14e669d88e6 100644
--- a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md
+++ b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md
@@ -14,15 +14,15 @@ dashedName: relational-databases-many-to-many-relationships
 
 Додаткові ресурси:
 
-\- [Відео-урок: email](https://www.youtube.com/watch?v=uQ3Qv1z_Vao)
+\- <a href="https://www.youtube.com/watch?v=uQ3Qv1z_Vao" target="_blank" rel="noopener noreferrer nofollow">Exercise: Email</a>
 
-\- [Відео-урок: roster](https://www.youtube.com/watch?v=qEkUEAz8j3o)
+\- <a href="https://www.youtube.com/watch?v=qEkUEAz8j3o" target="_blank" rel="noopener noreferrer nofollow">Exercise: Roster</a>
 
-\- [Відео-урок: tracks](https://www.youtube.com/watch?v=I-E7avcPeSE)
+\- <a href="https://www.youtube.com/watch?v=I-E7avcPeSE" target="_blank" rel="noopener noreferrer nofollow">Exercise: Tracks</a>
 
-\- [Відео-урок: twfriends](https://www.youtube.com/watch?v=RZRAoBFIH6A)
+\- <a href="https://www.youtube.com/watch?v=RZRAoBFIH6A" target="_blank" rel="noopener noreferrer nofollow">Exercise: Twfriends</a>
 
-\- [Відео-урок: twspider](https://www.youtube.com/watch?v=xBaJddvJL4A)
+\- <a href="https://www.youtube.com/watch?v=xBaJddvJL4A" target="_blank" rel="noopener noreferrer nofollow">Exercise: Twspider</a>
 
 # --question--
 
diff --git a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md
index 97861c703e6..274d91818f5 100644
--- a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md
+++ b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md
@@ -14,7 +14,7 @@ dashedName: strings-and-lists
 
 Додаткові ресурси:
 
-\- [Відео-урок](https://www.youtube.com/watch?v=-9TfJF2dwHI)
+\- <a href="https://www.youtube.com/watch?v=-9TfJF2dwHI" target="_blank" rel="noopener noreferrer nofollow">Exercise</a>
 
 # --question--
 
diff --git a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md
index c4da6375b28..64c85c091d6 100644
--- a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md
+++ b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md
@@ -8,16 +8,11 @@ dashedName: arithmetic-formatter
 
 # --description--
 
-Ви маєте [виконати цей проєкт за допомогою нашого стартового коду Replit](https://replit.com/github/freeCodeCamp/boilerplate-arithmetic-formatter).
-
-Ми й досі в процесі розробки інтерактивної складової навчального курсу Python. Наразі можете ознайомитись із наступними відео на YouTube каналі freeCodeCamp.org. У них ви знайдете все необхідне для завершення цього проєкту:
-
-- [Python for Everybody Video Course](https://www.freecodecamp.org/news/python-for-everybody/) (14 годин)
-- [Learn Python Video Course](https://www.freecodecamp.org/news/learn-python-video-course/) (10 години)
+Ви будете <a href="https://replit.com/github/freeCodeCamp/boilerplate-arithmetic-formatter" target="_blank" rel="noopener noreferrer nofollow">працювати над цим проєктом з нашим стартовим кодом Replit</a>.
 
 # --instructions--
 
-У початковій школі школярів вчать вирішувати арифметичні приклади вертикально, бо це легше. Наприклад, "235 + 52" перетворюється на:
+Students in primary school often arrange arithmetic problems vertically to make them easier to solve. For example, "235 + 52" becomes:
 
 ```py
   235
@@ -25,17 +20,17 @@ dashedName: arithmetic-formatter
 -----
 ```
 
-Створіть функцію, яка отримує список рядків з арифметичними завданнями та вводить їх послідовно у вертикальному вигляді. Функція повинна при необхідності брати другий аргумент. Коли другий аргумент встановлено на `True`, відповіді повинні відображатися.
+Create a function that receives a list of strings that are arithmetic problems and returns the problems arranged vertically and side-by-side. The function should optionally take a second argument. When the second argument is set to `True`, the answers should be displayed.
 
 ## Приклад
 
-Виклик функції:
+Function Call:
 
 ```py
 arithmetic_arranger(["32 + 698", "3801 - 2", "45 + 43", "123 + 49"])
 ```
 
-Виведення:
+Output:
 
 ```py
    32      3801      45      123
@@ -43,13 +38,13 @@ arithmetic_arranger(["32 + 698", "3801 - 2", "45 + 43", "123 + 49"])
 -----    ------    ----    -----
 ```
 
-Виклик функції:
+Function Call:
 
 ```py
 arithmetic_arranger(["32 + 8", "1 - 3801", "9999 + 9999", "523 - 49"], True)
 ```
 
-Виведення:
+Output:
 
 ```py
   32         1      9999      523
@@ -60,35 +55,35 @@ arithmetic_arranger(["32 + 8", "1 - 3801", "9999 + 9999", "523 - 49"], True)
 
 ## Правила
 
-Функція повернеться до правильного перетворення якщо наявні завдання відформатовані належним чином, в протилежному випадку, це буде **return** **string**, що описує помилку, яка має велике значення для користувача.
+The function will return the correct conversion if the supplied problems are properly formatted, otherwise, it will **return** a **string** that describes an error that is meaningful to the user.
 
 
-- Ситуації, які приводять до помилки:
-  - Якщо ** забагато завдань ** з'являються для функції. Ліміт **five**, що-небудь ще повернеться:`Error: Забагато завдань.`
-  - Відповідні оператори, які приймають функцію **addition** and **subtraction**. Множення і ділення породжує помилку. Інші оператори, які не згадані у цій точці, тестовані не будуть. Отримана помилка буде:`Error: Оператор повинен бути '+' або '-'.`
-  - Кожне число (операнд) повинен містити лише цифри. В іншому випадку, функція буде така:`Error: Числа повинні містити тільки цифри.`
-  - Кожен операнд (також номер один з кожної сторони оператора) максимум може мати по чотири цифри по ширині. В іншому випадку, помилковий рядок видасть наступне:`Error: Числа не можуть бути більше чотирьох цифр.`
-- Якщо користувач подбав про правильний формат проблем, то перетворення буде слідувати наступним правилам:
-  - Повинен бути лише один пробіл між оператором і найдовшим із двох операндів, оператор буде на тому ж рядку, що й другий операнд, обоє операндів будуть в однаковому порядку, як і надано (перший буде зверху, а другий - знизу).
-  - Числа повинні бути вирівняні справа.
-  - Має бути чотири пробіли між кожним завданням.
-  - У нижній частині кожного завдання мають бути тире. Тире повинні йти по всій довжині кожного завдання індивідуально. (Приклад вище показує, як це повинно виглядати.)
+- Situations that will return an error:
+  - If there are **too many problems** supplied to the function. The limit is **five**, anything more will return: `Error: Too many problems.`
+  - The appropriate operators the function will accept are **addition** and **subtraction**. Multiplication and division will return an error. Other operators not mentioned in this bullet point will not need to be tested. The error returned will be: `Error: Operator must be '+' or '-'.`
+  - Each number (operand) should only contain digits. Otherwise, the function will return: `Error: Numbers must only contain digits.`
+  - Each operand (aka number on each side of the operator) has a max of four digits in width. Otherwise, the error string returned will be: `Error: Numbers cannot be more than four digits.`
+- If the user supplied the correct format of problems, the conversion you return will follow these rules:
+  - There should be a single space between the operator and the longest of the two operands, the operator will be on the same line as the second operand, both operands will be in the same order as provided (the first will be the top one and the second will be the bottom).
+  - Numbers should be right-aligned.
+  - There should be four spaces between each problem.
+  - There should be dashes at the bottom of each problem. The dashes should run along the entire length of each problem individually. (The example above shows what this should look like.)
 
 ## Розробка
 
-Напишіть свій код на `arithmetic_arranger.py`. Для розробки, ви можете використати `main.py`, щоб перевірити вашу функцію `arithmetic_arranger()`. Натисніть кнопку "run" і `main.py` запуститься.
+Write your code in `arithmetic_arranger.py`. For development, you can use `main.py` to test your `arithmetic_arranger()` function. Натисніть кнопку «запустити» і `main.py` запуститься.
 
 ## Тестування
 
-Розділи з тестами для цього проєкту знаходяться в `test_module.py`. Ми запускаємо тести з `test_module.py` в `main.py` для вашої зручності. Тести запустяться автоматично кожного разу, коли ви натиснете клавішу "run". Як альтернатива, ви можете запустити тести, ввівши у консолях `pytest`.
+The unit tests for this project are in `test_module.py`. We are running the tests from `test_module.py` in `main.py` for your convenience. Тести запустяться автоматично, коли ви натиснете на кнопку «запустити». Alternatively you may run the tests by inputting `pytest` in the console.
 
 ## Надіслати
 
-Скопіюйте URL-адресу вашого проєкту та відправте його.
+Copy your project's URL and submit it below.
 
 # --hints--
 
-Функція повинна правильно відформатувати арифметичні проблеми та пройти тестування.
+It should correctly format an arithmetic problem and pass all tests.
 
 ```js
 
diff --git a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md
index 9c163e70996..4daeb40b76c 100644
--- a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md
+++ b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md
@@ -8,31 +8,25 @@ dashedName: budget-app
 
 # --description--
 
-Ви маєте [виконати цей проєкт за допомогою нашого стартового коду Replit](https://replit.com/github/freeCodeCamp/boilerplate-budget-app).
-
-Ми й досі в процесі розробки інтерактивної складової навчального курсу Python. Наразі можете ознайомитись із наступними відео на YouTube каналі freeCodeCamp.org. У них ви знайдете все необхідне для завершення цього проєкту:
-
-- [Python for Everybody Video Course](https://www.freecodecamp.org/news/python-for-everybody/) (14 годин)
-
-- [Learn Python Video Course](https://www.freecodecamp.org/news/learn-python-video-course/) (10 години)
+Ви будете <a href="https://replit.com/github/freeCodeCamp/boilerplate-budget-app" target="_blank" rel="noopener noreferrer nofollow">працювати над цим проєктом з нашим стартовим кодом Replit</a>.
 
 # --instructions--
 
-Зробіть клас `Category` в `budget.py`. Реклама повинна використовувати об'єкти на основі різних бюджетних категорій, а саме *їжа*, *одяг*, та *розваги*. Коли об'єкти створені, вони передаються в назву категорії. Клас повинен мати приклад змінної, що називається `ledger`, яка є за списком. Клас також повинен містити наступні методи:
+Complete the `Category` class in `budget.py`. It should be able to instantiate objects based on different budget categories like *food*, *clothing*, and *entertainment*. When objects are created, they are passed in the name of the category. The class should have an instance variable called `ledger` that is a list. The class should also contain the following methods:
 
-- Метод `deposit`, що приймає суму та опис. Якщо жодного опису не дано, то воно автоматично переходить до порожнього рядка. Метод повинен додати об'єкт до списку реєстрацій у вигляді `{"amount": amount, "description": description}`.
-- Метод `withdraw`, який схожий до методу `deposit`, але кількість, яку він передає, повинна зберігатися у реєстраційному списку як від'ємне число. Якщо недостатньо коштів, до реєстраційного списку додавати нічого не потрібно. Цей метод повинен переходити у `True`, якщо виведення займе місце, і в іншому випадку `False`.
-- Метод `get_balance`, що повертає поточний баланс категорії бюджету на основі депозитів і зняття.
-- Метод `transfer`, що приймає суму або іншу бюджетну категорію в якості аргументів. Метод повинен додати виведення суми та опис "Перенести до [Категорії Призначення Бюджету]". Метод повинен додати депозит до іншої бюджетної категорії, що містить суму та опис "Передача з [Категорії Джерела Бюджету]". Якщо недостатньо грошей, до реєстраційного списку додавати нічого не потрібно. Цей метод повинен переходити в `True`, якщо виведення займе місце, і в іншому випадку `False`.
-- Метод `check_funds`, що приймає суму в якості аргументу. Це переходить у `False`, якщо сума більша ніж баланс бюджетної категорії і повертає `True` в іншому випадку. Цей метод слід використовувати як метод `withdraw`, так і метод `transfer`.
+- A `deposit` method that accepts an amount and description. If no description is given, it should default to an empty string. The method should append an object to the ledger list in the form of `{"amount": amount, "description": description}`.
+- A `withdraw` method that is similar to the `deposit` method, but the amount passed in should be stored in the ledger as a negative number. If there are not enough funds, nothing should be added to the ledger. This method should return `True` if the withdrawal took place, and `False` otherwise.
+- A `get_balance` method that returns the current balance of the budget category based on the deposits and withdrawals that have occurred.
+- A `transfer` method that accepts an amount and another budget category as arguments. The method should add a withdrawal with the amount and the description "Transfer to [Destination Budget Category]". The method should then add a deposit to the other budget category with the amount and the description "Transfer from [Source Budget Category]". If there are not enough funds, nothing should be added to either ledgers. This method should return `True` if the transfer took place, and `False` otherwise.
+- A `check_funds` method that accepts an amount as an argument. It returns `False` if the amount is greater than the balance of the budget category and returns `True` otherwise. This method should be used by both the `withdraw` method and `transfer` method.
 
-Якщо бюджетний об'єкт надрукований, він повинен відображатися:
+When the budget object is printed it should display:
 
-- Рядок заголовка із 30 символів, де є назва категорії знаходиться у рядку символів `*`.
-- Список елементів у реєстраційній базі. Кожен рядок повинен показувати опис і суму. Перші 23 символи опису повинні відображатися, а далі вже сума. Суму слід вирівняти з правого боку, помістити два десяткові знаки, та відобразити максимум 7 символів.
-- Рядок, що показує загальну категорію.
+- A title line of 30 characters where the name of the category is centered in a line of `*` characters.
+- A list of the items in the ledger. Each line should show the description and amount. The first 23 characters of the description should be displayed, then the amount. The amount should be right aligned, contain two decimal places, and display a maximum of 7 characters.
+- A line displaying the category total.
 
-Ось приклад результату:
+Here is an example of the output:
 
 ```bash
 *************Food*************
@@ -43,13 +37,13 @@ Transfer to Clothing    -50.00
 Total: 923.96
 ```
 
-Окрім класу `Category`, створіть функцію (за межами класу) під назвою `create_spend_chart`, яка приймає список категорій в якості аргументу. Вона повинна повертати рядок зі стовпчиковою діаграмою.
+Besides the `Category` class, create a function (outside of the class) called `create_spend_chart` that takes a list of categories as an argument. It should return a string that is a bar chart.
 
-Графік повинен показувати кількість відсотків, витрачених в кожній категорії, що передається до функції. Відсоток витраченого повинен бути розрахований лише за рахунок зняття, але не з депозитів. Внизу лівої частини графіку повинні бути мітки 0 - 100. "Стовпчики" у стовпчиковій діаграмі повинні бути створені із символу "0". Висота кожного стовпчика повинна бути округлена до найближчого 10. Горизонтальна лінія під стовпчиками повинна бути на двох пробілах біля кінцевої панелі. Кожна назва категорії повинна бути написана вертикально нижче стовпчика. Вгорі повинен бути заголовок, де вказано "Відсоток, витрачений категорією".
+The chart should show the percentage spent in each category passed in to the function. The percentage spent should be calculated only with withdrawals and not with deposits. Down the left side of the chart should be labels 0 - 100. The "bars" in the bar chart should be made out of the "o" character. The height of each bar should be rounded down to the nearest 10. The horizontal line below the bars should go two spaces past the final bar. Each category name should be written vertically below the bar. There should be a title at the top that says "Percentage spent by category".
 
-Ця функція буде тестуватися з чотирма категоріями.
+This function will be tested with up to four categories.
 
-Подивіться на приклад виходу нижче дуже близько і переконайтеся, що інтервал результатів повністю відповідає прикладу.
+Look at the example output below very closely and make sure the spacing of the output matches the example exactly.
 
 ```bash
 Percentage spent by category
@@ -75,23 +69,23 @@ Percentage spent by category
         g     
 ```
 
-Розділи з тестами для цього проєкту є в `test_module.py`.
+The unit tests for this project are in `test_module.py`.
 
 ## Розробка
 
-Запишіть свій код в `budget.py`. Для розробки, ви можете використати `main.py` для перевірки вашого класу `Category`. Натисніть клавішу "run" і `main.py` запуститься.
+Write your code in `budget.py`. For development, you can use `main.py` to test your `Category` class. Натисніть кнопку «запустити» і `main.py` запуститься.
 
 ## Тестування
 
-Ми імпортували тести з `test_module.py` до `main.py` для вашої зручності. Тести запустяться автоматично кожен раз, коли ви натиснете клавішу "run".
+We imported the tests from `test_module.py` to `main.py` for your convenience. Тести запустяться автоматично, коли ви натиснете на кнопку «запустити».
 
 ## Надсилання
 
-Скопіюйте URL-адресу вашого проєкту і відправте його до freeCodeCamp.
+Copy your project's URL and submit it to freeCodeCamp.
 
 # --hints--
 
-Ви повинні створити клас "Категорія" і пройти всі тести.
+It should create a Category class and pass all tests.
 
 ```js
 
diff --git a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md
index 1941fff3cb9..1f4cc5b3e77 100644
--- a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md
+++ b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md
@@ -8,39 +8,33 @@ dashedName: polygon-area-calculator
 
 # --description--
 
-Ви маєте [виконати цей проєкт за допомогою нашого стартового коду Replit](https://replit.com/github/freeCodeCamp/boilerplate-polygon-area-calculator).
-
-Ми й досі в процесі розробки інтерактивної складової навчального курсу Python. Наразі можете ознайомитись із наступними відео на YouTube каналі freeCodeCamp.org. У них ви знайдете все необхідне для завершення цього проєкту:
-
-- [Python for Everybody Video Course](https://www.freecodecamp.org/news/python-for-everybody/) (14 годин)
-
-- [Learn Python Video Course](https://www.freecodecamp.org/news/learn-python-video-course/) (10 години)
+Ви будете <a href="https://replit.com/github/freeCodeCamp/boilerplate-polygon-area-calculator" target="_blank" rel="noopener noreferrer nofollow">працювати над цим проєктом з нашим стартовим кодом Replit</a>.
 
 # --instructions--
 
-У цьому проєкті ви будете використовувати програмування, що зорієнтоване на проєкті для створення класів "Rectangle" і "Square". Клас "Square" повинен бути підкласом до "Rectangle" і наслідувати його методи та атрибути.
+In this project you will use object oriented programming to create a Rectangle class and a Square class. The Square class should be a subclass of Rectangle and inherit methods and attributes.
 
 ## Клас "Rectangle"
 
-Зробіть початковими атрибутами `width` та `height`, коли ви створюєте об'єкт Rectangle. Клас також повинен містити наступні методи:
+When a Rectangle object is created, it should be initialized with `width` and `height` attributes. The class should also contain the following methods:
 
 - `set_width`
 - `set_height`
-- `get_area`: повертає площину (`width * height`)
-- `get_perimeter`: повертає периметр (`2 * width + 2 * height`)
-- `get_diagonal`: повертає діагональ (`(width ** 2 + height ** 2) ** .5`)
-- `get_picture`: повертає рядок, який представлений формою з "\*" ліній. Кількість рядків має бути рівною висоті, а кількість "\*" у кожному рядку має бути рівною ширині. Наприкінці кожного рядка має бути новий рядок (`\n`). Якщо ширина або висота більші за 50, то рядок повинен повернути: "Завеликий для зображення.".
-- `get_amount_inside`: бере іншу форму (квадрат чи трикутник) як аргумент. Повертає кількість разів, скільки потрібна форма може поміститися у задану форму (без обертання). Наприклад, прямокутник з шириною 4 і висотою 8 може вмістити два квадрати зі сторонами 4.
+- `get_area`: Returns area (`width * height`)
+- `get_perimeter`: Returns perimeter (`2 * width + 2 * height`)
+- `get_diagonal`: Returns diagonal (`(width ** 2 + height ** 2) ** .5`)
+- `get_picture`: Returns a string that represents the shape using lines of "\*". The number of lines should be equal to the height and the number of "\*" in each line should be equal to the width. There should be a new line (`\n`) at the end of each line. If the width or height is larger than 50, this should return the string: "Too big for picture.".
+- `get_amount_inside`: Takes another shape (square or rectangle) as an argument. Returns the number of times the passed in shape could fit inside the shape (with no rotations). For instance, a rectangle with a width of 4 and a height of 8 could fit in two squares with sides of 4.
 
-Додатково, якщо екземпляр Rectangle представлений як рядок, він має виглядати так: `Rectangle(width=5, height=10)`
+Additionally, if an instance of a Rectangle is represented as a string, it should look like: `Rectangle(width=5, height=10)`
 
 ## Клас Square
 
-Клас Square має бути підкласом Rectangle. Коли ви створюєте об'єкт Square, зберігається довжина однієї сторони. Метод `__init__` має зберігати довжину сторони в атрибутах `width` та `height` з класу Rectangle.
+The Square class should be a subclass of Rectangle. When a Square object is created, a single side length is passed in. The `__init__` method should store the side length in both the `width` and `height` attributes from the Rectangle class.
 
-Клас Square повинен мати доступ до методів класу Rectange, але також повинен містити метод `set_side`. Якщо екземпляр Square представлений у вигляді рядка, то це має виглядати так: `Square(side=9)`
+The Square class should be able to access the Rectangle class methods but should also contain a `set_side` method. If an instance of a Square is represented as a string, it should look like: `Square(side=9)`
 
-Додатково, методи `set_width` та `set_height` на класі Square повинні встановити як ширину, так і висоту.
+Additionally, the `set_width` and `set_height` methods on the Square class should set both the width and height.
 
 ## Приклад використання
 
@@ -64,7 +58,7 @@ rect.set_width(16)
 print(rect.get_amount_inside(sq))
 ```
 
-Цей код має повернути:
+Цей код повинен повернути:
 
 ```bash
 50
@@ -85,23 +79,23 @@ Square(side=4)
 8
 ```
 
-Розділи з тестами для цього проєкту є в `test_module.py`.
+The unit tests for this project are in `test_module.py`.
 
 ## Розробка
 
-Запишіть свій код в `shape_calculator.py`. Для розробки, ви можете використати `main.py`, щоб перевірити вашу функцію `shape_calculator()`. Натисніть клавішу "run" і `main.py` запуститься.
+Write your code in `shape_calculator.py`. For development, you can use `main.py` to test your `shape_calculator()` function. Натисніть кнопку «запустити» і `main.py` запуститься.
 
 ## Тестування
 
-Ми імпортували тести з `test_module.py` до `main.py` для вашої зручності. Тести запустяться автоматично кожен раз, коли ви натиснете клавішу "run".
+We imported the tests from `test_module.py` to `main.py` for your convenience. Тести запустяться автоматично, коли ви натиснете на кнопку «запустити».
 
 ## Надсилання
 
-Скопіюйте URL-адресу вашого проєкту і відправте його до freeCodeCamp.
+Copy your project's URL and submit it to freeCodeCamp.
 
 # --hints--
 
-Це має створити класи "Rectangle", "Square" та пройти тестування.
+It should create a Rectangle class and Square class and pass all tests.
 
 ```js
 
diff --git a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md
index 26872943efc..db135f8b2a1 100644
--- a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md
+++ b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md
@@ -8,21 +8,15 @@ dashedName: probability-calculator
 
 # --description--
 
-Ви маєте [виконати цей проєкт за допомогою нашого стартового коду Replit](https://replit.com/github/freeCodeCamp/boilerplate-probability-calculator).
-
-Ми й досі в процесі розробки інтерактивної складової навчального курсу Python. Наразі можете ознайомитись із наступними відео на YouTube каналі freeCodeCamp.org. У них ви знайдете все необхідне для завершення цього проєкту:
-
-- [Python for Everybody Video Course](https://www.freecodecamp.org/news/python-for-everybody/) (14 годин)
-
-- [Learn Python Video Course](https://www.freecodecamp.org/news/learn-python-video-course/) (10 години)
+Ви будете <a href="https://replit.com/github/freeCodeCamp/boilerplate-probability-calculator" target="_blank" rel="noopener noreferrer nofollow">працювати над цим проєктом з нашим стартовим кодом Replit</a>.
 
 # --instructions--
 
-Уявімо, що у капелюсі лежить 5 синіх кульок, 4 червоні та 2 зелені кульки. Яка ймовірність того, що з 4 кульок, які ви витягнете, принаймні 1 буде червоною та 2 зеленими? І хоча можливо прорахувати вірогідність за допомогою вищої математики, легше буде написати програму для виконання великої кількості експериментів для оцінки приблизної вірогідності.
+Suppose there is a hat containing 5 blue balls, 4 red balls, and 2 green balls. What is the probability that a random draw of 4 balls will contain at least 1 red ball and 2 green balls? While it would be possible to calculate the probability using advanced mathematics, an easier way is to write a program to perform a large number of experiments to estimate an approximate probability.
 
-Для цього проєкту, напишіть програму, яка визначатиме вірогідність випадкового діставання певних кульок із капелюха.
+For this project, you will write a program to determine the approximate probability of drawing certain balls randomly from a hat.
 
-Спершу створіть клас `Hat` в `prob_calculator.py`. Клас має взяти змінну кількість аргументів, яка вточнюватиме кількість кульок усіх кольорів із капелюха. Наприклад, клас об'єкту можна створити такими способами:
+First, create a `Hat` class in `prob_calculator.py`. The class should take a variable number of arguments that specify the number of balls of each color that are in the hat. For example, a class object could be created in any of these ways:
 
 ```py
 hat1 = Hat(yellow=3, blue=2, green=6)
@@ -30,22 +24,22 @@ hat2 = Hat(red=5, orange=4)
 hat3 = Hat(red=5, orange=4, black=1, blue=0, pink=2, striped=9)
 ```
 
-Капелюх завжди створюється з принаймні однією кулькою. Аргументи, які передаються в об'єкт капелюха, під час створення мають конвертуватися в приклад змінної `contents`. `contents` має бути списком рядків з елементами для кожної кульки у капелюсі. Кожний елемент списку має бути назвою кольору, яка позначатиме кожну кульку певного кольору. Наприклад, якщо ваш капелюх `{"red": 2, "blue": 1}`, `contents` має бути `["red", "red", "blue"]`.
+A hat will always be created with at least one ball. The arguments passed into the hat object upon creation should be converted to a `contents` instance variable. `contents` should be a list of strings containing one item for each ball in the hat. Each item in the list should be a color name representing a single ball of that color. For example, if your hat is `{"red": 2, "blue": 1}`, `contents` should be `["red", "red", "blue"]`.
 
-Клас `Hat` повинен мати метод `draw`, який приймає аргумент з позначенням кількості кульок, які можна витягти з капелюха. Цей метод має випадково витягати кульки з `contents` та повертати ці кульки списком рядків. Кульки не повинні повертатися до капелюха після того, як їх витягли (як в експерименті з урною без заміни). Якщо кількість кульок, яку треба витягти, перевищує доступну кількість, поверніть усі кульки.
+The `Hat` class should have a `draw` method that accepts an argument indicating the number of balls to draw from the hat. This method should remove balls at random from `contents` and return those balls as a list of strings. The balls should not go back into the hat during the draw, similar to an urn experiment without replacement. If the number of balls to draw exceeds the available quantity, return all the balls.
 
-Потім створіть функцію `experiment` в `prob_calculator.py` (не в класі `Hat`). Ця функція повинна приймати наступні аргументи:
+Next, create an `experiment` function in `prob_calculator.py` (not inside the `Hat` class). Ця функція повинна приймати наступні аргументи:
 
-- `hat`: об'єкт капелюха з кульками, який має скопійований у функцію.
-- `expected_balls`: об'єкт, який вказує на точну кількість кульок, котру треба вийняти з капелюха для експерименту. Наприклад, щоб визначити вірогідність того, що ви витягнете 2 сині кульки та 1 червону кульку з капелюха, встановіть `expected_balls` на `{"blue":2, "red":1}`.
-- `num_balls_drawn`: кількість кульок, які треба витягти з капелюха в кожному експерименті.
-- `num_experiments`: кількість експериментів, які треба провести. (Чим більше експериментів було проведено, тим точнішою буде приблизна вірогідність.)
+- `hat`: A hat object containing balls that should be copied inside the function.
+- `expected_balls`: An object indicating the exact group of balls to attempt to draw from the hat for the experiment. For example, to determine the probability of drawing 2 blue balls and 1 red ball from the hat, set `expected_balls` to `{"blue":2, "red":1}`.
+- `num_balls_drawn`: The number of balls to draw out of the hat in each experiment.
+- `num_experiments`: The number of experiments to perform. (The more experiments performed, the more accurate the approximate probability will be.)
 
-`experiment` функція має повертати вірогідність.
+The `experiment` function should return a probability.
 
-Допустимо, ви хочете визначити вірогідність витягти щонайменше 2 червоні кульки та 1 зелену кульку, коли ви витягаєте 5 кульок з капелюха, де лежить 6 чорних, 4 червоні та 3 зелені кульки. Для цього нам треба виконати `N` експериментів, порахуйте скільки разів `M` ми можемо витягти принаймні 2 червоні кульки та 1 зелену кульку. Вирахуйте вірогідність як `M/N`. Кожен експеримент складається з: капелюха (з певними кульками), витягування певної кількості кульок та перевірка, чи ми витягли необхідні кульки.
+For example, if you want to determine the probability of getting at least two red balls and one green ball when you draw five balls from a hat containing six black, four red, and three green. To do this, you will perform `N` experiments, count how many times `M` you get at least two red balls and one green ball, and estimate the probability as `M/N`. Each experiment consists of starting with a hat containing the specified balls, drawing several balls, and checking if you got the balls you were attempting to draw.
 
-Ось так ви можете викликати функцію `experiment` з 2000 експериментів (з прикладу зверху):
+Here is how you would call the `experiment` function based on the example above with 2000 experiments:
 
 ```py
 hat = Hat(black=6, red=4, green=3)
@@ -55,27 +49,27 @@ probability = experiment(hat=hat,
                   num_experiments=2000)
 ```
 
-Оскільки все базується на випадкових витяганнях, то вірогідність буде злегка відрізнятися з кожним новим запуском коду.
+Since this is based on random draws, the probability will be slightly different each time the code is run.
 
-*Підказка: спробуйте використати вже імпортовані модулі зверху `prob_calculator.py`. Не ініціалізуйте випадкове початкове значення в `prob_calculator.py`.*
+*Hint: Consider using the modules that are already imported at the top of `prob_calculator.py`. Do not initialize random seed within `prob_calculator.py`.*
 
 ## Розробка
 
-Запишіть свій код в `prob_calculator.py`. Для розробки, ви можете використати `main.py` для перевірки вашого коду. Натисніть кнопку "run" і `main.py` запуститься.
+Write your code in `prob_calculator.py`. For development, you can use `main.py` to test your code. Натисніть кнопку «запустити» і `main.py` запуститься.
 
-Boilerplate містить команду `import` для `copy` та `random` модулів. Спробуйте використати їх у своєму проєкті.
+The boilerplate includes `import` statements for the `copy` and `random` modules. Consider using those in your project.
 
 ## Тестування
 
-Розділи з тестами для цього проєкту знаходяться в `test_module.py`. Ми імпортували тести з `test_module.py` до `main.py` для вашої зручності. Тести запустяться автоматично кожного разу, коли ви натиснете клавішу "run".
+The unit tests for this project are in `test_module.py`. We imported the tests from `test_module.py` to `main.py` for your convenience. Тести запустяться автоматично, коли ви натиснете на кнопку «запустити».
 
 ## Надсилання
 
-Скопіюйте URL-адресу вашого проєкту і відправте його до freeCodeCamp.
+Copy your project's URL and submit it to freeCodeCamp.
 
 # --hints--
 
-Програма повинна правильно вираховувати ймовірності та пройти тестування.
+It should correctly calculate probabilities and pass all tests.
 
 ```js
 
diff --git a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md
index 075b791020a..f232d1ba063 100644
--- a/curriculum/challenges/ukrainian/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md
+++ b/curriculum/challenges/ukrainian/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md
@@ -8,29 +8,23 @@ dashedName: time-calculator
 
 # --description--
 
-Ви маєте [виконати цей проєкт за допомогою нашого стартового коду Replit](https://replit.com/github/freeCodeCamp/boilerplate-time-calculator).
-
-Ми й досі в процесі розробки інтерактивної складової навчального курсу Python. Наразі можете ознайомитись із наступними відео на YouTube каналі freeCodeCamp.org. У них ви знайдете все необхідне для завершення цього проєкту:
-
-- [Python for Everybody Video Course](https://www.freecodecamp.org/news/python-for-everybody/) (14 годин)
-
-- [Learn Python Video Course](https://www.freecodecamp.org/news/learn-python-video-course/) (10 години)
+Ви будете <a href="https://replit.com/github/freeCodeCamp/boilerplate-time-calculator" target="_blank" rel="noopener noreferrer nofollow">працювати над цим проєктом з нашим стартовим кодом Replit</a>.
 
 # --instructions--
 
-Напишіть функцію з назвою `add_time`, яка приймає два обов'язкових параметри та один необов'язковий параметр:
+Write a function named `add_time` that takes in two required parameters and one optional parameter:
 
-- початок часу в 12-годинному форматі годинника (закінчується на AM чи PM)
-- проміжок часу, який позначає кількість годин та хвилин
-- (необов'язкове) перший день тижня (без урахування регістру)
+- a start time in the 12-hour clock format (ending in AM or PM)
+- a duration time that indicates the number of hours and minutes
+- (optional) a starting day of the week, case insensitive
 
-Функція має додати проміжок часу до початку часу та повернути результат.
+The function should add the duration time to the start time and return the result.
 
-Якщо результат буде наступним днем, то він має показати `(next day)` після часу. Якщо результат буде за декілька днів, то він має показати `(n days later)` після часу, де "n" — це кількість днів.
+If the result will be the next day, it should show `(next day)` after the time. If the result will be more than one day later, it should show `(n days later)` after the time, where "n" is the number of days later.
 
-Якщо функції задано довільний параметр першого дня тижня, то вивід має показувати день тижня з результату. День тижня у виводі має показуватися перед часом та після кількості днів.
+If the function is given the optional starting day of the week parameter, then the output should display the day of the week of the result. The day of the week in the output should appear after the time and before the number of days later.
 
-Нижче наведені приклади різних випадків, які має опрацьовувати функція. Слідкуйте за інтервалами та пунктуацією в результатах.
+Below are some examples of different cases the function should handle. Pay close attention to the spacing and punctuation of the results.
 
 ```py
 add_time("3:00 PM", "3:10")
@@ -52,23 +46,23 @@ add_time("6:30 PM", "205:12")
 # Returns: 7:42 AM (9 days later)
 ```
 
-Не імпортуйте бібліотеки Python. Припускаймо, що початок часу завжди валідний. Мінути у проміжку часу будуть цілим числом меншим за 60, але години можуть бути будь-яким числом.
+Do not import any Python libraries. Assume that the start times are valid times. The minutes in the duration time will be a whole number less than 60, but the hour can be any whole number.
 
 ## Розробка
 
-Запишіть свій код в `time_calculator.py`. Для розробки, ви можете використати `main.py`, щоб перевірити вашу функцію `time_calculator()`. Натисніть кнопку "run" і `main.py` запуститься.
+Write your code in `time_calculator.py`. For development, you can use `main.py` to test your `time_calculator()` function. Натисніть кнопку «запустити» і `main.py` запуститься.
 
 ## Тестування
 
-Розділи з тестами для цього проєкту знаходяться в `test_module.py`. Ми імпортували тести з `test_module.py` до `main.py` для вашої зручності. Тести запустяться автоматично кожного разу, коли ви натиснете клавішу "run".
+The unit tests for this project are in `test_module.py`. We imported the tests from `test_module.py` to `main.py` for your convenience. Тести запустяться автоматично, коли ви натиснете на кнопку «запустити».
 
 ## Надсилання
 
-Скопіюйте URL-адресу вашого проєкту і відправте його до freeCodeCamp.
+Copy your project's URL and submit it to freeCodeCamp.
 
 # --hints--
 
-Функція повинна правильно додавати час і пройти тестування.
+It should correctly add times and pass all tests.
 
 ```js
 
diff --git a/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md b/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md
index 52a05a6279f..432fe3230c4 100644
--- a/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md
+++ b/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md
@@ -11,32 +11,33 @@ dashedName: introduction-to-data-analysis
 ---
 
 # --description--
+Data analysis is the act of turning raw, messy data into useful insights by cleaning the data up, transforming it, manipulating it, and inspecting it.
 
-Додаткові ресурси:
+More resources:
 
-\- [Презентація](https://docs.google.com/presentation/d/1cUIt8b2ySz-85_ykfeuuWsurccwTAuFPn782pZBzFsU/edit?usp=sharing)
+\- <a href="https://www.freecodecamp.org/news/what-is-data-analysis/" rel="noopener noreferrer nofollow">News article</a>
 
 # --question--
 
 ## --text--
 
-Що з нижчепереліченого **не** є частиною аналізу даних?
+Which of the following is **not** part of Data Analysis?
 
 ## --answers--
 
-Створення статистичних моделей та візуалізація даних.
+Building statistical models and data visualizations.
 
 ---
 
-Обрання бажаних висновків для аналізу.
+Picking a desired conclusion for the analysis.
 
 ---
 
-Виправлення некоректних значень і видалення хибних даних.
+Fixing incorrect values and removing invalid data.
 
 ---
 
-Структурування даних.
+Transforming data into an appropriate data structure.
 
 ## --video-solution--
 
diff --git a/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md b/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md
index 9b67fad6306..fd60e63f7b7 100644
--- a/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md
+++ b/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md
@@ -1,6 +1,6 @@
 ---
 id: 5e46f7e5ac417301a38fb929
-title: Demographic Data Analyzer
+title: Аналізатор демографічних даних
 challengeType: 10
 forumTopicId: 462367
 dashedName: demographic-data-analyzer
@@ -8,12 +8,13 @@ dashedName: demographic-data-analyzer
 
 # --description--
 
-You will be [working on this project with our Replit starter code](https://replit.com/github/freeCodeCamp/boilerplate-demographic-data-analyzer).
+Ви будете <a href="https://replit.com/github/freeCodeCamp/boilerplate-demographic-data-analyzer" target="_blank" rel="noopener noreferrer nofollow">працювати над цим проєктом з нашим стартовим кодом Replit</a>.
 
 We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you everything you need to know to complete this project:
 
-- [Python for Everybody Video Course](https://www.freecodecamp.org/news/python-for-everybody/) (14 hours)
-- [Learn Python Video Course](https://www.freecodecamp.org/news/learn-python-video-course/) (10 hours)
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a> (14 hours)
+
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">How to Analyze Data with Python Pandas</a> (10 hours)
 
 # --instructions--
 
@@ -47,11 +48,11 @@ Unit tests are written for you under `test_module.py`.
 
 ## Development
 
-For development, you can use `main.py` to test your functions. Click the "run" button and `main.py` will run.
+For development, you can use `main.py` to test your functions. Натисніть кнопку «запустити» і `main.py` запуститься.
 
 ## Testing
 
-We imported the tests from `test_module.py` to `main.py` for your convenience. The tests will run automatically whenever you hit the "run" button.
+We imported the tests from `test_module.py` to `main.py` for your convenience. Тести запустяться автоматично, коли ви натиснете на кнопку «запустити».
 
 ## Submitting
 
@@ -59,11 +60,11 @@ Copy your project's URL and submit it to freeCodeCamp.
 
 ## Dataset Source
 
-Dua, D. and Graff, C. (2019). [UCI Machine Learning Repository](http://archive.ics.uci.edu/ml). Irvine, CA: University of California, School of Information and Computer Science.
+Dua, D. and Graff, C. (2019). <a href="http://archive.ics.uci.edu/ml" target="_blank" rel="noopener noreferrer nofollow">UCI Machine Learning Repository</a>. Irvine, CA: University of California, School of Information and Computer Science.
 
 # --hints--
 
-It should pass all Python tests.
+Він повинен пройти усі тести Python.
 
 ```js
 
diff --git a/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md b/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md
index 447e9ece0b2..bfe3385b8ab 100644
--- a/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md
+++ b/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md
@@ -1,6 +1,6 @@
 ---
 id: 5e46f7e5ac417301a38fb928
-title: Mean-Variance-Standard Deviation Calculator
+title: Калькулятор середньоквадратичного відхилення
 challengeType: 10
 forumTopicId: 462366
 dashedName: mean-variance-standard-deviation-calculator
@@ -8,18 +8,19 @@ dashedName: mean-variance-standard-deviation-calculator
 
 # --description--
 
-You will be [working on this project with our Replit starter code](https://replit.com/github/freeCodeCamp/boilerplate-mean-variance-standard-deviation-calculator).
+Ви будете <a href="https://replit.com/github/freeCodeCamp/boilerplate-mean-variance-standard-deviation-calculator" target="_blank" rel="noopener noreferrer nofollow">працювати над цим проєктом з нашим стартовим кодом Replit</a>.
 
-We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you everything you need to know to complete this project:
+Ми все ще розробляємо інтерактивну частину навчального курсу Python. Наразі ось кілька відео на YouTube-каналі freeCodeCamp.org, які навчать вас усього необхідного, щоб виконати цей проєкт:
 
-- [Python for Everybody Video Course](https://www.freecodecamp.org/news/python-for-everybody/) (14 hours)
-- [Learn Python Video Course](https://www.freecodecamp.org/news/learn-python-video-course/) (10 hours)
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a>(14 hours)
+
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">How to Analyze Data with Python Pandas</a> (10 hours)
 
 # --instructions--
 
-Create a function named `calculate()` in `mean_var_std.py` that uses Numpy to output the mean, variance, standard deviation, max, min, and sum of the rows, columns, and elements in a 3 x 3 matrix.
+Створіть функцію `calculate()` в `mean_var_std.py`, яку використовує Numpy для виведення середнього значення, дисперсії, стандартного відхилення, максимуму, мінімуму та суми рядків, стовпців, і елементи в матриці 3 x 3.
 
-The input of the function should be a list containing 9 digits. The function should convert the list into a 3 x 3 Numpy array, and then return a dictionary containing the mean, variance, standard deviation, max, min, and sum along both axes and for the flattened matrix.
+Вхідним значенням функції має бути список, що містить 9 цифр. Функція повинна перетворити список у масив Numpy 3 x 3, а потім повернути словник, що містить середнє значення, дисперсію, стандартне відхилення, максимум, мінімум і суму вздовж обох осей і для сплощеної матриці.
 
 The returned dictionary should follow this format:
 
@@ -34,7 +35,7 @@ The returned dictionary should follow this format:
 }
 ```
 
-If a list containing less than 9 elements is passed into the function, it should raise a `ValueError` exception with the message: "List must contain nine numbers." The values in the returned dictionary should be lists and not Numpy arrays.
+Якщо у функцію передається список, що містить менше 9 елементів, вона має викликати виняток `ValueError` з повідомленням: «Список має містити дев’ять чисел.» Значеннями у повернутому словнику мають бути списки, а не числові масиви Numpy.
 
 For example, `calculate([0,1,2,3,4,5,6,7,8])` should return:
 
@@ -53,11 +54,11 @@ The unit tests for this project are in `test_module.py`.
 
 ## Development
 
-For development, you can use `main.py` to test your `calculate()` function. Click the "run" button and `main.py` will run.
+For development, you can use `main.py` to test your `calculate()` function. Натисніть кнопку «запустити» і `main.py` запуститься.
 
 ## Testing
 
-We imported the tests from `test_module.py` to `main.py` for your convenience. The tests will run automatically whenever you hit the "run" button.
+We imported the tests from `test_module.py` to `main.py` for your convenience. Тести запустяться автоматично, коли ви натиснете на кнопку «запустити».
 
 ## Submitting
 
@@ -65,7 +66,7 @@ Copy your project's URL and submit it to freeCodeCamp.
 
 # --hints--
 
-It should pass all Python tests.
+Потрібно виконати всі тести Python.
 
 ```js
 
diff --git a/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md b/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md
index 540499ebf56..1068fc22b47 100644
--- a/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md
+++ b/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md
@@ -1,6 +1,6 @@
 ---
 id: 5e46f7f8ac417301a38fb92a
-title: Medical Data Visualizer
+title: Візуалізатор медичних даних
 challengeType: 10
 forumTopicId: 462368
 dashedName: medical-data-visualizer
@@ -8,12 +8,13 @@ dashedName: medical-data-visualizer
 
 # --description--
 
-You will be [working on this project with our Replit starter code](https://replit.com/github/freeCodeCamp/boilerplate-medical-data-visualizer).
+Ви будете <a href="https://replit.com/github/freeCodeCamp/boilerplate-medical-data-visualizer" target="_blank" rel="noopener noreferrer nofollow">працювати над цим проєктом з нашим стартовим кодом Replit</a>.
 
 We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you everything you need to know to complete this project:
 
-- [Python for Everybody Video Course](https://www.freecodecamp.org/news/python-for-everybody/) (14 hours)
-- [Learn Python Video Course](https://www.freecodecamp.org/news/learn-python-video-course/) (10 hours)
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a>(14 hours)
+
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">How to Analyze Data with Python Pandas</a> (10 hours)
 
 # --instructions--
 
@@ -25,20 +26,20 @@ The rows in the dataset represent patients and the columns represent information
 
 File name: medical_examination.csv
 
-| Feature | Variable Type | Variable      | Value Type |
-|:-------:|:------------:|:-------------:|:----------:|
-| Age | Objective Feature | age | int (days) |
-| Height | Objective Feature | height | int (cm) |
-| Weight | Objective Feature | weight | float (kg) |
-| Gender | Objective Feature | gender | categorical code |
-| Systolic blood pressure | Examination Feature | ap_hi | int |
-| Diastolic blood pressure | Examination Feature | ap_lo | int |
-| Cholesterol | Examination Feature | cholesterol | 1: normal, 2: above normal, 3: well above normal |
-| Glucose | Examination Feature | gluc | 1: normal, 2: above normal, 3: well above normal |
-| Smoking | Subjective Feature | smoke | binary |
-| Alcohol intake | Subjective Feature | alco | binary |
-| Physical activity | Subjective Feature | active | binary |
-| Presence or absence of cardiovascular disease | Target Variable | cardio | binary |
+|                    Feature                    |    Variable Type    |   Variable    |                    Value Type                    |
+|:---------------------------------------------:|:-------------------:|:-------------:|:------------------------------------------------:|
+|                      Age                      |  Objective Feature  |     `age`     |                    int (days)                    |
+|                    Height                     |  Objective Feature  |   `height`    |                     int (cm)                     |
+|                    Weight                     |  Objective Feature  |   `weight`    |                    float (kg)                    |
+|                    Gender                     |  Objective Feature  |   `gender`    |                 categorical code                 |
+|            Systolic blood pressure            | Examination Feature |    `ap_hi`    |                       int                        |
+|           Diastolic blood pressure            | Examination Feature |    `ap_lo`    |                       int                        |
+|                  Cholesterol                  | Examination Feature | `cholesterol` | 1: normal, 2: above normal, 3: well above normal |
+|                    Glucose                    | Examination Feature |    `gluc`     | 1: normal, 2: above normal, 3: well above normal |
+|                    Smoking                    | Subjective Feature  |    `smoke`    |                      binary                      |
+|                Alcohol intake                 | Subjective Feature  |    `alco`     |                      binary                      |
+|               Physical activity               | Subjective Feature  |   `active`    |                      binary                      |
+| Presence or absence of cardiovascular disease |   Target Variable   |   `cardio`    |                      binary                      |
 
 ## Tasks
 
@@ -63,11 +64,11 @@ Unit tests are written for you under `test_module.py`.
 
 ## Development
 
-For development, you can use `main.py` to test your functions. Click the "run" button and `main.py` will run.
+For development, you can use `main.py` to test your functions. Натисніть кнопку «запустити» і `main.py` запуститься.
 
 ## Testing
 
-We imported the tests from `test_module.py` to `main.py` for your convenience. The tests will run automatically whenever you hit the "run" button.
+We imported the tests from `test_module.py` to `main.py` for your convenience. Тести запустяться автоматично, коли ви натиснете на кнопку «запустити».
 
 ## Submitting
 
@@ -75,7 +76,7 @@ Copy your project's URL and submit it to freeCodeCamp.
 
 # --hints--
 
-It should pass all Python tests.
+Він повинен пройти усі тести Python.
 
 ```js
 
diff --git a/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md b/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md
index 2ca374ca72b..d55101a9565 100644
--- a/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md
+++ b/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md
@@ -1,6 +1,6 @@
 ---
 id: 5e46f802ac417301a38fb92b
-title: Page View Time Series Visualizer
+title: Візуалізатор часового ряду перегляду сторінки
 challengeType: 10
 forumTopicId: 462369
 dashedName: page-view-time-series-visualizer
@@ -8,12 +8,13 @@ dashedName: page-view-time-series-visualizer
 
 # --description--
 
-You will be [working on this project with our Replit starter code](https://replit.com/github/freeCodeCamp/boilerplate-page-view-time-series-visualizer).
+Ви будете <a href="https://replit.com/github/freeCodeCamp/boilerplate-page-view-time-series-visualizer" target="_blank" rel="noopener noreferrer nofollow">працювати над цим проєктом з нашим стартовим кодом Replit</a>.
 
 We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you everything you need to know to complete this project:
 
-- [Python for Everybody Video Course](https://www.freecodecamp.org/news/python-for-everybody/) (14 hours)
-- [Learn Python Video Course](https://www.freecodecamp.org/news/learn-python-video-course/) (10 hours)
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a>(14 hours)
+
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">How to Analyze Data with Python Pandas</a> (10 hours)
 
 # --instructions--
 
@@ -21,11 +22,11 @@ For this project you will visualize time series data using a line chart, bar cha
 
 Use the data to complete the following tasks:
 
-- Use Pandas to import the data from "fcc-forum-pageviews.csv". Set the index to the "date" column.
+- Use Pandas to import the data from "fcc-forum-pageviews.csv". Set the index to the `date` column.
 - Clean the data by filtering out days when the page views were in the top 2.5% of the dataset or bottom 2.5% of the dataset.
-- Create a `draw_line_plot` function that uses Matplotlib to draw a line chart similar to "examples/Figure_1.png". The title should be "Daily freeCodeCamp Forum Page Views 5/2016-12/2019". The label on the x axis should be "Date" and the label on the y axis should be "Page Views".
-- Create a `draw_bar_plot` function that draws a bar chart similar to "examples/Figure_2.png". It should show average daily page views for each month grouped by year. The legend should show month labels and have a title of "Months". On the chart, the label on the x axis should be "Years" and the label on the y axis should be "Average Page Views".
-- Create a `draw_box_plot` function that uses Searborn to draw two adjacent box plots similar to "examples/Figure_3.png". These box plots should show how the values are distributed within a given year or month and how it compares over time. The title of the first chart should be "Year-wise Box Plot (Trend)" and the title of the second chart should be "Month-wise Box Plot (Seasonality)". Make sure the month labels on bottom start at "Jan" and the x and x axis are labeled correctly. The boilerplate includes commands to prepare the data.
+- Create a `draw_line_plot` function that uses Matplotlib to draw a line chart similar to "examples/Figure_1.png". The title should be `Daily freeCodeCamp Forum Page Views 5/2016-12/2019`. The label on the x axis should be `Date` and the label on the y axis should be `Page Views`.
+- Create a `draw_bar_plot` function that draws a bar chart similar to "examples/Figure_2.png". It should show average daily page views for each month grouped by year. The legend should show month labels and have a title of `Months`. On the chart, the label on the x axis should be `Years` and the label on the y axis should be `Average Page Views`.
+- Create a `draw_box_plot` function that uses Seaborn to draw two adjacent box plots similar to "examples/Figure_3.png". These box plots should show how the values are distributed within a given year or month and how it compares over time. The title of the first chart should be `Year-wise Box Plot (Trend)` and the title of the second chart should be `Month-wise Box Plot (Seasonality)`. Make sure the month labels on bottom start at `Jan` and the x and y axis are labeled correctly. The boilerplate includes commands to prepare the data.
 
 For each chart, make sure to use a copy of the data frame. Unit tests are written for you under `test_module.py`.
 
@@ -33,11 +34,11 @@ The boilerplate also includes commands to save and return the image.
 
 ## Development
 
-For development, you can use `main.py` to test your functions. Click the "run" button and `main.py` will run.
+For development, you can use `main.py` to test your functions. Натисніть кнопку «запустити» і `main.py` запуститься.
 
 ## Testing
 
-We imported the tests from `test_module.py` to `main.py` for your convenience. The tests will run automatically whenever you hit the "run" button.
+We imported the tests from `test_module.py` to `main.py` for your convenience. Тести запустяться автоматично, коли ви натиснете на кнопку «запустити».
 
 ## Submitting
 
@@ -45,7 +46,7 @@ Copy your project's URL and submit it to freeCodeCamp.
 
 # --hints--
 
-It should pass all Python tests.
+Він повинен пройти усі тести Python.
 
 ```js
 
diff --git a/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md b/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md
index 04742507b64..96ba925b940 100644
--- a/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md
+++ b/curriculum/challenges/ukrainian/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md
@@ -1,6 +1,6 @@
 ---
 id: 5e4f5c4b570f7e3a4949899f
-title: Sea Level Predictor
+title: Прогнозування змін рівня моря
 challengeType: 10
 forumTopicId: 462370
 dashedName: sea-level-predictor
@@ -8,12 +8,13 @@ dashedName: sea-level-predictor
 
 # --description--
 
-You will be [working on this project with our Replit starter code](https://replit.com/github/freeCodeCamp/boilerplate-sea-level-predictor).
+Ви будете <a href="https://replit.com/github/freeCodeCamp/boilerplate-sea-level-predictor" target="_blank" rel="noopener noreferrer nofollow">працювати над цим проєктом з нашим стартовим кодом Replit</a>.
 
 We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you everything you need to know to complete this project:
 
-- [Python for Everybody Video Course](https://www.freecodecamp.org/news/python-for-everybody/) (14 hours)
-- [Learn Python Video Course](https://www.freecodecamp.org/news/learn-python-video-course/) (10 hours)
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a>(14 hours)
+
+- <a href="https://www.freecodecamp.org/news/how-to-analyze-data-with-python-pandas/" target="_blank" rel="noopener noreferrer nofollow">How to Analyze Data with Python Pandas</a> (10 hours)
 
 # --instructions--
 
@@ -22,10 +23,10 @@ You will analyze a dataset of the global average sea level change since 1880. Yo
 Use the data to complete the following tasks:
 
 - Use Pandas to import the data from `epa-sea-level.csv`.
-- Use matplotlib to create a scatter plot using the "Year" column as the x-axis and the "CSIRO Adjusted Sea Level" column as the y-axix.
+- Use matplotlib to create a scatter plot using the `Year` column as the x-axis and the `CSIRO Adjusted Sea Level` column as the y-axix.
 - Use the `linregress` function from `scipy.stats` to get the slope and y-intercept of the line of best fit. Plot the line of best fit over the top of the scatter plot. Make the line go through the year 2050 to predict the sea level rise in 2050.
 - Plot a new line of best fit just using the data from year 2000 through the most recent year in the dataset. Make the line also go through the year 2050 to predict the sea level rise in 2050 if the rate of rise continues as it has since the year 2000.
-- The x label should be "Year", the y label should be "Sea Level (inches)", and the title should be "Rise in Sea Level".
+- The x label should be `Year`, the y label should be `Sea Level (inches)`, and the title should be `Rise in Sea Level`.
 
 Unit tests are written for you under `test_module.py`.
 
@@ -33,23 +34,24 @@ The boilerplate also includes commands to save and return the image.
 
 ## Development
 
-For development, you can use `main.py` to test your functions. Click the "run" button and `main.py` will run.
+For development, you can use `main.py` to test your functions. Натисніть кнопку «запустити» і `main.py` запуститься.
 
 ## Testing
 
-We imported the tests from `test_module.py` to `main.py` for your convenience. The tests will run automatically whenever you hit the "run" button.
+We imported the tests from `test_module.py` to `main.py` for your convenience. Тести запустяться автоматично, коли ви натиснете на кнопку «запустити».
 
 ## Submitting
 
 Copy your project's URL and submit it to freeCodeCamp.
 
 ## Data Source
-[Global Average Absolute Sea Level Change](https://datahub.io/core/sea-level-rise), 1880-2014 from the US Environmental Protection Agency using data from CSIRO, 2015; NOAA, 2015.
+
+<a href="https://datahub.io/core/sea-level-rise" target="_blank" rel="noopener noreferrer nofollow">Global Average Absolute Sea Level Change</a>, 1880-2014 from the US Environmental Protection Agency using data from CSIRO, 2015; NOAA, 2015.
 
 
 # --hints--
 
-It should pass all Python tests.
+Він повинен пройти усі тести Python.
 
 ```js
 
diff --git a/curriculum/challenges/ukrainian/09-information-security/information-security-projects/port-scanner.md b/curriculum/challenges/ukrainian/09-information-security/information-security-projects/port-scanner.md
index 10c950657d6..99fd3594871 100644
--- a/curriculum/challenges/ukrainian/09-information-security/information-security-projects/port-scanner.md
+++ b/curriculum/challenges/ukrainian/09-information-security/information-security-projects/port-scanner.md
@@ -1,6 +1,6 @@
 ---
 id: 5e46f979ac417301a38fb932
-title: Port Scanner
+title: Сканер портів
 challengeType: 10
 forumTopicId: 462372
 helpCategory: Python
@@ -9,17 +9,19 @@ dashedName: port-scanner
 
 # --description--
 
-You will be [working on this project with our Replit starter code](https://replit.com/github/freeCodeCamp/boilerplate-port-scanner).
+Ви будете <a href="https://replit.com/github/freeCodeCamp/boilerplate-port-scanner" target="_blank" rel="noopener noreferrer nofollow">працювати над цим проєктом з нашим стартовим кодом Replit</a>.
 
-We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you everything you need to know to complete this project:
+Ми й досі в процесі розробки інтерактивної складової навчального курсу Python. Наразі можете ознайомитись із наступними відео на YouTube каналі freeCodeCamp.org. У них ви знайдете все необхідне для завершення цього проєкту:
 
-- [Python for Everybody Video Course](https://www.freecodecamp.org/news/python-for-everybody/) (14 hours)
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a> (14 hours)
 
-- [Learn Python Video Course](https://www.freecodecamp.org/news/learn-python-video-course/) (10 hours)
+- <a href="https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/" target="_blank" rel="noopener noreferrer nofollow">Learn Python Basics in Depth</a> (4 hours)
+
+- <a href="https://www.freecodecamp.org/news/intermediate-python-course/" target="_blank" rel="noopener noreferrer nofollow">Intermediate Python Course</a> (6 hours)
 
 # --instructions--
 
-Create a port scanner using Python.
+Створення сканера портів за допомогою Python.
 
 In the `port_scanner.py` file, create a function called `get_open_ports` that takes a `target` argument and a `port_range` argument. `target` can be a URL or IP address. `port_range` is a list of two numbers indicating the first and last numbers of the range of ports to check.
 
@@ -66,21 +68,21 @@ If the URL passed into the `get_open_ports` function is invalid, the function sh
 
 If the IP address passed into the `get_open_ports` function is invalid, the function should return the string: "Error:  Invalid IP address".
 
-## Development
+## Розробка
 
-Write your code in `port_scanner.py`. For development, you can use `main.py` to test your code. Click the "run" button and `main.py` will run.
+Write your code in `port_scanner.py`. For development, you can use `main.py` to test your code. Натисніть кнопку "run" і `main.py` запуститься.
 
-## Testing
+## Тестування
 
-The unit tests for this project are in `test_module.py`. We imported the tests from `test_module.py` to `main.py` for your convenience. The tests will run automatically whenever you hit the "run" button.
+Розділи з тестами для цього проєкту знаходяться в `test_module.py`. Ми імпортували тести з `test_module.py` до `main.py` для вашої зручності. Тести запустяться автоматично кожного разу, коли ви натиснете клавішу "run".
 
-## Submitting
+## Надіслати
 
-Copy your project's URL and submit it to freeCodeCamp.
+Скопіюйте URL-адресу вашого проєкту і відправте його до freeCodeCamp.
 
 # --hints--
 
-It should pass all Python tests.
+Він повинен пройти усі тести Python.
 
 ```js
 
diff --git a/curriculum/challenges/ukrainian/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md b/curriculum/challenges/ukrainian/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md
index e9424dd6320..31e8364cff1 100644
--- a/curriculum/challenges/ukrainian/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md
+++ b/curriculum/challenges/ukrainian/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md
@@ -8,21 +8,32 @@ dashedName: secure-real-time-multiplayer-game
 
 # --description--
 
-Розробіть 2D оперативну багатокористувацьку гру в режимі HTML Canvas API та [Socket.io](https://socket.io/), що функціонально схожа на це: <https://secure-real-time-multiplayer-game.freecodecamp.rocks/>. Робота над цим проєктом бути включати написання кода одним із таких методів:
+Develop a 2D real time multiplayer game using the HTML Canvas API and Socket.io that is functionally similar to this: <a href="https://secure-real-time-multiplayer-game.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://secure-real-time-multiplayer-game.freecodecamp.rocks/</a>. Робота над цим проєктом бути включати написання кода одним із таких методів:
 
--   Клонувати [цей GitHub репозиторій](https://github.com/freeCodeCamp/boilerplate-project-secure-real-time-multiplayer-game/) та локально завершити ваш проєкт.
--   Використовуйте [наш Replit проєкт](https://replit.com/github/freeCodeCamp/boilerplate-project-secure-real-time-multiplayer-game), щоб завершити ваш проєкт.
+-   Клонуйте <a href="https://github.com/freeCodeCamp/boilerplate-project-secure-real-time-multiplayer-game/" target="_blank" rel="noopener noreferrer nofollow">цей репозиторій GitHub</a> та виконайте свій проєкт локально.
+-   Використайте <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-secure-real-time-multiplayer-game" target="_blank" rel="noopener noreferrer nofollow">наш стартовий проєкт Replit</a> для виконання свого проєкту.
 -   Для завершення проєкту використайте вибраний вами розробник сайтів. Не забудьте включити всі файли із нашого репозиторію GitHub.
 
 Коли ви завершили, переконайтеся, що демоверсія вашого проекту розміщена у відкритому доступі. Потім введіть URL-адресу у поле `Solution Link`. Додатково, також вкажіть посилання на вхідний код вашого проєкту у полі `GitHub Link`.
 
 # --instructions--
 
-**Примітка**: `helmet@^3.21.3` потрібна для користувацьких історій. Це означає, що вам потрібно буде використовувати попередню версію документації Helmet, щоб отримати інформацію про те, як досягти історій користувача.
+Create a secure multiplayer game in which each player can move their avatar, there is at least one collectible item, and the rank of the players is calculated based on their score.
+
+For details consult the tests below.
+
+Make sure that your game is secure! Include these security measures:
+
+- The client should not be able to guess/sniff the MIME type
+- Prevent XSS attacks
+- Do not cache anything from the website in the client
+- The headers say that the site is powered by `PHP 7.4.3`
+
+**Note**: `helmet@^3.21.3` is needed for the user stories. This means you will need to use the previous version of Helmet's docs, for information on how to achieve the user stories.
 
 # --hints--
 
-Ви можете вказати свій власний проєкт, а не приклад URL.
+You can provide your own project, not the example URL.
 
 ```js
 (getUserInput) => {
@@ -34,91 +45,91 @@ dashedName: secure-real-time-multiplayer-game
 };
 ```
 
-Декілька гравців можуть підключитися до сервера і грати.
+Multiple players can connect to a server and play.
 
 ```js
 
 ```
 
-У кожного гравця є аватар.
+Each player has an avatar.
 
 ```js
 
 ```
 
-Кожен гравець представлений об'єктом, створеним класом `Player` у `Player.mjs`.
+Each player is represented by an object created by the `Player` class in `Player.mjs`.
 
 ```js
 
 ```
 
-Як мінімум, кожен гравець повинен містити унікальний `id`, `score`, `x` і `y` координати, які відображають поточну позицію гравця.
+At a minimum, each player object should contain a unique `id`, a `score`, and `x` and `y` coordinates representing the player's current position.
 
 ```js
 
 ```
 
-Гра має принаймні один тип предметів, які треба збирати. Заповніть `Collectible` клас у `Collectible.mjs` для наслідування цього.
+The game has at least one type of collectible item. Complete the `Collectible` class in `Collectible.mjs` to implement this.
 
 ```js
 
 ```
 
-Як мінімум, кожен зібраний об'єкт предметів, створений класом `Collectible` повинен містити унікальний `id`, `value` та `x` і `y` координат, що представляють поточну позицію предмета.
+At a minimum, each collectible item object created by the `Collectible` class should contain a unique `id`, a `value`, and `x` and `y` coordinates representing the item's current position.
 
 ```js
 
 ```
 
-Гравці можуть використовувати клавіші WASD та/або стрілки, щоб перемістити свій аватар. Заповніть `movePlayer` метод у `Player.mjs` щоб це реалізувати.
+Players can use the WASD and/or arrow keys to move their avatar. Complete the `movePlayer` method in `Player.mjs` to implement this.
 
 ```js
 
 ```
 
-Метод `movePlayer` повинен приймати два аргументи: рядок "up", "down", "left" або "right", а також число пікселів, на яку позиція гравця має змінюватися. `movePlayer` повинен адаптуватися до `x` і `y` координат об'єкта який його викликав.
+The `movePlayer` method should accept two arguments: a string of "up", "down", "left", or "right", and a number for the amount of pixels the player's position should change. `movePlayer` should adjust the `x` and `y` coordinates of the player object it's called from.
 
 ```js
 
 ```
 
-Рахунок гравця повинен розраховувати його рейтинг серед інших гравців. Заповніть `calculateRank` метод у `Player` щоб це реалізувати.
+The player's score should be used to calculate their rank among the other players. Complete the `calculateRank` method in the `Player` class to implement this.
 
 ```js
 
 ```
 
-Метод `calculateRank` повинен приймати масив об'єктів, які представляють всіх підключених гравців і повернути рядок `Rank: currentRanking/totalPlayers`. Наприклад, в грі з двома гравцями, якщо гравець А має рахунок 3 і гравець В має рахунок 5, `calculateRank` для гравця A повинен повернути `Rank: 2/2`.
+The `calculateRank` method should accept an array of objects representing all connected players and return the string `Rank: currentRanking/totalPlayers`. For example, in a game with two players, if Player A has a score of 3 and Player B has a score of 5, `calculateRank` for Player A should return `Rank: 2/2`.
 
 ```js
 
 ```
 
-Гравці можуть зіткнутися з предметом, який треба збирати. Заповніть `collision` метод у `Player.mjs` щоб це реалізувати.
+Players can collide with a collectible item. Complete the `collision` method in `Player.mjs` to implement this.
 
 ```js
 
 ```
 
-Метод `collision` повинен приймати об'єкт збору предмета в якості аргумента. Якщо аватар гравця перетинається з предметом, метод `collision` повинен повернути `true`.
+The `collision` method should accept a collectible item's object as an argument. If the player's avatar intersects with the item, the `collision` method should return `true`.
 
 ```js
 
 ```
 
-Всі гравці залишаються синхронізованими.
+All players are kept in sync.
 
 ```js
 
 ```
 
-Гравці можуть відключитись від гри в будь-який час.
+Players can disconnect from the game at any time.
 
 ```js
 
 ```
 
-Заборонити клієнту вгадувати тип MIME.
+Prevent the client from trying to guess / sniff the MIME type.
 
 ```js
 async (getUserInput) => {
@@ -128,7 +139,7 @@ async (getUserInput) => {
 };
 ```
 
-Заборонити міжсайтові скрипти (XSS) атаки.
+Prevent cross-site scripting (XSS) attacks.
 
 ```js
 async (getUserInput) => {
@@ -138,7 +149,7 @@ async (getUserInput) => {
 };
 ```
 
-Немає даних з веб-сайту.
+Nothing from the website is cached in the client.
 
 ```js
 async (getUserInput) => {
@@ -154,7 +165,7 @@ async (getUserInput) => {
 };
 ```
 
-Заголовки кажуть, що сайт працює на "PHP 7.4.3", не дивлячись на те, що це насправді не так (написано з міркувань безпеки).
+The headers say that the site is powered by "PHP 7.4.3" even though it isn't (as a security measure).
 
 ```js
 async (getUserInput) => {
diff --git a/curriculum/challenges/ukrainian/09-information-security/information-security-projects/sha-1-password-cracker.md b/curriculum/challenges/ukrainian/09-information-security/information-security-projects/sha-1-password-cracker.md
index 5d297ce139f..1559f377023 100644
--- a/curriculum/challenges/ukrainian/09-information-security/information-security-projects/sha-1-password-cracker.md
+++ b/curriculum/challenges/ukrainian/09-information-security/information-security-projects/sha-1-password-cracker.md
@@ -1,6 +1,6 @@
 ---
 id: 5e46f983ac417301a38fb933
-title: SHA-1 Password Cracker
+title: Злом паролів SHA-1
 challengeType: 10
 forumTopicId: 462374
 helpCategory: Python
@@ -9,19 +9,21 @@ dashedName: sha-1-password-cracker
 
 # --description--
 
-You will be [working on this project with our Replit starter code](https://replit.com/github/freeCodeCamp/boilerplate-SHA-1-password-cracker).
+Ви будете <a href="https://replit.com/github/freeCodeCamp/boilerplate-SHA-1-password-cracker" target="_blank" rel="noopener noreferrer nofollow">працювати над цим проєктом з нашим стартовим кодом Replit</a>.
 
-We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you everything you need to know to complete this project:
+Ми й досі в процесі розробки інтерактивної складової навчального курсу Python. Наразі можете ознайомитись із наступними відео на YouTube каналі freeCodeCamp.org. У них ви знайдете все необхідне для завершення цього проєкту:
 
-- [Python for Everybody Video Course](https://www.freecodecamp.org/news/python-for-everybody/) (14 hours)
+- <a href="https://www.freecodecamp.org/news/python-for-everybody/" target="_blank" rel="noopener noreferrer nofollow">Python for Everybody Video Course</a> (14 hours)
 
-- [Learn Python Video Course](https://www.freecodecamp.org/news/learn-python-video-course/) (10 hours)
+- <a href="https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/" target="_blank" rel="noopener noreferrer nofollow">Learn Python Basics in Depth</a> (4 hours)
+
+- <a href="https://www.freecodecamp.org/news/intermediate-python-course/" target="_blank" rel="noopener noreferrer nofollow">Intermediate Python Course</a> (6 hours)
 
 # --instructions--
 
-Passwords should never be stored in plain text. They should be stored as hashes, just in case the password list is discovered. However, not all hashes are created equal.
+Паролі ніколи не повинні зберігатися у вигляді звичайного тексту. Їх потрібно зберігати як хеші на випадок виявлення списку паролів. Однак не всі хеші створені однаковими.
 
-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.
 
 Create a function that takes in a SHA-1 hash of a password and returns the password if it is one of the top 10,000 passwords used. If the SHA-1 hash is NOT of a password in the database, return "PASSWORD NOT IN DATABASE".
 
@@ -41,23 +43,23 @@ Here are some hashed passwords to test the function with when `use_salts` is set
 - `da5a4e8cf89539e66097acd2f8af128acae2f8ae` should return "q1w2e3r4t5"
 - `ea3f62d498e3b98557f9f9cd0d905028b3b019e1` should return "bubbles1"
 
-The `hashlib` library has been imported for you. You should condider using it in your code. [Learn more about "hashlib" here.](https://docs.python.org/3/library/hashlib.html)
+The `hashlib` library has been imported for you. You should consider using it in your code. <a href="https://docs.python.org/3/library/hashlib.html" target="_blank" rel="noopener noreferrer nofollow">Learn more about "hashlib" here</a>.
 
-## Development
+## Розробка
 
-Write your code in `password_cracker.py`. For development, you can use `main.py` to test your code. Click the "run" button and `main.py` will run.
+Запишіть свій код в `password_cracker.py`. Для розробки, ви можете використати `main.py` для перевірки вашого коду. Натисніть клавішу "run" і `main.py` запуститься.
 
-## Testing
+## Тестування
 
-The unit tests for this project are in `test_module.py`. We imported the tests from `test_module.py` to `main.py` for your convenience. The tests will run automatically whenever you hit the "run" button.
+Розділи з тестами для цього проєкту знаходяться в `test_module.py`. Ми імпортували тести з `test_module.py` до `main.py` для вашої зручності. Тести запустяться автоматично кожен раз, коли ви натиснете клавішу "run".
 
-## Submitting
+## Надіслати
 
-Copy your project's URL and submit it to freeCodeCamp.
+Скопіюйте URL-адресу вашого проєкту і відправте його до freeCodeCamp.
 
 # --hints--
 
-It should pass all Python tests.
+Він повинен пройти усі тести Python.
 
 ```js
 
diff --git a/curriculum/challenges/ukrainian/09-information-security/information-security-projects/stock-price-checker.md b/curriculum/challenges/ukrainian/09-information-security/information-security-projects/stock-price-checker.md
index 4d7baddcb5b..be985dddc44 100644
--- a/curriculum/challenges/ukrainian/09-information-security/information-security-projects/stock-price-checker.md
+++ b/curriculum/challenges/ukrainian/09-information-security/information-security-projects/stock-price-checker.md
@@ -8,14 +8,14 @@ dashedName: stock-price-checker
 
 # --description--
 
-Напишіть повний пакет програми JavaScript, що функціонально подібний до цього: <https://stock-price-checker.freecodecamp.rocks/>.
+Створіть повний пакет додатку JavaScript, який функціонально схожий до <a href="https://stock-price-checker.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://stock-price-checker.freecodecamp.rocks/</a>.
 
-Оскільки всі надійні API цін на акції вимагають API-ключа, ми створили обхідний шлях. Користуйтесь <https://stock-price-checker-proxy.freecodecamp.rocks/>, аби отримувати актуальну інформацію про ціни на акції без необхідності підписуватись на власний ключ.
+Оскільки всі надійні API цін на акції вимагають API-ключа, ми створили обхідний шлях. Use <a href="https://stock-price-checker-proxy.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://stock-price-checker-proxy.freecodecamp.rocks/</a> to get up-to-date stock price information without needing to sign up for your own key.
 
 При роботі над цим проєктом Ви будете писати код, використовуючи один із наступних методів:
 
--   Дублюйте [цей репозиторій GitHub](https://github.com/freeCodeCamp/boilerplate-project-stockchecker/) та завершіть свій проєкт локально.
--   Використовуйте [наш стартовий проєкт Replit](https://replit.com/github/freeCodeCamp/boilerplate-project-stockchecker) для завершення Вашого проєкту.
+-   Клонуйте <a href="https://github.com/freeCodeCamp/boilerplate-project-stockchecker/" target="_blank" rel="noopener noreferrer nofollow">цей репозиторій GitHub</a> та виконайте свій проєкт локально.
+-   Використайте <a href="https://replit.com/github/freeCodeCamp/boilerplate-project-stockchecker" target="_blank" rel="noopener noreferrer nofollow">наш стартовий проєкт Replit</a> для виконання свого проєкту.
 -   Використовуйте конструктор сайту на власний розсуд, щоб завершити проєкт. Впевніться, що Ви включили усі файли з нашого репозиторію GitHub.
 
 Коли Ви завершите роботу, переконайтесь, що робоча демоверсія Вашого проєкту розміщена у вільному доступі. Потім введіть URL-адресу проєкту у поле `Solution Link`. За бажанням також введіть посилання на вихідний код проєкту у полі `GitHub Link`.
diff --git a/curriculum/challenges/ukrainian/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md b/curriculum/challenges/ukrainian/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md
index 1d72070146f..244d78f416f 100644
--- a/curriculum/challenges/ukrainian/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md
+++ b/curriculum/challenges/ukrainian/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 [Replit](https://replit.com/github/freeCodeCamp/boilerplate-bcrypt), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-bcrypt/).
+Нагадуємо, що цей проєкт створюється на основі наступного стартового проєкту на <a href="https://replit.com/github/freeCodeCamp/boilerplate-bcrypt" target="_blank" rel="noopener noreferrer nofollow">Replit</a> або клонований з <a href="https://github.com/freeCodeCamp/boilerplate-bcrypt/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
-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.
+Додайте це до наявної функції хешування (оскільки вам необхідно очікувати закінчення процесу перед тим як запускати функцію порівняння) після того, як ви записали про завершене хешування та ввели 'res' на консолі. На консолі з'являться дані перетворення та значення 'true'! Якщо ви зміните 'myPlaintextPassword' в функції порівняння на 'someOtherPlaintextPassword' - це призведе до помилки.
 
 ```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/ukrainian/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md b/curriculum/challenges/ukrainian/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md
index b6797d917b1..eb54c1ee782 100644
--- a/curriculum/challenges/ukrainian/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md
+++ b/curriculum/challenges/ukrainian/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md
@@ -10,8 +10,8 @@ dashedName: install-and-require-helmet
 
 Робота над цими завданнями включає написання коду користуючись одним з методів наведених нижче:
 
-- Створіть точну копію [ нашого репозиторія GitHub ](https://github.com/freeCodeCamp/boilerplate-infosec/) та завершіть ці завдання локально.
-- Використовуйте [Replit sterter project](https://replit.com/github/freeCodeCamp/boilerplate-infosec) для виконання цих завдань.
+- Клонуйте <a href="https://github.com/freeCodeCamp/boilerplate-infosec/" target="_blank" rel="noopener noreferrer nofollow">цей репозиторій GitHub</a> та виконайте ці завдання локально.
+- Використайте <a href="https://replit.com/github/freeCodeCamp/boilerplate-infosec" target="_blank" rel="noopener noreferrer nofollow">наш стартовий проєкт Replit</a> для виконання цих завдань.
 - Для завершення завдань використовуйте обраний вами розробник сайтів. Переконайтеся, що ви зберегли всі файли з нашого репозиторію GitHub.
 
 Після завершення, переконайтеся, що робоча демоверсія вашого проєкту розміщена у відкритому доступі. Потім введіть URL-адресу проєкту в поле `Solution Link`.
@@ -22,7 +22,7 @@ Helmet допоможе вам захистити ваші Express-програ
 
 Весь ваш код для цих уроків розміщується в файл `myApp.js` між рядками коду, з якого ми почали вам писати. Не змінюйте та не видаляйте код, який ми додали для вас.
 
-Встановіть версію Helmet`3.21.3`, це необхідно. Ви можете встановити певну версію пакету за допомогою `npm install --save-exact package@version`, або додавши його безпосередньо до `package.json`.
+Версія Helmet `3.21.3` вже встановлена, тому вимагайте його як `helmet` у `myApp.js`.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md b/curriculum/challenges/ukrainian/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md
index 73c0ec217f2..aeb2fda8330 100644
--- a/curriculum/challenges/ukrainian/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md
+++ b/curriculum/challenges/ukrainian/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md
@@ -8,17 +8,17 @@ dashedName: understand-bcrypt-hashes
 
 # --description--
 
-У наступних завданнях ви будете працювати з новим початковим проєктом, який відрізняється від попереднього. Ви можете знайти новий початковий проект на [Replit](https://replit.com/github/freeCodeCamp/boilerplate-bcrypt)або скопіювати його з [GitHub](https://github.com/freeCodeCamp/boilerplate-bcrypt/).
+У наступних завданнях ви будете працювати з новим початковим проєктом, який відрізняється від попереднього. You can find the new starter project on <a href="https://replit.com/github/freeCodeCamp/boilerplate-bcrypt" target="_blank" rel="noopener noreferrer nofollow">Replit</a>, or clone it from <a href="https://github.com/freeCodeCamp/boilerplate-bcrypt/" target="_blank" rel="noopener noreferrer nofollow">GitHub</a>.
 
 Функція BCrypt відзначається своєю надійністю. Хеш - це, по суті, "відбиток" початкових даних, який завжди лишається унікальним. Така функція виконується шляхом введення початкових даних в алгоритм і виведення фіксованого результату довжини. Щоб ускладнити процес і зробити його безпечнішим, ви можете застосувати випадково згенерований модифікатор *salt* для хешу. Випадкова генерація хешу включає в себе додавання випадкових даних до початкових даних перед процесом хешування, що ускладнює крадіжку хешу.
 
-Функція BCrypt завжди виглядає як код `$2a$13$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm`, що має структуру. Перший невеликий біт даних `$2a` визначає, який алгоритм хешу був використаний. Наступна частина `$13` визначає *cost*. Cost показує наскільки важко вичислити хеш. Цей елемент розміщений на логарифмічній шкалі 2^cost і визначає скільки разів дані проходять крізь алгоритм хешування. Наприклад, якщо cost дорівнює 10, ви можете перетворити 10 паролів за секунду на середньостатистичному комп'ютері, однак при значенні cost 15 - це займе 3 секунди за один результат... і, відповідно, при значенні 31, процес займе кілька днів, щоб отримати готовий хеш. Значення cost 12 вважається найбезпечнішим на сьогодні. Остання частина хешу `$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm` виглядає як один великий рядок чисел, періодів і букв, але насправді це дві окремі деталі. Перші 22 символи це згенерований модифікатор у вигляді простого тексту, решта - перетворений пароль!
+BCrypt hashes will always look like `$2a$13$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm` which does have a structure. Перший невеликий біт даних `$2a` визначає, який алгоритм хешу був використаний. Наступна частина `$13` визначає *cost*. Cost показує наскільки важко вичислити хеш. Цей елемент розміщений на логарифмічній шкалі 2^cost і визначає скільки разів дані проходять крізь алгоритм хешування. 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 take multiple days to complete a hash. Значення cost 12 вважається найбезпечнішим на сьогодні. Остання частина хешу `$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm` виглядає як один великий рядок чисел, періодів і букв, але насправді це дві окремі деталі. Перші 22 символи це згенерований модифікатор у вигляді простого тексту, решта - перетворений пароль!
 
 # --instructions--
 
-Щоб почати використовувати 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` між рядками коду, з якого ми почали. Не змінюйте і не видаляйте код, який ми додали для вас.
+BCrypt has already been added as a dependency, so require it as `bcrypt` in your server.
 
 Підтвердіть свою сторінку, коли зрозумієте, що все працює коректно.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md
index c35c941e513..e8acf0f264d 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md
@@ -1,14 +1,14 @@
 ---
 id: a3f503de51cf954ede28891d
 title: Знайдіть симетричну різницю множин
-challengeType: 5
+challengeType: 1
 forumTopicId: 301611
 dashedName: find-the-symmetric-difference
 ---
 
 # --description--
 
-Математичний термін <dfn> симетрична різниця</dfn> (`△` або `⊕`) двох множин - це набір елементів, які знаходяться в одній з множин, але не в обох. Наприклад, для множин `A = {1, 2, 3}` та `B = {2, 3, 4}`, `A △ B = {1, 4}`.
+Математичний термін <dfn>симетрична різниця двох множин</dfn> (`△` або `⊕`) – це множина елементів, які знаходяться в одній з множин, але не в обох. Наприклад, для множин `A = {1, 2, 3}` та `B = {2, 3, 4}`, `A △ B = {1, 4}`.
 
 Симетрична різниця множин - це двійкова операція, тобто вона діє лише на два елементи. Тому, щоб оцінити вираз, який містить симетричну різницю множин серед *трьох* елементів(`A △ B △ C`), потрібно виконувати лише одну операцію одночасно. Таким чином, для множин `A` та `B` вище, і `C = {2, 3}`, `A △ B △ C = (A △ B) △ C = {1, 4} △ {2, 3} = {1, 2, 3, 4}`.
 
@@ -54,7 +54,7 @@ assert.sameMembers(sym([1, 2, 3], [5, 2, 1, 4, 5]), [3, 4, 5]);
 assert.equal(sym([1, 2, 3], [5, 2, 1, 4, 5]).length, 3);
 ```
 
-`sym([1, 2, 5], [2, 3, 5], [3, 4, 5])` повинен повертатися як `[1, 4, 5]`
+`sym([1, 2, 5], [2, 3, 5], [3, 4, 5])` should return `[1, 4, 5]`.
 
 ```js
 assert.sameMembers(sym([1, 2, 5], [2, 3, 5], [3, 4, 5]), [1, 4, 5]);
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/algorithms/implement-binary-search.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/algorithms/implement-binary-search.md
index bd2e8306ee1..66080225901 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/algorithms/implement-binary-search.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/algorithms/implement-binary-search.md
@@ -37,7 +37,7 @@ const testArray = [
 
 # --hints--
 
-`binarySearch` should be a function.
+`binarySearch` має бути функцією.
 
 ```js
 assert(typeof binarySearch == 'function');
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md
index 36851478c48..b36afe18f23 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md
@@ -22,7 +22,7 @@ dashedName: add-a-new-element-to-a-binary-search-tree
 
 # --instructions--
 
-Розпочнемо з простого. Ми окреслили основу структури двійкового дерева пошуку разом з функцією створення вузлів для нашого дерева. Зауважте, що кожен вузол може мати ліве та праве значення. Вони будуть призначатися дочірнім піддеревам за умови їх існування. Ви створите метод додавання нових значень до нашого двійкового дерева пошуку. Метод повинен називатися `add` і приймати ціле значення, яке буде додане до дерева. Необхідно зберігати інваріантність двійкового дерева пошуку: значення кожного лівого дочірнього елемента повинно бути меншим за батьківське значення або рівним йому, а значення кожного правого дочірнього елемента - більшим за батьківське значення або дорівнювати йому. Зробімо так, щоб наше дерево не містило повторюваних значень. Якщо ми спробуємо додати значення, яке вже існує, метод повинен повернути `null`. Успішне додавання повернеться як `undefined`.
+Розпочнемо з простого. Ми окреслили основу структури двійкового дерева пошуку разом з функцією створення вузлів для нашого дерева. Зауважте, що кожен вузол може мати ліве та праве значення. Вони будуть призначатися дочірнім піддеревам за умови їх існування. In our binary search tree, you will create a method to add new values to the tree. Метод повинен називатися `add` і приймати ціле значення, яке буде додане до дерева. Необхідно зберігати інваріантність двійкового дерева пошуку: значення кожного лівого дочірнього елемента повинно бути меншим за батьківське значення або рівним йому, а значення кожного правого дочірнього елемента - більшим за батьківське значення або дорівнювати йому. Зробімо так, щоб наше дерево не містило повторюваних значень. Якщо ми спробуємо додати значення, яке вже існує, метод повинен повернути `null`. Успішне додавання повернеться як `undefined`.
 
 **Підказка:** дерева за своєю суттю є рекурсивними структурами даних!
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md
index aec8119c6fb..0b9faddcfe7 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md
@@ -39,6 +39,24 @@ assert(
 );
 ```
 
+`isBinarySearchTree()` should return false when checked with a tree that is not a binary search tree.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    test.push(1);
+    test.root.left = new Node(1);
+    return isBinarySearchTree(test) == false;
+  })()
+);
+```
+
 # --seed--
 
 ## --after-user-code--
@@ -114,7 +132,7 @@ function isBinarySearchTree(tree) {
     function checkTree(node) {
       if (node.left != null) {
         const left = node.left;
-        if (left.value > node.value) {
+        if (left.value >= node.value) {
           isBST = false;
         } else {
           checkTree(left);
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md
index 1de93e7705e..11d8188b35e 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md
@@ -20,7 +20,7 @@ dashedName: create-a-doubly-linked-list
 
 # --hints--
 
-Повинна існувати структура даних DoublyLinkedList.
+The `DoublyLinkedList` data structure should exist.
 
 ```js
 assert(
@@ -34,7 +34,7 @@ assert(
 );
 ```
 
-У DoublyLinkedList повинен бути метод add.
+`DoublyLinkedList` повинен мати метод під назвою `add`.
 
 ```js
 assert(
@@ -51,7 +51,7 @@ assert(
 );
 ```
 
-У DoublyLinkedList повинен бути метод remove.
+`DoublyLinkedList` повинен мати метод під назвою `remove`.
 
 ```js
 assert(
@@ -68,7 +68,7 @@ assert(
 );
 ```
 
-Спроба видалення елементу з пустого списку має повертатися як null.
+Removing an item from an empty list should return `null`.
 
 ```js
 assert(
@@ -82,7 +82,7 @@ assert(
 );
 ```
 
-Метод add має додавати елементи до списку.
+The `add` method should add items to the list.
 
 ```js
 assert(
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/create-a-hash-table.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/create-a-hash-table.md
index a4752e3af3e..ea57c8a39dc 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/create-a-hash-table.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/create-a-hash-table.md
@@ -24,7 +24,7 @@ dashedName: create-a-hash-table
 
 # --hints--
 
-Повинна існувати структура даних HashTable.
+The `HashTable` data structure should exist.
 
 ```js
 assert(
@@ -38,7 +38,7 @@ assert(
 );
 ```
 
-HashTable має містити метод add.
+The `HashTable` should have an `add` method.
 
 ```js
 assert(
@@ -52,7 +52,7 @@ assert(
 );
 ```
 
-HashTable має мати метод lookup.
+The `HashTable` should have a `lookup` method.
 
 ```js
 assert(
@@ -66,7 +66,7 @@ assert(
 );
 ```
 
-HashTable має мати метод remove.
+The `HashTable` should have a `remove` method.
 
 ```js
 assert(
@@ -80,7 +80,7 @@ assert(
 );
 ```
 
-Метод add повинен додати пари ключів-значень, а метод lookup повинен повернути значення, пов'язані з заданим ключем.
+The `add` method should add key value pairs and the `lookup` method should return the values associated with a given key.
 
 ```js
 assert(
@@ -95,7 +95,7 @@ assert(
 );
 ```
 
-Після введення ключа метод remove вилучає асоціативну пару ключ-значення.
+The `remove` method should accept a key as input and should remove the associated key value pair.
 
 ```js
 assert(
@@ -113,7 +113,7 @@ assert(
 );
 ```
 
-Метод remove вилучає тільки правильну пару ключ-значення.
+The `remove` method should only remove the correct key value pair.
 
 ```js
 assert(
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/create-a-map-data-structure.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/create-a-map-data-structure.md
index 33b37db9b01..98342191e06 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/create-a-map-data-structure.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/create-a-map-data-structure.md
@@ -26,7 +26,7 @@ dashedName: create-a-map-data-structure
 
 # --hints--
 
-Повинна існувати структура даних Map.
+The `Map` data structure should exist.
 
 ```js
 assert(
@@ -40,7 +40,7 @@ assert(
 );
 ```
 
-Об'єкт Map має містити такі методи: add, remove, get, has, values, clear, and size.
+The `Map` object should have the following methods: `add`, `remove`, `get`, `has`, `values`, `clear`, and `size`.
 
 ```js
 assert(
@@ -62,7 +62,7 @@ assert(
 );
 ```
 
-Метод add має додавати елементи до карти.
+The `add` method should add items to the map.
 
 ```js
 assert(
@@ -79,7 +79,7 @@ assert(
 );
 ```
 
-Метод has має повертати true для доданих елементів та false - для відсутніх.
+The `has` method should return `true` for added items and `false` for absent items.
 
 ```js
 assert(
@@ -94,7 +94,7 @@ assert(
 );
 ```
 
-Метод get має приймати ключі в якості вхідних даних та повертати пов'язані з ними значення.
+The `get` method should accept keys as input and should return the associated values.
 
 ```js
 assert(
@@ -109,7 +109,7 @@ assert(
 );
 ```
 
-Метод values має повертати всі значення, що зберігаються в карті, у вигляді рядків масиву.
+The `values` method should return all the values stored in the map as strings in an array.
 
 ```js
 assert(
@@ -131,7 +131,7 @@ assert(
 );
 ```
 
-Метод clear має очистити карту, а метод size - повернути кількість елементів, що місяться в карті.
+The `clear` method should empty the map and the `size` method should return the number of items present in the map.
 
 ```js
 assert(
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md
index a6f1ea34df0..aec725b65ac 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md
@@ -12,11 +12,11 @@ dashedName: create-a-trie-search-tree
 
 # --instructions--
 
-Створімо префіксне дерево пошуку для зберігання слів. Воно буде отримувати слова за допомогою методу `add` і зберігати їх у структурі даних префіксного дерева пошуку. А також він допоможе нам дізнатися, чи даний рядок містить слово з методом `isWord`, і вилучить всі слова, введені у префіксне дерево пошуку за допомогою способу `print`. Метод `isWord` повинен повернути логічне значення, а метод print - повернути масив всіх цих слів у вигляді рядкових значень. Аби впевнитись, що ця структура даних реалізована правильно, ми задали структуру `Node` для кожного вузла у дереві. Кожен вузол буде об'єктом із властивістю `keys`, яка є об'єктом JavaScript Map. Він міститиме окремі літери, які виступають дійсними ключами кожного вузла. Також ми створили для вузлів властивість `end`, яка може бути налаштована як `true`, якщо вузол являє собою закінчення слова.
+Створімо префіксне дерево пошуку для зберігання слів. Воно буде отримувати слова за допомогою методу `add` і зберігати їх у структурі даних префіксного дерева пошуку. А також він допоможе нам дізнатися, чи даний рядок містить слово з методом `isWord`, і вилучить всі слова, введені у префіксне дерево пошуку за допомогою способу `print`. `isWord` should return a boolean value and `print` should return an array of all these words as string values. Аби впевнитись, що ця структура даних реалізована правильно, ми задали структуру `Node` для кожного вузла у дереві. Кожен вузол буде об'єктом із властивістю `keys`, яка є об'єктом JavaScript Map. Він міститиме окремі літери, які виступають дійсними ключами кожного вузла. Також ми створили для вузлів властивість `end`, яка може бути налаштована як `true`, якщо вузол являє собою закінчення слова.
 
 # --hints--
 
-Префіксне дерево пошуку має містити метод add.
+`Trie` повинен мати метод `add`.
 
 ```js
 assert(
@@ -32,7 +32,7 @@ assert(
 );
 ```
 
-Префіксне дерево пошуку має містити метод print.
+`Trie` повинен мати метод `print`.
 
 ```js
 assert(
@@ -48,7 +48,7 @@ assert(
 );
 ```
 
-Префіксне дерево пошуку має містити метод isWord.
+`Trie` повинен мати метод `isWord`.
 
 ```js
 assert(
@@ -64,7 +64,7 @@ assert(
 );
 ```
 
-Метод print має повернути всі елементи, додані до префіксного дерева пошуку у вигляді рядків масиву.
+The `print` method should return all items added to the trie as strings in an array.
 
 ```js
 assert(
@@ -93,7 +93,7 @@ assert(
 );
 ```
 
-Метод isWord має повернути true лише для слів, доданих до префіксного дерева пошуку, і false - для всіх інших слів.
+The `isWord` method should return `true` only for words added to the trie and `false` for all other words.
 
 ```js
 assert(
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md
index e9e5cb92a75..95f57891c27 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md
@@ -8,7 +8,15 @@ dashedName: create-an-es6-javascript-map
 
 # --description--
 
-У новій версії JavaScript вбудований об'єкт Map, який передбачає наявність усіх тих функцій, які до цього ми мали писати самостійно. Незважаючи на те, що обʼєкт Map схожий на звичайні обʼєкти JavaScript, у ньому вбудований корисний функціонал, який відсутній у звичайних. Наприклад, ES6 Map відстежує порядок вставки елементів, які додаються до нього. Серед його методів є такі: метод `.has(key)` повертає true або false з огляду на наявність ключа; метод `.get(key)` повертає значення, повʼязане з ключем; метод `.set(key, value)` задає нову пару ключ-значення; метод `.delete(key)` видаляє пару ключ-значення; метод `.clear()` видаляє всі пари ключів-значень; метод `.entries()` повертає весь масив ключів у порядку їх вставки; метод `.values()` повертає весь масив значень у порядку їх вставки
+У новій версії JavaScript вбудований об'єкт Map, який передбачає наявність усіх тих функцій, які до цього ми мали писати самостійно. Незважаючи на те, що обʼєкт Map схожий на звичайні обʼєкти JavaScript, у ньому вбудований корисний функціонал, який відсутній у звичайних. Наприклад, ES6 Map відстежує порядок вставки елементів, які додаються до нього. Here is a more complete overview of its methods:
+
+- `.has(key)` returns true or false based on the presence of a key
+- `.get(key)` returns the value associated with a key
+- `.set(key, value)` sets a new key, value pair
+- `.delete(key)` removes a key, value pair
+- `.clear()` removes all key, value pairs
+- `.entries()` returns an array of all the keys in insertion order
+- `.values()` returns an array of all the values in insertion order
 
 # --instructions--
 
@@ -16,13 +24,13 @@ dashedName: create-an-es6-javascript-map
 
 # --hints--
 
-Повинен існувати об'єкт myMap.
+The `myMap` object should exist.
 
 ```js
 assert(typeof myMap === 'object');
 ```
 
-myMap повинен містити пару ключ-значення `freeCodeCamp`, `Awesome!`.
+`myMap` should contain the key value pair `freeCodeCamp`, `Awesome!`.
 
 ```js
 assert(myMap.get('freeCodeCamp') === 'Awesome!');
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/depth-first-search.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/depth-first-search.md
index 4c4c843e7fe..5ca08c5c294 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/depth-first-search.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/depth-first-search.md
@@ -49,7 +49,24 @@ assert.sameMembers(
 );
 ```
 
-Вхідний граф `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]` з початковим вузлом `1` повинен повертатися як масив з чотирьох елементів.
+The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]` with a start node of `3` should return an array with `3`, `2`, `1`, and `0`.
+
+```js
+assert.sameMembers(
+  (function () {
+    var graph = [
+      [0, 1, 0, 0],
+      [1, 0, 1, 0],
+      [0, 1, 0, 1],
+      [0, 0, 1, 0]
+    ];
+    return dfs(graph, 3);
+  })(),
+  [3, 2, 1, 0]
+);
+```
+
+The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]` with a start node of `1` should return an array with four elements.
 
 ```js
 assert(
@@ -65,7 +82,7 @@ assert(
 );
 ```
 
-Вхідний граф `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 0]]` з початковим вузлом `3` повинен повертатися як масив з числом `3`.
+The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 0]]` with a start node of `3` should return an array with `3`.
 
 ```js
 assert.sameMembers(
@@ -82,7 +99,7 @@ assert.sameMembers(
 );
 ```
 
-Вхідний граф `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 0]]` з початковим вузлом `3` повинен повертатися як масив з одним елементом.
+The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 0]]` with a start node of `3` should return an array with one element.
 
 ```js
 assert(
@@ -98,7 +115,7 @@ assert(
 );
 ```
 
-Вхідний граф`[[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]` з початковим вузлом `3` повинен повертатися як масив з чисел `2` і `3`.
+The input graph `[[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]` with a start node of `3` should return an array with `2` and `3`.
 
 ```js
 assert.sameMembers(
@@ -115,7 +132,7 @@ assert.sameMembers(
 );
 ```
 
-Вхідний граф `[[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]` з початковим вузлом `3` повинен повертатися як масив з двох елементів.
+The input graph `[[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]` with a start node of `3` should return an array with two elements.
 
 ```js
 assert(
@@ -131,7 +148,7 @@ assert(
 );
 ```
 
-Вхідний граф `[[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]` з початковим вузлом `0` повинен повертатися як масив з чисел `0` і `1`.
+The input graph `[[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]` with a start node of `0` should return an array with `0` and `1`.
 
 ```js
 assert.sameMembers(
@@ -148,7 +165,7 @@ assert.sameMembers(
 );
 ```
 
-Вхідний граф `[[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]` з початковим вузлом `0` повинен повертатися як масив з двох елементів.
+The input graph `[[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]` with a start node of `0` should return an array with two elements.
 
 ```js
 assert(
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md
index 84277bc1077..0c34650ad26 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md
@@ -18,7 +18,7 @@ dashedName: implement-heap-sort-with-a-min-heap
 
 # --hints--
 
-Повинна існувати структура даних MinHeap (неспадна купа).
+The `MinHeap` data structure should exist.
 
 ```js
 assert(
@@ -32,7 +32,7 @@ assert(
 );
 ```
 
-MinHeap повинна мати метод під назвою insert.
+`MinHeap` повинен мати метод під назвою `insert`.
 
 ```js
 assert(
@@ -48,7 +48,7 @@ assert(
 );
 ```
 
-MinHeap повинна мати метод під назвою remove.
+`MinHeap` повинен мати метод під назвою `remove`.
 
 ```js
 assert(
@@ -64,7 +64,7 @@ assert(
 );
 ```
 
-MinHeap повинна мати метод під назвою sort.
+`MinHeap` повинен мати метод під назвою `sort`.
 
 ```js
 assert(
@@ -80,7 +80,7 @@ assert(
 );
 ```
 
-Метод sort повинен повертати масив, що містить усі елементи, додані до неспадної купи, у відсортованому порядку.
+The `sort` method should return an array containing all items added to the min heap in sorted order.
 
 ```js
 assert(
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/incidence-matrix.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/incidence-matrix.md
index 6d924c5e449..d0e1108411b 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/incidence-matrix.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/incidence-matrix.md
@@ -18,7 +18,7 @@ dashedName: incidence-matrix
 
 <blockquote>    1<br>   ---<br>1 | 1<br>2 | 0<br>3 | 1</blockquote>
 
-Ось приклад матриці інцидентності `incidence matrix` з 4-ма ребрами та 4-ма вершинами. Пам'ятайте, стовпці — це ребра, а рядки — вершини.
+Here is an example of an incidence matrix with 4 edges and 4 nodes. Пам'ятайте, стовпці — це ребра, а рядки — вершини.
 
 <blockquote>    1 2 3 4<br>   --------<br>1 | 0 1 1 1<br>2 | 1 1 0 0<br>3 | 1 0 0 1<br>4 | 0 0 1 0</blockquote>
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
index 85cb5e05190..bfa85408a3b 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
@@ -48,7 +48,7 @@ dashedName: insert-an-element-into-a-max-heap
 
 # --hints--
 
-Дані незростаючої купи повинні бути структуровані.
+The `MaxHeap` data structure should exist.
 
 ```js
 assert(
@@ -62,7 +62,7 @@ assert(
 );
 ```
 
-Незростаюча купа повинна містити процедуру insert.
+`MaxHeap` повинен мати метод під назвою `insert`.
 
 ```js
 assert(
@@ -78,7 +78,7 @@ assert(
 );
 ```
 
-Незростаюча купа повинна містити процедуру print.
+`MaxHeap` повинен мати метод під назвою `print`.
 
 ```js
 assert(
@@ -94,7 +94,7 @@ assert(
 );
 ```
 
-Процедура insert додає елементи відповідно до властивостей купи.
+The `insert` method should add elements according to the max heap property.
 
 ```js
 assert(
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md
index 60a1e7996a4..15eae562643 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md
@@ -25,7 +25,7 @@ assert(
 );
 ```
 
-Перша множина Set() повинна міститися у другій
+The first `Set` should be contained in the second `Set`.
 
 ```js
 assert(
@@ -43,7 +43,7 @@ assert(
 );
 ```
 
-Метод `['a', 'b'].isSubsetOf(['a', 'b', 'c', 'd'])` повинен повернутися як `true`
+`['a', 'b'].isSubsetOf(['a', 'b', 'c', 'd'])` повинен повертати `true`.
 
 ```js
 assert(
@@ -62,7 +62,7 @@ assert(
 );
 ```
 
-Метод `['a', 'b', 'c'].isSubsetOf(['a', 'b'])` повинен повернутися як `false`
+`['a', 'b', 'c'].isSubsetOf(['a', 'b'])` повинен повертати `false`.
 
 ```js
 assert(
@@ -80,7 +80,7 @@ assert(
 );
 ```
 
-Метод `[].isSubsetOf([])` повинен повернутися як `true`
+`[].isSubsetOf([])` повинен повертати `true`.
 
 ```js
 assert(
@@ -93,7 +93,7 @@ assert(
 );
 ```
 
-Метод `['a', 'b'].isSubsetOf(['c', 'd'])` повинен повернутися як `false`
+`['a', 'b'].isSubsetOf(['c', 'd'])` повинен повертати `false`.
 
 ```js
 assert(
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md
index dc924f46efd..afc3a22c55c 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md
@@ -25,7 +25,7 @@ assert(
 );
 ```
 
-Спроба об'єднання множини, що містить значення ["a", "b", "c"], та множини, що містить значення ["c", "d"], повинна повертатися як нова множина зі значеннями ["a", "b", "c", "d"].
+The union of a `Set` containing values `["a", "b", "c"]` and a `Set` containing values `["c", "d"]` should return a new `Set` containing values `["a", "b", "c", "d"]`.
 
 ```js
 assert(
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
index 516f1c1fadd..cf4b23754e3 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
@@ -22,7 +22,7 @@ dashedName: remove-an-element-from-a-max-heap
 
 # --hints--
 
-Повинна існувати структура даних MaxHeap.
+The `MaxHeap` data structure should exist.
 
 ```js
 assert(
@@ -36,7 +36,7 @@ assert(
 );
 ```
 
-У MaxHeap повинен бути метод під назвою print.
+`MaxHeap` повинен мати метод під назвою `print`.
 
 ```js
 assert(
@@ -52,7 +52,7 @@ assert(
 );
 ```
 
-У MaxHeap повинен бути метод під назвою insert.
+`MaxHeap` повинен мати метод під назвою `insert`.
 
 ```js
 assert(
@@ -68,7 +68,7 @@ assert(
 );
 ```
 
-У MaxHeap повинен бути метод під назвою remove.
+`MaxHeap` повинен мати метод під назвою `remove`.
 
 ```js
 assert(
@@ -84,7 +84,7 @@ assert(
 );
 ```
 
-Метод remove має видаляти найбільший елемент з незростаючої купи, зберігаючи при цьому властивість купи.
+The `remove` method should remove the greatest element from the max heap while maintaining the max heap property.
 
 ```js
 assert(
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.md
index 72c8d18e870..e35228dd7ee 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.md
@@ -14,7 +14,7 @@ dashedName: remove-elements-from-a-linked-list-by-index
 
 Зазвичай, щоб пройтися елементами зв'язаного списку, користуються технікою, що містить <dfn>'runner'</dfn>, або вартового, який "вказує" на вузли, які порівнює ваш код. Оскільки в нашому випадку ми почнемо з `head` (голови) списку, то змінна `currentIndex` починається з `0`. `currentIndex` має збільшуватись на одиницю для кожного пройденого вузла.
 
-Як і з методом `remove(element)`, який [ми вивчили на минулому уроці](/learn/coding-interview-prep/data-structures/remove-elements-from-a-linked-list), потрібно бути обережним, щоб не осиротити решту елементів нашого списку при видаленні вузла за допомогою методу `removeAt(index)`. Ми зберігаємо ланцюг вузлів, переконавшись, що вузол, в якому міститься посилання на видалений вузол, має ще й посилання на наступний.
+Just like our `remove(element)` method, which <a href="/learn/coding-interview-prep/data-structures/remove-elements-from-a-linked-list" target="_blank" rel="noopener noreferrer nofollow">we covered in a previous lesson</a>, we need to be careful not to orphan the rest of our list when we remove the node in our `removeAt(index)` method. Ми зберігаємо ланцюг вузлів, переконавшись, що вузол, в якому міститься посилання на видалений вузол, має ще й посилання на наступний.
 
 # --instructions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
index e791dff3ca6..4bd4bc5c2b7 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
@@ -12,7 +12,7 @@ dashedName: reverse-a-doubly-linked-list
 
 # --hints--
 
-Повинна існувати структура даних DoublyLinkedList.
+The `DoublyLinkedList` data structure should exist.
 
 ```js
 assert(
@@ -26,7 +26,7 @@ assert(
 );
 ```
 
-DoublyLinkedList повинен мати метод під назвою reverse.
+`DoublyLinkedList` повинен мати метод під назвою `reverse`.
 
 ```js
 assert(
@@ -43,7 +43,7 @@ assert(
 );
 ```
 
-Спроба перевернути порожній список повинна повернутися як null.
+Reversing an empty list should return `null`.
 
 ```js
 assert(
@@ -57,7 +57,7 @@ assert(
 );
 ```
 
-Метод reverse повинен перевертати список.
+The `reverse` method should reverse the list.
 
 ```js
 assert(
@@ -77,7 +77,7 @@ assert(
 );
 ```
 
-У перевернутому списку повинні правильно підтримуватися посилання на наступні та попередні елементи.
+The `next` and `previous` references should be correctly maintained when a list is reversed.
 
 ```js
 assert(
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/search-within-a-linked-list.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/search-within-a-linked-list.md
index fb28ddadf4e..fa3284c67c2 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/search-within-a-linked-list.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/data-structures/search-within-a-linked-list.md
@@ -16,7 +16,7 @@ dashedName: search-within-a-linked-list
 
 # --instructions--
 
-Напишіть метод `isEmpty`, який перевірятиме, чи зв'язаний список порожній; метод `indexOf`, який повертає індекс `index` даного елементу; метод `elementAt`, який повертає `element` за заданим індексом `index.`
+Write an `isEmpty` method that checks if the linked list is empty, an `indexOf` method that returns the `index` of a given element, and an `elementAt` that returns an `element` at a given `index`.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
index c655ca8f2dd..4fa18ea59ab 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
@@ -60,32 +60,46 @@ primeSummation(2000000);
 # --solutions--
 
 ```js
-const NUM_PRIMES = 2000000;
-const PRIME_SEIVE = Array(Math.floor((NUM_PRIMES-1)/2)).fill(true);
-(function initPrimes(num) {
-  const upper = Math.floor((num - 1) / 2);
-  const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
-  for (let i = 0; i <= sqrtUpper; i++) {
-    if (PRIME_SEIVE[i]) {
-      // Mark value in PRIMES array
-      const prime = 2 * i + 3;
-      // Mark all multiples of this number as false (not prime)
-      const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
-      for (let j = primeSqaredIndex; j < upper; j += prime) {
-        PRIME_SEIVE[j] = false;
+class PrimeSeive {
+  constructor(num) {
+    const seive = Array(Math.floor((num - 1) / 2)).fill(true);
+    const upper = Math.floor((num - 1) / 2);
+    const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+
+    for (let i = 0; i <= sqrtUpper; i++) {
+      if (seive[i]) {
+        // Mark value in seive array
+        const prime = 2 * i + 3;
+        // Mark all multiples of this number as false (not prime)
+        const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+        for (let j = primeSqaredIndex; j < upper; j += prime) {
+          seive[j] = false;
+        }
       }
     }
+
+    this._seive = seive;
   }
-})(NUM_PRIMES);
 
-function isOddNumberPrime(num) {
-  return PRIME_SEIVE[(num - 3) / 2];
-}
+  isPrime(num) {
+    return num === 2
+      ? true
+      : num % 2 === 0
+        ? false
+        : this.isOddPrime(num);
+  }
+
+  isOddPrime(num) {
+    return this._seive[(num - 3) / 2];
+  }
+};
+
+function primeSummation(num) {
+  const primeSeive = new PrimeSeive(num);
 
-function primeSummation(n) {
   let sum = 2;
-  for (let i = 3; i < n; i += 2) {
-    if (isOddNumberPrime(i)) sum += i;
+  for (let i = 3; i < num; i += 2) {
+    if (primeSeive.isOddPrime(i)) sum += i;
   }
   return sum;
 }
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-107-minimal-network.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
index 0312ca5e29c..dba6cfc9a5f 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3d91000cf542c50feea
 title: 'Завдання 107: мінімальна мережа'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301731
 dashedName: problem-107-minimal-network
 ---
@@ -27,7 +27,7 @@ dashedName: problem-107-minimal-network
 
 Однак можна оптимізувати мережу, видаливши деякі ребра, при цьому всі точки мережі залишаться з'єднаними. Нижче відображена максимально оптимізована мережа. Вона має вагу - 93, оптимізація становить 243 − 93 = 150 з вихідної мережі.
 
-<img class="img-responsive center-block" alt="Мережа з сімома вершинами та шістьма ребрами, що залишились: AB, BD, CA, DE, DF, EG" src="https://cdn.freecodecamp.org/curriculum/project-euler/minimal-network-2.png" style="background-color: white; padding: 10px;" />
+<img class="img-responsive center-block" alt="Network with 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;" />
 
 Використовуючи `network`, 2D масив, що представляє мережу у формі матриці, знайдіть максимальний рівень оптимізації, який можна досягти, усунувши зайві ребра, при цьому мережа повинна залишатись з'єднаною. Вершини, що не мають з'єднання, будуть представлені `-1`.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
index 08779282a3d..9e96ab13b68 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
@@ -1,16 +1,16 @@
 ---
 id: 5900f3e81000cf542c50fefb
-title: 'Problem 124: Ordered radicals'
-challengeType: 5
+title: 'Задача 124: Впорядковані радикали'
+challengeType: 1
 forumTopicId: 301751
 dashedName: problem-124-ordered-radicals
 ---
 
 # --description--
 
-The radical of $n$, $rad(n)$, is the product of the distinct prime factors of $n$. For example, $504 = 2^3 × 3^2 × 7$, so $rad(504) = 2 × 3 × 7 = 42$.
+The radical of $n$, $rad(n)$, is the product of the distinct prime factors of $n$. Наприклад, $ 504 = 2^3 × 3^2 × 7 $, тому $rad(504) = 2 × 3 × 7 = 42$.
 
-If we calculate $rad(n)$ for $1 ≤ n ≤ 10$, then sort them on $rad(n)$, and sorting on $n$ if the radical values are equal, we get:
+Якщо ми обчислюємо $rad (n)$ для $1 ≤ n ≤ 10$, то сортуємо їх за $rad (n)$, а за $n$, якщо радикальні значення рівні, то отримуємо:
 
 <div style="text-align: center;">
   <table cellpadding="2" cellspacing="0" border="0" align="center">
@@ -112,11 +112,11 @@ If we calculate $rad(n)$ for $1 ≤ n ≤ 10$, then sort them on $rad(n)$, and s
   </table>
 </div><br>
 
-Let $E(k)$ be the $k$th element in the sorted $n$ column; for example, $E(4) = 8$ and $E(6) = 9$. If $rad(n)$ is sorted for $1 ≤ n ≤ 100000$, find $E(10000)$.
+Нехай $E(k)$ - елемент $k$ у відсортованому стовпці $n$; наприклад, $E(4) = 8$ і $E(6) = 9$. Якщо $rad(n)$ відсортовано за $1 ≤ n ≤ 100000$, знайдіть $E(10000)$.
 
 # --hints--
 
-`orderedRadicals()` should return `21417`.
+`orderedRadicals()` має повернути `21417`.
 
 ```js
 assert.strictEqual(orderedRadicals(), 21417);
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
index 6ea78f0a194..843461033e5 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ec1000cf542c50feff
 title: 'Завдання 128: Різниці шестикутних плиток'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301755
 dashedName: problem-128-hexagonal-tile-differences
 ---
@@ -28,10 +28,16 @@ dashedName: problem-128-hexagonal-tile-differences
 
 # --hints--
 
-`hexagonalTile()` повинен повернути `14516824220`.
+`hexagonalTile(10)` should return `271`.
 
 ```js
-assert.strictEqual(hexagonalTile(), 14516824220);
+assert.strictEqual(hexagonalTile(10), 271);
+```
+
+`hexagonalTile(2000)` should return `14516824220`.
+
+```js
+assert.strictEqual(hexagonalTile(2000), 14516824220);
 ```
 
 # --seed--
@@ -39,16 +45,62 @@ assert.strictEqual(hexagonalTile(), 14516824220);
 ## --seed-contents--
 
 ```js
-function hexagonalTile() {
+function hexagonalTile(tileIndex) {
 
   return true;
 }
 
-hexagonalTile();
+hexagonalTile(10);
 ```
 
 # --solutions--
 
 ```js
-// solution required
+const NUM_PRIMES = 840000;
+const PRIME_SEIVE = Array(Math.floor((NUM_PRIMES-1)/2)).fill(true);
+(function initPrimes(num) {
+  const upper = Math.floor((num - 1) / 2);
+  const sqrtUpper = Math.floor((Math.sqrt(num) - 1) / 2);
+  for (let i = 0; i <= sqrtUpper; i++) {
+    if (PRIME_SEIVE[i]) {
+      // Mark value in PRIMES array
+      const prime = 2 * i + 3;
+      // Mark all multiples of this number as false (not prime)
+      const primeSqaredIndex = 2 * i ** 2 + 6 * i + 3;
+      for (let j = primeSqaredIndex; j < upper; j += prime) {
+        PRIME_SEIVE[j] = false;
+      }
+    }
+  }
+})(NUM_PRIMES);
+
+function isPrime(num) {
+  if (num === 2) return true;
+  else if (num % 2 === 0) return false
+  else return PRIME_SEIVE[(num - 3) / 2];
+}
+
+function hexagonalTile(tileIndex) {
+  let count = 1;
+  let n = 1;
+  let number = 0;
+
+  while (count < tileIndex) {
+    if (isPrime(6*n - 1) &&
+        isPrime(6*n + 1) &&
+        isPrime(12*n + 5)) {
+      number = 3*n*n - 3*n + 2;
+      count++;
+      if (count >= tileIndex) break;
+    }
+    if (isPrime(6*n + 5) &&
+        isPrime(6*n - 1) &&
+        isPrime(12*n - 7) && n != 1) {
+      number = 3*n*n + 3*n + 1;
+      count++;
+    }
+    n++;
+  }
+  return number;
+}
 ```
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-168-number-rotations.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-168-number-rotations.md
index a42d7f5e8b8..4cf268af8cd 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-168-number-rotations.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-168-number-rotations.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4151000cf542c50ff27
 title: 'Задача 168: Обертання чисел'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301802
 dashedName: problem-168-number-rotations
 ---
@@ -14,14 +14,20 @@ dashedName: problem-168-number-rotations
 
 Це показує незвичайну властивість 142857: це дільник її обертання вправо.
 
-Знайдіть останні 5 цифр суми всіх цілих чисел $n$, $ 10 &lt;; n &lt;; 10100$, які мають цю властивість.
+For integer number of digits $a$ and $b$, find the last 5 digits of the sum of all integers $n$, $10^a &lt; n &lt; 10^b$, that have this property.
 
 # --hints--
 
-`numberRotations()` має повертати `59206`.
+`numberRotations(2, 10)` має повертати `98311`.
 
 ```js
-assert.strictEqual(numberRotations(), 59206);
+assert.strictEqual(numberRotations(2, 10), 98311);
+```
+
+`numberRotations(2, 100)` має повертати `59206`.
+
+```js
+assert.strictEqual(numberRotations(2, 100), 59206);
 ```
 
 # --seed--
@@ -29,9 +35,9 @@ assert.strictEqual(numberRotations(), 59206);
 ## --seed-contents--
 
 ```js
-function numberRotations() {
+function numberRotations(a, b) {
 
-  return true;
+  return 0;
 }
 
 numberRotations();
@@ -40,5 +46,37 @@ numberRotations();
 # --solutions--
 
 ```js
-// solution required
+function numberRotations(minDigits, maxDigits) {
+  const DIGITS_TO_KEEP = 100000n;
+  const powersOfTen = Array(maxDigits).fill(0);
+  powersOfTen[0] = 1n;
+  for (let i = 1; i < maxDigits; i++) {
+    powersOfTen[i] = powersOfTen[i - 1] * 10n;
+  }
+
+  // We want numbers of the form xd * m = dx
+  // Or more precisely:
+  //   (x * 10 + d) * m = d*10^(n-1) + x
+  // Solving for x:
+  //   x = d (10^(n-1) - m) / (10 * m - 1)
+  let total = 0n;
+  for (let numDigits = minDigits; numDigits <= maxDigits; numDigits++) {
+    // Check all multiplier - digit pairs to see if a candidate can be built
+    //  with the correct number of digits
+    for (let multiplier = 1n; multiplier < 10n; multiplier++) {
+      for (let lastDigit = 1n; lastDigit < 10n; lastDigit++) {
+        const numerator   = lastDigit * (powersOfTen[numDigits - 1] - multiplier);
+        const denominator = (powersOfTen[1] * multiplier - 1n);
+        if (numerator % denominator === 0n) {
+          const candidate = (numerator / denominator) * 10n + lastDigit;
+          if (candidate.toString().length === numDigits) {
+            total = (total + candidate) % DIGITS_TO_KEEP;
+          }
+        }
+      }
+    }
+  }
+
+  return parseInt(total);
+}
 ```
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md
index d2fc26383fc..ee88faf15d8 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md
@@ -1,36 +1,36 @@
 ---
 id: 5900f4341000cf542c50ff46
-title: 'Problem 199: Iterative Circle Packing'
-challengeType: 5
+title: 'Завдання 199: Ітеративне кільцеве потовщення'
+challengeType: 1
 forumTopicId: 301837
 dashedName: problem-199-iterative-circle-packing
 ---
 
 # --description--
 
-Three circles of equal radius are placed inside a larger circle such that each pair of circles is tangent to one another and the inner circles do not overlap. There are four uncovered "gaps" which are to be filled iteratively with more tangent circles.
+Три кола з однаковим радіусом розміщені всередині більшого кола так, що кожна пара кіл дотична один до одного, а внутрішні кола не перетинаються. Існує чотири непокритих "прогалини", які багатократно заповнюються більш дотичними колами.
 
-<img class="img-responsive center-block" alt="a diagram of non-overlapping circles" src="https://cdn-media-1.freecodecamp.org/project-euler/199-circles-in-circles.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="a diagram of non-overlapping circles" src="https://cdn-media-1.freecodecamp.org/project-euler/199-circles-in-circles.gif" style="background-color: white; padding: 10px;" />
 
-At each iteration, a maximally sized circle is placed in each gap, which creates more gaps for the next iteration. After 3 iterations (pictured), there are 108 gaps and the fraction of the area which is not covered by circles is 0.06790342, rounded to eight decimal places.
+При кожному повторному застосуванні в кожну прогалину розміщується коло максимального розміру, що створює ще більше прогалин для наступної етапу. Після 3-х повторних застосувань (на фото) виникає 108 прогалин, а частка площі, яка не покрита колами, становить 0,06790342, округлена до восьми знаків після коми.
 
-What fraction of the area is not covered by circles after `n` iterations? Give your answer rounded to eight decimal places using the format x.xxxxxxxx .
+Яка частка площі не покрита колами після `n` повторних застосувань? Дайте відповідь, округлену до восьми знаків після коми, у форматі x.xxxxxxxx .
 
 # --hints--
 
-`iterativeCirclePacking(10)` should return a number.
+`iterativeCirclePacking(10)` має видати число.
 
 ```js
 assert(typeof iterativeCirclePacking(10) === 'number');
 ```
 
-`iterativeCirclePacking(10)` should return `0.00396087`.
+`iterativeCirclePacking(10)` має видати `0.00396087`.
 
 ```js
 assert.strictEqual(iterativeCirclePacking(10), 0.00396087);
 ```
 
-`iterativeCirclePacking(3)` should return `0.06790342`.
+`iterativeCirclePacking(3)` має видати `0.06790342`.
 
 ```js
 assert.strictEqual(iterativeCirclePacking(3), 0.06790342);
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md
index e998f83548d..a6afe991287 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f36e1000cf542c50fe81
 title: 'Завдання 2: Парні числа Фібоначчі'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301838
 dashedName: problem-2-even-fibonacci-numbers
 ---
@@ -22,7 +22,7 @@ dashedName: problem-2-even-fibonacci-numbers
 assert(typeof fiboEvenSum(10) === 'number');
 ```
 
-Ваша функція має дорівнювати `even` value.
+Your function should return an even value.
 
 ```js
 assert.equal(fiboEvenSum(10) % 2 === 0, true);
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-250-250250.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-250-250250.md
index 99f137241fb..9533c242f2e 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-250-250250.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-250-250250.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f4661000cf542c50ff78
 title: 'Завдання 250: 250250'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301898
 dashedName: problem-250-250250
 ---
 
 # --description--
 
-Знайдіть кількість непорожніх підмножин $\\{11, 22, 33, \ldots, {250250}^{250250}\\}$, сума елементів яких ділиться на 250. Введіть 16 цифр, як вашу відповідь.
+Find the number of non-empty subsets of $\\{{1}^{1}, {2}^{2}, {3}^{3}, \ldots, {250250}^{250250}\\}$, the sum of whose elements is divisible by 250. Введіть 16 цифр, як вашу відповідь.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
index 80ce7cc413f..b626292fe12 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f46e1000cf542c50ff80
 title: 'Завдання 257: Кутові бісектриси'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301905
 dashedName: problem-257-angular-bisectors
 ---
 
 # --description--
 
-Дано цілочисельний трикутник $ABC$ зі сторонами $a ≤ b ≤ c$. ($AB = c$, $BC = a$ and $AC = b$).
+Given is an integer sided triangle $ABC$ with sides $a ≤ b ≤ c$ ($AB = c$, $BC = a$ and $AC = b$).
 
 Бісектриси кутів трикутника перетинають в точках $E$, $F$ і $G$ (див. малюнок нижче).
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md
index d88415d4819..2933278a196 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md
@@ -2,7 +2,7 @@
 id: 5900f4881000cf542c50ff9a
 title: >-
   Problem 283: Integer sided triangles for which the area / perimeter ratio is integral
-challengeType: 5
+challengeType: 1
 forumTopicId: 301934
 dashedName: >-
   problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral
@@ -10,19 +10,19 @@ dashedName: >-
 
 # --description--
 
-Consider the triangle with sides 6, 8 and 10. It can be seen that the perimeter and the area are both equal to 24.
+Розглянемо трикутник зі сторонами 6, 8 і 10. Бачимо, що як периметр, так і площа дорівнюють 24.
 
-So the $\frac{\text{area}}{\text{perimeter}}$ ratio is equal to 1.
+Тож співвідношення the $\frac{\text{area}}{\text{perimeter}}$ дорівнює 1.
 
-Consider also the triangle with sides 13, 14 and 15. The perimeter equals 42 while the area is equal to 84.
+Також розглянемо трикутник зі сторонами 13, 14 і 15. Його периметр дорівнює 42, тоді як площа — 84.
 
-So for this triangle the $\frac{\text{area}}{\text{perimeter}}$ ratio is equal to 2.
+Тож для цього трикутника співвідношення $\frac{\text{area}}{\text{perimeter}}$ дорівнює 2.
 
-Find the sum of the perimeters of all integer sided triangles for which the area/perimeter ratios are equal to positive integers not exceeding 1000.
+Знайдіть суму периметрів усіх трикутників зі сторонами, які вимірюються цілими числами, для яких співвідношення площа/периметр дорівнює додатним цілим числам, які не більші за 1000.
 
 # --hints--
 
-`integralAreaPerimeterRatio()` should return `28038042525570324`.
+`integralAreaPerimeterRatio()` має повертати до `28038042525570324`.
 
 ```js
 assert.strictEqual(integralAreaPerimeterRatio(), 28038042525570324);
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
index 0fc363ab988..75bb44b0127 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3891000cf542c50fe9c
-title: 'Problem 29: Distinct powers'
-challengeType: 5
+title: 'Завдання 29: Різні степені'
+challengeType: 1
 forumTopicId: 301941
 dashedName: problem-29-distinct-powers
 ---
@@ -17,7 +17,7 @@ Consider all integer combinations of $a^b$ for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
   5<sup>2</sup>=25, 5<sup>3</sup>=125, 5<sup>4</sup>=625, 5<sup>5</sup>=3125 <br>
 </div>
 
-If they are then placed in numerical order, with any repeats removed, we get the following sequence of 15 distinct terms:
+Якщо їх потім розташувати в порядку зростання, виключивши повтори, ми отримаємо таку послідовність з 15 різних членів:
 
 <div style='padding-left: 4em;'>
   4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
@@ -27,31 +27,31 @@ How many distinct terms are in the sequence generated by $a^b$ for 2 ≤ `a` ≤
 
 # --hints--
 
-`distinctPowers(15)` should return a number.
+`distinctPowers(15)` має повернути число.
 
 ```js
 assert(typeof distinctPowers(15) === 'number');
 ```
 
-`distinctPowers(15)` should return 177.
+`distinctPowers(15)` має повернути число 177.
 
 ```js
 assert.strictEqual(distinctPowers(15), 177);
 ```
 
-`distinctPowers(20)` should return 324.
+`distinctPowers(20)` має повернути число 324.
 
 ```js
 assert.strictEqual(distinctPowers(20), 324);
 ```
 
-`distinctPowers(25)` should return 519.
+`distinctPowers(25)` має повернути число 519.
 
 ```js
 assert.strictEqual(distinctPowers(25), 519);
 ```
 
-`distinctPowers(30)` should return 755.
+`distinctPowers(30)` має повернути число 755.
 
 ```js
 assert.strictEqual(distinctPowers(30), 755);
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
index 48f4d215581..c8946bb8b72 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
@@ -1,29 +1,27 @@
 ---
 id: 5900f4b01000cf542c50ffc2
 title: 'Завдання 323: Бітові операції над випадковими цілими числами'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301980
 dashedName: problem-323-bitwise-or-operations-on-random-integers
 ---
 
 # --description--
 
-Нехай $y_0, y_1, y_2, \ldots$ – це послідовність випадково непідписаних 32-бітних цілих чисел
+Let $y_0, y_1, y_2, \ldots$ be a sequence of random unsigned 32 bit integers (i.e. $0 ≤ y_i &lt; 2^{32}$, every value equally likely).
 
-(тобто $0 ≤ y_i &lt; 2^{32}$, кожне значення рівноможливе).
-
-Для послідовності $x_i$ надано наступну рекурсію:
+For the sequence $x_i$ the following recursion is given:
 
 - $x_0 = 0$ і
 - $x_i = x_{i - 1} \mathbf{|} y_{i - 1}$, для $i > 0$. ($\mathbf{|}$ – це оператори бітових операцій)
 
-Бачимо, що зрештою в нас буде такий індекс $N$, що $x_i = 2^{32} - 1$ (бітовий шаблон для всіх одиниць) для всіх $i ≥ N$.
+It can be seen that eventually there will be an index $N$ such that $x_i = 2^{32} - 1$ (a bit-pattern of all ones) for all $i ≥ N$.
 
-Знайдіть очікуване значення $N$. Округліть відповідь до 10 цифр після коми.
+Find the expected value of $N$. Give your answer rounded to 10 digits after the decimal point.
 
 # --hints--
 
-`bitwiseOrOnRandomIntegers()` має повернути до `6.3551758451`.
+`bitwiseOrOnRandomIntegers()` should return `6.3551758451`.
 
 ```js
 assert.strictEqual(bitwiseOrOnRandomIntegers(), 6.3551758451);
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md
index 2c6f98d9092..47f5edf96ff 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f4b21000cf542c50ffc5
 title: 'Завдання 326: Суми модулів'
-challengeType: 5
+challengeType: 1
 forumTopicId: 301983
 dashedName: problem-326-modulo-summations
 ---
 
 # --description--
 
-Нехай an – це послідовність, рекурсивно визначена за допомогою: $a_1 = 1$, $\displaystyle a_n = \left(\sum_{k = 1}^{n - 1} k \times a_k\right)\bmod n$.
+Let $a_n$ be a sequence recursively defined by: $a_1 = 1$, $\displaystyle a_n = \left(\sum_{k = 1}^{n - 1} k \times a_k\right)\bmod n$.
 
 Тож першими 10 елементами $a_n$ є: 1, 1, 0, 3, 0, 3, 5, 4, 1, 9.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-331-cross-flips.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-331-cross-flips.md
index 024faedcfd7..1cb185db331 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-331-cross-flips.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-331-cross-flips.md
@@ -1,32 +1,32 @@
 ---
 id: 5900f4b71000cf542c50ffca
-title: 'Problem 331: Cross flips'
-challengeType: 5
+title: 'Задача 331: Перехресні перевертання'
+challengeType: 1
 forumTopicId: 301989
 dashedName: problem-331-cross-flips
 ---
 
 # --description--
 
-N×N disks are placed on a square game board. Each disk has a black side and white side.
+N×N дисків розміщують на квадратній гральній дошці. Кожен диск має чорну і білу сторону.
 
-At each turn, you may choose a disk and flip all the disks in the same row and the same column as this disk: thus $2 × N - 1$ disks are flipped. The game ends when all disks show their white side. The following example shows a game on a 5×5 board.
+З кожним ходом ви можете обрати диск та перевернути всі диски у тому ж рядку і в тому ж стовпці, у якому знаходиться цей диск, тобто перевертаються $2 × N - 1$ дисків. Гра закінчується, коли всі диски перевернуті білою стороною догори. У наступному прикладі продемонстровано гру на дошці 5×5.
 
-<img class="img-responsive center-block" alt="animation showing game on 5x5 board" src="https://cdn.freecodecamp.org/curriculum/project-euler/cross-flips.gif" style="background-color: white; padding: 10px;">
+<img class="img-responsive center-block" alt="анімація показує гру на панелі 5x5" src="https://cdn.freecodecamp.org/curriculum/project-euler/cross-flips.gif" style="background-color: white; padding: 10px;" />
 
-It can be proven that 3 is the minimal number of turns to finish this game.
+Можна довести, що для завершення гри потрібно зробити мінімум 3 ходи.
 
-The bottom left disk on the $N×N$ board has coordinates (0, 0); the bottom right disk has coordinates ($N - 1$,$0$) and the top left disk has coordinates ($0$,$N - 1$).
+Нижній лівий диск на $N×N$ дошці має координати (0, 0); нижній правий диск має координати ($N - 1$,$0$), а верхній лівий диск має координати ($0$,$N - 1$).
 
-Let $C_N$ be the following configuration of a board with $N × N$ disks: A disk at ($x$, $y$) satisfying $N - 1 \le \sqrt{x^2 + y^2} \lt N$, shows its black side; otherwise, it shows its white side. $C_5$ is shown above.
+Let $C_N$ be the following configuration of a board with $N × N$ disks: A disk at ($x$, $y$) satisfying $N - 1 \le \sqrt{x^2 + y^2} \lt N$, shows its black side; otherwise, it shows its white side. $C_5$ показано вище.
 
-Let $T(N)$ be the minimal number of turns to finish a game starting from configuration $C_N$ or 0 if configuration $C_N$ is unsolvable. We have shown that $T(5) = 3$. You are also given that $T(10) = 29$ and $T(1\\,000) = 395\\,253$.
+Нехай $T(N)$ буде мінімальною кількістю ходів для завершення гри, починаючи з конфігурації $C_N$ або 0, якщо конфігурація $C_N$ нерозв'язна. Ми продемонстрували, що $T(5) = 3$. Показано також, що $T(10) = 29$ and $T(1\\,000) = 395\\,253$.
 
-Find $\displaystyle \sum_{i = 3}^{31} T(2^i - i)$.
+Знайдіть $\displaystyle \sum_{i = 3}^{31} T(2^i - i)$.
 
 # --hints--
 
-`crossFlips()` should return `467178235146843500`.
+`crossFlips()`повинно вийти`467178235146843500`.
 
 ```js
 assert.strictEqual(crossFlips(), 467178235146843500);
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
index e9855cf58d7..63fe21459e6 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f4c51000cf542c50ffd7
 title: 'Задача 344: Гра "Срібний долар"'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302003
 dashedName: problem-344-silver-dollar-game
 ---
 
 # --description--
 
-Один з варіантів N.G. Гру де Брейна "Срібний долар" можна описати таким чином:
+One variant of N.G. de Bruijn's silver dollar game can be described as follows:
 
 В рядку квадратів розміщена певна кількість монет, щонайбільше одна на квадрат. Цінність має лише монета під назвою "срібний долар". Двоє гравців ходять по черзі. Хід може бути або звичайним, або спеціальним.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
index 25da484c313..d8c99f8515d 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
@@ -1,14 +1,14 @@
 ---
 id: 5900f4d01000cf542c50ffe3
 title: 'Задача 356: Найбільші корені кубічних поліномів'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302016
 dashedName: problem-356-largest-roots-of-cubic-polynomials
 ---
 
 # --description--
 
-Нехай an - найбільший дійсний корінь полінома $g(x) = x^3 - 2^n \times x^2 + n$.
+Let $a_n$ be the largest real root of a polynomial $g(x) = x^3 - 2^n \times x^2 + n$.
 
 Наприклад, $a_2 = 3.86619826\ldots$
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-371-licence-plates.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-371-licence-plates.md
index d43fd31ff7d..e6cce019ce5 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-371-licence-plates.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-371-licence-plates.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f4e01000cf542c50fff2
 title: 'Задача 371: Номерні знаки'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302033
 dashedName: problem-371-licence-plates
 ---
@@ -14,7 +14,7 @@ dashedName: problem-371-licence-plates
 
 Кожен раз, коли числа двох номерних знаків, що він побачив на своєму шляху, додаючись, утворюють 1000 - це перемога.
 
-До прикладу. `MIC-012` і `HAN-988` є перемогою, `RYU-500` і `SET-500` -- також перемога. (якщо бачить він їх в одній поїздці).
+До прикладу. `MIC-012` and `HAN-988` is a win and `RYU-500` and `SET-500` too (as long as he sees them in the same trip).
 
 Знайдіть очікувану кількість номерних пластин, які йому потрібно побачити для перемоги. Дайте відповідь, заокруглену до 8 знаків після коми.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
index 00d7107ebcd..1c06e440514 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f50b1000cf542c51001d
 title: 'Завдання 414: Стала Капрекара'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302083
 dashedName: problem-414-kaprekar-constant
 ---
@@ -23,7 +23,7 @@ $$\begin{align}   & 8730 - 0378 = 8352 \\\\
 
 Можна розглядати рутину Капрекара і для інших систем числення та кількості цифр. На жаль, стала Капрекара існує не у всіх випадках. Перетворення закінчується циклом для деяких вхідних чисел або стала, отримана в результаті перетворення, інша для різних вхідних чисел. Однак для п'яти цифр та основи $b = 6t + 3 ≠ 9$ константа Капрекара існує.
 
-Наприклад, основа 15: ${(10, 4, 14, 9, 5)}\_{15}$ основа 21: $(14, 6, 20, 13, 7)_{21}$
+Наприклад, base 15: ${(10, 4, 14, 9, 5)}\_{15}$ base 21: $(14, 6, 20, 13, 7)\_{21}$
 
 Нехай $C_b$ — стала Капрекара в основі $b$ для 5-ти цифр. Визначте функцію $sb(i)$:
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md
index 3ca02bf60ad..0100cc815c0 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5131000cf542c510024
-title: 'Задача 421: прості множники n15+1'
-challengeType: 5
+title: 'Problem 421: Prime factors of n^15+1'
+challengeType: 1
 forumTopicId: 302091
 dashedName: problem-421-prime-factors-of-n151
 ---
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md
index e10ea30f958..7001cb31891 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5191000cf542c51002c
 title: 'Завдання 429: Сума квадратів одиничних дільників'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302099
 dashedName: problem-429-sum-of-squares-of-unitary-divisors
 ---
@@ -10,11 +10,11 @@ dashedName: problem-429-sum-of-squares-of-unitary-divisors
 
 Унітарний дільник $d$ числа $n$ - це дільник $n$, що має властивість $gcd(d, \frac{n}{d}) = 1$.
 
-Унітарні дільники $4! = 24$ = 1, 3, 8 і 24.
+The unitary divisors of $4! = 24$ are 1, 3, 8 and 24.
 
 Сума їх квадратів дорівнює $12 + 32 + 82 + 242 = 650$.
 
-Нехай $S(n)$ являє собою суму квадратів унітарних дільників $n$. Так $S(4!) = 650$.
+Нехай $S(n)$ являє собою суму квадратів унітарних дільників $n$. Thus $S(4!) = 650$.
 
 Знайдіть $S(100\\,000\\,000!)$ за модулем $1\\,000\\,000\\,009$.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md
index 77c5dea829d..cf77c6c851e 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5231000cf542c510034
 title: 'Завдання 438: Ціла частина розв’язків поліноміального рівняння'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302109
 dashedName: problem-438-integer-part-of-polynomial-equations-solutions
 ---
@@ -19,7 +19,7 @@ dashedName: problem-438-integer-part-of-polynomial-equations-solutions
 
 Ми визначаємо $S(t)$ як суму абсолютних значень цілих чисел у $t$.
 
-За $n = 4$ ми можемо перевірити $\суму S(t) = 2087$ для всіх $n$-tuples, які задовольняють обидві умови.
+For $n = 4$ we can verify that $\sum S(t) = 2087$ for all $n$-tuples $t$ which satisfy both conditions.
 
 Знайти: $\суму S(t)$ за $n = 7$.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
index fe5edf5a3af..4d4a37ee9a9 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f52e1000cf542c510041
 title: 'Задача 450: Гіпоциклоїда та вузли ґратки'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302123
 dashedName: problem-450-hypocycloid-and-lattice-points
 ---
@@ -24,9 +24,10 @@ $$y(t) = (R - r) \sin(t) - r \sin(\frac{R - r}{r} t)$$
 
 Дано:
 
-$$\begin{align} C(3, 1) = & \\{(3, 0), (-1, 2), (-1,0), (-1,-2)\\} \\\\ C(2500, 1000) = & \\{(2500, 0), (772, 2376), (772, -2376), (516, 1792), (516, -1792), (500, 0), (68, 504), \\\\ &(68, -504),(-1356, 1088), (-1356, -1088), (-1500, 1000), (-1500, -1000)\\} \end{align}$$
+$$\begin{align}   C(3, 1) = & \\{(3, 0), (-1, 2), (-1,0), (-1,-2)\\} \\\\
+  C(2500, 1000) = & \\{(2500, 0), (772, 2376), (772, -2376), (516, 1792), (516, -1792), (500, 0), (68, 504), \\\\ &(68, -504),(-1356, 1088), (-1356, -1088), (-1500, 1000), (-1500, -1000)\\} \end{align}$$
 
-**Примітка:** (-625, 0) не елемент $C(2500, 1000)$, оскільки $\sin(t)$ не є раціональним числом для відповідних значень t.
+**Note:** (-625, 0) is not an element of $C(2500, 1000)$ because $\sin(t)$ is not a rational number for the corresponding values of $t$.
 
 $S(3, 1) = (|3| + |0|) + (|-1| + |2|) + (|-1| + |0|) + (|-1| + |-2|) = 10$
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md
index c675c3ba485..d123e9d0ebe 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f5461000cf542c510058
 title: 'Завдання 473: База чисел ϕ'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302150
 dashedName: problem-473-phigital-number-base
 ---
@@ -22,7 +22,7 @@ $2 = \varphi + \varphi^{-2}$ і $3 = \varphi^{2} + \varphi^{-2}$
 
 Щоб представити цю суму степенів в $\varphi$, ми використовуємо рядок з нулем і одиницею, щоб вказати, де починаються від'ємні значення. Ми називаємо це представленням у базі чисел ϕ.
 
-Таким чином, $1 = 1_{\varphi}$, $2 = 10.01_{\varphi}$, $3 = 100.01_{\varphi}$ та $14 = 100.100.00{\varphi}$. Рядки, що представляють 1, 2 і 14 в базі чисел ϕ є паліндромними, а рядок, що представляє 3 таким не є. (точка ϕ не є середнім символом).
+Таким чином, $1 = 1_{\varphi}$, $2 = 10.01_{\varphi}$, $3 = 100.01_{\varphi}$ та $14 = 100.100.00{\varphi}$. The strings representing 1, 2 and 14 in the phigital number base are palindromic, while the string representing 3 is not (the phigital point is not the middle character).
 
 Сума додатних цілих чисел не перевищує 1000, чиї ϕ-представлення є паліндромними та дорівнюють 4345.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md
index 9aa7d885c73..0128a97c3ef 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md
@@ -1,7 +1,7 @@
 ---
 id: 5900f3ac1000cf542c50febf
 title: 'Завдання 64: Квадратні корені з непарним періодом'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302176
 dashedName: problem-64-odd-period-square-roots
 ---
@@ -12,7 +12,7 @@ dashedName: problem-64-odd-period-square-roots
 
 $\\displaystyle \\quad \\quad \\sqrt{N}=a_0+\\frac 1 {a_1+\\frac 1 {a_2+ \\frac 1 {a3+ \\dots}}}$
 
-Наприклад, розгляньмо $\\sqrt{23}:$:
+For example, let us consider $\\sqrt{23}$:
 
 $\\quad \\quad \\sqrt{23}=4+\\sqrt{23}-4=4+\\frac 1 {\\frac 1 {\\sqrt{23}-4}}=4+\\frac 1 {1+\\frac{\\sqrt{23}-3}7}$
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/24-game.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/24-game.md
index 13db84a3d60..b81ce70d8ef 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/24-game.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/24-game.md
@@ -1,14 +1,14 @@
 ---
 id: 5951e88f64ebf159166a1176
 title: Гра 24
-challengeType: 5
+challengeType: 1
 forumTopicId: 302218
 dashedName: 24-game
 ---
 
 # --description--
 
-[ Гра 24](https://en.wikipedia.org/wiki/24_Game) тестує можливість людини обчислювати в умі.
+The 24 Game tests a person's mental arithmetic.
 
 Мета гри - впорядкувати чотири числа так, щоб при обчислюванні, результат дорівнював 24
 
@@ -39,28 +39,28 @@ dashedName: 24-game
 assert(typeof solve24 === 'function');
 ```
 
-`solve24("4878")` має повернути `(7-8/8)*4` чи `4*(7-8/8)`
+`solve24("4878")` should return `(7-8/8)*4`, `4*(7-8/8)`, or a similar valid string
 
 ```js
-assert(include(answers[0], removeParentheses(solve24(testCases[0]))));
+assert(isValidSolution_(solve24(testCases_[0])));
 ```
 
-`solve24("1234")` повинен повернути будь-яке розташування `1*2*3*4`
+`solve24("1234")` should return `1*2*3*4` or a similar valid string
 
 ```js
-assert(include(answers[1], removeParentheses(solve24(testCases[1]))));
+assert(isValidSolution_(solve24(testCases_[1])));
 ```
 
-`solve24("6789")` повинен повернути `(6*8)/(9-7)` чи `(8*6)/(9-7)`
+`solve24("6789")` should return `(6*8)/(9-7)`, `(8*6)/(9-7)`, or a similar valid string
 
 ```js
-assert(include(answers[2], removeParentheses(solve24(testCases[2]))));
+assert(isValidSolution_(solve24(testCases_[2])));
 ```
 
-`solve24("1127")` має повернути перестановку `(1+7)*(1+2)`
+`solve24("1127")` should return `(1+7)*(1+2)` or a similar valid string
 
 ```js
-assert(include(answers[3], removeParentheses(solve24(testCases[3]))));
+assert(isValidSolution_(solve24(testCases_[3])));
 ```
 
 # --seed--
@@ -68,56 +68,101 @@ assert(include(answers[3], removeParentheses(solve24(testCases[3]))));
 ## --after-user-code--
 
 ```js
-const testCases = [
+const testCases_ = [
   '4878',
   '1234',
   '6789',
   '1127'
 ];
 
-const answers = [
-  ['(7-8/8)*4', '4*(7-8/8)', '(4-8+7)*8', '(4+7-8)*8', '(7+4-8)*8', '(7-8+4)*8', '8*(4-8+7)', '8*(4+7-8)', '8*(7+4-8)', '8*(7-8+4)'],
-  ['1*2*3*4', '1*2*4*3', '1*3*2*4', '1*3*4*2', '1*4*2*3', '1*4*3*2', '2*1*3*4', '2*1*4*3', '2*3*1*4', '2*3*4*1', '2*4*3*1', '2*4*1*3', '3*1*2*4', '3*1*4*2', '3*2*1*4', '3*2*4*1', '3*4*1*2', '3*4*2*1', '4*1*2*3', '4*1*3*2', '4*2*1*3', '4*2*3*1', '4*3*1*2', '4*3*2*1', '(1+2+3)*4', '(1+3+2)*4', '(2+1+3)*4', '(2+3+1)*4', '(3+1+2)*4', '(3+2+1)*4', '4*(1+2+3)', '4*(2+1+3)', '4*(2+3+1)', '4*(3+1+2)', '4*(3+2+1)'],
-  ['(6*8)/(9-7)', '(8*6)/(9-7)', '6*8/(9-7)', '8*6/(9-7)'],
-  ['(1+7)*(2+1)', '(1+7)*(1+2)', '(1+2)*(1+7)', '(1+2)*(7+1)', '(2+1)*(1+7)', '(7+1)*(2+1)']
-];
-
-function include(ansArr, res) {
-  const index = ansArr.indexOf(res);
-  return index >= 0;
+const OPERATORS_ = {
+  "+": (a, b) => a + b,
+  "-": (a, b) => a - b,
+  "*": (a, b) => a * b,
+  "/": (a, b) => a / b,
 }
 
-//The main method for detecting single parentheses
-function removeParentheses(ans) {
-  for (let i = 0; i < ans.length; i++) {
-    if (!isNaN(ans[i])) {
-      ans = removeParenthesesHelper(ans, i);
+const PRECIDENCE_ = {
+  "+": 1,
+  "-": 1,
+  "*": 2,
+  "/": 2,
+}
+
+function evaluate_(expression) {
+  expression = expression.replace('/\s+/g', '');
+  const stack = [];
+  let postfix = "";
+
+  // Convert from infix to postfix
+  let head = 0;
+  while (head < expression.length) {
+    let c = expression[head];
+    switch (c) {
+      case "(":
+        stack.push(c);
+        break;
+      case ")":
+        let last = stack.pop();
+        while (last !== "(") {
+          postfix += last;
+          last = stack.pop();
+        }
+        break;
+      case "+":
+      case "-":
+      case "*":
+      case "/":
+        while (stack.length &&
+               PRECIDENCE_[c] <= PRECIDENCE_[stack[stack.length-1]]) {
+          postfix += stack.pop();
+        }
+        stack.push(c);
+        break;
+      case "0":
+      case "1":
+      case "2":
+      case "3":
+      case "4":
+      case "5":
+      case "6":
+      case "7":
+      case "8":
+      case "9":
+        postfix += c;
+        break;
+      default:
+        return false;
+    }
+    head++;
+  }
+
+  // Clear out stack
+  while (stack.length) {
+    postfix += stack.pop();
+  }
+
+  // Evaluate postfix
+  for (let c of postfix) {
+    switch (c) {
+      case "+":
+      case "-":
+      case "*":
+      case "/":
+        const b = +stack.pop();
+        const a = +stack.pop();
+        stack.push(OPERATORS_[c](a, b));
+        break;
+      default:
+        stack.push(c);
     }
   }
-  return ans;
+  return stack.pop();
 }
 
-//Helper to remove left and right parantheses
-function removeParenthesesHelper(ans, i) {
-  while (i > 0 && i < ans.length - 1) {
-    if (ans[i - 1] === '(' && ans[i + 1] === ')') {
-      //Paranthesis detected. Remove them.
-      ans = replaceChar(ans, '', i - 1);
-      ans = replaceChar(ans, '', i);
-      i--;
-    } else {
-      return ans;
-    }
-  }
-  return ans;
-}
-
-//Replace a character at a given index for the provided character
-function replaceChar(origString, replaceChar, index) {
-  let firstPart = origString.substr(0, index);
-  let lastPart = origString.substr(index + 1);
-  let newString = firstPart + replaceChar + lastPart;
-  return newString;
+// Check solution validity
+function isValidSolution_(userSolution) {
+  return evaluate_(userSolution) === 24;
 }
 ```
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md
index 1e50f6c9f8f..85aeb45ebca 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md
@@ -1,14 +1,14 @@
 ---
 id: 5949b579404977fbaefcd736
 title: Ціле число "9 мільярдів імен Бога"
-challengeType: 5
+challengeType: 1
 forumTopicId: 302219
 dashedName: 9-billion-names-of-god-the-integer
 ---
 
 # --description--
 
-Це завдання є варіацією [оповідання Артура Кларка](https://en.wikipedia.org/wiki/The Nine Billion Names of God#Plot_summary "wp: The Nine Billion Names of God#Plot_summary").
+This task is a variation of the short story by Arthur C. Clarke.
 
 (Той хто розв'язує завдання, має знати про наслідки виконання даного завдання.)
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/accumulator-factory.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/accumulator-factory.md
index 64a98eb480c..953a267c9b7 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/accumulator-factory.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/accumulator-factory.md
@@ -1,14 +1,14 @@
 ---
 id: 594810f028c0303b75339ace
 title: Акумуляторна фабрика
-challengeType: 5
+challengeType: 1
 forumTopicId: 302222
 dashedName: accumulator-factory
 ---
 
 # --description--
 
-Проблема, спричинена [Paul Graham](https://en.wikipedia.org/wiki/Paul_Graham_(programmer)) полягає у створенні функції, яка приймає один (числовий) аргумент, і яка повертає іншу функцію, тобто акумулятор. Повернена акумуляторна функція в свою чергу також бере один числовий аргумент, і повертає суму усіх числових значень, прийнятих до цього часу до цього акумулятора (включаючи початкове значення, передане при створенні акумулятора).
+A problem posed by Paul Graham is that of creating a function that takes a single (numeric) argument and which returns another function that is an accumulator. Повернена акумуляторна функція в свою чергу також бере один числовий аргумент, і повертає суму усіх числових значень, прийнятих до цього часу до цього акумулятора (включаючи початкове значення, передане при створенні акумулятора).
 
 # --instructions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/amicable-pairs.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/amicable-pairs.md
index 63f0a93946f..066edb3f4a5 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/amicable-pairs.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/amicable-pairs.md
@@ -1,49 +1,51 @@
 ---
 id: 5949b579404977fbaefcd737
 title: Дружні числа
-challengeType: 5
+challengeType: 1
 forumTopicId: 302225
 dashedName: amicable-pairs
 ---
 
 # --description--
 
-Цілі числа $N$ та $M$ - це [дружні числа](https://en.wikipedia.org/wiki/Amicable numbers "wp: Amicable numbers") if $N \\neq M$ і сума [власних дільників](https://rosettacode.org/wiki/Proper divisors "Proper divisors") of $N$ ($\\mathrm{sum}(\\mathrm{propDivs}(N))$) $= M$, як і $\\mathrm{sum}(\\mathrm{propDivs}(M)) = N$.
+Two integers $N$ and $M$ are said to be amicable pairs if $N \\neq M$ and the sum of the proper divisors of $N$ ($\\mathrm{sum}(\\mathrm{propDivs}(N))$) $= M$ as well as $\\mathrm{sum}(\\mathrm{propDivs}(M)) = N$.
 
 **Приклад:**
 
 **1184** та **1210** - це дружні числа з власними дільниками:
 
 <ul>
-  <li>1, 2, 4, 8, 16, 32, 37, 74, 148, 296, 592  та</li>
-  <li>1, 2, 5, 10, 11, 22, 55, 110, 121, 242, 605  також.</li>
+  <li>1, 2, 4, 8, 16, 32, 37, 74, 148, 296, 592 and</li>
+  <li>1, 2, 5, 10, 11, 22, 55, 110, 121, 242, 605 respectively.</li>
 </ul>
 
+The sum of the divisors for the first value, **1184**, is **1210** and the sum of the divisors for the second value, **1210**, is **1184**.
+
 # --instructions--
 
-Порахуйте та покажіть тут дружні числа нижче 20 000 (тут їх вісім).
+Calculate and show here the Amicable pairs below 20,000 (there are eight).
 
 # --hints--
 
-`amicablePairsUpTo` мають бути функцією.
+`amicablePairsUpTo` має бути функцією.
 
 ```js
 assert(typeof amicablePairsUpTo === 'function');
 ```
 
-`amicablePairsUpTo(300)` повинен повертатися як `[[220,284]]`.
+`amicablePairsUpTo(300)` повинен повертати `[[220,284]]`.
 
 ```js
 assert.deepEqual(amicablePairsUpTo(300), answer300);
 ```
 
-`amicablePairsUpTo(3000)` повинен повертатися як `[[220,284],[1184,1210],[2620,2924]]`.
+`amicablePairsUpTo(3000)` повинен повертати `[[220,284],[1184,1210],[2620,2924]]`.
 
 ```js
 assert.deepEqual(amicablePairsUpTo(3000), answer3000);
 ```
 
-`amicablePairsUpTo(20000)` повинен повертатися як `[[220,284],[1184,1210],[2620,2924],[5020,5564],[6232,6368],[10744,10856],[12285,14595],[17296,18416]]`.
+`amicablePairsUpTo(20000)` повинен повертати `[[220,284],[1184,1210],[2620,2924],[5020,5564],[6232,6368],[10744,10856],[12285,14595],[17296,18416]]`.
 
 ```js
 assert.deepEqual(amicablePairsUpTo(20000), answer20000);
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/averages-mode.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/averages-mode.md
index 07316d41fe0..58d13edce6e 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/averages-mode.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/averages-mode.md
@@ -1,14 +1,14 @@
 ---
 id: 594d8d0ab97724821379b1e6
 title: Середні значення/Режим
-challengeType: 5
+challengeType: 1
 forumTopicId: 302226
 dashedName: averagesmode
 ---
 
 # --description--
 
-Напишіть програму для пошуку значення [режиму](https://en.wikipedia.org/wiki/Mode (statistics) "wp: Mode (statistics)") колекції.
+Write a function `mode` to find the value that appears most in an array.
 
 Випадок, коли колекція є порожньою, можна ігнорувати. Необхідно бути обережним у випадку, коли режим не є унікальним.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md
index 9a9c943b8dd..a8d3391db25 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md
@@ -1,14 +1,14 @@
 ---
 id: 594d966a1467eb84194f0086
 title: Піфагорові середні
-challengeType: 5
+challengeType: 1
 forumTopicId: 302227
 dashedName: averagespythagorean-means
 ---
 
 # --description--
 
-Розрахуйте всі три [ Піфагорових середніх ](https://en.wikipedia.org/wiki/Pythagorean means "wp: Pythagorean means") набору цілих чисел від $1$ до $10$ (включно).
+Compute all three of the <a href="https://en.wikipedia.org/wiki/Pythagorean_means" target="_blank" rel="noopener noreferrer nofollow">Pythagorean means</a> of the set of integers $1$ through $10$ (inclusive).
 
 Покажіть, що $A(x_1,\\ldots,x_n) \\geq G(x_1,\\ldots,x_n) \\geq H(x_1,\\ldots,x_n)$ для цього набору цілих чисел.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md
index abc93c85227..9dc2403df5d 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md
@@ -1,18 +1,16 @@
 ---
 id: 594da033de4190850b893874
 title: Середнє значення квадратного кореня
-challengeType: 5
+challengeType: 1
 forumTopicId: 302228
 dashedName: averagesroot-mean-square
 ---
 
 # --description--
 
-Визначте [ середнє квадратне ](https://en.wikipedia.org/wiki/Root mean square "wp: Root mean square") від 1 до 10 включно.
+Compute the Root Mean Square (RMS) of the numbers 1 through 10 inclusive.
 
-* середнє квадратне * також відоме своїми ініціалами СК (або ск), а також як **quadratic mean**.
-
-СК вираховується як середнє значення квадратів чисел в квадратних коренях:
+The <abbr title="Root mean square">RMS</abbr> is calculated by taking the square root of the mean of the squares of the numbers, given by the equation:
 
 $$x\_{\\mathrm{rms}} = \\sqrt {{{x_1}^2 + {x_2}^2 + \\cdots + {x_n}^2} \\over n}. $$
 
@@ -24,7 +22,7 @@ $$x\_{\\mathrm{rms}} = \\sqrt {{{x_1}^2 + {x_2}^2 + \\cdots + {x_n}^2} \\over n}
 assert(typeof rms === 'function');
 ```
 
-`rms([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])` має дорівнювати `6.2048368229954285`.
+`rms([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])` should equal `6.2048368229954285`.
 
 ```js
 assert.equal(rms(arr1), answer1);
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/babbage-problem.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/babbage-problem.md
index cc21c9a8e64..362ca348a90 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/babbage-problem.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/babbage-problem.md
@@ -1,14 +1,14 @@
 ---
 id: 594db4d0dedb4c06a2a4cefd
 title: Задача Беббіджа
-challengeType: 5
+challengeType: 1
 forumTopicId: 302229
 dashedName: babbage-problem
 ---
 
 # --description--
 
-[Чарльз Беббідж](https://en.wikipedia.org/wiki/Charles_Babbage "wp: Charles_Babbage"), дивлячись у майбутнє на завдання, які зможе вирішити його аналітична машина, навів такий приклад:
+Charles Babbage, looking ahead to the sorts of problems his Analytical Engine would be able to solve, gave this example:
 
 <blockquote>
   Яке найменше натуральне число, квадрат якого закінчується цифрами 269,696?
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md
index 3cd40accd9a..72773d98691 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md
@@ -1,7 +1,7 @@
 ---
 id: 5951815dd895584b06884620
 title: Кола з заданим радіусом через дві точки
-challengeType: 5
+challengeType: 1
 forumTopicId: 302231
 dashedName: circles-of-given-radius-through-two-points
 ---
@@ -27,8 +27,8 @@ dashedName: circles-of-given-radius-through-two-points
 
 <ul>
   <li>Якщо точки розташовані на діаметрі, повернеться одна точка. Якщо ж радіус також є нульовим, тоді повернеться <code>"Radius Zero"</code>.</li>
-  <li>Якщо точки збігаються, поверніть <code>"Точку збігу. Безкінечні рішення"</code>.</li>
-  <li>Якщо точки розташовані далі, ніж діаметр, поверніть <code>"Без перетину. Точки, які віддалені одна від одної, відносно діаметра кола"</code>.</li>
+  <li>If points are coincident, return <code>"Coincident point. Infinite solutions"</code>.</li>
+  <li>If points are farther apart than the diameter, return <code>"No intersection. Points further apart than circle diameter"</code>.</li>
 </ul>
 
 **Приклади вхідних даних:**
@@ -61,13 +61,13 @@ assert.deepEqual(getCircles(...testCases[0]), answers[0]);
 assert.deepEqual(getCircles(...testCases[1]), answers[1]);
 ```
 
-`getCircles([0.1234, 0.9876], [0.1234, 0.9876], 2.0)` має повертатися `Точка збігу. Безкінечні рішення"`
+`getCircles([0.1234, 0.9876], [0.1234, 0.9876], 2.0)` має повертати `Coincident point. Infinite solutions`
 
 ```js
 assert.deepEqual(getCircles(...testCases[2]), answers[2]);
 ```
 
-`getCircles([0.1234, 0.9876], [0.8765, 0.2345], 0.5)` має повертатися `Без перетину. Точки, які віддалені одна від одної, відносно діаметра кола"`
+`getCircles([0.1234, 0.9876], [0.8765, 0.2345], 0.5)` має повертати `No intersection. Points further apart than circle diameter`
 
 ```js
 assert.deepEqual(getCircles(...testCases[3]), answers[3]);
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/comma-quibbling.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/comma-quibbling.md
index 7bae9e953c1..49026918e55 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/comma-quibbling.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/comma-quibbling.md
@@ -1,14 +1,14 @@
 ---
 id: 596e414344c3b2872167f0fe
 title: Comma quibbling (створення рядків значень розділених комою)
-challengeType: 5
+challengeType: 1
 forumTopicId: 302234
 dashedName: comma-quibbling
 ---
 
 # --description--
 
-Comma quibbling це завдання вперше встановлене Еріком Ліппертом в його блозі [blog](https://blogs.msdn.com/b/ericlippert/archive/2009/04/15/comma-quibbling.aspx).
+<a href="https://rosettacode.org/wiki/Comma_quibbling" target="_blank" rel="noopener noreferrer nofollow">Comma quibbling</a> is a task originally set by Eric Lippert in his blog.
 
 # --instructions--
 
@@ -52,19 +52,19 @@ assert(typeof quibble(['ABC']) === 'string');
 assert.equal(quibble(testCases[0]), results[0]);
 ```
 
-Функція `quibble(["ABC"])` має повернути "{ABC}".
+`quibble(["ABC"])` should return `"{ABC}"`.
 
 ```js
 assert.equal(quibble(testCases[1]), results[1]);
 ```
 
-Функція `quibble(["ABC", "DEF"])` має повернути "{ABC and DEF}".
+`quibble(["ABC", "DEF"])` should return `"{ABC and DEF}"`.
 
 ```js
 assert.equal(quibble(testCases[2]), results[2]);
 ```
 
-Функція `quibble(["ABC", "DEF", "G", "H"])` має повернути "{ABC,DEF,G and H}".
+`quibble(["ABC", "DEF", "G", "H"])` should return `"{ABC, DEF, G and H}"`.
 
 ```js
 assert.equal(quibble(testCases[3]), results[3]);
@@ -76,7 +76,7 @@ assert.equal(quibble(testCases[3]), results[3]);
 
 ```js
 const testCases = [[], ["ABC"], ["ABC", "DEF"], ["ABC", "DEF", "G", "H"]];
-const results = ["{}", "{ABC}", "{ABC and DEF}", "{ABC,DEF,G and H}"];
+const results = ["{}", "{ABC}", "{ABC and DEF}", "{ABC, DEF, G and H}"];
 ```
 
 ## --seed-contents--
@@ -93,7 +93,7 @@ function quibble(words) {
 ```js
 function quibble(words) {
   return "{" +
-    words.slice(0, words.length - 1).join(",") +
+    words.slice(0, words.length - 1).join(", ") +
    (words.length > 1 ? " and " : "") +
    (words[words.length - 1] || '') +
   "}";
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
index cc5af86ed56..5a3015c2861 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
@@ -1,14 +1,20 @@
 ---
 id: 596e457071c35c882915b3e4
 title: Порівняйте список рядків
-challengeType: 5
+challengeType: 1
 forumTopicId: 302235
 dashedName: compare-a-list-of-strings
 ---
 
 # --description--
 
-Маючи список [list](https://en.wikipedia.org/wiki/List_(abstract_data_type) "wp: List\_(abstract_data_type)") з довільної кількості рядків, реалізуйте функцію для кожної з наступних умов:
+A list is a ordered set of values that may contain duplicates. Here is an example:
+
+```js
+const list = [['AA',  'BB', 'CC'], ['AA', 'ACB', 'AA'], [], ['AA']];
+```
+
+Given a list of arbitrarily many strings, implement a function for each of the following conditions:
 
 <ul>
   <li>перевірте, чи всі вони лексично рівні</li>
@@ -29,61 +35,61 @@ assert(typeof allEqual === 'function');
 assert(typeof azSorted === 'function');
 ```
 
-Функція `allEqual(["AA", "AA", "AA", "AA"])` має повернути true.
+`allEqual(["AA", "AA", "AA", "AA"])` should return true.
 
 ```js
 assert(allEqual(testCases[0]));
 ```
 
-Функція `azSorted(["AA", "AA", "AA", "AA"])` має повернути false.
+`azSorted(["AA", "AA", "AA", "AA"])` should return false.
 
 ```js
 assert(!azSorted(testCases[0]));
 ```
 
-Функція `allEqual(["AA", "ACB", "BB", "CC"])` має повернути false.
+`allEqual(["AA", "ACB", "BB", "CC"])` should return false.
 
 ```js
 assert(!allEqual(testCases[1]));
 ```
 
-Функція `azSorted(["AA", "ACB", "BB", "CC"])` має повернути true.
+`azSorted(["AA", "ACB", "BB", "CC"])` should return true.
 
 ```js
 assert(azSorted(testCases[1]));
 ```
 
-Функція `allEqual([])` має повернути true.
+`allEqual([])` should return true.
 
 ```js
 assert(allEqual(testCases[2]));
 ```
 
-Функція `azSorted([])` має повернути true.
+`azSorted([])` should return true.
 
 ```js
 assert(azSorted(testCases[2]));
 ```
 
-Функція `allEqual(["AA"])` має повернути true.
+`allEqual(["AA"])` should return true.
 
 ```js
 assert(allEqual(testCases[3]));
 ```
 
-Функція `azSorted(["AA"])` має повернути true.
+`azSorted(["AA"])` should return true.
 
 ```js
 assert(azSorted(testCases[3]));
 ```
 
-Функція `allEqual(["BB", "AA"])` має повернути false.
+`allEqual(["BB", "AA"])` should return false.
 
 ```js
 assert(!allEqual(testCases[4]));
 ```
 
-Функція `azSorted(["BB", "AA"])` має повернути false.
+`azSorted(["BB", "AA"])` should return false.
 
 ```js
 assert(!azSorted(testCases[4]));
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/count-the-coins.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/count-the-coins.md
index b6063735be3..0f0233d4980 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/count-the-coins.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/count-the-coins.md
@@ -1,14 +1,14 @@
 ---
 id: 59713bd26bdeb8a594fb9413
 title: Підрахунок монет
-challengeType: 5
+challengeType: 1
 forumTopicId: 302238
 dashedName: count-the-coins
 ---
 
 # --description--
 
-У валюті [США](https://en.wikipedia.org/wiki/United_States) існує чотири типи звичайних монет:
+There are four types of common coins in US currency:
 
 <ul>
   <li>четвертаки (25 центів)</li>
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/cramers-rule.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/cramers-rule.md
index 013c6a0bcad..f00b3ccc30f 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/cramers-rule.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/cramers-rule.md
@@ -1,34 +1,38 @@
 ---
 id: 59713da0a428c1a62d7db430
 title: Метод Крамера
-challengeType: 5
+challengeType: 1
 forumTopicId: 302239
 dashedName: cramers-rule
 ---
 
 # --description--
 
-В [лінійній алгебрі](https://en.wikipedia.org/wiki/linear algebra "wp: linear algebra"), [методі Кремера](https://en.wikipedia.org/wiki/Cramer's rule "wp: Cramer's rule") є явною формулою для вирішення [ системи лінійних рівнянь](https://en.wikipedia.org/wiki/system of linear equations "wp: system of linear equations") яка має таку ж кількістю невідомих, допустимих рівнянь, коли система має унікальний розв'язок. Вона виражає розв'язок в межах детермінантів коефіцієнтної матриці (квадрата), і матриць, отриманих з неї шляхом заміни одного стовпця вектором правої сторони рівнянь.
+<a href="https://rosettacode.org/wiki/Cramer%27s_rule" target="_blank" rel="noopener noreferrer nofollow">Cramer's rule</a> is a formula for solving a system of linear equations by using the determinants of matrices formed from subsets of the coefficients and right hand side values.
 
-Дано
+The determinant of a matrix with 2 rows and two columns is given by:
+
+$\begin{aligned}|A|={\begin{vmatrix}a&b\\\c&d\end{vmatrix}}=ad-bc.\end{aligned}$
+
+Given a system of linear equations:
 
 $\\left\\{\\begin{matrix}a_1x + b_1y + c_1z&= {\\color{red}d_1}\\\\a_2x + b_2y + c_2z&= {\\color{red}d_2}\\\\a_3x + b_3y + c_3z&= {\\color{red}d_3}\\end{matrix}\\right.$
 
-яка є у форматі матриці
+which in matrix format is
 
 $\\begin{bmatrix} a_1 & b_1 & c_1 \\\\ a_2 & b_2 & c_2 \\\\ a_3 & b_3 & c_3 \\end{bmatrix}\\begin{bmatrix} x \\\\ y \\\\ z \\end{bmatrix}=\\begin{bmatrix} {\\color{red}d_1} \\\\ {\\color{red}d_2} \\\\ {\\color{red}d_3} \\end{bmatrix}.$
 
-Тоді значення $x, y$ і $z$ можна знайти так:
+Then the values of $x, y$ and $z$ can be found as follows:
 
 $x = \\frac{\\begin{vmatrix} {\\color{red}d_1} & b_1 & c_1 \\\\ {\\color{red}d_2} & b_2 & c_2 \\\\ {\\color{red}d_3} & b_3 & c_3 \\end{vmatrix} } { \\begin{vmatrix} a_1 & b_1 & c_1 \\\\ a_2 & b_2 & c_2 \\\\ a_3 & b_3 & c_3 \\end{vmatrix}}, \\quad y = \\frac {\\begin{vmatrix} a_1 & {\\color{red}d_1} & c_1 \\\\ a_2 & {\\color{red}d_2} & c_2 \\\\ a_3 & {\\color{red}d_3} & c_3 \\end{vmatrix}} {\\begin{vmatrix} a_1 & b_1 & c_1 \\\\ a_2 & b_2 & c_2 \\\\ a_3 & b_3 & c_3 \\end{vmatrix}}, \\text{ and }z = \\frac { \\begin{vmatrix} a_1 & b_1 & {\\color{red}d_1} \\\\ a_2 & b_2 & {\\color{red}d_2} \\\\ a_3 & b_3 & {\\color{red}d_3} \\end{vmatrix}} {\\begin{vmatrix} a_1 & b_1 & c_1 \\\\ a_2 & b_2 & c_2 \\\\ a_3 & b_3 & c_3 \\end{vmatrix} }.$
 
 # --instructions--
 
-Враховуючи таку систему рівнянь:
+Given the following system of equations:
 
 $\\begin{cases} 2w-x+5y+z=-3 \\\\ 3w+2x+2y-6z=-32 \\\\ w+3x+3y-z=-47 \\\\ 5w-2x-3y+3z=49 \\\\ \\end{cases}$
 
-розв'язок для $w$, $x$, $y$ і $z$, використовуючи правило Крамера.
+solve for $w$, $x$, $y$ and $z$, using Cramer's rule.
 
 # --hints--
 
@@ -38,13 +42,13 @@ $\\begin{cases} 2w-x+5y+z=-3 \\\\ 3w+2x+2y-6z=-32 \\\\ w+3x+3y-z=-47 \\\\ 5w-2x-
 assert(typeof cramersRule === 'function');
 ```
 
-`cramersRule([[2, -1, 5, 1], [3, 2, 2, -6], [1, 3, 3, -1], [5, -2, -3, 3]], [-3, -32, -47, 49])` має повернути `[2, -12, -4, 1]`.
+`cramersRule([[2, -1, 5, 1], [3, 2, 2, -6], [1, 3, 3, -1], [5, -2, -3, 3]], [-3, -32, -47, 49])` should return `[2, -12, -4, 1]`.
 
 ```js
 assert.deepEqual(cramersRule(matrices[0], freeTerms[0]), answers[0]);
 ```
 
-`cramersRule([[3, 1, 1], [2, 2, 5], [1, -3, -4]], [3, -1, 2])` має повернути `[1, 1, -1]`.
+`cramersRule([[3, 1, 1], [2, 2, 5], [1, -3, -4]], [3, -1, 2])` should return `[1, 1, -1]`.
 
 ```js
 assert.deepEqual(cramersRule(matrices[1], freeTerms[1]), answers[1]);
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md
index e87bca5e27b..25c9acda510 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md
@@ -1,14 +1,39 @@
 ---
 id: 5a23c84252665b21eecc7e03
 title: Сукупне стандартне відхилення
-challengeType: 5
+challengeType: 1
 forumTopicId: 302240
 dashedName: cumulative-standard-deviation
 ---
 
 # --description--
 
-Напишіть функцію, яка враховує масив чисел як параметр та повертає [стандартне відхилення](https://en.wikipedia.org/wiki/Standard Deviation) послідовності.
+Suppose that the entire population of interest is eight students in a particular class. For a finite set of numbers, the population standard deviation is found by taking the square root of the average of the squared deviations of the values subtracted from their average value. The marks of a class of eight students (that is, a statistical population) are the following eight values:
+
+$2, 4, 4, 4, 5, 5, 7, 9$
+
+These eight data points have the mean (average) of 5:
+
+$$\mu ={\frac {2+4+4+4+5+5+7+9}{8}}={\frac {40}{8}}=5$$
+
+First, calculate the deviations of each data point from the mean, and square the result of each:
+
+| Deviations of each data | Square the result    |
+| ----------------------- | -------------------- |
+| $(2-5)^{2}=(-3)^{2}=9$  | $(5-5)^{2}=0^{2}=0$  |
+| $(4-5)^{2}=(-1)^{2}=1$  | $(5-5)^{2}=0^{2}=0$  |
+| $(4-5)^{2}=(-1)^{2}=1$  | $(7-5)^{2}=2^{2}=4$  |
+| $(4-5)^{2}=(-1)^{2}=1$  | $(9-5)^{2}=4^{2}=16$ |
+
+The variance is the mean of these values:
+
+$$\sigma ^{2}={\frac {9+1+1+1+0+0+4+16}{8}}={\frac {32}{8}}=4$$
+
+and the population standard deviation is equal to the square root of the variance:
+
+$$\sigma ={\sqrt {4}}=2$$
+
+Write a function that takes an array of numbers as parameter and returns the <a href="https://rosettacode.org/wiki/Standard_deviation" target="_blank" rel="noopener noreferrer nofollow">standard deviation</a> of the series.
 
 # --hints--
 
@@ -18,31 +43,31 @@ dashedName: cumulative-standard-deviation
 assert(typeof standardDeviation == 'function');
 ```
 
-`standardDeviation([2, 4, 4, 4, 5, 5, 7, 9])` має повернути число.
+`standardDeviation([2, 4, 4, 4, 5, 5, 7, 9])` має повертати число.
 
 ```js
 assert(typeof standardDeviation([2, 4, 4, 4, 5, 5, 7, 9]) == 'number');
 ```
 
-`standardDeviation([2, 4, 4, 4, 5, 5, 7, 9])` має повернути `2`.
+`standardDeviation([2, 4, 4, 4, 5, 5, 7, 9])` має повертати `2`.
 
 ```js
 assert.equal(standardDeviation([2, 4, 4, 4, 5, 5, 7, 9]), 2);
 ```
 
-`standardDeviation([600, 470, 170, 430, 300])` має повернути `147.323`.
+`standardDeviation([600, 470, 170, 430, 300])` має повертати `147.323`.
 
 ```js
 assert.equal(standardDeviation([600, 470, 170, 430, 300]), 147.323);
 ```
 
-`standardDeviation([75, 83, 96, 100, 121, 125])` має повернути `18.239`.
+`standardDeviation([75, 83, 96, 100, 121, 125])` має повертати `18.239`.
 
 ```js
 assert.equal(standardDeviation([75, 83, 96, 100, 121, 125]), 18.239);
 ```
 
-`standardDeviation([23, 37, 45, 49, 56, 63, 63, 70, 72, 82])` має повернути `16.87`.
+`standardDeviation([23, 37, 45, 49, 56, 63, 63, 70, 72, 82])` має повертати `16.87`.
 
 ```js
 assert.equal(
@@ -51,7 +76,7 @@ assert.equal(
 );
 ```
 
-`standardDeviation([271, 354, 296, 301, 333, 326, 285, 298, 327, 316, 287, 314])` має повернути `22.631`.
+`standardDeviation([271, 354, 296, 301, 333, 326, 285, 298, 327, 316, 287, 314])` має повертати `22.631`.
 
 ```js
 assert.equal(
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md
index 4e2d04de151..c520f434f78 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md
@@ -1,18 +1,18 @@
 ---
 id: 59694356a6e7011f7f1c5f4e
 title: Роздати карти для FreeCell
-challengeType: 5
+challengeType: 1
 forumTopicId: 302246
 dashedName: deal-cards-for-freecell
 ---
 
 # --description--
 
-*FreeCell* - це гра в пасьянс, представлена Полем Альфілем для системи PLATO у 1978. Джим Хорн, представник Microsoft, змінив її ім'я на FreeCell та реалізував гру для системи [DOS](https://rosettacode.org/wiki/DOS "DOS"), а згодом і для [Windows](https://rosettacode.org/wiki/Windows "Windows"). Ця версія представила 32000 нумерованих роздач.
+*FreeCell* - це гра в пасьянс, представлена Полем Альфілем для системи PLATO у 1978. Jim Horne, at Microsoft, changed the name to FreeCell and reimplemented the game for DOS, then Windows. Ця версія представила 32000 нумерованих роздач.
 
 Як тільки гра стала популярною, Джим Хорн розкрив її алгоритм, що дало початок реалізації нових версій FreeCell, які відтворювали роздачі Microsoft. Нумерація роздач сягала від 1 до 32000. Нові версії від Microsoft мають близько 1 мільйону роздач, нумерованих від 1 до 1000000; а деякі варіації дозволяють нумерацію і поза межами цього діапазону.
 
-Алгоритм використовує цей [лінійний конгурентний генератор](https://rosettacode.org/wiki/linear congruential generator "linear congruential generator") від Microsoft C:
+The algorithm uses this linear congruential generator from Microsoft C:
 
 <ul>
   <li>$state_{n + 1} \equiv 214013 \times state_n + 2531011 \pmod{2^{31}}$</li>
@@ -24,7 +24,7 @@ dashedName: deal-cards-for-freecell
 
 <ol>
   <li>Введіть загальну кількість роздач у RNG (random number generator).
-  </li><li>Створіть <a href='https://rosettacode.org/wiki/array' title='array' target='_blank'>масив</a> з 52 карт: туз трефи, туз бубни, туз чирви, туз піки, двійка трефи, двійка бубни і т.д. по усім рангам: Туз, 2, 3, 4, 5, 6, 7, 8, 9, 10, Валет, Дама, Король. Індекси масивів від 0 до 51, з тузом трефи на 0 та королем піки на 51.</li>
+  </li><li>Create an array of 52 cards: Ace of Clubs, Ace of Diamonds, Ace of Hearts, Ace of Spades, 2 of Clubs, 2 of Diamonds, and so on through the ranks: Ace, 2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King. Індекси масивів від 0 до 51, з тузом трефи на 0 та королем піки на 51.</li>
   <li>Поки масив не стане пустим:</li>
   <li>Оберіть випадкову карту із індексом ≡ наступне випадкове число (довжина масиву модулів).</li>
     <ul>
@@ -79,8 +79,6 @@ dashedName: deal-cards-for-freecell
 
 Напишіть функцію, щоб дізнатись номер роздачі та роздати карти в такому ж порядку, як у алгоритмі. Функція має видати двовимірний масив, що представляє собою дошку FreeCell.
 
-Роздачі також можна перевірити у [ рішеннях до 1000000 FreeCell ігор](https://freecellgamesolutions.com/). (Знайдіть відеорішення, що покаже початкову роздачу.)
-
 # --hints--
 
 `dealFreeCell` має бути функцією.
@@ -89,25 +87,25 @@ dashedName: deal-cards-for-freecell
 assert(typeof dealFreeCell === 'function');
 ```
 
-`dealFreeCell(seed)` має видати об'єкт.
+`dealFreeCell(seed)` should return an object.
 
 ```js
 assert(typeof dealFreeCell(1) === 'object');
 ```
 
-`dealFreeCell(seed)` має видати масив довжиною 7.
+`dealFreeCell(seed)` should return an array of length 7.
 
 ```js
 assert(dealFreeCell(1).length === 7);
 ```
 
-`dealFreeCell(1)` має видати масив ідентичний до прикладу "Гра #1"
+`dealFreeCell(1)` should return an array identical to example "Game #1"
 
 ```js
 assert.deepEqual(dealFreeCell(1), game1);
 ```
 
-`dealFreeCell(617)` має видати масив ідентичний до прикладу "Гра #617"
+`dealFreeCell(617)` should return an array identical to example "Game #617"
 
 ```js
 assert.deepEqual(dealFreeCell(617), game617);
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/discordian-date.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/discordian-date.md
index f2ac9575015..c3b611c4650 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/discordian-date.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/discordian-date.md
@@ -1,14 +1,31 @@
 ---
 id: 59f4eafba0343628bb682785
 title: Дискордіанський календар
-challengeType: 5
+challengeType: 1
 forumTopicId: 302250
 dashedName: discordian-date
 ---
 
 # --description--
+The Gregorian calendar is a solar calendar with 12 months of 28-31 days each. A week consists of seven days, and there are 52 weeks and 1 day per year. The year consists of 365 days with a leap day added to February every leap year. A leap year occurs every four years, except for the first three centurial years of every 400 years.
 
-Перетворіть дану дату з [Григоріанського календаря ](https://en.wikipedia.org/wiki/Gregorian calendar "wp: Gregorian calendar") в [Дискордіанський календар](https://en.wikipedia.org/wiki/Discordian calendar "wp: Discordian calendar").
+The <a href="http://www.rosettacode.org/wiki/Discordian_date" target="_blank" rel="noopener noreferrer nofollow">Discordian calendar</a> is aligned with the Gregorian calendar, and begins on January 1. The week consists of five days, and there are 73 weeks per year. The year also consists of 365 days, with an extra day inserted between Chaos 59 and Chaos 60 every leap year.
+
+The months, weekdays, Apostle events, and Holidays in the Discordian calendar are given by:
+
+Seasons: `'Chaos', 'Discord', 'Confusion', 'Bureaucracy', 'The Aftermath'`.
+
+Weekdays: `'Sweetmorn', 'Boomtime', 'Pungenday', 'Prickle-Prickle', 'Setting Orange'`.
+
+Apostle: `'Mungday', 'Mojoday', 'Syaday', 'Zaraday', 'Maladay'`.
+
+Holidays: `'Chaoflux', 'Discoflux', 'Confuflux', 'Bureflux', 'Afflux'`.
+
+# --instructions--
+
+Convert a given date from the Gregorian calendar to the Discordian calendar.
+
+Note that the day Chaos 1, 3188 YOLD in the Discordian calendar is the day January 1, 2022 in the Gregorian calendar.
 
 # --hints--
 
@@ -18,7 +35,7 @@ dashedName: discordian-date
 assert(typeof discordianDate === 'function');
 ```
 
-`discordianDate(new Date(2010, 6, 22))` повинен повернутися як `"Pungenday, the 57th day of Confusion in the YOLD 3176"`.
+`discordianDate(new Date(2010, 6, 22))` should return `"Pungenday, the 57th day of Confusion in the YOLD 3176"`.
 
 ```js
 assert(
@@ -27,7 +44,7 @@ assert(
 );
 ```
 
-`discordianDate(new Date(2012, 1, 28))` повинен повертатися як `"Prickle-Prickle, the 59th day of Chaos in the YOLD 3178"`.
+`discordianDate(new Date(2012, 1, 28))` should return `"Prickle-Prickle, the 59th day of Chaos in the YOLD 3178"`.
 
 ```js
 assert(
@@ -36,7 +53,7 @@ assert(
 );
 ```
 
-`discordianDate(new Date(2012, 1, 29))` повинен повертатися як `"Setting Orange, the 60th day of Chaos in the YOLD 3178. Святкуйте St. Tib\'s Day!"`.
+`discordianDate(new Date(2012, 1, 29))` should return `"Setting Orange, the 60th day of Chaos in the YOLD 3178. Celebrate St. Tib\'s Day!"`.
 
 ```js
 assert(
@@ -45,7 +62,7 @@ assert(
 );
 ```
 
-`discordianDate(new Date(2012, 2, 1))` повинен повертатися як `"Setting Orange, the 60th day of Chaos in the YOLD 3178"`.
+`discordianDate(new Date(2012, 2, 1))` should return `"Setting Orange, the 60th day of Chaos in the YOLD 3178"`.
 
 ```js
 assert(
@@ -54,7 +71,7 @@ assert(
 );
 ```
 
-`discordianDate(new Date(2010, 0, 5))` повинен повертатися як `"Setting Orange, the 5th day of Chaos in the YOLD 3176. Відсвяткуйте Mungday!"`.
+`discordianDate(new Date(2010, 0, 5))` should return `"Setting Orange, the 5th day of Chaos in the YOLD 3176. Celebrate Mungday!"`.
 
 ```js
 assert(
@@ -63,7 +80,7 @@ assert(
 );
 ```
 
-`discordianDate(new Date(2011, 4, 3))` повинен повертатися як `"Pungenday, the 50th day of Discord in the YOLD 3177. Відсвяткуйте Discoflux!"`.
+`discordianDate(new Date(2011, 4, 3))` should return `"Pungenday, the 50th day of Discord in the YOLD 3177. Celebrate Discoflux!"`.
 
 ```js
 assert(
@@ -72,7 +89,7 @@ assert(
 );
 ```
 
-`discordianDate(new Date(2015, 9, 19))` повинен повертатися як `"Boomtime, the 73rd day of Bureaucracy in the YOLD 3181"`.
+`discordianDate(new Date(2015, 9, 19))` should return `"Boomtime, the 73rd day of Bureaucracy in the YOLD 3181"`.
 
 ```js
 assert(
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/dot-product.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/dot-product.md
index fd3f25cf6ad..35466049ef6 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/dot-product.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/dot-product.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7e1e
 title: Скалярний добуток
-challengeType: 5
+challengeType: 1
 forumTopicId: 302251
 dashedName: dot-product
 ---
 
 # --description--
 
-Створіть функцію, щоб обчислити **[скалярний добуток](https://en.wikipedia.org/wiki/Dot product)**, також відомий як **скалярний продукт** двох векторів.
+Create a function, to compute the **dot product**, also known as the **scalar product** of two vectors.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/euler-method.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/euler-method.md
index 9cba4e9b1ea..a38d3137222 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/euler-method.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/euler-method.md
@@ -1,14 +1,14 @@
 ---
 id: 59880443fb36441083c6c20e
 title: Метод Ейлера
-challengeType: 5
+challengeType: 1
 forumTopicId: 302258
 dashedName: euler-method
 ---
 
 # --description--
 
-Метод Ейлера чисельно наближує рішення звичайних рівнянь першого порядку (ODE) з заданим початковим значенням. Це явний метод вирішення проблем із початковими значеннями (IVP), описаний у [цій статті](https://www.freecodecamp.org/news/eulers-method-explained-with-examples/ "news: Euler's Method Explained with Examples").
+Метод Ейлера чисельно наближує рішення звичайних рівнянь першого порядку (ODE) з заданим початковим значенням. It is an explicit method for solving initial value problems (IVPs), as described in <a href="https://www.freecodecamp.org/news/eulers-method-explained-with-examples/" title="Euler's Method Explained with Examples" target="_blank" rel="noopener noreferrer nofollow">this article</a>.
 
 ODE повинен бути наданий за такою формою:
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md
index c1397c07a9c..a0a9fd1d481 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md
@@ -1,183 +1,115 @@
 ---
 id: 59e09e6d412c5939baa02d16
 title: Виконайте алгоритм Маркова
-challengeType: 5
+challengeType: 1
 forumTopicId: 302260
 dashedName: execute-a-markov-algorithm
 ---
 
 # --description--
 
-Створіть інтерпретацію для сторінки [алгоритм Маркова](https://en.wikipedia.org/wiki/Markov algorithm "wp: Markov algorithm").
+Markov Concepts are used in machine learning, because of its simple approach in data manipulation. With a set number of `rules` you can manipulate given `data` to create a desired `output`.
 
-Граматична побудова правил:
+We have added in the background:
 
-<pre>[ruleset] ::= (([comment] | [rule]) [newline]+)*
-[comment] ::= # {[будь-який символ]}
-[rule] ::= [pattern] [whitespace] -> [whitespace] [.] [replacement]
-[whitespace] ::= ([tab] | [space]) [[whitespace]]
-</pre>
+The `rules` in the form of nested array, and the `data` in the form of array, too. And the desired `outputs`.
 
-У кожному рядку по одному правилу.
+`rules`:
 
-Якщо `.` (крапка) стоїть перед \[replacement], тоді це кінцеве правило, у випадку котрого інтерпретатор повинен зупинити виконання.
+```js
+let rules=[
+[
+"A -> apple","B -> bag","S -> shop","T -> the",
+"the shop -> my brother","a never used -> .terminating rule"
+],
 
-Набір правил складається з послідовності певних норм та умовних додатків.
+[
+ "A -> apple","B -> bag","S -> .shop","T -> the",
+ "the shop -> my brother","a never used -> .terminating rule"
+],
 
-Правила
+[
+ "A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag",
+ "->.* -> money","W -> WW","S -> .shop","T -> the",
+ "the shop -> my brother","a never used -> .terminating rule"
+],
 
-Використовуйте поточні вправи на початку:
+[
+ "_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX",
+ "X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y",
+ "1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "
+],
 
-**Правило 1:**
+[
+"A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11",
+"B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"
+]
 
-<pre># Цей файл з правилами взято з Вікіпедії:
-#
-<code>http://en.wikipedia.org/wiki/Markov_Algorithm</code>
-A -> яблуко
-B -> мішок
-S -> магазин
-T -> артикль "the"
-магазин -> мій брат
-невикористаний -> .кінцеве правило
-</pre>
+];
+```
 
-Зразок тексту `я купив B As у T S.` має повернути речення`я купив мішок яблук у мого брата.`
+`data`:
 
-**Правило 2:**
+```js
+let data=[
+        "I bought a B of As from T S.",
+        "I bought a B of As from T S.",
+        "I bought a B of As W my Bgage from T S.",
+        "_1111*11111_",
+        "000000A000000"
+        ];
+```
 
-Перевірка кінцевого правила
+`outputs`:
 
-<pre># Трохи змінено правила з Вікіпедії
-A -> яблуко
-B -> сумка
-S -> . магазин
-T -> the
-магазин -> мій брат
-ніколи не використовувався -> .кінцева умова
-</pre>
+```js
+let outputs=[
+    "I bought a bag of apples from my brother.",
+    "I bought a bag of apples from T shop.",
+    "I bought a bag of apples with my money from T shop.",
+    "11111111111111111111",
+    "00011H1111000"
+    ]
+```
 
-Зразок тексту `я купив B As у T S.`повинен згенерувати`я купив мішок яблук у цьому магазині.`
-
-**Правило 3:**
-
-Ці вправи призначені для правильної заміни порядку, вони можуть закрити замінні послідовності, базовані на простих регулярних виразах, якщо символів спеціальних регулярних виразів не оминули.
-
-<pre># BNF правила синтаксичного тестування
--> яблуко
-WWW -> з
-Bgage -> ->.*
-B -> сумка
-->. -> гроші
-W -> WW
-S -> . магазин
-T -> 
-магазин -> мій брат
-ніколи не використовувався -> закінчення правила
-</pre>
-
-Зразок тексту `я купив As B W свої Bgage у T S.` повинний перетворитися у `я купив мішок яблук за свої гроші у T магазині.`
-
-**Правило 4:**
-
-Ці тести для правильного порядку сканування правил може ловити підпрограми, що сканують в неправильному порядку. Це реалізує загальний двовимірний механізм множення. (Зверніть увагу, що вхідний вираз повинен бути в підкресленнях у цій реалізації.)
-
-<pre>### Унарний механізм множення для тестування виконання алгоритму Маркова
-### За методом Дона Феллоуза.
-Одинарна додаткова система:
-_+1 -> _1+
-1+1 -> 11+
-# Передача для конвертування від поділу множинного до звичайного
-# додаток
-1! -> !1,! -> !+
-_! -> _
-# Одинарне множення шляхом дублювання лівої сторони, часів правої сторони
-1*1 -> x,@y
-1x -> xX
-X, -> 1,1
-X1 -> 1X
-_x -> _X
-,x -> ,X
-y1 -> 1y
-y_ -> _
-# Наступний етап додавання
-1@1 -> x,@y
-1@_ -> @_
-,@_ -> !_
-++ -> +
-# Припинення очищення для додатку:
-_1 -> 1
-1+_ -> 1
-_+_ ->
-</pre>
-
-Зразок тексту `_1111*11111_` повинний згенерувати наступне`11111111111111111111`
-
-**Правило 5:**
-
-Проста [Машина Тюрінга](http://en.wikipedia.org/wiki/Turing_machine "link: http&#x3A;//en.wikipedia.org/wiki/Turing_machine"), здійснюючи трьохстановий [busy beaver](http://en.wikipedia.org/wiki/Busy_beaver "link: http&#x3A;//en.wikipedia.org/wiki/Busy_beaver").
-
-Стрічка складається з`0`s та`1`s, станами є `A`, `B`, `C` і `H` (для `H`alt), початкова позиція визначається написанням літери стану перед символом початку. Усі частини початкової стрічки, на яких працює машина, мають вказані у вхідних даних.
-
-Окрім демонстрації того, що алгоритм Маркова є довершенням Тюрінга, він допоміг мені виявити проблему у реалізації C++, котра не була помічною у попередніх правилах.
-
-<pre># Машина Тюрінга: трьохстановий Busy beaver:
-#
-#стан А, символ 0=> пишемо 1, переносимо праворуч, новий стан В
-А0 -> 1B
-# стан А, символ 1=> пишемо 1, переносимо ліворуч, новий стан C
-0A1 -> C01
-1A1 -> C11
-# стан В, символ 0 => пишемо 1, переносимо ліворуч, новий стан А
-0B0 -> A01
-1B0 -> A11
-# стан B, символ 1 => пишемо 1, переносимо праворуч, новий стан В
-B1 -> 1B
-# стан С, символ => 1 пишемо 1, переносимо ліворуч, новий стан В
-0C0 -> B01
-1C0 -> B11
-# стан С, символ => 1 пишемо 1, переносимо ліворуч, зупиняємо
-0C1 -> H01
-1C1 -> H11
-</pre>
-
-Цей набір правил повинен перетворитися з `000000A000000` у `00011H1111000`
+Using Markov Algorithm, change the `data` into the desired `outputs` using the `rules` provided for you.
 
 # --hints--
 
-`markov` повинен бути функцією.
+`markov` має бути функцією.
 
 ```js
 assert(typeof markov === 'function');
 ```
 
-`markov(["A -> apple","B -> bag","S -> shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` повинно повертати "я купив мішок яблук у мого брата".
+`markov(["A -> apple","B -> bag","S -> shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` має повертати рядок `I bought a bag of apples from my brother.`.
 
 ```js
-assert.deepEqual(markov(rules[0], tests[0]), outputs[0]);
+assert.deepEqual(markov(rules[0], datas[0]), outputs[0]);
 ```
 
-`markov(["A -> apple","B -> bag","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` має повертати "я купив мішок яблук у цьому магазині".
+`markov(["A -> apple","B -> bag","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` має повертати рядок `I bought a bag of apples from T shop.`.
 
 ```js
-assert.deepEqual(markov(rules[1], tests[1]), outputs[1]);
+assert.deepEqual(markov(rules[1], datas[1]), outputs[1]);
 ```
 
-`markov(["A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag","->.* -> money","W -> WW","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As W my Bgage from T S.")` має повертати "я купив мішок яблук за мої грошу у цьому магазині".
+`markov(["A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag","->.* -> money","W -> WW","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As W my Bgage from T S.")` має повертати рядок `I bought a bag of apples with my money from T shop.`.
 
 ```js
-assert.deepEqual(markov(rules[2], tests[2]), outputs[2]);
+assert.deepEqual(markov(rules[2], datas[2]), outputs[2]);
 ```
 
-`Марков(["_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX","X, -> 1,1","X1 -> 1X","_x -> _X",", -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y","1@_ -> @_",",@_ -> ! ","++ -> +","_1 -> 1","1+_ -> ","_+_ -> "],"_11*11111_")` повинен повернути "11111111111111111111111111111111111111".
+`markov(["_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX","X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y","1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "],"_1111*11111_")` має повертати рядок `11111111111111111111`.
 
 ```js
-assert.deepEqual(markov(rules[3], tests[3]), outputs[3]);
+assert.deepEqual(markov(rules[3], datas[3]), outputs[3]);
 ```
 
-`markov(["A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11","B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"],"")` повинен повернути "00011H1111000".
+`markov(["A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11","B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"],"")` має повертати рядок `00011H1111000`.
 
 ```js
-assert.deepEqual(markov(rules[4], tests[4]), outputs[4]);
+assert.deepEqual(markov(rules[4], datas[4]), outputs[4]);
 ```
 
 # --seed--
@@ -191,7 +123,7 @@ let rules=[["A -> apple","B -> bag","S -> shop","T -> the","the shop -> my broth
             ["A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag","->.* -> money","W -> WW","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],
             ["_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX","X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y","1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "],
             ["A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11","B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"]];
-let tests=["I bought a B of As from T S.",
+let datas=["I bought a B of As from T S.",
             "I bought a B of As from T S.",
             "I bought a B of As W my Bgage from T S.",
             "_1111*11111_",
@@ -208,7 +140,7 @@ let outputs=["I bought a bag of apples from my brother.",
 ## --seed-contents--
 
 ```js
-function markov(rules,test) {
+function markov(rules,data) {
 
 }
 ```
@@ -216,9 +148,9 @@ function markov(rules,test) {
 # --solutions--
 
 ```js
-function markov(rules,test) {
+function markov(rules,data) {
     let pattern = new RegExp("^([^#]*?)\\s+->\\s+(\\.?)(.*)");
-    let origTest = test;
+    let origData = data;
 
     let captures = [];
 
@@ -229,18 +161,18 @@ function markov(rules,test) {
         captures.push(m);
     });
 
-    test = origTest;
-    let copy = test;
+    data = origData;
+    let copy = data;
     for (let j = 0; j < captures.length; j++) {
         let c = captures[j];
-        test = test.replace(c[0], c[2]);
+        data = data.replace(c[0], c[2]);
         if (c[1]==".")
             break;
-        if (test!=copy) {
+        if (data!=copy) {
             j = -1;
-            copy = test;
+            copy = data;
         }
     }
-    return test;
+    return data;
 }
 ```
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/execute-brain.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/execute-brain.md
index 72b52c15849..70a10a53348 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/execute-brain.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/execute-brain.md
@@ -1,7 +1,7 @@
 ---
 id: 59e0a8df964e4540d5abe599
 title: Execute Brain****
-challengeType: 5
+challengeType: 1
 forumTopicId: 302261
 dashedName: execute-brain
 ---
@@ -10,7 +10,7 @@ dashedName: execute-brain
 
 Напишіть функцію для запуску Brain\*\*\*\* перекладача. Функція бере рядок як параметр і на виході також виходить рядок. Деталі наведено нижче:
 
-RCBF є набором [Brainf\*\*\*](https://rosettacode.org/wiki/Brainf*** "Brainf\*\*\*") компіляторів та інтерпретаторів, написаних Rosetta code різними мовами.
+RCBF is a set of <a href="https://rosettacode.org/wiki/Brainf***" target="_blank" rel="noopener noreferrer nofollow">Brainf\*\*\*</a> compilers and interpreters written for Rosetta Code in a variety of languages.
 
 Нижче наведено посилання на кожну з версій RCBF.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/factorial.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/factorial.md
index 2d040f209be..0173950b3e0 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/factorial.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/factorial.md
@@ -1,7 +1,7 @@
 ---
 id: 597b2b2a2702b44414742771
 title: Факторіал
-challengeType: 5
+challengeType: 1
 forumTopicId: 302263
 dashedName: factorial
 ---
@@ -22,7 +22,7 @@ dashedName: factorial
   <li><code>4! = 4 * 3 * 2 * 1 = 24</code></li>
 </ul>
 
-**Примітка:** `0! = 1`
+**Note:** `0! = 1`
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
index a5ecd1f7ad8..e3ac234844f 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
@@ -1,7 +1,7 @@
 ---
 id: 598eea87e5cf4b116c3ff81a
 title: Фактори числа Мерсенна
-challengeType: 5
+challengeType: 1
 forumTopicId: 302264
 dashedName: factors-of-a-mersenne-number
 ---
@@ -12,7 +12,7 @@ dashedName: factors-of-a-mersenne-number
 
 Якщо `P` є простим, то число Мерсенна може бути простим числом Мерсенна. (Якщо `P` не є простим, число Мерсенна також не є простим.)
 
-У пошуку простих чисел Мерсенна вигідно усунути експоненти, знайшовши невеликий фактор перед початком, потенційно довжину, [тест Лукас-Лемер](https://rosettacode.org/wiki/Lucas-Lehmer test "Lucas-Lehmer test").
+In the search for Mersenne prime numbers it is advantageous to eliminate exponents by finding a small factor before starting a, potentially lengthy, <a href="https://rosettacode.org/wiki/Lucas-Lehmer test" target="_blank" rel="noopener noreferrer nofollow">Lucas-Lehmer test</a>.
 
 Існують дуже ефективні алгоритми визначення, чи число ділиться на <code>2<sup>P</sup>-1</code> (або відповідно, якщо <code>2<sup>P</sup> мод (число) = 1</code>).
 
@@ -48,7 +48,7 @@ dashedName: factors-of-a-mersenne-number
 
 Будь-який фактор, `q` з <code>2<sup>P</sup>-1</code> повинен бути у вигляді `2kP+1`, `k` це додатне ціле число або нуль. Крім того, `q` має бути `1` або `7 mod 8`.
 
-Нарешті будь-який потенційний множник `q` має бути [prime](https://rosettacode.org/wiki/Primality by Trial Division "Primality by Trial Division").
+Finally any potential factor `q` must be <a href="https://rosettacode.org/wiki/Primality_by_trial_division" target="_blank" rel="noopener noreferrer nofollow">prime</a>.
 
 Як і в інших алгоритмах пробного ділення, алгоритм припиняється, коли `2kP+1 > sqrt(N)`. Ці в першу чергу тести працюють лише з цифрами Мерсенна, де `P` - це просте число. Наприклад, <code>M<sub>4</sub>=15</code> не дає ніяких чинників, використовуючи ці технології, але фактори в 3 та 5, жоден з яких не відповідає `2kP+1`.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/farey-sequence.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/farey-sequence.md
index b7f088d5560..86725bd4e60 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/farey-sequence.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/farey-sequence.md
@@ -1,14 +1,14 @@
 ---
 id: 59c3ec9f15068017c96eb8a3
 title: Ряд Фарея
-challengeType: 5
+challengeType: 1
 forumTopicId: 302266
 dashedName: farey-sequence
 ---
 
 # --description--
 
-[Ряд Фарея](https://en.wikipedia.org/wiki/Farey sequence "wp: Farey sequence") <code>F<sub>n</sub></code> of order`n` є рядом повністю скорочених дробів між `0` та `1`, які у нескороченому виді мають знаменники, менші від або такі, які дорівнюють `n` у порядку зростання.
+The Farey sequence <code>F<sub>n</sub></code> of order `n` is the sequence of completely reduced fractions between `0` and `1` which, when in lowest terms, have denominators less than or equal to `n`, arranged in order of increasing size.
 
 *Ряд Фарея* деколи помилково називають *Серією Фарея*.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md
index 7430dbd0cf0..b383d165eeb 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md
@@ -1,14 +1,14 @@
 ---
 id: 598eef80ba501f1268170e1e
 title: Послідовність n-крокових чисел Фібоначчі
-challengeType: 5
+challengeType: 1
 forumTopicId: 302267
 dashedName: fibonacci-n-step-number-sequences
 ---
 
 # --description--
 
-Ця серія чисел є розширенням звичайної [послідовності Фібоначчі](https://rosettacode.org/wiki/Fibonacci sequence "Fibonacci sequence") де:
+These number series are an expansion of the ordinary Fibonacci sequence where:
 
 <ol>
   <li>Для $n = 2$ ми маємо послідовність Фібоначчі; з початковими значеннями $[1, 1]$ і $F_k^2 = F_{k-1}^2 + F_{k-2}^2$</li>
@@ -17,7 +17,7 @@ dashedName: fibonacci-n-step-number-sequences
   <li>Для загального $n>2$ ми маємо послідовність Фібоначчі $n$-крокову - $F_k^n$; з початковими значеннями з перших $n$ значень $(n-1)$'th $n$-крокової послідовності Фібоначчі $F_k^{n-1}$; і $k$'th значення цієї $n$'ої послідовності - $F_k^n = \sum_{i=1}^{(n)} {F_{k-i}^{(n)}$</li>
 </ol>
 
-Для невеликих значень $n$, <ahref="https://en.wikipe[іноді використовують грецькі числівникові префікси](https://en.wikipedia.org/wiki/Number prefix#Greek_series "wp: Number prefix#Greek_series") щоб індивідуально дати назву кожній послідовності.
+For small values of $n$, Greek numeric prefixes are sometimes used to individually name each series.
 
 Послідовність $n$- крокових чисел Фібоначчі:
 
@@ -33,7 +33,7 @@ dashedName: fibonacci-n-step-number-sequences
 | 9   | нонаначчі           | 1 1 2 4 8 16 32 64 128 256 511 1021 2040 4076 8144 ... |
 | 10  | деканаччі           | 1 1 2 4 8 16 32 64 128 256 512 1023 2045 4088 8172 ... |
 
-Союзні послідовності можна створити там, де початкові значення змінюються: [Послідовність Люка](https://en.wikipedia.org/wiki/Lucas number "wp: Lucas number") сумує два попередніх значення, так само як серія Фібоначчі для $n= 2$, але використовує рядок $\[2, 1]$ як початкові значення.
+Allied sequences can be generated where the initial values are changed: The Lucas series sums the two preceding values like the fibonacci series for $n=2$ but uses $\[2, 1]$ as its initial values.
 
 # --instructions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/fibonacci-word.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/fibonacci-word.md
index ca3d4494098..c38a2d07f15 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/fibonacci-word.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/fibonacci-word.md
@@ -1,14 +1,14 @@
 ---
 id: 5992e222d397f00d21122931
 title: Слово Фібоначчі
-challengeType: 5
+challengeType: 1
 forumTopicId: 302269
 dashedName: fibonacci-word
 ---
 
 # --description--
 
-Слово Фібоначчі можна створити аналогічно послідовності Фібоначчі [як описано тут](https://hal.archives-ouvertes.fr/docs/00/36/79/72/PDF/The_Fibonacci_word_fractal.pdf):
+The Fibonacci Word Sequence may be created in a manner analogous to the Fibonacci Sequence, but it focuses on iterating concatenation.
 
 <pre>Визначте  F_Слово<sub>1</sub>  як  <strong>1</strong>
 Визначте  F_Слово<sub>2</sub>  як  <strong>0</strong>
@@ -16,9 +16,11 @@ dashedName: fibonacci-word
 Форма   F_Слова<sub>n</sub>  as  F_Слово<sub>n-1</sub>  об'єднана з  F_Словом<sub>n-2</sub>
 </pre>
 
+Entropy calculation is required in this challenge, <a href="https://www.freecodecamp.org/learn/coding-interview-prep/rosetta-code/entropy" target="_blank" rel="noopener noreferrer nofollow">as shown in this Rosetta Code challenge</a>
+
 # --instructions--
 
-Напишіть функцію для повернення слів Фібоначчі до `n`. `n` буде надано як параметр функції. Функція має повернути масив об'єктів. Об’єкти мають мати такий вигляд: `{ N: 1, Length: 1, Entropy: 0, Word: '1' }`.
+Write a function to return the first `n` Fibonacci Words. The number of `n` is provided as a parameter to the function. The function should return an array of objects. The objects should be of the form: `{ N: 1, Length: 1, Entropy: 0, Word: '1' }`. `Entropy` is computed for the string `Word` and rounded to 8 decimal digits of accuracy. Note that the indices of this sequence start at `1`.
 
 # --hints--
 
@@ -28,16 +30,22 @@ dashedName: fibonacci-word
 assert(typeof fibWord === 'function');
 ```
 
-`fibWord(5)` має повернути масив.
+`fibWord(5)` should return an array.
 
 ```js
 assert(Array.isArray(fibWord(5)));
 ```
 
-`fibWord(5)` має повернути `[{ N:1, Length:1, Entropy:0, Word:"1" },{ N:2, Length:1, Entropy:0, Word:"0" },{ N:3, Length:2, Entropy:1, Word:"01" },{ N:4, Length:3, Entropy:0.9182958340544896, Word:"010" },{ N:5, Length:5, Entropy:0.9709505944546688, Word:"01001" }]`.
+`fibWord(5)` should return `[{ N:1, Length:1, Entropy:0, Word:"1" },{ N:2, Length:1, Entropy:0, Word:"0" },{ N:3, Length:2, Entropy:1, Word:"01" },{ N:4, Length:3, Entropy:0.91829583, Word:"010" },{ N:5, Length:5, Entropy:0.97095059, Word:"01001" }]`.
 
 ```js
-assert.deepEqual(fibWord(5), ans);
+assert.deepEqual(fibWord(5), words5);
+```
+
+`fibWord(7)` should return `[{ N:1, Length:1, Entropy:0, Word:"1" },{ N:2, Length:1, Entropy:0, Word:"0" },{ N:3, Length:2, Entropy:1, Word:"01" },{ N:4, Length:3, Entropy:0.91829583, Word:"010" },{ N:5, Length:5, Entropy:0.97095059, Word:"01001" }, { N:6, Length:8, Entropy:0.954434, Word:'01001010' }, { N:7, Length:13, Entropy:0.9612366, Word:'0100101001001' }]`.
+
+```js
+assert.deepEqual(fibWord(7), words7);
 ```
 
 # --seed--
@@ -45,15 +53,23 @@ assert.deepEqual(fibWord(5), ans);
 ## --after-user-code--
 
 ```js
-let ans=[ { N: 1, Length: 1, Entropy: 0, Word: '1' },
-
+const words5 = [
+  { N: 1, Length: 1, Entropy: 0, Word: '1' },
   { N: 2, Length: 1, Entropy: 0, Word: '0' },
-
   { N: 3, Length: 2, Entropy: 1, Word: '01' },
+  { N: 4, Length: 3, Entropy: 0.91829583, Word: '010' },
+  { N: 5, Length: 5, Entropy: 0.97095059, Word: '01001' }
+];
 
-  { N: 4, Length: 3, Entropy: 0.9182958340544896, Word: '010' },
-
-  { N: 5, Length: 5, Entropy: 0.9709505944546688, Word: '01001' }];
+const words7 = [
+  { N: 1, Length: 1, Entropy: 0, Word: '1' },
+  { N: 2, Length: 1, Entropy: 0, Word: '0' },
+  { N: 3, Length: 2, Entropy: 1, Word: '01' },
+  { N: 4, Length: 3, Entropy: 0.91829583, Word: '010' },
+  { N: 5, Length: 5, Entropy: 0.97095059, Word: '01001' },
+  { N: 6, Length: 8, Entropy: 0.954434, Word: '01001010' },
+  { N: 7, Length: 13, Entropy: 0.9612366, Word: '0100101001001' }
+];
 ```
 
 ## --seed-contents--
@@ -67,55 +83,33 @@ function fibWord(n) {
 # --solutions--
 
 ```js
+// Round to digits
+function roundFloat(num, digits) {
+  return Math.round(num * 10.0**digits) / (10.0**digits);
+}
+
+// Entropy calculation for string with only 0 and 1
+function entropy(word) {
+  function digitEntropy(count) {
+    return count < 1 ? 0
+      : - count / word.length * Math.log2(count / word.length);
+  }
+  const numZeros = word.split('').filter(e => e === '0').length;
+  const numOnes  = word.length - numZeros;
+  return roundFloat(digitEntropy(numZeros) + digitEntropy(numOnes), 8);
+}
+
+// Compute array of Fibonacci words
 function fibWord(n) {
-    function entropy(s) {
-         //create an object containing each individual char
-      //and the amount of iterations per char
-        function prob(s) {
-            var h = Object.create(null);
-            s.split('').forEach(function(c) {
-               h[c] && h[c]++ || (h[c] = 1);
-            });
-            return h;
-        }
-
-        s = s.toString(); //just in case
-        var e = 0, l = s.length, h = prob(s);
-
-        for (var i in h ) {
-            var p = h[i]/l;
-            e -= p * Math.log(p) / Math.log(2);
-        }
-        return e;
-    }
-    var wOne = "1", wTwo = "0", wNth = [wOne, wTwo], w = "", o = [];
-
-    for (var i = 0; i < n; i++) {
-        if (i === 0 || i === 1) {
-            w = wNth[i];
-        } else {
-            w = wNth[i - 1] + wNth[i - 2];
-            wNth.push(w);
-        }
-        var l = w.length;
-        var e = entropy(w);
-
-        if (l <= 21) {
-            o.push({
-                N: i + 1,
-                Length: l,
-                Entropy: e,
-                Word: w
-            });
-        } else {
-            o.push({
-                N: i + 1,
-                Length: l,
-                Entropy: e,
-                Word: "..."
-            });
-        }
-    }
-  return o;
+  return [...Array(n).keys()]
+    .reduce((words, i) => {
+      const word = i === 0 ? "1"
+                 : i === 1 ? "0"
+                 : words[i - 1].Word + words[i - 2].Word;
+      words.push(
+        { N: i + 1, Length: word.length, Entropy: entropy(word), Word: word }
+      );
+      return words;
+    }, []);
 }
 ```
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/fractran.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/fractran.md
index 307b66fa026..5c4ae6ce545 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/fractran.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/fractran.md
@@ -1,14 +1,14 @@
 ---
 id: 5a7dad05be01840e1778a0d1
 title: Мова програмування Fractran
-challengeType: 5
+challengeType: 1
 forumTopicId: 302270
 dashedName: fractran
 ---
 
 # --description--
 
-[FRACTRAN](https://en.wikipedia.org/wiki/FRACTRAN "wp: FRACTRAN")-це повна езотерична мова програмування Тюрінга, винайдена математиком [Джоном Хортоном Конвеєм](https://en.wikipedia.org/wiki/John Horton Conway "wp: John Horton Conway").
+FRACTRAN is a Turing-complete esoteric programming language invented by the mathematician John Horton Conway.
 
 Програма FRACTRAN є впорядкованим списком додатних дробів $P = (f_1, f_2, \\ldots, f_m)$, разом з початковим введенням додатного цілого числа $n$.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/gamma-function.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/gamma-function.md
index 95f4b80390d..debff9574b9 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/gamma-function.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/gamma-function.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7e76
 title: Гамма-функція
-challengeType: 5
+challengeType: 1
 forumTopicId: 302271
 dashedName: gamma-function
 ---
 
 # --description--
 
-Реалізуйте один (або більше) алгоритм для обчислення [гамма-функції](https://en.wikipedia.org/wiki/Gamma function) ($\\Gamma$) (тільки в реальному полі).
+Implement one algorithm (or more) to compute the Gamma function (in the real field only).
 
 Гамма-функція може бути визначена як:
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md
index a05cb1315c7..1b1bfd7ffa4 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7e78
 title: Спільний FizzBuzz
-challengeType: 5
+challengeType: 1
 forumTopicId: 302273
 dashedName: general-fizzbuzz
 ---
 
 # --description--
 
-Напишіть спрощену версію [FizzBuzz](https://rosettacode.org/wiki/FizzBuzz) яка спрацює для буль якого переліку факторів, разом з їх словами.
+Write a generalized version of <a href="https://rosettacode.org/wiki/FizzBuzz" target="_blank" rel="noopener noreferrer nofollow">FizzBuzz</a> that works for any list of factors, along with their words.
 
 В основному, це реалізація "fizzbuzz", де надаються правила гри користувачу. Створіть функцію для реалізації цього. Функція повинна приймати два параметри.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/gray-code.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/gray-code.md
index 053b65a782e..cb9082b844d 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/gray-code.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/gray-code.md
@@ -1,18 +1,18 @@
 ---
 id: 5a23c84252665b21eecc7e80
 title: Код Грея
-challengeType: 5
+challengeType: 1
 forumTopicId: 302276
 dashedName: gray-code
 ---
 
 # --description--
 
-[ код Грея ](https://en.wikipedia.org/wiki/Gray code) - це форма бінарного кодування, де переходи між послідовними числами відрізняються лише на один біт.
+Gray code is a form of binary encoding where transitions between consecutive numbers differ by only one bit.
 
 Це корисне кодування для зменшення ризиків настання небезпеки для апаратних даних зі значеннями, що швидко змінюються та/або підключаються до повільнішого апаратного забезпечення як вхідних даних.
 
-Це також корисно для генерації даних для [Karnaugh maps](https://en.wikipedia.org/wiki/Karnaugh map) у порядку зліва направо або зверху вниз.
+It is also useful for generating inputs for Karnaugh maps in order from left to right or top to bottom.
 
 # --instructions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/happy-numbers.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/happy-numbers.md
index 47766347be4..eb7b3571497 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/happy-numbers.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/happy-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 594810f028c0303b75339ad1
 title: Щасливі числа
-challengeType: 5
+challengeType: 1
 forumTopicId: 302280
 dashedName: happy-numbers
 ---
 
 # --description--
 
-[ щасливе число ](https://en.wikipedia.org/wiki/Happy_number) визначається так:
+A happy number is defined by the following process:
 
 Починаючи з будь-якого додатного цілого числа, замініть число на суму квадратів цифр і повторіть дію, доки число не буде дорівнювати `1` (де воно залишиться), або воно нескінченно буде повторюватися у циклі, який не включає `1`. Ті числа, для яких цей процес закінчується `1` є щасливими, а ті, для яких процес не закінчуються `1` є нещасливими.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
index 3f3e5d1de37..8813f207b93 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
@@ -1,20 +1,24 @@
 ---
 id: 595671d4d2cdc305f0d5b36f
 title: Хеш із двох масивів
-challengeType: 5
+challengeType: 1
 forumTopicId: 302283
 dashedName: hash-from-two-arrays
 ---
 
 # --description--
 
-Використовуючи два масиви однакової довжини, створіть геш-об'єкт, в якому елементи з одного масиву (ключі) будуть пов'язані з елементами з іншого (значеннями).
+Given two arrays, create a hash object where the elements from one array (the keys) are linked to the elements of the other (the values).
 
-**Пов’язане завдання:**
+Example:
 
-<ul>
-  <li><a href='https://rosettacode.org/wiki/Associative arrays/Creation' title='Асоціативні масиви/Створення' target='_blank'>Асоціативні масиви/Створення</a></li>
-</ul>
+```js
+const firstArr = [1, 2, 3];
+const secondArr = ["a", "b", "c"];
+const hashObj = arrToObj(firstArr, secondArr);
+```
+
+The hash object created from the arrays above will be `{1: "a", 2: "b", 3: "c"}`.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/hash-join.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/hash-join.md
index 5b179e431cf..0c3ff10bb90 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/hash-join.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/hash-join.md
@@ -1,19 +1,19 @@
 ---
 id: 5956795bc9e2c415eb244de1
 title: Хеш-приєднання
-challengeType: 5
+challengeType: 1
 forumTopicId: 302284
 dashedName: hash-join
 ---
 
 # --description--
 
-[ внутрішнє з'єднання ](https://www.freecodecamp.org/news/sql-join-types-inner-join-vs-outer-join-example/#how-to-use-an-inner-join-in-sql "news: SQL Join Types – Inner Join VS Outer Join Example#How to Use an INNER JOIN in SQL") — це операція, яка об'єднує дві таблиці даних в одну таблицю на основі відповідності значень стовпців. Найпростіший спосіб виконати цю операцію: [приєднання вкладеного циклу](https://en.wikipedia.org/wiki/Nested loop join "wp: Nested loop join")алгоритм, а більш масштабованою альтернативою є[хеш-приєднання](https://en.wikipedia.org/wiki/hash join "wp: hash join")алгоритм.
+An inner join is an operation that combines two data tables into one table, based on matching column values. The simplest way of implementing this operation is the nested loop join algorithm, but a more scalable alternative is the hash join algorithm.
 
 Алгоритм "хеш-приєднання" складається з двох кроків:
 
 <ol>
-  <li><strong>хеш фаза:</strong> Створіть <a href='https://en.wikipedia.org/wiki/Multimap' title='wp: Multimap' target='_blank'>,багатофункціональної карти</a> з однієї із двох таблиць, зіставляючи значення кожного стовпця до всіх рядків, що містять його.</li>
+  <li><strong>Hash phase:</strong> Create a multimap from one of the two tables, mapping from each join column value to all the rows that contain it.</li>
   <ul>
     <li>Багатофункціональна карта повинна підтримувати хеш пошук, який оцінює краще звичайного лінійного пошуку, оскільки це і є суть алгоритму.</li>
     <li>В ідеалі, ми створюємо мультимедійне відображення для меншої таблиці, таким чином мінімізуючи час створення та розмір пам'яті.</li>
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/heronian-triangles.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/heronian-triangles.md
index 7f23cf735a9..69b55cf67e7 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/heronian-triangles.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/heronian-triangles.md
@@ -1,14 +1,14 @@
 ---
 id: 595b98f8b5a2245e243aa831
 title: Трикутники Герона
-challengeType: 5
+challengeType: 1
 forumTopicId: 302285
 dashedName: heronian-triangles
 ---
 
 # --description--
 
-[Формула Герона](https://en.wikipedia.org/wiki/Heron's formula "wp: Heron's formula") для площі трикутника з урахуванням довжини його трьох сторін `a` `b`, та `c` подається як:
+Hero's formula for the area of a triangle given the length of its three sides `a`, `b`, and `c` is given by:
 
 $A = \\sqrt{s(s-a)(s-b)(s-c)},$
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
index 8fac9dbb92f..f4555b87d88 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
@@ -1,43 +1,35 @@
 ---
 id: 59622f89e4e137560018a40e
 title: Послідовність Хофштадтера
-challengeType: 5
+challengeType: 1
 forumTopicId: 302286
 dashedName: hofstadter-figure-figure-sequences
 ---
 
 # --description--
 
-Ці дві послідовності додатніх чисел визначаються як:
+The Hofstadter Figure-Figure sequences $R_n$ and $S_n$ are given by
 
-$R(1)=1\\ ;\\ S(1)=2 \\\\R(n)=R(n-1)+S(n-1), \\quad n>1.$
+$R_1 = 1\\ ;\\ S_1 = 2 \\\\R_n = R_{n-1} + S_{n-1}, \\quad n>1.$
 
-Послідовність $S(n)$ далі визначається як послідовність натуральних чисел, яких немає в $R(n)$.
-
-Послідовність $R$ запущена:
+Specifically, the sequence $R_n$ contains the values
 
 <pre>1, 3, 7, 12, 18, ...</pre>
 
-Послідовність $R$ запущена:
+and the sequence $S_n$ contains the values
 
 <pre>2, 4, 5, 6, 8, ...</pre>
 
+The sequence $R_n$ is defined by the recurrence relation $R_n = R_{n-1} + S_{n-1}$, while $S_n$ is defined as sequence of positive integers that are not included in the sequence $R_n$.
+
 # --instructions--
 
-Створіть 2 функції названі як `ffr` і `ffs` коли їм надають `n` повернення` R(n)` або ` S(n)` відповідно. (Зверніть увагу на те, щоб R(1) = 1 і S(1) = 2 уникати окремих помилок).
+Create two functions named `ffr` and `ffs` that return `R(n)` or `S(n)`, respectively, for any index `n`. Note that the Hofstadter Figure-Figure sequences are 1-indexed, with $R_1 = 1$ and $S_1 = 2$.
 
 Не слід припускати жодного максимального значення для ` n `.
 
-**Посилання**
+**Посилання**<p>Rosetta: <a href='https://rosettacode.org/wiki/Hofstadter_Figure-Figure_sequences' target='_blank'>Hofstadter Figure-Figure sequences</a></p>.
 
-<ul>
-  <li>
-    Sloane's <a href='https://oeis.org/A005228' target='_blank'>A005228</a> і <a href='https://oeis.org/A030124' target='_blank'>A030124</a>.
-  </li>
-  <li>
-    Вікіпедія: <a href='https://en.wikipedia.org/wiki/Hofstadter_sequence#Hofstadter_Figure-Figure_sequences' title='wp: Hofstadter_sequence#Hofstadter_Figure-Figure_sequences' target='_blank'> Послідовність Хофштадтера</a>.
-  </li>
-</ul>
 
 # --hints--
 
@@ -47,67 +39,67 @@ $R(1)=1\\ ;\\ S(1)=2 \\\\R(n)=R(n-1)+S(n-1), \\quad n>1.$
 assert(typeof ffr === 'function');
 ```
 
-`ffr` має бути функцією.
+`ffs` має бути функцією.
 
 ```js
 assert(typeof ffs === 'function');
 ```
 
-`ffr` повинен повернути ціле число.
+`ffr` should return integer.
 
 ```js
 assert(Number.isInteger(ffr(1)));
 ```
 
-`ffr` повинен повернути ціле число.
+`ffs` should return integer.
 
 ```js
 assert(Number.isInteger(ffs(1)));
 ```
 
-`ffr(10)` повинен повертатися `69`
+`ffr(10)` should return `69`
 
 ```js
 assert.equal(ffr(ffrParamRes[0][0]), ffrParamRes[0][1]);
 ```
 
-`ffr(50)` повинен повертатися ` 1509`
+`ffr(50)` should return `1509`
 
 ```js
 assert.equal(ffr(ffrParamRes[1][0]), ffrParamRes[1][1]);
 ```
 
-`ffr(100)` повинен повертатися ` 5764 `
+`ffr(100)` should return `5764`
 
 ```js
 assert.equal(ffr(ffrParamRes[2][0]), ffrParamRes[2][1]);
 ```
 
-`ffr(1000)` повинен повертатися ` 526334`
+`ffr(1000)` should return `526334`
 
 ```js
 assert.equal(ffr(ffrParamRes[3][0]), ffrParamRes[3][1]);
 ```
 
-`ffs(10)` повинен повертатися ` 14`
+`ffs(10)` should return `14`
 
 ```js
 assert.equal(ffs(ffsParamRes[0][0]), ffsParamRes[0][1]);
 ```
 
-`ffr(50)` повинен повертатися ` 59`
+`ffs(50)` should return `59`
 
 ```js
 assert.equal(ffs(ffsParamRes[1][0]), ffsParamRes[1][1]);
 ```
 
-`ffr(100)` повинен повертатися ` 112`
+`ffs(100)` should return `112`
 
 ```js
 assert.equal(ffs(ffsParamRes[2][0]), ffsParamRes[2][1]);
 ```
 
-`ffs(1000)` повинен повертатися ` 1041`
+`ffs(1000)` should return `1041`
 
 ```js
 assert.equal(ffs(ffsParamRes[3][0]), ffsParamRes[3][1]);
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
index af5a417220e..31957faac90 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
@@ -1,18 +1,18 @@
 ---
 id: 59637c4d89f6786115efd814
 title: Q послідовність Гофстедтера
-challengeType: 5
+challengeType: 1
 forumTopicId: 302287
 dashedName: hofstadter-q-sequence
 ---
 
 # --description--
 
-[Q послідовність Гофстедтера](https://en.wikipedia.org/wiki/Hofstadter_sequence#Hofstadter_Q_sequence "wp: Hofstadter_sequence#Hofstadter_Q_sequence") визначають як:
+The Hofstadter Q sequence is defined as:
 
 $Q(1)=Q(2)=1, \\\\ Q(n)=Q\\big(n-Q(n-1)\\big)+Q\\big(n-Q(n-2)), \\quad n>2.$
 
-Вона визначається як [послідовність Фібоначчі](https://rosettacode.org/wiki/Fibonacci sequence "Fibonacci sequence"), але в той час як наступний член у послідовності Фібоначчі - це сума попередніх двох членів, у послідовності Q попередні два члени вказують на те, як далеко треба повернутися назад в послідовності Q, щоб знайти два числа, які потрібно підсумувати, щоб утворити наступний член послідовності.
+It is defined like the Fibonacci sequence, but whereas the next term in the Fibonacci sequence is the sum of the previous two terms, in the Q sequence the previous two terms tell you how far to go back in the Q sequence to find the two numbers to sum to make the next term of the sequence.
 
 # --instructions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md
index 927b51e60b5..7adb0768db6 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7eb0
 title: 'І перед Е (виняток: окрім після С)'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302288
 dashedName: i-before-e-except-after-c
 ---
 
 # --description--
 
-Вираз ["I перед E, але не після C"](https://en.wikipedia.org/wiki/I before E except after C) - це загальновідомий мнемонічний вираз, який допомагає при написанні англійський слів.
+**<a href="http://www.rosettacode.org/wiki/I_before_E_except_after_C" target="_blank" rel="noopener noreferrer nofollow">"I before E, except after C"</a>** is a general rule for English language spelling. If one is unsure whether a word is spelled with the digraph `ei` or `ie`, the rhyme suggests that the correct order is `ie` unless the preceding letter is `c`, in which case it may be `ei`.
 
 Використовуючи надані слова, перевірте, чи два підпункти фрази переконливі окремо:
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/iban.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/iban.md
index 0de87832b73..c7f5162d2fe 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/iban.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/iban.md
@@ -1,19 +1,19 @@
 ---
 id: 5a23c84252665b21eecc7eaf
 title: IBAN
-challengeType: 5
+challengeType: 1
 forumTopicId: 302289
 dashedName: iban
 ---
 
 # --description--
 
-The [Міжнародний номер банківського рахунку (IBAN)](https://en.wikipedia.org/wiki/International_Bank_Account_Number) є міжнародно узгодженим засобом ідентифікації банківських рахунків через національні кордони зі зниженим ризиком розповсюдження [transcription errors](https://en.wikipedia.org/wiki/Transcription_error).
+The International Bank Account Number (IBAN) is an internationally agreed means of identifying bank accounts across national borders with a reduced risk of propagating transcription errors.
 
-IBAN містить до 34 літерно-цифрових символів:
+The <abbr title="International Bank Account Number">IBAN</abbr> consists of up to 34 alphanumeric characters:
 
 <ul>
-  <li>спочатку дволітерний код країни за стандартом ISO 3166-1 alpha-2</li>
+  <li>first the two-letter <abbr title="International Organization for Standardization">ISO</abbr> 3166-1 alpha-2 country code</li>
   <li>потім дві контрольні цифри, та</li>
   <li>нарешті, базовий номер банківського рахунку для конкретної країни (BBAN).</li>
 </ul>
@@ -95,10 +95,10 @@ function isValid(iban) {
     iban = __helpers.removeWhiteSpace(iban)
     if (!iban.match(/^[\dA-Z]+$/)) return false
     var len = iban.length
-    if (len != ibanLen[iban.substr(0,2)]) return false
-    iban = iban.substr(4) + iban.substr(0,4)
+    if (len != ibanLen[iban.substring(0,2)]) return false
+    iban = iban.substring(4) + iban.substring(0,4)
     for (var s='', i=0; i<len; i+=1) s+=parseInt(iban.charAt(i),36)
-    for (var m=s.substr(0,15)%97, s=s.substr(15); s; s=s.substr(13)) m=(m+s.substr(0,13))%97
+    for (var m=s.substring(0,15)%97, s=s.substring(15); s; s=s.substring(13)) m=(m+s.substring(0,13))%97
     return m == 1
 }
 ```
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/jortsort.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/jortsort.md
index 1b6122e2f2c..f33658543db 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/jortsort.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/jortsort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7ec4
 title: JortSort
-challengeType: 5
+challengeType: 1
 forumTopicId: 302293
 dashedName: jortsort
 ---
 
 # --description--
 
-jortSort — це набір інструментів для сортування, за допомогою яких користувач виконає роботу і гарантує ефективність, оскільки вам більше не доведеться сортувати. Вперше, його представила Дженн "Moneydollars" Шиффер на престижному [JSConf](https://www.youtube.com/watch?v=pj4U_W0OFoE).
+jortSort — це набір інструментів для сортування, за допомогою яких користувач виконає роботу і гарантує ефективність, оскільки вам більше не доведеться сортувати. It was originally presented by Jenn "Moneydollars" Schiffer at the prestigious JSConf2014.
 
 jortSort має бути функцією, яка бере в якості аргументу єдиний масив об'єктів, що можна порівняти. Потім він сортує масив у порядку зростання та порівнює відсортований масив з початковим масивом. Якщо масиви збігаються (тобто вихідний масив вже було відсортовано), функція повертає true. Якщо масиви не співпадають (наприклад, вихідний масив не було сортовано), функція повертає false.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/josephus-problem.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/josephus-problem.md
index 9790fe772b8..2dad6ad0620 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/josephus-problem.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/josephus-problem.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7ec5
 title: Задача Йосифа Флавія
-challengeType: 5
+challengeType: 1
 forumTopicId: 302294
 dashedName: josephus-problem
 ---
 
 # --description--
 
-[ Задача Йосифа Флавія](https://en.wikipedia.org/wiki/Josephus problem) це математична головоломка з похмурим описом: $n$ ув'язнені стоять у колі, послідовно пронумеровані від $0$ до $n-1$.
+Josephus problem is a math puzzle with a grim description: $n$ prisoners are standing on a circle, sequentially numbered from $0$ to $n-1$.
 
 Кат йде по колу, починаючи від ув’язненого $0$, виводить кожного $k$-го ув’язненого і вбиває його.
 
@@ -26,7 +26,7 @@ dashedName: josephus-problem
 
 # --instructions--
 
-Напишіть функцію, яка бере початкову кількість ув'язнених і "k" в якості параметра і повертає номер в'язня, який вижив.
+Write a function that takes the initial number of prisoners and `k` as parameters and returns the number of the prisoner that survives.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md
index e3515cb314a..464692f76f4 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc7eca
 title: Числа Капрекара
-challengeType: 5
+challengeType: 1
 forumTopicId: 302296
 dashedName: kaprekar-numbers
 ---
 
 # --description--
 
-Додатнє ціле число — це [число Капрекара](https://en.wikipedia.org/wiki/Kaprekar number), якщо:
+A positive integer is a Kaprekar number if:
 
 <ul>
   <li>Це 1, або</li>
@@ -21,7 +21,7 @@ dashedName: kaprekar-numbers
 
 <ul>
   <li><code>2223</code> це число Капрекар, оскільки <code>2223 * 2223 = 4941729</code> <code>4941729</code> може бути розділено на <code>494</code> та <code>1729</code>, та <code>494 + 1729 = 2223</code></li>
-  <li>Серія чисел Kaprekar відома як <a href='https://oeis.org/A006886' target='_blank'>A006886</a>, і починається <code>1, 9, 45, 55, ...</code></li>
+  <li>The series of Kaprekar numbers is known as A006886, and begins as <code>1, 9, 45, 55, ...</code></li>
 </ul>
 
 # --instructions--
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/knights-tour.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/knights-tour.md
index 90ff89ef076..3ecc7b97426 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/knights-tour.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/knights-tour.md
@@ -1,18 +1,18 @@
 ---
 id: 5a23c84252665b21eecc7ed5
 title: Задача про хід коня
-challengeType: 5
+challengeType: 1
 forumTopicId: 302297
 dashedName: knights-tour
 ---
 
 # --description--
 
-[Knight's Tour](https://en.wikipedia.org/wiki/Knight%27s_tour) Задача: У вас є порожня `w` \* `h` шахівниця з одним конем на якомусь полі. Кінь повинен виконати послідовність ходів таким чином, щоб побувати на кожному полі шахівниці лише раз. Зауважте, що йому *не* не обов'язково пройти весь маршрут, а отже кінь не повинен закінчити гру, зробивши один хід від початкової позиції.
+Knight's Tour Problem: You have an empty `width` \* `height` chessboard, but for a single knight on some square. Кінь повинен виконати послідовність ходів таким чином, щоб побувати на кожному полі шахівниці лише раз. Зауважте, що йому *не* не обов'язково пройти весь маршрут, а отже кінь не повинен закінчити гру, зробивши один хід від початкової позиції.
 
 # --instructions--
 
-Напишіть функцію, яка бере `w` і `h` як параметри й повертає кількість початкових позицій звідти, де можливо виконати завдання, про яке йшлося вище.
+Write a function that takes `width` and `height` as parameters and returns the number of initial positions from where it is possible to achieve the task stated above.
 
 # --hints--
 
@@ -63,7 +63,7 @@ assert.equal(knightTour(8, 6), 48);
 ## --seed-contents--
 
 ```js
-function knightTour(w, h) {
+function knightTour(width, height) {
 
 }
 ```
@@ -71,7 +71,7 @@ function knightTour(w, h) {
 # --solutions--
 
 ```js
-function knightTour(w, h) {
+function knightTour(width, height) {
   function createBoards(rows, columns) {
     const board = [];
     const visited = [];
@@ -210,11 +210,11 @@ function knightTour(w, h) {
     [1, -2]
   ];
 
-  const [baseBoard, baseVisited] = createBoards(h, w);
+  const [baseBoard, baseVisited] = createBoards(height, width);
   fillAllowedMovesCounts(baseBoard);
   let solvedCount = 0;
-  for (let row = 0; row < h; row++) {
-    for (let column = 0; column < w; column++) {
+  for (let row = 0; row < height; row++) {
+    for (let column = 0; column < width; column++) {
       if (solveStart(baseBoard, baseVisited, row, column)) {
         solvedCount++;
       }
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/least-common-multiple.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/least-common-multiple.md
index 499eab02e21..1573d2e7b24 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/least-common-multiple.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/least-common-multiple.md
@@ -1,18 +1,20 @@
 ---
 id: 5a23c84252665b21eecc7edf
 title: Найменше спільне кратне
-challengeType: 5
+challengeType: 1
 forumTopicId: 302301
 dashedName: least-common-multiple
 ---
 
 # --description--
 
-Найменше спільне кратне 12 та 18 це 36, оскільки 12 - коефіцієнт (12 × 3 = 36), та 18 - коефіцієнт (18 × 2 = 36), і немає цілого додатного числа менше ніж 36, яке мало б обидва коефіцієнти. В окремому випадку, якщо *m* або *n* дорівнює нулю, то найменше спільне кратне дорівнює нулю. Одним зі способів обчислення найменшого спільного кратного є повторення всіх кратних *m*, доки не буде знайдено таке, що є кратним *n*. Якщо у вас вже є *gcd* для [greatest common divisor](https://rosettacode.org/wiki/greatest common divisor), в такому випадку ця формула вираховує *lcm*. ( \\operatorname{lcm}(m, n) = \\frac{|m \\times n|}{\\operatorname{gcd}(m, n)} )
+Найменше спільне кратне 12 та 18 це 36, оскільки 12 - коефіцієнт (12 × 3 = 36), та 18 - коефіцієнт (18 × 2 = 36), і немає цілого додатного числа менше ніж 36, яке мало б обидва коефіцієнти. As a special case, if either $m$ or $n$ is zero, then the least common multiple is zero. One way to calculate the least common multiple is to iterate all the multiples of $m$, until you find one that is also a multiple of $n$. If you already have $gcd$ for <a href="https://rosettacode.org/wiki/Greatest_common_divisor" target="_blank" rel="noopener noreferrer nofollow">greatest common divisor</a>, then this formula calculates $lcm$.
+
+$$ \\operatorname{lcm}(m, n) = \\frac{|m \\times n|}{\\operatorname{gcd}(m, n)} $$
 
 # --instructions--
 
-Обчисліть найменше спільне кратне масиву цілих чисел. З огляду на значення *m* та *n*, найменше спільне кратне - це найменше позитивне ціле число, яке має як *m*, так і *n* у якості факторів.
+Compute the least common multiple of an array of integers. Given *m* and *n*, the least common multiple is the smallest positive integer that has both *m* and *n* as factors.
 
 # --hints--
 
@@ -22,7 +24,7 @@ dashedName: least-common-multiple
 assert(typeof LCM == 'function');
 ```
 
-`LCM([2, 4, 8])` має повернути число.
+`LCM([2, 4, 8])` має повертати число.
 
 ```js
 assert(typeof LCM([2, 4, 8]) == 'number');
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/levenshtein-distance.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/levenshtein-distance.md
index fba6b041ab6..4abbdd95a2b 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/levenshtein-distance.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/levenshtein-distance.md
@@ -1,14 +1,14 @@
 ---
 id: 5e4ce2eaac708cc68c1df260
 title: Відстань Левенштейна
-challengeType: 5
+challengeType: 1
 forumTopicId: 385264
 dashedName: levenshtein-distance
 ---
 
 # --description--
 
-У інформаційній теорії та комп'ютерних науках **відстань Левенштейна** — це [метрика](https://en.wikipedia.org/wiki/string metric), яка вимірює відмінність між двома послідовностями (тобто [відстань редагування](https://en.wikipedia.org/wiki/edit distance)). Відстань Левенштейна між двома рядками визначається як мінімальна кількість операцій вставки, видалення або заміни, необхідних для перетворення одного рядка в інший.
+In information theory and computer science, the **Levenshtein distance** is a metric for measuring the amount of difference between two sequences (i.e. an edit distance). Відстань Левенштейна між двома рядками визначається як мінімальна кількість операцій вставки, видалення або заміни, необхідних для перетворення одного рядка в інший.
 
 Наприклад:
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
index f2501e363a7..b834d3ed4bd 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
@@ -1,14 +1,14 @@
 ---
 id: 5e4ce2f5ac708cc68c1df261
 title: Лінійний конгруентний метод
-challengeType: 5
+challengeType: 1
 forumTopicId: 385266
 dashedName: linear-congruential-generator
 ---
 
 # --description--
 
-[Лінійний конгруентний метод](https://en.wikipedia.org/wiki/linear congruential generator) є дуже простим прикладом [генератора випадкових чисел](http://rosettacode.org/wiki/random number generator). Усі лінійні конгруентні генератори працюють за формулою:
+A linear congruential generator (LCG) is an <em>algorithm</em> that yields a sequence of pseudo-randomized numbers calculated with a discontinuous piecewise linear equation. Усі лінійні конгруентні генератори працюють за формулою:
 
 $$r_{n + 1} = (a \times r_n + c) \bmod m$$
 
@@ -22,7 +22,7 @@ $$r_{n + 1} = (a \times r_n + c) \bmod m$$
 
 Якщо уважно вибирати значення $a$, $c$ і $m$, то генератор створює рівномірний розподіл цілих чисел від $0$ до $m - 1$.
 
-Згенеровані алгоритмом числа неякісні. $r_n$ та $r\_{n + 1}$ не є незалежними, як справжні випадкові числа. Знаючи $r_n$, можна передбачити $r\_{n + 1}$, тому лінійний конгруентний метод не є криптографічно стійким. Лінійний конгруентний метод добре підходить для простих завдань, наприклад для [Miller-Rabin primality test](http://rosettacode.org/wiki/Miller-Rabin primality test) або [FreeCell deals](http://rosettacode.org/wiki/deal cards for FreeCell). Перевагою цього методу є те, що можна легко відтворити послідовність чисел з того самого $r_0$. Можна також відтворити таку послідовність за допомогою іншої мови програмування, оскільки формула дуже проста.
+<abbr title="linear congruential generator">LCG</abbr> numbers have poor quality. $r_n$ та $r\_{n + 1}$ не є незалежними, як справжні випадкові числа. Anyone who knows $r_n$ can predict $r\_{n + 1}$, therefore <abbr title="linear congruential generator">LCG</abbr> is not cryptographically secure. The <abbr title="linear congruential generator">LCG</abbr> is still good enough for simple tasks like Miller-Rabin primality test, or FreeCell deals. Among the benefits of the <abbr title="linear congruential generator">LCG</abbr>, one can easily reproduce a sequence of numbers, from the same $r_0$. Можна також відтворити таку послідовність за допомогою іншої мови програмування, оскільки формула дуже проста.
 
 # --instructions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/long-multiplication.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/long-multiplication.md
index a75c89c3158..26ce73fe4dc 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/long-multiplication.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/long-multiplication.md
@@ -1,14 +1,14 @@
 ---
 id: 5e4ce2a1ac708cc68c1df25d
 title: Множення в стовпчик
-challengeType: 5
+challengeType: 1
 forumTopicId: 385269
 dashedName: long-multiplication
 ---
 
 # --description--
 
-Без сумніву застосовуйте [множення в стовпчик](https://en.wikipedia.org/wiki/long multiplication).
+Explicitly implement long multiplication.
 
 Це один з можливих підходів у довгій арифметиці.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
index 5d42134cb40..58989d428f1 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
@@ -1,72 +1,66 @@
 ---
 id: 5e6dd1278e6ca105cde40ea9
 title: Найдовша спільна підпослідовність
-challengeType: 5
+challengeType: 1
 forumTopicId: 385271
 dashedName: longest-common-subsequence
 ---
 
 # --description--
 
-** Найдовша спільна підпослідовність**([**LCS**](http://en.wikipedia.org/wiki/Longest_common_subsequence_problem)) груп А і В - це найдовша група спільних елементів між двома групами, які розташовані в однаковому порядку в кожній групі. Наприклад, послідовності "1234" і "1224533324" мають LCS "1234":
+The **longest common subsequence** (or **LCS**) of groups A and B is the longest group of elements from A and B that are common between the two groups and in the same order in each group. For example, the sequences `1234` and `1224533324` have an LCS of `1234`:<u>1234</u>
+<u>12</u>245<u>3</u>332<u>4</u>
 
-***1234***
+For a string example, consider the sequences `thisisatest` and `testing123testing`. An LCS would be `tsitest`:
+<u>t</u>hi<u>si</u>sa<u>test</u>
 
-***12***245***3***332***4***
+<u>t</u>e<u>s</u>t<u>i</u>ng123<u>test</u>ing.
 
-На прикладі рядка розглянемо послідовності "thisisatest" та "testing123testing". LCS буде "tsitest":
-
-***t***hi***si***sa***test***
-
-***t***e***s***t***i***ng123***test***ing.
-
-Ваш код має складатися тільки з рядків.
-
-Для отримання додаткової інформації про це завдання, будь ласка, дивіться [Wikipedia](https://en.wikipedia.org/wiki/Longest_common_subsequence_problem).
+Your code only needs to deal with strings.
 
 # --instructions--
 
-Напишіть чутливу до регістру символів функцію, яка повертає LCS двох рядків. Вам не потрібно показувати багато LCS.
+Write a case-sensitive function that returns the LCS of two strings. You don't need to show multiple LCS's.
 
 # --hints--
 
-`lcs` повинен бути функцією.
+`lcs` має бути функцією.
 
 ```js
 assert(typeof lcs == 'function');
 ```
 
-`lcs("thisisatest", "testing123testing")` повинен вивести рядок.
+`lcs("thisisatest", "testing123testing")` should return a string.
 
 ```js
 assert(typeof lcs('thisisatest', 'testing123testing') == 'string');
 ```
 
-`lcs("thisisatest", "testing123testing")` повинен повернути `"tsitest"`.
+`lcs("thisisatest", "testing123testing")` should return `"tsitest"`.
 
 ```js
 assert.equal(lcs('thisisatest', 'testing123testing'), 'tsitest');
 ```
 
-`lcs("ABCDGH", "AEDFHR")` повинен повернути `"ADH"`.
+`lcs("ABCDGH", "AEDFHR")` should return `"ADH"`.
 
 ```js
 assert.equal(lcs('ABCDGH', 'AEDFHR'), 'ADH');
 ```
 
-`lcs("AGGTAB", "GXTXAYB")` повинен повернути `"GTAB"`.
+`lcs("AGGTAB", "GXTXAYB")` should return `"GTAB"`.
 
 ```js
 assert.equal(lcs('AGGTAB', 'GXTXAYB'), 'GTAB');
 ```
 
-`lcs("BDACDB", "BDCB")` повинен повернути `"BDCB"`.
+`lcs("BDACDB", "BDCB")` should return `"BDCB"`.
 
 ```js
 assert.equal(lcs('BDACDB', 'BDCB'), 'BDCB');
 ```
 
-`lcs("ABAZDC", "BACBAD")` повинен повернути `"ABAD"`.
+`lcs("ABAZDC", "BACBAD")` should return `"ABAD"`.
 
 ```js
 assert.equal(lcs('ABAZDC', 'BACBAD'), 'ABAD');
@@ -86,8 +80,8 @@ function lcs(a, b) {
 
 ```js
 function lcs(a, b) {
-  var aSub = a.substr(0, a.length - 1);
-  var bSub = b.substr(0, b.length - 1);
+  var aSub = a.substring(0, a.length - 1);
+  var bSub = b.substring(0, b.length - 1);
 
   if (a.length === 0 || b.length === 0) {
     return '';
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md
index 54189af8088..84cf99d9e36 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md
@@ -1,7 +1,7 @@
 ---
 id: 5e6dd139859c290b6ab80292
 title: Задача про найдовшу зростаючу підпослідовність
-challengeType: 5
+challengeType: 1
 forumTopicId: 385272
 dashedName: longest-increasing-subsequence
 ---
@@ -12,19 +12,19 @@ dashedName: longest-increasing-subsequence
 
 Для наступного масиву:
 
-$\\{3, 10, 2, 1, 20\\}$
+```js
+const array = [3, 10, 2, 1, 20];
+```
 
-Найдовша зростаюча підпослідовність:
+Longest increasing sequence is:
 
 $\\{3, 10, 20\\}$
 
-Для отримання додаткової інформації про цю задачу, будь ласка, перейдіть за посиланням [Wikipedia](https://en.wikipedia.org/wiki/Longest increasing subsequence).
-
 # --instructions--
 
-Напишіть функцію, яка приймає масив чисел як параметр і виводить найдовшу зростаючу послідовність.
+Write a function that takes an array of numbers as a parameter and returns the longest increasing subsequence.
 
-Гарантовано, що кожен масив матиме найдовшу зростаючу послідовність.
+It is guaranteed that every array will have a longest increasing subsequence.
 
 # --hints--
 
@@ -34,31 +34,31 @@ $\\{3, 10, 20\\}$
 assert(typeof findSequence == 'function');
 ```
 
-`findSequence([3, 10, 2, 1, 20])` повинен видати масив.
+`findSequence([3, 10, 2, 1, 20])` should return a array.
 
 ```js
 assert(Array.isArray(findSequence([3, 10, 2, 1, 20])));
 ```
 
-`findSequence([3, 10, 2, 1, 20])` повинен видати `[3, 10, 20]`.
+`findSequence([3, 10, 2, 1, 20])` should return `[3, 10, 20]`.
 
 ```js
 assert.deepEqual(findSequence([3, 10, 2, 1, 20]), [3, 10, 20]);
 ```
 
-`findSequence([2, 7, 3, 5, 8])` повинен видати `[2, 3, 5, 8]`.
+`findSequence([2, 7, 3, 5, 8])` should return `[2, 3, 5, 8]`.
 
 ```js
 assert.deepEqual(findSequence([2, 7, 3, 5, 8]), [2, 3, 5, 8]);
 ```
 
-`findSequence([2, 6, 4, 5, 1])` повинен видати `[2, 4, 5]`.
+`findSequence([2, 6, 4, 5, 1])` should return `[2, 4, 5]`.
 
 ```js
 assert.deepEqual(findSequence([2, 6, 4, 5, 1]), [2, 4, 5]);
 ```
 
-`findSequence([10, 22, 9, 33, 21, 50, 60, 80])` повинен видати `[10, 22, 33, 50, 60, 80]`.
+`findSequence([10, 22, 9, 33, 21, 50, 60, 80])` should return `[10, 22, 33, 50, 60, 80]`.
 
 ```js
 assert.deepEqual(findSequence([10, 22, 9, 33, 21, 50, 60, 80]), [
@@ -71,7 +71,7 @@ assert.deepEqual(findSequence([10, 22, 9, 33, 21, 50, 60, 80]), [
 ]);
 ```
 
-`findSequence([0, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15])` повинен видати `[0, 2, 6, 9, 11, 15`.
+`findSequence([0, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15])` should return `[0, 2, 6, 9, 11, 15`.
 
 ```js
 assert.deepEqual(
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/longest-string-challenge.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/longest-string-challenge.md
index b47912d765e..2bc8e9345c2 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/longest-string-challenge.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/longest-string-challenge.md
@@ -1,7 +1,7 @@
 ---
 id: 5e6dd14192286d95fc43046e
 title: Завдання найдовшого рядка
-challengeType: 5
+challengeType: 1
 forumTopicId: 385275
 dashedName: longest-string-challenge
 ---
@@ -28,7 +28,7 @@ assert(typeof longestString == 'function');
 assert(Array.isArray(longestString(['a', 'bb', 'ccc', 'ee', 'f', 'ggg'])));
 ```
 
-`longestString(["a", "bb", "ccc", "ee", "f", "ggg"])` має повернути масив `["ccc", "ggg"]'`.
+`longestString(["a", "bb", "ccc", "ee", "f", "ggg"])` should return `["ccc", "ggg"]`.
 
 ```js
 assert.deepEqual(longestString(['a', 'bb', 'ccc', 'ee', 'f', 'ggg']), [
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md
index e7069e9a05c..d077d5a3c5f 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md
@@ -1,14 +1,14 @@
 ---
 id: 5e6dd14797f5ce267c2f19d0
 title: Послідовність "подивися-і-скажи"
-challengeType: 5
+challengeType: 1
 forumTopicId: 385277
 dashedName: look-and-say-sequence
 ---
 
 # --description--
 
-[Послідовність "подивися-і-скажи" ](https://en.wikipedia.org/wiki/Look and say sequence) - це рекурсивна послідовність певних чисел.
+The Look and say sequence is a recursively defined sequence of numbers.
 
 Визначення послідовності
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/lu-decomposition.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/lu-decomposition.md
index ba8fdd0cc5b..340010f0eee 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/lu-decomposition.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/lu-decomposition.md
@@ -1,20 +1,20 @@
 ---
 id: 5e6decd8ec8d7db960950d1c
 title: LU-розклад матриці
-challengeType: 5
+challengeType: 1
 forumTopicId: 385280
 dashedName: lu-decomposition
 ---
 
 # --description--
 
-Кожну квадратну матрицю $A$ можна розкласти на добуток з нижньої трикутної матриці $L$ та верхньої трикутної матриці $U$, як описано у [LU decomposition](https://en.wikipedia.org/wiki/LU decomposition).
+Every square matrix $A$ can be decomposed into a product of a lower triangular matrix $L$ and a upper triangular matrix $U$. This is known as the LU decomposition.
 
 $A = LU$
 
 Таке представлення матриці є модифікованим методом Гауса.
 
-В той час як [розклад Холецького](http://rosettacode.org/wiki/Cholesky decomposition) тільки працює для симетричних, позитивно-визначених матриць, загальніший LU-розклад матриці працює для будь-якої квадратної матриці.
+While the Cholesky decomposition only works for symmetric, positive definite matrices, the more general LU decomposition works for any square matrix.
 
 Існують декілька алгоритмів для розрахунку $L$ та $U$.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/ludic-numbers.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/ludic-numbers.md
index 20d44872fbb..0aa79dffa1a 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/ludic-numbers.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/ludic-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 5ea281203167d2b0bdefca00
 title: Ігрові числа
-challengeType: 5
+challengeType: 1
 forumTopicId: 385282
 dashedName: ludic-numbers
 ---
 
 # --description--
 
-[Ігрові числа](https://oeis.org/wiki/Ludic_numbers) пов'язані з простими числами, бо вони генеруються за допомогою фільтру, так само як [ Решето Ератосфена](https://rosettacode.org/wiki/Sieve_of_Eratosthenes) використовується для генерації простих чисел.
+Ludic numbers are related to prime numbers as they are generated by a sieve quite like the Sieve of Eratosthenes is used to generate prime numbers.
 
 Перше ігрове число - це 1.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md
index dc2876a22ff..e319451dc5b 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 5ea28156e79528a9ab248f27
 title: Тест Луна для визначення номерів кредитних карток
-challengeType: 5
+challengeType: 1
 forumTopicId: 385284
 dashedName: luhn-test-of-credit-card-numbers
 ---
 
 # --description--
 
-Тест [Луна](https://en.wikipedia.org/wiki/Luhn algorithm) використовується деякими компаніями, які мають справу з кредитними картками, для того, щоб відрізнити дійсні номери кредитних карток від випадкового набору цифр.
+The Luhn test is used by some credit card companies to distinguish valid credit card numbers from what could be a random selection of digits.
 
 Ті компанії, які використовують номери кредитних карток, котрі можна перевірити за допомогою тесту Луна, мають номери, які проходять наступний тест:
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/lzw-compression.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/lzw-compression.md
index 1addd49d838..9df0e99ba15 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/lzw-compression.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/lzw-compression.md
@@ -1,7 +1,7 @@
 ---
 id: 5ea2815e364d9a2222ea55f8
 title: LZW компресія
-challengeType: 5
+challengeType: 1
 forumTopicId: 385288
 dashedName: lzw-compression
 ---
@@ -10,11 +10,9 @@ dashedName: lzw-compression
 
 Алгоритм Лемпеля-Зіва-Велча (LZW) забезпечує стискання даних без втрат.
 
-Детальніше про алгоритм можна прочитати у [статті ](https://en.wikipedia.org/wiki/Lempel-Ziv-Welch) Вікіпедія.
-
 # --instructions--
 
-Напишіть функцію, яка бере два параметри. Перший параметр - логічне значення, де `true`позначає стиснути та `false`позначає розвернути. Другий параметр - це рядок або масив для обробки. Якщо це рядок для стиснення, поверніть масив чисел. Якщо це масив чисел для розгортання, поверніть рядок.
+Write a function that takes two parameters. The first parameter is a boolean where `true` indicates compress and `false` indicates decompress. The second parameter is either a string or an array to be processed. If it is a string to be compressed, return an array of numbers. If it's an array of numbers to be decompressed, return a string.
 
 # --hints--
 
@@ -24,7 +22,7 @@ dashedName: lzw-compression
 assert(typeof LZW === 'function');
 ```
 
-`LZW(true, "TOBEORNOTTOBEORTOBEORNOT")` має повернути рядок.
+`LZW(true, "TOBEORNOTTOBEORTOBEORNOT")` має повернути масив.
 
 ```js
 assert(Array.isArray(LZW(true, 'TOBEORNOTTOBEORTOBEORNOT')));
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/s-expressions.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/s-expressions.md
index 843591b52d5..0e7565ef57d 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/s-expressions.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/s-expressions.md
@@ -1,14 +1,14 @@
 ---
 id: 59667989bf71cf555dd5d2ff
 title: S-вирази
-challengeType: 5
+challengeType: 1
 forumTopicId: 302303
 dashedName: s-expressions
 ---
 
 # --description--
 
-[S-вирази](https://en.wikipedia.org/wiki/S-Expression "wp: S-Expression") - це зручний спосіб для аналізу та зберігання даних.
+<a href="https://rosettacode.org/wiki/S-expressions" target="_blank" rel="noopener noreferrer nofollow">S-Expressions</a> are one convenient way to parse and store data.
 
 # --instructions--
 
@@ -32,7 +32,7 @@ dashedName: s-expressions
 (data (!@# (4.5) "(more" "data)")))
 </pre>
 
-і перетворити його на початкову структуру даних. (Дивіться [Pike](https://rosettacode.org/wiki/S-Expressions#Pike "\#Pike"), [Python](https://rosettacode.org/wiki/S-Expressions#Python "\#Python") and [Ruby](https://rosettacode.org/wiki/S-Expressions#Ruby "\#Ruby") implementations задля прикладів початкових структур даних.)
+and turn it into a native data structure.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
index 276928a7502..5af907f9585 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
@@ -1,23 +1,24 @@
 ---
 id: 59da22823d04c95919d46269
 title: 'Задача про моряків, кокоси та мавп'
-challengeType: 5
+challengeType: 1
 forumTopicId: 302304
 dashedName: sailors-coconuts-and-a-monkey-problem
 ---
 
 # --description--
 
-П'ять моряків розбилися на острові і назбирали велику купу кокосів протягом дня. Тієї ночі перший моряк прокидається і вирішує завчасно взяти свою першу частку, тому намагається поділити купки з кокосами порівно на п'ять маленьких частин, але дізнається, що залишається один кокос, тому він кидає його мавпі і потім ховає "свій" в один із п'яти однакових за розміром куп з кокосами і зіштовхує інші чотири купи разом для того, щоб знову утворити єдину видиму купу з кокосами і йде спати. Коротше кажучи, кожний моряк один раз встає протягом ночі і виконує ті ж самі дії: ділить купу кокосів на 5 частин, знаходить один кокос, що залишився, і віддає його мавпі. Вранці( після спантеличених та окремих вчинків кожного з п'яти моряків протягом ночі), кокоси, що залишилися були поділені на п'ять однакових куп для кожного з моряків, після чого виявилося, що вони поділені порівно серед моряків без залишку. (Зранку нічого не залишилось для мавпи.)
+Five sailors are shipwrecked on an island and collect a large pile of coconuts during the day.
+
+That night the first sailor wakes up and decides to take his first share early so tries to divide the pile of coconuts equally into five piles but finds that there is one coconut left over, so he tosses it to a monkey and then hides "his" one of the five equally sized piles of coconuts and pushes the other four piles together to form a single visible pile of coconuts again and goes to bed.
+
+To cut a long story short, each of the sailors in turn gets up once during the night and performs the same actions of dividing the coconut pile into five, finding that one coconut is left over and giving that single remainder coconut to the monkey, then push the other four piles together to form a single pile.
+
+In the morning (after the surreptitious and separate action of each of the five sailors during the night), the remaining coconuts are divided into five equal piles for each of the sailors, whereupon it is found that the pile of coconuts divides equally amongst the sailors with no remainder. (Nothing for the monkey in the morning.)
 
 # --instructions--
 
-Створіть функцію, що повертає мінімальний можливий розмір початкової купи з кокосами, зібраної протягом дня для `N` моряків. **Зверніть увагу:** Звичайно, у світі розповідаються казки про збирання будь-якої кількості кокосових горіхів за день і множинні поділи купи, тощо, можуть виникнути у час, який відповідає сюжетній лінії, щоб таким чином не впливати на математику. **Подивіться також:**
-
-<ul>
-  <li><a href="https://www.youtube.com/watch?v=U9qU20VmvaU" target="_blank">Мавпи і кокоси - Numberphile</a>(Відео) Аналітичне рішення.</li>
-  <li><a href="https://oeis.org/A002021" target="_blank">A002021 Задача про купи з коксами</a> Енциклопедія цінової послідовності цілих чисел. (Хоча деякі з цих посилань можуть використовувати альтернативну форму казки).</li>
-</ul>
+Create a function that returns the minimum possible size of the initial pile of coconuts collected during the day for `N` sailors. **Note:** Of course the tale is told in a world where the collection of any number of coconuts in a day and multiple divisions of the pile, etc. can occur in time fitting the story line, so as not to affect mathematics.
 
 # --hints--
 
@@ -39,7 +40,7 @@ assert(splitCoconuts(5) === 3121);
 assert(splitCoconuts(6) === 233275);
 ```
 
-`splitCoconuts(7)`має повернути 823537.
+`splitCoconuts(7)` має повернути 823537.
 
 ```js
 assert(splitCoconuts(7) === 823537);
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sedols.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sedols.md
index 74c8acecc81..e12d92908de 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sedols.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sedols.md
@@ -1,14 +1,16 @@
 ---
 id: 59d9c6bc214c613ba73ff012
 title: SEDOLs (списки ідентифікаційних кодів цінних паперів)
-challengeType: 5
+challengeType: 1
 forumTopicId: 302305
 dashedName: sedols
 ---
 
 # --description--
 
-Для кожного списку чисел з 6-цифрових [SEDOL](https://en.wikipedia.org/wiki/SEDOL "wp: SEDOL")s, порахуйте та додайте цифру контрольної суми. Тобто, враховуючи вхідний рядок зліва, ваша функція повинна повернутися відповідним рядком справа:
+<abbr title="Stock Exchange Daily Official List">SEDOL</abbr> is a list of securities identification numbers issued by the London Stock Exchange.
+
+For each number list of 6-digit <abbr title="Stock Exchange Daily Official List">SEDOL</abbr>s, calculate and append the checksum digit. That is, given the input string on the left, your function should return the corresponding string on the right:
 
 <pre>
 710889 => 7108899
@@ -24,7 +26,7 @@ B0YBKT => B0YBKT7
 B00030 => B000300
 </pre>
 
-Перевірте, щоб кожне введення було правильно сформовано, особливо стосовно допустимих символів, дозволених у рядку SEDOL. Ваша функція повинна повернути `null` на недопустиме введення.
+Check that each input is correctly formed, especially with respect to valid characters allowed in a SEDOL string. Your function should return `null` on an invalid input.
 
 # --hints--
 
@@ -34,25 +36,25 @@ B00030 => B000300
 assert(typeof sedol === 'function');
 ```
 
-`sedol('a')` має повернутись нулем.
+`sedol('a')` should return null.
 
 ```js
 assert(sedol('a') === null);
 ```
 
-`sedol('710889')` має повернути '7108899'.
+`sedol('710889')` should return '7108899'.
 
 ```js
 assert(sedol('710889') === '7108899');
 ```
 
-`sedol('BOATER')` має повернутись нулем.
+`sedol('BOATER')` should return null.
 
 ```js
 assert(sedol('BOATER') === null);
 ```
 
-`sedol('228276')` має повернути '2282765'.
+`sedol('228276')` should return '2282765'.
 
 ```js
 assert(sedol('228276') === '2282765');
@@ -64,8 +66,9 @@ assert(sedol('228276') === '2282765');
 
 ```js
 function sedol(input) {
+  const checkSum = 0
 
-  return true;
+  return checkSum;
 }
 ```
 
@@ -90,7 +93,7 @@ function sedolCheckDigit(char6) {
   for (let i = 0; i < char6.length; i++) {
     sum += weight[i] * parseInt(char6.charAt(i), 36);
   }
-  const check = (10 - (sum % 10)) % 10;
-  return check.toString();
+  const checkSum = (10 - (sum % 10)) % 10;
+  return checkSum.toString();
 }
 ```
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/self-describing-numbers.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
index b36c1cfd65f..dd95f976e48 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 5eaf48389ee512d4d103684b
 title: Самоописувальні числа
-challengeType: 5
+challengeType: 1
 forumTopicId: 385289
 dashedName: self-describing-numbers
 ---
 
 # --description--
 
-Існує декілька так званих "самоописів" або ["самоописувальних"](https://en.wikipedia.org/wiki/Self-descriptive_number) цілих чисел.
+There are several so-called "self-describing" or "self-descriptive" integers.
 
 Ціле число називають самоописувальним, якщо воно має такі властивості, коли розряд цифри позначений від 0 до N-1, а цифра в кожній позиції дорівнює тій кількості разів, за яку вона з'являється в числі.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/self-referential-sequence.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/self-referential-sequence.md
index 2e34735c854..387691d7708 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/self-referential-sequence.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/self-referential-sequence.md
@@ -1,14 +1,14 @@
 ---
 id: 5eb3e4a21f462f409d656c73
 title: Самовідносна послідовність
-challengeType: 5
+challengeType: 1
 forumTopicId: 385317
 dashedName: self-referential-sequence
 ---
 
 # --description--
 
-Існує декілька шляхів створення самовідносної послідовності. Найрозповсюдженішим([ Послідовність перегляду](https://rosettacode.org/wiki/Look-and-say sequence))є почати із додатного цілого числа, а потім створити наступну умову, об'єднавши перелічені групи суміжних однакових цифр:
+Існує декілька шляхів створення самовідносної послідовності. One very common one (the <a href="https://rosettacode.org/wiki/Look-and-say_sequence" target="_blank" rel="noopener noreferrer nofollow">Look-and-say sequence</a>) is to start with a positive integer, then generate the next term by concatenating enumerated groups of adjacent alike digits:
 
 <pre>0, 10, 1110, 3110, 132110, 1113122110, 311311222110 ...</pre>
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/semiprime.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/semiprime.md
index 49edd93797d..012793911b1 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/semiprime.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/semiprime.md
@@ -1,14 +1,14 @@
 ---
 id: 5eb3e4aa847216613aa81983
 title: Напівпросте число
-challengeType: 5
+challengeType: 1
 forumTopicId: 385318
 dashedName: semiprime
 ---
 
 # --description--
 
-Напівпрості числа - це натуральні числа, які є добутками рівно двох інших (можливо, рівних)[ простих чисел](https://rosettacode.org/wiki/prime_number).
+Semiprime numbers are natural numbers that are products of exactly two (possibly equal) <a href="https://rosettacode.org/wiki/prime_number" target="_blank" rel="noopener noreferrer nofollow">prime numbers</a>.
 
 <pre>1679  =  23 x 73</pre>
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sha-1.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sha-1.md
index da2bec813e9..74721d6b222 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sha-1.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sha-1.md
@@ -1,7 +1,7 @@
 ---
 id: 5eb3e4b5f629b9a07429a5d2
 title: SHA-1
-challengeType: 5
+challengeType: 1
 forumTopicId: 385326
 dashedName: sha-1
 ---
@@ -16,7 +16,7 @@ BitTorrent використовує SHA-1 для перевірки завант
 
 Git і Mercurial використовують дайджести SHA-1 для визначення комітів.
 
-Стандарт уряду США, [FIPS 180-1](https://rosettacode.org/wiki/SHA-1/FIPS-180-1), визначає SHA-1.
+A US government standard, <a href="https://rosettacode.org/wiki/SHA-1/FIPS-180-1" target="_blank" rel="noopener noreferrer nofollow">FIPS 180-1</a>, defines SHA-1.
 
 # --instructions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sort-stability.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sort-stability.md
index 4c2b91abc05..1c28cdc7171 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sort-stability.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sort-stability.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8014
 title: Стабільне сортування
-challengeType: 5
+challengeType: 1
 forumTopicId: 302308
 dashedName: sort-stability
 ---
 
 # --description--
 
-При сортуванні записів в таблиці за певним стовпцем або полем [стабільне сортування](https://en.wikipedia.org/wiki/Stable_sort#Stability) завжди зберігає відносний порядок записів з відповідним ключем.
+When sorting records in a table by a particular column or field, a <a href="https://www.freecodecamp.org/news/stability-in-sorting-algorithms-a-treatment-of-equality-fa3140a5a539/" target="_blank" rel="noopener noreferrer nofollow">stable sort</a> will always retain the relative order of records that have the same key.
 
 Наприклад, у цій таблиці країн і міст стабільне сортування в **другому** стовпці розташує Бірмінгем у США над Бірмінгемом у Великобританії серед міст. (Хоча нестабільне сортування *може* в цьому випадку розташувати Бірмінгем у США над Бірмінгемом у Великобританії, стабільна процедура сортування це *забезпечить*).
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md
index 0d953446364..ee8611a9b49 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md
@@ -1,20 +1,20 @@
 ---
 id: 5a23c84252665b21eecc8001
 title: Алгоритми сортування/Метод сортування намистин
-challengeType: 5
+challengeType: 1
 forumTopicId: 302310
 dashedName: sorting-algorithmsbead-sort
 ---
 
 # --description--
 
-Відсортуйте масив цілих натуральних чисел за допомогою [алгоритму сортування намистин](https://en.wikipedia.org/wiki/Bead_sort).
+A *bead sort* starts by creating a matrix of zeroes whose length is equal to the value of the largest element in the input array. The matrix is transformed by adding one to all elements between the zeroth index and the index indicated by the current element. This process is repeated, until you have filled the matrix.
 
-Метод *сортування намистин* також відомий як *гравітаційне сортування*.
+Iterating over the matrix, summing the number of elements greater than zero, then decreasing the value of each element by one yields the sorted array.
 
-Алгоритм містить O(S), де S – сума цілих чисел у вхідному наборі. Кожна намистина переміщається індивідуально.
+**Note:** Each element in the input array is unique.
 
-Це той випадок, коли сортування намистин реалізоване без механізму, який допомагає знаходити порожній простір під намистинами, як у реалізаціях програмних продуктів.
+Sort an array of positive integers using the Bead Sort Algorithm.
 
 # --hints--
 
@@ -90,31 +90,31 @@ function beadSort(arr) {
 
 ```js
 function beadSort(arr) {
-  var max = 0;
-  for (var i = 0; i < arr.length; i++) if (arr[i] > max) max = arr[i];
-  var grid = new Array(arr.length);
-  for (var i = 0; i < grid.length; i++) {
+  let max = 0;
+  for (let i = 0; i < arr.length; i++) if (arr[i] > max) max = arr[i];
+  const grid = new Array(arr.length);
+  for (let i = 0; i < grid.length; i++) {
     grid[i] = new Array(max);
   }
-  var levelcount = new Array(max);
+  const levelcount = new Array(max);
   levelcount.fill(0);
-  for (var i = 0; i < max; i++) {
+  for (let i = 0; i < max; i++) {
     levelcount[i] = 0;
-    for (var j = 0; j < arr.length; j++) grid[j][i] = '_';
+    for (let j = 0; j < arr.length; j++) grid[j][i] = '_';
   }
-  for (var i = 0; i < arr.length; i++) {
-    var num = arr[i];
-    for (var j = 0; num > 0; j++) {
+  for (let i = 0; i < arr.length; i++) {
+    let num = arr[i];
+    for (let j = 0; num > 0; j++) {
       grid[levelcount[j]++][j] = '*';
       num--;
     }
   }
-  var sorted = new Array(arr.length);
+  const sorted = new Array(arr.length);
   sorted.fill(0);
-  for (var i = 0; i < arr.length; i++) {
-    var putt = 0;
+  for (let i = 0; i < arr.length; i++) {
+    let putt = 0;
     for (
-      var j = 0;
+      let j = 0;
       j < max &&
       (function(c) {
         return c.charCodeAt == null ? c : c.charCodeAt(0);
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md
index 965dac8f188..3b9c449093e 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8002
 title: Алгоритми сортування/Випадкове сортування
-challengeType: 5
+challengeType: 1
 forumTopicId: 302311
 dashedName: sorting-algorithmsbogosort
 ---
 
 # --description--
 
-[випадкове сортування](https://en.wikipedia.org/wiki/Bogosort) – це список чисел.
+Bogosort a list of numbers.
 
 Випадкове сортування просто перемішує набір елементів випадковим чином, поки він не упорядкований.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
index 58afb5d47a9..cf5906b059b 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
@@ -1,36 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8004
 title: Алгоритми сортування/Шейкерне сортування
-challengeType: 5
+challengeType: 1
 forumTopicId: 302312
 dashedName: sorting-algorithmscocktail-sort
 ---
 
 # --description--
 
-Шейкерне сортування – це удосконалене [сортування бульбашкою](https://rosettacode.org/wiki/Bubble Sort). Покращення в основному полягає в тому, що значення "струменять" в обох напрямках через масив, тому що на кожній ітерації шейкер упорядковує бульбашки один раз вперед і один раз назад. Псевдокод для алгоритму (взято з [Вікіпедії](https://en.wikipedia.org/wiki/Cocktail sort)):
-
-<pre><b>function</b> <i>cocktailSort</i>( A : list of sortable items )
-  <b>do</b>
-    swapped := false
-    <b>for each</b> i <b>in</b> 0 <b>to</b> length( A ) - 2 <b>do</b>
-      <b>if</b> A[ i ] > A[ i+1 ] <b>then</b> <i>// перевірте, чи два елементи</i>
-                                <i>// знаходяться в неправильному</i>
-                                <i>// порядку</i>
-        swap( A[ i ], A[ i+1 ] ) <i>// поміняйте два елементи</i>
-                                 <i>// місцями</i>
-        swapped := true;
-    <b>if</b> swapped = false <b>then</b>
-      <i>// можна вийти із зовнішнього циклу тут, якщо жодних замін не відбулося.</i>
-      <b>break do-while loop</b>;
-    swapped := false
-    <b>for each</b> i <b>in</b> length( A ) - 2 <b>down to</b> 0 <b>do</b>
-      <b>if</b> A[ i ] > A[ i+1 ] <b>then</b>
-        swap( A[ i ], A[ i+1 ] )
-        swapped := true;
-  <b>while</b> swapped; <i>// якщо жодні елементи не помінялися місцями,</i>
-                <i>// сортування виконано</i>
-</pre>
+The <a href="https://rosettacode.org/wiki/Sorting_algorithms/Cocktail_sort" target="_blank" rel="noopener noreferrer nofollow">cocktail sort</a> is an improvement on the Bubble Sort. Given an array of numbers, the cocktail sort will traverse the array from start to finish, moving the largest number to the end. Then, it will traverse the array backwards and move the smallest number to the start. It repeats these two passes, moving the next largest/smallest number to its correct position in the array until it is sorted.
 
 # --instructions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
index 6f20f79f415..32579546931 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
@@ -1,7 +1,7 @@
 ---
 id: 5a23c84252665b21eecc8005
 title: Алгоритми сортування/Сортування гребінцем
-challengeType: 5
+challengeType: 1
 forumTopicId: 302313
 dashedName: sorting-algorithmscomb-sort
 ---
@@ -10,28 +10,22 @@ dashedName: sorting-algorithmscomb-sort
 
 Виконайте *сортування гребінцем*.
 
-**Сортування гребінцем** – це один з варіантів [сортування бульбашкою](https://rosettacode.org/wiki/Bubble Sort).
+The **Comb Sort** is a variant of the Bubble Sort.
 
-Як і [сортування Шелла](https://rosettacode.org/wiki/Shell sort), сортування гребінцем збільшує розрив, який використовується при порівняннях і обмінах.
+Like the Shell sort, the Comb Sort increases the gap used in comparisons and exchanges.
 
 Поділ розриву найкраще здійснити на $(1-e^{-\\varphi})^{-1} \\approx 1.247330950103979$, але значення 1.3 може бути практичнішим.
 
 Деякі реалізації використовують сортування включенням, коли розрив менший за певну величину.
 
-**Дивіться також**
+Variants:
 
 <ul>
-  <li>стаття Вікіпедії: <a href='https://en.wikipedia.org/wiki/Comb sort' target='_blank'>Сортування гребінцем</a>.</li>
+  <li>Combsort11 makes sure the gap ends in (11, 8, 6, 4, 3, 2, 1), which is significantly faster than the other two possible endings.</li>
+  <li>Combsort with different endings changes to a more efficient sort when the data is almost sorted (when the gap is small). Comb sort with a low gap isn't much better than the Bubble Sort.</li>
 </ul>
 
-Варіанти:
-
-<ul>
-  <li>Combsort11 забезпечує закінчення розриву на (11, 8, 6, 4, 3, 2, 1), що значно швидше, ніж два інших можливих закінчення.</li>
-  <li>Сортування гребінцем з різними закінченнями змінюється на ефективніше сортування, коли дані майже відсортовані (коли розрив невеликий). Сортування гребінцем з малим розривом не набагато краще, ніж сортування бульбашкою.</li>
-</ul>
-
-Псевдокод:
+Pseudocode:
 
 <pre><b>function</b> combsort(<b>array</b> input)
   gap := input<b>.size</b> <i>//встановити розмір розриву</i>
@@ -59,7 +53,7 @@ dashedName: sorting-algorithmscomb-sort
 
 # --instructions--
 
-Напишіть функцію, яка упорядкує даний масив, використовуючи сортування гребінцем.
+Write a function that sorts a given array using Comb sort.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
index 4b4f1f24260..2aabb3ecd1c 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8007
 title: Алгоритми сортування/Сортування гнома
-challengeType: 5
+challengeType: 1
 forumTopicId: 302314
 dashedName: sorting-algorithmsgnome-sort
 ---
 
 # --description--
 
-Сортування гнома – це алгоритм сортування, який схожий на [сортування вставленням](https://rosettacode.org/wiki/Insertion sort), за винятком того, що переміщення елемента в потрібне місце виконується послідовністю замін, як в [сортуванні бульбашкою](https://rosettacode.org/wiki/Bubble Sort).
+Gnome sort is a sorting algorithm which is similar to <a href="https://rosettacode.org/wiki/Insertion_sort" target="_blank" rel="noopener noreferrer nofollow">Insertion sort</a>, except that moving an element to its proper place is accomplished by a series of swaps, as in <a href="https://rosettacode.org/wiki/Bubble" target="_blank" rel="noopener noreferrer nofollow">Bubble Sort</a>.
 
 Псевдокод для алгоритму:
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md
index bc59dc9e3fc..89a81e13ac1 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc800b
 title: Алгоритми сортування/Млинцеве сортування
-challengeType: 5
+challengeType: 1
 forumTopicId: 302315
 dashedName: sorting-algorithmspancake-sort
 ---
 
 # --description--
 
-Напишіть функцію для сортування масиву цілих чисел (будь-якого зручного розміру) у порядку зростання за допомогою [млинцевого сортування](https://en.wikipedia.org/wiki/Pancake sorting). Функція має повернути впорядкований масив.
+Write a function to sort an array of integers (of any convenient size) into ascending order using Pancake sorting. Функція має повернути впорядкований масив.
 
 Коротко кажучи, замість сортування окремих елементів єдина дозволена операція – це «перевертання» одного кінця списку, наприклад:
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md
index e7bbb6282b1..51bfe779597 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8010
 title: Алгоритми сортування/Сортува́ння Ше́лла
-challengeType: 5
+challengeType: 1
 forumTopicId: 302317
 dashedName: sorting-algorithmsshell-sort
 ---
 
 # --description--
 
-Напишіть функцію для сортування масиву елементів за допомогою алгоритму [>сортування Шелла](https://en.wikipedia.org/wiki/Shell sort), сортування за зменшенням приросту. Функція має повернути впорядкований масив.
+Write a function to sort an array of elements using the Shell sort algorithm, a diminishing increment sort. Функція має повернути впорядкований масив.
 
 Сортування Шелла( також відомий як Шеллове сортування або метод Шелла) названо на честь винахідника Дональда Шелла, який опублікував алгоритм у 1959.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md
index a55fbbc3362..079e1f122be 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8012
 title: Алгоритми сортування/Сортування по частинах
-challengeType: 5
+challengeType: 1
 forumTopicId: 302318
 dashedName: sorting-algorithmsstooge-sort
 ---
 
 # --description--
 
-Напишіть функцію для виконання [ Сортування по частинах ](https://en.wikipedia.org/wiki/Stooge sort) для масиву цілих чисел. Функція має повернути впорядкований масив.
+Write a function to perform Stooge Sort on an array of integers. Функція має повернути впорядкований масив.
 
 Алгоритм сортування по частинах виглядає наступним чином:
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
index d5f86bbb5cc..34f401ff6b7 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
@@ -1,16 +1,28 @@
 ---
 id: 5a23c84252665b21eecc8013
 title: Алгоритми сортування/Ниткоподібне сортування
-challengeType: 5
+challengeType: 1
 forumTopicId: 302319
 dashedName: sorting-algorithmsstrand-sort
 ---
 
 # --description--
 
-Напишіть функцію для сортування масиву, використовуючи [Ниткоподібне сортування](https://en.wikipedia.org/wiki/Strand sort). Функція має повернути впорядкований масив.
+The **Strand sort** creates sorted subsets that are merged to create the final result.
+
+Consider an `unsortedArray = [3, 1, 4, 2]`. Pick the first item `3` and copy it into a separate array. Search for any bigger item following this item. When you find the a larger item, in this case `4`, copy it to the separate array, `[3, 4]`, and compare the following items to this new value, `4`.
+
+After you have reached the end of the array, remove the items you copied, `[3, 4]`, and start again with the first item remaining in the `unsortedArray`, in this case `1`.
+
+Following this process results in two sorted arrays, `[3, 4]` and `[1, 2]`. Merge these two arrays to create the `strandSortedArray`.
+
+```js
+const unsortedArray = [3, 1, 4, 2];
+const strandsortedArray = [1, 2, 3, 4];
+```
+
+Write a function to sort an array using the **Strand sort**. The function should return the sorted array.
 
-Це спосіб сортування чисел шляхом вилучення коротших послідовностей уже відсортованих чисел із несортованого списку.
 
 # --hints--
 
@@ -20,31 +32,31 @@ dashedName: sorting-algorithmsstrand-sort
 assert(typeof strandSort == 'function');
 ```
 
-`strandSort([25, 32, 12, 7, 20])` має повернути масив.
+`strandSort([25, 32, 12, 7, 20])` should return an array.
 
 ```js
 assert(Array.isArray(strandSort([25, 32, 12, 7, 20])));
 ```
 
-`strandSort([25, 32, 12, 7, 20])` має повернути `[7, 12, 20, 25, 32]`.
+`strandSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
 
 ```js
 assert.deepEqual(strandSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
 ```
 
-`strandSort([38, 45, 35, 8, 13])` має повернути `[8, 13, 35, 38, 45]`.
+`strandSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
 
 ```js
 assert.deepEqual(strandSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
 ```
 
-`strandSort([43, 36, 20, 34, 24])` має повернути `[20, 24, 34, 36, 43]`.
+`strandSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
 
 ```js
 assert.deepEqual(strandSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
 ```
 
-`strandSort([12, 33, 26, 18, 1, 16, 38])` має повернути `[1, 12, 16, 18, 26, 33, 38]`.
+`strandSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
 
 ```js
 assert.deepEqual(strandSort([12, 33, 26, 18, 1, 16, 38]), [
@@ -58,7 +70,7 @@ assert.deepEqual(strandSort([12, 33, 26, 18, 1, 16, 38]), [
 ]);
 ```
 
-`strandSort([3, 39, 48, 16, 1, 4, 29])` має повернути `[1, 3, 4, 16, 29, 39, 48]`.
+`strandSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
 
 ```js
 assert.deepEqual(strandSort([3, 39, 48, 16, 1, 4, 29]), [
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/soundex.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/soundex.md
index f47ac62b82a..5bb77e30279 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/soundex.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/soundex.md
@@ -1,14 +1,24 @@
 ---
 id: 5a23c84252665b21eecc8017
 title: Алгоритм Саундекс
-challengeType: 5
+challengeType: 1
 forumTopicId: 302320
 dashedName: soundex
 ---
 
 # --description--
 
-Саундекс — це алгоритм створення індексів для слів на основі їх вимови. Метою є кодування омофонів до одного представлення, щоб їх можна було зіставити, незважаючи на незначні відмінності у написанні (зі [статті у Вікіпедії](https://en.wikipedia.org/wiki/soundex)). Великою проблемою в багатьох реалізаціях є розрізнення приголосних із однаковим саундекс-кодом! Згідно з [ офіційними правилами](https://www.archives.gov/research/census/soundex.html). Тому перевірте, наприклад, чи **Ashcraft** закодовано як **A-261**.
+**Soundex Algorithm** deals with the *intentions* of the words. It creates a representation for similar sounding words.
+
+It is used for searching <em>names</em> and <em>addresses</em>. This means that the person who filled in the <em>name</em>, can focus on how it sounds instead of correcting the spelling of <em>names</em>.
+
+Наприклад:
+
+If you are hearing the name `Quenci` for the first time, and misspelled it, you will get **Soundex** code `Q520`.
+
+When you spell the name `Quincy` correctly next time, you will still get the same code `Q520`, which means you can link multiple name pronunciations into the same <em>person</em> without the need for adding every spelling.
+
+Ось правила: 
 
 <ul>
   <li>Якщо голосний (A, E, I, O, U) звук розділяє два приголосні, які мають однаковий саундекс-код, кодується приголосний праворуч від голосного. Tymczak кодується як T-522 (T, 5 замість M, 2 замість C, Z ігнорується (див. правило "Пліч-о-пліч" вище), 2 замість K). Оскільки голосний "A" розділяє літери Z та К, літера К кодується.</li>
@@ -17,7 +27,7 @@ dashedName: soundex
 
 # --instructions--
 
-Напишіть функцію, яка приймає рядок як параметр та повертає закодований рядок.
+Write a function that takes a string as a parameter and returns the encoded string.
 
 # --hints--
 
@@ -39,7 +49,7 @@ assert(typeof soundex('Soundex') == 'string');
 assert.equal(soundex('Soundex'), 'S532');
 ```
 
-`soundex("Example")`має повернути `"E251"`.
+`soundex("Example")` має повернути `"E251"`.
 
 ```js
 assert.equal(soundex('Example'), 'E251');
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/state-name-puzzle.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/state-name-puzzle.md
index dedd140a564..da2468a2898 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/state-name-puzzle.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/state-name-puzzle.md
@@ -1,18 +1,21 @@
 ---
 id: 5a23c84252665b21eecc8024
 title: Головоломка з назвами штатів
-challengeType: 5
+challengeType: 1
 forumTopicId: 302323
 dashedName: state-name-puzzle
 ---
 
 # --description--
 
-При створенні цього завдання надихалися DDJ колонкою Марка Нельсона "Wordplay" та однією з тижневих головоломок Вілла Шорца з вихідного випуску NPR [\[1\]](https://www.npr.org/templates/story/story.php?storyId=9264290) та спочатку приписували Девіду Едельгайту. Завдання полягало в тому, щоб взяти назви двох штатів США, поєднати їх, потім переставити літери так, щоб утворилися назви двох *різних* штатів США (щоб усі чотири назви штатів відрізнялися одна від одної). Які це штати? Проблема була знову опублікована на [the Unicon Discussion Web](https://tapestry.tucson.az.us/twiki/bin/view/Main/StateNamesPuzzle), який включає декілька розв'язків з аналізом. Декілька технік можуть допомогти і ви, можливо, захочете звернутися до [нумерації Геделя](https://en.wikipedia.org/wiki/Goedel_numbering), [відношення еквівалентності](https://en.wikipedia.org/wiki/Equivalence_relation), та [класів еквівалентності](https://en.wikipedia.org/wiki/Equivalence_classes). Базові переваги цього обговорювалися на Unicon Discussion Web. Також було представлено друге завдання у вигляді набору нових вигаданих штатів.
+**State name** is a <em>word puzzle</em> in which you take the letters from two U.S. state names and rearrange them to form the names of two different U.S. states.
+
 
 # --instructions--
 
-Напишіть функцію для розв'язання завдання для заданого масиву назв штатів. Функція має повернути масив. Кожен елемент має бути об'єктом у цьому вигляді: `{"from":[],"to":[]}`. Масив "from" повинен містити оригінальні назви, а масив "to" повинен містити отримані назви.
+Write a function to solve the challenge for a given array of actual U.S. state names, and for fictional state names.
+
+The function should return an array. Each element should be an object in this form: `{"from":[],"to":[]}`. The `"from"` array should contain the original names and the `"to"` array should contain the resultant names.
 
 # --hints--
 
@@ -22,7 +25,7 @@ dashedName: state-name-puzzle
 assert(typeof solve == 'function');
 ```
 
-`solve(["New Mexico", "New York", "North Carolina ", "North Dakota", "Ohio", "Oklahoma", "Oregon", "Pennsylvania", "Rhode Island", "South Carolina", "South Dakota"])` має повернути масив.
+`solve(["New Mexico", "New York", "North Carolina ", "North Dakota", "Ohio", "Oklahoma", "Oregon", "Pennsylvania", "Rhode Island", "South Carolina", "South Dakota"])` should return an array.
 
 ```js
 assert(
@@ -44,7 +47,7 @@ assert(
 );
 ```
 
-`solve(["New Mexico", "New York", "North Carolina ", "North Dakota", "Ohio", "Oklahoma", "Oregon", "Pennsylvania", "Rhode Island", "South Carolina", "South Dakota"])` має повернути `[{ from: ["North Carolina ", "South Dakota"], to: ["North Dakota", "South Carolina"] }]`.
+`solve(["New Mexico", "New York", "North Carolina ", "North Dakota", "Ohio", "Oklahoma", "Oregon", "Pennsylvania", "Rhode Island", "South Carolina", "South Dakota"])` should return `[{ from: ["North Carolina ", "South Dakota"], to: ["North Dakota", "South Carolina"] }]`.
 
 ```js
 assert.deepEqual(
@@ -70,7 +73,7 @@ assert.deepEqual(
 );
 ```
 
-`solve(["New York", "New Kory", "Wen Kory", "York New", "Kory New", "New Kory"])` має повернути `[{ from: ["New Kory", "New York"], to: ["Wen Kory", "York New"] }, { from: ["New Kory", "New York"], to: ["Kory New", "Wen Kory"] }, { from: ["New Kory", "New York"], to: ["Kory New", "York New"] }, { from: ["New York", "Wen Kory"], to: ["New Kory", "York New"] }, { from: ["New York", "Wen Kory"], to: ["Kory New", "New Kory"] }, { from: ["New York", "Wen Kory"], to: ["Kory New", "York New"] }, { from: ["New York", "York New"], to: ["New Kory", "Wen Kory"] }, { from: ["New York", "York New"], to: ["Kory New", "New Kory"] }, { from: ["New York", "York New"], to: ["Kory New", "Wen Kory"] }, { from: ["Kory New", "New York"], to: ["New Kory", "Wen Kory"] }, { from: ["Kory New", "New York"], to: ["New Kory", "York New"] }, { from: ["Kory New", "New York"], to: ["Wen Kory", "York New"] }, { from: ["New Kory", "Wen Kory"], to: ["Kory New", "York New"] }, { from: ["New Kory", "York New"], to: ["Kory New", "Wen Kory"] }, { from: ["Kory New", "New Kory"], to: ["Wen Kory", "York New"] }]`.
+`solve(["New York", "New Kory", "Wen Kory", "York New", "Kory New", "New Kory"])` should return `[{ from: ["New Kory", "New York"], to: ["Wen Kory", "York New"] }, { from: ["New Kory", "New York"], to: ["Kory New", "Wen Kory"] }, { from: ["New Kory", "New York"], to: ["Kory New", "York New"] }, { from: ["New York", "Wen Kory"], to: ["New Kory", "York New"] }, { from: ["New York", "Wen Kory"], to: ["Kory New", "New Kory"] }, { from: ["New York", "Wen Kory"], to: ["Kory New", "York New"] }, { from: ["New York", "York New"], to: ["New Kory", "Wen Kory"] }, { from: ["New York", "York New"], to: ["Kory New", "New Kory"] }, { from: ["New York", "York New"], to: ["Kory New", "Wen Kory"] }, { from: ["Kory New", "New York"], to: ["New Kory", "Wen Kory"] }, { from: ["Kory New", "New York"], to: ["New Kory", "York New"] }, { from: ["Kory New", "New York"], to: ["Wen Kory", "York New"] }, { from: ["New Kory", "Wen Kory"], to: ["Kory New", "York New"] }, { from: ["New Kory", "York New"], to: ["Kory New", "Wen Kory"] }, { from: ["Kory New", "New Kory"], to: ["Wen Kory", "York New"] }]`.
 
 ```js
 assert.deepEqual(
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
index cbd93f8eca2..3181fd9ed84 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8028
 title: Послідовність Штерна-Броко
-challengeType: 5
+challengeType: 1
 forumTopicId: 302324
 dashedName: stern-brocot-sequence
 ---
 
 # --description--
 
-Для цього завдання потрібно згенерувати послідовність Штерна-Броко, скориставшись таким самим алгоритмом, як і для генерування [послідовності Фібоначчі](https://rosettacode.org/wiki/Fibonacci sequence).
+For this task, the Stern-Brocot sequence is to be generated by an algorithm similar to that employed in generating the <a href="https://rosettacode.org/wiki/Fibonacci_sequence" target="_blank" rel="noopener noreferrer nofollow">Fibonacci sequence</a>.
 
 <ol>
   <li>Перший та другий члени послідовності дорівнюють 1:</li>
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md
index 5e92c506d32..888b154ca11 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md
@@ -1,14 +1,20 @@
 ---
 id: 5a23c84252665b21eecc8029
 title: Перекидна шахова дошка
-challengeType: 5
+challengeType: 1
 forumTopicId: 302325
 dashedName: straddling-checkerboard
 ---
 
 # --description--
 
-Застосуйте функції для шифрування та дешифрування повідомлення, використовуючи [метод перекидної шахової дошки](https://en.wikipedia.org/wiki/Straddling_checkerboard). Функції прийматимуть рядок і масив як параметри. Масив має 3 рядки, які представляють собою 3 ряди шахової дошки. Значення функції буде серією із десяткових чисел. Цифри мають бути зашифровані шляхом вставлення екранованого символу перед кожною цифрою, а потім включати дешифровану цифру. Для дешифрування цей процес має бути зворотнім.
+Implement functions to encrypt and decrypt a message using the **straddling checkerboard** method.
+
+Each function will take two arguments, a `message` string and an `alphabet` array. The `alphabet` array will contain 3 strings representing the 3 rows of the straddling checkerboard.
+
+The output of the `straddle()` function should be a series of decimal digits. Numbers should be encrypted by inserting the escape character before each digit, then including the digit <em>unencrypted</em>.
+
+This should be reversed for decryption with the `unstraddle()` function.
 
 # --hints--
 
@@ -18,7 +24,7 @@ dashedName: straddling-checkerboard
 assert(typeof straddle == 'function');
 ```
 
-`straddle("One night-it was on the twentieth of March, 1888-I was returning.",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` має повернутись рядком.
+`straddle("One night-it was on the twentieth of March, 1888-I was returning.",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` should return a string.
 
 ```js
 assert(
@@ -29,7 +35,7 @@ assert(
 );
 ```
 
-`straddle("One night-it was on the twentieth of March, 1888-I was returning.",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` має повернутись `"34045747525284613427502840425027537379697175891898898898584619028294547488"`.
+`straddle("One night-it was on the twentieth of March, 1888-I was returning.",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` should return `"34045747525284613427502840425027537379697175891898898898584619028294547488"`.
 
 ```js
 assert.equal(
@@ -41,7 +47,7 @@ assert.equal(
 );
 ```
 
-`straddle("One night-it was on the twentieth of March, 1888-I was returning",["HOL MES RT", "ABCDFGIJKN", "PQUVWXYZ./"])` має повернутись `"139539363509369743061399059745399365901344308320791798798798367430685972839363935"`.
+`straddle("One night-it was on the twentieth of March, 1888-I was returning",["HOL MES RT", "ABCDFGIJKN", "PQUVWXYZ./"])` should return `"139539363509369743061399059745399365901344308320791798798798367430685972839363935"`.
 
 ```js
 assert.equal(
@@ -54,7 +60,7 @@ assert.equal(
 );
 ```
 
-`straddle("Thecheckerboardcakerecipespecifies3largeeggsand2.25cupsofflour.",["ET AON RIS", "BCDFGHJKLM", "PQ/UVWXYZ."])` має повернутись `"125021250212707204372221327070218600960021823809623283724002424935226226962262521636094232328463769"`.
+`straddle("Thecheckerboardcakerecipespecifies3largeeggsand2.25cupsofflour.",["ET AON RIS", "BCDFGHJKLM", "PQ/UVWXYZ."])` should return `"125021250212707204372221327070218600960021823809623283724002424935226226962262521636094232328463769"`.
 
 ```js
 assert.equal(
@@ -73,7 +79,7 @@ assert.equal(
 assert(typeof unstraddle == 'function');
 ```
 
-`unstraddle("34045747525284613427502840425027537379697175891898898898584619028294547488",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` має повернутись стрічкою.
+`unstraddle("34045747525284613427502840425027537379697175891898898898584619028294547488",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` should return a string.
 
 ```js
 assert(
@@ -84,7 +90,7 @@ assert(
 );
 ```
 
-`unstraddle("34045747525284613427502840425027537379697175891898898898584619028294547488",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` має повернутись `"ONENIGHTITWASONTHETWENTIETHOFMARCH1888IWASRETURNING."`.
+`unstraddle("34045747525284613427502840425027537379697175891898898898584619028294547488",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` should return `"ONENIGHTITWASONTHETWENTIETHOFMARCH1888IWASRETURNING."`.
 
 ```js
 assert.equal(
@@ -96,7 +102,7 @@ assert.equal(
 );
 ```
 
-`unstraddle("139539363509369743061399059745399365901344308320791798798798367430685972839363935",["HOL MES RT", "ABCDFGIJKN", "PQUVWXYZ./"])` має повернутись `"ONENIGHTITWASONTHETWENTIETHOFMARCH1888IWASRETURNING"`.
+`unstraddle("139539363509369743061399059745399365901344308320791798798798367430685972839363935",["HOL MES RT", "ABCDFGIJKN", "PQUVWXYZ./"])` should return `"ONENIGHTITWASONTHETWENTIETHOFMARCH1888IWASRETURNING"`.
 
 ```js
 assert.equal(
@@ -108,7 +114,7 @@ assert.equal(
 );
 ```
 
-`unstraddle("125021250212707204372221327070218600960021823809623283724002424935226226962262521636094232328463769",["ET AON RIS", "BCDFGHJKLM", "PQ/UVWXYZ."])` має повернутись `"THECHECKERBOARDCAKERECIPESPECIFIES3LARGEEGGSAND2.25CUPSOFFLOUR."`.
+`unstraddle("125021250212707204372221327070218600960021823809623283724002424935226226962262521636094232328463769",["ET AON RIS", "BCDFGHJKLM", "PQ/UVWXYZ."])` should return `"THECHECKERBOARDCAKERECIPESPECIFIES3LARGEEGGSAND2.25CUPSOFFLOUR."`.
 
 ```js
 assert.equal(
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/subleq.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/subleq.md
index 948bfcc052f..314218a4840 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/subleq.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/subleq.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8038
 title: Subleq
-challengeType: 5
+challengeType: 1
 forumTopicId: 302328
 dashedName: subleq
 ---
 
 # --description--
 
-[Subleq](https://rosettacode.org/wiki/eso:Subleq) — приклад a [One-Instruction Set Computer (OISC) (Комп'ютер із набором однієї інструкції)](https://en.wikipedia.org/wiki/One_instruction_set_computer).
+Subleq is an example of a One-Instruction Set Computer (OISC).
 
 Назва пішла від перших літер інструкції: **SU**btract і **B**ranch if **L**ess than or **EQ**ual to zero (відняти й перейти, якщо результат менший або рівний нулю).
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sudoku.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sudoku.md
index 8477a1f9a41..7327bdddc63 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sudoku.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sudoku.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc803c
 title: Судоку
-challengeType: 5
+challengeType: 1
 forumTopicId: 302329
 dashedName: sudoku
 ---
 
 # --description--
 
-Напишіть функцію, яка вирішить частково заповнений стандартний квадрат [судоку](https://en.wikipedia.org/wiki/Sudoku) розміром 9х9 та поверне результат. Порожні поля представлені як `-1`. [Алгоритми вирішення судоку](https://en.wikipedia.org/wiki/Algorithmics_of_sudoku) можуть допомогти з реалізацією.
+Write a function to solve a partially filled-in normal 9x9 Sudoku grid and return the result. Порожні поля представлені як `-1`.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sum-of-a-series.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sum-of-a-series.md
index 8e9e43b1e43..4ca3e3a6c38 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sum-of-a-series.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sum-of-a-series.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8041
 title: Сума послідовності
-challengeType: 5
+challengeType: 1
 forumTopicId: 302333
 dashedName: sum-of-a-series
 ---
 
 # --description--
 
-Вичисліть **n**<sup>ний</sup> член [послідовності](https://en.wikipedia.org/wiki/Series (mathematics)), тобто суму **n** перших членів відповідної [послідовності](https://en.wikipedia.org/wiki/sequence). Неформально це значення або його обмеження, коли **n** прагне до нескінченності називають *сумою послідовності*, звідси й назва завдання. Для цього завдання використовуйте: $S_n = \displaystyle\sum_{k=1}^n \frac{1}{k^2}$.
+Compute the **n**<sup>th</sup> term of a <em>series</em>, i.e. the sum of the **n** first terms of the corresponding <em>sequence</em>. Неформально це значення або його обмеження, коли **n** прагне до нескінченності називають *сумою послідовності*, звідси й назва завдання. Для цього завдання використовуйте: $S_n = \displaystyle\sum_{k=1}^n \frac{1}{k^2}$.
 
 # --instructions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
index b39385de1ef..e951cc59bad 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
@@ -1,14 +1,14 @@
 ---
 id: 5a23c84252665b21eecc8045
 title: Відсікання багатокутників алгоритмом Сазерленд-Ходжман
-challengeType: 5
+challengeType: 1
 forumTopicId: 302336
 dashedName: sutherland-hodgman-polygon-clipping
 ---
 
 # --description--
 
-[ алгоритм відсікання Сазерленд-Ходжман ](https://en.wikipedia.org/wiki/Sutherland-Hodgman clipping algorithm)знаходить багатокутники, які перетинаються між довільним багатокутником( "багатокутник-об'єкт") і опуклим багатокутником (" багатокутником який потрібно відсікти"). Це використовується в комп'ютерній графіці(особливо у 2D графіці), щоб зменшити складність відображення сцен шляхом усунення частин багатокутника, який не повинен відображатися. Візьміть замкнутий багатокутник, визначений точками:
+The Sutherland-Hodgman clipping algorithm finds the polygon that is the intersection between an arbitrary polygon (the "subject polygon") and a convex polygon (the "clip polygon"). Це використовується в комп'ютерній графіці(особливо у 2D графіці), щоб зменшити складність відображення сцен шляхом усунення частин багатокутника, який не повинен відображатися. Візьміть замкнутий багатокутник, визначений точками:
 
 <pre>[(50, 150), (200, 50), (350, 150), (350, 300), (250, 300), (200, 250), (150, 350), (100, 250), (100, 200)]</pre>
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/symmetric-difference.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/symmetric-difference.md
index be857fece0a..6ce73926c2f 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/symmetric-difference.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/symmetric-difference.md
@@ -1,28 +1,32 @@
 ---
 id: 5a23c84252665b21eecc8046
 title: Симетрична різниця
-challengeType: 5
+challengeType: 1
 forumTopicId: 16086
 dashedName: symmetric-difference
 ---
 
 # --description--
 
-Дано два [set](https://rosettacode.org/wiki/set)s *A* та *B*, обчисліть $(A \\setminus B) \\cup (B \\setminus A).$ Тобто перерахуйте предмети, які містяться в *A* або *B*, але не в обох. Цей набір називається [симетричною різницею](https://en.wikipedia.org/wiki/Symmetric difference) *A* та *B*. Іншими словами: $(A \\cup B) \\setminus (A \\cap B)$ (набір предметів, які є в принаймні одному з *A* або *B* не входить в набір предметів, який є в обидвох *A* та *B*).
+Given two sets *A* and *B*, compute $(A \\setminus B) \\cup (B \\setminus A).$ That is, enumerate the items that are in *A* or *B* but not both. This set is called the symmetric difference of *A* and *B*. Іншими словами: $(A \\cup B) \\setminus (A \\cap B)$ (набір предметів, які є в принаймні одному з *A* або *B* не входить в набір предметів, який є в обидвох *A* та *B*).
+
+Example:
+
+For sets `A = [1, 2, 3]`, and `B = [1, 3, 4]`, the symmetric difference of *A* and *B* is `[2, 4]`.
 
 # --instructions--
 
-Створіть функцію, яка приймає два масиви як параметри та повертає симетричну різницю. Відсортуйте отриманий масив перед поверненням.
+Write a function that takes two arrays as parameters and returns the symmetric difference. Sort the resultant array before returning it.
 
 # --hints--
 
-`symmetricDifference` повинна бути функцією.
+`symmetricDifference` має бути функцією.
 
 ```js
 assert(typeof symmetricDifference == 'function');
 ```
 
-`symmetricDifference(["John", "Bob", "Mary", "Serena"], ["Jim", "Mary", "John", "Bob"])` має повернути масив.
+`symmetricDifference(["John", "Bob", "Mary", "Serena"], ["Jim", "Mary", "John", "Bob"])` should return an array.
 
 ```js
 assert(
@@ -35,7 +39,7 @@ assert(
 );
 ```
 
-`symmetricDifference(["John", "Bob", "Mary", "Serena"], ["Jim", "Mary", "John", "Bob"])` має повернути `["Jim", "Serena"]`.
+`symmetricDifference(["John", "Bob", "Mary", "Serena"], ["Jim", "Mary", "John", "Bob"])` should return `["Jim", "Serena"]`.
 
 ```js
 assert.deepEqual(
@@ -47,13 +51,13 @@ assert.deepEqual(
 );
 ```
 
-`symmetricDifference([1, 2, 3], [3, 4])` має повернути `[1, 2, 4]`.
+`symmetricDifference([1, 2, 3], [3, 4])` should return `[1, 2, 4]`.
 
 ```js
 assert.deepEqual(symmetricDifference([1, 2, 3], [3, 4]), [1, 2, 4]);
 ```
 
-`symmetricDifference([1, 2, 3, 4, 5], [3, 4, 8, 7])` має повернути `[1, 2, 5, 7, 8]`.
+`symmetricDifference([1, 2, 3, 4, 5], [3, 4, 8, 7])` should return `[1, 2, 5, 7, 8]`.
 
 ```js
 assert.deepEqual(symmetricDifference([1, 2, 3, 4, 5], [3, 4, 8, 7]), [
@@ -65,7 +69,7 @@ assert.deepEqual(symmetricDifference([1, 2, 3, 4, 5], [3, 4, 8, 7]), [
 ]);
 ```
 
-`symmetricDifference([1, 2, 3, 4, 5, 6, 7, 8], [1, 3, 5, 6, 7, 8, 9])` має повернути `[2, 4, 9]`.
+`symmetricDifference([1, 2, 3, 4, 5, 6, 7, 8], [1, 3, 5, 6, 7, 8, 9])` should return `[2, 4, 9]`.
 
 ```js
 assert.deepEqual(
@@ -74,7 +78,7 @@ assert.deepEqual(
 );
 ```
 
-`symmetricDifference([1, 2, 4, 7, 9], [2, 3, 7, 8, 9])` має повернути `[1, 3, 4, 8]`.
+`symmetricDifference([1, 2, 4, 7, 9], [2, 3, 7, 8, 9])` should return `[1, 3, 4, 8]`.
 
 ```js
 assert.deepEqual(symmetricDifference([1, 2, 4, 7, 9], [2, 3, 7, 8, 9]), [
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/taxicab-numbers.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/taxicab-numbers.md
index 22e6ec1ee6e..feec72a6593 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/taxicab-numbers.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/taxicab-numbers.md
@@ -1,14 +1,14 @@
 ---
 id: 594ecc0d9a8cf816e3340187
 title: Числа Taxicab
-challengeType: 5
+challengeType: 1
 forumTopicId: 302337
 dashedName: taxicab-numbers
 ---
 
 # --description--
 
-[число Taxicab або n-е число Харді–Рамануджана](https://en.wikipedia.org/wiki/Hardy–Ramanujan number "wp: Hardy–Ramanujan number") (визначення яке використовується тут) — це таке додатне число, що може відображатися як сума двох додатних чисел у третьому ступені двома або більше способами.
+A taxicab number (the definition that is being used here) is a positive integer that can be expressed as the sum of two positive cubes in more than one way.
 
 Першим n-им числом Харді–Рамануджана є `1729`, який є:
 
@@ -29,13 +29,6 @@ dashedName: taxicab-numbers
 
 Напишіть функцію, що повертає `n`-найменші числа taxicab. Для кожного даного числа покажіть також і число включаючи його складові в третьому ступені.
 
-**Див. також:**
-
-<ul>
-  <li><a href='https://oeis.org/A001235' target='_blank'>A001235 числа taxicab</a> в Енциклопедії послідовностей цілих чисел.</li>
-  <li><a href='https://en.wikipedia.org/wiki/Taxicab_number' target='_blank'> Число taxicab і</a> в онлайн-енциклопедії «Вікіпедія» (англ.).</li>
-</ul>
-
 # --hints--
 
 `taxicabNumbers` має бути функцією.
@@ -44,31 +37,31 @@ dashedName: taxicab-numbers
 assert(typeof taxicabNumbers === 'function');
 ```
 
-`taxicabNumbers` має повернути масив.
+`taxicabNumbers` should return an array.
 
 ```js
 assert(typeof taxicabNumbers(2) === 'object');
 ```
 
-`taxicabNumbers` має повернути масив чисел.
+`taxicabNumbers` should return an array of numbers.
 
 ```js
 assert(typeof taxicabNumbers(100)[0] === 'number');
 ```
 
-`taxicabNumbers(4)` має повернути [1729, 4104, 13832, 20683].
+`taxicabNumbers(4)` should return [1729, 4104, 13832, 20683].
 
 ```js
 assert.deepEqual(taxicabNumbers(4), res4);
 ```
 
-`taxicabNumbers(25)` має повернути [1729, 4104, 13832, 20683, 32832, 39312, 40033, 46683, 64232, 65728, 110656, 110808, 134379, 149389, 165464, 171288, 195841, 216027, 216125, 262656, 314496, 320264, 327763, 373464, 402597]
+`taxicabNumbers(25)` should return [1729, 4104, 13832, 20683, 32832, 39312, 40033, 46683, 64232, 65728, 110656, 110808, 134379, 149389, 165464, 171288, 195841, 216027, 216125, 262656, 314496, 320264, 327763, 373464, 402597]
 
 ```js
 assert.deepEqual(taxicabNumbers(25), res25);
 ```
 
-`taxicabNumbers(39)` отриманими числами від 20 до 29 мають бути [314496,320264,327763,373464,402597,439101,443889,513000,513856].
+`taxicabNumbers(39)` resulting numbers from 20 - 29 should be [314496,320264,327763,373464,402597,439101,443889,513000,513856].
 
 ```js
 assert.deepEqual(taxicabNumbers(39).slice(20, 29), res39From20To29);
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
index e32b559a450..bfa38aee98e 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
@@ -1,20 +1,20 @@
 ---
 id: 5951ed8945deab770972ae56
 title: Ханойські вежі
-challengeType: 5
+challengeType: 1
 forumTopicId: 302341
 dashedName: towers-of-hanoi
 ---
 
 # --description--
 
-Розв'яжіть [Towers of Hanoi](https://en.wikipedia.org/wiki/Towers_of_Hanoi "wp: Towers_of_Hanoi") завдання.
+Solve the Towers of Hanoi problem. The number of objects will be given as the first parameter, followed by the strings used to identify each stack of objects. Create a nested array containing the list of moves, `["source", "destination"]`.
 
-Ваше рішення повинно містити кількість дисків у якості першого параметру та три рядки, що використовуються для ідентифікації кожного з трьох стопок дисків, наприклад, `towerOfHanoi(4, 'A', 'B', 'C')`. Функція має повернути ряд масивів, що містять перелік кроків, джерело - -> призначення.
+For example, the parameters `(4, 'A', 'B', 'C')`, will result in nested array of moves `[['A', 'C'], ['B', 'A']]`, indicating that the 1st move was to move an object from stack `A` to `C` and the 2nd move was to move an object from stack `B` to `A`.
 
-Наприклад, масив `[['A', 'C'], ['B', 'A']]` вказує на те, що 1-й хід полягав у переміщенні диску зі стержня А на С, а другий хід —переміщенні диск зі стержня В на А.
+# --instructions--
 
-<p></p>
+Write a function that returns the moves to stack the objects in a nested array.
 
 # --hints--
 
@@ -24,25 +24,25 @@ dashedName: towers-of-hanoi
 assert(typeof towerOfHanoi === 'function');
 ```
 
-`towerOfHanoi(3, ...)` має повернути 7 ходів.
+`towerOfHanoi(3, ...)` should return 7 moves.
 
 ```js
 assert(res3.length === 7);
 ```
 
-`towerOfHanoi(3, 'A', 'B', 'C')` має повернути `[['A','B'], ['A','C'], ['B','C'], ['A','B'], ['C','A'], ['C','B'], ['A','B']]`.
+`towerOfHanoi(3, 'A', 'B', 'C')` should return `[['A','B'], ['A','C'], ['B','C'], ['A','B'], ['C','A'], ['C','B'], ['A','B']]`.
 
 ```js
 assert.deepEqual(towerOfHanoi(3, 'A', 'B', 'C'), res3Moves);
 ```
 
-`towerOfHanoi(5, "X", "Y", "Z")` 10-й хід має бути Y -> X.
+`towerOfHanoi(5, "X", "Y", "Z")` 10th move should be Y -> X.
 
 ```js
 assert.deepEqual(res5[9], ['Y', 'X']);
 ```
 
-`towerOfHanoi(7, 'A', 'B', 'C')` перші десять ходів мають бути `[['A','B'], ['A','C'], ['B','C'], ['A','B'], ['C','A'], ['C','B'], ['A','B'], ['A','C'], ['B','C'], ['B','A']]`
+`towerOfHanoi(7, 'A', 'B', 'C')` first ten moves should be `[['A','B'], ['A','C'], ['B','C'], ['A','B'], ['C','A'], ['C','B'], ['A','B'], ['A','C'], ['B','C'], ['B','A']]`
 
 ```js
 assert.deepEqual(towerOfHanoi(7, 'A', 'B', 'C').slice(0, 10), res7First10Moves);
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/y-combinator.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/y-combinator.md
index 8a0657c02c5..b8089e2e127 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/y-combinator.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/y-combinator.md
@@ -1,22 +1,20 @@
 ---
 id: 594810f028c0303b75339ad5
 title: Y комбінатор
-challengeType: 5
+challengeType: 1
 forumTopicId: 302345
 dashedName: y-combinator
 ---
 
 # --description--
 
-У строгому [ функціональному програмуванні](https://www.freecodecamp.org/news/the-principles-of-functional-programming/ "news: the principles of functional programming") та [ лямбда-численнях](https://en.wikipedia.org/wiki/lambda calculus "wp: lambda calculus"), функції (лямбда-вирази) не мають стану і можуть посилатися лише на аргументи охоплювальних функцій. Це виключає звичайне визначення рекурсивної функції, коли функція асоціюється зі станом змінної, а стан цієї змінної використовується в основній частині функції. [ Комбінатор Y ](https://mvanier.livejournal.com/2897.html) сам по собі є функцією без стану, яка при застосуванні до іншої такої функції повертає рекурсивну версію функції. Комбінатор Y — найпростіший з класу таких функцій, який називається [ комбінаторами з фіксованою точкою](https://en.wikipedia.org/wiki/Fixed-point combinator "wp: fixed-point combinator").
+In strict <a href="https://www.freecodecamp.org/news/the-principles-of-functional-programming/" target="_blank" rel="noopener noreferrer nofollow">functional programming</a> and the lambda calculus, functions (lambda expressions) don't have state and are only allowed to refer to arguments of enclosing functions. Це виключає звичайне визначення рекурсивної функції, коли функція асоціюється зі станом змінної, а стан цієї змінної використовується в основній частині функції.
+
+The Y combinator is itself a stateless function that, when applied to another stateless function, returns a recursive version of the function. The Y combinator is the simplest of the class of such functions, called fixed-point combinators.
 
 # --instructions--
 
-Визначте комбінаторну функцію Y без стану та використовуйте її для обчислення [factorial](https://en.wikipedia.org/wiki/Factorial "wp: factorial"). Функція `factorial(N)` вже дана. **Дивіться також:**
-
-<ul>
-  <li><a href="https://vimeo.com/45140590" target="_blank">Джим Вейріх: Пригоди у функціональному програмуванні</a>.</li>
-</ul>
+Define the stateless Y combinator function and use it to compute the factorials. The `factorial(N)` function is already given to you.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md
index de979ec418a..0bc00fb2ef0 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md
@@ -1,14 +1,14 @@
 ---
 id: 594810f028c0303b75339ad8
 title: Зигзагоподібна матриця
-challengeType: 5
+challengeType: 1
 forumTopicId: 302348
 dashedName: zig-zag-matrix
 ---
 
 # --description--
 
-"Зигзагоподібний" масив — це квадратне розташування перших $N^2$ цілих чисел, де числа послідовно збільшуються, коли ви рухаєтесь зигзагоподібно по антидіагоналі[ масиву](https://en.wiktionary.org/wiki/antidiagonal).
+A 'zig-zag' array is a square arrangement of the first $N^2$ integers, where the numbers increase sequentially as you zig-zag along the array's anti-diagonals.
 
 Наприклад, для введення `5` такий результат має згенеруватися:
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
index 6d9288bab80..d88bcd0257a 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
@@ -8,9 +8,9 @@ dashedName: build-a-freecodecamp-forum-homepage
 
 # --description--
 
-** Ціль: ** Створити застосунок в [ CodePen.io](https://codepen.io), який функціонально схожий до даного: <https://codepen.io/freeCodeCamp/full/JqdoMV>.
+**Мета:** Створити застосунок, функціонально схожий до цього: <https://codepen.io/freeCodeCamp/full/JqdoMV>.
 
-Заповніть, як нижче наведено,[ історії користувача ](https://en.wikipedia.org/wiki/User_story). Використовуйте будь-які потрібні вам бібліотеки чи API (прикладні програмні інтерфейси). Проявіть при цьому свій власний стиль.
+Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
 ** Історія користувача: ** Я можу бачити список найактуальніших дописів на freeCodeCamp forum.
 
@@ -22,7 +22,7 @@ dashedName: build-a-freecodecamp-forum-homepage
 
 Коли ви завершили, додайте посилання на ваш проєкт на CodePen та натисніть кнопку "Я виконав це завдання".
 
-Ви можете отримати відгук про ваш проєкт, поділившись ним на даному форумі: [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
index 6971051e0c6..9669048f2aa 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
@@ -8,11 +8,11 @@ dashedName: build-a-light-bright-app
 
 # --description--
 
-**Ціль:** Створити застосунок в [CodePen.io](https://codepen.io), який функціонально схожий до даного: <https://codepen.io/freeCodeCamp/full/eyLYXE>.
+**Мета:** Створити застосунок, функціонально схожий до цього: <https://codepen.io/freeCodeCamp/full/eyLYXE>.
 
 **Правило #1: ** Не дивіться на зразок коду проєкту. Визначте його самі.
 
-**Правило #2: **Заповніть, як нижче наведено,[ історії користувача ](https://en.wikipedia.org/wiki/User_story). Використовуйте будь-які потрібні вам бібліотеки чи API (прикладні програмні інтерфейси). Проявіть при цьому свій власний стиль.
+**Правило №2:** виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
 ** Історія користувача: ** Я можу натискати чи перетягувати курсор миші, щоб зафарбувати кружечки.
 
@@ -28,7 +28,7 @@ dashedName: build-a-light-bright-app
 
 Коли ви завершили, додайте посилання на ваш проєкт на CodePen та натисніть кнопку "Я виконав це завдання".
 
-Ви можете отримати відгук про ваш проєкт, поділившись ним на даному форумі: [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
index c322bb2e724..a4df513e58a 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
@@ -8,7 +8,7 @@ dashedName: build-a-nightlife-coordination-app
 
 # --description--
 
-Створіть full stack додаток на JavaScript, який функціонально схожий на цей: <https://yoyo44.herokuapp.com/>. Використовуйте конструктор сайтів на ваш розсуд для завершення проєкту.
+Створіть повний пакет додатку JavaScript, який функціонально схожий до <a href="https://yoyo44.herokuapp.com/" target="_blank" rel="noopener noreferrer nofollow">https://yoyo44.herokuapp.com/</a>. Використовуйте конструктор сайтів на ваш розсуд для завершення проєкту.
 
 Тут наведено конкретні історії користувача, які варто імплементувати в даний проєкт:
 
@@ -20,7 +20,7 @@ dashedName: build-a-nightlife-coordination-app
 
 **Історія користувача:** Як неавторизований користувач, коли ви входите в систему, вам не треба виконувати пошук знову.
 
-**Підказка:** Спробуйте використати [Yelp API](https://www.yelp.com/developers/documentation/v3), щоб знайти місця проведення заходів, які шукають ваші користувачі. Якщо ви використовуєте Yelp API, не забудьте вказати це у вашому додатку.
+**Hint:** Try using the Yelp API to find venues in the cities your users search for. Якщо ви використовуєте Yelp API, не забудьте вказати це у вашому додатку.
 
 Коли ви завершили, переконайтеся, що демоверсія вашого проєкту розміщена у відкритому доступі. Потім введіть URL-адресу проєкту у поле `Solution Link`. За бажанням також введіть посилання на вихідний код проєкту у полі `GitHub Link`.
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
index 59f1680e14e..fca2f462fd5 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
@@ -8,9 +8,9 @@ dashedName: build-a-pinterest-clone
 
 # --description--
 
-** Ціль: ** Створити [ Replit](https://replit.com/) застосунок, який функціонально схожий на цей: <https://build-a-pinterest-clone.freecodecamp.rocks/>.
+**Мета:** Створити застосунок, функціонально схожий до цього: <a href="https://build-a-pinterest-clone.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://build-a-pinterest-clone.freecodecamp.rocks/</a>.
 
-Заповніть, як нижче наведено,[ історії користувача ](https://en.wikipedia.org/wiki/User_story). Використовуйте будь-які потрібні вам бібліотеки чи API (прикладні програмні інтерфейси). Проявіть при цьому свій власний стиль.
+Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
 **Історія користувача:** Як неавторизований користувач, я можу увійти за допомогою GitHub.
 
@@ -24,11 +24,11 @@ dashedName: build-a-pinterest-clone
 
 **Історія користувача:** Як авторизований користувач, якщо я завантажу неробоче зображення, то отримаю в результаті його заміну на зображення-заповнювач. (Ви можете скористатися детектором зламаних зображень jQuery)
 
-**Підказка: **[Masonry.js](https://masonry.desandro.com/) - це бібліотека, яка дозволяє створювати сітки зображень у стилі Pinterest.
+**Hint:** Masonry.js is a library that allows for Pinterest-style image grids.
 
 Як тільки ви завершите імплементацію цих історій користувача, введіть URL-адресу вашого онлайн додатку і, за бажанням, вашого GitHub репозиторію. Тоді натисніть кнопку "Я завершив це завдання".
 
-Ви можете отримати відгук про ваш проєкт, поділившись ним на даному форумі: [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-pong-game.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
index ce973e97f07..60f5ec0f99e 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
@@ -8,11 +8,11 @@ dashedName: build-a-pong-game
 
 # --description--
 
-** Ціль:** Створіть [CodePen.io ](https://codepen.io)застосунок, який функціонально схожий на цей: <https://codepen.io/satyamdev/full/pdMmBp>.
+**Мета:** Створити застосунок, функціонально схожий до цього: <https://codepen.io/satyamdev/full/pdMmBp>.
 
 **Правило #1: ** Не дивіться на зразок коду проєкту. Визначте його самі.
 
-**Правило #2: **Заповніть, як нижче наведено,[ історії користувача ](https://en.wikipedia.org/wiki/User_story). Використовуйте будь-які потрібні вам бібліотеки чи API (прикладні програмні інтерфейси). Проявіть при цьому свій власний стиль.
+**Правило №2:** виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
 **Історія користувача:** Я можу керувати ігровою лопаткою.
 
@@ -24,7 +24,7 @@ dashedName: build-a-pong-game
 
 Коли ви завершили, додайте посилання на ваш проєкт на CodePen та натисніть кнопку "Я виконав це завдання".
 
-Ви можете отримати відгук про ваш проєкт, поділившись ним на даному форумі: [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
index 2ad461255d0..8352f09b60b 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
@@ -8,9 +8,9 @@ dashedName: build-a-recipe-box
 
 # --description--
 
-**Ціль:**Створити на сайті [CodePen.io](https://codepen.io) застосунок, який функціонально схожий на цей: <https://codepen.io/freeCodeCamp/full/dNVazZ/>.
+**Мета:** Створити застосунок, функціонально схожий до цього: <a href="https://codepen.io/freeCodeCamp/full/dNVazZ/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/dNVazZ/</a>.
 
-Заповніть, як нижче наведено,[ історії користувача ](https://en.wikipedia.org/wiki/User_story). Використовуйте будь-які потрібні вам бібліотеки чи API (прикладні програмні інтерфейси). Проявіть при цьому свій власний стиль.
+Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
 **Історія користувача:** Я можу створювати рецепти, в яких є назви та інгредієнти.
 
@@ -28,7 +28,7 @@ dashedName: build-a-recipe-box
 
 Коли ви завершили, додайте посилання на ваш проєкт на CodePen та натисніть кнопку "Я виконав це завдання".
 
-Ви можете отримати відгук про ваш проєкт, поділившись ним на даному форумі: [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
index 016f5c7a840..38713f0c802 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
@@ -8,9 +8,9 @@ dashedName: build-a-roguelike-dungeon-crawler-game
 
 # --description--
 
-**Ціль:** Створіть [CodePen.io](https://codepen.io) застосунок, який функціонально схожий на цей: <https://codepen.io/freeCodeCamp/full/apLXEJ/>.
+**Мета:** Створити застосунок, функціонально схожий до цього: <a href="https://codepen.io/freeCodeCamp/full/apLXEJ/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/apLXEJ/</a>.
 
-Виконайте наведені нижче [історії користувача](https://en.wikipedia.org/wiki/User_story). Використовуйте необхідні Вам бібліотеки або API. Виконайте завдання у власному стилі.
+Виконайте історію користувача та пройдіть тести. Використовуйте необхідні Вам бібліотеки або API. Оформте за власним стилем.
 
 **Історія користувача:** у мене є здоров'я, рівень і зброя. Я можу підібрати кращу зброю. Я можу підбирати ліки.
 
@@ -32,7 +32,7 @@ dashedName: build-a-roguelike-dungeon-crawler-game
 
 Після виконання завдання, прикріпіть посилання на Ваш проєкт на CodePen і натисніть на кнопку "Я виконав(ла) це завдання".
 
-Ви можете отримати відгук про ваш проєкт, поділившись ним на [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-simon-game.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
index 3df35e56a9a..8e2bd815af1 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
@@ -8,9 +8,9 @@ dashedName: build-a-simon-game
 
 # --description--
 
-**Мета:** Створіть [CodePen.io](https://codepen.io) додаток, який схожий за функціональністю до цього: [https://codepen.io/freeCodeCamp/full/obYBjE](https://codepen.io/freeCodeCamp/full/obYBjE).
+**Мета:** Створити застосунок, функціонально схожий до цього: <a href="https://codepen.io/freeCodeCamp/full/obYBjE" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/obYBjE</a>.
 
-Виконайте наведене нижче [історії користувача](https://en.wikipedia.org/wiki/User_story). Використовуйте необхідні вам бібліотеки або API. Оформіть за вашим власним стилем.
+Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
 **Історія користувача:** Я починаю випадковим чином натискати на кнопки.
 
@@ -32,7 +32,7 @@ dashedName: build-a-simon-game
 
 Коли ви закінчите, прикріпіть посилання до вашого проєкту на CodePen і натисніть кнопку: "я виконав це завдання".
 
-Ви можете отримати відгук про ваш проєкт, поділившись ним на [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
index f3116e2782b..1168c6ed5db 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
@@ -8,9 +8,9 @@ dashedName: build-a-tic-tac-toe-game
 
 # --description--
 
-**Ціль:** Створити застосунок[ CodePen.io, ](https://codepen.io) який функціонально схожий на цей [ https://codepen.io/freeCodeCamp/full/KzXQgy/](https://codepen.io/freeCodeCamp/full/KzXQgy/).
+**Мета:** Створити застосунок, функціонально схожий до цього: <a href="https://codepen.io/freeCodeCamp/full/KzXQgy/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/KzXQgy/</a>.
 
-Заповніть, як нижче наведено, [ історії користувача ](https://en.wikipedia.org/wiki/User_story). Використовуйте будь-які потрібні вам бібліотеки чи API (прикладні програмні інтерфейси). Проявіть при цьому свій власний стиль.
+Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
 **Історія користувача:** Я можу грати в Хрестики-нулики за допомогою комп'ютера.
 
@@ -20,7 +20,7 @@ dashedName: build-a-tic-tac-toe-game
 
 Після завершення додайте посилання на ваш проєкт на CodePen та натисніть на кнопку "Я виконав це завдання".
 
-Ви можете отримати відгук про ваш проєкт, поділившись ним на форумі - [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
index b210e3440ef..6b60955d66a 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
@@ -8,23 +8,21 @@ dashedName: build-a-wikipedia-viewer
 
 # --description--
 
-**Ціль: ** Створіть застосунок[ CodePen.io](https://codepen.io), який функціонально схожий на даний: [ https://codepen.io/freeCodeCamp/full/wGqEga/](https://codepen.io/freeCodeCamp/full/wGqEga/).
+**Мета:** Створити застосунок, функціонально схожий до цього: <a href="https://codepen.io/freeCodeCamp/full/wGqEga/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/wGqEga/</a>.
 
-Заповніть, як нижче наведено,[ історії користувача ](https://en.wikipedia.org/wiki/User_story). Використовуйте будь-які потрібні вам бібліотеки чи API (прикладні програмні інтерфейси). Проявіть при цьому свій власний стиль.
+The MediaWiki software powers Wikipedia, and it helps you collect and organize knowledge and make it available to people.
 
-**Історія користувача:** Я можу здійснювати пошук у Вікіпедії за допомогою пошукового поля та бачити статті, що відповідають запиту.
+Using the MediaWiki API, replicate the search function and random article function, similar to the example app above. You can use Wikipedia as your data source.
 
-**Історія користувача:** Я можу натиснути кнопку, щоб побачити випадковий запис у Вікіпедії.
+Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
-Підказка #1: Ось URL-адреса, яку ви можете використовувати для отримання випадкової статті з Вікіпедії: `https://en.wikipedia.org/wiki/Special:Random`.
+**User Story:** I can search Wikipedia entries in a search box and see the resulting Wikipedia entries.
 
-Підказка #2: Ось матеріал на тему використання API (прикладного програмного інтерфейсу) Вікіпедії: `https://www.mediawiki.org/wiki/API:Main_page`.
+**User Story:** I can click a button to see a random Wikipedia entry.
 
-Підказка #3: Використовуйте це [посилання](https://en.wikipedia.org/wiki/Special:ApiSandbox#action=query&titles=Main%20Page&prop=revisions&rvprop=content&format=jsonfm), щоб поекспериментувати з API Вікіпедії.
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
 
-Коли ви завершили, додайте посилання на ваш проєкт на CodePen та натисніть кнопку "Я виконав це завдання".
-
-Ви можете отримати відгук про ваш проєкт, поділившись ним на даному форумі: [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md
index 03635f25f19..aa0185efbc3 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md
@@ -8,7 +8,7 @@ dashedName: build-an-image-search-abstraction-layer
 
 # --description--
 
-Створіть full stack додаток, що дозволяє шукати зображення, як тут: <https://image-search-abstraction-layer.freecodecamp.rocks/query/lolcats%20funny?page=10> і завантажувати останні пошукові запити, як тут: <https://image-search-abstraction-layer.freecodecamp.rocks/recent/>. Використовуйте конструктор сайтів на ваш розсуд для завершення проєкту.
+Build a full stack JavaScript app that allows you to search for images like this: <a href="https://image-search-abstraction-layer.freecodecamp.rocks/query/lolcats%20funny?page=10" target="_blank" rel="noopener noreferrer nofollow">https://image-search-abstraction-layer.freecodecamp.rocks/query/lolcats%20funny?page=10</a> and browse recent search queries like this: <a href="https://image-search-abstraction-layer.freecodecamp.rocks/recent/" target="_blank" rel="noopener noreferrer nofollow">https://image-search-abstraction-layer.freecodecamp.rocks/recent/</a>. Використовуйте конструктор сайтів на ваш розсуд для завершення проєкту.
 
 Тут наведено конкретні історії користувача, які варто реалізувати в даному проєкті:
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
index a8b8d7bf0d8..5eea4be60be 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
@@ -8,29 +8,36 @@ dashedName: build-the-game-of-life
 
 # --description--
 
-**Ціль:** Створіть [ CodePen.io ](https://codepen.io) застосунок, який функціонально схожий на цей: [ https://codepen.io/freeCodeCamp/full/BpwMZv/](https://codepen.io/freeCodeCamp/full/BpwMZv/).
+**Мета:** Створити застосунок, функціонально схожий до цього: <a href="https://codepen.io/freeCodeCamp/full/BpwMZv/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/BpwMZv/</a>.
 
-Заповніть, як нижче наведено,[ історії користувача ](https://en.wikipedia.org/wiki/User_story). Використовуйте будь-які потрібні вам бібліотеки чи API (прикладні програмні інтерфейси). Проявіть при цьому свій власний стиль.
+The Game of Life is a cellular automaton devised by the British mathematician John Horton Conway. It is a <em>zero-player game</em>, meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and observing how it evolves.
 
-**Історія користувача:** Коли я вперше заходжу в гру, вона випадково створить площину і почне гру.
+The universe of the Game of Life is an infinite, two-dimensional orthogonal grid of square cells, each of which is in one of two possible states, populated and unpopulated. Every cell interacts with its eight neighbours, which are the cells that are horizontally, vertically, or diagonally adjacent.
 
-**Історія користувача:** Я можу запустити і зупинити площину.
+At each step in time, the following transitions occur:
 
-**Історія користувача:** Я можу розставити початкову конфігурацію на площині.
+- Any live cell with fewer than two live neighbours dies, as if by underpopulation.
+- Any live cell with two or three live neighbours lives on to the next generation.
+- Any live cell with more than three live neighbours dies, as if by overpopulation.
+- Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.
 
-**Історія користувача:** Я можу очистити площину.
+Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
-**Історія користувача:** Коли я натисну кнопку "Старт", гра почне розвиватись.
+**User Story:** When I first arrive at the game, it will randomly generate a board and start playing.
 
-**Історія користувача:** Щоразу, як площина змінюється, я можу подивитися, скільки поколінь минуло.
+**User Story:** I can start and stop the board.
 
-**Підказка:** Ось пояснення гри "Життя" Джона Конвея від нього самого: <https://www.youtube.com/watch?v=E8kUJL04ELA>
+**User Story:** I can set up the board.
 
-**Підказка:** Ось огляд гри "Життя" Конвея з правилами для довідки: [https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life](https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life)
+**User Story:** I can clear the board.
 
-Після завершення додайте посилання на ваш проєкт на CodePen та натисніть на кнопку "Я виконав це завдання".
+**User Story:** When I press start, the game will play out.
 
-Ви можете отримати відгук про ваш проєкт, поділившись ним на форумі: [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+**User Story:** Each time the board changes, I can see how many generations have gone by.
+
+When you are finished, include a link to your project and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
index 96effef2235..ff783e420ad 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
@@ -8,9 +8,9 @@ dashedName: manage-a-book-trading-club
 
 # --description--
 
-**Ціль:** Створити застосунок на [Replit ](https://replit.com/), який функціонально схожий на цей: <https://manage-a-book-trading-club.freecodecamp.rocks/>.</p> 
+**Мета:** Створити застосунок, функціонально схожий до цього: <a href="https://manage-a-book-trading-club.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://manage-a-book-trading-club.freecodecamp.rocks/</a>.
 
-Заповніть, як нижче наведено,[ історії користувача ](https://en.wikipedia.org/wiki/User_story). Використовуйте будь-які потрібні вам бібліотеки чи API (прикладні програмні інтерфейси). Проявіть при цьому свій власний стиль.
+Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
 **Історія користувача:** Я можу переглядати всі книги, опубліковані кожним користувачем.
 
@@ -22,14 +22,10 @@ dashedName: manage-a-book-trading-club
 
 Як тільки ви закінчите реалізацію цих історій користувача, введіть URL-адресу вашого онлайн додатку і, за бажанням, вашого GitHub репозиторію. Тоді натисніть кнопку "Я завершив це завдання".
 
-Ви можете отримати відгук про ваш проєкт, поділившись ним на даному форумі: [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
-
-
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
-
-
 ```js
 // solution required
 ```
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
index a0024b992c1..353a3cc1cda 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
@@ -8,9 +8,9 @@ dashedName: map-data-across-the-globe
 
 # --description--
 
-**Ціль: **Створити застосунок на [CodePen.io](https://codepen.io), який функціонально схожий на цей:<https://codepen.io/freeCodeCamp/full/mVEJag>.
+**Мета:** Створити застосунок, функціонально схожий до цього: <https://codepen.io/freeCodeCamp/full/mVEJag>.
 
-Заповніть, як нижче наведено,[ історії користувача ](https://en.wikipedia.org/wiki/User_story). Використовуйте будь-які потрібні вам бібліотеки чи API (прикладні програмні інтерфейси). Проявіть при цьому свій власний стиль.
+Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
 **Історія користувача:** Я можу побачити на карті світу де приземлились всі метеорити.
 
@@ -22,7 +22,7 @@ dashedName: map-data-across-the-globe
 
 Коли ви завершили, додайте посилання на ваш проєкт на CodePen та натисніть кнопку "Я виконав це завдання".
 
-Ви можете отримати відгук про ваш проєкт, поділившись ним на даному форумі: [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md
index 8d0fde91d34..0a99a6a36d7 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md
@@ -8,9 +8,9 @@ dashedName: p2p-video-chat-application
 
 # --description--
 
-**Мета:** Створити [Replit](https://replit.com/) додаток, який за функціями подібний до цього [ -video-chat-application.freecodecamp.rocks/](https://p2p-video-chat-application.freecodecamp.rocks/).
+**Мета:** Створити застосунок, функціонально схожий до цього: <a href="https://p2p-video-chat-application.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://p2p-video-chat-application.freecodecamp.rocks/</a>.
 
-Заповніть подані нижче [ історії користувачів](https://en.wikipedia.org/wiki/User_story). Використовуйте необхідні вам бібліотеки чи прикладні програмні інтерфейси. Продемонструйте свій власний неповторний стиль.
+Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
 **Історія користувача:** При поверненні, браузер запропонує мені доступ до камери та мікрофона.
 
@@ -32,7 +32,7 @@ dashedName: p2p-video-chat-application
 
 Як тільки ви виконаєте ці історії користувачів, введіть URL-адресу вашого онлайн додатку і, за можливості, вашого GitHub репозиторію. Тоді натисніть кнопку "Завдання виконано".
 
-Ви можете отримати відгук про ваш проект, поділившись ним на форумі freeCodeCamp [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
index ef84e850b7e..08f9b540b20 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
@@ -8,9 +8,9 @@ dashedName: show-national-contiguity-with-a-force-directed-graph
 
 # --description--
 
-**Мета:** створити додаток [CodePen.io](https://codepen.io), який своїми функціями схожий на цей: <https://codepen.io/freeCodeCamp/full/xVopBo>.
+**Objective:** Build an app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/XWEONRz>.
 
-Виконайте наступні [історії користувачів](https://en.wikipedia.org/wiki/User_story). Використовуйте необхідні вам бібліотеки чи прикладні програмні інтерфейси. Продемонструйте свій власний неповторний стиль.
+Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
 **Історія користувача:** я бачу орієнтований граф, створений силовими алгоритмами, який показує, які країни мають спільні кордони.
 
@@ -22,7 +22,7 @@ dashedName: show-national-contiguity-with-a-force-directed-graph
 
 Після завершення додайте посилання на ваш проєкт на CodePen та натисніть на кнопку "Завдання виконано".
 
-Ви можете отримати відгук про ваш проєкт, поділившись ним на форумі: [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/show-the-local-weather.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
index e751bf12e5e..1275914afbd 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
@@ -8,11 +8,11 @@ dashedName: show-the-local-weather
 
 # --description--
 
-**Мета:** Створити [CodePen.io](https://codepen.io) додаток, який функціонально схожий на цей: <https://codepen.io/freeCodeCamp/full/bELRjV>.
+**Мета:** Створити застосунок, функціонально схожий до цього: <a href="https://codepen.io/freeCodeCamp/full/bELRjV" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/bELRjV</a>.
 
 **Правило #1:** Не дивіться на приклад коду проєкту. Визначте його самі.
 
-**Правило #2:** Виконайте відповідно наведені нижче [історії користувача](https://en.wikipedia.org/wiki/User_story). Використовуйте будь-які потрібні вам бібліотеки чи API (прикладні програмні інтерфейси). Проявіть при цьому свій власний стиль.
+**Правило №2:** виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
 **Історія користувача:** Я можу побачити погоду у своєму поточному місцеперебуванні.
 
@@ -20,11 +20,11 @@ dashedName: show-the-local-weather
 
 **Історія користувача:** Я можу натиснути кнопку для перемикання між Фаренгейтом та Цельсієм.
 
-**Примітка:** Тепер багато інтернет-браузерів вимагають безпечне HTTP з'єднання (`https://`), щоб отримати місцеперебування користувача через геолокацію HTML5. Через це ми рекомендуємо використовувати геолокацію HTML5 для того, щоб отримати локацію користувача, а потім використовувати freeCodeCam API погоди <https://weather-proxy.freecodecamp.rocks/>, який використовує безпечне з'єднання HTTP для погоди. Крім цього, упевніться, що з'єднання з [CodePen.io](https://codepen.io) відбувається через `https://`.
+**Примітка:** Тепер багато інтернет-браузерів вимагають безпечне HTTP з'єднання (`https://`), щоб отримати місцеперебування користувача через геолокацію HTML5. For this reason, we recommend using HTML5 Geolocation to get user location and then use the freeCodeCamp Weather API <a href="https://weather-proxy.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://weather-proxy.freecodecamp.rocks/</a> which uses an HTTP Secure connection for the weather. Also, be sure to connect to <a href="https://codepen.io" target="_blank" rel="noopener noreferrer nofollow">CodePen.io</a> via `https://`.
 
 Після завершення додайте посилання на ваш проєкт на CodePen та натисніть на кнопку "Завдання виконано".
 
-Ви можете отримати відгук про ваш проєкт, поділившись ним на форумі freeCodeCamp [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
index 4d84a540c1a..cb7b00b5cbd 100644
--- a/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
+++ b/curriculum/challenges/ukrainian/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
@@ -8,25 +8,25 @@ dashedName: use-the-twitch-json-api
 
 # --description--
 
-**Мета:** Створити додаток [CodePen.io](https://codepen.io), який за функціями схожий на цей: [ https://codepen.io/freeCodeCamp/full/Myvqmo/](https://codepen.io/freeCodeCamp/full/Myvqmo/).
+**Мета:** Створити застосунок, функціонально схожий до цього: <a href="https://codepen.io/freeCodeCamp/full/Myvqmo/" target="_blank" rel="noopener noreferrer nofollow">https://codepen.io/freeCodeCamp/full/Myvqmo/</a>.
 
-Виконайте наведені нижче [історії користувача](https://en.wikipedia.org/wiki/User_story). Використовуйте необхідні вам бібліотеки або API. Виконайте завдання у власному стилі.
+The Twitch API is a RESTful API that lets developers build creative integrations for the broader Twitch community.
 
-**Історія користувача:** Я можу бачити чи зараз freeCodeCamp транслюється на Twitch.tv.
+Виконайте історію користувача та пройдіть тести. Використовуйте необхідні вам бібліотеки або API. Оформте за власним стилем.
 
-**Історія користувача:** Я можу натиснути на статус користувача і безпосередньо перейти на канал freeCodeCamp на Twitch.tv.
+**User Story:** I can see whether freeCodeCamp is currently streaming on Twitch.tv.
 
-**Історія користувача:** Якщо користувач Twitch на цей момент проводить трансляцію, я можу подивитись додаткову інформацію про що вона.
+**User Story:** I can click the status output and be sent directly to the freeCodeCamp's Twitch.tv channel.
 
-**Підказка:** Відповідна документація про JSON API на Twitch.tv тут: <https://dev.twitch.tv/docs/api/reference/#get-streams>.
+**User Story:** If a Twitch user is currently streaming, I can see additional details about what they are streaming.
 
 **Підказка:** Ось перелік імен користувачів, хто регулярно проводить трансляції: `["ESL_SC2", "OgamingSC2", "cretetion", "freecodecamp", "storbeck", "habathcx", "RobotCaleb", "noobs2ninjas"]`
 
-**UPDATE:** Через зміни в умовах користування API Twitch.tv вимагає ключ доступу API, але ми створили спосіб його обійти. Використовуйте <https://twitch-proxy.freecodecamp.rocks/> замість базового посилання на API Twitch (наприклад, `https://api.twitch.tv/helix` ), і ви теж зможете отримати інформацію облікового запису без реєстрації для отримання ключа доступу API.
+**UPDATE:** Через зміни в умовах користування API Twitch.tv вимагає ключ доступу API, але ми створили спосіб його обійти. Use <a href="https://twitch-proxy.freecodecamp.rocks/" target="_blank" rel="noopener noreferrer nofollow">https://twitch-proxy.freecodecamp.rocks/</a> instead of Twitch's API base URL and you'll still be able to get account information, without needing to sign up for an API key.
 
 Після завершення додайте посилання на ваш проєкт на CodePen та натисніть на кнопку "Завдання виконано".
 
-Ви можете отримати відгук про ваш проєкт, поділившись ним на форумі: [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+You can get feedback on your project by sharing it on the <a href="https://forum.freecodecamp.org/c/project-feedback/409" target="_blank" rel="noopener noreferrer nofollow">freeCodeCamp forum</a>.
 
 # --solutions--
 
diff --git a/curriculum/challenges/ukrainian/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md b/curriculum/challenges/ukrainian/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md
index 9db6592ed26..1891cdd30f7 100644
--- a/curriculum/challenges/ukrainian/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md
+++ b/curriculum/challenges/ukrainian/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md
@@ -8,15 +8,48 @@ dashedName: book-recommendation-engine-using-knn
 
 # --description--
 
-У цьому завданні ви створите алгоритм книжкових рекомендації, використовуючи K-Nearest Neighbours.
+Ви будете <a href="https://colab.research.google.com/github/freeCodeCamp/boilerplate-book-recommendation-engine/blob/master/fcc_book_recommendation_knn.ipynb" target="_blank" rel="noopener noreferrer nofollow">працювати над цим проєктом з Google Colaboratory</a>.
 
-Ви будете використовувати набір даних Book-Crossing. Цей набір даних містить1.1 млн. рейтингів (масштаб 1-10) 270 000 книг від 90,000 користувачів.
+Перейшовши за цим посиланням, створіть копію блокнота в своєму обліковому записі або локально. Як тільки ви завершили проєкт та пройшли тести (доданий до посилання), здайте посилання на свій проєкт. If you are submitting a Google Colaboratory link, make sure to turn on link sharing for "anyone with the link."
 
-Ви можете отримати доступ до [ вичерпних інструкцій по проєкту та початкового коду для Google Colaboratory](https://colab.research.google.com/github/freeCodeCamp/boilerplate-book-recommendation-engine/blob/master/fcc_book_recommendation_knn.ipynb).
+We are still developing the interactive instructional content for the machine learning curriculum. Поки ви можете переглянути відеозавдання цієї сертифікації. You may also have to seek out additional learning resources, similar to what you would do when working on a real-world project.
 
-Перейшовши за цим посиланням, створіть копію блокнота з вашого акаунту або локально. Завершивши проєкт та тестування ( додане за цим посиланням), створіть посилання на проєкт нижче. Якщо ви надаєте посилання на Google Colaboratory, переконайтеся, що ви увімкнули режим доступу "для усіх за цим посиланням"
+# --instructions--
 
-Ми все ще в процесі розробки інтерактивної навчальної складової для машинного навчального курсу. Наразі ви можете скористатися відео-викликами з цієї сертифікації. Вам також можуть знадобитися додаткові навчальні ресурси, так само як під час роботи із повноцінним проєктом.
+In this challenge, you will create a book recommendation algorithm using **K-Nearest Neighbors**.
+
+You will use the <a href="http://www2.informatik.uni-freiburg.de/~cziegler/BX/" target="_blank" rel="noopener noreferrer nofollow">Book-Crossings dataset</a>. This dataset contains 1.1 million ratings (scale of 1-10) of 270,000 books by 90,000 users.
+
+After importing and cleaning the data, use `NearestNeighbors` from `sklearn.neighbors` to develop a model that shows books that are similar to a given book. The Nearest Neighbors algorithm measures the distance to determine the “closeness” of instances.
+
+Create a function named `get_recommends` that takes a book title (from the dataset) as an argument and returns a list of 5 similar books with their distances from the book argument.
+
+This code:
+
+```py
+get_recommends("The Queen of the Damned (Vampire Chronicles (Paperback))")
+```
+
+should return:
+
+```py
+[
+  'The Queen of the Damned (Vampire Chronicles (Paperback))',
+  [
+    ['Catch 22', 0.793983519077301], 
+    ['The Witching Hour (Lives of the Mayfair Witches)', 0.7448656558990479], 
+    ['Interview with the Vampire', 0.7345068454742432],
+    ['The Tale of the Body Thief (Vampire Chronicles (Paperback))', 0.5376338362693787],
+    ['The Vampire Lestat (Vampire Chronicles, Book II)', 0.5178412199020386]
+  ]
+]
+```
+
+Notice that the data returned from `get_recommends()` is a list. The first element in the list is the book title passed into the function. The second element in the list is a list of five more lists. Each of the five lists contains a recommended book and the distance from the recommended book to the book passed into the function.
+
+If you graph the dataset (optional), you will notice that most books are not rated frequently. To ensure statistical significance, remove from the dataset users with less than 200 ratings and books with less than 100 ratings.
+
+The first three cells import libraries you may need and the data to use. The final cell is for testing. Write all your code in between those cells.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md b/curriculum/challenges/ukrainian/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md
index 81b41a42618..e4d7be2c682 100644
--- a/curriculum/challenges/ukrainian/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md
+++ b/curriculum/challenges/ukrainian/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md
@@ -8,13 +8,97 @@ dashedName: cat-and-dog-image-classifier
 
 # --description--
 
-Для цього завдання ви будете використовувати TensorFlow 2.0 та Keras, щоб створити звивисту нейронну систему, яка б чітко визначала зображення котів та собак із мінімум 63-відсотковою точністю.
+Ви будете <a href="https://colab.research.google.com/github/freeCodeCamp/boilerplate-cat-and-dog-image-classifier/blob/master/fcc_cat_dog.ipynb" target="_blank" rel="noopener noreferrer nofollow">працювати над цим проєктом з Google Colaboratory</a>.
 
-Ви можете отримати доступ до [ вичерпних інструкцій по проєкту та початкового коду для Google Colaboratory](https://colab.research.google.com/github/freeCodeCamp/boilerplate-cat-and-dog-image-classifier/blob/master/fcc_cat_dog.ipynb).
+Перейшовши за цим посиланням, створіть копію блокнота в своєму обліковому записі або локально. Як тільки ви завершили проєкт та пройшли тести (доданий до посилання), здайте посилання на свій проєкт. If you are submitting a Google Colaboratory link, make sure to turn on link sharing for "anyone with the link."
 
-Перейшовши за цим посиланням, створіть копію блокнота з вашого акаунту або локально. Завершивши проєкт та тестування ( додане за цим посиланням), створіть посилання на проєкт нижче. Якщо ви надаєте посилання на Google Colaboratory, переконайтеся, що ви увімкнули режим доступу "для усіх за цим посиланням"
+We are still developing the interactive instructional content for the machine learning curriculum. Поки ви можете переглянути відеозавдання цієї сертифікації. You may also have to seek out additional learning resources, similar to what you would do when working on a real-world project.
 
-Ми вже ще в процесі розробки інтерактивної навчальної складової для машинного навчального курсу. Наразі ви можете скористатися відео-викликами з цієї сертифікації. Вам також можуть знадобитися додаткові навчальні ресурси, так само як під час роботи із повноцінним проєктом.
+# --instructions--
+
+For this challenge, you will complete the code  to classify images of dogs and cats. You will use TensorFlow 2.0 and Keras to create a convolutional neural network that correctly classifies images of cats and dogs at least 63% of the time. (Extra credit if you get it to 70% accuracy!)
+
+Some of the code is given to you but some code you must fill in to complete this challenge. Read the instruction in each text cell so you will know what you have to do in each code cell.
+
+The first code cell imports the required libraries. The second code cell downloads the data and sets key variables. The third cell is the first place you will write your own code.
+
+The structure of the dataset files that are downloaded looks like this (You will notice that the test directory has no subdirectories and the images are not labeled):
+
+```py
+cats_and_dogs
+|__ train:
+    |______ cats: [cat.0.jpg, cat.1.jpg ...]
+    |______ dogs: [dog.0.jpg, dog.1.jpg ...]
+|__ validation:
+    |______ cats: [cat.2000.jpg, cat.2001.jpg ...]
+    |______ dogs: [dog.2000.jpg, dog.2001.jpg ...]
+|__ test: [1.jpg, 2.jpg ...]
+```
+
+You can tweak epochs and batch size if you like, but it is not required.
+
+The following instructions correspond to specific cell numbers, indicated with a comment at the top of the cell (such as `# 3`).
+
+## Cell 3
+
+Now it is your turn! Set each of the variables in this cell correctly. (They should no longer equal `None`.)
+
+Create image generators for each of the three image data sets (train, validation, test). Use `ImageDataGenerator` to read / decode the images and convert them into floating point tensors. Use the `rescale` argument (and no other arguments for now) to rescale the tensors from values between 0 and 255 to values between 0 and 1.
+
+For the `*_data_gen` variables, use the `flow_from_directory` method. Pass in the batch size, directory, target size (`(IMG_HEIGHT, IMG_WIDTH)`), class mode, and anything else required. `test_data_gen` will be the trickiest one. For `test_data_gen`, make sure to pass in `shuffle=False` to the `flow_from_directory` method. This will make sure the final predictions stay is in the order that our test expects. For `test_data_gen` it will also be helpful to observe the directory structure.
+
+
+After you run the code, the output should look like this:
+
+```py
+Found 2000 images belonging to 2 classes.
+Found 1000 images belonging to 2 classes.
+Found 50 images belonging to 1 class.
+```
+
+## Cell 4
+
+The `plotImages` function will be used a few times to plot images. It takes an array of images and a probabilities list, although the probabilities list is optional. This code is given to you. If you created the `train_data_gen` variable correctly, then running this cell will plot five random training images.
+
+## Cell 5
+
+Recreate the `train_image_generator` using `ImageDataGenerator`.
+
+Since there are a small number of training examples, there is a risk of overfitting. One way to fix this problem is by creating more training data from existing training examples by using random transformations.
+
+Add 4-6 random transformations as arguments to `ImageDataGenerator`. Make sure to rescale the same as before.
+
+## Cell 6
+
+You don't have to do anything for this cell. `train_data_gen` is created just like before but with the new `train_image_generator`. Then, a single image is plotted five different times using different variations.
+
+## Cell 7
+
+In this cell, create a model for the neural network that outputs class probabilities. It should use the Keras Sequential model. It will probably involve a stack of Conv2D and MaxPooling2D layers and then a fully connected layer on top that is activated by a ReLU activation function.
+
+Compile the model passing the arguments to set the optimizer and loss. Also pass in `metrics=['accuracy']` to view training and validation accuracy for each training epoch.
+
+## Cell 8
+
+Use the `fit` method on your `model` to train the network. Make sure to pass in arguments for `x`, `steps_per_epoch`, `epochs`, `validation_data`, and `validation_steps`.
+
+## Cell 9
+
+Run this cell to visualize the accuracy and loss of the model.
+
+## Cell 10
+
+Now it is time to use your model to predict whether a brand new image is a cat or a dog.
+
+In this cell, get the probability that each test image (from `test_data_gen`) is a dog or a cat. `probabilities` should be a list of integers.
+
+Call the `plotImages` function and pass in the test images and the probabilities corresponding to each test image.
+
+After you run the cell, you should see all 50 test images with a label showing the percentage of "sure" that the image is a cat or a dog. The accuracy will correspond to the accuracy shown in the graph above (after running the previous cell). More training images could lead to a higher accuracy.
+
+## Cell 11
+
+Run this final cell to see if you passed the challenge or if you need to keep trying.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md b/curriculum/challenges/ukrainian/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md
index e3f9244ee48..70369f3d127 100644
--- a/curriculum/challenges/ukrainian/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md
+++ b/curriculum/challenges/ukrainian/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md
@@ -8,19 +8,33 @@ dashedName: linear-regression-health-costs-calculator
 
 # --description--
 
-У цьому завданні ви передбачите витрати на охорону здоров'я, використовуючи алгоритм регресії.
+Ви будете <a href="https://colab.research.google.com/github/freeCodeCamp/boilerplate-linear-regression-health-costs-calculator/blob/master/fcc_predict_health_costs_with_regression.ipynb" target="_blank" rel="noopener noreferrer nofollow">працювати над цим проєктом з Google Colaboratory</a>.
 
-Ви отримаєте набір даних, що містять інформацію про різних людей, враховуючи їхні витрати на охорону здоров'я. Використовуйте ці дані для прогнозування витрат на охорону здоров'я на основі нових даних.
+Перейшовши за цим посиланням, створіть копію блокнота в своєму обліковому записі або локально. Як тільки ви завершили проєкт та пройшли тести (доданий до посилання), здайте посилання на свій проєкт. If you are submitting a Google Colaboratory link, make sure to turn on link sharing for "anyone with the link."
 
-Ви можете отримати доступ до [ вичерпних інструкцій по проєкту та початкового коду для Google Colaboratory](https://colab.research.google.com/github/freeCodeCamp/boilerplate-linear-regression-health-costs-calculator/blob/master/fcc_predict_health_costs_with_regression.ipynb).
+We are still developing the interactive instructional content for the machine learning curriculum. Поки ви можете переглянути відеозавдання цієї сертифікації. You may also have to seek out additional learning resources, similar to what you would do when working on a real-world project.
 
-Перейшовши за цим посиланням, створіть копію блокнота з вашого акаунту або локально. Завершивши проєкт та тестування ( додане за цим посиланням), створіть посилання на проєкт нижче. Якщо ви надаєте посилання на Google Colaboratory, переконайтеся, що ви увімкнули режим доступу "для усіх за цим посиланням"
+# --instructions--
 
-Ми вже ще в процесі розробки інтерактивної навчальної складової для машинного навчального курсу. Наразі ви можете скористатися відео-викликами з цієї сертифікації. Вам також можуть знадобитися додаткові навчальні ресурси, так само як під час роботи із повноцінним проєктом.
+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.
+
+The first two cells of this notebook import libraries and the data.
+
+Make sure to convert categorical data to numbers. Use 80% of the data as the `train_dataset` and 20% of the data as the `test_dataset`.
+
+`pop` off the "expenses" column from these datasets to create new datasets called `train_labels` and `test_labels`. Use these labels when training your model.
+
+Create a model and train it with the `train_dataset`. Run the final cell in this notebook to check your model. The final cell will use the unseen `test_dataset` to check how well the model generalizes.
+
+To pass the challenge, `model.evaluate` must return a Mean Absolute Error of under 3500. This means it predicts health care costs correctly within $3500.
+
+The final cell will also predict expenses using the `test_dataset` and graph the results.
 
 # --hints--
 
-Він повинен пройти усі тести Python.
+Потрібно виконати всі тести Python.
 
 ```js
 
diff --git a/curriculum/challenges/ukrainian/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md b/curriculum/challenges/ukrainian/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md
index cdfb47d44ae..e7663e20d47 100644
--- a/curriculum/challenges/ukrainian/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md
+++ b/curriculum/challenges/ukrainian/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md
@@ -8,13 +8,21 @@ dashedName: neural-network-sms-text-classifier
 
 # --description--
 
-Під час цього випробування, вам потрібно створити модель машинного навчання, яка класифікуватиме SMS повідомлення як "ham" чи "спам". Повідомлення"ham" це звичайне повідомлення, надіслане другом. Повідомлення "спам" це реклама або повідомлення, надіслане компанією.
+Ви будете <a href="https://colab.research.google.com/github/freeCodeCamp/boilerplate-neural-network-sms-text-classifier/blob/master/fcc_sms_text_classification.ipynb" target="_blank" rel="noopener noreferrer nofollow">працювати над цим проєктом з Google Colaboratory</a>.
 
-Ви можете отримати доступ до [ усіх інструкцій проєкту та початкового коду на Google Colaboratory](https://colab.research.google.com/github/freeCodeCamp/boilerplate-neural-network-sms-text-classifier/blob/master/fcc_sms_text_classification.ipynb).
+Перейшовши за цим посиланням, створіть копію блокнота в своєму обліковому записі або локально. Як тільки ви завершили проєкт та пройшли тести (доданий до посилання), здайте посилання на свій проєкт. If you are submitting a Google Colaboratory link, make sure to turn on link sharing for "anyone with the link."
 
-Перейшовши за цим посиланням, створіть копію блокнота з вашого акаунту або локально. Завершивши проєкт та тестування ( доданий із цим посиланням), створіть посилання на проєкт нижче. Якщо ви надаєте посилання на Google Colaboratory, переконайтеся, що ви увімкнули режим доступу "для усіх за цим посиланням"
+We are still developing the interactive instructional content for the machine learning curriculum. Поки ви можете переглянути відеозавдання цієї сертифікації. You may also have to seek out additional learning resources, similar to what you would do when working on a real-world project.
 
-Ми вже ще в процесі розробки інтерактивної навчальної складової для машинного навчального курсу. Наразі ви можете скористатися відео-викликами з цієї сертифікації. Вам також можуть знадобитися додаткові навчальні ресурси, так само як під час роботи із повноцінним проєктом.
+# --instructions--
+
+В цьому завданні вам потрібно створити модель машинного навчання, яка класифікуватиме SMS повідомлення як «ham» або «спам». Повідомлення «ham» – це звичайне повідомлення, надіслане другом. Повідомлення «spam» – це реклама або повідомлення, надіслане компанією.
+
+Ви повинні створити функцію під назвою `predict_message`, яка приймає рядок повідомлення як аргумент та повертає список. Першим елементом у списку повинне бути число від нуля до одного, яке вказує на ймовірність «ham» (0) або «spam» (1). Другим елементом у списку повинне бути слово «ham» або «spam», залежно від того, що більш ймовірно.
+
+For this challenge, you will use the <a href="http://www.dt.fee.unicamp.br/~tiago/smsspamcollection/" target="_blank" rel="noopener noreferrer nofollow">SMS Spam Collection</a> dataset. The dataset has already been grouped into train data and test data.
+
+The first two cells import the libraries and data. The final cell tests your model and function. Add your code in between these cells.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md b/curriculum/challenges/ukrainian/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
index 171e1eebf7a..91e72a24845 100644
--- a/curriculum/challenges/ukrainian/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
+++ b/curriculum/challenges/ukrainian/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
@@ -8,13 +8,53 @@ dashedName: rock-paper-scissors
 
 # --description--
 
-В цьому завданні ви створите програму, щоб грати в камінь, ножиці, папір. Програма, яка обиратиме випадково, зазвичай виграватиме у 50 відсотках. Щоб виконати це завдання, ваша програма повинна зіграти матчі проти чотирьох різних ботів, вигравши принаймні 60% ігор у кожному матчі.
+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.
 
-Ви можете отримати доступ до [ вичерпних інструкцій по проєкту та початкового коду для Replit ](https://replit.com/github/freeCodeCamp/boilerplate-rock-paper-scissors).
+Ви будете <a href="https://replit.com/github/freeCodeCamp/boilerplate-rock-paper-scissors" target="_blank" rel="noopener noreferrer nofollow">працювати над цим проєктом з нашим стартовим кодом Replit</a>.
 
-Перейшовши за посиланням, створіть копію проєкту. Після завершення проєкту на основі інструкцій '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.
 
-Ми вже ще в процесі розробки інтерактивної навчальної складової для машинного навчального курсу. Наразі вам доведеться використовувати інші ресурси, щоб виконати це завдання.
+# --instructions--
+
+In the file `RPS.py` you are provided with a function called `player`. The function takes an argument that is a string describing the last move of the opponent ("R", "P", or "S"). The function should return a string representing the next move for it to play ("R", "P", or "S").
+
+A player function will receive an empty string as an argument for the first game in a match since there is no previous play.
+
+The file `RPS.py` shows an example function that you will need to update. The example function is defined with two arguments (`player(prev_play, opponent_history = [])`). The function is never called with a second argument so that one is completely optional. The reason why the example function contains a second argument (`opponent_history = []`) is because that is the only way to save state between consecutive calls of the `player` function. You only need the `opponent_history` argument if you want to keep track of the opponent_history.
+
+*Hint: To defeat all four opponents, your program may need to have multiple strategies that change depending on the plays of the opponent.*
+
+## Development
+
+Do not modify `RPS_game.py`. Write all your code in `RPS.py`. For development, you can use `main.py` to test your code.
+
+`main.py` imports the game function and bots from `RPS_game.py`.
+
+To test your code, play a game with the `play` function. The `play` function takes four arguments:
+
+- two players to play against each other (the players are actually functions)
+- the number of games to play in the match
+- an optional argument to see a log of each game. Set it to `True` to see these messages.
+
+```py
+play(player1, player2, num_games[, verbose])
+```
+
+For example, here is how you would call the function if you want `player` and `quincy` to play 1000 games against each other and you want to see the results of each game:
+
+```py
+play(player, quincy, 1000, verbose=True)
+```
+
+Натисніть кнопку «запустити» і `main.py` запуститься.
+
+## Testing
+
+The unit tests for this project are in `test_module.py`. We imported the tests from `test_module.py` to `main.py` for your convenience. Якщо ви видалите коментар в останньому рядку у `main.py`, тести запустяться автоматично, коли ви натиснете кнопку «запустити».
+
+## Submitting
+
+Copy your project's URL and submit it below.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md b/curriculum/challenges/ukrainian/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md
index ae787a0c686..f9e2c872ec7 100644
--- a/curriculum/challenges/ukrainian/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md
+++ b/curriculum/challenges/ukrainian/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md
@@ -14,7 +14,7 @@ dashedName: neural-networks-activation-functions
 
 ## --text--
 
-Яка функція активації переключає значення між -1 та 1?
+Which activation function squishes values between -1 and 1?
 
 ## --answers--
 
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
index c58d87f33a5..f61fe35513a 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148da157cc0bd0d06df5c0a.md
@@ -9,7 +9,7 @@ dashedName: step-56
 
 Щоб вирівняти блоки `input` один з одним, встановіть властивість `display` на `inline-block` для всіх елементів `input` та `label` в межах елементів `.info`.
 
-Також вирівняйте текст за правим краєм.
+Також вирівняйте текст елемента `label` за правим краєм.
 
 # --hints--
 
@@ -28,22 +28,14 @@ const display = gs('.info > label, .info > input') ?? gs('.info label, .info inp
 assert.equal(display, 'inline-block');
 ```
 
-Ви повинні надати елементам `input` та `label` властивість `text-align` зі значенням `right`.
+Ви повинні надати елементу `label` властивість `text-align` зі значенням `right`.
 
 ```js
 const gs = (s) => new __helpers.CSSHelp(document).getStyle(s)?.textAlign;
-const textAlign = gs('.info > label, .info > input') ?? gs('.info label, .info input') ?? gs('.info > input, .info > label') ?? gs('.info input, .info label');
+const textAlign = gs('.info > label') ?? gs('.info label');
 assert.equal(textAlign, 'right');
 ```
 
-Ви повинні встановити властивість `text-align: right` перед правилом `.info input`.
-
-```js
-const gs = (s) => new __helpers.CSSHelp(document).getStyleRule(s);
-assert(gs('.info input').isDeclaredAfter('.info label, .info input') || gs('.info input').isDeclaredAfter('.info > label, .info > input') || gs('.info input').isDeclaredAfter('.info > input, .info > label') || gs('.info input').isDeclaredAfter('.info input, .info label'));
-
-```
-
 # --seed--
 
 ## --seed-contents--
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
index 70074dfdfd5..6a989cbd1d2 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dc095264000dce348bf5.md
@@ -286,7 +286,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -297,6 +296,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 --fcc-editable-region--
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
index 1b9dafca4f8..30a2d991095 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dcaaf2e8750e6cb4501a.md
@@ -272,7 +272,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -283,6 +282,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
index 5e39d9873da..88117c78baa 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dd31d210990f0fb140f8.md
@@ -262,7 +262,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -273,6 +272,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
index 6f2834f084c..3d92da94b45 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148defa9c01520fb9d178a0.md
@@ -260,7 +260,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -271,6 +270,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
index 68521a35e04..4ad66f937c2 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148dfab9b54c110577de165.md
@@ -300,7 +300,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -311,6 +310,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
index 5bac8498ca0..d14ef866af6 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e0bcc13efd10f7d7a6a9.md
@@ -266,7 +266,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -277,6 +276,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
index 2004a830f3b..7143bf59691 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e161ecec9511941f8833.md
@@ -280,7 +280,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -291,6 +290,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
index 0047be9ff65..ace3fbfb87f 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e28706b34912340fd042.md
@@ -278,7 +278,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -289,6 +288,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
index cc2ae3300e3..f2084d61c42 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e335c1edd512d00e4691.md
@@ -260,7 +260,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -271,6 +270,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
index 39736bca1f8..aa5f973df6a 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e41c728f65138addf9cc.md
@@ -278,7 +278,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -289,6 +288,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
index e7ae37ffdd5..4c5986e1fc7 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-accessibility-by-building-a-quiz/6148e5aeb102e3142de026a2.md
@@ -280,7 +280,6 @@ input {
 
 .info label, .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info input {
@@ -291,6 +290,7 @@ input {
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .question-block {
@@ -603,12 +603,12 @@ input {
 .info label,
 .info input {
   display: inline-block;
-  text-align: right;
 }
 
 .info label {
   width: 10%;
   min-width: 55px;
+  text-align: right;
 }
 
 .info input {
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
index 423dd35f305..569e33884b4 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f33294a6af5e9188dbdb8f3.md
@@ -7,38 +7,33 @@ dashedName: step-5
 
 # --description--
 
-Назва кафе – `CAMPER CAFE`. Додайте елемент `h1` в межах елемента `body`. Напишіть назву кафе великими літерами, щоб вона виділялась.
+Час додати деякий вміст меню. Додайте елемент `main` в межі наявного елемента `body`. В кінцевому підсумку там буде ціна напоїв та десертів, які пропонує кафе.
 
 # --hints--
 
-Ви повинні мати початковий теґ `<h1>`.
+Ваш код повинен мати початковий теґ `<main>`.
 
 ```js
-assert(code.match(/<h1>/i));
+assert(code.match(/<main>/i));
 ```
 
-Ви повинні мати кінцевий теґ `</h1>`.
+Ваш код повинен мати кінцевий теґ `</main>`.
 
 ```js
-assert(code.match(/<\/h1>/i));
+assert(code.match(/<\/main>/i));
 ```
 
-Ви не повинні змінювати наявний елемент `body`.
+Ви не повинні змінювати наявний елемент `body`. Переконайтеся, що випадково не видалили кінцевий теґ.
 
 ```js
 assert($('body').length === 1);
 ```
 
-Ваш елемент `h1` повинен бути вкладеним в елементі `body`.
+Ваш теґ `main` повинен бути в межах теґу `body`.
 
 ```js
-assert($('h1')[0].parentElement.tagName === "BODY");
-```
-
-Ваш елемент `h1` повинен мати текст `CAMPER CAFE`.
-
-```js
-assert(code.match(/<h1>CAMPER CAFE<\/h1>/));
+const main = document.querySelector('main');
+assert(main.parentElement.tagName === 'BODY');
 ```
 
 # --seed--
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
index 6ad72e413a4..572fcd1cf02 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332a88dc25a0fd25c7687a.md
@@ -7,38 +7,38 @@ dashedName: step-6
 
 # --description--
 
-Щоб відвідувачі знали, що кафе було засновано в 2020, додайте елемент `p` під елементом `h1` з текстом `Est. 2020`.
+Назва кафе – `CAMPER CAFE`. Додайте елемент `h1` в межах елемента `main`. Напишіть назву кафе великими літерами, щоб вона виділялась.
 
 # --hints--
 
-Ви повинні мати початковий теґ `<p>`.
+Ви повинні мати початковий теґ `<h1>`.
 
 ```js
-assert(code.match(/<p>/i));
+assert(code.match(/<h1>/i));
 ```
 
-Ви повинні мати кінцевий теґ `</p>`.
+Ви повинні мати кінцевий теґ `</h1>`.
 
 ```js
-assert(code.match(/<\/p>/i));
+assert(code.match(/<\/h1>/i));
 ```
 
-Ви не повинні змінювати наявний елемент `h1`. Переконайтеся, що не видалили кінцевий теґ.
+Ви не повинні змінювати наявний елемент `main`.
 
 ```js
-assert($('h1').length === 1);
+assert($('main').length === 1);
 ```
 
-Ваш елемент `p` повинен бути під елементом `h1`.
+Ваш елемент `h1` повинен бути вкладеним в елементі `main`.
 
 ```js
-assert($('p')[0].previousElementSibling.tagName === 'H1');
+assert($('h1')[0].parentElement.tagName === "MAIN");
 ```
 
-Ваш елемент `p` повинен мати текст `Est. 2020`.
+Ваш елемент `h1` повинен мати текст `CAMPER CAFE`.
 
 ```js
-assert(document.querySelector("p").innerText === "Est. 2020");
+assert(code.match(/<h1>CAMPER CAFE<\/h1>/));
 ```
 
 # --seed--
@@ -54,7 +54,8 @@ assert(document.querySelector("p").innerText === "Est. 2020");
   </head>
   <body>
 --fcc-editable-region--
-    <h1>CAMPER CAFE</h1>
+    <main>
+    </main>
 --fcc-editable-region--
   </body>
 </html>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
index df4c93c8329..cd01f504a71 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f332b23c2045fb843337579.md
@@ -7,34 +7,38 @@ dashedName: step-7
 
 # --description--
 
-Оскільки доданий в минулому кроці елемент `p` надає додаткову інформацію про кафе, вкладіть елементи `h1` та `p` в елемент `header`.
+Щоб відвідувачі знали, що кафе було засновано в 2020 році, додайте елемент `p` під елементом `h1` з текстом `Est. 2020`.
 
 # --hints--
 
-Ви повинні мати початковий теґ `<header>`.
+Ви повинні мати початковий теґ `<p>`.
 
 ```js
-assert(code.match(/<header>/i));
+assert(code.match(/<p>/i));
 ```
 
-Ви повинні мати кінцевий теґ `</header>`.
+Ви повинні мати кінцевий теґ `</p>`.
 
 ```js
-assert(code.match(/<\/header>/i));
+assert(code.match(/<\/p>/i));
 ```
 
-Ваш елемент `h1` повинен бути вкладеним в елементі `header`.
+Ви не повинні змінювати наявний елемент `h1`. Переконайтеся, що не видалили кінцевий теґ.
 
 ```js
-const header = document.querySelectorAll('header')[0];
-assert(header.children[0].tagName === 'H1');
+assert($('h1').length === 1);
 ```
 
-Ваш елемент `p` повинен бути вкладеним в елементі `header`.
+Ваш елемент `p` повинен бути під елементом `h1`.
 
 ```js
-const header = document.querySelectorAll('header')[0];
-assert(header.children[1].tagName === "P");
+assert($('p')[0].previousElementSibling.tagName === 'H1');
+```
+
+Ваш елемент `p` повинен мати текст `Est. 2020`.
+
+```js
+assert(document.querySelector("p").innerText === "Est. 2020");
 ```
 
 # --seed--
@@ -49,10 +53,11 @@ assert(header.children[1].tagName === "P");
     <title>Cafe Menu</title>
   </head>
   <body>
+    <main>
 --fcc-editable-region--
-    <h1>CAMPER CAFE</h1>
-    <p>Est. 2020</p>
+      <h1>CAMPER CAFE</h1>
 --fcc-editable-region--
+    </main>
   </body>
 </html>
 ```
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md
index 89d3489efe1..0f593f14e62 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344f9c805cd193c33d829c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344f9c805cd193c33d829c
-title: Крок 12
+title: Крок 11
 challengeType: 0
-dashedName: step-12
+dashedName: step-11
 ---
 
 # --description--
@@ -56,11 +56,9 @@ assert(h1TextAlign === 'center');
 --fcc-editable-region--
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md
index 9448e341360..ccfdf1515ac 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fad8bf01691e71a30eb.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fad8bf01691e71a30eb
-title: Крок 11
+title: Крок 10
 challengeType: 0
-dashedName: step-11
+dashedName: step-10
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(code.match(/<head\s*>[\w\W\s]*<style\s*>[\w\W\s]*<\/style\s*>[\w\W\s]*<\/
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md
index 05df8d0604d..85466ead94b 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fbc22624a2976425065.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fbc22624a2976425065
-title: Крок 10
+title: Крок 9
 challengeType: 0
-dashedName: step-10
+dashedName: step-9
 ---
 
 # --description--
@@ -55,11 +55,9 @@ assert(h2.innerText === 'Coffee');
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
 --fcc-editable-region--
       <section>
       </section>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
index 2a279a00b03..4f4ba2fd1de 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f344fc1520b6719f2e35605.md
@@ -1,8 +1,8 @@
 ---
 id: 5f344fc1520b6719f2e35605
-title: Крок 9
+title: Крок 8
 challengeType: 0
-dashedName: step-9
+dashedName: step-8
 ---
 
 # --description--
@@ -32,8 +32,9 @@ assert($('main').length === 1);
 Ваш елемент `section` повинен бути в межах елемента `main`.
 
 ```js
-const main = document.querySelectorAll('main')?.[0];
-assert(main.children[0].tagName === 'SECTION');
+const main = document.querySelector('main');
+const section = document.querySelector('section');
+assert(section.parentElement === main);
 ```
 
 # --seed--
@@ -48,12 +49,10 @@ assert(main.children[0].tagName === 'SECTION');
     <title>Cafe Menu</title>
   </head>
   <body>
-    <header>
-      <h1>CAMPER CAFE</h1>
-      <p>Est. 2020</p>
-    </header>
 --fcc-editable-region--
     <main>
+      <h1>CAMPER CAFE</h1>
+      <p>Est. 2020</p>
     </main>
 --fcc-editable-region--
   </body>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md
index f63c4664210..8496594495a 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae34c1239cafe128be.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477ae34c1239cafe128be
-title: Крок 14
+title: Крок 13
 challengeType: 0
-dashedName: step-14
+dashedName: step-13
 ---
 
 # --description--
@@ -58,11 +58,9 @@ assert(selectors.length === 1);
 --fcc-editable-region--
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md
index 2b866db3aaa..d6a83c0e929 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae8466a9a3d2cc953c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477ae8466a9a3d2cc953c
-title: Крок 16
+title: Крок 15
 challengeType: 0
-dashedName: step-16
+dashedName: step-15
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert(!code.match(/style/i));
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md
index cb5808653ea..08c47e77f18 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477ae9675db8bb7655b30.md
@@ -1,13 +1,13 @@
 ---
 id: 5f3477ae9675db8bb7655b30
-title: Крок 13
+title: Крок 12
 challengeType: 0
-dashedName: step-13
+dashedName: step-12
 ---
 
 # --description--
 
-В попередніх кроках ви використовували <dfn>селектор типу</dfn> для стилізації елемента `h1`. Зцентруйте елементи `h2` та `p` з новим селектором типу для кожного.
+В попередніх кроках ви використовували <dfn>селектор типу</dfn> для стилізації елемента `h1`. Відцентруйте елементи `h2` та `p`, додавши новий селектор типу до кожного з наявних елементів `style`.
 
 # --hints--
 
@@ -18,6 +18,13 @@ const hasH1 = new __helpers.CSSHelp(document).getStyle('h1');
 assert(hasH1);
 ```
 
+Ви не повинні додавати новий теґ `style`. Додайте нові правила CSS до наявного тегу `style`.
+
+```js
+const hasManyStyleTags = document.querySelectorAll('style').length > 1;
+assert(!hasManyStyleTags);
+```
+
 Ви повинні додати новий селектор `h2`.
 
 ```js
@@ -72,11 +79,9 @@ assert(pTextAlign === 'center');
 --fcc-editable-region--
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
index eac544efa8c..fcfed21df4c 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477aefa51bfc29327200b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477aefa51bfc29327200b
-title: Крок 15
+title: Крок 14
 challengeType: 0
-dashedName: step-15
+dashedName: step-14
 ---
 
 # --description--
@@ -54,11 +54,9 @@ dashedName: step-15
     </style>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md
index 9b1acb7d1f0..102b239f67b 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb2e27333b1ab2b955.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477cb2e27333b1ab2b955
-title: Крок 17
+title: Крок 16
 challengeType: 0
-dashedName: step-17
+dashedName: step-16
 ---
 
 # --description--
@@ -68,11 +68,9 @@ assert(link.dataset.href == 'styles.css')
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md
index c551811ca31..1c92e520854 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cb303c5cb61b43aa9b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477cb303c5cb61b43aa9b
-title: Крок 19
+title: Крок 18
 challengeType: 0
-dashedName: step-19
+dashedName: step-18
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert(bodyBackground === 'brown');
     <link href="styles.css" rel="stylesheet"/>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md
index 16c2085be52..ff2468c1f26 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3477cbcb6ba47918c1da92.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3477cbcb6ba47918c1da92
-title: Крок 18
+title: Крок 17
 challengeType: 0
-dashedName: step-18
+dashedName: step-17
 ---
 
 # --description--
@@ -52,11 +52,9 @@ assert(meta[0].outerHTML.match(/content=('|")width=device-width, initial-scale=1
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md
index 2cc177458ff..90d350c6486 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f34a1fd611d003edeafd681.md
@@ -1,8 +1,8 @@
 ---
 id: 5f34a1fd611d003edeafd681
-title: Крок 20
+title: Крок 19
 challengeType: 0
-dashedName: step-20
+dashedName: step-19
 ---
 
 # --description--
@@ -39,11 +39,9 @@ assert(bodyBackground === 'burlywood');
     <link href="styles.css" rel="stylesheet"/>
   </head>
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
index c21a9691d41..b4a42633275 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60785e1f3e9850b6e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed60785e1f3e9850b6e
-title: Крок 25
+title: Крок 24
 challengeType: 0
-dashedName: step-25
+dashedName: step-24
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(!hasWidth);
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
index dbe3eb0e1c8..60d44d66e99 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed60a5decd94ab66986.md
@@ -1,9 +1,9 @@
 ---
 id: 5f356ed60a5decd94ab66986
-title: Крок 23
+title: Крок 22
 challengeType: 0
 removeComments: false
-dashedName: step-23
+dashedName: step-22
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(bodyCSS === "rgba(0, 0, 0, 0)")
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
index aee71c50fa6..40423f91fc0 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6199b0cdef1d2be8f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed6199b0cdef1d2be8f
-title: Крок 27
+title: Крок 26
 challengeType: 0
-dashedName: step-27
+dashedName: step-26
 ---
 
 # --description--
@@ -48,11 +48,9 @@ assert(!hasDiv);
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
index 11c8384b6f8..c5acff84e59 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63c7807a4f1e6d054.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed63c7807a4f1e6d054
-title: Крок 22
+title: Крок 21
 challengeType: 0
-dashedName: step-22
+dashedName: step-21
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(divWidth === '300px');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
index 54f8563877a..63ef8d38e7e 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed63e0fa262326eef05.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed63e0fa262326eef05
-title: Крок 24
+title: Крок 23
 challengeType: 0
-dashedName: step-24
+dashedName: step-23
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(divBackground === 'burlywood');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
index 7ea8c0ff351..854cdd1d024 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed656a336993abd9f7c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed656a336993abd9f7c
-title: Крок 26
+title: Крок 25
 challengeType: 0
-dashedName: step-26
+dashedName: step-25
 ---
 
 # --description--
@@ -49,11 +49,9 @@ assert(divMarginLeft === 'auto');
   </head>
   <body>
     <div>
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
index a254530a48e..4031b14d72f 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed69db0a491745e2bb6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed69db0a491745e2bb6
-title: Крок 28
+title: Крок 27
 challengeType: 0
-dashedName: step-28
+dashedName: step-27
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert($('div').attr('class').includes('menu'));
 --fcc-editable-region--
     <div>
 --fcc-editable-region--
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
index 967565d50a2..5681175b8f1 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f356ed6cf6eab5f15f5cfe6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f356ed6cf6eab5f15f5cfe6
-title: Крок 21
+title: Крок 20
 challengeType: 0
-dashedName: step-21
+dashedName: step-20
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(div.parentElement.tagName === 'BODY');
   </head>
 --fcc-editable-region--
   <body>
-    <header>
+    <main>
       <h1>CAMPER CAFE</h1>
       <p>Est. 2020</p>
-    </header>
-    <main>
       <section>
         <h2>Coffee</h2>
       </section>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md
index 849bac7b109..0fe1769377b 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c4321f818cdc4bed30.md
@@ -1,8 +1,8 @@
 ---
 id: 5f35e5c4321f818cdc4bed30
-title: Крок 30
+title: Крок 29
 challengeType: 0
-dashedName: step-30
+dashedName: step-29
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(article.previousElementSibling.tagName === 'H2');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
 --fcc-editable-region--
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md
index b805f3f8155..181ed77f1d3 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f35e5c44359872a137bd98f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f35e5c44359872a137bd98f
-title: Крок 29
+title: Крок 28
 challengeType: 0
-dashedName: step-29
+dashedName: step-28
 ---
 
 # --description--
@@ -55,11 +55,9 @@ assert(bodyBackground === `url("https://cdn.freecodecamp.org/curriculum/css-cafe
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
         </section>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
index dcdc43b5ed3..5f355d71a8f 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d0fc037f7311b4ac8.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d0fc037f7311b4ac8
-title: Крок 39
+title: Крок 38
 challengeType: 0
-dashedName: step-39
+dashedName: step-38
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(priceWidth === '50%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
index f9da4ae8dd7..9f2d12fd247 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d28d7ad0de6470505.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d28d7ad0de6470505
-title: Крок 33
+title: Крок 32
 challengeType: 0
-dashedName: step-33
+dashedName: step-32
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert($('.flavor')[0].innerText.match(/French Vanilla/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
index fec8cdbfeb1..88726bac4f6 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866d5414453fc2d7b480.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866d5414453fc2d7b480
-title: Крок 32
+title: Крок 31
 challengeType: 0
-dashedName: step-32
+dashedName: step-31
 ---
 
 # --description--
@@ -90,11 +90,9 @@ assert(children[1].innerText.match(/4\.50/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
 --fcc-editable-region--
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
index 7ab7fb22b39..51b05202de4 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866daec9a49519871816.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866daec9a49519871816
-title: Крок 31
+title: Крок 30
 challengeType: 0
-dashedName: step-31
+dashedName: step-30
 ---
 
 # --description--
@@ -52,11 +52,9 @@ assert(secondP.innerText.match(/3\.00/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
 --fcc-editable-region--
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
index 879f85add42..206e3213993 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dbf362f99b9a0c6d0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866dbf362f99b9a0c6d0
-title: Крок 38
+title: Крок 37
 challengeType: 0
-dashedName: step-38
+dashedName: step-37
 ---
 
 # --description--
@@ -53,11 +53,9 @@ assert(itemPDisplay === 'inline-block');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md
index b3fe0749a12..a4edabecd4b 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866dd0d0275f01d4d847.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866dd0d0275f01d4d847
-title: Крок 40
+title: Крок 39
 challengeType: 0
-dashedName: step-40
+dashedName: step-39
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(priceWidth === '49%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md
index b08cba5967f..ad897f856fe 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3c866de7a5b784048f94b1.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3c866de7a5b784048f94b1
-title: Крок 37
+title: Крок 36
 challengeType: 0
-dashedName: step-37
+dashedName: step-36
 ---
 
 # --description--
@@ -46,11 +46,9 @@ assert($('article')[0].className === 'item');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
 --fcc-editable-region--
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md
index c4125de5b12..91fcb9ed014 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade94c6576e7f7b7953f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade94c6576e7f7b7953f
-title: Крок 42
+title: Крок 41
 challengeType: 0
-dashedName: step-42
+dashedName: step-41
 ---
 
 # --description--
@@ -40,11 +40,9 @@ assert(priceWidth === '50%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md
index 68393974463..f1922c797d5 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9993019e26313fa8e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade9993019e26313fa8e
-title: Крок 43
+title: Крок 42
 challengeType: 0
-dashedName: step-43
+dashedName: step-42
 ---
 
 # --description--
@@ -51,11 +51,9 @@ assert(articles[4] === items[4]);
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md
index 83f96883e22..20aa079dc4e 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade99dda4e6071a85dfd.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade99dda4e6071a85dfd
-title: Крок 47
+title: Крок 46
 challengeType: 0
-dashedName: step-47
+dashedName: step-46
 ---
 
 # --description--
@@ -50,11 +50,9 @@ assert($('main').children('section').length === 2);
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
 --fcc-editable-region--
         <section>
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md
index c80f3dd1c51..d5eeabbbc93 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3cade9fa77275d9f4efe62.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3cade9fa77275d9f4efe62
-title: Крок 41
+title: Крок 40
 challengeType: 0
-dashedName: step-41
+dashedName: step-40
 ---
 
 # --description--
@@ -34,11 +34,9 @@ assert(code.match(/Vanilla<\/p><p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md
index f0d52ce880f..b322d7c8541 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e01f288a026d709587.md
@@ -1,15 +1,15 @@
 ---
 id: 5f3ef6e01f288a026d709587
-title: Крок 67
+title: Крок 66
 challengeType: 0
-dashedName: step-67
+dashedName: step-66
 ---
 
 # --description--
 
 Елемент `hr` можна використовувати для відображення дільника між секціями різного вмісту.
 
-Спочатку додайте елемент `hr` між першим елементом `header` та елементом `main`. Зауважте, що елементи `hr` є самозакривними.
+Спочатку додайте елемент `hr` між елементом `p` з класом `established` та першим елементом `section`. Зауважте, що елементи `hr` є самозакривними.
 
 # --hints--
 
@@ -20,10 +20,10 @@ assert(code.match(/<hr\s?\/?>/i));
 assert(!code.match(/<\/hr>/i));
 ```
 
-Ви не повинні змінювати наявний елемент `header`.
+Ви не повинні змінювати наявний елемент `p` з класом `established`.
 
 ```js
-assert($('header').length === 1);
+assert($('p.established').length === 1);
 ```
 
 Ви не повинні змінювати наявний елемент `main`.
@@ -32,11 +32,11 @@ assert($('header').length === 1);
 assert($('main').length === 1);
 ```
 
-Ваш елемент `hr` повинен бути між елементами `header` та `main`.
+Ваш елемент `hr` повинен бути між елементами `p` та `section`.
 
 ```js
-assert($('hr')[0].previousElementSibling.tagName === 'HEADER');
-assert($('hr')[0].nextElementSibling.tagName === 'MAIN');
+assert($('hr')[0].previousElementSibling.tagName === 'P');
+assert($('hr')[0].nextElementSibling.tagName === 'SECTION');
 ```
 
 # --seed--
@@ -55,11 +55,9 @@ assert($('hr')[0].nextElementSibling.tagName === 'MAIN');
   <body>
     <div class="menu">
 --fcc-editable-region--
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
index fe1de3bfc78..cc66e4d2566 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e03d719d5ac4738993.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e03d719d5ac4738993
-title: Крок 57
+title: Крок 56
 challengeType: 0
-dashedName: step-57
+dashedName: step-56
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(menuMaxWidth === '500px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
index 74104f37cf5..e12cc27efe5 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e04559b939080db057.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e04559b939080db057
-title: Крок 56
+title: Крок 55
 challengeType: 0
-dashedName: step-56
+dashedName: step-55
 ---
 
 # --description--
@@ -64,11 +64,9 @@ assert(menuPadding === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
index 70cb745db54..17b386be772 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e050279c7a4a7101d3.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e050279c7a4a7101d3
-title: Крок 55
+title: Крок 54
 challengeType: 0
-dashedName: step-55
+dashedName: step-54
 ---
 
 # --description--
@@ -63,11 +63,9 @@ assert(menuPaddingBottom === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
index 34e26665031..1b7725db5c4 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e05473f91f948724ab.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e05473f91f948724ab
-title: Крок 58
+title: Крок 57
 challengeType: 0
-dashedName: step-58
+dashedName: step-57
 ---
 
 # --description--
@@ -41,11 +41,9 @@ assert(bodyFontFamily === 'sans-serif');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
index 0789eca180b..77676bf3dbd 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e056bdde6ae6892ba2.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e056bdde6ae6892ba2
-title: Крок 59
+title: Крок 58
 challengeType: 0
-dashedName: step-59
+dashedName: step-58
 ---
 
 # --description--
@@ -54,11 +54,9 @@ assert($('h2').css('font-family').match(/impact/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
index cbdd4864ccd..b73919df0b1 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e06d34faac0447fc44.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e06d34faac0447fc44
-title: Крок 61
+title: Крок 60
 challengeType: 0
-dashedName: step-61
+dashedName: step-60
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(establishedFontStyle === 'italic');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md
index 673da2d26d6..c9285633074 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e07276f782bb46b93d.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e07276f782bb46b93d
-title: Крок 64
+title: Крок 63
 challengeType: 0
-dashedName: step-64
+dashedName: step-63
 ---
 
 # --description--
@@ -51,12 +51,10 @@ assert(footer.previousElementSibling.tagName === 'MAIN');
   </head>
   <body>
     <div class="menu">
-      <header>
-        <h1>CAMPER CAFE</h1>
-        <p class="established">Est. 2020</p>
-      </header>
 --fcc-editable-region--
       <main>
+        <h1>CAMPER CAFE</h1>
+        <p class="established">Est. 2020</p>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
index f7bbf30bcb2..8d153e17d10 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0819d4f23ca7285e6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0819d4f23ca7285e6
-title: Крок 49
+title: Крок 48
 challengeType: 0
-dashedName: step-49
+dashedName: step-48
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('section')[1].children[1].className === 'item');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
index af184bb4fae..edeabaf52a3 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e087d56ed3ffdc36be.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e087d56ed3ffdc36be
-title: Крок 62
+title: Крок 61
 challengeType: 0
-dashedName: step-62
+dashedName: step-61
 ---
 
 # --description--
@@ -45,13 +45,11 @@ assert($('.established').css('font-style') === 'italic');
   </head>
   <body>
     <div class="menu">
+      <main>
 --fcc-editable-region--
-      <header>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
 --fcc-editable-region--
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
index 2b0bbc7c083..d5b2e5218cd 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0a81099d9a697b550.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0a81099d9a697b550
-title: Крок 65
+title: Крок 64
 challengeType: 0
-dashedName: step-65
+dashedName: step-64
 ---
 
 # --description--
@@ -58,11 +58,9 @@ assert(document.querySelector("footer > p > a")?.href === "https://www.freecodec
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md
index 39d88d6991a..e3b96545941 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0b431cc215bb16f55.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0b431cc215bb16f55
-title: Крок 66
+title: Крок 65
 challengeType: 0
-dashedName: step-66
+dashedName: step-65
 ---
 
 # --description--
@@ -38,11 +38,9 @@ assert($('footer').children('p').last().text().match(/123 Free Code Camp Drive/i
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md
index da3b564325a..1d1fef1a781 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e0c3feaebcf647ad.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0e0c3feaebcf647ad
-title: Крок 48
+title: Крок 47
 challengeType: 0
-dashedName: step-48
+dashedName: step-47
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('h2')[1].innerText.match(/Desserts/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md
index 3763cb6a161..2a6c6711b6c 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0e9629bad967cd71e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0e9629bad967cd71e
-title: Крок 60
+title: Крок 59
 challengeType: 0
-dashedName: step-60
+dashedName: step-59
 ---
 
 # --description--
@@ -35,11 +35,9 @@ assert(fontFamily === 'Impact, serif');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md
index d10bc30f676..06a9e4fbabc 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0eaa7da26e3d34d78.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0eaa7da26e3d34d78
-title: Крок 54
+title: Крок 53
 challengeType: 0
-dashedName: step-54
+dashedName: step-53
 ---
 
 # --description--
@@ -56,11 +56,9 @@ assert(menuPaddingRight === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md
index f10b5eadfef..7fad7e4adeb 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3ef6e0f8c230bdd2349716.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3ef6e0f8c230bdd2349716
-title: Крок 63
+title: Крок 62
 challengeType: 0
-dashedName: step-63
+dashedName: step-62
 ---
 
 # --description--
@@ -56,11 +56,9 @@ assert(h2FontSize === '30px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
index 3a87592c17b..e333c955b68 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f3f26fa39591db45e5cd7a0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f3f26fa39591db45e5cd7a0
-title: Крок 68
+title: Крок 67
 challengeType: 0
-dashedName: step-68
+dashedName: step-67
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(hrHeight === '3px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md
index de991834627..3a3e3812208 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459225127805351a6ad057.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459225127805351a6ad057
-title: Крок 69
+title: Крок 68
 challengeType: 0
-dashedName: step-69
+dashedName: step-68
 ---
 
 # --description--
@@ -39,12 +39,10 @@ assert(hrBackgroundColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
index c03b2a3c88d..0d00bc4c584 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459a7ceb8b5c446656d88b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459a7ceb8b5c446656d88b
-title: Крок 70
+title: Крок 69
 challengeType: 0
-dashedName: step-70
+dashedName: step-69
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(hrBorderColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
index 4aa4c06dd9c..bc76606ac3e 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459cf202c2a3472fae6a9f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459cf202c2a3472fae6a9f
-title: Крок 71
+title: Крок 70
 challengeType: 0
-dashedName: step-71
+dashedName: step-70
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(hrHeight === '2px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
index 37544f37271..05607ffe925 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f459fd48bdc98491ca6d1a3.md
@@ -1,8 +1,8 @@
 ---
 id: 5f459fd48bdc98491ca6d1a3
-title: Крок 72
+title: Крок 71
 challengeType: 0
-dashedName: step-72
+dashedName: step-71
 ---
 
 # --description--
@@ -39,13 +39,11 @@ assert($('hr')[1].nextElementSibling.tagName === 'FOOTER');
   </head>
   <body>
     <div class="menu">
-      <header>
-        <h1>CAMPER CAFE</h1>
-        <p class="established">Est. 2020</p>
-      </header>
-      <hr>
 --fcc-editable-region--
       <main>
+        <h1>CAMPER CAFE</h1>
+        <p class="established">Est. 2020</p>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md
index 26bd0df6c29..e08c1fe20ee 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a05977e2fa49d9119437.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a05977e2fa49d9119437
-title: Крок 73
+title: Крок 72
 challengeType: 0
-dashedName: step-73
+dashedName: step-72
 ---
 
 # --description--
@@ -39,12 +39,10 @@ assert(bodyPadding === '20px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md
index f887f3bee6a..3840716f4c6 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a276c093334f0f6e9df4.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a276c093334f0f6e9df4
-title: Крок 74
+title: Крок 73
 challengeType: 0
-dashedName: step-74
+dashedName: step-73
 ---
 
 # --description--
@@ -63,12 +63,10 @@ assert(itemPMarginBottom === '5px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md
index 8cf9e70381f..84dfccacd8a 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a5a7c49a8251f0bdb527.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a5a7c49a8251f0bdb527
-title: Крок 75
+title: Крок 74
 challengeType: 0
-dashedName: step-75
+dashedName: step-74
 ---
 
 # --description--
@@ -47,12 +47,10 @@ assert(itemPFontSize === '18px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md
index 28b74577d8c..37045e96ed9 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45a66d4a2b0453301e5a26.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45a66d4a2b0453301e5a26
-title: Крок 79
+title: Крок 78
 challengeType: 0
-dashedName: step-79
+dashedName: step-78
 ---
 
 # --description--
@@ -54,12 +54,10 @@ assert(footerFontSize === '14px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md
index 7497792dce3..df9ee61569a 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b0731d39e15d54df4dfc.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b0731d39e15d54df4dfc
-title: Крок 80
+title: Крок 79
 challengeType: 0
-dashedName: step-80
+dashedName: step-79
 ---
 
 # --description--
@@ -48,12 +48,10 @@ assert(aColor === 'black');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md
index 38338a65295..c2e3ae93d19 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b25e7ec2405f166b9de1.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b25e7ec2405f166b9de1
-title: Крок 81
+title: Крок 80
 challengeType: 0
-dashedName: step-81
+dashedName: step-80
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(aVisitedColor === 'grey' || aVisitedColor === 'gray');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md
index 865555af1bd..5765feef922 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b3c93c027860d9298dbd.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b3c93c027860d9298dbd
-title: Крок 82
+title: Крок 81
 challengeType: 0
-dashedName: step-82
+dashedName: step-81
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(aHoverColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md
index b36d5a8f741..da83d47fe78 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b45d099f3e621fbbb256.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b45d099f3e621fbbb256
-title: Крок 83
+title: Крок 82
 challengeType: 0
-dashedName: step-83
+dashedName: step-82
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(aActiveColor === 'white');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md
index c8e7c3bd576..cf067b2ecaf 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b4c81cea7763550e40df.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b4c81cea7763550e40df
-title: Крок 84
+title: Крок 83
 challengeType: 0
-dashedName: step-84
+dashedName: step-83
 ---
 
 # --description--
@@ -40,12 +40,10 @@ assert(aActiveColor === 'brown');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md
index 601be6f6f32..f4ad4b9fb71 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f45b715301bbf667badc04a.md
@@ -1,8 +1,8 @@
 ---
 id: 5f45b715301bbf667badc04a
-title: Крок 85
+title: Крок 84
 challengeType: 0
-dashedName: step-85
+dashedName: step-84
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(h1MarginTop === '0px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md
index 1cf65ca8fb9..070e03b450c 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e270702a8456a664f0df.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e270702a8456a664f0df
-title: Крок 86
+title: Крок 85
 challengeType: 0
-dashedName: step-86
+dashedName: step-85
 ---
 
 # --description--
@@ -40,12 +40,10 @@ assert(h1MarginBottom === '15px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md
index 99078002aa4..982232f3668 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e36e745ead58487aabf2.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e36e745ead58487aabf2
-title: Крок 87
+title: Крок 86
 challengeType: 0
-dashedName: step-87
+dashedName: step-86
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(addressMarginBottom === '5px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md
index a7ca8675097..c976b32fce5 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e7a4750dd05b5a673920.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e7a4750dd05b5a673920
-title: Крок 88
+title: Крок 87
 challengeType: 0
-dashedName: step-88
+dashedName: step-87
 ---
 
 # --description--
@@ -44,12 +44,10 @@ assert($('.address')[0].innerText.match(/123 Free Code Camp Drive/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md
index dea249d7df9..4fc4b91b17b 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46e8284aae155c83015dee.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46e8284aae155c83015dee
-title: Крок 89
+title: Крок 88
 challengeType: 0
-dashedName: step-89
+dashedName: step-88
 ---
 
 # --description--
@@ -46,12 +46,10 @@ assert($('img').attr('alt').match(/coffee icon/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
 --fcc-editable-region--
           <h2>Coffee</h2>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md
index 603cb198723..0365436967b 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46ede1ff8fec5ba656b44c.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46ede1ff8fec5ba656b44c
-title: Крок 78
+title: Крок 77
 challengeType: 0
-dashedName: step-78
+dashedName: step-77
 ---
 
 # --description--
@@ -32,12 +32,10 @@ assert(code.match(/\/\*\s*FOOTER\s*\*\//i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md
index 163d5fe4908..d54680e68bd 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f46fc57528aa1c4b5ea7c2e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f46fc57528aa1c4b5ea7c2e
-title: Крок 76
+title: Крок 75
 challengeType: 0
-dashedName: step-76
+dashedName: step-75
 ---
 
 # --description--
@@ -49,12 +49,10 @@ assert(bottomLineMargin === '25px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md
index 1272a102d2b..8f53f8e8871 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f4701b942c824109626c3d8.md
@@ -1,8 +1,8 @@
 ---
 id: 5f4701b942c824109626c3d8
-title: Крок 77
+title: Крок 76
 challengeType: 0
-dashedName: step-77
+dashedName: step-76
 ---
 
 # --description--
@@ -38,12 +38,10 @@ assert($('hr')[1].className === 'bottom-line');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
index d41acaf9971..1cb015141f8 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475bb508746c16c9431d42.md
@@ -1,8 +1,8 @@
 ---
 id: 5f475bb508746c16c9431d42
-title: Крок 90
+title: Крок 89
 challengeType: 0
-dashedName: step-90
+dashedName: step-89
 ---
 
 # --description--
@@ -72,12 +72,10 @@ assert(imgMarginRight === 'auto');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
index fb284b8f0a6..e12b9bc300b 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f475e1c7f71a61d913836c6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f475e1c7f71a61d913836c6
-title: Крок 91
+title: Крок 90
 challengeType: 0
-dashedName: step-91
+dashedName: step-90
 ---
 
 # --description--
@@ -44,12 +44,10 @@ assert($('img').last().attr('alt').match(/pie icon/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md
index 3e45a552930..b57c3833bd5 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47633757ae3469f2d33d2e.md
@@ -1,8 +1,8 @@
 ---
 id: 5f47633757ae3469f2d33d2e
-title: Крок 46
+title: Крок 45
 challengeType: 0
-dashedName: step-46
+dashedName: step-45
 ---
 
 # --description--
@@ -42,11 +42,9 @@ assert(priceWidth === '25%');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md
index 9ae91acac1c..687f52be2cf 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f47fe7e31980053a8d4403b.md
@@ -1,8 +1,8 @@
 ---
 id: 5f47fe7e31980053a8d4403b
-title: Крок 92
+title: Крок 91
 challengeType: 0
-dashedName: step-92
+dashedName: step-91
 ---
 
 # --description--
@@ -42,12 +42,10 @@ assert(imgMarginTop === '-25px');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
@@ -209,12 +207,10 @@ a:active {
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p class="established">Est. 2020</p>
-      </header>
-      <hr>
-      <main>
+        <hr>
         <section>
           <h2>Coffee</h2>
           <img src="https://cdn.freecodecamp.org/curriculum/css-cafe/coffee.jpg" alt="coffee icon"/>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
index 1ead92c87f4..56aa515fe9b 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716ad029ee4053c7027a7a.md
@@ -1,8 +1,8 @@
 ---
 id: 5f716ad029ee4053c7027a7a
-title: Крок 50
+title: Крок 49
 challengeType: 0
-dashedName: step-50
+dashedName: step-49
 ---
 
 # --description--
@@ -50,11 +50,9 @@ assert($('article').last().children('p')[1].innerText.match(/1\.50/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
index 459ad4f32eb..06ce18f292e 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f716bee5838c354c728a7c5.md
@@ -1,8 +1,8 @@
 ---
 id: 5f716bee5838c354c728a7c5
-title: Крок 53
+title: Крок 52
 challengeType: 0
-dashedName: step-53
+dashedName: step-52
 ---
 
 # --description--
@@ -84,11 +84,9 @@ assert(!code.match(/<\/p>\s+<p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md
index f3eae2d8f8f..a68ad8ccfff 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7691dafd882520797cd2f0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7691dafd882520797cd2f0
-title: Крок 44
+title: Крок 43
 challengeType: 0
-dashedName: step-44
+dashedName: step-43
 ---
 
 # --description--
@@ -32,11 +32,9 @@ assert(!code.match(/<\/p>\s+<p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md
index c3dafea9bf6..2a5712ae10d 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7692f7c5b3ce22a57788b6.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7692f7c5b3ce22a57788b6
-title: Крок 45
+title: Крок 44
 challengeType: 0
-dashedName: step-45
+dashedName: step-44
 ---
 
 # --description--
@@ -62,11 +62,9 @@ assert(p[10] === price[4]);
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md
index 6f61c63556c..608989061d6 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769541be494f25449b292f.md
@@ -1,8 +1,8 @@
 ---
 id: 5f769541be494f25449b292f
-title: Крок 34
+title: Крок 33
 challengeType: 0
-dashedName: step-34
+dashedName: step-33
 ---
 
 # --description--
@@ -47,11 +47,9 @@ assert(flavorTextAlign === 'left');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md
index 051cca97d73..7505d8e92a9 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f76967fad478126d6552b0d.md
@@ -1,8 +1,8 @@
 ---
 id: 5f76967fad478126d6552b0d
-title: Крок 35
+title: Крок 34
 challengeType: 0
-dashedName: step-35
+dashedName: step-34
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('.price')[0].innerText.match(/3\.00/i));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md
index 2ed97d57b76..d83cbc15500 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f769702e6e33127d14aa120.md
@@ -1,8 +1,8 @@
 ---
 id: 5f769702e6e33127d14aa120
-title: Крок 36
+title: Крок 35
 challengeType: 0
-dashedName: step-36
+dashedName: step-35
 ---
 
 # --description--
@@ -44,11 +44,9 @@ assert($('.price').css('text-align') === 'right');
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md
index e2dba94b37b..07c25b6b963 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b87422a560036fd03ccff.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7b87422a560036fd03ccff
-title: Крок 51
+title: Крок 50
 challengeType: 0
-dashedName: step-51
+dashedName: step-50
 ---
 
 # --description--
@@ -50,11 +50,9 @@ assert(!code.match(/<\/p>\s+<p/));
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
index 87a95ff59a3..c4e5f642086 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-basic-css-by-building-a-cafe-menu/5f7b88d37b1f98386f04edc0.md
@@ -1,8 +1,8 @@
 ---
 id: 5f7b88d37b1f98386f04edc0
-title: Крок 52
+title: Крок 51
 challengeType: 0
-dashedName: step-52
+dashedName: step-51
 ---
 
 # --description--
@@ -35,11 +35,9 @@ assert(selector)
   </head>
   <body>
     <div class="menu">
-      <header>
+      <main>
         <h1>CAMPER CAFE</h1>
         <p>Est. 2020</p>
-      </header>
-      <main>
         <section>
           <h2>Coffee</h2>
           <article class="item">
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md
index f707dddb399..85190575db4 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-css-colors-by-building-a-set-of-colored-markers/616965351e74d4689eb6de30.md
@@ -7,9 +7,7 @@ dashedName: step-5
 
 # --description--
 
-Наприкінці використайте теґ `<meta>` `viewport`, щоб переконатися, що ваша сторінка виглядає однаково на всіх пристроях.
-
-Вкладіть самозакривний елемент `meta` в `head`. Надайте йому атрибут `name` зі значенням `viewport` та атрибут `content` зі значенням `width=device-width, initial-scale=1.0`.
+Додайте ще один самозакривний елемент `meta` в межах `head`. Надайте йому атрибут `name` зі значенням `viewport` та атрибут `content` зі значенням `width=device-width, initial-scale=1.0`, щоб сторінка виглядала на всіх пристроях одинаково.
 
 # --hints--
 
@@ -30,7 +28,8 @@ assert(code.match(/<\/meta>/i) === null);
 
 ```js
 const meta = [...document.querySelectorAll('meta')];
-const target = meta?.find(m => m?.getAttribute('name') === 'viewport' && m?.getAttribute('content') === 'width=device-width, initial-scale=1.0');
+const reValidContent = /^\s*width\s*=\s*device-width\s*,\s*initial-scale\s*=\s*1(?:\.0)?\s*$/;
+const target = meta?.find(m => m?.getAttribute('name') === 'viewport' && reValidContent.test(m?.getAttribute('content')));
 assert.exists(target);
 ```
 
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md
index adec72586e6..968d7ebd7a6 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc2385ff86c76b9248c6eb7.md
@@ -9,7 +9,7 @@ dashedName: step-5
 
 HTML5 має деякі елементи, що ідентифікують різні області вмісту. Ці елементи полегшують прочитання вашого HTML, а також допомагають з оптимізацією пошукової системи (SEO) та доступністю.
 
-Ідентифікуйте головну секцію цієї сторінки, додавши початковий теґ `<main>` після елемента `h1` та кінцевий теґ `</main>` після елемента `p`.
+Ідентифікуйте головну секцію цієї сторінки, додавши початковий теґ `<main>` перед елементом `h1` та кінцевий теґ `</main>` після елемента `p`.
 
 # --hints--
 
@@ -25,20 +25,20 @@ assert(document.querySelector('main'));
 assert(code.match(/<\/main\>/));
 ```
 
-Початковий теґ вашого елемента `main` повинен бути під елементом `h1`. Вони знаходяться в неправильному порядку.
+Початковий теґ вашого елемента `main` повинен бути під елементом `body`. Вони знаходяться в неправильному порядку.
 
 ```js
 const main = document.querySelector('main');
-assert.equal(main?.previousElementSibling?.tagName, "H1");
+assert.equal(main?.previousElementSibling, null);
 ```
 
-Початковий теґ вашого елемента `main` повинен бути над елементом `h2`. Вони знаходяться в неправильному порядку.
+Початковий теґ вашого елемента `main` повинен бути над елементом `h1`. Вони знаходяться в неправильному порядку.
 
 ```js
-const collection = [...document.querySelectorAll('main,h2')].map(
+const collection = [...document.querySelectorAll('main,h1')].map(
   (node) => node.nodeName
 );
-assert(collection.indexOf('MAIN') < collection.indexOf('H2'));
+assert(collection.indexOf('MAIN') < collection.indexOf('H1'));
 ```
 
 Кінцевий теґ вашого елемента `main` повинен бути під елементом `p`. Вони знаходяться в неправильному порядку.
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md
index 0abd1f4b24f..2034792a435 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23991f86c76b9248c6eb8.md
@@ -7,9 +7,9 @@ dashedName: step-6
 
 # --description--
 
-В попередньому кроці ви розмістили елементи `h2`, коментар та `p` в межах елемента `main`. Це називається *вкладеність*. Вкладені елементи потрібно розміщувати на два пробіли праворуч від елемента, в який вони вкладені. Цей інтервал називається відступом та використовується для полегшення читання HTML.
+В попередньому кроці ви розмістили елементи `h1`, `h2`, коментар та `p` в межах елемента `main`. Це називається *вкладеність*. Вкладені елементи потрібно розміщувати на два пробіли праворуч від елемента, в який вони вкладені. Цей інтервал називається відступом та використовується для полегшення читання HTML.
 
-Елемент `h2` та коментар мають відступ на два пробіли більше, ніж елемент `main` в коді нижче. Скористайтеся пробілом на клавіатурі, щоб додати ще два пробіли перед елементом `p`, щоб він також мав належний відступ.
+Елемент `h1`, елемент `h2` та коментар мають відступ на два пробіли більше, ніж елемент `main` в коді нижче. Скористайтеся пробілом на клавіатурі, щоб додати ще два пробіли перед елементом `p`, щоб він також мав належний відступ.
 
 # --hints--
 
@@ -34,7 +34,7 @@ assert(
 Ви не повинні змінювати відступ в рядку зі своїм елементом `h2`. Його початковий теґ має починатися через 6 пробілів від початку рядка. Ви можете перезапустити крок, щоб відновити оригінальний відступ.
 
 ```js
-assert(code.toLowerCase().match(/<main\>\s*\n\s{6}<h2>/));
+assert(code.toLowerCase().match(/<\/h1\>\s*\n\s{6}<h2>/));
 ```
 
 Ваш код повинен мати коментар. Ви видалили коментар з попереднього кроку.
@@ -89,9 +89,9 @@ assert(code.toLowerCase().match(/-->\s*\n\s{6}<p>/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
---fcc-editable-region--
+    --fcc-editable-region--
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
     <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md
index d16650061ff..05beab58fdb 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc23f9bf86c76b9248c6eba.md
@@ -47,8 +47,8 @@ assert(collection.indexOf('P') < collection.indexOf('IMG'));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md
index 29838463555..87a49973a1b 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24073f86c76b9248c6ebb.md
@@ -46,8 +46,8 @@ assert(!/\<img\s+src\s*=\s*https:\/\/cdn\.freecodecamp\.org\/curriculum\/cat-pho
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md
index 818d8dbc6c1..6800b1e9b2c 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24165f86c76b9248c6ebc.md
@@ -44,8 +44,8 @@ assert(altText.match(/A cute orange cat lying on its back\.?$/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md
index b122fcd53ae..4daa2b156d3 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dc24614f86c76b9248c6ebd.md
@@ -64,8 +64,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md
index e98ea6d8a19..9bdd5779c59 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ddbd81294d8ddc1510a8e56.md
@@ -41,8 +41,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more cat photos.</p>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md
index e8e96429d2b..784aba63ef6 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa22d1b521be39a3de7be0.md
@@ -9,7 +9,7 @@ dashedName: step-12
 
 У попередньому кроці ви перетворили слова `link to cat pictures` на посилання, розмістивши їх між початковим та кінцевим теґами прив’язки (`a`). Ви можете зробити те саме зі словами всередині елемента, наприклад елемента `p`.
 
-У тексті свого елемента `p` перетворіть слова `cat photos` на посилання `https://freecatphotoapp.com`, розмістивши ці слова всередині початкового та кінцевого теґів прив’язки (`a`).
+У тексті свого елемента `p` перетворіть слова `cat photos` на посилання `https://freecatphotoapp.com`, додавши початковий та кінцевий теґи прив'язки (`a`) навколо цих слів.
 
 
 # --hints--
@@ -55,8 +55,8 @@ assert(pText.match(/click here to view more cat photos\.?$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md
index 3829208f808..bcb00a09329 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa2407b521be39a3de7be1.md
@@ -40,8 +40,8 @@ assert(document.querySelector('a').getAttribute('target') === '_blank');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md
index dcbc031ad82..942456683ba 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa30b9eacea3f48c6300ad.md
@@ -73,8 +73,8 @@ assert(document.querySelector('img').parentNode.nodeName === 'A');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md
index 65acd86b56c..c39ae79cf75 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa3589eacea3f48c6300ae.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md
index 1edbd358cc9..84ba3b5daf0 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa371beacea3f48c6300af.md
@@ -64,8 +64,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md
index 3b570cfb467..86e2277aca4 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfa37b9eacea3f48c6300b0.md
@@ -37,10 +37,10 @@ assert(secondSectionLastElemNode.nodeName === 'UL');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
-      <h2>Cat Photos</h2>
+        <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
         <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
         <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
index b44b8ce1d35..01c2f3221b0 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb5ecbeacea3f48c6300b1.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md
index e5abf714924..ad5a1bbb7d0 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6250eacea3f48c6300b2.md
@@ -68,8 +68,8 @@ assert(!/\<img\s+.+\s+src\s*=\s*https:\/\/cdn\.freecodecamp\.org\/curriculum\/ca
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md
index 6d793b9f734..4b8c4905459 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb655eeacea3f48c6300b3.md
@@ -48,11 +48,11 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
-      <h2>Cat Photos</h2>
-      <!-- TODO: Add link to cat photos -->
+        <h2>Cat Photos</h2>
+        <!-- TODO: Add link to cat photos -->
         <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
         <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
       </section>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md
index c3d5058f22e..a53de520807 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5dfb6a35eacea3f48c6300b4.md
@@ -69,8 +69,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md
index 52ecf79a7e9..a895099a44b 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d0.md
@@ -55,8 +55,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md
index 55285d0b8a2..26a10d5de10 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d1.md
@@ -51,8 +51,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
index 88829eea7fd..8ddcd614ba9 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d2.md
@@ -62,8 +62,8 @@ assert.deepStrictEqual(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md
index 03d5cecab7e..38569ba0616 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d3.md
@@ -36,8 +36,8 @@ assert($('main > section')[1].lastElementChild.nodeName === 'FIGURE');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md
index bd5bb5821b5..872095b6dae 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d4.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
index 7d915d35077..693c8afa2a0 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d5.md
@@ -63,8 +63,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md
index b6688391d66..d662a460e54 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d6.md
@@ -45,8 +45,8 @@ assert($('form')[0].innerHTML.trim().length === 0);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md
index a97f46081f4..4cc66e97131 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d7.md
@@ -71,8 +71,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md
index 5a2683d3a4c..23309a2dfe8 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d8.md
@@ -64,8 +64,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md
index 7fe6aaa5d3c..83ca0f3ed77 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804d9.md
@@ -58,8 +58,8 @@ assert(!/\<\s*input\s+placeholder\s*=\s*cat\s+photo\s+url/i.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md
index 854ce5dda1c..96376a87471 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804da.md
@@ -47,8 +47,8 @@ assert(collection.indexOf('INPUT') < collection.indexOf('BUTTON'));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md
index 0bdc6f5aad0..dd44fbdc306 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804db.md
@@ -45,8 +45,8 @@ assert($('input')[0].getAttribute('required') === '');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
index 17ebdb7fc67..62347987b67 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dc.md
@@ -90,8 +90,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
index 43edb5e34cc..ef0c8ef1dae 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804dd.md
@@ -56,8 +56,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md
index 8a5ba02e66a..ce7a057888b 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804de.md
@@ -57,8 +57,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md
index aecfede1ac2..6f20ce6ec46 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804df.md
@@ -47,8 +47,8 @@ assert($('input')[0].id.match(/^indoor$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md
index b9324b1c92e..6511f431815 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e1.md
@@ -53,8 +53,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
index c1db8bfd3d8..ec8a27a74bc 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e2.md
@@ -75,8 +75,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md
index 4b1e54a6389..6aef934d225 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e3.md
@@ -66,8 +66,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md
index 8d5e294149a..a4ccca75d66 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e5.md
@@ -59,8 +59,8 @@ assert(!$('input[type="checkbox"]')[2].hasAttribute('checked'));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md
index db7c507eabc..12f4ecfd114 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e7.md
@@ -44,8 +44,8 @@ assert(document.querySelector('main').nextElementSibling.nodeName === 'FOOTER');
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md
index 8d9d8202234..86a49f71d1b 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e8.md
@@ -44,8 +44,8 @@ assert(extraSpacesRemoved.match(/No Copyright - freeCodeCamp\.org$/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md
index b8891ccd42f..456c95dcb72 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804e9.md
@@ -55,8 +55,8 @@ assert(pText.match(/^no copyright - freecodecamp.org$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md
index 10791de2d23..c0c5b54beec 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ea.md
@@ -46,8 +46,8 @@ assert(noSpaces.match(/\<\/head\>\<body\>/));
 <html>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
index 881c7312db7..eec0b05c959 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804eb.md
@@ -51,8 +51,8 @@ assert(document.title && document.title.toLowerCase() === 'catphotoapp');
   </head>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
index 85a89028b4e..e28a2609d6b 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ec.md
@@ -44,8 +44,8 @@ assert(code.match(/<html\s+lang\s*=\s*('|")en\1\s*>/gi));
     <title>CatPhotoApp</title>
   </head>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md
index 345adf82621..2af3d2518d4 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5ef9b03c81a63668521804ee.md
@@ -38,8 +38,8 @@ assert(noSpaces.match(/^\<\!DOCTYPEhtml\>\<html/));
   </head>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md
index 6f74aca13d6..e9df31d4959 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efada803cbd2bbdab94e332.md
@@ -61,8 +61,8 @@ assert(!/\<img\s+.+\s+src\s*=\s*https:\/\/cdn\.freecodecamp\.org\/curriculum\/ca
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md
index ab6b0fa5c84..e908d319fd7 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae0543cbd2bbdab94e333.md
@@ -60,8 +60,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md
index 0ed9cbb119d..f49fab319c5 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efae16e3cbd2bbdab94e334.md
@@ -84,8 +84,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md
index e7fd58c2ed3..7ab52707408 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb23e70dc218d6c85f89b1.md
@@ -58,8 +58,8 @@ assert(!/\<input\s+type\s*=\s*text/.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md
index a8922eaee3c..737cb819912 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efb2c990dc218d6c85f89b2.md
@@ -54,8 +54,8 @@ assert(!/\<\s*button\s+type\s*=\s*submit/i.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
index 0394fa1ee03..14de3a7a1e3 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc4f528d6a74d05e68af74.md
@@ -80,8 +80,8 @@ assert(labelElem.textContent.replace(/\s/g, '').match(/Loving/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md
index f99b10e9d3d..da533242065 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc518e8d6a74d05e68af75.md
@@ -42,8 +42,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md
index f460c6b7249..339e789491e 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc54138d6a74d05e68af76.md
@@ -30,8 +30,8 @@ assert($('input[type="checkbox"]')[0].id.match(/^loving$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md
index 60967ebce35..e286fc436d3 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5efc575c8d6a74d05e68af77.md
@@ -67,8 +67,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
index 57e8dd2cbb8..2655da27b4d 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f05a1d8e233dff4a68508d8.md
@@ -88,8 +88,8 @@ assert(code.match(/<\/label>\s*<label\s*>\s*<input [^>]+>\s*Outdoor/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md
index 419ed440c4f..bab7a32b7a4 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07be6ef7412fbad0c5626b.md
@@ -9,7 +9,7 @@ dashedName: step-16
 
 Перш ніж додавати будь-який новий вміст, вам слід використати елемент `section`, щоб відокремити вміст фотографій котів від майбутнього вмісту.
 
-Візьміть усі елементи, які зараз знаходяться в елементі `main`, та вкладіть їх в елемент `section`.
+Візьміть елементи `h2`, коментар, `p` та елемент прив'язки (`a`) і вкладіть їх в елемент `section`.
 
 # --hints--
 
@@ -35,10 +35,18 @@ assert(document.querySelector('section').parentNode.nodeName === 'MAIN');
 
 ```js
 const childrenOfSection = [...document.querySelector('section').childNodes];
-const foundElems = childrenOfSection.filter((child) => {
+const foundElements = childrenOfSection.filter((child) => {
   return ['H2', 'A', 'P'].includes(child.nodeName);
 });
-assert(foundElems.length === 3);
+assert(foundElements.length === 3);
+```
+
+Елемент `h1` не повинен бути вкладеним в елементі `section`.
+
+```js
+const childrenOfSection = [...document.querySelector('section').childNodes];
+const includesH1 = childrenOfSection.some((child) => child.nodeName === 'H1');
+assert.isFalse(includesH1);
 ```
 
 # --seed--
@@ -48,9 +56,9 @@ assert(foundElems.length === 3);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
---fcc-editable-region--
+    --fcc-editable-region--
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
       <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md
index 20888b6c5bd..fbe0616eec6 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07c98cdb9413cbd4b16750.md
@@ -64,8 +64,8 @@ assert(foundElems.length === 2);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
 --fcc-editable-region--
       <section>
         <h2>Cat Photos</h2>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md
index b5c085b9c6a..ddf799c731d 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f07fb1579dc934717801375.md
@@ -58,37 +58,37 @@ assert($('main > section')[2].children.length === 0);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
-      <h2>Cat Photos</h2>
-      <!-- TODO: Add link to cat photos -->
-      <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
-      <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
+        <h2>Cat Photos</h2>
+        <!-- TODO: Add link to cat photos -->
+        <p>Click here to view more <a target="_blank" href="https://freecatphotoapp.com">cat photos</a>.</p>
+        <a href="https://freecatphotoapp.com"><img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/relaxing-cat.jpg" alt="A cute orange cat lying on its back."></a>
       </section>
 --fcc-editable-region--
       <section>
-      <h2>Cat Lists</h2>
-      <h3>Things cats love:</h3>
-      <ul>
-        <li>cat nip</li>
-        <li>laser pointers</li>
-        <li>lasagna</li>
-      </ul>
-      <figure>
-        <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/lasagna.jpg" alt="A slice of lasagna on a plate.">
-        <figcaption>Cats <em>love</em> lasagna.</figcaption>  
-      </figure>
-      <h3>Top 3 things cats hate:</h3>
-      <ol>
-        <li>flea treatment</li>
-        <li>thunder</li>
-        <li>other cats</li>
-      </ol>
-      <figure>
-        <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/cats.jpg" alt="Five cats looking around a field.">
-        <figcaption>Cats <strong>hate</strong> other cats.</figcaption>  
-      </figure>
+        <h2>Cat Lists</h2>
+        <h3>Things cats love:</h3>
+        <ul>
+          <li>cat nip</li>
+          <li>laser pointers</li>
+          <li>lasagna</li>
+        </ul>
+        <figure>
+          <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/lasagna.jpg" alt="A slice of lasagna on a plate.">
+          <figcaption>Cats <em>love</em> lasagna.</figcaption>  
+        </figure>
+        <h3>Top 3 things cats hate:</h3>
+        <ol>
+          <li>flea treatment</li>
+          <li>thunder</li>
+          <li>other cats</li>
+        </ol>
+        <figure>
+          <img src="https://cdn.freecodecamp.org/curriculum/cat-photo-app/cats.jpg" alt="Five cats looking around a field.">
+          <figcaption>Cats <strong>hate</strong> other cats.</figcaption>  
+        </figure>
       </section>
 --fcc-editable-region--
     </main>
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md
index 5c6a11f705e..ce3ed9e4d71 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d48e7b435f13ab6550051.md
@@ -54,8 +54,8 @@ assert(extraSpacesRemoved.match(/Is your cat an indoor or outdoor cat\??$/i));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md
index 1664f891de9..8de5e6ace0c 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4ab1b435f13ab6550052.md
@@ -76,8 +76,8 @@ assert(fieldsetChildren[0].length > fieldsetChildren[1].length);
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md
index 7bab8128c51..bfa3702eee4 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f0d4d04b435f13ab6550053.md
@@ -60,8 +60,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md
index 60d0e2ac54c..2f78c5107f3 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a80975fc4bcae0edb3497.md
@@ -60,8 +60,8 @@ assert(outdoorRadioButton.getAttribute('value').match(/^outdoor$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md
index cc99955f7e2..9fa9521ab01 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/5f1a89f1190aff21ae42105a.md
@@ -48,8 +48,8 @@ assert(energeticCheckbox.getAttribute('value').match(/^energetic$/));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md
index 05bd913ac73..e9592ab8734 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62bb4009e3458a128ff57d5d.md
@@ -37,8 +37,8 @@ assert.equal(document.querySelector('head > meta')?.getAttribute('charset')?.toL
   </head>
 --fcc-editable-region--
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
@@ -106,8 +106,8 @@ assert.equal(document.querySelector('head > meta')?.getAttribute('charset')?.toL
     <title>CatPhotoApp</title>
   </head>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md
index f0e89ba4214..087f9b0463c 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/62dabe2ef403a12d5d295273.md
@@ -69,8 +69,8 @@ assert(
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <h2>Cat Photos</h2>
       <!-- TODO: Add link to cat photos -->
 --fcc-editable-region--
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md
index 7c4eb2a7632..90f761a9502 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-by-building-a-cat-photo-app/7cf9b03d81a65668421804c3.md
@@ -57,8 +57,8 @@ assert(!/\<\s*input\s+.*\s*=\s*catphotourl/.test(code));
 ```html
 <html>
   <body>
-    <h1>CatPhotoApp</h1>
     <main>
+      <h1>CatPhotoApp</h1>
       <section>
         <h2>Cat Photos</h2>
         <!-- TODO: Add link to cat photos -->
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md
index e33b2dd1e91..9c1dd2f923d 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f1922fcbd2410527b3bd89.md
@@ -6,8 +6,9 @@ dashedName: step-8
 ---
 
 # --description--
+Одиниця `vh` означає висоту вюпорту (viewport height) та відноситься до 1% від `height` вюпорту.
 
-Щоб покращити проєкт, дозвольте нам додати трохи CSS. Спочатку надайте `body` властивості `width` зі значенням `100%` та `height` зі значенням `100vh`.
+Настав час причепурити проєкт за допомогою CSS. Спочатку надайте `body` властивості `width` зі значенням `100%` та `height` зі значенням `100vh`.
 
 # --hints--
 
@@ -17,13 +18,13 @@ dashedName: step-8
 assert.exists(new __helpers.CSSHelp(document).getStyle('body'));
 ```
 
-Для `body` надайте `width` зі значенням `100%`.
+Ви повинні надати `body` властивість `width` зі значенням `100%`.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.width, '100%');
 ```
 
-Для `body` надайте `height` зі значенням `100vh`.
+Ви повинні надати `body` властивість `height` зі значенням `100vh`.
 
 ```js
 assert.equal(new __helpers.CSSHelp(document).getStyle('body')?.height, '100vh');
diff --git a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md
index deef4162abf..6809f348441 100644
--- a/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md
+++ b/curriculum/challenges/ukrainian/14-responsive-web-design-22/learn-html-forms-by-building-a-registration-form/60f803d5241e6a0433a523a1.md
@@ -6,6 +6,7 @@ dashedName: step-15
 ---
 
 # --description--
+Одиниця `rem` означає корінь `em` та відноситься до розміру шрифту елемента `html`.
 
 Оскільки елементи `label` є вбудованими за замовчуванням, всі вони зображаються пліч-о-пліч в одному рядку, що ускладнює читання тексту. Щоб вони зображалися в окремих рядках, додайте `display: block` до елемента `label` та додайте `margin` зі значенням `0.5rem 0`, щоб відокремити їх один від одного.
 
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c2fccf186146b59c6e96.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c2fccf186146b59c6e96.md
index 0f2fe813e63..a0b62abaecc 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c2fccf186146b59c6e96.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c2fccf186146b59c6e96.md
@@ -1,31 +1,31 @@
 ---
 id: 62a3c2fccf186146b59c6e96
-title: Step 36
+title: Крок 36
 challengeType: 0
 dashedName: step-36
 ---
 
 # --description--
 
-`button1` represents your first `button` element. These elements have a special property called `onclick`, which you can use to determine what happens when someone clicks that button. Properties in JavaScript can be accessed in a couple of ways - the first is with <dfn>dot notation</dfn>. Accessing the `onclick` property of a button would look like `button.onclick`.
+`button1` представляє ваш перший елемент `button`. Ці елементи мають спеціальну властивість під назвою `onclick`, яку можна використати для того, щоб визначити, що буде при натисканні на кнопку. Доступ до властивостей у JavaScript можна отримати кількома способами: одним з них є <dfn>крапкова нотація</dfn>. Отримання доступу до властивості `onclick` кнопки виглядатиме так: `button.onclick`.
 
-Use dot notation to set the `onclick` property of your `button1` to the variable `goStore`. This variable will be something you write later. Note that `button1` is already declared, so you do not need to use `let` or `const`.
+Використайте крапкову нотацію, щоб встановити властивість `onclick` для `button1` на змінну `goStore`. Ця змінна буде чимось, що ви напишете пізніше. Зауважте, що `button1` вже оголошено, тому вам не потрібно використовувати `let` або `const`.
 
 # --hints--
 
-You should use dot notation to access the `onclick` property of `button1`.
+Ви повинні використати крапкову нотацію, щоб отримати доступ до властивості `onclick` для `button1`.
 
 ```js
 assert.match(code, /button1\.onclick/);
 ```
 
-You should not use `let` or `const`.
+Ви не повинні використовувати `let` чи `const`.
 
 ```js
 assert.notMatch(code, /(let|const)\s+button1\.onclick/);
 ```
 
-You should set the `onclick` property of `button1` to the variable `goStore`.
+Ви повинні встановити властивість `onclick` для `button1` на змінну `goStore`.
 
 ```js
 assert.match(code, /button1\.onclick\s*=\s*goStore/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c4a0e52767482c5202d4.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c4a0e52767482c5202d4.md
index 73d0dc234d9..199a39b7fc7 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c4a0e52767482c5202d4.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c4a0e52767482c5202d4.md
@@ -1,47 +1,47 @@
 ---
 id: 62a3c4a0e52767482c5202d4
-title: Step 37
+title: Крок 37
 challengeType: 0
 dashedName: step-37
 ---
 
 # --description--
 
-Using the same syntax, set the `onclick` properties of `button2` and `button3` to `goCave` and `fightDragon` respectively.
+Використовуючи той самий синтаксис, встановіть властивості `onclick` для `button2` та `button3` на `goCave` та `fightDragon` відповідно.
 
 # --hints--
 
-You should use dot notation to access the `onclick` property of `button2`.
+Ви повинні використати крапкову нотацію, щоб отримати доступ до властивості `onclick` для `button2`.
 
 ```js
 assert.match(code, /button2\.onclick/);
 ```
 
-You should not use `let` or `const` to assign `button2.onclick`.
+Ви не повинні використовувати `let` чи `const`, щоб призначити `button2.onclick`.
 
 ```js
 assert.notMatch(code, /(let|const)\s+button2\.onclick/);
 ```
 
-You should set the `onclick` property of `button2` to the variable `goCave`.
+Ви повинні встановити властивість `onclick` для `button2` на змінну `goCave`.
 
 ```js
 assert.match(code, /button2\.onclick\s*=\s*goCave/);
 ```
 
-You should use dot notation to access the `onclick` property of `button3`.
+Ви повинні використати крапкову нотацію, щоб отримати доступ до властивості `onclick` для `button3`.
 
 ```js
 assert.match(code, /button3\.onclick/);
 ```
 
-You should not use `let` or `const` to assign `button3.onclick`.
+Ви не повинні використовувати `let` чи `const`, щоб призначити `button3.onclick`.
 
 ```js
 assert.notMatch(code, /(let|const)\s+button3\.onclick/);
 ```
 
-You should set the `onclick` property of `button3` to the variable `fightDragon`.
+Ви повинні встановити властивість `onclick` для `button3` на змінну `fightDragon`.
 
 ```js
 assert.match(code, /button3\.onclick\s*=\s*fightDragon/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c668afc43b4a134cca81.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c668afc43b4a134cca81.md
index 38a51618160..1ce694f6ef8 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c668afc43b4a134cca81.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3c668afc43b4a134cca81.md
@@ -1,13 +1,13 @@
 ---
 id: 62a3c668afc43b4a134cca81
-title: Step 38
+title: Крок 38
 challengeType: 0
 dashedName: step-38
 ---
 
 # --description--
 
-Functions are special tools that allow you to run sections of code at specific times. You can declare functions using the `function` keyword. Here is an example of a function called `functionName` - note the opening and closing curly braces. These indicate the section of code that is within the function.
+Функції – це особливі інструменти, які дозволяють виконувати секції коду у певний час. Ви можете оголосити функції за допомогою ключового слова `function`. Ось приклад функції під назвою `functionName`: зверніть увагу на початкові та кінцеві фігурні дужки. Вони вказують, що секція коду знаходиться у функції.
 
 ```js
 function functionName() {
@@ -15,29 +15,29 @@ function functionName() {
 }
 ```
 
-Create an empty function named `goStore`. This will match the `goStore` variable you used earlier.
+Створіть пусту функцію під назвою `goStore`. Вона відповідатиме змінній `goStore`, яку ви використали раніше.
 
 # --hints--
 
-You should declare `goStore` with the `function` keyword.
+Ви повинні оголосити `goStore` за допомогою ключового слова `function`.
 
 ```js
 assert.match(code, /function\s*goStore()/);
 ```
 
-`goStore` should be defined.
+`goStore` повинна бути визначеною.
 
 ```js
 assert.isDefined(goStore);
 ```
 
-`goStore` should be a function.
+`goStore` повинна бути функцією.
 
 ```js
 assert.isFunction(goStore);
 ```
 
-`goStore` should be an empty function.
+`goStore` повинна бути порожньою функцією.
 
 ```js
 assert.equal(goStore.toString(), "function goStore() {}");
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md
index 490ea3e8e2f..cddf474092f 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a3cfc8328d3351b95d4f61.md
@@ -1,50 +1,50 @@
 ---
 id: 62a3cfc8328d3351b95d4f61
-title: Step 42
+title: Крок 42
 challengeType: 0
 dashedName: step-42
 ---
 
 # --description--
 
-The `innerText` property controls the text that appears in an HTML element. For example:
+Властивість `innerText` контролює текст, який з'являється в елементі HTML. Наприклад:
 
 ```js
 const info = document.querySelector("#info");
 info.innerText = "Hello World";
 ```
 
-This code would change the element assigned to the `div` variable to have the text `Hello World`. 
+Цей код змінить елемент, який призначено змінній `div`, щоб той мав текст `Hello World`.
 
-When a player clicks your `Go to store` button, you want to change the buttons and text. Remove the code inside the `goStore` function and add a line that updates the text of `button1` to say `Buy 10 health (10 gold)`.
+Якщо гравець натискає на кнопку `Go to store`, потрібно, щоб змінювались кнопки та текст. Видаліть код всередині функції `goStore` та додайте рядок, який оновлює текст для `button1` на `Buy 10 health (10 gold)`.
 
 # --hints--
 
-You should not have a `console.log("Going to store.");` line in your code.
+Вам не потрібен рядок `console.log("Going to store.");` у своєму коді.
 
 ```js
 assert.notMatch(code, /console.log\(('|")Going to store\.\1\)/);
 ```
 
-You should use dot notation to access the `innerText` property of `button1`.
+Ви повинні використати крапкову нотацію, щоб отримати доступ до властивості `innerText` для `button1`.
 
 ```js
 assert.match(code, /button1\.innerText/);
 ```
 
-You should not use `let` or `const` to access the `innerText` property of `button1`.
+Ви не повинні використовувати `let` чи `const` для доступу до властивості `innerText` для `button1`.
 
 ```js
 assert.notMatch(code, /(let|const)\s+button1.innerText/);
 ```
 
-You should update the `innerText` property of `button1` to be `Buy 10 health (10 gold)`.
+Ви повинні оновити властивість `innerText` для `button1` на `Buy 10 health (10 gold)`.
 
 ```js
 assert.match(code, /button1\.innerText\s*=\s*('|")Buy 10 health \(10 gold\)\1/);
 ```
 
-You should update the `innerText` property within your `goStore` function.
+Ви повинні оновити властивість `innerText` у своїй функції `goStore`.
 
 ```js
 assert.match(goStore.toString(), /button1\.innerText\s*=\s*('|")Buy 10 health \(10 gold\)\1/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7beb1ad61211ac153707f.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7beb1ad61211ac153707f.md
index 8d5c8d1245f..6e3d88259bc 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7beb1ad61211ac153707f.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7beb1ad61211ac153707f.md
@@ -1,59 +1,59 @@
 ---
 id: 62a7beb1ad61211ac153707f
-title: Step 43
+title: Крок 43
 challengeType: 0
 dashedName: step-43
 ---
 
 # --description--
 
-Now add a line that updates the text of `button2` to say `Buy weapon (30 gold)` and update the text of `button3` to say `Go to town square`.
+Тепер додайте рядок, який оновлює текст `button2` на `Buy weapon (30 gold)` та оновіть текст `button3` на `Go to town square`.
 
 # --hints--
 
-You should use dot notation to access the `innerText` property of `button2`.
+Ви повинні використати крапкову нотацію, щоб отримати доступ до властивості `innerText` для `button2`.
 
 ```js
 assert.match(code, /button2\.innerText/);
 ```
 
-You should not use `let` or `const` to access the `innerText` property of `button2`.
+Ви не повинні використовувати `let` чи `const` для доступу до властивості `innerText` для `button2`.
 
 ```js
 assert.notMatch(code, /(let|const)\s+button2.innerText/);
 ```
 
-You should update the `innerText` property of `button2` to be `Buy weapon (30 gold)`.
+Ви повинні оновити властивість `innerText` для `button2` на `Buy weapon (30 gold)`.
 
 ```js
 assert.match(code, /button2\.innerText\s*=\s*('|")Buy weapon \(30 gold\)\1/);
 ```
 
-You should update the `innerText` property within your `goStore` function.
+Ви повинні оновити властивість `innerText` у своїй функції `goStore`.
 
 ```js
 assert.match(goStore.toString(), /button2\.innerText\s*=\s*('|")Buy weapon \(30 gold\)\1/);
 ```
 
-You should use dot notation to access the `innerText` property of `button3`.
+Ви повинні використати крапкову нотацію, щоб отримати доступ до властивості `innerText` для `button3`.
 
 ```js
 assert.match(code, /button3\.innerText/);
 ```
 
-You should not use `let` or `const` to access the `innerText` property of `button3`.
+Ви не повинні використовувати `let` чи `const` для доступу до властивості `innerText` для `button3`.
 
 ```js
 assert.notMatch(code, /(let|const)\s+button3.innerText/);
 ```
 
-You should update the `innerText` property of `button3` to be `Go to town square`.
+Ви повинні оновити властивість `innerText` для `button3` на `Go to town square`.
 
 ```js
 assert.match(code, /button3\.innerText\s*=\s*('|")Go to town square\1/);
 ```
 
-You should update the `innerText` property within your `goStore` function.
+Ви повинні оновити властивість `innerText` у своїй функції `goStore`.
 
 ```js
 assert.match(goStore.toString(), /button3\.innerText\s*=\s*('|")Go to town square\1/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bf06d2ad9d1c5024e833.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bf06d2ad9d1c5024e833.md
index 981e39344f7..118b41d348a 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bf06d2ad9d1c5024e833.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bf06d2ad9d1c5024e833.md
@@ -1,83 +1,83 @@
 ---
 id: 62a7bf06d2ad9d1c5024e833
-title: Step 44
+title: Крок 44
 challengeType: 0
 dashedName: step-44
 ---
 
 # --description--
 
-You will also need to update the functions that run when the buttons are clicked. Update the `onclick` property for each button to run `buyHealth`, `buyWeapon`, and `goTown`, respectively.
+Вам також потрібно буде оновити функції, які будуть виконуватись, якщо натиснути на кнопку. Оновіть властивість `onclick` для кожної кнопки, щоб відповідно запустити `buyHealth`, `buyWeapon` та `goTown`.
 
 # --hints--
 
-You should use dot notation to access the `onclick` property of `button1`.
+Ви повинні використати крапкову нотацію, щоб отримати доступ до властивості `onclick` для `button1`.
 
 ```js
 assert.match(code, /button1\.onclick/);
 ```
 
-You should not use `let` or `const` to access the `onclick` property of `button1`.
+Ви не повинні використовувати `let` чи `const` для доступу до властивості `onclick` для `button1`.
 
 ```js
 assert.notMatch(code, /(let|const)\s+button1.onclick/);
 ```
 
-You should set the `onclick` property of `button1` to be `buyHealth`.
+Ви повинні встановити властивість `onclick` для `button1` на `buyHealth`.
 
 ```js
 assert.match(code, /button1\.onclick\s*=\s*buyHealth/);
 ```
 
-You should set the `onclick` property of `button1` in your `goStore` function.
+Ви повинні встановити властивість `onclick` для `button1` у своїй функції `goStore`.
 
 ```js
 assert.match(goStore.toString(), /button1\.onclick\s*=\s*buyHealth/);
 ```
 
-You should use dot notation to access the `onclick` property of `button2`.
+Ви повинні використати крапкову нотацію, щоб отримати доступ до властивості `onclick` для `button2`.
 
 ```js
 assert.match(code, /button2\.onclick/);
 ```
 
-You should not use `let` or `const` to access the `onclick` property of `button2`.
+Ви не повинні використовувати `let` чи `const` для доступу до властивості `onclick` для `button2`.
 
 ```js
 assert.notMatch(code, /(let|const)\s+button2.onclick/);
 ```
 
-You should set the `onclick` property of `button2` to be `buyWeapon`.
+Ви повинні встановити властивість `onclick` для `button2` на `buyWeapon`.
 
 ```js
 assert.match(code, /button2\.onclick\s*=\s*buyWeapon/);
 ```
 
-You should set the `onclick` property of `button2` in your `goStore` function.
+Ви повинні встановити властивість `onclick` для `button2` у своїй функції `goStore`.
 
 ```js
 assert.match(goStore.toString(), /button2\.onclick\s*=\s*buyWeapon/);
 ```
 
-You should use dot notation to access the `onclick` property of `button3`.
+Ви повинні використати крапкову нотацію, щоб отримати доступ до властивості `onclick` для `button3`.
 
 ```js
 assert.match(code, /button3\.onclick/);
 ```
 
-You should not use `let` or `const` to access the `onclick` property of `button3`.
+Ви не повинні використовувати `let` чи `const` для доступу до властивості `onclick` для `button3`.
 
 ```js
 assert.notMatch(code, /(let|const)\s+button3.onclick/);
 ```
 
-You should set the `onclick` property of `button3` to be `goTown`.
+Ви повинні встановити властивість `onclick` для `button3` на `goTown`.
 
 ```js
 assert.match(code, /button3\.onclick\s*=\s*goTown/);
 ```
 
-You should set the `onclick` property of `button3` in your `goStore` function.
+Ви повинні встановити властивість `onclick` для `button3` у своїй функції `goStore`.
 
 ```js
 assert.match(goStore.toString(), /button3\.onclick\s*=\s*goTown/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bfabe119461eb13ccbd6.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bfabe119461eb13ccbd6.md
index eed48a208c4..ff3eacef879 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bfabe119461eb13ccbd6.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7bfabe119461eb13ccbd6.md
@@ -1,35 +1,35 @@
 ---
 id: 62a7bfabe119461eb13ccbd6
-title: Step 45
+title: Крок 45
 challengeType: 0
 dashedName: step-45
 ---
 
 # --description--
 
-Now you need to modify your display text. Change the `innerText` of the `text` to be `You enter the store.`.
+Тепер вам потрібно змінити показуваний текст. Змініть `innerText` для `text` на `You enter the store.`.
 
 # --hints--
 
-You should use dot notation to access the `innerText` property of `text`.
+Ви повинні використати крапкову нотацію, щоб отримати доступ до властивості `innerText` для `text`.
 
 ```js
 assert.match(code, /text\.innerText/);
 ```
 
-You should not use `let` or `const` to access the `innerText` property of `text`.
+Ви не повинні використовувати `let` чи `const` для доступу до властивості `innerText` для `text`.
 
 ```js
 assert.notMatch(code, /(let|const)\s+text.innerText/);
 ```
 
-You should update the `innerText` property of `text` to be `You enter the store.`.
+Ви повинні оновити властивість `innerText` для `text` на `You enter the store.`.
 
 ```js
 assert.match(code, /text\.innerText\s*=\s*('|")You enter the store.\1/);
 ```
 
-You should update the `innerText` property within your `goStore` function.
+Ви повинні оновити властивість `innerText` у своїй функції `goStore`.
 
 ```js
 assert.match(goStore.toString(), /text\.innerText\s*=\s*('|")You enter the store.\1/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7c23e6b511f22ed71197a.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7c23e6b511f22ed71197a.md
index 6b26d69619b..ba982534e5e 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7c23e6b511f22ed71197a.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7c23e6b511f22ed71197a.md
@@ -1,23 +1,23 @@
 ---
 id: 62a7c23e6b511f22ed71197a
-title: Step 49
+title: Крок 49
 challengeType: 0
 dashedName: step-49
 ---
 
 # --description--
 
-You need to wrap the text `Store` in double quotes. Because your string is already wrapped in double quotes, you'll need to escape the quotes around `Store`. You can escape them with a backslash `\`.  Here is an example:
+Вам потрібно взяти текст `Store` у подвійні лапки. Оскільки рядок вже у подвійних лапках, вам потрібно уникнути лапок навколо `Store`. Ви можете уникнути їх за допомогою оберненої скісної риски `\`.  Ось приклад:
 
 ```js
 const escapedString = "Naomi likes to play \"Zelda\" sometimes.";
 ```
 
-Wrap the text `Store` in double quotes within your `text.innerText` line.
+Огорніть текст `Store` у подвійні лапки в межах рядка `text.innerText`.
 
 # --hints--
 
-You should wrap the text `Store` in double quotes.
+Ви повинні обернути текст `Store` у подвійні лапки.
 
 ```js
 assert.match(goTown.toString(), /text\.innerText\s*=\s*"You are in the town square. You see a sign that says \\"Store\\"."/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7cc99577fbf25ee7a7d76.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7cc99577fbf25ee7a7d76.md
index 82ae722f3d8..d9a5f78374c 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7cc99577fbf25ee7a7d76.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a7cc99577fbf25ee7a7d76.md
@@ -1,13 +1,13 @@
 ---
 id: 62a7cc99577fbf25ee7a7d76
-title: Step 50
+title: Крок 50
 challengeType: 0
 dashedName: step-50
 ---
 
 # --description--
 
-You have repetition in the `goTown` and `goStore` functions. When you have repetition in your code, this is a sign that you need another function. Functions can take parameters, which are values that are given to the function each time it is run. Here is a function that takes a parameter called `param`:
+Ви маєте повторення в функціях `goTown` та `goStore`. Якщо ви маєте повторення у своєму коді, тоді вам потрібна ще одна функція. Функції можуть приймати параметри, які є заданим значенням кожної функції та призначаються кожен раз, коли виконується функція. Ось функція, яка приймає параметр під назвою `param`:
 
 ```js
 function myFunction(param) {
@@ -15,23 +15,23 @@ function myFunction(param) {
 }
 ```
 
-Create an empty `update` function that takes a parameter called `location`.
+Створіть порожню функцію `update`, яка приймає параметр під назвою `location`.
 
 # --hints--
 
-You should use the `function` keyword to declare `update`.
+Ви повинні використати ключове слово `function`, щоб оголосити `update`.
 
 ```js
 assert.match(code, /function\s+update/);
 ```
 
-Your `update` function should take a parameter called `location`.
+Ваша функція `update` повинна приймати параметр під назвою `location`.
 
 ```js
 assert.match(update.toString(), /update\(location\)/);
 ```
 
-Your `update` function should be empty.
+Ваша функція `update` повинна бути порожньою.
 
 ```js
 assert.equal(update.toString(), function update(location) {});
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8a929e4260d08093756d2.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8a929e4260d08093756d2.md
index a36f9b9f86e..bdd5d556616 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8a929e4260d08093756d2.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8a929e4260d08093756d2.md
@@ -1,30 +1,30 @@
 ---
 id: 62a8a929e4260d08093756d2
-title: Step 51
+title: Крок 51
 challengeType: 0
 dashedName: step-51
 ---
 
 # --description--
 
-Create a variable called `locations` and set it to an empty array.
+Створіть змінну `locations` та встановіть її на порожній масив.
 
 # --hints--
 
-You should use `const` to declare `locations`.
+Ви повинні використати `const`, щоб оголосити `locations`.
 
 ```js
 assert.match(code, /const locations/);
 ```
 
-`locations` should be an array.
+`locations` повинен бути масивом.
 
 
 ```js
 assert.isArray(locations);
 ```
 
-`locations` should be empty.
+`locations` повинен бути порожнім.
 
 ```js
 assert.equal(locations.length, 0);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8a9d876b2580943ba9351.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8a9d876b2580943ba9351.md
index 4f9143c205b..db47a1394dd 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8a9d876b2580943ba9351.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8a9d876b2580943ba9351.md
@@ -1,25 +1,25 @@
 ---
 id: 62a8a9d876b2580943ba9351
-title: Step 52
+title: Крок 52
 challengeType: 0
 dashedName: step-52
 ---
 
 # --description--
 
-You previously used an array to store strings. But arrays can store any data type. This time, your array will be storing objects. Objects are similar to arrays, but with a few differences. One difference is that objects use properties, or keys, to access and modify data.
+Раніше ви використовували масив для зберігання рядків. Але масиви можуть зберігати дані будь-якого типу. Цього разу ваш масив зберігатиме об’єкти. Об’єкти схожі на масиви, але з деякими відмінностями. Одна відмінність полягає в тому, що об’єкти використовують властивості або ключі для доступу та зміни даних.
 
-Objects are indicated by curly braces. An empty object would look like `{}`. Add an empty object to your `locations` array.
+Об’єкти позначаються фігурними дужками. Порожній об’єкт матиме вигляд `{}`. Додайте порожній об’єкт до свого масиву `locations`.
 
 # --hints--
 
-Your first value of `locations` should be an object.
+Ваше перше значення `locations` повинне бути об’єктом.
 
 ```js
 assert.isObject(locations[0]);
 ```
 
-Your first value of `locations` should be an empty object.
+Ваше перше значення `locations` повинне бути порожнім об’єктом.
 
 ```js
 assert.deepEqual(locations[0], {});
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md
index d5c3664e5ed..a288db32fce 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8aa98a8289d0a698eee1d.md
@@ -1,13 +1,13 @@
 ---
 id: 62a8aa98a8289d0a698eee1d
-title: Step 53
+title: Крок 53
 challengeType: 0
 dashedName: step-53
 ---
 
 # --description--
 
-Object <dfn>properties</dfn> are written as `key: value` pairs, where `key` is the name of the property (or the key), and `value` is the value that property holds. For example, here is an object with a key of `name` set to `Quincy Larson`.
+<dfn>Властивості</dfn> об’єкта записуються парами `key: value`, де `key` – ім’я властивості (або ключа), а `value` – значення властивості. Наприклад, ось об’єкт з ключем `name`, встановленим на `Quincy Larson`.
 
 ```js
 {
@@ -15,23 +15,23 @@ Object <dfn>properties</dfn> are written as `key: value` pairs, where `key` is t
 }
 ```
 
-Add a `name` property to your empty object and give it a value of `town square`.
+Додайте властивість `name` до свого порожнього об’єкта та надайте йому значення `town square`.
 
 # --hints--
 
-Your first value of `locations` should be an object.
+Ваше перше значення `locations` повинне бути об’єктом.
 
 ```js
 assert.isObject(locations[0]);
 ```
 
-Your first value of `locations` should have a `name` property.
+Ваше перше значення `locations` повинне мати властивість `name`.
 
 ```js
 assert.isDefined(locations[0].name);
 ```
 
-Your first value of `locations` should have a `name` property with a value of `town square`.
+Ваше перше значення `locations` повинне мати властивість `name` зі значенням `town square`.
 
 ```js
 assert.equal(locations[0].name, "town square");
@@ -135,7 +135,7 @@ const monsterHealthText =document.querySelector("#monsterHealth");
 --fcc-editable-region--
 const locations = [
     {
-        
+
     }
 ];
 --fcc-editable-region--
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ab0e27cbaf0b54ba8a42.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ab0e27cbaf0b54ba8a42.md
index 45578691077..412dd1dc134 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ab0e27cbaf0b54ba8a42.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ab0e27cbaf0b54ba8a42.md
@@ -1,15 +1,15 @@
 ---
 id: 62a8ab0e27cbaf0b54ba8a42
-title: Step 54
+title: Крок 54
 challengeType: 0
 dashedName: step-54
 ---
 
 # --description--
 
-Just like array values, object properties are separated by a comma. Add a comma after your `name` property and add a `button text` property with the value of an empty array. Note that because the property name has more than one word, you'll need to surround it in quotes.
+Так само як і значення масиву, властивості об'єктів розділені комою. Додайте кому після властивості `name` та додайте властивість `button text` зі значенням пустого масиву. Зверніть увагу, що оскільки ім'я властивості має більше одного слова, вам потрібно буде його оточити лапками.
 
-For example:
+Наприклад:
 
 ```js
 {
@@ -20,31 +20,31 @@ For example:
 
 # --hints--
 
-Your first `locations` value should be an object.
+Ваше перше значення `locations` повинне бути об’єктом.
 
 ```js
 assert.isObject(locations[0]);
 ```
 
-Your first `locations` value should have a `button text` property.
+Ваше перше значення `locations` повинне мати властивість `button text`.
 
 ```js
 assert.isDefined(locations[0]["button text"]);
 ```
 
-Your first `locations` value should have a `button text` property with a value that is an array.
+Ваше перше значення `locations` повинне мати властивість `button text` зі значенням, яке є масивом.
 
 ```js
 assert.isArray(locations[0]["button text"]);
 ```
 
-Your first `locations` value should have a `button text` property with a value that is an empty array.
+Ваше перше значення `locations` повинне мати властивість `button text` зі значенням, яке є порожнім масивом.
 
 ```js
 assert.equal(locations[0]["button text"].length, 0);
 ```
 
-You should not remove or change the `name` property.
+Ви не повинні видаляти чи змінювати властивість `name`.
 
 ```js
 assert.equal(locations[0].name, "town square");
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ac194679e60cb561b0a8.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ac194679e60cb561b0a8.md
index 5a1412cf312..d1e4a5438b9 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ac194679e60cb561b0a8.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ac194679e60cb561b0a8.md
@@ -1,23 +1,23 @@
 ---
 id: 62a8ac194679e60cb561b0a8
-title: Step 55
+title: Крок 55
 challengeType: 0
 dashedName: step-55
 ---
 
 # --description--
 
-Give your empty `button text` array three string elements. Use the three strings being assigned to the button `innerText` properties in the `goTown` function. Remember that array values are separated by commas.
+Надайте своєму порожньому масиву `button text` три рядкові елементи. Використайте три рядки, щоб призначити кнопці властивості `innerText` у функції `goTown`. Пам'ятайте, що значення масиву розділені комами.
 
 # --hints--
 
-Your `button text` array should have three elements.
+Ваш масив `button text` повинен мати три елементи.
 
 ```js
 assert.lengthOf(locations[0]["button text"], 3);
 ```
 
-Your `button text` array should have three strings.
+Ваш масив `button text` повинен мати три рядки.
 
 ```js
 assert.isString(locations[0]["button text"][0]);
@@ -25,19 +25,19 @@ assert.isString(locations[0]["button text"][1]);
 assert.isString(locations[0]["button text"][2]);
 ```
 
-The first value in the `button text` array should be "Go to store".
+Першим значенням у масиві `button text` повинне бути "Go to store".
 
 ```js
 assert.equal(locations[0]["button text"][0], "Go to store");
 ```
 
-The second value in the `button text` array should be "Go to cave".
+Другим значенням у масиві `button text` повинне бути "Go to cave".
 
 ```js
 assert.equal(locations[0]["button text"][1], "Go to cave");
 ```
 
-The third value in the `button text` array should be "Fight dragon".
+Третім значенням у масиві `button text` повинне бути "Fight dragon".
 
 ```js
 assert.equal(locations[0]["button text"][2], "Fight dragon");
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ad8e01d7cb0deae5ec66.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ad8e01d7cb0deae5ec66.md
index 1229366bb3a..b083719bcd4 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ad8e01d7cb0deae5ec66.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ad8e01d7cb0deae5ec66.md
@@ -1,47 +1,47 @@
 ---
 id: 62a8ad8e01d7cb0deae5ec66
-title: Step 56
+title: Крок 56
 challengeType: 0
 dashedName: step-56
 ---
 
 # --description--
 
-Create another property in your object called `button functions`. Give this property an array containing the three functions assigned to the `onclick` properties in the `goTown` function. Remember that these functions are variables, not strings, and should not be wrapped in quotes.
+Створіть іншу властивість у своєму об'єкті під назвою `button functions`. Надайте цій властивості масив, що містить три функції, призначені до властивостей `onclick` у функції `goTown`. Пам'ятайте, що ці функції є змінними, а не рядками, і не повинні бути оточені лапками.
 
 # --hints--
 
-Your first `locations` object should have a `button functions` property.
+Ваш перший об’єкт `locations` повинен мати властивість `button functions`.
 
 ```js
 assert.isDefined(locations[0]["button functions"]);
 ```
 
-Your `button functions` property should be an array.
+Ваша властивість `button functions` повинна бути масивом.
 
 ```js
 assert.isArray(locations[0]["button functions"]);
 ```
 
-Your `button functions` property should have three values in it.
+Ваша властивість `button functions` повинна мати три значення всередині.
 
 ```js
 assert.lengthOf(locations[0]["button functions"], 3);
 ```
 
-Your first `button functions` array value should be the function `goStore`.
+Першим значенням масиву `button functions` повинна бути функція `goStore`.
 
 ```js
 assert.equal(locations[0]["button functions"][0], goStore);
 ```
 
-Your second `button functions` array value should be the function `goCave`.
+Другим значенням масиву `button functions` повинна бути функція `goCave`.
 
 ```js
 assert.equal(locations[0]["button functions"][1], goCave);
 ```
 
-Your third `button functions` array value should be the function `fightDragon`.
+Третім значенням масиву `button functions` повинна бути функція `fightDragon`.
 
 ```js
 assert.equal(locations[0]["button functions"][2], fightDragon);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ade9b2f5b30ef0b606c2.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ade9b2f5b30ef0b606c2.md
index 7ac20d72a3e..c998ecec7ac 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ade9b2f5b30ef0b606c2.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ade9b2f5b30ef0b606c2.md
@@ -1,29 +1,29 @@
 ---
 id: 62a8ade9b2f5b30ef0b606c2
-title: Step 57
+title: Крок 57
 challengeType: 0
 dashedName: step-57
 ---
 
 # --description--
 
-Add one final property to the object named `text`. Give this property the final `text.innerText` value from the `goTown` function.
+Додайте останню властивість до об’єкта під назвою `text`. Надайте цій властивості останнє значення `text.innerText` з функції `goTown`.
 
 # --hints--
 
-Your first `locations` value should have a `text` property.
+Ваше перше значення `locations` повинне мати властивість `text`.
 
 ```js
 assert.isDefined(locations[0]["text"]);
 ```
 
-Your `text` property should be a string.
+Ваша властивість `text` повинна бути рядком.
 
 ```js
 assert.isString(locations[0]["text"]);
 ```
 
-Your `text` property should have the value `You are in the town square. You see a sign that says \"Store\".`
+Ваша властивість `text` повинна мати значення `You are in the town square. You see a sign that says \"Store\".`
 
 ```js
 assert.equal(locations[0]["text"], "You are in the town square. You see a sign that says \"Store\".");
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ae85fcaedc0fddc7ca4f.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ae85fcaedc0fddc7ca4f.md
index 79d6d140e1e..7f96545922d 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ae85fcaedc0fddc7ca4f.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ae85fcaedc0fddc7ca4f.md
@@ -1,23 +1,23 @@
 ---
 id: 62a8ae85fcaedc0fddc7ca4f
-title: Step 58
+title: Крок 58
 challengeType: 0
 dashedName: step-58
 ---
 
 # --description--
 
-Add a second object to your `locations` array (remember to separate them with a comma). Following the pattern you used in the first object, create the same properties but use the values from the `goStore` function. Set the `name` property to `store`.
+Додайте другий об’єкт до свого масиву `locations` (не забудьте розділити їх комами). За шаблоном першого об'єкту створіть такі самі властивості, але використайте значення з функції `goStore`. Встановіть властивість `name` на `store`.
 
 # --hints--
 
-Your `locations` array should have two values.
+Ваш масив `locations` повинен мати два значення.
 
 ```js
 assert.lengthOf(locations, 2);
 ```
 
-Both `locations` values should be objects.
+Обидва значення `locations` повинні бути об'єктами.
 
 
 ```js
@@ -25,19 +25,19 @@ assert.isObject(locations[0]);
 assert.isObject(locations[1]);
 ```
 
-Your second `locations` object should have a `name` property with the value of `store`.
+Ваш другий об’єкт `locations` повинен мати властивість `name` зі значенням `store`.
 
 ```js
 assert.equal(locations[1].name, "store");
 ```
 
-Your second `locations` object should have a `button text` property which is an array.
+Ваш другий об’єкт `locations` повинен мати властивість `button text`, яка є масивом.
 
 ```js
 assert.isArray(locations[1]["button text"]);
 ```
 
-Your `button text` property should have the string values `Buy 10 health (10 gold)`, `Buy weapon (30 gold)`, and `Go to town square`.
+Ваша властивість `button text` повинна мати такі значення рядків: `Buy 10 health (10 gold)`, `Buy weapon (30 gold)` та `Go to town square`.
 
 ```js
 assert.equal(locations[1]["button text"][0], "Buy 10 health (10 gold)");
@@ -45,13 +45,13 @@ assert.equal(locations[1]["button text"][1], "Buy weapon (30 gold)");
 assert.equal(locations[1]["button text"][2], "Go to town square");
 ```
 
-Your second `locations` object should have a `button functions` property which is an array.
+Ваш другий об’єкт `locations` повинен мати властивість `button functions`, яка є масивом.
 
 ```js
 assert.isArray(locations[1]["button functions"]);
 ```
 
-Your `button functions` property should have the function values `buyHealth`, `buyWeapon`, and `goTown`.
+Ваша властивість `button functions` повинна мати такі значення функцій: `buyHealth`, `buyWeapon` та `goTown`.
 
 ```js
 assert.equal(locations[1]["button functions"][0], buyHealth);
@@ -59,19 +59,19 @@ assert.equal(locations[1]["button functions"][1], buyWeapon);
 assert.equal(locations[1]["button functions"][2], goTown);
 ```
 
-Your second `locations` object should have a `text` property which is a string.
+Ваш другий об’єкт `locations` повинен мати властивість `text`, яка є рядком.
 
 ```js
 assert.isString(locations[1].text);
 ```
 
-Your second `locations` object should have a `text` property with the value of `You enter the store.`.
+Ваш другий об’єкт `locations` повинен мати властивість `text` зі значенням `You enter the store.`.
 
 ```js
 assert.equal(locations[1].text, "You enter the store.");
 ```
 
-You should not modify the first `locations` object.
+Ви не повинні змінювати перший об’єкт `locations`.
 
 ```js
 assert.deepEqual(locations[0], {
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b0b5053f16111b0b6b5f.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b0b5053f16111b0b6b5f.md
index c60cf5907da..dad79fe3e10 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b0b5053f16111b0b6b5f.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b0b5053f16111b0b6b5f.md
@@ -1,65 +1,65 @@
 ---
 id: 62a8b0b5053f16111b0b6b5f
-title: Step 59
+title: Крок 59
 challengeType: 0
 dashedName: step-59
 ---
 
 # --description--
 
-Now you can consolidate some of your code. Start by copying the code from inside the `goTown` function and paste it into your `update` function. Then, remove all the code from inside the `goTown` and `goStore` functions.
+Тепер ви можете консолідувати частину свого коду. Розпочніть з копіювання коду всередині функції `goTown` та вставте його всередині функції `update`. Потім вилучіть весь код зсередини функцій `goTown` та `goStore`.
 
 # --hints--
 
-Your `update` function should set `button1.innerText` to `Go to store`.
+Ваша функція `update` повинна встановити `button1.innerText` на `Go to store`.
 
 ```js
 assert.match(update.toString(), /button1\.innerText\s*=\s*('|")Go to store\1/);
 ```
 
-Your `update` function should set `button2.innerText` to `Go to cave`.
+Ваша функція `update` повинна встановити `button2.innerText` на `Go to cave`.
 
 ```js
 assert.match(update.toString(), /button2\.innerText\s*=\s*('|")Go to cave\1/);
 ```
 
-Your `update` function should set `button3.innerText` to `Fight dragon`.
+Ваша функція `update` повинна встановити `button3.innerText` на `Fight dragon`.
 
 ```js
 assert.match(update.toString(), /button3\.innerText\s*=\s*('|")Fight dragon\1/);
 ```
 
-Your `update` function should set `button1.onclick` to `goStore`.
+Ваша функція `update` повинна встановити `button1.onclick` на `goStore`.
 
 ```js
 assert.match(update.toString(), /button1\.onclick\s*=\s*goStore/);
 ```
 
-Your `update` function should set `button2.onclick` to `goCave`.
+Ваша функція `update` повинна встановити `button2.onclick` на `goCave`.
 
 ```js
 assert.match(update.toString(), /button2\.onclick\s*=\s*goCave/);
 ```
 
-Your `update` function should set `button3.onclick` to `fightDragon`.
+Ваша функція `update` повинна встановити `button3.onclick` на `fightDragon`.
 
 ```js
 assert.match(update.toString(), /button3\.onclick\s*=\s*fightDragon/);
 ```
 
-Your `update` function should set `text.innerText` to `You are in the town square. You see a sign that says "Store".`.
+Ваша функція `update` повинна встановити `text.innerText` на `You are in the town square. You see a sign that says "Store".`.
 
 ```js
 assert.match(update.toString(), /text\.innerText\s*=\s*"You are in the town square. You see a sign that says \\"Store\\"\."/);
 ```
 
-Your `goTown` function should be empty.
+Ваша функція `goTown` повинна бути порожньою.
 
 ```js
 assert.match(goTown.toString(), /function goTown\(\) \{\}/);
 ```
 
-Your `goStore` function should be empty.
+Ваша функція `goStore` повинна бути порожньою.
 
 ```js
 assert.match(goStore.toString(), /function goStore\(\) \{\}/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b1762b7775124622e1a3.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b1762b7775124622e1a3.md
index 450bc66c133..8683a6462ad 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b1762b7775124622e1a3.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b1762b7775124622e1a3.md
@@ -1,23 +1,23 @@
 ---
 id: 62a8b1762b7775124622e1a3
-title: Step 60
+title: Крок 60
 challengeType: 0
 dashedName: step-60
 ---
 
 # --description--
 
-Instead of assigning the `innerText` and `onclick` properties to specific strings and functions, the `update` function will use data from the `location` that is passed into it. First, that data needs to be passed. Inside the `goTown` function, call the `update` function. Here is an example of calling a function named `myFunction`: `myFunction();`.
+Замість того, щоб призначати властивості `innerText` та `onclick` певним рядкам і функціям, функція `update` використовуватиме дані з `location`, які передаються їй. По-перше, ці дані потрібно передати. Усередині функції `goTown` викличте функцію `update`. Ось приклад виклику функції під назвою `myFunction`: `myFunction();`.
 
 # --hints--
 
-You should call the `update` function in the `goTown` function.
+Ви повинні викликати функцію `update` у функції `goTown`.
 
 ```js
 assert.match(goTown.toString(), /update\(\)/);
 ```
 
-Don't forget your ending semi-colon.
+Не забудьте про крапку з комою в кінці.
 
 ```js
 assert.match(goTown.toString(), /update\(\);/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b3cc436db8139cc5fc09.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b3cc436db8139cc5fc09.md
index 4d5aa1df9b9..c29878381da 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b3cc436db8139cc5fc09.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b3cc436db8139cc5fc09.md
@@ -1,17 +1,17 @@
 ---
 id: 62a8b3cc436db8139cc5fc09
-title: Step 61
+title: Крок 61
 challengeType: 0
 dashedName: step-61
 ---
 
 # --description--
 
-You now need to pass the `location` argument into the `update` call. You pass arguments by including them within the parentheses of the function call. For example, calling `myFunction` with an `arg` argument would look like: `myFunction(arg)`. Pass your `locations` array into the `update` call.
+Тепер вам потрібно передати аргумент `location` до виклику `update`. Ви передаєте аргументи, включаючи їх у парантезу виклику функції. Наприклад, виклик `myFunction` з аргументом `arg` виглядатиме так: `myFunction(arg)`. Передайте масив `locations` до виклику `update`.
 
 # --hints--
 
-You should pass the `locations` array into the `update` call.
+Ви повинні передати масив `locations` до виклику `update`.
 
 ```js
 assert.match(goTown.toString(), /update\(locations\);/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b6536156c51500739b41.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b6536156c51500739b41.md
index a8bef26a706..088be998a42 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b6536156c51500739b41.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b6536156c51500739b41.md
@@ -1,37 +1,37 @@
 ---
 id: 62a8b6536156c51500739b41
-title: Step 62
+title: Крок 62
 challengeType: 0
 dashedName: step-62
 ---
 
 # --description--
 
-The `locations` array contains two locations: the town square and the store. Currently you are passing that entire array into the update functions. Pass in only the first element of the `locations` array by adding `[0]` at the end of the variable. For example: `myFunction(arg[0]);`.
+Масив `locations` містить дві локації: площа (town square) та магазин (store). Наразі ви передаєте цілий масив до оновлених функцій. Передайте лише перший елемент масиву `locations`, додавши `[0]` в кінці змінної. Наприклад: `myFunction(arg[0]);`.
 
-This is called <dfn>bracket notation</dfn>. Values in an array are accessed by index. Indices are numerical values and start at 0 - this is called zero-based indexing. `arg[0]` would be the first element in the `arg` array.
+Це називається <dfn>нотацією в дужках</dfn>. Значення в масиві доступні за індексом. Індекси є числовими значеннями та починаються з 0 – це називається індексуванням від нуля. Першим елементом у масиві `arg` був би `arg[0]`.
 
 # --hints--
 
-You should use bracket notation with `locations`.
+Використайте нотацію в дужках для `locations`.
 
 ```js
 assert.match(code, /locations\[/);
 ```
 
-You should access the first object in the `locations` array. Remember that arrays are zero-based.
+Ви повинні отримати доступ до першого об'єкта у масиві `locations`. Пам’ятайте, що масиви починаються з нуля.
 
 ```js
 assert.match(code, /locations\[0\]/);
 ```
 
-You should pass the first object in the `locations` array into the `update` function.
+Ви повинні передати перший об'єкт у масиві `locations` до функції `update`.
 
 ```js
 assert.match(code, /update\(locations\[0\]\);/);
 ```
 
-This call should still be in your `goTown()` function.
+Цей виклик досі повинен бути у функції `goTown()`.
 
 ```js
 assert.match(goTown.toString(), /update\(locations\[0\]\);/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b711ab7a12161c7d9b67.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b711ab7a12161c7d9b67.md
index 8a6a5c5c67a..d12f10047d1 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b711ab7a12161c7d9b67.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b711ab7a12161c7d9b67.md
@@ -1,23 +1,23 @@
 ---
 id: 62a8b711ab7a12161c7d9b67
-title: Step 63
+title: Крок 63
 challengeType: 0
 dashedName: step-63
 ---
 
 # --description--
 
-Now your `update` function needs to use the argument you pass into it. Inside the `update` function, change the `button1.innerText` assignment to be `location["button text"]`. That uses bracket notation to get the `button text` property of the `location` object passed into the function.
+Тепер ваша функція `update` повинна використовувати аргумент, який ви передали. Всередині функції `update` змініть присвоєння `button1.innerText` на `location["button text"]`. Нотація в дужках використана для того, щоб передати властивість `button text` об'єкта `location` до функції.
 
 # --hints--
 
-Your `update` function should use bracket notation to get the `button text` property of the `location` object passed into the function.
+Ваша функція `update` повинна використовувати нотацію в дужках, щоб властивість `button text` об'єкта `location` була передана до функції.
 
 ```js
 assert.match(update.toString(), /location[('|")button text\1]/);
 ```
 
-You should assign the value of the `button text` property of the `location` object to the `innerText` property of `button1`.
+Ви повинні призначити значення властивості `button text` об'єкта `location` до властивості `innerText` для `button1`.
 
 ```js
 assert.match(update.toString(), /button1\.innerText\s*=\s*location\[('|")button text\1\]/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b9770050d217d2247801.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b9770050d217d2247801.md
index ab4856b1c26..87a2211737f 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b9770050d217d2247801.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8b9770050d217d2247801.md
@@ -1,23 +1,23 @@
 ---
 id: 62a8b9770050d217d2247801
-title: Step 64
+title: Крок 64
 challengeType: 0
 dashedName: step-64
 ---
 
 # --description--
 
-`location["button text"]` is an array with three elements. Change the `button1.innerText` assignment to be the first element of that array instead.
+`location["button text"]` є масивом з трьома елементами. Натомість змініть присвоєння `button1.innerText` на перший елемент цього масиву.
 
 # --hints--
 
-You should access the first element of the `button text` property of the `location` argument.
+Ви повинні отримати доступ до першого елемента властивості `button text` аргумента `location`.
 
 ```js
 assert.match(update.toString(), /location\[('|")button text\1\]\[0\]/);
 ```
 
-You should set the `button1.innerText` property to be the first element of the `button text` property of the `location` argument.
+Ви повинні встановити властивість `button1.innerText`, щоб вона була першим елементом властивості `button text` аргумента `location`.
 
 ```js
 assert.match(update.toString(), /button1\.innerText\s*=\s*location\[('|")button text\1\]\[0\]/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c0c8313e891a15ec23e7.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c0c8313e891a15ec23e7.md
index 458368c6e11..9adbc06633c 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c0c8313e891a15ec23e7.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c0c8313e891a15ec23e7.md
@@ -1,35 +1,35 @@
 ---
 id: 62a8c0c8313e891a15ec23e7
-title: Step 65
+title: Крок 65
 challengeType: 0
 dashedName: step-65
 ---
 
 # --description--
 
-Now update `button2.innerText` and `button3.innerText` to be assigned the second and third values of the `button text` array, respectively.
+Тепер оновіть `button2.innerText` та `button3.innerText`, щоб їм відповідно були призначені друге та третє значення масиву `button text`.
 
 # --hints--
 
-You should access the second element of the `button text` property of the `location` argument.
+Ви повинні отримати доступ до другого елемента властивості `button text` аргумента `location`.
 
 ```js
 assert.match(update.toString(), /location\[('|")button text\1\]\[1\]/);
 ```
 
-You should set the `button2.innerText` property to be the second element of the `button text` property of the `location` argument.
+Ви повинні встановити властивість `button2.innerText`, щоб вона була другим елементом властивості `button text` аргумента `location`.
 
 ```js
 assert.match(update.toString(), /button2\.innerText\s*=\s*location\[('|")button text\1\]\[1\]/);
 ```
 
-You should access the third element of the `button text` property of the `location` argument.
+Ви повинні отримати доступ до третього елемента властивості `button text` аргумента `location`.
 
 ```js
 assert.match(update.toString(), /location\[('|")button text\1\]\[2\]/);
 ```
 
-You should set the `button3.innerText` property to be the third element of the `button text` property of the `location` argument.
+Ви повинні встановити властивість `button3.innerText`, щоб вона була третім елементом властивості `button text` аргумента `location`.
 
 ```js
 assert.match(update.toString(), /button3\.innerText\s*=\s*location\[('|")button text\1\]\[2\]/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c1154d3ae11aee80353f.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c1154d3ae11aee80353f.md
index 4731c369e1e..8b5beb454e7 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c1154d3ae11aee80353f.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c1154d3ae11aee80353f.md
@@ -1,47 +1,47 @@
 ---
 id: 62a8c1154d3ae11aee80353f
-title: Step 66
+title: Крок 66
 challengeType: 0
 dashedName: step-66
 ---
 
 # --description--
 
-Following the same pattern as you did for the button text, update the three buttons' `onclick` assignments to be the first, second, and third values of the `button functions` array.
+Дотримуючись того самого шаблону, що й для тексту кнопки, оновіть призначення `onclick` трьох кнопок, щоб вони були першим, другим та третім значеннями масиву `button functions`.
 
 # --hints--
 
-You should access the first element of the `button functions` property of the `location` argument.
+Ви повинні отримати доступ до першого елемента властивості `button functions` аргументу `location`.
 
 ```js
 assert.match(update.toString(), /location\[('|")button functions\1\]\[0\]/);
 ```
 
-You should set the `button1.onclick` property to be the second element of the `button functions` property of the `location` argument.
+Ви повинні встановити властивість `button1.onclick` як другий елемент властивості `button functions` аргументу `location`.
 
 ```js
 assert.match(update.toString(), /button1\.onclick\s*=\s*location\[('|")button functions\1\]\[0\]/);
 ```
 
-You should access the second element of the `button functions` property of the `location` argument.
+Ви повинні отримати доступ до другого елемента властивості `button functions` аргументу `location`.
 
 ```js
 assert.match(update.toString(), /location\[('|")button functions\1\]\[1\]/);
 ```
 
-You should set the `button2.onclick` property to be the third element of the `button functions` property of the `location` argument.
+Ви повинні встановити властивість `button2.onclick` як третій елемент властивості `button functions` аргументу `location`.
 
 ```js
 assert.match(update.toString(), /button2\.onclick\s*=\s*location\[('|")button functions\1\]\[1\]/);
 ```
 
-You should access the third element of the `button functions` property of the `location` argument.
+Ви повинні отримати доступ до третього елемента властивості `button functions` аргументу `location`.
 
 ```js
 assert.match(update.toString(), /location\[('|")button functions\1\]\[2\]/);
 ```
 
-You should set the `button3.onclick` property to be the third element of the `button functions` property of the `location` argument.
+Ви повинні встановити властивість `button3.onclick` як третій елемент властивості `button functions` аргументу `location`.
 
 ```js
 assert.match(update.toString(), /button3\.onclick\s*=\s*location\[('|")button functions\1\]\[2\]/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c151b23bf21bc7c4fcba.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c151b23bf21bc7c4fcba.md
index ca8a532ec15..38870113b01 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c151b23bf21bc7c4fcba.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c151b23bf21bc7c4fcba.md
@@ -1,23 +1,23 @@
 ---
 id: 62a8c151b23bf21bc7c4fcba
-title: Step 67
+title: Крок 67
 challengeType: 0
 dashedName: step-67
 ---
 
 # --description--
 
-Finally, update the `text.innerText` assignment to equal the `text` from the location object. However, instead of using bracket notation, use <dfn>dot notation</dfn>. Here is an example of accessing the `name` property of an object called `obj`: `obj.name`.
+Зрештою оновіть присвоєння `text.innerText`, щоб воно дорівнювало `text` об'єкту локації. Але замість нотації в дужках використайте <dfn>крапкову нотацію</dfn>. Ось приклад отримання доступу до властивості `name` об'єкта під назвою `obj`: `obj.name`.
 
 # --hints--
 
-You should use dot notation to access the `text` property of the `location` object.
+Ви повинні використати крапкову нотацію, щоб отримати доступ до властивості `text` об'єкта `location`.
 
 ```js
 assert.match(update.toString(), /location\.text/);
 ```
 
-You should set the `text.innerText` property to be the `text` property of the `location` object.
+Ви повинні встановити властивість `text.innerText` на властивість `text` об'єкта `location`.
 
 ```js
 assert.match(update.toString(), /text\.innerText\s*=\s*location\.text/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c173949f851c83c64756.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c173949f851c83c64756.md
index 422ff092c3e..445b9777757 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c173949f851c83c64756.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c173949f851c83c64756.md
@@ -1,25 +1,25 @@
 ---
 id: 62a8c173949f851c83c64756
-title: Step 68
+title: Крок 68
 challengeType: 0
 dashedName: step-68
 ---
 
 # --description--
 
-Now update your `goStore` function to call the `update` function. Pass the second element of the `locations` array as your argument.
+Тепер оновіть свою функцію `goStore`, щоб викликати функцію `update`. Передайте другий елемент масиву `locations` як аргумент.
 
-To make sure your refactoring is correct, try clicking your first button again. You should see the same changes to your webpage that you saw earlier.
+Щоб переконатися, що рефакторинг правильний, знову натисніть на першу кнопку. Ви повинні побачити ті зміни на вебсторінці, які бачили раніше.
 
 # --hints--
 
-Your `goStore` function should call the `update` function.
+Ваша функція `goStore` повинна викликати функцію `update`.
 
 ```js
 assert.match(goStore.toString(), /update\(/);
 ```
 
-Your `goStore` function should pass the second element of the `locations` array as your argument to `update()`.
+Ваша функція `goStore` повинна передати другий елемент масиву `locations` як аргумент до `update()`.
 
 ```js
 assert.match(goStore.toString(), /update\(locations\[1\]\)/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c242b25a531f2909e5bc.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c242b25a531f2909e5bc.md
index d7800eb4dce..be69d6d5240 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c242b25a531f2909e5bc.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c242b25a531f2909e5bc.md
@@ -1,35 +1,35 @@
 ---
 id: 62a8c242b25a531f2909e5bc
-title: Step 69
+title: Крок 69
 challengeType: 0
 dashedName: step-69
 ---
 
 # --description--
 
-Create two more empty functions named `fightSlime` and `fightBeast`. These functions will be used in your upcoming `cave` object.
+Створіть дві порожні функції під назвою `fightSlime` та `fightBeast`. Ці функції будуть використані у майбутньому об'єкті `cave`.
 
 # --hints--
 
-`fightSlime` should be a function.
+`fightSlime` має бути функцією.
 
 ```js
 assert.isFunction(fightSlime);
 ```
 
-`fightBeast` should be a function.
+`fightBeast` має бути функцією.
 
 ```js
 assert.isFunction(fightBeast);
 ```
 
-`fightSlime` should be empty.
+`fightSlime` має бути порожньою.
 
 ```js
 assert.match(fightSlime.toString(), /function fightSlime\(\) \{\}/);
 ```
 
-`fightBeast` should be empty.
+`fightBeast` має бути порожньою.
 
 ```js
 assert.match(fightBeast.toString(), /function fightBeast\(\) \{\}/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c2bbbd8aa82052f47c53.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c2bbbd8aa82052f47c53.md
index d96b10aaff6..d953c65a9b4 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c2bbbd8aa82052f47c53.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c2bbbd8aa82052f47c53.md
@@ -1,44 +1,44 @@
 ---
 id: 62a8c2bbbd8aa82052f47c53
-title: Step 70
+title: Крок 70
 challengeType: 0
 dashedName: step-70
 ---
 
 # --description--
 
-Add a third object to the `locations` array. Give it the same properties as the other two objects.
+Додайте третій об’єкт до масиву `locations`. Надайте йому ті самі властивості, що й двом іншим об’єктам.
 
-Set `name` to `cave`. Set `button text` to an array with the strings `Fight slime`, `Fight fanged beast`, and `Go to town square`. Set the `button functions` to an array with the variables `fightSlime`, `fightBeast`, and `goTown`. Set the `text` property to `You enter the cave. You see some monsters.`.
+Встановіть `name` на `cave`. Встановіть `button text` на масив з рядками `Fight slime`, `Fight fanged beast` та `Go to town square`. Встановіть `button functions` на масив зі змінними `fightSlime`, `fightBeast` та `goTown`. Встановіть властивість `text` на `You enter the cave. You see some monsters.`.
 
 # --hints--
 
-You should have three values in your `locations` array.
+Ви повинні мати три значення в своєму масиві `locations`.
 
 ```js
 console.log(locations);
 assert.lengthOf(locations, 3);
 ```
 
-Your third `locations` value should be an object.
+Ваше трете значення `locations` повинне бути об’єктом.
 
 ```js
 assert.isObject(locations[2]);
 ```
 
-Your third `locations` object should have a `name` property with the value of `cave`.
+Ваш третій об’єкт `locations` повинен мати властивість `name` зі значенням `cave`.
 
 ```js
 assert.equal(locations[2].name, "cave");
 ```
 
-Your third `locations` object should have a `button text` property which is an array.
+Ваш третій об’єкт `locations` повинен мати властивість `button text`, яка є масивом.
 
 ```js
 assert.isArray(locations[2]["button text"]);
 ```
 
-Your `button text` property should have the string values `Fight slime`, `Fight fanged beast`, and `Go to town square`.
+Ваша властивість `button text` повинна мати рядкові значення `Fight slime`, `Fight fanged beast` та `Go to town square`.
 
 ```js
 assert.equal(locations[2]["button text"][0], "Fight slime");
@@ -46,13 +46,13 @@ assert.equal(locations[2]["button text"][1], "Fight fanged beast");
 assert.equal(locations[2]["button text"][2], "Go to town square");
 ```
 
-Your third `locations` object should have a `button functions` property which is an array.
+Ваш третій об’єкт `locations` повинен мати властивість `button functions`, яка є масивом.
 
 ```js
 assert.isArray(locations[2]["button functions"]);
 ```
 
-Your `button functions` property should have the function values `fightSlime`, `fightBeast`, and `goTown`.
+Ваша властивість `button functions` повинна мати значення функції `fightSlime`, `fightBeast` та `goTown`.
 
 ```js
 assert.equal(locations[2]["button functions"][0], fightSlime);
@@ -60,13 +60,13 @@ assert.equal(locations[2]["button functions"][1], fightBeast);
 assert.equal(locations[2]["button functions"][2], goTown);
 ```
 
-Your third `locations` object should have a `text` property which is a string.
+Ваш третій об’єкт `locations` повинен мати властивість `text`, яка є рядком.
 
 ```js
 assert.isString(locations[2].text);
 ```
 
-Your third `locations` object should have a `text` property with the value of `You enter the cave. You see some monsters.`.
+Ваш третій об'єкт `locations` повинен мати властивість `text` зі значенням `You enter the cave. You see some monsters.`.
 
 ```js
 assert.equal(locations[2].text, "You enter the cave. You see some monsters.");
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c31ec0ec78216a1c36a0.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c31ec0ec78216a1c36a0.md
index 1d663fa1670..b18e555cd56 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c31ec0ec78216a1c36a0.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c31ec0ec78216a1c36a0.md
@@ -1,37 +1,37 @@
 ---
 id: 62a8c31ec0ec78216a1c36a0
-title: Step 71
+title: Крок 71
 challengeType: 0
 dashedName: step-71
 ---
 
 # --description--
 
-Now that you have a `cave` location object, update your `goCave` function to call `update` and pass that new `cave` location. Remember that this is the third element in your `locations` array.
+Тепер коли ви маєте об'єкт `cave`, оновіть свою функцію `goCave` для виклику `update` та передайте цю нову локацію `cave`. Пам'ятайте, що це третій елемент у вашому масиві `locations`.
 
-Don't forget to remove your `console.log` call!
+Не забудьте видалити свій виклик `console.log`!
 
 # --hints--
 
-You should use bracket notation to access the third element in your `locations` array.
+Ви повинні використати нотацію в дужках, щоб отримати доступ до третього елемента в масиві `locations`.
 
 ```js
 assert.match(code, /locations\[2\]/);
 ```
 
-You should pass the third element in your `locations` array to `update`.
+Ви повинні передати третій елемент у масиві `locations` до `update`.
 
 ```js
 assert.match(code, /update\(locations\[2\]\)/);
 ```
 
-You should call `update` with the third element in your `locations` array in your `goCave` function.
+Ви повинні викликати `update` за допомогою третього елементу у своєму масиві `locations` у функції `goCave`.
 
 ```js
 assert.match(goCave.toString(), /update\(locations\[2\]\)/);
 ```
 
-You should not have the `console.log` statement in your `goCave` function.
+Вам не потрібна інструкція `console.log` у своїй функції `goCave`.
 
 ```js
 assert.notMatch(goCave.toString(), /console\.log/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c370ad8c68227137e0bc.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c370ad8c68227137e0bc.md
index 4d33b655a6b..84796a15900 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c370ad8c68227137e0bc.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c370ad8c68227137e0bc.md
@@ -1,25 +1,25 @@
 ---
 id: 62a8c370ad8c68227137e0bc
-title: Step 72
+title: Крок 72
 challengeType: 0
 dashedName: step-72
 ---
 
 # --description--
 
-Now that your `store` and `cave` locations are complete, you can code the actions the player takes at those locations. Inside the `buyHealth` function, set `gold` equal to `gold` minus `10`.
+Тепер, коли ваші локації `store` та `cave` закінчено, ви можете запрограмувати дії, які виконує гравець на них. Всередині функції `buyHealth` встановіть `gold` рівним `gold` мінус `10`.
 
-For example, here is how you would set `num` equal to `5` less than `num`: `num = num - 5;`.
+Ось так ви б встановили `num` рівним `5` менше за `num`: `num = num - 5;`.
 
 # --hints--
 
-You should subtract `10` from `gold`.
+Ви повинні відняти `10` від `gold`.
 
 ```js
 assert.match(code, /gold\s*=\s*gold\s*-\s*10/);
 ```
 
-Your `buyHealth` function should reduce `gold` by `10`.
+Ваша функція `buyHealth` повинна зменшити `gold` на `10`.
 
 ```js
 gold = 10;
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c3ebc6c35e23785e1a19.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c3ebc6c35e23785e1a19.md
index df1d38ffce5..99d64068b88 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c3ebc6c35e23785e1a19.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c3ebc6c35e23785e1a19.md
@@ -1,23 +1,23 @@
 ---
 id: 62a8c3ebc6c35e23785e1a19
-title: Step 73
+title: Крок 73
 challengeType: 0
 dashedName: step-73
 ---
 
 # --description--
 
-After the `gold` is updated, add a line to set `health` equal to `health` plus `10`.
+Після оновлення `gold` додайте рядок, щоб встановити `health` рівним `health` плюс `10`.
 
 # --hints--
 
-You should add `10` to `health`.
+Ви повинні додати `10` до `health`.
 
 ```js
 assert.match(code, /health\s*=\s*health\s*\+\s*10/);
 ```
 
-Your `buyHealth` function should increase `health` by `10`.
+Ваша функція `buyHealth` повинна збільшити `health` на `10`.
 
 ```js
 health = 10;
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c41ecaf1bd24536129b8.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c41ecaf1bd24536129b8.md
index a5bb57d211c..604a426c3c6 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c41ecaf1bd24536129b8.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c41ecaf1bd24536129b8.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c41ecaf1bd24536129b8
-title: Step 74
+title: Крок 74
 challengeType: 0
 dashedName: step-74
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c465fa7b0c252f4a8f0c.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c465fa7b0c252f4a8f0c.md
index 70e928a9bd6..a726382c0df 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c465fa7b0c252f4a8f0c.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c465fa7b0c252f4a8f0c.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c465fa7b0c252f4a8f0c
-title: Step 75
+title: Крок 75
 challengeType: 0
 dashedName: step-75
 ---
@@ -9,7 +9,7 @@ dashedName: step-75
 
 Now that you are updating the `gold` and `health` variables, you need to display those new values on the game screen. After your assignment lines, assign the `innerText` property of `goldText` to be the variable `gold`. Use the same pattern to update `healthText` with the `health` variable.
 
-Here is an example:
+Ось приклад:
 
 ```js
 let value = 100;
@@ -21,7 +21,7 @@ You can test this by clicking your "Go to store" button, followed by your "Buy H
 
 # --hints--
 
-Your `buyHealth` function should update the text of `healthText` to be the value of `health`.
+Ваша функція `buyHealth` повинна оновити текст `healthText` на значення `health`.
 
 ```js
 health = 10;
@@ -30,7 +30,7 @@ const target = document.querySelector('#healthText');
 assert.equal(target.innerText, '20');
 ```
 
-Your `buyHealth` function should update the text of `goldText` to be the value of `gold`.
+Ваша функція `buyHealth` повинна оновити текст `goldText` на значення `gold`.
 
 ```js
 gold = 10;
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c4db0710f3260f867a92.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c4db0710f3260f867a92.md
index 89161b6c20f..a58e5aa7a25 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c4db0710f3260f867a92.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c4db0710f3260f867a92.md
@@ -1,13 +1,13 @@
 ---
 id: 62a8c4db0710f3260f867a92
-title: Step 76
+title: Крок 76
 challengeType: 0
 dashedName: step-76
 ---
 
 # --description--
 
-What if the player doesn't have enough gold to buy health? When you want to run code conditionally, you can use the `if` statement. Put all of the code in your `buyHealth` function inside an `if` statement. For example:
+What if the player doesn't have enough gold to buy health? When you want to run code conditionally, you can use the `if` statement. Put all of the code in your `buyHealth` function inside an `if` statement. Наприклад:
 
 ```js
 function myFunction() {
@@ -21,7 +21,7 @@ For now, follow that pattern to use a string `condition` inside your `if` statem
 
 # --hints--
 
-Your `buyHealth` function should have an `if` statement.
+Ваша функція `buyHealth` повинна мати інструкцію `if`.
 
 ```js
 assert.match(buyHealth.toString(), /if/);
@@ -33,7 +33,7 @@ Your `if` statement should have the string `condition` for the condition.
 assert.match(buyHealth.toString(), /if\s*\(('|")condition\1\)/);
 ```
 
-All of your `buyHealth` code should be inside the `if` statement.
+Весь ваш код `buyHealth` повинен бути в інструкції `if`.
 
 ```js
 assert.match(buyHealth.toString(), /if\s*\(('|")condition\1\)\s*\{[\s\S]*\}/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c56247609626fa4a8d6e.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c56247609626fa4a8d6e.md
index e68eacaf744..f5045c16418 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c56247609626fa4a8d6e.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c56247609626fa4a8d6e.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c56247609626fa4a8d6e
-title: Step 77
+title: Крок 77
 challengeType: 0
 dashedName: step-77
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c5db7888af27af23f0dd.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c5db7888af27af23f0dd.md
index d29d4fa92c7..4bf09dcab95 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c5db7888af27af23f0dd.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c5db7888af27af23f0dd.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c5db7888af27af23f0dd
-title: Step 78
+title: Крок 78
 challengeType: 0
 dashedName: step-78
 ---
@@ -9,7 +9,7 @@ dashedName: step-78
 
 Now when a player tries to buy health it will only work if they have enough money. If they do not, nothing will happen. Add an `else` statement where you can put code to run if a player does not have enough money.
 
-Here is an example of an empty `else` statement:
+Ось приклад пустої інструкції `else`:
 
 ```js
 if (num >= 5) {
@@ -21,13 +21,13 @@ if (num >= 5) {
 
 # --hints--
 
-Your `buyHealth` function should have an `else` statement.
+Ваша функція `buyHealth` повинна мати інструкцію `else`.
 
 ```js
 assert.match(buyHealth.toString(), /else/);
 ```
 
-Your `else` statement should come after your `if` statement.
+Ваша інструкція `else` повинна йти після інструкції `if`.
 
 ```js
 const split = buyHealth.toString().split(/\s/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c65b75664c28a8e59c16.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c65b75664c28a8e59c16.md
index 3ef17db2434..91e1027cd64 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c65b75664c28a8e59c16.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c65b75664c28a8e59c16.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c65b75664c28a8e59c16
-title: Step 79
+title: Крок 79
 challengeType: 0
 dashedName: step-79
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c6815f5f1a29735efe1b.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c6815f5f1a29735efe1b.md
index 90b8c75c72f..df862acdb02 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c6815f5f1a29735efe1b.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c6815f5f1a29735efe1b.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c6815f5f1a29735efe1b
-title: Step 80
+title: Крок 80
 challengeType: 0
 dashedName: step-80
 ---
@@ -11,7 +11,7 @@ Use `const` to create a `weapons` variable above your `locations` array. Assign
 
 # --hints--
 
-You should use `const` to declare your `weapons` variable.
+Ви повинні використати `const`, щоб оголосити змінну `weapons`.
 
 ```js
 assert.match(code, /const weapons/i);
@@ -23,7 +23,7 @@ Your `weapons` variable should be an array.
 assert.isArray(weapons);
 ```
 
-Your `weapons` variable should be empty.
+Ваша змінна `weapons` повинна бути порожньою.
 
 ```js
 assert.equal(weapons.length, 0);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7322e42962ad53ad204.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7322e42962ad53ad204.md
index bed05c8d88b..d61231a70d3 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7322e42962ad53ad204.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7322e42962ad53ad204.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c7322e42962ad53ad204
-title: Step 81
+title: Крок 81
 challengeType: 0
 dashedName: step-81
 ---
@@ -11,13 +11,13 @@ Just like your `locations` array, your `weapons` array will hold objects. Add fo
 
 # --hints--
 
-Your `weapons` array should have four values.
+Ваш масив `weapons` повинен мати чотири значення.
 
 ```js
 assert.lengthOf(weapons, 4);
 ```
 
-Your `weapons` array should have four objects.
+Ваш масив `weapons` повинен мати чотири об’єкти.
 
 ```js
 assert.isObject(weapons[0]);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7a59e72c02bb1c717d2.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7a59e72c02bb1c717d2.md
index 422e0ad66b5..e429a203bac 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7a59e72c02bb1c717d2.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c7a59e72c02bb1c717d2.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c7a59e72c02bb1c717d2
-title: Step 82
+title: Крок 82
 challengeType: 0
 dashedName: step-82
 ---
@@ -11,7 +11,7 @@ Inside your `buyWeapon` function, add an `if` statement to check if `gold` is gr
 
 # --hints--
 
-Your `buyWeapon` function should have an `if` statement.
+Ваша функція `buyWeapon` повинна мати інструкцію `if`.
 
 ```js
 assert.include(buyWeapon.toString(), 'if');
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c89e4272512d44fc1c66.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c89e4272512d44fc1c66.md
index cded49b4395..5cd53a9929b 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c89e4272512d44fc1c66.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c89e4272512d44fc1c66.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c89e4272512d44fc1c66
-title: Step 83
+title: Крок 83
 challengeType: 0
 dashedName: step-83
 ---
@@ -25,7 +25,7 @@ buyWeapon();
 assert.equal(gold, 0);
 ```
 
-Your code should be in your `if` statement.
+Ваш код повинен бути у вашій інструкції `if`.
 
 ```js
 gold = 20;
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c8cee8e5cf2e001789b4.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c8cee8e5cf2e001789b4.md
index 7f2575cbb11..ac895dc9494 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c8cee8e5cf2e001789b4.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8c8cee8e5cf2e001789b4.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8c8cee8e5cf2e001789b4
-title: Step 84
+title: Крок 84
 challengeType: 0
 dashedName: step-84
 ---
@@ -28,7 +28,7 @@ buyWeapon();
 assert.equal(currentWeapon, 1);
 ```
 
-Your code should be in your `if` statement.
+Ваш код повинен бути у вашій інструкції `if`.
 
 ```js
 gold = 20;
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ca22d29fe62f3952bdf5.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ca22d29fe62f3952bdf5.md
index dbd8006158d..95905bcd1af 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ca22d29fe62f3952bdf5.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ca22d29fe62f3952bdf5.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8ca22d29fe62f3952bdf5
-title: Step 85
+title: Крок 85
 challengeType: 0
 dashedName: step-85
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cb19bd7f8a304e5427a1.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cb19bd7f8a304e5427a1.md
index 29c3d761fb0..e4c08043490 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cb19bd7f8a304e5427a1.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cb19bd7f8a304e5427a1.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8cb19bd7f8a304e5427a1
-title: Step 86
+title: Крок 86
 challengeType: 0
 dashedName: step-86
 ---
@@ -11,13 +11,13 @@ Now update the `goldText` element to display the new value of `gold`, and update
 
 # --hints--
 
-You should update the `innerText` property of the `goldText` element to be `gold`.
+Ви повинні оновити властивість `innerText` елемента `goldText` на `gold`.
 
 ```js
 assert.match(buyWeapon.toString(), /goldText\.innerText\s*=\s*gold/);
 ```
 
-You should update the `innerText` property of the `text` element to be `You now have a new weapon.`.
+Ви повинні оновити властивість `innerText` елемента `text` на `You now have a new weapon.`.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*=\s*('|")You now have a new weapon\.\1/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
index d91e6245ebe..89cb6024574 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cbd1e3595431d5a2b3f1.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8cbd1e3595431d5a2b3f1
-title: Step 87
+title: Крок 87
 challengeType: 0
 dashedName: step-87
 ---
@@ -17,7 +17,7 @@ Your `buyWeapon` function should have a variable named `newWeapon`.
 assert.match(buyWeapon.toString(), /newWeapon/);
 ```
 
-You should use `let` to declare `newWeapon`.
+Ви повинні використати `let`, щоб оголосити `newWeapon`.
 
 ```js
 assert.match(code, /let\s+newWeapon/);
@@ -206,7 +206,7 @@ function buyWeapon() {
     gold -= 30;
     currentWeapon++;
     goldText.innerText = gold;
-    
+
     text.innerText = "You now have a new weapon.";
   }
 }
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cce1b0c32c33017cf2e9.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cce1b0c32c33017cf2e9.md
index 165962a1920..842371df761 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cce1b0c32c33017cf2e9.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cce1b0c32c33017cf2e9.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8cce1b0c32c33017cf2e9
-title: Step 88
+title: Крок 88
 challengeType: 0
 dashedName: step-88
 ---
@@ -19,7 +19,7 @@ let value = array[index];
 
 # --hints--
 
-You should update `newWeapon` to have the value of `weapons[currentWeapon]`.
+Ви повинні оновити `newWeapon` на значення `weapons[currentWeapon]`.
 
 ```js
 assert.match(buyWeapon.toString(), /newWeapon\s*=\s*weapons\[currentWeapon\]/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce1dfc990134162b3bd9.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce1dfc990134162b3bd9.md
index 7165051ad52..d14f858fcb7 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce1dfc990134162b3bd9.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce1dfc990134162b3bd9.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8ce1dfc990134162b3bd9
-title: Step 89
+title: Крок 89
 challengeType: 0
 dashedName: step-89
 ---
@@ -11,7 +11,7 @@ dashedName: step-89
 
 # --hints--
 
-You should update `newWeapon` to have the value of `weapons[currentWeapon].name`.
+Ви повинні оновити `newWeapon` на значення `weapons[currentWeapon].name`.
 
 ```js
 assert.match(buyWeapon.toString(), /newWeapon\s*=\s*weapons\[currentWeapon\]\.name;/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
index 4b1f8fb6cb6..c778a90d1d2 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ce73d0dce43468f6689c.md
@@ -1,13 +1,13 @@
 ---
 id: 62a8ce73d0dce43468f6689c
-title: Step 90
+title: Крок 90
 challengeType: 0
 dashedName: step-90
 ---
 
 # --description--
 
-You can insert variables into a string with the <dfn>concatenation operator</dfn> `+`. Update the `You now have a new weapon.` string to say `You now have a ` and the name of the new weapon. Remember to end the sentence with a period.
+You can insert variables into a string with the <dfn>concatenation operator</dfn> `+`. Update the `You now have a new weapon.` string to say `You now have a` and the name of the new weapon. Не забудьте поставити крапку в кінці речення.
 
 Here is an example that creates the string `Hello, our name is freeCodeCamp.`:
 
@@ -18,7 +18,7 @@ const ourStr = "Hello, our name is " + ourName + ".";
 
 # --hints--
 
-You should update the `text.innerText` assignment to start with the string `You now have a `.
+You should update the `text.innerText` assignment to start with the string `You now have a`.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*=\s*('|")You now have a \1/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
index 748ab4d2f08..cf81c4b89a1 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8cf22272d6d35af80d4ac.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8cf22272d6d35af80d4ac
-title: Step 91
+title: Крок 91
 challengeType: 0
 dashedName: step-91
 ---
@@ -9,7 +9,7 @@ dashedName: step-91
 
 Back at the beginning of this project, you created the `inventory` array. Add the `newWeapon` to the end of the `inventory` array using the `push()` method.
 
-Here is an example:
+Ось приклад:
 
 ```js
 const arr = ["first"];
@@ -214,7 +214,7 @@ function buyWeapon() {
     goldText.innerText = gold;
     let newWeapon = weapons[currentWeapon].name;
     text.innerText = "You now have a " + newWeapon + ".";
-    
+
   }
 }
 --fcc-editable-region--
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
index b7219fb9be1..f00bb65a78d 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0337d7c67377a4a76c6.md
@@ -1,13 +1,13 @@
 ---
 id: 62a8d0337d7c67377a4a76c6
-title: Step 92
+title: Крок 92
 challengeType: 0
 dashedName: step-92
 ---
 
 # --description--
 
-Up until now, any time `text.innerText` was updated the old text was erased. This time, use the `+=` operator to add text to the end of `text.innerText`. Add the string ` In your inventory you have: ` - include the spaces at the beginning and the end.
+Up until now, any time `text.innerText` was updated the old text was erased. This time, use the `+=` operator to add text to the end of `text.innerText`. Add the string `In your inventory you have:` - include the spaces at the beginning and the end.
 
 # --hints--
 
@@ -24,7 +24,7 @@ You should use the `+=` operator to add to `text.innerText`.
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*/)
 ```
 
-You should add the string ` In your inventory you have: ` to the end of `text.innerText`. Mind the spaces!
+You should add the string `In your inventory you have:` to the end of `text.innerText`. Mind the spaces!
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*('|")\sIn your inventory you have:\s\1/)
@@ -203,7 +203,7 @@ function buyWeapon() {
     let newWeapon = weapons[currentWeapon].name;
     text.innerText = "You now have a " + newWeapon + ".";
     inventory.push(newWeapon);
-    
+
   }
 }
 --fcc-editable-region--
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
index 098be4a56e6..fff40e31cee 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d08668fa8b38732486e9.md
@@ -1,23 +1,23 @@
 ---
 id: 62a8d08668fa8b38732486e9
-title: Step 93
+title: Крок 93
 challengeType: 0
 dashedName: step-93
 ---
 
 # --description--
 
-At the end of the second `text.innerText` string you just added, use the concatenation operator to add the contents of `inventory` to the string.
+В кінці другого рядка `text.innerText`, який ви щойно додали, використайте оператор конкатенації, щоб додати вміст `inventory` до рядка.
 
 # --hints--
 
-You should not change the ` In your inventory you have: ` string.
+Ви не повинні змінювати рядок `In your inventory you have:`.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*('|")\sIn your inventory you have:\s\1/)
 ```
 
-You should use the concatenation operator `+` to add the contents of `inventory` to the string.
+Ви повинні використати оператор конкатенації `+`, щоб додати вміст `inventory` до рядка.
 
 ```js
 assert.match(buyWeapon.toString(), /text\.innerText\s*\+=\s*('|")\sIn your inventory you have:\s\1\s*\+\s*inventory/)
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0c4f12c2239b6618582.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0c4f12c2239b6618582.md
index 3ebebb1edd6..cfad0593ea0 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0c4f12c2239b6618582.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0c4f12c2239b6618582.md
@@ -1,36 +1,36 @@
 ---
 id: 62a8d0c4f12c2239b6618582
-title: Step 94
+title: Крок 94
 challengeType: 0
 dashedName: step-94
 ---
 
 # --description--
 
-Add an `else` statement to your `buyWeapon` function. In that statement, set `text.innerText` to equal `You do not have enough gold to buy a weapon.`.
+Додайте інструкцію `else` до своєї функції `buyWeapon`. У цій інструкції встановіть `text.innerText` рівним `You do not have enough gold to buy a weapon.`.
 
 # --hints--
 
-You should add an `else` statement to your `buyWeapon` function.
+Ви повинні додати інструкцію `else` до своєї функції `buyWeapon`.
 
 ```js
 assert.match(buyWeapon.toString(), /else/);
 ```
 
-Your `else` statement should come after your `if` statement.
+Ваша інструкція `else` повинна йти після інструкції `if`.
 
 ```js
 const split = buyWeapon.toString().split(/\s|\n/);
 assert.isAbove(split.indexOf('else'), split.indexOf('if'));
 ```
 
-You should set `text.innerText` to `You do not have enough gold to buy a weapon.`.
+Ви повинні встановити `text.innerText` на `You do not have enough gold to buy a weapon.`.
 
 ```js
 assert.match(buyWeapon.toString(), /text.innerText\s*=\s*('|")You do not have enough gold to buy a weapon.\1/);
 ```
 
-Your `else` statement should set `text.innerText` to `You do not have enough gold to buy a weapon.`.
+Ваша інструкція `else` повинна встановити `text.innerText` на `You do not have enough gold to buy a weapon.`.
 
 ```js
 gold = 20;
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0fdf2dad83a92883a80.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0fdf2dad83a92883a80.md
index 1c2b1476e8f..39804d76c55 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0fdf2dad83a92883a80.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d0fdf2dad83a92883a80.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d0fdf2dad83a92883a80
-title: Step 95
+title: Крок 95
 challengeType: 0
 dashedName: step-95
 ---
@@ -17,7 +17,7 @@ You should have a new `if` statement that checks if `currentWeapon` is less than
 assert.match(buyWeapon.toString(), /currentWeapon\s*\<\s*3/)
 ```
 
-Your existing `if` statement should be within your new `if` statement.
+Ваша наявна інструкція `if` повинна бути в новій інструкції `if`.
 
 ```js
 currentWeapon = 5;
@@ -26,7 +26,7 @@ buyWeapon();
 assert.equal(gold, 50);
 ```
 
-Your existing `else` statement should be within your new `if` statement.
+Ваша наявна інструкція `else` повинна бути в новій інструкції `if`.
 
 ```js
 currentWeapon = 5;
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d143f2a58e3b6d6e9c33.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d143f2a58e3b6d6e9c33.md
index a705f22a61f..d8c46170aa1 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d143f2a58e3b6d6e9c33.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d143f2a58e3b6d6e9c33.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d143f2a58e3b6d6e9c33
-title: Step 96
+title: Крок 96
 challengeType: 0
 dashedName: step-96
 ---
@@ -11,7 +11,7 @@ Arrays have a `length` property that returns the number of items in the array. Y
 
 # --hints--
 
-You should use the `length` property on the `weapons` array.
+Ви повинні використати властивість `length` для масиву `weapons`.
 
 ```js
 assert.match(buyWeapon.toString(), /weapons\.length/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d1c72e8bb13c2074d93c.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d1c72e8bb13c2074d93c.md
index 4db3e483fce..0a527f25ecb 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d1c72e8bb13c2074d93c.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d1c72e8bb13c2074d93c.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d1c72e8bb13c2074d93c
-title: Step 97
+title: Крок 97
 challengeType: 0
 dashedName: step-97
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2146a3e853d0a6e28ca.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2146a3e853d0a6e28ca.md
index 2061307615c..ff96c69e289 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2146a3e853d0a6e28ca.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2146a3e853d0a6e28ca.md
@@ -1,24 +1,24 @@
 ---
 id: 62a8d2146a3e853d0a6e28ca
-title: Step 98
+title: Крок 98
 challengeType: 0
 dashedName: step-98
 ---
 
 # --description--
 
-Add an `else` statement for your outer `if` statement. Inside this new `else` statement, set `text.innerText` to `You already have the most powerful weapon!`.
+Додайте інструкцію `else` до своєї зовнішньої інструкції `if`. Inside this new `else` statement, set `text.innerText` to `You already have the most powerful weapon!`.
 
 # --hints--
 
-You should have another `else` statement in your `buyWeapon` function.
+Ви повинні мати іншу інструкцію `else` у своїй функції `buyWeapon`.
 
 ```js
 const matches = buyWeapon.toString().match(/else/g);
 assert.equal(matches.length, 2);
 ```
 
-You should set `text.innerText` to `You already have the most powerful weapon!`.
+Ви повинні встановити `text.innerText` на `You already have the most powerful weapon!`.
 
 ```js
 assert.match(buyWeapon.toString(), /('|")You already have the most powerful weapon!\1/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d24c97461b3ddb9397c8.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d24c97461b3ddb9397c8.md
index cd0c1476164..73760eb149f 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d24c97461b3ddb9397c8.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d24c97461b3ddb9397c8.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d24c97461b3ddb9397c8
-title: Step 99
+title: Крок 99
 challengeType: 0
 dashedName: step-99
 ---
@@ -11,25 +11,25 @@ Once a player has the most powerful weapon, you can give them the ability to sel
 
 # --hints--
 
-You should set the value of `button2.innerText`.
+Ви повинні встановити значення `button2.innerText`.
 
 ```js
 assert.match(buyWeapon.toString(), /button2\.innerText/);
 ```
 
-You should set the value of `button2.innerText` to `Sell weapon for 15 gold`.
+Ви повинні встановити значення `button2.innerText` на `Sell weapon for 15 gold`.
 
 ```js
 assert.match(buyWeapon.toString(), /button2\.innerText\s*=\s*('|")Sell weapon for 15 gold\1;/);
 ```
 
-You should set the value of `button2.onclick`.
+Ви повинні встановити значення `button2.onclick`.
 
 ```js
 assert.match(buyWeapon.toString(), /button2\.onclick/);
 ```
 
-You should set the value of `button2.onclick` to `sellWeapon`.
+Ви повинні встановити значення `button2.onclick` на `sellWeapon`.
 
 ```js
 assert.match(buyWeapon.toString(), /button2\.onclick\s*=\s*sellWeapon;/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2e2a073be3edb46116f.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2e2a073be3edb46116f.md
index a5e28c829e7..e93a2728030 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2e2a073be3edb46116f.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d2e2a073be3edb46116f.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d2e2a073be3edb46116f
-title: Step 100
+title: Крок 100
 challengeType: 0
 dashedName: step-100
 ---
@@ -11,13 +11,13 @@ Create an empty `sellWeapon` function.
 
 # --hints--
 
-You should use the `function` keyword to declare a `sellWeapon` variable.
+Ви повинні використати ключове слово `function`, щоб оголосити змінну `sellWeapon`.
 
 ```js
 assert.isFunction(sellWeapon);
 ```
 
-`sellWeapon` should be an empty function.
+`sellWeapon` має бути порожньою функцією.
 
 ```js
 assert.match(sellWeapon.toString(), /sellWeapon\(\)\s*\{\s*\}/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d31ebbc10e3fe1b28e03.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d31ebbc10e3fe1b28e03.md
index 77100cf5462..70df11ebc6a 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d31ebbc10e3fe1b28e03.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d31ebbc10e3fe1b28e03.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d31ebbc10e3fe1b28e03
-title: Step 101
+title: Крок 101
 challengeType: 0
 dashedName: step-101
 ---
@@ -11,7 +11,7 @@ Players should not be able to sell their only weapon. Inside the `sellWeapon` fu
 
 # --hints--
 
-Your `sellWeapon` function should have an `if` statement.
+Ваша функція `sellWeapon` повинна мати інструкцію `if`.
 
 ```js
 assert.match(sellWeapon.toString(), /if/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d35660db4040ba292193.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d35660db4040ba292193.md
index dbbf432519d..443c43c9dcb 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d35660db4040ba292193.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d35660db4040ba292193.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d35660db4040ba292193
-title: Step 102
+title: Крок 102
 challengeType: 0
 dashedName: step-102
 ---
@@ -23,7 +23,7 @@ You should set `goldText.innerText` to `gold`.
 assert.match(sellWeapon.toString(), /goldText\.innerText\s*=\s*gold/);
 ```
 
-Your code should be in your `if` statement.
+Ваш код повинен бути у вашій інструкції `if`.
 
 ```js
 inventory = ["Naomi"];
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d382cd075f4169223e14.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d382cd075f4169223e14.md
index 8f3764e0ef9..093e309a2a3 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d382cd075f4169223e14.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d382cd075f4169223e14.md
@@ -1,19 +1,19 @@
 ---
 id: 62a8d382cd075f4169223e14
-title: Step 103
+title: Крок 103
 challengeType: 0
 dashedName: step-103
 ---
 
 # --description--
 
-Use the `let` keyword to create a variable named `currentWeapon`. Don't assign it a value yet.
+Use the `let` keyword to create a variable named `currentWeapon`. Поки що не присвоюйте значення.
 
 Notice that you already have a `currentWeapon` variable elsewhere in your code. Since you are using the `let` keyword instead of `var`, the new `currentWeapon` is scoped only to this `if` statement. At the close of the `if` statement, the old `currentWeapon` will be used again.
 
 # --hints--
 
-You should use `let` to declare a `currentWeapon` variable.
+Ви повинні використати `let`, щоб оголосити змінну `currentWeapon`.
 
 ```js
 assert.match(sellWeapon.toString(), /currentWeapon/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d539dc11cb42b5dd7ec8.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d539dc11cb42b5dd7ec8.md
index 1fb5303efc5..cf21872886f 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d539dc11cb42b5dd7ec8.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d539dc11cb42b5dd7ec8.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d539dc11cb42b5dd7ec8
-title: Step 104
+title: Крок 104
 challengeType: 0
 dashedName: step-104
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
index 03e5cceea99..fdf415d9005 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d61ddfe35744369365b7.md
@@ -1,13 +1,13 @@
 ---
 id: 62a8d61ddfe35744369365b7
-title: Step 105
+title: Крок 105
 challengeType: 0
 dashedName: step-105
 ---
 
 # --description--
 
-After your `currentWeapon`, use the concatenation operator to set `text.innerText` to the string `You sold a `, then `currentWeapon`, then the string `.`.
+After your `currentWeapon`, use the concatenation operator to set `text.innerText` to the string `You sold a`, then `currentWeapon`, then the string `.`.
 
 # --hints--
 
@@ -17,19 +17,19 @@ You should use the assignment operator with `text.innerText`.
 assert.match(sellWeapon.toString(), /text\.innerText\s*=/);
 ```
 
-You should add `You sold a ` to `text.innerText`. Spacing is important.
+Ви повинні додати `You sold a` до `text.innerText`. Spacing is important.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*=\s*('|")You sold a \1/);
 ```
 
-You should add the value of `currentWeapon` to the `You sold a ` string. Use the concatenation operator to do this on the same line.
+Ви повинні додати значення `currentWeapon` до рядка `You sold a`. Use the concatenation operator to do this on the same line.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*=\s*('|")You sold a\s\1\s*\+\s*\_currentWeapon/);
 ```
 
-You should add the string `.` to the value of `currentWeapon`. Use the concatenation operator to do this on the same line.
+Ви повинні додати рядок `.` до значення `currentWeapon`. Use the concatenation operator to do this on the same line.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*=\s*('|")You sold a \1\s*\+\s*\_currentWeapon\s+\+\s+('|")\.\2/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
index bc8435faa22..a087ec1f55b 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d6c7001ebc45350e3d16.md
@@ -1,13 +1,13 @@
 ---
 id: 62a8d6c7001ebc45350e3d16
-title: Step 106
+title: Крок 106
 challengeType: 0
 dashedName: step-106
 ---
 
 # --description--
 
-Now use the `+=` operator to add the string ` In your inventory you have: ` and the contents of `inventory` to the `text.innerText`. Make sure to include the space at the beginning and end of the ` In your inventory you have: ` string.
+Now use the `+=` operator to add the string `In your inventory you have:` and the contents of `inventory` to the `text.innerText`. Make sure to include the space at the beginning and end of the `In your inventory you have:` string.
 
 # --hints--
 
@@ -25,7 +25,7 @@ const matches = sellWeapon.toString().match(/text\.innerText\s*\+=/g);
 assert.equal(matches.length, 1);
 ```
 
-You should add the string ` In your inventory you have: ` to the second `text.innerText` line. Spacing matters.
+You should add the string `In your inventory you have:` to the second `text.innerText` line. Spacing matters.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*\+=\s*('|") In your inventory you have: \1/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d7b8ab568b4649998954.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d7b8ab568b4649998954.md
index 3e59ee00a2d..9a3b80743e6 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d7b8ab568b4649998954.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d7b8ab568b4649998954.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d7b8ab568b4649998954
-title: Step 107
+title: Крок 107
 challengeType: 0
 dashedName: step-107
 ---
@@ -11,13 +11,13 @@ Use an `else` statement to run when the `inventory` length is not more than one.
 
 # --hints--
 
-Your `sellWeapon` function should have an `else` statement.
+Ваша функція `sellWeapon` повинна мати інструкцію `else`.
 
 ```js
 assert.match(sellWeapon.toString(), /else/);
 ```
 
-You should set `text.innerText` to `Don't sell your only weapon!`.
+Ви повинні встановити `text.innerText` на `Don't sell your only weapon!`.
 
 ```js
 assert.match(sellWeapon.toString(), /text\.innerText\s*=\s*('|")Don't sell your only weapon!\1/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d81f539f004776dd9b1e.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d81f539f004776dd9b1e.md
index f47ecd3e581..81e2f59ee9f 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d81f539f004776dd9b1e.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8d81f539f004776dd9b1e.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8d81f539f004776dd9b1e
-title: Step 108
+title: Крок 108
 challengeType: 0
 dashedName: step-108
 ---
@@ -13,7 +13,7 @@ Below your `weapons` array, define a `monsters` variable and assign it an array.
 
 # --hints--
 
-You should use `const` to declare a `monsters` variable.
+Ви повинні використати `const`, щоб оголосити змінну `monsters`.
 
 ```js
 assert.match(code, /const\s*monsters/);
@@ -31,61 +31,61 @@ Your `monsters` variable should have 3 values.
 assert.lengthOf(monsters, 3);
 ```
 
-Your `monsters` array should have 3 objects.
+Ваш масив `monsters` повинен мати 3 об’єкти.
 
 ```js
 assert(monsters.every(val => typeof val === "object"));
 ```
 
-The first value in your `monsters` array should have an object with a `name` property set to `slime`.
+Перше значення у вашому масиві `monsters` повинне мати об'єкт із властивістю `name` зі значенням `slime`.
 
 ```js
 assert.equal(monsters[0].name, "slime");
 ```
 
-The first value in your `monsters` array should have an object with a `level` property set to `2`.
+Перше значення у вашому масиві `monsters` повинне мати об'єкт із властивістю `level` зі значенням `2`.
 
 ```js
 assert.equal(monsters[0].level, 2);
 ```
 
-The first value in your `monsters` array should have an object with a `health` property set to `15`.
+Перше значення у вашому масиві `monsters` повинне мати об'єкт із властивістю `health` зі значенням `15`.
 
 ```js
 assert.equal(monsters[0].health, 15);
 ```
 
-The second value in your `monsters` array should have an object with a `name` property set to `fanged beast`.
+Друге значення у вашому масиві `monsters` повинне мати об'єкт із властивістю `name` зі значенням `fanged beast`.
 
 ```js
 assert.equal(monsters[1].name, "fanged beast");
 ```
 
-The second value in your `monsters` array should have an object with a `level` property set to `8`.
+Друге значення у вашому масиві `monsters` повинне мати об'єкт із властивістю `level` зі значенням `8`.
 
 ```js
 assert.equal(monsters[1].level, 8);
 ```
 
-The second value in your `monsters` array should have an object with a `health` property set to `60`.
+Друге значення у вашому масиві `monsters` повинне мати об'єкт із властивістю `health` зі значенням `60`.
 
 ```js
 assert.equal(monsters[1].health, 60);
 ```
 
-The third value in your `monsters` array should have an object with a `name` property set to `dragon`.
+Третє значення у вашому масиві `monsters` повинне мати об'єкт із властивістю `name` зі значенням `dragon`.
 
 ```js
 assert.equal(monsters[2].name, "dragon");
 ```
 
-The third value in your `monsters` array should have an object with a `level` property set to `20`.
+Третє значення у вашому масиві `monsters` повинне мати об'єкт із властивістю `level` зі значенням `20`.
 
 ```js
 assert.equal(monsters[2].level, 20);
 ```
 
-The third value in your `monsters` array should have an object with a `health` property set to `300`.
+Третє значення у вашому масиві `monsters` повинне мати об'єкт із властивістю `health` зі значенням `300`.
 
 ```js
 assert.equal(monsters[2].health, 300);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd468debb449b4454086.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd468debb449b4454086.md
index 4167fc0a12b..f90bc4355bf 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd468debb449b4454086.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd468debb449b4454086.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8dd468debb449b4454086
-title: Step 109
+title: Крок 109
 challengeType: 0
 dashedName: step-109
 ---
@@ -11,13 +11,13 @@ Fighting each type of monster will use similar logic. Create an empty function c
 
 # --hints--
 
-You should use the `function` keyword to declare `goFight`.
+Ви повинні використати ключове слово `function`, щоб оголосити `goFight`.
 
 ```js
 assert.match(code, /function\s*goFight/);
 ```
 
-`goFight` should be an empty function.
+`goFight` має бути порожньою функцією.
 
 ```js
 assert.match(goFight.toString(), /goFight\s*\(\s*\)\s*\{\s*\}/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd9cdb16324b04cfd958.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd9cdb16324b04cfd958.md
index b960134fac7..cf746772d06 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd9cdb16324b04cfd958.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dd9cdb16324b04cfd958.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8dd9cdb16324b04cfd958
-title: Step 110
+title: Крок 110
 challengeType: 0
 dashedName: step-110
 ---
@@ -13,19 +13,19 @@ On the next line, call the `goFight` function.
 
 # --hints--
 
-You should set `fighting` equal to `0`.
+Ви повинні встановити `fighting` рівним `0`.
 
 ```js
 assert.match(fightSlime.toString(), /fighting\s*=\s*0;/);
 ```
 
-You should not use `let` or `const`.
+Ви не повинні використовувати `let` чи `const`.
 
 ```js
 assert.notMatch(fightSlime.toString(), /let|const|var/);
 ```
 
-You should call the `goFight` function.
+Ви повинні викликати функцію `goFight`.
 
 ```js
 assert.match(fightSlime.toString(), /goFight\(\);/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dfcf7fb1044d2f478fd1.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dfcf7fb1044d2f478fd1.md
index aa331ca8991..f8ef6d5b0e0 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dfcf7fb1044d2f478fd1.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8dfcf7fb1044d2f478fd1.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8dfcf7fb1044d2f478fd1
-title: Step 111
+title: Крок 111
 challengeType: 0
 dashedName: step-111
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e0d1d0110b4ec421489f.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e0d1d0110b4ec421489f.md
index 5eccfafdc9b..c4318a8be23 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e0d1d0110b4ec421489f.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e0d1d0110b4ec421489f.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8e0d1d0110b4ec421489f
-title: Step 112
+title: Крок 112
 challengeType: 0
 dashedName: step-112
 ---
@@ -11,25 +11,25 @@ At the end of your code, create two empty functions named `attack` and `dodge`.
 
 # --hints--
 
-You should use the `function` keyword to declare `attack`.
+Ви повинні використати ключове слово `function`, щоб оголосити `attack`.
 
 ```js
 assert.match(code, /function\s*attack/);
 ```
 
-`attack` should be an empty function.
+`attack` має бути порожньою функцією.
 
 ```js
 assert.match(attack.toString(), /attack\s*\(\s*\)\s*\{\s*\}/);
 ```
 
-You should use the `function` keyword to declare `dodge`.
+Ви повинні використати ключове слово `function`, щоб оголосити `dodge`.
 
 ```js
 assert.match(code, /function\s*dodge/);
 ```
 
-`dodge` should be an empty function.
+`dodge` має бути порожньою функцією.
 
 ```js
 assert.match(dodge.toString(), /dodge\s*\(\s*\)\s*\{\s*\}/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e142f7f0bd4fed898de3.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e142f7f0bd4fed898de3.md
index 70d0725b1d9..186c72201f6 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e142f7f0bd4fed898de3.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e142f7f0bd4fed898de3.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8e142f7f0bd4fed898de3
-title: Step 113
+title: Крок 113
 challengeType: 0
 dashedName: step-113
 ---
@@ -18,13 +18,13 @@ console.log(locations);
 assert.lengthOf(locations, 4);
 ```
 
-Your new value should be an object.
+Ваше нове значення повинне бути об'єктом.
 
 ```js
 assert.isObject(locations[3]);
 ```
 
-Your new object should have a `name` property set to `fight`.
+Ваш новий об’єкт повинен мати властивість `name` зі значенням `fight`.
 
 ```js
 assert.equal(locations[3].name, "fight");
@@ -42,7 +42,7 @@ Your new object should have a `button functions` property set to an array with t
 assert.deepEqual(locations[3]["button functions"], [attack, dodge, goTown]);
 ```
 
-Your new object should have a `text` property set to `You are fighting a monster.`.
+Ваш новий об’єкт повинен мати властивість `text` зі значенням `You are fighting a monster.`.
 
 ```js
 assert.equal(locations[3].text, "You are fighting a monster.");
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e1dc897df55108bcb5e8.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e1dc897df55108bcb5e8.md
index d87c8179a6e..e4272e7fead 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e1dc897df55108bcb5e8.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e1dc897df55108bcb5e8.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8e1dc897df55108bcb5e8
-title: Step 114
+title: Крок 114
 challengeType: 0
 dashedName: step-114
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e21398ad61520edb724f.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e21398ad61520edb724f.md
index ec221bb2490..b9de1e17a8d 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e21398ad61520edb724f.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e21398ad61520edb724f.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8e21398ad61520edb724f
-title: Step 115
+title: Крок 115
 challengeType: 0
 dashedName: step-115
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e24c673b075317cc0b09.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e24c673b075317cc0b09.md
index 64379cb2b5d..9b6a1d3a7cd 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e24c673b075317cc0b09.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e24c673b075317cc0b09.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8e24c673b075317cc0b09
-title: Step 116
+title: Крок 116
 challengeType: 0
 dashedName: step-116
 ---
@@ -27,7 +27,7 @@ You should use dot notation to access the `display` property of the `style` prop
 assert.match(goFight.toString(), /monsterStats\.style\.display/);
 ```
 
-You should set the `display` property to `block`.
+Ви повинні встановити властивість `display` на `block`.
 
 ```js
 assert.match(goFight.toString(), /monsterStats\.style\.display\s*=\s*('|")block\1/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e271f8e3d1541f9624ad.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e271f8e3d1541f9624ad.md
index 0ccd9de7c1a..97167016802 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e271f8e3d1541f9624ad.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e271f8e3d1541f9624ad.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8e271f8e3d1541f9624ad
-title: Step 117
+title: Крок 117
 challengeType: 0
 dashedName: step-117
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
index 229ca08f2a2..6f8489a998b 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e35675c18c56354c08cf.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8e35675c18c56354c08cf
-title: Step 118
+title: Крок 118
 challengeType: 0
 dashedName: step-118
 ---
@@ -17,19 +17,19 @@ You should use dot notation to access the `innerText` property of `text`.
 assert.match(attack.toString(), /text\.innerText/);
 ```
 
-You should assign the string `The ` to `innerText` property of `text`.
+You should assign the string `The` to `innerText` property of `text`.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1/);
 ```
 
-You should use the concatenation operator to add the value of `monsters[fighting].name` to the `The ` string.
+You should use the concatenation operator to add the value of `monsters[fighting].name` to the `The` string.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1\s*\+\s*monsters\[fighting\]\.name/);
 ```
 
-You should use the concatenation operator to add the string ` attacks.` to the `monsters[fighting].name` string.
+You should use the concatenation operator to add the string `attacks.` to the `monsters[fighting].name` string.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*=\s*('|")The \1\s*\+\s*monsters\[fighting\]\.name\s*\+\s*('|") attacks\.\2/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
index 6566de3802a..ba26addcbfb 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e41e2f190c58404dd46e.md
@@ -1,13 +1,13 @@
 ---
 id: 62a8e41e2f190c58404dd46e
-title: Step 119
+title: Крок 119
 challengeType: 0
 dashedName: step-119
 ---
 
 # --description--
 
-On a new line, add the string ` You attack it with your [weapon].` to the `text` value, replacing `[weapon]` with the player's current weapon.
+On a new line, add the string `You attack it with your [weapon].` to the `text` value, replacing `[weapon]` with the player's current weapon.
 
 # --hints--
 
@@ -24,7 +24,7 @@ You should use compound assignment with `text.innerText`.
 assert.match(attack.toString(), /text\.innerText\s*\+=/);
 ```
 
-You should add the string ` You attack it with your ` to the `text.innerText` value. Remember that spacing matters.
+You should add the string `You attack it with your` to the `text.innerText` value. Remember that spacing matters.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|") You attack it with your \1/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e45cc600c3591cee671a.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e45cc600c3591cee671a.md
index 7ebd6d5383a..9e73ed1ef7e 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e45cc600c3591cee671a.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e45cc600c3591cee671a.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8e45cc600c3591cee671a
-title: Step 120
+title: Крок 120
 challengeType: 0
 dashedName: step-120
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e49f4df7af5ae2d7a616.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e49f4df7af5ae2d7a616.md
index 687f2f04e57..a34781abadf 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e49f4df7af5ae2d7a616.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e49f4df7af5ae2d7a616.md
@@ -1,13 +1,13 @@
 ---
 id: 62a8e49f4df7af5ae2d7a616
-title: Step 121
+title: Крок 121
 challengeType: 0
 dashedName: step-121
 ---
 
 # --description--
 
-Set `monsterHealth` to `monsterHealth` minus the power of the player's current weapon. Remember you have the `currentWeapon` variable and the `power` property.
+Set `monsterHealth` to `monsterHealth` minus the power of the player's current weapon. Пам'ятайте, що ви маєте змінну `currentWeapon` та властивість `power`.
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e4dc6a60f85bf256a0cb.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e4dc6a60f85bf256a0cb.md
index fe85bcd7f75..49325efe364 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e4dc6a60f85bf256a0cb.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8e4dc6a60f85bf256a0cb.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8e4dc6a60f85bf256a0cb
-title: Step 122
+title: Крок 122
 challengeType: 0
 dashedName: step-122
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
index 7c47c581528..109d4c0e7ce 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ed36d7a7915dfa444ba2.md
@@ -23,7 +23,7 @@ assert.match(attack.toString(), /healthText\.innerText/);
 assert.match(attack.toString(), /healthText\.innerText\s*=\s*health/);
 ```
 
-Ви повинні оновити `monsterHealthText.innerText`.
+You should update `monsterHealthText.innerText`.
 
 ```js
 assert.match(attack.toString(), /monsterHealthText\.innerText/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
index acf1efd38b0..a58883f30bc 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8edd05e27cc668051686f.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8edd05e27cc668051686f
-title: Step 124
+title: Крок 124
 challengeType: 0
 dashedName: step-124
 ---
@@ -11,7 +11,7 @@ Add an `if` statement to check if `health` is less than or equal to `0`. If it i
 
 # --hints--
 
-Your `attack` function should have an `if` statement.
+Ваша функція `attack` повинна мати інструкцію `if`.
 
 ```js
 assert.match(attack.toString(), /if/);
@@ -23,7 +23,7 @@ Your `if` statement should check if `health` is less than or equal to `0`.
 assert.match(attack.toString(), /if\s*\(health\s*<=\s*0\)/);
 ```
 
-Your `if` statement should call the `lose` function.
+Ваша інструкція `if` повинна викликати функцію `lose`.
 
 ```js
 assert.match(attack.toString(), /lose\(\)/);
@@ -275,7 +275,7 @@ function attack() {
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
   healthText.innerText = health;
   monsterHealthText.innerText = monsterHealth;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee154c8946678775c4a4.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee154c8946678775c4a4.md
index ac058ac03bc..cee06a8fc8e 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee154c8946678775c4a4.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee154c8946678775c4a4.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8ee154c8946678775c4a4
-title: Step 125
+title: Крок 125
 challengeType: 0
 dashedName: step-125
 ---
@@ -9,7 +9,7 @@ dashedName: step-125
 
 You can make an `else` statement conditional by using `else if`. At the end of your `if` statement, add an `else if` statement to check if `monsterHealth` is less than or equal to `0`. In your `else if`, call the `defeatMonster` function.
 
-Here's an example:
+Ось приклад:
 
 ```js
 if (num > 10) {
@@ -21,7 +21,7 @@ if (num > 10) {
 
 # --hints--
 
-You should have an `else if` statement.
+Ви повинні мати інструкцію `else if`.
 
 ```js
 assert.match(attack.toString(), /else if/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee71f018e968a056d369.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee71f018e968a056d369.md
index 94244500db9..8c6a163b9b0 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee71f018e968a056d369.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ee71f018e968a056d369.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8ee71f018e968a056d369
-title: Step 126
+title: Крок 126
 challengeType: 0
 dashedName: step-126
 ---
@@ -11,25 +11,25 @@ At the end of your code, create the `defeatMonster` and `lose` functions. Leave
 
 # --hints--
 
-You should use the `function` keyword to declare `defeatMonster`.
+Ви повинні використати ключове слово `function`, щоб оголосити `defeatMonster`.
 
 ```js
 assert.match(code, /function\s+defeatMonster/);
 ```
 
-`defeatMonster` should be an empty function.
+`defeatMonster` має бути порожньою функцією.
 
 ```js
 assert.match(defeatMonster.toString(), /defeatMonster\s*\(\)\s*\{\s*\}/);
 ```
 
-You should use the `function` keyword to declare `lose`.
+Ви повинні використати ключове слово `function`, щоб оголосити `lose`.
 
 ```js
 assert.match(code, /function\s+lose/);
 ```
 
-`lose` should be an empty function.
+`lose` має бути порожньою функцією.
 
 ```js
 assert.match(lose.toString(), /lose\s*\(\)\s*\{\s*\}/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
index 3524f53b4a3..cc87fbe01c5 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eec45f77bc69e8775294.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8eec45f77bc69e8775294
-title: Step 127
+title: Крок 127
 challengeType: 0
 dashedName: step-127
 ---
@@ -11,7 +11,7 @@ Inside the `dodge` function, set `text.innerText` equal to the string `You dodge
 
 # --hints--
 
-You should assign the string `You dodge the attack from the ` to the `text.innerText` property. Remember that spacing matters.
+You should assign the string `You dodge the attack from the` to the `text.innerText` property. Remember that spacing matters.
 
 ```js
 assert.match(dodge.toString(), /text\.innerText\s*=\s*('|")You dodge the attack from the \1/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eefe2e68b66ac563816b.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eefe2e68b66ac563816b.md
index f67c008aa05..b6a6b915384 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eefe2e68b66ac563816b.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eefe2e68b66ac563816b.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8eefe2e68b66ac563816b
-title: Step 128
+title: Крок 128
 challengeType: 0
 dashedName: step-128
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef6a52292f6bdca4f6f8.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef6a52292f6bdca4f6f8.md
index 678fd1314fc..3e373fa85de 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef6a52292f6bdca4f6f8.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef6a52292f6bdca4f6f8.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8ef6a52292f6bdca4f6f8
-title: Step 129
+title: Крок 129
 challengeType: 0
 dashedName: step-129
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
index cb9eadcb3ec..3d19907355b 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8ef8f0c76a46cd221a68c.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8ef8f0c76a46cd221a68c
-title: Step 130
+title: Крок 130
 challengeType: 0
 dashedName: step-130
 ---
@@ -11,13 +11,13 @@ Now update `goldText` and `xpText` to display the updated values.
 
 # --hints--
 
-You should update `goldText.innerText` to the value of `gold`.
+Ви повинні оновити `goldText.innerText` на значення `gold`.
 
 ```js
 assert.match(defeatMonster.toString(), /goldText\.innerText\s*=\s*gold/);
 ```
 
-You should update `xpText.innerText` to the value of `xp`.
+Ви повинні оновити `xpText.innerText` на значення `xp`.
 
 ```js
 assert.match(defeatMonster.toString(), /xpText\.innerText\s*=\s*xp/);
@@ -283,7 +283,7 @@ function dodge() {
 function defeatMonster() {
   gold += Math.floor(monsters[fighting].level * 6.7);
   xp += monsters[fighting].level;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
index ca92f837431..29e0911ca1b 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8efb0e3ce826db8daf80f.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8efb0e3ce826db8daf80f
-title: Step 131
+title: Крок 131
 challengeType: 0
 dashedName: step-131
 ---
@@ -11,7 +11,7 @@ Finish the `defeatMonster` function by calling the `update` function with `locat
 
 # --hints--
 
-You should call the `update` function.
+Ви повинні викликати функцію `update`.
 
 ```js
 assert.match(defeatMonster.toString(), /update/);
@@ -285,7 +285,7 @@ function defeatMonster() {
   xp += monsters[fighting].level;
   goldText.innerText = gold;
   xpText.innerText = xp;
-  
+
 }
 --fcc-editable-region--
 
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
index dd0068655fd..df2cfe72c81 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8eff21c0b0f6ebe5b8e38.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8eff21c0b0f6ebe5b8e38
-title: Step 132
+title: Крок 132
 challengeType: 0
 dashedName: step-132
 ---
@@ -10,14 +10,14 @@ dashedName: step-132
 Your `locations` array doesn't have a fifth element, so `locations[4]` doesn't work. Add a new object at the end of the `locations` array, following the same structure as the other objects. Set `name` to `kill monster`, set `button text` to an array with three `Go to town square` strings, set `button functions` to an array with three `goTown` variables, and set `text` to `The monster screams Arg! as it dies. You gain experience points and find gold.`.
 
 # --hints--
- 
-Your `locations` array should have five values.
+
+Ваш масив `locations` повинен мати п'ять значень.
 
 ```js
 assert.lengthOf(locations, 5);
 ```
 
-Your fifth `locations` value should be an object.
+Ваше п’яте значення `locations` повинне бути об’єктом.
 
 ```js
 assert.isObject(locations[4]);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f06fb318666fef69f91e.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f06fb318666fef69f91e.md
index ad30c67858d..b01dc351c97 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f06fb318666fef69f91e.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f06fb318666fef69f91e.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8f06fb318666fef69f91e
-title: Step 133
+title: Крок 133
 challengeType: 0
 dashedName: step-133
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f14fe6d1fc72454648c7.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f14fe6d1fc72454648c7.md
index ee850581fa7..4f5783de3e9 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f14fe6d1fc72454648c7.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f14fe6d1fc72454648c7.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8f14fe6d1fc72454648c7
-title: Step 134
+title: Крок 134
 challengeType: 0
 dashedName: step-134
 ---
@@ -17,7 +17,7 @@ You should use `monsterStats.style.display` in the `update` function.
 assert.match(update.toString(), /monsterStats\.style\.display/);
 ```
 
-You should set `monsterStats.style.display` to `none`.
+Ви повинні встановити `monsterStats.style.display` на `none`.
 
 ```js
 assert.match(update.toString(), /monsterStats\.style\.display\s*=\s*('|")none\1/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f1d5f5ddbf74c07f733b.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f1d5f5ddbf74c07f733b.md
index de99851e153..f4953795ca9 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f1d5f5ddbf74c07f733b.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f1d5f5ddbf74c07f733b.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8f1d5f5ddbf74c07f733b
-title: Step 135
+title: Крок 135
 challengeType: 0
 dashedName: step-135
 ---
@@ -11,7 +11,7 @@ In the `lose` function, call the `update` function and pass in the sixth object
 
 # --hints--
 
-Test 1
+Тест 1
 
 ```js
 
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f20463b324759953edad.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f20463b324759953edad.md
index 097ae332be3..f7a2d5b27b3 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f20463b324759953edad.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f20463b324759953edad.md
@@ -1,13 +1,13 @@
 ---
 id: 62a8f20463b324759953edad
-title: Step 136
+title: Крок 136
 challengeType: 0
 dashedName: step-136
 ---
 
 # --description--
 
-At the end of your code, create a `restart` function. Inside this function, set `xp` to `0`, `health` to `100`, `gold` to `50`, `currentWeapon` to `0`, and set `inventory` to an array with the string `stick`.
+В кінці коду створіть функцію `restart`. У цій функції встановіть `xp` на `0`, `health` на `100`, `gold` на `50`, `currentWeapon` на `0` та встановіть `inventory` на масив з рядком `stick`.
 
 Also update the `innerText` properties of `goldText`, `healthText`, and `xpText` to their current values.
 
@@ -15,31 +15,31 @@ Finally, call the `goTown()` function.
 
 # --hints--
 
-You should use the `function` keyword to declare `restart`.
+Ви повинні використати ключове слово `function`, щоб оголосити `restart`.
 
 ```js
 assert.match(code, /function\s+restart/);
 ```
 
-Your `restart` function should set `xp` to `0`.
+Ваша функція `restart` повинна встановити `xp` на `0`.
 
 ```js
 assert.match(restart.toString(), /xp\s*=\s*0/);
 ```
 
-Your `restart` function should set `health` to `100`.
+Ваша функція `restart` повинна встановити `health` на `100`.
 
 ```js
 assert.match(restart.toString(), /health\s*=\s*100/);
 ```
 
-Your `restart` function should set `gold` to `50`.
+Ваша функція `restart` повинна встановити `gold` на `50`.
 
 ```js
 assert.match(restart.toString(), /gold\s*=\s*50/);
 ```
 
-Your `restart` function should set `currentWeapon` to `0`.
+Ваша функція `restart` повинна встановити `currentWeapon` на `0`.
 
 ```js
 assert.match(restart.toString(), /currentWeapon\s*=\s*0/);
@@ -51,25 +51,25 @@ Your `restart` function should set `inventory` to an array with the string `stic
 assert.match(restart.toString(), /inventory\s*=\s*\[\s*('|")stick\1\s*\]/);
 ```
 
-Your `restart` function should call the `goTown()` function.
+Ваша функція `restart` повинна викликати функцію `goTown()`.
 
 ```js
 assert.match(restart.toString(), /goTown\(\)/);
 ```
 
-You should set `goldText.innerText` to the value of `gold`.
+Ви повинні встановити `goldText.innerText` на значення `gold`.
 
 ```js
 assert.match(restart.toString(), /goldText\.innerText\s*=\s*gold/);
 ```
 
-You should set `healthText.innerText` to the value of `health`.
+Ви повинні встановити `healthText.innerText` на значення `health`.
 
 ```js
 assert.match(restart.toString(), /healthText\.innerText\s*=\s*health/);
 ```
 
-You should set `xpText.innerText` to the value of `xp`.
+Ви повинні встановити `xpText.innerText` на значення `xp`.
 
 ```js
 assert.match(restart.toString(), /xpText\.innerText\s*=\s*xp/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f256b813a476cae51f49.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f256b813a476cae51f49.md
index 84ad6a8fbc2..c85d990fb03 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f256b813a476cae51f49.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f256b813a476cae51f49.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8f256b813a476cae51f49
-title: Step 138
+title: Крок 138
 challengeType: 0
 dashedName: step-138
 ---
@@ -21,7 +21,7 @@ if (num === 5) {
 
 # --hints--
 
-You should add a new `if` statement in your `else if` block.
+Ви повинні додати нову інструкцію `if` у свій блок `else if`.
 
 ```js
 const block = attack.toString().split("else if");
@@ -42,14 +42,14 @@ const block = attack.toString().split("else if");
 assert.match(block[1], /if\s*\(\s*fighting\s*===\s*2\s*\)\s*\{\s*winGame\(\)/);
 ```
 
-You should add an `else` block.
+Ви повинні додати блок `else`.
 
 ```js
 const block = attack.toString().split("else if");
 assert.include(block[1], "else");
 ```
 
-Your `else` block should call the `defeatMonster` function.
+Ваш блок `else` повинен викликати функцію `defeatMonster`.
 
 ```js
 const block = attack.toString().split("else if");
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f2bc37675e77d5835235.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f2bc37675e77d5835235.md
index cd564871491..c699393e9ee 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f2bc37675e77d5835235.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f2bc37675e77d5835235.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8f2bc37675e77d5835235
-title: Step 139
+title: Крок 139
 challengeType: 0
 dashedName: step-139
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f35bde1750791f58773f.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f35bde1750791f58773f.md
index 6cf34e927c5..82ae48037f4 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f35bde1750791f58773f.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a8f35bde1750791f58773f.md
@@ -1,6 +1,6 @@
 ---
 id: 62a8f35bde1750791f58773f
-title: Step 140
+title: Крок 140
 challengeType: 0
 dashedName: step-140
 ---
@@ -11,7 +11,7 @@ After the `lose` function, create a function called `winGame`. Inside the `winGa
 
 # --hints--
 
-You should use the `function` keyword to declare `winGame`.
+Ви повинні використати ключове слово `function`, щоб оголосити `winGame`.
 
 ```js
 assert.match(code, /function\s+winGame/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a94114ce0b8918b487390f.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a94114ce0b8918b487390f.md
index 4b4f1f70732..b8cf69efa53 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a94114ce0b8918b487390f.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62a94114ce0b8918b487390f.md
@@ -7,7 +7,7 @@ dashedName: step-141
 
 # --description--
 
-Додайте ще один об’єкт до масиву `locations`. Усе має бути таким самим, як і об’єкт `lose`, за винятком того, що `name` повинен бути `win`, а `text` повинен бути `You defeat the dragon! YOU WIN THE GAME! 🎉`.
+Додайте ще один об’єкт до масиву `locations`. Everything should be the same as the `lose` object, except the `name` should be `win` and the `text` should be `You defeat the dragon! YOU WIN THE GAME! 🎉`.
 
 # --hints--
 
@@ -41,7 +41,7 @@ assert.deepEqual(locations[6]["button text"], ['REPLAY?', 'REPLAY?', 'REPLAY?'])
 assert.deepEqual(locations[6]["button functions"], [restart, restart, restart]);
 ```
 
-Ваше сьоме значення `locations` повинне мати властивість `text` зі значенням `You defeat the dragon! YOU WIN THE GAME! 🎉`.
+Your seventh `locations` value should have a `text` property with the value `You defeat the dragon! YOU WIN THE GAME! 🎉`.
 
 ```js
 assert.equal(locations[6].text, 'You defeat the dragon! YOU WIN THE GAME! 🎉');
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d6736ba262cfa74344b.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d6736ba262cfa74344b.md
index 1dd06a164f4..8c9be867da9 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d6736ba262cfa74344b.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d6736ba262cfa74344b.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa1d6736ba262cfa74344b
-title: Step 143
+title: Крок 143
 challengeType: 0
 dashedName: step-143
 ---
@@ -11,7 +11,7 @@ Below your `attack` function, create an empty function named `getMonsterAttackVa
 
 # --hints--
 
-You should use the `function` keyword to declare `getMonsterAttackValue`.
+Ви повинні використати ключове слово `function`, щоб оголосити `getMonsterAttackValue`.
 
 ```js
 assert.match(code, /function\s+getMonsterAttackValue/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d9f535e102e4663e7a6.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d9f535e102e4663e7a6.md
index 62f2bd62862..3a4450e9fc2 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d9f535e102e4663e7a6.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1d9f535e102e4663e7a6.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa1d9f535e102e4663e7a6
-title: Step 144
+title: Крок 144
 challengeType: 0
 dashedName: step-144
 ---
@@ -13,7 +13,7 @@ This will set the monster's attack to five times their `level` minus a random nu
 
 # --hints--
 
-You should use `const` to declare the variable `hit`.
+Ви повинні використати `const`, щоб оголосити змінну `hit`.
 
 ```js
 assert.match(code, /const\s*hit/);
@@ -25,7 +25,7 @@ You should use the equation `(level * 5) - (Math.floor(Math.random() * xp))`.
 assert.match(getMonsterAttackValue, /(level\s*\*\s*5)\s*-\s*(Math.floor\(Math.random\(\)\s*\*\s*xp\))/);
 ```
 
-You should set `hit` to the value of `(level * 5) - (Math.floor(Math.random() * xp))`.
+Ви повинні встановити значення `hit` на `(level * 5) - (Math.floor(Math.random() * xp))`.
 
 ```js
 assert.match(code, /hit\s*=\s*\(level\s*\*\s*5\)\s*-\s*\(Math.floor\(Math.random\(\)\s*\*\s*xp\)\)/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e3c7c3d552fb04f0f18.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e3c7c3d552fb04f0f18.md
index 0e1f69267c5..68aaa3db137 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e3c7c3d552fb04f0f18.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e3c7c3d552fb04f0f18.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa1e3c7c3d552fb04f0f18
-title: Step 145
+title: Крок 145
 challengeType: 0
 dashedName: step-145
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e8ccd579330e097ce44.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e8ccd579330e097ce44.md
index bcc2b14ee5a..838c96a1af9 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e8ccd579330e097ce44.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1e8ccd579330e097ce44.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa1e8ccd579330e097ce44
-title: Step 146
+title: Крок 146
 challengeType: 0
 dashedName: step-146
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1eec891ed731db227a36.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1eec891ed731db227a36.md
index 725aa7e720a..9562022f7b7 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1eec891ed731db227a36.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1eec891ed731db227a36.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa1eec891ed731db227a36
-title: Step 147
+title: Крок 147
 challengeType: 0
 dashedName: step-147
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1fed3d4e873366ff3131.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1fed3d4e873366ff3131.md
index 97ce39a4821..ad7a2acf6b4 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1fed3d4e873366ff3131.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa1fed3d4e873366ff3131.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa1fed3d4e873366ff3131
-title: Step 148
+title: Крок 148
 challengeType: 0
 dashedName: step-148
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
index 3e9df421573..5b1fe186370 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa204c1e1d33348ff09944.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa204c1e1d33348ff09944
-title: Step 149
+title: Крок 149
 challengeType: 0
 dashedName: step-149
 ---
@@ -280,7 +280,7 @@ function attack() {
   text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
   health -= getMonsterAttackValue(monsters[fighting].level);
   if (isMonsterHit()) {
-    
+
   }
   monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
   healthText.innerText = health;
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
index 88836e37794..ae8a6d45ab0 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa20e9cf1be9358f5aceae.md
@@ -1,13 +1,13 @@
 ---
 id: 62aa20e9cf1be9358f5aceae
-title: Step 150
+title: Крок 150
 challengeType: 0
 dashedName: step-150
 ---
 
 # --description--
 
-Add an `else` statement to your `if` statement. In the `else` statement, use the `+=` operator to add the text ` You miss.` to the end of `text.innerText`.
+Додайте інструкцію `else` до своєї інструкції `if`. In the `else` statement, use the `+=` operator to add the text `You miss.` to the end of `text.innerText`.
 
 # --hints--
 
@@ -17,7 +17,7 @@ You should add an `else` block after your `if (isMonsterHit())` block.
 assert.match(attack.toString(), /if\s*\(isMonsterHit\(\)\s*\)\s*\{\s*monsterHealth\s*-=\s*weapons\[currentWeapon\]\.power\s*\+\s*Math\.floor\(Math\.random\(\)\s*\*\s*xp\)\s*\+\s*1;\s*\}\s*else/)
 ```
 
-You should add the text ` You miss.` to the end of `text.innerText`. Remember to use compound assignment.
+You should add the text `You miss.` to the end of `text.innerText`. Remember to use compound assignment.
 
 ```js
 assert.match(attack.toString(), /if\s*\(isMonsterHit\(\)\s*\)\s*\{\s*monsterHealth\s*-=\s*weapons\[currentWeapon\]\.power\s*\+\s*Math\.floor\(Math\.random\(\)\s*\*\s*xp\)\s*\+\s*1;\s*\}\s*else\s*\{\s*text\.innerText\s*\+=\s*('|")\sYou miss\.\1/)
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2136fc49b836dfedb959.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2136fc49b836dfedb959.md
index 7a5d427b22f..67149d2cfd1 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2136fc49b836dfedb959.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2136fc49b836dfedb959.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa2136fc49b836dfedb959
-title: Step 151
+title: Крок 151
 challengeType: 0
 dashedName: step-151
 ---
@@ -11,7 +11,7 @@ Now create the `isMonsterHit` function. This will return a <dfn>boolean</dfn> va
 
 # --hints--
 
-You should use the `function` keyword to declare `isMonsterHit`.
+Ви повинні використати ключове слово `function`, щоб оголосити `isMonsterHit`.
 
 ```js
 assert.match(code, /function\s+isMonsterHit/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa21971e3b743844849985.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa21971e3b743844849985.md
index 2db80762083..38e9892121f 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa21971e3b743844849985.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa21971e3b743844849985.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa21971e3b743844849985
-title: Step 152
+title: Крок 152
 challengeType: 0
 dashedName: step-152
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa21ea8d9d9f396b95dd87.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa21ea8d9d9f396b95dd87.md
index 34820846dd6..b10abc407a2 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa21ea8d9d9f396b95dd87.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa21ea8d9d9f396b95dd87.md
@@ -1,24 +1,24 @@
 ---
 id: 62aa21ea8d9d9f396b95dd87
-title: Step 153
+title: Крок 153
 challengeType: 0
 dashedName: step-153
 ---
 
 # --description--
 
-On every attack, there should be a chance that the player's weapon breaks. At the end of the `attack` function, add an empty `if` expression with the condition `Math.random() <= .1`.
+При кожній атаці повинен бути шанс, що зброя гравця зламається. В кінці функції `attack` додайте порожній вираз `if` з умовою `Math.random() <= .1`.
 
 # --hints--
 
-You should add an `if` statement to your `attack` function.
+Ви повинні додати інструкцію `if` до своєї функції `attack`.
 
 ```js
 const ifs = attack.toString().match(/if/g);
 assert.lengthOf(ifs, 4);
 ```
 
-Your new `if` statement should check `Math.random() <= .1`.
+Ваша нова інструкція `if` повинна перевіряти `Math.random() <= .1`.
 
 ```js
 assert.match(attack.toString(), /if\s*\(\s*Math\.random\(\)\s*<=\s*0?\.1\s*\)/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
index 4210b69f7a8..4c2e2ed6cc2 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa226207f33d3ad4c6f546.md
@@ -1,43 +1,43 @@
 ---
 id: 62aa226207f33d3ad4c6f546
-title: Step 154
+title: Крок 154
 challengeType: 0
 dashedName: step-154
 ---
 
 # --description--
 
-Use the `+=` operator to add ` Your [weapon] breaks.` to the end of `text.innerText`, replacing `weapon` with the last item in the `inventory` array. You can get this last item by using `inventory.pop()`, which will remove the last item in the array AND return it so it appears in your string.
+Використайте оператор `+=`, щоб додати `Your [weapon] breaks.` в кінці `text.innerText`, замінивши `weapon` останнім елементом у масиві `inventory`. Ви можете отримати цей останній елемент, використавши `inventory.pop()`, що видалить останній елемент у масиві ТА поверне його, щоб він з’явився у рядку.
 
 # --hints--
 
-You should use the compound assignment operator to modify `text.innerText`.
+Ви повинні використати складений оператор присвоювання, щоб змінити `text.innerText`.
 
 ```js
 const concat = attack.toString().match(/\+=/g);
 assert.lengthOf(concat, 3);
 ```
 
-You should use the `pop` method on the `inventory` array.
+Ви повинні використати метод `pop` для масиву `inventory`.
 
 ```js
 assert.match(attack.toString(), /inventory\.pop\(\)/);
 ```
 
-You should add the string " Your " to `text.innerText`. Remember that spacing matters.
+Додайте рядок " Your " до `text.innerText`. Пам'ятайте, що інтервал має значення.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1/);
 ```
 
-You should add the return value of `inventory.pop()` to the ` Your ` string.
+You should add the return value of `inventory.pop()` to the `Your` string.
 
 ```js
 console.log(attack.toString());
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1\s*\+\s*inventory\.pop\(\)/);
 ```
 
-You should add ` breaks.` to the ` "Your " + inventory.pop()` string.
+Ви повинні додати `breaks.` до рядка `"Your " + inventory.pop()`.
 
 ```js
 assert.match(attack.toString(), /text\.innerText\s*\+=\s*('|")\sYour\s\1\s*\+\s*inventory\.pop\(\)\s*\+\s*('|")\sbreaks\.\2/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa22aba186563bcbf2c395.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa22aba186563bcbf2c395.md
index 44980b592f0..c7671a81a8d 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa22aba186563bcbf2c395.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa22aba186563bcbf2c395.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa22aba186563bcbf2c395
-title: Step 155
+title: Крок 155
 challengeType: 0
 dashedName: step-155
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa234322d4ad3e8bce42cc.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa234322d4ad3e8bce42cc.md
index 65fc9cd5576..52b341974df 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa234322d4ad3e8bce42cc.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa234322d4ad3e8bce42cc.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa234322d4ad3e8bce42cc
-title: Step 156
+title: Крок 156
 challengeType: 0
 dashedName: step-156
 ---
@@ -21,7 +21,7 @@ if (firstName === "Quincy" && lastName === "Larson") {
 
 # --hints--
 
-You should not modify your existing `if` statement.
+Ви не повинні змінювати свою наявну інструкцію `if`.
 
 ```js
 assert.match(attack.toString(), /if\s*\(Math\.random\(\)\s*\<=\s*\.1/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2469c77b363fdb4f0e06.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2469c77b363fdb4f0e06.md
index 10cb8603022..ec494666b43 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2469c77b363fdb4f0e06.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2469c77b363fdb4f0e06.md
@@ -1,31 +1,31 @@
 ---
 id: 62aa2469c77b363fdb4f0e06
-title: Step 157
+title: Крок 157
 challengeType: 0
 dashedName: step-157
 ---
 
 # --description--
 
-Now you can add a small easter egg (hidden feature) to your game.
+Тепер ви можете додати маленьке пасхальне яйце (приховану функцію) до своєї гри.
 
-Create a new function called `easterEgg` which calls the `update` function with `locations[7]` as the argument.
+Створіть нову функцію під назвою `easterEgg`, яка викликає функцію `update` з аргументом `locations[7]`.
 
 # --hints--
 
-You should use the `function` keyword to declare `easterEgg`.
+Ви повинні використати ключове слово `function`, щоб оголосити `easterEgg`.
 
 ```js
 assert.match(code, /function\s+easterEgg\s*/);
 ```
 
-`easterEgg` should call the `update` function.
+`easterEgg` повинна викликати функцію `update`.
 
 ```js
 assert.match(easterEgg.toString(), /update\(/);
 ```
 
-`easterEgg` should call the `update` function with `locations[7]` as the argument.
+`easterEgg` повинна викликати функцію `update` з аргументом `locations[7]`.
 
 ```js
 assert.match(easterEgg.toString(), /update\(\s*locations\[7\]\s*\)/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa252c3b1073415ba2b898.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa252c3b1073415ba2b898.md
index a502101c334..b0c795d95e9 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa252c3b1073415ba2b898.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa252c3b1073415ba2b898.md
@@ -1,23 +1,23 @@
 ---
 id: 62aa252c3b1073415ba2b898
-title: Step 158
+title: Крок 158
 challengeType: 0
 dashedName: step-158
 ---
 
 # --description--
 
-Create an empty `pick` function with a parameter named `guess`.
+Створіть порожню функцію `pick` з параметром під назвою `guess`.
 
 # --hints--
 
-You should use the `function` keyword to declare `pick`.
+Ви повинні використати ключове слово `function`, щоб оголосити `pick`.
 
 ```js
 assert.match(code, /function\s+pick\s*/);
 ```
 
-`pick` should take a parameter named `guess`.
+`pick` повинна приймати параметр під назвою `guess`.
 
 ```js
 assert.match(pick.toString(), /pick\s*\(\s*guess\s*\)/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa25fcb5837d43b4d9873d.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa25fcb5837d43b4d9873d.md
index 01f3692b24e..0692cbc38d4 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa25fcb5837d43b4d9873d.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa25fcb5837d43b4d9873d.md
@@ -1,47 +1,47 @@
 ---
 id: 62aa25fcb5837d43b4d9873d
-title: Step 160
+title: Крок 160
 challengeType: 0
 dashedName: step-160
 ---
 
 # --description--
 
-Add another object to your `locations` array. Set `name` to `easter egg`, set `button text` to an array with the strings `2`, `8`, and `Go to town square?`, set `button functions` to an array with the variables `pickTwo`, `pickEight`, and `goTown`, and `text` to `You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!`.
+Додайте ще один об’єкт до свого масиву `locations`. Встановіть `name` на `easter egg`, встановіть `button text` на масив з рядками `2`, `8` та `Go to town square?`, встановіть `button functions` на масив зі змінними `pickTwo`, `pickEight` та `goTown` і встановіть `text` на `You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!`.
 
 # --hints--
 
-Your `locations` array should have 8 values.
+Ваш масив `locations` повинен мати 8 значень.
 
 ```js
 assert.lengthOf(locations, 8);
 ```
 
-Your eighth `locations` value should be an object.
+Ваше восьме значення `locations` повинне бути об’єктом.
 
 ```js
 assert.isObject(locations[7]);
 ```
 
-Your eighth `locations` value should have a `name` property with the value `easter egg`.
+Ваше восьме значення `locations` повинне мати властивість `name` зі значенням `easter egg`.
 
 ```js
 assert.equal(locations[7].name, "easter egg");
 ```
 
-Your eighth `locations` value should have a `button text` property with the value an array with the strings `2`, `8`, and `Go to town square?`.
+Ваше восьме значення `locations` повинне мати властивість `button text` зі значенням як масив з рядками `2`, `8` та `Go to town square?`.
 
 ```js
 assert.deepEqual(locations[7]["button text"], ["2", "8", "Go to town square?"]);
 ```
 
-Your eighth `locations` value should have a `button functions` property with the value an array with the variables `pickTwo`, `pickEight`, and `goTown`.
+Ваше восьме значення `locations` повинне мати властивість `button functions` зі значенням як масив зі змінними `pickTwo`, `pickEight` та `goTown`.
 
 ```js
 assert.deepEqual(locations[7]["button functions"], [pickTwo, pickEight, goTown]);
 ```
 
-Your eighth `locations` value should have a `text` property with the value `You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!`.
+Ваше восьме значення `locations` повинне мати властивість `text` зі значенням `You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!`.
 
 ```js
 assert.equal(locations[7].text, "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!");
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2626c3c10244b94c787b.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2626c3c10244b94c787b.md
index c335f2d7bc9..86b8a8d44ca 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2626c3c10244b94c787b.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2626c3c10244b94c787b.md
@@ -1,17 +1,17 @@
 ---
 id: 62aa2626c3c10244b94c787b
-title: Step 161
+title: Крок 161
 challengeType: 0
 dashedName: step-161
 ---
 
 # --description--
 
-Inside `pick`, use `let` to initialize a variable named `numbers` and set it to an empty array.
+Всередині `pick` використайте `let`, щоб ініціалізувати змінну під назвою `numbers` та встановіть її на порожній масив.
 
 # --hints--
 
-Your `pick` function should initalize `numbers` to an empty array `[]`.
+Ваша функція `pick` повинна ініціалізувати `numbers` на порожній масив `[]`.
 
 ```js
 assert.match(pick.toString(), /numbers\s*=\s*\[\]/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
index b043a04a1a5..c5573ab6b9f 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa264d23cdaa45a20efada.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa264d23cdaa45a20efada
-title: Step 162
+title: Крок 162
 challengeType: 0
 dashedName: step-162
 ---
@@ -375,7 +375,7 @@ function pickEight() {
 --fcc-editable-region--
 function pick(guess) {
   let numbers = [];
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa26cca3cd3d46c431e73b.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa26cca3cd3d46c431e73b.md
index beace6c6228..c2677db5a09 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa26cca3cd3d46c431e73b.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa26cca3cd3d46c431e73b.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa26cca3cd3d46c431e73b
-title: Step 163
+title: Крок 163
 challengeType: 0
 dashedName: step-163
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
index ac85513b88f..9f0749456c9 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27227399d647e1c37a3c.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa27227399d647e1c37a3c
-title: Step 164
+title: Крок 164
 challengeType: 0
 dashedName: step-164
 ---
@@ -11,13 +11,13 @@ After the `while` loop, set `text.innerText` to equal `You picked [guess]. Here
 
 # --hints--
 
-You should set `text.innerText` to the string `You picked `. Remember that spacing matters.
+Ви повинні встановити `text.innerText` на рядок `You picked`. Remember that spacing matters.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1/);
 ```
 
-You should use the concatenation operator to add the value of the `guess` parameter to your `You picked ` string.
+You should use the concatenation operator to add the value of the `guess` parameter to your `You picked` string.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1\s*\+\s*guess/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
index 3b20e162326..fc2a07526f9 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27560def7048d7b4a095.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa27560def7048d7b4a095
-title: Step 165
+title: Крок 165
 challengeType: 0
 dashedName: step-165
 ---
@@ -11,7 +11,7 @@ Before the final quote in that string you added, insert the new line escape char
 
 # --hints--
 
-You should add the new line escape character `\n` to your `. Here are the random numbers: ` string.
+You should add the new line escape character `\n` to your `. Here are the random numbers:` string.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*=\s*('|")You picked \1\s*\+\s*guess\s*\+\s*('|")\.\sHere are the random numbers:\\n\2/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
index 180270940d6..12b94853b63 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa27c40ca6f04ab8be5fac.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa27c40ca6f04ab8be5fac
-title: Step 166
+title: Крок 166
 challengeType: 0
 dashedName: step-166
 ---
@@ -369,7 +369,7 @@ function pick(guess) {
     numbers.push(Math.floor(Math.random() * 11));
   }
   text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
-  
+
 }
 --fcc-editable-region--
 ```
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28032d863d4bd8058799.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28032d863d4bd8058799.md
index 4b4af2f8669..b08302d898b 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28032d863d4bd8058799.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28032d863d4bd8058799.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa28032d863d4bd8058799
-title: Step 167
+title: Крок 167
 challengeType: 0
 dashedName: step-167
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa287434dc284cea01157c.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa287434dc284cea01157c.md
index 7067e31d3f3..04e5018ea5b 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa287434dc284cea01157c.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa287434dc284cea01157c.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa287434dc284cea01157c
-title: Step 168
+title: Крок 168
 challengeType: 0
 dashedName: step-168
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28bbd6323e4dfb3ac43e.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28bbd6323e4dfb3ac43e.md
index 72bbc1f15f8..1cf2c6f7538 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28bbd6323e4dfb3ac43e.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28bbd6323e4dfb3ac43e.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa28bbd6323e4dfb3ac43e
-title: Step 169
+title: Крок 169
 challengeType: 0
 dashedName: step-169
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28fb651bf14efa2dbb16.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28fb651bf14efa2dbb16.md
index 94da3ef415e..0a9e310450e 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28fb651bf14efa2dbb16.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa28fb651bf14efa2dbb16.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa28fb651bf14efa2dbb16
-title: Step 170
+title: Крок 170
 challengeType: 0
 dashedName: step-170
 ---
@@ -23,7 +23,7 @@ You should use bracket notation to access `numbers[i]`.
 assert.match(pick.toString(), /numbers\[i\]/);
 ```
 
-You should add `numbers[i]` to your `text.innerText` value.
+Ви повинні додати `numbers[i]` до свого значення `text.innerText`.
 
 ```js
 assert.match(pick.toString(), /text\.innerText\s*\+=\s*numbers\[i\]/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2943669c9d5026af6985.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2943669c9d5026af6985.md
index b1540f1ac41..067139b5436 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2943669c9d5026af6985.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2943669c9d5026af6985.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa2943669c9d5026af6985
-title: Step 171
+title: Крок 171
 challengeType: 0
 dashedName: step-171
 ---
@@ -20,7 +20,7 @@ numbers.indexOf(2) // 1
 
 # --hints--
 
-Your `pick` function should have an `if` statement.
+Ваша функція `pick` повинна мати інструкцію `if`.
 
 ```js
 assert.match(pick.toString(), /if/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2999ec27ec516655eba6.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2999ec27ec516655eba6.md
index aa044de71f3..e62bc015ddf 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2999ec27ec516655eba6.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2999ec27ec516655eba6.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa2999ec27ec516655eba6
-title: Step 172
+title: Крок 172
 challengeType: 0
 dashedName: step-172
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa29d8f8f88152c91350ca.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa29d8f8f88152c91350ca.md
index 13ed8152080..1e279600dc1 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa29d8f8f88152c91350ca.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa29d8f8f88152c91350ca.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa29d8f8f88152c91350ca
-title: Step 173
+title: Крок 173
 challengeType: 0
 dashedName: step-173
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2aec2f09d454253aad6c.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2aec2f09d454253aad6c.md
index 5f48991b690..7ce17063fe5 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2aec2f09d454253aad6c.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2aec2f09d454253aad6c.md
@@ -1,6 +1,6 @@
 ---
 id: 62aa2aec2f09d454253aad6c
-title: Step 174
+title: Крок 174
 challengeType: 0
 dashedName: step-174
 ---
@@ -11,7 +11,7 @@ Since you subtracted health from the player, you need to check `if` the player's
 
 # --hints--
 
-Your `pick` function should have a second `if` statement.
+Ваша функція `pick` повинна мати другу інструкцію `if`.
 
 ```js
 const match = pick.toString().match(/if/g);
@@ -24,7 +24,7 @@ Your `if` statement should check if the player's `health` is less than or equal
 assert.match(pick.toString(), /if\s*\(\s*health\s*<=\s*0\s*\)/);
 ```
 
-Your `if` statement should call the `lose` function.
+Ваша інструкція `if` повинна викликати функцію `lose`.
 
 ```js
 assert.match(pick.toString(), /lose\(\)/);
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2ba9cd881355a6f0a5a8.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2ba9cd881355a6f0a5a8.md
index f9bcbbb6387..10d1464d22e 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2ba9cd881355a6f0a5a8.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62aa2ba9cd881355a6f0a5a8.md
@@ -1,15 +1,15 @@
 ---
 id: 62aa2ba9cd881355a6f0a5a8
-title: Step 175
+title: Крок 175
 challengeType: 0
 dashedName: step-175
 ---
 
 # --description--
 
-Looking at your `kill monster` object, `button functions` currently has three `goTown` variables. Replace the third one with `easterEgg` - this is how a player will access the hidden feature of the game. Do not change the `button text`.
+Looking at your `kill monster` object, `button functions` currently has three `goTown` variables. Replace the third one with `easterEgg` - this is how a player will access the hidden feature of the game. Не змінюйте `button text`.
 
-With this, your RPG game is complete! You can now play around - can you defeat the dragon?
+На цьому ваша рольова гра готова! You can now play around - can you defeat the dragon?
 
 # --hints--
 
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62b46e3a8d4be31be5af793d.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62b46e3a8d4be31be5af793d.md
index d98f9e81298..4cb60f9ece4 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62b46e3a8d4be31be5af793d.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62b46e3a8d4be31be5af793d.md
@@ -1,6 +1,6 @@
 ---
 id: 62b46e3a8d4be31be5af793d
-title: Step 30
+title: Крок 30
 challengeType: 0
 dashedName: step-30
 ---
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc1ee0c5a89717d4785729.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc1ee0c5a89717d4785729.md
index 50b06ed7911..6f2eb431161 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc1ee0c5a89717d4785729.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc1ee0c5a89717d4785729.md
@@ -1,45 +1,45 @@
 ---
 id: 62fc1ee0c5a89717d4785729
-title: Step 12
+title: Крок 12
 challengeType: 0
 dashedName: step-12
 ---
 
 # --description--
 
-Give your `#monsterStats` element the same `border` and `padding` as your `#stats` element. Set its color to `white` and give it a `red` background.
+Надайте своєму елементу `#monsterStats` такі ж `border` та `padding`, що має елемент `#stats`. Встановіть його колір на `white` та надайте `red` фон.
 
 # --hints--
 
-You should have a `#monsterStats` selector.
+Ви повинні мати селектор `#monsterStats`.
 
 ```js
 const monsterStats = new __helpers.CSSHelp(document).getStyle('#monsterStats');
 assert.exists(monsterStats);
 ```
 
-Your `#monsterStats` selector should have a `border` of `1px solid black`.
+Ваш селектор `#monsterStats` повинен мати `border` зі значенням `1px solid black`.
 
 ```js
 const border = new __helpers.CSSHelp(document).getStyle('#monsterStats')?.getPropertyValue('border');
 assert.equal(border, '1px solid black');
 ```
 
-Your `#monsterStats` selector should have `5px` of padding.
+Ваш селектор `#monsterStats` повинен мати відступ зі значенням `5px`.
 
 ```js
 const padding = new __helpers.CSSHelp(document).getStyle('#monsterStats')?.getPropertyValue('padding');
 assert.equal(padding, '5px');
 ```
 
-Your `#monsterStats` selector should have a `color` of `white`.
+Ваш селектор `#monsterStats` повинен мати `color` зі значенням `white`.
 
 ```js
 const color = new __helpers.CSSHelp(document).getStyle('#monsterStats')?.getPropertyValue('color');
 assert.equal(color, 'white');
 ```
 
-Your `#monsterStats` selector should have a `background-color` of `red`.
+Ваш селектор `#monsterStats` повинен мати `background-color` зі значенням `red`.
 
 ```js
 const background = new __helpers.CSSHelp(document).getStyle('#monsterStats')?.getPropertyValue('background-color');
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc20387ef88d1d1998aac5.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc20387ef88d1d1998aac5.md
index 1b122cb50c8..3bc51b48a51 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc20387ef88d1d1998aac5.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc20387ef88d1d1998aac5.md
@@ -1,35 +1,35 @@
 ---
 id: 62fc20387ef88d1d1998aac5
-title: Step 32
+title: Крок 32
 challengeType: 0
 dashedName: step-32
 ---
 
 # --description--
 
-Use `querySelector()` to get the other two button elements, using their `#button2` and `#button3` `id`s. Store them in variables called `button2` and `button3`. Remember to use `const`.
+Використайте `querySelector()`, щоб отримати два інші елементи, використовуючи їхні `id` `#button2` та `#button3`. Розмістіть їх у змінних під назвою `button2` та `button3`. Не забудьте використати `const`.
 
 # --hints--
 
-You should declare a `button2` variable with `const`.
+Ви повинні оголосити змінну `button2` за допомогою `const`.
 
 ```js
 assert.match(code, /const button2/);
 ```
 
-Your `button2` variable should have the value of your `#button2` element.
+Ваша змінна `button2` повинна мати значення вашого елемента `#button2`.
 
 ```js
 assert.deepEqual(button2, document.querySelector('#button2'));
 ```
 
-You should declare a `button3` variable with `const`.
+Ви повинні оголосити змінну `button3` за допомогою `const`.
 
 ```js
 assert.match(code, /const button3/);
 ```
 
-Your `button3` variable should have the value of your `#button3` element.
+Ваша змінна `button3` повинна мати значення вашого елемента `#button3`.
 
 ```js
 assert.deepEqual(button3, document.querySelector('#button3'));
diff --git a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc211760bfc220f4734800.md b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc211760bfc220f4734800.md
index 5dd815b61c0..59b0d6d0e13 100644
--- a/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc211760bfc220f4734800.md
+++ b/curriculum/challenges/ukrainian/15-javascript-algorithms-and-data-structures-22/learn-basic-javascript-by-building-a-role-playing-game/62fc211760bfc220f4734800.md
@@ -1,23 +1,23 @@
 ---
 id: 62fc211760bfc220f4734800
-title: Step 34
+title: Крок 34
 challengeType: 0
 dashedName: step-34
 ---
 
 # --description--
 
-Finally, use `querySelector()` to get the `#monsterHealth` element. Because you have already declared a `monsterHealth` variable earlier, you need to use a different variable name for this element. Declare a new variable with the `const` keyword and name it `monsterHealthText`.
+Зрештою використайте `querySelector()`, щоб отримати елемент `#monsterHealth`. Оскільки ви вже оголосили змінну `monsterHealth`, вам потрібно використати іншу назву змінної для цього елемента. Оголосіть нову змінну за допомогою ключового слова `const` та назвіть її `monsterHealthText`.
 
 # --hints--
 
-You should declare a `monsterHealthText` variable with `const`.
+Ви повинні оголосити змінну `monsterHealthText` за допомогою `const`.
 
 ```js
 assert.match(code, /const monsterHealthText/);
 ```
 
-Your `monsterHealthText` variable should have the value of your `#monsterHealth` element.
+Ваша змінна `monsterHealthText` повинна мати значення вашого елемента `#monsterHealth`.
 
 ```js
 assert.deepEqual(monsterHealthText, document.querySelector('#monsterHealth'));
diff --git a/curriculum/dictionaries/chinese-traditional/comments.json b/curriculum/dictionaries/chinese-traditional/comments.json
index f7ece39ec0d..a8e76701962 100644
--- a/curriculum/dictionaries/chinese-traditional/comments.json
+++ b/curriculum/dictionaries/chinese-traditional/comments.json
@@ -106,5 +106,6 @@
   "es69h6": "當你將兩個窗口合併爲一個窗口時",
   "fho5t5": "當你在最後打開一個選項卡時",
   "00kcrm": "輸出 true",
-  "sxpg2a": "你的郵箱、Google Drive 和其他工作地點"
+  "sxpg2a": "你的郵箱、Google Drive 和其他工作地點",
+  "4143lf": "初始化按鈕"
 }
diff --git a/curriculum/dictionaries/chinese/comments.json b/curriculum/dictionaries/chinese/comments.json
index 1762add2e3b..9aaedcc6067 100644
--- a/curriculum/dictionaries/chinese/comments.json
+++ b/curriculum/dictionaries/chinese/comments.json
@@ -106,5 +106,6 @@
   "es69h6": "当你将两个窗口合并为一个窗口时",
   "fho5t5": "当你在最后打开一个选项卡时",
   "00kcrm": "输出 true",
-  "sxpg2a": "你的邮箱、Google Drive 和其他工作地点"
+  "sxpg2a": "你的邮箱、Google Drive 和其他工作地点",
+  "4143lf": "初始化按钮"
 }
diff --git a/curriculum/dictionaries/german/comments.json b/curriculum/dictionaries/german/comments.json
new file mode 100644
index 00000000000..6e6f7825791
--- /dev/null
+++ b/curriculum/dictionaries/german/comments.json
@@ -0,0 +1,111 @@
+{
+  "hyek8f": "24,44 Grad Celsius",
+  "rscjup": "26 Grad Celsius",
+  "am2xch": "Eine Liste von Strings, die zu erledigende Aufgaben darstellen:",
+  "6rztdg": "Hier einen Datensatz hinzufügen",
+  "to1vwe": "Füge hier die Methoden handleChange() und submitMessage() hinzu",
+  "31b7ey": "Füge deinen Code über dieser Zeile ein",
+  "c24by8": "Füge deinen Code unterhalb dieser Zeile ein",
+  "jbrt8k": "Fügt die m-te Zeile in neuesArray ein",
+  "zkh12d": "Nachdem du die Aufgabe bestanden hast, experimentiere mit myString und schau, wie die Gruppierung funktioniert",
+  "mobihi": "Weise hier 5 oopsGlobal zu",
+  "v3ups9": "Hier scale mit einem Argument aufrufen",
+  "iw4a3a": "Fall 1: Zielelement hat keine Kindelemente",
+  "463xp8": "Fall 1: Zielelement hat ein Kindelement",
+  "u3inrm": "Fall 3: Zielelement hat zwei Kindelemente",
+  "axnbgg": "Ändere den Code oberhalb dieser Zeile",
+  "i2kck7": "Ändere den Code unterhalb dieser Zeile",
+  "dlbobn": "Ändere diese Zeile",
+  "v127zb": "Überprüfe die beiden Konsolen, um den Unterschied zu sehen. Die freeCodeCamp-Konsole sollte die Variable zweimal ausgeben, einmal für jeden Test dieser Aufgabe. Die Browser-Konsole sollte die Variable nur einmal ausgeben, weil du sie zuerst gelöscht hast.",
+  "ejm0ql": "Schließe die dritte Registerkarte im Videofenster und tritt ein",
+  "iwch6t": "Vervollständige die untenstehende Methode und implementiere die anderen auf ähnliche Weise",
+  "hihhyz": "Vervollständige die Rückgabeanweisung:",
+  "sdxti5": "Zähle die Kindelemente des zu löschenden Ziels",
+  "wfw6sc": "Erstelle eine x- und y-Skala",
+  "sjw6f4": "Erstelle die Skala hier",
+  "nupsh2": "Erzeugt ein 2-D-Array mit m Zeilen und n Spalten mit Nullen",
+  "xfjb3s": "Deklariere die Variable myGlobal unterhalb dieser Zeile",
+  "htpjk7": "Definiere eine Konstante für dekrementelle Aktionstypen",
+  "tfzdsp": "Definiere eine Konstante für inkrementelle Aktionstypen",
+  "zh20mi": "Definiere hier ADD, addMessage(), messageReducer() und store:",
+  "43qs4c": "Definiere einen Action Creator für das Dekrementieren",
+  "nen3qo": "Definiere einen Action Creator für das Inkrementieren",
+  "0cwyam": "Definiere hier einen Action Creator:",
+  "fq0wsg": "Definiere hier eine Aktion:",
+  "tegkqa": "Definiere hier die Container-Komponente:",
+  "b5oihn": "Definiere den Counter Reducer, der den Zustand basierend auf der empfangenen Aktion inkrementiert oder dekrementiert",
+  "91y4pd": "Definiere hier den Redux-Store und übergebe deine Reducer",
+  "eie1vk": "Definiere hier den Root Reducer",
+  "5s7nnl": "Definiere den Store hier:",
+  "34qe2q": "Das Dictionary enthält die Elemente unseres Sets",
+  "2c1wra": "Sende die empfangene Datenaktion hier ab",
+  "923cpg": "Sende die Anfrageaktion hier ab",
+  "picsyf": "Sende die Aktion hier ab:",
+  "ysjr1s": "Code anzeigen",
+  "kjd1am": "Verändere hier nicht den Zustand, sonst werden die Tests fehlschlagen",
+  "5tx4ow": "Unterhaltungs-Seiten",
+  "9yu58b": "Beispiel-Inventarlisten",
+  "ciddtb": "Finde den Zielwert und sein Elternteil",
+  "ixx548": "Ändere den folgenden Code so, dass er true ergibt",
+  "6mbhjj": "Zum Beispiel: Redux.createStore()",
+  "jshtzq": "Funktion, die einen String zurückgibt, der eine Tasse schwarzen Tee darstellt",
+  "cw1ghf": "Funktion, die einen String zurückgibt, der eine Tasse grünen Tee darstellt",
+  "iuccln": "Generiere ein zufällig gefülltes Array",
+  "bm2mop": "Erhalte die Tabs nach dem Tab",
+  "kchz5k": "Die Tabs vor dem Tab holen",
+  "bfd23c": "Anhand einer Funktion (die den Teetyp repräsentiert) und der Anzahl der benötigten Tassen, gibt die\nfolgende Funktion ein Array von Strings zurück (jeder steht für eine Tasse einer\neiner bestimmten Teesorte).",
+  "ead98i": "Globale Zählvariable:",
+  "7zf0i2": "Verbinde sie miteinander",
+  "5j2l88": "Lass uns drei Browserfenster erstellen",
+  "e843r9": "Öffnen wir erst einmal einen neuen Tab",
+  "5fvehh": "myVar ist nicht außerhalb von myLocalScope definiert",
+  "qn720a": "Jetzt fügst du console.clear() vor deiner console.log() ein, um die Browserkonsole zu löschen und die Tests zu bestehen.",
+  "j86mef": "Führe nun das Öffnen und Schließen von Tabs und andere Operationen durch",
+  "mk7rvy": "Entferne nun die Konsolenprotokollzeile, um den Test zu bestehen",
+  "n7vm1s": "Ändere nur den Code oberhalb dieser Zeile",
+  "cvh4x7": "Ändere nur den Code unterhalb dieser Zeile",
+  "lvmnm7": "Öffne einen neuen Tab für Katzen-Memes",
+  "avpx79": "Öffne deine Browserkonsole.",
+  "0b5ps6": "Abstand zwischen der SVG-Canvas-Grenze und dem Plot",
+  "uemoej": "Schiebt n Nullen in die aktuelle Zeile, um die Spalten zu erstellen",
+  "lm86nf": "Schiebt die aktuelle Zeile, die jetzt n Nullen enthält, in das Array",
+  "qscelx": "Redux-Methoden sind über ein Redux-Objekt verfügbar",
+  "atqiig": "Rendere ein Input, einen Button und ein ul unterhalb dieser Zeile",
+  "yq81wg": "Rendere den Provider unterhalb dieser Zeile",
+  "kxio9j": "responseFromServer wird auf false gesetzt, um eine erfolglose Antwort von einem Server darzustellen",
+  "alh6pw": "responseFromServer wird auf true gesetzt, um eine erfolgreiche Antwort von einem Server darzustellen",
+  "1cfidd": "responseFromServer stellt eine Antwort von einem Server dar",
+  "96tntk": "Gibt 30 zurück",
+  "58a5g7": "Ausführen und überprüfen der Konsole",
+  "71bus9": "Führe die Tests durch, um den Unterschied zwischen den beiden Konsolen zu sehen.",
+  "7wp46n": "Einstellung in der Skala Grad Fahrenheit",
+  "oefvg5": "Setup",
+  "mnt4d3": "Sollte \"Karotte\" anzeigen",
+  "fhe9m4": "Soziale Seiten",
+  "za434b": "Gestapeltes Balkendiagramm des wöchentlichen Trainings",
+  "7c1fv9": "Gestapelte Balkendiagramme werden hier eingefügt",
+  "r44ovx": "tabs ist ein Array, das den Titel jeder im Fenster geöffneten Seite enthält",
+  "cl8peb": "Test-Array:",
+  "1xi3cv": "Die globale Variable",
+  "3gc01a": "Die Datei main.scss",
+  "14kfog": "Dies ist unsere Schnittpunktmethode",
+  "d1shtt": "Dies ist unsere Vereinigungsmethode",
+  "pqq6sy": "Diese Methode fügt dem Set ein Element hinzu",
+  "nd2oxy": "Diese Methode prüft, ob ein Element vorhanden ist und gibt true oder false zurück",
+  "ocm81t": "Diese Methode entfernt ein Element aus einem Set",
+  "or9p5p": "Diese Methode gibt alle Werte des Sets zurück",
+  "g1608f": "Diese Methode gibt die Größe des Set zurück",
+  "bheu99": "Dies wird das Set enthalten",
+  "x1djjr": "Verwende console.clear() in der nächsten Zeile, um die Browserkonsole zu löschen.",
+  "22ta95": "Verwende console.log(), um die Ausgabevariable auszugeben.",
+  "w43c7l": "Die Verwendung von s = [2, 5, 7] wäre ungültig",
+  "pgckoj": "Zuweisung der Variablen",
+  "2xiqvv": "Deklarationen der Variablen",
+  "2sx8zg": "Das Array wird innerhalb des Objekts aufgezeichnet",
+  "xmjfd8": "Wenn du eine Registerkarte schließt",
+  "es69h6": "Wenn du zwei Fenster zu einem Fenster verbindest",
+  "fho5t5": "Wenn du am Ende eine neue Registerkarte öffnest",
+  "00kcrm": "ergibt true",
+  "sxpg2a": "Dein Posteingang, dein Laufwerk und andere Arbeitsorte",
+  "4143lf": "initialize buttons"
+}